]>
Commit | Line | Data |
---|---|---|
8d08fdba | 1 | /* Handle parameterized types (templates) for GNU C++. |
06ceef4e RK |
2 | Copyright (C) 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000 |
3 | 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" |
a9aedbc2 | 40 | #include "defaults.h" |
49c249e1 | 41 | #include "except.h" |
54f92bfb | 42 | #include "toplev.h" |
3dcaad8b | 43 | #include "rtl.h" |
091f9839 | 44 | #include "defaults.h" |
9cd64686 | 45 | #include "ggc.h" |
6dfbb909 | 46 | #include "hashtab.h" |
297a5329 | 47 | #include "timevar.h" |
49c249e1 | 48 | |
050367a3 MM |
49 | /* The type of functions taking a tree, and some additional data, and |
50 | returning an int. */ | |
158991b7 | 51 | typedef int (*tree_fn_t) PARAMS ((tree, void*)); |
050367a3 | 52 | |
8d08fdba | 53 | extern struct obstack permanent_obstack; |
8d08fdba | 54 | |
0aafb128 MM |
55 | /* The PENDING_TEMPLATES is a TREE_LIST of templates whose |
56 | instantiations have been deferred, either because their definitions | |
57 | were not yet available, or because we were putting off doing the | |
58 | work. The TREE_PURPOSE of each entry is a SRCLOC indicating where | |
59 | the instantiate request occurred; the TREE_VALUE is a either a DECL | |
60 | (for a function or static data member), or a TYPE (for a class) | |
61 | indicating what we are hoping to instantiate. */ | |
62 | static tree pending_templates; | |
5566b478 MS |
63 | static tree *template_tail = &pending_templates; |
64 | ||
0aafb128 | 65 | static tree maybe_templates; |
73aad9b9 JM |
66 | static tree *maybe_template_tail = &maybe_templates; |
67 | ||
67ffc812 | 68 | int processing_template_parmlist; |
386b8a85 JM |
69 | static int template_header_count; |
70 | ||
75650646 | 71 | static tree saved_trees; |
3dcaad8b MM |
72 | static varray_type inline_parm_levels; |
73 | static size_t inline_parm_levels_used; | |
75650646 | 74 | |
3ae18eaf JM |
75 | tree current_tinst_level; |
76 | ||
6dfbb909 MM |
77 | /* A map from local variable declarations in the body of the template |
78 | presently being instantiated to the corresponding instantiated | |
79 | local variables. */ | |
80 | static htab_t local_specializations; | |
81 | ||
8d08fdba MS |
82 | #define obstack_chunk_alloc xmalloc |
83 | #define obstack_chunk_free free | |
84 | ||
830bfa74 MM |
85 | #define UNIFY_ALLOW_NONE 0 |
86 | #define UNIFY_ALLOW_MORE_CV_QUAL 1 | |
87 | #define UNIFY_ALLOW_LESS_CV_QUAL 2 | |
88 | #define UNIFY_ALLOW_DERIVED 4 | |
161c12b0 | 89 | #define UNIFY_ALLOW_INTEGER 8 |
830bfa74 | 90 | |
4393e105 MM |
91 | #define GTB_VIA_VIRTUAL 1 /* The base class we are examining is |
92 | virtual, or a base class of a virtual | |
93 | base. */ | |
94 | #define GTB_IGNORE_TYPE 2 /* We don't need to try to unify the current | |
95 | type with the desired type. */ | |
96 | ||
158991b7 | 97 | static int resolve_overloaded_unification PARAMS ((tree, tree, tree, tree, |
4393e105 | 98 | unification_kind_t, int)); |
158991b7 | 99 | static int try_one_overload PARAMS ((tree, tree, tree, tree, tree, |
4393e105 | 100 | unification_kind_t, int)); |
158991b7 KG |
101 | static int unify PARAMS ((tree, tree, tree, tree, int)); |
102 | static void add_pending_template PARAMS ((tree)); | |
103 | static int push_tinst_level PARAMS ((tree)); | |
3ae18eaf | 104 | static void reopen_tinst_level PARAMS ((tree)); |
158991b7 KG |
105 | static tree classtype_mangled_name PARAMS ((tree)); |
106 | static char *mangle_class_name_for_template PARAMS ((char *, tree, tree)); | |
fd74ca0b | 107 | static tree tsubst_initializer_list PARAMS ((tree, tree)); |
158991b7 KG |
108 | static int list_eq PARAMS ((tree, tree)); |
109 | static tree get_class_bindings PARAMS ((tree, tree, tree)); | |
110 | static tree coerce_template_parms PARAMS ((tree, tree, tree, int, int)); | |
111 | static void tsubst_enum PARAMS ((tree, tree, tree)); | |
112 | static tree add_to_template_args PARAMS ((tree, tree)); | |
113 | static tree add_outermost_template_args PARAMS ((tree, tree)); | |
114 | static void maybe_adjust_types_for_deduction PARAMS ((unification_kind_t, tree*, | |
830bfa74 | 115 | tree*)); |
158991b7 | 116 | static int type_unification_real PARAMS ((tree, tree, tree, tree, |
4393e105 | 117 | int, unification_kind_t, int)); |
158991b7 KG |
118 | static void note_template_header PARAMS ((int)); |
119 | static tree maybe_fold_nontype_arg PARAMS ((tree)); | |
120 | static tree convert_nontype_argument PARAMS ((tree, tree)); | |
121 | static tree convert_template_argument PARAMS ((tree, tree, tree, int, | |
8b5b8b7c | 122 | int , tree)); |
158991b7 KG |
123 | static tree get_bindings_overload PARAMS ((tree, tree, tree)); |
124 | static int for_each_template_parm PARAMS ((tree, tree_fn_t, void*)); | |
125 | static tree build_template_parm_index PARAMS ((int, int, int, tree, tree)); | |
126 | static int inline_needs_template_parms PARAMS ((tree)); | |
127 | static void push_inline_template_parms_recursive PARAMS ((tree, int)); | |
128 | static tree retrieve_specialization PARAMS ((tree, tree)); | |
6dfbb909 | 129 | static tree retrieve_local_specialization PARAMS ((tree)); |
158991b7 | 130 | static tree register_specialization PARAMS ((tree, tree, tree)); |
6dfbb909 | 131 | static tree register_local_specialization PARAMS ((tree, tree)); |
158991b7 KG |
132 | static int unregister_specialization PARAMS ((tree, tree)); |
133 | static tree reduce_template_parm_level PARAMS ((tree, tree, int)); | |
134 | static tree build_template_decl PARAMS ((tree, tree)); | |
135 | static int mark_template_parm PARAMS ((tree, void *)); | |
136 | static tree tsubst_friend_function PARAMS ((tree, tree)); | |
137 | static tree tsubst_friend_class PARAMS ((tree, tree)); | |
138 | static tree get_bindings_real PARAMS ((tree, tree, tree, int)); | |
139 | static int template_decl_level PARAMS ((tree)); | |
140 | static tree maybe_get_template_decl_from_type_decl PARAMS ((tree)); | |
141 | static int check_cv_quals_for_unify PARAMS ((int, tree, tree)); | |
142 | static tree tsubst_template_arg_vector PARAMS ((tree, tree, int)); | |
143 | static tree tsubst_template_parms PARAMS ((tree, tree, int)); | |
144 | static void regenerate_decl_from_template PARAMS ((tree, tree)); | |
145 | static tree most_specialized PARAMS ((tree, tree, tree)); | |
146 | static tree most_specialized_class PARAMS ((tree, tree)); | |
669ec2b4 | 147 | static void set_mangled_name_for_template_decl PARAMS ((tree)); |
158991b7 KG |
148 | static int template_class_depth_real PARAMS ((tree, int)); |
149 | static tree tsubst_aggr_type PARAMS ((tree, tree, int, tree, int)); | |
150 | static tree tsubst_decl PARAMS ((tree, tree, tree, tree)); | |
151 | static tree tsubst_arg_types PARAMS ((tree, tree, int, tree)); | |
152 | static tree tsubst_function_type PARAMS ((tree, tree, int, tree)); | |
153 | static void check_specialization_scope PARAMS ((void)); | |
154 | static tree process_partial_specialization PARAMS ((tree)); | |
155 | static void set_current_access_from_decl PARAMS ((tree)); | |
156 | static void check_default_tmpl_args PARAMS ((tree, tree, int, int)); | |
157 | static tree tsubst_call_declarator_parms PARAMS ((tree, tree, int, tree)); | |
158 | static tree get_template_base_recursive PARAMS ((tree, tree, | |
4393e105 | 159 | tree, tree, tree, int)); |
158991b7 KG |
160 | static tree get_template_base PARAMS ((tree, tree, tree, tree)); |
161 | static tree try_class_unification PARAMS ((tree, tree, tree, tree)); | |
162 | static int coerce_template_template_parms PARAMS ((tree, tree, int, | |
4393e105 | 163 | tree, tree)); |
158991b7 KG |
164 | static tree determine_specialization PARAMS ((tree, tree, tree *, int)); |
165 | static int template_args_equal PARAMS ((tree, tree)); | |
166 | static void print_template_context PARAMS ((int)); | |
167 | static void tsubst_default_arguments PARAMS ((tree)); | |
168 | static tree for_each_template_parm_r PARAMS ((tree *, int *, void *)); | |
db9b2174 | 169 | static tree instantiate_clone PARAMS ((tree, tree)); |
36a117a5 | 170 | |
9cd64686 MM |
171 | /* Called once to initialize pt.c. */ |
172 | ||
173 | void | |
174 | init_pt () | |
175 | { | |
176 | ggc_add_tree_root (&pending_templates, 1); | |
177 | ggc_add_tree_root (&maybe_templates, 1); | |
178 | ggc_add_tree_root (&saved_trees, 1); | |
3ae18eaf | 179 | ggc_add_tree_root (¤t_tinst_level, 1); |
9cd64686 MM |
180 | } |
181 | ||
e1467ff2 MM |
182 | /* Do any processing required when DECL (a member template declaration |
183 | using TEMPLATE_PARAMETERS as its innermost parameter list) is | |
184 | finished. Returns the TEMPLATE_DECL corresponding to DECL, unless | |
185 | it is a specialization, in which case the DECL itself is returned. */ | |
186 | ||
187 | tree | |
61a127b3 | 188 | finish_member_template_decl (decl) |
e1467ff2 MM |
189 | tree decl; |
190 | { | |
93cdc044 JM |
191 | if (decl == NULL_TREE || decl == void_type_node) |
192 | return NULL_TREE; | |
3ddfb0e6 MM |
193 | else if (decl == error_mark_node) |
194 | /* By returning NULL_TREE, the parser will just ignore this | |
195 | declaration. We have already issued the error. */ | |
196 | return NULL_TREE; | |
93cdc044 JM |
197 | else if (TREE_CODE (decl) == TREE_LIST) |
198 | { | |
5f311aec | 199 | /* Assume that the class is the only declspec. */ |
93cdc044 | 200 | decl = TREE_VALUE (decl); |
8d019cef | 201 | if (IS_AGGR_TYPE (decl) && CLASSTYPE_TEMPLATE_INFO (decl) |
370af2d5 | 202 | && ! CLASSTYPE_TEMPLATE_SPECIALIZATION (decl)) |
93cdc044 JM |
203 | { |
204 | tree tmpl = CLASSTYPE_TI_TEMPLATE (decl); | |
205 | check_member_template (tmpl); | |
206 | return tmpl; | |
207 | } | |
8d019cef | 208 | return NULL_TREE; |
93cdc044 | 209 | } |
07c88314 MM |
210 | else if (TREE_CODE (decl) == FIELD_DECL) |
211 | cp_error ("data member `%D' cannot be a member template", decl); | |
a1da6cba | 212 | else if (DECL_TEMPLATE_INFO (decl)) |
e1467ff2 | 213 | { |
a1da6cba MM |
214 | if (!DECL_TEMPLATE_SPECIALIZATION (decl)) |
215 | { | |
216 | check_member_template (DECL_TI_TEMPLATE (decl)); | |
217 | return DECL_TI_TEMPLATE (decl); | |
218 | } | |
219 | else | |
220 | return decl; | |
221 | } | |
222 | else | |
8251199e | 223 | cp_error ("invalid member template declaration `%D'", decl); |
e1467ff2 | 224 | |
a1da6cba | 225 | return error_mark_node; |
f84b4be9 | 226 | } |
e1467ff2 | 227 | |
f84b4be9 JM |
228 | /* Returns the template nesting level of the indicated class TYPE. |
229 | ||
230 | For example, in: | |
231 | template <class T> | |
232 | struct A | |
233 | { | |
234 | template <class U> | |
235 | struct B {}; | |
236 | }; | |
237 | ||
39c01e4c MM |
238 | A<T>::B<U> has depth two, while A<T> has depth one. |
239 | Both A<T>::B<int> and A<int>::B<U> have depth one, if | |
240 | COUNT_SPECIALIZATIONS is 0 or if they are instantiations, not | |
241 | specializations. | |
242 | ||
243 | This function is guaranteed to return 0 if passed NULL_TREE so | |
244 | that, for example, `template_class_depth (current_class_type)' is | |
245 | always safe. */ | |
f84b4be9 | 246 | |
e9659ab0 | 247 | static int |
39c01e4c | 248 | template_class_depth_real (type, count_specializations) |
f84b4be9 | 249 | tree type; |
39c01e4c | 250 | int count_specializations; |
f84b4be9 | 251 | { |
93cdc044 | 252 | int depth; |
f84b4be9 | 253 | |
2c73f9f5 | 254 | for (depth = 0; |
ed44da02 MM |
255 | type && TREE_CODE (type) != NAMESPACE_DECL; |
256 | type = (TREE_CODE (type) == FUNCTION_DECL) | |
4f1c5b7d | 257 | ? CP_DECL_CONTEXT (type) : TYPE_CONTEXT (type)) |
ed44da02 MM |
258 | { |
259 | if (TREE_CODE (type) != FUNCTION_DECL) | |
260 | { | |
261 | if (CLASSTYPE_TEMPLATE_INFO (type) | |
262 | && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (type)) | |
263 | && ((count_specializations | |
370af2d5 | 264 | && CLASSTYPE_TEMPLATE_SPECIALIZATION (type)) |
ed44da02 MM |
265 | || uses_template_parms (CLASSTYPE_TI_ARGS (type)))) |
266 | ++depth; | |
267 | } | |
268 | else | |
269 | { | |
270 | if (DECL_TEMPLATE_INFO (type) | |
271 | && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (type)) | |
272 | && ((count_specializations | |
273 | && DECL_TEMPLATE_SPECIALIZATION (type)) | |
274 | || uses_template_parms (DECL_TI_ARGS (type)))) | |
275 | ++depth; | |
276 | } | |
277 | } | |
f84b4be9 JM |
278 | |
279 | return depth; | |
e1467ff2 | 280 | } |
98c1c668 | 281 | |
39c01e4c MM |
282 | /* Returns the template nesting level of the indicated class TYPE. |
283 | Like template_class_depth_real, but instantiations do not count in | |
284 | the depth. */ | |
285 | ||
286 | int | |
287 | template_class_depth (type) | |
288 | tree type; | |
289 | { | |
290 | return template_class_depth_real (type, /*count_specializations=*/0); | |
291 | } | |
292 | ||
cae40af6 JM |
293 | /* Returns 1 if processing DECL as part of do_pending_inlines |
294 | needs us to push template parms. */ | |
295 | ||
296 | static int | |
297 | inline_needs_template_parms (decl) | |
298 | tree decl; | |
299 | { | |
300 | if (! DECL_TEMPLATE_INFO (decl)) | |
301 | return 0; | |
f84b4be9 | 302 | |
36a117a5 | 303 | return (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (most_general_template (decl))) |
cae40af6 JM |
304 | > (processing_template_decl + DECL_TEMPLATE_SPECIALIZATION (decl))); |
305 | } | |
306 | ||
307 | /* Subroutine of maybe_begin_member_template_processing. | |
308 | Push the template parms in PARMS, starting from LEVELS steps into the | |
309 | chain, and ending at the beginning, since template parms are listed | |
310 | innermost first. */ | |
311 | ||
312 | static void | |
313 | push_inline_template_parms_recursive (parmlist, levels) | |
314 | tree parmlist; | |
315 | int levels; | |
316 | { | |
317 | tree parms = TREE_VALUE (parmlist); | |
318 | int i; | |
319 | ||
320 | if (levels > 1) | |
321 | push_inline_template_parms_recursive (TREE_CHAIN (parmlist), levels - 1); | |
786b5245 | 322 | |
98c1c668 | 323 | ++processing_template_decl; |
cae40af6 | 324 | current_template_parms |
98c1c668 JM |
325 | = tree_cons (build_int_2 (0, processing_template_decl), |
326 | parms, current_template_parms); | |
cae40af6 JM |
327 | TEMPLATE_PARMS_FOR_INLINE (current_template_parms) = 1; |
328 | ||
786b5245 | 329 | pushlevel (0); |
98c1c668 JM |
330 | for (i = 0; i < TREE_VEC_LENGTH (parms); ++i) |
331 | { | |
786b5245 | 332 | tree parm = TREE_VALUE (TREE_VEC_ELT (parms, i)); |
2f939d94 | 333 | my_friendly_assert (DECL_P (parm), 0); |
cae40af6 | 334 | |
98c1c668 JM |
335 | switch (TREE_CODE (parm)) |
336 | { | |
786b5245 | 337 | case TYPE_DECL: |
73b0fce8 | 338 | case TEMPLATE_DECL: |
98c1c668 JM |
339 | pushdecl (parm); |
340 | break; | |
786b5245 MM |
341 | |
342 | case PARM_DECL: | |
343 | { | |
fc03edb3 MM |
344 | /* Make a CONST_DECL as is done in process_template_parm. |
345 | It is ugly that we recreate this here; the original | |
346 | version built in process_template_parm is no longer | |
347 | available. */ | |
786b5245 MM |
348 | tree decl = build_decl (CONST_DECL, DECL_NAME (parm), |
349 | TREE_TYPE (parm)); | |
fc03edb3 | 350 | SET_DECL_ARTIFICIAL (decl); |
786b5245 | 351 | DECL_INITIAL (decl) = DECL_INITIAL (parm); |
cd9f6678 | 352 | SET_DECL_TEMPLATE_PARM_P (decl); |
786b5245 MM |
353 | pushdecl (decl); |
354 | } | |
cae40af6 | 355 | break; |
786b5245 | 356 | |
98c1c668 JM |
357 | default: |
358 | my_friendly_abort (0); | |
359 | } | |
360 | } | |
361 | } | |
362 | ||
cae40af6 JM |
363 | /* Restore the template parameter context for a member template or |
364 | a friend template defined in a class definition. */ | |
365 | ||
366 | void | |
367 | maybe_begin_member_template_processing (decl) | |
368 | tree decl; | |
369 | { | |
370 | tree parms; | |
3dcaad8b | 371 | int levels = 0; |
cae40af6 | 372 | |
3dcaad8b MM |
373 | if (inline_needs_template_parms (decl)) |
374 | { | |
375 | parms = DECL_TEMPLATE_PARMS (most_general_template (decl)); | |
376 | levels = TMPL_PARMS_DEPTH (parms) - processing_template_decl; | |
cae40af6 | 377 | |
3dcaad8b MM |
378 | if (DECL_TEMPLATE_SPECIALIZATION (decl)) |
379 | { | |
380 | --levels; | |
381 | parms = TREE_CHAIN (parms); | |
382 | } | |
cae40af6 | 383 | |
3dcaad8b | 384 | push_inline_template_parms_recursive (parms, levels); |
cae40af6 JM |
385 | } |
386 | ||
3dcaad8b MM |
387 | /* Remember how many levels of template parameters we pushed so that |
388 | we can pop them later. */ | |
389 | if (!inline_parm_levels) | |
390 | VARRAY_INT_INIT (inline_parm_levels, 4, "inline_parm_levels"); | |
391 | if (inline_parm_levels_used == inline_parm_levels->num_elements) | |
392 | VARRAY_GROW (inline_parm_levels, 2 * inline_parm_levels_used); | |
393 | VARRAY_INT (inline_parm_levels, inline_parm_levels_used) = levels; | |
394 | ++inline_parm_levels_used; | |
cae40af6 JM |
395 | } |
396 | ||
98c1c668 JM |
397 | /* Undo the effects of begin_member_template_processing. */ |
398 | ||
399 | void | |
b370501f | 400 | maybe_end_member_template_processing () |
98c1c668 | 401 | { |
3dcaad8b MM |
402 | int i; |
403 | ||
404 | if (!inline_parm_levels_used) | |
98c1c668 JM |
405 | return; |
406 | ||
3dcaad8b MM |
407 | --inline_parm_levels_used; |
408 | for (i = 0; | |
409 | i < VARRAY_INT (inline_parm_levels, inline_parm_levels_used); | |
410 | ++i) | |
cae40af6 JM |
411 | { |
412 | --processing_template_decl; | |
413 | current_template_parms = TREE_CHAIN (current_template_parms); | |
414 | poplevel (0, 0, 0); | |
415 | } | |
98c1c668 JM |
416 | } |
417 | ||
cae40af6 | 418 | /* Returns non-zero iff T is a member template function. We must be |
f84b4be9 | 419 | careful as in |
75650646 MM |
420 | |
421 | template <class T> class C { void f(); } | |
422 | ||
423 | Here, f is a template function, and a member, but not a member | |
424 | template. This function does not concern itself with the origin of | |
425 | T, only its present state. So if we have | |
426 | ||
427 | template <class T> class C { template <class U> void f(U); } | |
428 | ||
429 | then neither C<int>::f<char> nor C<T>::f<double> is considered | |
f181d4ae MM |
430 | to be a member template. But, `template <class U> void |
431 | C<int>::f(U)' is considered a member template. */ | |
98c1c668 | 432 | |
cae40af6 JM |
433 | int |
434 | is_member_template (t) | |
98c1c668 JM |
435 | tree t; |
436 | { | |
f181d4ae | 437 | if (!DECL_FUNCTION_TEMPLATE_P (t)) |
75650646 | 438 | /* Anything that isn't a function or a template function is |
aa5f3bad MM |
439 | certainly not a member template. */ |
440 | return 0; | |
441 | ||
cae40af6 | 442 | /* A local class can't have member templates. */ |
4f1c5b7d | 443 | if (decl_function_context (t)) |
cae40af6 JM |
444 | return 0; |
445 | ||
f181d4ae | 446 | return (DECL_FUNCTION_MEMBER_P (DECL_TEMPLATE_RESULT (t)) |
f84b4be9 JM |
447 | /* If there are more levels of template parameters than |
448 | there are template classes surrounding the declaration, | |
449 | then we have a member template. */ | |
f181d4ae | 450 | && (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (t)) > |
4f1c5b7d | 451 | template_class_depth (DECL_CONTEXT (t)))); |
f84b4be9 | 452 | } |
98c1c668 | 453 | |
ba4f4e5d | 454 | #if 0 /* UNUSED */ |
2ee4e084 MM |
455 | /* Returns non-zero iff T is a member template class. See |
456 | is_member_template for a description of what precisely constitutes | |
457 | a member template. */ | |
458 | ||
459 | int | |
460 | is_member_template_class (t) | |
461 | tree t; | |
462 | { | |
463 | if (!DECL_CLASS_TEMPLATE_P (t)) | |
464 | /* Anything that isn't a class template, is certainly not a member | |
465 | template. */ | |
466 | return 0; | |
467 | ||
468 | if (!DECL_CLASS_SCOPE_P (t)) | |
469 | /* Anything whose context isn't a class type is surely not a | |
470 | member template. */ | |
471 | return 0; | |
472 | ||
473 | /* If there are more levels of template parameters than there are | |
474 | template classes surrounding the declaration, then we have a | |
475 | member template. */ | |
36a117a5 | 476 | return (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (t)) > |
2ee4e084 MM |
477 | template_class_depth (DECL_CONTEXT (t))); |
478 | } | |
ba4f4e5d | 479 | #endif |
2ee4e084 | 480 | |
36a117a5 | 481 | /* Return a new template argument vector which contains all of ARGS, |
f9a7ae04 | 482 | but has as its innermost set of arguments the EXTRA_ARGS. */ |
e6f1275f JM |
483 | |
484 | static tree | |
36a117a5 MM |
485 | add_to_template_args (args, extra_args) |
486 | tree args; | |
487 | tree extra_args; | |
e6f1275f | 488 | { |
36a117a5 MM |
489 | tree new_args; |
490 | int extra_depth; | |
491 | int i; | |
492 | int j; | |
e6f1275f | 493 | |
36a117a5 | 494 | extra_depth = TMPL_ARGS_DEPTH (extra_args); |
f31c0a32 | 495 | new_args = make_tree_vec (TMPL_ARGS_DEPTH (args) + extra_depth); |
e6f1275f | 496 | |
36a117a5 MM |
497 | for (i = 1; i <= TMPL_ARGS_DEPTH (args); ++i) |
498 | SET_TMPL_ARGS_LEVEL (new_args, i, TMPL_ARGS_LEVEL (args, i)); | |
e6f1275f | 499 | |
36a117a5 MM |
500 | for (j = 1; j <= extra_depth; ++j, ++i) |
501 | SET_TMPL_ARGS_LEVEL (new_args, i, TMPL_ARGS_LEVEL (extra_args, j)); | |
502 | ||
e6f1275f JM |
503 | return new_args; |
504 | } | |
505 | ||
36a117a5 MM |
506 | /* Like add_to_template_args, but only the outermost ARGS are added to |
507 | the EXTRA_ARGS. In particular, all but TMPL_ARGS_DEPTH | |
508 | (EXTRA_ARGS) levels are added. This function is used to combine | |
509 | the template arguments from a partial instantiation with the | |
510 | template arguments used to attain the full instantiation from the | |
511 | partial instantiation. */ | |
98c1c668 | 512 | |
4966381a | 513 | static tree |
36a117a5 | 514 | add_outermost_template_args (args, extra_args) |
98c1c668 JM |
515 | tree args; |
516 | tree extra_args; | |
517 | { | |
518 | tree new_args; | |
519 | ||
e4a84209 MM |
520 | /* If there are more levels of EXTRA_ARGS than there are ARGS, |
521 | something very fishy is going on. */ | |
522 | my_friendly_assert (TMPL_ARGS_DEPTH (args) >= TMPL_ARGS_DEPTH (extra_args), | |
523 | 0); | |
524 | ||
525 | /* If *all* the new arguments will be the EXTRA_ARGS, just return | |
526 | them. */ | |
527 | if (TMPL_ARGS_DEPTH (args) == TMPL_ARGS_DEPTH (extra_args)) | |
528 | return extra_args; | |
529 | ||
36a117a5 MM |
530 | /* For the moment, we make ARGS look like it contains fewer levels. */ |
531 | TREE_VEC_LENGTH (args) -= TMPL_ARGS_DEPTH (extra_args); | |
532 | ||
533 | new_args = add_to_template_args (args, extra_args); | |
98c1c668 | 534 | |
36a117a5 MM |
535 | /* Now, we restore ARGS to its full dimensions. */ |
536 | TREE_VEC_LENGTH (args) += TMPL_ARGS_DEPTH (extra_args); | |
98c1c668 JM |
537 | |
538 | return new_args; | |
539 | } | |
5566b478 | 540 | |
f9a7ae04 MM |
541 | /* Return the N levels of innermost template arguments from the ARGS. */ |
542 | ||
543 | tree | |
544 | get_innermost_template_args (args, n) | |
545 | tree args; | |
546 | int n; | |
547 | { | |
548 | tree new_args; | |
549 | int extra_levels; | |
550 | int i; | |
551 | ||
552 | my_friendly_assert (n >= 0, 20000603); | |
553 | ||
554 | /* If N is 1, just return the innermost set of template arguments. */ | |
555 | if (n == 1) | |
556 | return TMPL_ARGS_LEVEL (args, TMPL_ARGS_DEPTH (args)); | |
557 | ||
558 | /* If we're not removing anything, just return the arguments we were | |
559 | given. */ | |
560 | extra_levels = TMPL_ARGS_DEPTH (args) - n; | |
561 | my_friendly_assert (extra_levels >= 0, 20000603); | |
562 | if (extra_levels == 0) | |
563 | return args; | |
564 | ||
565 | /* Make a new set of arguments, not containing the outer arguments. */ | |
566 | new_args = make_tree_vec (n); | |
567 | for (i = 1; i <= n; ++i) | |
568 | SET_TMPL_ARGS_LEVEL (new_args, i, | |
569 | TMPL_ARGS_LEVEL (args, i + extra_levels)); | |
570 | ||
571 | return new_args; | |
572 | } | |
573 | ||
5566b478 MS |
574 | /* We've got a template header coming up; push to a new level for storing |
575 | the parms. */ | |
8d08fdba | 576 | |
8d08fdba MS |
577 | void |
578 | begin_template_parm_list () | |
579 | { | |
6757edfe MM |
580 | /* We use a non-tag-transparent scope here, which causes pushtag to |
581 | put tags in this scope, rather than in the enclosing class or | |
582 | namespace scope. This is the right thing, since we want | |
583 | TEMPLATE_DECLS, and not TYPE_DECLS for template classes. For a | |
584 | global template class, push_template_decl handles putting the | |
585 | TEMPLATE_DECL into top-level scope. For a nested template class, | |
586 | e.g.: | |
587 | ||
588 | template <class T> struct S1 { | |
589 | template <class T> struct S2 {}; | |
590 | }; | |
591 | ||
592 | pushtag contains special code to call pushdecl_with_scope on the | |
593 | TEMPLATE_DECL for S2. */ | |
74b846e0 | 594 | begin_scope (sk_template_parms); |
5156628f | 595 | ++processing_template_decl; |
67ffc812 | 596 | ++processing_template_parmlist; |
386b8a85 JM |
597 | note_template_header (0); |
598 | } | |
599 | ||
6c30752f MM |
600 | /* This routine is called when a specialization is declared. If it is |
601 | illegal to declare a specialization here, an error is reported. */ | |
602 | ||
e9659ab0 | 603 | static void |
6c30752f MM |
604 | check_specialization_scope () |
605 | { | |
606 | tree scope = current_scope (); | |
3ddfb0e6 | 607 | |
6c30752f MM |
608 | /* [temp.expl.spec] |
609 | ||
610 | An explicit specialization shall be declared in the namespace of | |
611 | which the template is a member, or, for member templates, in the | |
612 | namespace of which the enclosing class or enclosing class | |
613 | template is a member. An explicit specialization of a member | |
614 | function, member class or static data member of a class template | |
615 | shall be declared in the namespace of which the class template | |
616 | is a member. */ | |
617 | if (scope && TREE_CODE (scope) != NAMESPACE_DECL) | |
8251199e | 618 | cp_error ("explicit specialization in non-namespace scope `%D'", |
6c30752f | 619 | scope); |
3ddfb0e6 | 620 | |
6c30752f MM |
621 | /* [temp.expl.spec] |
622 | ||
623 | In an explicit specialization declaration for a member of a class | |
624 | template or a member template that appears in namespace scope, | |
625 | the member template and some of its enclosing class templates may | |
626 | remain unspecialized, except that the declaration shall not | |
627 | explicitly specialize a class member template if its enclosing | |
628 | class templates are not explicitly specialized as well. */ | |
629 | if (current_template_parms) | |
fd4de5ff | 630 | cp_error ("enclosing class templates are not explicitly specialized"); |
6c30752f MM |
631 | } |
632 | ||
386b8a85 JM |
633 | /* We've just seen template <>. */ |
634 | ||
635 | void | |
636 | begin_specialization () | |
637 | { | |
74b846e0 | 638 | begin_scope (sk_template_spec); |
386b8a85 | 639 | note_template_header (1); |
6c30752f | 640 | check_specialization_scope (); |
386b8a85 JM |
641 | } |
642 | ||
386b8a85 JM |
643 | /* Called at then end of processing a declaration preceeded by |
644 | template<>. */ | |
645 | ||
646 | void | |
647 | end_specialization () | |
648 | { | |
74b846e0 | 649 | finish_scope (); |
386b8a85 JM |
650 | reset_specialization (); |
651 | } | |
652 | ||
386b8a85 JM |
653 | /* Any template <>'s that we have seen thus far are not referring to a |
654 | function specialization. */ | |
655 | ||
656 | void | |
657 | reset_specialization () | |
658 | { | |
659 | processing_specialization = 0; | |
660 | template_header_count = 0; | |
661 | } | |
662 | ||
386b8a85 JM |
663 | /* We've just seen a template header. If SPECIALIZATION is non-zero, |
664 | it was of the form template <>. */ | |
665 | ||
4966381a | 666 | static void |
386b8a85 JM |
667 | note_template_header (specialization) |
668 | int specialization; | |
669 | { | |
670 | processing_specialization = specialization; | |
671 | template_header_count++; | |
672 | } | |
673 | ||
75650646 | 674 | /* We're beginning an explicit instantiation. */ |
386b8a85 | 675 | |
75650646 MM |
676 | void |
677 | begin_explicit_instantiation () | |
386b8a85 | 678 | { |
75650646 MM |
679 | ++processing_explicit_instantiation; |
680 | } | |
386b8a85 | 681 | |
386b8a85 | 682 | |
75650646 MM |
683 | void |
684 | end_explicit_instantiation () | |
685 | { | |
686 | my_friendly_assert(processing_explicit_instantiation > 0, 0); | |
687 | --processing_explicit_instantiation; | |
688 | } | |
386b8a85 | 689 | |
36a117a5 MM |
690 | /* The TYPE is being declared. If it is a template type, that means it |
691 | is a partial specialization. Do appropriate error-checking. */ | |
692 | ||
693 | void | |
694 | maybe_process_partial_specialization (type) | |
695 | tree type; | |
696 | { | |
697 | if (IS_AGGR_TYPE (type) && CLASSTYPE_USE_TEMPLATE (type)) | |
698 | { | |
699 | if (CLASSTYPE_IMPLICIT_INSTANTIATION (type) | |
d0f062fb | 700 | && !COMPLETE_TYPE_P (type)) |
36a117a5 | 701 | { |
700466c2 JM |
702 | if (current_namespace |
703 | != decl_namespace_context (CLASSTYPE_TI_TEMPLATE (type))) | |
704 | { | |
705 | cp_pedwarn ("specializing `%#T' in different namespace", type); | |
706 | cp_pedwarn_at (" from definition of `%#D'", | |
707 | CLASSTYPE_TI_TEMPLATE (type)); | |
708 | } | |
370af2d5 | 709 | SET_CLASSTYPE_TEMPLATE_SPECIALIZATION (type); |
36a117a5 MM |
710 | if (processing_template_decl) |
711 | push_template_decl (TYPE_MAIN_DECL (type)); | |
712 | } | |
713 | else if (CLASSTYPE_TEMPLATE_INSTANTIATION (type)) | |
8251199e | 714 | cp_error ("specialization of `%T' after instantiation", type); |
36a117a5 | 715 | } |
20496fa2 JM |
716 | else if (processing_specialization) |
717 | cp_error ("explicit specialization of non-template `%T'", type); | |
36a117a5 MM |
718 | } |
719 | ||
75650646 MM |
720 | /* Retrieve the specialization (in the sense of [temp.spec] - a |
721 | specialization is either an instantiation or an explicit | |
722 | specialization) of TMPL for the given template ARGS. If there is | |
723 | no such specialization, return NULL_TREE. The ARGS are a vector of | |
724 | arguments, or a vector of vectors of arguments, in the case of | |
725 | templates with more than one level of parameters. */ | |
726 | ||
727 | static tree | |
728 | retrieve_specialization (tmpl, args) | |
729 | tree tmpl; | |
730 | tree args; | |
731 | { | |
732 | tree s; | |
733 | ||
734 | my_friendly_assert (TREE_CODE (tmpl) == TEMPLATE_DECL, 0); | |
735 | ||
36a117a5 MM |
736 | /* There should be as many levels of arguments as there are |
737 | levels of parameters. */ | |
738 | my_friendly_assert (TMPL_ARGS_DEPTH (args) | |
739 | == TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl)), | |
740 | 0); | |
741 | ||
75650646 MM |
742 | for (s = DECL_TEMPLATE_SPECIALIZATIONS (tmpl); |
743 | s != NULL_TREE; | |
744 | s = TREE_CHAIN (s)) | |
745 | if (comp_template_args (TREE_PURPOSE (s), args)) | |
746 | return TREE_VALUE (s); | |
747 | ||
748 | return NULL_TREE; | |
386b8a85 JM |
749 | } |
750 | ||
6dfbb909 | 751 | /* Like retrieve_speciailization, but for local declarations. */ |
9188c363 MM |
752 | |
753 | static tree | |
6dfbb909 | 754 | retrieve_local_specialization (tmpl) |
9188c363 | 755 | tree tmpl; |
9188c363 | 756 | { |
6dfbb909 | 757 | return (tree) htab_find (local_specializations, tmpl); |
9188c363 MM |
758 | } |
759 | ||
6757edfe MM |
760 | /* Returns non-zero iff DECL is a specialization of TMPL. */ |
761 | ||
762 | int | |
763 | is_specialization_of (decl, tmpl) | |
764 | tree decl; | |
765 | tree tmpl; | |
766 | { | |
767 | tree t; | |
768 | ||
769 | if (TREE_CODE (decl) == FUNCTION_DECL) | |
770 | { | |
771 | for (t = decl; | |
772 | t != NULL_TREE; | |
773 | t = DECL_TEMPLATE_INFO (t) ? DECL_TI_TEMPLATE (t) : NULL_TREE) | |
774 | if (t == tmpl) | |
775 | return 1; | |
776 | } | |
777 | else | |
778 | { | |
779 | my_friendly_assert (TREE_CODE (decl) == TYPE_DECL, 0); | |
780 | ||
781 | for (t = TREE_TYPE (decl); | |
782 | t != NULL_TREE; | |
783 | t = CLASSTYPE_USE_TEMPLATE (t) | |
784 | ? TREE_TYPE (CLASSTYPE_TI_TEMPLATE (t)) : NULL_TREE) | |
9edc3913 | 785 | if (same_type_ignoring_top_level_qualifiers_p (t, TREE_TYPE (tmpl))) |
6757edfe MM |
786 | return 1; |
787 | } | |
386b8a85 | 788 | |
6757edfe MM |
789 | return 0; |
790 | } | |
75650646 MM |
791 | |
792 | /* Register the specialization SPEC as a specialization of TMPL with | |
36a117a5 MM |
793 | the indicated ARGS. Returns SPEC, or an equivalent prior |
794 | declaration, if available. */ | |
75650646 | 795 | |
36a117a5 | 796 | static tree |
75650646 MM |
797 | register_specialization (spec, tmpl, args) |
798 | tree spec; | |
799 | tree tmpl; | |
800 | tree args; | |
801 | { | |
802 | tree s; | |
803 | ||
804 | my_friendly_assert (TREE_CODE (tmpl) == TEMPLATE_DECL, 0); | |
805 | ||
36a117a5 MM |
806 | if (TREE_CODE (spec) == FUNCTION_DECL |
807 | && uses_template_parms (DECL_TI_ARGS (spec))) | |
808 | /* This is the FUNCTION_DECL for a partial instantiation. Don't | |
809 | register it; we want the corresponding TEMPLATE_DECL instead. | |
810 | We use `uses_template_parms (DECL_TI_ARGS (spec))' rather than | |
811 | the more obvious `uses_template_parms (spec)' to avoid problems | |
812 | with default function arguments. In particular, given | |
813 | something like this: | |
814 | ||
815 | template <class T> void f(T t1, T t = T()) | |
816 | ||
817 | the default argument expression is not substituted for in an | |
818 | instantiation unless and until it is actually needed. */ | |
819 | return spec; | |
75650646 | 820 | |
36a117a5 MM |
821 | /* There should be as many levels of arguments as there are |
822 | levels of parameters. */ | |
823 | my_friendly_assert (TMPL_ARGS_DEPTH (args) | |
824 | == TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl)), | |
825 | 0); | |
826 | ||
75650646 MM |
827 | for (s = DECL_TEMPLATE_SPECIALIZATIONS (tmpl); |
828 | s != NULL_TREE; | |
829 | s = TREE_CHAIN (s)) | |
22e9174f MM |
830 | { |
831 | tree fn = TREE_VALUE (s); | |
832 | ||
833 | /* We can sometimes try to re-register a specialization that we've | |
834 | already got. In particular, regenerate_decl_from_template | |
835 | calls duplicate_decls which will update the specialization | |
836 | list. But, we'll still get called again here anyhow. It's | |
837 | more convenient to simply allow this than to try to prevent it. */ | |
838 | if (fn == spec) | |
839 | return spec; | |
840 | else if (comp_template_args (TREE_PURPOSE (s), args)) | |
841 | { | |
842 | if (DECL_TEMPLATE_SPECIALIZATION (spec)) | |
843 | { | |
844 | if (DECL_TEMPLATE_INSTANTIATION (fn)) | |
845 | { | |
846 | if (TREE_USED (fn) | |
847 | || DECL_EXPLICIT_INSTANTIATION (fn)) | |
848 | { | |
849 | cp_error ("specialization of %D after instantiation", | |
850 | fn); | |
851 | return spec; | |
852 | } | |
853 | else | |
854 | { | |
855 | /* This situation should occur only if the first | |
856 | specialization is an implicit instantiation, | |
857 | the second is an explicit specialization, and | |
858 | the implicit instantiation has not yet been | |
859 | used. That situation can occur if we have | |
860 | implicitly instantiated a member function and | |
861 | then specialized it later. | |
862 | ||
863 | We can also wind up here if a friend | |
864 | declaration that looked like an instantiation | |
865 | turns out to be a specialization: | |
866 | ||
867 | template <class T> void foo(T); | |
868 | class S { friend void foo<>(int) }; | |
869 | template <> void foo(int); | |
870 | ||
871 | We transform the existing DECL in place so that | |
872 | any pointers to it become pointers to the | |
873 | updated declaration. | |
874 | ||
875 | If there was a definition for the template, but | |
876 | not for the specialization, we want this to | |
877 | look as if there is no definition, and vice | |
878 | versa. */ | |
879 | DECL_INITIAL (fn) = NULL_TREE; | |
880 | duplicate_decls (spec, fn); | |
881 | ||
882 | return fn; | |
883 | } | |
884 | } | |
885 | else if (DECL_TEMPLATE_SPECIALIZATION (fn)) | |
886 | { | |
887 | duplicate_decls (spec, fn); | |
888 | return fn; | |
889 | } | |
890 | } | |
891 | } | |
75650646 MM |
892 | } |
893 | ||
894 | DECL_TEMPLATE_SPECIALIZATIONS (tmpl) | |
e1b3e07d | 895 | = tree_cons (args, spec, DECL_TEMPLATE_SPECIALIZATIONS (tmpl)); |
36a117a5 MM |
896 | |
897 | return spec; | |
898 | } | |
899 | ||
900 | /* Unregister the specialization SPEC as a specialization of TMPL. | |
901 | Returns nonzero if the SPEC was listed as a specialization of | |
902 | TMPL. */ | |
903 | ||
904 | static int | |
905 | unregister_specialization (spec, tmpl) | |
906 | tree spec; | |
907 | tree tmpl; | |
908 | { | |
909 | tree* s; | |
910 | ||
911 | for (s = &DECL_TEMPLATE_SPECIALIZATIONS (tmpl); | |
912 | *s != NULL_TREE; | |
913 | s = &TREE_CHAIN (*s)) | |
914 | if (TREE_VALUE (*s) == spec) | |
915 | { | |
916 | *s = TREE_CHAIN (*s); | |
917 | return 1; | |
918 | } | |
919 | ||
920 | return 0; | |
75650646 MM |
921 | } |
922 | ||
6dfbb909 MM |
923 | /* Like register_specialization, but for local declarations. We are |
924 | registering SPEC, an instantiation of TMPL. */ | |
9188c363 MM |
925 | |
926 | static tree | |
6dfbb909 | 927 | register_local_specialization (spec, tmpl) |
9188c363 MM |
928 | tree spec; |
929 | tree tmpl; | |
9188c363 | 930 | { |
6dfbb909 MM |
931 | void **slot; |
932 | ||
933 | slot = htab_find_slot (local_specializations, tmpl, INSERT); | |
934 | *slot = spec; | |
9188c363 MM |
935 | |
936 | return spec; | |
937 | } | |
938 | ||
e1467ff2 MM |
939 | /* Print the list of candidate FNS in an error message. */ |
940 | ||
104bf76a | 941 | void |
e1467ff2 MM |
942 | print_candidates (fns) |
943 | tree fns; | |
944 | { | |
945 | tree fn; | |
946 | ||
d8e178a0 | 947 | const char *str = "candidates are:"; |
e1467ff2 MM |
948 | |
949 | for (fn = fns; fn != NULL_TREE; fn = TREE_CHAIN (fn)) | |
950 | { | |
d6479fe7 MM |
951 | tree f; |
952 | ||
953 | for (f = TREE_VALUE (fn); f; f = OVL_NEXT (f)) | |
954 | cp_error_at ("%s %+#D", str, OVL_CURRENT (f)); | |
e1467ff2 MM |
955 | str = " "; |
956 | } | |
957 | } | |
958 | ||
75650646 | 959 | /* Returns the template (one of the functions given by TEMPLATE_ID) |
e1467ff2 | 960 | which can be specialized to match the indicated DECL with the |
03017874 MM |
961 | explicit template args given in TEMPLATE_ID. The DECL may be |
962 | NULL_TREE if none is available. In that case, the functions in | |
963 | TEMPLATE_ID are non-members. | |
964 | ||
965 | If NEED_MEMBER_TEMPLATE is non-zero the function is known to be a | |
966 | specialization of a member template. | |
967 | ||
968 | The template args (those explicitly specified and those deduced) | |
969 | are output in a newly created vector *TARGS_OUT. | |
970 | ||
971 | If it is impossible to determine the result, an error message is | |
bf8f3f93 | 972 | issued. The error_mark_node is returned to indicate failure. */ |
75650646 | 973 | |
e9659ab0 | 974 | static tree |
e1467ff2 | 975 | determine_specialization (template_id, decl, targs_out, |
bf8f3f93 | 976 | need_member_template) |
386b8a85 | 977 | tree template_id; |
e1467ff2 | 978 | tree decl; |
386b8a85 JM |
979 | tree* targs_out; |
980 | int need_member_template; | |
386b8a85 | 981 | { |
03017874 MM |
982 | tree fns; |
983 | tree targs; | |
984 | tree explicit_targs; | |
985 | tree candidates = NULL_TREE; | |
986 | tree templates = NULL_TREE; | |
386b8a85 | 987 | |
e1467ff2 MM |
988 | *targs_out = NULL_TREE; |
989 | ||
f2e48b67 BK |
990 | if (template_id == error_mark_node) |
991 | return error_mark_node; | |
992 | ||
993 | fns = TREE_OPERAND (template_id, 0); | |
03017874 | 994 | explicit_targs = TREE_OPERAND (template_id, 1); |
f2e48b67 | 995 | |
27fafc8d JM |
996 | if (fns == error_mark_node) |
997 | return error_mark_node; | |
998 | ||
2c73f9f5 | 999 | /* Check for baselinks. */ |
91e490ab | 1000 | if (BASELINK_P (fns)) |
2c73f9f5 | 1001 | fns = TREE_VALUE (fns); |
386b8a85 | 1002 | |
91e490ab MM |
1003 | if (!is_overloaded_fn (fns)) |
1004 | { | |
9dfce8fd | 1005 | cp_error ("`%D' is not a function template", fns); |
91e490ab MM |
1006 | return error_mark_node; |
1007 | } | |
1008 | ||
2c73f9f5 | 1009 | for (; fns; fns = OVL_NEXT (fns)) |
386b8a85 | 1010 | { |
75650646 MM |
1011 | tree tmpl; |
1012 | ||
9dfce8fd | 1013 | tree fn = OVL_CURRENT (fns); |
03017874 MM |
1014 | |
1015 | if (TREE_CODE (fn) == TEMPLATE_DECL) | |
1016 | /* DECL might be a specialization of FN. */ | |
1017 | tmpl = fn; | |
1018 | else if (need_member_template) | |
1019 | /* FN is an ordinary member function, and we need a | |
1020 | specialization of a member template. */ | |
1021 | continue; | |
1022 | else if (TREE_CODE (fn) != FUNCTION_DECL) | |
1023 | /* We can get IDENTIFIER_NODEs here in certain erroneous | |
1024 | cases. */ | |
1025 | continue; | |
1026 | else if (!DECL_FUNCTION_MEMBER_P (fn)) | |
1027 | /* This is just an ordinary non-member function. Nothing can | |
1028 | be a specialization of that. */ | |
1029 | continue; | |
75650646 | 1030 | else |
03017874 MM |
1031 | { |
1032 | tree decl_arg_types; | |
386b8a85 | 1033 | |
03017874 MM |
1034 | /* This is an ordinary member function. However, since |
1035 | we're here, we can assume it's enclosing class is a | |
1036 | template class. For example, | |
1037 | ||
1038 | template <typename T> struct S { void f(); }; | |
1039 | template <> void S<int>::f() {} | |
1040 | ||
1041 | Here, S<int>::f is a non-template, but S<int> is a | |
1042 | template class. If FN has the same type as DECL, we | |
1043 | might be in business. */ | |
1044 | if (!same_type_p (TREE_TYPE (TREE_TYPE (decl)), | |
1045 | TREE_TYPE (TREE_TYPE (fn)))) | |
1046 | /* The return types differ. */ | |
1047 | continue; | |
1048 | ||
1049 | /* Adjust the type of DECL in case FN is a static member. */ | |
1050 | decl_arg_types = TYPE_ARG_TYPES (TREE_TYPE (decl)); | |
1051 | if (DECL_STATIC_FUNCTION_P (fn) | |
1052 | && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl)) | |
1053 | decl_arg_types = TREE_CHAIN (decl_arg_types); | |
1054 | ||
1055 | if (compparms (TYPE_ARG_TYPES (TREE_TYPE (fn)), | |
1056 | decl_arg_types)) | |
1057 | /* They match! */ | |
1058 | candidates = tree_cons (NULL_TREE, fn, candidates); | |
1059 | ||
1060 | continue; | |
1061 | } | |
386b8a85 | 1062 | |
bf8f3f93 MM |
1063 | /* See whether this function might be a specialization of this |
1064 | template. */ | |
1065 | targs = get_bindings (tmpl, decl, explicit_targs); | |
03017874 MM |
1066 | |
1067 | if (!targs) | |
bf8f3f93 | 1068 | /* We cannot deduce template arguments that when used to |
03017874 MM |
1069 | specialize TMPL will produce DECL. */ |
1070 | continue; | |
1071 | ||
1072 | /* Save this template, and the arguments deduced. */ | |
e1b3e07d | 1073 | templates = tree_cons (targs, tmpl, templates); |
386b8a85 | 1074 | } |
03017874 | 1075 | |
bf8f3f93 | 1076 | if (templates && TREE_CHAIN (templates)) |
386b8a85 | 1077 | { |
03017874 MM |
1078 | /* We have: |
1079 | ||
1080 | [temp.expl.spec] | |
1081 | ||
1082 | It is possible for a specialization with a given function | |
1083 | signature to be instantiated from more than one function | |
1084 | template. In such cases, explicit specification of the | |
1085 | template arguments must be used to uniquely identify the | |
1086 | function template specialization being specialized. | |
1087 | ||
1088 | Note that here, there's no suggestion that we're supposed to | |
1089 | determine which of the candidate templates is most | |
1090 | specialized. However, we, also have: | |
1091 | ||
1092 | [temp.func.order] | |
1093 | ||
1094 | Partial ordering of overloaded function template | |
1095 | declarations is used in the following contexts to select | |
1096 | the function template to which a function template | |
1097 | specialization refers: | |
1098 | ||
1099 | -- when an explicit specialization refers to a function | |
1100 | template. | |
1101 | ||
1102 | So, we do use the partial ordering rules, at least for now. | |
1103 | This extension can only serve to make illegal programs legal, | |
1104 | so it's safe. And, there is strong anecdotal evidence that | |
1105 | the committee intended the partial ordering rules to apply; | |
1106 | the EDG front-end has that behavior, and John Spicer claims | |
1107 | that the committee simply forgot to delete the wording in | |
1108 | [temp.expl.spec]. */ | |
1109 | tree tmpl = most_specialized (templates, decl, explicit_targs); | |
1110 | if (tmpl && tmpl != error_mark_node) | |
1111 | { | |
1112 | targs = get_bindings (tmpl, decl, explicit_targs); | |
e1b3e07d | 1113 | templates = tree_cons (targs, tmpl, NULL_TREE); |
03017874 | 1114 | } |
e1467ff2 MM |
1115 | } |
1116 | ||
03017874 | 1117 | if (templates == NULL_TREE && candidates == NULL_TREE) |
e1467ff2 | 1118 | { |
bf8f3f93 MM |
1119 | cp_error_at ("template-id `%D' for `%+D' does not match any template declaration", |
1120 | template_id, decl); | |
03017874 | 1121 | return error_mark_node; |
386b8a85 | 1122 | } |
03017874 | 1123 | else if ((templates && TREE_CHAIN (templates)) |
bf8f3f93 MM |
1124 | || (candidates && TREE_CHAIN (candidates)) |
1125 | || (templates && candidates)) | |
386b8a85 | 1126 | { |
bf8f3f93 MM |
1127 | cp_error_at ("ambiguous template specialization `%D' for `%+D'", |
1128 | template_id, decl); | |
1129 | chainon (candidates, templates); | |
1130 | print_candidates (candidates); | |
03017874 | 1131 | return error_mark_node; |
386b8a85 JM |
1132 | } |
1133 | ||
1134 | /* We have one, and exactly one, match. */ | |
03017874 MM |
1135 | if (candidates) |
1136 | { | |
1137 | /* It was a specialization of an ordinary member function in a | |
1138 | template class. */ | |
1139 | *targs_out = copy_node (DECL_TI_ARGS (TREE_VALUE (candidates))); | |
1140 | return DECL_TI_TEMPLATE (TREE_VALUE (candidates)); | |
1141 | } | |
1142 | ||
1143 | /* It was a specialization of a template. */ | |
17aec3eb | 1144 | targs = DECL_TI_ARGS (DECL_TEMPLATE_RESULT (TREE_VALUE (templates))); |
03017874 MM |
1145 | if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (targs)) |
1146 | { | |
1147 | *targs_out = copy_node (targs); | |
1148 | SET_TMPL_ARGS_LEVEL (*targs_out, | |
1149 | TMPL_ARGS_DEPTH (*targs_out), | |
1150 | TREE_PURPOSE (templates)); | |
1151 | } | |
1152 | else | |
1153 | *targs_out = TREE_PURPOSE (templates); | |
e1467ff2 | 1154 | return TREE_VALUE (templates); |
8d08fdba | 1155 | } |
6757edfe | 1156 | |
386b8a85 | 1157 | /* Check to see if the function just declared, as indicated in |
75650646 MM |
1158 | DECLARATOR, and in DECL, is a specialization of a function |
1159 | template. We may also discover that the declaration is an explicit | |
1160 | instantiation at this point. | |
1161 | ||
e1467ff2 | 1162 | Returns DECL, or an equivalent declaration that should be used |
03017874 MM |
1163 | instead if all goes well. Issues an error message if something is |
1164 | amiss. Returns error_mark_node if the error is not easily | |
1165 | recoverable. | |
75650646 | 1166 | |
75650646 MM |
1167 | FLAGS is a bitmask consisting of the following flags: |
1168 | ||
75650646 MM |
1169 | 2: The function has a definition. |
1170 | 4: The function is a friend. | |
75650646 MM |
1171 | |
1172 | The TEMPLATE_COUNT is the number of references to qualifying | |
1173 | template classes that appeared in the name of the function. For | |
1174 | example, in | |
1175 | ||
1176 | template <class T> struct S { void f(); }; | |
1177 | void S<int>::f(); | |
1178 | ||
1179 | the TEMPLATE_COUNT would be 1. However, explicitly specialized | |
1180 | classes are not counted in the TEMPLATE_COUNT, so that in | |
1181 | ||
1182 | template <class T> struct S {}; | |
1183 | template <> struct S<int> { void f(); } | |
36a117a5 | 1184 | template <> void S<int>::f(); |
75650646 MM |
1185 | |
1186 | the TEMPLATE_COUNT would be 0. (Note that this declaration is | |
1187 | illegal; there should be no template <>.) | |
1188 | ||
1189 | If the function is a specialization, it is marked as such via | |
1190 | DECL_TEMPLATE_SPECIALIZATION. Furthermore, its DECL_TEMPLATE_INFO | |
1191 | is set up correctly, and it is added to the list of specializations | |
1192 | for that template. */ | |
386b8a85 | 1193 | |
e1467ff2 | 1194 | tree |
27bb8339 | 1195 | check_explicit_specialization (declarator, decl, template_count, flags) |
386b8a85 JM |
1196 | tree declarator; |
1197 | tree decl; | |
1198 | int template_count; | |
1199 | int flags; | |
1200 | { | |
75650646 MM |
1201 | int have_def = flags & 2; |
1202 | int is_friend = flags & 4; | |
1203 | int specialization = 0; | |
e1467ff2 | 1204 | int explicit_instantiation = 0; |
fd4de5ff | 1205 | int member_specialization = 0; |
75650646 MM |
1206 | tree ctype = DECL_CLASS_CONTEXT (decl); |
1207 | tree dname = DECL_NAME (decl); | |
74b846e0 | 1208 | tmpl_spec_kind tsk; |
386b8a85 | 1209 | |
74b846e0 | 1210 | tsk = current_tmpl_spec_kind (template_count); |
75650646 | 1211 | |
74b846e0 MM |
1212 | switch (tsk) |
1213 | { | |
1214 | case tsk_none: | |
1215 | if (processing_specialization) | |
75650646 | 1216 | { |
fd4de5ff MM |
1217 | specialization = 1; |
1218 | SET_DECL_TEMPLATE_SPECIALIZATION (decl); | |
75650646 | 1219 | } |
74b846e0 | 1220 | else if (TREE_CODE (declarator) == TEMPLATE_ID_EXPR) |
386b8a85 | 1221 | { |
74b846e0 MM |
1222 | if (is_friend) |
1223 | /* This could be something like: | |
75650646 | 1224 | |
74b846e0 MM |
1225 | template <class T> void f(T); |
1226 | class S { friend void f<>(int); } */ | |
1227 | specialization = 1; | |
1228 | else | |
1229 | { | |
1230 | /* This case handles bogus declarations like template <> | |
1231 | template <class T> void f<int>(); */ | |
1232 | ||
1233 | cp_error ("template-id `%D' in declaration of primary template", | |
1234 | declarator); | |
1235 | return decl; | |
1236 | } | |
1237 | } | |
1238 | break; | |
1239 | ||
1240 | case tsk_invalid_member_spec: | |
1241 | /* The error has already been reported in | |
1242 | check_specialization_scope. */ | |
1243 | return error_mark_node; | |
1244 | ||
1245 | case tsk_invalid_expl_inst: | |
1246 | cp_error ("template parameter list used in explicit instantiation"); | |
1247 | ||
1248 | /* Fall through. */ | |
1249 | ||
1250 | case tsk_expl_inst: | |
fd4de5ff MM |
1251 | if (have_def) |
1252 | cp_error ("definition provided for explicit instantiation"); | |
74b846e0 | 1253 | |
fd4de5ff | 1254 | explicit_instantiation = 1; |
74b846e0 | 1255 | break; |
fd4de5ff | 1256 | |
74b846e0 MM |
1257 | case tsk_excessive_parms: |
1258 | cp_error ("too many template parameter lists in declaration of `%D'", | |
1259 | decl); | |
1260 | return error_mark_node; | |
75650646 | 1261 | |
74b846e0 MM |
1262 | /* Fall through. */ |
1263 | case tsk_expl_spec: | |
1264 | SET_DECL_TEMPLATE_SPECIALIZATION (decl); | |
1265 | if (ctype) | |
1266 | member_specialization = 1; | |
1267 | else | |
1268 | specialization = 1; | |
1269 | break; | |
1270 | ||
1271 | case tsk_insufficient_parms: | |
fd4de5ff MM |
1272 | if (template_header_count) |
1273 | { | |
74b846e0 MM |
1274 | cp_error("too few template parameter lists in declaration of `%D'", |
1275 | decl); | |
fd4de5ff | 1276 | return decl; |
c6f2ed0d | 1277 | } |
74b846e0 MM |
1278 | else if (ctype != NULL_TREE |
1279 | && !TYPE_BEING_DEFINED (ctype) | |
1280 | && CLASSTYPE_TEMPLATE_INSTANTIATION (ctype) | |
1281 | && !is_friend) | |
1282 | { | |
1283 | /* For backwards compatibility, we accept: | |
fd4de5ff | 1284 | |
74b846e0 MM |
1285 | template <class T> struct S { void f(); }; |
1286 | void S<int>::f() {} // Missing template <> | |
fd4de5ff | 1287 | |
74b846e0 MM |
1288 | That used to be legal C++. */ |
1289 | if (pedantic) | |
1290 | cp_pedwarn | |
1291 | ("explicit specialization not preceded by `template <>'"); | |
1292 | specialization = 1; | |
1293 | SET_DECL_TEMPLATE_SPECIALIZATION (decl); | |
1294 | } | |
1295 | break; | |
1296 | ||
1297 | case tsk_template: | |
1298 | if (TREE_CODE (declarator) == TEMPLATE_ID_EXPR) | |
c6f2ed0d | 1299 | { |
fd4de5ff MM |
1300 | /* This case handles bogus declarations like template <> |
1301 | template <class T> void f<int>(); */ | |
75650646 | 1302 | |
fd4de5ff MM |
1303 | cp_error ("template-id `%D' in declaration of primary template", |
1304 | declarator); | |
1305 | return decl; | |
386b8a85 | 1306 | } |
74b846e0 MM |
1307 | |
1308 | if (ctype && CLASSTYPE_TEMPLATE_INSTANTIATION (ctype)) | |
1309 | /* This is a specialization of a member template, without | |
1310 | specialization the containing class. Something like: | |
1311 | ||
1312 | template <class T> struct S { | |
1313 | template <class U> void f (U); | |
1314 | }; | |
1315 | template <> template <class U> void S<int>::f(U) {} | |
1316 | ||
1317 | That's a specialization -- but of the entire template. */ | |
1318 | specialization = 1; | |
1319 | break; | |
1320 | ||
1321 | default: | |
1322 | my_friendly_abort (20000309); | |
75650646 | 1323 | } |
386b8a85 | 1324 | |
670960ac JM |
1325 | if (specialization || member_specialization) |
1326 | { | |
1327 | tree t = TYPE_ARG_TYPES (TREE_TYPE (decl)); | |
1328 | for (; t; t = TREE_CHAIN (t)) | |
1329 | if (TREE_PURPOSE (t)) | |
1330 | { | |
8251199e JM |
1331 | cp_pedwarn |
1332 | ("default argument specified in explicit specialization"); | |
670960ac JM |
1333 | break; |
1334 | } | |
f3400fe2 JM |
1335 | if (current_lang_name == lang_name_c) |
1336 | cp_error ("template specialization with C linkage"); | |
670960ac JM |
1337 | } |
1338 | ||
e1467ff2 | 1339 | if (specialization || member_specialization || explicit_instantiation) |
75650646 MM |
1340 | { |
1341 | tree tmpl = NULL_TREE; | |
1342 | tree targs = NULL_TREE; | |
75650646 MM |
1343 | |
1344 | /* Make sure that the declarator is a TEMPLATE_ID_EXPR. */ | |
386b8a85 JM |
1345 | if (TREE_CODE (declarator) != TEMPLATE_ID_EXPR) |
1346 | { | |
1347 | tree fns; | |
1348 | ||
1349 | my_friendly_assert (TREE_CODE (declarator) == IDENTIFIER_NODE, | |
1350 | 0); | |
1351 | if (!ctype) | |
30394414 | 1352 | fns = IDENTIFIER_NAMESPACE_VALUE (dname); |
386b8a85 JM |
1353 | else |
1354 | fns = dname; | |
1355 | ||
75650646 MM |
1356 | declarator = |
1357 | lookup_template_function (fns, NULL_TREE); | |
386b8a85 JM |
1358 | } |
1359 | ||
f2e48b67 BK |
1360 | if (declarator == error_mark_node) |
1361 | return error_mark_node; | |
1362 | ||
75650646 MM |
1363 | if (ctype != NULL_TREE && TYPE_BEING_DEFINED (ctype)) |
1364 | { | |
8ec2ac34 | 1365 | if (!explicit_instantiation) |
6c30752f MM |
1366 | /* A specialization in class scope. This is illegal, |
1367 | but the error will already have been flagged by | |
1368 | check_specialization_scope. */ | |
1369 | return error_mark_node; | |
8ec2ac34 | 1370 | else |
b370501f KG |
1371 | { |
1372 | /* It's not legal to write an explicit instantiation in | |
1373 | class scope, e.g.: | |
8ec2ac34 | 1374 | |
b370501f | 1375 | class C { template void f(); } |
8ec2ac34 | 1376 | |
b370501f KG |
1377 | This case is caught by the parser. However, on |
1378 | something like: | |
8ec2ac34 | 1379 | |
b370501f | 1380 | template class C { void f(); }; |
8ec2ac34 | 1381 | |
b370501f KG |
1382 | (which is illegal) we can get here. The error will be |
1383 | issued later. */ | |
1384 | ; | |
1385 | } | |
8ec2ac34 | 1386 | |
e1467ff2 | 1387 | return decl; |
75650646 | 1388 | } |
8f032717 MM |
1389 | else if (TREE_CODE (TREE_OPERAND (declarator, 0)) == LOOKUP_EXPR) |
1390 | { | |
1391 | /* A friend declaration. We can't do much, because we don't | |
1392 | know what this resolves to, yet. */ | |
1393 | my_friendly_assert (is_friend != 0, 0); | |
1394 | my_friendly_assert (!explicit_instantiation, 0); | |
1395 | SET_DECL_IMPLICIT_INSTANTIATION (decl); | |
1396 | return decl; | |
1397 | } | |
75650646 MM |
1398 | else if (ctype != NULL_TREE |
1399 | && (TREE_CODE (TREE_OPERAND (declarator, 0)) == | |
1400 | IDENTIFIER_NODE)) | |
386b8a85 | 1401 | { |
75650646 MM |
1402 | /* Find the list of functions in ctype that have the same |
1403 | name as the declared function. */ | |
1404 | tree name = TREE_OPERAND (declarator, 0); | |
03017874 MM |
1405 | tree fns = NULL_TREE; |
1406 | int idx; | |
1407 | ||
75650646 MM |
1408 | if (name == constructor_name (ctype) |
1409 | || name == constructor_name_full (ctype)) | |
386b8a85 | 1410 | { |
75650646 MM |
1411 | int is_constructor = DECL_CONSTRUCTOR_P (decl); |
1412 | ||
1413 | if (is_constructor ? !TYPE_HAS_CONSTRUCTOR (ctype) | |
1414 | : !TYPE_HAS_DESTRUCTOR (ctype)) | |
1415 | { | |
1416 | /* From [temp.expl.spec]: | |
e1467ff2 | 1417 | |
75650646 MM |
1418 | If such an explicit specialization for the member |
1419 | of a class template names an implicitly-declared | |
1420 | special member function (clause _special_), the | |
e1467ff2 MM |
1421 | program is ill-formed. |
1422 | ||
1423 | Similar language is found in [temp.explicit]. */ | |
8251199e | 1424 | cp_error ("specialization of implicitly-declared special member function"); |
03017874 | 1425 | return error_mark_node; |
75650646 | 1426 | } |
386b8a85 | 1427 | |
42da2fd8 | 1428 | name = is_constructor ? ctor_identifier : dtor_identifier; |
75650646 | 1429 | } |
42da2fd8 | 1430 | |
421844e7 | 1431 | if (!DECL_CONV_FN_P (decl)) |
03017874 MM |
1432 | { |
1433 | idx = lookup_fnfields_1 (ctype, name); | |
1434 | if (idx >= 0) | |
1435 | fns = TREE_VEC_ELT (CLASSTYPE_METHOD_VEC (ctype), idx); | |
1436 | } | |
1437 | else | |
1438 | { | |
1439 | tree methods; | |
1440 | ||
1441 | /* For a type-conversion operator, we cannot do a | |
1442 | name-based lookup. We might be looking for `operator | |
1443 | int' which will be a specialization of `operator T'. | |
1444 | So, we find *all* the conversion operators, and then | |
1445 | select from them. */ | |
1446 | fns = NULL_TREE; | |
1447 | ||
1448 | methods = CLASSTYPE_METHOD_VEC (ctype); | |
1449 | if (methods) | |
1450 | for (idx = 2; idx < TREE_VEC_LENGTH (methods); ++idx) | |
1451 | { | |
1452 | tree ovl = TREE_VEC_ELT (methods, idx); | |
1453 | ||
1454 | if (!ovl || !DECL_CONV_FN_P (OVL_CURRENT (ovl))) | |
1455 | /* There are no more conversion functions. */ | |
1456 | break; | |
1457 | ||
1458 | /* Glue all these conversion functions together | |
1459 | with those we already have. */ | |
1460 | for (; ovl; ovl = OVL_NEXT (ovl)) | |
1461 | fns = ovl_cons (OVL_CURRENT (ovl), fns); | |
1462 | } | |
1463 | } | |
1464 | ||
386b8a85 JM |
1465 | if (fns == NULL_TREE) |
1466 | { | |
b3f738da MM |
1467 | cp_error ("no member function `%D' declared in `%T'", |
1468 | name, ctype); | |
03017874 | 1469 | return error_mark_node; |
386b8a85 JM |
1470 | } |
1471 | else | |
1472 | TREE_OPERAND (declarator, 0) = fns; | |
1473 | } | |
75650646 | 1474 | |
e1467ff2 MM |
1475 | /* Figure out what exactly is being specialized at this point. |
1476 | Note that for an explicit instantiation, even one for a | |
38e01259 | 1477 | member function, we cannot tell apriori whether the |
e1467ff2 | 1478 | instantiation is for a member template, or just a member |
36a117a5 MM |
1479 | function of a template class. Even if a member template is |
1480 | being instantiated, the member template arguments may be | |
1481 | elided if they can be deduced from the rest of the | |
1482 | declaration. */ | |
e1467ff2 MM |
1483 | tmpl = determine_specialization (declarator, decl, |
1484 | &targs, | |
bf8f3f93 | 1485 | member_specialization); |
386b8a85 | 1486 | |
03017874 MM |
1487 | if (!tmpl || tmpl == error_mark_node) |
1488 | /* We couldn't figure out what this declaration was | |
1489 | specializing. */ | |
1490 | return error_mark_node; | |
1491 | else | |
386b8a85 | 1492 | { |
25aab5d0 | 1493 | tree gen_tmpl = most_general_template (tmpl); |
36a117a5 | 1494 | |
e1467ff2 MM |
1495 | if (explicit_instantiation) |
1496 | { | |
03d0f4af | 1497 | /* We don't set DECL_EXPLICIT_INSTANTIATION here; that |
25aab5d0 MM |
1498 | is done by do_decl_instantiation later. */ |
1499 | ||
1500 | int arg_depth = TMPL_ARGS_DEPTH (targs); | |
1501 | int parm_depth = TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl)); | |
1502 | ||
1503 | if (arg_depth > parm_depth) | |
1504 | { | |
1505 | /* If TMPL is not the most general template (for | |
1506 | example, if TMPL is a friend template that is | |
1507 | injected into namespace scope), then there will | |
1508 | be too many levels fo TARGS. Remove some of them | |
1509 | here. */ | |
1510 | int i; | |
1511 | tree new_targs; | |
1512 | ||
f31c0a32 | 1513 | new_targs = make_tree_vec (parm_depth); |
25aab5d0 MM |
1514 | for (i = arg_depth - parm_depth; i < arg_depth; ++i) |
1515 | TREE_VEC_ELT (new_targs, i - (arg_depth - parm_depth)) | |
1516 | = TREE_VEC_ELT (targs, i); | |
1517 | targs = new_targs; | |
1518 | } | |
1519 | ||
74b846e0 | 1520 | return instantiate_template (tmpl, targs); |
e1467ff2 | 1521 | } |
74b846e0 | 1522 | |
f9a7ae04 MM |
1523 | /* If this is a specialization of a member template of a |
1524 | template class. In we want to return the TEMPLATE_DECL, | |
1525 | not the specialization of it. */ | |
74b846e0 MM |
1526 | if (tsk == tsk_template) |
1527 | { | |
1528 | SET_DECL_TEMPLATE_SPECIALIZATION (tmpl); | |
f9a7ae04 | 1529 | DECL_INITIAL (DECL_TEMPLATE_RESULT (tmpl)) = NULL_TREE; |
74b846e0 MM |
1530 | return tmpl; |
1531 | } | |
1532 | ||
36a117a5 MM |
1533 | /* If we though that the DECL was a member function, but it |
1534 | turns out to be specializing a static member function, | |
1535 | make DECL a static member function as well. */ | |
1536 | if (DECL_STATIC_FUNCTION_P (tmpl) | |
1537 | && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl)) | |
366c0f1e | 1538 | { |
3afb32a4 | 1539 | revert_static_member_fn (decl); |
366c0f1e MM |
1540 | last_function_parms = TREE_CHAIN (last_function_parms); |
1541 | } | |
e1467ff2 | 1542 | |
36a117a5 | 1543 | /* Set up the DECL_TEMPLATE_INFO for DECL. */ |
e1b3e07d | 1544 | DECL_TEMPLATE_INFO (decl) = tree_cons (tmpl, targs, NULL_TREE); |
36a117a5 | 1545 | |
e1467ff2 MM |
1546 | /* Mangle the function name appropriately. Note that we do |
1547 | not mangle specializations of non-template member | |
1548 | functions of template classes, e.g. with | |
36a117a5 | 1549 | |
e1467ff2 | 1550 | template <class T> struct S { void f(); } |
36a117a5 | 1551 | |
e1467ff2 | 1552 | and given the specialization |
36a117a5 | 1553 | |
e1467ff2 | 1554 | template <> void S<int>::f() {} |
36a117a5 | 1555 | |
e1467ff2 MM |
1556 | we do not mangle S<int>::f() here. That's because it's |
1557 | just an ordinary member function and doesn't need special | |
36a117a5 | 1558 | treatment. We do this here so that the ordinary, |
74b846e0 | 1559 | non-template, name-mangling algorithm will not be used |
36a117a5 | 1560 | later. */ |
669ec2b4 JM |
1561 | if ((is_member_template (tmpl) || ctype == NULL_TREE) |
1562 | && name_mangling_version >= 1) | |
1563 | set_mangled_name_for_template_decl (decl); | |
386b8a85 JM |
1564 | |
1565 | if (is_friend && !have_def) | |
36a117a5 MM |
1566 | /* This is not really a declaration of a specialization. |
1567 | It's just the name of an instantiation. But, it's not | |
1568 | a request for an instantiation, either. */ | |
fbf1c34b | 1569 | SET_DECL_IMPLICIT_INSTANTIATION (decl); |
75650646 | 1570 | |
36a117a5 MM |
1571 | /* Register this specialization so that we can find it |
1572 | again. */ | |
1573 | decl = register_specialization (decl, gen_tmpl, targs); | |
386b8a85 JM |
1574 | } |
1575 | } | |
75650646 | 1576 | |
e1467ff2 | 1577 | return decl; |
386b8a85 | 1578 | } |
75650646 | 1579 | |
39c01e4c MM |
1580 | /* TYPE is being declared. Verify that the use of template headers |
1581 | and such is reasonable. Issue error messages if not. */ | |
1582 | ||
1583 | void | |
1584 | maybe_check_template_type (type) | |
1585 | tree type; | |
1586 | { | |
1587 | if (template_header_count) | |
1588 | { | |
1589 | /* We are in the scope of some `template <...>' header. */ | |
1590 | ||
1591 | int context_depth | |
1592 | = template_class_depth_real (TYPE_CONTEXT (type), | |
1593 | /*count_specializations=*/1); | |
1594 | ||
1595 | if (template_header_count <= context_depth) | |
1596 | /* This is OK; the template headers are for the context. We | |
1597 | are actually too lenient here; like | |
1598 | check_explicit_specialization we should consider the number | |
1599 | of template types included in the actual declaration. For | |
1600 | example, | |
1601 | ||
1602 | template <class T> struct S { | |
1603 | template <class U> template <class V> | |
1604 | struct I {}; | |
1605 | }; | |
1606 | ||
1607 | is illegal, but: | |
1608 | ||
1609 | template <class T> struct S { | |
1610 | template <class U> struct I; | |
1611 | }; | |
1612 | ||
1613 | template <class T> template <class U. | |
1614 | struct S<T>::I {}; | |
1615 | ||
1616 | is not. */ | |
1617 | ; | |
1618 | else if (template_header_count > context_depth + 1) | |
1619 | /* There are two many template parameter lists. */ | |
8251199e | 1620 | cp_error ("too many template parameter lists in declaration of `%T'", type); |
39c01e4c MM |
1621 | } |
1622 | } | |
1623 | ||
75650646 MM |
1624 | /* Returns 1 iff PARMS1 and PARMS2 are identical sets of template |
1625 | parameters. These are represented in the same format used for | |
1626 | DECL_TEMPLATE_PARMS. */ | |
1627 | ||
1628 | int comp_template_parms (parms1, parms2) | |
1629 | tree parms1; | |
1630 | tree parms2; | |
1631 | { | |
1632 | tree p1; | |
1633 | tree p2; | |
1634 | ||
1635 | if (parms1 == parms2) | |
1636 | return 1; | |
1637 | ||
1638 | for (p1 = parms1, p2 = parms2; | |
1639 | p1 != NULL_TREE && p2 != NULL_TREE; | |
1640 | p1 = TREE_CHAIN (p1), p2 = TREE_CHAIN (p2)) | |
1641 | { | |
1642 | tree t1 = TREE_VALUE (p1); | |
1643 | tree t2 = TREE_VALUE (p2); | |
1644 | int i; | |
1645 | ||
1646 | my_friendly_assert (TREE_CODE (t1) == TREE_VEC, 0); | |
1647 | my_friendly_assert (TREE_CODE (t2) == TREE_VEC, 0); | |
1648 | ||
1649 | if (TREE_VEC_LENGTH (t1) != TREE_VEC_LENGTH (t2)) | |
1650 | return 0; | |
1651 | ||
1652 | for (i = 0; i < TREE_VEC_LENGTH (t2); ++i) | |
1653 | { | |
1654 | tree parm1 = TREE_VALUE (TREE_VEC_ELT (t1, i)); | |
1655 | tree parm2 = TREE_VALUE (TREE_VEC_ELT (t2, i)); | |
1656 | ||
1657 | if (TREE_CODE (parm1) != TREE_CODE (parm2)) | |
1658 | return 0; | |
1659 | ||
1660 | if (TREE_CODE (parm1) == TEMPLATE_TYPE_PARM) | |
1661 | continue; | |
3bfdc719 | 1662 | else if (!same_type_p (TREE_TYPE (parm1), TREE_TYPE (parm2))) |
75650646 MM |
1663 | return 0; |
1664 | } | |
1665 | } | |
1666 | ||
1667 | if ((p1 != NULL_TREE) != (p2 != NULL_TREE)) | |
1668 | /* One set of parameters has more parameters lists than the | |
1669 | other. */ | |
1670 | return 0; | |
1671 | ||
1672 | return 1; | |
1673 | } | |
1674 | ||
f3400fe2 JM |
1675 | /* Complain if DECL shadows a template parameter. |
1676 | ||
1677 | [temp.local]: A template-parameter shall not be redeclared within its | |
1678 | scope (including nested scopes). */ | |
1679 | ||
1680 | void | |
1681 | check_template_shadow (decl) | |
1682 | tree decl; | |
1683 | { | |
8f032717 MM |
1684 | tree olddecl; |
1685 | ||
b5d9b9ab MM |
1686 | /* If we're not in a template, we can't possibly shadow a template |
1687 | parameter. */ | |
1688 | if (!current_template_parms) | |
1689 | return; | |
1690 | ||
1691 | /* Figure out what we're shadowing. */ | |
8f032717 MM |
1692 | if (TREE_CODE (decl) == OVERLOAD) |
1693 | decl = OVL_CURRENT (decl); | |
1694 | olddecl = IDENTIFIER_VALUE (DECL_NAME (decl)); | |
f3400fe2 | 1695 | |
b5d9b9ab MM |
1696 | /* If there's no previous binding for this name, we're not shadowing |
1697 | anything, let alone a template parameter. */ | |
1698 | if (!olddecl) | |
1699 | return; | |
1700 | ||
1701 | /* If we're not shadowing a template parameter, we're done. Note | |
1702 | that OLDDECL might be an OVERLOAD (or perhaps even an | |
1703 | ERROR_MARK), so we can't just blithely assume it to be a _DECL | |
1704 | node. */ | |
2f939d94 | 1705 | if (!DECL_P (olddecl) || !DECL_TEMPLATE_PARM_P (olddecl)) |
b5d9b9ab MM |
1706 | return; |
1707 | ||
1708 | /* We check for decl != olddecl to avoid bogus errors for using a | |
1709 | name inside a class. We check TPFI to avoid duplicate errors for | |
1710 | inline member templates. */ | |
1711 | if (decl == olddecl | |
1712 | || TEMPLATE_PARMS_FOR_INLINE (current_template_parms)) | |
1713 | return; | |
1714 | ||
1715 | cp_error_at ("declaration of `%#D'", decl); | |
1716 | cp_error_at (" shadows template parm `%#D'", olddecl); | |
f3400fe2 | 1717 | } |
22a7be53 | 1718 | |
f3400fe2 | 1719 | /* Return a new TEMPLATE_PARM_INDEX with the indicated INDEX, LEVEL, |
f84b4be9 JM |
1720 | ORIG_LEVEL, DECL, and TYPE. */ |
1721 | ||
1722 | static tree | |
1723 | build_template_parm_index (index, level, orig_level, decl, type) | |
1724 | int index; | |
1725 | int level; | |
1726 | int orig_level; | |
1727 | tree decl; | |
1728 | tree type; | |
1729 | { | |
1730 | tree t = make_node (TEMPLATE_PARM_INDEX); | |
1731 | TEMPLATE_PARM_IDX (t) = index; | |
1732 | TEMPLATE_PARM_LEVEL (t) = level; | |
1733 | TEMPLATE_PARM_ORIG_LEVEL (t) = orig_level; | |
1734 | TEMPLATE_PARM_DECL (t) = decl; | |
1735 | TREE_TYPE (t) = type; | |
1736 | ||
1737 | return t; | |
1738 | } | |
1739 | ||
f84b4be9 | 1740 | /* Return a TEMPLATE_PARM_INDEX, similar to INDEX, but whose |
93cdc044 | 1741 | TEMPLATE_PARM_LEVEL has been decreased by LEVELS. If such a |
f84b4be9 JM |
1742 | TEMPLATE_PARM_INDEX already exists, it is returned; otherwise, a |
1743 | new one is created. */ | |
1744 | ||
1745 | static tree | |
93cdc044 | 1746 | reduce_template_parm_level (index, type, levels) |
f84b4be9 JM |
1747 | tree index; |
1748 | tree type; | |
93cdc044 | 1749 | int levels; |
f84b4be9 JM |
1750 | { |
1751 | if (TEMPLATE_PARM_DESCENDANTS (index) == NULL_TREE | |
1752 | || (TEMPLATE_PARM_LEVEL (TEMPLATE_PARM_DESCENDANTS (index)) | |
93cdc044 | 1753 | != TEMPLATE_PARM_LEVEL (index) - levels)) |
f84b4be9 JM |
1754 | { |
1755 | tree decl | |
1756 | = build_decl (TREE_CODE (TEMPLATE_PARM_DECL (index)), | |
1757 | DECL_NAME (TEMPLATE_PARM_DECL (index)), | |
1758 | type); | |
1759 | tree t | |
1760 | = build_template_parm_index (TEMPLATE_PARM_IDX (index), | |
93cdc044 | 1761 | TEMPLATE_PARM_LEVEL (index) - levels, |
f84b4be9 JM |
1762 | TEMPLATE_PARM_ORIG_LEVEL (index), |
1763 | decl, type); | |
1764 | TEMPLATE_PARM_DESCENDANTS (index) = t; | |
cae40af6 JM |
1765 | |
1766 | /* Template template parameters need this. */ | |
1767 | DECL_TEMPLATE_PARMS (decl) | |
1768 | = DECL_TEMPLATE_PARMS (TEMPLATE_PARM_DECL (index)); | |
f84b4be9 JM |
1769 | } |
1770 | ||
1771 | return TEMPLATE_PARM_DESCENDANTS (index); | |
1772 | } | |
1773 | ||
8d08fdba | 1774 | /* Process information from new template parameter NEXT and append it to the |
5566b478 | 1775 | LIST being built. */ |
e92cc029 | 1776 | |
8d08fdba MS |
1777 | tree |
1778 | process_template_parm (list, next) | |
1779 | tree list, next; | |
1780 | { | |
1781 | tree parm; | |
1782 | tree decl = 0; | |
a292b002 | 1783 | tree defval; |
5566b478 | 1784 | int is_type, idx; |
f84b4be9 | 1785 | |
8d08fdba MS |
1786 | parm = next; |
1787 | my_friendly_assert (TREE_CODE (parm) == TREE_LIST, 259); | |
a292b002 MS |
1788 | defval = TREE_PURPOSE (parm); |
1789 | parm = TREE_VALUE (parm); | |
1790 | is_type = TREE_PURPOSE (parm) == class_type_node; | |
5566b478 MS |
1791 | |
1792 | if (list) | |
1793 | { | |
1794 | tree p = TREE_VALUE (tree_last (list)); | |
1795 | ||
1796 | if (TREE_CODE (p) == TYPE_DECL) | |
1797 | idx = TEMPLATE_TYPE_IDX (TREE_TYPE (p)); | |
73b0fce8 KL |
1798 | else if (TREE_CODE (p) == TEMPLATE_DECL) |
1799 | idx = TEMPLATE_TYPE_IDX (TREE_TYPE (DECL_TEMPLATE_RESULT (p))); | |
5566b478 | 1800 | else |
f84b4be9 | 1801 | idx = TEMPLATE_PARM_IDX (DECL_INITIAL (p)); |
5566b478 MS |
1802 | ++idx; |
1803 | } | |
1804 | else | |
1805 | idx = 0; | |
1806 | ||
8d08fdba MS |
1807 | if (!is_type) |
1808 | { | |
a292b002 | 1809 | my_friendly_assert (TREE_CODE (TREE_PURPOSE (parm)) == TREE_LIST, 260); |
8d08fdba | 1810 | /* is a const-param */ |
a292b002 | 1811 | parm = grokdeclarator (TREE_VALUE (parm), TREE_PURPOSE (parm), |
c11b6f21 | 1812 | PARM, 0, NULL_TREE); |
d490621d MM |
1813 | |
1814 | /* [temp.param] | |
1815 | ||
1816 | The top-level cv-qualifiers on the template-parameter are | |
1817 | ignored when determining its type. */ | |
1818 | TREE_TYPE (parm) = TYPE_MAIN_VARIANT (TREE_TYPE (parm)); | |
1819 | ||
8d08fdba MS |
1820 | /* A template parameter is not modifiable. */ |
1821 | TREE_READONLY (parm) = 1; | |
c91a56d2 | 1822 | if (IS_AGGR_TYPE (TREE_TYPE (parm)) |
410c2fba KL |
1823 | && TREE_CODE (TREE_TYPE (parm)) != TEMPLATE_TYPE_PARM |
1824 | && TREE_CODE (TREE_TYPE (parm)) != TYPENAME_TYPE) | |
8d08fdba | 1825 | { |
8251199e | 1826 | cp_error ("`%#T' is not a valid type for a template constant parameter", |
c91a56d2 MS |
1827 | TREE_TYPE (parm)); |
1828 | if (DECL_NAME (parm) == NULL_TREE) | |
8251199e | 1829 | error (" a template type parameter must begin with `class' or `typename'"); |
8d08fdba MS |
1830 | TREE_TYPE (parm) = void_type_node; |
1831 | } | |
37c46b43 MS |
1832 | else if (pedantic |
1833 | && (TREE_CODE (TREE_TYPE (parm)) == REAL_TYPE | |
1834 | || TREE_CODE (TREE_TYPE (parm)) == COMPLEX_TYPE)) | |
8251199e | 1835 | cp_pedwarn ("`%T' is not a valid type for a template constant parameter", |
eb66be0e | 1836 | TREE_TYPE (parm)); |
8d08fdba | 1837 | decl = build_decl (CONST_DECL, DECL_NAME (parm), TREE_TYPE (parm)); |
f84b4be9 JM |
1838 | DECL_INITIAL (parm) = DECL_INITIAL (decl) |
1839 | = build_template_parm_index (idx, processing_template_decl, | |
1840 | processing_template_decl, | |
1841 | decl, TREE_TYPE (parm)); | |
8d08fdba MS |
1842 | } |
1843 | else | |
1844 | { | |
73b0fce8 KL |
1845 | tree t; |
1846 | parm = TREE_VALUE (parm); | |
1847 | ||
1848 | if (parm && TREE_CODE (parm) == TEMPLATE_DECL) | |
1849 | { | |
33848bb0 | 1850 | t = make_aggr_type (TEMPLATE_TEMPLATE_PARM); |
73b0fce8 KL |
1851 | /* This is for distinguishing between real templates and template |
1852 | template parameters */ | |
1853 | TREE_TYPE (parm) = t; | |
1854 | TREE_TYPE (DECL_TEMPLATE_RESULT (parm)) = t; | |
1855 | decl = parm; | |
1856 | } | |
1857 | else | |
1858 | { | |
33848bb0 | 1859 | t = make_aggr_type (TEMPLATE_TYPE_PARM); |
73b0fce8 KL |
1860 | /* parm is either IDENTIFIER_NODE or NULL_TREE */ |
1861 | decl = build_decl (TYPE_DECL, parm, t); | |
1862 | } | |
1863 | ||
d2e5ee5c MS |
1864 | TYPE_NAME (t) = decl; |
1865 | TYPE_STUB_DECL (t) = decl; | |
a292b002 | 1866 | parm = decl; |
f84b4be9 JM |
1867 | TEMPLATE_TYPE_PARM_INDEX (t) |
1868 | = build_template_parm_index (idx, processing_template_decl, | |
1869 | processing_template_decl, | |
1870 | decl, TREE_TYPE (parm)); | |
8d08fdba | 1871 | } |
8ccc31eb | 1872 | SET_DECL_ARTIFICIAL (decl); |
cd9f6678 | 1873 | SET_DECL_TEMPLATE_PARM_P (decl); |
8d08fdba | 1874 | pushdecl (decl); |
a292b002 | 1875 | parm = build_tree_list (defval, parm); |
8d08fdba MS |
1876 | return chainon (list, parm); |
1877 | } | |
1878 | ||
1879 | /* The end of a template parameter list has been reached. Process the | |
1880 | tree list into a parameter vector, converting each parameter into a more | |
1881 | useful form. Type parameters are saved as IDENTIFIER_NODEs, and others | |
1882 | as PARM_DECLs. */ | |
1883 | ||
1884 | tree | |
1885 | end_template_parm_list (parms) | |
1886 | tree parms; | |
1887 | { | |
5566b478 | 1888 | int nparms; |
8d08fdba | 1889 | tree parm; |
5566b478 MS |
1890 | tree saved_parmlist = make_tree_vec (list_length (parms)); |
1891 | ||
5566b478 MS |
1892 | current_template_parms |
1893 | = tree_cons (build_int_2 (0, processing_template_decl), | |
1894 | saved_parmlist, current_template_parms); | |
8d08fdba | 1895 | |
91e490ab MM |
1896 | for (parm = parms, nparms = 0; |
1897 | parm; | |
1898 | parm = TREE_CHAIN (parm), nparms++) | |
66191c20 | 1899 | TREE_VEC_ELT (saved_parmlist, nparms) = parm; |
a292b002 | 1900 | |
67ffc812 MM |
1901 | --processing_template_parmlist; |
1902 | ||
8d08fdba MS |
1903 | return saved_parmlist; |
1904 | } | |
1905 | ||
5566b478 MS |
1906 | /* end_template_decl is called after a template declaration is seen. */ |
1907 | ||
8d08fdba | 1908 | void |
5566b478 | 1909 | end_template_decl () |
8d08fdba | 1910 | { |
386b8a85 JM |
1911 | reset_specialization (); |
1912 | ||
5156628f | 1913 | if (! processing_template_decl) |
73aad9b9 JM |
1914 | return; |
1915 | ||
5566b478 | 1916 | /* This matches the pushlevel in begin_template_parm_list. */ |
74b846e0 | 1917 | finish_scope (); |
8d08fdba | 1918 | |
5566b478 MS |
1919 | --processing_template_decl; |
1920 | current_template_parms = TREE_CHAIN (current_template_parms); | |
5566b478 | 1921 | } |
8d08fdba | 1922 | |
36a117a5 MM |
1923 | /* Given a template argument vector containing the template PARMS. |
1924 | The innermost PARMS are given first. */ | |
9a3b49ac MS |
1925 | |
1926 | tree | |
1927 | current_template_args () | |
5566b478 | 1928 | { |
36a117a5 | 1929 | tree header; |
b370501f | 1930 | tree args = NULL_TREE; |
36a117a5 | 1931 | int length = TMPL_PARMS_DEPTH (current_template_parms); |
98c1c668 JM |
1932 | int l = length; |
1933 | ||
36a117a5 MM |
1934 | /* If there is only one level of template parameters, we do not |
1935 | create a TREE_VEC of TREE_VECs. Instead, we return a single | |
1936 | TREE_VEC containing the arguments. */ | |
1937 | if (length > 1) | |
1938 | args = make_tree_vec (length); | |
1939 | ||
1940 | for (header = current_template_parms; header; header = TREE_CHAIN (header)) | |
8d08fdba | 1941 | { |
5566b478 | 1942 | tree a = copy_node (TREE_VALUE (header)); |
36a117a5 MM |
1943 | int i; |
1944 | ||
5566b478 | 1945 | TREE_TYPE (a) = NULL_TREE; |
36a117a5 | 1946 | for (i = TREE_VEC_LENGTH (a) - 1; i >= 0; --i) |
5566b478 | 1947 | { |
98c1c668 JM |
1948 | tree t = TREE_VEC_ELT (a, i); |
1949 | ||
36a117a5 | 1950 | /* T will be a list if we are called from within a |
98c1c668 JM |
1951 | begin/end_template_parm_list pair, but a vector directly |
1952 | if within a begin/end_member_template_processing pair. */ | |
1953 | if (TREE_CODE (t) == TREE_LIST) | |
1954 | { | |
1955 | t = TREE_VALUE (t); | |
1956 | ||
73b0fce8 KL |
1957 | if (TREE_CODE (t) == TYPE_DECL |
1958 | || TREE_CODE (t) == TEMPLATE_DECL) | |
98c1c668 JM |
1959 | t = TREE_TYPE (t); |
1960 | else | |
1961 | t = DECL_INITIAL (t); | |
36a117a5 | 1962 | TREE_VEC_ELT (a, i) = t; |
98c1c668 | 1963 | } |
5566b478 | 1964 | } |
36a117a5 MM |
1965 | |
1966 | if (length > 1) | |
1967 | TREE_VEC_ELT (args, --l) = a; | |
1968 | else | |
1969 | args = a; | |
8d08fdba MS |
1970 | } |
1971 | ||
9a3b49ac MS |
1972 | return args; |
1973 | } | |
75650646 | 1974 | |
e1467ff2 MM |
1975 | /* Return a TEMPLATE_DECL corresponding to DECL, using the indicated |
1976 | template PARMS. Used by push_template_decl below. */ | |
1977 | ||
75650646 MM |
1978 | static tree |
1979 | build_template_decl (decl, parms) | |
1980 | tree decl; | |
1981 | tree parms; | |
1982 | { | |
1983 | tree tmpl = build_lang_decl (TEMPLATE_DECL, DECL_NAME (decl), NULL_TREE); | |
1984 | DECL_TEMPLATE_PARMS (tmpl) = parms; | |
1985 | DECL_CONTEXT (tmpl) = DECL_CONTEXT (decl); | |
1986 | if (DECL_LANG_SPECIFIC (decl)) | |
1987 | { | |
4f1c5b7d | 1988 | DECL_VIRTUAL_CONTEXT (tmpl) = DECL_VIRTUAL_CONTEXT (decl); |
8f032717 MM |
1989 | DECL_STATIC_FUNCTION_P (tmpl) = DECL_STATIC_FUNCTION_P (decl); |
1990 | DECL_CONSTRUCTOR_P (tmpl) = DECL_CONSTRUCTOR_P (decl); | |
11f98788 | 1991 | DECL_NONCONVERTING_P (tmpl) = DECL_NONCONVERTING_P (decl); |
1f6e1acc AS |
1992 | DECL_ASSIGNMENT_OPERATOR_P (tmpl) = DECL_ASSIGNMENT_OPERATOR_P (decl); |
1993 | if (DECL_OVERLOADED_OPERATOR_P (decl)) | |
1994 | SET_OVERLOADED_OPERATOR_CODE (tmpl, | |
1995 | DECL_OVERLOADED_OPERATOR_P (decl)); | |
75650646 MM |
1996 | } |
1997 | ||
1998 | return tmpl; | |
1999 | } | |
2000 | ||
050367a3 MM |
2001 | struct template_parm_data |
2002 | { | |
6c30752f MM |
2003 | /* The level of the template parameters we are currently |
2004 | processing. */ | |
050367a3 | 2005 | int level; |
6c30752f MM |
2006 | |
2007 | /* The index of the specialization argument we are currently | |
2008 | processing. */ | |
2009 | int current_arg; | |
2010 | ||
2011 | /* An array whose size is the number of template parameters. The | |
2012 | elements are non-zero if the parameter has been used in any one | |
2013 | of the arguments processed so far. */ | |
050367a3 | 2014 | int* parms; |
6c30752f MM |
2015 | |
2016 | /* An array whose size is the number of template arguments. The | |
2017 | elements are non-zero if the argument makes use of template | |
2018 | parameters of this level. */ | |
2019 | int* arg_uses_template_parms; | |
050367a3 MM |
2020 | }; |
2021 | ||
2022 | /* Subroutine of push_template_decl used to see if each template | |
2023 | parameter in a partial specialization is used in the explicit | |
2024 | argument list. If T is of the LEVEL given in DATA (which is | |
2025 | treated as a template_parm_data*), then DATA->PARMS is marked | |
2026 | appropriately. */ | |
2027 | ||
2028 | static int | |
2029 | mark_template_parm (t, data) | |
2030 | tree t; | |
2031 | void* data; | |
2032 | { | |
2033 | int level; | |
2034 | int idx; | |
2035 | struct template_parm_data* tpd = (struct template_parm_data*) data; | |
2036 | ||
2037 | if (TREE_CODE (t) == TEMPLATE_PARM_INDEX) | |
2038 | { | |
2039 | level = TEMPLATE_PARM_LEVEL (t); | |
2040 | idx = TEMPLATE_PARM_IDX (t); | |
2041 | } | |
2042 | else | |
2043 | { | |
2044 | level = TEMPLATE_TYPE_LEVEL (t); | |
2045 | idx = TEMPLATE_TYPE_IDX (t); | |
2046 | } | |
2047 | ||
2048 | if (level == tpd->level) | |
6c30752f MM |
2049 | { |
2050 | tpd->parms[idx] = 1; | |
2051 | tpd->arg_uses_template_parms[tpd->current_arg] = 1; | |
2052 | } | |
050367a3 MM |
2053 | |
2054 | /* Return zero so that for_each_template_parm will continue the | |
2055 | traversal of the tree; we want to mark *every* template parm. */ | |
2056 | return 0; | |
2057 | } | |
2058 | ||
6c30752f MM |
2059 | /* Process the partial specialization DECL. */ |
2060 | ||
e9659ab0 | 2061 | static tree |
6c30752f MM |
2062 | process_partial_specialization (decl) |
2063 | tree decl; | |
2064 | { | |
2065 | tree type = TREE_TYPE (decl); | |
2066 | tree maintmpl = CLASSTYPE_TI_TEMPLATE (type); | |
2067 | tree specargs = CLASSTYPE_TI_ARGS (type); | |
f9a7ae04 | 2068 | tree inner_args = INNERMOST_TEMPLATE_ARGS (specargs); |
6c30752f MM |
2069 | tree inner_parms = INNERMOST_TEMPLATE_PARMS (current_template_parms); |
2070 | tree main_inner_parms = DECL_INNERMOST_TEMPLATE_PARMS (maintmpl); | |
2071 | int nargs = TREE_VEC_LENGTH (inner_args); | |
2072 | int ntparms = TREE_VEC_LENGTH (inner_parms); | |
2073 | int i; | |
2074 | int did_error_intro = 0; | |
6c30752f MM |
2075 | struct template_parm_data tpd; |
2076 | struct template_parm_data tpd2; | |
2077 | ||
6c30752f MM |
2078 | /* We check that each of the template parameters given in the |
2079 | partial specialization is used in the argument list to the | |
2080 | specialization. For example: | |
2081 | ||
2082 | template <class T> struct S; | |
2083 | template <class T> struct S<T*>; | |
2084 | ||
2085 | The second declaration is OK because `T*' uses the template | |
2086 | parameter T, whereas | |
2087 | ||
2088 | template <class T> struct S<int>; | |
2089 | ||
2090 | is no good. Even trickier is: | |
2091 | ||
2092 | template <class T> | |
2093 | struct S1 | |
2094 | { | |
2095 | template <class U> | |
2096 | struct S2; | |
2097 | template <class U> | |
2098 | struct S2<T>; | |
2099 | }; | |
2100 | ||
2101 | The S2<T> declaration is actually illegal; it is a | |
2102 | full-specialization. Of course, | |
2103 | ||
2104 | template <class U> | |
2105 | struct S2<T (*)(U)>; | |
2106 | ||
2107 | or some such would have been OK. */ | |
2108 | tpd.level = TMPL_PARMS_DEPTH (current_template_parms); | |
2109 | tpd.parms = alloca (sizeof (int) * ntparms); | |
1ddb2906 | 2110 | bzero ((PTR) tpd.parms, sizeof (int) * ntparms); |
6c30752f MM |
2111 | |
2112 | tpd.arg_uses_template_parms = alloca (sizeof (int) * nargs); | |
1ddb2906 | 2113 | bzero ((PTR) tpd.arg_uses_template_parms, sizeof (int) * nargs); |
6c30752f MM |
2114 | for (i = 0; i < nargs; ++i) |
2115 | { | |
2116 | tpd.current_arg = i; | |
2117 | for_each_template_parm (TREE_VEC_ELT (inner_args, i), | |
2118 | &mark_template_parm, | |
2119 | &tpd); | |
2120 | } | |
2121 | for (i = 0; i < ntparms; ++i) | |
2122 | if (tpd.parms[i] == 0) | |
2123 | { | |
2124 | /* One of the template parms was not used in the | |
f9a7ae04 | 2125 | specialization. */ |
6c30752f MM |
2126 | if (!did_error_intro) |
2127 | { | |
8251199e | 2128 | cp_error ("template parameters not used in partial specialization:"); |
6c30752f MM |
2129 | did_error_intro = 1; |
2130 | } | |
2131 | ||
8251199e | 2132 | cp_error (" `%D'", |
6c30752f MM |
2133 | TREE_VALUE (TREE_VEC_ELT (inner_parms, i))); |
2134 | } | |
2135 | ||
2136 | /* [temp.class.spec] | |
2137 | ||
2138 | The argument list of the specialization shall not be identical to | |
2139 | the implicit argument list of the primary template. */ | |
f9a7ae04 MM |
2140 | if (comp_template_args |
2141 | (inner_args, | |
2142 | INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (TREE_TYPE | |
2143 | (maintmpl))))) | |
8251199e | 2144 | cp_error ("partial specialization `%T' does not specialize any template arguments", type); |
6c30752f MM |
2145 | |
2146 | /* [temp.class.spec] | |
2147 | ||
2148 | A partially specialized non-type argument expression shall not | |
2149 | involve template parameters of the partial specialization except | |
2150 | when the argument expression is a simple identifier. | |
2151 | ||
2152 | The type of a template parameter corresponding to a specialized | |
2153 | non-type argument shall not be dependent on a parameter of the | |
2154 | specialization. */ | |
2155 | my_friendly_assert (nargs == DECL_NTPARMS (maintmpl), 0); | |
2156 | tpd2.parms = 0; | |
2157 | for (i = 0; i < nargs; ++i) | |
2158 | { | |
2159 | tree arg = TREE_VEC_ELT (inner_args, i); | |
2160 | if (/* These first two lines are the `non-type' bit. */ | |
2f939d94 | 2161 | !TYPE_P (arg) |
6c30752f MM |
2162 | && TREE_CODE (arg) != TEMPLATE_DECL |
2163 | /* This next line is the `argument expression is not just a | |
2164 | simple identifier' condition and also the `specialized | |
2165 | non-type argument' bit. */ | |
2166 | && TREE_CODE (arg) != TEMPLATE_PARM_INDEX) | |
2167 | { | |
2168 | if (tpd.arg_uses_template_parms[i]) | |
8251199e | 2169 | cp_error ("template argument `%E' involves template parameter(s)", arg); |
6c30752f MM |
2170 | else |
2171 | { | |
2172 | /* Look at the corresponding template parameter, | |
2173 | marking which template parameters its type depends | |
2174 | upon. */ | |
2175 | tree type = | |
2176 | TREE_TYPE (TREE_VALUE (TREE_VEC_ELT (main_inner_parms, | |
2177 | i))); | |
2178 | ||
2179 | if (!tpd2.parms) | |
2180 | { | |
2181 | /* We haven't yet initialized TPD2. Do so now. */ | |
2182 | tpd2.arg_uses_template_parms | |
2183 | = (int*) alloca (sizeof (int) * nargs); | |
104bf76a | 2184 | /* The number of parameters here is the number in the |
76a83782 RH |
2185 | main template, which, as checked in the assertion |
2186 | above, is NARGS. */ | |
6c30752f MM |
2187 | tpd2.parms = (int*) alloca (sizeof (int) * nargs); |
2188 | tpd2.level = | |
2189 | TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (maintmpl)); | |
2190 | } | |
2191 | ||
104bf76a | 2192 | /* Mark the template parameters. But this time, we're |
6c30752f MM |
2193 | looking for the template parameters of the main |
2194 | template, not in the specialization. */ | |
2195 | tpd2.current_arg = i; | |
2196 | tpd2.arg_uses_template_parms[i] = 0; | |
1ddb2906 | 2197 | bzero ((PTR) tpd2.parms, sizeof (int) * nargs); |
6c30752f MM |
2198 | for_each_template_parm (type, |
2199 | &mark_template_parm, | |
2200 | &tpd2); | |
2201 | ||
2202 | if (tpd2.arg_uses_template_parms [i]) | |
2203 | { | |
2204 | /* The type depended on some template parameters. | |
2205 | If they are fully specialized in the | |
2206 | specialization, that's OK. */ | |
2207 | int j; | |
2208 | for (j = 0; j < nargs; ++j) | |
2209 | if (tpd2.parms[j] != 0 | |
2210 | && tpd.arg_uses_template_parms [j]) | |
2211 | { | |
104bf76a | 2212 | cp_error ("type `%T' of template argument `%E' depends on template parameter(s)", |
6c30752f MM |
2213 | type, |
2214 | arg); | |
2215 | break; | |
2216 | } | |
2217 | } | |
2218 | } | |
2219 | } | |
2220 | } | |
2221 | ||
2222 | if (retrieve_specialization (maintmpl, specargs)) | |
2223 | /* We've already got this specialization. */ | |
2224 | return decl; | |
2225 | ||
d8b64f80 | 2226 | DECL_TEMPLATE_SPECIALIZATIONS (maintmpl) |
e1b3e07d MM |
2227 | = tree_cons (inner_args, inner_parms, |
2228 | DECL_TEMPLATE_SPECIALIZATIONS (maintmpl)); | |
6c30752f MM |
2229 | TREE_TYPE (DECL_TEMPLATE_SPECIALIZATIONS (maintmpl)) = type; |
2230 | return decl; | |
2231 | } | |
2232 | ||
6ba89f8e MM |
2233 | /* Check that a template declaration's use of default arguments is not |
2234 | invalid. Here, PARMS are the template parameters. IS_PRIMARY is | |
2235 | non-zero if DECL is the thing declared by a primary template. | |
2236 | IS_PARTIAL is non-zero if DECL is a partial specialization. */ | |
2237 | ||
2238 | static void | |
2239 | check_default_tmpl_args (decl, parms, is_primary, is_partial) | |
2240 | tree decl; | |
2241 | tree parms; | |
2242 | int is_primary; | |
2243 | int is_partial; | |
2244 | { | |
d8e178a0 | 2245 | const char *msg; |
66191c20 MM |
2246 | int last_level_to_check; |
2247 | tree parm_level; | |
6ba89f8e MM |
2248 | |
2249 | /* [temp.param] | |
2250 | ||
2251 | A default template-argument shall not be specified in a | |
2252 | function template declaration or a function template definition, nor | |
2253 | in the template-parameter-list of the definition of a member of a | |
2254 | class template. */ | |
2255 | ||
4f1c5b7d | 2256 | if (TREE_CODE (CP_DECL_CONTEXT (decl)) == FUNCTION_DECL) |
e0942dcd MM |
2257 | /* You can't have a function template declaration in a local |
2258 | scope, nor you can you define a member of a class template in a | |
2259 | local scope. */ | |
2260 | return; | |
2261 | ||
6ba89f8e MM |
2262 | if (current_class_type |
2263 | && !TYPE_BEING_DEFINED (current_class_type) | |
3d7de1fa | 2264 | && DECL_LANG_SPECIFIC (decl) |
5937a6f9 MM |
2265 | /* If this is either a friend defined in the scope of the class |
2266 | or a member function. */ | |
4f1c5b7d MM |
2267 | && ((DECL_CONTEXT (decl) |
2268 | && same_type_p (DECL_CONTEXT (decl), current_class_type)) | |
2269 | || (DECL_FRIEND_CONTEXT (decl) | |
2270 | && same_type_p (DECL_FRIEND_CONTEXT (decl), | |
2271 | current_class_type))) | |
5937a6f9 MM |
2272 | /* And, if it was a member function, it really was defined in |
2273 | the scope of the class. */ | |
2274 | && (!DECL_FUNCTION_MEMBER_P (decl) || DECL_DEFINED_IN_CLASS_P (decl))) | |
6ba89f8e | 2275 | /* We already checked these parameters when the template was |
5937a6f9 MM |
2276 | declared, so there's no need to do it again now. This function |
2277 | was defined in class scope, but we're processing it's body now | |
2278 | that the class is complete. */ | |
6ba89f8e MM |
2279 | return; |
2280 | ||
66191c20 MM |
2281 | /* [temp.param] |
2282 | ||
2283 | If a template-parameter has a default template-argument, all | |
2284 | subsequent template-parameters shall have a default | |
2285 | template-argument supplied. */ | |
2286 | for (parm_level = parms; parm_level; parm_level = TREE_CHAIN (parm_level)) | |
2287 | { | |
2288 | tree inner_parms = TREE_VALUE (parm_level); | |
2289 | int ntparms = TREE_VEC_LENGTH (inner_parms); | |
2290 | int seen_def_arg_p = 0; | |
2291 | int i; | |
2292 | ||
2293 | for (i = 0; i < ntparms; ++i) | |
2294 | { | |
2295 | tree parm = TREE_VEC_ELT (inner_parms, i); | |
2296 | if (TREE_PURPOSE (parm)) | |
2297 | seen_def_arg_p = 1; | |
2298 | else if (seen_def_arg_p) | |
2299 | { | |
2300 | cp_error ("no default argument for `%D'", TREE_VALUE (parm)); | |
2301 | /* For better subsequent error-recovery, we indicate that | |
2302 | there should have been a default argument. */ | |
2303 | TREE_PURPOSE (parm) = error_mark_node; | |
2304 | } | |
2305 | } | |
2306 | } | |
2307 | ||
6ba89f8e MM |
2308 | if (TREE_CODE (decl) != TYPE_DECL || is_partial || !is_primary) |
2309 | /* For an ordinary class template, default template arguments are | |
2310 | allowed at the innermost level, e.g.: | |
2311 | template <class T = int> | |
2312 | struct S {}; | |
2313 | but, in a partial specialization, they're not allowed even | |
2314 | there, as we have in [temp.class.spec]: | |
2315 | ||
2316 | The template parameter list of a specialization shall not | |
2317 | contain default template argument values. | |
2318 | ||
2319 | So, for a partial specialization, or for a function template, | |
2320 | we look at all of them. */ | |
2321 | ; | |
2322 | else | |
2323 | /* But, for a primary class template that is not a partial | |
2324 | specialization we look at all template parameters except the | |
2325 | innermost ones. */ | |
2326 | parms = TREE_CHAIN (parms); | |
2327 | ||
2328 | /* Figure out what error message to issue. */ | |
2329 | if (TREE_CODE (decl) == FUNCTION_DECL) | |
2330 | msg = "default argument for template parameter in function template `%D'"; | |
2331 | else if (is_partial) | |
2332 | msg = "default argument in partial specialization `%D'"; | |
2333 | else | |
2334 | msg = "default argument for template parameter for class enclosing `%D'"; | |
2335 | ||
2336 | if (current_class_type && TYPE_BEING_DEFINED (current_class_type)) | |
2337 | /* If we're inside a class definition, there's no need to | |
104bf76a | 2338 | examine the parameters to the class itself. On the one |
6ba89f8e MM |
2339 | hand, they will be checked when the class is defined, and, |
2340 | on the other, default arguments are legal in things like: | |
2341 | template <class T = double> | |
2342 | struct S { template <class U> void f(U); }; | |
2343 | Here the default argument for `S' has no bearing on the | |
2344 | declaration of `f'. */ | |
2345 | last_level_to_check = template_class_depth (current_class_type) + 1; | |
2346 | else | |
2347 | /* Check everything. */ | |
2348 | last_level_to_check = 0; | |
2349 | ||
66191c20 MM |
2350 | for (parm_level = parms; |
2351 | parm_level && TMPL_PARMS_DEPTH (parm_level) >= last_level_to_check; | |
2352 | parm_level = TREE_CHAIN (parm_level)) | |
6ba89f8e | 2353 | { |
66191c20 MM |
2354 | tree inner_parms = TREE_VALUE (parm_level); |
2355 | int i; | |
2356 | int ntparms; | |
6ba89f8e MM |
2357 | |
2358 | ntparms = TREE_VEC_LENGTH (inner_parms); | |
2359 | for (i = 0; i < ntparms; ++i) | |
2360 | if (TREE_PURPOSE (TREE_VEC_ELT (inner_parms, i))) | |
2361 | { | |
2362 | if (msg) | |
2363 | { | |
2364 | cp_error (msg, decl); | |
2365 | msg = 0; | |
2366 | } | |
2367 | ||
2368 | /* Clear out the default argument so that we are not | |
2369 | confused later. */ | |
2370 | TREE_PURPOSE (TREE_VEC_ELT (inner_parms, i)) = NULL_TREE; | |
2371 | } | |
2372 | ||
2373 | /* At this point, if we're still interested in issuing messages, | |
2374 | they must apply to classes surrounding the object declared. */ | |
2375 | if (msg) | |
2376 | msg = "default argument for template parameter for class enclosing `%D'"; | |
2377 | } | |
2378 | } | |
2379 | ||
3ac3d9ea | 2380 | /* Creates a TEMPLATE_DECL for the indicated DECL using the template |
f84b4be9 JM |
2381 | parameters given by current_template_args, or reuses a |
2382 | previously existing one, if appropriate. Returns the DECL, or an | |
6757edfe MM |
2383 | equivalent one, if it is replaced via a call to duplicate_decls. |
2384 | ||
2385 | If IS_FRIEND is non-zero, DECL is a friend declaration. */ | |
3ac3d9ea MM |
2386 | |
2387 | tree | |
6757edfe | 2388 | push_template_decl_real (decl, is_friend) |
9a3b49ac | 2389 | tree decl; |
6757edfe | 2390 | int is_friend; |
9a3b49ac MS |
2391 | { |
2392 | tree tmpl; | |
f84b4be9 | 2393 | tree args; |
9a3b49ac | 2394 | tree info; |
f84b4be9 JM |
2395 | tree ctx; |
2396 | int primary; | |
6ba89f8e | 2397 | int is_partial; |
cfe507be | 2398 | int new_template_p = 0; |
6ba89f8e MM |
2399 | |
2400 | /* See if this is a partial specialization. */ | |
9188c363 | 2401 | is_partial = (DECL_IMPLICIT_TYPEDEF_P (decl) |
6ba89f8e | 2402 | && TREE_CODE (TREE_TYPE (decl)) != ENUMERAL_TYPE |
370af2d5 | 2403 | && CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_TYPE (decl))); |
6757edfe MM |
2404 | |
2405 | is_friend |= (TREE_CODE (decl) == FUNCTION_DECL && DECL_FRIEND_P (decl)); | |
f84b4be9 JM |
2406 | |
2407 | if (is_friend) | |
2408 | /* For a friend, we want the context of the friend function, not | |
2409 | the type of which it is a friend. */ | |
2410 | ctx = DECL_CONTEXT (decl); | |
4f1c5b7d MM |
2411 | else if (CP_DECL_CONTEXT (decl) |
2412 | && TREE_CODE (CP_DECL_CONTEXT (decl)) != NAMESPACE_DECL) | |
f84b4be9 JM |
2413 | /* In the case of a virtual function, we want the class in which |
2414 | it is defined. */ | |
4f1c5b7d | 2415 | ctx = CP_DECL_CONTEXT (decl); |
f84b4be9 JM |
2416 | else |
2417 | /* Otherwise, if we're currently definining some class, the DECL | |
2418 | is assumed to be a member of the class. */ | |
9188c363 | 2419 | ctx = current_scope (); |
f84b4be9 | 2420 | |
2c73f9f5 ML |
2421 | if (ctx && TREE_CODE (ctx) == NAMESPACE_DECL) |
2422 | ctx = NULL_TREE; | |
2423 | ||
2424 | if (!DECL_CONTEXT (decl)) | |
cb0dbb9a | 2425 | DECL_CONTEXT (decl) = FROB_CONTEXT (current_namespace); |
2c73f9f5 | 2426 | |
6ba89f8e | 2427 | /* See if this is a primary template. */ |
74b846e0 | 2428 | primary = template_parm_scope_p (); |
9a3b49ac | 2429 | |
83566abf JM |
2430 | if (primary) |
2431 | { | |
2432 | if (current_lang_name == lang_name_c) | |
8251199e | 2433 | cp_error ("template with C linkage"); |
4ce3d537 MM |
2434 | else if (TREE_CODE (decl) == TYPE_DECL |
2435 | && ANON_AGGRNAME_P (DECL_NAME (decl))) | |
8251199e | 2436 | cp_error ("template class without a name"); |
2aaf816d JM |
2437 | else if ((DECL_IMPLICIT_TYPEDEF_P (decl) |
2438 | && CLASS_TYPE_P (TREE_TYPE (decl))) | |
2439 | || (TREE_CODE (decl) == VAR_DECL && ctx && CLASS_TYPE_P (ctx)) | |
2440 | || TREE_CODE (decl) == FUNCTION_DECL) | |
2441 | /* OK */; | |
2442 | else | |
4ce3d537 | 2443 | cp_error ("template declaration of `%#D'", decl); |
83566abf JM |
2444 | } |
2445 | ||
6ba89f8e MM |
2446 | /* Check to see that the rules regarding the use of default |
2447 | arguments are not being violated. */ | |
2448 | check_default_tmpl_args (decl, current_template_parms, | |
2449 | primary, is_partial); | |
73aad9b9 | 2450 | |
6ba89f8e MM |
2451 | if (is_partial) |
2452 | return process_partial_specialization (decl); | |
d32789d8 | 2453 | |
9a3b49ac MS |
2454 | args = current_template_args (); |
2455 | ||
f84b4be9 JM |
2456 | if (!ctx |
2457 | || TREE_CODE (ctx) == FUNCTION_DECL | |
2458 | || TYPE_BEING_DEFINED (ctx) | |
2459 | || (is_friend && !DECL_TEMPLATE_INFO (decl))) | |
8d08fdba | 2460 | { |
75650646 | 2461 | if (DECL_LANG_SPECIFIC (decl) |
f84b4be9 JM |
2462 | && DECL_TEMPLATE_INFO (decl) |
2463 | && DECL_TI_TEMPLATE (decl)) | |
2464 | tmpl = DECL_TI_TEMPLATE (decl); | |
1c10870d AS |
2465 | /* If DECL is a TYPE_DECL for a class-template, then there won't |
2466 | be DECL_LANG_SPECIFIC. The information equivalent to | |
2467 | DECL_TEMPLATE_INFO is found in TYPE_TEMPLATE_INFO instead. */ | |
2468 | else if (DECL_IMPLICIT_TYPEDEF_P (decl) | |
2469 | && TYPE_TEMPLATE_INFO (TREE_TYPE (decl)) | |
2470 | && TYPE_TI_TEMPLATE (TREE_TYPE (decl))) | |
2471 | { | |
2472 | /* Since a template declaration already existed for this | |
2473 | class-type, we must be redeclaring it here. Make sure | |
2474 | that the redeclaration is legal. */ | |
2475 | redeclare_class_template (TREE_TYPE (decl), | |
2476 | current_template_parms); | |
2477 | /* We don't need to create a new TEMPLATE_DECL; just use the | |
2478 | one we already had. */ | |
2479 | tmpl = TYPE_TI_TEMPLATE (TREE_TYPE (decl)); | |
2480 | } | |
f84b4be9 | 2481 | else |
786b5245 | 2482 | { |
f84b4be9 | 2483 | tmpl = build_template_decl (decl, current_template_parms); |
cfe507be MM |
2484 | new_template_p = 1; |
2485 | ||
f84b4be9 JM |
2486 | if (DECL_LANG_SPECIFIC (decl) |
2487 | && DECL_TEMPLATE_SPECIALIZATION (decl)) | |
2488 | { | |
2489 | /* A specialization of a member template of a template | |
2490 | class. */ | |
2491 | SET_DECL_TEMPLATE_SPECIALIZATION (tmpl); | |
2492 | DECL_TEMPLATE_INFO (tmpl) = DECL_TEMPLATE_INFO (decl); | |
2493 | DECL_TEMPLATE_INFO (decl) = NULL_TREE; | |
2494 | } | |
786b5245 | 2495 | } |
8d08fdba MS |
2496 | } |
2497 | else | |
2498 | { | |
e1a5ccf7 | 2499 | tree a, t, current, parms; |
ba4f4e5d | 2500 | int i; |
6633d636 | 2501 | |
6b9ab5cc MM |
2502 | if (TREE_CODE (decl) == TYPE_DECL) |
2503 | { | |
ed44da02 MM |
2504 | if ((IS_AGGR_TYPE_CODE (TREE_CODE (TREE_TYPE (decl))) |
2505 | || TREE_CODE (TREE_TYPE (decl)) == ENUMERAL_TYPE) | |
2506 | && TYPE_TEMPLATE_INFO (TREE_TYPE (decl)) | |
2507 | && TYPE_TI_TEMPLATE (TREE_TYPE (decl))) | |
2508 | tmpl = TYPE_TI_TEMPLATE (TREE_TYPE (decl)); | |
6b9ab5cc MM |
2509 | else |
2510 | { | |
8251199e | 2511 | cp_error ("`%D' does not declare a template type", decl); |
6b9ab5cc MM |
2512 | return decl; |
2513 | } | |
2514 | } | |
fc378698 | 2515 | else if (! DECL_TEMPLATE_INFO (decl)) |
c91a56d2 | 2516 | { |
8251199e | 2517 | cp_error ("template definition of non-template `%#D'", decl); |
3ac3d9ea | 2518 | return decl; |
c91a56d2 | 2519 | } |
8d08fdba | 2520 | else |
5566b478 | 2521 | tmpl = DECL_TI_TEMPLATE (decl); |
98c1c668 | 2522 | |
e1a5ccf7 JM |
2523 | if (is_member_template (tmpl) |
2524 | && DECL_FUNCTION_TEMPLATE_P (tmpl) | |
2525 | && DECL_TEMPLATE_INFO (decl) && DECL_TI_ARGS (decl) | |
2526 | && DECL_TEMPLATE_SPECIALIZATION (decl)) | |
98c1c668 | 2527 | { |
e1a5ccf7 JM |
2528 | tree new_tmpl; |
2529 | ||
2530 | /* The declaration is a specialization of a member | |
2531 | template, declared outside the class. Therefore, the | |
2532 | innermost template arguments will be NULL, so we | |
2533 | replace them with the arguments determined by the | |
2534 | earlier call to check_explicit_specialization. */ | |
2535 | args = DECL_TI_ARGS (decl); | |
2536 | ||
2537 | new_tmpl | |
2538 | = build_template_decl (decl, current_template_parms); | |
2539 | DECL_TEMPLATE_RESULT (new_tmpl) = decl; | |
2540 | TREE_TYPE (new_tmpl) = TREE_TYPE (decl); | |
2541 | DECL_TI_TEMPLATE (decl) = new_tmpl; | |
2542 | SET_DECL_TEMPLATE_SPECIALIZATION (new_tmpl); | |
e1b3e07d MM |
2543 | DECL_TEMPLATE_INFO (new_tmpl) |
2544 | = tree_cons (tmpl, args, NULL_TREE); | |
e1a5ccf7 | 2545 | |
f9a7ae04 MM |
2546 | register_specialization (new_tmpl, |
2547 | most_general_template (tmpl), | |
2548 | args); | |
e1a5ccf7 | 2549 | return decl; |
98c1c668 | 2550 | } |
98c1c668 | 2551 | |
e1a5ccf7 | 2552 | /* Make sure the template headers we got make sense. */ |
6633d636 | 2553 | |
e1a5ccf7 JM |
2554 | parms = DECL_TEMPLATE_PARMS (tmpl); |
2555 | i = TMPL_PARMS_DEPTH (parms); | |
2556 | if (TMPL_ARGS_DEPTH (args) != i) | |
98c1c668 | 2557 | { |
e1a5ccf7 JM |
2558 | cp_error ("expected %d levels of template parms for `%#D', got %d", |
2559 | i, decl, TMPL_ARGS_DEPTH (args)); | |
98c1c668 | 2560 | } |
e1a5ccf7 JM |
2561 | else |
2562 | for (current = decl; i > 0; --i, parms = TREE_CHAIN (parms)) | |
2563 | { | |
2564 | a = TMPL_ARGS_LEVEL (args, i); | |
2565 | t = INNERMOST_TEMPLATE_PARMS (parms); | |
2566 | ||
2567 | if (TREE_VEC_LENGTH (t) != TREE_VEC_LENGTH (a)) | |
2568 | { | |
2569 | if (current == decl) | |
2570 | cp_error ("got %d template parameters for `%#D'", | |
2571 | TREE_VEC_LENGTH (a), decl); | |
2572 | else | |
2573 | cp_error ("got %d template parameters for `%#T'", | |
2574 | TREE_VEC_LENGTH (a), current); | |
2575 | cp_error (" but %d required", TREE_VEC_LENGTH (t)); | |
2576 | } | |
98c1c668 | 2577 | |
e1a5ccf7 JM |
2578 | /* Perhaps we should also check that the parms are used in the |
2579 | appropriate qualifying scopes in the declarator? */ | |
6633d636 | 2580 | |
e1a5ccf7 JM |
2581 | if (current == decl) |
2582 | current = ctx; | |
2583 | else | |
2584 | current = TYPE_CONTEXT (current); | |
2585 | } | |
5566b478 | 2586 | } |
8d08fdba | 2587 | |
5566b478 MS |
2588 | DECL_TEMPLATE_RESULT (tmpl) = decl; |
2589 | TREE_TYPE (tmpl) = TREE_TYPE (decl); | |
8d08fdba | 2590 | |
36a117a5 MM |
2591 | /* Push template declarations for global functions and types. Note |
2592 | that we do not try to push a global template friend declared in a | |
2593 | template class; such a thing may well depend on the template | |
39c01e4c | 2594 | parameters of the class. */ |
cfe507be | 2595 | if (new_template_p && !ctx |
36a117a5 | 2596 | && !(is_friend && template_class_depth (current_class_type) > 0)) |
2c73f9f5 | 2597 | tmpl = pushdecl_namespace_level (tmpl); |
8d08fdba | 2598 | |
5566b478 | 2599 | if (primary) |
6757edfe | 2600 | DECL_PRIMARY_TEMPLATE (tmpl) = tmpl; |
5566b478 | 2601 | |
e1b3e07d | 2602 | info = tree_cons (tmpl, args, NULL_TREE); |
5566b478 | 2603 | |
9188c363 | 2604 | if (DECL_IMPLICIT_TYPEDEF_P (decl)) |
8d08fdba | 2605 | { |
ed44da02 MM |
2606 | SET_TYPE_TEMPLATE_INFO (TREE_TYPE (tmpl), info); |
2607 | if ((!ctx || TREE_CODE (ctx) != FUNCTION_DECL) | |
2608 | && TREE_CODE (TREE_TYPE (decl)) != ENUMERAL_TYPE) | |
75650646 | 2609 | DECL_NAME (decl) = classtype_mangled_name (TREE_TYPE (decl)); |
51c184be | 2610 | } |
2aaf816d | 2611 | else if (DECL_LANG_SPECIFIC (decl)) |
5566b478 | 2612 | DECL_TEMPLATE_INFO (decl) = info; |
3ac3d9ea MM |
2613 | |
2614 | return DECL_TEMPLATE_RESULT (tmpl); | |
8d08fdba MS |
2615 | } |
2616 | ||
6757edfe MM |
2617 | tree |
2618 | push_template_decl (decl) | |
2619 | tree decl; | |
2620 | { | |
2621 | return push_template_decl_real (decl, 0); | |
2622 | } | |
2623 | ||
2624 | /* Called when a class template TYPE is redeclared with the indicated | |
2625 | template PARMS, e.g.: | |
7fe6899f MM |
2626 | |
2627 | template <class T> struct S; | |
2628 | template <class T> struct S {}; */ | |
2629 | ||
2630 | void | |
6757edfe | 2631 | redeclare_class_template (type, parms) |
7fe6899f | 2632 | tree type; |
6757edfe | 2633 | tree parms; |
7fe6899f | 2634 | { |
3d7de1fa | 2635 | tree tmpl; |
6757edfe | 2636 | tree tmpl_parms; |
7fe6899f MM |
2637 | int i; |
2638 | ||
3d7de1fa MM |
2639 | if (!TYPE_TEMPLATE_INFO (type)) |
2640 | { | |
2641 | cp_error ("`%T' is not a template type", type); | |
2642 | return; | |
2643 | } | |
2644 | ||
2645 | tmpl = TYPE_TI_TEMPLATE (type); | |
7fe6899f MM |
2646 | if (!PRIMARY_TEMPLATE_P (tmpl)) |
2647 | /* The type is nested in some template class. Nothing to worry | |
2648 | about here; there are no new template parameters for the nested | |
2649 | type. */ | |
2650 | return; | |
2651 | ||
6757edfe MM |
2652 | parms = INNERMOST_TEMPLATE_PARMS (parms); |
2653 | tmpl_parms = DECL_INNERMOST_TEMPLATE_PARMS (tmpl); | |
2654 | ||
7fe6899f MM |
2655 | if (TREE_VEC_LENGTH (parms) != TREE_VEC_LENGTH (tmpl_parms)) |
2656 | { | |
8251199e JM |
2657 | cp_error_at ("previous declaration `%D'", tmpl); |
2658 | cp_error ("used %d template parameter%s instead of %d", | |
7fe6899f MM |
2659 | TREE_VEC_LENGTH (tmpl_parms), |
2660 | TREE_VEC_LENGTH (tmpl_parms) == 1 ? "" : "s", | |
2661 | TREE_VEC_LENGTH (parms)); | |
2662 | return; | |
2663 | } | |
2664 | ||
2665 | for (i = 0; i < TREE_VEC_LENGTH (tmpl_parms); ++i) | |
2666 | { | |
2667 | tree tmpl_parm = TREE_VALUE (TREE_VEC_ELT (tmpl_parms, i)); | |
2668 | tree parm = TREE_VALUE (TREE_VEC_ELT (parms, i)); | |
2669 | tree tmpl_default = TREE_PURPOSE (TREE_VEC_ELT (tmpl_parms, i)); | |
2670 | tree parm_default = TREE_PURPOSE (TREE_VEC_ELT (parms, i)); | |
2671 | ||
2672 | if (TREE_CODE (tmpl_parm) != TREE_CODE (parm)) | |
2673 | { | |
8251199e JM |
2674 | cp_error_at ("template parameter `%#D'", tmpl_parm); |
2675 | cp_error ("redeclared here as `%#D'", parm); | |
7fe6899f MM |
2676 | return; |
2677 | } | |
2678 | ||
2679 | if (tmpl_default != NULL_TREE && parm_default != NULL_TREE) | |
2680 | { | |
2681 | /* We have in [temp.param]: | |
2682 | ||
2683 | A template-parameter may not be given default arguments | |
2684 | by two different declarations in the same scope. */ | |
8251199e JM |
2685 | cp_error ("redefinition of default argument for `%#D'", parm); |
2686 | cp_error_at (" original definition appeared here", tmpl_parm); | |
7fe6899f MM |
2687 | return; |
2688 | } | |
2689 | ||
2690 | if (parm_default != NULL_TREE) | |
2691 | /* Update the previous template parameters (which are the ones | |
2692 | that will really count) with the new default value. */ | |
2693 | TREE_PURPOSE (TREE_VEC_ELT (tmpl_parms, i)) = parm_default; | |
7ce74c5e MM |
2694 | else if (tmpl_default != NULL_TREE) |
2695 | /* Update the new parameters, too; they'll be used as the | |
2696 | parameters for any members. */ | |
2697 | TREE_PURPOSE (TREE_VEC_ELT (parms, i)) = tmpl_default; | |
7fe6899f MM |
2698 | } |
2699 | } | |
75650646 | 2700 | |
75650646 MM |
2701 | /* Attempt to convert the non-type template parameter EXPR to the |
2702 | indicated TYPE. If the conversion is successful, return the | |
2703 | converted value. If the conversion is unsuccesful, return | |
2704 | NULL_TREE if we issued an error message, or error_mark_node if we | |
2705 | did not. We issue error messages for out-and-out bad template | |
2706 | parameters, but not simply because the conversion failed, since we | |
2707 | might be just trying to do argument deduction. By the time this | |
2708 | function is called, neither TYPE nor EXPR may make use of template | |
2709 | parameters. */ | |
2710 | ||
2711 | static tree | |
e1467ff2 | 2712 | convert_nontype_argument (type, expr) |
75650646 MM |
2713 | tree type; |
2714 | tree expr; | |
2715 | { | |
2716 | tree expr_type = TREE_TYPE (expr); | |
2717 | ||
2718 | /* A template-argument for a non-type, non-template | |
2719 | template-parameter shall be one of: | |
2720 | ||
2721 | --an integral constant-expression of integral or enumeration | |
2722 | type; or | |
2723 | ||
2724 | --the name of a non-type template-parameter; or | |
2725 | ||
2726 | --the name of an object or function with external linkage, | |
2727 | including function templates and function template-ids but | |
86052cc3 | 2728 | excluding non-static class members, expressed as id-expression; |
75650646 MM |
2729 | or |
2730 | ||
2731 | --the address of an object or function with external linkage, | |
2732 | including function templates and function template-ids but | |
2733 | excluding non-static class members, expressed as & id-expression | |
2734 | where the & is optional if the name refers to a function or | |
2735 | array; or | |
2736 | ||
2737 | --a pointer to member expressed as described in _expr.unary.op_. */ | |
2738 | ||
638dd8fc MM |
2739 | /* An integral constant-expression can include const variables or |
2740 | enumerators. Simplify things by folding them to their values, | |
2741 | unless we're about to bind the declaration to a reference | |
2742 | parameter. */ | |
fc611ce0 | 2743 | if (INTEGRAL_TYPE_P (expr_type) |
638dd8fc | 2744 | && TREE_CODE (type) != REFERENCE_TYPE) |
86052cc3 JM |
2745 | expr = decl_constant_value (expr); |
2746 | ||
7bf2682f MM |
2747 | if (is_overloaded_fn (expr)) |
2748 | /* OK for now. We'll check that it has external linkage later. | |
2749 | Check this first since if expr_type is the unknown_type_node | |
2750 | we would otherwise complain below. */ | |
2751 | ; | |
e08a8f45 MM |
2752 | else if (TYPE_PTRMEM_P (expr_type) |
2753 | || TYPE_PTRMEMFUNC_P (expr_type)) | |
2754 | { | |
2755 | if (TREE_CODE (expr) != PTRMEM_CST) | |
2756 | goto bad_argument; | |
2757 | } | |
f3400fe2 | 2758 | else if (TYPE_PTR_P (expr_type) |
e08a8f45 | 2759 | || TYPE_PTRMEM_P (expr_type) |
f3400fe2 JM |
2760 | || TREE_CODE (expr_type) == ARRAY_TYPE |
2761 | || TREE_CODE (type) == REFERENCE_TYPE | |
75650646 MM |
2762 | /* If expr is the address of an overloaded function, we |
2763 | will get the unknown_type_node at this point. */ | |
2764 | || expr_type == unknown_type_node) | |
2765 | { | |
2766 | tree referent; | |
49bf0d6f MM |
2767 | tree e = expr; |
2768 | STRIP_NOPS (e); | |
75650646 | 2769 | |
0dc09a61 MM |
2770 | if (TREE_CODE (expr_type) == ARRAY_TYPE |
2771 | || (TREE_CODE (type) == REFERENCE_TYPE | |
2772 | && TREE_CODE (e) != ADDR_EXPR)) | |
f3400fe2 JM |
2773 | referent = e; |
2774 | else | |
75650646 | 2775 | { |
f3400fe2 JM |
2776 | if (TREE_CODE (e) != ADDR_EXPR) |
2777 | { | |
2778 | bad_argument: | |
2779 | cp_error ("`%E' is not a valid template argument", expr); | |
e08a8f45 MM |
2780 | if (TYPE_PTR_P (expr_type)) |
2781 | { | |
2782 | if (TREE_CODE (TREE_TYPE (expr_type)) == FUNCTION_TYPE) | |
2783 | cp_error ("it must be the address of a function with external linkage"); | |
2784 | else | |
2785 | cp_error ("it must be the address of an object with external linkage"); | |
2786 | } | |
2787 | else if (TYPE_PTRMEM_P (expr_type) | |
2788 | || TYPE_PTRMEMFUNC_P (expr_type)) | |
2789 | cp_error ("it must be a pointer-to-member of the form `&X::Y'"); | |
2790 | ||
f3400fe2 JM |
2791 | return NULL_TREE; |
2792 | } | |
2793 | ||
2794 | referent = TREE_OPERAND (e, 0); | |
2795 | STRIP_NOPS (referent); | |
75650646 MM |
2796 | } |
2797 | ||
75650646 MM |
2798 | if (TREE_CODE (referent) == STRING_CST) |
2799 | { | |
b4f4233d | 2800 | cp_error ("string literal %E is not a valid template argument because it is the address of an object with static linkage", |
75650646 | 2801 | referent); |
75650646 MM |
2802 | return NULL_TREE; |
2803 | } | |
2804 | ||
2805 | if (is_overloaded_fn (referent)) | |
2806 | /* We'll check that it has external linkage later. */ | |
2807 | ; | |
2808 | else if (TREE_CODE (referent) != VAR_DECL) | |
2809 | goto bad_argument; | |
2810 | else if (!TREE_PUBLIC (referent)) | |
2811 | { | |
8251199e | 2812 | cp_error ("address of non-extern `%E' cannot be used as template argument", referent); |
75650646 MM |
2813 | return error_mark_node; |
2814 | } | |
2815 | } | |
f3400fe2 JM |
2816 | else if (INTEGRAL_TYPE_P (expr_type) |
2817 | || TYPE_PTRMEM_P (expr_type) | |
2818 | || TYPE_PTRMEMFUNC_P (expr_type) | |
2819 | /* The next two are g++ extensions. */ | |
2820 | || TREE_CODE (expr_type) == REAL_TYPE | |
2821 | || TREE_CODE (expr_type) == COMPLEX_TYPE) | |
75650646 | 2822 | { |
f3400fe2 JM |
2823 | if (! TREE_CONSTANT (expr)) |
2824 | { | |
2825 | non_constant: | |
2826 | cp_error ("non-constant `%E' cannot be used as template argument", | |
2827 | expr); | |
2828 | return NULL_TREE; | |
2829 | } | |
75650646 | 2830 | } |
75650646 MM |
2831 | else |
2832 | { | |
8251199e | 2833 | cp_error ("object `%E' cannot be used as template argument", expr); |
75650646 MM |
2834 | return NULL_TREE; |
2835 | } | |
2836 | ||
2837 | switch (TREE_CODE (type)) | |
2838 | { | |
2839 | case INTEGER_TYPE: | |
2840 | case BOOLEAN_TYPE: | |
2841 | case ENUMERAL_TYPE: | |
2842 | /* For a non-type template-parameter of integral or enumeration | |
2843 | type, integral promotions (_conv.prom_) and integral | |
2844 | conversions (_conv.integral_) are applied. */ | |
2845 | if (!INTEGRAL_TYPE_P (expr_type)) | |
2846 | return error_mark_node; | |
2847 | ||
2848 | /* It's safe to call digest_init in this case; we know we're | |
2849 | just converting one integral constant expression to another. */ | |
db02b6b9 | 2850 | expr = digest_init (type, expr, (tree*) 0); |
75650646 | 2851 | |
db02b6b9 | 2852 | if (TREE_CODE (expr) != INTEGER_CST) |
f3400fe2 | 2853 | /* Curiously, some TREE_CONSTANT integral expressions do not |
db02b6b9 MM |
2854 | simplify to integer constants. For example, `3 % 0', |
2855 | remains a TRUNC_MOD_EXPR. */ | |
2856 | goto non_constant; | |
2857 | ||
2858 | return expr; | |
2859 | ||
abff8e06 JM |
2860 | case REAL_TYPE: |
2861 | case COMPLEX_TYPE: | |
2862 | /* These are g++ extensions. */ | |
2863 | if (TREE_CODE (expr_type) != TREE_CODE (type)) | |
2864 | return error_mark_node; | |
2865 | ||
db02b6b9 MM |
2866 | expr = digest_init (type, expr, (tree*) 0); |
2867 | ||
2868 | if (TREE_CODE (expr) != REAL_CST) | |
2869 | goto non_constant; | |
2870 | ||
2871 | return expr; | |
abff8e06 | 2872 | |
75650646 MM |
2873 | case POINTER_TYPE: |
2874 | { | |
2875 | tree type_pointed_to = TREE_TYPE (type); | |
2876 | ||
2877 | if (TYPE_PTRMEM_P (type)) | |
93aa462d MM |
2878 | { |
2879 | tree e; | |
2880 | ||
2881 | /* For a non-type template-parameter of type pointer to data | |
2882 | member, qualification conversions (_conv.qual_) are | |
2883 | applied. */ | |
2884 | e = perform_qualification_conversions (type, expr); | |
2885 | if (TREE_CODE (e) == NOP_EXPR) | |
87533b37 MM |
2886 | /* The call to perform_qualification_conversions will |
2887 | insert a NOP_EXPR over EXPR to do express conversion, | |
2888 | if necessary. But, that will confuse us if we use | |
2889 | this (converted) template parameter to instantiate | |
2890 | another template; then the thing will not look like a | |
2891 | valid template argument. So, just make a new | |
2892 | constant, of the appropriate type. */ | |
2893 | e = make_ptrmem_cst (type, PTRMEM_CST_MEMBER (expr)); | |
93aa462d MM |
2894 | return e; |
2895 | } | |
75650646 MM |
2896 | else if (TREE_CODE (type_pointed_to) == FUNCTION_TYPE) |
2897 | { | |
2898 | /* For a non-type template-parameter of type pointer to | |
2899 | function, only the function-to-pointer conversion | |
2900 | (_conv.func_) is applied. If the template-argument | |
2901 | represents a set of overloaded functions (or a pointer to | |
2902 | such), the matching function is selected from the set | |
2903 | (_over.over_). */ | |
2904 | tree fns; | |
2905 | tree fn; | |
2906 | ||
7bf2682f | 2907 | if (TREE_CODE (expr) == ADDR_EXPR) |
75650646 MM |
2908 | fns = TREE_OPERAND (expr, 0); |
2909 | else | |
2910 | fns = expr; | |
2911 | ||
a05273d4 | 2912 | fn = instantiate_type (type_pointed_to, fns, 0); |
75650646 MM |
2913 | |
2914 | if (fn == error_mark_node) | |
2915 | return error_mark_node; | |
2916 | ||
2917 | if (!TREE_PUBLIC (fn)) | |
2918 | { | |
2919 | if (really_overloaded_fn (fns)) | |
2920 | return error_mark_node; | |
2921 | else | |
2922 | goto bad_argument; | |
2923 | } | |
2924 | ||
2925 | expr = build_unary_op (ADDR_EXPR, fn, 0); | |
2926 | ||
3bfdc719 | 2927 | my_friendly_assert (same_type_p (type, TREE_TYPE (expr)), |
75650646 MM |
2928 | 0); |
2929 | return expr; | |
2930 | } | |
2931 | else | |
2932 | { | |
2933 | /* For a non-type template-parameter of type pointer to | |
2934 | object, qualification conversions (_conv.qual_) and the | |
2935 | array-to-pointer conversion (_conv.array_) are applied. | |
2936 | [Note: In particular, neither the null pointer conversion | |
2937 | (_conv.ptr_) nor the derived-to-base conversion | |
2938 | (_conv.ptr_) are applied. Although 0 is a valid | |
2939 | template-argument for a non-type template-parameter of | |
2940 | integral type, it is not a valid template-argument for a | |
e1467ff2 MM |
2941 | non-type template-parameter of pointer type.] |
2942 | ||
2943 | The call to decay_conversion performs the | |
2944 | array-to-pointer conversion, if appropriate. */ | |
2945 | expr = decay_conversion (expr); | |
75650646 MM |
2946 | |
2947 | if (expr == error_mark_node) | |
2948 | return error_mark_node; | |
2949 | else | |
2950 | return perform_qualification_conversions (type, expr); | |
2951 | } | |
2952 | } | |
2953 | break; | |
2954 | ||
2955 | case REFERENCE_TYPE: | |
2956 | { | |
2957 | tree type_referred_to = TREE_TYPE (type); | |
2958 | ||
0dc09a61 MM |
2959 | /* If this expression already has reference type, get the |
2960 | underling object. */ | |
2961 | if (TREE_CODE (expr_type) == REFERENCE_TYPE) | |
2962 | { | |
2963 | my_friendly_assert (TREE_CODE (expr) == ADDR_EXPR, 20000604); | |
2964 | expr = TREE_OPERAND (expr, 0); | |
2965 | expr_type = TREE_TYPE (expr); | |
2966 | } | |
2967 | ||
75650646 MM |
2968 | if (TREE_CODE (type_referred_to) == FUNCTION_TYPE) |
2969 | { | |
2970 | /* For a non-type template-parameter of type reference to | |
39c01e4c MM |
2971 | function, no conversions apply. If the |
2972 | template-argument represents a set of overloaded | |
2973 | functions, the matching function is selected from the | |
2974 | set (_over.over_). */ | |
75650646 MM |
2975 | tree fn; |
2976 | ||
0dc09a61 | 2977 | fn = instantiate_type (type_referred_to, expr, 0); |
e6e174e5 JM |
2978 | |
2979 | if (fn == error_mark_node) | |
2980 | return error_mark_node; | |
75650646 MM |
2981 | |
2982 | if (!TREE_PUBLIC (fn)) | |
2983 | { | |
0dc09a61 | 2984 | if (really_overloaded_fn (expr)) |
75650646 MM |
2985 | /* Don't issue an error here; we might get a different |
2986 | function if the overloading had worked out | |
2987 | differently. */ | |
2988 | return error_mark_node; | |
2989 | else | |
2990 | goto bad_argument; | |
2991 | } | |
2992 | ||
3bfdc719 MM |
2993 | my_friendly_assert (same_type_p (type_referred_to, |
2994 | TREE_TYPE (fn)), | |
75650646 MM |
2995 | 0); |
2996 | ||
0dc09a61 | 2997 | expr = fn; |
75650646 MM |
2998 | } |
2999 | else | |
3000 | { | |
3001 | /* For a non-type template-parameter of type reference to | |
3002 | object, no conversions apply. The type referred to by the | |
3003 | reference may be more cv-qualified than the (otherwise | |
3004 | identical) type of the template-argument. The | |
3005 | template-parameter is bound directly to the | |
3006 | template-argument, which must be an lvalue. */ | |
0dc09a61 MM |
3007 | if (!same_type_p (TYPE_MAIN_VARIANT (expr_type), |
3008 | TYPE_MAIN_VARIANT (type_referred_to)) | |
91063b51 MM |
3009 | || !at_least_as_qualified_p (type_referred_to, |
3010 | expr_type) | |
75650646 | 3011 | || !real_lvalue_p (expr)) |
fd74ca0b | 3012 | return error_mark_node; |
75650646 | 3013 | } |
0dc09a61 MM |
3014 | |
3015 | mark_addressable (expr); | |
3016 | return build1 (ADDR_EXPR, type, expr); | |
75650646 MM |
3017 | } |
3018 | break; | |
3019 | ||
3020 | case RECORD_TYPE: | |
3021 | { | |
410c2fba KL |
3022 | if (!TYPE_PTRMEMFUNC_P (type)) |
3023 | /* This handles templates like | |
3024 | template<class T, T t> void f(); | |
3025 | when T is substituted with any class. The second template | |
3026 | parameter becomes invalid and the template candidate is | |
3027 | rejected. */ | |
3028 | return error_mark_node; | |
75650646 MM |
3029 | |
3030 | /* For a non-type template-parameter of type pointer to member | |
3031 | function, no conversions apply. If the template-argument | |
3032 | represents a set of overloaded member functions, the | |
3033 | matching member function is selected from the set | |
3034 | (_over.over_). */ | |
3035 | ||
3036 | if (!TYPE_PTRMEMFUNC_P (expr_type) && | |
3037 | expr_type != unknown_type_node) | |
3038 | return error_mark_node; | |
3039 | ||
e08a8f45 | 3040 | if (TREE_CODE (expr) == PTRMEM_CST) |
75650646 MM |
3041 | { |
3042 | /* A ptr-to-member constant. */ | |
3bfdc719 | 3043 | if (!same_type_p (type, expr_type)) |
75650646 MM |
3044 | return error_mark_node; |
3045 | else | |
3046 | return expr; | |
3047 | } | |
3048 | ||
3049 | if (TREE_CODE (expr) != ADDR_EXPR) | |
3050 | return error_mark_node; | |
3051 | ||
d8f8dca1 | 3052 | expr = instantiate_type (type, expr, 0); |
75650646 | 3053 | |
d8f8dca1 | 3054 | if (expr == error_mark_node) |
75650646 MM |
3055 | return error_mark_node; |
3056 | ||
3bfdc719 | 3057 | my_friendly_assert (same_type_p (type, TREE_TYPE (expr)), |
75650646 MM |
3058 | 0); |
3059 | return expr; | |
3060 | } | |
3061 | break; | |
3062 | ||
3063 | default: | |
3064 | /* All non-type parameters must have one of these types. */ | |
3065 | my_friendly_abort (0); | |
3066 | break; | |
3067 | } | |
3068 | ||
3069 | return error_mark_node; | |
3070 | } | |
3071 | ||
744fac59 KL |
3072 | /* Return 1 if PARM_PARMS and ARG_PARMS matches using rule for |
3073 | template template parameters. Both PARM_PARMS and ARG_PARMS are | |
3074 | vectors of TREE_LIST nodes containing TYPE_DECL, TEMPLATE_DECL | |
3075 | or PARM_DECL. | |
3076 | ||
3077 | ARG_PARMS may contain more parameters than PARM_PARMS. If this is | |
3078 | the case, then extra parameters must have default arguments. | |
3079 | ||
3080 | Consider the example: | |
3081 | template <class T, class Allocator = allocator> class vector; | |
3082 | template<template <class U> class TT> class C; | |
3083 | ||
3084 | C<vector> is a valid instantiation. PARM_PARMS for the above code | |
3085 | contains a TYPE_DECL (for U), ARG_PARMS contains two TYPE_DECLs (for | |
3086 | T and Allocator) and OUTER_ARGS contains the argument that is used to | |
3087 | substitute the TT parameter. */ | |
3088 | ||
3089 | static int | |
4393e105 MM |
3090 | coerce_template_template_parms (parm_parms, arg_parms, complain, |
3091 | in_decl, outer_args) | |
3092 | tree parm_parms, arg_parms; | |
3093 | int complain; | |
3094 | tree in_decl, outer_args; | |
744fac59 KL |
3095 | { |
3096 | int nparms, nargs, i; | |
3097 | tree parm, arg; | |
3098 | ||
3099 | my_friendly_assert (TREE_CODE (parm_parms) == TREE_VEC, 0); | |
3100 | my_friendly_assert (TREE_CODE (arg_parms) == TREE_VEC, 0); | |
3101 | ||
3102 | nparms = TREE_VEC_LENGTH (parm_parms); | |
3103 | nargs = TREE_VEC_LENGTH (arg_parms); | |
3104 | ||
3105 | /* The rule here is opposite of coerce_template_parms. */ | |
3106 | if (nargs < nparms | |
3107 | || (nargs > nparms | |
3108 | && TREE_PURPOSE (TREE_VEC_ELT (arg_parms, nparms)) == NULL_TREE)) | |
3109 | return 0; | |
3110 | ||
3111 | for (i = 0; i < nparms; ++i) | |
3112 | { | |
3113 | parm = TREE_VALUE (TREE_VEC_ELT (parm_parms, i)); | |
3114 | arg = TREE_VALUE (TREE_VEC_ELT (arg_parms, i)); | |
3115 | ||
3116 | if (arg == NULL_TREE || arg == error_mark_node | |
3117 | || parm == NULL_TREE || parm == error_mark_node) | |
3118 | return 0; | |
3119 | ||
3120 | if (TREE_CODE (arg) != TREE_CODE (parm)) | |
3121 | return 0; | |
3122 | ||
3123 | switch (TREE_CODE (parm)) | |
3124 | { | |
3125 | case TYPE_DECL: | |
3126 | break; | |
3127 | ||
3128 | case TEMPLATE_DECL: | |
3129 | /* We encounter instantiations of templates like | |
3130 | template <template <template <class> class> class TT> | |
3131 | class C; */ | |
700466c2 JM |
3132 | { |
3133 | tree parmparm = DECL_INNERMOST_TEMPLATE_PARMS (parm); | |
3134 | tree argparm = DECL_INNERMOST_TEMPLATE_PARMS (arg); | |
3135 | ||
3136 | if (!coerce_template_template_parms (parmparm, argparm, | |
4393e105 MM |
3137 | complain, in_decl, |
3138 | outer_args)) | |
700466c2 JM |
3139 | return 0; |
3140 | } | |
3141 | break; | |
744fac59 KL |
3142 | |
3143 | case PARM_DECL: | |
3144 | /* The tsubst call is used to handle cases such as | |
3145 | template <class T, template <T> class TT> class D; | |
3146 | i.e. the parameter list of TT depends on earlier parameters. */ | |
4393e105 MM |
3147 | if (!same_type_p (tsubst (TREE_TYPE (parm), outer_args, |
3148 | complain, in_decl), | |
3bfdc719 | 3149 | TREE_TYPE (arg))) |
744fac59 KL |
3150 | return 0; |
3151 | break; | |
3152 | ||
3153 | default: | |
3154 | my_friendly_abort (0); | |
3155 | } | |
3156 | } | |
3157 | return 1; | |
3158 | } | |
3159 | ||
8b5b8b7c MM |
3160 | /* Convert the indicated template ARG as necessary to match the |
3161 | indicated template PARM. Returns the converted ARG, or | |
3162 | error_mark_node if the conversion was unsuccessful. Error messages | |
3163 | are issued if COMPLAIN is non-zero. This conversion is for the Ith | |
3164 | parameter in the parameter list. ARGS is the full set of template | |
3165 | arguments deduced so far. */ | |
3166 | ||
3167 | static tree | |
3168 | convert_template_argument (parm, arg, args, complain, i, in_decl) | |
3169 | tree parm; | |
3170 | tree arg; | |
3171 | tree args; | |
3172 | int complain; | |
3173 | int i; | |
3174 | tree in_decl; | |
3175 | { | |
3176 | tree val; | |
3177 | tree inner_args; | |
3178 | int is_type, requires_type, is_tmpl_type, requires_tmpl_type; | |
3179 | ||
f9a7ae04 | 3180 | inner_args = INNERMOST_TEMPLATE_ARGS (args); |
8b5b8b7c MM |
3181 | |
3182 | if (TREE_CODE (arg) == TREE_LIST | |
3183 | && TREE_TYPE (arg) != NULL_TREE | |
3184 | && TREE_CODE (TREE_TYPE (arg)) == OFFSET_TYPE) | |
3185 | { | |
3186 | /* The template argument was the name of some | |
3187 | member function. That's usually | |
3188 | illegal, but static members are OK. In any | |
3189 | case, grab the underlying fields/functions | |
3190 | and issue an error later if required. */ | |
3191 | arg = TREE_VALUE (arg); | |
3192 | TREE_TYPE (arg) = unknown_type_node; | |
3193 | } | |
3194 | ||
3195 | requires_tmpl_type = TREE_CODE (parm) == TEMPLATE_DECL; | |
3196 | requires_type = (TREE_CODE (parm) == TYPE_DECL | |
3197 | || requires_tmpl_type); | |
3198 | ||
3199 | /* Check if it is a class template. If REQUIRES_TMPL_TYPE is true, | |
3200 | we also accept implicitly created TYPE_DECL as a valid argument. | |
3201 | This is necessary to handle the case where we pass a template name | |
3202 | to a template template parameter in a scope where we've derived from | |
3203 | in instantiation of that template, so the template name refers to that | |
3204 | instantiation. We really ought to handle this better. */ | |
3205 | is_tmpl_type | |
3206 | = ((TREE_CODE (arg) == TEMPLATE_DECL | |
3207 | && TREE_CODE (DECL_TEMPLATE_RESULT (arg)) == TYPE_DECL) | |
3208 | || (TREE_CODE (arg) == TEMPLATE_TEMPLATE_PARM | |
7ddedda4 | 3209 | && !TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (arg)) |
8b5b8b7c MM |
3210 | || (TREE_CODE (arg) == RECORD_TYPE |
3211 | && CLASSTYPE_TEMPLATE_INFO (arg) | |
3212 | && TREE_CODE (TYPE_NAME (arg)) == TYPE_DECL | |
3213 | && DECL_ARTIFICIAL (TYPE_NAME (arg)) | |
3214 | && requires_tmpl_type | |
b54ccf71 | 3215 | && is_base_of_enclosing_class (arg, current_class_type))); |
8b5b8b7c MM |
3216 | if (is_tmpl_type && TREE_CODE (arg) == TEMPLATE_TEMPLATE_PARM) |
3217 | arg = TYPE_STUB_DECL (arg); | |
3218 | else if (is_tmpl_type && TREE_CODE (arg) == RECORD_TYPE) | |
3219 | arg = CLASSTYPE_TI_TEMPLATE (arg); | |
3220 | ||
2f939d94 | 3221 | is_type = TYPE_P (arg) || is_tmpl_type; |
8b5b8b7c MM |
3222 | |
3223 | if (requires_type && ! is_type && TREE_CODE (arg) == SCOPE_REF | |
3224 | && TREE_CODE (TREE_OPERAND (arg, 0)) == TEMPLATE_TYPE_PARM) | |
3225 | { | |
b4f4233d | 3226 | cp_pedwarn ("to refer to a type member of a template parameter, use `typename %E'", arg); |
8b5b8b7c MM |
3227 | |
3228 | arg = make_typename_type (TREE_OPERAND (arg, 0), | |
3baa501d MM |
3229 | TREE_OPERAND (arg, 1), |
3230 | complain); | |
8b5b8b7c MM |
3231 | is_type = 1; |
3232 | } | |
3233 | if (is_type != requires_type) | |
3234 | { | |
3235 | if (in_decl) | |
3236 | { | |
3237 | if (complain) | |
3238 | { | |
8251199e | 3239 | cp_error ("type/value mismatch at argument %d in template parameter list for `%D'", |
8b5b8b7c MM |
3240 | i + 1, in_decl); |
3241 | if (is_type) | |
8251199e | 3242 | cp_error (" expected a constant of type `%T', got `%T'", |
8b5b8b7c MM |
3243 | TREE_TYPE (parm), |
3244 | (is_tmpl_type ? DECL_NAME (arg) : arg)); | |
3245 | else | |
8251199e | 3246 | cp_error (" expected a type, got `%E'", arg); |
8b5b8b7c MM |
3247 | } |
3248 | } | |
3249 | return error_mark_node; | |
3250 | } | |
3251 | if (is_tmpl_type ^ requires_tmpl_type) | |
3252 | { | |
3253 | if (in_decl && complain) | |
3254 | { | |
8251199e | 3255 | cp_error ("type/value mismatch at argument %d in template parameter list for `%D'", |
8b5b8b7c MM |
3256 | i + 1, in_decl); |
3257 | if (is_tmpl_type) | |
8251199e | 3258 | cp_error (" expected a type, got `%T'", DECL_NAME (arg)); |
8b5b8b7c | 3259 | else |
8251199e | 3260 | cp_error (" expected a class template, got `%T'", arg); |
8b5b8b7c MM |
3261 | } |
3262 | return error_mark_node; | |
3263 | } | |
3264 | ||
3265 | if (is_type) | |
3266 | { | |
3267 | if (requires_tmpl_type) | |
3268 | { | |
3269 | tree parmparm = DECL_INNERMOST_TEMPLATE_PARMS (parm); | |
3270 | tree argparm = DECL_INNERMOST_TEMPLATE_PARMS (arg); | |
3271 | ||
4393e105 | 3272 | if (coerce_template_template_parms (parmparm, argparm, complain, |
8b5b8b7c MM |
3273 | in_decl, inner_args)) |
3274 | { | |
3275 | val = arg; | |
3276 | ||
3277 | /* TEMPLATE_TEMPLATE_PARM node is preferred over | |
3278 | TEMPLATE_DECL. */ | |
3279 | if (val != error_mark_node | |
3280 | && DECL_TEMPLATE_TEMPLATE_PARM_P (val)) | |
3281 | val = TREE_TYPE (val); | |
3282 | } | |
3283 | else | |
3284 | { | |
3285 | if (in_decl && complain) | |
3286 | { | |
8251199e | 3287 | cp_error ("type/value mismatch at argument %d in template parameter list for `%D'", |
8b5b8b7c | 3288 | i + 1, in_decl); |
8251199e | 3289 | cp_error (" expected a template of type `%D', got `%D'", parm, arg); |
8b5b8b7c MM |
3290 | } |
3291 | ||
3292 | val = error_mark_node; | |
3293 | } | |
3294 | } | |
3295 | else | |
3296 | { | |
3297 | val = groktypename (arg); | |
3298 | if (! processing_template_decl) | |
3299 | { | |
3300 | /* [basic.link]: A name with no linkage (notably, the | |
3301 | name of a class or enumeration declared in a local | |
3302 | scope) shall not be used to declare an entity with | |
3303 | linkage. This implies that names with no linkage | |
3304 | cannot be used as template arguments. */ | |
3305 | tree t = no_linkage_check (val); | |
3306 | if (t) | |
3307 | { | |
3308 | if (ANON_AGGRNAME_P (TYPE_IDENTIFIER (t))) | |
8251199e JM |
3309 | cp_pedwarn |
3310 | ("template-argument `%T' uses anonymous type", val); | |
8b5b8b7c | 3311 | else |
8251199e JM |
3312 | cp_error |
3313 | ("template-argument `%T' uses local type `%T'", | |
8b5b8b7c MM |
3314 | val, t); |
3315 | return error_mark_node; | |
3316 | } | |
3317 | } | |
3318 | } | |
3319 | } | |
3320 | else | |
3321 | { | |
4393e105 | 3322 | tree t = tsubst (TREE_TYPE (parm), args, complain, in_decl); |
8b5b8b7c MM |
3323 | |
3324 | if (processing_template_decl) | |
3325 | arg = maybe_fold_nontype_arg (arg); | |
3326 | ||
3327 | if (!uses_template_parms (arg) && !uses_template_parms (t)) | |
3328 | /* We used to call digest_init here. However, digest_init | |
3329 | will report errors, which we don't want when complain | |
3330 | is zero. More importantly, digest_init will try too | |
3331 | hard to convert things: for example, `0' should not be | |
3332 | converted to pointer type at this point according to | |
3333 | the standard. Accepting this is not merely an | |
3334 | extension, since deciding whether or not these | |
3335 | conversions can occur is part of determining which | |
3336 | function template to call, or whether a given epxlicit | |
3337 | argument specification is legal. */ | |
3338 | val = convert_nontype_argument (t, arg); | |
3339 | else | |
3340 | val = arg; | |
3341 | ||
3342 | if (val == NULL_TREE) | |
3343 | val = error_mark_node; | |
3344 | else if (val == error_mark_node && complain) | |
8251199e | 3345 | cp_error ("could not convert template argument `%E' to `%T'", |
8b5b8b7c MM |
3346 | arg, t); |
3347 | } | |
3348 | ||
3349 | return val; | |
3350 | } | |
3351 | ||
3352 | /* Convert all template arguments to their appropriate types, and | |
3353 | return a vector containing the innermost resulting template | |
3354 | arguments. If any error occurs, return error_mark_node, and, if | |
3355 | COMPLAIN is non-zero, issue an error message. Some error messages | |
3356 | are issued even if COMPLAIN is zero; for instance, if a template | |
3357 | argument is composed from a local class. | |
75650646 MM |
3358 | |
3359 | If REQUIRE_ALL_ARGUMENTS is non-zero, all arguments must be | |
3360 | provided in ARGLIST, or else trailing parameters must have default | |
3361 | values. If REQUIRE_ALL_ARGUMENTS is zero, we will attempt argument | |
6dfbb909 | 3362 | deduction for any unspecified trailing arguments. */ |
de575009 | 3363 | |
8d08fdba | 3364 | static tree |
8b5b8b7c | 3365 | coerce_template_parms (parms, args, in_decl, |
75650646 | 3366 | complain, |
744fac59 | 3367 | require_all_arguments) |
8b5b8b7c | 3368 | tree parms, args; |
8d08fdba | 3369 | tree in_decl; |
75650646 MM |
3370 | int complain; |
3371 | int require_all_arguments; | |
8d08fdba | 3372 | { |
a292b002 | 3373 | int nparms, nargs, i, lost = 0; |
e4a84209 | 3374 | tree inner_args; |
8b5b8b7c MM |
3375 | tree new_args; |
3376 | tree new_inner_args; | |
a292b002 | 3377 | |
f9a7ae04 | 3378 | inner_args = INNERMOST_TEMPLATE_ARGS (args); |
e4a84209 | 3379 | nargs = NUM_TMPL_ARGS (inner_args); |
a292b002 MS |
3380 | nparms = TREE_VEC_LENGTH (parms); |
3381 | ||
3382 | if (nargs > nparms | |
3383 | || (nargs < nparms | |
75650646 | 3384 | && require_all_arguments |
a292b002 | 3385 | && TREE_PURPOSE (TREE_VEC_ELT (parms, nargs)) == NULL_TREE)) |
8d08fdba | 3386 | { |
75650646 MM |
3387 | if (complain) |
3388 | { | |
8251199e | 3389 | cp_error ("wrong number of template arguments (%d, should be %d)", |
e4a84209 | 3390 | nargs, nparms); |
75650646 MM |
3391 | |
3392 | if (in_decl) | |
8251199e | 3393 | cp_error_at ("provided for `%D'", in_decl); |
75650646 MM |
3394 | } |
3395 | ||
8d08fdba MS |
3396 | return error_mark_node; |
3397 | } | |
3398 | ||
f31c0a32 | 3399 | new_inner_args = make_tree_vec (nparms); |
8b5b8b7c MM |
3400 | new_args = add_outermost_template_args (args, new_inner_args); |
3401 | for (i = 0; i < nparms; i++) | |
8d08fdba | 3402 | { |
8b5b8b7c MM |
3403 | tree arg; |
3404 | tree parm; | |
e4a84209 | 3405 | |
8b5b8b7c MM |
3406 | /* Get the Ith template parameter. */ |
3407 | parm = TREE_VEC_ELT (parms, i); | |
75650646 | 3408 | |
8b5b8b7c MM |
3409 | /* Calculate the Ith argument. */ |
3410 | if (inner_args && TREE_CODE (inner_args) == TREE_LIST) | |
8d08fdba | 3411 | { |
8b5b8b7c MM |
3412 | arg = TREE_VALUE (inner_args); |
3413 | inner_args = TREE_CHAIN (inner_args); | |
8d08fdba | 3414 | } |
8b5b8b7c MM |
3415 | else if (i < nargs) |
3416 | arg = TREE_VEC_ELT (inner_args, i); | |
3417 | /* If no template argument was supplied, look for a default | |
3418 | value. */ | |
3419 | else if (TREE_PURPOSE (parm) == NULL_TREE) | |
3420 | { | |
3421 | /* There was no default value. */ | |
3422 | my_friendly_assert (!require_all_arguments, 0); | |
3423 | break; | |
3424 | } | |
3425 | else if (TREE_CODE (TREE_VALUE (parm)) == TYPE_DECL) | |
4393e105 | 3426 | arg = tsubst (TREE_PURPOSE (parm), new_args, complain, in_decl); |
8b5b8b7c | 3427 | else |
4393e105 MM |
3428 | arg = tsubst_expr (TREE_PURPOSE (parm), new_args, complain, |
3429 | in_decl); | |
e4a84209 | 3430 | |
8b5b8b7c | 3431 | /* Now, convert the Ith argument, as necessary. */ |
75650646 MM |
3432 | if (arg == NULL_TREE) |
3433 | /* We're out of arguments. */ | |
3434 | { | |
3435 | my_friendly_assert (!require_all_arguments, 0); | |
3436 | break; | |
3437 | } | |
8b5b8b7c | 3438 | else if (arg == error_mark_node) |
75650646 | 3439 | { |
8251199e | 3440 | cp_error ("template argument %d is invalid", i + 1); |
8b5b8b7c | 3441 | arg = error_mark_node; |
8d08fdba | 3442 | } |
8b5b8b7c MM |
3443 | else |
3444 | arg = convert_template_argument (TREE_VALUE (parm), | |
3445 | arg, new_args, complain, i, | |
3446 | in_decl); | |
3447 | ||
3448 | if (arg == error_mark_node) | |
8d08fdba | 3449 | lost++; |
8b5b8b7c | 3450 | TREE_VEC_ELT (new_inner_args, i) = arg; |
8d08fdba | 3451 | } |
8b5b8b7c | 3452 | |
8d08fdba MS |
3453 | if (lost) |
3454 | return error_mark_node; | |
8b5b8b7c MM |
3455 | |
3456 | return new_inner_args; | |
8d08fdba MS |
3457 | } |
3458 | ||
34016c81 JM |
3459 | /* Returns 1 if template args OT and NT are equivalent. */ |
3460 | ||
d8e178a0 | 3461 | static int |
34016c81 JM |
3462 | template_args_equal (ot, nt) |
3463 | tree ot, nt; | |
3464 | { | |
3465 | if (nt == ot) | |
3466 | return 1; | |
3467 | if (TREE_CODE (nt) != TREE_CODE (ot)) | |
3468 | return 0; | |
3469 | if (TREE_CODE (nt) == TREE_VEC) | |
3470 | /* For member templates */ | |
3471 | return comp_template_args (ot, nt); | |
2f939d94 | 3472 | else if (TYPE_P (ot)) |
3bfdc719 | 3473 | return same_type_p (ot, nt); |
34016c81 JM |
3474 | else |
3475 | return (cp_tree_equal (ot, nt) > 0); | |
3476 | } | |
3477 | ||
3478 | /* Returns 1 iff the OLDARGS and NEWARGS are in fact identical sets | |
f84b4be9 JM |
3479 | of template arguments. Returns 0 otherwise. */ |
3480 | ||
6757edfe | 3481 | int |
5566b478 MS |
3482 | comp_template_args (oldargs, newargs) |
3483 | tree oldargs, newargs; | |
3484 | { | |
3485 | int i; | |
3486 | ||
386b8a85 JM |
3487 | if (TREE_VEC_LENGTH (oldargs) != TREE_VEC_LENGTH (newargs)) |
3488 | return 0; | |
3489 | ||
5566b478 MS |
3490 | for (i = 0; i < TREE_VEC_LENGTH (oldargs); ++i) |
3491 | { | |
3492 | tree nt = TREE_VEC_ELT (newargs, i); | |
3493 | tree ot = TREE_VEC_ELT (oldargs, i); | |
3494 | ||
34016c81 | 3495 | if (! template_args_equal (ot, nt)) |
61a127b3 | 3496 | return 0; |
5566b478 MS |
3497 | } |
3498 | return 1; | |
3499 | } | |
3500 | ||
8d08fdba MS |
3501 | /* Given class template name and parameter list, produce a user-friendly name |
3502 | for the instantiation. */ | |
e92cc029 | 3503 | |
8d08fdba | 3504 | static char * |
36a117a5 | 3505 | mangle_class_name_for_template (name, parms, arglist) |
8d08fdba MS |
3506 | char *name; |
3507 | tree parms, arglist; | |
3508 | { | |
3509 | static struct obstack scratch_obstack; | |
3510 | static char *scratch_firstobj; | |
3511 | int i, nparms; | |
8d08fdba MS |
3512 | |
3513 | if (!scratch_firstobj) | |
fc378698 | 3514 | gcc_obstack_init (&scratch_obstack); |
8d08fdba MS |
3515 | else |
3516 | obstack_free (&scratch_obstack, scratch_firstobj); | |
fc378698 | 3517 | scratch_firstobj = obstack_alloc (&scratch_obstack, 1); |
8d08fdba | 3518 | |
8d08fdba | 3519 | #define ccat(c) obstack_1grow (&scratch_obstack, (c)); |
8d08fdba | 3520 | #define cat(s) obstack_grow (&scratch_obstack, (s), strlen (s)) |
8d08fdba MS |
3521 | |
3522 | cat (name); | |
3523 | ccat ('<'); | |
3524 | nparms = TREE_VEC_LENGTH (parms); | |
f9a7ae04 | 3525 | arglist = INNERMOST_TEMPLATE_ARGS (arglist); |
8d08fdba MS |
3526 | my_friendly_assert (nparms == TREE_VEC_LENGTH (arglist), 268); |
3527 | for (i = 0; i < nparms; i++) | |
3528 | { | |
a292b002 MS |
3529 | tree parm = TREE_VALUE (TREE_VEC_ELT (parms, i)); |
3530 | tree arg = TREE_VEC_ELT (arglist, i); | |
8d08fdba MS |
3531 | |
3532 | if (i) | |
3533 | ccat (','); | |
3534 | ||
a292b002 | 3535 | if (TREE_CODE (parm) == TYPE_DECL) |
8d08fdba | 3536 | { |
9e93bc9d | 3537 | cat (type_as_string (arg, TS_CHASE_TYPEDEFS)); |
8d08fdba MS |
3538 | continue; |
3539 | } | |
73b0fce8 KL |
3540 | else if (TREE_CODE (parm) == TEMPLATE_DECL) |
3541 | { | |
3542 | if (TREE_CODE (arg) == TEMPLATE_DECL) | |
2c73f9f5 ML |
3543 | { |
3544 | /* Already substituted with real template. Just output | |
3545 | the template name here */ | |
cb0dbb9a | 3546 | tree context = DECL_CONTEXT (arg); |
ec4f972f AS |
3547 | if (context) |
3548 | { | |
3549 | /* The template may be defined in a namespace, or | |
3550 | may be a member template. */ | |
3551 | my_friendly_assert (TREE_CODE (context) == NAMESPACE_DECL | |
3552 | || CLASS_TYPE_P (context), | |
3553 | 980422); | |
2c73f9f5 ML |
3554 | cat(decl_as_string (DECL_CONTEXT (arg), 0)); |
3555 | cat("::"); | |
3556 | } | |
3557 | cat (IDENTIFIER_POINTER (DECL_NAME (arg))); | |
3558 | } | |
73b0fce8 KL |
3559 | else |
3560 | /* Output the parameter declaration */ | |
9e93bc9d | 3561 | cat (type_as_string (arg, TS_CHASE_TYPEDEFS)); |
73b0fce8 KL |
3562 | continue; |
3563 | } | |
8d08fdba MS |
3564 | else |
3565 | my_friendly_assert (TREE_CODE (parm) == PARM_DECL, 269); | |
3566 | ||
3567 | if (TREE_CODE (arg) == TREE_LIST) | |
3568 | { | |
3569 | /* New list cell was built because old chain link was in | |
3570 | use. */ | |
3571 | my_friendly_assert (TREE_PURPOSE (arg) == NULL_TREE, 270); | |
3572 | arg = TREE_VALUE (arg); | |
3573 | } | |
3574 | /* No need to check arglist against parmlist here; we did that | |
3575 | in coerce_template_parms, called from lookup_template_class. */ | |
3576 | cat (expr_as_string (arg, 0)); | |
3577 | } | |
3578 | { | |
3579 | char *bufp = obstack_next_free (&scratch_obstack); | |
3580 | int offset = 0; | |
3581 | while (bufp[offset - 1] == ' ') | |
3582 | offset--; | |
3583 | obstack_blank_fast (&scratch_obstack, offset); | |
3584 | ||
3585 | /* B<C<char> >, not B<C<char>> */ | |
3586 | if (bufp[offset - 1] == '>') | |
3587 | ccat (' '); | |
3588 | } | |
3589 | ccat ('>'); | |
3590 | ccat ('\0'); | |
3591 | return (char *) obstack_base (&scratch_obstack); | |
8d08fdba MS |
3592 | } |
3593 | ||
bd6dd845 | 3594 | static tree |
5566b478 MS |
3595 | classtype_mangled_name (t) |
3596 | tree t; | |
3597 | { | |
3598 | if (CLASSTYPE_TEMPLATE_INFO (t) | |
36a117a5 MM |
3599 | /* Specializations have already had their names set up in |
3600 | lookup_template_class. */ | |
370af2d5 | 3601 | && !CLASSTYPE_TEMPLATE_SPECIALIZATION (t)) |
9fbf56f7 MM |
3602 | { |
3603 | tree tmpl = most_general_template (CLASSTYPE_TI_TEMPLATE (t)); | |
3604 | ||
36a117a5 MM |
3605 | /* For non-primary templates, the template parameters are |
3606 | implicit from their surrounding context. */ | |
9fbf56f7 MM |
3607 | if (PRIMARY_TEMPLATE_P (tmpl)) |
3608 | { | |
3609 | tree name = DECL_NAME (tmpl); | |
3610 | char *mangled_name = mangle_class_name_for_template | |
3611 | (IDENTIFIER_POINTER (name), | |
3612 | DECL_INNERMOST_TEMPLATE_PARMS (tmpl), | |
3613 | CLASSTYPE_TI_ARGS (t)); | |
3614 | tree id = get_identifier (mangled_name); | |
3615 | IDENTIFIER_TEMPLATE (id) = name; | |
3616 | return id; | |
3617 | } | |
5566b478 | 3618 | } |
9fbf56f7 MM |
3619 | |
3620 | return TYPE_IDENTIFIER (t); | |
5566b478 MS |
3621 | } |
3622 | ||
3623 | static void | |
3624 | add_pending_template (d) | |
3625 | tree d; | |
3626 | { | |
3ae18eaf JM |
3627 | tree ti = (TYPE_P (d) |
3628 | ? CLASSTYPE_TEMPLATE_INFO (d) | |
3629 | : DECL_TEMPLATE_INFO (d)); | |
3630 | int level; | |
e92cc029 | 3631 | |
824b9a4c | 3632 | if (TI_PENDING_TEMPLATE_FLAG (ti)) |
5566b478 MS |
3633 | return; |
3634 | ||
3ae18eaf JM |
3635 | /* We are called both from instantiate_decl, where we've already had a |
3636 | tinst_level pushed, and instantiate_template, where we haven't. | |
3637 | Compensate. */ | |
3638 | level = !(current_tinst_level && TINST_DECL (current_tinst_level) == d); | |
3639 | ||
3640 | if (level) | |
3641 | push_tinst_level (d); | |
3642 | ||
3643 | *template_tail = tree_cons (current_tinst_level, d, NULL_TREE); | |
5566b478 | 3644 | template_tail = &TREE_CHAIN (*template_tail); |
824b9a4c | 3645 | TI_PENDING_TEMPLATE_FLAG (ti) = 1; |
3ae18eaf JM |
3646 | |
3647 | if (level) | |
3648 | pop_tinst_level (); | |
5566b478 MS |
3649 | } |
3650 | ||
386b8a85 JM |
3651 | |
3652 | /* Return a TEMPLATE_ID_EXPR corresponding to the indicated FNS (which | |
3653 | may be either a _DECL or an overloaded function or an | |
3654 | IDENTIFIER_NODE), and ARGLIST. */ | |
3655 | ||
3656 | tree | |
3657 | lookup_template_function (fns, arglist) | |
3658 | tree fns, arglist; | |
3659 | { | |
2c73f9f5 | 3660 | tree type; |
050367a3 | 3661 | |
386b8a85 JM |
3662 | if (fns == NULL_TREE) |
3663 | { | |
8251199e | 3664 | cp_error ("non-template used as template"); |
386b8a85 JM |
3665 | return error_mark_node; |
3666 | } | |
3667 | ||
2c73f9f5 ML |
3668 | type = TREE_TYPE (fns); |
3669 | if (TREE_CODE (fns) == OVERLOAD || !type) | |
3670 | type = unknown_type_node; | |
3671 | ||
672476cb MM |
3672 | if (processing_template_decl) |
3673 | return build_min (TEMPLATE_ID_EXPR, type, fns, arglist); | |
3674 | else | |
3675 | return build (TEMPLATE_ID_EXPR, type, fns, arglist); | |
386b8a85 JM |
3676 | } |
3677 | ||
a2b60a0e MM |
3678 | /* Within the scope of a template class S<T>, the name S gets bound |
3679 | (in build_self_reference) to a TYPE_DECL for the class, not a | |
3680 | TEMPLATE_DECL. If DECL is a TYPE_DECL for current_class_type, | |
3681 | or one of its enclosing classes, and that type is a template, | |
3682 | return the associated TEMPLATE_DECL. Otherwise, the original | |
3683 | DECL is returned. */ | |
3684 | ||
e9659ab0 | 3685 | static tree |
a2b60a0e MM |
3686 | maybe_get_template_decl_from_type_decl (decl) |
3687 | tree decl; | |
3688 | { | |
3689 | return (decl != NULL_TREE | |
3690 | && TREE_CODE (decl) == TYPE_DECL | |
3691 | && DECL_ARTIFICIAL (decl) | |
511b60ff | 3692 | && CLASS_TYPE_P (TREE_TYPE (decl)) |
a2b60a0e MM |
3693 | && CLASSTYPE_TEMPLATE_INFO (TREE_TYPE (decl))) |
3694 | ? CLASSTYPE_TI_TEMPLATE (TREE_TYPE (decl)) : decl; | |
3695 | } | |
386b8a85 | 3696 | |
8d08fdba MS |
3697 | /* Given an IDENTIFIER_NODE (type TEMPLATE_DECL) and a chain of |
3698 | parameters, find the desired type. | |
3699 | ||
3700 | D1 is the PTYPENAME terminal, and ARGLIST is the list of arguments. | |
36a117a5 MM |
3701 | (Actually ARGLIST may be either a TREE_LIST or a TREE_VEC. It will |
3702 | be a TREE_LIST if called directly from the parser, and a TREE_VEC | |
0a2c2fd1 | 3703 | otherwise.) Since ARGLIST is build on the temp_decl_obstack, we must |
36a117a5 MM |
3704 | copy it here to keep it from being reclaimed when the decl storage |
3705 | is reclaimed. | |
8d08fdba MS |
3706 | |
3707 | IN_DECL, if non-NULL, is the template declaration we are trying to | |
75650646 MM |
3708 | instantiate. |
3709 | ||
36a117a5 MM |
3710 | If ENTERING_SCOPE is non-zero, we are about to enter the scope of |
3711 | the class we are looking up. | |
3712 | ||
75650646 MM |
3713 | If the template class is really a local class in a template |
3714 | function, then the FUNCTION_CONTEXT is the function in which it is | |
3715 | being instantiated. */ | |
e92cc029 | 3716 | |
8d08fdba | 3717 | tree |
36a117a5 | 3718 | lookup_template_class (d1, arglist, in_decl, context, entering_scope) |
8d08fdba MS |
3719 | tree d1, arglist; |
3720 | tree in_decl; | |
e1467ff2 | 3721 | tree context; |
36a117a5 | 3722 | int entering_scope; |
8d08fdba | 3723 | { |
a703fb38 | 3724 | tree template = NULL_TREE, parmlist; |
dbfe2124 | 3725 | tree t; |
5566b478 MS |
3726 | |
3727 | if (TREE_CODE (d1) == IDENTIFIER_NODE) | |
3728 | { | |
f181d4ae MM |
3729 | if (IDENTIFIER_VALUE (d1) |
3730 | && DECL_TEMPLATE_TEMPLATE_PARM_P (IDENTIFIER_VALUE (d1))) | |
3731 | template = IDENTIFIER_VALUE (d1); | |
73b0fce8 KL |
3732 | else |
3733 | { | |
2c73f9f5 ML |
3734 | if (context) |
3735 | push_decl_namespace (context); | |
3ebc5c52 MM |
3736 | template = lookup_name (d1, /*prefer_type=*/0); |
3737 | template = maybe_get_template_decl_from_type_decl (template); | |
2c73f9f5 ML |
3738 | if (context) |
3739 | pop_decl_namespace (); | |
73b0fce8 | 3740 | } |
8d019cef JM |
3741 | if (template) |
3742 | context = DECL_CONTEXT (template); | |
5566b478 | 3743 | } |
c91a56d2 MS |
3744 | else if (TREE_CODE (d1) == TYPE_DECL && IS_AGGR_TYPE (TREE_TYPE (d1))) |
3745 | { | |
802dbc34 JM |
3746 | tree type = TREE_TYPE (d1); |
3747 | ||
3748 | /* If we are declaring a constructor, say A<T>::A<T>, we will get | |
3749 | an implicit typename for the second A. Deal with it. */ | |
3750 | if (TREE_CODE (type) == TYPENAME_TYPE && TREE_TYPE (type)) | |
3751 | type = TREE_TYPE (type); | |
3752 | ||
3753 | if (CLASSTYPE_TEMPLATE_INFO (type)) | |
f3400fe2 | 3754 | { |
802dbc34 | 3755 | template = CLASSTYPE_TI_TEMPLATE (type); |
f3400fe2 JM |
3756 | d1 = DECL_NAME (template); |
3757 | } | |
c91a56d2 | 3758 | } |
ed44da02 | 3759 | else if (TREE_CODE (d1) == ENUMERAL_TYPE |
2f939d94 | 3760 | || (TYPE_P (d1) && IS_AGGR_TYPE (d1))) |
5566b478 | 3761 | { |
ed44da02 | 3762 | template = TYPE_TI_TEMPLATE (d1); |
5566b478 MS |
3763 | d1 = DECL_NAME (template); |
3764 | } | |
93cdc044 | 3765 | else if (TREE_CODE (d1) == TEMPLATE_DECL |
17aec3eb | 3766 | && TREE_CODE (DECL_TEMPLATE_RESULT (d1)) == TYPE_DECL) |
93cdc044 JM |
3767 | { |
3768 | template = d1; | |
3769 | d1 = DECL_NAME (template); | |
3770 | context = DECL_CONTEXT (template); | |
3771 | } | |
5566b478 MS |
3772 | else |
3773 | my_friendly_abort (272); | |
8d08fdba | 3774 | |
8d08fdba | 3775 | /* With something like `template <class T> class X class X { ... };' |
f181d4ae MM |
3776 | we could end up with D1 having nothing but an IDENTIFIER_VALUE. |
3777 | We don't want to do that, but we have to deal with the situation, | |
3778 | so let's give them some syntax errors to chew on instead of a | |
3779 | crash. */ | |
8d08fdba | 3780 | if (! template) |
f3400fe2 JM |
3781 | { |
3782 | cp_error ("`%T' is not a template", d1); | |
3783 | return error_mark_node; | |
3784 | } | |
2c73f9f5 | 3785 | |
c3baf4b5 JM |
3786 | if (context == NULL_TREE) |
3787 | context = global_namespace; | |
2c73f9f5 | 3788 | |
8d08fdba MS |
3789 | if (TREE_CODE (template) != TEMPLATE_DECL) |
3790 | { | |
8251199e | 3791 | cp_error ("non-template type `%T' used as a template", d1); |
8d08fdba | 3792 | if (in_decl) |
8251199e | 3793 | cp_error_at ("for template declaration `%D'", in_decl); |
8d08fdba MS |
3794 | return error_mark_node; |
3795 | } | |
8d08fdba | 3796 | |
73b0fce8 KL |
3797 | if (DECL_TEMPLATE_TEMPLATE_PARM_P (template)) |
3798 | { | |
3799 | /* Create a new TEMPLATE_DECL and TEMPLATE_TEMPLATE_PARM node to store | |
3800 | template arguments */ | |
3801 | ||
3802 | tree parm = copy_template_template_parm (TREE_TYPE (template)); | |
3803 | tree template2 = TYPE_STUB_DECL (parm); | |
3804 | tree arglist2; | |
3805 | ||
73b0fce8 KL |
3806 | parmlist = DECL_INNERMOST_TEMPLATE_PARMS (template); |
3807 | ||
744fac59 | 3808 | arglist2 = coerce_template_parms (parmlist, arglist, template, 1, 1); |
73b0fce8 KL |
3809 | if (arglist2 == error_mark_node) |
3810 | return error_mark_node; | |
3811 | ||
7ddedda4 | 3812 | TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (parm) |
e1b3e07d | 3813 | = tree_cons (template2, arglist2, NULL_TREE); |
73b0fce8 KL |
3814 | TYPE_SIZE (parm) = 0; |
3815 | return parm; | |
3816 | } | |
36a117a5 | 3817 | else |
8d08fdba | 3818 | { |
36a117a5 | 3819 | tree template_type = TREE_TYPE (template); |
7ac7b28f | 3820 | tree gen_tmpl; |
36a117a5 MM |
3821 | tree type_decl; |
3822 | tree found = NULL_TREE; | |
3823 | int arg_depth; | |
3824 | int parm_depth; | |
dbfe2124 | 3825 | int is_partial_instantiation; |
830bfa74 | 3826 | |
7ac7b28f MM |
3827 | gen_tmpl = most_general_template (template); |
3828 | parmlist = DECL_TEMPLATE_PARMS (gen_tmpl); | |
36a117a5 MM |
3829 | parm_depth = TMPL_PARMS_DEPTH (parmlist); |
3830 | arg_depth = TMPL_ARGS_DEPTH (arglist); | |
3831 | ||
3832 | if (arg_depth == 1 && parm_depth > 1) | |
3833 | { | |
39c01e4c | 3834 | /* We've been given an incomplete set of template arguments. |
36a117a5 MM |
3835 | For example, given: |
3836 | ||
3837 | template <class T> struct S1 { | |
3838 | template <class U> struct S2 {}; | |
3839 | template <class U> struct S2<U*> {}; | |
3840 | }; | |
3841 | ||
3842 | we will be called with an ARGLIST of `U*', but the | |
3843 | TEMPLATE will be `template <class T> template | |
3844 | <class U> struct S1<T>::S2'. We must fill in the missing | |
3845 | arguments. */ | |
7ac7b28f MM |
3846 | arglist |
3847 | = add_outermost_template_args (TYPE_TI_ARGS (TREE_TYPE (template)), | |
3848 | arglist); | |
36a117a5 MM |
3849 | arg_depth = TMPL_ARGS_DEPTH (arglist); |
3850 | } | |
5566b478 | 3851 | |
7ac7b28f | 3852 | /* Now we should enough arguments. */ |
36a117a5 MM |
3853 | my_friendly_assert (parm_depth == arg_depth, 0); |
3854 | ||
7ac7b28f MM |
3855 | /* From here on, we're only interested in the most general |
3856 | template. */ | |
3857 | template = gen_tmpl; | |
3858 | ||
36a117a5 MM |
3859 | /* Calculate the BOUND_ARGS. These will be the args that are |
3860 | actually tsubst'd into the definition to create the | |
3861 | instantiation. */ | |
3862 | if (parm_depth > 1) | |
830bfa74 MM |
3863 | { |
3864 | /* We have multiple levels of arguments to coerce, at once. */ | |
830bfa74 | 3865 | int i; |
e4a84209 | 3866 | int saved_depth = TMPL_ARGS_DEPTH (arglist); |
36a117a5 | 3867 | |
f31c0a32 | 3868 | tree bound_args = make_tree_vec (parm_depth); |
830bfa74 | 3869 | |
e4a84209 | 3870 | for (i = saved_depth, |
830bfa74 | 3871 | t = DECL_TEMPLATE_PARMS (template); |
e4a84209 | 3872 | i > 0 && t != NULL_TREE; |
830bfa74 | 3873 | --i, t = TREE_CHAIN (t)) |
e4a84209 MM |
3874 | { |
3875 | tree a = coerce_template_parms (TREE_VALUE (t), | |
3876 | arglist, template, 1, 1); | |
3877 | SET_TMPL_ARGS_LEVEL (bound_args, i, a); | |
3878 | ||
3879 | /* We temporarily reduce the length of the ARGLIST so | |
3880 | that coerce_template_parms will see only the arguments | |
3881 | corresponding to the template parameters it is | |
3882 | examining. */ | |
3883 | TREE_VEC_LENGTH (arglist)--; | |
3884 | } | |
3885 | ||
3886 | /* Restore the ARGLIST to its full size. */ | |
3887 | TREE_VEC_LENGTH (arglist) = saved_depth; | |
3888 | ||
36a117a5 | 3889 | arglist = bound_args; |
830bfa74 MM |
3890 | } |
3891 | else | |
36a117a5 MM |
3892 | arglist |
3893 | = coerce_template_parms (INNERMOST_TEMPLATE_PARMS (parmlist), | |
f9a7ae04 | 3894 | INNERMOST_TEMPLATE_ARGS (arglist), |
36a117a5 MM |
3895 | template, 1, 1); |
3896 | ||
3897 | if (arglist == error_mark_node) | |
3898 | /* We were unable to bind the arguments. */ | |
5566b478 | 3899 | return error_mark_node; |
5566b478 | 3900 | |
36a117a5 MM |
3901 | /* In the scope of a template class, explicit references to the |
3902 | template class refer to the type of the template, not any | |
3903 | instantiation of it. For example, in: | |
3904 | ||
3905 | template <class T> class C { void f(C<T>); } | |
3906 | ||
3907 | the `C<T>' is just the same as `C'. Outside of the | |
3908 | class, however, such a reference is an instantiation. */ | |
ed44da02 | 3909 | if (comp_template_args (TYPE_TI_ARGS (template_type), |
36a117a5 MM |
3910 | arglist)) |
3911 | { | |
3912 | found = template_type; | |
3913 | ||
3914 | if (!entering_scope && PRIMARY_TEMPLATE_P (template)) | |
5566b478 | 3915 | { |
36a117a5 MM |
3916 | tree ctx; |
3917 | ||
3918 | /* Note that we use DECL_CONTEXT, rather than | |
3919 | CP_DECL_CONTEXT, so that the termination test is | |
3920 | always just `ctx'. We're not interested in namepace | |
3921 | scopes. */ | |
3922 | for (ctx = current_class_type; | |
3923 | ctx; | |
2f939d94 | 3924 | ctx = (TYPE_P (ctx)) ? TYPE_CONTEXT (ctx) : DECL_CONTEXT (ctx)) |
3bfdc719 | 3925 | if (same_type_p (ctx, template_type)) |
36a117a5 MM |
3926 | break; |
3927 | ||
3928 | if (!ctx) | |
3929 | /* We're not in the scope of the class, so the | |
3930 | TEMPLATE_TYPE is not the type we want after | |
3931 | all. */ | |
3932 | found = NULL_TREE; | |
5566b478 MS |
3933 | } |
3934 | } | |
36a117a5 MM |
3935 | |
3936 | if (!found) | |
75650646 | 3937 | { |
36a117a5 MM |
3938 | for (found = DECL_TEMPLATE_INSTANTIATIONS (template); |
3939 | found; found = TREE_CHAIN (found)) | |
3940 | if (comp_template_args (TREE_PURPOSE (found), arglist)) | |
3941 | break; | |
75650646 | 3942 | |
36a117a5 MM |
3943 | if (found) |
3944 | found = TREE_VALUE (found); | |
8d08fdba | 3945 | } |
3ebc5c52 | 3946 | |
36a117a5 | 3947 | if (found) |
f31c0a32 | 3948 | return found; |
5566b478 | 3949 | |
dbfe2124 | 3950 | /* This type is a "partial instantiation" if any of the template |
486e4077 MM |
3951 | arguments still inolve template parameters. Note that we set |
3952 | IS_PARTIAL_INSTANTIATION for partial specializations as | |
3953 | well. */ | |
dbfe2124 MM |
3954 | is_partial_instantiation = uses_template_parms (arglist); |
3955 | ||
3ebc5c52 MM |
3956 | if (!is_partial_instantiation |
3957 | && !PRIMARY_TEMPLATE_P (template) | |
3958 | && TREE_CODE (CP_DECL_CONTEXT (template)) == NAMESPACE_DECL) | |
3959 | { | |
3ebc5c52 MM |
3960 | found = xref_tag_from_type (TREE_TYPE (template), |
3961 | DECL_NAME (template), | |
3962 | /*globalize=*/1); | |
3963 | return found; | |
3964 | } | |
3ebc5c52 | 3965 | |
36a117a5 | 3966 | /* Create the type. */ |
ed44da02 MM |
3967 | if (TREE_CODE (template_type) == ENUMERAL_TYPE) |
3968 | { | |
dbfe2124 | 3969 | if (!is_partial_instantiation) |
61a127b3 | 3970 | t = start_enum (TYPE_IDENTIFIER (template_type)); |
ed44da02 | 3971 | else |
dbfe2124 | 3972 | /* We don't want to call start_enum for this type, since |
ed44da02 MM |
3973 | the values for the enumeration constants may involve |
3974 | template parameters. And, no one should be interested | |
3975 | in the enumeration constants for such a type. */ | |
3976 | t = make_node (ENUMERAL_TYPE); | |
3977 | } | |
3978 | else | |
3979 | { | |
33848bb0 | 3980 | t = make_aggr_type (TREE_CODE (template_type)); |
ed44da02 MM |
3981 | CLASSTYPE_DECLARED_CLASS (t) |
3982 | = CLASSTYPE_DECLARED_CLASS (template_type); | |
3983 | CLASSTYPE_GOT_SEMICOLON (t) = 1; | |
3984 | SET_CLASSTYPE_IMPLICIT_INSTANTIATION (t); | |
f668f160 | 3985 | TYPE_FOR_JAVA (t) = TYPE_FOR_JAVA (template_type); |
ae673f14 JM |
3986 | |
3987 | /* A local class. Make sure the decl gets registered properly. */ | |
3988 | if (context == current_function_decl) | |
3989 | pushtag (DECL_NAME (template), t, 0); | |
ed44da02 MM |
3990 | } |
3991 | ||
ae673f14 JM |
3992 | /* If we called start_enum or pushtag above, this information |
3993 | will already be set up. */ | |
ed44da02 MM |
3994 | if (!TYPE_NAME (t)) |
3995 | { | |
3996 | TYPE_CONTEXT (t) = FROB_CONTEXT (context); | |
36a117a5 | 3997 | |
9188c363 | 3998 | type_decl = create_implicit_typedef (DECL_NAME (template), t); |
ed44da02 | 3999 | DECL_CONTEXT (type_decl) = TYPE_CONTEXT (t); |
9188c363 | 4000 | TYPE_STUB_DECL (t) = type_decl; |
ed44da02 MM |
4001 | DECL_SOURCE_FILE (type_decl) |
4002 | = DECL_SOURCE_FILE (TYPE_STUB_DECL (template_type)); | |
4003 | DECL_SOURCE_LINE (type_decl) | |
4004 | = DECL_SOURCE_LINE (TYPE_STUB_DECL (template_type)); | |
ed44da02 MM |
4005 | } |
4006 | else | |
4007 | type_decl = TYPE_NAME (t); | |
36a117a5 | 4008 | |
9fbf56f7 MM |
4009 | /* Set up the template information. We have to figure out which |
4010 | template is the immediate parent if this is a full | |
4011 | instantiation. */ | |
4012 | if (parm_depth == 1 || is_partial_instantiation | |
4013 | || !PRIMARY_TEMPLATE_P (template)) | |
4014 | /* This case is easy; there are no member templates involved. */ | |
4015 | found = template; | |
4016 | else | |
4017 | { | |
4018 | /* This is a full instantiation of a member template. There | |
4019 | should be some partial instantiation of which this is an | |
4020 | instance. */ | |
4021 | ||
4022 | for (found = DECL_TEMPLATE_INSTANTIATIONS (template); | |
4023 | found; found = TREE_CHAIN (found)) | |
4024 | { | |
4025 | int success; | |
4026 | tree tmpl = CLASSTYPE_TI_TEMPLATE (TREE_VALUE (found)); | |
4027 | ||
4028 | /* We only want partial instantiations, here, not | |
4029 | specializations or full instantiations. */ | |
370af2d5 | 4030 | if (CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_VALUE (found)) |
9fbf56f7 MM |
4031 | || !uses_template_parms (TREE_VALUE (found))) |
4032 | continue; | |
4033 | ||
4034 | /* Temporarily reduce by one the number of levels in the | |
4035 | ARGLIST and in FOUND so as to avoid comparing the | |
4036 | last set of arguments. */ | |
4037 | TREE_VEC_LENGTH (arglist)--; | |
4038 | TREE_VEC_LENGTH (TREE_PURPOSE (found)) --; | |
4039 | ||
4040 | /* See if the arguments match. If they do, then TMPL is | |
4041 | the partial instantiation we want. */ | |
4042 | success = comp_template_args (TREE_PURPOSE (found), arglist); | |
4043 | ||
4044 | /* Restore the argument vectors to their full size. */ | |
4045 | TREE_VEC_LENGTH (arglist)++; | |
4046 | TREE_VEC_LENGTH (TREE_PURPOSE (found))++; | |
4047 | ||
4048 | if (success) | |
4049 | { | |
4050 | found = tmpl; | |
4051 | break; | |
4052 | } | |
4053 | } | |
4054 | ||
4055 | if (!found) | |
4056 | my_friendly_abort (0); | |
4057 | } | |
4058 | ||
ed44da02 | 4059 | SET_TYPE_TEMPLATE_INFO (t, |
9fbf56f7 | 4060 | tree_cons (found, arglist, NULL_TREE)); |
dbfe2124 MM |
4061 | DECL_TEMPLATE_INSTANTIATIONS (template) |
4062 | = tree_cons (arglist, t, | |
4063 | DECL_TEMPLATE_INSTANTIATIONS (template)); | |
4064 | ||
4065 | if (TREE_CODE (t) == ENUMERAL_TYPE | |
4066 | && !is_partial_instantiation) | |
61a127b3 MM |
4067 | /* Now that the type has been registered on the instantiations |
4068 | list, we set up the enumerators. Because the enumeration | |
4069 | constants may involve the enumeration type itself, we make | |
4070 | sure to register the type first, and then create the | |
4071 | constants. That way, doing tsubst_expr for the enumeration | |
4072 | constants won't result in recursive calls here; we'll find | |
4073 | the instantiation and exit above. */ | |
4074 | tsubst_enum (template_type, t, arglist); | |
dbfe2124 | 4075 | |
36a117a5 MM |
4076 | /* Reset the name of the type, now that CLASSTYPE_TEMPLATE_INFO |
4077 | is set up. */ | |
ed44da02 MM |
4078 | if (TREE_CODE (t) != ENUMERAL_TYPE) |
4079 | DECL_NAME (type_decl) = classtype_mangled_name (t); | |
36a117a5 | 4080 | DECL_ASSEMBLER_NAME (type_decl) = DECL_NAME (type_decl); |
dbfe2124 | 4081 | if (!is_partial_instantiation) |
36a117a5 | 4082 | { |
669ec2b4 JM |
4083 | if (flag_new_abi) |
4084 | DECL_ASSEMBLER_NAME (type_decl) = mangle_decl (type_decl); | |
4085 | else | |
4086 | DECL_ASSEMBLER_NAME (type_decl) | |
4087 | = get_identifier (build_overload_name (t, 1, 1)); | |
50a6dbd7 JM |
4088 | |
4089 | /* For backwards compatibility; code that uses | |
4090 | -fexternal-templates expects looking up a template to | |
4091 | instantiate it. I think DDD still relies on this. | |
4092 | (jason 8/20/1998) */ | |
ed44da02 MM |
4093 | if (TREE_CODE (t) != ENUMERAL_TYPE |
4094 | && flag_external_templates | |
36a117a5 MM |
4095 | && CLASSTYPE_INTERFACE_KNOWN (TREE_TYPE (template)) |
4096 | && ! CLASSTYPE_INTERFACE_ONLY (TREE_TYPE (template))) | |
4097 | add_pending_template (t); | |
4098 | } | |
4099 | else | |
077e7015 MM |
4100 | /* If the type makes use of template parameters, the |
4101 | code that generates debugging information will crash. */ | |
4102 | DECL_IGNORED_P (TYPE_STUB_DECL (t)) = 1; | |
8d08fdba | 4103 | |
36a117a5 MM |
4104 | return t; |
4105 | } | |
8d08fdba MS |
4106 | } |
4107 | \f | |
8dfaeb63 | 4108 | struct pair_fn_data |
8d08fdba | 4109 | { |
8dfaeb63 MM |
4110 | tree_fn_t fn; |
4111 | void *data; | |
4112 | }; | |
4113 | ||
4114 | /* Called from for_each_template_parm via walk_tree. */ | |
581d38d0 | 4115 | |
8dfaeb63 MM |
4116 | static tree |
4117 | for_each_template_parm_r (tp, walk_subtrees, d) | |
4118 | tree *tp; | |
4119 | int *walk_subtrees; | |
4120 | void *d; | |
4121 | { | |
4122 | tree t = *tp; | |
4123 | struct pair_fn_data *pfd = (struct pair_fn_data *) d; | |
4124 | tree_fn_t fn = pfd->fn; | |
4125 | void *data = pfd->data; | |
4126 | ||
2f939d94 | 4127 | if (TYPE_P (t) |
581d38d0 | 4128 | && for_each_template_parm (TYPE_CONTEXT (t), fn, data)) |
8dfaeb63 | 4129 | return error_mark_node; |
581d38d0 | 4130 | |
8d08fdba MS |
4131 | switch (TREE_CODE (t)) |
4132 | { | |
8d08fdba | 4133 | case RECORD_TYPE: |
b7484fbe | 4134 | if (TYPE_PTRMEMFUNC_FLAG (t)) |
8dfaeb63 | 4135 | break; |
ed44da02 MM |
4136 | /* Fall through. */ |
4137 | ||
8d08fdba | 4138 | case UNION_TYPE: |
ed44da02 | 4139 | case ENUMERAL_TYPE: |
8dfaeb63 MM |
4140 | if (!TYPE_TEMPLATE_INFO (t)) |
4141 | *walk_subtrees = 0; | |
4142 | else if (for_each_template_parm (TREE_VALUE (TYPE_TEMPLATE_INFO (t)), | |
4143 | fn, data)) | |
4144 | return error_mark_node; | |
4145 | break; | |
4146 | ||
588c2d1c | 4147 | case METHOD_TYPE: |
8dfaeb63 MM |
4148 | /* Since we're not going to walk subtrees, we have to do this |
4149 | explicitly here. */ | |
588c2d1c | 4150 | if (for_each_template_parm (TYPE_METHOD_BASETYPE (t), fn, data)) |
8dfaeb63 | 4151 | return error_mark_node; |
588c2d1c MM |
4152 | |
4153 | case FUNCTION_TYPE: | |
8dfaeb63 MM |
4154 | /* Check the return type. */ |
4155 | if (for_each_template_parm (TREE_TYPE (t), fn, data)) | |
4156 | return error_mark_node; | |
4157 | ||
588c2d1c MM |
4158 | /* Check the parameter types. Since default arguments are not |
4159 | instantiated until they are needed, the TYPE_ARG_TYPES may | |
4160 | contain expressions that involve template parameters. But, | |
4161 | no-one should be looking at them yet. And, once they're | |
4162 | instantiated, they don't contain template parameters, so | |
4163 | there's no point in looking at them then, either. */ | |
4164 | { | |
4165 | tree parm; | |
4166 | ||
4167 | for (parm = TYPE_ARG_TYPES (t); parm; parm = TREE_CHAIN (parm)) | |
4168 | if (for_each_template_parm (TREE_VALUE (parm), fn, data)) | |
8dfaeb63 | 4169 | return error_mark_node; |
5566b478 | 4170 | |
8dfaeb63 MM |
4171 | /* Since we've already handled the TYPE_ARG_TYPES, we don't |
4172 | want walk_tree walking into them itself. */ | |
4173 | *walk_subtrees = 0; | |
4174 | } | |
4175 | break; | |
3ac3d9ea | 4176 | |
8d08fdba | 4177 | case FUNCTION_DECL: |
5566b478 | 4178 | case VAR_DECL: |
5566b478 | 4179 | if (DECL_LANG_SPECIFIC (t) && DECL_TEMPLATE_INFO (t) |
050367a3 | 4180 | && for_each_template_parm (DECL_TI_ARGS (t), fn, data)) |
8dfaeb63 MM |
4181 | return error_mark_node; |
4182 | /* Fall through. */ | |
4183 | ||
4184 | case CONST_DECL: | |
8d08fdba | 4185 | case PARM_DECL: |
050367a3 MM |
4186 | if (DECL_CONTEXT (t) |
4187 | && for_each_template_parm (DECL_CONTEXT (t), fn, data)) | |
8dfaeb63 MM |
4188 | return error_mark_node; |
4189 | break; | |
8d08fdba | 4190 | |
73b0fce8 | 4191 | case TEMPLATE_TEMPLATE_PARM: |
744fac59 | 4192 | /* Record template parameters such as `T' inside `TT<T>'. */ |
7ddedda4 MM |
4193 | if (TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (t) |
4194 | && for_each_template_parm (TYPE_TI_ARGS (t), fn, data)) | |
8dfaeb63 MM |
4195 | return error_mark_node; |
4196 | /* Fall through. */ | |
4197 | ||
744fac59 | 4198 | case TEMPLATE_TYPE_PARM: |
f84b4be9 | 4199 | case TEMPLATE_PARM_INDEX: |
8dfaeb63 MM |
4200 | if (fn && (*fn)(t, data)) |
4201 | return error_mark_node; | |
4202 | else if (!fn) | |
4203 | return error_mark_node; | |
4204 | break; | |
5156628f | 4205 | |
8dfaeb63 MM |
4206 | case TEMPLATE_DECL: |
4207 | /* A template template parameter is encountered */ | |
4208 | if (DECL_TEMPLATE_TEMPLATE_PARM_P (t) | |
4209 | && for_each_template_parm (TREE_TYPE (t), fn, data)) | |
4210 | return error_mark_node; | |
db5ae43f | 4211 | |
8dfaeb63 MM |
4212 | /* Already substituted template template parameter */ |
4213 | *walk_subtrees = 0; | |
4214 | break; | |
b8865407 | 4215 | |
4699c561 | 4216 | case TYPENAME_TYPE: |
8dfaeb63 MM |
4217 | if (!fn || for_each_template_parm (TYPENAME_TYPE_FULLNAME (t), fn, data)) |
4218 | return error_mark_node; | |
4219 | break; | |
4699c561 | 4220 | |
8dfaeb63 MM |
4221 | case CONSTRUCTOR: |
4222 | if (TREE_TYPE (t) && TYPE_PTRMEMFUNC_P (TREE_TYPE (t)) | |
4223 | && for_each_template_parm (TYPE_PTRMEMFUNC_FN_TYPE | |
4224 | (TREE_TYPE (t)), fn, data)) | |
4225 | return error_mark_node; | |
4226 | break; | |
4227 | ||
b8865407 MM |
4228 | case INDIRECT_REF: |
4229 | case COMPONENT_REF: | |
4699c561 | 4230 | /* If there's no type, then this thing must be some expression |
b8865407 | 4231 | involving template parameters. */ |
4699c561 | 4232 | if (!fn && !TREE_TYPE (t)) |
8dfaeb63 MM |
4233 | return error_mark_node; |
4234 | break; | |
b8865407 | 4235 | |
42976354 BK |
4236 | case MODOP_EXPR: |
4237 | case CAST_EXPR: | |
4238 | case REINTERPRET_CAST_EXPR: | |
4239 | case CONST_CAST_EXPR: | |
4240 | case STATIC_CAST_EXPR: | |
4241 | case DYNAMIC_CAST_EXPR: | |
42976354 BK |
4242 | case ARROW_EXPR: |
4243 | case DOTSTAR_EXPR: | |
4244 | case TYPEID_EXPR: | |
b8865407 | 4245 | case LOOKUP_EXPR: |
40242ccf | 4246 | case PSEUDO_DTOR_EXPR: |
b8865407 | 4247 | if (!fn) |
8dfaeb63 MM |
4248 | return error_mark_node; |
4249 | break; | |
abff8e06 | 4250 | |
8d08fdba | 4251 | default: |
8dfaeb63 | 4252 | break; |
8d08fdba | 4253 | } |
8dfaeb63 MM |
4254 | |
4255 | /* We didn't find any template parameters we liked. */ | |
4256 | return NULL_TREE; | |
4257 | } | |
4258 | ||
4259 | /* For each TEMPLATE_TYPE_PARM, TEMPLATE_TEMPLATE_PARM, or | |
4260 | TEMPLATE_PARM_INDEX in T, call FN with the parameter and the DATA. | |
4261 | If FN returns non-zero, the iteration is terminated, and | |
4262 | for_each_template_parm returns 1. Otherwise, the iteration | |
4263 | continues. If FN never returns a non-zero value, the value | |
4264 | returned by for_each_template_parm is 0. If FN is NULL, it is | |
4265 | considered to be the function which always returns 1. */ | |
4266 | ||
4267 | static int | |
4268 | for_each_template_parm (t, fn, data) | |
4269 | tree t; | |
4270 | tree_fn_t fn; | |
4271 | void* data; | |
4272 | { | |
4273 | struct pair_fn_data pfd; | |
4274 | ||
4275 | /* Set up. */ | |
4276 | pfd.fn = fn; | |
4277 | pfd.data = data; | |
4278 | ||
4279 | /* Walk the tree. */ | |
4280 | return walk_tree (&t, for_each_template_parm_r, &pfd) != NULL_TREE; | |
8d08fdba MS |
4281 | } |
4282 | ||
050367a3 MM |
4283 | int |
4284 | uses_template_parms (t) | |
4285 | tree t; | |
4286 | { | |
4287 | return for_each_template_parm (t, 0, 0); | |
4288 | } | |
4289 | ||
27fafc8d | 4290 | static int tinst_depth; |
e9f32eb5 | 4291 | extern int max_tinst_depth; |
5566b478 | 4292 | #ifdef GATHER_STATISTICS |
27fafc8d | 4293 | int depth_reached; |
5566b478 | 4294 | #endif |
8dfaeb63 MM |
4295 | static int tinst_level_tick; |
4296 | static int last_template_error_tick; | |
8d08fdba | 4297 | |
7bae46f4 | 4298 | /* Print out all the template instantiations that we are currently |
27fafc8d JM |
4299 | working on. If ERR, we are being called from cp_thing, so do |
4300 | the right thing for an error message. */ | |
7bae46f4 | 4301 | |
27fafc8d JM |
4302 | static void |
4303 | print_template_context (err) | |
4304 | int err; | |
7bae46f4 | 4305 | { |
3ae18eaf | 4306 | tree p = current_tinst_level; |
7bae46f4 | 4307 | int line = lineno; |
3b304f5b | 4308 | const char *file = input_filename; |
7bae46f4 | 4309 | |
49e04385 | 4310 | if (err && p) |
27fafc8d | 4311 | { |
3ae18eaf | 4312 | if (current_function_decl != TINST_DECL (p) |
49e04385 MM |
4313 | && current_function_decl != NULL_TREE) |
4314 | /* We can get here during the processing of some synthesized | |
3ae18eaf | 4315 | method. Then, TINST_DECL (p) will be the function that's causing |
49e04385 MM |
4316 | the synthesis. */ |
4317 | ; | |
27fafc8d | 4318 | else |
27fafc8d | 4319 | { |
3ae18eaf | 4320 | if (current_function_decl == TINST_DECL (p)) |
49e04385 MM |
4321 | /* Avoid redundancy with the the "In function" line. */; |
4322 | else | |
4323 | fprintf (stderr, "%s: In instantiation of `%s':\n", | |
3ae18eaf JM |
4324 | file, decl_as_string (TINST_DECL (p), |
4325 | TS_DECL_TYPE | TS_FUNC_NORETURN)); | |
49e04385 | 4326 | |
3ae18eaf JM |
4327 | line = TINST_LINE (p); |
4328 | file = TINST_FILE (p); | |
4329 | p = TREE_CHAIN (p); | |
27fafc8d JM |
4330 | } |
4331 | } | |
4332 | ||
3ae18eaf | 4333 | for (; p; p = TREE_CHAIN (p)) |
7bae46f4 | 4334 | { |
038fb86f | 4335 | fprintf (stderr, "%s:%d: instantiated from `%s'\n", file, line, |
3ae18eaf JM |
4336 | decl_as_string (TINST_DECL (p), |
4337 | TS_DECL_TYPE | TS_FUNC_NORETURN)); | |
4338 | line = TINST_LINE (p); | |
4339 | file = TINST_FILE (p); | |
7bae46f4 | 4340 | } |
038fb86f | 4341 | fprintf (stderr, "%s:%d: instantiated from here\n", file, line); |
7bae46f4 JM |
4342 | } |
4343 | ||
27fafc8d JM |
4344 | /* Called from cp_thing to print the template context for an error. */ |
4345 | ||
4346 | void | |
4347 | maybe_print_template_context () | |
4348 | { | |
4349 | if (last_template_error_tick == tinst_level_tick | |
4350 | || current_tinst_level == 0) | |
4351 | return; | |
4352 | ||
4353 | last_template_error_tick = tinst_level_tick; | |
4354 | print_template_context (1); | |
4355 | } | |
4356 | ||
3ae18eaf JM |
4357 | /* We're starting to instantiate D; record the template instantiation context |
4358 | for diagnostics and to restore it later. */ | |
4359 | ||
bd6dd845 | 4360 | static int |
5566b478 MS |
4361 | push_tinst_level (d) |
4362 | tree d; | |
8d08fdba | 4363 | { |
3ae18eaf | 4364 | tree new; |
8d08fdba | 4365 | |
7215f9a0 MS |
4366 | if (tinst_depth >= max_tinst_depth) |
4367 | { | |
8adf5b5e JM |
4368 | /* If the instantiation in question still has unbound template parms, |
4369 | we don't really care if we can't instantiate it, so just return. | |
4370 | This happens with base instantiation for implicit `typename'. */ | |
4371 | if (uses_template_parms (d)) | |
4372 | return 0; | |
4373 | ||
1139b3d8 | 4374 | last_template_error_tick = tinst_level_tick; |
b4f4233d GDR |
4375 | cp_error ("template instantiation depth exceeds maximum of %d (use -ftemplate-depth-NN to increase the maximum) instantiating `%D'", |
4376 | max_tinst_depth, d); | |
5566b478 | 4377 | |
27fafc8d | 4378 | print_template_context (0); |
5566b478 | 4379 | |
7215f9a0 MS |
4380 | return 0; |
4381 | } | |
4382 | ||
3ae18eaf JM |
4383 | new = build_expr_wfl (d, input_filename, lineno, 0); |
4384 | TREE_CHAIN (new) = current_tinst_level; | |
8d08fdba | 4385 | current_tinst_level = new; |
5566b478 | 4386 | |
7215f9a0 | 4387 | ++tinst_depth; |
5566b478 MS |
4388 | #ifdef GATHER_STATISTICS |
4389 | if (tinst_depth > depth_reached) | |
4390 | depth_reached = tinst_depth; | |
4391 | #endif | |
4392 | ||
27fafc8d | 4393 | ++tinst_level_tick; |
7215f9a0 | 4394 | return 1; |
8d08fdba MS |
4395 | } |
4396 | ||
3ae18eaf JM |
4397 | /* We're done instantiating this template; return to the instantiation |
4398 | context. */ | |
4399 | ||
8d08fdba MS |
4400 | void |
4401 | pop_tinst_level () | |
4402 | { | |
3ae18eaf | 4403 | tree old = current_tinst_level; |
8d08fdba | 4404 | |
ae58fa02 MM |
4405 | /* Restore the filename and line number stashed away when we started |
4406 | this instantiation. */ | |
3ae18eaf JM |
4407 | lineno = TINST_LINE (old); |
4408 | input_filename = TINST_FILE (old); | |
5f2c99c4 | 4409 | extract_interface_info (); |
ae58fa02 | 4410 | |
3ae18eaf | 4411 | current_tinst_level = TREE_CHAIN (old); |
7215f9a0 | 4412 | --tinst_depth; |
27fafc8d | 4413 | ++tinst_level_tick; |
8d08fdba MS |
4414 | } |
4415 | ||
3ae18eaf JM |
4416 | /* We're instantiating a deferred template; restore the template |
4417 | instantiation context in which the instantiation was requested, which | |
4418 | is one step out from LEVEL. */ | |
4419 | ||
4420 | static void | |
4421 | reopen_tinst_level (level) | |
4422 | tree level; | |
4423 | { | |
4424 | tree t; | |
4425 | ||
4426 | tinst_depth = 0; | |
4427 | for (t = level; t; t = TREE_CHAIN (t)) | |
4428 | ++tinst_depth; | |
4429 | ||
4430 | current_tinst_level = level; | |
4431 | pop_tinst_level (); | |
4432 | } | |
4433 | ||
4434 | /* Return the outermost template instantiation context, for use with | |
4435 | -falt-external-templates. */ | |
4436 | ||
4437 | tree | |
8d08fdba MS |
4438 | tinst_for_decl () |
4439 | { | |
3ae18eaf | 4440 | tree p = current_tinst_level; |
8d08fdba MS |
4441 | |
4442 | if (p) | |
3ae18eaf | 4443 | for (; TREE_CHAIN (p) ; p = TREE_CHAIN (p)) |
8d08fdba MS |
4444 | ; |
4445 | return p; | |
4446 | } | |
4447 | ||
f84b4be9 JM |
4448 | /* DECL is a friend FUNCTION_DECL or TEMPLATE_DECL. ARGS is the |
4449 | vector of template arguments, as for tsubst. | |
4450 | ||
4451 | Returns an appropriate tsbust'd friend declaration. */ | |
4452 | ||
4453 | static tree | |
4454 | tsubst_friend_function (decl, args) | |
4455 | tree decl; | |
4456 | tree args; | |
4457 | { | |
4458 | tree new_friend; | |
27fafc8d | 4459 | int line = lineno; |
3b304f5b | 4460 | const char *file = input_filename; |
27fafc8d JM |
4461 | |
4462 | lineno = DECL_SOURCE_LINE (decl); | |
4463 | input_filename = DECL_SOURCE_FILE (decl); | |
4464 | ||
f84b4be9 JM |
4465 | if (TREE_CODE (decl) == FUNCTION_DECL |
4466 | && DECL_TEMPLATE_INSTANTIATION (decl) | |
4467 | && TREE_CODE (DECL_TI_TEMPLATE (decl)) != TEMPLATE_DECL) | |
4468 | /* This was a friend declared with an explicit template | |
4469 | argument list, e.g.: | |
4470 | ||
4471 | friend void f<>(T); | |
4472 | ||
4473 | to indicate that f was a template instantiation, not a new | |
4474 | function declaration. Now, we have to figure out what | |
4475 | instantiation of what template. */ | |
4476 | { | |
4477 | tree template_id; | |
4478 | tree new_args; | |
4479 | tree tmpl; | |
f84b4be9 JM |
4480 | |
4481 | template_id | |
4482 | = lookup_template_function (tsubst_expr (DECL_TI_TEMPLATE (decl), | |
4393e105 MM |
4483 | args, /*complain=*/1, |
4484 | NULL_TREE), | |
f84b4be9 | 4485 | tsubst (DECL_TI_ARGS (decl), |
4393e105 MM |
4486 | args, /*complain=*/1, |
4487 | NULL_TREE)); | |
4393e105 | 4488 | new_friend = tsubst (decl, args, /*complain=*/1, NULL_TREE); |
36a117a5 MM |
4489 | tmpl = determine_specialization (template_id, new_friend, |
4490 | &new_args, | |
bf8f3f93 | 4491 | /*need_member_template=*/0); |
27fafc8d JM |
4492 | new_friend = instantiate_template (tmpl, new_args); |
4493 | goto done; | |
f84b4be9 | 4494 | } |
36a117a5 | 4495 | |
4393e105 | 4496 | new_friend = tsubst (decl, args, /*complain=*/1, NULL_TREE); |
f84b4be9 | 4497 | |
36a117a5 | 4498 | /* The NEW_FRIEND will look like an instantiation, to the |
f84b4be9 JM |
4499 | compiler, but is not an instantiation from the point of view of |
4500 | the language. For example, we might have had: | |
4501 | ||
4502 | template <class T> struct S { | |
4503 | template <class U> friend void f(T, U); | |
4504 | }; | |
4505 | ||
4506 | Then, in S<int>, template <class U> void f(int, U) is not an | |
4507 | instantiation of anything. */ | |
4508 | DECL_USE_TEMPLATE (new_friend) = 0; | |
4509 | if (TREE_CODE (decl) == TEMPLATE_DECL) | |
4510 | DECL_USE_TEMPLATE (DECL_TEMPLATE_RESULT (new_friend)) = 0; | |
36a117a5 MM |
4511 | |
4512 | /* The mangled name for the NEW_FRIEND is incorrect. The call to | |
669ec2b4 JM |
4513 | tsubst will have resulted in a call to |
4514 | set_mangled_name_for_template_decl. But, the function is not a | |
4515 | template instantiation and should not be mangled like one. | |
4516 | Therefore, we remangle the function name. We don't have to do | |
4517 | this if the NEW_FRIEND is a template since | |
36a117a5 MM |
4518 | set_mangled_name_for_template_decl doesn't do anything if the |
4519 | function declaration still uses template arguments. */ | |
4520 | if (TREE_CODE (new_friend) != TEMPLATE_DECL) | |
4521 | { | |
4522 | set_mangled_name_for_decl (new_friend); | |
4523 | DECL_RTL (new_friend) = 0; | |
4524 | make_decl_rtl (new_friend, NULL_PTR, 1); | |
4525 | } | |
4526 | ||
6eb3bb27 | 4527 | if (DECL_NAMESPACE_SCOPE_P (new_friend)) |
f84b4be9 | 4528 | { |
36a117a5 | 4529 | tree old_decl; |
fbf1c34b MM |
4530 | tree new_friend_template_info; |
4531 | tree new_friend_result_template_info; | |
92da7074 | 4532 | tree ns; |
fbf1c34b MM |
4533 | int new_friend_is_defn; |
4534 | ||
4535 | /* We must save some information from NEW_FRIEND before calling | |
4536 | duplicate decls since that function will free NEW_FRIEND if | |
4537 | possible. */ | |
4538 | new_friend_template_info = DECL_TEMPLATE_INFO (new_friend); | |
f84b4be9 | 4539 | if (TREE_CODE (new_friend) == TEMPLATE_DECL) |
fbf1c34b MM |
4540 | { |
4541 | /* This declaration is a `primary' template. */ | |
4542 | DECL_PRIMARY_TEMPLATE (new_friend) = new_friend; | |
4543 | ||
4544 | new_friend_is_defn | |
17aec3eb | 4545 | = DECL_INITIAL (DECL_TEMPLATE_RESULT (new_friend)) != NULL_TREE; |
fbf1c34b | 4546 | new_friend_result_template_info |
17aec3eb | 4547 | = DECL_TEMPLATE_INFO (DECL_TEMPLATE_RESULT (new_friend)); |
fbf1c34b MM |
4548 | } |
4549 | else | |
4550 | { | |
4551 | new_friend_is_defn = DECL_INITIAL (new_friend) != NULL_TREE; | |
4552 | new_friend_result_template_info = NULL_TREE; | |
4553 | } | |
36a117a5 | 4554 | |
1c227897 MM |
4555 | /* Inside pushdecl_namespace_level, we will push into the |
4556 | current namespace. However, the friend function should go | |
4557 | into the namespace of the template. */ | |
92da7074 ML |
4558 | ns = decl_namespace_context (new_friend); |
4559 | push_nested_namespace (ns); | |
36a117a5 | 4560 | old_decl = pushdecl_namespace_level (new_friend); |
92da7074 | 4561 | pop_nested_namespace (ns); |
36a117a5 MM |
4562 | |
4563 | if (old_decl != new_friend) | |
4564 | { | |
4565 | /* This new friend declaration matched an existing | |
4566 | declaration. For example, given: | |
4567 | ||
4568 | template <class T> void f(T); | |
4569 | template <class U> class C { | |
4570 | template <class T> friend void f(T) {} | |
4571 | }; | |
4572 | ||
4573 | the friend declaration actually provides the definition | |
4574 | of `f', once C has been instantiated for some type. So, | |
4575 | old_decl will be the out-of-class template declaration, | |
4576 | while new_friend is the in-class definition. | |
4577 | ||
4578 | But, if `f' was called before this point, the | |
4579 | instantiation of `f' will have DECL_TI_ARGS corresponding | |
4580 | to `T' but not to `U', references to which might appear | |
4581 | in the definition of `f'. Previously, the most general | |
4582 | template for an instantiation of `f' was the out-of-class | |
4583 | version; now it is the in-class version. Therefore, we | |
4584 | run through all specialization of `f', adding to their | |
4585 | DECL_TI_ARGS appropriately. In particular, they need a | |
4586 | new set of outer arguments, corresponding to the | |
4587 | arguments for this class instantiation. | |
4588 | ||
4589 | The same situation can arise with something like this: | |
4590 | ||
4591 | friend void f(int); | |
4592 | template <class T> class C { | |
4593 | friend void f(T) {} | |
4594 | }; | |
4595 | ||
4596 | when `C<int>' is instantiated. Now, `f(int)' is defined | |
4597 | in the class. */ | |
4598 | ||
fbf1c34b MM |
4599 | if (!new_friend_is_defn) |
4600 | /* On the other hand, if the in-class declaration does | |
4601 | *not* provide a definition, then we don't want to alter | |
4602 | existing definitions. We can just leave everything | |
4603 | alone. */ | |
36a117a5 | 4604 | ; |
fbf1c34b | 4605 | else |
36a117a5 | 4606 | { |
fbf1c34b MM |
4607 | /* Overwrite whatever template info was there before, if |
4608 | any, with the new template information pertaining to | |
4609 | the declaration. */ | |
4610 | DECL_TEMPLATE_INFO (old_decl) = new_friend_template_info; | |
4611 | ||
4612 | if (TREE_CODE (old_decl) != TEMPLATE_DECL) | |
4613 | /* duplicate_decls will take care of this case. */ | |
4614 | ; | |
4615 | else | |
36a117a5 | 4616 | { |
fbf1c34b MM |
4617 | tree t; |
4618 | tree new_friend_args; | |
4619 | ||
17aec3eb | 4620 | DECL_TEMPLATE_INFO (DECL_TEMPLATE_RESULT (old_decl)) |
fbf1c34b MM |
4621 | = new_friend_result_template_info; |
4622 | ||
4623 | new_friend_args = TI_ARGS (new_friend_template_info); | |
4624 | for (t = DECL_TEMPLATE_SPECIALIZATIONS (old_decl); | |
4625 | t != NULL_TREE; | |
4626 | t = TREE_CHAIN (t)) | |
4627 | { | |
4628 | tree spec = TREE_VALUE (t); | |
36a117a5 | 4629 | |
fbf1c34b MM |
4630 | DECL_TI_ARGS (spec) |
4631 | = add_outermost_template_args (new_friend_args, | |
4632 | DECL_TI_ARGS (spec)); | |
fbf1c34b MM |
4633 | } |
4634 | ||
4635 | /* Now, since specializations are always supposed to | |
4636 | hang off of the most general template, we must move | |
4637 | them. */ | |
4638 | t = most_general_template (old_decl); | |
4639 | if (t != old_decl) | |
4640 | { | |
4641 | DECL_TEMPLATE_SPECIALIZATIONS (t) | |
4642 | = chainon (DECL_TEMPLATE_SPECIALIZATIONS (t), | |
4643 | DECL_TEMPLATE_SPECIALIZATIONS (old_decl)); | |
4644 | DECL_TEMPLATE_SPECIALIZATIONS (old_decl) = NULL_TREE; | |
4645 | } | |
36a117a5 MM |
4646 | } |
4647 | } | |
4648 | ||
4649 | /* The information from NEW_FRIEND has been merged into OLD_DECL | |
4650 | by duplicate_decls. */ | |
4651 | new_friend = old_decl; | |
4652 | } | |
f84b4be9 | 4653 | } |
d0f062fb | 4654 | else if (COMPLETE_TYPE_P (DECL_CONTEXT (new_friend))) |
f84b4be9 JM |
4655 | { |
4656 | /* Check to see that the declaration is really present, and, | |
4657 | possibly obtain an improved declaration. */ | |
4658 | tree fn = check_classfn (DECL_CONTEXT (new_friend), | |
4659 | new_friend); | |
4660 | ||
4661 | if (fn) | |
4662 | new_friend = fn; | |
4663 | } | |
4664 | ||
27fafc8d JM |
4665 | done: |
4666 | lineno = line; | |
4667 | input_filename = file; | |
f84b4be9 JM |
4668 | return new_friend; |
4669 | } | |
4670 | ||
1aed5355 MM |
4671 | /* FRIEND_TMPL is a friend TEMPLATE_DECL. ARGS is the vector of |
4672 | template arguments, as for tsubst. | |
6757edfe MM |
4673 | |
4674 | Returns an appropriate tsbust'd friend type. */ | |
4675 | ||
4676 | static tree | |
1aed5355 MM |
4677 | tsubst_friend_class (friend_tmpl, args) |
4678 | tree friend_tmpl; | |
6757edfe MM |
4679 | tree args; |
4680 | { | |
1aed5355 | 4681 | tree friend_type; |
25aab5d0 | 4682 | tree tmpl; |
6757edfe | 4683 | |
25aab5d0 MM |
4684 | /* First, we look for a class template. */ |
4685 | tmpl = lookup_name (DECL_NAME (friend_tmpl), /*prefer_type=*/0); | |
4686 | ||
4687 | /* But, if we don't find one, it might be because we're in a | |
4688 | situation like this: | |
4689 | ||
4690 | template <class T> | |
4691 | struct S { | |
4692 | template <class U> | |
4693 | friend struct S; | |
4694 | }; | |
4695 | ||
4696 | Here, in the scope of (say) S<int>, `S' is bound to a TYPE_DECL | |
4697 | for `S<int>', not the TEMPLATE_DECL. */ | |
bc639f90 | 4698 | if (!tmpl || !DECL_CLASS_TEMPLATE_P (tmpl)) |
25aab5d0 MM |
4699 | { |
4700 | tmpl = lookup_name (DECL_NAME (friend_tmpl), /*prefer_type=*/1); | |
4701 | tmpl = maybe_get_template_decl_from_type_decl (tmpl); | |
4702 | } | |
6757edfe | 4703 | |
25aab5d0 | 4704 | if (tmpl && DECL_CLASS_TEMPLATE_P (tmpl)) |
6757edfe MM |
4705 | { |
4706 | /* The friend template has already been declared. Just | |
36a117a5 MM |
4707 | check to see that the declarations match, and install any new |
4708 | default parameters. We must tsubst the default parameters, | |
4709 | of course. We only need the innermost template parameters | |
4710 | because that is all that redeclare_class_template will look | |
4711 | at. */ | |
4712 | tree parms | |
4713 | = tsubst_template_parms (DECL_TEMPLATE_PARMS (friend_tmpl), | |
4393e105 | 4714 | args, /*complain=*/1); |
36a117a5 | 4715 | redeclare_class_template (TREE_TYPE (tmpl), parms); |
6757edfe MM |
4716 | friend_type = TREE_TYPE (tmpl); |
4717 | } | |
4718 | else | |
4719 | { | |
4720 | /* The friend template has not already been declared. In this | |
4721 | case, the instantiation of the template class will cause the | |
4722 | injection of this template into the global scope. */ | |
4393e105 | 4723 | tmpl = tsubst (friend_tmpl, args, /*complain=*/1, NULL_TREE); |
6757edfe MM |
4724 | |
4725 | /* The new TMPL is not an instantiation of anything, so we | |
4726 | forget its origins. We don't reset CLASSTYPE_TI_TEMPLATE for | |
4727 | the new type because that is supposed to be the corresponding | |
4728 | template decl, i.e., TMPL. */ | |
4729 | DECL_USE_TEMPLATE (tmpl) = 0; | |
4730 | DECL_TEMPLATE_INFO (tmpl) = NULL_TREE; | |
4731 | CLASSTYPE_USE_TEMPLATE (TREE_TYPE (tmpl)) = 0; | |
4732 | ||
4733 | /* Inject this template into the global scope. */ | |
4734 | friend_type = TREE_TYPE (pushdecl_top_level (tmpl)); | |
4735 | } | |
4736 | ||
4737 | return friend_type; | |
4738 | } | |
f84b4be9 | 4739 | |
8d08fdba | 4740 | tree |
5566b478 MS |
4741 | instantiate_class_template (type) |
4742 | tree type; | |
8d08fdba | 4743 | { |
61a127b3 | 4744 | tree template, args, pattern, t; |
36a117a5 | 4745 | tree typedecl; |
8d08fdba | 4746 | |
5566b478 | 4747 | if (type == error_mark_node) |
8d08fdba MS |
4748 | return error_mark_node; |
4749 | ||
d0f062fb | 4750 | if (TYPE_BEING_DEFINED (type) || COMPLETE_TYPE_P (type)) |
5566b478 MS |
4751 | return type; |
4752 | ||
6bdb985f | 4753 | /* Figure out which template is being instantiated. */ |
36a117a5 | 4754 | template = most_general_template (CLASSTYPE_TI_TEMPLATE (type)); |
5566b478 | 4755 | my_friendly_assert (TREE_CODE (template) == TEMPLATE_DECL, 279); |
73aad9b9 | 4756 | |
6bdb985f MM |
4757 | /* Figure out which arguments are being used to do the |
4758 | instantiation. */ | |
4759 | args = CLASSTYPE_TI_ARGS (type); | |
4c571114 | 4760 | PARTIAL_INSTANTIATION_P (type) = uses_template_parms (args); |
6bdb985f | 4761 | |
4c571114 MM |
4762 | if (pedantic && PARTIAL_INSTANTIATION_P (type)) |
4763 | /* If this is a partial instantiation, then we can't instantiate | |
4764 | the type; there's no telling whether or not one of the | |
4765 | template parameters might eventually be instantiated to some | |
4766 | value that results in a specialization being used. For | |
4767 | example, consider: | |
4768 | ||
4769 | template <class T> | |
4770 | struct S {}; | |
4771 | ||
4772 | template <class U> | |
4773 | void f(S<U>); | |
4774 | ||
4775 | template <> | |
4776 | struct S<int> {}; | |
4777 | ||
4778 | Now, the `S<U>' in `f<int>' is the specialization, not an | |
5db698f6 | 4779 | instantiation of the original template. */ |
f31c0a32 | 4780 | return type; |
4c571114 MM |
4781 | |
4782 | /* Determine what specialization of the original template to | |
4783 | instantiate. */ | |
4784 | if (PARTIAL_INSTANTIATION_P (type)) | |
6bdb985f MM |
4785 | /* There's no telling which specialization is appropriate at this |
4786 | point. Since all peeking at the innards of this partial | |
4787 | instantiation are extensions (like the "implicit typename" | |
4788 | extension, which allows users to omit the keyword `typename' on | |
4789 | names that are declared as types in template base classes), we | |
4790 | are free to do what we please. | |
4791 | ||
4792 | Trying to figure out which partial instantiation to use can | |
4793 | cause a crash. (Some of the template arguments don't even have | |
4794 | types.) So, we just use the most general version. */ | |
4795 | t = NULL_TREE; | |
4796 | else | |
73aad9b9 | 4797 | { |
6bdb985f MM |
4798 | t = most_specialized_class (template, args); |
4799 | ||
4800 | if (t == error_mark_node) | |
73aad9b9 | 4801 | { |
d8e178a0 | 4802 | const char *str = "candidates are:"; |
6bdb985f MM |
4803 | cp_error ("ambiguous class template instantiation for `%#T'", type); |
4804 | for (t = DECL_TEMPLATE_SPECIALIZATIONS (template); t; | |
4805 | t = TREE_CHAIN (t)) | |
73aad9b9 | 4806 | { |
6bdb985f MM |
4807 | if (get_class_bindings (TREE_VALUE (t), TREE_PURPOSE (t), |
4808 | args)) | |
4809 | { | |
4810 | cp_error_at ("%s %+#T", str, TREE_TYPE (t)); | |
4811 | str = " "; | |
4812 | } | |
73aad9b9 | 4813 | } |
6bdb985f | 4814 | TYPE_BEING_DEFINED (type) = 1; |
f31c0a32 | 4815 | return error_mark_node; |
73aad9b9 | 4816 | } |
73aad9b9 | 4817 | } |
6bdb985f MM |
4818 | |
4819 | if (t) | |
73aad9b9 JM |
4820 | pattern = TREE_TYPE (t); |
4821 | else | |
4822 | pattern = TREE_TYPE (template); | |
5566b478 | 4823 | |
4c571114 MM |
4824 | /* If the template we're instantiating is incomplete, then clearly |
4825 | there's nothing we can do. */ | |
d0f062fb | 4826 | if (!COMPLETE_TYPE_P (pattern)) |
f31c0a32 | 4827 | return type; |
5566b478 | 4828 | |
4c571114 MM |
4829 | /* If this is a partial instantiation, don't tsubst anything. We will |
4830 | only use this type for implicit typename, so the actual contents don't | |
4831 | matter. All that matters is whether a particular name is a type. */ | |
4832 | if (PARTIAL_INSTANTIATION_P (type)) | |
4833 | { | |
4834 | /* The fields set here must be kept in sync with those cleared | |
4835 | in begin_class_definition. */ | |
4836 | TYPE_BINFO_BASETYPES (type) = TYPE_BINFO_BASETYPES (pattern); | |
4837 | TYPE_FIELDS (type) = TYPE_FIELDS (pattern); | |
4838 | TYPE_METHODS (type) = TYPE_METHODS (pattern); | |
4839 | CLASSTYPE_TAGS (type) = CLASSTYPE_TAGS (pattern); | |
4840 | /* Pretend that the type is complete, so that we will look | |
4841 | inside it during name lookup and such. */ | |
867580ce | 4842 | TYPE_SIZE (type) = bitsize_zero_node; |
f31c0a32 | 4843 | return type; |
4c571114 MM |
4844 | } |
4845 | ||
4846 | /* If we've recursively instantiated too many templates, stop. */ | |
4847 | if (! push_tinst_level (type)) | |
f31c0a32 | 4848 | return type; |
4c571114 MM |
4849 | |
4850 | /* Now we're really doing the instantiation. Mark the type as in | |
4851 | the process of being defined. */ | |
4852 | TYPE_BEING_DEFINED (type) = 1; | |
4853 | ||
4854 | maybe_push_to_top_level (uses_template_parms (type)); | |
4c571114 | 4855 | |
73aad9b9 | 4856 | if (t) |
36a117a5 MM |
4857 | { |
4858 | /* This TYPE is actually a instantiation of of a partial | |
4859 | specialization. We replace the innermost set of ARGS with | |
4860 | the arguments appropriate for substitution. For example, | |
4861 | given: | |
4862 | ||
4863 | template <class T> struct S {}; | |
4864 | template <class T> struct S<T*> {}; | |
4865 | ||
4866 | and supposing that we are instantiating S<int*>, ARGS will | |
4867 | present be {int*} but we need {int}. */ | |
4868 | tree inner_args | |
4869 | = get_class_bindings (TREE_VALUE (t), TREE_PURPOSE (t), | |
4870 | args); | |
4871 | ||
4872 | /* If there were multiple levels in ARGS, replacing the | |
4873 | innermost level would alter CLASSTYPE_TI_ARGS, which we don't | |
4874 | want, so we make a copy first. */ | |
4875 | if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (args)) | |
4876 | { | |
4877 | args = copy_node (args); | |
4878 | SET_TMPL_ARGS_LEVEL (args, TMPL_ARGS_DEPTH (args), inner_args); | |
4879 | } | |
4880 | else | |
4881 | args = inner_args; | |
4882 | } | |
8d019cef | 4883 | |
5566b478 MS |
4884 | if (flag_external_templates) |
4885 | { | |
4886 | if (flag_alt_external_templates) | |
4887 | { | |
4888 | CLASSTYPE_INTERFACE_ONLY (type) = interface_only; | |
4889 | SET_CLASSTYPE_INTERFACE_UNKNOWN_X (type, interface_unknown); | |
4890 | CLASSTYPE_VTABLE_NEEDS_WRITING (type) | |
2604412d JM |
4891 | = (! CLASSTYPE_INTERFACE_ONLY (type) |
4892 | && CLASSTYPE_INTERFACE_KNOWN (type)); | |
5566b478 MS |
4893 | } |
4894 | else | |
4895 | { | |
4896 | CLASSTYPE_INTERFACE_ONLY (type) = CLASSTYPE_INTERFACE_ONLY (pattern); | |
4897 | SET_CLASSTYPE_INTERFACE_UNKNOWN_X | |
4898 | (type, CLASSTYPE_INTERFACE_UNKNOWN (pattern)); | |
4899 | CLASSTYPE_VTABLE_NEEDS_WRITING (type) | |
2604412d JM |
4900 | = (! CLASSTYPE_INTERFACE_ONLY (type) |
4901 | && CLASSTYPE_INTERFACE_KNOWN (type)); | |
5566b478 MS |
4902 | } |
4903 | } | |
4904 | else | |
8d08fdba | 4905 | { |
5566b478 MS |
4906 | SET_CLASSTYPE_INTERFACE_UNKNOWN (type); |
4907 | CLASSTYPE_VTABLE_NEEDS_WRITING (type) = 1; | |
8d08fdba MS |
4908 | } |
4909 | ||
f7da6097 MS |
4910 | TYPE_HAS_CONSTRUCTOR (type) = TYPE_HAS_CONSTRUCTOR (pattern); |
4911 | TYPE_HAS_DESTRUCTOR (type) = TYPE_HAS_DESTRUCTOR (pattern); | |
f7da6097 MS |
4912 | TYPE_OVERLOADS_CALL_EXPR (type) = TYPE_OVERLOADS_CALL_EXPR (pattern); |
4913 | TYPE_OVERLOADS_ARRAY_REF (type) = TYPE_OVERLOADS_ARRAY_REF (pattern); | |
4914 | TYPE_OVERLOADS_ARROW (type) = TYPE_OVERLOADS_ARROW (pattern); | |
834c6dff MM |
4915 | TYPE_HAS_NEW_OPERATOR (type) = TYPE_HAS_NEW_OPERATOR (pattern); |
4916 | TYPE_HAS_ARRAY_NEW_OPERATOR (type) = TYPE_HAS_ARRAY_NEW_OPERATOR (pattern); | |
f7da6097 MS |
4917 | TYPE_GETS_DELETE (type) = TYPE_GETS_DELETE (pattern); |
4918 | TYPE_VEC_DELETE_TAKES_SIZE (type) = TYPE_VEC_DELETE_TAKES_SIZE (pattern); | |
4919 | TYPE_HAS_ASSIGN_REF (type) = TYPE_HAS_ASSIGN_REF (pattern); | |
4920 | TYPE_HAS_CONST_ASSIGN_REF (type) = TYPE_HAS_CONST_ASSIGN_REF (pattern); | |
4921 | TYPE_HAS_ABSTRACT_ASSIGN_REF (type) = TYPE_HAS_ABSTRACT_ASSIGN_REF (pattern); | |
4922 | TYPE_HAS_INIT_REF (type) = TYPE_HAS_INIT_REF (pattern); | |
4923 | TYPE_HAS_CONST_INIT_REF (type) = TYPE_HAS_CONST_INIT_REF (pattern); | |
f7da6097 MS |
4924 | TYPE_HAS_DEFAULT_CONSTRUCTOR (type) = TYPE_HAS_DEFAULT_CONSTRUCTOR (pattern); |
4925 | TYPE_HAS_CONVERSION (type) = TYPE_HAS_CONVERSION (pattern); | |
4c6b7393 MM |
4926 | TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (type) |
4927 | = TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (pattern); | |
f7da6097 MS |
4928 | TYPE_USES_MULTIPLE_INHERITANCE (type) |
4929 | = TYPE_USES_MULTIPLE_INHERITANCE (pattern); | |
4930 | TYPE_USES_VIRTUAL_BASECLASSES (type) | |
4931 | = TYPE_USES_VIRTUAL_BASECLASSES (pattern); | |
4932 | TYPE_PACKED (type) = TYPE_PACKED (pattern); | |
4933 | TYPE_ALIGN (type) = TYPE_ALIGN (pattern); | |
11cf4d18 | 4934 | TYPE_USER_ALIGN (type) = TYPE_USER_ALIGN (pattern); |
eff71ab0 | 4935 | TYPE_FOR_JAVA (type) = TYPE_FOR_JAVA (pattern); /* For libjava's JArray<T> */ |
6bdb8141 JM |
4936 | if (ANON_AGGR_TYPE_P (pattern)) |
4937 | SET_ANON_AGGR_TYPE_P (type); | |
f7da6097 | 4938 | |
3fd71a52 MM |
4939 | if (TYPE_BINFO_BASETYPES (pattern)) |
4940 | { | |
4941 | tree base_list = NULL_TREE; | |
4942 | tree pbases = TYPE_BINFO_BASETYPES (pattern); | |
4943 | int i; | |
5566b478 | 4944 | |
3fd71a52 MM |
4945 | /* Substitute into each of the bases to determine the actual |
4946 | basetypes. */ | |
4947 | for (i = 0; i < TREE_VEC_LENGTH (pbases); ++i) | |
4948 | { | |
4949 | tree base; | |
4950 | tree access; | |
4951 | tree pbase; | |
5566b478 | 4952 | |
3fd71a52 | 4953 | pbase = TREE_VEC_ELT (pbases, i); |
711734a9 | 4954 | |
3fd71a52 MM |
4955 | /* Substitue to figure out the base class. */ |
4956 | base = tsubst (BINFO_TYPE (pbase), args, | |
4957 | /*complain=*/1, NULL_TREE); | |
4958 | if (base == error_mark_node) | |
4959 | continue; | |
711734a9 | 4960 | |
3fd71a52 MM |
4961 | /* Calculate the correct access node. */ |
4962 | if (TREE_VIA_VIRTUAL (pbase)) | |
4963 | { | |
4964 | if (TREE_VIA_PUBLIC (pbase)) | |
4965 | access = access_public_virtual_node; | |
4966 | else if (TREE_VIA_PROTECTED (pbase)) | |
4967 | access = access_protected_virtual_node; | |
d6479fe7 | 4968 | else |
3fd71a52 MM |
4969 | access = access_private_virtual_node; |
4970 | } | |
4971 | else | |
4972 | { | |
4973 | if (TREE_VIA_PUBLIC (pbase)) | |
4974 | access = access_public_node; | |
4975 | else if (TREE_VIA_PROTECTED (pbase)) | |
4976 | access = access_protected_node; | |
d6479fe7 | 4977 | else |
3fd71a52 MM |
4978 | access = access_private_node; |
4979 | } | |
dfbcd65a | 4980 | |
3fd71a52 MM |
4981 | base_list = tree_cons (access, base, base_list); |
4982 | } | |
dfbcd65a | 4983 | |
3fd71a52 MM |
4984 | /* The list is now in reverse order; correct that. */ |
4985 | base_list = nreverse (base_list); | |
4986 | ||
4987 | /* Now call xref_basetypes to set up all the base-class | |
4988 | information. */ | |
4989 | xref_basetypes (TREE_CODE (pattern) == RECORD_TYPE | |
4990 | ? (CLASSTYPE_DECLARED_CLASS (pattern) | |
4991 | ? class_type_node : record_type_node) | |
4992 | : union_type_node, | |
4993 | DECL_NAME (TYPE_NAME (pattern)), | |
4994 | type, | |
4995 | base_list); | |
4996 | } | |
5566b478 | 4997 | |
b74a0560 MM |
4998 | /* Now that our base classes are set up, enter the scope of the |
4999 | class, so that name lookups into base classes, etc. will work | |
5000 | corectly. This is precisely analagous to what we do in | |
5001 | begin_class_definition when defining an ordinary non-template | |
5002 | class. */ | |
5003 | pushclass (type, 1); | |
5004 | ||
5566b478 | 5005 | for (t = CLASSTYPE_TAGS (pattern); t; t = TREE_CHAIN (t)) |
8d08fdba | 5006 | { |
5566b478 | 5007 | tree tag = TREE_VALUE (t); |
36a117a5 MM |
5008 | tree name = TYPE_IDENTIFIER (tag); |
5009 | tree newtag; | |
5566b478 | 5010 | |
4393e105 | 5011 | newtag = tsubst (tag, args, /*complain=*/1, NULL_TREE); |
61a127b3 | 5012 | if (TREE_CODE (newtag) != ENUMERAL_TYPE) |
ed44da02 | 5013 | { |
486e4077 MM |
5014 | if (TYPE_LANG_SPECIFIC (tag) && CLASSTYPE_IS_TEMPLATE (tag)) |
5015 | /* Unfortunately, lookup_template_class sets | |
5016 | CLASSTYPE_IMPLICIT_INSTANTIATION for a partial | |
5017 | instantiation (i.e., for the type of a member template | |
5018 | class nested within a template class.) This behavior is | |
5019 | required for maybe_process_partial_specialization to work | |
5020 | correctly, but is not accurate in this case; the TAG is not | |
5021 | an instantiation of anything. (The corresponding | |
5022 | TEMPLATE_DECL is an instantiation, but the TYPE is not.) */ | |
5023 | CLASSTYPE_USE_TEMPLATE (newtag) = 0; | |
5024 | ||
ed44da02 MM |
5025 | /* Now, we call pushtag to put this NEWTAG into the scope of |
5026 | TYPE. We first set up the IDENTIFIER_TYPE_VALUE to avoid | |
5027 | pushtag calling push_template_decl. We don't have to do | |
5028 | this for enums because it will already have been done in | |
5029 | tsubst_enum. */ | |
5030 | if (name) | |
5031 | SET_IDENTIFIER_TYPE_VALUE (name, newtag); | |
5032 | pushtag (name, newtag, /*globalize=*/0); | |
5033 | } | |
8d08fdba MS |
5034 | } |
5035 | ||
5566b478 MS |
5036 | /* Don't replace enum constants here. */ |
5037 | for (t = TYPE_FIELDS (pattern); t; t = TREE_CHAIN (t)) | |
8dd3f57a | 5038 | if (TREE_CODE (t) != CONST_DECL) |
5566b478 | 5039 | { |
ae58fa02 MM |
5040 | tree r; |
5041 | ||
5042 | /* The the file and line for this declaration, to assist in | |
5043 | error message reporting. Since we called push_tinst_level | |
5044 | above, we don't need to restore these. */ | |
5045 | lineno = DECL_SOURCE_LINE (t); | |
5046 | input_filename = DECL_SOURCE_FILE (t); | |
5047 | ||
4393e105 | 5048 | r = tsubst (t, args, /*complain=*/1, NULL_TREE); |
5566b478 MS |
5049 | if (TREE_CODE (r) == VAR_DECL) |
5050 | { | |
fa8d6e85 MM |
5051 | tree init; |
5052 | ||
94c82a77 | 5053 | if (DECL_DEFINED_IN_CLASS_P (r)) |
fa8d6e85 MM |
5054 | init = tsubst_expr (DECL_INITIAL (t), args, |
5055 | /*complain=*/1, NULL_TREE); | |
5056 | else | |
5057 | init = NULL_TREE; | |
5058 | ||
5059 | finish_static_data_member_decl (r, init, | |
5060 | /*asmspec_tree=*/NULL_TREE, | |
fa8d6e85 MM |
5061 | /*flags=*/0); |
5062 | ||
6ba89f8e MM |
5063 | if (DECL_DEFINED_IN_CLASS_P (r)) |
5064 | check_static_variable_definition (r, TREE_TYPE (r)); | |
5566b478 | 5065 | } |
61a127b3 MM |
5066 | |
5067 | /* R will have a TREE_CHAIN if and only if it has already been | |
5068 | processed by finish_member_declaration. This can happen | |
5069 | if, for example, it is a TYPE_DECL for a class-scoped | |
5070 | ENUMERAL_TYPE; such a thing will already have been added to | |
5071 | the field list by tsubst_enum above. */ | |
5072 | if (!TREE_CHAIN (r)) | |
5073 | { | |
5074 | set_current_access_from_decl (r); | |
5075 | finish_member_declaration (r); | |
5076 | } | |
5566b478 | 5077 | } |
8d08fdba | 5078 | |
61a127b3 MM |
5079 | /* Set up the list (TYPE_METHODS) and vector (CLASSTYPE_METHOD_VEC) |
5080 | for this instantiation. */ | |
5081 | for (t = TYPE_METHODS (pattern); t; t = TREE_CHAIN (t)) | |
5082 | { | |
4393e105 | 5083 | tree r = tsubst (t, args, /*complain=*/1, NULL_TREE); |
61a127b3 MM |
5084 | set_current_access_from_decl (r); |
5085 | finish_member_declaration (r); | |
5086 | } | |
8d08fdba | 5087 | |
2604412d JM |
5088 | /* Construct the DECL_FRIENDLIST for the new class type. */ |
5089 | typedecl = TYPE_MAIN_DECL (type); | |
5090 | for (t = DECL_FRIENDLIST (TYPE_MAIN_DECL (pattern)); | |
5091 | t != NULL_TREE; | |
5092 | t = TREE_CHAIN (t)) | |
f84b4be9 | 5093 | { |
2604412d | 5094 | tree friends; |
f84b4be9 | 5095 | |
2604412d JM |
5096 | for (friends = TREE_VALUE (t); |
5097 | friends != NULL_TREE; | |
5098 | friends = TREE_CHAIN (friends)) | |
0c0aac2f MM |
5099 | if (TREE_PURPOSE (friends) == error_mark_node) |
5100 | add_friend (type, | |
5101 | tsubst_friend_function (TREE_VALUE (friends), | |
5102 | args)); | |
5103 | else | |
4f1c5b7d | 5104 | my_friendly_abort (20000216); |
2604412d | 5105 | } |
5566b478 | 5106 | |
6757edfe MM |
5107 | for (t = CLASSTYPE_FRIEND_CLASSES (pattern); |
5108 | t != NULL_TREE; | |
5109 | t = TREE_CHAIN (t)) | |
5110 | { | |
5111 | tree friend_type = TREE_VALUE (t); | |
1aed5355 | 5112 | tree new_friend_type; |
6757edfe | 5113 | |
36a117a5 MM |
5114 | if (TREE_CODE (friend_type) == TEMPLATE_DECL) |
5115 | new_friend_type = tsubst_friend_class (friend_type, args); | |
5116 | else if (uses_template_parms (friend_type)) | |
4393e105 MM |
5117 | new_friend_type = tsubst (friend_type, args, /*complain=*/1, |
5118 | NULL_TREE); | |
36a117a5 | 5119 | else |
61fc8c9e MM |
5120 | { |
5121 | tree ns = decl_namespace_context (TYPE_MAIN_DECL (friend_type)); | |
36a117a5 | 5122 | |
61fc8c9e MM |
5123 | /* The call to xref_tag_from_type does injection for friend |
5124 | classes. */ | |
5125 | push_nested_namespace (ns); | |
5126 | new_friend_type = | |
5127 | xref_tag_from_type (friend_type, NULL_TREE, 1); | |
5128 | pop_nested_namespace (ns); | |
5129 | } | |
1aed5355 MM |
5130 | |
5131 | if (TREE_CODE (friend_type) == TEMPLATE_DECL) | |
5132 | /* Trick make_friend_class into realizing that the friend | |
5133 | we're adding is a template, not an ordinary class. It's | |
5134 | important that we use make_friend_class since it will | |
5135 | perform some error-checking and output cross-reference | |
5136 | information. */ | |
5137 | ++processing_template_decl; | |
5138 | ||
5139 | make_friend_class (type, new_friend_type); | |
fc378698 | 5140 | |
1aed5355 MM |
5141 | if (TREE_CODE (friend_type) == TEMPLATE_DECL) |
5142 | --processing_template_decl; | |
6757edfe | 5143 | } |
fc378698 | 5144 | |
2604412d JM |
5145 | for (t = TYPE_FIELDS (type); t; t = TREE_CHAIN (t)) |
5146 | if (TREE_CODE (t) == FIELD_DECL) | |
5147 | { | |
5148 | TREE_TYPE (t) = complete_type (TREE_TYPE (t)); | |
5149 | require_complete_type (t); | |
5150 | } | |
5566b478 | 5151 | |
61a127b3 MM |
5152 | /* Set the file and line number information to whatever is given for |
5153 | the class itself. This puts error messages involving generated | |
5154 | implicit functions at a predictable point, and the same point | |
5155 | that would be used for non-template classes. */ | |
5156 | lineno = DECL_SOURCE_LINE (typedecl); | |
5157 | input_filename = DECL_SOURCE_FILE (typedecl); | |
5158 | ||
5159 | unreverse_member_declarations (type); | |
9f33663b | 5160 | finish_struct_1 (type); |
2604412d | 5161 | CLASSTYPE_GOT_SEMICOLON (type) = 1; |
e92cc029 | 5162 | |
5524676d JM |
5163 | /* Clear this now so repo_template_used is happy. */ |
5164 | TYPE_BEING_DEFINED (type) = 0; | |
2604412d | 5165 | repo_template_used (type); |
8d08fdba | 5166 | |
9188c363 MM |
5167 | /* Now that the class is complete, instantiate default arguments for |
5168 | any member functions. We don't do this earlier because the | |
5169 | default arguments may reference members of the class. */ | |
5170 | if (!PRIMARY_TEMPLATE_P (template)) | |
5171 | for (t = TYPE_METHODS (type); t; t = TREE_CHAIN (t)) | |
5172 | if (TREE_CODE (t) == FUNCTION_DECL | |
5173 | /* Implicitly generated member functions will not have tmplate | |
5174 | information; they are not instantiations, but instead are | |
5175 | created "fresh" for each instantiation. */ | |
5176 | && DECL_TEMPLATE_INFO (t)) | |
5177 | tsubst_default_arguments (t); | |
5178 | ||
b74a0560 | 5179 | popclass (); |
5566b478 MS |
5180 | pop_from_top_level (); |
5181 | pop_tinst_level (); | |
5182 | ||
5183 | return type; | |
8d08fdba MS |
5184 | } |
5185 | ||
5186 | static int | |
5187 | list_eq (t1, t2) | |
5188 | tree t1, t2; | |
5189 | { | |
5190 | if (t1 == NULL_TREE) | |
5191 | return t2 == NULL_TREE; | |
5192 | if (t2 == NULL_TREE) | |
5193 | return 0; | |
5194 | /* Don't care if one declares its arg const and the other doesn't -- the | |
5195 | main variant of the arg type is all that matters. */ | |
5196 | if (TYPE_MAIN_VARIANT (TREE_VALUE (t1)) | |
5197 | != TYPE_MAIN_VARIANT (TREE_VALUE (t2))) | |
5198 | return 0; | |
5199 | return list_eq (TREE_CHAIN (t1), TREE_CHAIN (t2)); | |
5200 | } | |
5201 | ||
00d3396f JM |
5202 | /* If arg is a non-type template parameter that does not depend on template |
5203 | arguments, fold it like we weren't in the body of a template. */ | |
5204 | ||
5205 | static tree | |
5206 | maybe_fold_nontype_arg (arg) | |
5207 | tree arg; | |
5208 | { | |
7610f2ce JM |
5209 | /* If we're not in a template, ARG is already as simple as it's going to |
5210 | get, and trying to reprocess the trees will break. */ | |
5211 | if (! processing_template_decl) | |
5212 | return arg; | |
5213 | ||
2f939d94 | 5214 | if (!TYPE_P (arg) && !uses_template_parms (arg)) |
00d3396f JM |
5215 | { |
5216 | /* Sometimes, one of the args was an expression involving a | |
5217 | template constant parameter, like N - 1. Now that we've | |
5218 | tsubst'd, we might have something like 2 - 1. This will | |
5219 | confuse lookup_template_class, so we do constant folding | |
5220 | here. We have to unset processing_template_decl, to | |
5221 | fool build_expr_from_tree() into building an actual | |
5222 | tree. */ | |
5223 | ||
5224 | int saved_processing_template_decl = processing_template_decl; | |
5225 | processing_template_decl = 0; | |
5226 | arg = fold (build_expr_from_tree (arg)); | |
5227 | processing_template_decl = saved_processing_template_decl; | |
5228 | } | |
5229 | return arg; | |
5230 | } | |
5231 | ||
830bfa74 MM |
5232 | /* Substitute ARGS into the vector of template arguments T. */ |
5233 | ||
e9659ab0 | 5234 | static tree |
4393e105 | 5235 | tsubst_template_arg_vector (t, args, complain) |
830bfa74 MM |
5236 | tree t; |
5237 | tree args; | |
4393e105 | 5238 | int complain; |
830bfa74 MM |
5239 | { |
5240 | int len = TREE_VEC_LENGTH (t), need_new = 0, i; | |
5241 | tree *elts = (tree *) alloca (len * sizeof (tree)); | |
5242 | ||
5243 | bzero ((char *) elts, len * sizeof (tree)); | |
5244 | ||
5245 | for (i = 0; i < len; i++) | |
5246 | { | |
5247 | if (TREE_VEC_ELT (t, i) != NULL_TREE | |
5248 | && TREE_CODE (TREE_VEC_ELT (t, i)) == TREE_VEC) | |
4393e105 MM |
5249 | elts[i] = tsubst_template_arg_vector (TREE_VEC_ELT (t, i), |
5250 | args, complain); | |
830bfa74 MM |
5251 | else |
5252 | elts[i] = maybe_fold_nontype_arg | |
4393e105 MM |
5253 | (tsubst_expr (TREE_VEC_ELT (t, i), args, complain, |
5254 | NULL_TREE)); | |
830bfa74 MM |
5255 | |
5256 | if (elts[i] != TREE_VEC_ELT (t, i)) | |
5257 | need_new = 1; | |
5258 | } | |
5259 | ||
5260 | if (!need_new) | |
5261 | return t; | |
5262 | ||
f31c0a32 | 5263 | t = make_tree_vec (len); |
830bfa74 MM |
5264 | for (i = 0; i < len; i++) |
5265 | TREE_VEC_ELT (t, i) = elts[i]; | |
5266 | ||
5267 | return t; | |
5268 | } | |
5269 | ||
36a117a5 MM |
5270 | /* Return the result of substituting ARGS into the template parameters |
5271 | given by PARMS. If there are m levels of ARGS and m + n levels of | |
5272 | PARMS, then the result will contain n levels of PARMS. For | |
5273 | example, if PARMS is `template <class T> template <class U> | |
5274 | template <T*, U, class V>' and ARGS is {{int}, {double}} then the | |
5275 | result will be `template <int*, double, class V>'. */ | |
5276 | ||
e9659ab0 | 5277 | static tree |
4393e105 | 5278 | tsubst_template_parms (parms, args, complain) |
36a117a5 MM |
5279 | tree parms; |
5280 | tree args; | |
4393e105 | 5281 | int complain; |
36a117a5 | 5282 | { |
f71f87f9 MM |
5283 | tree r = NULL_TREE; |
5284 | tree* new_parms; | |
36a117a5 MM |
5285 | |
5286 | for (new_parms = &r; | |
5287 | TMPL_PARMS_DEPTH (parms) > TMPL_ARGS_DEPTH (args); | |
5288 | new_parms = &(TREE_CHAIN (*new_parms)), | |
5289 | parms = TREE_CHAIN (parms)) | |
5290 | { | |
5291 | tree new_vec = | |
5292 | make_tree_vec (TREE_VEC_LENGTH (TREE_VALUE (parms))); | |
5293 | int i; | |
5294 | ||
5295 | for (i = 0; i < TREE_VEC_LENGTH (new_vec); ++i) | |
5296 | { | |
5297 | tree default_value = | |
5298 | TREE_PURPOSE (TREE_VEC_ELT (TREE_VALUE (parms), i)); | |
5299 | tree parm_decl = | |
5300 | TREE_VALUE (TREE_VEC_ELT (TREE_VALUE (parms), i)); | |
5301 | ||
5302 | TREE_VEC_ELT (new_vec, i) | |
4393e105 MM |
5303 | = build_tree_list (tsubst (default_value, args, complain, |
5304 | NULL_TREE), | |
5305 | tsubst (parm_decl, args, complain, | |
5306 | NULL_TREE)); | |
36a117a5 MM |
5307 | } |
5308 | ||
5309 | *new_parms = | |
5310 | tree_cons (build_int_2 (0, (TMPL_PARMS_DEPTH (parms) | |
5311 | - TMPL_ARGS_DEPTH (args))), | |
5312 | new_vec, NULL_TREE); | |
5313 | } | |
5314 | ||
5315 | return r; | |
5316 | } | |
5317 | ||
ed44da02 MM |
5318 | /* Substitute the ARGS into the indicated aggregate (or enumeration) |
5319 | type T. If T is not an aggregate or enumeration type, it is | |
5320 | handled as if by tsubst. IN_DECL is as for tsubst. If | |
5321 | ENTERING_SCOPE is non-zero, T is the context for a template which | |
5322 | we are presently tsubst'ing. Return the subsituted value. */ | |
36a117a5 | 5323 | |
e9659ab0 | 5324 | static tree |
4393e105 | 5325 | tsubst_aggr_type (t, args, complain, in_decl, entering_scope) |
36a117a5 MM |
5326 | tree t; |
5327 | tree args; | |
4393e105 | 5328 | int complain; |
36a117a5 MM |
5329 | tree in_decl; |
5330 | int entering_scope; | |
5331 | { | |
5332 | if (t == NULL_TREE) | |
5333 | return NULL_TREE; | |
5334 | ||
5335 | switch (TREE_CODE (t)) | |
5336 | { | |
5337 | case RECORD_TYPE: | |
5338 | if (TYPE_PTRMEMFUNC_P (t)) | |
5339 | { | |
5340 | tree r = build_ptrmemfunc_type | |
4393e105 | 5341 | (tsubst (TYPE_PTRMEMFUNC_FN_TYPE (t), args, complain, in_decl)); |
adecb3f4 MM |
5342 | return cp_build_qualified_type_real (r, TYPE_QUALS (t), |
5343 | complain); | |
36a117a5 MM |
5344 | } |
5345 | ||
5346 | /* else fall through */ | |
ed44da02 | 5347 | case ENUMERAL_TYPE: |
36a117a5 | 5348 | case UNION_TYPE: |
5db698f6 | 5349 | if (TYPE_TEMPLATE_INFO (t)) |
36a117a5 MM |
5350 | { |
5351 | tree argvec; | |
5352 | tree context; | |
5353 | tree r; | |
5354 | ||
5355 | /* First, determine the context for the type we are looking | |
5356 | up. */ | |
5357 | if (TYPE_CONTEXT (t) != NULL_TREE) | |
5358 | context = tsubst_aggr_type (TYPE_CONTEXT (t), args, | |
4393e105 | 5359 | complain, |
36a117a5 MM |
5360 | in_decl, /*entering_scope=*/1); |
5361 | else | |
5362 | context = NULL_TREE; | |
5363 | ||
5364 | /* Then, figure out what arguments are appropriate for the | |
5365 | type we are trying to find. For example, given: | |
5366 | ||
5367 | template <class T> struct S; | |
5368 | template <class T, class U> void f(T, U) { S<U> su; } | |
5369 | ||
5370 | and supposing that we are instantiating f<int, double>, | |
5371 | then our ARGS will be {int, double}, but, when looking up | |
5372 | S we only want {double}. */ | |
4393e105 MM |
5373 | argvec = tsubst_template_arg_vector (TYPE_TI_ARGS (t), args, |
5374 | complain); | |
36a117a5 MM |
5375 | |
5376 | r = lookup_template_class (t, argvec, in_decl, context, | |
5377 | entering_scope); | |
5378 | ||
adecb3f4 MM |
5379 | return cp_build_qualified_type_real (r, TYPE_QUALS (t), |
5380 | complain); | |
36a117a5 MM |
5381 | } |
5382 | else | |
5383 | /* This is not a template type, so there's nothing to do. */ | |
5384 | return t; | |
5385 | ||
5386 | default: | |
4393e105 | 5387 | return tsubst (t, args, complain, in_decl); |
36a117a5 MM |
5388 | } |
5389 | } | |
5390 | ||
9188c363 MM |
5391 | /* Substitute into the default argument ARG (a default argument for |
5392 | FN), which has the indicated TYPE. */ | |
5393 | ||
5394 | tree | |
5395 | tsubst_default_argument (fn, type, arg) | |
5396 | tree fn; | |
5397 | tree type; | |
5398 | tree arg; | |
5399 | { | |
5400 | /* This default argument came from a template. Instantiate the | |
5401 | default argument here, not in tsubst. In the case of | |
5402 | something like: | |
5403 | ||
5404 | template <class T> | |
5405 | struct S { | |
5406 | static T t(); | |
5407 | void f(T = t()); | |
5408 | }; | |
5409 | ||
5410 | we must be careful to do name lookup in the scope of S<T>, | |
5411 | rather than in the current class. */ | |
5412 | if (DECL_CLASS_SCOPE_P (fn)) | |
4f1c5b7d | 5413 | pushclass (DECL_CONTEXT (fn), 2); |
9188c363 MM |
5414 | |
5415 | arg = tsubst_expr (arg, DECL_TI_ARGS (fn), /*complain=*/1, NULL_TREE); | |
5416 | ||
5417 | if (DECL_CLASS_SCOPE_P (fn)) | |
5418 | popclass (); | |
5419 | ||
5420 | /* Make sure the default argument is reasonable. */ | |
5421 | arg = check_default_argument (type, arg); | |
5422 | ||
5423 | return arg; | |
5424 | } | |
5425 | ||
5426 | /* Substitute into all the default arguments for FN. */ | |
5427 | ||
5428 | static void | |
5429 | tsubst_default_arguments (fn) | |
5430 | tree fn; | |
5431 | { | |
5432 | tree arg; | |
5433 | tree tmpl_args; | |
5434 | ||
5435 | tmpl_args = DECL_TI_ARGS (fn); | |
5436 | ||
5437 | /* If this function is not yet instantiated, we certainly don't need | |
5438 | its default arguments. */ | |
5439 | if (uses_template_parms (tmpl_args)) | |
5440 | return; | |
5441 | ||
5442 | for (arg = TYPE_ARG_TYPES (TREE_TYPE (fn)); | |
5443 | arg; | |
5444 | arg = TREE_CHAIN (arg)) | |
5445 | if (TREE_PURPOSE (arg)) | |
5446 | TREE_PURPOSE (arg) = tsubst_default_argument (fn, | |
5447 | TREE_VALUE (arg), | |
5448 | TREE_PURPOSE (arg)); | |
5449 | } | |
5450 | ||
ae58fa02 MM |
5451 | /* Substitute the ARGS into the T, which is a _DECL. TYPE is the |
5452 | (already computed) substitution of ARGS into TREE_TYPE (T), if | |
5453 | appropriate. Return the result of the substitution. IN_DECL is as | |
5454 | for tsubst. */ | |
00d3396f | 5455 | |
e9659ab0 | 5456 | static tree |
ae58fa02 MM |
5457 | tsubst_decl (t, args, type, in_decl) |
5458 | tree t; | |
5459 | tree args; | |
5460 | tree type; | |
8d08fdba MS |
5461 | tree in_decl; |
5462 | { | |
ae58fa02 | 5463 | int saved_lineno; |
3b304f5b | 5464 | const char *saved_filename; |
b370501f | 5465 | tree r = NULL_TREE; |
830bfa74 | 5466 | |
ae58fa02 MM |
5467 | /* Set the filename and linenumber to improve error-reporting. */ |
5468 | saved_lineno = lineno; | |
5469 | saved_filename = input_filename; | |
5470 | lineno = DECL_SOURCE_LINE (t); | |
5471 | input_filename = DECL_SOURCE_FILE (t); | |
b7484fbe | 5472 | |
8d08fdba MS |
5473 | switch (TREE_CODE (t)) |
5474 | { | |
98c1c668 JM |
5475 | case TEMPLATE_DECL: |
5476 | { | |
5477 | /* We can get here when processing a member template function | |
5478 | of a template class. */ | |
98c1c668 | 5479 | tree decl = DECL_TEMPLATE_RESULT (t); |
386b8a85 | 5480 | tree spec; |
db2767b6 | 5481 | int is_template_template_parm = DECL_TEMPLATE_TEMPLATE_PARM_P (t); |
98c1c668 | 5482 | |
db2767b6 MM |
5483 | if (!is_template_template_parm) |
5484 | { | |
36a117a5 MM |
5485 | /* We might already have an instance of this template. |
5486 | The ARGS are for the surrounding class type, so the | |
5487 | full args contain the tsubst'd args for the context, | |
5488 | plus the innermost args from the template decl. */ | |
5489 | tree tmpl_args = DECL_CLASS_TEMPLATE_P (t) | |
5490 | ? CLASSTYPE_TI_ARGS (TREE_TYPE (t)) | |
17aec3eb | 5491 | : DECL_TI_ARGS (DECL_TEMPLATE_RESULT (t)); |
7ddedda4 MM |
5492 | tree full_args; |
5493 | ||
4393e105 MM |
5494 | full_args = tsubst_template_arg_vector (tmpl_args, args, |
5495 | /*complain=*/1); | |
36a117a5 MM |
5496 | |
5497 | /* tsubst_template_arg_vector doesn't copy the vector if | |
5498 | nothing changed. But, *something* should have | |
5499 | changed. */ | |
5500 | my_friendly_assert (full_args != tmpl_args, 0); | |
5501 | ||
5502 | spec = retrieve_specialization (t, full_args); | |
db2767b6 | 5503 | if (spec != NULL_TREE) |
ae58fa02 MM |
5504 | { |
5505 | r = spec; | |
5506 | break; | |
5507 | } | |
db2767b6 | 5508 | } |
98c1c668 JM |
5509 | |
5510 | /* Make a new template decl. It will be similar to the | |
5511 | original, but will record the current template arguments. | |
5512 | We also create a new function declaration, which is just | |
5513 | like the old one, but points to this new template, rather | |
5514 | than the old one. */ | |
0acf7199 | 5515 | r = copy_decl (t); |
ae58fa02 MM |
5516 | my_friendly_assert (DECL_LANG_SPECIFIC (r) != 0, 0); |
5517 | TREE_CHAIN (r) = NULL_TREE; | |
db2767b6 MM |
5518 | |
5519 | if (is_template_template_parm) | |
5520 | { | |
4393e105 | 5521 | tree new_decl = tsubst (decl, args, /*complain=*/1, in_decl); |
17aec3eb | 5522 | DECL_TEMPLATE_RESULT (r) = new_decl; |
ae58fa02 MM |
5523 | TREE_TYPE (r) = TREE_TYPE (new_decl); |
5524 | break; | |
db2767b6 MM |
5525 | } |
5526 | ||
ae58fa02 | 5527 | DECL_CONTEXT (r) |
4f1c5b7d | 5528 | = tsubst_aggr_type (DECL_CONTEXT (t), args, |
4393e105 MM |
5529 | /*complain=*/1, in_decl, |
5530 | /*entering_scope=*/1); | |
4f1c5b7d MM |
5531 | DECL_VIRTUAL_CONTEXT (r) |
5532 | = tsubst_aggr_type (DECL_VIRTUAL_CONTEXT (t), args, | |
5533 | /*complain=*/1, in_decl, | |
5534 | /*entering_scope=*/1); | |
ae58fa02 | 5535 | DECL_TEMPLATE_INFO (r) = build_tree_list (t, args); |
93cdc044 JM |
5536 | |
5537 | if (TREE_CODE (decl) == TYPE_DECL) | |
5538 | { | |
4393e105 MM |
5539 | tree new_type = tsubst (TREE_TYPE (t), args, |
5540 | /*complain=*/1, in_decl); | |
ae58fa02 MM |
5541 | TREE_TYPE (r) = new_type; |
5542 | CLASSTYPE_TI_TEMPLATE (new_type) = r; | |
17aec3eb | 5543 | DECL_TEMPLATE_RESULT (r) = TYPE_MAIN_DECL (new_type); |
ae58fa02 | 5544 | DECL_TI_ARGS (r) = CLASSTYPE_TI_ARGS (new_type); |
93cdc044 JM |
5545 | } |
5546 | else | |
5547 | { | |
4393e105 | 5548 | tree new_decl = tsubst (decl, args, /*complain=*/1, in_decl); |
17aec3eb RK |
5549 | |
5550 | DECL_TEMPLATE_RESULT (r) = new_decl; | |
ae58fa02 MM |
5551 | DECL_TI_TEMPLATE (new_decl) = r; |
5552 | TREE_TYPE (r) = TREE_TYPE (new_decl); | |
5553 | DECL_TI_ARGS (r) = DECL_TI_ARGS (new_decl); | |
93cdc044 JM |
5554 | } |
5555 | ||
ae58fa02 MM |
5556 | SET_DECL_IMPLICIT_INSTANTIATION (r); |
5557 | DECL_TEMPLATE_INSTANTIATIONS (r) = NULL_TREE; | |
5558 | DECL_TEMPLATE_SPECIALIZATIONS (r) = NULL_TREE; | |
98c1c668 JM |
5559 | |
5560 | /* The template parameters for this new template are all the | |
5561 | template parameters for the old template, except the | |
5562 | outermost level of parameters. */ | |
ae58fa02 | 5563 | DECL_TEMPLATE_PARMS (r) |
4393e105 MM |
5564 | = tsubst_template_parms (DECL_TEMPLATE_PARMS (t), args, |
5565 | /*complain=*/1); | |
98c1c668 | 5566 | |
93cdc044 | 5567 | if (PRIMARY_TEMPLATE_P (t)) |
ae58fa02 | 5568 | DECL_PRIMARY_TEMPLATE (r) = r; |
93cdc044 | 5569 | |
8d019cef | 5570 | /* We don't partially instantiate partial specializations. */ |
93cdc044 | 5571 | if (TREE_CODE (decl) == TYPE_DECL) |
ae58fa02 | 5572 | break; |
93cdc044 | 5573 | |
75650646 | 5574 | /* Record this partial instantiation. */ |
ae58fa02 | 5575 | register_specialization (r, t, |
17aec3eb | 5576 | DECL_TI_ARGS (DECL_TEMPLATE_RESULT (r))); |
75650646 | 5577 | |
98c1c668 | 5578 | } |
ae58fa02 | 5579 | break; |
8d08fdba MS |
5580 | |
5581 | case FUNCTION_DECL: | |
5582 | { | |
386b8a85 | 5583 | tree ctx; |
87603ed0 | 5584 | tree argvec = NULL_TREE; |
cf38f48a | 5585 | tree *friends; |
36a117a5 | 5586 | tree gen_tmpl; |
5566b478 | 5587 | int member; |
d8c4447d MM |
5588 | int args_depth; |
5589 | int parms_depth; | |
5566b478 | 5590 | |
36a117a5 MM |
5591 | /* Nobody should be tsubst'ing into non-template functions. */ |
5592 | my_friendly_assert (DECL_TEMPLATE_INFO (t) != NULL_TREE, 0); | |
5593 | ||
5594 | if (TREE_CODE (DECL_TI_TEMPLATE (t)) == TEMPLATE_DECL) | |
5595 | { | |
5596 | tree spec; | |
5597 | ||
5598 | /* Calculate the most general template of which R is a | |
5599 | specialization, and the complete set of arguments used to | |
5600 | specialize R. */ | |
5601 | gen_tmpl = most_general_template (DECL_TI_TEMPLATE (t)); | |
7ddedda4 MM |
5602 | argvec |
5603 | = tsubst_template_arg_vector (DECL_TI_ARGS | |
5604 | (DECL_TEMPLATE_RESULT (gen_tmpl)), | |
4393e105 | 5605 | args, /*complain=*/1); |
36a117a5 MM |
5606 | |
5607 | /* Check to see if we already have this specialization. */ | |
5608 | spec = retrieve_specialization (gen_tmpl, argvec); | |
7ddedda4 | 5609 | |
36a117a5 | 5610 | if (spec) |
ae58fa02 MM |
5611 | { |
5612 | r = spec; | |
5613 | break; | |
5614 | } | |
d8c4447d | 5615 | |
f9a7ae04 MM |
5616 | /* We can see more levels of arguments than parameters if |
5617 | there was a specialization of a member template, like | |
5618 | this: | |
5619 | ||
5620 | template <class T> struct S { template <class U> void f(); } | |
5621 | template <> template <class U> void S<int>::f(U); | |
5622 | ||
5623 | Here, we'll be subtituting into the specialization, | |
5624 | because that's where we can find the code we actually | |
5625 | want to generate, but we'll have enough arguments for | |
5626 | the most general template. | |
5627 | ||
5628 | We also deal with the peculiar case: | |
d8c4447d MM |
5629 | |
5630 | template <class T> struct S { | |
5631 | template <class U> friend void f(); | |
5632 | }; | |
74b846e0 | 5633 | template <class U> void f() {} |
d8c4447d MM |
5634 | template S<int>; |
5635 | template void f<double>(); | |
5636 | ||
5637 | Here, the ARGS for the instantiation of will be {int, | |
5638 | double}. But, we only need as many ARGS as there are | |
5639 | levels of template parameters in CODE_PATTERN. We are | |
5640 | careful not to get fooled into reducing the ARGS in | |
5641 | situations like: | |
5642 | ||
5643 | template <class T> struct S { template <class U> void f(U); } | |
5644 | template <class T> template <> void S<T>::f(int) {} | |
5645 | ||
5646 | which we can spot because the pattern will be a | |
5647 | specialization in this case. */ | |
5648 | args_depth = TMPL_ARGS_DEPTH (args); | |
5649 | parms_depth = | |
5650 | TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (DECL_TI_TEMPLATE (t))); | |
5651 | if (args_depth > parms_depth | |
5652 | && !DECL_TEMPLATE_SPECIALIZATION (t)) | |
f9a7ae04 | 5653 | args = get_innermost_template_args (args, parms_depth); |
36a117a5 MM |
5654 | } |
5655 | else | |
5656 | { | |
5657 | /* This special case arises when we have something like this: | |
5658 | ||
5659 | template <class T> struct S { | |
5660 | friend void f<int>(int, double); | |
5661 | }; | |
5662 | ||
5663 | Here, the DECL_TI_TEMPLATE for the friend declaration | |
39c01e4c MM |
5664 | will be a LOOKUP_EXPR or an IDENTIFIER_NODE. We are |
5665 | being called from tsubst_friend_function, and we want | |
5666 | only to create a new decl (R) with appropriate types so | |
5667 | that we can call determine_specialization. */ | |
5668 | my_friendly_assert ((TREE_CODE (DECL_TI_TEMPLATE (t)) | |
5669 | == LOOKUP_EXPR) | |
5670 | || (TREE_CODE (DECL_TI_TEMPLATE (t)) | |
5671 | == IDENTIFIER_NODE), 0); | |
36a117a5 MM |
5672 | gen_tmpl = NULL_TREE; |
5673 | } | |
5674 | ||
6eb3bb27 | 5675 | if (DECL_CLASS_SCOPE_P (t)) |
8d08fdba | 5676 | { |
5566b478 MS |
5677 | if (DECL_NAME (t) == constructor_name (DECL_CONTEXT (t))) |
5678 | member = 2; | |
5679 | else | |
5680 | member = 1; | |
4f1c5b7d | 5681 | ctx = tsubst_aggr_type (DECL_CONTEXT (t), args, |
4393e105 | 5682 | /*complain=*/1, t, |
36a117a5 | 5683 | /*entering_scope=*/1); |
5566b478 MS |
5684 | } |
5685 | else | |
5686 | { | |
5687 | member = 0; | |
4f1c5b7d | 5688 | ctx = DECL_CONTEXT (t); |
5566b478 | 5689 | } |
4393e105 | 5690 | type = tsubst (type, args, /*complain=*/1, in_decl); |
b3da7bb1 MM |
5691 | if (type == error_mark_node) |
5692 | return error_mark_node; | |
8d08fdba | 5693 | |
5566b478 MS |
5694 | /* We do NOT check for matching decls pushed separately at this |
5695 | point, as they may not represent instantiations of this | |
5696 | template, and in any case are considered separate under the | |
312e7d50 | 5697 | discrete model. Instead, see add_maybe_template. */ |
0acf7199 | 5698 | r = copy_decl (t); |
e1467ff2 | 5699 | DECL_USE_TEMPLATE (r) = 0; |
5566b478 MS |
5700 | TREE_TYPE (r) = type; |
5701 | ||
4f1c5b7d MM |
5702 | DECL_CONTEXT (r) = ctx; |
5703 | DECL_VIRTUAL_CONTEXT (r) | |
5704 | = tsubst_aggr_type (DECL_VIRTUAL_CONTEXT (t), args, | |
5705 | /*complain=*/1, t, | |
4393e105 | 5706 | /*entering_scope=*/1); |
5566b478 | 5707 | |
1f6e1acc | 5708 | if (member && DECL_CONV_FN_P (r)) |
669ec2b4 JM |
5709 | { |
5710 | /* Type-conversion operator. Reconstruct the name, in | |
5711 | case it's the name of one of the template's parameters. */ | |
5712 | if (flag_new_abi) | |
5713 | DECL_NAME (r) = mangle_conv_op_name_for_type (TREE_TYPE (type)); | |
5714 | else | |
5715 | DECL_NAME (r) = build_typename_overload (TREE_TYPE (type)); | |
5716 | } | |
5566b478 | 5717 | |
4393e105 MM |
5718 | DECL_ARGUMENTS (r) = tsubst (DECL_ARGUMENTS (t), args, |
5719 | /*complain=*/1, t); | |
17aec3eb | 5720 | DECL_TEMPLATE_RESULT (r) = NULL_TREE; |
711734a9 JM |
5721 | |
5722 | TREE_STATIC (r) = 0; | |
5723 | TREE_PUBLIC (r) = TREE_PUBLIC (t); | |
5724 | DECL_EXTERNAL (r) = 1; | |
5725 | DECL_INTERFACE_KNOWN (r) = 0; | |
5726 | DECL_DEFER_OUTPUT (r) = 0; | |
5727 | TREE_CHAIN (r) = NULL_TREE; | |
5728 | DECL_PENDING_INLINE_INFO (r) = 0; | |
59026e79 | 5729 | DECL_PENDING_INLINE_P (r) = 0; |
711734a9 | 5730 | TREE_USED (r) = 0; |
db9b2174 MM |
5731 | if (DECL_CLONED_FUNCTION (r)) |
5732 | { | |
5733 | DECL_CLONED_FUNCTION (r) = tsubst (DECL_CLONED_FUNCTION (t), | |
5734 | args, /*complain=*/1, t); | |
5735 | TREE_CHAIN (r) = TREE_CHAIN (DECL_CLONED_FUNCTION (r)); | |
5736 | TREE_CHAIN (DECL_CLONED_FUNCTION (r)) = r; | |
5737 | } | |
711734a9 | 5738 | |
36a117a5 MM |
5739 | /* Set up the DECL_TEMPLATE_INFO for R and compute its mangled |
5740 | name. There's no need to do this in the special friend | |
5741 | case mentioned above where GEN_TMPL is NULL. */ | |
5742 | if (gen_tmpl) | |
386b8a85 | 5743 | { |
36a117a5 | 5744 | DECL_TEMPLATE_INFO (r) |
e1b3e07d | 5745 | = tree_cons (gen_tmpl, argvec, NULL_TREE); |
36a117a5 MM |
5746 | SET_DECL_IMPLICIT_INSTANTIATION (r); |
5747 | register_specialization (r, gen_tmpl, argvec); | |
5748 | ||
5749 | /* Set the mangled name for R. */ | |
669ec2b4 JM |
5750 | if (DECL_DESTRUCTOR_P (t)) |
5751 | { | |
5752 | if (flag_new_abi) | |
5753 | set_mangled_name_for_decl (r); | |
5754 | else | |
5755 | DECL_ASSEMBLER_NAME (r) = build_destructor_name (ctx); | |
5756 | } | |
5757 | else | |
5758 | { | |
5759 | /* Instantiations of template functions must be mangled | |
5760 | specially, in order to conform to 14.5.5.1 | |
5761 | [temp.over.link]. */ | |
5762 | tree tmpl = DECL_TI_TEMPLATE (t); | |
5763 | ||
5764 | /* TMPL will be NULL if this is a specialization of a | |
5765 | member function of a template class. */ | |
5766 | if (name_mangling_version < 1 | |
5767 | || tmpl == NULL_TREE | |
5768 | || (member && !is_member_template (tmpl) | |
5769 | && !DECL_TEMPLATE_INFO (tmpl))) | |
5770 | set_mangled_name_for_decl (r); | |
5771 | else | |
5772 | set_mangled_name_for_template_decl (r); | |
5773 | } | |
36a117a5 MM |
5774 | |
5775 | DECL_RTL (r) = 0; | |
5776 | make_decl_rtl (r, NULL_PTR, 1); | |
5777 | ||
5778 | /* Like grokfndecl. If we don't do this, pushdecl will | |
5779 | mess up our TREE_CHAIN because it doesn't find a | |
5780 | previous decl. Sigh. */ | |
5781 | if (member | |
c36ae80f | 5782 | && ! uses_template_parms (r) |
36a117a5 MM |
5783 | && (IDENTIFIER_GLOBAL_VALUE (DECL_ASSEMBLER_NAME (r)) |
5784 | == NULL_TREE)) | |
5785 | SET_IDENTIFIER_GLOBAL_VALUE (DECL_ASSEMBLER_NAME (r), r); | |
9188c363 MM |
5786 | |
5787 | /* We're not supposed to instantiate default arguments | |
5788 | until they are called, for a template. But, for a | |
5789 | declaration like: | |
5790 | ||
5791 | template <class T> void f () | |
5792 | { extern void g(int i = T()); } | |
5793 | ||
5794 | we should do the substitution when the template is | |
5795 | instantiated. We handle the member function case in | |
5796 | instantiate_class_template since the default arguments | |
5797 | might refer to other members of the class. */ | |
5798 | if (!member | |
5799 | && !PRIMARY_TEMPLATE_P (gen_tmpl) | |
5800 | && !uses_template_parms (argvec)) | |
5801 | tsubst_default_arguments (r); | |
386b8a85 | 5802 | } |
f181d4ae | 5803 | |
cf38f48a MM |
5804 | /* Copy the list of befriending classes. */ |
5805 | for (friends = &DECL_BEFRIENDING_CLASSES (r); | |
5806 | *friends; | |
5807 | friends = &TREE_CHAIN (*friends)) | |
5808 | { | |
5809 | *friends = copy_node (*friends); | |
5810 | TREE_VALUE (*friends) = tsubst (TREE_VALUE (*friends), | |
5811 | args, /*complain=*/1, | |
5812 | in_decl); | |
5813 | } | |
5814 | ||
212e7048 | 5815 | if (DECL_CONSTRUCTOR_P (r) || DECL_DESTRUCTOR_P (r)) |
f181d4ae MM |
5816 | { |
5817 | maybe_retrofit_in_chrg (r); | |
212e7048 MM |
5818 | if (DECL_CONSTRUCTOR_P (r)) |
5819 | grok_ctor_properties (ctx, r); | |
f181d4ae | 5820 | } |
596ea4e5 | 5821 | else if (IDENTIFIER_OPNAME_P (DECL_NAME (r))) |
f181d4ae | 5822 | grok_op_properties (r, DECL_VIRTUAL_P (r), DECL_FRIEND_P (r)); |
8d08fdba | 5823 | } |
ae58fa02 | 5824 | break; |
8d08fdba MS |
5825 | |
5826 | case PARM_DECL: | |
5827 | { | |
ae58fa02 | 5828 | r = copy_node (t); |
5566b478 | 5829 | TREE_TYPE (r) = type; |
1b8899d1 MM |
5830 | c_apply_type_quals_to_decl (CP_TYPE_QUALS (type), r); |
5831 | ||
db2767b6 MM |
5832 | if (TREE_CODE (DECL_INITIAL (r)) != TEMPLATE_PARM_INDEX) |
5833 | DECL_INITIAL (r) = TREE_TYPE (r); | |
5834 | else | |
4393e105 MM |
5835 | DECL_INITIAL (r) = tsubst (DECL_INITIAL (r), args, |
5836 | /*complain=*/1, in_decl); | |
db2767b6 | 5837 | |
5566b478 | 5838 | DECL_CONTEXT (r) = NULL_TREE; |
fa56377d JJ |
5839 | if (PROMOTE_PROTOTYPES |
5840 | && (TREE_CODE (type) == INTEGER_TYPE | |
5841 | || TREE_CODE (type) == ENUMERAL_TYPE) | |
f83b0cb6 JM |
5842 | && TYPE_PRECISION (type) < TYPE_PRECISION (integer_type_node)) |
5843 | DECL_ARG_TYPE (r) = integer_type_node; | |
8d08fdba | 5844 | if (TREE_CHAIN (t)) |
4393e105 MM |
5845 | TREE_CHAIN (r) = tsubst (TREE_CHAIN (t), args, |
5846 | /*complain=*/1, TREE_CHAIN (t)); | |
8d08fdba | 5847 | } |
ae58fa02 | 5848 | break; |
8d08fdba | 5849 | |
5566b478 MS |
5850 | case FIELD_DECL: |
5851 | { | |
0acf7199 | 5852 | r = copy_decl (t); |
1b8899d1 MM |
5853 | TREE_TYPE (r) = type; |
5854 | c_apply_type_quals_to_decl (CP_TYPE_QUALS (type), r); | |
5855 | ||
5856 | /* We don't have to set DECL_CONTEXT here; it is set by | |
5857 | finish_member_declaration. */ | |
4393e105 MM |
5858 | DECL_INITIAL (r) = tsubst_expr (DECL_INITIAL (t), args, |
5859 | /*complain=*/1, in_decl); | |
5566b478 | 5860 | TREE_CHAIN (r) = NULL_TREE; |
4393e105 | 5861 | if (TREE_CODE (type) == VOID_TYPE) |
8251199e | 5862 | cp_error_at ("instantiation of `%D' as type void", r); |
5566b478 | 5863 | } |
ae58fa02 | 5864 | break; |
5566b478 MS |
5865 | |
5866 | case USING_DECL: | |
5867 | { | |
ae58fa02 | 5868 | r = copy_node (t); |
5566b478 | 5869 | DECL_INITIAL (r) |
4393e105 | 5870 | = tsubst_copy (DECL_INITIAL (t), args, /*complain=*/1, in_decl); |
5566b478 | 5871 | TREE_CHAIN (r) = NULL_TREE; |
5566b478 | 5872 | } |
ae58fa02 | 5873 | break; |
5566b478 | 5874 | |
9188c363 | 5875 | case TYPE_DECL: |
88e1b92a JM |
5876 | if (TREE_CODE (type) == TEMPLATE_TEMPLATE_PARM |
5877 | || t == TYPE_MAIN_DECL (TREE_TYPE (t))) | |
9188c363 | 5878 | { |
88e1b92a JM |
5879 | /* If this is the canonical decl, we don't have to mess with |
5880 | instantiations, and often we can't (for typename, template | |
5881 | type parms and such). Note that TYPE_NAME is not correct for | |
5882 | the above test if we've copied the type for a typedef. */ | |
b9f39201 | 5883 | r = TYPE_NAME (type); |
9188c363 MM |
5884 | break; |
5885 | } | |
5886 | ||
5887 | /* Fall through. */ | |
5888 | ||
5566b478 MS |
5889 | case VAR_DECL: |
5890 | { | |
1cea0434 KG |
5891 | tree argvec = NULL_TREE; |
5892 | tree gen_tmpl = NULL_TREE; | |
36a117a5 | 5893 | tree spec; |
1cea0434 | 5894 | tree tmpl = NULL_TREE; |
9188c363 | 5895 | tree ctx; |
6dfbb909 | 5896 | int local_p; |
9188c363 | 5897 | |
6dfbb909 MM |
5898 | /* Assume this is a non-local variable. */ |
5899 | local_p = 0; | |
5566b478 | 5900 | |
de96bf57 | 5901 | if (TYPE_P (CP_DECL_CONTEXT (t))) |
9188c363 MM |
5902 | ctx = tsubst_aggr_type (DECL_CONTEXT (t), args, |
5903 | /*complain=*/1, | |
5904 | in_decl, /*entering_scope=*/1); | |
5905 | else | |
6dfbb909 MM |
5906 | { |
5907 | /* Subsequent calls to pushdecl will fill this in. */ | |
5908 | ctx = NULL_TREE; | |
5909 | if (!DECL_NAMESPACE_SCOPE_P (t)) | |
5910 | local_p = 1; | |
5911 | } | |
9188c363 | 5912 | |
36a117a5 | 5913 | /* Check to see if we already have this specialization. */ |
6dfbb909 MM |
5914 | if (!local_p) |
5915 | { | |
5916 | tmpl = DECL_TI_TEMPLATE (t); | |
5917 | gen_tmpl = most_general_template (tmpl); | |
5918 | argvec = tsubst (DECL_TI_ARGS (t), args, /*complain=*/1, in_decl); | |
5919 | spec = retrieve_specialization (gen_tmpl, argvec); | |
5920 | } | |
9188c363 | 5921 | else |
6dfbb909 | 5922 | spec = retrieve_local_specialization (t); |
9188c363 | 5923 | |
36a117a5 | 5924 | if (spec) |
ae58fa02 MM |
5925 | { |
5926 | r = spec; | |
5927 | break; | |
5928 | } | |
5566b478 | 5929 | |
0acf7199 | 5930 | r = copy_decl (t); |
5566b478 | 5931 | TREE_TYPE (r) = type; |
1b8899d1 | 5932 | c_apply_type_quals_to_decl (CP_TYPE_QUALS (type), r); |
5566b478 | 5933 | DECL_CONTEXT (r) = ctx; |
d11ad92e MS |
5934 | |
5935 | /* Don't try to expand the initializer until someone tries to use | |
5936 | this variable; otherwise we run into circular dependencies. */ | |
5937 | DECL_INITIAL (r) = NULL_TREE; | |
5566b478 | 5938 | DECL_RTL (r) = 0; |
06ceef4e | 5939 | DECL_SIZE (r) = DECL_SIZE_UNIT (r) = 0; |
5566b478 | 5940 | |
f9817201 MM |
5941 | /* For __PRETTY_FUNCTION__ we have to adjust the initializer. */ |
5942 | if (DECL_PRETTY_FUNCTION_P (r)) | |
5943 | { | |
5944 | DECL_INITIAL (r) = tsubst (DECL_INITIAL (t), | |
5945 | args, | |
5946 | /*complain=*/1, | |
5947 | NULL_TREE); | |
5948 | TREE_TYPE (r) = TREE_TYPE (DECL_INITIAL (r)); | |
5949 | } | |
5950 | ||
e0942dcd MM |
5951 | /* Even if the original location is out of scope, the newly |
5952 | substituted one is not. */ | |
5953 | if (TREE_CODE (r) == VAR_DECL) | |
5954 | DECL_DEAD_FOR_LOCAL (r) = 0; | |
5955 | ||
6dfbb909 MM |
5956 | if (!local_p) |
5957 | { | |
5958 | /* A static data member declaration is always marked | |
5959 | external when it is declared in-class, even if an | |
5960 | initializer is present. We mimic the non-template | |
5961 | processing here. */ | |
5962 | DECL_EXTERNAL (r) = 1; | |
fa8d6e85 | 5963 | |
6dfbb909 MM |
5964 | register_specialization (r, gen_tmpl, argvec); |
5965 | DECL_TEMPLATE_INFO (r) = tree_cons (tmpl, argvec, NULL_TREE); | |
5966 | SET_DECL_IMPLICIT_INSTANTIATION (r); | |
5967 | } | |
9188c363 | 5968 | else |
6dfbb909 | 5969 | register_local_specialization (r, t); |
5566b478 | 5970 | |
5566b478 | 5971 | TREE_CHAIN (r) = NULL_TREE; |
9188c363 | 5972 | if (TREE_CODE (r) == VAR_DECL && TREE_CODE (type) == VOID_TYPE) |
8251199e | 5973 | cp_error_at ("instantiation of `%D' as type void", r); |
5566b478 | 5974 | } |
ae58fa02 | 5975 | break; |
5566b478 | 5976 | |
ae58fa02 MM |
5977 | default: |
5978 | my_friendly_abort (0); | |
5979 | } | |
5980 | ||
5981 | /* Restore the file and line information. */ | |
5982 | lineno = saved_lineno; | |
5983 | input_filename = saved_filename; | |
5984 | ||
5985 | return r; | |
5986 | } | |
5987 | ||
cabc336a MM |
5988 | /* Substitue into the ARG_TYPES of a function type. */ |
5989 | ||
e9659ab0 | 5990 | static tree |
4393e105 | 5991 | tsubst_arg_types (arg_types, args, complain, in_decl) |
cabc336a MM |
5992 | tree arg_types; |
5993 | tree args; | |
4393e105 | 5994 | int complain; |
cabc336a MM |
5995 | tree in_decl; |
5996 | { | |
5997 | tree remaining_arg_types; | |
cabc336a MM |
5998 | tree type; |
5999 | ||
6000 | if (!arg_types || arg_types == void_list_node) | |
6001 | return arg_types; | |
6002 | ||
6003 | remaining_arg_types = tsubst_arg_types (TREE_CHAIN (arg_types), | |
4393e105 MM |
6004 | args, complain, in_decl); |
6005 | if (remaining_arg_types == error_mark_node) | |
6006 | return error_mark_node; | |
6007 | ||
6008 | type = tsubst (TREE_VALUE (arg_types), args, complain, in_decl); | |
6009 | if (type == error_mark_node) | |
6010 | return error_mark_node; | |
cabc336a | 6011 | |
4393e105 MM |
6012 | /* Do array-to-pointer, function-to-pointer conversion, and ignore |
6013 | top-level qualifiers as required. */ | |
6014 | type = TYPE_MAIN_VARIANT (type_decays_to (type)); | |
cabc336a MM |
6015 | |
6016 | /* Note that we do not substitute into default arguments here. The | |
6017 | standard mandates that they be instantiated only when needed, | |
6018 | which is done in build_over_call. */ | |
51632249 JM |
6019 | return hash_tree_cons (TREE_PURPOSE (arg_types), type, |
6020 | remaining_arg_types); | |
cabc336a MM |
6021 | |
6022 | } | |
6023 | ||
4393e105 MM |
6024 | /* Substitute into a FUNCTION_TYPE or METHOD_TYPE. This routine does |
6025 | *not* handle the exception-specification for FNTYPE, because the | |
6026 | initial substitution of explicitly provided template parameters | |
6027 | during argument deduction forbids substitution into the | |
6028 | exception-specification: | |
6029 | ||
6030 | [temp.deduct] | |
6031 | ||
6032 | All references in the function type of the function template to the | |
6033 | corresponding template parameters are replaced by the specified tem- | |
6034 | plate argument values. If a substitution in a template parameter or | |
6035 | in the function type of the function template results in an invalid | |
6036 | type, type deduction fails. [Note: The equivalent substitution in | |
6037 | exception specifications is done only when the function is instanti- | |
6038 | ated, at which point a program is ill-formed if the substitution | |
6039 | results in an invalid type.] */ | |
6040 | ||
6041 | static tree | |
6042 | tsubst_function_type (t, args, complain, in_decl) | |
6043 | tree t; | |
6044 | tree args; | |
6045 | int complain; | |
6046 | tree in_decl; | |
6047 | { | |
6048 | tree return_type; | |
6049 | tree arg_types; | |
6050 | tree fntype; | |
6051 | ||
8dd3f57a | 6052 | /* The TYPE_CONTEXT is not used for function/method types. */ |
4393e105 MM |
6053 | my_friendly_assert (TYPE_CONTEXT (t) == NULL_TREE, 0); |
6054 | ||
6055 | /* Substitue the return type. */ | |
6056 | return_type = tsubst (TREE_TYPE (t), args, complain, in_decl); | |
6057 | if (return_type == error_mark_node) | |
6058 | return error_mark_node; | |
6059 | ||
6060 | /* Substitue the argument types. */ | |
6061 | arg_types = tsubst_arg_types (TYPE_ARG_TYPES (t), args, | |
6062 | complain, in_decl); | |
6063 | if (arg_types == error_mark_node) | |
6064 | return error_mark_node; | |
6065 | ||
6066 | /* Construct a new type node and return it. */ | |
6067 | if (TREE_CODE (t) == FUNCTION_TYPE) | |
6068 | fntype = build_function_type (return_type, arg_types); | |
6069 | else | |
6070 | { | |
6071 | tree r = TREE_TYPE (TREE_VALUE (arg_types)); | |
6072 | if (! IS_AGGR_TYPE (r)) | |
6073 | { | |
6074 | /* [temp.deduct] | |
6075 | ||
6076 | Type deduction may fail for any of the following | |
6077 | reasons: | |
6078 | ||
6079 | -- Attempting to create "pointer to member of T" when T | |
6080 | is not a class type. */ | |
6081 | if (complain) | |
6082 | cp_error ("creating pointer to member function of non-class type `%T'", | |
6083 | r); | |
6084 | return error_mark_node; | |
6085 | } | |
6086 | ||
6087 | fntype = build_cplus_method_type (r, return_type, TREE_CHAIN | |
6088 | (arg_types)); | |
6089 | } | |
6090 | fntype = build_qualified_type (fntype, TYPE_QUALS (t)); | |
ada846eb | 6091 | fntype = build_type_attribute_variant (fntype, TYPE_ATTRIBUTES (t)); |
4393e105 MM |
6092 | |
6093 | return fntype; | |
6094 | } | |
6095 | ||
297e73d8 MM |
6096 | /* Substitute into the PARMS of a call-declarator. */ |
6097 | ||
e9659ab0 | 6098 | static tree |
4393e105 | 6099 | tsubst_call_declarator_parms (parms, args, complain, in_decl) |
297e73d8 MM |
6100 | tree parms; |
6101 | tree args; | |
4393e105 | 6102 | int complain; |
297e73d8 MM |
6103 | tree in_decl; |
6104 | { | |
6105 | tree new_parms; | |
6106 | tree type; | |
6107 | tree defarg; | |
6108 | ||
6109 | if (!parms || parms == void_list_node) | |
6110 | return parms; | |
6111 | ||
6112 | new_parms = tsubst_call_declarator_parms (TREE_CHAIN (parms), | |
4393e105 | 6113 | args, complain, in_decl); |
297e73d8 MM |
6114 | |
6115 | /* Figure out the type of this parameter. */ | |
4393e105 | 6116 | type = tsubst (TREE_VALUE (parms), args, complain, in_decl); |
297e73d8 MM |
6117 | |
6118 | /* Figure out the default argument as well. Note that we use | |
4393e105 MM |
6119 | tsubst_expr since the default argument is really an expression. */ |
6120 | defarg = tsubst_expr (TREE_PURPOSE (parms), args, complain, in_decl); | |
297e73d8 MM |
6121 | |
6122 | /* Chain this parameter on to the front of those we have already | |
6123 | processed. We don't use hash_tree_cons because that function | |
6124 | doesn't check TREE_PARMLIST. */ | |
6125 | new_parms = tree_cons (defarg, type, new_parms); | |
6126 | ||
6127 | /* And note that these are parameters. */ | |
6128 | TREE_PARMLIST (new_parms) = 1; | |
6129 | ||
6130 | return new_parms; | |
6131 | } | |
6132 | ||
4393e105 MM |
6133 | /* Take the tree structure T and replace template parameters used |
6134 | therein with the argument vector ARGS. IN_DECL is an associated | |
6135 | decl for diagnostics. If an error occurs, returns ERROR_MARK_NODE. | |
6136 | An appropriate error message is issued only if COMPLAIN is | |
6137 | non-zero. Note that we must be relatively non-tolerant of | |
6138 | extensions here, in order to preserve conformance; if we allow | |
6139 | substitutions that should not be allowed, we may allow argument | |
6140 | deductions that should not succeed, and therefore report ambiguous | |
6141 | overload situations where there are none. In theory, we could | |
6142 | allow the substitution, but indicate that it should have failed, | |
6143 | and allow our caller to make sure that the right thing happens, but | |
6144 | we don't try to do this yet. | |
6145 | ||
6146 | This function is used for dealing with types, decls and the like; | |
6147 | for expressions, use tsubst_expr or tsubst_copy. */ | |
ae58fa02 MM |
6148 | |
6149 | tree | |
4393e105 | 6150 | tsubst (t, args, complain, in_decl) |
ae58fa02 | 6151 | tree t, args; |
4393e105 | 6152 | int complain; |
ae58fa02 MM |
6153 | tree in_decl; |
6154 | { | |
0ecfe0b4 | 6155 | tree type, r; |
ae58fa02 MM |
6156 | |
6157 | if (t == NULL_TREE || t == error_mark_node | |
6158 | || t == integer_type_node | |
6159 | || t == void_type_node | |
6160 | || t == char_type_node | |
6161 | || TREE_CODE (t) == NAMESPACE_DECL) | |
6162 | return t; | |
6163 | ||
6164 | if (TREE_CODE (t) == IDENTIFIER_NODE) | |
6165 | type = IDENTIFIER_TYPE_VALUE (t); | |
6166 | else | |
6167 | type = TREE_TYPE (t); | |
6168 | if (type == unknown_type_node) | |
6169 | my_friendly_abort (42); | |
6170 | ||
6171 | if (type && TREE_CODE (t) != FUNCTION_DECL | |
6172 | && TREE_CODE (t) != TYPENAME_TYPE | |
6173 | && TREE_CODE (t) != TEMPLATE_DECL | |
4393e105 MM |
6174 | && TREE_CODE (t) != IDENTIFIER_NODE |
6175 | && TREE_CODE (t) != FUNCTION_TYPE | |
6176 | && TREE_CODE (t) != METHOD_TYPE) | |
6177 | type = tsubst (type, args, complain, in_decl); | |
6178 | if (type == error_mark_node) | |
6179 | return error_mark_node; | |
ae58fa02 | 6180 | |
2f939d94 | 6181 | if (DECL_P (t)) |
ae58fa02 MM |
6182 | return tsubst_decl (t, args, type, in_decl); |
6183 | ||
6184 | switch (TREE_CODE (t)) | |
6185 | { | |
6186 | case RECORD_TYPE: | |
6187 | case UNION_TYPE: | |
6188 | case ENUMERAL_TYPE: | |
4393e105 MM |
6189 | return tsubst_aggr_type (t, args, complain, in_decl, |
6190 | /*entering_scope=*/0); | |
ae58fa02 MM |
6191 | |
6192 | case ERROR_MARK: | |
6193 | case IDENTIFIER_NODE: | |
6194 | case OP_IDENTIFIER: | |
6195 | case VOID_TYPE: | |
6196 | case REAL_TYPE: | |
6197 | case COMPLEX_TYPE: | |
6198 | case BOOLEAN_TYPE: | |
6199 | case INTEGER_CST: | |
6200 | case REAL_CST: | |
6201 | case STRING_CST: | |
6202 | return t; | |
6203 | ||
6204 | case INTEGER_TYPE: | |
6205 | if (t == integer_type_node) | |
6206 | return t; | |
6207 | ||
6208 | if (TREE_CODE (TYPE_MIN_VALUE (t)) == INTEGER_CST | |
6209 | && TREE_CODE (TYPE_MAX_VALUE (t)) == INTEGER_CST) | |
6210 | return t; | |
d2e5ee5c | 6211 | |
5566b478 | 6212 | { |
ddce3528 | 6213 | tree max, omax = TREE_OPERAND (TYPE_MAX_VALUE (t), 0); |
7ddedda4 | 6214 | |
ddce3528 | 6215 | max = tsubst_expr (omax, args, complain, in_decl); |
4393e105 MM |
6216 | if (max == error_mark_node) |
6217 | return error_mark_node; | |
6218 | ||
8dd3f57a MM |
6219 | /* See if we can reduce this expression to something simpler. */ |
6220 | max = maybe_fold_nontype_arg (max); | |
fc611ce0 | 6221 | if (!processing_template_decl) |
8dd3f57a MM |
6222 | max = decl_constant_value (max); |
6223 | ||
856216bb MM |
6224 | if (processing_template_decl |
6225 | /* When providing explicit arguments to a template | |
6226 | function, but leaving some arguments for subsequent | |
6227 | deduction, MAX may be template-dependent even if we're | |
c95cd22e JM |
6228 | not PROCESSING_TEMPLATE_DECL. We still need to check for |
6229 | template parms, though; MAX won't be an INTEGER_CST for | |
6230 | dynamic arrays, either. */ | |
6231 | || (TREE_CODE (max) != INTEGER_CST | |
6232 | && uses_template_parms (max))) | |
ae58fa02 | 6233 | { |
8dd3f57a MM |
6234 | tree itype = make_node (INTEGER_TYPE); |
6235 | TYPE_MIN_VALUE (itype) = size_zero_node; | |
6236 | TYPE_MAX_VALUE (itype) = build_min (MINUS_EXPR, sizetype, max, | |
6237 | integer_one_node); | |
6238 | return itype; | |
ae58fa02 MM |
6239 | } |
6240 | ||
ddce3528 JM |
6241 | if (integer_zerop (omax)) |
6242 | { | |
6243 | /* Still allow an explicit array of size zero. */ | |
6244 | if (pedantic) | |
6245 | pedwarn ("creating array with size zero"); | |
6246 | } | |
07c88314 MM |
6247 | else if (integer_zerop (max) |
6248 | || (TREE_CODE (max) == INTEGER_CST | |
6249 | && INT_CST_LT (max, integer_zero_node))) | |
0ecfe0b4 | 6250 | { |
4393e105 MM |
6251 | /* [temp.deduct] |
6252 | ||
6253 | Type deduction may fail for any of the following | |
6254 | reasons: | |
6255 | ||
bf8f3f93 MM |
6256 | Attempting to create an array with a size that is |
6257 | zero or negative. */ | |
4393e105 | 6258 | if (complain) |
16bb3387 | 6259 | cp_error ("creating array with size zero (`%E')", max); |
4393e105 MM |
6260 | |
6261 | return error_mark_node; | |
0ecfe0b4 JM |
6262 | } |
6263 | ||
c95cd22e | 6264 | return compute_array_index_type (NULL_TREE, max); |
ae58fa02 MM |
6265 | } |
6266 | ||
6267 | case TEMPLATE_TYPE_PARM: | |
6268 | case TEMPLATE_TEMPLATE_PARM: | |
6269 | case TEMPLATE_PARM_INDEX: | |
6270 | { | |
6271 | int idx; | |
6272 | int level; | |
6273 | int levels; | |
0ecfe0b4 JM |
6274 | |
6275 | r = NULL_TREE; | |
ae58fa02 MM |
6276 | |
6277 | if (TREE_CODE (t) == TEMPLATE_TYPE_PARM | |
6278 | || TREE_CODE (t) == TEMPLATE_TEMPLATE_PARM) | |
6279 | { | |
6280 | idx = TEMPLATE_TYPE_IDX (t); | |
6281 | level = TEMPLATE_TYPE_LEVEL (t); | |
6282 | } | |
6283 | else | |
6284 | { | |
6285 | idx = TEMPLATE_PARM_IDX (t); | |
6286 | level = TEMPLATE_PARM_LEVEL (t); | |
6287 | } | |
6288 | ||
6289 | if (TREE_VEC_LENGTH (args) > 0) | |
6290 | { | |
6291 | tree arg = NULL_TREE; | |
6292 | ||
6293 | levels = TMPL_ARGS_DEPTH (args); | |
6294 | if (level <= levels) | |
6295 | arg = TMPL_ARG (args, level, idx); | |
6296 | ||
8b5b8b7c MM |
6297 | if (arg == error_mark_node) |
6298 | return error_mark_node; | |
6299 | else if (arg != NULL_TREE) | |
ae58fa02 MM |
6300 | { |
6301 | if (TREE_CODE (t) == TEMPLATE_TYPE_PARM) | |
6302 | { | |
2f939d94 | 6303 | my_friendly_assert (TYPE_P (arg), 0); |
adecb3f4 MM |
6304 | return cp_build_qualified_type_real |
6305 | (arg, CP_TYPE_QUALS (arg) | CP_TYPE_QUALS (t), | |
6306 | complain); | |
ae58fa02 MM |
6307 | } |
6308 | else if (TREE_CODE (t) == TEMPLATE_TEMPLATE_PARM) | |
6309 | { | |
7ddedda4 | 6310 | if (TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (t)) |
ae58fa02 MM |
6311 | { |
6312 | /* We are processing a type constructed from | |
6313 | a template template parameter */ | |
7ddedda4 | 6314 | tree argvec = tsubst (TYPE_TI_ARGS (t), |
4393e105 MM |
6315 | args, complain, in_decl); |
6316 | if (argvec == error_mark_node) | |
6317 | return error_mark_node; | |
6318 | ||
ae58fa02 MM |
6319 | /* We can get a TEMPLATE_TEMPLATE_PARM here when |
6320 | we are resolving nested-types in the signature of | |
6321 | a member function templates. | |
6322 | Otherwise ARG is a TEMPLATE_DECL and is the real | |
6323 | template to be instantiated. */ | |
6324 | if (TREE_CODE (arg) == TEMPLATE_TEMPLATE_PARM) | |
6325 | arg = TYPE_NAME (arg); | |
6326 | ||
6327 | r = lookup_template_class (DECL_NAME (arg), | |
6328 | argvec, in_decl, | |
6329 | DECL_CONTEXT (arg), | |
6330 | /*entering_scope=*/0); | |
adecb3f4 MM |
6331 | return cp_build_qualified_type_real (r, |
6332 | TYPE_QUALS (t), | |
6333 | complain); | |
ae58fa02 MM |
6334 | } |
6335 | else | |
6336 | /* We are processing a template argument list. */ | |
6337 | return arg; | |
6338 | } | |
6339 | else | |
6340 | return arg; | |
6341 | } | |
6342 | } | |
51924768 JM |
6343 | else |
6344 | my_friendly_abort (981018); | |
ae58fa02 MM |
6345 | |
6346 | if (level == 1) | |
6347 | /* This can happen during the attempted tsubst'ing in | |
6348 | unify. This means that we don't yet have any information | |
6349 | about the template parameter in question. */ | |
6350 | return t; | |
6351 | ||
6352 | /* If we get here, we must have been looking at a parm for a | |
6353 | more deeply nested template. Make a new version of this | |
6354 | template parameter, but with a lower level. */ | |
6355 | switch (TREE_CODE (t)) | |
6356 | { | |
6357 | case TEMPLATE_TYPE_PARM: | |
6358 | case TEMPLATE_TEMPLATE_PARM: | |
6359 | r = copy_node (t); | |
6360 | TEMPLATE_TYPE_PARM_INDEX (r) | |
6361 | = reduce_template_parm_level (TEMPLATE_TYPE_PARM_INDEX (t), | |
6362 | r, levels); | |
6363 | TYPE_STUB_DECL (r) = TYPE_NAME (r) = TEMPLATE_TYPE_DECL (r); | |
6364 | TYPE_MAIN_VARIANT (r) = r; | |
6365 | TYPE_POINTER_TO (r) = NULL_TREE; | |
6366 | TYPE_REFERENCE_TO (r) = NULL_TREE; | |
6367 | ||
6368 | if (TREE_CODE (t) == TEMPLATE_TEMPLATE_PARM | |
7ddedda4 | 6369 | && TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (t)) |
ae58fa02 | 6370 | { |
4393e105 MM |
6371 | tree argvec = tsubst (TYPE_TI_ARGS (t), args, |
6372 | complain, in_decl); | |
6373 | if (argvec == error_mark_node) | |
6374 | return error_mark_node; | |
6375 | ||
7ddedda4 | 6376 | TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (r) |
e1b3e07d | 6377 | = tree_cons (TYPE_NAME (t), argvec, NULL_TREE); |
ae58fa02 MM |
6378 | } |
6379 | break; | |
6380 | ||
6381 | case TEMPLATE_PARM_INDEX: | |
6382 | r = reduce_template_parm_level (t, type, levels); | |
6383 | break; | |
6384 | ||
6385 | default: | |
6386 | my_friendly_abort (0); | |
6387 | } | |
6388 | ||
5566b478 | 6389 | return r; |
ae58fa02 | 6390 | } |
5566b478 | 6391 | |
8d08fdba MS |
6392 | case TREE_LIST: |
6393 | { | |
6394 | tree purpose, value, chain, result; | |
8d08fdba MS |
6395 | |
6396 | if (t == void_list_node) | |
6397 | return t; | |
6398 | ||
8d08fdba MS |
6399 | purpose = TREE_PURPOSE (t); |
6400 | if (purpose) | |
4393e105 MM |
6401 | { |
6402 | purpose = tsubst (purpose, args, complain, in_decl); | |
6403 | if (purpose == error_mark_node) | |
6404 | return error_mark_node; | |
6405 | } | |
8d08fdba MS |
6406 | value = TREE_VALUE (t); |
6407 | if (value) | |
4393e105 MM |
6408 | { |
6409 | value = tsubst (value, args, complain, in_decl); | |
6410 | if (value == error_mark_node) | |
6411 | return error_mark_node; | |
6412 | } | |
8d08fdba MS |
6413 | chain = TREE_CHAIN (t); |
6414 | if (chain && chain != void_type_node) | |
4393e105 MM |
6415 | { |
6416 | chain = tsubst (chain, args, complain, in_decl); | |
6417 | if (chain == error_mark_node) | |
6418 | return error_mark_node; | |
6419 | } | |
8d08fdba MS |
6420 | if (purpose == TREE_PURPOSE (t) |
6421 | && value == TREE_VALUE (t) | |
6422 | && chain == TREE_CHAIN (t)) | |
6423 | return t; | |
51632249 | 6424 | result = hash_tree_cons (purpose, value, chain); |
8d08fdba MS |
6425 | TREE_PARMLIST (result) = TREE_PARMLIST (t); |
6426 | return result; | |
6427 | } | |
6428 | case TREE_VEC: | |
5566b478 MS |
6429 | if (type != NULL_TREE) |
6430 | { | |
1ceaad38 JM |
6431 | /* A binfo node. We always need to make a copy, of the node |
6432 | itself and of its BINFO_BASETYPES. */ | |
85b71cf2 | 6433 | |
5566b478 MS |
6434 | t = copy_node (t); |
6435 | ||
c7449f2b JM |
6436 | /* Make sure type isn't a typedef copy. */ |
6437 | type = BINFO_TYPE (TYPE_BINFO (type)); | |
6438 | ||
5566b478 | 6439 | TREE_TYPE (t) = complete_type (type); |
6633d636 MS |
6440 | if (IS_AGGR_TYPE (type)) |
6441 | { | |
6442 | BINFO_VTABLE (t) = TYPE_BINFO_VTABLE (type); | |
6443 | BINFO_VIRTUALS (t) = TYPE_BINFO_VIRTUALS (type); | |
6444 | if (TYPE_BINFO_BASETYPES (type) != NULL_TREE) | |
6445 | BINFO_BASETYPES (t) = copy_node (TYPE_BINFO_BASETYPES (type)); | |
6446 | } | |
5566b478 MS |
6447 | return t; |
6448 | } | |
85b71cf2 JM |
6449 | |
6450 | /* Otherwise, a vector of template arguments. */ | |
4393e105 | 6451 | return tsubst_template_arg_vector (t, args, complain); |
8d08fdba | 6452 | |
8d08fdba MS |
6453 | case POINTER_TYPE: |
6454 | case REFERENCE_TYPE: | |
6455 | { | |
8d08fdba | 6456 | enum tree_code code; |
79a7c7fa | 6457 | |
8d08fdba MS |
6458 | if (type == TREE_TYPE (t)) |
6459 | return t; | |
6460 | ||
6461 | code = TREE_CODE (t); | |
4393e105 MM |
6462 | |
6463 | ||
6464 | /* [temp.deduct] | |
6465 | ||
6466 | Type deduction may fail for any of the following | |
6467 | reasons: | |
6468 | ||
6469 | -- Attempting to create a pointer to reference type. | |
6470 | -- Attempting to create a reference to a reference type or | |
6471 | a reference to void. */ | |
0ecfe0b4 JM |
6472 | if (TREE_CODE (type) == REFERENCE_TYPE |
6473 | || (code == REFERENCE_TYPE && TREE_CODE (type) == VOID_TYPE)) | |
79a7c7fa JM |
6474 | { |
6475 | static int last_line = 0; | |
3b304f5b | 6476 | static const char* last_file = 0; |
79a7c7fa JM |
6477 | |
6478 | /* We keep track of the last time we issued this error | |
6479 | message to avoid spewing a ton of messages during a | |
6480 | single bad template instantiation. */ | |
4393e105 MM |
6481 | if (complain && (last_line != lineno || |
6482 | last_file != input_filename)) | |
79a7c7fa | 6483 | { |
0ecfe0b4 JM |
6484 | if (TREE_CODE (type) == VOID_TYPE) |
6485 | cp_error ("forming reference to void"); | |
6486 | else | |
6487 | cp_error ("forming %s to reference type `%T'", | |
6488 | (code == POINTER_TYPE) ? "pointer" : "reference", | |
6489 | type); | |
79a7c7fa JM |
6490 | last_line = lineno; |
6491 | last_file = input_filename; | |
6492 | } | |
6493 | ||
4393e105 | 6494 | return error_mark_node; |
79a7c7fa JM |
6495 | } |
6496 | else if (code == POINTER_TYPE) | |
8d08fdba MS |
6497 | r = build_pointer_type (type); |
6498 | else | |
6499 | r = build_reference_type (type); | |
adecb3f4 | 6500 | r = cp_build_qualified_type_real (r, TYPE_QUALS (t), complain); |
79a7c7fa | 6501 | |
8d08fdba MS |
6502 | /* Will this ever be needed for TYPE_..._TO values? */ |
6503 | layout_type (r); | |
6504 | return r; | |
6505 | } | |
a4443a08 | 6506 | case OFFSET_TYPE: |
0ecfe0b4 | 6507 | { |
4393e105 MM |
6508 | r = tsubst (TYPE_OFFSET_BASETYPE (t), args, complain, in_decl); |
6509 | if (r == error_mark_node || !IS_AGGR_TYPE (r)) | |
6510 | { | |
6511 | /* [temp.deduct] | |
6512 | ||
6513 | Type deduction may fail for any of the following | |
6514 | reasons: | |
6515 | ||
6516 | -- Attempting to create "pointer to member of T" when T | |
6517 | is not a class type. */ | |
6518 | if (complain) | |
6519 | cp_error ("creating pointer to member of non-class type `%T'", | |
6520 | r); | |
6521 | return error_mark_node; | |
6522 | } | |
0ecfe0b4 JM |
6523 | return build_offset_type (r, type); |
6524 | } | |
8d08fdba MS |
6525 | case FUNCTION_TYPE: |
6526 | case METHOD_TYPE: | |
6527 | { | |
c11b6f21 | 6528 | tree fntype; |
4393e105 | 6529 | tree raises; |
8d08fdba | 6530 | |
4393e105 MM |
6531 | fntype = tsubst_function_type (t, args, complain, in_decl); |
6532 | if (fntype == error_mark_node) | |
6533 | return error_mark_node; | |
cabc336a MM |
6534 | |
6535 | /* Substitue the exception specification. */ | |
6536 | raises = TYPE_RAISES_EXCEPTIONS (t); | |
c11b6f21 MS |
6537 | if (raises) |
6538 | { | |
4cc1d462 NS |
6539 | tree list = NULL_TREE; |
6540 | ||
6541 | if (! TREE_VALUE (raises)) | |
6542 | list = raises; | |
6543 | else | |
6544 | for (; raises != NULL_TREE; raises = TREE_CHAIN (raises)) | |
6545 | { | |
6546 | tree spec = TREE_VALUE (raises); | |
6547 | ||
6548 | spec = tsubst (spec, args, complain, in_decl); | |
6549 | if (spec == error_mark_node) | |
6550 | return spec; | |
6551 | list = add_exception_specifier (list, spec, complain); | |
6552 | } | |
6553 | fntype = build_exception_variant (fntype, list); | |
c11b6f21 MS |
6554 | } |
6555 | return fntype; | |
8d08fdba MS |
6556 | } |
6557 | case ARRAY_TYPE: | |
6558 | { | |
4393e105 MM |
6559 | tree domain = tsubst (TYPE_DOMAIN (t), args, complain, in_decl); |
6560 | if (domain == error_mark_node) | |
6561 | return error_mark_node; | |
6562 | ||
6563 | /* As an optimization, we avoid regenerating the array type if | |
6564 | it will obviously be the same as T. */ | |
8d08fdba MS |
6565 | if (type == TREE_TYPE (t) && domain == TYPE_DOMAIN (t)) |
6566 | return t; | |
0ecfe0b4 | 6567 | |
4393e105 MM |
6568 | /* These checks should match the ones in grokdeclarator. |
6569 | ||
6570 | [temp.deduct] | |
6571 | ||
6572 | The deduction may fail for any of the following reasons: | |
6573 | ||
6574 | -- Attempting to create an array with an element type that | |
6575 | is void, a function type, or a reference type. */ | |
6576 | if (TREE_CODE (type) == VOID_TYPE | |
6577 | || TREE_CODE (type) == FUNCTION_TYPE | |
6578 | || TREE_CODE (type) == REFERENCE_TYPE) | |
0ecfe0b4 | 6579 | { |
4393e105 MM |
6580 | if (complain) |
6581 | cp_error ("creating array of `%T'", type); | |
6582 | return error_mark_node; | |
0ecfe0b4 JM |
6583 | } |
6584 | ||
8d08fdba MS |
6585 | r = build_cplus_array_type (type, domain); |
6586 | return r; | |
6587 | } | |
6588 | ||
8d08fdba | 6589 | case PLUS_EXPR: |
5566b478 | 6590 | case MINUS_EXPR: |
4393e105 MM |
6591 | { |
6592 | tree e1 = tsubst (TREE_OPERAND (t, 0), args, complain, | |
6593 | in_decl); | |
6594 | tree e2 = tsubst (TREE_OPERAND (t, 1), args, complain, | |
6595 | in_decl); | |
6596 | ||
6597 | if (e1 == error_mark_node || e2 == error_mark_node) | |
6598 | return error_mark_node; | |
6599 | ||
6600 | return fold (build (TREE_CODE (t), TREE_TYPE (t), e1, e2)); | |
6601 | } | |
8d08fdba MS |
6602 | |
6603 | case NEGATE_EXPR: | |
6604 | case NOP_EXPR: | |
4393e105 MM |
6605 | { |
6606 | tree e = tsubst (TREE_OPERAND (t, 0), args, complain, | |
6607 | in_decl); | |
6608 | if (e == error_mark_node) | |
6609 | return error_mark_node; | |
6610 | ||
6611 | return fold (build (TREE_CODE (t), TREE_TYPE (t), e)); | |
6612 | } | |
8d08fdba | 6613 | |
5566b478 MS |
6614 | case TYPENAME_TYPE: |
6615 | { | |
4393e105 MM |
6616 | tree ctx = tsubst_aggr_type (TYPE_CONTEXT (t), args, complain, |
6617 | in_decl, /*entering_scope=*/1); | |
6618 | tree f = tsubst_copy (TYPENAME_TYPE_FULLNAME (t), args, | |
6619 | complain, in_decl); | |
6620 | ||
6621 | if (ctx == error_mark_node || f == error_mark_node) | |
6622 | return error_mark_node; | |
ae58fa02 | 6623 | |
bf8f3f93 MM |
6624 | if (!IS_AGGR_TYPE (ctx)) |
6625 | { | |
6626 | if (complain) | |
6627 | cp_error ("`%T' is not a class, struct, or union type", | |
6628 | ctx); | |
6629 | return error_mark_node; | |
6630 | } | |
6631 | else if (!uses_template_parms (ctx) && !TYPE_BEING_DEFINED (ctx)) | |
6632 | { | |
6633 | /* Normally, make_typename_type does not require that the CTX | |
6634 | have complete type in order to allow things like: | |
ae58fa02 | 6635 | |
bf8f3f93 | 6636 | template <class T> struct S { typename S<T>::X Y; }; |
ae58fa02 | 6637 | |
bf8f3f93 MM |
6638 | But, such constructs have already been resolved by this |
6639 | point, so here CTX really should have complete type, unless | |
6640 | it's a partial instantiation. */ | |
4393e105 | 6641 | ctx = complete_type (ctx); |
d0f062fb | 6642 | if (!COMPLETE_TYPE_P (ctx)) |
4393e105 MM |
6643 | { |
6644 | if (complain) | |
6645 | incomplete_type_error (NULL_TREE, ctx); | |
6646 | return error_mark_node; | |
6647 | } | |
6648 | } | |
ae58fa02 | 6649 | |
3baa501d | 6650 | f = make_typename_type (ctx, f, complain); |
f0bcd168 MM |
6651 | if (f == error_mark_node) |
6652 | return f; | |
adecb3f4 MM |
6653 | return cp_build_qualified_type_real (f, |
6654 | CP_TYPE_QUALS (f) | |
6655 | | CP_TYPE_QUALS (t), | |
6656 | complain); | |
5566b478 MS |
6657 | } |
6658 | ||
6659 | case INDIRECT_REF: | |
4393e105 MM |
6660 | { |
6661 | tree e = tsubst (TREE_OPERAND (t, 0), args, complain, | |
6662 | in_decl); | |
6663 | if (e == error_mark_node) | |
6664 | return error_mark_node; | |
6665 | return make_pointer_declarator (type, e); | |
6666 | } | |
6667 | ||
5566b478 | 6668 | case ADDR_EXPR: |
4393e105 MM |
6669 | { |
6670 | tree e = tsubst (TREE_OPERAND (t, 0), args, complain, | |
6671 | in_decl); | |
6672 | if (e == error_mark_node) | |
6673 | return error_mark_node; | |
6674 | return make_reference_declarator (type, e); | |
6675 | } | |
5566b478 MS |
6676 | |
6677 | case ARRAY_REF: | |
4393e105 MM |
6678 | { |
6679 | tree e1 = tsubst (TREE_OPERAND (t, 0), args, complain, | |
6680 | in_decl); | |
6fb2c05a JM |
6681 | tree e2 = tsubst_expr (TREE_OPERAND (t, 1), args, complain, |
6682 | in_decl); | |
4393e105 MM |
6683 | if (e1 == error_mark_node || e2 == error_mark_node) |
6684 | return error_mark_node; | |
6685 | ||
6686 | return build_parse_node (ARRAY_REF, e1, e2, tsubst_expr); | |
6687 | } | |
5566b478 MS |
6688 | |
6689 | case CALL_EXPR: | |
4393e105 MM |
6690 | { |
6691 | tree e1 = tsubst (TREE_OPERAND (t, 0), args, complain, | |
6692 | in_decl); | |
43f887f9 MM |
6693 | tree e2 = (tsubst_call_declarator_parms |
6694 | (CALL_DECLARATOR_PARMS (t), args, complain, in_decl)); | |
6695 | tree e3 = tsubst (CALL_DECLARATOR_EXCEPTION_SPEC (t), args, | |
6696 | complain, in_decl); | |
4393e105 MM |
6697 | |
6698 | if (e1 == error_mark_node || e2 == error_mark_node | |
6699 | || e3 == error_mark_node) | |
6700 | return error_mark_node; | |
6701 | ||
43f887f9 | 6702 | return make_call_declarator (e1, e2, CALL_DECLARATOR_QUALS (t), e3); |
4393e105 | 6703 | } |
5566b478 | 6704 | |
fc378698 | 6705 | case SCOPE_REF: |
4393e105 MM |
6706 | { |
6707 | tree e1 = tsubst (TREE_OPERAND (t, 0), args, complain, | |
6708 | in_decl); | |
6709 | tree e2 = tsubst (TREE_OPERAND (t, 1), args, complain, in_decl); | |
6710 | if (e1 == error_mark_node || e2 == error_mark_node) | |
6711 | return error_mark_node; | |
6712 | ||
6713 | return build_parse_node (TREE_CODE (t), e1, e2); | |
6714 | } | |
fc378698 | 6715 | |
b894fc05 | 6716 | case TYPEOF_TYPE: |
4393e105 MM |
6717 | { |
6718 | tree e1 = tsubst_expr (TYPE_FIELDS (t), args, complain, | |
6719 | in_decl); | |
6720 | if (e1 == error_mark_node) | |
6721 | return error_mark_node; | |
6722 | ||
6723 | return TREE_TYPE (e1); | |
6724 | } | |
b894fc05 | 6725 | |
f9817201 MM |
6726 | case FUNCTION_NAME: |
6727 | { | |
6728 | const char *name; | |
6729 | int len; | |
6730 | tree type; | |
6731 | tree str; | |
6732 | ||
6733 | /* This code should match declare_hidden_char_array in | |
6734 | c-common.c. */ | |
6735 | name = (*decl_printable_name) (current_function_decl, 2); | |
6736 | len = strlen (name) + 1; | |
6737 | type = build_array_type (char_type_node, | |
6738 | build_index_type (build_int_2 (len, 0))); | |
6739 | str = build_string (len, name); | |
6740 | TREE_TYPE (str) = type; | |
6741 | return str; | |
6742 | } | |
6743 | ||
8d08fdba | 6744 | default: |
5566b478 | 6745 | sorry ("use of `%s' in template", |
8d08fdba MS |
6746 | tree_code_name [(int) TREE_CODE (t)]); |
6747 | return error_mark_node; | |
6748 | } | |
6749 | } | |
6750 | ||
00d3396f JM |
6751 | /* Like tsubst, but deals with expressions. This function just replaces |
6752 | template parms; to finish processing the resultant expression, use | |
6753 | tsubst_expr. */ | |
6754 | ||
5566b478 | 6755 | tree |
4393e105 | 6756 | tsubst_copy (t, args, complain, in_decl) |
98c1c668 | 6757 | tree t, args; |
4393e105 | 6758 | int complain; |
5566b478 MS |
6759 | tree in_decl; |
6760 | { | |
6761 | enum tree_code code; | |
8452b1d3 | 6762 | tree r; |
8d08fdba | 6763 | |
5566b478 MS |
6764 | if (t == NULL_TREE || t == error_mark_node) |
6765 | return t; | |
6766 | ||
6767 | code = TREE_CODE (t); | |
b7484fbe | 6768 | |
5566b478 MS |
6769 | switch (code) |
6770 | { | |
6771 | case PARM_DECL: | |
a759e627 | 6772 | return do_identifier (DECL_NAME (t), 0, NULL_TREE); |
5566b478 MS |
6773 | |
6774 | case CONST_DECL: | |
ed44da02 MM |
6775 | { |
6776 | tree enum_type; | |
6777 | tree v; | |
6778 | ||
6779 | if (!DECL_CONTEXT (t)) | |
6780 | /* This is a global enumeration constant. */ | |
6781 | return t; | |
6782 | ||
6783 | /* Unfortunately, we cannot just call lookup_name here. | |
9188c363 MM |
6784 | Consider: |
6785 | ||
6786 | template <int I> int f() { | |
6787 | enum E { a = I }; | |
6788 | struct S { void g() { E e = a; } }; | |
6789 | }; | |
6790 | ||
6791 | When we instantiate f<7>::S::g(), say, lookup_name is not | |
6792 | clever enough to find f<7>::a. */ | |
ed44da02 | 6793 | enum_type |
4393e105 | 6794 | = tsubst_aggr_type (TREE_TYPE (t), args, complain, in_decl, |
ed44da02 MM |
6795 | /*entering_scope=*/0); |
6796 | ||
6797 | for (v = TYPE_VALUES (enum_type); | |
6798 | v != NULL_TREE; | |
6799 | v = TREE_CHAIN (v)) | |
6800 | if (TREE_PURPOSE (v) == DECL_NAME (t)) | |
6801 | return TREE_VALUE (v); | |
6802 | ||
6803 | /* We didn't find the name. That should never happen; if | |
6804 | name-lookup found it during preliminary parsing, we | |
6805 | should find it again here during instantiation. */ | |
6806 | my_friendly_abort (0); | |
6807 | } | |
db04386f | 6808 | return t; |
ed44da02 | 6809 | |
5566b478 MS |
6810 | case FIELD_DECL: |
6811 | if (DECL_CONTEXT (t)) | |
6812 | { | |
0978790f | 6813 | tree ctx; |
0978790f | 6814 | |
4393e105 | 6815 | ctx = tsubst_aggr_type (DECL_CONTEXT (t), args, complain, in_decl, |
36a117a5 | 6816 | /*entering_scope=*/1); |
0978790f | 6817 | if (ctx != DECL_CONTEXT (t)) |
5566b478 MS |
6818 | return lookup_field (ctx, DECL_NAME (t), 0, 0); |
6819 | } | |
6820 | return t; | |
6821 | ||
6822 | case VAR_DECL: | |
6823 | case FUNCTION_DECL: | |
6824 | if (DECL_LANG_SPECIFIC (t) && DECL_TEMPLATE_INFO (t)) | |
4393e105 | 6825 | t = tsubst (t, args, complain, in_decl); |
5566b478 MS |
6826 | mark_used (t); |
6827 | return t; | |
6828 | ||
98c1c668 JM |
6829 | case TEMPLATE_DECL: |
6830 | if (is_member_template (t)) | |
4393e105 | 6831 | return tsubst (t, args, complain, in_decl); |
98c1c668 JM |
6832 | else |
6833 | return t; | |
6834 | ||
672476cb MM |
6835 | case LOOKUP_EXPR: |
6836 | { | |
6837 | /* We must tsbust into a LOOKUP_EXPR in case the names to | |
6838 | which it refers is a conversion operator; in that case the | |
6839 | name will change. We avoid making unnecessary copies, | |
6840 | however. */ | |
6841 | ||
4393e105 | 6842 | tree id = tsubst_copy (TREE_OPERAND (t, 0), args, complain, in_decl); |
672476cb MM |
6843 | |
6844 | if (id != TREE_OPERAND (t, 0)) | |
6845 | { | |
8452b1d3 | 6846 | r = build_nt (LOOKUP_EXPR, id); |
672476cb MM |
6847 | LOOKUP_EXPR_GLOBAL (r) = LOOKUP_EXPR_GLOBAL (t); |
6848 | t = r; | |
6849 | } | |
6850 | ||
6851 | return t; | |
6852 | } | |
6853 | ||
5566b478 MS |
6854 | case CAST_EXPR: |
6855 | case REINTERPRET_CAST_EXPR: | |
e92cc029 MS |
6856 | case CONST_CAST_EXPR: |
6857 | case STATIC_CAST_EXPR: | |
6858 | case DYNAMIC_CAST_EXPR: | |
51924768 | 6859 | case NOP_EXPR: |
5566b478 | 6860 | return build1 |
4393e105 MM |
6861 | (code, tsubst (TREE_TYPE (t), args, complain, in_decl), |
6862 | tsubst_copy (TREE_OPERAND (t, 0), args, complain, in_decl)); | |
5566b478 MS |
6863 | |
6864 | case INDIRECT_REF: | |
6865 | case PREDECREMENT_EXPR: | |
6866 | case PREINCREMENT_EXPR: | |
6867 | case POSTDECREMENT_EXPR: | |
6868 | case POSTINCREMENT_EXPR: | |
6869 | case NEGATE_EXPR: | |
6870 | case TRUTH_NOT_EXPR: | |
b87692e5 | 6871 | case BIT_NOT_EXPR: |
5566b478 MS |
6872 | case ADDR_EXPR: |
6873 | case CONVERT_EXPR: /* Unary + */ | |
6874 | case SIZEOF_EXPR: | |
abff8e06 | 6875 | case ALIGNOF_EXPR: |
5566b478 | 6876 | case ARROW_EXPR: |
fc378698 | 6877 | case THROW_EXPR: |
5156628f | 6878 | case TYPEID_EXPR: |
f5733617 SS |
6879 | case REALPART_EXPR: |
6880 | case IMAGPART_EXPR: | |
5566b478 | 6881 | return build1 |
6a629cac | 6882 | (code, tsubst (TREE_TYPE (t), args, complain, in_decl), |
4393e105 | 6883 | tsubst_copy (TREE_OPERAND (t, 0), args, complain, in_decl)); |
5566b478 MS |
6884 | |
6885 | case PLUS_EXPR: | |
6886 | case MINUS_EXPR: | |
6887 | case MULT_EXPR: | |
6888 | case TRUNC_DIV_EXPR: | |
6889 | case CEIL_DIV_EXPR: | |
6890 | case FLOOR_DIV_EXPR: | |
6891 | case ROUND_DIV_EXPR: | |
6892 | case EXACT_DIV_EXPR: | |
6893 | case BIT_AND_EXPR: | |
6894 | case BIT_ANDTC_EXPR: | |
6895 | case BIT_IOR_EXPR: | |
6896 | case BIT_XOR_EXPR: | |
6897 | case TRUNC_MOD_EXPR: | |
6898 | case FLOOR_MOD_EXPR: | |
6899 | case TRUTH_ANDIF_EXPR: | |
6900 | case TRUTH_ORIF_EXPR: | |
6901 | case TRUTH_AND_EXPR: | |
6902 | case TRUTH_OR_EXPR: | |
6903 | case RSHIFT_EXPR: | |
6904 | case LSHIFT_EXPR: | |
6905 | case RROTATE_EXPR: | |
6906 | case LROTATE_EXPR: | |
6907 | case EQ_EXPR: | |
6908 | case NE_EXPR: | |
6909 | case MAX_EXPR: | |
6910 | case MIN_EXPR: | |
6911 | case LE_EXPR: | |
6912 | case GE_EXPR: | |
6913 | case LT_EXPR: | |
6914 | case GT_EXPR: | |
6915 | case COMPONENT_REF: | |
6916 | case ARRAY_REF: | |
6917 | case COMPOUND_EXPR: | |
6918 | case SCOPE_REF: | |
6919 | case DOTSTAR_EXPR: | |
6920 | case MEMBER_REF: | |
6921 | return build_nt | |
4393e105 MM |
6922 | (code, tsubst_copy (TREE_OPERAND (t, 0), args, complain, in_decl), |
6923 | tsubst_copy (TREE_OPERAND (t, 1), args, complain, in_decl)); | |
5566b478 MS |
6924 | |
6925 | case CALL_EXPR: | |
6926 | { | |
6927 | tree fn = TREE_OPERAND (t, 0); | |
f84b4be9 | 6928 | if (is_overloaded_fn (fn)) |
4393e105 | 6929 | fn = tsubst_copy (get_first_fn (fn), args, complain, in_decl); |
5566b478 | 6930 | else |
f84b4be9 | 6931 | /* Sometimes FN is a LOOKUP_EXPR. */ |
4393e105 | 6932 | fn = tsubst_copy (fn, args, complain, in_decl); |
5566b478 | 6933 | return build_nt |
4393e105 MM |
6934 | (code, fn, tsubst_copy (TREE_OPERAND (t, 1), args, complain, |
6935 | in_decl), | |
5566b478 MS |
6936 | NULL_TREE); |
6937 | } | |
6938 | ||
6939 | case METHOD_CALL_EXPR: | |
6940 | { | |
6941 | tree name = TREE_OPERAND (t, 0); | |
6942 | if (TREE_CODE (name) == BIT_NOT_EXPR) | |
6943 | { | |
4393e105 MM |
6944 | name = tsubst_copy (TREE_OPERAND (name, 0), args, |
6945 | complain, in_decl); | |
7bae46f4 | 6946 | name = build1 (BIT_NOT_EXPR, NULL_TREE, name); |
5566b478 MS |
6947 | } |
6948 | else if (TREE_CODE (name) == SCOPE_REF | |
6949 | && TREE_CODE (TREE_OPERAND (name, 1)) == BIT_NOT_EXPR) | |
6950 | { | |
4393e105 MM |
6951 | tree base = tsubst_copy (TREE_OPERAND (name, 0), args, |
6952 | complain, in_decl); | |
5566b478 | 6953 | name = TREE_OPERAND (name, 1); |
4393e105 MM |
6954 | name = tsubst_copy (TREE_OPERAND (name, 0), args, |
6955 | complain, in_decl); | |
11686454 | 6956 | name = build1 (BIT_NOT_EXPR, NULL_TREE, name); |
5566b478 MS |
6957 | name = build_nt (SCOPE_REF, base, name); |
6958 | } | |
6959 | else | |
4393e105 | 6960 | name = tsubst_copy (TREE_OPERAND (t, 0), args, complain, in_decl); |
5566b478 | 6961 | return build_nt |
4393e105 MM |
6962 | (code, name, tsubst_copy (TREE_OPERAND (t, 1), args, |
6963 | complain, in_decl), | |
6964 | tsubst_copy (TREE_OPERAND (t, 2), args, complain, in_decl), | |
5566b478 MS |
6965 | NULL_TREE); |
6966 | } | |
6967 | ||
558475f0 MM |
6968 | case STMT_EXPR: |
6969 | /* This processing should really occur in tsubst_expr, However, | |
6970 | tsubst_expr does not recurse into expressions, since it | |
6971 | assumes that there aren't any statements inside them. | |
6972 | Instead, it simply calls build_expr_from_tree. So, we need | |
6973 | to expand the STMT_EXPR here. */ | |
6974 | if (!processing_template_decl) | |
6975 | { | |
b5ac18ea | 6976 | tree stmt_expr = begin_stmt_expr (); |
447cfcb9 MM |
6977 | tsubst_expr (STMT_EXPR_STMT (t), args, |
6978 | complain, in_decl); | |
b5ac18ea | 6979 | return finish_stmt_expr (stmt_expr); |
558475f0 | 6980 | } |
9d9169de MM |
6981 | |
6982 | return t; | |
558475f0 | 6983 | |
5566b478 MS |
6984 | case COND_EXPR: |
6985 | case MODOP_EXPR: | |
40242ccf | 6986 | case PSEUDO_DTOR_EXPR: |
67da3287 | 6987 | { |
8452b1d3 | 6988 | r = build_nt |
4393e105 MM |
6989 | (code, tsubst_copy (TREE_OPERAND (t, 0), args, complain, in_decl), |
6990 | tsubst_copy (TREE_OPERAND (t, 1), args, complain, in_decl), | |
6991 | tsubst_copy (TREE_OPERAND (t, 2), args, complain, in_decl)); | |
67da3287 MM |
6992 | return r; |
6993 | } | |
5566b478 MS |
6994 | |
6995 | case NEW_EXPR: | |
6996 | { | |
8452b1d3 | 6997 | r = build_nt |
4393e105 MM |
6998 | (code, tsubst_copy (TREE_OPERAND (t, 0), args, complain, in_decl), |
6999 | tsubst_copy (TREE_OPERAND (t, 1), args, complain, in_decl), | |
7000 | tsubst_copy (TREE_OPERAND (t, 2), args, complain, in_decl)); | |
5566b478 MS |
7001 | NEW_EXPR_USE_GLOBAL (r) = NEW_EXPR_USE_GLOBAL (t); |
7002 | return r; | |
7003 | } | |
7004 | ||
7005 | case DELETE_EXPR: | |
7006 | { | |
8452b1d3 | 7007 | r = build_nt |
4393e105 MM |
7008 | (code, tsubst_copy (TREE_OPERAND (t, 0), args, complain, in_decl), |
7009 | tsubst_copy (TREE_OPERAND (t, 1), args, complain, in_decl)); | |
5566b478 MS |
7010 | DELETE_EXPR_USE_GLOBAL (r) = DELETE_EXPR_USE_GLOBAL (t); |
7011 | DELETE_EXPR_USE_VEC (r) = DELETE_EXPR_USE_VEC (t); | |
7012 | return r; | |
7013 | } | |
7014 | ||
386b8a85 JM |
7015 | case TEMPLATE_ID_EXPR: |
7016 | { | |
00d3396f | 7017 | /* Substituted template arguments */ |
4393e105 MM |
7018 | tree targs = tsubst_copy (TREE_OPERAND (t, 1), args, complain, |
7019 | in_decl); | |
856216bb MM |
7020 | |
7021 | if (targs && TREE_CODE (targs) == TREE_LIST) | |
7022 | { | |
7023 | tree chain; | |
7024 | for (chain = targs; chain; chain = TREE_CHAIN (chain)) | |
7025 | TREE_VALUE (chain) = maybe_fold_nontype_arg (TREE_VALUE (chain)); | |
7026 | } | |
7027 | else if (targs) | |
7028 | { | |
7029 | int i; | |
7030 | for (i = 0; i < TREE_VEC_LENGTH (targs); ++i) | |
7031 | TREE_VEC_ELT (targs, i) | |
7032 | = maybe_fold_nontype_arg (TREE_VEC_ELT (targs, i)); | |
7033 | } | |
00d3396f JM |
7034 | |
7035 | return lookup_template_function | |
4393e105 | 7036 | (tsubst_copy (TREE_OPERAND (t, 0), args, complain, in_decl), targs); |
386b8a85 JM |
7037 | } |
7038 | ||
5566b478 MS |
7039 | case TREE_LIST: |
7040 | { | |
7041 | tree purpose, value, chain; | |
7042 | ||
7043 | if (t == void_list_node) | |
7044 | return t; | |
7045 | ||
7046 | purpose = TREE_PURPOSE (t); | |
7047 | if (purpose) | |
4393e105 | 7048 | purpose = tsubst_copy (purpose, args, complain, in_decl); |
5566b478 MS |
7049 | value = TREE_VALUE (t); |
7050 | if (value) | |
4393e105 | 7051 | value = tsubst_copy (value, args, complain, in_decl); |
5566b478 MS |
7052 | chain = TREE_CHAIN (t); |
7053 | if (chain && chain != void_type_node) | |
4393e105 | 7054 | chain = tsubst_copy (chain, args, complain, in_decl); |
5566b478 MS |
7055 | if (purpose == TREE_PURPOSE (t) |
7056 | && value == TREE_VALUE (t) | |
7057 | && chain == TREE_CHAIN (t)) | |
7058 | return t; | |
7059 | return tree_cons (purpose, value, chain); | |
7060 | } | |
7061 | ||
7062 | case RECORD_TYPE: | |
7063 | case UNION_TYPE: | |
7064 | case ENUMERAL_TYPE: | |
7065 | case INTEGER_TYPE: | |
7066 | case TEMPLATE_TYPE_PARM: | |
73b0fce8 | 7067 | case TEMPLATE_TEMPLATE_PARM: |
f84b4be9 | 7068 | case TEMPLATE_PARM_INDEX: |
5566b478 MS |
7069 | case POINTER_TYPE: |
7070 | case REFERENCE_TYPE: | |
7071 | case OFFSET_TYPE: | |
7072 | case FUNCTION_TYPE: | |
7073 | case METHOD_TYPE: | |
7074 | case ARRAY_TYPE: | |
7075 | case TYPENAME_TYPE: | |
f84b4be9 | 7076 | case TYPE_DECL: |
4393e105 | 7077 | return tsubst (t, args, complain, in_decl); |
5566b478 | 7078 | |
e92cc029 | 7079 | case IDENTIFIER_NODE: |
421844e7 | 7080 | if (IDENTIFIER_TYPENAME_P (t)) |
1f6e1acc AS |
7081 | { |
7082 | tree new_type = tsubst (TREE_TYPE (t), args, complain, in_decl); | |
669ec2b4 JM |
7083 | if (flag_new_abi) |
7084 | return mangle_conv_op_name_for_type (new_type); | |
7085 | else | |
7086 | return (build_typename_overload (new_type)); | |
1f6e1acc | 7087 | } |
e92cc029 MS |
7088 | else |
7089 | return t; | |
7090 | ||
5156628f | 7091 | case CONSTRUCTOR: |
8452b1d3 JM |
7092 | { |
7093 | r = build | |
4393e105 MM |
7094 | (CONSTRUCTOR, tsubst (TREE_TYPE (t), args, complain, in_decl), |
7095 | NULL_TREE, tsubst_copy (CONSTRUCTOR_ELTS (t), args, | |
7096 | complain, in_decl)); | |
8452b1d3 JM |
7097 | TREE_HAS_CONSTRUCTOR (r) = TREE_HAS_CONSTRUCTOR (t); |
7098 | return r; | |
7099 | } | |
5156628f | 7100 | |
371534a9 MM |
7101 | case VA_ARG_EXPR: |
7102 | return build_va_arg (tsubst_copy (TREE_OPERAND (t, 0), args, complain, | |
7103 | in_decl), | |
7104 | tsubst (TREE_TYPE (t), args, complain, in_decl)); | |
f9817201 MM |
7105 | |
7106 | case FUNCTION_NAME: | |
7107 | return tsubst (t, args, complain, in_decl); | |
7108 | ||
5566b478 MS |
7109 | default: |
7110 | return t; | |
7111 | } | |
7112 | } | |
7113 | ||
558475f0 | 7114 | /* Like tsubst_copy, but also does semantic processing. */ |
00d3396f | 7115 | |
5566b478 | 7116 | tree |
4393e105 | 7117 | tsubst_expr (t, args, complain, in_decl) |
98c1c668 | 7118 | tree t, args; |
4393e105 | 7119 | int complain; |
5566b478 MS |
7120 | tree in_decl; |
7121 | { | |
558475f0 MM |
7122 | tree stmt; |
7123 | ||
5566b478 MS |
7124 | if (t == NULL_TREE || t == error_mark_node) |
7125 | return t; | |
7126 | ||
5156628f | 7127 | if (processing_template_decl) |
4393e105 | 7128 | return tsubst_copy (t, args, complain, in_decl); |
5566b478 MS |
7129 | |
7130 | switch (TREE_CODE (t)) | |
8d08fdba | 7131 | { |
558475f0 | 7132 | case RETURN_INIT: |
a7e4cfa0 | 7133 | prep_stmt (t); |
558475f0 MM |
7134 | finish_named_return_value |
7135 | (TREE_OPERAND (t, 0), | |
7136 | tsubst_expr (TREE_OPERAND (t, 1), args, /*complain=*/1, in_decl)); | |
7137 | tsubst_expr (TREE_CHAIN (t), args, complain, in_decl); | |
7138 | break; | |
7139 | ||
7140 | case CTOR_INITIALIZER: | |
fd74ca0b MM |
7141 | { |
7142 | tree member_init_list; | |
7143 | tree base_init_list; | |
7144 | ||
7145 | prep_stmt (t); | |
7146 | member_init_list | |
7147 | = tsubst_initializer_list (TREE_OPERAND (t, 0), args); | |
7148 | base_init_list | |
7149 | = tsubst_initializer_list (TREE_OPERAND (t, 1), args); | |
7150 | setup_vtbl_ptr (member_init_list, base_init_list); | |
7151 | tsubst_expr (TREE_CHAIN (t), args, complain, in_decl); | |
7152 | break; | |
7153 | } | |
558475f0 | 7154 | |
5566b478 | 7155 | case RETURN_STMT: |
a7e4cfa0 | 7156 | prep_stmt (t); |
ad321293 | 7157 | finish_return_stmt (tsubst_expr (RETURN_EXPR (t), |
4393e105 | 7158 | args, complain, in_decl)); |
5566b478 MS |
7159 | break; |
7160 | ||
7161 | case EXPR_STMT: | |
a7e4cfa0 | 7162 | prep_stmt (t); |
ad321293 | 7163 | finish_expr_stmt (tsubst_expr (EXPR_STMT_EXPR (t), |
4393e105 | 7164 | args, complain, in_decl)); |
5566b478 MS |
7165 | break; |
7166 | ||
7167 | case DECL_STMT: | |
7168 | { | |
e0942dcd MM |
7169 | tree decl; |
7170 | tree init; | |
5566b478 | 7171 | |
a7e4cfa0 | 7172 | prep_stmt (t); |
e0942dcd | 7173 | decl = DECL_STMT_DECL (t); |
acef433b MM |
7174 | if (TREE_CODE (decl) == LABEL_DECL) |
7175 | finish_label_decl (DECL_NAME (decl)); | |
7176 | else | |
7177 | { | |
7178 | init = DECL_INITIAL (decl); | |
7179 | decl = tsubst (decl, args, complain, in_decl); | |
7180 | init = tsubst_expr (init, args, complain, in_decl); | |
24bef158 MM |
7181 | if (init) |
7182 | DECL_INITIAL (decl) = error_mark_node; | |
b7b8bcd2 MM |
7183 | /* By marking the declaration as instantiated, we avoid |
7184 | trying to instantiate it. Since instantiate_decl can't | |
7185 | handle local variables, and since we've already done | |
7186 | all that needs to be done, that's the right thing to | |
7187 | do. */ | |
acef433b MM |
7188 | if (TREE_CODE (decl) == VAR_DECL) |
7189 | DECL_TEMPLATE_INSTANTIATED (decl) = 1; | |
7190 | maybe_push_decl (decl); | |
cd9f6678 | 7191 | cp_finish_decl (decl, init, NULL_TREE, 0); |
acef433b | 7192 | } |
e0942dcd | 7193 | return decl; |
5566b478 | 7194 | } |
8d08fdba | 7195 | |
5566b478 MS |
7196 | case FOR_STMT: |
7197 | { | |
7198 | tree tmp; | |
a7e4cfa0 | 7199 | prep_stmt (t); |
5566b478 | 7200 | |
558475f0 | 7201 | stmt = begin_for_stmt (); |
ad321293 | 7202 | for (tmp = FOR_INIT_STMT (t); tmp; tmp = TREE_CHAIN (tmp)) |
4393e105 | 7203 | tsubst_expr (tmp, args, complain, in_decl); |
558475f0 | 7204 | finish_for_init_stmt (stmt); |
ad321293 | 7205 | finish_for_cond (tsubst_expr (FOR_COND (t), args, |
4393e105 | 7206 | complain, in_decl), |
558475f0 | 7207 | stmt); |
4393e105 | 7208 | tmp = tsubst_expr (FOR_EXPR (t), args, complain, in_decl); |
558475f0 | 7209 | finish_for_expr (tmp, stmt); |
4393e105 | 7210 | tsubst_expr (FOR_BODY (t), args, complain, in_decl); |
35b1567d | 7211 | finish_for_stmt (stmt); |
5566b478 MS |
7212 | } |
7213 | break; | |
8d08fdba | 7214 | |
5566b478 MS |
7215 | case WHILE_STMT: |
7216 | { | |
a7e4cfa0 | 7217 | prep_stmt (t); |
558475f0 | 7218 | stmt = begin_while_stmt (); |
ad321293 | 7219 | finish_while_stmt_cond (tsubst_expr (WHILE_COND (t), |
4393e105 | 7220 | args, complain, in_decl), |
558475f0 | 7221 | stmt); |
4393e105 | 7222 | tsubst_expr (WHILE_BODY (t), args, complain, in_decl); |
558475f0 | 7223 | finish_while_stmt (stmt); |
5566b478 MS |
7224 | } |
7225 | break; | |
8d08fdba | 7226 | |
5566b478 MS |
7227 | case DO_STMT: |
7228 | { | |
a7e4cfa0 | 7229 | prep_stmt (t); |
558475f0 | 7230 | stmt = begin_do_stmt (); |
4393e105 | 7231 | tsubst_expr (DO_BODY (t), args, complain, in_decl); |
558475f0 | 7232 | finish_do_body (stmt); |
ad321293 | 7233 | finish_do_stmt (tsubst_expr (DO_COND (t), args, |
4393e105 | 7234 | complain, in_decl), |
558475f0 | 7235 | stmt); |
5566b478 MS |
7236 | } |
7237 | break; | |
a0a33927 | 7238 | |
5566b478 | 7239 | case IF_STMT: |
8d08fdba | 7240 | { |
5566b478 | 7241 | tree tmp; |
5566b478 | 7242 | |
a7e4cfa0 | 7243 | prep_stmt (t); |
558475f0 | 7244 | stmt = begin_if_stmt (); |
ad321293 | 7245 | finish_if_stmt_cond (tsubst_expr (IF_COND (t), |
4393e105 | 7246 | args, complain, in_decl), |
558475f0 | 7247 | stmt); |
db5ae43f | 7248 | |
ad321293 | 7249 | if (tmp = THEN_CLAUSE (t), tmp) |
db5ae43f | 7250 | { |
4393e105 | 7251 | tsubst_expr (tmp, args, complain, in_decl); |
558475f0 | 7252 | finish_then_clause (stmt); |
db5ae43f MS |
7253 | } |
7254 | ||
ad321293 MM |
7255 | if (tmp = ELSE_CLAUSE (t), tmp) |
7256 | { | |
7257 | begin_else_clause (); | |
4393e105 | 7258 | tsubst_expr (tmp, args, complain, in_decl); |
558475f0 | 7259 | finish_else_clause (stmt); |
ad321293 | 7260 | } |
8d08fdba | 7261 | |
ad321293 | 7262 | finish_if_stmt (); |
8d08fdba | 7263 | } |
5566b478 | 7264 | break; |
8d08fdba | 7265 | |
5566b478 MS |
7266 | case COMPOUND_STMT: |
7267 | { | |
ad321293 | 7268 | tree substmt; |
8d08fdba | 7269 | |
a7e4cfa0 | 7270 | prep_stmt (t); |
558475f0 | 7271 | stmt = begin_compound_stmt (COMPOUND_STMT_NO_SCOPE (t)); |
ad321293 MM |
7272 | for (substmt = COMPOUND_BODY (t); |
7273 | substmt != NULL_TREE; | |
7274 | substmt = TREE_CHAIN (substmt)) | |
4393e105 | 7275 | tsubst_expr (substmt, args, complain, in_decl); |
558475f0 | 7276 | return finish_compound_stmt (COMPOUND_STMT_NO_SCOPE (t), stmt); |
5566b478 MS |
7277 | } |
7278 | break; | |
8d08fdba | 7279 | |
5566b478 | 7280 | case BREAK_STMT: |
a7e4cfa0 | 7281 | prep_stmt (t); |
ad321293 | 7282 | finish_break_stmt (); |
5566b478 | 7283 | break; |
8d08fdba | 7284 | |
6467930b | 7285 | case CONTINUE_STMT: |
a7e4cfa0 | 7286 | prep_stmt (t); |
ad321293 | 7287 | finish_continue_stmt (); |
6467930b MS |
7288 | break; |
7289 | ||
5566b478 MS |
7290 | case SWITCH_STMT: |
7291 | { | |
558475f0 | 7292 | tree val; |
5566b478 | 7293 | |
a7e4cfa0 | 7294 | prep_stmt (t); |
527f0080 | 7295 | stmt = begin_switch_stmt (); |
4393e105 | 7296 | val = tsubst_expr (SWITCH_COND (t), args, complain, in_decl); |
527f0080 | 7297 | finish_switch_cond (val, stmt); |
558475f0 | 7298 | tsubst_expr (SWITCH_BODY (t), args, complain, in_decl); |
35b1567d | 7299 | finish_switch_stmt (stmt); |
5566b478 MS |
7300 | } |
7301 | break; | |
7302 | ||
7303 | case CASE_LABEL: | |
a7e4cfa0 | 7304 | prep_stmt (t); |
4393e105 MM |
7305 | finish_case_label (tsubst_expr (CASE_LOW (t), args, complain, in_decl), |
7306 | tsubst_expr (CASE_HIGH (t), args, complain, in_decl)); | |
5566b478 MS |
7307 | break; |
7308 | ||
acef433b MM |
7309 | case LABEL_STMT: |
7310 | lineno = STMT_LINENO (t); | |
7311 | finish_label_stmt (DECL_NAME (LABEL_STMT_LABEL (t))); | |
5566b478 MS |
7312 | break; |
7313 | ||
7314 | case GOTO_STMT: | |
a7e4cfa0 | 7315 | prep_stmt (t); |
aa09da44 | 7316 | t = GOTO_DESTINATION (t); |
3fa56191 | 7317 | if (TREE_CODE (t) != LABEL_DECL) |
aa09da44 MM |
7318 | /* Computed goto's must be tsubst'd into. On the other hand, |
7319 | non-computed gotos must not be; the identifier in question | |
7320 | will have no binding. */ | |
4393e105 | 7321 | t = tsubst_expr (t, args, complain, in_decl); |
3fa56191 MM |
7322 | else |
7323 | t = DECL_NAME (t); | |
aa09da44 | 7324 | finish_goto_stmt (t); |
ad321293 MM |
7325 | break; |
7326 | ||
7327 | case ASM_STMT: | |
a7e4cfa0 | 7328 | prep_stmt (t); |
3ebc5c52 | 7329 | finish_asm_stmt (ASM_CV_QUAL (t), |
4393e105 MM |
7330 | tsubst_expr (ASM_STRING (t), args, complain, in_decl), |
7331 | tsubst_expr (ASM_OUTPUTS (t), args, complain, in_decl), | |
7332 | tsubst_expr (ASM_INPUTS (t), args, complain, in_decl), | |
7333 | tsubst_expr (ASM_CLOBBERS (t), args, complain, | |
7334 | in_decl)); | |
5566b478 | 7335 | break; |
faf5394a MS |
7336 | |
7337 | case TRY_BLOCK: | |
a7e4cfa0 | 7338 | prep_stmt (t); |
f1dedc31 | 7339 | if (CLEANUP_P (t)) |
62409b39 | 7340 | { |
57b52417 | 7341 | stmt = begin_try_block (); |
62409b39 MM |
7342 | tsubst_expr (TRY_STMTS (t), args, complain, in_decl); |
7343 | finish_cleanup_try_block (stmt); | |
7344 | finish_cleanup (tsubst_expr (TRY_HANDLERS (t), args, | |
7345 | complain, in_decl), | |
7346 | stmt); | |
7347 | } | |
f1dedc31 MM |
7348 | else |
7349 | { | |
62409b39 MM |
7350 | tree handler; |
7351 | ||
7352 | if (FN_TRY_BLOCK_P (t)) | |
7353 | stmt = begin_function_try_block (); | |
7354 | else | |
7355 | stmt = begin_try_block (); | |
7356 | ||
7357 | tsubst_expr (TRY_STMTS (t), args, complain, in_decl); | |
7358 | ||
7359 | if (FN_TRY_BLOCK_P (t)) | |
7360 | finish_function_try_block (stmt); | |
7361 | else | |
7362 | finish_try_block (stmt); | |
7363 | ||
7364 | handler = TRY_HANDLERS (t); | |
f1dedc31 MM |
7365 | for (; handler; handler = TREE_CHAIN (handler)) |
7366 | tsubst_expr (handler, args, complain, in_decl); | |
84df082b MM |
7367 | if (FN_TRY_BLOCK_P (t)) |
7368 | finish_function_handler_sequence (stmt); | |
7369 | else | |
7370 | finish_handler_sequence (stmt); | |
f1dedc31 | 7371 | } |
faf5394a | 7372 | break; |
b35d4555 | 7373 | |
faf5394a | 7374 | case HANDLER: |
b35d4555 MM |
7375 | { |
7376 | tree decl; | |
7377 | tree blocks; | |
7378 | ||
7379 | prep_stmt (t); | |
7380 | stmt = begin_handler (); | |
7381 | if (HANDLER_PARMS (t)) | |
7382 | { | |
7383 | decl = DECL_STMT_DECL (HANDLER_PARMS (t)); | |
7384 | decl = tsubst (decl, args, complain, in_decl); | |
f8191e64 MM |
7385 | /* Prevent instantiate_decl from trying to instantiate |
7386 | this variable. We've already done all that needs to be | |
7387 | done. */ | |
7388 | DECL_TEMPLATE_INSTANTIATED (decl) = 1; | |
b35d4555 MM |
7389 | } |
7390 | else | |
7391 | decl = NULL_TREE; | |
7392 | blocks = finish_handler_parms (decl, stmt); | |
7393 | tsubst_expr (HANDLER_BODY (t), args, complain, in_decl); | |
7394 | finish_handler (blocks, stmt); | |
7395 | } | |
faf5394a MS |
7396 | break; |
7397 | ||
b87692e5 | 7398 | case TAG_DEFN: |
a7e4cfa0 | 7399 | prep_stmt (t); |
b87692e5 | 7400 | t = TREE_TYPE (t); |
ae673f14 | 7401 | tsubst (t, args, complain, NULL_TREE); |
b87692e5 MS |
7402 | break; |
7403 | ||
5566b478 | 7404 | default: |
4393e105 | 7405 | return build_expr_from_tree (tsubst_copy (t, args, complain, in_decl)); |
5566b478 MS |
7406 | } |
7407 | return NULL_TREE; | |
8d08fdba MS |
7408 | } |
7409 | ||
db9b2174 MM |
7410 | /* TMPL is a TEMPLATE_DECL for a cloned constructor or destructor. |
7411 | Instantiate it with the ARGS. */ | |
7412 | ||
7413 | static tree | |
7414 | instantiate_clone (tmpl, args) | |
7415 | tree tmpl; | |
7416 | tree args; | |
7417 | { | |
7418 | tree spec; | |
7419 | tree clone; | |
7420 | ||
7421 | /* Instantiated the cloned function, rather than the clone. */ | |
7422 | spec = instantiate_template (DECL_CLONED_FUNCTION (tmpl), args); | |
7423 | ||
7424 | /* Then, see if we've already cloned the instantiation. */ | |
7425 | for (clone = TREE_CHAIN (spec); | |
7426 | clone && DECL_CLONED_FUNCTION_P (clone); | |
7427 | clone = TREE_CHAIN (clone)) | |
7428 | if (DECL_NAME (clone) == DECL_NAME (tmpl)) | |
7429 | return clone; | |
7430 | ||
7431 | /* If we haven't, do so know. */ | |
7432 | if (!clone) | |
7433 | clone_function_decl (spec, /*update_method_vec_p=*/0); | |
7434 | ||
7435 | /* Look again. */ | |
7436 | for (clone = TREE_CHAIN (spec); | |
7437 | clone && DECL_CLONED_FUNCTION_P (clone); | |
7438 | clone = TREE_CHAIN (clone)) | |
7439 | if (DECL_NAME (clone) == DECL_NAME (tmpl)) | |
7440 | return clone; | |
7441 | ||
7442 | /* We should always have found the clone by now. */ | |
7443 | my_friendly_abort (20000411); | |
7444 | return NULL_TREE; | |
7445 | } | |
7446 | ||
6ba89f8e | 7447 | /* Instantiate the indicated variable or function template TMPL with |
36a117a5 MM |
7448 | the template arguments in TARG_PTR. */ |
7449 | ||
5566b478 MS |
7450 | tree |
7451 | instantiate_template (tmpl, targ_ptr) | |
98c1c668 | 7452 | tree tmpl, targ_ptr; |
8d08fdba | 7453 | { |
5566b478 | 7454 | tree fndecl; |
36a117a5 MM |
7455 | tree gen_tmpl; |
7456 | tree spec; | |
5566b478 | 7457 | int i, len; |
36a117a5 | 7458 | tree inner_args; |
5566b478 | 7459 | |
27fafc8d JM |
7460 | if (tmpl == error_mark_node) |
7461 | return error_mark_node; | |
7462 | ||
386b8a85 JM |
7463 | my_friendly_assert (TREE_CODE (tmpl) == TEMPLATE_DECL, 283); |
7464 | ||
db9b2174 MM |
7465 | /* If this function is a clone, handle it specially. */ |
7466 | if (DECL_CLONED_FUNCTION_P (tmpl)) | |
7467 | return instantiate_clone (tmpl, targ_ptr); | |
7468 | ||
36a117a5 MM |
7469 | /* Check to see if we already have this specialization. */ |
7470 | spec = retrieve_specialization (tmpl, targ_ptr); | |
7471 | if (spec != NULL_TREE) | |
7472 | return spec; | |
7473 | ||
f9a7ae04 MM |
7474 | gen_tmpl = most_general_template (tmpl); |
7475 | if (tmpl != gen_tmpl) | |
386b8a85 | 7476 | { |
36a117a5 MM |
7477 | /* The TMPL is a partial instantiation. To get a full set of |
7478 | arguments we must add the arguments used to perform the | |
7479 | partial instantiation. */ | |
7480 | targ_ptr = add_outermost_template_args (DECL_TI_ARGS (tmpl), | |
7481 | targ_ptr); | |
36a117a5 MM |
7482 | |
7483 | /* Check to see if we already have this specialization. */ | |
7484 | spec = retrieve_specialization (gen_tmpl, targ_ptr); | |
75650646 MM |
7485 | if (spec != NULL_TREE) |
7486 | return spec; | |
386b8a85 JM |
7487 | } |
7488 | ||
36a117a5 | 7489 | len = DECL_NTPARMS (gen_tmpl); |
f9a7ae04 | 7490 | inner_args = INNERMOST_TEMPLATE_ARGS (targ_ptr); |
5566b478 MS |
7491 | i = len; |
7492 | while (i--) | |
8d08fdba | 7493 | { |
36a117a5 | 7494 | tree t = TREE_VEC_ELT (inner_args, i); |
2f939d94 | 7495 | if (TYPE_P (t)) |
5566b478 MS |
7496 | { |
7497 | tree nt = target_type (t); | |
ec255269 | 7498 | if (IS_AGGR_TYPE (nt) && decl_function_context (TYPE_MAIN_DECL (nt))) |
5566b478 | 7499 | { |
8251199e JM |
7500 | cp_error ("type `%T' composed from a local class is not a valid template-argument", t); |
7501 | cp_error (" trying to instantiate `%D'", gen_tmpl); | |
454fa7a7 | 7502 | return error_mark_node; |
5566b478 MS |
7503 | } |
7504 | } | |
8d08fdba MS |
7505 | } |
7506 | ||
5566b478 | 7507 | /* substitute template parameters */ |
17aec3eb RK |
7508 | fndecl = tsubst (DECL_TEMPLATE_RESULT (gen_tmpl), |
7509 | targ_ptr, /*complain=*/1, gen_tmpl); | |
36a117a5 MM |
7510 | /* The DECL_TI_TEMPLATE should always be the immediate parent |
7511 | template, not the most general template. */ | |
7512 | DECL_TI_TEMPLATE (fndecl) = tmpl; | |
8d08fdba | 7513 | |
824b9a4c MS |
7514 | if (flag_external_templates) |
7515 | add_pending_template (fndecl); | |
7516 | ||
5566b478 | 7517 | return fndecl; |
8d08fdba | 7518 | } |
5566b478 MS |
7519 | |
7520 | /* Push the name of the class template into the scope of the instantiation. */ | |
8d08fdba MS |
7521 | |
7522 | void | |
5566b478 MS |
7523 | overload_template_name (type) |
7524 | tree type; | |
8d08fdba | 7525 | { |
5566b478 MS |
7526 | tree id = DECL_NAME (CLASSTYPE_TI_TEMPLATE (type)); |
7527 | tree decl; | |
8d08fdba | 7528 | |
5566b478 MS |
7529 | if (IDENTIFIER_CLASS_VALUE (id) |
7530 | && TREE_TYPE (IDENTIFIER_CLASS_VALUE (id)) == type) | |
7531 | return; | |
8d08fdba | 7532 | |
5566b478 MS |
7533 | decl = build_decl (TYPE_DECL, id, type); |
7534 | SET_DECL_ARTIFICIAL (decl); | |
7535 | pushdecl_class_level (decl); | |
8d08fdba MS |
7536 | } |
7537 | ||
4393e105 MM |
7538 | /* The FN is a TEMPLATE_DECL for a function. The ARGS are the |
7539 | arguments that are being used when calling it. TARGS is a vector | |
7540 | into which the deduced template arguments are placed. | |
8d08fdba MS |
7541 | |
7542 | Return zero for success, 2 for an incomplete match that doesn't resolve | |
7543 | all the types, and 1 for complete failure. An error message will be | |
7544 | printed only for an incomplete match. | |
7545 | ||
4393e105 MM |
7546 | If FN is a conversion operator, RETURN_TYPE is the type desired as |
7547 | the result of the conversion operator. | |
8d08fdba | 7548 | |
4393e105 | 7549 | TPARMS is a vector of template parameters. |
9f54c803 MM |
7550 | |
7551 | The EXPLICIT_TARGS are explicit template arguments provided via a | |
7552 | template-id. | |
6467930b | 7553 | |
830bfa74 MM |
7554 | The parameter STRICT is one of: |
7555 | ||
7556 | DEDUCE_CALL: | |
7557 | We are deducing arguments for a function call, as in | |
7558 | [temp.deduct.call]. | |
7559 | ||
7560 | DEDUCE_CONV: | |
7561 | We are deducing arguments for a conversion function, as in | |
7562 | [temp.deduct.conv]. | |
7563 | ||
7564 | DEDUCE_EXACT: | |
7565 | We are deducing arguments when calculating the partial | |
7566 | ordering between specializations of function or class | |
7567 | templates, as in [temp.func.order] and [temp.class.order], | |
7568 | when doing an explicit instantiation as in [temp.explicit], | |
9f54c803 | 7569 | when determining an explicit specialization as in |
830bfa74 | 7570 | [temp.expl.spec], or when taking the address of a function |
4393e105 MM |
7571 | template, as in [temp.deduct.funcaddr]. |
7572 | ||
4393e105 | 7573 | The other arguments are as for type_unification. */ |
8d08fdba MS |
7574 | |
7575 | int | |
4393e105 | 7576 | fn_type_unification (fn, explicit_targs, targs, args, return_type, |
03017874 | 7577 | strict) |
4393e105 | 7578 | tree fn, explicit_targs, targs, args, return_type; |
830bfa74 | 7579 | unification_kind_t strict; |
386b8a85 | 7580 | { |
4393e105 MM |
7581 | tree parms; |
7582 | tree fntype; | |
adecb3f4 | 7583 | int result; |
386b8a85 | 7584 | |
4393e105 MM |
7585 | my_friendly_assert (TREE_CODE (fn) == TEMPLATE_DECL, 0); |
7586 | ||
7587 | fntype = TREE_TYPE (fn); | |
7588 | if (explicit_targs) | |
75650646 | 7589 | { |
4393e105 MM |
7590 | /* [temp.deduct] |
7591 | ||
7592 | The specified template arguments must match the template | |
7593 | parameters in kind (i.e., type, nontype, template), and there | |
7594 | must not be more arguments than there are parameters; | |
7595 | otherwise type deduction fails. | |
7596 | ||
7597 | Nontype arguments must match the types of the corresponding | |
7598 | nontype template parameters, or must be convertible to the | |
7599 | types of the corresponding nontype parameters as specified in | |
7600 | _temp.arg.nontype_, otherwise type deduction fails. | |
7601 | ||
7602 | All references in the function type of the function template | |
7603 | to the corresponding template parameters are replaced by the | |
7604 | specified template argument values. If a substitution in a | |
7605 | template parameter or in the function type of the function | |
7606 | template results in an invalid type, type deduction fails. */ | |
7607 | int i; | |
7608 | tree converted_args; | |
75650646 | 7609 | |
4393e105 MM |
7610 | converted_args |
7611 | = (coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (fn), | |
7612 | explicit_targs, NULL_TREE, /*complain=*/0, | |
7613 | /*require_all_arguments=*/0)); | |
7614 | if (converted_args == error_mark_node) | |
75650646 | 7615 | return 1; |
386b8a85 | 7616 | |
4393e105 MM |
7617 | fntype = tsubst (fntype, converted_args, /*complain=*/0, NULL_TREE); |
7618 | if (fntype == error_mark_node) | |
7619 | return 1; | |
050367a3 | 7620 | |
4393e105 MM |
7621 | /* Place the explicitly specified arguments in TARGS. */ |
7622 | for (i = 0; i < TREE_VEC_LENGTH (targs); i++) | |
7623 | TREE_VEC_ELT (targs, i) = TREE_VEC_ELT (converted_args, i); | |
75650646 | 7624 | } |
4393e105 MM |
7625 | |
7626 | parms = TYPE_ARG_TYPES (fntype); | |
386b8a85 | 7627 | |
4393e105 MM |
7628 | if (DECL_CONV_FN_P (fn)) |
7629 | { | |
8d3631f8 | 7630 | /* This is a template conversion operator. Remove `this', since |
edef8288 | 7631 | we could be comparing conversions from different classes. */ |
8d3631f8 NS |
7632 | parms = TREE_CHAIN (parms); |
7633 | args = TREE_CHAIN (args); | |
7634 | my_friendly_assert (return_type != NULL_TREE, 20000227); | |
7635 | } | |
7636 | ||
7637 | if (return_type) | |
7638 | { | |
7639 | /* We've been given a return type to match, prepend it. */ | |
7640 | parms = tree_cons (NULL_TREE, TREE_TYPE (fntype), parms); | |
7641 | args = tree_cons (NULL_TREE, return_type, args); | |
4393e105 MM |
7642 | } |
7643 | ||
4393e105 MM |
7644 | /* We allow incomplete unification without an error message here |
7645 | because the standard doesn't seem to explicitly prohibit it. Our | |
7646 | callers must be ready to deal with unification failures in any | |
7647 | event. */ | |
adecb3f4 MM |
7648 | result = type_unification_real (DECL_INNERMOST_TEMPLATE_PARMS (fn), |
7649 | targs, parms, args, /*subr=*/0, | |
7650 | strict, /*allow_incomplete*/1); | |
7651 | ||
7652 | if (result == 0) | |
7653 | /* All is well so far. Now, check: | |
7654 | ||
7655 | [temp.deduct] | |
7656 | ||
7657 | When all template arguments have been deduced, all uses of | |
7658 | template parameters in nondeduced contexts are replaced with | |
7659 | the corresponding deduced argument values. If the | |
7660 | substitution results in an invalid type, as described above, | |
7661 | type deduction fails. */ | |
7662 | if (tsubst (TREE_TYPE (fn), targs, /*complain=*/0, NULL_TREE) | |
7663 | == error_mark_node) | |
7664 | return 1; | |
7665 | ||
7666 | return result; | |
830bfa74 MM |
7667 | } |
7668 | ||
7669 | /* Adjust types before performing type deduction, as described in | |
7670 | [temp.deduct.call] and [temp.deduct.conv]. The rules in these two | |
4c7d0dff MM |
7671 | sections are symmetric. PARM is the type of a function parameter |
7672 | or the return type of the conversion function. ARG is the type of | |
7673 | the argument passed to the call, or the type of the value | |
7674 | intialized with the result of the conversion function. */ | |
386b8a85 | 7675 | |
e9659ab0 | 7676 | static void |
830bfa74 MM |
7677 | maybe_adjust_types_for_deduction (strict, parm, arg) |
7678 | unification_kind_t strict; | |
7679 | tree* parm; | |
7680 | tree* arg; | |
7681 | { | |
7682 | switch (strict) | |
7683 | { | |
7684 | case DEDUCE_CALL: | |
7685 | break; | |
7686 | ||
7687 | case DEDUCE_CONV: | |
7688 | { | |
4c7d0dff MM |
7689 | /* Swap PARM and ARG throughout the remainder of this |
7690 | function; the handling is precisely symmetric since PARM | |
7691 | will initialize ARG rather than vice versa. */ | |
830bfa74 MM |
7692 | tree* temp = parm; |
7693 | parm = arg; | |
7694 | arg = temp; | |
7695 | break; | |
7696 | } | |
7697 | ||
7698 | case DEDUCE_EXACT: | |
7699 | /* There is nothing to do in this case. */ | |
7700 | return; | |
7701 | ||
7702 | default: | |
7703 | my_friendly_abort (0); | |
7704 | } | |
7705 | ||
7706 | if (TREE_CODE (*parm) != REFERENCE_TYPE) | |
7707 | { | |
7708 | /* [temp.deduct.call] | |
7709 | ||
7710 | If P is not a reference type: | |
7711 | ||
7712 | --If A is an array type, the pointer type produced by the | |
7713 | array-to-pointer standard conversion (_conv.array_) is | |
7714 | used in place of A for type deduction; otherwise, | |
7715 | ||
7716 | --If A is a function type, the pointer type produced by | |
7717 | the function-to-pointer standard conversion | |
7718 | (_conv.func_) is used in place of A for type deduction; | |
7719 | otherwise, | |
7720 | ||
7721 | --If A is a cv-qualified type, the top level | |
7722 | cv-qualifiers of A's type are ignored for type | |
7723 | deduction. */ | |
7724 | if (TREE_CODE (*arg) == ARRAY_TYPE) | |
7725 | *arg = build_pointer_type (TREE_TYPE (*arg)); | |
d8f8dca1 | 7726 | else if (TREE_CODE (*arg) == FUNCTION_TYPE) |
830bfa74 MM |
7727 | *arg = build_pointer_type (*arg); |
7728 | else | |
7729 | *arg = TYPE_MAIN_VARIANT (*arg); | |
7730 | } | |
7731 | ||
7732 | /* [temp.deduct.call] | |
7733 | ||
7734 | If P is a cv-qualified type, the top level cv-qualifiers | |
7735 | of P's type are ignored for type deduction. If P is a | |
7736 | reference type, the type referred to by P is used for | |
7737 | type deduction. */ | |
7738 | *parm = TYPE_MAIN_VARIANT (*parm); | |
7739 | if (TREE_CODE (*parm) == REFERENCE_TYPE) | |
7740 | *parm = TREE_TYPE (*parm); | |
386b8a85 JM |
7741 | } |
7742 | ||
4393e105 | 7743 | /* Like type_unfication. |
9f54c803 MM |
7744 | |
7745 | If SUBR is 1, we're being called recursively (to unify the | |
7746 | arguments of a function or method parameter of a function | |
7747 | template). */ | |
386b8a85 | 7748 | |
4966381a | 7749 | static int |
3b3ba9f0 | 7750 | type_unification_real (tparms, targs, parms, args, subr, |
4393e105 | 7751 | strict, allow_incomplete) |
050367a3 | 7752 | tree tparms, targs, parms, args; |
830bfa74 MM |
7753 | int subr; |
7754 | unification_kind_t strict; | |
7755 | int allow_incomplete; | |
8d08fdba MS |
7756 | { |
7757 | tree parm, arg; | |
7758 | int i; | |
7759 | int ntparms = TREE_VEC_LENGTH (tparms); | |
830bfa74 | 7760 | int sub_strict; |
8d08fdba MS |
7761 | |
7762 | my_friendly_assert (TREE_CODE (tparms) == TREE_VEC, 289); | |
386b8a85 JM |
7763 | my_friendly_assert (parms == NULL_TREE |
7764 | || TREE_CODE (parms) == TREE_LIST, 290); | |
51c184be | 7765 | /* ARGS could be NULL (via a call from parse.y to |
8d08fdba MS |
7766 | build_x_function_call). */ |
7767 | if (args) | |
7768 | my_friendly_assert (TREE_CODE (args) == TREE_LIST, 291); | |
7769 | my_friendly_assert (ntparms > 0, 292); | |
7770 | ||
830bfa74 MM |
7771 | switch (strict) |
7772 | { | |
7773 | case DEDUCE_CALL: | |
7774 | sub_strict = UNIFY_ALLOW_MORE_CV_QUAL | UNIFY_ALLOW_DERIVED; | |
7775 | break; | |
7776 | ||
7777 | case DEDUCE_CONV: | |
7778 | sub_strict = UNIFY_ALLOW_LESS_CV_QUAL; | |
7779 | break; | |
7780 | ||
7781 | case DEDUCE_EXACT: | |
7782 | sub_strict = UNIFY_ALLOW_NONE; | |
7783 | break; | |
7784 | ||
7785 | default: | |
7786 | my_friendly_abort (0); | |
7787 | } | |
7788 | ||
8d08fdba MS |
7789 | while (parms |
7790 | && parms != void_list_node | |
7791 | && args | |
7792 | && args != void_list_node) | |
7793 | { | |
7794 | parm = TREE_VALUE (parms); | |
7795 | parms = TREE_CHAIN (parms); | |
7796 | arg = TREE_VALUE (args); | |
7797 | args = TREE_CHAIN (args); | |
7798 | ||
7799 | if (arg == error_mark_node) | |
7800 | return 1; | |
7801 | if (arg == unknown_type_node) | |
34016c81 JM |
7802 | /* We can't deduce anything from this, but we might get all the |
7803 | template args from other function args. */ | |
7804 | continue; | |
b7484fbe | 7805 | |
03e70705 JM |
7806 | /* Conversions will be performed on a function argument that |
7807 | corresponds with a function parameter that contains only | |
7808 | non-deducible template parameters and explicitly specified | |
7809 | template parameters. */ | |
7810 | if (! uses_template_parms (parm)) | |
b7484fbe | 7811 | { |
03e70705 JM |
7812 | tree type; |
7813 | ||
2f939d94 | 7814 | if (!TYPE_P (arg)) |
03e70705 JM |
7815 | type = TREE_TYPE (arg); |
7816 | else | |
7817 | { | |
7818 | type = arg; | |
7819 | arg = NULL_TREE; | |
7820 | } | |
7821 | ||
830bfa74 | 7822 | if (strict == DEDUCE_EXACT) |
03e70705 | 7823 | { |
3bfdc719 | 7824 | if (same_type_p (parm, type)) |
03e70705 JM |
7825 | continue; |
7826 | } | |
03e70705 | 7827 | else |
343c89cd JM |
7828 | /* It might work; we shouldn't check now, because we might |
7829 | get into infinite recursion. Overload resolution will | |
7830 | handle it. */ | |
7831 | continue; | |
03e70705 | 7832 | |
b7484fbe MS |
7833 | return 1; |
7834 | } | |
7835 | ||
2f939d94 | 7836 | if (!TYPE_P (arg)) |
8d08fdba MS |
7837 | { |
7838 | my_friendly_assert (TREE_TYPE (arg) != NULL_TREE, 293); | |
34016c81 | 7839 | if (type_unknown_p (arg)) |
28cbf42c | 7840 | { |
34016c81 JM |
7841 | /* [temp.deduct.type] A template-argument can be deduced from |
7842 | a pointer to function or pointer to member function | |
7843 | argument if the set of overloaded functions does not | |
7844 | contain function templates and at most one of a set of | |
7845 | overloaded functions provides a unique match. */ | |
7846 | ||
7847 | if (resolve_overloaded_unification | |
4393e105 | 7848 | (tparms, targs, parm, arg, strict, sub_strict) |
34016c81 JM |
7849 | != 0) |
7850 | return 1; | |
7851 | continue; | |
28cbf42c | 7852 | } |
8d08fdba MS |
7853 | arg = TREE_TYPE (arg); |
7854 | } | |
4393e105 | 7855 | |
830bfa74 MM |
7856 | if (!subr) |
7857 | maybe_adjust_types_for_deduction (strict, &parm, &arg); | |
db5ae43f | 7858 | |
4393e105 | 7859 | switch (unify (tparms, targs, parm, arg, sub_strict)) |
8d08fdba MS |
7860 | { |
7861 | case 0: | |
7862 | break; | |
7863 | case 1: | |
7864 | return 1; | |
7865 | } | |
7866 | } | |
7867 | /* Fail if we've reached the end of the parm list, and more args | |
7868 | are present, and the parm list isn't variadic. */ | |
7869 | if (args && args != void_list_node && parms == void_list_node) | |
7870 | return 1; | |
7871 | /* Fail if parms are left and they don't have default values. */ | |
7872 | if (parms | |
7873 | && parms != void_list_node | |
7874 | && TREE_PURPOSE (parms) == NULL_TREE) | |
7875 | return 1; | |
7876 | if (!subr) | |
7877 | for (i = 0; i < ntparms; i++) | |
050367a3 | 7878 | if (TREE_VEC_ELT (targs, i) == NULL_TREE) |
8d08fdba | 7879 | { |
386b8a85 | 7880 | if (!allow_incomplete) |
8251199e | 7881 | error ("incomplete type unification"); |
8d08fdba MS |
7882 | return 2; |
7883 | } | |
7884 | return 0; | |
7885 | } | |
7886 | ||
34016c81 JM |
7887 | /* Subroutine of type_unification_real. Args are like the variables at the |
7888 | call site. ARG is an overloaded function (or template-id); we try | |
7889 | deducing template args from each of the overloads, and if only one | |
7890 | succeeds, we go with that. Modifies TARGS and returns 0 on success. */ | |
7891 | ||
7892 | static int | |
7893 | resolve_overloaded_unification (tparms, targs, parm, arg, strict, | |
4393e105 | 7894 | sub_strict) |
34016c81 JM |
7895 | tree tparms, targs, parm, arg; |
7896 | unification_kind_t strict; | |
7897 | int sub_strict; | |
34016c81 JM |
7898 | { |
7899 | tree tempargs = copy_node (targs); | |
7900 | int good = 0; | |
7901 | ||
7902 | if (TREE_CODE (arg) == ADDR_EXPR) | |
7903 | arg = TREE_OPERAND (arg, 0); | |
9f3d9e46 | 7904 | |
d8f8dca1 MM |
7905 | if (TREE_CODE (arg) == COMPONENT_REF) |
7906 | /* Handle `&x' where `x' is some static or non-static member | |
7907 | function name. */ | |
7908 | arg = TREE_OPERAND (arg, 1); | |
7909 | ||
05e0b2f4 JM |
7910 | if (TREE_CODE (arg) == OFFSET_REF) |
7911 | arg = TREE_OPERAND (arg, 1); | |
7912 | ||
9f3d9e46 JM |
7913 | /* Strip baselink information. */ |
7914 | while (TREE_CODE (arg) == TREE_LIST) | |
7915 | arg = TREE_VALUE (arg); | |
7916 | ||
34016c81 JM |
7917 | if (TREE_CODE (arg) == TEMPLATE_ID_EXPR) |
7918 | { | |
7919 | /* If we got some explicit template args, we need to plug them into | |
7920 | the affected templates before we try to unify, in case the | |
7921 | explicit args will completely resolve the templates in question. */ | |
7922 | ||
7923 | tree expl_subargs = TREE_OPERAND (arg, 1); | |
7924 | arg = TREE_OPERAND (arg, 0); | |
7925 | ||
7926 | for (; arg; arg = OVL_NEXT (arg)) | |
7927 | { | |
7928 | tree fn = OVL_CURRENT (arg); | |
7929 | tree subargs, elem; | |
7930 | ||
7931 | if (TREE_CODE (fn) != TEMPLATE_DECL) | |
7932 | continue; | |
7933 | ||
17aec3eb RK |
7934 | subargs = get_bindings_overload (fn, DECL_TEMPLATE_RESULT (fn), |
7935 | expl_subargs); | |
34016c81 JM |
7936 | if (subargs) |
7937 | { | |
4393e105 MM |
7938 | elem = tsubst (TREE_TYPE (fn), subargs, /*complain=*/0, |
7939 | NULL_TREE); | |
d8f8dca1 MM |
7940 | if (TREE_CODE (elem) == METHOD_TYPE) |
7941 | elem = build_ptrmemfunc_type (build_pointer_type (elem)); | |
e97e5263 | 7942 | good += try_one_overload (tparms, targs, tempargs, parm, elem, |
4393e105 | 7943 | strict, sub_strict); |
34016c81 JM |
7944 | } |
7945 | } | |
7946 | } | |
7947 | else if (TREE_CODE (arg) == OVERLOAD) | |
7948 | { | |
7949 | for (; arg; arg = OVL_NEXT (arg)) | |
d8f8dca1 MM |
7950 | { |
7951 | tree type = TREE_TYPE (OVL_CURRENT (arg)); | |
7952 | if (TREE_CODE (type) == METHOD_TYPE) | |
7953 | type = build_ptrmemfunc_type (build_pointer_type (type)); | |
7954 | good += try_one_overload (tparms, targs, tempargs, parm, | |
7955 | type, | |
4393e105 | 7956 | strict, sub_strict); |
d8f8dca1 | 7957 | } |
34016c81 JM |
7958 | } |
7959 | else | |
7960 | my_friendly_abort (981006); | |
7961 | ||
7962 | /* [temp.deduct.type] A template-argument can be deduced from a pointer | |
7963 | to function or pointer to member function argument if the set of | |
7964 | overloaded functions does not contain function templates and at most | |
7965 | one of a set of overloaded functions provides a unique match. | |
7966 | ||
7967 | So if we found multiple possibilities, we return success but don't | |
7968 | deduce anything. */ | |
7969 | ||
7970 | if (good == 1) | |
7971 | { | |
7972 | int i = TREE_VEC_LENGTH (targs); | |
7973 | for (; i--; ) | |
7974 | if (TREE_VEC_ELT (tempargs, i)) | |
7975 | TREE_VEC_ELT (targs, i) = TREE_VEC_ELT (tempargs, i); | |
7976 | } | |
7977 | if (good) | |
7978 | return 0; | |
7979 | ||
7980 | return 1; | |
7981 | } | |
7982 | ||
7983 | /* Subroutine of resolve_overloaded_unification; does deduction for a single | |
7984 | overload. Fills TARGS with any deduced arguments, or error_mark_node if | |
7985 | different overloads deduce different arguments for a given parm. | |
7986 | Returns 1 on success. */ | |
7987 | ||
7988 | static int | |
e97e5263 | 7989 | try_one_overload (tparms, orig_targs, targs, parm, arg, strict, |
4393e105 | 7990 | sub_strict) |
e97e5263 | 7991 | tree tparms, orig_targs, targs, parm, arg; |
34016c81 JM |
7992 | unification_kind_t strict; |
7993 | int sub_strict; | |
34016c81 JM |
7994 | { |
7995 | int nargs; | |
7996 | tree tempargs; | |
7997 | int i; | |
7998 | ||
7999 | /* [temp.deduct.type] A template-argument can be deduced from a pointer | |
8000 | to function or pointer to member function argument if the set of | |
8001 | overloaded functions does not contain function templates and at most | |
8002 | one of a set of overloaded functions provides a unique match. | |
8003 | ||
8004 | So if this is a template, just return success. */ | |
8005 | ||
8006 | if (uses_template_parms (arg)) | |
8007 | return 1; | |
8008 | ||
8009 | maybe_adjust_types_for_deduction (strict, &parm, &arg); | |
8010 | ||
8011 | /* We don't copy orig_targs for this because if we have already deduced | |
8012 | some template args from previous args, unify would complain when we | |
8013 | try to deduce a template parameter for the same argument, even though | |
8014 | there isn't really a conflict. */ | |
8015 | nargs = TREE_VEC_LENGTH (targs); | |
f31c0a32 | 8016 | tempargs = make_tree_vec (nargs); |
34016c81 | 8017 | |
4393e105 | 8018 | if (unify (tparms, tempargs, parm, arg, sub_strict) != 0) |
34016c81 JM |
8019 | return 0; |
8020 | ||
8021 | /* First make sure we didn't deduce anything that conflicts with | |
e97e5263 | 8022 | explicitly specified args. */ |
34016c81 JM |
8023 | for (i = nargs; i--; ) |
8024 | { | |
8025 | tree elt = TREE_VEC_ELT (tempargs, i); | |
e97e5263 | 8026 | tree oldelt = TREE_VEC_ELT (orig_targs, i); |
34016c81 JM |
8027 | |
8028 | if (elt == NULL_TREE) | |
8029 | continue; | |
8030 | else if (uses_template_parms (elt)) | |
8031 | { | |
8032 | /* Since we're unifying against ourselves, we will fill in template | |
8033 | args used in the function parm list with our own template parms. | |
8034 | Discard them. */ | |
8035 | TREE_VEC_ELT (tempargs, i) = NULL_TREE; | |
8036 | continue; | |
8037 | } | |
8038 | else if (oldelt && ! template_args_equal (oldelt, elt)) | |
8039 | return 0; | |
8040 | } | |
8041 | ||
8042 | for (i = nargs; i--; ) | |
8043 | { | |
8044 | tree elt = TREE_VEC_ELT (tempargs, i); | |
8045 | ||
8046 | if (elt) | |
8047 | TREE_VEC_ELT (targs, i) = elt; | |
8048 | } | |
8049 | ||
8050 | return 1; | |
8051 | } | |
8052 | ||
4393e105 MM |
8053 | /* PARM is a template class (perhaps with unbound template |
8054 | parameters). ARG is a fully instantiated type. If ARG can be | |
8055 | bound to PARM, return ARG, otherwise return NULL_TREE. TPARMS and | |
8056 | TARGS are as for unify. */ | |
fcfb9f96 MM |
8057 | |
8058 | static tree | |
4393e105 | 8059 | try_class_unification (tparms, targs, parm, arg) |
fcfb9f96 MM |
8060 | tree tparms; |
8061 | tree targs; | |
4393e105 MM |
8062 | tree parm; |
8063 | tree arg; | |
8064 | { | |
8065 | int i; | |
8066 | tree copy_of_targs; | |
8067 | ||
8068 | if (!CLASSTYPE_TEMPLATE_INFO (arg) | |
8069 | || CLASSTYPE_TI_TEMPLATE (arg) != CLASSTYPE_TI_TEMPLATE (parm)) | |
8070 | return NULL_TREE; | |
8071 | ||
8072 | /* We need to make a new template argument vector for the call to | |
8073 | unify. If we used TARGS, we'd clutter it up with the result of | |
8074 | the attempted unification, even if this class didn't work out. | |
8075 | We also don't want to commit ourselves to all the unifications | |
8076 | we've already done, since unification is supposed to be done on | |
8077 | an argument-by-argument basis. In other words, consider the | |
8078 | following pathological case: | |
8079 | ||
8080 | template <int I, int J, int K> | |
8081 | struct S {}; | |
8082 | ||
8083 | template <int I, int J> | |
8084 | struct S<I, J, 2> : public S<I, I, I>, S<J, J, J> {}; | |
8085 | ||
8086 | template <int I, int J, int K> | |
8087 | void f(S<I, J, K>, S<I, I, I>); | |
8088 | ||
8089 | void g() { | |
8090 | S<0, 0, 0> s0; | |
8091 | S<0, 1, 2> s2; | |
8092 | ||
8093 | f(s0, s2); | |
8094 | } | |
8095 | ||
8096 | Now, by the time we consider the unification involving `s2', we | |
8097 | already know that we must have `f<0, 0, 0>'. But, even though | |
8098 | `S<0, 1, 2>' is derived from `S<0, 0, 0>', the code is not legal | |
8099 | because there are two ways to unify base classes of S<0, 1, 2> | |
8100 | with S<I, I, I>. If we kept the already deduced knowledge, we | |
8101 | would reject the possibility I=1. */ | |
f31c0a32 | 8102 | copy_of_targs = make_tree_vec (TREE_VEC_LENGTH (targs)); |
4393e105 MM |
8103 | i = unify (tparms, copy_of_targs, CLASSTYPE_TI_ARGS (parm), |
8104 | CLASSTYPE_TI_ARGS (arg), UNIFY_ALLOW_NONE); | |
4393e105 MM |
8105 | |
8106 | /* If unification failed, we're done. */ | |
8107 | if (i != 0) | |
8108 | return NULL_TREE; | |
8109 | else | |
8110 | return arg; | |
8111 | } | |
8112 | ||
8113 | /* Subroutine of get_template_base. RVAL, if non-NULL, is a base we | |
8114 | have alreay discovered to be satisfactory. ARG_BINFO is the binfo | |
8115 | for the base class of ARG that we are currently examining. */ | |
8116 | ||
8117 | static tree | |
8118 | get_template_base_recursive (tparms, targs, parm, | |
8119 | arg_binfo, rval, flags) | |
8120 | tree tparms; | |
8121 | tree targs; | |
8122 | tree arg_binfo; | |
fcfb9f96 | 8123 | tree rval; |
4393e105 MM |
8124 | tree parm; |
8125 | int flags; | |
fcfb9f96 MM |
8126 | { |
8127 | tree binfos; | |
8128 | int i, n_baselinks; | |
4393e105 | 8129 | tree arg = BINFO_TYPE (arg_binfo); |
fcfb9f96 | 8130 | |
4393e105 | 8131 | if (!(flags & GTB_IGNORE_TYPE)) |
fcfb9f96 | 8132 | { |
4393e105 MM |
8133 | tree r = try_class_unification (tparms, targs, |
8134 | parm, arg); | |
fcfb9f96 | 8135 | |
4393e105 | 8136 | /* If there is more than one satisfactory baseclass, then: |
fcfb9f96 | 8137 | |
4393e105 MM |
8138 | [temp.deduct.call] |
8139 | ||
8140 | If they yield more than one possible deduced A, the type | |
8141 | deduction fails. | |
8142 | ||
8143 | applies. */ | |
8144 | if (r && rval && !same_type_p (r, rval)) | |
8145 | return error_mark_node; | |
8146 | else if (r) | |
8147 | rval = r; | |
fcfb9f96 MM |
8148 | } |
8149 | ||
4393e105 | 8150 | binfos = BINFO_BASETYPES (arg_binfo); |
fcfb9f96 MM |
8151 | n_baselinks = binfos ? TREE_VEC_LENGTH (binfos) : 0; |
8152 | ||
8153 | /* Process base types. */ | |
8154 | for (i = 0; i < n_baselinks; i++) | |
8155 | { | |
8156 | tree base_binfo = TREE_VEC_ELT (binfos, i); | |
4393e105 | 8157 | int this_virtual; |
fcfb9f96 | 8158 | |
4393e105 MM |
8159 | /* Skip this base, if we've already seen it. */ |
8160 | if (BINFO_MARKED (base_binfo)) | |
8161 | continue; | |
8162 | ||
8163 | this_virtual = | |
8164 | (flags & GTB_VIA_VIRTUAL) || TREE_VIA_VIRTUAL (base_binfo); | |
8165 | ||
8166 | /* When searching for a non-virtual, we cannot mark virtually | |
8167 | found binfos. */ | |
8168 | if (! this_virtual) | |
8169 | SET_BINFO_MARKED (base_binfo); | |
8170 | ||
8171 | rval = get_template_base_recursive (tparms, targs, | |
8172 | parm, | |
8173 | base_binfo, | |
8174 | rval, | |
8175 | GTB_VIA_VIRTUAL * this_virtual); | |
8176 | ||
8177 | /* If we discovered more than one matching base class, we can | |
8178 | stop now. */ | |
8179 | if (rval == error_mark_node) | |
8180 | return error_mark_node; | |
fcfb9f96 MM |
8181 | } |
8182 | ||
8183 | return rval; | |
8184 | } | |
8185 | ||
4393e105 MM |
8186 | /* Given a template type PARM and a class type ARG, find the unique |
8187 | base type in ARG that is an instance of PARM. We do not examine | |
8188 | ARG itself; only its base-classes. If there is no appropriate base | |
8189 | class, return NULL_TREE. If there is more than one, return | |
8190 | error_mark_node. PARM may be the type of a partial specialization, | |
8191 | as well as a plain template type. Used by unify. */ | |
fcfb9f96 MM |
8192 | |
8193 | static tree | |
4393e105 | 8194 | get_template_base (tparms, targs, parm, arg) |
fcfb9f96 MM |
8195 | tree tparms; |
8196 | tree targs; | |
4393e105 MM |
8197 | tree parm; |
8198 | tree arg; | |
fcfb9f96 | 8199 | { |
4393e105 MM |
8200 | tree rval; |
8201 | tree arg_binfo; | |
fcfb9f96 | 8202 | |
4393e105 MM |
8203 | my_friendly_assert (IS_AGGR_TYPE_CODE (TREE_CODE (arg)), 92); |
8204 | ||
8205 | arg_binfo = TYPE_BINFO (complete_type (arg)); | |
8206 | rval = get_template_base_recursive (tparms, targs, | |
8207 | parm, arg_binfo, | |
8208 | NULL_TREE, | |
8209 | GTB_IGNORE_TYPE); | |
fcfb9f96 | 8210 | |
4393e105 MM |
8211 | /* Since get_template_base_recursive marks the bases classes, we |
8212 | must unmark them here. */ | |
d6479fe7 | 8213 | dfs_walk (arg_binfo, dfs_unmark, markedp, 0); |
fcfb9f96 MM |
8214 | |
8215 | return rval; | |
8216 | } | |
8217 | ||
db2767b6 MM |
8218 | /* Returns the level of DECL, which declares a template parameter. */ |
8219 | ||
e9659ab0 | 8220 | static int |
db2767b6 MM |
8221 | template_decl_level (decl) |
8222 | tree decl; | |
8223 | { | |
8224 | switch (TREE_CODE (decl)) | |
8225 | { | |
8226 | case TYPE_DECL: | |
8227 | case TEMPLATE_DECL: | |
8228 | return TEMPLATE_TYPE_LEVEL (TREE_TYPE (decl)); | |
8229 | ||
8230 | case PARM_DECL: | |
8231 | return TEMPLATE_PARM_LEVEL (DECL_INITIAL (decl)); | |
8232 | ||
8233 | default: | |
8234 | my_friendly_abort (0); | |
5ffe581d | 8235 | return 0; |
db2767b6 MM |
8236 | } |
8237 | } | |
8238 | ||
830bfa74 MM |
8239 | /* Decide whether ARG can be unified with PARM, considering only the |
8240 | cv-qualifiers of each type, given STRICT as documented for unify. | |
8241 | Returns non-zero iff the unification is OK on that basis.*/ | |
e92cc029 | 8242 | |
e9659ab0 | 8243 | static int |
830bfa74 MM |
8244 | check_cv_quals_for_unify (strict, arg, parm) |
8245 | int strict; | |
8246 | tree arg; | |
8247 | tree parm; | |
8248 | { | |
ef637255 MM |
8249 | if (!(strict & UNIFY_ALLOW_MORE_CV_QUAL) |
8250 | && !at_least_as_qualified_p (arg, parm)) | |
8251 | return 0; | |
8252 | ||
8253 | if (!(strict & UNIFY_ALLOW_LESS_CV_QUAL) | |
8254 | && !at_least_as_qualified_p (parm, arg)) | |
8255 | return 0; | |
8256 | ||
ef637255 | 8257 | return 1; |
830bfa74 MM |
8258 | } |
8259 | ||
8260 | /* Takes parameters as for type_unification. Returns 0 if the | |
8261 | type deduction suceeds, 1 otherwise. The parameter STRICT is a | |
8262 | bitwise or of the following flags: | |
8263 | ||
8264 | UNIFY_ALLOW_NONE: | |
8265 | Require an exact match between PARM and ARG. | |
8266 | UNIFY_ALLOW_MORE_CV_QUAL: | |
8267 | Allow the deduced ARG to be more cv-qualified than ARG. | |
8268 | UNIFY_ALLOW_LESS_CV_QUAL: | |
8269 | Allow the deduced ARG to be less cv-qualified than ARG. | |
8270 | UNIFY_ALLOW_DERIVED: | |
8271 | Allow the deduced ARG to be a template base class of ARG, | |
8272 | or a pointer to a template base class of the type pointed to by | |
161c12b0 JM |
8273 | ARG. |
8274 | UNIFY_ALLOW_INTEGER: | |
8275 | Allow any integral type to be deduced. See the TEMPLATE_PARM_INDEX | |
8276 | case for more information. */ | |
830bfa74 | 8277 | |
e9659ab0 | 8278 | static int |
4393e105 | 8279 | unify (tparms, targs, parm, arg, strict) |
050367a3 | 8280 | tree tparms, targs, parm, arg; |
830bfa74 | 8281 | int strict; |
8d08fdba MS |
8282 | { |
8283 | int idx; | |
050367a3 | 8284 | tree targ; |
db2767b6 | 8285 | tree tparm; |
8d08fdba MS |
8286 | |
8287 | /* I don't think this will do the right thing with respect to types. | |
8288 | But the only case I've seen it in so far has been array bounds, where | |
8289 | signedness is the only information lost, and I think that will be | |
8290 | okay. */ | |
8291 | while (TREE_CODE (parm) == NOP_EXPR) | |
8292 | parm = TREE_OPERAND (parm, 0); | |
8293 | ||
8294 | if (arg == error_mark_node) | |
8295 | return 1; | |
8296 | if (arg == unknown_type_node) | |
34016c81 JM |
8297 | /* We can't deduce anything from this, but we might get all the |
8298 | template args from other function args. */ | |
8299 | return 0; | |
8300 | ||
db2767b6 | 8301 | /* If PARM uses template parameters, then we can't bail out here, |
6bdb985f | 8302 | even if ARG == PARM, since we won't record unifications for the |
db2767b6 MM |
8303 | template parameters. We might need them if we're trying to |
8304 | figure out which of two things is more specialized. */ | |
8305 | if (arg == parm && !uses_template_parms (parm)) | |
8d08fdba MS |
8306 | return 0; |
8307 | ||
830bfa74 MM |
8308 | /* Immediately reject some pairs that won't unify because of |
8309 | cv-qualification mismatches. */ | |
8310 | if (TREE_CODE (arg) == TREE_CODE (parm) | |
2f939d94 | 8311 | && TYPE_P (arg) |
830bfa74 MM |
8312 | /* We check the cv-qualifiers when unifying with template type |
8313 | parameters below. We want to allow ARG `const T' to unify with | |
8314 | PARM `T' for example, when computing which of two templates | |
8315 | is more specialized, for example. */ | |
8316 | && TREE_CODE (arg) != TEMPLATE_TYPE_PARM | |
8317 | && !check_cv_quals_for_unify (strict, arg, parm)) | |
49432171 JM |
8318 | return 1; |
8319 | ||
8d08fdba MS |
8320 | switch (TREE_CODE (parm)) |
8321 | { | |
2ca340ae JM |
8322 | case TYPENAME_TYPE: |
8323 | /* In a type which contains a nested-name-specifier, template | |
8324 | argument values cannot be deduced for template parameters used | |
8325 | within the nested-name-specifier. */ | |
8326 | return 0; | |
8327 | ||
8d08fdba | 8328 | case TEMPLATE_TYPE_PARM: |
73b0fce8 | 8329 | case TEMPLATE_TEMPLATE_PARM: |
db2767b6 MM |
8330 | tparm = TREE_VALUE (TREE_VEC_ELT (tparms, 0)); |
8331 | ||
8332 | if (TEMPLATE_TYPE_LEVEL (parm) | |
8333 | != template_decl_level (tparm)) | |
8334 | /* The PARM is not one we're trying to unify. Just check | |
8335 | to see if it matches ARG. */ | |
8336 | return (TREE_CODE (arg) == TREE_CODE (parm) | |
3bfdc719 | 8337 | && same_type_p (parm, arg)) ? 0 : 1; |
73b0fce8 | 8338 | idx = TEMPLATE_TYPE_IDX (parm); |
050367a3 | 8339 | targ = TREE_VEC_ELT (targs, idx); |
db2767b6 | 8340 | tparm = TREE_VALUE (TREE_VEC_ELT (tparms, idx)); |
050367a3 | 8341 | |
73b0fce8 | 8342 | /* Check for mixed types and values. */ |
db2767b6 MM |
8343 | if ((TREE_CODE (parm) == TEMPLATE_TYPE_PARM |
8344 | && TREE_CODE (tparm) != TYPE_DECL) | |
8345 | || (TREE_CODE (parm) == TEMPLATE_TEMPLATE_PARM | |
8346 | && TREE_CODE (tparm) != TEMPLATE_DECL)) | |
73b0fce8 KL |
8347 | return 1; |
8348 | ||
db2767b6 | 8349 | if (TREE_CODE (parm) == TEMPLATE_TEMPLATE_PARM) |
73b0fce8 | 8350 | { |
7ddedda4 | 8351 | if (TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (parm)) |
db2767b6 MM |
8352 | { |
8353 | /* We arrive here when PARM does not involve template | |
8354 | specialization. */ | |
73b0fce8 | 8355 | |
db2767b6 MM |
8356 | /* ARG must be constructed from a template class. */ |
8357 | if (TREE_CODE (arg) != RECORD_TYPE || !CLASSTYPE_TEMPLATE_INFO (arg)) | |
8358 | return 1; | |
73b0fce8 | 8359 | |
db2767b6 | 8360 | { |
7ddedda4 MM |
8361 | tree parmtmpl = TYPE_TI_TEMPLATE (parm); |
8362 | tree parmvec = TYPE_TI_ARGS (parm); | |
db2767b6 MM |
8363 | tree argvec = CLASSTYPE_TI_ARGS (arg); |
8364 | tree argtmplvec | |
8365 | = DECL_INNERMOST_TEMPLATE_PARMS (CLASSTYPE_TI_TEMPLATE (arg)); | |
8366 | int i; | |
8367 | ||
8368 | /* The parameter and argument roles have to be switched here | |
8369 | in order to handle default arguments properly. For example, | |
8370 | template<template <class> class TT> void f(TT<int>) | |
8371 | should be able to accept vector<int> which comes from | |
744fac59 | 8372 | template <class T, class Allocator = allocator> |
73b0fce8 KL |
8373 | class vector. */ |
8374 | ||
fcfcdfc8 | 8375 | if (coerce_template_parms (argtmplvec, parmvec, parmtmpl, 0, 1) |
db2767b6 MM |
8376 | == error_mark_node) |
8377 | return 1; | |
73b0fce8 | 8378 | |
6b9b6b15 JM |
8379 | /* Deduce arguments T, i from TT<T> or TT<i>. |
8380 | We check each element of PARMVEC and ARGVEC individually | |
8381 | rather than the whole TREE_VEC since they can have | |
8382 | different number of elements. */ | |
8383 | ||
db2767b6 MM |
8384 | for (i = 0; i < TREE_VEC_LENGTH (parmvec); ++i) |
8385 | { | |
8386 | tree t = TREE_VEC_ELT (parmvec, i); | |
73b0fce8 | 8387 | |
830bfa74 MM |
8388 | if (unify (tparms, targs, t, |
8389 | TREE_VEC_ELT (argvec, i), | |
4393e105 | 8390 | UNIFY_ALLOW_NONE)) |
db2767b6 MM |
8391 | return 1; |
8392 | } | |
73b0fce8 | 8393 | } |
db2767b6 MM |
8394 | arg = CLASSTYPE_TI_TEMPLATE (arg); |
8395 | } | |
8396 | } | |
8397 | else | |
8398 | { | |
830bfa74 MM |
8399 | /* If PARM is `const T' and ARG is only `int', we don't have |
8400 | a match unless we are allowing additional qualification. | |
8401 | If ARG is `const int' and PARM is just `T' that's OK; | |
8402 | that binds `const int' to `T'. */ | |
8403 | if (!check_cv_quals_for_unify (strict | UNIFY_ALLOW_LESS_CV_QUAL, | |
8404 | arg, parm)) | |
db2767b6 MM |
8405 | return 1; |
8406 | ||
830bfa74 MM |
8407 | /* Consider the case where ARG is `const volatile int' and |
8408 | PARM is `const T'. Then, T should be `volatile int'. */ | |
8409 | arg = | |
adecb3f4 MM |
8410 | cp_build_qualified_type_real (arg, |
8411 | CP_TYPE_QUALS (arg) | |
8412 | & ~CP_TYPE_QUALS (parm), | |
8413 | /*complain=*/0); | |
8414 | if (arg == error_mark_node) | |
8415 | return 1; | |
73b0fce8 KL |
8416 | } |
8417 | ||
8418 | /* Simple cases: Value already set, does match or doesn't. */ | |
4393e105 | 8419 | if (targ != NULL_TREE && same_type_p (targ, arg)) |
73b0fce8 | 8420 | return 0; |
050367a3 | 8421 | else if (targ) |
73b0fce8 | 8422 | return 1; |
61cd552e MM |
8423 | |
8424 | /* Make sure that ARG is not a variable-sized array. (Note that | |
8425 | were talking about variable-sized arrays (like `int[n]'), | |
8426 | rather than arrays of unknown size (like `int[]').) We'll | |
8427 | get very confused by such a type since the bound of the array | |
8428 | will not be computable in an instantiation. Besides, such | |
8429 | types are not allowed in ISO C++, so we can do as we please | |
8430 | here. */ | |
8431 | if (TREE_CODE (arg) == ARRAY_TYPE | |
8432 | && !uses_template_parms (arg) | |
8433 | && (TREE_CODE (TYPE_MAX_VALUE (TYPE_DOMAIN (arg))) | |
8434 | != INTEGER_CST)) | |
8435 | return 1; | |
8436 | ||
050367a3 | 8437 | TREE_VEC_ELT (targs, idx) = arg; |
73b0fce8 KL |
8438 | return 0; |
8439 | ||
f84b4be9 | 8440 | case TEMPLATE_PARM_INDEX: |
db2767b6 MM |
8441 | tparm = TREE_VALUE (TREE_VEC_ELT (tparms, 0)); |
8442 | ||
8443 | if (TEMPLATE_PARM_LEVEL (parm) | |
8444 | != template_decl_level (tparm)) | |
8445 | /* The PARM is not one we're trying to unify. Just check | |
8446 | to see if it matches ARG. */ | |
8447 | return (TREE_CODE (arg) == TREE_CODE (parm) | |
67ffc812 | 8448 | && cp_tree_equal (parm, arg) > 0) ? 0 : 1; |
db2767b6 | 8449 | |
f84b4be9 | 8450 | idx = TEMPLATE_PARM_IDX (parm); |
050367a3 | 8451 | targ = TREE_VEC_ELT (targs, idx); |
db2767b6 | 8452 | |
050367a3 | 8453 | if (targ) |
8d08fdba | 8454 | { |
67ffc812 | 8455 | int i = (cp_tree_equal (targ, arg) > 0); |
312e7d50 JM |
8456 | if (i == 1) |
8457 | return 0; | |
8458 | else if (i == 0) | |
8459 | return 1; | |
8460 | else | |
8461 | my_friendly_abort (42); | |
8d08fdba | 8462 | } |
8d08fdba | 8463 | |
161c12b0 JM |
8464 | /* [temp.deduct.type] If, in the declaration of a function template |
8465 | with a non-type template-parameter, the non-type | |
8466 | template-parameter is used in an expression in the function | |
8467 | parameter-list and, if the corresponding template-argument is | |
8468 | deduced, the template-argument type shall match the type of the | |
8469 | template-parameter exactly, except that a template-argument | |
8470 | deduced from an array bound may be of any integral type. */ | |
8471 | if (same_type_p (TREE_TYPE (arg), TREE_TYPE (parm))) | |
8472 | /* OK */; | |
8473 | else if ((strict & UNIFY_ALLOW_INTEGER) | |
8474 | && (TREE_CODE (TREE_TYPE (parm)) == INTEGER_TYPE | |
8475 | || TREE_CODE (TREE_TYPE (parm)) == BOOLEAN_TYPE)) | |
8476 | /* OK */; | |
8477 | else | |
8478 | return 1; | |
8479 | ||
2a1e9fdd | 8480 | TREE_VEC_ELT (targs, idx) = arg; |
8d08fdba MS |
8481 | return 0; |
8482 | ||
8483 | case POINTER_TYPE: | |
830bfa74 MM |
8484 | { |
8485 | int sub_strict; | |
4ac14744 | 8486 | |
830bfa74 MM |
8487 | if (TREE_CODE (arg) != POINTER_TYPE) |
8488 | return 1; | |
8489 | ||
8490 | /* [temp.deduct.call] | |
8491 | ||
8492 | A can be another pointer or pointer to member type that can | |
8493 | be converted to the deduced A via a qualification | |
8494 | conversion (_conv.qual_). | |
8495 | ||
8496 | We pass down STRICT here rather than UNIFY_ALLOW_NONE. | |
8497 | This will allow for additional cv-qualification of the | |
8498 | pointed-to types if appropriate. In general, this is a bit | |
8499 | too generous; we are only supposed to allow qualification | |
8500 | conversions and this method will allow an ARG of char** and | |
8501 | a deduced ARG of const char**. However, overload | |
8502 | resolution will subsequently invalidate the candidate, so | |
8503 | this is probably OK. */ | |
8504 | sub_strict = strict; | |
8505 | ||
a7a64a77 | 8506 | if (TREE_CODE (TREE_TYPE (arg)) != RECORD_TYPE) |
830bfa74 MM |
8507 | /* The derived-to-base conversion only persists through one |
8508 | level of pointers. */ | |
8509 | sub_strict &= ~UNIFY_ALLOW_DERIVED; | |
8510 | ||
a7a64a77 MM |
8511 | return unify (tparms, targs, TREE_TYPE (parm), |
8512 | TREE_TYPE (arg), sub_strict); | |
830bfa74 | 8513 | } |
8d08fdba MS |
8514 | |
8515 | case REFERENCE_TYPE: | |
830bfa74 MM |
8516 | if (TREE_CODE (arg) != REFERENCE_TYPE) |
8517 | return 1; | |
8518 | return unify (tparms, targs, TREE_TYPE (parm), TREE_TYPE (arg), | |
4393e105 | 8519 | UNIFY_ALLOW_NONE); |
8d08fdba MS |
8520 | |
8521 | case ARRAY_TYPE: | |
8522 | if (TREE_CODE (arg) != ARRAY_TYPE) | |
8523 | return 1; | |
3042d5be MM |
8524 | if ((TYPE_DOMAIN (parm) == NULL_TREE) |
8525 | != (TYPE_DOMAIN (arg) == NULL_TREE)) | |
8526 | return 1; | |
8527 | if (TYPE_DOMAIN (parm) != NULL_TREE | |
830bfa74 | 8528 | && unify (tparms, targs, TYPE_DOMAIN (parm), |
4393e105 | 8529 | TYPE_DOMAIN (arg), UNIFY_ALLOW_NONE) != 0) |
8d08fdba | 8530 | return 1; |
830bfa74 | 8531 | return unify (tparms, targs, TREE_TYPE (parm), TREE_TYPE (arg), |
4393e105 | 8532 | UNIFY_ALLOW_NONE); |
8d08fdba MS |
8533 | |
8534 | case REAL_TYPE: | |
37c46b43 | 8535 | case COMPLEX_TYPE: |
8d08fdba | 8536 | case INTEGER_TYPE: |
42976354 | 8537 | case BOOLEAN_TYPE: |
5ad5a526 | 8538 | case VOID_TYPE: |
f376e137 MS |
8539 | if (TREE_CODE (arg) != TREE_CODE (parm)) |
8540 | return 1; | |
8541 | ||
514a1f18 JM |
8542 | if (TREE_CODE (parm) == INTEGER_TYPE |
8543 | && TREE_CODE (TYPE_MAX_VALUE (parm)) != INTEGER_CST) | |
8d08fdba MS |
8544 | { |
8545 | if (TYPE_MIN_VALUE (parm) && TYPE_MIN_VALUE (arg) | |
830bfa74 | 8546 | && unify (tparms, targs, TYPE_MIN_VALUE (parm), |
4393e105 | 8547 | TYPE_MIN_VALUE (arg), UNIFY_ALLOW_INTEGER)) |
8d08fdba MS |
8548 | return 1; |
8549 | if (TYPE_MAX_VALUE (parm) && TYPE_MAX_VALUE (arg) | |
830bfa74 | 8550 | && unify (tparms, targs, TYPE_MAX_VALUE (parm), |
4393e105 | 8551 | TYPE_MAX_VALUE (arg), UNIFY_ALLOW_INTEGER)) |
8d08fdba MS |
8552 | return 1; |
8553 | } | |
9edc3913 | 8554 | /* We have already checked cv-qualification at the top of the |
514a1f18 | 8555 | function. */ |
9edc3913 | 8556 | else if (!same_type_ignoring_top_level_qualifiers_p (arg, parm)) |
ca79f85d JM |
8557 | return 1; |
8558 | ||
8d08fdba MS |
8559 | /* As far as unification is concerned, this wins. Later checks |
8560 | will invalidate it if necessary. */ | |
8561 | return 0; | |
8562 | ||
8563 | /* Types INTEGER_CST and MINUS_EXPR can come from array bounds. */ | |
bd6dd845 | 8564 | /* Type INTEGER_CST can come from ordinary constant template args. */ |
8d08fdba | 8565 | case INTEGER_CST: |
bd6dd845 MS |
8566 | while (TREE_CODE (arg) == NOP_EXPR) |
8567 | arg = TREE_OPERAND (arg, 0); | |
8568 | ||
8d08fdba MS |
8569 | if (TREE_CODE (arg) != INTEGER_CST) |
8570 | return 1; | |
8571 | return !tree_int_cst_equal (parm, arg); | |
8572 | ||
8d08fdba MS |
8573 | case TREE_VEC: |
8574 | { | |
8575 | int i; | |
8576 | if (TREE_CODE (arg) != TREE_VEC) | |
8577 | return 1; | |
8578 | if (TREE_VEC_LENGTH (parm) != TREE_VEC_LENGTH (arg)) | |
8579 | return 1; | |
0dc09a61 | 8580 | for (i = 0; i < TREE_VEC_LENGTH (parm); ++i) |
830bfa74 | 8581 | if (unify (tparms, targs, |
8d08fdba | 8582 | TREE_VEC_ELT (parm, i), TREE_VEC_ELT (arg, i), |
4393e105 | 8583 | UNIFY_ALLOW_NONE)) |
8d08fdba MS |
8584 | return 1; |
8585 | return 0; | |
8586 | } | |
8587 | ||
8d08fdba | 8588 | case RECORD_TYPE: |
f181d4ae | 8589 | case UNION_TYPE: |
f181d4ae | 8590 | if (TREE_CODE (arg) != TREE_CODE (parm)) |
a4443a08 | 8591 | return 1; |
830bfa74 | 8592 | |
a7a64a77 MM |
8593 | if (TYPE_PTRMEMFUNC_P (parm)) |
8594 | { | |
8595 | if (!TYPE_PTRMEMFUNC_P (arg)) | |
8596 | return 1; | |
8597 | ||
8598 | return unify (tparms, targs, | |
8599 | TYPE_PTRMEMFUNC_FN_TYPE (parm), | |
8600 | TYPE_PTRMEMFUNC_FN_TYPE (arg), | |
8601 | strict); | |
8602 | } | |
8603 | ||
5db698f6 | 8604 | if (CLASSTYPE_TEMPLATE_INFO (parm)) |
5566b478 | 8605 | { |
6467930b | 8606 | tree t = NULL_TREE; |
4393e105 | 8607 | |
830bfa74 | 8608 | if (strict & UNIFY_ALLOW_DERIVED) |
4393e105 MM |
8609 | { |
8610 | /* First, we try to unify the PARM and ARG directly. */ | |
8611 | t = try_class_unification (tparms, targs, | |
8612 | parm, arg); | |
8613 | ||
8614 | if (!t) | |
8615 | { | |
8616 | /* Fallback to the special case allowed in | |
8617 | [temp.deduct.call]: | |
8618 | ||
8619 | If P is a class, and P has the form | |
8620 | template-id, then A can be a derived class of | |
8621 | the deduced A. Likewise, if P is a pointer to | |
8622 | a class of the form template-id, A can be a | |
8623 | pointer to a derived class pointed to by the | |
8624 | deduced A. */ | |
8625 | t = get_template_base (tparms, targs, | |
8626 | parm, arg); | |
8627 | ||
8628 | if (! t || t == error_mark_node) | |
8629 | return 1; | |
8630 | } | |
8631 | } | |
6df47b06 | 8632 | else if (CLASSTYPE_TEMPLATE_INFO (arg) |
9fbf56f7 MM |
8633 | && (CLASSTYPE_TI_TEMPLATE (parm) |
8634 | == CLASSTYPE_TI_TEMPLATE (arg))) | |
6df47b06 MM |
8635 | /* Perhaps PARM is something like S<U> and ARG is S<int>. |
8636 | Then, we should unify `int' and `U'. */ | |
6467930b | 8637 | t = arg; |
4393e105 MM |
8638 | else |
8639 | /* There's no chance of unication succeeding. */ | |
5566b478 | 8640 | return 1; |
6467930b | 8641 | |
830bfa74 | 8642 | return unify (tparms, targs, CLASSTYPE_TI_ARGS (parm), |
4393e105 | 8643 | CLASSTYPE_TI_ARGS (t), UNIFY_ALLOW_NONE); |
5566b478 | 8644 | } |
9edc3913 | 8645 | else if (!same_type_ignoring_top_level_qualifiers_p (parm, arg)) |
5566b478 | 8646 | return 1; |
a4443a08 | 8647 | return 0; |
8d08fdba MS |
8648 | |
8649 | case METHOD_TYPE: | |
8d08fdba | 8650 | case FUNCTION_TYPE: |
830bfa74 | 8651 | if (TREE_CODE (arg) != TREE_CODE (parm)) |
8d08fdba | 8652 | return 1; |
830bfa74 MM |
8653 | |
8654 | if (unify (tparms, targs, TREE_TYPE (parm), | |
4393e105 | 8655 | TREE_TYPE (arg), UNIFY_ALLOW_NONE)) |
28cbf42c | 8656 | return 1; |
386b8a85 | 8657 | return type_unification_real (tparms, targs, TYPE_ARG_TYPES (parm), |
3b3ba9f0 | 8658 | TYPE_ARG_TYPES (arg), 1, |
4393e105 | 8659 | DEDUCE_EXACT, 0); |
a4443a08 MS |
8660 | |
8661 | case OFFSET_TYPE: | |
8662 | if (TREE_CODE (arg) != OFFSET_TYPE) | |
8663 | return 1; | |
830bfa74 | 8664 | if (unify (tparms, targs, TYPE_OFFSET_BASETYPE (parm), |
4393e105 | 8665 | TYPE_OFFSET_BASETYPE (arg), UNIFY_ALLOW_NONE)) |
a4443a08 | 8666 | return 1; |
830bfa74 | 8667 | return unify (tparms, targs, TREE_TYPE (parm), TREE_TYPE (arg), |
4393e105 | 8668 | strict); |
a4443a08 | 8669 | |
f62dbf03 | 8670 | case CONST_DECL: |
830bfa74 | 8671 | if (arg != decl_constant_value (parm)) |
f62dbf03 JM |
8672 | return 1; |
8673 | return 0; | |
8674 | ||
027905b4 KL |
8675 | case TEMPLATE_DECL: |
8676 | /* Matched cases are handled by the ARG == PARM test above. */ | |
8677 | return 1; | |
8678 | ||
53929c47 JM |
8679 | case MINUS_EXPR: |
8680 | if (TREE_CODE (TREE_OPERAND (parm, 1)) == INTEGER_CST) | |
8681 | { | |
8682 | /* We handle this case specially, since it comes up with | |
8683 | arrays. In particular, something like: | |
8684 | ||
8685 | template <int N> void f(int (&x)[N]); | |
8686 | ||
8687 | Here, we are trying to unify the range type, which | |
8688 | looks like [0 ... (N - 1)]. */ | |
8689 | tree t, t1, t2; | |
8690 | t1 = TREE_OPERAND (parm, 0); | |
8691 | t2 = TREE_OPERAND (parm, 1); | |
8692 | ||
24e2e58e | 8693 | t = fold (build (PLUS_EXPR, integer_type_node, arg, t2)); |
53929c47 | 8694 | |
4393e105 | 8695 | return unify (tparms, targs, t1, t, strict); |
53929c47 JM |
8696 | } |
8697 | /* else fall through */ | |
8698 | ||
8d08fdba | 8699 | default: |
050367a3 | 8700 | if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (TREE_CODE (parm)))) |
4393e105 MM |
8701 | /* We're looking at an expression. This can happen with |
8702 | something like: | |
8703 | ||
8704 | template <int I> | |
8705 | void foo(S<I>, S<I + 2>); | |
050367a3 | 8706 | |
4393e105 | 8707 | This is a "nondeduced context": |
050367a3 | 8708 | |
4393e105 MM |
8709 | [deduct.type] |
8710 | ||
8711 | The nondeduced contexts are: | |
050367a3 | 8712 | |
4393e105 MM |
8713 | --A type that is a template-id in which one or more of |
8714 | the template-arguments is an expression that references | |
8715 | a template-parameter. | |
050367a3 | 8716 | |
4393e105 MM |
8717 | In these cases, we assume deduction succeeded, but don't |
8718 | actually infer any unifications. */ | |
8719 | return 0; | |
050367a3 | 8720 | else |
b4c4a9ec MM |
8721 | sorry ("use of `%s' in template type unification", |
8722 | tree_code_name [(int) TREE_CODE (parm)]); | |
050367a3 | 8723 | |
8d08fdba MS |
8724 | return 1; |
8725 | } | |
8726 | } | |
8d08fdba | 8727 | \f |
03d0f4af MM |
8728 | /* Called if RESULT is explicitly instantiated, or is a member of an |
8729 | explicitly instantiated class, or if using -frepo and the | |
8730 | instantiation of RESULT has been assigned to this file. */ | |
8731 | ||
faae18ab | 8732 | void |
5566b478 | 8733 | mark_decl_instantiated (result, extern_p) |
faae18ab MS |
8734 | tree result; |
8735 | int extern_p; | |
8736 | { | |
75650646 MM |
8737 | if (TREE_CODE (result) != FUNCTION_DECL) |
8738 | /* The TREE_PUBLIC flag for function declarations will have been | |
8739 | set correctly by tsubst. */ | |
8740 | TREE_PUBLIC (result) = 1; | |
faae18ab | 8741 | |
3ae18eaf JM |
8742 | /* We used to set this unconditionally; we moved that to |
8743 | do_decl_instantiation so it wouldn't get set on members of | |
8744 | explicit class template instantiations. But we still need to set | |
8745 | it here for the 'extern template' case in order to suppress | |
8746 | implicit instantiations. */ | |
8747 | if (extern_p) | |
8748 | SET_DECL_EXPLICIT_INSTANTIATION (result); | |
8749 | ||
faae18ab MS |
8750 | if (! extern_p) |
8751 | { | |
8752 | DECL_INTERFACE_KNOWN (result) = 1; | |
8753 | DECL_NOT_REALLY_EXTERN (result) = 1; | |
a7d87521 | 8754 | |
1a408d07 JM |
8755 | /* Always make artificials weak. */ |
8756 | if (DECL_ARTIFICIAL (result) && flag_weak) | |
8757 | comdat_linkage (result); | |
a7d87521 JM |
8758 | /* For WIN32 we also want to put explicit instantiations in |
8759 | linkonce sections. */ | |
1a408d07 | 8760 | else if (TREE_PUBLIC (result)) |
b385c841 | 8761 | maybe_make_one_only (result); |
faae18ab | 8762 | } |
f49422da | 8763 | else if (TREE_CODE (result) == FUNCTION_DECL) |
56e770bf | 8764 | defer_fn (result); |
faae18ab MS |
8765 | } |
8766 | ||
e1467ff2 MM |
8767 | /* Given two function templates PAT1 and PAT2, and explicit template |
8768 | arguments EXPLICIT_ARGS return: | |
6467930b MS |
8769 | |
8770 | 1 if PAT1 is more specialized than PAT2 as described in [temp.func.order]. | |
8771 | -1 if PAT2 is more specialized than PAT1. | |
8772 | 0 if neither is more specialized. */ | |
8773 | ||
8774 | int | |
e1467ff2 MM |
8775 | more_specialized (pat1, pat2, explicit_args) |
8776 | tree pat1, pat2, explicit_args; | |
6467930b | 8777 | { |
98c1c668 | 8778 | tree targs; |
73aad9b9 | 8779 | int winner = 0; |
6467930b | 8780 | |
17aec3eb RK |
8781 | targs |
8782 | = get_bindings_overload (pat1, DECL_TEMPLATE_RESULT (pat2), explicit_args); | |
73aad9b9 | 8783 | if (targs) |
36a117a5 | 8784 | --winner; |
6467930b | 8785 | |
17aec3eb RK |
8786 | targs |
8787 | = get_bindings_overload (pat2, DECL_TEMPLATE_RESULT (pat1), explicit_args); | |
73aad9b9 | 8788 | if (targs) |
36a117a5 | 8789 | ++winner; |
6467930b | 8790 | |
73aad9b9 JM |
8791 | return winner; |
8792 | } | |
6467930b | 8793 | |
73aad9b9 | 8794 | /* Given two class template specialization list nodes PAT1 and PAT2, return: |
6467930b | 8795 | |
73aad9b9 JM |
8796 | 1 if PAT1 is more specialized than PAT2 as described in [temp.class.order]. |
8797 | -1 if PAT2 is more specialized than PAT1. | |
8798 | 0 if neither is more specialized. */ | |
8799 | ||
8800 | int | |
8801 | more_specialized_class (pat1, pat2) | |
8802 | tree pat1, pat2; | |
8803 | { | |
8804 | tree targs; | |
8805 | int winner = 0; | |
8806 | ||
36a117a5 MM |
8807 | targs = get_class_bindings (TREE_VALUE (pat1), TREE_PURPOSE (pat1), |
8808 | TREE_PURPOSE (pat2)); | |
73aad9b9 JM |
8809 | if (targs) |
8810 | --winner; | |
8811 | ||
36a117a5 MM |
8812 | targs = get_class_bindings (TREE_VALUE (pat2), TREE_PURPOSE (pat2), |
8813 | TREE_PURPOSE (pat1)); | |
73aad9b9 | 8814 | if (targs) |
6467930b MS |
8815 | ++winner; |
8816 | ||
8817 | return winner; | |
8818 | } | |
73aad9b9 JM |
8819 | |
8820 | /* Return the template arguments that will produce the function signature | |
e1467ff2 | 8821 | DECL from the function template FN, with the explicit template |
76b9a14d | 8822 | arguments EXPLICIT_ARGS. If CHECK_RETTYPE is 1, the return type must |
4393e105 MM |
8823 | also match. Return NULL_TREE if no satisfactory arguments could be |
8824 | found. */ | |
73aad9b9 | 8825 | |
76b9a14d JM |
8826 | static tree |
8827 | get_bindings_real (fn, decl, explicit_args, check_rettype) | |
e1467ff2 | 8828 | tree fn, decl, explicit_args; |
76b9a14d | 8829 | int check_rettype; |
73aad9b9 | 8830 | { |
98c1c668 | 8831 | int ntparms = DECL_NTPARMS (fn); |
f31c0a32 | 8832 | tree targs = make_tree_vec (ntparms); |
4393e105 | 8833 | tree decl_type; |
03017874 | 8834 | tree decl_arg_types; |
98c1c668 JM |
8835 | int i; |
8836 | ||
4393e105 MM |
8837 | /* Substitute the explicit template arguments into the type of DECL. |
8838 | The call to fn_type_unification will handle substitution into the | |
8839 | FN. */ | |
8840 | decl_type = TREE_TYPE (decl); | |
8841 | if (explicit_args && uses_template_parms (decl_type)) | |
8842 | { | |
8843 | tree tmpl; | |
8844 | tree converted_args; | |
8845 | ||
8846 | if (DECL_TEMPLATE_INFO (decl)) | |
8847 | tmpl = DECL_TI_TEMPLATE (decl); | |
8848 | else | |
8849 | /* We can get here for some illegal specializations. */ | |
8850 | return NULL_TREE; | |
8851 | ||
8852 | converted_args | |
8853 | = (coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (tmpl), | |
8854 | explicit_args, NULL_TREE, | |
8855 | /*complain=*/0, | |
8856 | /*require_all_arguments=*/0)); | |
8857 | if (converted_args == error_mark_node) | |
8858 | return NULL_TREE; | |
8859 | ||
8860 | decl_type = tsubst (decl_type, converted_args, /*complain=*/0, | |
8861 | NULL_TREE); | |
8862 | if (decl_type == error_mark_node) | |
8863 | return NULL_TREE; | |
8864 | } | |
8865 | ||
03017874 MM |
8866 | /* If FN is a static member function, adjust the type of DECL |
8867 | appropriately. */ | |
4393e105 | 8868 | decl_arg_types = TYPE_ARG_TYPES (decl_type); |
d7684f2d MM |
8869 | if (DECL_STATIC_FUNCTION_P (fn) |
8870 | && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl)) | |
03017874 | 8871 | decl_arg_types = TREE_CHAIN (decl_arg_types); |
d7684f2d | 8872 | |
e1467ff2 | 8873 | i = fn_type_unification (fn, explicit_args, targs, |
03017874 | 8874 | decl_arg_types, |
8d3631f8 NS |
8875 | (check_rettype || DECL_CONV_FN_P (fn) |
8876 | ? TREE_TYPE (decl_type) : NULL_TREE), | |
03017874 | 8877 | DEDUCE_EXACT); |
98c1c668 | 8878 | |
76b9a14d JM |
8879 | if (i != 0) |
8880 | return NULL_TREE; | |
8881 | ||
76b9a14d JM |
8882 | return targs; |
8883 | } | |
8884 | ||
8885 | /* For most uses, we want to check the return type. */ | |
8886 | ||
8887 | tree | |
8888 | get_bindings (fn, decl, explicit_args) | |
8889 | tree fn, decl, explicit_args; | |
8890 | { | |
8891 | return get_bindings_real (fn, decl, explicit_args, 1); | |
8892 | } | |
8893 | ||
8894 | /* But for more_specialized, we only care about the parameter types. */ | |
8895 | ||
8896 | static tree | |
8897 | get_bindings_overload (fn, decl, explicit_args) | |
8898 | tree fn, decl, explicit_args; | |
8899 | { | |
8900 | return get_bindings_real (fn, decl, explicit_args, 0); | |
73aad9b9 JM |
8901 | } |
8902 | ||
36a117a5 MM |
8903 | /* Return the innermost template arguments that, when applied to a |
8904 | template specialization whose innermost template parameters are | |
8905 | TPARMS, and whose specialization arguments are ARGS, yield the | |
8906 | ARGS. | |
8907 | ||
8908 | For example, suppose we have: | |
8909 | ||
8910 | template <class T, class U> struct S {}; | |
8911 | template <class T> struct S<T*, int> {}; | |
8912 | ||
8913 | Then, suppose we want to get `S<double*, int>'. The TPARMS will be | |
8914 | {T}, the PARMS will be {T*, int} and the ARGS will be {double*, | |
8915 | int}. The resulting vector will be {double}, indicating that `T' | |
8916 | is bound to `double'. */ | |
8917 | ||
bd6dd845 | 8918 | static tree |
36a117a5 MM |
8919 | get_class_bindings (tparms, parms, args) |
8920 | tree tparms, parms, args; | |
73aad9b9 | 8921 | { |
3b3ba9f0 | 8922 | int i, ntparms = TREE_VEC_LENGTH (tparms); |
f31c0a32 | 8923 | tree vec = make_tree_vec (ntparms); |
73aad9b9 | 8924 | |
f9a7ae04 | 8925 | args = INNERMOST_TEMPLATE_ARGS (args); |
8d019cef | 8926 | |
4393e105 | 8927 | if (unify (tparms, vec, parms, args, UNIFY_ALLOW_NONE)) |
fcfb9f96 | 8928 | return NULL_TREE; |
73aad9b9 JM |
8929 | |
8930 | for (i = 0; i < ntparms; ++i) | |
8931 | if (! TREE_VEC_ELT (vec, i)) | |
8932 | return NULL_TREE; | |
8933 | ||
8934 | return vec; | |
8935 | } | |
8936 | ||
104bf76a MM |
8937 | /* In INSTANTIATIONS is a list of <INSTANTIATION, TEMPLATE> pairs. |
8938 | Pick the most specialized template, and return the corresponding | |
8939 | instantiation, or if there is no corresponding instantiation, the | |
8940 | template itself. EXPLICIT_ARGS is any template arguments explicity | |
8941 | mentioned in a template-id. If there is no most specialized | |
5186142b | 8942 | template, error_mark_node is returned. If there are no templates |
104bf76a | 8943 | at all, NULL_TREE is returned. */ |
73aad9b9 JM |
8944 | |
8945 | tree | |
104bf76a MM |
8946 | most_specialized_instantiation (instantiations, explicit_args) |
8947 | tree instantiations; | |
8948 | tree explicit_args; | |
73aad9b9 | 8949 | { |
104bf76a | 8950 | tree fn, champ; |
73aad9b9 JM |
8951 | int fate; |
8952 | ||
104bf76a | 8953 | if (!instantiations) |
73aad9b9 JM |
8954 | return NULL_TREE; |
8955 | ||
104bf76a MM |
8956 | champ = instantiations; |
8957 | for (fn = TREE_CHAIN (instantiations); fn; fn = TREE_CHAIN (fn)) | |
73aad9b9 | 8958 | { |
104bf76a MM |
8959 | fate = more_specialized (TREE_VALUE (champ), |
8960 | TREE_VALUE (fn), explicit_args); | |
73aad9b9 JM |
8961 | if (fate == 1) |
8962 | ; | |
8963 | else | |
8964 | { | |
8965 | if (fate == 0) | |
8966 | { | |
8967 | fn = TREE_CHAIN (fn); | |
8968 | if (! fn) | |
8969 | return error_mark_node; | |
8970 | } | |
104bf76a | 8971 | champ = fn; |
73aad9b9 JM |
8972 | } |
8973 | } | |
8974 | ||
104bf76a | 8975 | for (fn = instantiations; fn && fn != champ; fn = TREE_CHAIN (fn)) |
73aad9b9 | 8976 | { |
104bf76a MM |
8977 | fate = more_specialized (TREE_VALUE (champ), |
8978 | TREE_VALUE (fn), explicit_args); | |
73aad9b9 JM |
8979 | if (fate != 1) |
8980 | return error_mark_node; | |
8981 | } | |
8982 | ||
104bf76a MM |
8983 | return TREE_PURPOSE (champ) ? TREE_PURPOSE (champ) : TREE_VALUE (champ); |
8984 | } | |
8985 | ||
8986 | /* Return the most specialized of the list of templates in FNS that can | |
8987 | produce an instantiation matching DECL, given the explicit template | |
8988 | arguments EXPLICIT_ARGS. */ | |
8989 | ||
e9659ab0 | 8990 | static tree |
104bf76a MM |
8991 | most_specialized (fns, decl, explicit_args) |
8992 | tree fns, decl, explicit_args; | |
8993 | { | |
8994 | tree candidates = NULL_TREE; | |
8995 | tree fn, args; | |
8996 | ||
8997 | for (fn = fns; fn; fn = TREE_CHAIN (fn)) | |
8998 | { | |
8999 | tree candidate = TREE_VALUE (fn); | |
9000 | ||
9001 | args = get_bindings (candidate, decl, explicit_args); | |
9002 | if (args) | |
e1b3e07d | 9003 | candidates = tree_cons (NULL_TREE, candidate, candidates); |
104bf76a MM |
9004 | } |
9005 | ||
9006 | return most_specialized_instantiation (candidates, explicit_args); | |
73aad9b9 JM |
9007 | } |
9008 | ||
36a117a5 | 9009 | /* If DECL is a specialization of some template, return the most |
f9a7ae04 MM |
9010 | general such template. Otherwise, returns NULL_TREE. |
9011 | ||
9012 | For example, given: | |
36a117a5 MM |
9013 | |
9014 | template <class T> struct S { template <class U> void f(U); }; | |
9015 | ||
9016 | if TMPL is `template <class U> void S<int>::f(U)' this will return | |
9017 | the full template. This function will not trace past partial | |
9018 | specializations, however. For example, given in addition: | |
9019 | ||
9020 | template <class T> struct S<T*> { template <class U> void f(U); }; | |
9021 | ||
9022 | if TMPL is `template <class U> void S<int*>::f(U)' this will return | |
9023 | `template <class T> template <class U> S<T*>::f(U)'. */ | |
73aad9b9 | 9024 | |
612c671a | 9025 | tree |
36a117a5 MM |
9026 | most_general_template (decl) |
9027 | tree decl; | |
73aad9b9 | 9028 | { |
f9a7ae04 MM |
9029 | /* If DECL is a FUNCTION_DECL, find the TEMPLATE_DECL of which it is |
9030 | an immediate specialization. */ | |
9031 | if (TREE_CODE (decl) == FUNCTION_DECL) | |
9032 | { | |
9033 | if (DECL_TEMPLATE_INFO (decl)) { | |
9034 | decl = DECL_TI_TEMPLATE (decl); | |
9035 | ||
9036 | /* The DECL_TI_TEMPLATE can be an IDENTIFIER_NODE for a | |
9037 | template friend. */ | |
9038 | if (TREE_CODE (decl) != TEMPLATE_DECL) | |
9039 | return NULL_TREE; | |
9040 | } else | |
9041 | return NULL_TREE; | |
9042 | } | |
9043 | ||
9044 | /* Look for more and more general templates. */ | |
9045 | while (DECL_TEMPLATE_INFO (decl)) | |
9046 | { | |
9047 | /* The DECL_TI_TEMPLATE can be a LOOKUP_EXPR or IDENTIFIER_NODE | |
9048 | in some cases. (See cp-tree.h for details.) */ | |
9049 | if (TREE_CODE (DECL_TI_TEMPLATE (decl)) != TEMPLATE_DECL) | |
9050 | break; | |
9051 | ||
9052 | /* Stop if we run into an explicitly specialized class template. */ | |
9053 | if (!DECL_NAMESPACE_SCOPE_P (decl) | |
9054 | && DECL_CONTEXT (decl) | |
9055 | && CLASSTYPE_TEMPLATE_SPECIALIZATION (DECL_CONTEXT (decl))) | |
9056 | break; | |
9057 | ||
9058 | decl = DECL_TI_TEMPLATE (decl); | |
9059 | } | |
36a117a5 MM |
9060 | |
9061 | return decl; | |
9062 | } | |
9063 | ||
9064 | /* Return the most specialized of the class template specializations | |
9065 | of TMPL which can produce an instantiation matching ARGS, or | |
9066 | error_mark_node if the choice is ambiguous. */ | |
9067 | ||
e9659ab0 | 9068 | static tree |
36a117a5 MM |
9069 | most_specialized_class (tmpl, args) |
9070 | tree tmpl; | |
9071 | tree args; | |
9072 | { | |
9073 | tree list = NULL_TREE; | |
9074 | tree t; | |
9075 | tree champ; | |
73aad9b9 JM |
9076 | int fate; |
9077 | ||
36a117a5 MM |
9078 | tmpl = most_general_template (tmpl); |
9079 | for (t = DECL_TEMPLATE_SPECIALIZATIONS (tmpl); t; t = TREE_CHAIN (t)) | |
73aad9b9 | 9080 | { |
36a117a5 MM |
9081 | tree spec_args |
9082 | = get_class_bindings (TREE_VALUE (t), TREE_PURPOSE (t), args); | |
9083 | if (spec_args) | |
73aad9b9 JM |
9084 | { |
9085 | list = decl_tree_cons (TREE_PURPOSE (t), TREE_VALUE (t), list); | |
9086 | TREE_TYPE (list) = TREE_TYPE (t); | |
9087 | } | |
9088 | } | |
9089 | ||
9090 | if (! list) | |
9091 | return NULL_TREE; | |
9092 | ||
9093 | t = list; | |
9094 | champ = t; | |
9095 | t = TREE_CHAIN (t); | |
9096 | for (; t; t = TREE_CHAIN (t)) | |
9097 | { | |
9098 | fate = more_specialized_class (champ, t); | |
9099 | if (fate == 1) | |
9100 | ; | |
9101 | else | |
9102 | { | |
9103 | if (fate == 0) | |
9104 | { | |
9105 | t = TREE_CHAIN (t); | |
9106 | if (! t) | |
9107 | return error_mark_node; | |
9108 | } | |
9109 | champ = t; | |
9110 | } | |
9111 | } | |
9112 | ||
9113 | for (t = list; t && t != champ; t = TREE_CHAIN (t)) | |
9114 | { | |
85b71cf2 | 9115 | fate = more_specialized_class (champ, t); |
73aad9b9 JM |
9116 | if (fate != 1) |
9117 | return error_mark_node; | |
9118 | } | |
9119 | ||
9120 | return champ; | |
9121 | } | |
9122 | ||
8d08fdba | 9123 | /* called from the parser. */ |
e92cc029 | 9124 | |
8d08fdba | 9125 | void |
6633d636 | 9126 | do_decl_instantiation (declspecs, declarator, storage) |
f0e01782 | 9127 | tree declspecs, declarator, storage; |
8d08fdba | 9128 | { |
c11b6f21 | 9129 | tree decl = grokdeclarator (declarator, declspecs, NORMAL, 0, NULL_TREE); |
8d08fdba | 9130 | tree result = NULL_TREE; |
faae18ab | 9131 | int extern_p = 0; |
e8abc66f | 9132 | |
3fa56191 MM |
9133 | if (!decl) |
9134 | /* An error ocurred, for which grokdeclarator has already issued | |
9135 | an appropriate message. */ | |
9136 | return; | |
9137 | else if (! DECL_LANG_SPECIFIC (decl)) | |
ec255269 | 9138 | { |
8251199e | 9139 | cp_error ("explicit instantiation of non-template `%#D'", decl); |
ec255269 MS |
9140 | return; |
9141 | } | |
03d0f4af | 9142 | else if (TREE_CODE (decl) == VAR_DECL) |
6633d636 | 9143 | { |
03d0f4af MM |
9144 | /* There is an asymmetry here in the way VAR_DECLs and |
9145 | FUNCTION_DECLs are handled by grokdeclarator. In the case of | |
9146 | the latter, the DECL we get back will be marked as a | |
9147 | template instantiation, and the appropriate | |
9148 | DECL_TEMPLATE_INFO will be set up. This does not happen for | |
9149 | VAR_DECLs so we do the lookup here. Probably, grokdeclarator | |
9150 | should handle VAR_DECLs as it currently handles | |
9151 | FUNCTION_DECLs. */ | |
6633d636 MS |
9152 | result = lookup_field (DECL_CONTEXT (decl), DECL_NAME (decl), 0, 0); |
9153 | if (result && TREE_CODE (result) != VAR_DECL) | |
03d0f4af | 9154 | { |
8251199e | 9155 | cp_error ("no matching template for `%D' found", result); |
03d0f4af MM |
9156 | return; |
9157 | } | |
6633d636 MS |
9158 | } |
9159 | else if (TREE_CODE (decl) != FUNCTION_DECL) | |
9160 | { | |
8251199e | 9161 | cp_error ("explicit instantiation of `%#D'", decl); |
6633d636 MS |
9162 | return; |
9163 | } | |
03d0f4af MM |
9164 | else |
9165 | result = decl; | |
672476cb | 9166 | |
03d0f4af MM |
9167 | /* Check for various error cases. Note that if the explicit |
9168 | instantiation is legal the RESULT will currently be marked as an | |
9169 | *implicit* instantiation; DECL_EXPLICIT_INSTANTIATION is not set | |
9170 | until we get here. */ | |
9171 | ||
9172 | if (DECL_TEMPLATE_SPECIALIZATION (result)) | |
672476cb | 9173 | { |
03d0f4af MM |
9174 | /* [temp.spec] |
9175 | ||
9176 | No program shall both explicitly instantiate and explicitly | |
9177 | specialize a template. */ | |
6f1b4c42 JM |
9178 | cp_pedwarn ("explicit instantiation of `%#D' after", result); |
9179 | cp_pedwarn_at ("explicit specialization here", result); | |
672476cb MM |
9180 | return; |
9181 | } | |
03d0f4af MM |
9182 | else if (DECL_EXPLICIT_INSTANTIATION (result)) |
9183 | { | |
9184 | /* [temp.spec] | |
98c1c668 | 9185 | |
03d0f4af MM |
9186 | No program shall explicitly instantiate any template more |
9187 | than once. | |
9188 | ||
2aaf816d JM |
9189 | We check DECL_INTERFACE_KNOWN so as not to complain when the first |
9190 | instantiation was `extern' and the second is not, and EXTERN_P for | |
9191 | the opposite case. If -frepo, chances are we already got marked | |
9192 | as an explicit instantion because of the repo file. */ | |
9193 | if (DECL_INTERFACE_KNOWN (result) && !extern_p && !flag_use_repository) | |
6f1b4c42 | 9194 | cp_pedwarn ("duplicate explicit instantiation of `%#D'", result); |
03d0f4af MM |
9195 | |
9196 | /* If we've already instantiated the template, just return now. */ | |
9197 | if (DECL_INTERFACE_KNOWN (result)) | |
9198 | return; | |
9199 | } | |
9200 | else if (!DECL_IMPLICIT_INSTANTIATION (result)) | |
faae18ab | 9201 | { |
8251199e | 9202 | cp_error ("no matching template for `%D' found", result); |
faae18ab MS |
9203 | return; |
9204 | } | |
03d0f4af | 9205 | else if (!DECL_TEMPLATE_INFO (result)) |
6633d636 | 9206 | { |
8251199e | 9207 | cp_pedwarn ("explicit instantiation of non-template `%#D'", result); |
6633d636 MS |
9208 | return; |
9209 | } | |
9210 | ||
a0a33927 MS |
9211 | if (flag_external_templates) |
9212 | return; | |
9213 | ||
f0e01782 | 9214 | if (storage == NULL_TREE) |
00595019 | 9215 | ; |
faae18ab | 9216 | else if (storage == ridpointers[(int) RID_EXTERN]) |
03d0f4af MM |
9217 | { |
9218 | if (pedantic) | |
cab1f180 | 9219 | cp_pedwarn ("ISO C++ forbids the use of `extern' on explicit instantiations"); |
03d0f4af MM |
9220 | extern_p = 1; |
9221 | } | |
f0e01782 | 9222 | else |
8251199e | 9223 | cp_error ("storage class `%D' applied to template instantiation", |
f0e01782 | 9224 | storage); |
5566b478 | 9225 | |
03d0f4af | 9226 | SET_DECL_EXPLICIT_INSTANTIATION (result); |
5566b478 | 9227 | mark_decl_instantiated (result, extern_p); |
44a8d0b3 | 9228 | repo_template_instantiated (result, extern_p); |
c91a56d2 | 9229 | if (! extern_p) |
16d53b64 | 9230 | instantiate_decl (result, /*defer_ok=*/1); |
7177d104 MS |
9231 | } |
9232 | ||
faae18ab MS |
9233 | void |
9234 | mark_class_instantiated (t, extern_p) | |
9235 | tree t; | |
9236 | int extern_p; | |
9237 | { | |
9238 | SET_CLASSTYPE_EXPLICIT_INSTANTIATION (t); | |
eb773359 JM |
9239 | SET_CLASSTYPE_INTERFACE_KNOWN (t); |
9240 | CLASSTYPE_INTERFACE_ONLY (t) = extern_p; | |
faae18ab MS |
9241 | CLASSTYPE_VTABLE_NEEDS_WRITING (t) = ! extern_p; |
9242 | TYPE_DECL_SUPPRESS_DEBUG (TYPE_NAME (t)) = extern_p; | |
9243 | if (! extern_p) | |
9244 | { | |
9245 | CLASSTYPE_DEBUG_REQUESTED (t) = 1; | |
9246 | rest_of_type_compilation (t, 1); | |
9247 | } | |
9248 | } | |
e8abc66f | 9249 | |
7177d104 | 9250 | void |
ca79f85d JM |
9251 | do_type_instantiation (t, storage) |
9252 | tree t, storage; | |
7177d104 | 9253 | { |
e8abc66f MS |
9254 | int extern_p = 0; |
9255 | int nomem_p = 0; | |
5566b478 MS |
9256 | int static_p = 0; |
9257 | ||
ca79f85d JM |
9258 | if (TREE_CODE (t) == TYPE_DECL) |
9259 | t = TREE_TYPE (t); | |
9260 | ||
7ddedda4 | 9261 | if (! CLASS_TYPE_P (t) || ! CLASSTYPE_TEMPLATE_INFO (t)) |
ca79f85d | 9262 | { |
8251199e | 9263 | cp_error ("explicit instantiation of non-template type `%T'", t); |
ca79f85d JM |
9264 | return; |
9265 | } | |
9266 | ||
5566b478 | 9267 | complete_type (t); |
7177d104 | 9268 | |
a292b002 MS |
9269 | /* With -fexternal-templates, explicit instantiations are treated the same |
9270 | as implicit ones. */ | |
a0a33927 MS |
9271 | if (flag_external_templates) |
9272 | return; | |
9273 | ||
d0f062fb | 9274 | if (!COMPLETE_TYPE_P (t)) |
f0e01782 | 9275 | { |
8251199e | 9276 | cp_error ("explicit instantiation of `%#T' before definition of template", |
f0e01782 MS |
9277 | t); |
9278 | return; | |
9279 | } | |
9280 | ||
03d0f4af | 9281 | if (storage != NULL_TREE) |
f0e01782 | 9282 | { |
03d0f4af | 9283 | if (pedantic) |
cab1f180 | 9284 | cp_pedwarn("ISO C++ forbids the use of `%s' on explicit instantiations", |
8251199e | 9285 | IDENTIFIER_POINTER (storage)); |
03d0f4af MM |
9286 | |
9287 | if (storage == ridpointers[(int) RID_INLINE]) | |
9288 | nomem_p = 1; | |
9289 | else if (storage == ridpointers[(int) RID_EXTERN]) | |
9290 | extern_p = 1; | |
9291 | else if (storage == ridpointers[(int) RID_STATIC]) | |
9292 | static_p = 1; | |
9293 | else | |
9294 | { | |
8251199e | 9295 | cp_error ("storage class `%D' applied to template instantiation", |
03d0f4af MM |
9296 | storage); |
9297 | extern_p = 0; | |
9298 | } | |
f0e01782 MS |
9299 | } |
9300 | ||
370af2d5 | 9301 | if (CLASSTYPE_TEMPLATE_SPECIALIZATION (t)) |
03d0f4af MM |
9302 | { |
9303 | /* [temp.spec] | |
a292b002 | 9304 | |
03d0f4af MM |
9305 | No program shall both explicitly instantiate and explicitly |
9306 | specialize a template. */ | |
8251199e JM |
9307 | cp_error ("explicit instantiation of `%#T' after", t); |
9308 | cp_error_at ("explicit specialization here", t); | |
03d0f4af MM |
9309 | return; |
9310 | } | |
9311 | else if (CLASSTYPE_EXPLICIT_INSTANTIATION (t)) | |
44a8d0b3 | 9312 | { |
03d0f4af MM |
9313 | /* [temp.spec] |
9314 | ||
9315 | No program shall explicitly instantiate any template more | |
9316 | than once. | |
9317 | ||
2aaf816d JM |
9318 | If CLASSTYPE_INTERFACE_ONLY, then the first explicit instantiation |
9319 | was `extern'. If EXTERN_P then the second is. If -frepo, chances | |
9320 | are we already got marked as an explicit instantion because of the | |
9321 | repo file. All these cases are OK. */ | |
9322 | if (!CLASSTYPE_INTERFACE_ONLY (t) && !extern_p && !flag_use_repository) | |
9323 | cp_pedwarn ("duplicate explicit instantiation of `%#T'", t); | |
03d0f4af MM |
9324 | |
9325 | /* If we've already instantiated the template, just return now. */ | |
9326 | if (!CLASSTYPE_INTERFACE_ONLY (t)) | |
9327 | return; | |
44a8d0b3 | 9328 | } |
e8abc66f | 9329 | |
03d0f4af MM |
9330 | mark_class_instantiated (t, extern_p); |
9331 | repo_template_instantiated (t, extern_p); | |
9332 | ||
e8abc66f MS |
9333 | if (nomem_p) |
9334 | return; | |
9335 | ||
7177d104 | 9336 | { |
db5ae43f | 9337 | tree tmp; |
5566b478 | 9338 | |
03d0f4af MM |
9339 | /* In contrast to implicit instantiation, where only the |
9340 | declarations, and not the definitions, of members are | |
9341 | instantiated, we have here: | |
9342 | ||
9343 | [temp.explicit] | |
9344 | ||
9345 | The explicit instantiation of a class template specialization | |
9346 | implies the instantiation of all of its members not | |
9347 | previously explicitly specialized in the translation unit | |
9348 | containing the explicit instantiation. | |
9349 | ||
9350 | Of course, we can't instantiate member template classes, since | |
9351 | we don't have any arguments for them. Note that the standard | |
9352 | is unclear on whether the instatiation of the members are | |
9353 | *explicit* instantiations or not. We choose to be generous, | |
9354 | and not set DECL_EXPLICIT_INSTANTIATION. Therefore, we allow | |
9355 | the explicit instantiation of a class where some of the members | |
9356 | have no definition in the current translation unit. */ | |
9357 | ||
5566b478 MS |
9358 | if (! static_p) |
9359 | for (tmp = TYPE_METHODS (t); tmp; tmp = TREE_CHAIN (tmp)) | |
a7d87521 | 9360 | if (TREE_CODE (tmp) == FUNCTION_DECL |
1f109f0f | 9361 | && DECL_TEMPLATE_INSTANTIATION (tmp)) |
5566b478 MS |
9362 | { |
9363 | mark_decl_instantiated (tmp, extern_p); | |
9364 | repo_template_instantiated (tmp, extern_p); | |
9365 | if (! extern_p) | |
16d53b64 | 9366 | instantiate_decl (tmp, /*defer_ok=*/1); |
5566b478 MS |
9367 | } |
9368 | ||
9369 | for (tmp = TYPE_FIELDS (t); tmp; tmp = TREE_CHAIN (tmp)) | |
9370 | if (TREE_CODE (tmp) == VAR_DECL && DECL_TEMPLATE_INSTANTIATION (tmp)) | |
863adfc0 | 9371 | { |
5566b478 | 9372 | mark_decl_instantiated (tmp, extern_p); |
863adfc0 | 9373 | repo_template_instantiated (tmp, extern_p); |
5566b478 | 9374 | if (! extern_p) |
16d53b64 | 9375 | instantiate_decl (tmp, /*defer_ok=*/1); |
863adfc0 | 9376 | } |
7177d104 | 9377 | |
a292b002 | 9378 | for (tmp = CLASSTYPE_TAGS (t); tmp; tmp = TREE_CHAIN (tmp)) |
e4a84209 MM |
9379 | if (IS_AGGR_TYPE (TREE_VALUE (tmp)) |
9380 | && !uses_template_parms (CLASSTYPE_TI_ARGS (TREE_VALUE (tmp)))) | |
f376e137 | 9381 | do_type_instantiation (TYPE_MAIN_DECL (TREE_VALUE (tmp)), storage); |
a292b002 | 9382 | } |
8d08fdba | 9383 | } |
a28e3c7f | 9384 | |
36a117a5 MM |
9385 | /* Given a function DECL, which is a specialization of TMPL, modify |
9386 | DECL to be a re-instantiation of TMPL with the same template | |
9387 | arguments. TMPL should be the template into which tsubst'ing | |
9388 | should occur for DECL, not the most general template. | |
830bfa74 MM |
9389 | |
9390 | One reason for doing this is a scenario like this: | |
9391 | ||
9392 | template <class T> | |
9393 | void f(const T&, int i); | |
9394 | ||
9395 | void g() { f(3, 7); } | |
9396 | ||
9397 | template <class T> | |
9398 | void f(const T& t, const int i) { } | |
9399 | ||
9400 | Note that when the template is first instantiated, with | |
9401 | instantiate_template, the resulting DECL will have no name for the | |
9402 | first parameter, and the wrong type for the second. So, when we go | |
9403 | to instantiate the DECL, we regenerate it. */ | |
9404 | ||
e9659ab0 | 9405 | static void |
830bfa74 MM |
9406 | regenerate_decl_from_template (decl, tmpl) |
9407 | tree decl; | |
9408 | tree tmpl; | |
9409 | { | |
f9a7ae04 MM |
9410 | /* The most general version of TMPL. */ |
9411 | tree gen_tmpl; | |
9412 | /* The arguments used to instantiate DECL, from the most general | |
9413 | template. */ | |
830bfa74 | 9414 | tree args; |
830bfa74 MM |
9415 | tree code_pattern; |
9416 | tree new_decl; | |
36a117a5 | 9417 | int unregistered; |
830bfa74 MM |
9418 | |
9419 | args = DECL_TI_ARGS (decl); | |
9420 | code_pattern = DECL_TEMPLATE_RESULT (tmpl); | |
9421 | ||
8251199e JM |
9422 | /* Unregister the specialization so that when we tsubst we will not |
9423 | just return DECL. We don't have to unregister DECL from TMPL | |
9424 | because if would only be registered there if it were a partial | |
9425 | instantiation of a specialization, which it isn't: it's a full | |
9426 | instantiation. */ | |
36a117a5 MM |
9427 | gen_tmpl = most_general_template (tmpl); |
9428 | unregistered = unregister_specialization (decl, gen_tmpl); | |
9429 | ||
9430 | /* If the DECL was not unregistered then something peculiar is | |
9431 | happening: we created a specialization but did not call | |
9432 | register_specialization for it. */ | |
9433 | my_friendly_assert (unregistered, 0); | |
9434 | ||
61a127b3 MM |
9435 | if (TREE_CODE (decl) == VAR_DECL) |
9436 | /* Make sure that we can see identifiers, and compute access | |
9437 | correctly, for the class members used in the declaration of | |
9438 | this static variable. */ | |
9439 | pushclass (DECL_CONTEXT (decl), 2); | |
9440 | ||
d8c4447d | 9441 | /* Do the substitution to get the new declaration. */ |
4393e105 | 9442 | new_decl = tsubst (code_pattern, args, /*complain=*/1, NULL_TREE); |
830bfa74 MM |
9443 | |
9444 | if (TREE_CODE (decl) == VAR_DECL) | |
9445 | { | |
9446 | /* Set up DECL_INITIAL, since tsubst doesn't. */ | |
830bfa74 | 9447 | DECL_INITIAL (new_decl) = |
d8c4447d | 9448 | tsubst_expr (DECL_INITIAL (code_pattern), args, |
4393e105 | 9449 | /*complain=*/1, DECL_TI_TEMPLATE (decl)); |
61a127b3 | 9450 | /* Pop the class context we pushed above. */ |
b74a0560 | 9451 | popclass (); |
830bfa74 | 9452 | } |
2b0a63a3 | 9453 | else if (TREE_CODE (decl) == FUNCTION_DECL) |
fbf1c34b MM |
9454 | { |
9455 | /* Convince duplicate_decls to use the DECL_ARGUMENTS from the | |
9456 | new decl. */ | |
9457 | DECL_INITIAL (new_decl) = error_mark_node; | |
9458 | /* And don't complain about a duplicate definition. */ | |
9459 | DECL_INITIAL (decl) = NULL_TREE; | |
9460 | } | |
36a117a5 MM |
9461 | |
9462 | /* The immediate parent of the new template is still whatever it was | |
9463 | before, even though tsubst sets DECL_TI_TEMPLATE up as the most | |
9464 | general template. We also reset the DECL_ASSEMBLER_NAME since | |
9465 | tsubst always calculates the name as if the function in question | |
9466 | were really a template instance, and sometimes, with friend | |
9467 | functions, this is not so. See tsubst_friend_function for | |
9468 | details. */ | |
9469 | DECL_TI_TEMPLATE (new_decl) = DECL_TI_TEMPLATE (decl); | |
9470 | DECL_ASSEMBLER_NAME (new_decl) = DECL_ASSEMBLER_NAME (decl); | |
9471 | DECL_RTL (new_decl) = DECL_RTL (decl); | |
459c43ad | 9472 | DECL_USE_TEMPLATE (new_decl) = DECL_USE_TEMPLATE (decl); |
36a117a5 MM |
9473 | |
9474 | /* Call duplicate decls to merge the old and new declarations. */ | |
830bfa74 MM |
9475 | duplicate_decls (new_decl, decl); |
9476 | ||
36a117a5 MM |
9477 | /* Now, re-register the specialization. */ |
9478 | register_specialization (decl, gen_tmpl, args); | |
830bfa74 MM |
9479 | } |
9480 | ||
16d53b64 MM |
9481 | /* Produce the definition of D, a _DECL generated from a template. If |
9482 | DEFER_OK is non-zero, then we don't have to actually do the | |
9483 | instantiation now; we just have to do it sometime. */ | |
f84b4be9 | 9484 | |
a28e3c7f | 9485 | tree |
16d53b64 | 9486 | instantiate_decl (d, defer_ok) |
5566b478 | 9487 | tree d; |
16d53b64 | 9488 | int defer_ok; |
a28e3c7f | 9489 | { |
36a117a5 MM |
9490 | tree tmpl = DECL_TI_TEMPLATE (d); |
9491 | tree args = DECL_TI_ARGS (d); | |
830bfa74 | 9492 | tree td; |
36a117a5 MM |
9493 | tree code_pattern; |
9494 | tree spec; | |
9495 | tree gen_tmpl; | |
5566b478 | 9496 | int pattern_defined; |
c27be9b9 | 9497 | int line = lineno; |
3b304f5b | 9498 | const char *file = input_filename; |
5566b478 | 9499 | |
36a117a5 MM |
9500 | /* This function should only be used to instantiate templates for |
9501 | functions and static member variables. */ | |
9502 | my_friendly_assert (TREE_CODE (d) == FUNCTION_DECL | |
9503 | || TREE_CODE (d) == VAR_DECL, 0); | |
9504 | ||
db9b2174 MM |
9505 | /* Don't instantiate cloned functions. Instead, instantiate the |
9506 | functions they cloned. */ | |
9507 | if (TREE_CODE (d) == FUNCTION_DECL && DECL_CLONED_FUNCTION_P (d)) | |
9508 | d = DECL_CLONED_FUNCTION (d); | |
9509 | ||
fbf1c34b | 9510 | if (DECL_TEMPLATE_INSTANTIATED (d)) |
03d0f4af MM |
9511 | /* D has already been instantiated. It might seem reasonable to |
9512 | check whether or not D is an explict instantiation, and, if so, | |
9513 | stop here. But when an explicit instantiation is deferred | |
9514 | until the end of the compilation, DECL_EXPLICIT_INSTANTIATION | |
9515 | is set, even though we still need to do the instantiation. */ | |
36a117a5 MM |
9516 | return d; |
9517 | ||
9518 | /* If we already have a specialization of this declaration, then | |
9519 | there's no reason to instantiate it. Note that | |
9520 | retrieve_specialization gives us both instantiations and | |
9521 | specializations, so we must explicitly check | |
9522 | DECL_TEMPLATE_SPECIALIZATION. */ | |
9523 | gen_tmpl = most_general_template (tmpl); | |
9524 | spec = retrieve_specialization (gen_tmpl, args); | |
9525 | if (spec != NULL_TREE && DECL_TEMPLATE_SPECIALIZATION (spec)) | |
9526 | return spec; | |
9527 | ||
9528 | /* This needs to happen before any tsubsting. */ | |
9529 | if (! push_tinst_level (d)) | |
9530 | return d; | |
9531 | ||
297a5329 JM |
9532 | timevar_push (TV_PARSE); |
9533 | ||
4d85e00e MM |
9534 | /* Set TD to the template whose DECL_TEMPLATE_RESULT is the pattern |
9535 | for the instantiation. This is not always the most general | |
9536 | template. Consider, for example: | |
9537 | ||
9538 | template <class T> | |
9539 | struct S { template <class U> void f(); | |
9540 | template <> void f<int>(); }; | |
9541 | ||
9542 | and an instantiation of S<double>::f<int>. We want TD to be the | |
9543 | specialization S<T>::f<int>, not the more general S<T>::f<U>. */ | |
9544 | td = tmpl; | |
f9a7ae04 MM |
9545 | while (/* An instantiation cannot have a definition, so we need a |
9546 | more general template. */ | |
9547 | DECL_TEMPLATE_INSTANTIATION (td) | |
9548 | /* We must also deal with friend templates. Given: | |
9549 | ||
9550 | template <class T> struct S { | |
9551 | template <class U> friend void f() {}; | |
9552 | }; | |
9553 | ||
9554 | S<int>::f<U> say, is not an instantiation of S<T>::f<U>, | |
9555 | so far as the language is concerned, but that's still | |
9556 | where we get the pattern for the instantiation from. On | |
9557 | ther hand, if the definition comes outside the class, say: | |
9558 | ||
9559 | template <class T> struct S { | |
9560 | template <class U> friend void f(); | |
9561 | }; | |
9562 | template <class U> friend void f() {} | |
9563 | ||
9564 | we don't need to look any further. That's what the check for | |
9565 | DECL_INITIAL is for. */ | |
9566 | || (TREE_CODE (d) == FUNCTION_DECL | |
9567 | && DECL_FRIEND_PSEUDO_TEMPLATE_INSTANTIATION (td) | |
9568 | && !DECL_INITIAL (DECL_TEMPLATE_RESULT (td)))) | |
4d85e00e MM |
9569 | { |
9570 | /* The present template, TD, should not be a definition. If it | |
9571 | were a definition, we should be using it! Note that we | |
9572 | cannot restructure the loop to just keep going until we find | |
9573 | a template with a definition, since that might go too far if | |
9574 | a specialization was declared, but not defined. */ | |
4d85e00e MM |
9575 | my_friendly_assert (!(TREE_CODE (d) == VAR_DECL |
9576 | && !DECL_IN_AGGR_P (DECL_TEMPLATE_RESULT (td))), | |
9577 | 0); | |
9578 | ||
9579 | /* Fetch the more general template. */ | |
9580 | td = DECL_TI_TEMPLATE (td); | |
9581 | } | |
27bb8339 | 9582 | |
fee23f54 | 9583 | code_pattern = DECL_TEMPLATE_RESULT (td); |
27bb8339 | 9584 | |
5566b478 | 9585 | if (TREE_CODE (d) == FUNCTION_DECL) |
39c76b4f | 9586 | pattern_defined = (DECL_SAVED_TREE (code_pattern) != NULL_TREE); |
5566b478 | 9587 | else |
36a117a5 | 9588 | pattern_defined = ! DECL_IN_AGGR_P (code_pattern); |
de22184b MS |
9589 | |
9590 | push_to_top_level (); | |
9591 | lineno = DECL_SOURCE_LINE (d); | |
9592 | input_filename = DECL_SOURCE_FILE (d); | |
9593 | ||
de22184b | 9594 | if (pattern_defined) |
5566b478 MS |
9595 | { |
9596 | repo_template_used (d); | |
9597 | ||
9598 | if (flag_external_templates && ! DECL_INTERFACE_KNOWN (d)) | |
9599 | { | |
9600 | if (flag_alt_external_templates) | |
9601 | { | |
9602 | if (interface_unknown) | |
9603 | warn_if_unknown_interface (d); | |
9604 | } | |
fee23f54 | 9605 | else if (DECL_INTERFACE_KNOWN (code_pattern)) |
5566b478 MS |
9606 | { |
9607 | DECL_INTERFACE_KNOWN (d) = 1; | |
fee23f54 | 9608 | DECL_NOT_REALLY_EXTERN (d) = ! DECL_EXTERNAL (code_pattern); |
5566b478 MS |
9609 | } |
9610 | else | |
fee23f54 | 9611 | warn_if_unknown_interface (code_pattern); |
5566b478 MS |
9612 | } |
9613 | ||
e92cc029 | 9614 | if (at_eof) |
5566b478 MS |
9615 | import_export_decl (d); |
9616 | } | |
9617 | ||
c4ae3f91 JM |
9618 | /* Reject all external templates except inline functions. */ |
9619 | if (DECL_INTERFACE_KNOWN (d) | |
9620 | && ! DECL_NOT_REALLY_EXTERN (d) | |
9621 | && ! (TREE_CODE (d) == FUNCTION_DECL && DECL_INLINE (d))) | |
9622 | goto out; | |
9623 | ||
16d53b64 MM |
9624 | /* We need to set up DECL_INITIAL regardless of pattern_defined if |
9625 | the variable is a static const initialized in the class body. */ | |
67ffc812 | 9626 | if (TREE_CODE (d) == VAR_DECL |
711734a9 | 9627 | && TREE_READONLY (d) |
67ffc812 MM |
9628 | && DECL_INITIAL (d) == NULL_TREE |
9629 | && DECL_INITIAL (code_pattern) != NULL_TREE) | |
16d53b64 MM |
9630 | ; |
9631 | /* Defer all other templates, unless we have been explicitly | |
9632 | forbidden from doing so. We restore the source position here | |
9633 | because it's used by add_pending_template. */ | |
9634 | else if (! pattern_defined || defer_ok) | |
9635 | { | |
c27be9b9 JM |
9636 | lineno = line; |
9637 | input_filename = file; | |
9638 | ||
03d0f4af MM |
9639 | if (at_eof && !pattern_defined |
9640 | && DECL_EXPLICIT_INSTANTIATION (d)) | |
9641 | /* [temp.explicit] | |
9642 | ||
9643 | The definition of a non-exported function template, a | |
9644 | non-exported member function template, or a non-exported | |
9645 | member function or static data member of a class template | |
9646 | shall be present in every translation unit in which it is | |
9647 | explicitly instantiated. */ | |
8251199e | 9648 | cp_error ("explicit instantiation of `%D' but no definition available", |
03d0f4af MM |
9649 | d); |
9650 | ||
5566b478 | 9651 | add_pending_template (d); |
de22184b | 9652 | goto out; |
5566b478 MS |
9653 | } |
9654 | ||
2b0a63a3 MM |
9655 | /* We're now committed to instantiating this template. Mark it as |
9656 | instantiated so that recursive calls to instantiate_decl do not | |
9657 | try to instantiate it again. */ | |
fbf1c34b | 9658 | DECL_TEMPLATE_INSTANTIATED (d) = 1; |
120722ac | 9659 | |
2b0a63a3 MM |
9660 | /* Regenerate the declaration in case the template has been modified |
9661 | by a subsequent redeclaration. */ | |
9662 | regenerate_decl_from_template (d, td); | |
9663 | ||
120722ac MM |
9664 | /* We already set the file and line above. Reset them now in case |
9665 | they changed as a result of calling regenerate_decl_from_template. */ | |
5156628f MS |
9666 | lineno = DECL_SOURCE_LINE (d); |
9667 | input_filename = DECL_SOURCE_FILE (d); | |
9668 | ||
5566b478 MS |
9669 | if (TREE_CODE (d) == VAR_DECL) |
9670 | { | |
9671 | DECL_IN_AGGR_P (d) = 0; | |
9672 | if (DECL_INTERFACE_KNOWN (d)) | |
9673 | DECL_EXTERNAL (d) = ! DECL_NOT_REALLY_EXTERN (d); | |
9674 | else | |
9675 | { | |
9676 | DECL_EXTERNAL (d) = 1; | |
9677 | DECL_NOT_REALLY_EXTERN (d) = 1; | |
9678 | } | |
cd9f6678 | 9679 | cp_finish_decl (d, DECL_INITIAL (d), NULL_TREE, 0); |
5566b478 MS |
9680 | } |
9681 | else if (TREE_CODE (d) == FUNCTION_DECL) | |
9682 | { | |
6bbf1598 MM |
9683 | htab_t saved_local_specializations; |
9684 | ||
9685 | /* Save away the current list, in case we are instantiating one | |
9686 | template from within the body of another. */ | |
9687 | saved_local_specializations = local_specializations; | |
9688 | ||
6dfbb909 | 9689 | /* Set up the list of local specializations. */ |
6dfbb909 MM |
9690 | local_specializations = htab_create (37, |
9691 | htab_hash_pointer, | |
9692 | htab_eq_pointer, | |
9693 | NULL); | |
9694 | ||
558475f0 | 9695 | /* Set up context. */ |
a8f73d4b | 9696 | start_function (NULL_TREE, d, NULL_TREE, SF_PRE_PARSED); |
5566b478 MS |
9697 | store_parm_decls (); |
9698 | ||
f9817201 MM |
9699 | /* We already set up __FUNCTION__, etc., so we don't want to do |
9700 | it again now. */ | |
9701 | current_function_name_declared = 1; | |
9702 | ||
558475f0 MM |
9703 | /* Substitute into the body of the function. */ |
9704 | tsubst_expr (DECL_SAVED_TREE (code_pattern), args, | |
9705 | /*complain=*/1, tmpl); | |
9706 | ||
6dfbb909 MM |
9707 | /* We don't need the local specializations any more. */ |
9708 | htab_delete (local_specializations); | |
6bbf1598 | 9709 | local_specializations = saved_local_specializations; |
6dfbb909 | 9710 | |
4d6abc1c | 9711 | /* Finish the function. */ |
0acf7199 | 9712 | expand_body (finish_function (0)); |
5566b478 MS |
9713 | } |
9714 | ||
971cbc14 MM |
9715 | /* We're not deferring instantiation any more. */ |
9716 | TI_PENDING_TEMPLATE_FLAG (DECL_TEMPLATE_INFO (d)) = 0; | |
9717 | ||
de22184b | 9718 | out: |
c27be9b9 JM |
9719 | lineno = line; |
9720 | input_filename = file; | |
9721 | ||
5566b478 | 9722 | pop_from_top_level (); |
5566b478 | 9723 | pop_tinst_level (); |
a28e3c7f | 9724 | |
297a5329 JM |
9725 | timevar_pop (TV_PARSE); |
9726 | ||
a28e3c7f MS |
9727 | return d; |
9728 | } | |
5566b478 | 9729 | |
0aafb128 MM |
9730 | /* Run through the list of templates that we wish we could |
9731 | instantiate, and instantiate any we can. */ | |
9732 | ||
9733 | int | |
9734 | instantiate_pending_templates () | |
9735 | { | |
9736 | tree *t; | |
9737 | int instantiated_something = 0; | |
9738 | int reconsider; | |
9739 | ||
9740 | do | |
9741 | { | |
9742 | reconsider = 0; | |
9743 | ||
9744 | t = &pending_templates; | |
9745 | while (*t) | |
9746 | { | |
0aafb128 MM |
9747 | tree instantiation = TREE_VALUE (*t); |
9748 | ||
3ae18eaf | 9749 | reopen_tinst_level (TREE_PURPOSE (*t)); |
0aafb128 | 9750 | |
2f939d94 | 9751 | if (TYPE_P (instantiation)) |
0aafb128 MM |
9752 | { |
9753 | tree fn; | |
9754 | ||
d0f062fb | 9755 | if (!COMPLETE_TYPE_P (instantiation)) |
0aafb128 MM |
9756 | { |
9757 | instantiate_class_template (instantiation); | |
9758 | if (CLASSTYPE_TEMPLATE_INSTANTIATION (instantiation)) | |
9759 | for (fn = TYPE_METHODS (instantiation); | |
9760 | fn; | |
9761 | fn = TREE_CHAIN (fn)) | |
9762 | if (! DECL_ARTIFICIAL (fn)) | |
16d53b64 | 9763 | instantiate_decl (fn, /*defer_ok=*/0); |
d0f062fb | 9764 | if (COMPLETE_TYPE_P (instantiation)) |
0aafb128 MM |
9765 | { |
9766 | instantiated_something = 1; | |
9767 | reconsider = 1; | |
9768 | } | |
9769 | } | |
9770 | ||
d0f062fb | 9771 | if (COMPLETE_TYPE_P (instantiation)) |
0aafb128 MM |
9772 | /* If INSTANTIATION has been instantiated, then we don't |
9773 | need to consider it again in the future. */ | |
9774 | *t = TREE_CHAIN (*t); | |
9775 | else | |
9776 | t = &TREE_CHAIN (*t); | |
9777 | } | |
9778 | else | |
9779 | { | |
16d53b64 | 9780 | if (!DECL_TEMPLATE_SPECIALIZATION (instantiation) |
0aafb128 MM |
9781 | && !DECL_TEMPLATE_INSTANTIATED (instantiation)) |
9782 | { | |
16d53b64 MM |
9783 | instantiation = instantiate_decl (instantiation, |
9784 | /*defer_ok=*/0); | |
0aafb128 MM |
9785 | if (DECL_TEMPLATE_INSTANTIATED (instantiation)) |
9786 | { | |
9787 | instantiated_something = 1; | |
9788 | reconsider = 1; | |
9789 | } | |
9790 | } | |
9791 | ||
16d53b64 | 9792 | if (DECL_TEMPLATE_SPECIALIZATION (instantiation) |
0aafb128 MM |
9793 | || DECL_TEMPLATE_INSTANTIATED (instantiation)) |
9794 | /* If INSTANTIATION has been instantiated, then we don't | |
9795 | need to consider it again in the future. */ | |
9796 | *t = TREE_CHAIN (*t); | |
9797 | else | |
9798 | t = &TREE_CHAIN (*t); | |
9799 | } | |
9800 | } | |
9801 | template_tail = t; | |
9802 | ||
9803 | /* Go through the things that are template instantiations if we are | |
9804 | using guiding declarations. */ | |
9805 | t = &maybe_templates; | |
9806 | while (*t) | |
9807 | { | |
9808 | tree template; | |
9809 | tree fn; | |
9810 | tree args; | |
9811 | ||
9812 | fn = TREE_VALUE (*t); | |
9813 | ||
9814 | if (DECL_INITIAL (fn)) | |
9815 | /* If the FN is already defined, then it was either already | |
9816 | instantiated or, even though guiding declarations were | |
9817 | allowed, a non-template definition was provided. */ | |
9818 | ; | |
9819 | else | |
9820 | { | |
9821 | template = TREE_PURPOSE (*t); | |
9822 | args = get_bindings (template, fn, NULL_TREE); | |
9823 | fn = instantiate_template (template, args); | |
16d53b64 | 9824 | instantiate_decl (fn, /*defer_ok=*/0); |
0aafb128 MM |
9825 | reconsider = 1; |
9826 | } | |
9827 | ||
9828 | /* Remove this entry from the chain. */ | |
9829 | *t = TREE_CHAIN (*t); | |
9830 | } | |
9831 | maybe_template_tail = t; | |
9832 | } | |
9833 | while (reconsider); | |
9834 | ||
9835 | return instantiated_something; | |
9836 | } | |
9837 | ||
fd74ca0b MM |
9838 | /* Substitute ARGVEC into T, which is a list of initializers for |
9839 | either base class or a non-static data member. The TREE_PURPOSEs | |
9840 | are DECLs, and the TREE_VALUEs are the initializer values. Used by | |
9841 | instantiate_decl. */ | |
4393e105 | 9842 | |
824b9a4c | 9843 | static tree |
fd74ca0b | 9844 | tsubst_initializer_list (t, argvec) |
5566b478 MS |
9845 | tree t, argvec; |
9846 | { | |
9847 | tree first = NULL_TREE; | |
9848 | tree *p = &first; | |
9849 | ||
9850 | for (; t; t = TREE_CHAIN (t)) | |
9851 | { | |
fd74ca0b MM |
9852 | tree decl; |
9853 | tree init; | |
9854 | tree val; | |
9855 | ||
9856 | decl = tsubst_copy (TREE_PURPOSE (t), argvec, /*complain=*/1, | |
9857 | NULL_TREE); | |
9858 | init = tsubst_expr (TREE_VALUE (t), argvec, /*complain=*/1, | |
9859 | NULL_TREE); | |
9860 | ||
9861 | if (!init) | |
9862 | ; | |
9863 | else if (TREE_CODE (init) == TREE_LIST) | |
9864 | for (val = init; val; val = TREE_CHAIN (val)) | |
9865 | TREE_VALUE (val) = convert_from_reference (TREE_VALUE (val)); | |
9866 | else | |
9867 | init = convert_from_reference (init); | |
9868 | ||
9869 | *p = build_tree_list (decl, init); | |
5566b478 MS |
9870 | p = &TREE_CHAIN (*p); |
9871 | } | |
9872 | return first; | |
9873 | } | |
9874 | ||
73aad9b9 JM |
9875 | /* D is an undefined function declaration in the presence of templates with |
9876 | the same name, listed in FNS. If one of them can produce D as an | |
9877 | instantiation, remember this so we can instantiate it at EOF if D has | |
9878 | not been defined by that time. */ | |
9879 | ||
9880 | void | |
9881 | add_maybe_template (d, fns) | |
9882 | tree d, fns; | |
9883 | { | |
9884 | tree t; | |
9885 | ||
9886 | if (DECL_MAYBE_TEMPLATE (d)) | |
9887 | return; | |
9888 | ||
e1467ff2 | 9889 | t = most_specialized (fns, d, NULL_TREE); |
73aad9b9 JM |
9890 | if (! t) |
9891 | return; | |
9892 | if (t == error_mark_node) | |
9893 | { | |
8251199e | 9894 | cp_error ("ambiguous template instantiation for `%D'", d); |
73aad9b9 JM |
9895 | return; |
9896 | } | |
9897 | ||
e1b3e07d | 9898 | *maybe_template_tail = tree_cons (t, d, NULL_TREE); |
73aad9b9 JM |
9899 | maybe_template_tail = &TREE_CHAIN (*maybe_template_tail); |
9900 | DECL_MAYBE_TEMPLATE (d) = 1; | |
9901 | } | |
b87692e5 | 9902 | |
61a127b3 MM |
9903 | /* Set CURRENT_ACCESS_SPECIFIER based on the protection of DECL. */ |
9904 | ||
9905 | static void | |
9906 | set_current_access_from_decl (decl) | |
9907 | tree decl; | |
9908 | { | |
9909 | if (TREE_PRIVATE (decl)) | |
9910 | current_access_specifier = access_private_node; | |
9911 | else if (TREE_PROTECTED (decl)) | |
9912 | current_access_specifier = access_protected_node; | |
9913 | else | |
9914 | current_access_specifier = access_public_node; | |
9915 | } | |
9916 | ||
dbfe2124 MM |
9917 | /* Instantiate an enumerated type. TAG is the template type, NEWTAG |
9918 | is the instantiation (which should have been created with | |
9919 | start_enum) and ARGS are the template arguments to use. */ | |
b87692e5 | 9920 | |
dbfe2124 MM |
9921 | static void |
9922 | tsubst_enum (tag, newtag, args) | |
9923 | tree tag; | |
9924 | tree newtag; | |
9925 | tree args; | |
b87692e5 | 9926 | { |
dbfe2124 | 9927 | tree e; |
b87692e5 MS |
9928 | |
9929 | for (e = TYPE_VALUES (tag); e; e = TREE_CHAIN (e)) | |
9930 | { | |
61a127b3 | 9931 | tree value; |
58595203 | 9932 | |
61a127b3 MM |
9933 | /* Note that in a template enum, the TREE_VALUE is the |
9934 | CONST_DECL, not the corresponding INTEGER_CST. */ | |
9935 | value = tsubst_expr (DECL_INITIAL (TREE_VALUE (e)), | |
4393e105 MM |
9936 | args, /*complain=*/1, |
9937 | NULL_TREE); | |
61a127b3 MM |
9938 | |
9939 | /* Give this enumeration constant the correct access. */ | |
9940 | set_current_access_from_decl (TREE_VALUE (e)); | |
9941 | ||
9942 | /* Actually build the enumerator itself. */ | |
58595203 | 9943 | build_enumerator (TREE_PURPOSE (e), value, newtag); |
dbfe2124 | 9944 | } |
b3d5a58b | 9945 | |
dbfe2124 | 9946 | finish_enum (newtag); |
b87692e5 | 9947 | } |
36a117a5 | 9948 | |
1f6e1acc AS |
9949 | /* DECL is a FUNCTION_DECL that is a template specialization. Return |
9950 | its type -- but without substituting the innermost set of template | |
9951 | arguments. So, innermost set of template parameters will appear in | |
9952 | the type. If CONTEXTP is non-NULL, then the partially substituted | |
9953 | DECL_CONTEXT (if any) will also be filled in. Similarly, TPARMSP | |
9954 | will be filled in with the substituted template parameters, if it | |
9955 | is non-NULL. */ | |
9956 | ||
9957 | tree | |
9958 | get_mostly_instantiated_function_type (decl, contextp, tparmsp) | |
9959 | tree decl; | |
9960 | tree *contextp; | |
9961 | tree *tparmsp; | |
9962 | { | |
9963 | tree context = NULL_TREE; | |
9964 | tree fn_type; | |
9965 | tree tmpl; | |
9966 | tree targs; | |
9967 | tree tparms; | |
9968 | int parm_depth; | |
9969 | ||
9970 | tmpl = most_general_template (DECL_TI_TEMPLATE (decl)); | |
9971 | targs = DECL_TI_ARGS (decl); | |
9972 | tparms = DECL_TEMPLATE_PARMS (tmpl); | |
9973 | parm_depth = TMPL_PARMS_DEPTH (tparms); | |
9974 | ||
9975 | /* There should be as many levels of arguments as there are levels | |
9976 | of parameters. */ | |
9977 | my_friendly_assert (parm_depth == TMPL_ARGS_DEPTH (targs), 0); | |
9978 | ||
9979 | fn_type = TREE_TYPE (tmpl); | |
9980 | if (DECL_STATIC_FUNCTION_P (decl)) | |
9981 | context = DECL_CONTEXT (decl); | |
9982 | ||
9983 | if (parm_depth == 1) | |
9984 | /* No substitution is necessary. */ | |
9985 | ; | |
9986 | else | |
9987 | { | |
9988 | int i; | |
9989 | tree partial_args; | |
9990 | ||
9991 | /* Replace the innermost level of the TARGS with NULL_TREEs to | |
9992 | let tsubst know not to subsitute for those parameters. */ | |
9993 | partial_args = make_tree_vec (TREE_VEC_LENGTH (targs)); | |
9994 | for (i = 1; i < TMPL_ARGS_DEPTH (targs); ++i) | |
9995 | SET_TMPL_ARGS_LEVEL (partial_args, i, | |
9996 | TMPL_ARGS_LEVEL (targs, i)); | |
9997 | SET_TMPL_ARGS_LEVEL (partial_args, | |
9998 | TMPL_ARGS_DEPTH (targs), | |
9999 | make_tree_vec (DECL_NTPARMS (tmpl))); | |
10000 | ||
10001 | /* Now, do the (partial) substitution to figure out the | |
10002 | appropriate function type. */ | |
10003 | fn_type = tsubst (fn_type, partial_args, /*complain=*/1, NULL_TREE); | |
10004 | if (DECL_STATIC_FUNCTION_P (decl)) | |
10005 | context = tsubst (context, partial_args, /*complain=*/1, NULL_TREE); | |
10006 | ||
10007 | /* Substitute into the template parameters to obtain the real | |
10008 | innermost set of parameters. This step is important if the | |
10009 | innermost set of template parameters contains value | |
10010 | parameters whose types depend on outer template parameters. */ | |
10011 | TREE_VEC_LENGTH (partial_args)--; | |
10012 | tparms = tsubst_template_parms (tparms, partial_args, /*complain=*/1); | |
10013 | } | |
10014 | ||
10015 | if (contextp) | |
10016 | *contextp = context; | |
10017 | if (tparmsp) | |
10018 | *tparmsp = tparms; | |
10019 | ||
10020 | return fn_type; | |
10021 | } | |
669ec2b4 JM |
10022 | |
10023 | /* Set the DECL_ASSEMBLER_NAME for DECL, which is a FUNCTION_DECL that | |
10024 | is either an instantiation or specialization of a template | |
10025 | function. */ | |
10026 | ||
10027 | static void | |
10028 | set_mangled_name_for_template_decl (decl) | |
10029 | tree decl; | |
10030 | { | |
10031 | tree context = NULL_TREE; | |
10032 | tree fn_type; | |
10033 | tree ret_type; | |
10034 | tree parm_types; | |
10035 | tree tparms; | |
10036 | tree targs; | |
10037 | ||
10038 | my_friendly_assert (TREE_CODE (decl) == FUNCTION_DECL, 0); | |
10039 | my_friendly_assert (DECL_TEMPLATE_INFO (decl) != NULL_TREE, 0); | |
10040 | ||
10041 | /* Under the new ABI, we don't need special machinery. */ | |
10042 | if (flag_new_abi) | |
10043 | { | |
10044 | set_mangled_name_for_decl (decl); | |
10045 | return; | |
10046 | } | |
10047 | ||
10048 | /* The names of template functions must be mangled so as to indicate | |
10049 | what template is being specialized with what template arguments. | |
10050 | For example, each of the following three functions must get | |
10051 | different mangled names: | |
10052 | ||
10053 | void f(int); | |
10054 | template <> void f<7>(int); | |
10055 | template <> void f<8>(int); */ | |
10056 | ||
10057 | targs = DECL_TI_ARGS (decl); | |
10058 | if (uses_template_parms (targs)) | |
10059 | /* This DECL is for a partial instantiation. There's no need to | |
10060 | mangle the name of such an entity. */ | |
10061 | return; | |
10062 | ||
10063 | /* We now compute the PARMS and RET_TYPE to give to | |
10064 | build_decl_overload_real. The PARMS and RET_TYPE are the | |
10065 | parameter and return types of the template, after all but the | |
10066 | innermost template arguments have been substituted, not the | |
10067 | parameter and return types of the function DECL. For example, | |
10068 | given: | |
10069 | ||
10070 | template <class T> T f(T); | |
10071 | ||
10072 | both PARMS and RET_TYPE should be `T' even if DECL is `int f(int)'. | |
10073 | A more subtle example is: | |
10074 | ||
10075 | template <class T> struct S { template <class U> void f(T, U); } | |
10076 | ||
10077 | Here, if DECL is `void S<int>::f(int, double)', PARMS should be | |
10078 | {int, U}. Thus, the args that we want to subsitute into the | |
10079 | return and parameter type for the function are those in TARGS, | |
10080 | with the innermost level omitted. */ | |
10081 | fn_type = get_mostly_instantiated_function_type (decl, &context, &tparms); | |
10082 | ||
10083 | /* Now, get the innermost parameters and arguments, and figure out | |
10084 | the parameter and return types. */ | |
10085 | tparms = INNERMOST_TEMPLATE_PARMS (tparms); | |
10086 | targs = INNERMOST_TEMPLATE_ARGS (targs); | |
10087 | ret_type = TREE_TYPE (fn_type); | |
10088 | parm_types = TYPE_ARG_TYPES (fn_type); | |
10089 | ||
10090 | /* For a static member function, we generate a fake `this' pointer, | |
10091 | for the purposes of mangling. This indicates of which class the | |
10092 | function is a member. Because of: | |
10093 | ||
10094 | [class.static] | |
10095 | ||
10096 | There shall not be a static and a nonstatic member function | |
10097 | with the same name and the same parameter types | |
10098 | ||
10099 | we don't have to worry that this will result in a clash with a | |
10100 | non-static member function. */ | |
10101 | if (DECL_STATIC_FUNCTION_P (decl)) | |
10102 | parm_types = hash_tree_chain (build_pointer_type (context), parm_types); | |
10103 | ||
10104 | /* There should be the same number of template parameters as | |
10105 | template arguments. */ | |
10106 | my_friendly_assert (TREE_VEC_LENGTH (tparms) == TREE_VEC_LENGTH (targs), | |
10107 | 0); | |
10108 | ||
10109 | /* Actually set the DECL_ASSEMBLER_NAME. */ | |
10110 | DECL_ASSEMBLER_NAME (decl) | |
10111 | = build_decl_overload_real (decl, parm_types, ret_type, | |
10112 | tparms, targs, | |
10113 | DECL_FUNCTION_MEMBER_P (decl) | |
10114 | + DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (decl)); | |
10115 | } |