]>
Commit | Line | Data |
---|---|---|
1 | /* Handle parameterized types (templates) for GNU C++. | |
2 | Copyright (C) 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000, | |
3 | 2001 Free Software Foundation, Inc. | |
4 | Written by Ken Raeburn (raeburn@cygnus.com) while at Watchmaker Computing. | |
5 | Rewritten by Jason Merrill (jason@cygnus.com). | |
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 | |
21 | the Free Software Foundation, 59 Temple Place - Suite 330, | |
22 | Boston, MA 02111-1307, USA. */ | |
23 | ||
24 | /* Known bugs or deficiencies include: | |
25 | ||
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". */ | |
28 | ||
29 | #include "config.h" | |
30 | #include "system.h" | |
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" | |
38 | #include "lex.h" | |
39 | #include "output.h" | |
40 | #include "except.h" | |
41 | #include "toplev.h" | |
42 | #include "rtl.h" | |
43 | #include "ggc.h" | |
44 | #include "timevar.h" | |
45 | ||
46 | /* The type of functions taking a tree, and some additional data, and | |
47 | returning an int. */ | |
48 | typedef int (*tree_fn_t) PARAMS ((tree, void*)); | |
49 | ||
50 | extern struct obstack permanent_obstack; | |
51 | ||
52 | /* The PENDING_TEMPLATES is a TREE_LIST of templates whose | |
53 | instantiations have been deferred, either because their definitions | |
54 | were not yet available, or because we were putting off doing the | |
55 | work. The TREE_PURPOSE of each entry is a SRCLOC indicating where | |
56 | the instantiate request occurred; the TREE_VALUE is a either a DECL | |
57 | (for a function or static data member), or a TYPE (for a class) | |
58 | indicating what we are hoping to instantiate. */ | |
59 | static tree pending_templates; | |
60 | static tree *template_tail = &pending_templates; | |
61 | ||
62 | static tree maybe_templates; | |
63 | static tree *maybe_template_tail = &maybe_templates; | |
64 | ||
65 | int processing_template_parmlist; | |
66 | static int template_header_count; | |
67 | ||
68 | static tree saved_trees; | |
69 | static varray_type inline_parm_levels; | |
70 | static size_t inline_parm_levels_used; | |
71 | ||
72 | static tree current_tinst_level; | |
73 | ||
74 | /* A map from local variable declarations in the body of the template | |
75 | presently being instantiated to the corresponding instantiated | |
76 | local variables. */ | |
77 | static htab_t local_specializations; | |
78 | ||
79 | #define obstack_chunk_alloc xmalloc | |
80 | #define obstack_chunk_free free | |
81 | ||
82 | #define UNIFY_ALLOW_NONE 0 | |
83 | #define UNIFY_ALLOW_MORE_CV_QUAL 1 | |
84 | #define UNIFY_ALLOW_LESS_CV_QUAL 2 | |
85 | #define UNIFY_ALLOW_DERIVED 4 | |
86 | #define UNIFY_ALLOW_INTEGER 8 | |
87 | #define UNIFY_ALLOW_OUTER_LEVEL 16 | |
88 | #define UNIFY_ALLOW_OUTER_MORE_CV_QUAL 32 | |
89 | #define UNIFY_ALLOW_OUTER_LESS_CV_QUAL 64 | |
90 | ||
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 | ||
97 | static int resolve_overloaded_unification PARAMS ((tree, tree, tree, tree, | |
98 | unification_kind_t, int)); | |
99 | static int try_one_overload PARAMS ((tree, tree, tree, tree, tree, | |
100 | unification_kind_t, int)); | |
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)); | |
104 | static void reopen_tinst_level PARAMS ((tree)); | |
105 | static tree classtype_mangled_name PARAMS ((tree)); | |
106 | static char *mangle_class_name_for_template PARAMS ((const char *, tree, tree)); | |
107 | static tree tsubst_initializer_list PARAMS ((tree, tree)); | |
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 int maybe_adjust_types_for_deduction PARAMS ((unification_kind_t, tree*, | |
115 | tree*)); | |
116 | static int type_unification_real PARAMS ((tree, tree, tree, tree, | |
117 | int, unification_kind_t, int, int)); | |
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, | |
122 | int , tree)); | |
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)); | |
129 | static tree retrieve_local_specialization PARAMS ((tree)); | |
130 | static tree register_specialization PARAMS ((tree, tree, tree)); | |
131 | static void register_local_specialization PARAMS ((tree, tree)); | |
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, int, 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)); | |
147 | static void set_mangled_name_for_template_decl PARAMS ((tree)); | |
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)); | |
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, | |
159 | tree, tree, tree, int)); | |
160 | static tree get_template_base PARAMS ((tree, tree, tree, tree)); | |
161 | static int verify_class_unification PARAMS ((tree, tree, tree)); | |
162 | static tree try_class_unification PARAMS ((tree, tree, tree, tree)); | |
163 | static int coerce_template_template_parms PARAMS ((tree, tree, int, | |
164 | tree, tree)); | |
165 | static tree determine_specialization PARAMS ((tree, tree, tree *, int)); | |
166 | static int template_args_equal PARAMS ((tree, tree)); | |
167 | static void tsubst_default_arguments PARAMS ((tree)); | |
168 | static tree for_each_template_parm_r PARAMS ((tree *, int *, void *)); | |
169 | static tree instantiate_clone PARAMS ((tree, tree)); | |
170 | static tree copy_default_args_to_explicit_spec_1 PARAMS ((tree, tree)); | |
171 | static void copy_default_args_to_explicit_spec PARAMS ((tree)); | |
172 | static int invalid_nontype_parm_type_p PARAMS ((tree, int)); | |
173 | ||
174 | /* Called once to initialize pt.c. */ | |
175 | ||
176 | void | |
177 | init_pt () | |
178 | { | |
179 | ggc_add_tree_root (&pending_templates, 1); | |
180 | ggc_add_tree_root (&maybe_templates, 1); | |
181 | ggc_add_tree_root (&saved_trees, 1); | |
182 | ggc_add_tree_root (¤t_tinst_level, 1); | |
183 | } | |
184 | ||
185 | /* Do any processing required when DECL (a member template declaration | |
186 | using TEMPLATE_PARAMETERS as its innermost parameter list) is | |
187 | finished. Returns the TEMPLATE_DECL corresponding to DECL, unless | |
188 | it is a specialization, in which case the DECL itself is returned. */ | |
189 | ||
190 | tree | |
191 | finish_member_template_decl (decl) | |
192 | tree decl; | |
193 | { | |
194 | if (decl == NULL_TREE || decl == void_type_node) | |
195 | return NULL_TREE; | |
196 | else if (decl == error_mark_node) | |
197 | /* By returning NULL_TREE, the parser will just ignore this | |
198 | declaration. We have already issued the error. */ | |
199 | return NULL_TREE; | |
200 | else if (TREE_CODE (decl) == TREE_LIST) | |
201 | { | |
202 | /* Assume that the class is the only declspec. */ | |
203 | decl = TREE_VALUE (decl); | |
204 | if (IS_AGGR_TYPE (decl) && CLASSTYPE_TEMPLATE_INFO (decl) | |
205 | && ! CLASSTYPE_TEMPLATE_SPECIALIZATION (decl)) | |
206 | { | |
207 | tree tmpl = CLASSTYPE_TI_TEMPLATE (decl); | |
208 | check_member_template (tmpl); | |
209 | return tmpl; | |
210 | } | |
211 | return NULL_TREE; | |
212 | } | |
213 | else if (TREE_CODE (decl) == FIELD_DECL) | |
214 | cp_error ("data member `%D' cannot be a member template", decl); | |
215 | else if (DECL_TEMPLATE_INFO (decl)) | |
216 | { | |
217 | if (!DECL_TEMPLATE_SPECIALIZATION (decl)) | |
218 | { | |
219 | check_member_template (DECL_TI_TEMPLATE (decl)); | |
220 | return DECL_TI_TEMPLATE (decl); | |
221 | } | |
222 | else | |
223 | return decl; | |
224 | } | |
225 | else | |
226 | cp_error ("invalid member template declaration `%D'", decl); | |
227 | ||
228 | return error_mark_node; | |
229 | } | |
230 | ||
231 | /* Returns the template nesting level of the indicated class TYPE. | |
232 | ||
233 | For example, in: | |
234 | template <class T> | |
235 | struct A | |
236 | { | |
237 | template <class U> | |
238 | struct B {}; | |
239 | }; | |
240 | ||
241 | A<T>::B<U> has depth two, while A<T> has depth one. | |
242 | Both A<T>::B<int> and A<int>::B<U> have depth one, if | |
243 | COUNT_SPECIALIZATIONS is 0 or if they are instantiations, not | |
244 | specializations. | |
245 | ||
246 | This function is guaranteed to return 0 if passed NULL_TREE so | |
247 | that, for example, `template_class_depth (current_class_type)' is | |
248 | always safe. */ | |
249 | ||
250 | static int | |
251 | template_class_depth_real (type, count_specializations) | |
252 | tree type; | |
253 | int count_specializations; | |
254 | { | |
255 | int depth; | |
256 | ||
257 | for (depth = 0; | |
258 | type && TREE_CODE (type) != NAMESPACE_DECL; | |
259 | type = (TREE_CODE (type) == FUNCTION_DECL) | |
260 | ? CP_DECL_CONTEXT (type) : TYPE_CONTEXT (type)) | |
261 | { | |
262 | if (TREE_CODE (type) != FUNCTION_DECL) | |
263 | { | |
264 | if (CLASSTYPE_TEMPLATE_INFO (type) | |
265 | && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (type)) | |
266 | && ((count_specializations | |
267 | && CLASSTYPE_TEMPLATE_SPECIALIZATION (type)) | |
268 | || uses_template_parms (CLASSTYPE_TI_ARGS (type)))) | |
269 | ++depth; | |
270 | } | |
271 | else | |
272 | { | |
273 | if (DECL_TEMPLATE_INFO (type) | |
274 | && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (type)) | |
275 | && ((count_specializations | |
276 | && DECL_TEMPLATE_SPECIALIZATION (type)) | |
277 | || uses_template_parms (DECL_TI_ARGS (type)))) | |
278 | ++depth; | |
279 | } | |
280 | } | |
281 | ||
282 | return depth; | |
283 | } | |
284 | ||
285 | /* Returns the template nesting level of the indicated class TYPE. | |
286 | Like template_class_depth_real, but instantiations do not count in | |
287 | the depth. */ | |
288 | ||
289 | int | |
290 | template_class_depth (type) | |
291 | tree type; | |
292 | { | |
293 | return template_class_depth_real (type, /*count_specializations=*/0); | |
294 | } | |
295 | ||
296 | /* Returns 1 if processing DECL as part of do_pending_inlines | |
297 | needs us to push template parms. */ | |
298 | ||
299 | static int | |
300 | inline_needs_template_parms (decl) | |
301 | tree decl; | |
302 | { | |
303 | if (! DECL_TEMPLATE_INFO (decl)) | |
304 | return 0; | |
305 | ||
306 | return (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (most_general_template (decl))) | |
307 | > (processing_template_decl + DECL_TEMPLATE_SPECIALIZATION (decl))); | |
308 | } | |
309 | ||
310 | /* Subroutine of maybe_begin_member_template_processing. | |
311 | Push the template parms in PARMS, starting from LEVELS steps into the | |
312 | chain, and ending at the beginning, since template parms are listed | |
313 | innermost first. */ | |
314 | ||
315 | static void | |
316 | push_inline_template_parms_recursive (parmlist, levels) | |
317 | tree parmlist; | |
318 | int levels; | |
319 | { | |
320 | tree parms = TREE_VALUE (parmlist); | |
321 | int i; | |
322 | ||
323 | if (levels > 1) | |
324 | push_inline_template_parms_recursive (TREE_CHAIN (parmlist), levels - 1); | |
325 | ||
326 | ++processing_template_decl; | |
327 | current_template_parms | |
328 | = tree_cons (size_int (processing_template_decl), | |
329 | parms, current_template_parms); | |
330 | TEMPLATE_PARMS_FOR_INLINE (current_template_parms) = 1; | |
331 | ||
332 | pushlevel (0); | |
333 | for (i = 0; i < TREE_VEC_LENGTH (parms); ++i) | |
334 | { | |
335 | tree parm = TREE_VALUE (TREE_VEC_ELT (parms, i)); | |
336 | my_friendly_assert (DECL_P (parm), 0); | |
337 | ||
338 | switch (TREE_CODE (parm)) | |
339 | { | |
340 | case TYPE_DECL: | |
341 | case TEMPLATE_DECL: | |
342 | pushdecl (parm); | |
343 | break; | |
344 | ||
345 | case PARM_DECL: | |
346 | { | |
347 | /* Make a CONST_DECL as is done in process_template_parm. | |
348 | It is ugly that we recreate this here; the original | |
349 | version built in process_template_parm is no longer | |
350 | available. */ | |
351 | tree decl = build_decl (CONST_DECL, DECL_NAME (parm), | |
352 | TREE_TYPE (parm)); | |
353 | DECL_ARTIFICIAL (decl) = 1; | |
354 | DECL_INITIAL (decl) = DECL_INITIAL (parm); | |
355 | SET_DECL_TEMPLATE_PARM_P (decl); | |
356 | pushdecl (decl); | |
357 | } | |
358 | break; | |
359 | ||
360 | default: | |
361 | my_friendly_abort (0); | |
362 | } | |
363 | } | |
364 | } | |
365 | ||
366 | /* Restore the template parameter context for a member template or | |
367 | a friend template defined in a class definition. */ | |
368 | ||
369 | void | |
370 | maybe_begin_member_template_processing (decl) | |
371 | tree decl; | |
372 | { | |
373 | tree parms; | |
374 | int levels = 0; | |
375 | ||
376 | if (inline_needs_template_parms (decl)) | |
377 | { | |
378 | parms = DECL_TEMPLATE_PARMS (most_general_template (decl)); | |
379 | levels = TMPL_PARMS_DEPTH (parms) - processing_template_decl; | |
380 | ||
381 | if (DECL_TEMPLATE_SPECIALIZATION (decl)) | |
382 | { | |
383 | --levels; | |
384 | parms = TREE_CHAIN (parms); | |
385 | } | |
386 | ||
387 | push_inline_template_parms_recursive (parms, levels); | |
388 | } | |
389 | ||
390 | /* Remember how many levels of template parameters we pushed so that | |
391 | we can pop them later. */ | |
392 | if (!inline_parm_levels) | |
393 | VARRAY_INT_INIT (inline_parm_levels, 4, "inline_parm_levels"); | |
394 | if (inline_parm_levels_used == inline_parm_levels->num_elements) | |
395 | VARRAY_GROW (inline_parm_levels, 2 * inline_parm_levels_used); | |
396 | VARRAY_INT (inline_parm_levels, inline_parm_levels_used) = levels; | |
397 | ++inline_parm_levels_used; | |
398 | } | |
399 | ||
400 | /* Undo the effects of begin_member_template_processing. */ | |
401 | ||
402 | void | |
403 | maybe_end_member_template_processing () | |
404 | { | |
405 | int i; | |
406 | ||
407 | if (!inline_parm_levels_used) | |
408 | return; | |
409 | ||
410 | --inline_parm_levels_used; | |
411 | for (i = 0; | |
412 | i < VARRAY_INT (inline_parm_levels, inline_parm_levels_used); | |
413 | ++i) | |
414 | { | |
415 | --processing_template_decl; | |
416 | current_template_parms = TREE_CHAIN (current_template_parms); | |
417 | poplevel (0, 0, 0); | |
418 | } | |
419 | } | |
420 | ||
421 | /* Returns non-zero iff T is a member template function. We must be | |
422 | careful as in | |
423 | ||
424 | template <class T> class C { void f(); } | |
425 | ||
426 | Here, f is a template function, and a member, but not a member | |
427 | template. This function does not concern itself with the origin of | |
428 | T, only its present state. So if we have | |
429 | ||
430 | template <class T> class C { template <class U> void f(U); } | |
431 | ||
432 | then neither C<int>::f<char> nor C<T>::f<double> is considered | |
433 | to be a member template. But, `template <class U> void | |
434 | C<int>::f(U)' is considered a member template. */ | |
435 | ||
436 | int | |
437 | is_member_template (t) | |
438 | tree t; | |
439 | { | |
440 | if (!DECL_FUNCTION_TEMPLATE_P (t)) | |
441 | /* Anything that isn't a function or a template function is | |
442 | certainly not a member template. */ | |
443 | return 0; | |
444 | ||
445 | /* A local class can't have member templates. */ | |
446 | if (decl_function_context (t)) | |
447 | return 0; | |
448 | ||
449 | return (DECL_FUNCTION_MEMBER_P (DECL_TEMPLATE_RESULT (t)) | |
450 | /* If there are more levels of template parameters than | |
451 | there are template classes surrounding the declaration, | |
452 | then we have a member template. */ | |
453 | && (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (t)) > | |
454 | template_class_depth (DECL_CONTEXT (t)))); | |
455 | } | |
456 | ||
457 | #if 0 /* UNUSED */ | |
458 | /* Returns non-zero iff T is a member template class. See | |
459 | is_member_template for a description of what precisely constitutes | |
460 | a member template. */ | |
461 | ||
462 | int | |
463 | is_member_template_class (t) | |
464 | tree t; | |
465 | { | |
466 | if (!DECL_CLASS_TEMPLATE_P (t)) | |
467 | /* Anything that isn't a class template, is certainly not a member | |
468 | template. */ | |
469 | return 0; | |
470 | ||
471 | if (!DECL_CLASS_SCOPE_P (t)) | |
472 | /* Anything whose context isn't a class type is surely not a | |
473 | member template. */ | |
474 | return 0; | |
475 | ||
476 | /* If there are more levels of template parameters than there are | |
477 | template classes surrounding the declaration, then we have a | |
478 | member template. */ | |
479 | return (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (t)) > | |
480 | template_class_depth (DECL_CONTEXT (t))); | |
481 | } | |
482 | #endif | |
483 | ||
484 | /* Return a new template argument vector which contains all of ARGS, | |
485 | but has as its innermost set of arguments the EXTRA_ARGS. */ | |
486 | ||
487 | static tree | |
488 | add_to_template_args (args, extra_args) | |
489 | tree args; | |
490 | tree extra_args; | |
491 | { | |
492 | tree new_args; | |
493 | int extra_depth; | |
494 | int i; | |
495 | int j; | |
496 | ||
497 | extra_depth = TMPL_ARGS_DEPTH (extra_args); | |
498 | new_args = make_tree_vec (TMPL_ARGS_DEPTH (args) + extra_depth); | |
499 | ||
500 | for (i = 1; i <= TMPL_ARGS_DEPTH (args); ++i) | |
501 | SET_TMPL_ARGS_LEVEL (new_args, i, TMPL_ARGS_LEVEL (args, i)); | |
502 | ||
503 | for (j = 1; j <= extra_depth; ++j, ++i) | |
504 | SET_TMPL_ARGS_LEVEL (new_args, i, TMPL_ARGS_LEVEL (extra_args, j)); | |
505 | ||
506 | return new_args; | |
507 | } | |
508 | ||
509 | /* Like add_to_template_args, but only the outermost ARGS are added to | |
510 | the EXTRA_ARGS. In particular, all but TMPL_ARGS_DEPTH | |
511 | (EXTRA_ARGS) levels are added. This function is used to combine | |
512 | the template arguments from a partial instantiation with the | |
513 | template arguments used to attain the full instantiation from the | |
514 | partial instantiation. */ | |
515 | ||
516 | static tree | |
517 | add_outermost_template_args (args, extra_args) | |
518 | tree args; | |
519 | tree extra_args; | |
520 | { | |
521 | tree new_args; | |
522 | ||
523 | /* If there are more levels of EXTRA_ARGS than there are ARGS, | |
524 | something very fishy is going on. */ | |
525 | my_friendly_assert (TMPL_ARGS_DEPTH (args) >= TMPL_ARGS_DEPTH (extra_args), | |
526 | 0); | |
527 | ||
528 | /* If *all* the new arguments will be the EXTRA_ARGS, just return | |
529 | them. */ | |
530 | if (TMPL_ARGS_DEPTH (args) == TMPL_ARGS_DEPTH (extra_args)) | |
531 | return extra_args; | |
532 | ||
533 | /* For the moment, we make ARGS look like it contains fewer levels. */ | |
534 | TREE_VEC_LENGTH (args) -= TMPL_ARGS_DEPTH (extra_args); | |
535 | ||
536 | new_args = add_to_template_args (args, extra_args); | |
537 | ||
538 | /* Now, we restore ARGS to its full dimensions. */ | |
539 | TREE_VEC_LENGTH (args) += TMPL_ARGS_DEPTH (extra_args); | |
540 | ||
541 | return new_args; | |
542 | } | |
543 | ||
544 | /* Return the N levels of innermost template arguments from the ARGS. */ | |
545 | ||
546 | tree | |
547 | get_innermost_template_args (args, n) | |
548 | tree args; | |
549 | int n; | |
550 | { | |
551 | tree new_args; | |
552 | int extra_levels; | |
553 | int i; | |
554 | ||
555 | my_friendly_assert (n >= 0, 20000603); | |
556 | ||
557 | /* If N is 1, just return the innermost set of template arguments. */ | |
558 | if (n == 1) | |
559 | return TMPL_ARGS_LEVEL (args, TMPL_ARGS_DEPTH (args)); | |
560 | ||
561 | /* If we're not removing anything, just return the arguments we were | |
562 | given. */ | |
563 | extra_levels = TMPL_ARGS_DEPTH (args) - n; | |
564 | my_friendly_assert (extra_levels >= 0, 20000603); | |
565 | if (extra_levels == 0) | |
566 | return args; | |
567 | ||
568 | /* Make a new set of arguments, not containing the outer arguments. */ | |
569 | new_args = make_tree_vec (n); | |
570 | for (i = 1; i <= n; ++i) | |
571 | SET_TMPL_ARGS_LEVEL (new_args, i, | |
572 | TMPL_ARGS_LEVEL (args, i + extra_levels)); | |
573 | ||
574 | return new_args; | |
575 | } | |
576 | ||
577 | /* We've got a template header coming up; push to a new level for storing | |
578 | the parms. */ | |
579 | ||
580 | void | |
581 | begin_template_parm_list () | |
582 | { | |
583 | /* We use a non-tag-transparent scope here, which causes pushtag to | |
584 | put tags in this scope, rather than in the enclosing class or | |
585 | namespace scope. This is the right thing, since we want | |
586 | TEMPLATE_DECLS, and not TYPE_DECLS for template classes. For a | |
587 | global template class, push_template_decl handles putting the | |
588 | TEMPLATE_DECL into top-level scope. For a nested template class, | |
589 | e.g.: | |
590 | ||
591 | template <class T> struct S1 { | |
592 | template <class T> struct S2 {}; | |
593 | }; | |
594 | ||
595 | pushtag contains special code to call pushdecl_with_scope on the | |
596 | TEMPLATE_DECL for S2. */ | |
597 | begin_scope (sk_template_parms); | |
598 | ++processing_template_decl; | |
599 | ++processing_template_parmlist; | |
600 | note_template_header (0); | |
601 | } | |
602 | ||
603 | /* This routine is called when a specialization is declared. If it is | |
604 | illegal to declare a specialization here, an error is reported. */ | |
605 | ||
606 | static void | |
607 | check_specialization_scope () | |
608 | { | |
609 | tree scope = current_scope (); | |
610 | ||
611 | /* [temp.expl.spec] | |
612 | ||
613 | An explicit specialization shall be declared in the namespace of | |
614 | which the template is a member, or, for member templates, in the | |
615 | namespace of which the enclosing class or enclosing class | |
616 | template is a member. An explicit specialization of a member | |
617 | function, member class or static data member of a class template | |
618 | shall be declared in the namespace of which the class template | |
619 | is a member. */ | |
620 | if (scope && TREE_CODE (scope) != NAMESPACE_DECL) | |
621 | cp_error ("explicit specialization in non-namespace scope `%D'", | |
622 | scope); | |
623 | ||
624 | /* [temp.expl.spec] | |
625 | ||
626 | In an explicit specialization declaration for a member of a class | |
627 | template or a member template that appears in namespace scope, | |
628 | the member template and some of its enclosing class templates may | |
629 | remain unspecialized, except that the declaration shall not | |
630 | explicitly specialize a class member template if its enclosing | |
631 | class templates are not explicitly specialized as well. */ | |
632 | if (current_template_parms) | |
633 | cp_error ("enclosing class templates are not explicitly specialized"); | |
634 | } | |
635 | ||
636 | /* We've just seen template <>. */ | |
637 | ||
638 | void | |
639 | begin_specialization () | |
640 | { | |
641 | begin_scope (sk_template_spec); | |
642 | note_template_header (1); | |
643 | check_specialization_scope (); | |
644 | } | |
645 | ||
646 | /* Called at then end of processing a declaration preceded by | |
647 | template<>. */ | |
648 | ||
649 | void | |
650 | end_specialization () | |
651 | { | |
652 | finish_scope (); | |
653 | reset_specialization (); | |
654 | } | |
655 | ||
656 | /* Any template <>'s that we have seen thus far are not referring to a | |
657 | function specialization. */ | |
658 | ||
659 | void | |
660 | reset_specialization () | |
661 | { | |
662 | processing_specialization = 0; | |
663 | template_header_count = 0; | |
664 | } | |
665 | ||
666 | /* We've just seen a template header. If SPECIALIZATION is non-zero, | |
667 | it was of the form template <>. */ | |
668 | ||
669 | static void | |
670 | note_template_header (specialization) | |
671 | int specialization; | |
672 | { | |
673 | processing_specialization = specialization; | |
674 | template_header_count++; | |
675 | } | |
676 | ||
677 | /* We're beginning an explicit instantiation. */ | |
678 | ||
679 | void | |
680 | begin_explicit_instantiation () | |
681 | { | |
682 | ++processing_explicit_instantiation; | |
683 | } | |
684 | ||
685 | ||
686 | void | |
687 | end_explicit_instantiation () | |
688 | { | |
689 | my_friendly_assert(processing_explicit_instantiation > 0, 0); | |
690 | --processing_explicit_instantiation; | |
691 | } | |
692 | ||
693 | /* The TYPE is being declared. If it is a template type, that means it | |
694 | is a partial specialization. Do appropriate error-checking. */ | |
695 | ||
696 | void | |
697 | maybe_process_partial_specialization (type) | |
698 | tree type; | |
699 | { | |
700 | if (IS_AGGR_TYPE (type) && CLASSTYPE_USE_TEMPLATE (type)) | |
701 | { | |
702 | if (CLASSTYPE_IMPLICIT_INSTANTIATION (type) | |
703 | && !COMPLETE_TYPE_P (type)) | |
704 | { | |
705 | if (current_namespace | |
706 | != decl_namespace_context (CLASSTYPE_TI_TEMPLATE (type))) | |
707 | { | |
708 | cp_pedwarn ("specializing `%#T' in different namespace", type); | |
709 | cp_pedwarn_at (" from definition of `%#D'", | |
710 | CLASSTYPE_TI_TEMPLATE (type)); | |
711 | } | |
712 | SET_CLASSTYPE_TEMPLATE_SPECIALIZATION (type); | |
713 | if (processing_template_decl) | |
714 | push_template_decl (TYPE_MAIN_DECL (type)); | |
715 | } | |
716 | else if (CLASSTYPE_TEMPLATE_INSTANTIATION (type)) | |
717 | cp_error ("specialization of `%T' after instantiation", type); | |
718 | } | |
719 | else if (processing_specialization) | |
720 | cp_error ("explicit specialization of non-template `%T'", type); | |
721 | } | |
722 | ||
723 | /* Retrieve the specialization (in the sense of [temp.spec] - a | |
724 | specialization is either an instantiation or an explicit | |
725 | specialization) of TMPL for the given template ARGS. If there is | |
726 | no such specialization, return NULL_TREE. The ARGS are a vector of | |
727 | arguments, or a vector of vectors of arguments, in the case of | |
728 | templates with more than one level of parameters. */ | |
729 | ||
730 | static tree | |
731 | retrieve_specialization (tmpl, args) | |
732 | tree tmpl; | |
733 | tree args; | |
734 | { | |
735 | tree s; | |
736 | ||
737 | my_friendly_assert (TREE_CODE (tmpl) == TEMPLATE_DECL, 0); | |
738 | ||
739 | /* There should be as many levels of arguments as there are | |
740 | levels of parameters. */ | |
741 | my_friendly_assert (TMPL_ARGS_DEPTH (args) | |
742 | == TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl)), | |
743 | 0); | |
744 | ||
745 | for (s = DECL_TEMPLATE_SPECIALIZATIONS (tmpl); | |
746 | s != NULL_TREE; | |
747 | s = TREE_CHAIN (s)) | |
748 | if (comp_template_args (TREE_PURPOSE (s), args)) | |
749 | return TREE_VALUE (s); | |
750 | ||
751 | return NULL_TREE; | |
752 | } | |
753 | ||
754 | /* Like retrieve_specialization, but for local declarations. */ | |
755 | ||
756 | static tree | |
757 | retrieve_local_specialization (tmpl) | |
758 | tree tmpl; | |
759 | { | |
760 | return (tree) htab_find (local_specializations, tmpl); | |
761 | } | |
762 | ||
763 | /* Returns non-zero iff DECL is a specialization of TMPL. */ | |
764 | ||
765 | int | |
766 | is_specialization_of (decl, tmpl) | |
767 | tree decl; | |
768 | tree tmpl; | |
769 | { | |
770 | tree t; | |
771 | ||
772 | if (TREE_CODE (decl) == FUNCTION_DECL) | |
773 | { | |
774 | for (t = decl; | |
775 | t != NULL_TREE; | |
776 | t = DECL_TEMPLATE_INFO (t) ? DECL_TI_TEMPLATE (t) : NULL_TREE) | |
777 | if (t == tmpl) | |
778 | return 1; | |
779 | } | |
780 | else | |
781 | { | |
782 | my_friendly_assert (TREE_CODE (decl) == TYPE_DECL, 0); | |
783 | ||
784 | for (t = TREE_TYPE (decl); | |
785 | t != NULL_TREE; | |
786 | t = CLASSTYPE_USE_TEMPLATE (t) | |
787 | ? TREE_TYPE (CLASSTYPE_TI_TEMPLATE (t)) : NULL_TREE) | |
788 | if (same_type_ignoring_top_level_qualifiers_p (t, TREE_TYPE (tmpl))) | |
789 | return 1; | |
790 | } | |
791 | ||
792 | return 0; | |
793 | } | |
794 | ||
795 | /* Register the specialization SPEC as a specialization of TMPL with | |
796 | the indicated ARGS. Returns SPEC, or an equivalent prior | |
797 | declaration, if available. */ | |
798 | ||
799 | static tree | |
800 | register_specialization (spec, tmpl, args) | |
801 | tree spec; | |
802 | tree tmpl; | |
803 | tree args; | |
804 | { | |
805 | tree s; | |
806 | ||
807 | my_friendly_assert (TREE_CODE (tmpl) == TEMPLATE_DECL, 0); | |
808 | ||
809 | if (TREE_CODE (spec) == FUNCTION_DECL | |
810 | && uses_template_parms (DECL_TI_ARGS (spec))) | |
811 | /* This is the FUNCTION_DECL for a partial instantiation. Don't | |
812 | register it; we want the corresponding TEMPLATE_DECL instead. | |
813 | We use `uses_template_parms (DECL_TI_ARGS (spec))' rather than | |
814 | the more obvious `uses_template_parms (spec)' to avoid problems | |
815 | with default function arguments. In particular, given | |
816 | something like this: | |
817 | ||
818 | template <class T> void f(T t1, T t = T()) | |
819 | ||
820 | the default argument expression is not substituted for in an | |
821 | instantiation unless and until it is actually needed. */ | |
822 | return spec; | |
823 | ||
824 | /* There should be as many levels of arguments as there are | |
825 | levels of parameters. */ | |
826 | my_friendly_assert (TMPL_ARGS_DEPTH (args) | |
827 | == TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl)), | |
828 | 0); | |
829 | ||
830 | for (s = DECL_TEMPLATE_SPECIALIZATIONS (tmpl); | |
831 | s != NULL_TREE; | |
832 | s = TREE_CHAIN (s)) | |
833 | { | |
834 | tree fn = TREE_VALUE (s); | |
835 | ||
836 | /* We can sometimes try to re-register a specialization that we've | |
837 | already got. In particular, regenerate_decl_from_template | |
838 | calls duplicate_decls which will update the specialization | |
839 | list. But, we'll still get called again here anyhow. It's | |
840 | more convenient to simply allow this than to try to prevent it. */ | |
841 | if (fn == spec) | |
842 | return spec; | |
843 | else if (comp_template_args (TREE_PURPOSE (s), args)) | |
844 | { | |
845 | if (DECL_TEMPLATE_SPECIALIZATION (spec)) | |
846 | { | |
847 | if (DECL_TEMPLATE_INSTANTIATION (fn)) | |
848 | { | |
849 | if (TREE_USED (fn) | |
850 | || DECL_EXPLICIT_INSTANTIATION (fn)) | |
851 | { | |
852 | cp_error ("specialization of %D after instantiation", | |
853 | fn); | |
854 | return spec; | |
855 | } | |
856 | else | |
857 | { | |
858 | /* This situation should occur only if the first | |
859 | specialization is an implicit instantiation, | |
860 | the second is an explicit specialization, and | |
861 | the implicit instantiation has not yet been | |
862 | used. That situation can occur if we have | |
863 | implicitly instantiated a member function and | |
864 | then specialized it later. | |
865 | ||
866 | We can also wind up here if a friend | |
867 | declaration that looked like an instantiation | |
868 | turns out to be a specialization: | |
869 | ||
870 | template <class T> void foo(T); | |
871 | class S { friend void foo<>(int) }; | |
872 | template <> void foo(int); | |
873 | ||
874 | We transform the existing DECL in place so that | |
875 | any pointers to it become pointers to the | |
876 | updated declaration. | |
877 | ||
878 | If there was a definition for the template, but | |
879 | not for the specialization, we want this to | |
880 | look as if there is no definition, and vice | |
881 | versa. */ | |
882 | DECL_INITIAL (fn) = NULL_TREE; | |
883 | duplicate_decls (spec, fn); | |
884 | ||
885 | return fn; | |
886 | } | |
887 | } | |
888 | else if (DECL_TEMPLATE_SPECIALIZATION (fn)) | |
889 | { | |
890 | duplicate_decls (spec, fn); | |
891 | return fn; | |
892 | } | |
893 | } | |
894 | } | |
895 | } | |
896 | ||
897 | DECL_TEMPLATE_SPECIALIZATIONS (tmpl) | |
898 | = tree_cons (args, spec, DECL_TEMPLATE_SPECIALIZATIONS (tmpl)); | |
899 | ||
900 | return spec; | |
901 | } | |
902 | ||
903 | /* Unregister the specialization SPEC as a specialization of TMPL. | |
904 | Returns nonzero if the SPEC was listed as a specialization of | |
905 | TMPL. */ | |
906 | ||
907 | static int | |
908 | unregister_specialization (spec, tmpl) | |
909 | tree spec; | |
910 | tree tmpl; | |
911 | { | |
912 | tree* s; | |
913 | ||
914 | for (s = &DECL_TEMPLATE_SPECIALIZATIONS (tmpl); | |
915 | *s != NULL_TREE; | |
916 | s = &TREE_CHAIN (*s)) | |
917 | if (TREE_VALUE (*s) == spec) | |
918 | { | |
919 | *s = TREE_CHAIN (*s); | |
920 | return 1; | |
921 | } | |
922 | ||
923 | return 0; | |
924 | } | |
925 | ||
926 | /* Like register_specialization, but for local declarations. We are | |
927 | registering SPEC, an instantiation of TMPL. */ | |
928 | ||
929 | static void | |
930 | register_local_specialization (spec, tmpl) | |
931 | tree spec; | |
932 | tree tmpl; | |
933 | { | |
934 | void **slot; | |
935 | ||
936 | slot = htab_find_slot (local_specializations, tmpl, INSERT); | |
937 | *slot = spec; | |
938 | } | |
939 | ||
940 | /* Print the list of candidate FNS in an error message. */ | |
941 | ||
942 | void | |
943 | print_candidates (fns) | |
944 | tree fns; | |
945 | { | |
946 | tree fn; | |
947 | ||
948 | const char *str = "candidates are:"; | |
949 | ||
950 | for (fn = fns; fn != NULL_TREE; fn = TREE_CHAIN (fn)) | |
951 | { | |
952 | tree f; | |
953 | ||
954 | for (f = TREE_VALUE (fn); f; f = OVL_NEXT (f)) | |
955 | cp_error_at ("%s %+#D", str, OVL_CURRENT (f)); | |
956 | str = " "; | |
957 | } | |
958 | } | |
959 | ||
960 | /* Returns the template (one of the functions given by TEMPLATE_ID) | |
961 | which can be specialized to match the indicated DECL with the | |
962 | explicit template args given in TEMPLATE_ID. The DECL may be | |
963 | NULL_TREE if none is available. In that case, the functions in | |
964 | TEMPLATE_ID are non-members. | |
965 | ||
966 | If NEED_MEMBER_TEMPLATE is non-zero the function is known to be a | |
967 | specialization of a member template. | |
968 | ||
969 | The template args (those explicitly specified and those deduced) | |
970 | are output in a newly created vector *TARGS_OUT. | |
971 | ||
972 | If it is impossible to determine the result, an error message is | |
973 | issued. The error_mark_node is returned to indicate failure. */ | |
974 | ||
975 | static tree | |
976 | determine_specialization (template_id, decl, targs_out, | |
977 | need_member_template) | |
978 | tree template_id; | |
979 | tree decl; | |
980 | tree* targs_out; | |
981 | int need_member_template; | |
982 | { | |
983 | tree fns; | |
984 | tree targs; | |
985 | tree explicit_targs; | |
986 | tree candidates = NULL_TREE; | |
987 | tree templates = NULL_TREE; | |
988 | ||
989 | *targs_out = NULL_TREE; | |
990 | ||
991 | if (template_id == error_mark_node) | |
992 | return error_mark_node; | |
993 | ||
994 | fns = TREE_OPERAND (template_id, 0); | |
995 | explicit_targs = TREE_OPERAND (template_id, 1); | |
996 | ||
997 | if (fns == error_mark_node) | |
998 | return error_mark_node; | |
999 | ||
1000 | /* Check for baselinks. */ | |
1001 | if (BASELINK_P (fns)) | |
1002 | fns = TREE_VALUE (fns); | |
1003 | ||
1004 | if (!is_overloaded_fn (fns)) | |
1005 | { | |
1006 | cp_error ("`%D' is not a function template", fns); | |
1007 | return error_mark_node; | |
1008 | } | |
1009 | ||
1010 | for (; fns; fns = OVL_NEXT (fns)) | |
1011 | { | |
1012 | tree tmpl; | |
1013 | ||
1014 | tree fn = OVL_CURRENT (fns); | |
1015 | ||
1016 | if (TREE_CODE (fn) == TEMPLATE_DECL) | |
1017 | /* DECL might be a specialization of FN. */ | |
1018 | tmpl = fn; | |
1019 | else if (need_member_template) | |
1020 | /* FN is an ordinary member function, and we need a | |
1021 | specialization of a member template. */ | |
1022 | continue; | |
1023 | else if (TREE_CODE (fn) != FUNCTION_DECL) | |
1024 | /* We can get IDENTIFIER_NODEs here in certain erroneous | |
1025 | cases. */ | |
1026 | continue; | |
1027 | else if (!DECL_FUNCTION_MEMBER_P (fn)) | |
1028 | /* This is just an ordinary non-member function. Nothing can | |
1029 | be a specialization of that. */ | |
1030 | continue; | |
1031 | else | |
1032 | { | |
1033 | tree decl_arg_types; | |
1034 | ||
1035 | /* This is an ordinary member function. However, since | |
1036 | we're here, we can assume it's enclosing class is a | |
1037 | template class. For example, | |
1038 | ||
1039 | template <typename T> struct S { void f(); }; | |
1040 | template <> void S<int>::f() {} | |
1041 | ||
1042 | Here, S<int>::f is a non-template, but S<int> is a | |
1043 | template class. If FN has the same type as DECL, we | |
1044 | might be in business. */ | |
1045 | if (!same_type_p (TREE_TYPE (TREE_TYPE (decl)), | |
1046 | TREE_TYPE (TREE_TYPE (fn)))) | |
1047 | /* The return types differ. */ | |
1048 | continue; | |
1049 | ||
1050 | /* Adjust the type of DECL in case FN is a static member. */ | |
1051 | decl_arg_types = TYPE_ARG_TYPES (TREE_TYPE (decl)); | |
1052 | if (DECL_STATIC_FUNCTION_P (fn) | |
1053 | && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl)) | |
1054 | decl_arg_types = TREE_CHAIN (decl_arg_types); | |
1055 | ||
1056 | if (compparms (TYPE_ARG_TYPES (TREE_TYPE (fn)), | |
1057 | decl_arg_types)) | |
1058 | /* They match! */ | |
1059 | candidates = tree_cons (NULL_TREE, fn, candidates); | |
1060 | ||
1061 | continue; | |
1062 | } | |
1063 | ||
1064 | /* See whether this function might be a specialization of this | |
1065 | template. */ | |
1066 | targs = get_bindings (tmpl, decl, explicit_targs); | |
1067 | ||
1068 | if (!targs) | |
1069 | /* We cannot deduce template arguments that when used to | |
1070 | specialize TMPL will produce DECL. */ | |
1071 | continue; | |
1072 | ||
1073 | /* Save this template, and the arguments deduced. */ | |
1074 | templates = tree_cons (targs, tmpl, templates); | |
1075 | } | |
1076 | ||
1077 | if (templates && TREE_CHAIN (templates)) | |
1078 | { | |
1079 | /* We have: | |
1080 | ||
1081 | [temp.expl.spec] | |
1082 | ||
1083 | It is possible for a specialization with a given function | |
1084 | signature to be instantiated from more than one function | |
1085 | template. In such cases, explicit specification of the | |
1086 | template arguments must be used to uniquely identify the | |
1087 | function template specialization being specialized. | |
1088 | ||
1089 | Note that here, there's no suggestion that we're supposed to | |
1090 | determine which of the candidate templates is most | |
1091 | specialized. However, we, also have: | |
1092 | ||
1093 | [temp.func.order] | |
1094 | ||
1095 | Partial ordering of overloaded function template | |
1096 | declarations is used in the following contexts to select | |
1097 | the function template to which a function template | |
1098 | specialization refers: | |
1099 | ||
1100 | -- when an explicit specialization refers to a function | |
1101 | template. | |
1102 | ||
1103 | So, we do use the partial ordering rules, at least for now. | |
1104 | This extension can only serve to make illegal programs legal, | |
1105 | so it's safe. And, there is strong anecdotal evidence that | |
1106 | the committee intended the partial ordering rules to apply; | |
1107 | the EDG front-end has that behavior, and John Spicer claims | |
1108 | that the committee simply forgot to delete the wording in | |
1109 | [temp.expl.spec]. */ | |
1110 | tree tmpl = most_specialized (templates, decl, explicit_targs); | |
1111 | if (tmpl && tmpl != error_mark_node) | |
1112 | { | |
1113 | targs = get_bindings (tmpl, decl, explicit_targs); | |
1114 | templates = tree_cons (targs, tmpl, NULL_TREE); | |
1115 | } | |
1116 | } | |
1117 | ||
1118 | if (templates == NULL_TREE && candidates == NULL_TREE) | |
1119 | { | |
1120 | cp_error_at ("template-id `%D' for `%+D' does not match any template declaration", | |
1121 | template_id, decl); | |
1122 | return error_mark_node; | |
1123 | } | |
1124 | else if ((templates && TREE_CHAIN (templates)) | |
1125 | || (candidates && TREE_CHAIN (candidates)) | |
1126 | || (templates && candidates)) | |
1127 | { | |
1128 | cp_error_at ("ambiguous template specialization `%D' for `%+D'", | |
1129 | template_id, decl); | |
1130 | chainon (candidates, templates); | |
1131 | print_candidates (candidates); | |
1132 | return error_mark_node; | |
1133 | } | |
1134 | ||
1135 | /* We have one, and exactly one, match. */ | |
1136 | if (candidates) | |
1137 | { | |
1138 | /* It was a specialization of an ordinary member function in a | |
1139 | template class. */ | |
1140 | *targs_out = copy_node (DECL_TI_ARGS (TREE_VALUE (candidates))); | |
1141 | return DECL_TI_TEMPLATE (TREE_VALUE (candidates)); | |
1142 | } | |
1143 | ||
1144 | /* It was a specialization of a template. */ | |
1145 | targs = DECL_TI_ARGS (DECL_TEMPLATE_RESULT (TREE_VALUE (templates))); | |
1146 | if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (targs)) | |
1147 | { | |
1148 | *targs_out = copy_node (targs); | |
1149 | SET_TMPL_ARGS_LEVEL (*targs_out, | |
1150 | TMPL_ARGS_DEPTH (*targs_out), | |
1151 | TREE_PURPOSE (templates)); | |
1152 | } | |
1153 | else | |
1154 | *targs_out = TREE_PURPOSE (templates); | |
1155 | return TREE_VALUE (templates); | |
1156 | } | |
1157 | ||
1158 | /* Returns a chain of parameter types, exactly like the SPEC_TYPES, | |
1159 | but with the default argument values filled in from those in the | |
1160 | TMPL_TYPES. */ | |
1161 | ||
1162 | static tree | |
1163 | copy_default_args_to_explicit_spec_1 (spec_types, | |
1164 | tmpl_types) | |
1165 | tree spec_types; | |
1166 | tree tmpl_types; | |
1167 | { | |
1168 | tree new_spec_types; | |
1169 | ||
1170 | if (!spec_types) | |
1171 | return NULL_TREE; | |
1172 | ||
1173 | if (spec_types == void_list_node) | |
1174 | return void_list_node; | |
1175 | ||
1176 | /* Substitute into the rest of the list. */ | |
1177 | new_spec_types = | |
1178 | copy_default_args_to_explicit_spec_1 (TREE_CHAIN (spec_types), | |
1179 | TREE_CHAIN (tmpl_types)); | |
1180 | ||
1181 | /* Add the default argument for this parameter. */ | |
1182 | return hash_tree_cons (TREE_PURPOSE (tmpl_types), | |
1183 | TREE_VALUE (spec_types), | |
1184 | new_spec_types); | |
1185 | } | |
1186 | ||
1187 | /* DECL is an explicit specialization. Replicate default arguments | |
1188 | from the template it specializes. (That way, code like: | |
1189 | ||
1190 | template <class T> void f(T = 3); | |
1191 | template <> void f(double); | |
1192 | void g () { f (); } | |
1193 | ||
1194 | works, as required.) An alternative approach would be to look up | |
1195 | the correct default arguments at the call-site, but this approach | |
1196 | is consistent with how implicit instantiations are handled. */ | |
1197 | ||
1198 | static void | |
1199 | copy_default_args_to_explicit_spec (decl) | |
1200 | tree decl; | |
1201 | { | |
1202 | tree tmpl; | |
1203 | tree spec_types; | |
1204 | tree tmpl_types; | |
1205 | tree new_spec_types; | |
1206 | tree old_type; | |
1207 | tree new_type; | |
1208 | tree t; | |
1209 | tree object_type = NULL_TREE; | |
1210 | tree in_charge = NULL_TREE; | |
1211 | tree vtt = NULL_TREE; | |
1212 | ||
1213 | /* See if there's anything we need to do. */ | |
1214 | tmpl = DECL_TI_TEMPLATE (decl); | |
1215 | tmpl_types = TYPE_ARG_TYPES (TREE_TYPE (DECL_TEMPLATE_RESULT (tmpl))); | |
1216 | for (t = tmpl_types; t; t = TREE_CHAIN (t)) | |
1217 | if (TREE_PURPOSE (t)) | |
1218 | break; | |
1219 | if (!t) | |
1220 | return; | |
1221 | ||
1222 | old_type = TREE_TYPE (decl); | |
1223 | spec_types = TYPE_ARG_TYPES (old_type); | |
1224 | ||
1225 | if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl)) | |
1226 | { | |
1227 | /* Remove the this pointer, but remember the object's type for | |
1228 | CV quals. */ | |
1229 | object_type = TREE_TYPE (TREE_VALUE (spec_types)); | |
1230 | spec_types = TREE_CHAIN (spec_types); | |
1231 | tmpl_types = TREE_CHAIN (tmpl_types); | |
1232 | ||
1233 | if (DECL_HAS_IN_CHARGE_PARM_P (decl)) | |
1234 | { | |
1235 | /* DECL may contain more parameters than TMPL due to the extra | |
1236 | in-charge parameter in constructors and destructors. */ | |
1237 | in_charge = spec_types; | |
1238 | spec_types = TREE_CHAIN (spec_types); | |
1239 | } | |
1240 | if (DECL_HAS_VTT_PARM_P (decl)) | |
1241 | { | |
1242 | vtt = spec_types; | |
1243 | spec_types = TREE_CHAIN (spec_types); | |
1244 | } | |
1245 | } | |
1246 | ||
1247 | /* Compute the merged default arguments. */ | |
1248 | new_spec_types = | |
1249 | copy_default_args_to_explicit_spec_1 (spec_types, tmpl_types); | |
1250 | ||
1251 | /* Compute the new FUNCTION_TYPE. */ | |
1252 | if (object_type) | |
1253 | { | |
1254 | if (vtt) | |
1255 | new_spec_types = hash_tree_cons (TREE_PURPOSE (vtt), | |
1256 | TREE_VALUE (vtt), | |
1257 | new_spec_types); | |
1258 | ||
1259 | if (in_charge) | |
1260 | /* Put the in-charge parameter back. */ | |
1261 | new_spec_types = hash_tree_cons (TREE_PURPOSE (in_charge), | |
1262 | TREE_VALUE (in_charge), | |
1263 | new_spec_types); | |
1264 | ||
1265 | new_type = build_cplus_method_type (object_type, | |
1266 | TREE_TYPE (old_type), | |
1267 | new_spec_types); | |
1268 | } | |
1269 | else | |
1270 | new_type = build_function_type (TREE_TYPE (old_type), | |
1271 | new_spec_types); | |
1272 | new_type = build_type_attribute_variant (new_type, | |
1273 | TYPE_ATTRIBUTES (old_type)); | |
1274 | new_type = build_exception_variant (new_type, | |
1275 | TYPE_RAISES_EXCEPTIONS (old_type)); | |
1276 | TREE_TYPE (decl) = new_type; | |
1277 | } | |
1278 | ||
1279 | /* Check to see if the function just declared, as indicated in | |
1280 | DECLARATOR, and in DECL, is a specialization of a function | |
1281 | template. We may also discover that the declaration is an explicit | |
1282 | instantiation at this point. | |
1283 | ||
1284 | Returns DECL, or an equivalent declaration that should be used | |
1285 | instead if all goes well. Issues an error message if something is | |
1286 | amiss. Returns error_mark_node if the error is not easily | |
1287 | recoverable. | |
1288 | ||
1289 | FLAGS is a bitmask consisting of the following flags: | |
1290 | ||
1291 | 2: The function has a definition. | |
1292 | 4: The function is a friend. | |
1293 | ||
1294 | The TEMPLATE_COUNT is the number of references to qualifying | |
1295 | template classes that appeared in the name of the function. For | |
1296 | example, in | |
1297 | ||
1298 | template <class T> struct S { void f(); }; | |
1299 | void S<int>::f(); | |
1300 | ||
1301 | the TEMPLATE_COUNT would be 1. However, explicitly specialized | |
1302 | classes are not counted in the TEMPLATE_COUNT, so that in | |
1303 | ||
1304 | template <class T> struct S {}; | |
1305 | template <> struct S<int> { void f(); } | |
1306 | template <> void S<int>::f(); | |
1307 | ||
1308 | the TEMPLATE_COUNT would be 0. (Note that this declaration is | |
1309 | illegal; there should be no template <>.) | |
1310 | ||
1311 | If the function is a specialization, it is marked as such via | |
1312 | DECL_TEMPLATE_SPECIALIZATION. Furthermore, its DECL_TEMPLATE_INFO | |
1313 | is set up correctly, and it is added to the list of specializations | |
1314 | for that template. */ | |
1315 | ||
1316 | tree | |
1317 | check_explicit_specialization (declarator, decl, template_count, flags) | |
1318 | tree declarator; | |
1319 | tree decl; | |
1320 | int template_count; | |
1321 | int flags; | |
1322 | { | |
1323 | int have_def = flags & 2; | |
1324 | int is_friend = flags & 4; | |
1325 | int specialization = 0; | |
1326 | int explicit_instantiation = 0; | |
1327 | int member_specialization = 0; | |
1328 | tree ctype = DECL_CLASS_CONTEXT (decl); | |
1329 | tree dname = DECL_NAME (decl); | |
1330 | tmpl_spec_kind tsk; | |
1331 | ||
1332 | tsk = current_tmpl_spec_kind (template_count); | |
1333 | ||
1334 | switch (tsk) | |
1335 | { | |
1336 | case tsk_none: | |
1337 | if (processing_specialization) | |
1338 | { | |
1339 | specialization = 1; | |
1340 | SET_DECL_TEMPLATE_SPECIALIZATION (decl); | |
1341 | } | |
1342 | else if (TREE_CODE (declarator) == TEMPLATE_ID_EXPR) | |
1343 | { | |
1344 | if (is_friend) | |
1345 | /* This could be something like: | |
1346 | ||
1347 | template <class T> void f(T); | |
1348 | class S { friend void f<>(int); } */ | |
1349 | specialization = 1; | |
1350 | else | |
1351 | { | |
1352 | /* This case handles bogus declarations like template <> | |
1353 | template <class T> void f<int>(); */ | |
1354 | ||
1355 | cp_error ("template-id `%D' in declaration of primary template", | |
1356 | declarator); | |
1357 | return decl; | |
1358 | } | |
1359 | } | |
1360 | break; | |
1361 | ||
1362 | case tsk_invalid_member_spec: | |
1363 | /* The error has already been reported in | |
1364 | check_specialization_scope. */ | |
1365 | return error_mark_node; | |
1366 | ||
1367 | case tsk_invalid_expl_inst: | |
1368 | cp_error ("template parameter list used in explicit instantiation"); | |
1369 | ||
1370 | /* Fall through. */ | |
1371 | ||
1372 | case tsk_expl_inst: | |
1373 | if (have_def) | |
1374 | cp_error ("definition provided for explicit instantiation"); | |
1375 | ||
1376 | explicit_instantiation = 1; | |
1377 | break; | |
1378 | ||
1379 | case tsk_excessive_parms: | |
1380 | cp_error ("too many template parameter lists in declaration of `%D'", | |
1381 | decl); | |
1382 | return error_mark_node; | |
1383 | ||
1384 | /* Fall through. */ | |
1385 | case tsk_expl_spec: | |
1386 | SET_DECL_TEMPLATE_SPECIALIZATION (decl); | |
1387 | if (ctype) | |
1388 | member_specialization = 1; | |
1389 | else | |
1390 | specialization = 1; | |
1391 | break; | |
1392 | ||
1393 | case tsk_insufficient_parms: | |
1394 | if (template_header_count) | |
1395 | { | |
1396 | cp_error("too few template parameter lists in declaration of `%D'", | |
1397 | decl); | |
1398 | return decl; | |
1399 | } | |
1400 | else if (ctype != NULL_TREE | |
1401 | && !TYPE_BEING_DEFINED (ctype) | |
1402 | && CLASSTYPE_TEMPLATE_INSTANTIATION (ctype) | |
1403 | && !is_friend) | |
1404 | { | |
1405 | /* For backwards compatibility, we accept: | |
1406 | ||
1407 | template <class T> struct S { void f(); }; | |
1408 | void S<int>::f() {} // Missing template <> | |
1409 | ||
1410 | That used to be legal C++. */ | |
1411 | if (pedantic) | |
1412 | cp_pedwarn | |
1413 | ("explicit specialization not preceded by `template <>'"); | |
1414 | specialization = 1; | |
1415 | SET_DECL_TEMPLATE_SPECIALIZATION (decl); | |
1416 | } | |
1417 | break; | |
1418 | ||
1419 | case tsk_template: | |
1420 | if (TREE_CODE (declarator) == TEMPLATE_ID_EXPR) | |
1421 | { | |
1422 | /* This case handles bogus declarations like template <> | |
1423 | template <class T> void f<int>(); */ | |
1424 | ||
1425 | if (uses_template_parms (declarator)) | |
1426 | cp_error ("partial specialization `%D' of function template", | |
1427 | declarator); | |
1428 | else | |
1429 | cp_error ("template-id `%D' in declaration of primary template", | |
1430 | declarator); | |
1431 | return decl; | |
1432 | } | |
1433 | ||
1434 | if (ctype && CLASSTYPE_TEMPLATE_INSTANTIATION (ctype)) | |
1435 | /* This is a specialization of a member template, without | |
1436 | specialization the containing class. Something like: | |
1437 | ||
1438 | template <class T> struct S { | |
1439 | template <class U> void f (U); | |
1440 | }; | |
1441 | template <> template <class U> void S<int>::f(U) {} | |
1442 | ||
1443 | That's a specialization -- but of the entire template. */ | |
1444 | specialization = 1; | |
1445 | break; | |
1446 | ||
1447 | default: | |
1448 | my_friendly_abort (20000309); | |
1449 | } | |
1450 | ||
1451 | if (specialization || member_specialization) | |
1452 | { | |
1453 | tree t = TYPE_ARG_TYPES (TREE_TYPE (decl)); | |
1454 | for (; t; t = TREE_CHAIN (t)) | |
1455 | if (TREE_PURPOSE (t)) | |
1456 | { | |
1457 | cp_pedwarn | |
1458 | ("default argument specified in explicit specialization"); | |
1459 | break; | |
1460 | } | |
1461 | if (current_lang_name == lang_name_c) | |
1462 | cp_error ("template specialization with C linkage"); | |
1463 | } | |
1464 | ||
1465 | if (specialization || member_specialization || explicit_instantiation) | |
1466 | { | |
1467 | tree tmpl = NULL_TREE; | |
1468 | tree targs = NULL_TREE; | |
1469 | ||
1470 | /* Make sure that the declarator is a TEMPLATE_ID_EXPR. */ | |
1471 | if (TREE_CODE (declarator) != TEMPLATE_ID_EXPR) | |
1472 | { | |
1473 | tree fns; | |
1474 | ||
1475 | my_friendly_assert (TREE_CODE (declarator) == IDENTIFIER_NODE, | |
1476 | 0); | |
1477 | if (!ctype) | |
1478 | fns = IDENTIFIER_NAMESPACE_VALUE (dname); | |
1479 | else | |
1480 | fns = dname; | |
1481 | ||
1482 | declarator = | |
1483 | lookup_template_function (fns, NULL_TREE); | |
1484 | } | |
1485 | ||
1486 | if (declarator == error_mark_node) | |
1487 | return error_mark_node; | |
1488 | ||
1489 | if (ctype != NULL_TREE && TYPE_BEING_DEFINED (ctype)) | |
1490 | { | |
1491 | if (!explicit_instantiation) | |
1492 | /* A specialization in class scope. This is illegal, | |
1493 | but the error will already have been flagged by | |
1494 | check_specialization_scope. */ | |
1495 | return error_mark_node; | |
1496 | else | |
1497 | { | |
1498 | /* It's not legal to write an explicit instantiation in | |
1499 | class scope, e.g.: | |
1500 | ||
1501 | class C { template void f(); } | |
1502 | ||
1503 | This case is caught by the parser. However, on | |
1504 | something like: | |
1505 | ||
1506 | template class C { void f(); }; | |
1507 | ||
1508 | (which is illegal) we can get here. The error will be | |
1509 | issued later. */ | |
1510 | ; | |
1511 | } | |
1512 | ||
1513 | return decl; | |
1514 | } | |
1515 | else if (TREE_CODE (TREE_OPERAND (declarator, 0)) == LOOKUP_EXPR) | |
1516 | { | |
1517 | /* A friend declaration. We can't do much, because we don't | |
1518 | know what this resolves to, yet. */ | |
1519 | my_friendly_assert (is_friend != 0, 0); | |
1520 | my_friendly_assert (!explicit_instantiation, 0); | |
1521 | SET_DECL_IMPLICIT_INSTANTIATION (decl); | |
1522 | return decl; | |
1523 | } | |
1524 | else if (ctype != NULL_TREE | |
1525 | && (TREE_CODE (TREE_OPERAND (declarator, 0)) == | |
1526 | IDENTIFIER_NODE)) | |
1527 | { | |
1528 | /* Find the list of functions in ctype that have the same | |
1529 | name as the declared function. */ | |
1530 | tree name = TREE_OPERAND (declarator, 0); | |
1531 | tree fns = NULL_TREE; | |
1532 | int idx; | |
1533 | ||
1534 | if (name == constructor_name (ctype) | |
1535 | || name == constructor_name_full (ctype)) | |
1536 | { | |
1537 | int is_constructor = DECL_CONSTRUCTOR_P (decl); | |
1538 | ||
1539 | if (is_constructor ? !TYPE_HAS_CONSTRUCTOR (ctype) | |
1540 | : !TYPE_HAS_DESTRUCTOR (ctype)) | |
1541 | { | |
1542 | /* From [temp.expl.spec]: | |
1543 | ||
1544 | If such an explicit specialization for the member | |
1545 | of a class template names an implicitly-declared | |
1546 | special member function (clause _special_), the | |
1547 | program is ill-formed. | |
1548 | ||
1549 | Similar language is found in [temp.explicit]. */ | |
1550 | cp_error ("specialization of implicitly-declared special member function"); | |
1551 | return error_mark_node; | |
1552 | } | |
1553 | ||
1554 | name = is_constructor ? ctor_identifier : dtor_identifier; | |
1555 | } | |
1556 | ||
1557 | if (!DECL_CONV_FN_P (decl)) | |
1558 | { | |
1559 | idx = lookup_fnfields_1 (ctype, name); | |
1560 | if (idx >= 0) | |
1561 | fns = TREE_VEC_ELT (CLASSTYPE_METHOD_VEC (ctype), idx); | |
1562 | } | |
1563 | else | |
1564 | { | |
1565 | tree methods; | |
1566 | ||
1567 | /* For a type-conversion operator, we cannot do a | |
1568 | name-based lookup. We might be looking for `operator | |
1569 | int' which will be a specialization of `operator T'. | |
1570 | So, we find *all* the conversion operators, and then | |
1571 | select from them. */ | |
1572 | fns = NULL_TREE; | |
1573 | ||
1574 | methods = CLASSTYPE_METHOD_VEC (ctype); | |
1575 | if (methods) | |
1576 | for (idx = 2; idx < TREE_VEC_LENGTH (methods); ++idx) | |
1577 | { | |
1578 | tree ovl = TREE_VEC_ELT (methods, idx); | |
1579 | ||
1580 | if (!ovl || !DECL_CONV_FN_P (OVL_CURRENT (ovl))) | |
1581 | /* There are no more conversion functions. */ | |
1582 | break; | |
1583 | ||
1584 | /* Glue all these conversion functions together | |
1585 | with those we already have. */ | |
1586 | for (; ovl; ovl = OVL_NEXT (ovl)) | |
1587 | fns = ovl_cons (OVL_CURRENT (ovl), fns); | |
1588 | } | |
1589 | } | |
1590 | ||
1591 | if (fns == NULL_TREE) | |
1592 | { | |
1593 | cp_error ("no member function `%D' declared in `%T'", | |
1594 | name, ctype); | |
1595 | return error_mark_node; | |
1596 | } | |
1597 | else | |
1598 | TREE_OPERAND (declarator, 0) = fns; | |
1599 | } | |
1600 | ||
1601 | /* Figure out what exactly is being specialized at this point. | |
1602 | Note that for an explicit instantiation, even one for a | |
1603 | member function, we cannot tell apriori whether the | |
1604 | instantiation is for a member template, or just a member | |
1605 | function of a template class. Even if a member template is | |
1606 | being instantiated, the member template arguments may be | |
1607 | elided if they can be deduced from the rest of the | |
1608 | declaration. */ | |
1609 | tmpl = determine_specialization (declarator, decl, | |
1610 | &targs, | |
1611 | member_specialization); | |
1612 | ||
1613 | if (!tmpl || tmpl == error_mark_node) | |
1614 | /* We couldn't figure out what this declaration was | |
1615 | specializing. */ | |
1616 | return error_mark_node; | |
1617 | else | |
1618 | { | |
1619 | tree gen_tmpl = most_general_template (tmpl); | |
1620 | ||
1621 | if (explicit_instantiation) | |
1622 | { | |
1623 | /* We don't set DECL_EXPLICIT_INSTANTIATION here; that | |
1624 | is done by do_decl_instantiation later. */ | |
1625 | ||
1626 | int arg_depth = TMPL_ARGS_DEPTH (targs); | |
1627 | int parm_depth = TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl)); | |
1628 | ||
1629 | if (arg_depth > parm_depth) | |
1630 | { | |
1631 | /* If TMPL is not the most general template (for | |
1632 | example, if TMPL is a friend template that is | |
1633 | injected into namespace scope), then there will | |
1634 | be too many levels of TARGS. Remove some of them | |
1635 | here. */ | |
1636 | int i; | |
1637 | tree new_targs; | |
1638 | ||
1639 | new_targs = make_tree_vec (parm_depth); | |
1640 | for (i = arg_depth - parm_depth; i < arg_depth; ++i) | |
1641 | TREE_VEC_ELT (new_targs, i - (arg_depth - parm_depth)) | |
1642 | = TREE_VEC_ELT (targs, i); | |
1643 | targs = new_targs; | |
1644 | } | |
1645 | ||
1646 | return instantiate_template (tmpl, targs); | |
1647 | } | |
1648 | ||
1649 | /* If this is a specialization of a member template of a | |
1650 | template class. In we want to return the TEMPLATE_DECL, | |
1651 | not the specialization of it. */ | |
1652 | if (tsk == tsk_template) | |
1653 | { | |
1654 | SET_DECL_TEMPLATE_SPECIALIZATION (tmpl); | |
1655 | DECL_INITIAL (DECL_TEMPLATE_RESULT (tmpl)) = NULL_TREE; | |
1656 | return tmpl; | |
1657 | } | |
1658 | ||
1659 | /* If we thought that the DECL was a member function, but it | |
1660 | turns out to be specializing a static member function, | |
1661 | make DECL a static member function as well. */ | |
1662 | if (DECL_STATIC_FUNCTION_P (tmpl) | |
1663 | && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl)) | |
1664 | { | |
1665 | revert_static_member_fn (decl); | |
1666 | last_function_parms = TREE_CHAIN (last_function_parms); | |
1667 | } | |
1668 | ||
1669 | /* Set up the DECL_TEMPLATE_INFO for DECL. */ | |
1670 | DECL_TEMPLATE_INFO (decl) = tree_cons (tmpl, targs, NULL_TREE); | |
1671 | ||
1672 | /* Inherit default function arguments from the template | |
1673 | DECL is specializing. */ | |
1674 | copy_default_args_to_explicit_spec (decl); | |
1675 | ||
1676 | /* This specialization has the same protection as the | |
1677 | template it specializes. */ | |
1678 | TREE_PRIVATE (decl) = TREE_PRIVATE (gen_tmpl); | |
1679 | TREE_PROTECTED (decl) = TREE_PROTECTED (gen_tmpl); | |
1680 | ||
1681 | /* Mangle the function name appropriately. Note that we do | |
1682 | not mangle specializations of non-template member | |
1683 | functions of template classes, e.g. with | |
1684 | ||
1685 | template <class T> struct S { void f(); } | |
1686 | ||
1687 | and given the specialization | |
1688 | ||
1689 | template <> void S<int>::f() {} | |
1690 | ||
1691 | we do not mangle S<int>::f() here. That's because it's | |
1692 | just an ordinary member function and doesn't need special | |
1693 | treatment. We do this here so that the ordinary, | |
1694 | non-template, name-mangling algorithm will not be used | |
1695 | later. */ | |
1696 | if (is_member_template (tmpl) || ctype == NULL_TREE) | |
1697 | set_mangled_name_for_template_decl (decl); | |
1698 | ||
1699 | if (is_friend && !have_def) | |
1700 | /* This is not really a declaration of a specialization. | |
1701 | It's just the name of an instantiation. But, it's not | |
1702 | a request for an instantiation, either. */ | |
1703 | SET_DECL_IMPLICIT_INSTANTIATION (decl); | |
1704 | else if (DECL_CONSTRUCTOR_P (decl) || DECL_DESTRUCTOR_P (decl)) | |
1705 | /* This is indeed a specialization. In case of constructors | |
1706 | and destructors, we need in-charge and not-in-charge | |
1707 | versions in V3 ABI. */ | |
1708 | clone_function_decl (decl, /*update_method_vec_p=*/0); | |
1709 | ||
1710 | /* Register this specialization so that we can find it | |
1711 | again. */ | |
1712 | decl = register_specialization (decl, gen_tmpl, targs); | |
1713 | } | |
1714 | } | |
1715 | ||
1716 | return decl; | |
1717 | } | |
1718 | ||
1719 | /* TYPE is being declared. Verify that the use of template headers | |
1720 | and such is reasonable. Issue error messages if not. */ | |
1721 | ||
1722 | void | |
1723 | maybe_check_template_type (type) | |
1724 | tree type; | |
1725 | { | |
1726 | if (template_header_count) | |
1727 | { | |
1728 | /* We are in the scope of some `template <...>' header. */ | |
1729 | ||
1730 | int context_depth | |
1731 | = template_class_depth_real (TYPE_CONTEXT (type), | |
1732 | /*count_specializations=*/1); | |
1733 | ||
1734 | if (template_header_count <= context_depth) | |
1735 | /* This is OK; the template headers are for the context. We | |
1736 | are actually too lenient here; like | |
1737 | check_explicit_specialization we should consider the number | |
1738 | of template types included in the actual declaration. For | |
1739 | example, | |
1740 | ||
1741 | template <class T> struct S { | |
1742 | template <class U> template <class V> | |
1743 | struct I {}; | |
1744 | }; | |
1745 | ||
1746 | is illegal, but: | |
1747 | ||
1748 | template <class T> struct S { | |
1749 | template <class U> struct I; | |
1750 | }; | |
1751 | ||
1752 | template <class T> template <class U. | |
1753 | struct S<T>::I {}; | |
1754 | ||
1755 | is not. */ | |
1756 | ; | |
1757 | else if (template_header_count > context_depth + 1) | |
1758 | /* There are two many template parameter lists. */ | |
1759 | cp_error ("too many template parameter lists in declaration of `%T'", type); | |
1760 | } | |
1761 | } | |
1762 | ||
1763 | /* Returns 1 iff PARMS1 and PARMS2 are identical sets of template | |
1764 | parameters. These are represented in the same format used for | |
1765 | DECL_TEMPLATE_PARMS. */ | |
1766 | ||
1767 | int comp_template_parms (parms1, parms2) | |
1768 | tree parms1; | |
1769 | tree parms2; | |
1770 | { | |
1771 | tree p1; | |
1772 | tree p2; | |
1773 | ||
1774 | if (parms1 == parms2) | |
1775 | return 1; | |
1776 | ||
1777 | for (p1 = parms1, p2 = parms2; | |
1778 | p1 != NULL_TREE && p2 != NULL_TREE; | |
1779 | p1 = TREE_CHAIN (p1), p2 = TREE_CHAIN (p2)) | |
1780 | { | |
1781 | tree t1 = TREE_VALUE (p1); | |
1782 | tree t2 = TREE_VALUE (p2); | |
1783 | int i; | |
1784 | ||
1785 | my_friendly_assert (TREE_CODE (t1) == TREE_VEC, 0); | |
1786 | my_friendly_assert (TREE_CODE (t2) == TREE_VEC, 0); | |
1787 | ||
1788 | if (TREE_VEC_LENGTH (t1) != TREE_VEC_LENGTH (t2)) | |
1789 | return 0; | |
1790 | ||
1791 | for (i = 0; i < TREE_VEC_LENGTH (t2); ++i) | |
1792 | { | |
1793 | tree parm1 = TREE_VALUE (TREE_VEC_ELT (t1, i)); | |
1794 | tree parm2 = TREE_VALUE (TREE_VEC_ELT (t2, i)); | |
1795 | ||
1796 | if (TREE_CODE (parm1) != TREE_CODE (parm2)) | |
1797 | return 0; | |
1798 | ||
1799 | if (TREE_CODE (parm1) == TEMPLATE_TYPE_PARM) | |
1800 | continue; | |
1801 | else if (!same_type_p (TREE_TYPE (parm1), TREE_TYPE (parm2))) | |
1802 | return 0; | |
1803 | } | |
1804 | } | |
1805 | ||
1806 | if ((p1 != NULL_TREE) != (p2 != NULL_TREE)) | |
1807 | /* One set of parameters has more parameters lists than the | |
1808 | other. */ | |
1809 | return 0; | |
1810 | ||
1811 | return 1; | |
1812 | } | |
1813 | ||
1814 | /* Complain if DECL shadows a template parameter. | |
1815 | ||
1816 | [temp.local]: A template-parameter shall not be redeclared within its | |
1817 | scope (including nested scopes). */ | |
1818 | ||
1819 | void | |
1820 | check_template_shadow (decl) | |
1821 | tree decl; | |
1822 | { | |
1823 | tree olddecl; | |
1824 | ||
1825 | /* If we're not in a template, we can't possibly shadow a template | |
1826 | parameter. */ | |
1827 | if (!current_template_parms) | |
1828 | return; | |
1829 | ||
1830 | /* Figure out what we're shadowing. */ | |
1831 | if (TREE_CODE (decl) == OVERLOAD) | |
1832 | decl = OVL_CURRENT (decl); | |
1833 | olddecl = IDENTIFIER_VALUE (DECL_NAME (decl)); | |
1834 | ||
1835 | /* If there's no previous binding for this name, we're not shadowing | |
1836 | anything, let alone a template parameter. */ | |
1837 | if (!olddecl) | |
1838 | return; | |
1839 | ||
1840 | /* If we're not shadowing a template parameter, we're done. Note | |
1841 | that OLDDECL might be an OVERLOAD (or perhaps even an | |
1842 | ERROR_MARK), so we can't just blithely assume it to be a _DECL | |
1843 | node. */ | |
1844 | if (!DECL_P (olddecl) || !DECL_TEMPLATE_PARM_P (olddecl)) | |
1845 | return; | |
1846 | ||
1847 | /* We check for decl != olddecl to avoid bogus errors for using a | |
1848 | name inside a class. We check TPFI to avoid duplicate errors for | |
1849 | inline member templates. */ | |
1850 | if (decl == olddecl | |
1851 | || TEMPLATE_PARMS_FOR_INLINE (current_template_parms)) | |
1852 | return; | |
1853 | ||
1854 | cp_error_at ("declaration of `%#D'", decl); | |
1855 | cp_error_at (" shadows template parm `%#D'", olddecl); | |
1856 | } | |
1857 | ||
1858 | /* Return a new TEMPLATE_PARM_INDEX with the indicated INDEX, LEVEL, | |
1859 | ORIG_LEVEL, DECL, and TYPE. */ | |
1860 | ||
1861 | static tree | |
1862 | build_template_parm_index (index, level, orig_level, decl, type) | |
1863 | int index; | |
1864 | int level; | |
1865 | int orig_level; | |
1866 | tree decl; | |
1867 | tree type; | |
1868 | { | |
1869 | tree t = make_node (TEMPLATE_PARM_INDEX); | |
1870 | TEMPLATE_PARM_IDX (t) = index; | |
1871 | TEMPLATE_PARM_LEVEL (t) = level; | |
1872 | TEMPLATE_PARM_ORIG_LEVEL (t) = orig_level; | |
1873 | TEMPLATE_PARM_DECL (t) = decl; | |
1874 | TREE_TYPE (t) = type; | |
1875 | ||
1876 | return t; | |
1877 | } | |
1878 | ||
1879 | /* Return a TEMPLATE_PARM_INDEX, similar to INDEX, but whose | |
1880 | TEMPLATE_PARM_LEVEL has been decreased by LEVELS. If such a | |
1881 | TEMPLATE_PARM_INDEX already exists, it is returned; otherwise, a | |
1882 | new one is created. */ | |
1883 | ||
1884 | static tree | |
1885 | reduce_template_parm_level (index, type, levels) | |
1886 | tree index; | |
1887 | tree type; | |
1888 | int levels; | |
1889 | { | |
1890 | if (TEMPLATE_PARM_DESCENDANTS (index) == NULL_TREE | |
1891 | || (TEMPLATE_PARM_LEVEL (TEMPLATE_PARM_DESCENDANTS (index)) | |
1892 | != TEMPLATE_PARM_LEVEL (index) - levels)) | |
1893 | { | |
1894 | tree decl | |
1895 | = build_decl (TREE_CODE (TEMPLATE_PARM_DECL (index)), | |
1896 | DECL_NAME (TEMPLATE_PARM_DECL (index)), | |
1897 | type); | |
1898 | tree t | |
1899 | = build_template_parm_index (TEMPLATE_PARM_IDX (index), | |
1900 | TEMPLATE_PARM_LEVEL (index) - levels, | |
1901 | TEMPLATE_PARM_ORIG_LEVEL (index), | |
1902 | decl, type); | |
1903 | TEMPLATE_PARM_DESCENDANTS (index) = t; | |
1904 | ||
1905 | DECL_ARTIFICIAL (decl) = 1; | |
1906 | SET_DECL_TEMPLATE_PARM_P (decl); | |
1907 | ||
1908 | /* Template template parameters need this. */ | |
1909 | DECL_TEMPLATE_PARMS (decl) | |
1910 | = DECL_TEMPLATE_PARMS (TEMPLATE_PARM_DECL (index)); | |
1911 | } | |
1912 | ||
1913 | return TEMPLATE_PARM_DESCENDANTS (index); | |
1914 | } | |
1915 | ||
1916 | /* Process information from new template parameter NEXT and append it to the | |
1917 | LIST being built. */ | |
1918 | ||
1919 | tree | |
1920 | process_template_parm (list, next) | |
1921 | tree list, next; | |
1922 | { | |
1923 | tree parm; | |
1924 | tree decl = 0; | |
1925 | tree defval; | |
1926 | int is_type, idx; | |
1927 | ||
1928 | parm = next; | |
1929 | my_friendly_assert (TREE_CODE (parm) == TREE_LIST, 259); | |
1930 | defval = TREE_PURPOSE (parm); | |
1931 | parm = TREE_VALUE (parm); | |
1932 | is_type = TREE_PURPOSE (parm) == class_type_node; | |
1933 | ||
1934 | if (list) | |
1935 | { | |
1936 | tree p = TREE_VALUE (tree_last (list)); | |
1937 | ||
1938 | if (TREE_CODE (p) == TYPE_DECL || TREE_CODE (p) == TEMPLATE_DECL) | |
1939 | idx = TEMPLATE_TYPE_IDX (TREE_TYPE (p)); | |
1940 | else | |
1941 | idx = TEMPLATE_PARM_IDX (DECL_INITIAL (p)); | |
1942 | ++idx; | |
1943 | } | |
1944 | else | |
1945 | idx = 0; | |
1946 | ||
1947 | if (!is_type) | |
1948 | { | |
1949 | my_friendly_assert (TREE_CODE (TREE_PURPOSE (parm)) == TREE_LIST, 260); | |
1950 | /* is a const-param */ | |
1951 | parm = grokdeclarator (TREE_VALUE (parm), TREE_PURPOSE (parm), | |
1952 | PARM, 0, NULL_TREE); | |
1953 | ||
1954 | /* [temp.param] | |
1955 | ||
1956 | The top-level cv-qualifiers on the template-parameter are | |
1957 | ignored when determining its type. */ | |
1958 | TREE_TYPE (parm) = TYPE_MAIN_VARIANT (TREE_TYPE (parm)); | |
1959 | ||
1960 | /* A template parameter is not modifiable. */ | |
1961 | TREE_READONLY (parm) = 1; | |
1962 | if (invalid_nontype_parm_type_p (TREE_TYPE (parm), 1)) | |
1963 | TREE_TYPE (parm) = void_type_node; | |
1964 | decl = build_decl (CONST_DECL, DECL_NAME (parm), TREE_TYPE (parm)); | |
1965 | DECL_INITIAL (parm) = DECL_INITIAL (decl) | |
1966 | = build_template_parm_index (idx, processing_template_decl, | |
1967 | processing_template_decl, | |
1968 | decl, TREE_TYPE (parm)); | |
1969 | } | |
1970 | else | |
1971 | { | |
1972 | tree t; | |
1973 | parm = TREE_VALUE (parm); | |
1974 | ||
1975 | if (parm && TREE_CODE (parm) == TEMPLATE_DECL) | |
1976 | { | |
1977 | t = make_aggr_type (TEMPLATE_TEMPLATE_PARM); | |
1978 | /* This is for distinguishing between real templates and template | |
1979 | template parameters */ | |
1980 | TREE_TYPE (parm) = t; | |
1981 | TREE_TYPE (DECL_TEMPLATE_RESULT (parm)) = t; | |
1982 | decl = parm; | |
1983 | } | |
1984 | else | |
1985 | { | |
1986 | t = make_aggr_type (TEMPLATE_TYPE_PARM); | |
1987 | /* parm is either IDENTIFIER_NODE or NULL_TREE */ | |
1988 | decl = build_decl (TYPE_DECL, parm, t); | |
1989 | } | |
1990 | ||
1991 | TYPE_NAME (t) = decl; | |
1992 | TYPE_STUB_DECL (t) = decl; | |
1993 | parm = decl; | |
1994 | TEMPLATE_TYPE_PARM_INDEX (t) | |
1995 | = build_template_parm_index (idx, processing_template_decl, | |
1996 | processing_template_decl, | |
1997 | decl, TREE_TYPE (parm)); | |
1998 | } | |
1999 | DECL_ARTIFICIAL (decl) = 1; | |
2000 | SET_DECL_TEMPLATE_PARM_P (decl); | |
2001 | pushdecl (decl); | |
2002 | parm = build_tree_list (defval, parm); | |
2003 | return chainon (list, parm); | |
2004 | } | |
2005 | ||
2006 | /* The end of a template parameter list has been reached. Process the | |
2007 | tree list into a parameter vector, converting each parameter into a more | |
2008 | useful form. Type parameters are saved as IDENTIFIER_NODEs, and others | |
2009 | as PARM_DECLs. */ | |
2010 | ||
2011 | tree | |
2012 | end_template_parm_list (parms) | |
2013 | tree parms; | |
2014 | { | |
2015 | int nparms; | |
2016 | tree parm; | |
2017 | tree saved_parmlist = make_tree_vec (list_length (parms)); | |
2018 | ||
2019 | current_template_parms | |
2020 | = tree_cons (size_int (processing_template_decl), | |
2021 | saved_parmlist, current_template_parms); | |
2022 | ||
2023 | for (parm = parms, nparms = 0; | |
2024 | parm; | |
2025 | parm = TREE_CHAIN (parm), nparms++) | |
2026 | TREE_VEC_ELT (saved_parmlist, nparms) = parm; | |
2027 | ||
2028 | --processing_template_parmlist; | |
2029 | ||
2030 | return saved_parmlist; | |
2031 | } | |
2032 | ||
2033 | /* end_template_decl is called after a template declaration is seen. */ | |
2034 | ||
2035 | void | |
2036 | end_template_decl () | |
2037 | { | |
2038 | reset_specialization (); | |
2039 | ||
2040 | if (! processing_template_decl) | |
2041 | return; | |
2042 | ||
2043 | /* This matches the pushlevel in begin_template_parm_list. */ | |
2044 | finish_scope (); | |
2045 | ||
2046 | --processing_template_decl; | |
2047 | current_template_parms = TREE_CHAIN (current_template_parms); | |
2048 | } | |
2049 | ||
2050 | /* Given a template argument vector containing the template PARMS. | |
2051 | The innermost PARMS are given first. */ | |
2052 | ||
2053 | tree | |
2054 | current_template_args () | |
2055 | { | |
2056 | tree header; | |
2057 | tree args = NULL_TREE; | |
2058 | int length = TMPL_PARMS_DEPTH (current_template_parms); | |
2059 | int l = length; | |
2060 | ||
2061 | /* If there is only one level of template parameters, we do not | |
2062 | create a TREE_VEC of TREE_VECs. Instead, we return a single | |
2063 | TREE_VEC containing the arguments. */ | |
2064 | if (length > 1) | |
2065 | args = make_tree_vec (length); | |
2066 | ||
2067 | for (header = current_template_parms; header; header = TREE_CHAIN (header)) | |
2068 | { | |
2069 | tree a = copy_node (TREE_VALUE (header)); | |
2070 | int i; | |
2071 | ||
2072 | TREE_TYPE (a) = NULL_TREE; | |
2073 | for (i = TREE_VEC_LENGTH (a) - 1; i >= 0; --i) | |
2074 | { | |
2075 | tree t = TREE_VEC_ELT (a, i); | |
2076 | ||
2077 | /* T will be a list if we are called from within a | |
2078 | begin/end_template_parm_list pair, but a vector directly | |
2079 | if within a begin/end_member_template_processing pair. */ | |
2080 | if (TREE_CODE (t) == TREE_LIST) | |
2081 | { | |
2082 | t = TREE_VALUE (t); | |
2083 | ||
2084 | if (TREE_CODE (t) == TYPE_DECL | |
2085 | || TREE_CODE (t) == TEMPLATE_DECL) | |
2086 | t = TREE_TYPE (t); | |
2087 | else | |
2088 | t = DECL_INITIAL (t); | |
2089 | TREE_VEC_ELT (a, i) = t; | |
2090 | } | |
2091 | } | |
2092 | ||
2093 | if (length > 1) | |
2094 | TREE_VEC_ELT (args, --l) = a; | |
2095 | else | |
2096 | args = a; | |
2097 | } | |
2098 | ||
2099 | return args; | |
2100 | } | |
2101 | ||
2102 | /* Return a TEMPLATE_DECL corresponding to DECL, using the indicated | |
2103 | template PARMS. Used by push_template_decl below. */ | |
2104 | ||
2105 | static tree | |
2106 | build_template_decl (decl, parms) | |
2107 | tree decl; | |
2108 | tree parms; | |
2109 | { | |
2110 | tree tmpl = build_lang_decl (TEMPLATE_DECL, DECL_NAME (decl), NULL_TREE); | |
2111 | DECL_TEMPLATE_PARMS (tmpl) = parms; | |
2112 | DECL_CONTEXT (tmpl) = DECL_CONTEXT (decl); | |
2113 | if (DECL_LANG_SPECIFIC (decl)) | |
2114 | { | |
2115 | if (CAN_HAVE_FULL_LANG_DECL_P (decl)) | |
2116 | DECL_VIRTUAL_CONTEXT (tmpl) = DECL_VIRTUAL_CONTEXT (decl); | |
2117 | DECL_STATIC_FUNCTION_P (tmpl) = DECL_STATIC_FUNCTION_P (decl); | |
2118 | DECL_CONSTRUCTOR_P (tmpl) = DECL_CONSTRUCTOR_P (decl); | |
2119 | DECL_NONCONVERTING_P (tmpl) = DECL_NONCONVERTING_P (decl); | |
2120 | DECL_ASSIGNMENT_OPERATOR_P (tmpl) = DECL_ASSIGNMENT_OPERATOR_P (decl); | |
2121 | if (DECL_OVERLOADED_OPERATOR_P (decl)) | |
2122 | SET_OVERLOADED_OPERATOR_CODE (tmpl, | |
2123 | DECL_OVERLOADED_OPERATOR_P (decl)); | |
2124 | } | |
2125 | ||
2126 | return tmpl; | |
2127 | } | |
2128 | ||
2129 | struct template_parm_data | |
2130 | { | |
2131 | /* The level of the template parameters we are currently | |
2132 | processing. */ | |
2133 | int level; | |
2134 | ||
2135 | /* The index of the specialization argument we are currently | |
2136 | processing. */ | |
2137 | int current_arg; | |
2138 | ||
2139 | /* An array whose size is the number of template parameters. The | |
2140 | elements are non-zero if the parameter has been used in any one | |
2141 | of the arguments processed so far. */ | |
2142 | int* parms; | |
2143 | ||
2144 | /* An array whose size is the number of template arguments. The | |
2145 | elements are non-zero if the argument makes use of template | |
2146 | parameters of this level. */ | |
2147 | int* arg_uses_template_parms; | |
2148 | }; | |
2149 | ||
2150 | /* Subroutine of push_template_decl used to see if each template | |
2151 | parameter in a partial specialization is used in the explicit | |
2152 | argument list. If T is of the LEVEL given in DATA (which is | |
2153 | treated as a template_parm_data*), then DATA->PARMS is marked | |
2154 | appropriately. */ | |
2155 | ||
2156 | static int | |
2157 | mark_template_parm (t, data) | |
2158 | tree t; | |
2159 | void* data; | |
2160 | { | |
2161 | int level; | |
2162 | int idx; | |
2163 | struct template_parm_data* tpd = (struct template_parm_data*) data; | |
2164 | ||
2165 | if (TREE_CODE (t) == TEMPLATE_PARM_INDEX) | |
2166 | { | |
2167 | level = TEMPLATE_PARM_LEVEL (t); | |
2168 | idx = TEMPLATE_PARM_IDX (t); | |
2169 | } | |
2170 | else | |
2171 | { | |
2172 | level = TEMPLATE_TYPE_LEVEL (t); | |
2173 | idx = TEMPLATE_TYPE_IDX (t); | |
2174 | } | |
2175 | ||
2176 | if (level == tpd->level) | |
2177 | { | |
2178 | tpd->parms[idx] = 1; | |
2179 | tpd->arg_uses_template_parms[tpd->current_arg] = 1; | |
2180 | } | |
2181 | ||
2182 | /* Return zero so that for_each_template_parm will continue the | |
2183 | traversal of the tree; we want to mark *every* template parm. */ | |
2184 | return 0; | |
2185 | } | |
2186 | ||
2187 | /* Process the partial specialization DECL. */ | |
2188 | ||
2189 | static tree | |
2190 | process_partial_specialization (decl) | |
2191 | tree decl; | |
2192 | { | |
2193 | tree type = TREE_TYPE (decl); | |
2194 | tree maintmpl = CLASSTYPE_TI_TEMPLATE (type); | |
2195 | tree specargs = CLASSTYPE_TI_ARGS (type); | |
2196 | tree inner_args = INNERMOST_TEMPLATE_ARGS (specargs); | |
2197 | tree inner_parms = INNERMOST_TEMPLATE_PARMS (current_template_parms); | |
2198 | tree main_inner_parms = DECL_INNERMOST_TEMPLATE_PARMS (maintmpl); | |
2199 | int nargs = TREE_VEC_LENGTH (inner_args); | |
2200 | int ntparms = TREE_VEC_LENGTH (inner_parms); | |
2201 | int i; | |
2202 | int did_error_intro = 0; | |
2203 | struct template_parm_data tpd; | |
2204 | struct template_parm_data tpd2; | |
2205 | ||
2206 | /* We check that each of the template parameters given in the | |
2207 | partial specialization is used in the argument list to the | |
2208 | specialization. For example: | |
2209 | ||
2210 | template <class T> struct S; | |
2211 | template <class T> struct S<T*>; | |
2212 | ||
2213 | The second declaration is OK because `T*' uses the template | |
2214 | parameter T, whereas | |
2215 | ||
2216 | template <class T> struct S<int>; | |
2217 | ||
2218 | is no good. Even trickier is: | |
2219 | ||
2220 | template <class T> | |
2221 | struct S1 | |
2222 | { | |
2223 | template <class U> | |
2224 | struct S2; | |
2225 | template <class U> | |
2226 | struct S2<T>; | |
2227 | }; | |
2228 | ||
2229 | The S2<T> declaration is actually illegal; it is a | |
2230 | full-specialization. Of course, | |
2231 | ||
2232 | template <class U> | |
2233 | struct S2<T (*)(U)>; | |
2234 | ||
2235 | or some such would have been OK. */ | |
2236 | tpd.level = TMPL_PARMS_DEPTH (current_template_parms); | |
2237 | tpd.parms = alloca (sizeof (int) * ntparms); | |
2238 | memset ((PTR) tpd.parms, 0, sizeof (int) * ntparms); | |
2239 | ||
2240 | tpd.arg_uses_template_parms = alloca (sizeof (int) * nargs); | |
2241 | memset ((PTR) tpd.arg_uses_template_parms, 0, sizeof (int) * nargs); | |
2242 | for (i = 0; i < nargs; ++i) | |
2243 | { | |
2244 | tpd.current_arg = i; | |
2245 | for_each_template_parm (TREE_VEC_ELT (inner_args, i), | |
2246 | &mark_template_parm, | |
2247 | &tpd); | |
2248 | } | |
2249 | for (i = 0; i < ntparms; ++i) | |
2250 | if (tpd.parms[i] == 0) | |
2251 | { | |
2252 | /* One of the template parms was not used in the | |
2253 | specialization. */ | |
2254 | if (!did_error_intro) | |
2255 | { | |
2256 | cp_error ("template parameters not used in partial specialization:"); | |
2257 | did_error_intro = 1; | |
2258 | } | |
2259 | ||
2260 | cp_error (" `%D'", | |
2261 | TREE_VALUE (TREE_VEC_ELT (inner_parms, i))); | |
2262 | } | |
2263 | ||
2264 | /* [temp.class.spec] | |
2265 | ||
2266 | The argument list of the specialization shall not be identical to | |
2267 | the implicit argument list of the primary template. */ | |
2268 | if (comp_template_args | |
2269 | (inner_args, | |
2270 | INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (TREE_TYPE | |
2271 | (maintmpl))))) | |
2272 | cp_error ("partial specialization `%T' does not specialize any template arguments", type); | |
2273 | ||
2274 | /* [temp.class.spec] | |
2275 | ||
2276 | A partially specialized non-type argument expression shall not | |
2277 | involve template parameters of the partial specialization except | |
2278 | when the argument expression is a simple identifier. | |
2279 | ||
2280 | The type of a template parameter corresponding to a specialized | |
2281 | non-type argument shall not be dependent on a parameter of the | |
2282 | specialization. */ | |
2283 | my_friendly_assert (nargs == DECL_NTPARMS (maintmpl), 0); | |
2284 | tpd2.parms = 0; | |
2285 | for (i = 0; i < nargs; ++i) | |
2286 | { | |
2287 | tree arg = TREE_VEC_ELT (inner_args, i); | |
2288 | if (/* These first two lines are the `non-type' bit. */ | |
2289 | !TYPE_P (arg) | |
2290 | && TREE_CODE (arg) != TEMPLATE_DECL | |
2291 | /* This next line is the `argument expression is not just a | |
2292 | simple identifier' condition and also the `specialized | |
2293 | non-type argument' bit. */ | |
2294 | && TREE_CODE (arg) != TEMPLATE_PARM_INDEX) | |
2295 | { | |
2296 | if (tpd.arg_uses_template_parms[i]) | |
2297 | cp_error ("template argument `%E' involves template parameter(s)", arg); | |
2298 | else | |
2299 | { | |
2300 | /* Look at the corresponding template parameter, | |
2301 | marking which template parameters its type depends | |
2302 | upon. */ | |
2303 | tree type = | |
2304 | TREE_TYPE (TREE_VALUE (TREE_VEC_ELT (main_inner_parms, | |
2305 | i))); | |
2306 | ||
2307 | if (!tpd2.parms) | |
2308 | { | |
2309 | /* We haven't yet initialized TPD2. Do so now. */ | |
2310 | tpd2.arg_uses_template_parms | |
2311 | = (int*) alloca (sizeof (int) * nargs); | |
2312 | /* The number of parameters here is the number in the | |
2313 | main template, which, as checked in the assertion | |
2314 | above, is NARGS. */ | |
2315 | tpd2.parms = (int*) alloca (sizeof (int) * nargs); | |
2316 | tpd2.level = | |
2317 | TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (maintmpl)); | |
2318 | } | |
2319 | ||
2320 | /* Mark the template parameters. But this time, we're | |
2321 | looking for the template parameters of the main | |
2322 | template, not in the specialization. */ | |
2323 | tpd2.current_arg = i; | |
2324 | tpd2.arg_uses_template_parms[i] = 0; | |
2325 | memset ((PTR) tpd2.parms, 0, sizeof (int) * nargs); | |
2326 | for_each_template_parm (type, | |
2327 | &mark_template_parm, | |
2328 | &tpd2); | |
2329 | ||
2330 | if (tpd2.arg_uses_template_parms [i]) | |
2331 | { | |
2332 | /* The type depended on some template parameters. | |
2333 | If they are fully specialized in the | |
2334 | specialization, that's OK. */ | |
2335 | int j; | |
2336 | for (j = 0; j < nargs; ++j) | |
2337 | if (tpd2.parms[j] != 0 | |
2338 | && tpd.arg_uses_template_parms [j]) | |
2339 | { | |
2340 | cp_error ("type `%T' of template argument `%E' depends on template parameter(s)", | |
2341 | type, | |
2342 | arg); | |
2343 | break; | |
2344 | } | |
2345 | } | |
2346 | } | |
2347 | } | |
2348 | } | |
2349 | ||
2350 | if (retrieve_specialization (maintmpl, specargs)) | |
2351 | /* We've already got this specialization. */ | |
2352 | return decl; | |
2353 | ||
2354 | DECL_TEMPLATE_SPECIALIZATIONS (maintmpl) | |
2355 | = tree_cons (inner_args, inner_parms, | |
2356 | DECL_TEMPLATE_SPECIALIZATIONS (maintmpl)); | |
2357 | TREE_TYPE (DECL_TEMPLATE_SPECIALIZATIONS (maintmpl)) = type; | |
2358 | return decl; | |
2359 | } | |
2360 | ||
2361 | /* Check that a template declaration's use of default arguments is not | |
2362 | invalid. Here, PARMS are the template parameters. IS_PRIMARY is | |
2363 | non-zero if DECL is the thing declared by a primary template. | |
2364 | IS_PARTIAL is non-zero if DECL is a partial specialization. */ | |
2365 | ||
2366 | static void | |
2367 | check_default_tmpl_args (decl, parms, is_primary, is_partial) | |
2368 | tree decl; | |
2369 | tree parms; | |
2370 | int is_primary; | |
2371 | int is_partial; | |
2372 | { | |
2373 | const char *msg; | |
2374 | int last_level_to_check; | |
2375 | tree parm_level; | |
2376 | ||
2377 | /* [temp.param] | |
2378 | ||
2379 | A default template-argument shall not be specified in a | |
2380 | function template declaration or a function template definition, nor | |
2381 | in the template-parameter-list of the definition of a member of a | |
2382 | class template. */ | |
2383 | ||
2384 | if (TREE_CODE (CP_DECL_CONTEXT (decl)) == FUNCTION_DECL) | |
2385 | /* You can't have a function template declaration in a local | |
2386 | scope, nor you can you define a member of a class template in a | |
2387 | local scope. */ | |
2388 | return; | |
2389 | ||
2390 | if (current_class_type | |
2391 | && !TYPE_BEING_DEFINED (current_class_type) | |
2392 | && DECL_LANG_SPECIFIC (decl) | |
2393 | /* If this is either a friend defined in the scope of the class | |
2394 | or a member function. */ | |
2395 | && ((DECL_CONTEXT (decl) | |
2396 | && same_type_p (DECL_CONTEXT (decl), current_class_type)) | |
2397 | || (DECL_FRIEND_CONTEXT (decl) | |
2398 | && same_type_p (DECL_FRIEND_CONTEXT (decl), | |
2399 | current_class_type))) | |
2400 | /* And, if it was a member function, it really was defined in | |
2401 | the scope of the class. */ | |
2402 | && (!DECL_FUNCTION_MEMBER_P (decl) || DECL_INITIALIZED_IN_CLASS_P (decl))) | |
2403 | /* We already checked these parameters when the template was | |
2404 | declared, so there's no need to do it again now. This function | |
2405 | was defined in class scope, but we're processing it's body now | |
2406 | that the class is complete. */ | |
2407 | return; | |
2408 | ||
2409 | /* [temp.param] | |
2410 | ||
2411 | If a template-parameter has a default template-argument, all | |
2412 | subsequent template-parameters shall have a default | |
2413 | template-argument supplied. */ | |
2414 | for (parm_level = parms; parm_level; parm_level = TREE_CHAIN (parm_level)) | |
2415 | { | |
2416 | tree inner_parms = TREE_VALUE (parm_level); | |
2417 | int ntparms = TREE_VEC_LENGTH (inner_parms); | |
2418 | int seen_def_arg_p = 0; | |
2419 | int i; | |
2420 | ||
2421 | for (i = 0; i < ntparms; ++i) | |
2422 | { | |
2423 | tree parm = TREE_VEC_ELT (inner_parms, i); | |
2424 | if (TREE_PURPOSE (parm)) | |
2425 | seen_def_arg_p = 1; | |
2426 | else if (seen_def_arg_p) | |
2427 | { | |
2428 | cp_error ("no default argument for `%D'", TREE_VALUE (parm)); | |
2429 | /* For better subsequent error-recovery, we indicate that | |
2430 | there should have been a default argument. */ | |
2431 | TREE_PURPOSE (parm) = error_mark_node; | |
2432 | } | |
2433 | } | |
2434 | } | |
2435 | ||
2436 | if (TREE_CODE (decl) != TYPE_DECL || is_partial || !is_primary) | |
2437 | /* For an ordinary class template, default template arguments are | |
2438 | allowed at the innermost level, e.g.: | |
2439 | template <class T = int> | |
2440 | struct S {}; | |
2441 | but, in a partial specialization, they're not allowed even | |
2442 | there, as we have in [temp.class.spec]: | |
2443 | ||
2444 | The template parameter list of a specialization shall not | |
2445 | contain default template argument values. | |
2446 | ||
2447 | So, for a partial specialization, or for a function template, | |
2448 | we look at all of them. */ | |
2449 | ; | |
2450 | else | |
2451 | /* But, for a primary class template that is not a partial | |
2452 | specialization we look at all template parameters except the | |
2453 | innermost ones. */ | |
2454 | parms = TREE_CHAIN (parms); | |
2455 | ||
2456 | /* Figure out what error message to issue. */ | |
2457 | if (TREE_CODE (decl) == FUNCTION_DECL) | |
2458 | msg = "default argument for template parameter in function template `%D'"; | |
2459 | else if (is_partial) | |
2460 | msg = "default argument in partial specialization `%D'"; | |
2461 | else | |
2462 | msg = "default argument for template parameter for class enclosing `%D'"; | |
2463 | ||
2464 | if (current_class_type && TYPE_BEING_DEFINED (current_class_type)) | |
2465 | /* If we're inside a class definition, there's no need to | |
2466 | examine the parameters to the class itself. On the one | |
2467 | hand, they will be checked when the class is defined, and, | |
2468 | on the other, default arguments are legal in things like: | |
2469 | template <class T = double> | |
2470 | struct S { template <class U> void f(U); }; | |
2471 | Here the default argument for `S' has no bearing on the | |
2472 | declaration of `f'. */ | |
2473 | last_level_to_check = template_class_depth (current_class_type) + 1; | |
2474 | else | |
2475 | /* Check everything. */ | |
2476 | last_level_to_check = 0; | |
2477 | ||
2478 | for (parm_level = parms; | |
2479 | parm_level && TMPL_PARMS_DEPTH (parm_level) >= last_level_to_check; | |
2480 | parm_level = TREE_CHAIN (parm_level)) | |
2481 | { | |
2482 | tree inner_parms = TREE_VALUE (parm_level); | |
2483 | int i; | |
2484 | int ntparms; | |
2485 | ||
2486 | ntparms = TREE_VEC_LENGTH (inner_parms); | |
2487 | for (i = 0; i < ntparms; ++i) | |
2488 | if (TREE_PURPOSE (TREE_VEC_ELT (inner_parms, i))) | |
2489 | { | |
2490 | if (msg) | |
2491 | { | |
2492 | cp_error (msg, decl); | |
2493 | msg = 0; | |
2494 | } | |
2495 | ||
2496 | /* Clear out the default argument so that we are not | |
2497 | confused later. */ | |
2498 | TREE_PURPOSE (TREE_VEC_ELT (inner_parms, i)) = NULL_TREE; | |
2499 | } | |
2500 | ||
2501 | /* At this point, if we're still interested in issuing messages, | |
2502 | they must apply to classes surrounding the object declared. */ | |
2503 | if (msg) | |
2504 | msg = "default argument for template parameter for class enclosing `%D'"; | |
2505 | } | |
2506 | } | |
2507 | ||
2508 | /* Creates a TEMPLATE_DECL for the indicated DECL using the template | |
2509 | parameters given by current_template_args, or reuses a | |
2510 | previously existing one, if appropriate. Returns the DECL, or an | |
2511 | equivalent one, if it is replaced via a call to duplicate_decls. | |
2512 | ||
2513 | If IS_FRIEND is non-zero, DECL is a friend declaration. */ | |
2514 | ||
2515 | tree | |
2516 | push_template_decl_real (decl, is_friend) | |
2517 | tree decl; | |
2518 | int is_friend; | |
2519 | { | |
2520 | tree tmpl; | |
2521 | tree args; | |
2522 | tree info; | |
2523 | tree ctx; | |
2524 | int primary; | |
2525 | int is_partial; | |
2526 | int new_template_p = 0; | |
2527 | ||
2528 | /* See if this is a partial specialization. */ | |
2529 | is_partial = (DECL_IMPLICIT_TYPEDEF_P (decl) | |
2530 | && TREE_CODE (TREE_TYPE (decl)) != ENUMERAL_TYPE | |
2531 | && CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_TYPE (decl))); | |
2532 | ||
2533 | is_friend |= (TREE_CODE (decl) == FUNCTION_DECL && DECL_FRIEND_P (decl)); | |
2534 | ||
2535 | if (is_friend) | |
2536 | /* For a friend, we want the context of the friend function, not | |
2537 | the type of which it is a friend. */ | |
2538 | ctx = DECL_CONTEXT (decl); | |
2539 | else if (CP_DECL_CONTEXT (decl) | |
2540 | && TREE_CODE (CP_DECL_CONTEXT (decl)) != NAMESPACE_DECL) | |
2541 | /* In the case of a virtual function, we want the class in which | |
2542 | it is defined. */ | |
2543 | ctx = CP_DECL_CONTEXT (decl); | |
2544 | else | |
2545 | /* Otherwise, if we're currently defining some class, the DECL | |
2546 | is assumed to be a member of the class. */ | |
2547 | ctx = current_scope (); | |
2548 | ||
2549 | if (ctx && TREE_CODE (ctx) == NAMESPACE_DECL) | |
2550 | ctx = NULL_TREE; | |
2551 | ||
2552 | if (!DECL_CONTEXT (decl)) | |
2553 | DECL_CONTEXT (decl) = FROB_CONTEXT (current_namespace); | |
2554 | ||
2555 | /* See if this is a primary template. */ | |
2556 | primary = template_parm_scope_p (); | |
2557 | ||
2558 | if (primary) | |
2559 | { | |
2560 | if (current_lang_name == lang_name_c) | |
2561 | cp_error ("template with C linkage"); | |
2562 | else if (TREE_CODE (decl) == TYPE_DECL | |
2563 | && ANON_AGGRNAME_P (DECL_NAME (decl))) | |
2564 | cp_error ("template class without a name"); | |
2565 | else if ((DECL_IMPLICIT_TYPEDEF_P (decl) | |
2566 | && CLASS_TYPE_P (TREE_TYPE (decl))) | |
2567 | || (TREE_CODE (decl) == VAR_DECL && ctx && CLASS_TYPE_P (ctx)) | |
2568 | || TREE_CODE (decl) == FUNCTION_DECL) | |
2569 | /* OK */; | |
2570 | else | |
2571 | cp_error ("template declaration of `%#D'", decl); | |
2572 | } | |
2573 | ||
2574 | /* Check to see that the rules regarding the use of default | |
2575 | arguments are not being violated. */ | |
2576 | check_default_tmpl_args (decl, current_template_parms, | |
2577 | primary, is_partial); | |
2578 | ||
2579 | if (is_partial) | |
2580 | return process_partial_specialization (decl); | |
2581 | ||
2582 | args = current_template_args (); | |
2583 | ||
2584 | if (!ctx | |
2585 | || TREE_CODE (ctx) == FUNCTION_DECL | |
2586 | || TYPE_BEING_DEFINED (ctx) | |
2587 | || (is_friend && !DECL_TEMPLATE_INFO (decl))) | |
2588 | { | |
2589 | if (DECL_LANG_SPECIFIC (decl) | |
2590 | && DECL_TEMPLATE_INFO (decl) | |
2591 | && DECL_TI_TEMPLATE (decl)) | |
2592 | tmpl = DECL_TI_TEMPLATE (decl); | |
2593 | /* If DECL is a TYPE_DECL for a class-template, then there won't | |
2594 | be DECL_LANG_SPECIFIC. The information equivalent to | |
2595 | DECL_TEMPLATE_INFO is found in TYPE_TEMPLATE_INFO instead. */ | |
2596 | else if (DECL_IMPLICIT_TYPEDEF_P (decl) | |
2597 | && TYPE_TEMPLATE_INFO (TREE_TYPE (decl)) | |
2598 | && TYPE_TI_TEMPLATE (TREE_TYPE (decl))) | |
2599 | { | |
2600 | /* Since a template declaration already existed for this | |
2601 | class-type, we must be redeclaring it here. Make sure | |
2602 | that the redeclaration is legal. */ | |
2603 | redeclare_class_template (TREE_TYPE (decl), | |
2604 | current_template_parms); | |
2605 | /* We don't need to create a new TEMPLATE_DECL; just use the | |
2606 | one we already had. */ | |
2607 | tmpl = TYPE_TI_TEMPLATE (TREE_TYPE (decl)); | |
2608 | } | |
2609 | else | |
2610 | { | |
2611 | tmpl = build_template_decl (decl, current_template_parms); | |
2612 | new_template_p = 1; | |
2613 | ||
2614 | if (DECL_LANG_SPECIFIC (decl) | |
2615 | && DECL_TEMPLATE_SPECIALIZATION (decl)) | |
2616 | { | |
2617 | /* A specialization of a member template of a template | |
2618 | class. */ | |
2619 | SET_DECL_TEMPLATE_SPECIALIZATION (tmpl); | |
2620 | DECL_TEMPLATE_INFO (tmpl) = DECL_TEMPLATE_INFO (decl); | |
2621 | DECL_TEMPLATE_INFO (decl) = NULL_TREE; | |
2622 | } | |
2623 | } | |
2624 | } | |
2625 | else | |
2626 | { | |
2627 | tree a, t, current, parms; | |
2628 | int i; | |
2629 | ||
2630 | if (TREE_CODE (decl) == TYPE_DECL) | |
2631 | { | |
2632 | if ((IS_AGGR_TYPE_CODE (TREE_CODE (TREE_TYPE (decl))) | |
2633 | || TREE_CODE (TREE_TYPE (decl)) == ENUMERAL_TYPE) | |
2634 | && TYPE_TEMPLATE_INFO (TREE_TYPE (decl)) | |
2635 | && TYPE_TI_TEMPLATE (TREE_TYPE (decl))) | |
2636 | tmpl = TYPE_TI_TEMPLATE (TREE_TYPE (decl)); | |
2637 | else | |
2638 | { | |
2639 | cp_error ("`%D' does not declare a template type", decl); | |
2640 | return decl; | |
2641 | } | |
2642 | } | |
2643 | else if (! DECL_TEMPLATE_INFO (decl)) | |
2644 | { | |
2645 | cp_error ("template definition of non-template `%#D'", decl); | |
2646 | return decl; | |
2647 | } | |
2648 | else | |
2649 | tmpl = DECL_TI_TEMPLATE (decl); | |
2650 | ||
2651 | if (is_member_template (tmpl) | |
2652 | && DECL_FUNCTION_TEMPLATE_P (tmpl) | |
2653 | && DECL_TEMPLATE_INFO (decl) && DECL_TI_ARGS (decl) | |
2654 | && DECL_TEMPLATE_SPECIALIZATION (decl)) | |
2655 | { | |
2656 | tree new_tmpl; | |
2657 | ||
2658 | /* The declaration is a specialization of a member | |
2659 | template, declared outside the class. Therefore, the | |
2660 | innermost template arguments will be NULL, so we | |
2661 | replace them with the arguments determined by the | |
2662 | earlier call to check_explicit_specialization. */ | |
2663 | args = DECL_TI_ARGS (decl); | |
2664 | ||
2665 | new_tmpl | |
2666 | = build_template_decl (decl, current_template_parms); | |
2667 | DECL_TEMPLATE_RESULT (new_tmpl) = decl; | |
2668 | TREE_TYPE (new_tmpl) = TREE_TYPE (decl); | |
2669 | DECL_TI_TEMPLATE (decl) = new_tmpl; | |
2670 | SET_DECL_TEMPLATE_SPECIALIZATION (new_tmpl); | |
2671 | DECL_TEMPLATE_INFO (new_tmpl) | |
2672 | = tree_cons (tmpl, args, NULL_TREE); | |
2673 | ||
2674 | register_specialization (new_tmpl, | |
2675 | most_general_template (tmpl), | |
2676 | args); | |
2677 | return decl; | |
2678 | } | |
2679 | ||
2680 | /* Make sure the template headers we got make sense. */ | |
2681 | ||
2682 | parms = DECL_TEMPLATE_PARMS (tmpl); | |
2683 | i = TMPL_PARMS_DEPTH (parms); | |
2684 | if (TMPL_ARGS_DEPTH (args) != i) | |
2685 | { | |
2686 | cp_error ("expected %d levels of template parms for `%#D', got %d", | |
2687 | i, decl, TMPL_ARGS_DEPTH (args)); | |
2688 | } | |
2689 | else | |
2690 | for (current = decl; i > 0; --i, parms = TREE_CHAIN (parms)) | |
2691 | { | |
2692 | a = TMPL_ARGS_LEVEL (args, i); | |
2693 | t = INNERMOST_TEMPLATE_PARMS (parms); | |
2694 | ||
2695 | if (TREE_VEC_LENGTH (t) != TREE_VEC_LENGTH (a)) | |
2696 | { | |
2697 | if (current == decl) | |
2698 | cp_error ("got %d template parameters for `%#D'", | |
2699 | TREE_VEC_LENGTH (a), decl); | |
2700 | else | |
2701 | cp_error ("got %d template parameters for `%#T'", | |
2702 | TREE_VEC_LENGTH (a), current); | |
2703 | cp_error (" but %d required", TREE_VEC_LENGTH (t)); | |
2704 | } | |
2705 | ||
2706 | /* Perhaps we should also check that the parms are used in the | |
2707 | appropriate qualifying scopes in the declarator? */ | |
2708 | ||
2709 | if (current == decl) | |
2710 | current = ctx; | |
2711 | else | |
2712 | current = TYPE_CONTEXT (current); | |
2713 | } | |
2714 | } | |
2715 | ||
2716 | DECL_TEMPLATE_RESULT (tmpl) = decl; | |
2717 | TREE_TYPE (tmpl) = TREE_TYPE (decl); | |
2718 | ||
2719 | /* Push template declarations for global functions and types. Note | |
2720 | that we do not try to push a global template friend declared in a | |
2721 | template class; such a thing may well depend on the template | |
2722 | parameters of the class. */ | |
2723 | if (new_template_p && !ctx | |
2724 | && !(is_friend && template_class_depth (current_class_type) > 0)) | |
2725 | tmpl = pushdecl_namespace_level (tmpl); | |
2726 | ||
2727 | if (primary) | |
2728 | DECL_PRIMARY_TEMPLATE (tmpl) = tmpl; | |
2729 | ||
2730 | info = tree_cons (tmpl, args, NULL_TREE); | |
2731 | ||
2732 | if (DECL_IMPLICIT_TYPEDEF_P (decl)) | |
2733 | { | |
2734 | SET_TYPE_TEMPLATE_INFO (TREE_TYPE (tmpl), info); | |
2735 | if ((!ctx || TREE_CODE (ctx) != FUNCTION_DECL) | |
2736 | && TREE_CODE (TREE_TYPE (decl)) != ENUMERAL_TYPE | |
2737 | /* Don't change the name if we've already set it up. */ | |
2738 | && !IDENTIFIER_TEMPLATE (DECL_NAME (decl))) | |
2739 | DECL_NAME (decl) = classtype_mangled_name (TREE_TYPE (decl)); | |
2740 | } | |
2741 | else if (DECL_LANG_SPECIFIC (decl)) | |
2742 | DECL_TEMPLATE_INFO (decl) = info; | |
2743 | ||
2744 | return DECL_TEMPLATE_RESULT (tmpl); | |
2745 | } | |
2746 | ||
2747 | tree | |
2748 | push_template_decl (decl) | |
2749 | tree decl; | |
2750 | { | |
2751 | return push_template_decl_real (decl, 0); | |
2752 | } | |
2753 | ||
2754 | /* Called when a class template TYPE is redeclared with the indicated | |
2755 | template PARMS, e.g.: | |
2756 | ||
2757 | template <class T> struct S; | |
2758 | template <class T> struct S {}; */ | |
2759 | ||
2760 | void | |
2761 | redeclare_class_template (type, parms) | |
2762 | tree type; | |
2763 | tree parms; | |
2764 | { | |
2765 | tree tmpl; | |
2766 | tree tmpl_parms; | |
2767 | int i; | |
2768 | ||
2769 | if (!TYPE_TEMPLATE_INFO (type)) | |
2770 | { | |
2771 | cp_error ("`%T' is not a template type", type); | |
2772 | return; | |
2773 | } | |
2774 | ||
2775 | tmpl = TYPE_TI_TEMPLATE (type); | |
2776 | if (!PRIMARY_TEMPLATE_P (tmpl)) | |
2777 | /* The type is nested in some template class. Nothing to worry | |
2778 | about here; there are no new template parameters for the nested | |
2779 | type. */ | |
2780 | return; | |
2781 | ||
2782 | parms = INNERMOST_TEMPLATE_PARMS (parms); | |
2783 | tmpl_parms = DECL_INNERMOST_TEMPLATE_PARMS (tmpl); | |
2784 | ||
2785 | if (TREE_VEC_LENGTH (parms) != TREE_VEC_LENGTH (tmpl_parms)) | |
2786 | { | |
2787 | cp_error_at ("previous declaration `%D'", tmpl); | |
2788 | cp_error ("used %d template parameter%s instead of %d", | |
2789 | TREE_VEC_LENGTH (tmpl_parms), | |
2790 | TREE_VEC_LENGTH (tmpl_parms) == 1 ? "" : "s", | |
2791 | TREE_VEC_LENGTH (parms)); | |
2792 | return; | |
2793 | } | |
2794 | ||
2795 | for (i = 0; i < TREE_VEC_LENGTH (tmpl_parms); ++i) | |
2796 | { | |
2797 | tree tmpl_parm = TREE_VALUE (TREE_VEC_ELT (tmpl_parms, i)); | |
2798 | tree parm = TREE_VALUE (TREE_VEC_ELT (parms, i)); | |
2799 | tree tmpl_default = TREE_PURPOSE (TREE_VEC_ELT (tmpl_parms, i)); | |
2800 | tree parm_default = TREE_PURPOSE (TREE_VEC_ELT (parms, i)); | |
2801 | ||
2802 | if (TREE_CODE (tmpl_parm) != TREE_CODE (parm)) | |
2803 | { | |
2804 | cp_error_at ("template parameter `%#D'", tmpl_parm); | |
2805 | cp_error ("redeclared here as `%#D'", parm); | |
2806 | return; | |
2807 | } | |
2808 | ||
2809 | if (tmpl_default != NULL_TREE && parm_default != NULL_TREE) | |
2810 | { | |
2811 | /* We have in [temp.param]: | |
2812 | ||
2813 | A template-parameter may not be given default arguments | |
2814 | by two different declarations in the same scope. */ | |
2815 | cp_error ("redefinition of default argument for `%#D'", parm); | |
2816 | cp_error_at (" original definition appeared here", tmpl_parm); | |
2817 | return; | |
2818 | } | |
2819 | ||
2820 | if (parm_default != NULL_TREE) | |
2821 | /* Update the previous template parameters (which are the ones | |
2822 | that will really count) with the new default value. */ | |
2823 | TREE_PURPOSE (TREE_VEC_ELT (tmpl_parms, i)) = parm_default; | |
2824 | else if (tmpl_default != NULL_TREE) | |
2825 | /* Update the new parameters, too; they'll be used as the | |
2826 | parameters for any members. */ | |
2827 | TREE_PURPOSE (TREE_VEC_ELT (parms, i)) = tmpl_default; | |
2828 | } | |
2829 | } | |
2830 | ||
2831 | /* Attempt to convert the non-type template parameter EXPR to the | |
2832 | indicated TYPE. If the conversion is successful, return the | |
2833 | converted value. If the conversion is unsuccessful, return | |
2834 | NULL_TREE if we issued an error message, or error_mark_node if we | |
2835 | did not. We issue error messages for out-and-out bad template | |
2836 | parameters, but not simply because the conversion failed, since we | |
2837 | might be just trying to do argument deduction. By the time this | |
2838 | function is called, neither TYPE nor EXPR may make use of template | |
2839 | parameters. */ | |
2840 | ||
2841 | static tree | |
2842 | convert_nontype_argument (type, expr) | |
2843 | tree type; | |
2844 | tree expr; | |
2845 | { | |
2846 | tree expr_type = TREE_TYPE (expr); | |
2847 | ||
2848 | /* A template-argument for a non-type, non-template | |
2849 | template-parameter shall be one of: | |
2850 | ||
2851 | --an integral constant-expression of integral or enumeration | |
2852 | type; or | |
2853 | ||
2854 | --the name of a non-type template-parameter; or | |
2855 | ||
2856 | --the name of an object or function with external linkage, | |
2857 | including function templates and function template-ids but | |
2858 | excluding non-static class members, expressed as id-expression; | |
2859 | or | |
2860 | ||
2861 | --the address of an object or function with external linkage, | |
2862 | including function templates and function template-ids but | |
2863 | excluding non-static class members, expressed as & id-expression | |
2864 | where the & is optional if the name refers to a function or | |
2865 | array; or | |
2866 | ||
2867 | --a pointer to member expressed as described in _expr.unary.op_. */ | |
2868 | ||
2869 | /* An integral constant-expression can include const variables or | |
2870 | enumerators. Simplify things by folding them to their values, | |
2871 | unless we're about to bind the declaration to a reference | |
2872 | parameter. */ | |
2873 | if (INTEGRAL_TYPE_P (expr_type) | |
2874 | && TREE_CODE (type) != REFERENCE_TYPE) | |
2875 | expr = decl_constant_value (expr); | |
2876 | ||
2877 | if (is_overloaded_fn (expr)) | |
2878 | /* OK for now. We'll check that it has external linkage later. | |
2879 | Check this first since if expr_type is the unknown_type_node | |
2880 | we would otherwise complain below. */ | |
2881 | ; | |
2882 | else if (TYPE_PTRMEM_P (expr_type) | |
2883 | || TYPE_PTRMEMFUNC_P (expr_type)) | |
2884 | { | |
2885 | if (TREE_CODE (expr) != PTRMEM_CST) | |
2886 | goto bad_argument; | |
2887 | } | |
2888 | else if (TYPE_PTR_P (expr_type) | |
2889 | || TYPE_PTRMEM_P (expr_type) | |
2890 | || TREE_CODE (expr_type) == ARRAY_TYPE | |
2891 | || TREE_CODE (type) == REFERENCE_TYPE | |
2892 | /* If expr is the address of an overloaded function, we | |
2893 | will get the unknown_type_node at this point. */ | |
2894 | || expr_type == unknown_type_node) | |
2895 | { | |
2896 | tree referent; | |
2897 | tree e = expr; | |
2898 | STRIP_NOPS (e); | |
2899 | ||
2900 | if (TREE_CODE (expr_type) == ARRAY_TYPE | |
2901 | || (TREE_CODE (type) == REFERENCE_TYPE | |
2902 | && TREE_CODE (e) != ADDR_EXPR)) | |
2903 | referent = e; | |
2904 | else | |
2905 | { | |
2906 | if (TREE_CODE (e) != ADDR_EXPR) | |
2907 | { | |
2908 | bad_argument: | |
2909 | cp_error ("`%E' is not a valid template argument", expr); | |
2910 | if (TYPE_PTR_P (expr_type)) | |
2911 | { | |
2912 | if (TREE_CODE (TREE_TYPE (expr_type)) == FUNCTION_TYPE) | |
2913 | cp_error ("it must be the address of a function with external linkage"); | |
2914 | else | |
2915 | cp_error ("it must be the address of an object with external linkage"); | |
2916 | } | |
2917 | else if (TYPE_PTRMEM_P (expr_type) | |
2918 | || TYPE_PTRMEMFUNC_P (expr_type)) | |
2919 | cp_error ("it must be a pointer-to-member of the form `&X::Y'"); | |
2920 | ||
2921 | return NULL_TREE; | |
2922 | } | |
2923 | ||
2924 | referent = TREE_OPERAND (e, 0); | |
2925 | STRIP_NOPS (referent); | |
2926 | } | |
2927 | ||
2928 | if (TREE_CODE (referent) == STRING_CST) | |
2929 | { | |
2930 | cp_error ("string literal %E is not a valid template argument because it is the address of an object with static linkage", | |
2931 | referent); | |
2932 | return NULL_TREE; | |
2933 | } | |
2934 | ||
2935 | if (is_overloaded_fn (referent)) | |
2936 | /* We'll check that it has external linkage later. */ | |
2937 | ; | |
2938 | else if (TREE_CODE (referent) != VAR_DECL) | |
2939 | goto bad_argument; | |
2940 | else if (!DECL_EXTERNAL_LINKAGE_P (referent)) | |
2941 | { | |
2942 | cp_error ("address of non-extern `%E' cannot be used as template argument", referent); | |
2943 | return error_mark_node; | |
2944 | } | |
2945 | } | |
2946 | else if (INTEGRAL_TYPE_P (expr_type) | |
2947 | || TYPE_PTRMEM_P (expr_type) | |
2948 | || TYPE_PTRMEMFUNC_P (expr_type)) | |
2949 | { | |
2950 | if (! TREE_CONSTANT (expr)) | |
2951 | { | |
2952 | non_constant: | |
2953 | cp_error ("non-constant `%E' cannot be used as template argument", | |
2954 | expr); | |
2955 | return NULL_TREE; | |
2956 | } | |
2957 | } | |
2958 | else | |
2959 | { | |
2960 | cp_error ("object `%E' cannot be used as template argument", expr); | |
2961 | return NULL_TREE; | |
2962 | } | |
2963 | ||
2964 | switch (TREE_CODE (type)) | |
2965 | { | |
2966 | case INTEGER_TYPE: | |
2967 | case BOOLEAN_TYPE: | |
2968 | case ENUMERAL_TYPE: | |
2969 | /* For a non-type template-parameter of integral or enumeration | |
2970 | type, integral promotions (_conv.prom_) and integral | |
2971 | conversions (_conv.integral_) are applied. */ | |
2972 | if (!INTEGRAL_TYPE_P (expr_type)) | |
2973 | return error_mark_node; | |
2974 | ||
2975 | /* It's safe to call digest_init in this case; we know we're | |
2976 | just converting one integral constant expression to another. */ | |
2977 | expr = digest_init (type, expr, (tree*) 0); | |
2978 | ||
2979 | if (TREE_CODE (expr) != INTEGER_CST) | |
2980 | /* Curiously, some TREE_CONSTANT integral expressions do not | |
2981 | simplify to integer constants. For example, `3 % 0', | |
2982 | remains a TRUNC_MOD_EXPR. */ | |
2983 | goto non_constant; | |
2984 | ||
2985 | return expr; | |
2986 | ||
2987 | case POINTER_TYPE: | |
2988 | { | |
2989 | tree type_pointed_to = TREE_TYPE (type); | |
2990 | ||
2991 | if (TYPE_PTRMEM_P (type)) | |
2992 | { | |
2993 | tree e; | |
2994 | ||
2995 | /* For a non-type template-parameter of type pointer to data | |
2996 | member, qualification conversions (_conv.qual_) are | |
2997 | applied. */ | |
2998 | e = perform_qualification_conversions (type, expr); | |
2999 | if (TREE_CODE (e) == NOP_EXPR) | |
3000 | /* The call to perform_qualification_conversions will | |
3001 | insert a NOP_EXPR over EXPR to do express conversion, | |
3002 | if necessary. But, that will confuse us if we use | |
3003 | this (converted) template parameter to instantiate | |
3004 | another template; then the thing will not look like a | |
3005 | valid template argument. So, just make a new | |
3006 | constant, of the appropriate type. */ | |
3007 | e = make_ptrmem_cst (type, PTRMEM_CST_MEMBER (expr)); | |
3008 | return e; | |
3009 | } | |
3010 | else if (TREE_CODE (type_pointed_to) == FUNCTION_TYPE) | |
3011 | { | |
3012 | /* For a non-type template-parameter of type pointer to | |
3013 | function, only the function-to-pointer conversion | |
3014 | (_conv.func_) is applied. If the template-argument | |
3015 | represents a set of overloaded functions (or a pointer to | |
3016 | such), the matching function is selected from the set | |
3017 | (_over.over_). */ | |
3018 | tree fns; | |
3019 | tree fn; | |
3020 | ||
3021 | if (TREE_CODE (expr) == ADDR_EXPR) | |
3022 | fns = TREE_OPERAND (expr, 0); | |
3023 | else | |
3024 | fns = expr; | |
3025 | ||
3026 | fn = instantiate_type (type_pointed_to, fns, itf_none); | |
3027 | ||
3028 | if (fn == error_mark_node) | |
3029 | return error_mark_node; | |
3030 | ||
3031 | if (!DECL_EXTERNAL_LINKAGE_P (fn)) | |
3032 | { | |
3033 | if (really_overloaded_fn (fns)) | |
3034 | return error_mark_node; | |
3035 | else | |
3036 | goto bad_argument; | |
3037 | } | |
3038 | ||
3039 | expr = build_unary_op (ADDR_EXPR, fn, 0); | |
3040 | ||
3041 | my_friendly_assert (same_type_p (type, TREE_TYPE (expr)), | |
3042 | 0); | |
3043 | return expr; | |
3044 | } | |
3045 | else | |
3046 | { | |
3047 | /* For a non-type template-parameter of type pointer to | |
3048 | object, qualification conversions (_conv.qual_) and the | |
3049 | array-to-pointer conversion (_conv.array_) are applied. | |
3050 | [Note: In particular, neither the null pointer conversion | |
3051 | (_conv.ptr_) nor the derived-to-base conversion | |
3052 | (_conv.ptr_) are applied. Although 0 is a valid | |
3053 | template-argument for a non-type template-parameter of | |
3054 | integral type, it is not a valid template-argument for a | |
3055 | non-type template-parameter of pointer type.] | |
3056 | ||
3057 | The call to decay_conversion performs the | |
3058 | array-to-pointer conversion, if appropriate. */ | |
3059 | expr = decay_conversion (expr); | |
3060 | ||
3061 | if (expr == error_mark_node) | |
3062 | return error_mark_node; | |
3063 | else | |
3064 | return perform_qualification_conversions (type, expr); | |
3065 | } | |
3066 | } | |
3067 | break; | |
3068 | ||
3069 | case REFERENCE_TYPE: | |
3070 | { | |
3071 | tree type_referred_to = TREE_TYPE (type); | |
3072 | ||
3073 | /* If this expression already has reference type, get the | |
3074 | underling object. */ | |
3075 | if (TREE_CODE (expr_type) == REFERENCE_TYPE) | |
3076 | { | |
3077 | my_friendly_assert (TREE_CODE (expr) == ADDR_EXPR, 20000604); | |
3078 | expr = TREE_OPERAND (expr, 0); | |
3079 | expr_type = TREE_TYPE (expr); | |
3080 | } | |
3081 | ||
3082 | if (TREE_CODE (type_referred_to) == FUNCTION_TYPE) | |
3083 | { | |
3084 | /* For a non-type template-parameter of type reference to | |
3085 | function, no conversions apply. If the | |
3086 | template-argument represents a set of overloaded | |
3087 | functions, the matching function is selected from the | |
3088 | set (_over.over_). */ | |
3089 | tree fn; | |
3090 | ||
3091 | fn = instantiate_type (type_referred_to, expr, itf_none); | |
3092 | ||
3093 | if (fn == error_mark_node) | |
3094 | return error_mark_node; | |
3095 | ||
3096 | if (!DECL_EXTERNAL_LINKAGE_P (fn)) | |
3097 | { | |
3098 | if (really_overloaded_fn (expr)) | |
3099 | /* Don't issue an error here; we might get a different | |
3100 | function if the overloading had worked out | |
3101 | differently. */ | |
3102 | return error_mark_node; | |
3103 | else | |
3104 | goto bad_argument; | |
3105 | } | |
3106 | ||
3107 | my_friendly_assert (same_type_p (type_referred_to, | |
3108 | TREE_TYPE (fn)), | |
3109 | 0); | |
3110 | ||
3111 | expr = fn; | |
3112 | } | |
3113 | else | |
3114 | { | |
3115 | /* For a non-type template-parameter of type reference to | |
3116 | object, no conversions apply. The type referred to by the | |
3117 | reference may be more cv-qualified than the (otherwise | |
3118 | identical) type of the template-argument. The | |
3119 | template-parameter is bound directly to the | |
3120 | template-argument, which must be an lvalue. */ | |
3121 | if (!same_type_p (TYPE_MAIN_VARIANT (expr_type), | |
3122 | TYPE_MAIN_VARIANT (type_referred_to)) | |
3123 | || !at_least_as_qualified_p (type_referred_to, | |
3124 | expr_type) | |
3125 | || !real_lvalue_p (expr)) | |
3126 | return error_mark_node; | |
3127 | } | |
3128 | ||
3129 | mark_addressable (expr); | |
3130 | return build1 (ADDR_EXPR, type, expr); | |
3131 | } | |
3132 | break; | |
3133 | ||
3134 | case RECORD_TYPE: | |
3135 | { | |
3136 | my_friendly_assert (TYPE_PTRMEMFUNC_P (type), 20010112); | |
3137 | ||
3138 | /* For a non-type template-parameter of type pointer to member | |
3139 | function, no conversions apply. If the template-argument | |
3140 | represents a set of overloaded member functions, the | |
3141 | matching member function is selected from the set | |
3142 | (_over.over_). */ | |
3143 | ||
3144 | if (!TYPE_PTRMEMFUNC_P (expr_type) && | |
3145 | expr_type != unknown_type_node) | |
3146 | return error_mark_node; | |
3147 | ||
3148 | if (TREE_CODE (expr) == PTRMEM_CST) | |
3149 | { | |
3150 | /* A ptr-to-member constant. */ | |
3151 | if (!same_type_p (type, expr_type)) | |
3152 | return error_mark_node; | |
3153 | else | |
3154 | return expr; | |
3155 | } | |
3156 | ||
3157 | if (TREE_CODE (expr) != ADDR_EXPR) | |
3158 | return error_mark_node; | |
3159 | ||
3160 | expr = instantiate_type (type, expr, itf_none); | |
3161 | ||
3162 | if (expr == error_mark_node) | |
3163 | return error_mark_node; | |
3164 | ||
3165 | my_friendly_assert (same_type_p (type, TREE_TYPE (expr)), | |
3166 | 0); | |
3167 | return expr; | |
3168 | } | |
3169 | break; | |
3170 | ||
3171 | default: | |
3172 | /* All non-type parameters must have one of these types. */ | |
3173 | my_friendly_abort (0); | |
3174 | break; | |
3175 | } | |
3176 | ||
3177 | return error_mark_node; | |
3178 | } | |
3179 | ||
3180 | /* Return 1 if PARM_PARMS and ARG_PARMS matches using rule for | |
3181 | template template parameters. Both PARM_PARMS and ARG_PARMS are | |
3182 | vectors of TREE_LIST nodes containing TYPE_DECL, TEMPLATE_DECL | |
3183 | or PARM_DECL. | |
3184 | ||
3185 | ARG_PARMS may contain more parameters than PARM_PARMS. If this is | |
3186 | the case, then extra parameters must have default arguments. | |
3187 | ||
3188 | Consider the example: | |
3189 | template <class T, class Allocator = allocator> class vector; | |
3190 | template<template <class U> class TT> class C; | |
3191 | ||
3192 | C<vector> is a valid instantiation. PARM_PARMS for the above code | |
3193 | contains a TYPE_DECL (for U), ARG_PARMS contains two TYPE_DECLs (for | |
3194 | T and Allocator) and OUTER_ARGS contains the argument that is used to | |
3195 | substitute the TT parameter. */ | |
3196 | ||
3197 | static int | |
3198 | coerce_template_template_parms (parm_parms, arg_parms, complain, | |
3199 | in_decl, outer_args) | |
3200 | tree parm_parms, arg_parms; | |
3201 | int complain; | |
3202 | tree in_decl, outer_args; | |
3203 | { | |
3204 | int nparms, nargs, i; | |
3205 | tree parm, arg; | |
3206 | ||
3207 | my_friendly_assert (TREE_CODE (parm_parms) == TREE_VEC, 0); | |
3208 | my_friendly_assert (TREE_CODE (arg_parms) == TREE_VEC, 0); | |
3209 | ||
3210 | nparms = TREE_VEC_LENGTH (parm_parms); | |
3211 | nargs = TREE_VEC_LENGTH (arg_parms); | |
3212 | ||
3213 | /* The rule here is opposite of coerce_template_parms. */ | |
3214 | if (nargs < nparms | |
3215 | || (nargs > nparms | |
3216 | && TREE_PURPOSE (TREE_VEC_ELT (arg_parms, nparms)) == NULL_TREE)) | |
3217 | return 0; | |
3218 | ||
3219 | for (i = 0; i < nparms; ++i) | |
3220 | { | |
3221 | parm = TREE_VALUE (TREE_VEC_ELT (parm_parms, i)); | |
3222 | arg = TREE_VALUE (TREE_VEC_ELT (arg_parms, i)); | |
3223 | ||
3224 | if (arg == NULL_TREE || arg == error_mark_node | |
3225 | || parm == NULL_TREE || parm == error_mark_node) | |
3226 | return 0; | |
3227 | ||
3228 | if (TREE_CODE (arg) != TREE_CODE (parm)) | |
3229 | return 0; | |
3230 | ||
3231 | switch (TREE_CODE (parm)) | |
3232 | { | |
3233 | case TYPE_DECL: | |
3234 | break; | |
3235 | ||
3236 | case TEMPLATE_DECL: | |
3237 | /* We encounter instantiations of templates like | |
3238 | template <template <template <class> class> class TT> | |
3239 | class C; */ | |
3240 | { | |
3241 | tree parmparm = DECL_INNERMOST_TEMPLATE_PARMS (parm); | |
3242 | tree argparm = DECL_INNERMOST_TEMPLATE_PARMS (arg); | |
3243 | ||
3244 | if (!coerce_template_template_parms (parmparm, argparm, | |
3245 | complain, in_decl, | |
3246 | outer_args)) | |
3247 | return 0; | |
3248 | } | |
3249 | break; | |
3250 | ||
3251 | case PARM_DECL: | |
3252 | /* The tsubst call is used to handle cases such as | |
3253 | template <class T, template <T> class TT> class D; | |
3254 | i.e. the parameter list of TT depends on earlier parameters. */ | |
3255 | if (!same_type_p (tsubst (TREE_TYPE (parm), outer_args, | |
3256 | complain, in_decl), | |
3257 | TREE_TYPE (arg))) | |
3258 | return 0; | |
3259 | break; | |
3260 | ||
3261 | default: | |
3262 | my_friendly_abort (0); | |
3263 | } | |
3264 | } | |
3265 | return 1; | |
3266 | } | |
3267 | ||
3268 | /* Convert the indicated template ARG as necessary to match the | |
3269 | indicated template PARM. Returns the converted ARG, or | |
3270 | error_mark_node if the conversion was unsuccessful. Error messages | |
3271 | are issued if COMPLAIN is non-zero. This conversion is for the Ith | |
3272 | parameter in the parameter list. ARGS is the full set of template | |
3273 | arguments deduced so far. */ | |
3274 | ||
3275 | static tree | |
3276 | convert_template_argument (parm, arg, args, complain, i, in_decl) | |
3277 | tree parm; | |
3278 | tree arg; | |
3279 | tree args; | |
3280 | int complain; | |
3281 | int i; | |
3282 | tree in_decl; | |
3283 | { | |
3284 | tree val; | |
3285 | tree inner_args; | |
3286 | int is_type, requires_type, is_tmpl_type, requires_tmpl_type; | |
3287 | ||
3288 | inner_args = INNERMOST_TEMPLATE_ARGS (args); | |
3289 | ||
3290 | if (TREE_CODE (arg) == TREE_LIST | |
3291 | && TREE_TYPE (arg) != NULL_TREE | |
3292 | && TREE_CODE (TREE_TYPE (arg)) == OFFSET_TYPE) | |
3293 | { | |
3294 | /* The template argument was the name of some | |
3295 | member function. That's usually | |
3296 | illegal, but static members are OK. In any | |
3297 | case, grab the underlying fields/functions | |
3298 | and issue an error later if required. */ | |
3299 | arg = TREE_VALUE (arg); | |
3300 | TREE_TYPE (arg) = unknown_type_node; | |
3301 | } | |
3302 | ||
3303 | requires_tmpl_type = TREE_CODE (parm) == TEMPLATE_DECL; | |
3304 | requires_type = (TREE_CODE (parm) == TYPE_DECL | |
3305 | || requires_tmpl_type); | |
3306 | ||
3307 | /* Check if it is a class template. If REQUIRES_TMPL_TYPE is true, | |
3308 | we also accept implicitly created TYPE_DECL as a valid argument. | |
3309 | This is necessary to handle the case where we pass a template name | |
3310 | to a template template parameter in a scope where we've derived from | |
3311 | in instantiation of that template, so the template name refers to that | |
3312 | instantiation. We really ought to handle this better. */ | |
3313 | is_tmpl_type | |
3314 | = ((TREE_CODE (arg) == TEMPLATE_DECL | |
3315 | && TREE_CODE (DECL_TEMPLATE_RESULT (arg)) == TYPE_DECL) | |
3316 | || TREE_CODE (arg) == TEMPLATE_TEMPLATE_PARM | |
3317 | || (TREE_CODE (arg) == RECORD_TYPE | |
3318 | && CLASSTYPE_TEMPLATE_INFO (arg) | |
3319 | && TREE_CODE (TYPE_NAME (arg)) == TYPE_DECL | |
3320 | && DECL_ARTIFICIAL (TYPE_NAME (arg)) | |
3321 | && requires_tmpl_type | |
3322 | && is_base_of_enclosing_class (arg, current_class_type))); | |
3323 | if (is_tmpl_type && TREE_CODE (arg) == TEMPLATE_TEMPLATE_PARM) | |
3324 | arg = TYPE_STUB_DECL (arg); | |
3325 | else if (is_tmpl_type && TREE_CODE (arg) == RECORD_TYPE) | |
3326 | arg = CLASSTYPE_TI_TEMPLATE (arg); | |
3327 | ||
3328 | is_type = TYPE_P (arg) || is_tmpl_type; | |
3329 | ||
3330 | if (requires_type && ! is_type && TREE_CODE (arg) == SCOPE_REF | |
3331 | && TREE_CODE (TREE_OPERAND (arg, 0)) == TEMPLATE_TYPE_PARM) | |
3332 | { | |
3333 | cp_pedwarn ("to refer to a type member of a template parameter, use `typename %E'", arg); | |
3334 | ||
3335 | arg = make_typename_type (TREE_OPERAND (arg, 0), | |
3336 | TREE_OPERAND (arg, 1), | |
3337 | complain); | |
3338 | is_type = 1; | |
3339 | } | |
3340 | if (is_type != requires_type) | |
3341 | { | |
3342 | if (in_decl) | |
3343 | { | |
3344 | if (complain) | |
3345 | { | |
3346 | cp_error ("type/value mismatch at argument %d in template parameter list for `%D'", | |
3347 | i + 1, in_decl); | |
3348 | if (is_type) | |
3349 | cp_error (" expected a constant of type `%T', got `%T'", | |
3350 | TREE_TYPE (parm), | |
3351 | (is_tmpl_type ? DECL_NAME (arg) : arg)); | |
3352 | else | |
3353 | cp_error (" expected a type, got `%E'", arg); | |
3354 | } | |
3355 | } | |
3356 | return error_mark_node; | |
3357 | } | |
3358 | if (is_tmpl_type ^ requires_tmpl_type) | |
3359 | { | |
3360 | if (in_decl && complain) | |
3361 | { | |
3362 | cp_error ("type/value mismatch at argument %d in template parameter list for `%D'", | |
3363 | i + 1, in_decl); | |
3364 | if (is_tmpl_type) | |
3365 | cp_error (" expected a type, got `%T'", DECL_NAME (arg)); | |
3366 | else | |
3367 | cp_error (" expected a class template, got `%T'", arg); | |
3368 | } | |
3369 | return error_mark_node; | |
3370 | } | |
3371 | ||
3372 | if (is_type) | |
3373 | { | |
3374 | if (requires_tmpl_type) | |
3375 | { | |
3376 | tree parmparm = DECL_INNERMOST_TEMPLATE_PARMS (parm); | |
3377 | tree argparm = DECL_INNERMOST_TEMPLATE_PARMS (arg); | |
3378 | ||
3379 | if (coerce_template_template_parms (parmparm, argparm, complain, | |
3380 | in_decl, inner_args)) | |
3381 | { | |
3382 | val = arg; | |
3383 | ||
3384 | /* TEMPLATE_TEMPLATE_PARM node is preferred over | |
3385 | TEMPLATE_DECL. */ | |
3386 | if (val != error_mark_node | |
3387 | && DECL_TEMPLATE_TEMPLATE_PARM_P (val)) | |
3388 | val = TREE_TYPE (val); | |
3389 | } | |
3390 | else | |
3391 | { | |
3392 | if (in_decl && complain) | |
3393 | { | |
3394 | cp_error ("type/value mismatch at argument %d in template parameter list for `%D'", | |
3395 | i + 1, in_decl); | |
3396 | cp_error (" expected a template of type `%D', got `%D'", parm, arg); | |
3397 | } | |
3398 | ||
3399 | val = error_mark_node; | |
3400 | } | |
3401 | } | |
3402 | else | |
3403 | { | |
3404 | val = groktypename (arg); | |
3405 | if (! processing_template_decl) | |
3406 | { | |
3407 | /* [basic.link]: A name with no linkage (notably, the | |
3408 | name of a class or enumeration declared in a local | |
3409 | scope) shall not be used to declare an entity with | |
3410 | linkage. This implies that names with no linkage | |
3411 | cannot be used as template arguments. */ | |
3412 | tree t = no_linkage_check (val); | |
3413 | if (t) | |
3414 | { | |
3415 | if (ANON_AGGRNAME_P (TYPE_IDENTIFIER (t))) | |
3416 | cp_pedwarn | |
3417 | ("template-argument `%T' uses anonymous type", val); | |
3418 | else | |
3419 | cp_error | |
3420 | ("template-argument `%T' uses local type `%T'", | |
3421 | val, t); | |
3422 | return error_mark_node; | |
3423 | } | |
3424 | } | |
3425 | } | |
3426 | } | |
3427 | else | |
3428 | { | |
3429 | tree t = tsubst (TREE_TYPE (parm), args, complain, in_decl); | |
3430 | ||
3431 | if (invalid_nontype_parm_type_p (t, complain)) | |
3432 | return error_mark_node; | |
3433 | ||
3434 | if (processing_template_decl) | |
3435 | arg = maybe_fold_nontype_arg (arg); | |
3436 | ||
3437 | if (!uses_template_parms (arg) && !uses_template_parms (t)) | |
3438 | /* We used to call digest_init here. However, digest_init | |
3439 | will report errors, which we don't want when complain | |
3440 | is zero. More importantly, digest_init will try too | |
3441 | hard to convert things: for example, `0' should not be | |
3442 | converted to pointer type at this point according to | |
3443 | the standard. Accepting this is not merely an | |
3444 | extension, since deciding whether or not these | |
3445 | conversions can occur is part of determining which | |
3446 | function template to call, or whether a given explicit | |
3447 | argument specification is legal. */ | |
3448 | val = convert_nontype_argument (t, arg); | |
3449 | else | |
3450 | val = arg; | |
3451 | ||
3452 | if (val == NULL_TREE) | |
3453 | val = error_mark_node; | |
3454 | else if (val == error_mark_node && complain) | |
3455 | cp_error ("could not convert template argument `%E' to `%T'", | |
3456 | arg, t); | |
3457 | } | |
3458 | ||
3459 | return val; | |
3460 | } | |
3461 | ||
3462 | /* Convert all template arguments to their appropriate types, and | |
3463 | return a vector containing the innermost resulting template | |
3464 | arguments. If any error occurs, return error_mark_node, and, if | |
3465 | COMPLAIN is non-zero, issue an error message. Some error messages | |
3466 | are issued even if COMPLAIN is zero; for instance, if a template | |
3467 | argument is composed from a local class. | |
3468 | ||
3469 | If REQUIRE_ALL_ARGUMENTS is non-zero, all arguments must be | |
3470 | provided in ARGLIST, or else trailing parameters must have default | |
3471 | values. If REQUIRE_ALL_ARGUMENTS is zero, we will attempt argument | |
3472 | deduction for any unspecified trailing arguments. */ | |
3473 | ||
3474 | static tree | |
3475 | coerce_template_parms (parms, args, in_decl, | |
3476 | complain, | |
3477 | require_all_arguments) | |
3478 | tree parms, args; | |
3479 | tree in_decl; | |
3480 | int complain; | |
3481 | int require_all_arguments; | |
3482 | { | |
3483 | int nparms, nargs, i, lost = 0; | |
3484 | tree inner_args; | |
3485 | tree new_args; | |
3486 | tree new_inner_args; | |
3487 | ||
3488 | inner_args = INNERMOST_TEMPLATE_ARGS (args); | |
3489 | nargs = NUM_TMPL_ARGS (inner_args); | |
3490 | nparms = TREE_VEC_LENGTH (parms); | |
3491 | ||
3492 | if (nargs > nparms | |
3493 | || (nargs < nparms | |
3494 | && require_all_arguments | |
3495 | && TREE_PURPOSE (TREE_VEC_ELT (parms, nargs)) == NULL_TREE)) | |
3496 | { | |
3497 | if (complain) | |
3498 | { | |
3499 | cp_error ("wrong number of template arguments (%d, should be %d)", | |
3500 | nargs, nparms); | |
3501 | ||
3502 | if (in_decl) | |
3503 | cp_error_at ("provided for `%D'", in_decl); | |
3504 | } | |
3505 | ||
3506 | return error_mark_node; | |
3507 | } | |
3508 | ||
3509 | new_inner_args = make_tree_vec (nparms); | |
3510 | new_args = add_outermost_template_args (args, new_inner_args); | |
3511 | for (i = 0; i < nparms; i++) | |
3512 | { | |
3513 | tree arg; | |
3514 | tree parm; | |
3515 | ||
3516 | /* Get the Ith template parameter. */ | |
3517 | parm = TREE_VEC_ELT (parms, i); | |
3518 | ||
3519 | /* Calculate the Ith argument. */ | |
3520 | if (inner_args && TREE_CODE (inner_args) == TREE_LIST) | |
3521 | { | |
3522 | arg = TREE_VALUE (inner_args); | |
3523 | inner_args = TREE_CHAIN (inner_args); | |
3524 | } | |
3525 | else if (i < nargs) | |
3526 | arg = TREE_VEC_ELT (inner_args, i); | |
3527 | /* If no template argument was supplied, look for a default | |
3528 | value. */ | |
3529 | else if (TREE_PURPOSE (parm) == NULL_TREE) | |
3530 | { | |
3531 | /* There was no default value. */ | |
3532 | my_friendly_assert (!require_all_arguments, 0); | |
3533 | break; | |
3534 | } | |
3535 | else if (TREE_CODE (TREE_VALUE (parm)) == TYPE_DECL) | |
3536 | arg = tsubst (TREE_PURPOSE (parm), new_args, complain, in_decl); | |
3537 | else | |
3538 | arg = tsubst_expr (TREE_PURPOSE (parm), new_args, complain, | |
3539 | in_decl); | |
3540 | ||
3541 | /* Now, convert the Ith argument, as necessary. */ | |
3542 | if (arg == NULL_TREE) | |
3543 | /* We're out of arguments. */ | |
3544 | { | |
3545 | my_friendly_assert (!require_all_arguments, 0); | |
3546 | break; | |
3547 | } | |
3548 | else if (arg == error_mark_node) | |
3549 | { | |
3550 | cp_error ("template argument %d is invalid", i + 1); | |
3551 | arg = error_mark_node; | |
3552 | } | |
3553 | else | |
3554 | arg = convert_template_argument (TREE_VALUE (parm), | |
3555 | arg, new_args, complain, i, | |
3556 | in_decl); | |
3557 | ||
3558 | if (arg == error_mark_node) | |
3559 | lost++; | |
3560 | TREE_VEC_ELT (new_inner_args, i) = arg; | |
3561 | } | |
3562 | ||
3563 | if (lost) | |
3564 | return error_mark_node; | |
3565 | ||
3566 | return new_inner_args; | |
3567 | } | |
3568 | ||
3569 | /* Returns 1 if template args OT and NT are equivalent. */ | |
3570 | ||
3571 | static int | |
3572 | template_args_equal (ot, nt) | |
3573 | tree ot, nt; | |
3574 | { | |
3575 | if (nt == ot) | |
3576 | return 1; | |
3577 | ||
3578 | if (TREE_CODE (nt) == TREE_VEC) | |
3579 | /* For member templates */ | |
3580 | return TREE_CODE (ot) == TREE_VEC && comp_template_args (ot, nt); | |
3581 | else if (TYPE_P (nt)) | |
3582 | return TYPE_P (ot) && same_type_p (ot, nt); | |
3583 | else if (TREE_CODE (ot) == TREE_VEC || TYPE_P (ot)) | |
3584 | return 0; | |
3585 | else | |
3586 | return (cp_tree_equal (ot, nt) > 0); | |
3587 | } | |
3588 | ||
3589 | /* Returns 1 iff the OLDARGS and NEWARGS are in fact identical sets | |
3590 | of template arguments. Returns 0 otherwise. */ | |
3591 | ||
3592 | int | |
3593 | comp_template_args (oldargs, newargs) | |
3594 | tree oldargs, newargs; | |
3595 | { | |
3596 | int i; | |
3597 | ||
3598 | if (TREE_VEC_LENGTH (oldargs) != TREE_VEC_LENGTH (newargs)) | |
3599 | return 0; | |
3600 | ||
3601 | for (i = 0; i < TREE_VEC_LENGTH (oldargs); ++i) | |
3602 | { | |
3603 | tree nt = TREE_VEC_ELT (newargs, i); | |
3604 | tree ot = TREE_VEC_ELT (oldargs, i); | |
3605 | ||
3606 | if (! template_args_equal (ot, nt)) | |
3607 | return 0; | |
3608 | } | |
3609 | return 1; | |
3610 | } | |
3611 | ||
3612 | /* Given class template name and parameter list, produce a user-friendly name | |
3613 | for the instantiation. */ | |
3614 | ||
3615 | static char * | |
3616 | mangle_class_name_for_template (name, parms, arglist) | |
3617 | const char *name; | |
3618 | tree parms, arglist; | |
3619 | { | |
3620 | static struct obstack scratch_obstack; | |
3621 | static char *scratch_firstobj; | |
3622 | int i, nparms; | |
3623 | ||
3624 | if (!scratch_firstobj) | |
3625 | gcc_obstack_init (&scratch_obstack); | |
3626 | else | |
3627 | obstack_free (&scratch_obstack, scratch_firstobj); | |
3628 | scratch_firstobj = obstack_alloc (&scratch_obstack, 1); | |
3629 | ||
3630 | #define ccat(c) obstack_1grow (&scratch_obstack, (c)); | |
3631 | #define cat(s) obstack_grow (&scratch_obstack, (s), strlen (s)) | |
3632 | ||
3633 | cat (name); | |
3634 | ccat ('<'); | |
3635 | nparms = TREE_VEC_LENGTH (parms); | |
3636 | arglist = INNERMOST_TEMPLATE_ARGS (arglist); | |
3637 | my_friendly_assert (nparms == TREE_VEC_LENGTH (arglist), 268); | |
3638 | for (i = 0; i < nparms; i++) | |
3639 | { | |
3640 | tree parm = TREE_VALUE (TREE_VEC_ELT (parms, i)); | |
3641 | tree arg = TREE_VEC_ELT (arglist, i); | |
3642 | ||
3643 | if (i) | |
3644 | ccat (','); | |
3645 | ||
3646 | if (TREE_CODE (parm) == TYPE_DECL) | |
3647 | { | |
3648 | cat (type_as_string (arg, TFF_CHASE_TYPEDEF)); | |
3649 | continue; | |
3650 | } | |
3651 | else if (TREE_CODE (parm) == TEMPLATE_DECL) | |
3652 | { | |
3653 | if (TREE_CODE (arg) == TEMPLATE_DECL) | |
3654 | { | |
3655 | /* Already substituted with real template. Just output | |
3656 | the template name here */ | |
3657 | tree context = DECL_CONTEXT (arg); | |
3658 | if (context) | |
3659 | { | |
3660 | /* The template may be defined in a namespace, or | |
3661 | may be a member template. */ | |
3662 | my_friendly_assert (TREE_CODE (context) == NAMESPACE_DECL | |
3663 | || CLASS_TYPE_P (context), | |
3664 | 980422); | |
3665 | cat(decl_as_string (DECL_CONTEXT (arg), TFF_PLAIN_IDENTIFIER)); | |
3666 | cat("::"); | |
3667 | } | |
3668 | cat (IDENTIFIER_POINTER (DECL_NAME (arg))); | |
3669 | } | |
3670 | else | |
3671 | /* Output the parameter declaration */ | |
3672 | cat (type_as_string (arg, TFF_CHASE_TYPEDEF)); | |
3673 | continue; | |
3674 | } | |
3675 | else | |
3676 | my_friendly_assert (TREE_CODE (parm) == PARM_DECL, 269); | |
3677 | ||
3678 | if (TREE_CODE (arg) == TREE_LIST) | |
3679 | { | |
3680 | /* New list cell was built because old chain link was in | |
3681 | use. */ | |
3682 | my_friendly_assert (TREE_PURPOSE (arg) == NULL_TREE, 270); | |
3683 | arg = TREE_VALUE (arg); | |
3684 | } | |
3685 | /* No need to check arglist against parmlist here; we did that | |
3686 | in coerce_template_parms, called from lookup_template_class. */ | |
3687 | cat (expr_as_string (arg, TFF_PLAIN_IDENTIFIER)); | |
3688 | } | |
3689 | { | |
3690 | char *bufp = obstack_next_free (&scratch_obstack); | |
3691 | int offset = 0; | |
3692 | while (bufp[offset - 1] == ' ') | |
3693 | offset--; | |
3694 | obstack_blank_fast (&scratch_obstack, offset); | |
3695 | ||
3696 | /* B<C<char> >, not B<C<char>> */ | |
3697 | if (bufp[offset - 1] == '>') | |
3698 | ccat (' '); | |
3699 | } | |
3700 | ccat ('>'); | |
3701 | ccat ('\0'); | |
3702 | return (char *) obstack_base (&scratch_obstack); | |
3703 | } | |
3704 | ||
3705 | static tree | |
3706 | classtype_mangled_name (t) | |
3707 | tree t; | |
3708 | { | |
3709 | if (CLASSTYPE_TEMPLATE_INFO (t) | |
3710 | /* Specializations have already had their names set up in | |
3711 | lookup_template_class. */ | |
3712 | && !CLASSTYPE_TEMPLATE_SPECIALIZATION (t)) | |
3713 | { | |
3714 | tree tmpl = most_general_template (CLASSTYPE_TI_TEMPLATE (t)); | |
3715 | ||
3716 | /* For non-primary templates, the template parameters are | |
3717 | implicit from their surrounding context. */ | |
3718 | if (PRIMARY_TEMPLATE_P (tmpl)) | |
3719 | { | |
3720 | tree name = DECL_NAME (tmpl); | |
3721 | char *mangled_name = mangle_class_name_for_template | |
3722 | (IDENTIFIER_POINTER (name), | |
3723 | DECL_INNERMOST_TEMPLATE_PARMS (tmpl), | |
3724 | CLASSTYPE_TI_ARGS (t)); | |
3725 | tree id = get_identifier (mangled_name); | |
3726 | IDENTIFIER_TEMPLATE (id) = name; | |
3727 | return id; | |
3728 | } | |
3729 | } | |
3730 | ||
3731 | return TYPE_IDENTIFIER (t); | |
3732 | } | |
3733 | ||
3734 | static void | |
3735 | add_pending_template (d) | |
3736 | tree d; | |
3737 | { | |
3738 | tree ti = (TYPE_P (d) | |
3739 | ? CLASSTYPE_TEMPLATE_INFO (d) | |
3740 | : DECL_TEMPLATE_INFO (d)); | |
3741 | int level; | |
3742 | ||
3743 | if (TI_PENDING_TEMPLATE_FLAG (ti)) | |
3744 | return; | |
3745 | ||
3746 | /* We are called both from instantiate_decl, where we've already had a | |
3747 | tinst_level pushed, and instantiate_template, where we haven't. | |
3748 | Compensate. */ | |
3749 | level = !(current_tinst_level && TINST_DECL (current_tinst_level) == d); | |
3750 | ||
3751 | if (level) | |
3752 | push_tinst_level (d); | |
3753 | ||
3754 | *template_tail = tree_cons (current_tinst_level, d, NULL_TREE); | |
3755 | template_tail = &TREE_CHAIN (*template_tail); | |
3756 | TI_PENDING_TEMPLATE_FLAG (ti) = 1; | |
3757 | ||
3758 | if (level) | |
3759 | pop_tinst_level (); | |
3760 | } | |
3761 | ||
3762 | ||
3763 | /* Return a TEMPLATE_ID_EXPR corresponding to the indicated FNS (which | |
3764 | may be either a _DECL or an overloaded function or an | |
3765 | IDENTIFIER_NODE), and ARGLIST. */ | |
3766 | ||
3767 | tree | |
3768 | lookup_template_function (fns, arglist) | |
3769 | tree fns, arglist; | |
3770 | { | |
3771 | tree type; | |
3772 | ||
3773 | if (fns == NULL_TREE) | |
3774 | { | |
3775 | cp_error ("non-template used as template"); | |
3776 | return error_mark_node; | |
3777 | } | |
3778 | ||
3779 | type = TREE_TYPE (fns); | |
3780 | if (TREE_CODE (fns) == OVERLOAD || !type) | |
3781 | type = unknown_type_node; | |
3782 | ||
3783 | if (processing_template_decl) | |
3784 | return build_min (TEMPLATE_ID_EXPR, type, fns, arglist); | |
3785 | else | |
3786 | return build (TEMPLATE_ID_EXPR, type, fns, arglist); | |
3787 | } | |
3788 | ||
3789 | /* Within the scope of a template class S<T>, the name S gets bound | |
3790 | (in build_self_reference) to a TYPE_DECL for the class, not a | |
3791 | TEMPLATE_DECL. If DECL is a TYPE_DECL for current_class_type, | |
3792 | or one of its enclosing classes, and that type is a template, | |
3793 | return the associated TEMPLATE_DECL. Otherwise, the original | |
3794 | DECL is returned. */ | |
3795 | ||
3796 | static tree | |
3797 | maybe_get_template_decl_from_type_decl (decl) | |
3798 | tree decl; | |
3799 | { | |
3800 | return (decl != NULL_TREE | |
3801 | && TREE_CODE (decl) == TYPE_DECL | |
3802 | && DECL_ARTIFICIAL (decl) | |
3803 | && CLASS_TYPE_P (TREE_TYPE (decl)) | |
3804 | && CLASSTYPE_TEMPLATE_INFO (TREE_TYPE (decl))) | |
3805 | ? CLASSTYPE_TI_TEMPLATE (TREE_TYPE (decl)) : decl; | |
3806 | } | |
3807 | ||
3808 | /* Given an IDENTIFIER_NODE (type TEMPLATE_DECL) and a chain of | |
3809 | parameters, find the desired type. | |
3810 | ||
3811 | D1 is the PTYPENAME terminal, and ARGLIST is the list of arguments. | |
3812 | (Actually ARGLIST may be either a TREE_LIST or a TREE_VEC. It will | |
3813 | be a TREE_LIST if called directly from the parser, and a TREE_VEC | |
3814 | otherwise.) | |
3815 | ||
3816 | IN_DECL, if non-NULL, is the template declaration we are trying to | |
3817 | instantiate. | |
3818 | ||
3819 | If ENTERING_SCOPE is non-zero, we are about to enter the scope of | |
3820 | the class we are looking up. | |
3821 | ||
3822 | If COMPLAIN is non-zero, issue error messages. | |
3823 | ||
3824 | If the template class is really a local class in a template | |
3825 | function, then the FUNCTION_CONTEXT is the function in which it is | |
3826 | being instantiated. */ | |
3827 | ||
3828 | tree | |
3829 | lookup_template_class (d1, arglist, in_decl, context, entering_scope, complain) | |
3830 | tree d1, arglist; | |
3831 | tree in_decl; | |
3832 | tree context; | |
3833 | int entering_scope; | |
3834 | int complain; | |
3835 | { | |
3836 | tree template = NULL_TREE, parmlist; | |
3837 | tree t; | |
3838 | ||
3839 | if (TREE_CODE (d1) == IDENTIFIER_NODE) | |
3840 | { | |
3841 | if (IDENTIFIER_VALUE (d1) | |
3842 | && DECL_TEMPLATE_TEMPLATE_PARM_P (IDENTIFIER_VALUE (d1))) | |
3843 | template = IDENTIFIER_VALUE (d1); | |
3844 | else | |
3845 | { | |
3846 | if (context) | |
3847 | push_decl_namespace (context); | |
3848 | template = lookup_name (d1, /*prefer_type=*/0); | |
3849 | template = maybe_get_template_decl_from_type_decl (template); | |
3850 | if (context) | |
3851 | pop_decl_namespace (); | |
3852 | } | |
3853 | if (template) | |
3854 | context = DECL_CONTEXT (template); | |
3855 | } | |
3856 | else if (TREE_CODE (d1) == TYPE_DECL && IS_AGGR_TYPE (TREE_TYPE (d1))) | |
3857 | { | |
3858 | tree type = TREE_TYPE (d1); | |
3859 | ||
3860 | /* If we are declaring a constructor, say A<T>::A<T>, we will get | |
3861 | an implicit typename for the second A. Deal with it. */ | |
3862 | if (TREE_CODE (type) == TYPENAME_TYPE && TREE_TYPE (type)) | |
3863 | type = TREE_TYPE (type); | |
3864 | ||
3865 | if (CLASSTYPE_TEMPLATE_INFO (type)) | |
3866 | { | |
3867 | template = CLASSTYPE_TI_TEMPLATE (type); | |
3868 | d1 = DECL_NAME (template); | |
3869 | } | |
3870 | } | |
3871 | else if (TREE_CODE (d1) == ENUMERAL_TYPE | |
3872 | || (TYPE_P (d1) && IS_AGGR_TYPE (d1))) | |
3873 | { | |
3874 | template = TYPE_TI_TEMPLATE (d1); | |
3875 | d1 = DECL_NAME (template); | |
3876 | } | |
3877 | else if (TREE_CODE (d1) == TEMPLATE_DECL | |
3878 | && TREE_CODE (DECL_TEMPLATE_RESULT (d1)) == TYPE_DECL) | |
3879 | { | |
3880 | template = d1; | |
3881 | d1 = DECL_NAME (template); | |
3882 | context = DECL_CONTEXT (template); | |
3883 | } | |
3884 | ||
3885 | /* With something like `template <class T> class X class X { ... };' | |
3886 | we could end up with D1 having nothing but an IDENTIFIER_VALUE. | |
3887 | We don't want to do that, but we have to deal with the situation, | |
3888 | so let's give them some syntax errors to chew on instead of a | |
3889 | crash. Alternatively D1 might not be a template type at all. */ | |
3890 | if (! template) | |
3891 | { | |
3892 | if (complain) | |
3893 | cp_error ("`%T' is not a template", d1); | |
3894 | return error_mark_node; | |
3895 | } | |
3896 | ||
3897 | if (TREE_CODE (template) != TEMPLATE_DECL | |
3898 | /* If we're called from the parser, make sure it's a user visible | |
3899 | template. */ | |
3900 | || ((!arglist || TREE_CODE (arglist) == TREE_LIST) | |
3901 | && !DECL_TEMPLATE_PARM_P (template) | |
3902 | && !PRIMARY_TEMPLATE_P (template))) | |
3903 | { | |
3904 | if (complain) | |
3905 | { | |
3906 | cp_error ("non-template type `%T' used as a template", d1); | |
3907 | if (in_decl) | |
3908 | cp_error_at ("for template declaration `%D'", in_decl); | |
3909 | } | |
3910 | return error_mark_node; | |
3911 | } | |
3912 | ||
3913 | if (DECL_TEMPLATE_TEMPLATE_PARM_P (template)) | |
3914 | { | |
3915 | /* Create a new TEMPLATE_DECL and TEMPLATE_TEMPLATE_PARM node to store | |
3916 | template arguments */ | |
3917 | ||
3918 | tree parm; | |
3919 | tree arglist2; | |
3920 | ||
3921 | parmlist = DECL_INNERMOST_TEMPLATE_PARMS (template); | |
3922 | ||
3923 | arglist2 = coerce_template_parms (parmlist, arglist, template, | |
3924 | complain, /*require_all_args=*/1); | |
3925 | if (arglist2 == error_mark_node) | |
3926 | return error_mark_node; | |
3927 | ||
3928 | parm = copy_template_template_parm (TREE_TYPE (template), arglist2); | |
3929 | TYPE_SIZE (parm) = 0; | |
3930 | return parm; | |
3931 | } | |
3932 | else | |
3933 | { | |
3934 | tree template_type = TREE_TYPE (template); | |
3935 | tree gen_tmpl; | |
3936 | tree type_decl; | |
3937 | tree found = NULL_TREE; | |
3938 | tree *tp; | |
3939 | int arg_depth; | |
3940 | int parm_depth; | |
3941 | int is_partial_instantiation; | |
3942 | ||
3943 | gen_tmpl = most_general_template (template); | |
3944 | parmlist = DECL_TEMPLATE_PARMS (gen_tmpl); | |
3945 | parm_depth = TMPL_PARMS_DEPTH (parmlist); | |
3946 | arg_depth = TMPL_ARGS_DEPTH (arglist); | |
3947 | ||
3948 | if (arg_depth == 1 && parm_depth > 1) | |
3949 | { | |
3950 | /* We've been given an incomplete set of template arguments. | |
3951 | For example, given: | |
3952 | ||
3953 | template <class T> struct S1 { | |
3954 | template <class U> struct S2 {}; | |
3955 | template <class U> struct S2<U*> {}; | |
3956 | }; | |
3957 | ||
3958 | we will be called with an ARGLIST of `U*', but the | |
3959 | TEMPLATE will be `template <class T> template | |
3960 | <class U> struct S1<T>::S2'. We must fill in the missing | |
3961 | arguments. */ | |
3962 | arglist | |
3963 | = add_outermost_template_args (TYPE_TI_ARGS (TREE_TYPE (template)), | |
3964 | arglist); | |
3965 | arg_depth = TMPL_ARGS_DEPTH (arglist); | |
3966 | } | |
3967 | ||
3968 | /* Now we should enough arguments. */ | |
3969 | my_friendly_assert (parm_depth == arg_depth, 0); | |
3970 | ||
3971 | /* From here on, we're only interested in the most general | |
3972 | template. */ | |
3973 | template = gen_tmpl; | |
3974 | ||
3975 | /* Calculate the BOUND_ARGS. These will be the args that are | |
3976 | actually tsubst'd into the definition to create the | |
3977 | instantiation. */ | |
3978 | if (parm_depth > 1) | |
3979 | { | |
3980 | /* We have multiple levels of arguments to coerce, at once. */ | |
3981 | int i; | |
3982 | int saved_depth = TMPL_ARGS_DEPTH (arglist); | |
3983 | ||
3984 | tree bound_args = make_tree_vec (parm_depth); | |
3985 | ||
3986 | for (i = saved_depth, | |
3987 | t = DECL_TEMPLATE_PARMS (template); | |
3988 | i > 0 && t != NULL_TREE; | |
3989 | --i, t = TREE_CHAIN (t)) | |
3990 | { | |
3991 | tree a = coerce_template_parms (TREE_VALUE (t), | |
3992 | arglist, template, | |
3993 | complain, /*require_all_args=*/1); | |
3994 | SET_TMPL_ARGS_LEVEL (bound_args, i, a); | |
3995 | ||
3996 | /* We temporarily reduce the length of the ARGLIST so | |
3997 | that coerce_template_parms will see only the arguments | |
3998 | corresponding to the template parameters it is | |
3999 | examining. */ | |
4000 | TREE_VEC_LENGTH (arglist)--; | |
4001 | } | |
4002 | ||
4003 | /* Restore the ARGLIST to its full size. */ | |
4004 | TREE_VEC_LENGTH (arglist) = saved_depth; | |
4005 | ||
4006 | arglist = bound_args; | |
4007 | } | |
4008 | else | |
4009 | arglist | |
4010 | = coerce_template_parms (INNERMOST_TEMPLATE_PARMS (parmlist), | |
4011 | INNERMOST_TEMPLATE_ARGS (arglist), | |
4012 | template, | |
4013 | complain, /*require_all_args=*/1); | |
4014 | ||
4015 | if (arglist == error_mark_node) | |
4016 | /* We were unable to bind the arguments. */ | |
4017 | return error_mark_node; | |
4018 | ||
4019 | /* In the scope of a template class, explicit references to the | |
4020 | template class refer to the type of the template, not any | |
4021 | instantiation of it. For example, in: | |
4022 | ||
4023 | template <class T> class C { void f(C<T>); } | |
4024 | ||
4025 | the `C<T>' is just the same as `C'. Outside of the | |
4026 | class, however, such a reference is an instantiation. */ | |
4027 | if (comp_template_args (TYPE_TI_ARGS (template_type), | |
4028 | arglist)) | |
4029 | { | |
4030 | found = template_type; | |
4031 | ||
4032 | if (!entering_scope && PRIMARY_TEMPLATE_P (template)) | |
4033 | { | |
4034 | tree ctx; | |
4035 | ||
4036 | /* Note that we use DECL_CONTEXT, rather than | |
4037 | CP_DECL_CONTEXT, so that the termination test is | |
4038 | always just `ctx'. We're not interested in namespace | |
4039 | scopes. */ | |
4040 | for (ctx = current_class_type; | |
4041 | ctx; | |
4042 | ctx = (TYPE_P (ctx)) ? TYPE_CONTEXT (ctx) : DECL_CONTEXT (ctx)) | |
4043 | if (same_type_p (ctx, template_type)) | |
4044 | break; | |
4045 | ||
4046 | if (!ctx) | |
4047 | /* We're not in the scope of the class, so the | |
4048 | TEMPLATE_TYPE is not the type we want after | |
4049 | all. */ | |
4050 | found = NULL_TREE; | |
4051 | } | |
4052 | } | |
4053 | if (found) | |
4054 | return found; | |
4055 | ||
4056 | for (tp = &DECL_TEMPLATE_INSTANTIATIONS (template); | |
4057 | *tp; | |
4058 | tp = &TREE_CHAIN (*tp)) | |
4059 | if (comp_template_args (TREE_PURPOSE (*tp), arglist)) | |
4060 | { | |
4061 | found = *tp; | |
4062 | ||
4063 | /* Use the move-to-front heuristic to speed up future | |
4064 | searches. */ | |
4065 | *tp = TREE_CHAIN (*tp); | |
4066 | TREE_CHAIN (found) | |
4067 | = DECL_TEMPLATE_INSTANTIATIONS (template); | |
4068 | DECL_TEMPLATE_INSTANTIATIONS (template) = found; | |
4069 | ||
4070 | return TREE_VALUE (found); | |
4071 | } | |
4072 | ||
4073 | /* This type is a "partial instantiation" if any of the template | |
4074 | arguments still involve template parameters. Note that we set | |
4075 | IS_PARTIAL_INSTANTIATION for partial specializations as | |
4076 | well. */ | |
4077 | is_partial_instantiation = uses_template_parms (arglist); | |
4078 | ||
4079 | if (!is_partial_instantiation | |
4080 | && !PRIMARY_TEMPLATE_P (template) | |
4081 | && TREE_CODE (CP_DECL_CONTEXT (template)) == NAMESPACE_DECL) | |
4082 | { | |
4083 | found = xref_tag_from_type (TREE_TYPE (template), | |
4084 | DECL_NAME (template), | |
4085 | /*globalize=*/1); | |
4086 | return found; | |
4087 | } | |
4088 | ||
4089 | context = tsubst (DECL_CONTEXT (template), arglist, | |
4090 | /*complain=*/0, in_decl); | |
4091 | if (!context) | |
4092 | context = global_namespace; | |
4093 | ||
4094 | /* Create the type. */ | |
4095 | if (TREE_CODE (template_type) == ENUMERAL_TYPE) | |
4096 | { | |
4097 | if (!is_partial_instantiation) | |
4098 | { | |
4099 | set_current_access_from_decl (TYPE_NAME (template_type)); | |
4100 | t = start_enum (TYPE_IDENTIFIER (template_type)); | |
4101 | } | |
4102 | else | |
4103 | /* We don't want to call start_enum for this type, since | |
4104 | the values for the enumeration constants may involve | |
4105 | template parameters. And, no one should be interested | |
4106 | in the enumeration constants for such a type. */ | |
4107 | t = make_node (ENUMERAL_TYPE); | |
4108 | } | |
4109 | else | |
4110 | { | |
4111 | t = make_aggr_type (TREE_CODE (template_type)); | |
4112 | CLASSTYPE_DECLARED_CLASS (t) | |
4113 | = CLASSTYPE_DECLARED_CLASS (template_type); | |
4114 | CLASSTYPE_GOT_SEMICOLON (t) = 1; | |
4115 | SET_CLASSTYPE_IMPLICIT_INSTANTIATION (t); | |
4116 | TYPE_FOR_JAVA (t) = TYPE_FOR_JAVA (template_type); | |
4117 | ||
4118 | /* A local class. Make sure the decl gets registered properly. */ | |
4119 | if (context == current_function_decl) | |
4120 | pushtag (DECL_NAME (template), t, 0); | |
4121 | } | |
4122 | ||
4123 | /* If we called start_enum or pushtag above, this information | |
4124 | will already be set up. */ | |
4125 | if (!TYPE_NAME (t)) | |
4126 | { | |
4127 | TYPE_CONTEXT (t) = FROB_CONTEXT (context); | |
4128 | ||
4129 | type_decl = create_implicit_typedef (DECL_NAME (template), t); | |
4130 | DECL_CONTEXT (type_decl) = TYPE_CONTEXT (t); | |
4131 | TYPE_STUB_DECL (t) = type_decl; | |
4132 | DECL_SOURCE_FILE (type_decl) | |
4133 | = DECL_SOURCE_FILE (TYPE_STUB_DECL (template_type)); | |
4134 | DECL_SOURCE_LINE (type_decl) | |
4135 | = DECL_SOURCE_LINE (TYPE_STUB_DECL (template_type)); | |
4136 | } | |
4137 | else | |
4138 | type_decl = TYPE_NAME (t); | |
4139 | ||
4140 | /* Set up the template information. We have to figure out which | |
4141 | template is the immediate parent if this is a full | |
4142 | instantiation. */ | |
4143 | if (parm_depth == 1 || is_partial_instantiation | |
4144 | || !PRIMARY_TEMPLATE_P (template)) | |
4145 | /* This case is easy; there are no member templates involved. */ | |
4146 | found = template; | |
4147 | else | |
4148 | { | |
4149 | /* This is a full instantiation of a member template. Look | |
4150 | for a partial instantiation of which this is an instance. */ | |
4151 | ||
4152 | for (found = DECL_TEMPLATE_INSTANTIATIONS (template); | |
4153 | found; found = TREE_CHAIN (found)) | |
4154 | { | |
4155 | int success; | |
4156 | tree tmpl = CLASSTYPE_TI_TEMPLATE (TREE_VALUE (found)); | |
4157 | ||
4158 | /* We only want partial instantiations, here, not | |
4159 | specializations or full instantiations. */ | |
4160 | if (CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_VALUE (found)) | |
4161 | || !uses_template_parms (TREE_VALUE (found))) | |
4162 | continue; | |
4163 | ||
4164 | /* Temporarily reduce by one the number of levels in the | |
4165 | ARGLIST and in FOUND so as to avoid comparing the | |
4166 | last set of arguments. */ | |
4167 | TREE_VEC_LENGTH (arglist)--; | |
4168 | TREE_VEC_LENGTH (TREE_PURPOSE (found)) --; | |
4169 | ||
4170 | /* See if the arguments match. If they do, then TMPL is | |
4171 | the partial instantiation we want. */ | |
4172 | success = comp_template_args (TREE_PURPOSE (found), arglist); | |
4173 | ||
4174 | /* Restore the argument vectors to their full size. */ | |
4175 | TREE_VEC_LENGTH (arglist)++; | |
4176 | TREE_VEC_LENGTH (TREE_PURPOSE (found))++; | |
4177 | ||
4178 | if (success) | |
4179 | { | |
4180 | found = tmpl; | |
4181 | break; | |
4182 | } | |
4183 | } | |
4184 | ||
4185 | if (!found) | |
4186 | { | |
4187 | /* There was no partial instantiation. This happens | |
4188 | where C<T> is a member template of A<T> and it's used | |
4189 | in something like | |
4190 | ||
4191 | template <typename T> struct B { A<T>::C<int> m; }; | |
4192 | B<float>; | |
4193 | ||
4194 | Create the partial instantiation. | |
4195 | */ | |
4196 | TREE_VEC_LENGTH (arglist)--; | |
4197 | template = tsubst (template, arglist, /*complain=*/0, NULL_TREE); | |
4198 | TREE_VEC_LENGTH (arglist)++; | |
4199 | found = template; | |
4200 | } | |
4201 | } | |
4202 | ||
4203 | SET_TYPE_TEMPLATE_INFO (t, tree_cons (found, arglist, NULL_TREE)); | |
4204 | DECL_TEMPLATE_INSTANTIATIONS (template) | |
4205 | = tree_cons (arglist, t, | |
4206 | DECL_TEMPLATE_INSTANTIATIONS (template)); | |
4207 | ||
4208 | if (TREE_CODE (t) == ENUMERAL_TYPE | |
4209 | && !is_partial_instantiation) | |
4210 | /* Now that the type has been registered on the instantiations | |
4211 | list, we set up the enumerators. Because the enumeration | |
4212 | constants may involve the enumeration type itself, we make | |
4213 | sure to register the type first, and then create the | |
4214 | constants. That way, doing tsubst_expr for the enumeration | |
4215 | constants won't result in recursive calls here; we'll find | |
4216 | the instantiation and exit above. */ | |
4217 | tsubst_enum (template_type, t, arglist); | |
4218 | ||
4219 | /* Reset the name of the type, now that CLASSTYPE_TEMPLATE_INFO | |
4220 | is set up. */ | |
4221 | if (TREE_CODE (t) != ENUMERAL_TYPE) | |
4222 | DECL_NAME (type_decl) = classtype_mangled_name (t); | |
4223 | DECL_ASSEMBLER_NAME (type_decl) = DECL_NAME (type_decl); | |
4224 | if (!is_partial_instantiation) | |
4225 | { | |
4226 | DECL_ASSEMBLER_NAME (type_decl) = mangle_decl (type_decl); | |
4227 | ||
4228 | /* For backwards compatibility; code that uses | |
4229 | -fexternal-templates expects looking up a template to | |
4230 | instantiate it. I think DDD still relies on this. | |
4231 | (jason 8/20/1998) */ | |
4232 | if (TREE_CODE (t) != ENUMERAL_TYPE | |
4233 | && flag_external_templates | |
4234 | && CLASSTYPE_INTERFACE_KNOWN (TREE_TYPE (template)) | |
4235 | && ! CLASSTYPE_INTERFACE_ONLY (TREE_TYPE (template))) | |
4236 | add_pending_template (t); | |
4237 | } | |
4238 | else | |
4239 | /* If the type makes use of template parameters, the | |
4240 | code that generates debugging information will crash. */ | |
4241 | DECL_IGNORED_P (TYPE_STUB_DECL (t)) = 1; | |
4242 | ||
4243 | return t; | |
4244 | } | |
4245 | } | |
4246 | \f | |
4247 | struct pair_fn_data | |
4248 | { | |
4249 | tree_fn_t fn; | |
4250 | void *data; | |
4251 | }; | |
4252 | ||
4253 | /* Called from for_each_template_parm via walk_tree. */ | |
4254 | ||
4255 | static tree | |
4256 | for_each_template_parm_r (tp, walk_subtrees, d) | |
4257 | tree *tp; | |
4258 | int *walk_subtrees; | |
4259 | void *d; | |
4260 | { | |
4261 | tree t = *tp; | |
4262 | struct pair_fn_data *pfd = (struct pair_fn_data *) d; | |
4263 | tree_fn_t fn = pfd->fn; | |
4264 | void *data = pfd->data; | |
4265 | ||
4266 | if (TYPE_P (t) | |
4267 | && for_each_template_parm (TYPE_CONTEXT (t), fn, data)) | |
4268 | return error_mark_node; | |
4269 | ||
4270 | switch (TREE_CODE (t)) | |
4271 | { | |
4272 | case RECORD_TYPE: | |
4273 | if (TYPE_PTRMEMFUNC_P (t)) | |
4274 | break; | |
4275 | /* Fall through. */ | |
4276 | ||
4277 | case UNION_TYPE: | |
4278 | case ENUMERAL_TYPE: | |
4279 | if (!TYPE_TEMPLATE_INFO (t)) | |
4280 | *walk_subtrees = 0; | |
4281 | else if (for_each_template_parm (TREE_VALUE (TYPE_TEMPLATE_INFO (t)), | |
4282 | fn, data)) | |
4283 | return error_mark_node; | |
4284 | break; | |
4285 | ||
4286 | case METHOD_TYPE: | |
4287 | /* Since we're not going to walk subtrees, we have to do this | |
4288 | explicitly here. */ | |
4289 | if (for_each_template_parm (TYPE_METHOD_BASETYPE (t), fn, data)) | |
4290 | return error_mark_node; | |
4291 | /* Fall through. */ | |
4292 | ||
4293 | case FUNCTION_TYPE: | |
4294 | /* Check the return type. */ | |
4295 | if (for_each_template_parm (TREE_TYPE (t), fn, data)) | |
4296 | return error_mark_node; | |
4297 | ||
4298 | /* Check the parameter types. Since default arguments are not | |
4299 | instantiated until they are needed, the TYPE_ARG_TYPES may | |
4300 | contain expressions that involve template parameters. But, | |
4301 | no-one should be looking at them yet. And, once they're | |
4302 | instantiated, they don't contain template parameters, so | |
4303 | there's no point in looking at them then, either. */ | |
4304 | { | |
4305 | tree parm; | |
4306 | ||
4307 | for (parm = TYPE_ARG_TYPES (t); parm; parm = TREE_CHAIN (parm)) | |
4308 | if (for_each_template_parm (TREE_VALUE (parm), fn, data)) | |
4309 | return error_mark_node; | |
4310 | ||
4311 | /* Since we've already handled the TYPE_ARG_TYPES, we don't | |
4312 | want walk_tree walking into them itself. */ | |
4313 | *walk_subtrees = 0; | |
4314 | } | |
4315 | break; | |
4316 | ||
4317 | case FUNCTION_DECL: | |
4318 | case VAR_DECL: | |
4319 | if (DECL_LANG_SPECIFIC (t) && DECL_TEMPLATE_INFO (t) | |
4320 | && for_each_template_parm (DECL_TI_ARGS (t), fn, data)) | |
4321 | return error_mark_node; | |
4322 | /* Fall through. */ | |
4323 | ||
4324 | case CONST_DECL: | |
4325 | case PARM_DECL: | |
4326 | if (DECL_CONTEXT (t) | |
4327 | && for_each_template_parm (DECL_CONTEXT (t), fn, data)) | |
4328 | return error_mark_node; | |
4329 | break; | |
4330 | ||
4331 | case BOUND_TEMPLATE_TEMPLATE_PARM: | |
4332 | /* Record template parameters such as `T' inside `TT<T>'. */ | |
4333 | if (for_each_template_parm (TYPE_TI_ARGS (t), fn, data)) | |
4334 | return error_mark_node; | |
4335 | /* Fall through. */ | |
4336 | ||
4337 | case TEMPLATE_TEMPLATE_PARM: | |
4338 | case TEMPLATE_TYPE_PARM: | |
4339 | case TEMPLATE_PARM_INDEX: | |
4340 | if (fn && (*fn)(t, data)) | |
4341 | return error_mark_node; | |
4342 | else if (!fn) | |
4343 | return error_mark_node; | |
4344 | break; | |
4345 | ||
4346 | case TEMPLATE_DECL: | |
4347 | /* A template template parameter is encountered */ | |
4348 | if (DECL_TEMPLATE_TEMPLATE_PARM_P (t) | |
4349 | && for_each_template_parm (TREE_TYPE (t), fn, data)) | |
4350 | return error_mark_node; | |
4351 | ||
4352 | /* Already substituted template template parameter */ | |
4353 | *walk_subtrees = 0; | |
4354 | break; | |
4355 | ||
4356 | case TYPENAME_TYPE: | |
4357 | if (!fn || for_each_template_parm (TYPENAME_TYPE_FULLNAME (t), fn, data)) | |
4358 | return error_mark_node; | |
4359 | break; | |
4360 | ||
4361 | case CONSTRUCTOR: | |
4362 | if (TREE_TYPE (t) && TYPE_PTRMEMFUNC_P (TREE_TYPE (t)) | |
4363 | && for_each_template_parm (TYPE_PTRMEMFUNC_FN_TYPE | |
4364 | (TREE_TYPE (t)), fn, data)) | |
4365 | return error_mark_node; | |
4366 | break; | |
4367 | ||
4368 | case INDIRECT_REF: | |
4369 | case COMPONENT_REF: | |
4370 | /* If there's no type, then this thing must be some expression | |
4371 | involving template parameters. */ | |
4372 | if (!fn && !TREE_TYPE (t)) | |
4373 | return error_mark_node; | |
4374 | break; | |
4375 | ||
4376 | case MODOP_EXPR: | |
4377 | case CAST_EXPR: | |
4378 | case REINTERPRET_CAST_EXPR: | |
4379 | case CONST_CAST_EXPR: | |
4380 | case STATIC_CAST_EXPR: | |
4381 | case DYNAMIC_CAST_EXPR: | |
4382 | case ARROW_EXPR: | |
4383 | case DOTSTAR_EXPR: | |
4384 | case TYPEID_EXPR: | |
4385 | case LOOKUP_EXPR: | |
4386 | case PSEUDO_DTOR_EXPR: | |
4387 | if (!fn) | |
4388 | return error_mark_node; | |
4389 | break; | |
4390 | ||
4391 | default: | |
4392 | break; | |
4393 | } | |
4394 | ||
4395 | /* We didn't find any template parameters we liked. */ | |
4396 | return NULL_TREE; | |
4397 | } | |
4398 | ||
4399 | /* For each TEMPLATE_TYPE_PARM, TEMPLATE_TEMPLATE_PARM, | |
4400 | BOUND_TEMPLATE_TEMPLATE_PARM or TEMPLATE_PARM_INDEX in T, | |
4401 | call FN with the parameter and the DATA. | |
4402 | If FN returns non-zero, the iteration is terminated, and | |
4403 | for_each_template_parm returns 1. Otherwise, the iteration | |
4404 | continues. If FN never returns a non-zero value, the value | |
4405 | returned by for_each_template_parm is 0. If FN is NULL, it is | |
4406 | considered to be the function which always returns 1. */ | |
4407 | ||
4408 | static int | |
4409 | for_each_template_parm (t, fn, data) | |
4410 | tree t; | |
4411 | tree_fn_t fn; | |
4412 | void* data; | |
4413 | { | |
4414 | struct pair_fn_data pfd; | |
4415 | ||
4416 | /* Set up. */ | |
4417 | pfd.fn = fn; | |
4418 | pfd.data = data; | |
4419 | ||
4420 | /* Walk the tree. (Conceptually, we would like to walk without | |
4421 | duplicates, but for_each_template_parm_r recursively calls | |
4422 | for_each_template_parm, so we would need to reorganize a fair | |
4423 | bit to use walk_tree_without_duplicates.) */ | |
4424 | return walk_tree (&t, | |
4425 | for_each_template_parm_r, | |
4426 | &pfd, | |
4427 | NULL) != NULL_TREE; | |
4428 | } | |
4429 | ||
4430 | int | |
4431 | uses_template_parms (t) | |
4432 | tree t; | |
4433 | { | |
4434 | return for_each_template_parm (t, 0, 0); | |
4435 | } | |
4436 | ||
4437 | static int tinst_depth; | |
4438 | extern int max_tinst_depth; | |
4439 | #ifdef GATHER_STATISTICS | |
4440 | int depth_reached; | |
4441 | #endif | |
4442 | static int tinst_level_tick; | |
4443 | static int last_template_error_tick; | |
4444 | ||
4445 | /* We're starting to instantiate D; record the template instantiation context | |
4446 | for diagnostics and to restore it later. */ | |
4447 | ||
4448 | static int | |
4449 | push_tinst_level (d) | |
4450 | tree d; | |
4451 | { | |
4452 | tree new; | |
4453 | ||
4454 | if (tinst_depth >= max_tinst_depth) | |
4455 | { | |
4456 | /* If the instantiation in question still has unbound template parms, | |
4457 | we don't really care if we can't instantiate it, so just return. | |
4458 | This happens with base instantiation for implicit `typename'. */ | |
4459 | if (uses_template_parms (d)) | |
4460 | return 0; | |
4461 | ||
4462 | last_template_error_tick = tinst_level_tick; | |
4463 | cp_error ("template instantiation depth exceeds maximum of %d (use -ftemplate-depth-NN to increase the maximum) instantiating `%D'", | |
4464 | max_tinst_depth, d); | |
4465 | ||
4466 | print_instantiation_context (); | |
4467 | ||
4468 | return 0; | |
4469 | } | |
4470 | ||
4471 | new = build_expr_wfl (d, input_filename, lineno, 0); | |
4472 | TREE_CHAIN (new) = current_tinst_level; | |
4473 | current_tinst_level = new; | |
4474 | ||
4475 | ++tinst_depth; | |
4476 | #ifdef GATHER_STATISTICS | |
4477 | if (tinst_depth > depth_reached) | |
4478 | depth_reached = tinst_depth; | |
4479 | #endif | |
4480 | ||
4481 | ++tinst_level_tick; | |
4482 | return 1; | |
4483 | } | |
4484 | ||
4485 | /* We're done instantiating this template; return to the instantiation | |
4486 | context. */ | |
4487 | ||
4488 | void | |
4489 | pop_tinst_level () | |
4490 | { | |
4491 | tree old = current_tinst_level; | |
4492 | ||
4493 | /* Restore the filename and line number stashed away when we started | |
4494 | this instantiation. */ | |
4495 | lineno = TINST_LINE (old); | |
4496 | input_filename = TINST_FILE (old); | |
4497 | extract_interface_info (); | |
4498 | ||
4499 | current_tinst_level = TREE_CHAIN (old); | |
4500 | --tinst_depth; | |
4501 | ++tinst_level_tick; | |
4502 | } | |
4503 | ||
4504 | /* We're instantiating a deferred template; restore the template | |
4505 | instantiation context in which the instantiation was requested, which | |
4506 | is one step out from LEVEL. */ | |
4507 | ||
4508 | static void | |
4509 | reopen_tinst_level (level) | |
4510 | tree level; | |
4511 | { | |
4512 | tree t; | |
4513 | ||
4514 | tinst_depth = 0; | |
4515 | for (t = level; t; t = TREE_CHAIN (t)) | |
4516 | ++tinst_depth; | |
4517 | ||
4518 | current_tinst_level = level; | |
4519 | pop_tinst_level (); | |
4520 | } | |
4521 | ||
4522 | /* Return the outermost template instantiation context, for use with | |
4523 | -falt-external-templates. */ | |
4524 | ||
4525 | tree | |
4526 | tinst_for_decl () | |
4527 | { | |
4528 | tree p = current_tinst_level; | |
4529 | ||
4530 | if (p) | |
4531 | for (; TREE_CHAIN (p) ; p = TREE_CHAIN (p)) | |
4532 | ; | |
4533 | return p; | |
4534 | } | |
4535 | ||
4536 | /* DECL is a friend FUNCTION_DECL or TEMPLATE_DECL. ARGS is the | |
4537 | vector of template arguments, as for tsubst. | |
4538 | ||
4539 | Returns an appropriate tsubst'd friend declaration. */ | |
4540 | ||
4541 | static tree | |
4542 | tsubst_friend_function (decl, args) | |
4543 | tree decl; | |
4544 | tree args; | |
4545 | { | |
4546 | tree new_friend; | |
4547 | int line = lineno; | |
4548 | const char *file = input_filename; | |
4549 | ||
4550 | lineno = DECL_SOURCE_LINE (decl); | |
4551 | input_filename = DECL_SOURCE_FILE (decl); | |
4552 | ||
4553 | if (TREE_CODE (decl) == FUNCTION_DECL | |
4554 | && DECL_TEMPLATE_INSTANTIATION (decl) | |
4555 | && TREE_CODE (DECL_TI_TEMPLATE (decl)) != TEMPLATE_DECL) | |
4556 | /* This was a friend declared with an explicit template | |
4557 | argument list, e.g.: | |
4558 | ||
4559 | friend void f<>(T); | |
4560 | ||
4561 | to indicate that f was a template instantiation, not a new | |
4562 | function declaration. Now, we have to figure out what | |
4563 | instantiation of what template. */ | |
4564 | { | |
4565 | tree template_id, arglist, fns; | |
4566 | tree new_args; | |
4567 | tree tmpl; | |
4568 | tree ns = CP_DECL_CONTEXT (TYPE_MAIN_DECL (current_class_type)); | |
4569 | ||
4570 | /* Friend functions are looked up in the containing namespace scope. | |
4571 | We must enter that scope, to avoid finding member functions of the | |
4572 | current cless with same name. */ | |
4573 | push_nested_namespace (ns); | |
4574 | fns = tsubst_expr (DECL_TI_TEMPLATE (decl), args, | |
4575 | /*complain=*/1, NULL_TREE); | |
4576 | pop_nested_namespace (ns); | |
4577 | arglist = tsubst (DECL_TI_ARGS (decl), args, | |
4578 | /*complain=*/1, NULL_TREE); | |
4579 | template_id = lookup_template_function (fns, arglist); | |
4580 | ||
4581 | new_friend = tsubst (decl, args, /*complain=*/1, NULL_TREE); | |
4582 | tmpl = determine_specialization (template_id, new_friend, | |
4583 | &new_args, | |
4584 | /*need_member_template=*/0); | |
4585 | new_friend = instantiate_template (tmpl, new_args); | |
4586 | goto done; | |
4587 | } | |
4588 | ||
4589 | new_friend = tsubst (decl, args, /*complain=*/1, NULL_TREE); | |
4590 | ||
4591 | /* The NEW_FRIEND will look like an instantiation, to the | |
4592 | compiler, but is not an instantiation from the point of view of | |
4593 | the language. For example, we might have had: | |
4594 | ||
4595 | template <class T> struct S { | |
4596 | template <class U> friend void f(T, U); | |
4597 | }; | |
4598 | ||
4599 | Then, in S<int>, template <class U> void f(int, U) is not an | |
4600 | instantiation of anything. */ | |
4601 | DECL_USE_TEMPLATE (new_friend) = 0; | |
4602 | if (TREE_CODE (decl) == TEMPLATE_DECL) | |
4603 | { | |
4604 | DECL_USE_TEMPLATE (DECL_TEMPLATE_RESULT (new_friend)) = 0; | |
4605 | DECL_SAVED_TREE (DECL_TEMPLATE_RESULT (new_friend)) | |
4606 | = DECL_SAVED_TREE (DECL_TEMPLATE_RESULT (decl)); | |
4607 | } | |
4608 | ||
4609 | /* The mangled name for the NEW_FRIEND is incorrect. The call to | |
4610 | tsubst will have resulted in a call to | |
4611 | set_mangled_name_for_template_decl. But, the function is not a | |
4612 | template instantiation and should not be mangled like one. | |
4613 | Therefore, we remangle the function name. We don't have to do | |
4614 | this if the NEW_FRIEND is a template since | |
4615 | set_mangled_name_for_template_decl doesn't do anything if the | |
4616 | function declaration still uses template arguments. */ | |
4617 | if (TREE_CODE (new_friend) != TEMPLATE_DECL) | |
4618 | { | |
4619 | set_mangled_name_for_decl (new_friend); | |
4620 | DECL_RTL (new_friend) = 0; | |
4621 | make_decl_rtl (new_friend, NULL_PTR); | |
4622 | } | |
4623 | ||
4624 | if (DECL_NAMESPACE_SCOPE_P (new_friend)) | |
4625 | { | |
4626 | tree old_decl; | |
4627 | tree new_friend_template_info; | |
4628 | tree new_friend_result_template_info; | |
4629 | tree ns; | |
4630 | int new_friend_is_defn; | |
4631 | ||
4632 | /* We must save some information from NEW_FRIEND before calling | |
4633 | duplicate decls since that function will free NEW_FRIEND if | |
4634 | possible. */ | |
4635 | new_friend_template_info = DECL_TEMPLATE_INFO (new_friend); | |
4636 | if (TREE_CODE (new_friend) == TEMPLATE_DECL) | |
4637 | { | |
4638 | /* This declaration is a `primary' template. */ | |
4639 | DECL_PRIMARY_TEMPLATE (new_friend) = new_friend; | |
4640 | ||
4641 | new_friend_is_defn | |
4642 | = DECL_INITIAL (DECL_TEMPLATE_RESULT (new_friend)) != NULL_TREE; | |
4643 | new_friend_result_template_info | |
4644 | = DECL_TEMPLATE_INFO (DECL_TEMPLATE_RESULT (new_friend)); | |
4645 | } | |
4646 | else | |
4647 | { | |
4648 | new_friend_is_defn = DECL_INITIAL (new_friend) != NULL_TREE; | |
4649 | new_friend_result_template_info = NULL_TREE; | |
4650 | } | |
4651 | ||
4652 | /* Inside pushdecl_namespace_level, we will push into the | |
4653 | current namespace. However, the friend function should go | |
4654 | into the namespace of the template. */ | |
4655 | ns = decl_namespace_context (new_friend); | |
4656 | push_nested_namespace (ns); | |
4657 | old_decl = pushdecl_namespace_level (new_friend); | |
4658 | pop_nested_namespace (ns); | |
4659 | ||
4660 | if (old_decl != new_friend) | |
4661 | { | |
4662 | /* This new friend declaration matched an existing | |
4663 | declaration. For example, given: | |
4664 | ||
4665 | template <class T> void f(T); | |
4666 | template <class U> class C { | |
4667 | template <class T> friend void f(T) {} | |
4668 | }; | |
4669 | ||
4670 | the friend declaration actually provides the definition | |
4671 | of `f', once C has been instantiated for some type. So, | |
4672 | old_decl will be the out-of-class template declaration, | |
4673 | while new_friend is the in-class definition. | |
4674 | ||
4675 | But, if `f' was called before this point, the | |
4676 | instantiation of `f' will have DECL_TI_ARGS corresponding | |
4677 | to `T' but not to `U', references to which might appear | |
4678 | in the definition of `f'. Previously, the most general | |
4679 | template for an instantiation of `f' was the out-of-class | |
4680 | version; now it is the in-class version. Therefore, we | |
4681 | run through all specialization of `f', adding to their | |
4682 | DECL_TI_ARGS appropriately. In particular, they need a | |
4683 | new set of outer arguments, corresponding to the | |
4684 | arguments for this class instantiation. | |
4685 | ||
4686 | The same situation can arise with something like this: | |
4687 | ||
4688 | friend void f(int); | |
4689 | template <class T> class C { | |
4690 | friend void f(T) {} | |
4691 | }; | |
4692 | ||
4693 | when `C<int>' is instantiated. Now, `f(int)' is defined | |
4694 | in the class. */ | |
4695 | ||
4696 | if (!new_friend_is_defn) | |
4697 | /* On the other hand, if the in-class declaration does | |
4698 | *not* provide a definition, then we don't want to alter | |
4699 | existing definitions. We can just leave everything | |
4700 | alone. */ | |
4701 | ; | |
4702 | else | |
4703 | { | |
4704 | /* Overwrite whatever template info was there before, if | |
4705 | any, with the new template information pertaining to | |
4706 | the declaration. */ | |
4707 | DECL_TEMPLATE_INFO (old_decl) = new_friend_template_info; | |
4708 | ||
4709 | if (TREE_CODE (old_decl) != TEMPLATE_DECL) | |
4710 | /* duplicate_decls will take care of this case. */ | |
4711 | ; | |
4712 | else | |
4713 | { | |
4714 | tree t; | |
4715 | tree new_friend_args; | |
4716 | ||
4717 | DECL_TEMPLATE_INFO (DECL_TEMPLATE_RESULT (old_decl)) | |
4718 | = new_friend_result_template_info; | |
4719 | ||
4720 | new_friend_args = TI_ARGS (new_friend_template_info); | |
4721 | for (t = DECL_TEMPLATE_SPECIALIZATIONS (old_decl); | |
4722 | t != NULL_TREE; | |
4723 | t = TREE_CHAIN (t)) | |
4724 | { | |
4725 | tree spec = TREE_VALUE (t); | |
4726 | ||
4727 | DECL_TI_ARGS (spec) | |
4728 | = add_outermost_template_args (new_friend_args, | |
4729 | DECL_TI_ARGS (spec)); | |
4730 | } | |
4731 | ||
4732 | /* Now, since specializations are always supposed to | |
4733 | hang off of the most general template, we must move | |
4734 | them. */ | |
4735 | t = most_general_template (old_decl); | |
4736 | if (t != old_decl) | |
4737 | { | |
4738 | DECL_TEMPLATE_SPECIALIZATIONS (t) | |
4739 | = chainon (DECL_TEMPLATE_SPECIALIZATIONS (t), | |
4740 | DECL_TEMPLATE_SPECIALIZATIONS (old_decl)); | |
4741 | DECL_TEMPLATE_SPECIALIZATIONS (old_decl) = NULL_TREE; | |
4742 | } | |
4743 | } | |
4744 | } | |
4745 | ||
4746 | /* The information from NEW_FRIEND has been merged into OLD_DECL | |
4747 | by duplicate_decls. */ | |
4748 | new_friend = old_decl; | |
4749 | } | |
4750 | } | |
4751 | else if (COMPLETE_TYPE_P (DECL_CONTEXT (new_friend))) | |
4752 | { | |
4753 | /* Check to see that the declaration is really present, and, | |
4754 | possibly obtain an improved declaration. */ | |
4755 | tree fn = check_classfn (DECL_CONTEXT (new_friend), | |
4756 | new_friend); | |
4757 | ||
4758 | if (fn) | |
4759 | new_friend = fn; | |
4760 | } | |
4761 | ||
4762 | done: | |
4763 | lineno = line; | |
4764 | input_filename = file; | |
4765 | return new_friend; | |
4766 | } | |
4767 | ||
4768 | /* FRIEND_TMPL is a friend TEMPLATE_DECL. ARGS is the vector of | |
4769 | template arguments, as for tsubst. | |
4770 | ||
4771 | Returns an appropriate tsubst'd friend type or error_mark_node on | |
4772 | failure. */ | |
4773 | ||
4774 | static tree | |
4775 | tsubst_friend_class (friend_tmpl, args) | |
4776 | tree friend_tmpl; | |
4777 | tree args; | |
4778 | { | |
4779 | tree friend_type; | |
4780 | tree tmpl; | |
4781 | ||
4782 | /* First, we look for a class template. */ | |
4783 | tmpl = lookup_name (DECL_NAME (friend_tmpl), /*prefer_type=*/0); | |
4784 | ||
4785 | /* But, if we don't find one, it might be because we're in a | |
4786 | situation like this: | |
4787 | ||
4788 | template <class T> | |
4789 | struct S { | |
4790 | template <class U> | |
4791 | friend struct S; | |
4792 | }; | |
4793 | ||
4794 | Here, in the scope of (say) S<int>, `S' is bound to a TYPE_DECL | |
4795 | for `S<int>', not the TEMPLATE_DECL. */ | |
4796 | if (!tmpl || !DECL_CLASS_TEMPLATE_P (tmpl)) | |
4797 | { | |
4798 | tmpl = lookup_name (DECL_NAME (friend_tmpl), /*prefer_type=*/1); | |
4799 | tmpl = maybe_get_template_decl_from_type_decl (tmpl); | |
4800 | } | |
4801 | ||
4802 | if (tmpl && DECL_CLASS_TEMPLATE_P (tmpl)) | |
4803 | { | |
4804 | /* The friend template has already been declared. Just | |
4805 | check to see that the declarations match, and install any new | |
4806 | default parameters. We must tsubst the default parameters, | |
4807 | of course. We only need the innermost template parameters | |
4808 | because that is all that redeclare_class_template will look | |
4809 | at. */ | |
4810 | tree parms | |
4811 | = tsubst_template_parms (DECL_TEMPLATE_PARMS (friend_tmpl), | |
4812 | args, /*complain=*/1); | |
4813 | if (!parms) | |
4814 | return error_mark_node; | |
4815 | redeclare_class_template (TREE_TYPE (tmpl), parms); | |
4816 | friend_type = TREE_TYPE (tmpl); | |
4817 | } | |
4818 | else | |
4819 | { | |
4820 | /* The friend template has not already been declared. In this | |
4821 | case, the instantiation of the template class will cause the | |
4822 | injection of this template into the global scope. */ | |
4823 | tmpl = tsubst (friend_tmpl, args, /*complain=*/1, NULL_TREE); | |
4824 | ||
4825 | /* The new TMPL is not an instantiation of anything, so we | |
4826 | forget its origins. We don't reset CLASSTYPE_TI_TEMPLATE for | |
4827 | the new type because that is supposed to be the corresponding | |
4828 | template decl, i.e., TMPL. */ | |
4829 | DECL_USE_TEMPLATE (tmpl) = 0; | |
4830 | DECL_TEMPLATE_INFO (tmpl) = NULL_TREE; | |
4831 | CLASSTYPE_USE_TEMPLATE (TREE_TYPE (tmpl)) = 0; | |
4832 | ||
4833 | /* Inject this template into the global scope. */ | |
4834 | friend_type = TREE_TYPE (pushdecl_top_level (tmpl)); | |
4835 | } | |
4836 | ||
4837 | return friend_type; | |
4838 | } | |
4839 | ||
4840 | tree | |
4841 | instantiate_class_template (type) | |
4842 | tree type; | |
4843 | { | |
4844 | tree template, args, pattern, t; | |
4845 | tree typedecl; | |
4846 | ||
4847 | if (type == error_mark_node) | |
4848 | return error_mark_node; | |
4849 | ||
4850 | if (TYPE_BEING_DEFINED (type) || COMPLETE_TYPE_P (type)) | |
4851 | return type; | |
4852 | ||
4853 | /* Figure out which template is being instantiated. */ | |
4854 | template = most_general_template (CLASSTYPE_TI_TEMPLATE (type)); | |
4855 | my_friendly_assert (TREE_CODE (template) == TEMPLATE_DECL, 279); | |
4856 | ||
4857 | /* Figure out which arguments are being used to do the | |
4858 | instantiation. */ | |
4859 | args = CLASSTYPE_TI_ARGS (type); | |
4860 | PARTIAL_INSTANTIATION_P (type) = uses_template_parms (args); | |
4861 | ||
4862 | if (pedantic && PARTIAL_INSTANTIATION_P (type)) | |
4863 | /* If this is a partial instantiation, then we can't instantiate | |
4864 | the type; there's no telling whether or not one of the | |
4865 | template parameters might eventually be instantiated to some | |
4866 | value that results in a specialization being used. For | |
4867 | example, consider: | |
4868 | ||
4869 | template <class T> | |
4870 | struct S {}; | |
4871 | ||
4872 | template <class U> | |
4873 | void f(S<U>); | |
4874 | ||
4875 | template <> | |
4876 | struct S<int> {}; | |
4877 | ||
4878 | Now, the `S<U>' in `f<int>' is the specialization, not an | |
4879 | instantiation of the original template. */ | |
4880 | return type; | |
4881 | ||
4882 | /* Determine what specialization of the original template to | |
4883 | instantiate. */ | |
4884 | if (PARTIAL_INSTANTIATION_P (type)) | |
4885 | /* There's no telling which specialization is appropriate at this | |
4886 | point. Since all peeking at the innards of this partial | |
4887 | instantiation are extensions (like the "implicit typename" | |
4888 | extension, which allows users to omit the keyword `typename' on | |
4889 | names that are declared as types in template base classes), we | |
4890 | are free to do what we please. | |
4891 | ||
4892 | Trying to figure out which partial instantiation to use can | |
4893 | cause a crash. (Some of the template arguments don't even have | |
4894 | types.) So, we just use the most general version. */ | |
4895 | t = NULL_TREE; | |
4896 | else | |
4897 | { | |
4898 | t = most_specialized_class (template, args); | |
4899 | ||
4900 | if (t == error_mark_node) | |
4901 | { | |
4902 | const char *str = "candidates are:"; | |
4903 | cp_error ("ambiguous class template instantiation for `%#T'", type); | |
4904 | for (t = DECL_TEMPLATE_SPECIALIZATIONS (template); t; | |
4905 | t = TREE_CHAIN (t)) | |
4906 | { | |
4907 | if (get_class_bindings (TREE_VALUE (t), TREE_PURPOSE (t), | |
4908 | args)) | |
4909 | { | |
4910 | cp_error_at ("%s %+#T", str, TREE_TYPE (t)); | |
4911 | str = " "; | |
4912 | } | |
4913 | } | |
4914 | TYPE_BEING_DEFINED (type) = 1; | |
4915 | return error_mark_node; | |
4916 | } | |
4917 | } | |
4918 | ||
4919 | if (t) | |
4920 | pattern = TREE_TYPE (t); | |
4921 | else | |
4922 | pattern = TREE_TYPE (template); | |
4923 | ||
4924 | /* If the template we're instantiating is incomplete, then clearly | |
4925 | there's nothing we can do. */ | |
4926 | if (!COMPLETE_TYPE_P (pattern)) | |
4927 | return type; | |
4928 | ||
4929 | /* If this is a partial instantiation, don't tsubst anything. We will | |
4930 | only use this type for implicit typename, so the actual contents don't | |
4931 | matter. All that matters is whether a particular name is a type. */ | |
4932 | if (PARTIAL_INSTANTIATION_P (type)) | |
4933 | { | |
4934 | /* The fields set here must be kept in sync with those cleared | |
4935 | in begin_class_definition. */ | |
4936 | TYPE_BINFO_BASETYPES (type) = TYPE_BINFO_BASETYPES (pattern); | |
4937 | TYPE_FIELDS (type) = TYPE_FIELDS (pattern); | |
4938 | TYPE_METHODS (type) = TYPE_METHODS (pattern); | |
4939 | CLASSTYPE_TAGS (type) = CLASSTYPE_TAGS (pattern); | |
4940 | CLASSTYPE_VBASECLASSES (type) = CLASSTYPE_VBASECLASSES (pattern); | |
4941 | ||
4942 | /* Pretend that the type is complete, so that we will look | |
4943 | inside it during name lookup and such. */ | |
4944 | TYPE_SIZE (type) = bitsize_zero_node; | |
4945 | return type; | |
4946 | } | |
4947 | ||
4948 | /* If we've recursively instantiated too many templates, stop. */ | |
4949 | if (! push_tinst_level (type)) | |
4950 | return type; | |
4951 | ||
4952 | /* Now we're really doing the instantiation. Mark the type as in | |
4953 | the process of being defined. */ | |
4954 | TYPE_BEING_DEFINED (type) = 1; | |
4955 | ||
4956 | maybe_push_to_top_level (uses_template_parms (type)); | |
4957 | ||
4958 | if (t) | |
4959 | { | |
4960 | /* This TYPE is actually a instantiation of of a partial | |
4961 | specialization. We replace the innermost set of ARGS with | |
4962 | the arguments appropriate for substitution. For example, | |
4963 | given: | |
4964 | ||
4965 | template <class T> struct S {}; | |
4966 | template <class T> struct S<T*> {}; | |
4967 | ||
4968 | and supposing that we are instantiating S<int*>, ARGS will | |
4969 | present be {int*} but we need {int}. */ | |
4970 | tree inner_args | |
4971 | = get_class_bindings (TREE_VALUE (t), TREE_PURPOSE (t), | |
4972 | args); | |
4973 | ||
4974 | /* If there were multiple levels in ARGS, replacing the | |
4975 | innermost level would alter CLASSTYPE_TI_ARGS, which we don't | |
4976 | want, so we make a copy first. */ | |
4977 | if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (args)) | |
4978 | { | |
4979 | args = copy_node (args); | |
4980 | SET_TMPL_ARGS_LEVEL (args, TMPL_ARGS_DEPTH (args), inner_args); | |
4981 | } | |
4982 | else | |
4983 | args = inner_args; | |
4984 | } | |
4985 | ||
4986 | if (flag_external_templates) | |
4987 | { | |
4988 | if (flag_alt_external_templates) | |
4989 | { | |
4990 | CLASSTYPE_INTERFACE_ONLY (type) = interface_only; | |
4991 | SET_CLASSTYPE_INTERFACE_UNKNOWN_X (type, interface_unknown); | |
4992 | CLASSTYPE_VTABLE_NEEDS_WRITING (type) | |
4993 | = (! CLASSTYPE_INTERFACE_ONLY (type) | |
4994 | && CLASSTYPE_INTERFACE_KNOWN (type)); | |
4995 | } | |
4996 | else | |
4997 | { | |
4998 | CLASSTYPE_INTERFACE_ONLY (type) = CLASSTYPE_INTERFACE_ONLY (pattern); | |
4999 | SET_CLASSTYPE_INTERFACE_UNKNOWN_X | |
5000 | (type, CLASSTYPE_INTERFACE_UNKNOWN (pattern)); | |
5001 | CLASSTYPE_VTABLE_NEEDS_WRITING (type) | |
5002 | = (! CLASSTYPE_INTERFACE_ONLY (type) | |
5003 | && CLASSTYPE_INTERFACE_KNOWN (type)); | |
5004 | } | |
5005 | } | |
5006 | else | |
5007 | { | |
5008 | SET_CLASSTYPE_INTERFACE_UNKNOWN (type); | |
5009 | CLASSTYPE_VTABLE_NEEDS_WRITING (type) = 1; | |
5010 | } | |
5011 | ||
5012 | TYPE_HAS_CONSTRUCTOR (type) = TYPE_HAS_CONSTRUCTOR (pattern); | |
5013 | TYPE_HAS_DESTRUCTOR (type) = TYPE_HAS_DESTRUCTOR (pattern); | |
5014 | TYPE_OVERLOADS_CALL_EXPR (type) = TYPE_OVERLOADS_CALL_EXPR (pattern); | |
5015 | TYPE_OVERLOADS_ARRAY_REF (type) = TYPE_OVERLOADS_ARRAY_REF (pattern); | |
5016 | TYPE_OVERLOADS_ARROW (type) = TYPE_OVERLOADS_ARROW (pattern); | |
5017 | TYPE_HAS_NEW_OPERATOR (type) = TYPE_HAS_NEW_OPERATOR (pattern); | |
5018 | TYPE_HAS_ARRAY_NEW_OPERATOR (type) = TYPE_HAS_ARRAY_NEW_OPERATOR (pattern); | |
5019 | TYPE_GETS_DELETE (type) = TYPE_GETS_DELETE (pattern); | |
5020 | TYPE_VEC_DELETE_TAKES_SIZE (type) = TYPE_VEC_DELETE_TAKES_SIZE (pattern); | |
5021 | TYPE_HAS_ASSIGN_REF (type) = TYPE_HAS_ASSIGN_REF (pattern); | |
5022 | TYPE_HAS_CONST_ASSIGN_REF (type) = TYPE_HAS_CONST_ASSIGN_REF (pattern); | |
5023 | TYPE_HAS_ABSTRACT_ASSIGN_REF (type) = TYPE_HAS_ABSTRACT_ASSIGN_REF (pattern); | |
5024 | TYPE_HAS_INIT_REF (type) = TYPE_HAS_INIT_REF (pattern); | |
5025 | TYPE_HAS_CONST_INIT_REF (type) = TYPE_HAS_CONST_INIT_REF (pattern); | |
5026 | TYPE_HAS_DEFAULT_CONSTRUCTOR (type) = TYPE_HAS_DEFAULT_CONSTRUCTOR (pattern); | |
5027 | TYPE_HAS_CONVERSION (type) = TYPE_HAS_CONVERSION (pattern); | |
5028 | TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (type) | |
5029 | = TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (pattern); | |
5030 | TYPE_USES_MULTIPLE_INHERITANCE (type) | |
5031 | = TYPE_USES_MULTIPLE_INHERITANCE (pattern); | |
5032 | TYPE_USES_VIRTUAL_BASECLASSES (type) | |
5033 | = TYPE_USES_VIRTUAL_BASECLASSES (pattern); | |
5034 | TYPE_PACKED (type) = TYPE_PACKED (pattern); | |
5035 | TYPE_ALIGN (type) = TYPE_ALIGN (pattern); | |
5036 | TYPE_USER_ALIGN (type) = TYPE_USER_ALIGN (pattern); | |
5037 | TYPE_FOR_JAVA (type) = TYPE_FOR_JAVA (pattern); /* For libjava's JArray<T> */ | |
5038 | if (ANON_AGGR_TYPE_P (pattern)) | |
5039 | SET_ANON_AGGR_TYPE_P (type); | |
5040 | ||
5041 | if (TYPE_BINFO_BASETYPES (pattern)) | |
5042 | { | |
5043 | tree base_list = NULL_TREE; | |
5044 | tree pbases = TYPE_BINFO_BASETYPES (pattern); | |
5045 | int i; | |
5046 | ||
5047 | /* Substitute into each of the bases to determine the actual | |
5048 | basetypes. */ | |
5049 | for (i = 0; i < TREE_VEC_LENGTH (pbases); ++i) | |
5050 | { | |
5051 | tree base; | |
5052 | tree access; | |
5053 | tree pbase; | |
5054 | ||
5055 | pbase = TREE_VEC_ELT (pbases, i); | |
5056 | ||
5057 | /* Substitute to figure out the base class. */ | |
5058 | base = tsubst (BINFO_TYPE (pbase), args, | |
5059 | /*complain=*/1, NULL_TREE); | |
5060 | if (base == error_mark_node) | |
5061 | continue; | |
5062 | ||
5063 | /* Calculate the correct access node. */ | |
5064 | if (TREE_VIA_VIRTUAL (pbase)) | |
5065 | { | |
5066 | if (TREE_VIA_PUBLIC (pbase)) | |
5067 | access = access_public_virtual_node; | |
5068 | else if (TREE_VIA_PROTECTED (pbase)) | |
5069 | access = access_protected_virtual_node; | |
5070 | else | |
5071 | access = access_private_virtual_node; | |
5072 | } | |
5073 | else | |
5074 | { | |
5075 | if (TREE_VIA_PUBLIC (pbase)) | |
5076 | access = access_public_node; | |
5077 | else if (TREE_VIA_PROTECTED (pbase)) | |
5078 | access = access_protected_node; | |
5079 | else | |
5080 | access = access_private_node; | |
5081 | } | |
5082 | ||
5083 | base_list = tree_cons (access, base, base_list); | |
5084 | } | |
5085 | ||
5086 | /* The list is now in reverse order; correct that. */ | |
5087 | base_list = nreverse (base_list); | |
5088 | ||
5089 | /* Now call xref_basetypes to set up all the base-class | |
5090 | information. */ | |
5091 | xref_basetypes (TREE_CODE (pattern) == RECORD_TYPE | |
5092 | ? (CLASSTYPE_DECLARED_CLASS (pattern) | |
5093 | ? class_type_node : record_type_node) | |
5094 | : union_type_node, | |
5095 | DECL_NAME (TYPE_NAME (pattern)), | |
5096 | type, | |
5097 | base_list); | |
5098 | } | |
5099 | ||
5100 | /* Now that our base classes are set up, enter the scope of the | |
5101 | class, so that name lookups into base classes, etc. will work | |
5102 | correctly. This is precisely analogous to what we do in | |
5103 | begin_class_definition when defining an ordinary non-template | |
5104 | class. */ | |
5105 | pushclass (type, 1); | |
5106 | ||
5107 | for (t = CLASSTYPE_TAGS (pattern); t; t = TREE_CHAIN (t)) | |
5108 | { | |
5109 | tree tag = TREE_VALUE (t); | |
5110 | tree name = TYPE_IDENTIFIER (tag); | |
5111 | tree newtag; | |
5112 | ||
5113 | newtag = tsubst (tag, args, /*complain=*/1, NULL_TREE); | |
5114 | my_friendly_assert (newtag != error_mark_node, 20010206); | |
5115 | if (TREE_CODE (newtag) != ENUMERAL_TYPE) | |
5116 | { | |
5117 | if (TYPE_LANG_SPECIFIC (tag) && CLASSTYPE_IS_TEMPLATE (tag)) | |
5118 | /* Unfortunately, lookup_template_class sets | |
5119 | CLASSTYPE_IMPLICIT_INSTANTIATION for a partial | |
5120 | instantiation (i.e., for the type of a member template | |
5121 | class nested within a template class.) This behavior is | |
5122 | required for maybe_process_partial_specialization to work | |
5123 | correctly, but is not accurate in this case; the TAG is not | |
5124 | an instantiation of anything. (The corresponding | |
5125 | TEMPLATE_DECL is an instantiation, but the TYPE is not.) */ | |
5126 | CLASSTYPE_USE_TEMPLATE (newtag) = 0; | |
5127 | ||
5128 | /* Now, we call pushtag to put this NEWTAG into the scope of | |
5129 | TYPE. We first set up the IDENTIFIER_TYPE_VALUE to avoid | |
5130 | pushtag calling push_template_decl. We don't have to do | |
5131 | this for enums because it will already have been done in | |
5132 | tsubst_enum. */ | |
5133 | if (name) | |
5134 | SET_IDENTIFIER_TYPE_VALUE (name, newtag); | |
5135 | pushtag (name, newtag, /*globalize=*/0); | |
5136 | } | |
5137 | } | |
5138 | ||
5139 | /* Don't replace enum constants here. */ | |
5140 | for (t = TYPE_FIELDS (pattern); t; t = TREE_CHAIN (t)) | |
5141 | if (TREE_CODE (t) != CONST_DECL) | |
5142 | { | |
5143 | tree r; | |
5144 | ||
5145 | /* The the file and line for this declaration, to assist in | |
5146 | error message reporting. Since we called push_tinst_level | |
5147 | above, we don't need to restore these. */ | |
5148 | lineno = DECL_SOURCE_LINE (t); | |
5149 | input_filename = DECL_SOURCE_FILE (t); | |
5150 | ||
5151 | r = tsubst (t, args, /*complain=*/1, NULL_TREE); | |
5152 | if (TREE_CODE (r) == VAR_DECL) | |
5153 | { | |
5154 | tree init; | |
5155 | ||
5156 | if (DECL_INITIALIZED_IN_CLASS_P (r)) | |
5157 | init = tsubst_expr (DECL_INITIAL (t), args, | |
5158 | /*complain=*/1, NULL_TREE); | |
5159 | else | |
5160 | init = NULL_TREE; | |
5161 | ||
5162 | finish_static_data_member_decl (r, init, | |
5163 | /*asmspec_tree=*/NULL_TREE, | |
5164 | /*flags=*/0); | |
5165 | ||
5166 | if (DECL_INITIALIZED_IN_CLASS_P (r)) | |
5167 | check_static_variable_definition (r, TREE_TYPE (r)); | |
5168 | } | |
5169 | ||
5170 | /* R will have a TREE_CHAIN if and only if it has already been | |
5171 | processed by finish_member_declaration. This can happen | |
5172 | if, for example, it is a TYPE_DECL for a class-scoped | |
5173 | ENUMERAL_TYPE; such a thing will already have been added to | |
5174 | the field list by tsubst_enum above. */ | |
5175 | if (!TREE_CHAIN (r)) | |
5176 | { | |
5177 | set_current_access_from_decl (r); | |
5178 | finish_member_declaration (r); | |
5179 | } | |
5180 | } | |
5181 | ||
5182 | /* Set up the list (TYPE_METHODS) and vector (CLASSTYPE_METHOD_VEC) | |
5183 | for this instantiation. */ | |
5184 | for (t = TYPE_METHODS (pattern); t; t = TREE_CHAIN (t)) | |
5185 | { | |
5186 | tree r = tsubst (t, args, /*complain=*/1, NULL_TREE); | |
5187 | set_current_access_from_decl (r); | |
5188 | finish_member_declaration (r); | |
5189 | } | |
5190 | ||
5191 | /* Construct the DECL_FRIENDLIST for the new class type. */ | |
5192 | typedecl = TYPE_MAIN_DECL (type); | |
5193 | for (t = DECL_FRIENDLIST (TYPE_MAIN_DECL (pattern)); | |
5194 | t != NULL_TREE; | |
5195 | t = TREE_CHAIN (t)) | |
5196 | { | |
5197 | tree friends; | |
5198 | ||
5199 | for (friends = TREE_VALUE (t); | |
5200 | friends != NULL_TREE; | |
5201 | friends = TREE_CHAIN (friends)) | |
5202 | if (TREE_PURPOSE (friends) == error_mark_node) | |
5203 | add_friend (type, | |
5204 | tsubst_friend_function (TREE_VALUE (friends), | |
5205 | args)); | |
5206 | else | |
5207 | my_friendly_abort (20000216); | |
5208 | } | |
5209 | ||
5210 | for (t = CLASSTYPE_FRIEND_CLASSES (pattern); | |
5211 | t != NULL_TREE; | |
5212 | t = TREE_CHAIN (t)) | |
5213 | { | |
5214 | tree friend_type = TREE_VALUE (t); | |
5215 | tree new_friend_type; | |
5216 | ||
5217 | if (TREE_CODE (friend_type) == TEMPLATE_DECL) | |
5218 | new_friend_type = tsubst_friend_class (friend_type, args); | |
5219 | else if (uses_template_parms (friend_type)) | |
5220 | new_friend_type = tsubst (friend_type, args, /*complain=*/1, | |
5221 | NULL_TREE); | |
5222 | else | |
5223 | { | |
5224 | tree ns = decl_namespace_context (TYPE_MAIN_DECL (friend_type)); | |
5225 | ||
5226 | /* The call to xref_tag_from_type does injection for friend | |
5227 | classes. */ | |
5228 | push_nested_namespace (ns); | |
5229 | new_friend_type = | |
5230 | xref_tag_from_type (friend_type, NULL_TREE, 1); | |
5231 | pop_nested_namespace (ns); | |
5232 | } | |
5233 | ||
5234 | if (TREE_CODE (friend_type) == TEMPLATE_DECL) | |
5235 | /* Trick make_friend_class into realizing that the friend | |
5236 | we're adding is a template, not an ordinary class. It's | |
5237 | important that we use make_friend_class since it will | |
5238 | perform some error-checking and output cross-reference | |
5239 | information. */ | |
5240 | ++processing_template_decl; | |
5241 | ||
5242 | if (new_friend_type != error_mark_node) | |
5243 | make_friend_class (type, new_friend_type); | |
5244 | ||
5245 | if (TREE_CODE (friend_type) == TEMPLATE_DECL) | |
5246 | --processing_template_decl; | |
5247 | } | |
5248 | ||
5249 | for (t = TYPE_FIELDS (type); t; t = TREE_CHAIN (t)) | |
5250 | if (TREE_CODE (t) == FIELD_DECL) | |
5251 | { | |
5252 | TREE_TYPE (t) = complete_type (TREE_TYPE (t)); | |
5253 | require_complete_type (t); | |
5254 | } | |
5255 | ||
5256 | /* Set the file and line number information to whatever is given for | |
5257 | the class itself. This puts error messages involving generated | |
5258 | implicit functions at a predictable point, and the same point | |
5259 | that would be used for non-template classes. */ | |
5260 | lineno = DECL_SOURCE_LINE (typedecl); | |
5261 | input_filename = DECL_SOURCE_FILE (typedecl); | |
5262 | ||
5263 | unreverse_member_declarations (type); | |
5264 | finish_struct_1 (type); | |
5265 | CLASSTYPE_GOT_SEMICOLON (type) = 1; | |
5266 | ||
5267 | /* Clear this now so repo_template_used is happy. */ | |
5268 | TYPE_BEING_DEFINED (type) = 0; | |
5269 | repo_template_used (type); | |
5270 | ||
5271 | /* Now that the class is complete, instantiate default arguments for | |
5272 | any member functions. We don't do this earlier because the | |
5273 | default arguments may reference members of the class. */ | |
5274 | if (!PRIMARY_TEMPLATE_P (template)) | |
5275 | for (t = TYPE_METHODS (type); t; t = TREE_CHAIN (t)) | |
5276 | if (TREE_CODE (t) == FUNCTION_DECL | |
5277 | /* Implicitly generated member functions will not have template | |
5278 | information; they are not instantiations, but instead are | |
5279 | created "fresh" for each instantiation. */ | |
5280 | && DECL_TEMPLATE_INFO (t)) | |
5281 | tsubst_default_arguments (t); | |
5282 | ||
5283 | popclass (); | |
5284 | pop_from_top_level (); | |
5285 | pop_tinst_level (); | |
5286 | ||
5287 | return type; | |
5288 | } | |
5289 | ||
5290 | static int | |
5291 | list_eq (t1, t2) | |
5292 | tree t1, t2; | |
5293 | { | |
5294 | if (t1 == NULL_TREE) | |
5295 | return t2 == NULL_TREE; | |
5296 | if (t2 == NULL_TREE) | |
5297 | return 0; | |
5298 | /* Don't care if one declares its arg const and the other doesn't -- the | |
5299 | main variant of the arg type is all that matters. */ | |
5300 | if (TYPE_MAIN_VARIANT (TREE_VALUE (t1)) | |
5301 | != TYPE_MAIN_VARIANT (TREE_VALUE (t2))) | |
5302 | return 0; | |
5303 | return list_eq (TREE_CHAIN (t1), TREE_CHAIN (t2)); | |
5304 | } | |
5305 | ||
5306 | /* If arg is a non-type template parameter that does not depend on template | |
5307 | arguments, fold it like we weren't in the body of a template. */ | |
5308 | ||
5309 | static tree | |
5310 | maybe_fold_nontype_arg (arg) | |
5311 | tree arg; | |
5312 | { | |
5313 | /* If we're not in a template, ARG is already as simple as it's going to | |
5314 | get, and trying to reprocess the trees will break. */ | |
5315 | if (! processing_template_decl) | |
5316 | return arg; | |
5317 | ||
5318 | if (!TYPE_P (arg) && !uses_template_parms (arg)) | |
5319 | { | |
5320 | /* Sometimes, one of the args was an expression involving a | |
5321 | template constant parameter, like N - 1. Now that we've | |
5322 | tsubst'd, we might have something like 2 - 1. This will | |
5323 | confuse lookup_template_class, so we do constant folding | |
5324 | here. We have to unset processing_template_decl, to | |
5325 | fool build_expr_from_tree() into building an actual | |
5326 | tree. */ | |
5327 | ||
5328 | int saved_processing_template_decl = processing_template_decl; | |
5329 | processing_template_decl = 0; | |
5330 | arg = fold (build_expr_from_tree (arg)); | |
5331 | processing_template_decl = saved_processing_template_decl; | |
5332 | } | |
5333 | return arg; | |
5334 | } | |
5335 | ||
5336 | /* Substitute ARGS into the vector of template arguments T. */ | |
5337 | ||
5338 | static tree | |
5339 | tsubst_template_arg_vector (t, args, complain) | |
5340 | tree t; | |
5341 | tree args; | |
5342 | int complain; | |
5343 | { | |
5344 | int len = TREE_VEC_LENGTH (t), need_new = 0, i; | |
5345 | tree *elts = (tree *) alloca (len * sizeof (tree)); | |
5346 | ||
5347 | memset ((char *) elts, 0, len * sizeof (tree)); | |
5348 | ||
5349 | for (i = 0; i < len; i++) | |
5350 | { | |
5351 | if (TREE_VEC_ELT (t, i) != NULL_TREE | |
5352 | && TREE_CODE (TREE_VEC_ELT (t, i)) == TREE_VEC) | |
5353 | elts[i] = tsubst_template_arg_vector (TREE_VEC_ELT (t, i), | |
5354 | args, complain); | |
5355 | else | |
5356 | elts[i] = maybe_fold_nontype_arg | |
5357 | (tsubst_expr (TREE_VEC_ELT (t, i), args, complain, | |
5358 | NULL_TREE)); | |
5359 | ||
5360 | if (elts[i] == error_mark_node) | |
5361 | return error_mark_node; | |
5362 | ||
5363 | if (elts[i] != TREE_VEC_ELT (t, i)) | |
5364 | need_new = 1; | |
5365 | } | |
5366 | ||
5367 | if (!need_new) | |
5368 | return t; | |
5369 | ||
5370 | t = make_tree_vec (len); | |
5371 | for (i = 0; i < len; i++) | |
5372 | TREE_VEC_ELT (t, i) = elts[i]; | |
5373 | ||
5374 | return t; | |
5375 | } | |
5376 | ||
5377 | /* Return the result of substituting ARGS into the template parameters | |
5378 | given by PARMS. If there are m levels of ARGS and m + n levels of | |
5379 | PARMS, then the result will contain n levels of PARMS. For | |
5380 | example, if PARMS is `template <class T> template <class U> | |
5381 | template <T*, U, class V>' and ARGS is {{int}, {double}} then the | |
5382 | result will be `template <int*, double, class V>'. */ | |
5383 | ||
5384 | static tree | |
5385 | tsubst_template_parms (parms, args, complain) | |
5386 | tree parms; | |
5387 | tree args; | |
5388 | int complain; | |
5389 | { | |
5390 | tree r = NULL_TREE; | |
5391 | tree* new_parms; | |
5392 | ||
5393 | for (new_parms = &r; | |
5394 | TMPL_PARMS_DEPTH (parms) > TMPL_ARGS_DEPTH (args); | |
5395 | new_parms = &(TREE_CHAIN (*new_parms)), | |
5396 | parms = TREE_CHAIN (parms)) | |
5397 | { | |
5398 | tree new_vec = | |
5399 | make_tree_vec (TREE_VEC_LENGTH (TREE_VALUE (parms))); | |
5400 | int i; | |
5401 | ||
5402 | for (i = 0; i < TREE_VEC_LENGTH (new_vec); ++i) | |
5403 | { | |
5404 | tree default_value = | |
5405 | TREE_PURPOSE (TREE_VEC_ELT (TREE_VALUE (parms), i)); | |
5406 | tree parm_decl = | |
5407 | TREE_VALUE (TREE_VEC_ELT (TREE_VALUE (parms), i)); | |
5408 | ||
5409 | TREE_VEC_ELT (new_vec, i) | |
5410 | = build_tree_list (tsubst (default_value, args, complain, | |
5411 | NULL_TREE), | |
5412 | tsubst (parm_decl, args, complain, | |
5413 | NULL_TREE)); | |
5414 | } | |
5415 | ||
5416 | *new_parms = | |
5417 | tree_cons (size_int (TMPL_PARMS_DEPTH (parms) | |
5418 | - TMPL_ARGS_DEPTH (args)), | |
5419 | new_vec, NULL_TREE); | |
5420 | } | |
5421 | ||
5422 | return r; | |
5423 | } | |
5424 | ||
5425 | /* Substitute the ARGS into the indicated aggregate (or enumeration) | |
5426 | type T. If T is not an aggregate or enumeration type, it is | |
5427 | handled as if by tsubst. IN_DECL is as for tsubst. If | |
5428 | ENTERING_SCOPE is non-zero, T is the context for a template which | |
5429 | we are presently tsubst'ing. Return the substituted value. */ | |
5430 | ||
5431 | static tree | |
5432 | tsubst_aggr_type (t, args, complain, in_decl, entering_scope) | |
5433 | tree t; | |
5434 | tree args; | |
5435 | int complain; | |
5436 | tree in_decl; | |
5437 | int entering_scope; | |
5438 | { | |
5439 | if (t == NULL_TREE) | |
5440 | return NULL_TREE; | |
5441 | ||
5442 | switch (TREE_CODE (t)) | |
5443 | { | |
5444 | case RECORD_TYPE: | |
5445 | if (TYPE_PTRMEMFUNC_P (t)) | |
5446 | { | |
5447 | tree r = build_ptrmemfunc_type | |
5448 | (tsubst (TYPE_PTRMEMFUNC_FN_TYPE (t), args, complain, in_decl)); | |
5449 | return cp_build_qualified_type_real (r, TYPE_QUALS (t), | |
5450 | complain); | |
5451 | } | |
5452 | ||
5453 | /* else fall through */ | |
5454 | case ENUMERAL_TYPE: | |
5455 | case UNION_TYPE: | |
5456 | if (TYPE_TEMPLATE_INFO (t)) | |
5457 | { | |
5458 | tree argvec; | |
5459 | tree context; | |
5460 | tree r; | |
5461 | ||
5462 | /* First, determine the context for the type we are looking | |
5463 | up. */ | |
5464 | if (TYPE_CONTEXT (t) != NULL_TREE) | |
5465 | context = tsubst_aggr_type (TYPE_CONTEXT (t), args, | |
5466 | complain, | |
5467 | in_decl, /*entering_scope=*/1); | |
5468 | else | |
5469 | context = NULL_TREE; | |
5470 | ||
5471 | /* Then, figure out what arguments are appropriate for the | |
5472 | type we are trying to find. For example, given: | |
5473 | ||
5474 | template <class T> struct S; | |
5475 | template <class T, class U> void f(T, U) { S<U> su; } | |
5476 | ||
5477 | and supposing that we are instantiating f<int, double>, | |
5478 | then our ARGS will be {int, double}, but, when looking up | |
5479 | S we only want {double}. */ | |
5480 | argvec = tsubst_template_arg_vector (TYPE_TI_ARGS (t), args, | |
5481 | complain); | |
5482 | if (argvec == error_mark_node) | |
5483 | return error_mark_node; | |
5484 | ||
5485 | r = lookup_template_class (t, argvec, in_decl, context, | |
5486 | entering_scope, complain); | |
5487 | ||
5488 | return cp_build_qualified_type_real (r, TYPE_QUALS (t), | |
5489 | complain); | |
5490 | } | |
5491 | else | |
5492 | /* This is not a template type, so there's nothing to do. */ | |
5493 | return t; | |
5494 | ||
5495 | default: | |
5496 | return tsubst (t, args, complain, in_decl); | |
5497 | } | |
5498 | } | |
5499 | ||
5500 | /* Substitute into the default argument ARG (a default argument for | |
5501 | FN), which has the indicated TYPE. */ | |
5502 | ||
5503 | tree | |
5504 | tsubst_default_argument (fn, type, arg) | |
5505 | tree fn; | |
5506 | tree type; | |
5507 | tree arg; | |
5508 | { | |
5509 | /* This default argument came from a template. Instantiate the | |
5510 | default argument here, not in tsubst. In the case of | |
5511 | something like: | |
5512 | ||
5513 | template <class T> | |
5514 | struct S { | |
5515 | static T t(); | |
5516 | void f(T = t()); | |
5517 | }; | |
5518 | ||
5519 | we must be careful to do name lookup in the scope of S<T>, | |
5520 | rather than in the current class. */ | |
5521 | if (DECL_CLASS_SCOPE_P (fn)) | |
5522 | pushclass (DECL_CONTEXT (fn), 2); | |
5523 | ||
5524 | arg = tsubst_expr (arg, DECL_TI_ARGS (fn), /*complain=*/1, NULL_TREE); | |
5525 | ||
5526 | if (DECL_CLASS_SCOPE_P (fn)) | |
5527 | popclass (); | |
5528 | ||
5529 | /* Make sure the default argument is reasonable. */ | |
5530 | arg = check_default_argument (type, arg); | |
5531 | ||
5532 | return arg; | |
5533 | } | |
5534 | ||
5535 | /* Substitute into all the default arguments for FN. */ | |
5536 | ||
5537 | static void | |
5538 | tsubst_default_arguments (fn) | |
5539 | tree fn; | |
5540 | { | |
5541 | tree arg; | |
5542 | tree tmpl_args; | |
5543 | ||
5544 | tmpl_args = DECL_TI_ARGS (fn); | |
5545 | ||
5546 | /* If this function is not yet instantiated, we certainly don't need | |
5547 | its default arguments. */ | |
5548 | if (uses_template_parms (tmpl_args)) | |
5549 | return; | |
5550 | ||
5551 | for (arg = TYPE_ARG_TYPES (TREE_TYPE (fn)); | |
5552 | arg; | |
5553 | arg = TREE_CHAIN (arg)) | |
5554 | if (TREE_PURPOSE (arg)) | |
5555 | TREE_PURPOSE (arg) = tsubst_default_argument (fn, | |
5556 | TREE_VALUE (arg), | |
5557 | TREE_PURPOSE (arg)); | |
5558 | } | |
5559 | ||
5560 | /* Substitute the ARGS into the T, which is a _DECL. TYPE is the | |
5561 | (already computed) substitution of ARGS into TREE_TYPE (T), if | |
5562 | appropriate. Return the result of the substitution. */ | |
5563 | ||
5564 | static tree | |
5565 | tsubst_decl (t, args, type) | |
5566 | tree t; | |
5567 | tree args; | |
5568 | tree type; | |
5569 | { | |
5570 | int saved_lineno; | |
5571 | const char *saved_filename; | |
5572 | tree r = NULL_TREE; | |
5573 | tree in_decl = t; | |
5574 | ||
5575 | /* Set the filename and linenumber to improve error-reporting. */ | |
5576 | saved_lineno = lineno; | |
5577 | saved_filename = input_filename; | |
5578 | lineno = DECL_SOURCE_LINE (t); | |
5579 | input_filename = DECL_SOURCE_FILE (t); | |
5580 | ||
5581 | switch (TREE_CODE (t)) | |
5582 | { | |
5583 | case TEMPLATE_DECL: | |
5584 | { | |
5585 | /* We can get here when processing a member template function | |
5586 | of a template class. */ | |
5587 | tree decl = DECL_TEMPLATE_RESULT (t); | |
5588 | tree spec; | |
5589 | int is_template_template_parm = DECL_TEMPLATE_TEMPLATE_PARM_P (t); | |
5590 | ||
5591 | if (!is_template_template_parm) | |
5592 | { | |
5593 | /* We might already have an instance of this template. | |
5594 | The ARGS are for the surrounding class type, so the | |
5595 | full args contain the tsubst'd args for the context, | |
5596 | plus the innermost args from the template decl. */ | |
5597 | tree tmpl_args = DECL_CLASS_TEMPLATE_P (t) | |
5598 | ? CLASSTYPE_TI_ARGS (TREE_TYPE (t)) | |
5599 | : DECL_TI_ARGS (DECL_TEMPLATE_RESULT (t)); | |
5600 | tree full_args; | |
5601 | ||
5602 | full_args = tsubst_template_arg_vector (tmpl_args, args, | |
5603 | /*complain=*/1); | |
5604 | ||
5605 | /* tsubst_template_arg_vector doesn't copy the vector if | |
5606 | nothing changed. But, *something* should have | |
5607 | changed. */ | |
5608 | my_friendly_assert (full_args != tmpl_args, 0); | |
5609 | ||
5610 | spec = retrieve_specialization (t, full_args); | |
5611 | if (spec != NULL_TREE) | |
5612 | { | |
5613 | r = spec; | |
5614 | break; | |
5615 | } | |
5616 | } | |
5617 | ||
5618 | /* Make a new template decl. It will be similar to the | |
5619 | original, but will record the current template arguments. | |
5620 | We also create a new function declaration, which is just | |
5621 | like the old one, but points to this new template, rather | |
5622 | than the old one. */ | |
5623 | r = copy_decl (t); | |
5624 | my_friendly_assert (DECL_LANG_SPECIFIC (r) != 0, 0); | |
5625 | TREE_CHAIN (r) = NULL_TREE; | |
5626 | ||
5627 | if (is_template_template_parm) | |
5628 | { | |
5629 | tree new_decl = tsubst (decl, args, /*complain=*/1, in_decl); | |
5630 | DECL_TEMPLATE_RESULT (r) = new_decl; | |
5631 | TREE_TYPE (r) = TREE_TYPE (new_decl); | |
5632 | break; | |
5633 | } | |
5634 | ||
5635 | DECL_CONTEXT (r) | |
5636 | = tsubst_aggr_type (DECL_CONTEXT (t), args, | |
5637 | /*complain=*/1, in_decl, | |
5638 | /*entering_scope=*/1); | |
5639 | DECL_VIRTUAL_CONTEXT (r) | |
5640 | = tsubst_aggr_type (DECL_VIRTUAL_CONTEXT (t), args, | |
5641 | /*complain=*/1, in_decl, | |
5642 | /*entering_scope=*/1); | |
5643 | DECL_TEMPLATE_INFO (r) = build_tree_list (t, args); | |
5644 | ||
5645 | if (TREE_CODE (decl) == TYPE_DECL) | |
5646 | { | |
5647 | tree new_type = tsubst (TREE_TYPE (t), args, | |
5648 | /*complain=*/1, in_decl); | |
5649 | TREE_TYPE (r) = new_type; | |
5650 | CLASSTYPE_TI_TEMPLATE (new_type) = r; | |
5651 | DECL_TEMPLATE_RESULT (r) = TYPE_MAIN_DECL (new_type); | |
5652 | DECL_TI_ARGS (r) = CLASSTYPE_TI_ARGS (new_type); | |
5653 | } | |
5654 | else | |
5655 | { | |
5656 | tree new_decl = tsubst (decl, args, /*complain=*/1, in_decl); | |
5657 | ||
5658 | DECL_TEMPLATE_RESULT (r) = new_decl; | |
5659 | DECL_TI_TEMPLATE (new_decl) = r; | |
5660 | TREE_TYPE (r) = TREE_TYPE (new_decl); | |
5661 | DECL_TI_ARGS (r) = DECL_TI_ARGS (new_decl); | |
5662 | } | |
5663 | ||
5664 | SET_DECL_IMPLICIT_INSTANTIATION (r); | |
5665 | DECL_TEMPLATE_INSTANTIATIONS (r) = NULL_TREE; | |
5666 | DECL_TEMPLATE_SPECIALIZATIONS (r) = NULL_TREE; | |
5667 | ||
5668 | /* The template parameters for this new template are all the | |
5669 | template parameters for the old template, except the | |
5670 | outermost level of parameters. */ | |
5671 | DECL_TEMPLATE_PARMS (r) | |
5672 | = tsubst_template_parms (DECL_TEMPLATE_PARMS (t), args, | |
5673 | /*complain=*/1); | |
5674 | ||
5675 | if (PRIMARY_TEMPLATE_P (t)) | |
5676 | DECL_PRIMARY_TEMPLATE (r) = r; | |
5677 | ||
5678 | /* We don't partially instantiate partial specializations. */ | |
5679 | if (TREE_CODE (decl) == TYPE_DECL) | |
5680 | break; | |
5681 | ||
5682 | /* Record this partial instantiation. */ | |
5683 | register_specialization (r, t, | |
5684 | DECL_TI_ARGS (DECL_TEMPLATE_RESULT (r))); | |
5685 | ||
5686 | } | |
5687 | break; | |
5688 | ||
5689 | case FUNCTION_DECL: | |
5690 | { | |
5691 | tree ctx; | |
5692 | tree argvec = NULL_TREE; | |
5693 | tree *friends; | |
5694 | tree gen_tmpl; | |
5695 | int member; | |
5696 | int args_depth; | |
5697 | int parms_depth; | |
5698 | ||
5699 | /* Nobody should be tsubst'ing into non-template functions. */ | |
5700 | my_friendly_assert (DECL_TEMPLATE_INFO (t) != NULL_TREE, 0); | |
5701 | ||
5702 | if (TREE_CODE (DECL_TI_TEMPLATE (t)) == TEMPLATE_DECL) | |
5703 | { | |
5704 | tree spec; | |
5705 | ||
5706 | /* Calculate the most general template of which R is a | |
5707 | specialization, and the complete set of arguments used to | |
5708 | specialize R. */ | |
5709 | gen_tmpl = most_general_template (DECL_TI_TEMPLATE (t)); | |
5710 | argvec | |
5711 | = tsubst_template_arg_vector (DECL_TI_ARGS | |
5712 | (DECL_TEMPLATE_RESULT (gen_tmpl)), | |
5713 | args, /*complain=*/1); | |
5714 | ||
5715 | /* Check to see if we already have this specialization. */ | |
5716 | spec = retrieve_specialization (gen_tmpl, argvec); | |
5717 | ||
5718 | if (spec) | |
5719 | { | |
5720 | r = spec; | |
5721 | break; | |
5722 | } | |
5723 | ||
5724 | /* We can see more levels of arguments than parameters if | |
5725 | there was a specialization of a member template, like | |
5726 | this: | |
5727 | ||
5728 | template <class T> struct S { template <class U> void f(); } | |
5729 | template <> template <class U> void S<int>::f(U); | |
5730 | ||
5731 | Here, we'll be substituting into the specialization, | |
5732 | because that's where we can find the code we actually | |
5733 | want to generate, but we'll have enough arguments for | |
5734 | the most general template. | |
5735 | ||
5736 | We also deal with the peculiar case: | |
5737 | ||
5738 | template <class T> struct S { | |
5739 | template <class U> friend void f(); | |
5740 | }; | |
5741 | template <class U> void f() {} | |
5742 | template S<int>; | |
5743 | template void f<double>(); | |
5744 | ||
5745 | Here, the ARGS for the instantiation of will be {int, | |
5746 | double}. But, we only need as many ARGS as there are | |
5747 | levels of template parameters in CODE_PATTERN. We are | |
5748 | careful not to get fooled into reducing the ARGS in | |
5749 | situations like: | |
5750 | ||
5751 | template <class T> struct S { template <class U> void f(U); } | |
5752 | template <class T> template <> void S<T>::f(int) {} | |
5753 | ||
5754 | which we can spot because the pattern will be a | |
5755 | specialization in this case. */ | |
5756 | args_depth = TMPL_ARGS_DEPTH (args); | |
5757 | parms_depth = | |
5758 | TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (DECL_TI_TEMPLATE (t))); | |
5759 | if (args_depth > parms_depth | |
5760 | && !DECL_TEMPLATE_SPECIALIZATION (t)) | |
5761 | args = get_innermost_template_args (args, parms_depth); | |
5762 | } | |
5763 | else | |
5764 | { | |
5765 | /* This special case arises when we have something like this: | |
5766 | ||
5767 | template <class T> struct S { | |
5768 | friend void f<int>(int, double); | |
5769 | }; | |
5770 | ||
5771 | Here, the DECL_TI_TEMPLATE for the friend declaration | |
5772 | will be a LOOKUP_EXPR or an IDENTIFIER_NODE. We are | |
5773 | being called from tsubst_friend_function, and we want | |
5774 | only to create a new decl (R) with appropriate types so | |
5775 | that we can call determine_specialization. */ | |
5776 | my_friendly_assert ((TREE_CODE (DECL_TI_TEMPLATE (t)) | |
5777 | == LOOKUP_EXPR) | |
5778 | || (TREE_CODE (DECL_TI_TEMPLATE (t)) | |
5779 | == IDENTIFIER_NODE), 0); | |
5780 | gen_tmpl = NULL_TREE; | |
5781 | } | |
5782 | ||
5783 | if (DECL_CLASS_SCOPE_P (t)) | |
5784 | { | |
5785 | if (DECL_NAME (t) == constructor_name (DECL_CONTEXT (t))) | |
5786 | member = 2; | |
5787 | else | |
5788 | member = 1; | |
5789 | ctx = tsubst_aggr_type (DECL_CONTEXT (t), args, | |
5790 | /*complain=*/1, t, | |
5791 | /*entering_scope=*/1); | |
5792 | } | |
5793 | else | |
5794 | { | |
5795 | member = 0; | |
5796 | ctx = DECL_CONTEXT (t); | |
5797 | } | |
5798 | type = tsubst (type, args, /*complain=*/1, in_decl); | |
5799 | if (type == error_mark_node) | |
5800 | return error_mark_node; | |
5801 | ||
5802 | /* We do NOT check for matching decls pushed separately at this | |
5803 | point, as they may not represent instantiations of this | |
5804 | template, and in any case are considered separate under the | |
5805 | discrete model. */ | |
5806 | r = copy_decl (t); | |
5807 | DECL_USE_TEMPLATE (r) = 0; | |
5808 | TREE_TYPE (r) = type; | |
5809 | ||
5810 | DECL_CONTEXT (r) = ctx; | |
5811 | DECL_VIRTUAL_CONTEXT (r) | |
5812 | = tsubst_aggr_type (DECL_VIRTUAL_CONTEXT (t), args, | |
5813 | /*complain=*/1, t, | |
5814 | /*entering_scope=*/1); | |
5815 | ||
5816 | if (member && DECL_CONV_FN_P (r)) | |
5817 | /* Type-conversion operator. Reconstruct the name, in | |
5818 | case it's the name of one of the template's parameters. */ | |
5819 | DECL_NAME (r) = mangle_conv_op_name_for_type (TREE_TYPE (type)); | |
5820 | ||
5821 | DECL_ARGUMENTS (r) = tsubst (DECL_ARGUMENTS (t), args, | |
5822 | /*complain=*/1, t); | |
5823 | DECL_RESULT (r) = NULL_TREE; | |
5824 | ||
5825 | TREE_STATIC (r) = 0; | |
5826 | TREE_PUBLIC (r) = TREE_PUBLIC (t); | |
5827 | DECL_EXTERNAL (r) = 1; | |
5828 | DECL_INTERFACE_KNOWN (r) = 0; | |
5829 | DECL_DEFER_OUTPUT (r) = 0; | |
5830 | TREE_CHAIN (r) = NULL_TREE; | |
5831 | DECL_PENDING_INLINE_INFO (r) = 0; | |
5832 | DECL_PENDING_INLINE_P (r) = 0; | |
5833 | DECL_SAVED_TREE (r) = NULL_TREE; | |
5834 | TREE_USED (r) = 0; | |
5835 | if (DECL_CLONED_FUNCTION (r)) | |
5836 | { | |
5837 | DECL_CLONED_FUNCTION (r) = tsubst (DECL_CLONED_FUNCTION (t), | |
5838 | args, /*complain=*/1, t); | |
5839 | TREE_CHAIN (r) = TREE_CHAIN (DECL_CLONED_FUNCTION (r)); | |
5840 | TREE_CHAIN (DECL_CLONED_FUNCTION (r)) = r; | |
5841 | } | |
5842 | ||
5843 | /* Set up the DECL_TEMPLATE_INFO for R and compute its mangled | |
5844 | name. There's no need to do this in the special friend | |
5845 | case mentioned above where GEN_TMPL is NULL. */ | |
5846 | if (gen_tmpl) | |
5847 | { | |
5848 | DECL_TEMPLATE_INFO (r) | |
5849 | = tree_cons (gen_tmpl, argvec, NULL_TREE); | |
5850 | SET_DECL_IMPLICIT_INSTANTIATION (r); | |
5851 | register_specialization (r, gen_tmpl, argvec); | |
5852 | ||
5853 | /* Set the mangled name for R. */ | |
5854 | if (DECL_DESTRUCTOR_P (t)) | |
5855 | set_mangled_name_for_decl (r); | |
5856 | else | |
5857 | { | |
5858 | /* Instantiations of template functions must be mangled | |
5859 | specially, in order to conform to 14.5.5.1 | |
5860 | [temp.over.link]. */ | |
5861 | tree tmpl = DECL_TI_TEMPLATE (t); | |
5862 | ||
5863 | /* TMPL will be NULL if this is a specialization of a | |
5864 | member function of a template class. */ | |
5865 | if (tmpl == NULL_TREE | |
5866 | || (member && !is_member_template (tmpl) | |
5867 | && !DECL_TEMPLATE_INFO (tmpl))) | |
5868 | set_mangled_name_for_decl (r); | |
5869 | else | |
5870 | set_mangled_name_for_template_decl (r); | |
5871 | } | |
5872 | ||
5873 | DECL_RTL (r) = 0; | |
5874 | make_decl_rtl (r, NULL_PTR); | |
5875 | ||
5876 | /* Like grokfndecl. If we don't do this, pushdecl will | |
5877 | mess up our TREE_CHAIN because it doesn't find a | |
5878 | previous decl. Sigh. */ | |
5879 | if (member | |
5880 | && ! uses_template_parms (r) | |
5881 | && (IDENTIFIER_GLOBAL_VALUE (DECL_ASSEMBLER_NAME (r)) | |
5882 | == NULL_TREE)) | |
5883 | SET_IDENTIFIER_GLOBAL_VALUE (DECL_ASSEMBLER_NAME (r), r); | |
5884 | ||
5885 | /* We're not supposed to instantiate default arguments | |
5886 | until they are called, for a template. But, for a | |
5887 | declaration like: | |
5888 | ||
5889 | template <class T> void f () | |
5890 | { extern void g(int i = T()); } | |
5891 | ||
5892 | we should do the substitution when the template is | |
5893 | instantiated. We handle the member function case in | |
5894 | instantiate_class_template since the default arguments | |
5895 | might refer to other members of the class. */ | |
5896 | if (!member | |
5897 | && !PRIMARY_TEMPLATE_P (gen_tmpl) | |
5898 | && !uses_template_parms (argvec)) | |
5899 | tsubst_default_arguments (r); | |
5900 | } | |
5901 | ||
5902 | /* Copy the list of befriending classes. */ | |
5903 | for (friends = &DECL_BEFRIENDING_CLASSES (r); | |
5904 | *friends; | |
5905 | friends = &TREE_CHAIN (*friends)) | |
5906 | { | |
5907 | *friends = copy_node (*friends); | |
5908 | TREE_VALUE (*friends) = tsubst (TREE_VALUE (*friends), | |
5909 | args, /*complain=*/1, | |
5910 | in_decl); | |
5911 | } | |
5912 | ||
5913 | if (DECL_CONSTRUCTOR_P (r) || DECL_DESTRUCTOR_P (r)) | |
5914 | { | |
5915 | maybe_retrofit_in_chrg (r); | |
5916 | if (DECL_CONSTRUCTOR_P (r)) | |
5917 | grok_ctor_properties (ctx, r); | |
5918 | /* If this is an instantiation of a member template, clone it. | |
5919 | If it isn't, that'll be handled by | |
5920 | clone_constructors_and_destructors. */ | |
5921 | if (PRIMARY_TEMPLATE_P (gen_tmpl)) | |
5922 | clone_function_decl(r, /*update_method_vec_p=*/0); | |
5923 | } | |
5924 | else if (IDENTIFIER_OPNAME_P (DECL_NAME (r))) | |
5925 | grok_op_properties (r, DECL_VIRTUAL_P (r), DECL_FRIEND_P (r)); | |
5926 | } | |
5927 | break; | |
5928 | ||
5929 | case PARM_DECL: | |
5930 | { | |
5931 | r = copy_node (t); | |
5932 | TREE_TYPE (r) = type; | |
5933 | c_apply_type_quals_to_decl (CP_TYPE_QUALS (type), r); | |
5934 | ||
5935 | if (TREE_CODE (DECL_INITIAL (r)) != TEMPLATE_PARM_INDEX) | |
5936 | DECL_INITIAL (r) = TREE_TYPE (r); | |
5937 | else | |
5938 | DECL_INITIAL (r) = tsubst (DECL_INITIAL (r), args, | |
5939 | /*complain=*/1, in_decl); | |
5940 | ||
5941 | DECL_CONTEXT (r) = NULL_TREE; | |
5942 | if (PROMOTE_PROTOTYPES | |
5943 | && (TREE_CODE (type) == INTEGER_TYPE | |
5944 | || TREE_CODE (type) == ENUMERAL_TYPE) | |
5945 | && TYPE_PRECISION (type) < TYPE_PRECISION (integer_type_node)) | |
5946 | DECL_ARG_TYPE (r) = integer_type_node; | |
5947 | if (TREE_CHAIN (t)) | |
5948 | TREE_CHAIN (r) = tsubst (TREE_CHAIN (t), args, | |
5949 | /*complain=*/1, TREE_CHAIN (t)); | |
5950 | } | |
5951 | break; | |
5952 | ||
5953 | case FIELD_DECL: | |
5954 | { | |
5955 | r = copy_decl (t); | |
5956 | TREE_TYPE (r) = type; | |
5957 | c_apply_type_quals_to_decl (CP_TYPE_QUALS (type), r); | |
5958 | ||
5959 | /* We don't have to set DECL_CONTEXT here; it is set by | |
5960 | finish_member_declaration. */ | |
5961 | DECL_INITIAL (r) = tsubst_expr (DECL_INITIAL (t), args, | |
5962 | /*complain=*/1, in_decl); | |
5963 | TREE_CHAIN (r) = NULL_TREE; | |
5964 | if (TREE_CODE (type) == VOID_TYPE) | |
5965 | cp_error_at ("instantiation of `%D' as type void", r); | |
5966 | } | |
5967 | break; | |
5968 | ||
5969 | case USING_DECL: | |
5970 | { | |
5971 | r = copy_node (t); | |
5972 | DECL_INITIAL (r) | |
5973 | = tsubst_copy (DECL_INITIAL (t), args, /*complain=*/1, in_decl); | |
5974 | TREE_CHAIN (r) = NULL_TREE; | |
5975 | } | |
5976 | break; | |
5977 | ||
5978 | case TYPE_DECL: | |
5979 | if (TREE_CODE (type) == TEMPLATE_TEMPLATE_PARM | |
5980 | || t == TYPE_MAIN_DECL (TREE_TYPE (t))) | |
5981 | { | |
5982 | /* If this is the canonical decl, we don't have to mess with | |
5983 | instantiations, and often we can't (for typename, template | |
5984 | type parms and such). Note that TYPE_NAME is not correct for | |
5985 | the above test if we've copied the type for a typedef. */ | |
5986 | r = TYPE_NAME (type); | |
5987 | break; | |
5988 | } | |
5989 | ||
5990 | /* Fall through. */ | |
5991 | ||
5992 | case VAR_DECL: | |
5993 | { | |
5994 | tree argvec = NULL_TREE; | |
5995 | tree gen_tmpl = NULL_TREE; | |
5996 | tree spec; | |
5997 | tree tmpl = NULL_TREE; | |
5998 | tree ctx; | |
5999 | int local_p; | |
6000 | ||
6001 | /* Assume this is a non-local variable. */ | |
6002 | local_p = 0; | |
6003 | ||
6004 | if (TYPE_P (CP_DECL_CONTEXT (t))) | |
6005 | ctx = tsubst_aggr_type (DECL_CONTEXT (t), args, | |
6006 | /*complain=*/1, | |
6007 | in_decl, /*entering_scope=*/1); | |
6008 | else | |
6009 | { | |
6010 | /* Subsequent calls to pushdecl will fill this in. */ | |
6011 | ctx = NULL_TREE; | |
6012 | if (!DECL_NAMESPACE_SCOPE_P (t)) | |
6013 | local_p = 1; | |
6014 | } | |
6015 | ||
6016 | /* Check to see if we already have this specialization. */ | |
6017 | if (!local_p) | |
6018 | { | |
6019 | tmpl = DECL_TI_TEMPLATE (t); | |
6020 | gen_tmpl = most_general_template (tmpl); | |
6021 | argvec = tsubst (DECL_TI_ARGS (t), args, /*complain=*/1, in_decl); | |
6022 | spec = retrieve_specialization (gen_tmpl, argvec); | |
6023 | } | |
6024 | else | |
6025 | spec = retrieve_local_specialization (t); | |
6026 | ||
6027 | if (spec) | |
6028 | { | |
6029 | r = spec; | |
6030 | break; | |
6031 | } | |
6032 | ||
6033 | r = copy_decl (t); | |
6034 | TREE_TYPE (r) = type; | |
6035 | c_apply_type_quals_to_decl (CP_TYPE_QUALS (type), r); | |
6036 | DECL_CONTEXT (r) = ctx; | |
6037 | ||
6038 | /* Don't try to expand the initializer until someone tries to use | |
6039 | this variable; otherwise we run into circular dependencies. */ | |
6040 | DECL_INITIAL (r) = NULL_TREE; | |
6041 | DECL_RTL (r) = 0; | |
6042 | DECL_SIZE (r) = DECL_SIZE_UNIT (r) = 0; | |
6043 | ||
6044 | /* For __PRETTY_FUNCTION__ we have to adjust the initializer. */ | |
6045 | if (DECL_PRETTY_FUNCTION_P (r)) | |
6046 | { | |
6047 | DECL_INITIAL (r) = tsubst (DECL_INITIAL (t), | |
6048 | args, | |
6049 | /*complain=*/1, | |
6050 | NULL_TREE); | |
6051 | TREE_TYPE (r) = TREE_TYPE (DECL_INITIAL (r)); | |
6052 | } | |
6053 | ||
6054 | /* Even if the original location is out of scope, the newly | |
6055 | substituted one is not. */ | |
6056 | if (TREE_CODE (r) == VAR_DECL) | |
6057 | DECL_DEAD_FOR_LOCAL (r) = 0; | |
6058 | ||
6059 | if (!local_p) | |
6060 | { | |
6061 | /* A static data member declaration is always marked | |
6062 | external when it is declared in-class, even if an | |
6063 | initializer is present. We mimic the non-template | |
6064 | processing here. */ | |
6065 | DECL_EXTERNAL (r) = 1; | |
6066 | ||
6067 | register_specialization (r, gen_tmpl, argvec); | |
6068 | DECL_TEMPLATE_INFO (r) = tree_cons (tmpl, argvec, NULL_TREE); | |
6069 | SET_DECL_IMPLICIT_INSTANTIATION (r); | |
6070 | } | |
6071 | else | |
6072 | register_local_specialization (r, t); | |
6073 | ||
6074 | TREE_CHAIN (r) = NULL_TREE; | |
6075 | if (TREE_CODE (r) == VAR_DECL && TREE_CODE (type) == VOID_TYPE) | |
6076 | cp_error_at ("instantiation of `%D' as type void", r); | |
6077 | } | |
6078 | break; | |
6079 | ||
6080 | default: | |
6081 | my_friendly_abort (0); | |
6082 | } | |
6083 | ||
6084 | /* Restore the file and line information. */ | |
6085 | lineno = saved_lineno; | |
6086 | input_filename = saved_filename; | |
6087 | ||
6088 | return r; | |
6089 | } | |
6090 | ||
6091 | /* Substitue into the ARG_TYPES of a function type. */ | |
6092 | ||
6093 | static tree | |
6094 | tsubst_arg_types (arg_types, args, complain, in_decl) | |
6095 | tree arg_types; | |
6096 | tree args; | |
6097 | int complain; | |
6098 | tree in_decl; | |
6099 | { | |
6100 | tree remaining_arg_types; | |
6101 | tree type; | |
6102 | ||
6103 | if (!arg_types || arg_types == void_list_node) | |
6104 | return arg_types; | |
6105 | ||
6106 | remaining_arg_types = tsubst_arg_types (TREE_CHAIN (arg_types), | |
6107 | args, complain, in_decl); | |
6108 | if (remaining_arg_types == error_mark_node) | |
6109 | return error_mark_node; | |
6110 | ||
6111 | type = tsubst (TREE_VALUE (arg_types), args, complain, in_decl); | |
6112 | if (type == error_mark_node) | |
6113 | return error_mark_node; | |
6114 | if (VOID_TYPE_P (type)) | |
6115 | { | |
6116 | if (complain) | |
6117 | { | |
6118 | cp_error ("invalid parameter type `%T'", type); | |
6119 | if (in_decl) | |
6120 | cp_error_at ("in declaration `%D'", in_decl); | |
6121 | } | |
6122 | return error_mark_node; | |
6123 | } | |
6124 | ||
6125 | /* Do array-to-pointer, function-to-pointer conversion, and ignore | |
6126 | top-level qualifiers as required. */ | |
6127 | type = TYPE_MAIN_VARIANT (type_decays_to (type)); | |
6128 | ||
6129 | /* Note that we do not substitute into default arguments here. The | |
6130 | standard mandates that they be instantiated only when needed, | |
6131 | which is done in build_over_call. */ | |
6132 | return hash_tree_cons (TREE_PURPOSE (arg_types), type, | |
6133 | remaining_arg_types); | |
6134 | ||
6135 | } | |
6136 | ||
6137 | /* Substitute into a FUNCTION_TYPE or METHOD_TYPE. This routine does | |
6138 | *not* handle the exception-specification for FNTYPE, because the | |
6139 | initial substitution of explicitly provided template parameters | |
6140 | during argument deduction forbids substitution into the | |
6141 | exception-specification: | |
6142 | ||
6143 | [temp.deduct] | |
6144 | ||
6145 | All references in the function type of the function template to the | |
6146 | corresponding template parameters are replaced by the specified tem- | |
6147 | plate argument values. If a substitution in a template parameter or | |
6148 | in the function type of the function template results in an invalid | |
6149 | type, type deduction fails. [Note: The equivalent substitution in | |
6150 | exception specifications is done only when the function is instanti- | |
6151 | ated, at which point a program is ill-formed if the substitution | |
6152 | results in an invalid type.] */ | |
6153 | ||
6154 | static tree | |
6155 | tsubst_function_type (t, args, complain, in_decl) | |
6156 | tree t; | |
6157 | tree args; | |
6158 | int complain; | |
6159 | tree in_decl; | |
6160 | { | |
6161 | tree return_type; | |
6162 | tree arg_types; | |
6163 | tree fntype; | |
6164 | ||
6165 | /* The TYPE_CONTEXT is not used for function/method types. */ | |
6166 | my_friendly_assert (TYPE_CONTEXT (t) == NULL_TREE, 0); | |
6167 | ||
6168 | /* Substitue the return type. */ | |
6169 | return_type = tsubst (TREE_TYPE (t), args, complain, in_decl); | |
6170 | if (return_type == error_mark_node) | |
6171 | return error_mark_node; | |
6172 | ||
6173 | /* Substitue the argument types. */ | |
6174 | arg_types = tsubst_arg_types (TYPE_ARG_TYPES (t), args, | |
6175 | complain, in_decl); | |
6176 | if (arg_types == error_mark_node) | |
6177 | return error_mark_node; | |
6178 | ||
6179 | /* Construct a new type node and return it. */ | |
6180 | if (TREE_CODE (t) == FUNCTION_TYPE) | |
6181 | fntype = build_function_type (return_type, arg_types); | |
6182 | else | |
6183 | { | |
6184 | tree r = TREE_TYPE (TREE_VALUE (arg_types)); | |
6185 | if (! IS_AGGR_TYPE (r)) | |
6186 | { | |
6187 | /* [temp.deduct] | |
6188 | ||
6189 | Type deduction may fail for any of the following | |
6190 | reasons: | |
6191 | ||
6192 | -- Attempting to create "pointer to member of T" when T | |
6193 | is not a class type. */ | |
6194 | if (complain) | |
6195 | cp_error ("creating pointer to member function of non-class type `%T'", | |
6196 | r); | |
6197 | return error_mark_node; | |
6198 | } | |
6199 | ||
6200 | fntype = build_cplus_method_type (r, return_type, TREE_CHAIN | |
6201 | (arg_types)); | |
6202 | } | |
6203 | fntype = build_qualified_type (fntype, TYPE_QUALS (t)); | |
6204 | fntype = build_type_attribute_variant (fntype, TYPE_ATTRIBUTES (t)); | |
6205 | ||
6206 | return fntype; | |
6207 | } | |
6208 | ||
6209 | /* Substitute into the PARMS of a call-declarator. */ | |
6210 | ||
6211 | static tree | |
6212 | tsubst_call_declarator_parms (parms, args, complain, in_decl) | |
6213 | tree parms; | |
6214 | tree args; | |
6215 | int complain; | |
6216 | tree in_decl; | |
6217 | { | |
6218 | tree new_parms; | |
6219 | tree type; | |
6220 | tree defarg; | |
6221 | ||
6222 | if (!parms || parms == void_list_node) | |
6223 | return parms; | |
6224 | ||
6225 | new_parms = tsubst_call_declarator_parms (TREE_CHAIN (parms), | |
6226 | args, complain, in_decl); | |
6227 | ||
6228 | /* Figure out the type of this parameter. */ | |
6229 | type = tsubst (TREE_VALUE (parms), args, complain, in_decl); | |
6230 | ||
6231 | /* Figure out the default argument as well. Note that we use | |
6232 | tsubst_expr since the default argument is really an expression. */ | |
6233 | defarg = tsubst_expr (TREE_PURPOSE (parms), args, complain, in_decl); | |
6234 | ||
6235 | /* Chain this parameter on to the front of those we have already | |
6236 | processed. We don't use hash_tree_cons because that function | |
6237 | doesn't check TREE_PARMLIST. */ | |
6238 | new_parms = tree_cons (defarg, type, new_parms); | |
6239 | ||
6240 | /* And note that these are parameters. */ | |
6241 | TREE_PARMLIST (new_parms) = 1; | |
6242 | ||
6243 | return new_parms; | |
6244 | } | |
6245 | ||
6246 | /* Take the tree structure T and replace template parameters used | |
6247 | therein with the argument vector ARGS. IN_DECL is an associated | |
6248 | decl for diagnostics. If an error occurs, returns ERROR_MARK_NODE. | |
6249 | An appropriate error message is issued only if COMPLAIN is | |
6250 | non-zero. Note that we must be relatively non-tolerant of | |
6251 | extensions here, in order to preserve conformance; if we allow | |
6252 | substitutions that should not be allowed, we may allow argument | |
6253 | deductions that should not succeed, and therefore report ambiguous | |
6254 | overload situations where there are none. In theory, we could | |
6255 | allow the substitution, but indicate that it should have failed, | |
6256 | and allow our caller to make sure that the right thing happens, but | |
6257 | we don't try to do this yet. | |
6258 | ||
6259 | This function is used for dealing with types, decls and the like; | |
6260 | for expressions, use tsubst_expr or tsubst_copy. */ | |
6261 | ||
6262 | tree | |
6263 | tsubst (t, args, complain, in_decl) | |
6264 | tree t, args; | |
6265 | int complain; | |
6266 | tree in_decl; | |
6267 | { | |
6268 | tree type, r; | |
6269 | ||
6270 | if (t == NULL_TREE || t == error_mark_node | |
6271 | || t == integer_type_node | |
6272 | || t == void_type_node | |
6273 | || t == char_type_node | |
6274 | || TREE_CODE (t) == NAMESPACE_DECL) | |
6275 | return t; | |
6276 | ||
6277 | if (TREE_CODE (t) == IDENTIFIER_NODE) | |
6278 | type = IDENTIFIER_TYPE_VALUE (t); | |
6279 | else | |
6280 | type = TREE_TYPE (t); | |
6281 | if (type == unknown_type_node) | |
6282 | my_friendly_abort (42); | |
6283 | ||
6284 | if (type && TREE_CODE (t) != FUNCTION_DECL | |
6285 | && TREE_CODE (t) != TYPENAME_TYPE | |
6286 | && TREE_CODE (t) != TEMPLATE_DECL | |
6287 | && TREE_CODE (t) != IDENTIFIER_NODE | |
6288 | && TREE_CODE (t) != FUNCTION_TYPE | |
6289 | && TREE_CODE (t) != METHOD_TYPE) | |
6290 | type = tsubst (type, args, complain, in_decl); | |
6291 | if (type == error_mark_node) | |
6292 | return error_mark_node; | |
6293 | ||
6294 | if (DECL_P (t)) | |
6295 | return tsubst_decl (t, args, type); | |
6296 | ||
6297 | switch (TREE_CODE (t)) | |
6298 | { | |
6299 | case RECORD_TYPE: | |
6300 | case UNION_TYPE: | |
6301 | case ENUMERAL_TYPE: | |
6302 | return tsubst_aggr_type (t, args, complain, in_decl, | |
6303 | /*entering_scope=*/0); | |
6304 | ||
6305 | case ERROR_MARK: | |
6306 | case IDENTIFIER_NODE: | |
6307 | case OP_IDENTIFIER: | |
6308 | case VOID_TYPE: | |
6309 | case REAL_TYPE: | |
6310 | case COMPLEX_TYPE: | |
6311 | case VECTOR_TYPE: | |
6312 | case BOOLEAN_TYPE: | |
6313 | case INTEGER_CST: | |
6314 | case REAL_CST: | |
6315 | case STRING_CST: | |
6316 | return t; | |
6317 | ||
6318 | case INTEGER_TYPE: | |
6319 | if (t == integer_type_node) | |
6320 | return t; | |
6321 | ||
6322 | if (TREE_CODE (TYPE_MIN_VALUE (t)) == INTEGER_CST | |
6323 | && TREE_CODE (TYPE_MAX_VALUE (t)) == INTEGER_CST) | |
6324 | return t; | |
6325 | ||
6326 | { | |
6327 | tree max, omax = TREE_OPERAND (TYPE_MAX_VALUE (t), 0); | |
6328 | ||
6329 | max = tsubst_expr (omax, args, complain, in_decl); | |
6330 | if (max == error_mark_node) | |
6331 | return error_mark_node; | |
6332 | ||
6333 | /* See if we can reduce this expression to something simpler. */ | |
6334 | max = maybe_fold_nontype_arg (max); | |
6335 | if (!processing_template_decl) | |
6336 | max = decl_constant_value (max); | |
6337 | ||
6338 | if (processing_template_decl | |
6339 | /* When providing explicit arguments to a template | |
6340 | function, but leaving some arguments for subsequent | |
6341 | deduction, MAX may be template-dependent even if we're | |
6342 | not PROCESSING_TEMPLATE_DECL. We still need to check for | |
6343 | template parms, though; MAX won't be an INTEGER_CST for | |
6344 | dynamic arrays, either. */ | |
6345 | || (TREE_CODE (max) != INTEGER_CST | |
6346 | && uses_template_parms (max))) | |
6347 | { | |
6348 | tree itype = make_node (INTEGER_TYPE); | |
6349 | TYPE_MIN_VALUE (itype) = size_zero_node; | |
6350 | TYPE_MAX_VALUE (itype) = build_min (MINUS_EXPR, sizetype, max, | |
6351 | integer_one_node); | |
6352 | return itype; | |
6353 | } | |
6354 | ||
6355 | if (integer_zerop (omax)) | |
6356 | { | |
6357 | /* Still allow an explicit array of size zero. */ | |
6358 | if (pedantic) | |
6359 | pedwarn ("creating array with size zero"); | |
6360 | } | |
6361 | else if (integer_zerop (max) | |
6362 | || (TREE_CODE (max) == INTEGER_CST | |
6363 | && INT_CST_LT (max, integer_zero_node))) | |
6364 | { | |
6365 | /* [temp.deduct] | |
6366 | ||
6367 | Type deduction may fail for any of the following | |
6368 | reasons: | |
6369 | ||
6370 | Attempting to create an array with a size that is | |
6371 | zero or negative. */ | |
6372 | if (complain) | |
6373 | cp_error ("creating array with size zero (`%E')", max); | |
6374 | ||
6375 | return error_mark_node; | |
6376 | } | |
6377 | ||
6378 | return compute_array_index_type (NULL_TREE, max); | |
6379 | } | |
6380 | ||
6381 | case TEMPLATE_TYPE_PARM: | |
6382 | case TEMPLATE_TEMPLATE_PARM: | |
6383 | case BOUND_TEMPLATE_TEMPLATE_PARM: | |
6384 | case TEMPLATE_PARM_INDEX: | |
6385 | { | |
6386 | int idx; | |
6387 | int level; | |
6388 | int levels; | |
6389 | ||
6390 | r = NULL_TREE; | |
6391 | ||
6392 | if (TREE_CODE (t) == TEMPLATE_TYPE_PARM | |
6393 | || TREE_CODE (t) == TEMPLATE_TEMPLATE_PARM | |
6394 | || TREE_CODE (t) == BOUND_TEMPLATE_TEMPLATE_PARM) | |
6395 | { | |
6396 | idx = TEMPLATE_TYPE_IDX (t); | |
6397 | level = TEMPLATE_TYPE_LEVEL (t); | |
6398 | } | |
6399 | else | |
6400 | { | |
6401 | idx = TEMPLATE_PARM_IDX (t); | |
6402 | level = TEMPLATE_PARM_LEVEL (t); | |
6403 | } | |
6404 | ||
6405 | if (TREE_VEC_LENGTH (args) > 0) | |
6406 | { | |
6407 | tree arg = NULL_TREE; | |
6408 | ||
6409 | levels = TMPL_ARGS_DEPTH (args); | |
6410 | if (level <= levels) | |
6411 | arg = TMPL_ARG (args, level, idx); | |
6412 | ||
6413 | if (arg == error_mark_node) | |
6414 | return error_mark_node; | |
6415 | else if (arg != NULL_TREE) | |
6416 | { | |
6417 | if (TREE_CODE (t) == TEMPLATE_TYPE_PARM) | |
6418 | { | |
6419 | my_friendly_assert (TYPE_P (arg), 0); | |
6420 | return cp_build_qualified_type_real | |
6421 | (arg, CP_TYPE_QUALS (arg) | CP_TYPE_QUALS (t), | |
6422 | complain); | |
6423 | } | |
6424 | else if (TREE_CODE (t) == BOUND_TEMPLATE_TEMPLATE_PARM) | |
6425 | { | |
6426 | /* We are processing a type constructed from | |
6427 | a template template parameter */ | |
6428 | tree argvec = tsubst (TYPE_TI_ARGS (t), | |
6429 | args, complain, in_decl); | |
6430 | if (argvec == error_mark_node) | |
6431 | return error_mark_node; | |
6432 | ||
6433 | /* We can get a TEMPLATE_TEMPLATE_PARM here when | |
6434 | we are resolving nested-types in the signature of | |
6435 | a member function templates. | |
6436 | Otherwise ARG is a TEMPLATE_DECL and is the real | |
6437 | template to be instantiated. */ | |
6438 | if (TREE_CODE (arg) == TEMPLATE_TEMPLATE_PARM) | |
6439 | arg = TYPE_NAME (arg); | |
6440 | ||
6441 | r = lookup_template_class (arg, | |
6442 | argvec, in_decl, | |
6443 | DECL_CONTEXT (arg), | |
6444 | /*entering_scope=*/0, | |
6445 | complain); | |
6446 | return cp_build_qualified_type_real (r, | |
6447 | TYPE_QUALS (t), | |
6448 | complain); | |
6449 | } | |
6450 | else | |
6451 | /* TEMPLATE_TEMPLATE_PARM or TEMPLATE_PARM_INDEX. */ | |
6452 | return arg; | |
6453 | } | |
6454 | } | |
6455 | else | |
6456 | my_friendly_abort (981018); | |
6457 | ||
6458 | if (level == 1) | |
6459 | /* This can happen during the attempted tsubst'ing in | |
6460 | unify. This means that we don't yet have any information | |
6461 | about the template parameter in question. */ | |
6462 | return t; | |
6463 | ||
6464 | /* If we get here, we must have been looking at a parm for a | |
6465 | more deeply nested template. Make a new version of this | |
6466 | template parameter, but with a lower level. */ | |
6467 | switch (TREE_CODE (t)) | |
6468 | { | |
6469 | case TEMPLATE_TYPE_PARM: | |
6470 | case TEMPLATE_TEMPLATE_PARM: | |
6471 | case BOUND_TEMPLATE_TEMPLATE_PARM: | |
6472 | if (CP_TYPE_QUALS (t)) | |
6473 | { | |
6474 | r = tsubst (TYPE_MAIN_VARIANT (t), args, complain, in_decl); | |
6475 | r = cp_build_qualified_type_real (r, CP_TYPE_QUALS (t), | |
6476 | complain); | |
6477 | } | |
6478 | else | |
6479 | { | |
6480 | r = copy_node (t); | |
6481 | TEMPLATE_TYPE_PARM_INDEX (r) | |
6482 | = reduce_template_parm_level (TEMPLATE_TYPE_PARM_INDEX (t), | |
6483 | r, levels); | |
6484 | TYPE_STUB_DECL (r) = TYPE_NAME (r) = TEMPLATE_TYPE_DECL (r); | |
6485 | TYPE_MAIN_VARIANT (r) = r; | |
6486 | TYPE_POINTER_TO (r) = NULL_TREE; | |
6487 | TYPE_REFERENCE_TO (r) = NULL_TREE; | |
6488 | ||
6489 | if (TREE_CODE (t) == BOUND_TEMPLATE_TEMPLATE_PARM) | |
6490 | { | |
6491 | tree argvec = tsubst (TYPE_TI_ARGS (t), args, | |
6492 | complain, in_decl); | |
6493 | if (argvec == error_mark_node) | |
6494 | return error_mark_node; | |
6495 | ||
6496 | TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (r) | |
6497 | = tree_cons (TYPE_TI_TEMPLATE (t), argvec, NULL_TREE); | |
6498 | } | |
6499 | } | |
6500 | break; | |
6501 | ||
6502 | case TEMPLATE_PARM_INDEX: | |
6503 | r = reduce_template_parm_level (t, type, levels); | |
6504 | break; | |
6505 | ||
6506 | default: | |
6507 | my_friendly_abort (0); | |
6508 | } | |
6509 | ||
6510 | return r; | |
6511 | } | |
6512 | ||
6513 | case TREE_LIST: | |
6514 | { | |
6515 | tree purpose, value, chain, result; | |
6516 | ||
6517 | if (t == void_list_node) | |
6518 | return t; | |
6519 | ||
6520 | purpose = TREE_PURPOSE (t); | |
6521 | if (purpose) | |
6522 | { | |
6523 | purpose = tsubst (purpose, args, complain, in_decl); | |
6524 | if (purpose == error_mark_node) | |
6525 | return error_mark_node; | |
6526 | } | |
6527 | value = TREE_VALUE (t); | |
6528 | if (value) | |
6529 | { | |
6530 | value = tsubst (value, args, complain, in_decl); | |
6531 | if (value == error_mark_node) | |
6532 | return error_mark_node; | |
6533 | } | |
6534 | chain = TREE_CHAIN (t); | |
6535 | if (chain && chain != void_type_node) | |
6536 | { | |
6537 | chain = tsubst (chain, args, complain, in_decl); | |
6538 | if (chain == error_mark_node) | |
6539 | return error_mark_node; | |
6540 | } | |
6541 | if (purpose == TREE_PURPOSE (t) | |
6542 | && value == TREE_VALUE (t) | |
6543 | && chain == TREE_CHAIN (t)) | |
6544 | return t; | |
6545 | if (TREE_PARMLIST (t)) | |
6546 | { | |
6547 | result = tree_cons (purpose, value, chain); | |
6548 | TREE_PARMLIST (result) = 1; | |
6549 | } | |
6550 | else | |
6551 | result = hash_tree_cons (purpose, value, chain); | |
6552 | return result; | |
6553 | } | |
6554 | case TREE_VEC: | |
6555 | if (type != NULL_TREE) | |
6556 | { | |
6557 | /* A binfo node. We always need to make a copy, of the node | |
6558 | itself and of its BINFO_BASETYPES. */ | |
6559 | ||
6560 | t = copy_node (t); | |
6561 | ||
6562 | /* Make sure type isn't a typedef copy. */ | |
6563 | type = BINFO_TYPE (TYPE_BINFO (type)); | |
6564 | ||
6565 | TREE_TYPE (t) = complete_type (type); | |
6566 | if (IS_AGGR_TYPE (type)) | |
6567 | { | |
6568 | BINFO_VTABLE (t) = TYPE_BINFO_VTABLE (type); | |
6569 | BINFO_VIRTUALS (t) = TYPE_BINFO_VIRTUALS (type); | |
6570 | if (TYPE_BINFO_BASETYPES (type) != NULL_TREE) | |
6571 | BINFO_BASETYPES (t) = copy_node (TYPE_BINFO_BASETYPES (type)); | |
6572 | } | |
6573 | return t; | |
6574 | } | |
6575 | ||
6576 | /* Otherwise, a vector of template arguments. */ | |
6577 | return tsubst_template_arg_vector (t, args, complain); | |
6578 | ||
6579 | case POINTER_TYPE: | |
6580 | case REFERENCE_TYPE: | |
6581 | { | |
6582 | enum tree_code code; | |
6583 | ||
6584 | if (type == TREE_TYPE (t)) | |
6585 | return t; | |
6586 | ||
6587 | code = TREE_CODE (t); | |
6588 | ||
6589 | ||
6590 | /* [temp.deduct] | |
6591 | ||
6592 | Type deduction may fail for any of the following | |
6593 | reasons: | |
6594 | ||
6595 | -- Attempting to create a pointer to reference type. | |
6596 | -- Attempting to create a reference to a reference type or | |
6597 | a reference to void. */ | |
6598 | if (TREE_CODE (type) == REFERENCE_TYPE | |
6599 | || (code == REFERENCE_TYPE && TREE_CODE (type) == VOID_TYPE)) | |
6600 | { | |
6601 | static int last_line = 0; | |
6602 | static const char* last_file = 0; | |
6603 | ||
6604 | /* We keep track of the last time we issued this error | |
6605 | message to avoid spewing a ton of messages during a | |
6606 | single bad template instantiation. */ | |
6607 | if (complain && (last_line != lineno || | |
6608 | last_file != input_filename)) | |
6609 | { | |
6610 | if (TREE_CODE (type) == VOID_TYPE) | |
6611 | cp_error ("forming reference to void"); | |
6612 | else | |
6613 | cp_error ("forming %s to reference type `%T'", | |
6614 | (code == POINTER_TYPE) ? "pointer" : "reference", | |
6615 | type); | |
6616 | last_line = lineno; | |
6617 | last_file = input_filename; | |
6618 | } | |
6619 | ||
6620 | return error_mark_node; | |
6621 | } | |
6622 | else if (code == POINTER_TYPE) | |
6623 | r = build_pointer_type (type); | |
6624 | else | |
6625 | r = build_reference_type (type); | |
6626 | r = cp_build_qualified_type_real (r, TYPE_QUALS (t), complain); | |
6627 | ||
6628 | if (r != error_mark_node) | |
6629 | /* Will this ever be needed for TYPE_..._TO values? */ | |
6630 | layout_type (r); | |
6631 | ||
6632 | return r; | |
6633 | } | |
6634 | case OFFSET_TYPE: | |
6635 | { | |
6636 | r = tsubst (TYPE_OFFSET_BASETYPE (t), args, complain, in_decl); | |
6637 | if (r == error_mark_node || !IS_AGGR_TYPE (r)) | |
6638 | { | |
6639 | /* [temp.deduct] | |
6640 | ||
6641 | Type deduction may fail for any of the following | |
6642 | reasons: | |
6643 | ||
6644 | -- Attempting to create "pointer to member of T" when T | |
6645 | is not a class type. */ | |
6646 | if (complain) | |
6647 | cp_error ("creating pointer to member of non-class type `%T'", | |
6648 | r); | |
6649 | return error_mark_node; | |
6650 | } | |
6651 | return build_offset_type (r, type); | |
6652 | } | |
6653 | case FUNCTION_TYPE: | |
6654 | case METHOD_TYPE: | |
6655 | { | |
6656 | tree fntype; | |
6657 | tree raises; | |
6658 | ||
6659 | fntype = tsubst_function_type (t, args, complain, in_decl); | |
6660 | if (fntype == error_mark_node) | |
6661 | return error_mark_node; | |
6662 | ||
6663 | /* Substitue the exception specification. */ | |
6664 | raises = TYPE_RAISES_EXCEPTIONS (t); | |
6665 | if (raises) | |
6666 | { | |
6667 | tree list = NULL_TREE; | |
6668 | ||
6669 | if (! TREE_VALUE (raises)) | |
6670 | list = raises; | |
6671 | else | |
6672 | for (; raises != NULL_TREE; raises = TREE_CHAIN (raises)) | |
6673 | { | |
6674 | tree spec = TREE_VALUE (raises); | |
6675 | ||
6676 | spec = tsubst (spec, args, complain, in_decl); | |
6677 | if (spec == error_mark_node) | |
6678 | return spec; | |
6679 | list = add_exception_specifier (list, spec, complain); | |
6680 | } | |
6681 | fntype = build_exception_variant (fntype, list); | |
6682 | } | |
6683 | return fntype; | |
6684 | } | |
6685 | case ARRAY_TYPE: | |
6686 | { | |
6687 | tree domain = tsubst (TYPE_DOMAIN (t), args, complain, in_decl); | |
6688 | if (domain == error_mark_node) | |
6689 | return error_mark_node; | |
6690 | ||
6691 | /* As an optimization, we avoid regenerating the array type if | |
6692 | it will obviously be the same as T. */ | |
6693 | if (type == TREE_TYPE (t) && domain == TYPE_DOMAIN (t)) | |
6694 | return t; | |
6695 | ||
6696 | /* These checks should match the ones in grokdeclarator. | |
6697 | ||
6698 | [temp.deduct] | |
6699 | ||
6700 | The deduction may fail for any of the following reasons: | |
6701 | ||
6702 | -- Attempting to create an array with an element type that | |
6703 | is void, a function type, or a reference type. */ | |
6704 | if (TREE_CODE (type) == VOID_TYPE | |
6705 | || TREE_CODE (type) == FUNCTION_TYPE | |
6706 | || TREE_CODE (type) == REFERENCE_TYPE) | |
6707 | { | |
6708 | if (complain) | |
6709 | cp_error ("creating array of `%T'", type); | |
6710 | return error_mark_node; | |
6711 | } | |
6712 | ||
6713 | r = build_cplus_array_type (type, domain); | |
6714 | return r; | |
6715 | } | |
6716 | ||
6717 | case PLUS_EXPR: | |
6718 | case MINUS_EXPR: | |
6719 | { | |
6720 | tree e1 = tsubst (TREE_OPERAND (t, 0), args, complain, | |
6721 | in_decl); | |
6722 | tree e2 = tsubst (TREE_OPERAND (t, 1), args, complain, | |
6723 | in_decl); | |
6724 | ||
6725 | if (e1 == error_mark_node || e2 == error_mark_node) | |
6726 | return error_mark_node; | |
6727 | ||
6728 | return fold (build (TREE_CODE (t), TREE_TYPE (t), e1, e2)); | |
6729 | } | |
6730 | ||
6731 | case NEGATE_EXPR: | |
6732 | case NOP_EXPR: | |
6733 | { | |
6734 | tree e = tsubst (TREE_OPERAND (t, 0), args, complain, | |
6735 | in_decl); | |
6736 | if (e == error_mark_node) | |
6737 | return error_mark_node; | |
6738 | ||
6739 | return fold (build (TREE_CODE (t), TREE_TYPE (t), e)); | |
6740 | } | |
6741 | ||
6742 | case TYPENAME_TYPE: | |
6743 | { | |
6744 | tree ctx = tsubst_aggr_type (TYPE_CONTEXT (t), args, complain, | |
6745 | in_decl, /*entering_scope=*/1); | |
6746 | tree f = tsubst_copy (TYPENAME_TYPE_FULLNAME (t), args, | |
6747 | complain, in_decl); | |
6748 | ||
6749 | if (ctx == error_mark_node || f == error_mark_node) | |
6750 | return error_mark_node; | |
6751 | ||
6752 | if (!IS_AGGR_TYPE (ctx)) | |
6753 | { | |
6754 | if (complain) | |
6755 | cp_error ("`%T' is not a class, struct, or union type", | |
6756 | ctx); | |
6757 | return error_mark_node; | |
6758 | } | |
6759 | else if (!uses_template_parms (ctx) && !TYPE_BEING_DEFINED (ctx)) | |
6760 | { | |
6761 | /* Normally, make_typename_type does not require that the CTX | |
6762 | have complete type in order to allow things like: | |
6763 | ||
6764 | template <class T> struct S { typename S<T>::X Y; }; | |
6765 | ||
6766 | But, such constructs have already been resolved by this | |
6767 | point, so here CTX really should have complete type, unless | |
6768 | it's a partial instantiation. */ | |
6769 | ctx = complete_type (ctx); | |
6770 | if (!COMPLETE_TYPE_P (ctx)) | |
6771 | { | |
6772 | if (complain) | |
6773 | incomplete_type_error (NULL_TREE, ctx); | |
6774 | return error_mark_node; | |
6775 | } | |
6776 | } | |
6777 | ||
6778 | f = make_typename_type (ctx, f, complain); | |
6779 | if (f == error_mark_node) | |
6780 | return f; | |
6781 | return cp_build_qualified_type_real (f, | |
6782 | CP_TYPE_QUALS (f) | |
6783 | | CP_TYPE_QUALS (t), | |
6784 | complain); | |
6785 | } | |
6786 | ||
6787 | case INDIRECT_REF: | |
6788 | { | |
6789 | tree e = tsubst (TREE_OPERAND (t, 0), args, complain, | |
6790 | in_decl); | |
6791 | if (e == error_mark_node) | |
6792 | return error_mark_node; | |
6793 | return make_pointer_declarator (type, e); | |
6794 | } | |
6795 | ||
6796 | case ADDR_EXPR: | |
6797 | { | |
6798 | tree e = tsubst (TREE_OPERAND (t, 0), args, complain, | |
6799 | in_decl); | |
6800 | if (e == error_mark_node) | |
6801 | return error_mark_node; | |
6802 | return make_reference_declarator (type, e); | |
6803 | } | |
6804 | ||
6805 | case ARRAY_REF: | |
6806 | { | |
6807 | tree e1 = tsubst (TREE_OPERAND (t, 0), args, complain, | |
6808 | in_decl); | |
6809 | tree e2 = tsubst_expr (TREE_OPERAND (t, 1), args, complain, | |
6810 | in_decl); | |
6811 | if (e1 == error_mark_node || e2 == error_mark_node) | |
6812 | return error_mark_node; | |
6813 | ||
6814 | return build_nt (ARRAY_REF, e1, e2, tsubst_expr); | |
6815 | } | |
6816 | ||
6817 | case CALL_EXPR: | |
6818 | { | |
6819 | tree e1 = tsubst (TREE_OPERAND (t, 0), args, complain, | |
6820 | in_decl); | |
6821 | tree e2 = (tsubst_call_declarator_parms | |
6822 | (CALL_DECLARATOR_PARMS (t), args, complain, in_decl)); | |
6823 | tree e3 = tsubst (CALL_DECLARATOR_EXCEPTION_SPEC (t), args, | |
6824 | complain, in_decl); | |
6825 | ||
6826 | if (e1 == error_mark_node || e2 == error_mark_node | |
6827 | || e3 == error_mark_node) | |
6828 | return error_mark_node; | |
6829 | ||
6830 | return make_call_declarator (e1, e2, CALL_DECLARATOR_QUALS (t), e3); | |
6831 | } | |
6832 | ||
6833 | case SCOPE_REF: | |
6834 | { | |
6835 | tree e1 = tsubst (TREE_OPERAND (t, 0), args, complain, | |
6836 | in_decl); | |
6837 | tree e2 = tsubst (TREE_OPERAND (t, 1), args, complain, in_decl); | |
6838 | if (e1 == error_mark_node || e2 == error_mark_node) | |
6839 | return error_mark_node; | |
6840 | ||
6841 | return build_nt (TREE_CODE (t), e1, e2); | |
6842 | } | |
6843 | ||
6844 | case TYPEOF_TYPE: | |
6845 | { | |
6846 | tree e1 = tsubst_expr (TYPE_FIELDS (t), args, complain, | |
6847 | in_decl); | |
6848 | if (e1 == error_mark_node) | |
6849 | return error_mark_node; | |
6850 | ||
6851 | return TREE_TYPE (e1); | |
6852 | } | |
6853 | ||
6854 | case FUNCTION_NAME: | |
6855 | { | |
6856 | const char *name; | |
6857 | int len; | |
6858 | tree type; | |
6859 | tree str; | |
6860 | ||
6861 | /* This code should match declare_hidden_char_array in | |
6862 | c-common.c. */ | |
6863 | name = (*decl_printable_name) (current_function_decl, 2); | |
6864 | len = strlen (name) + 1; | |
6865 | type = build_array_type (char_type_node, | |
6866 | build_index_type (size_int (len))); | |
6867 | str = build_string (len, name); | |
6868 | TREE_TYPE (str) = type; | |
6869 | return str; | |
6870 | } | |
6871 | ||
6872 | default: | |
6873 | sorry ("use of `%s' in template", | |
6874 | tree_code_name [(int) TREE_CODE (t)]); | |
6875 | return error_mark_node; | |
6876 | } | |
6877 | } | |
6878 | ||
6879 | /* Like tsubst, but deals with expressions. This function just replaces | |
6880 | template parms; to finish processing the resultant expression, use | |
6881 | tsubst_expr. */ | |
6882 | ||
6883 | tree | |
6884 | tsubst_copy (t, args, complain, in_decl) | |
6885 | tree t, args; | |
6886 | int complain; | |
6887 | tree in_decl; | |
6888 | { | |
6889 | enum tree_code code; | |
6890 | tree r; | |
6891 | ||
6892 | if (t == NULL_TREE || t == error_mark_node) | |
6893 | return t; | |
6894 | ||
6895 | code = TREE_CODE (t); | |
6896 | ||
6897 | switch (code) | |
6898 | { | |
6899 | case PARM_DECL: | |
6900 | return do_identifier (DECL_NAME (t), 0, NULL_TREE); | |
6901 | ||
6902 | case CONST_DECL: | |
6903 | { | |
6904 | tree enum_type; | |
6905 | tree v; | |
6906 | ||
6907 | if (!DECL_CONTEXT (t)) | |
6908 | /* This is a global enumeration constant. */ | |
6909 | return t; | |
6910 | ||
6911 | /* Unfortunately, we cannot just call lookup_name here. | |
6912 | Consider: | |
6913 | ||
6914 | template <int I> int f() { | |
6915 | enum E { a = I }; | |
6916 | struct S { void g() { E e = a; } }; | |
6917 | }; | |
6918 | ||
6919 | When we instantiate f<7>::S::g(), say, lookup_name is not | |
6920 | clever enough to find f<7>::a. */ | |
6921 | enum_type | |
6922 | = tsubst_aggr_type (TREE_TYPE (t), args, complain, in_decl, | |
6923 | /*entering_scope=*/0); | |
6924 | ||
6925 | for (v = TYPE_VALUES (enum_type); | |
6926 | v != NULL_TREE; | |
6927 | v = TREE_CHAIN (v)) | |
6928 | if (TREE_PURPOSE (v) == DECL_NAME (t)) | |
6929 | return TREE_VALUE (v); | |
6930 | ||
6931 | /* We didn't find the name. That should never happen; if | |
6932 | name-lookup found it during preliminary parsing, we | |
6933 | should find it again here during instantiation. */ | |
6934 | my_friendly_abort (0); | |
6935 | } | |
6936 | return t; | |
6937 | ||
6938 | case FIELD_DECL: | |
6939 | if (DECL_CONTEXT (t)) | |
6940 | { | |
6941 | tree ctx; | |
6942 | ||
6943 | ctx = tsubst_aggr_type (DECL_CONTEXT (t), args, complain, in_decl, | |
6944 | /*entering_scope=*/1); | |
6945 | if (ctx != DECL_CONTEXT (t)) | |
6946 | return lookup_field (ctx, DECL_NAME (t), 0, 0); | |
6947 | } | |
6948 | return t; | |
6949 | ||
6950 | case VAR_DECL: | |
6951 | case FUNCTION_DECL: | |
6952 | if (DECL_LANG_SPECIFIC (t) && DECL_TEMPLATE_INFO (t)) | |
6953 | t = tsubst (t, args, complain, in_decl); | |
6954 | mark_used (t); | |
6955 | return t; | |
6956 | ||
6957 | case TEMPLATE_DECL: | |
6958 | if (is_member_template (t)) | |
6959 | return tsubst (t, args, complain, in_decl); | |
6960 | else | |
6961 | return t; | |
6962 | ||
6963 | case LOOKUP_EXPR: | |
6964 | { | |
6965 | /* We must tsbust into a LOOKUP_EXPR in case the names to | |
6966 | which it refers is a conversion operator; in that case the | |
6967 | name will change. We avoid making unnecessary copies, | |
6968 | however. */ | |
6969 | ||
6970 | tree id = tsubst_copy (TREE_OPERAND (t, 0), args, complain, in_decl); | |
6971 | ||
6972 | if (id != TREE_OPERAND (t, 0)) | |
6973 | { | |
6974 | r = build_nt (LOOKUP_EXPR, id); | |
6975 | LOOKUP_EXPR_GLOBAL (r) = LOOKUP_EXPR_GLOBAL (t); | |
6976 | t = r; | |
6977 | } | |
6978 | ||
6979 | return t; | |
6980 | } | |
6981 | ||
6982 | case CAST_EXPR: | |
6983 | case REINTERPRET_CAST_EXPR: | |
6984 | case CONST_CAST_EXPR: | |
6985 | case STATIC_CAST_EXPR: | |
6986 | case DYNAMIC_CAST_EXPR: | |
6987 | case NOP_EXPR: | |
6988 | return build1 | |
6989 | (code, tsubst (TREE_TYPE (t), args, complain, in_decl), | |
6990 | tsubst_copy (TREE_OPERAND (t, 0), args, complain, in_decl)); | |
6991 | ||
6992 | case INDIRECT_REF: | |
6993 | case NEGATE_EXPR: | |
6994 | case TRUTH_NOT_EXPR: | |
6995 | case BIT_NOT_EXPR: | |
6996 | case ADDR_EXPR: | |
6997 | case CONVERT_EXPR: /* Unary + */ | |
6998 | case SIZEOF_EXPR: | |
6999 | case ALIGNOF_EXPR: | |
7000 | case ARROW_EXPR: | |
7001 | case THROW_EXPR: | |
7002 | case TYPEID_EXPR: | |
7003 | case REALPART_EXPR: | |
7004 | case IMAGPART_EXPR: | |
7005 | return build1 | |
7006 | (code, tsubst (TREE_TYPE (t), args, complain, in_decl), | |
7007 | tsubst_copy (TREE_OPERAND (t, 0), args, complain, in_decl)); | |
7008 | ||
7009 | case PLUS_EXPR: | |
7010 | case MINUS_EXPR: | |
7011 | case MULT_EXPR: | |
7012 | case TRUNC_DIV_EXPR: | |
7013 | case CEIL_DIV_EXPR: | |
7014 | case FLOOR_DIV_EXPR: | |
7015 | case ROUND_DIV_EXPR: | |
7016 | case EXACT_DIV_EXPR: | |
7017 | case BIT_AND_EXPR: | |
7018 | case BIT_ANDTC_EXPR: | |
7019 | case BIT_IOR_EXPR: | |
7020 | case BIT_XOR_EXPR: | |
7021 | case TRUNC_MOD_EXPR: | |
7022 | case FLOOR_MOD_EXPR: | |
7023 | case TRUTH_ANDIF_EXPR: | |
7024 | case TRUTH_ORIF_EXPR: | |
7025 | case TRUTH_AND_EXPR: | |
7026 | case TRUTH_OR_EXPR: | |
7027 | case RSHIFT_EXPR: | |
7028 | case LSHIFT_EXPR: | |
7029 | case RROTATE_EXPR: | |
7030 | case LROTATE_EXPR: | |
7031 | case EQ_EXPR: | |
7032 | case NE_EXPR: | |
7033 | case MAX_EXPR: | |
7034 | case MIN_EXPR: | |
7035 | case LE_EXPR: | |
7036 | case GE_EXPR: | |
7037 | case LT_EXPR: | |
7038 | case GT_EXPR: | |
7039 | case COMPONENT_REF: | |
7040 | case ARRAY_REF: | |
7041 | case COMPOUND_EXPR: | |
7042 | case SCOPE_REF: | |
7043 | case DOTSTAR_EXPR: | |
7044 | case MEMBER_REF: | |
7045 | case PREDECREMENT_EXPR: | |
7046 | case PREINCREMENT_EXPR: | |
7047 | case POSTDECREMENT_EXPR: | |
7048 | case POSTINCREMENT_EXPR: | |
7049 | return build_nt | |
7050 | (code, tsubst_copy (TREE_OPERAND (t, 0), args, complain, in_decl), | |
7051 | tsubst_copy (TREE_OPERAND (t, 1), args, complain, in_decl)); | |
7052 | ||
7053 | case CALL_EXPR: | |
7054 | { | |
7055 | tree fn = TREE_OPERAND (t, 0); | |
7056 | if (is_overloaded_fn (fn)) | |
7057 | fn = tsubst_copy (get_first_fn (fn), args, complain, in_decl); | |
7058 | else | |
7059 | /* Sometimes FN is a LOOKUP_EXPR. */ | |
7060 | fn = tsubst_copy (fn, args, complain, in_decl); | |
7061 | return build_nt | |
7062 | (code, fn, tsubst_copy (TREE_OPERAND (t, 1), args, complain, | |
7063 | in_decl), | |
7064 | NULL_TREE); | |
7065 | } | |
7066 | ||
7067 | case METHOD_CALL_EXPR: | |
7068 | { | |
7069 | tree name = TREE_OPERAND (t, 0); | |
7070 | if (TREE_CODE (name) == BIT_NOT_EXPR) | |
7071 | { | |
7072 | name = tsubst_copy (TREE_OPERAND (name, 0), args, | |
7073 | complain, in_decl); | |
7074 | name = build1 (BIT_NOT_EXPR, NULL_TREE, name); | |
7075 | } | |
7076 | else if (TREE_CODE (name) == SCOPE_REF | |
7077 | && TREE_CODE (TREE_OPERAND (name, 1)) == BIT_NOT_EXPR) | |
7078 | { | |
7079 | tree base = tsubst_copy (TREE_OPERAND (name, 0), args, | |
7080 | complain, in_decl); | |
7081 | name = TREE_OPERAND (name, 1); | |
7082 | name = tsubst_copy (TREE_OPERAND (name, 0), args, | |
7083 | complain, in_decl); | |
7084 | name = build1 (BIT_NOT_EXPR, NULL_TREE, name); | |
7085 | name = build_nt (SCOPE_REF, base, name); | |
7086 | } | |
7087 | else | |
7088 | name = tsubst_copy (TREE_OPERAND (t, 0), args, complain, in_decl); | |
7089 | return build_nt | |
7090 | (code, name, tsubst_copy (TREE_OPERAND (t, 1), args, | |
7091 | complain, in_decl), | |
7092 | tsubst_copy (TREE_OPERAND (t, 2), args, complain, in_decl), | |
7093 | NULL_TREE); | |
7094 | } | |
7095 | ||
7096 | case STMT_EXPR: | |
7097 | /* This processing should really occur in tsubst_expr, However, | |
7098 | tsubst_expr does not recurse into expressions, since it | |
7099 | assumes that there aren't any statements inside them. | |
7100 | Instead, it simply calls build_expr_from_tree. So, we need | |
7101 | to expand the STMT_EXPR here. */ | |
7102 | if (!processing_template_decl) | |
7103 | { | |
7104 | tree stmt_expr = begin_stmt_expr (); | |
7105 | tsubst_expr (STMT_EXPR_STMT (t), args, | |
7106 | complain, in_decl); | |
7107 | return finish_stmt_expr (stmt_expr); | |
7108 | } | |
7109 | ||
7110 | return t; | |
7111 | ||
7112 | case COND_EXPR: | |
7113 | case MODOP_EXPR: | |
7114 | case PSEUDO_DTOR_EXPR: | |
7115 | { | |
7116 | r = build_nt | |
7117 | (code, tsubst_copy (TREE_OPERAND (t, 0), args, complain, in_decl), | |
7118 | tsubst_copy (TREE_OPERAND (t, 1), args, complain, in_decl), | |
7119 | tsubst_copy (TREE_OPERAND (t, 2), args, complain, in_decl)); | |
7120 | return r; | |
7121 | } | |
7122 | ||
7123 | case NEW_EXPR: | |
7124 | { | |
7125 | r = build_nt | |
7126 | (code, tsubst_copy (TREE_OPERAND (t, 0), args, complain, in_decl), | |
7127 | tsubst_copy (TREE_OPERAND (t, 1), args, complain, in_decl), | |
7128 | tsubst_copy (TREE_OPERAND (t, 2), args, complain, in_decl)); | |
7129 | NEW_EXPR_USE_GLOBAL (r) = NEW_EXPR_USE_GLOBAL (t); | |
7130 | return r; | |
7131 | } | |
7132 | ||
7133 | case DELETE_EXPR: | |
7134 | { | |
7135 | r = build_nt | |
7136 | (code, tsubst_copy (TREE_OPERAND (t, 0), args, complain, in_decl), | |
7137 | tsubst_copy (TREE_OPERAND (t, 1), args, complain, in_decl)); | |
7138 | DELETE_EXPR_USE_GLOBAL (r) = DELETE_EXPR_USE_GLOBAL (t); | |
7139 | DELETE_EXPR_USE_VEC (r) = DELETE_EXPR_USE_VEC (t); | |
7140 | return r; | |
7141 | } | |
7142 | ||
7143 | case TEMPLATE_ID_EXPR: | |
7144 | { | |
7145 | /* Substituted template arguments */ | |
7146 | tree targs = tsubst_copy (TREE_OPERAND (t, 1), args, complain, | |
7147 | in_decl); | |
7148 | ||
7149 | if (targs && TREE_CODE (targs) == TREE_LIST) | |
7150 | { | |
7151 | tree chain; | |
7152 | for (chain = targs; chain; chain = TREE_CHAIN (chain)) | |
7153 | TREE_VALUE (chain) = maybe_fold_nontype_arg (TREE_VALUE (chain)); | |
7154 | } | |
7155 | else if (targs) | |
7156 | { | |
7157 | int i; | |
7158 | for (i = 0; i < TREE_VEC_LENGTH (targs); ++i) | |
7159 | TREE_VEC_ELT (targs, i) | |
7160 | = maybe_fold_nontype_arg (TREE_VEC_ELT (targs, i)); | |
7161 | } | |
7162 | ||
7163 | return lookup_template_function | |
7164 | (tsubst_copy (TREE_OPERAND (t, 0), args, complain, in_decl), targs); | |
7165 | } | |
7166 | ||
7167 | case TREE_LIST: | |
7168 | { | |
7169 | tree purpose, value, chain; | |
7170 | ||
7171 | if (t == void_list_node) | |
7172 | return t; | |
7173 | ||
7174 | purpose = TREE_PURPOSE (t); | |
7175 | if (purpose) | |
7176 | purpose = tsubst_copy (purpose, args, complain, in_decl); | |
7177 | value = TREE_VALUE (t); | |
7178 | if (value) | |
7179 | value = tsubst_copy (value, args, complain, in_decl); | |
7180 | chain = TREE_CHAIN (t); | |
7181 | if (chain && chain != void_type_node) | |
7182 | chain = tsubst_copy (chain, args, complain, in_decl); | |
7183 | if (purpose == TREE_PURPOSE (t) | |
7184 | && value == TREE_VALUE (t) | |
7185 | && chain == TREE_CHAIN (t)) | |
7186 | return t; | |
7187 | return tree_cons (purpose, value, chain); | |
7188 | } | |
7189 | ||
7190 | case RECORD_TYPE: | |
7191 | case UNION_TYPE: | |
7192 | case ENUMERAL_TYPE: | |
7193 | case INTEGER_TYPE: | |
7194 | case TEMPLATE_TYPE_PARM: | |
7195 | case TEMPLATE_TEMPLATE_PARM: | |
7196 | case BOUND_TEMPLATE_TEMPLATE_PARM: | |
7197 | case TEMPLATE_PARM_INDEX: | |
7198 | case POINTER_TYPE: | |
7199 | case REFERENCE_TYPE: | |
7200 | case OFFSET_TYPE: | |
7201 | case FUNCTION_TYPE: | |
7202 | case METHOD_TYPE: | |
7203 | case ARRAY_TYPE: | |
7204 | case TYPENAME_TYPE: | |
7205 | case TYPE_DECL: | |
7206 | return tsubst (t, args, complain, in_decl); | |
7207 | ||
7208 | case IDENTIFIER_NODE: | |
7209 | if (IDENTIFIER_TYPENAME_P (t)) | |
7210 | { | |
7211 | tree new_type = tsubst (TREE_TYPE (t), args, complain, in_decl); | |
7212 | return mangle_conv_op_name_for_type (new_type); | |
7213 | } | |
7214 | else | |
7215 | return t; | |
7216 | ||
7217 | case CONSTRUCTOR: | |
7218 | { | |
7219 | r = build | |
7220 | (CONSTRUCTOR, tsubst (TREE_TYPE (t), args, complain, in_decl), | |
7221 | NULL_TREE, tsubst_copy (CONSTRUCTOR_ELTS (t), args, | |
7222 | complain, in_decl)); | |
7223 | TREE_HAS_CONSTRUCTOR (r) = TREE_HAS_CONSTRUCTOR (t); | |
7224 | return r; | |
7225 | } | |
7226 | ||
7227 | case VA_ARG_EXPR: | |
7228 | return build_x_va_arg (tsubst_copy (TREE_OPERAND (t, 0), args, complain, | |
7229 | in_decl), | |
7230 | tsubst (TREE_TYPE (t), args, complain, in_decl)); | |
7231 | ||
7232 | case FUNCTION_NAME: | |
7233 | return tsubst (t, args, complain, in_decl); | |
7234 | ||
7235 | default: | |
7236 | return t; | |
7237 | } | |
7238 | } | |
7239 | ||
7240 | /* Like tsubst_copy, but also does semantic processing. */ | |
7241 | ||
7242 | tree | |
7243 | tsubst_expr (t, args, complain, in_decl) | |
7244 | tree t, args; | |
7245 | int complain; | |
7246 | tree in_decl; | |
7247 | { | |
7248 | tree stmt; | |
7249 | ||
7250 | if (t == NULL_TREE || t == error_mark_node) | |
7251 | return t; | |
7252 | ||
7253 | if (processing_template_decl) | |
7254 | return tsubst_copy (t, args, complain, in_decl); | |
7255 | ||
7256 | switch (TREE_CODE (t)) | |
7257 | { | |
7258 | case RETURN_INIT: | |
7259 | prep_stmt (t); | |
7260 | finish_named_return_value | |
7261 | (TREE_OPERAND (t, 0), | |
7262 | tsubst_expr (TREE_OPERAND (t, 1), args, /*complain=*/1, in_decl)); | |
7263 | tsubst_expr (TREE_CHAIN (t), args, complain, in_decl); | |
7264 | break; | |
7265 | ||
7266 | case CTOR_INITIALIZER: | |
7267 | { | |
7268 | tree member_init_list; | |
7269 | tree base_init_list; | |
7270 | ||
7271 | prep_stmt (t); | |
7272 | member_init_list | |
7273 | = tsubst_initializer_list (TREE_OPERAND (t, 0), args); | |
7274 | base_init_list | |
7275 | = tsubst_initializer_list (TREE_OPERAND (t, 1), args); | |
7276 | setup_vtbl_ptr (member_init_list, base_init_list); | |
7277 | tsubst_expr (TREE_CHAIN (t), args, complain, in_decl); | |
7278 | break; | |
7279 | } | |
7280 | ||
7281 | case RETURN_STMT: | |
7282 | prep_stmt (t); | |
7283 | finish_return_stmt (tsubst_expr (RETURN_EXPR (t), | |
7284 | args, complain, in_decl)); | |
7285 | break; | |
7286 | ||
7287 | case EXPR_STMT: | |
7288 | prep_stmt (t); | |
7289 | finish_expr_stmt (tsubst_expr (EXPR_STMT_EXPR (t), | |
7290 | args, complain, in_decl)); | |
7291 | break; | |
7292 | ||
7293 | case DECL_STMT: | |
7294 | { | |
7295 | tree decl; | |
7296 | tree init; | |
7297 | ||
7298 | prep_stmt (t); | |
7299 | decl = DECL_STMT_DECL (t); | |
7300 | if (TREE_CODE (decl) == LABEL_DECL) | |
7301 | finish_label_decl (DECL_NAME (decl)); | |
7302 | else if (TREE_CODE (decl) == USING_DECL) | |
7303 | { | |
7304 | tree scope = DECL_INITIAL (decl); | |
7305 | tree name = DECL_NAME (decl); | |
7306 | ||
7307 | scope = tsubst_expr (scope, args, complain, in_decl); | |
7308 | do_local_using_decl (build_nt (SCOPE_REF, scope, name)); | |
7309 | } | |
7310 | else | |
7311 | { | |
7312 | init = DECL_INITIAL (decl); | |
7313 | decl = tsubst (decl, args, complain, in_decl); | |
7314 | init = tsubst_expr (init, args, complain, in_decl); | |
7315 | if (decl != error_mark_node) | |
7316 | { | |
7317 | if (TREE_CODE (decl) != TYPE_DECL) | |
7318 | /* Make sure the type is instantiated now. */ | |
7319 | complete_type (TREE_TYPE (decl)); | |
7320 | if (init) | |
7321 | DECL_INITIAL (decl) = error_mark_node; | |
7322 | /* By marking the declaration as instantiated, we avoid | |
7323 | trying to instantiate it. Since instantiate_decl can't | |
7324 | handle local variables, and since we've already done | |
7325 | all that needs to be done, that's the right thing to | |
7326 | do. */ | |
7327 | if (TREE_CODE (decl) == VAR_DECL) | |
7328 | DECL_TEMPLATE_INSTANTIATED (decl) = 1; | |
7329 | maybe_push_decl (decl); | |
7330 | cp_finish_decl (decl, init, NULL_TREE, 0); | |
7331 | } | |
7332 | } | |
7333 | return decl; | |
7334 | } | |
7335 | ||
7336 | case FOR_STMT: | |
7337 | { | |
7338 | tree tmp; | |
7339 | prep_stmt (t); | |
7340 | ||
7341 | stmt = begin_for_stmt (); | |
7342 | for (tmp = FOR_INIT_STMT (t); tmp; tmp = TREE_CHAIN (tmp)) | |
7343 | tsubst_expr (tmp, args, complain, in_decl); | |
7344 | finish_for_init_stmt (stmt); | |
7345 | finish_for_cond (tsubst_expr (FOR_COND (t), args, | |
7346 | complain, in_decl), | |
7347 | stmt); | |
7348 | tmp = tsubst_expr (FOR_EXPR (t), args, complain, in_decl); | |
7349 | finish_for_expr (tmp, stmt); | |
7350 | tsubst_expr (FOR_BODY (t), args, complain, in_decl); | |
7351 | finish_for_stmt (stmt); | |
7352 | } | |
7353 | break; | |
7354 | ||
7355 | case WHILE_STMT: | |
7356 | { | |
7357 | prep_stmt (t); | |
7358 | stmt = begin_while_stmt (); | |
7359 | finish_while_stmt_cond (tsubst_expr (WHILE_COND (t), | |
7360 | args, complain, in_decl), | |
7361 | stmt); | |
7362 | tsubst_expr (WHILE_BODY (t), args, complain, in_decl); | |
7363 | finish_while_stmt (stmt); | |
7364 | } | |
7365 | break; | |
7366 | ||
7367 | case DO_STMT: | |
7368 | { | |
7369 | prep_stmt (t); | |
7370 | stmt = begin_do_stmt (); | |
7371 | tsubst_expr (DO_BODY (t), args, complain, in_decl); | |
7372 | finish_do_body (stmt); | |
7373 | finish_do_stmt (tsubst_expr (DO_COND (t), args, | |
7374 | complain, in_decl), | |
7375 | stmt); | |
7376 | } | |
7377 | break; | |
7378 | ||
7379 | case IF_STMT: | |
7380 | { | |
7381 | tree tmp; | |
7382 | ||
7383 | prep_stmt (t); | |
7384 | stmt = begin_if_stmt (); | |
7385 | finish_if_stmt_cond (tsubst_expr (IF_COND (t), | |
7386 | args, complain, in_decl), | |
7387 | stmt); | |
7388 | ||
7389 | if (tmp = THEN_CLAUSE (t), tmp) | |
7390 | { | |
7391 | tsubst_expr (tmp, args, complain, in_decl); | |
7392 | finish_then_clause (stmt); | |
7393 | } | |
7394 | ||
7395 | if (tmp = ELSE_CLAUSE (t), tmp) | |
7396 | { | |
7397 | begin_else_clause (); | |
7398 | tsubst_expr (tmp, args, complain, in_decl); | |
7399 | finish_else_clause (stmt); | |
7400 | } | |
7401 | ||
7402 | finish_if_stmt (); | |
7403 | } | |
7404 | break; | |
7405 | ||
7406 | case COMPOUND_STMT: | |
7407 | { | |
7408 | tree substmt; | |
7409 | ||
7410 | prep_stmt (t); | |
7411 | stmt = begin_compound_stmt (COMPOUND_STMT_NO_SCOPE (t)); | |
7412 | for (substmt = COMPOUND_BODY (t); | |
7413 | substmt != NULL_TREE; | |
7414 | substmt = TREE_CHAIN (substmt)) | |
7415 | tsubst_expr (substmt, args, complain, in_decl); | |
7416 | return finish_compound_stmt (COMPOUND_STMT_NO_SCOPE (t), stmt); | |
7417 | } | |
7418 | break; | |
7419 | ||
7420 | case BREAK_STMT: | |
7421 | prep_stmt (t); | |
7422 | finish_break_stmt (); | |
7423 | break; | |
7424 | ||
7425 | case CONTINUE_STMT: | |
7426 | prep_stmt (t); | |
7427 | finish_continue_stmt (); | |
7428 | break; | |
7429 | ||
7430 | case SWITCH_STMT: | |
7431 | { | |
7432 | tree val; | |
7433 | ||
7434 | prep_stmt (t); | |
7435 | stmt = begin_switch_stmt (); | |
7436 | val = tsubst_expr (SWITCH_COND (t), args, complain, in_decl); | |
7437 | finish_switch_cond (val, stmt); | |
7438 | tsubst_expr (SWITCH_BODY (t), args, complain, in_decl); | |
7439 | finish_switch_stmt (stmt); | |
7440 | } | |
7441 | break; | |
7442 | ||
7443 | case CASE_LABEL: | |
7444 | prep_stmt (t); | |
7445 | finish_case_label (tsubst_expr (CASE_LOW (t), args, complain, in_decl), | |
7446 | tsubst_expr (CASE_HIGH (t), args, complain, | |
7447 | in_decl)); | |
7448 | break; | |
7449 | ||
7450 | case LABEL_STMT: | |
7451 | lineno = STMT_LINENO (t); | |
7452 | finish_label_stmt (DECL_NAME (LABEL_STMT_LABEL (t))); | |
7453 | break; | |
7454 | ||
7455 | case GOTO_STMT: | |
7456 | prep_stmt (t); | |
7457 | t = GOTO_DESTINATION (t); | |
7458 | if (TREE_CODE (t) != LABEL_DECL) | |
7459 | /* Computed goto's must be tsubst'd into. On the other hand, | |
7460 | non-computed gotos must not be; the identifier in question | |
7461 | will have no binding. */ | |
7462 | t = tsubst_expr (t, args, complain, in_decl); | |
7463 | else | |
7464 | t = DECL_NAME (t); | |
7465 | finish_goto_stmt (t); | |
7466 | break; | |
7467 | ||
7468 | case ASM_STMT: | |
7469 | prep_stmt (t); | |
7470 | finish_asm_stmt (ASM_CV_QUAL (t), | |
7471 | tsubst_expr (ASM_STRING (t), args, complain, in_decl), | |
7472 | tsubst_expr (ASM_OUTPUTS (t), args, complain, in_decl), | |
7473 | tsubst_expr (ASM_INPUTS (t), args, complain, in_decl), | |
7474 | tsubst_expr (ASM_CLOBBERS (t), args, complain, | |
7475 | in_decl)); | |
7476 | break; | |
7477 | ||
7478 | case TRY_BLOCK: | |
7479 | prep_stmt (t); | |
7480 | if (CLEANUP_P (t)) | |
7481 | { | |
7482 | stmt = begin_try_block (); | |
7483 | tsubst_expr (TRY_STMTS (t), args, complain, in_decl); | |
7484 | finish_cleanup_try_block (stmt); | |
7485 | finish_cleanup (tsubst_expr (TRY_HANDLERS (t), args, | |
7486 | complain, in_decl), | |
7487 | stmt); | |
7488 | } | |
7489 | else | |
7490 | { | |
7491 | tree handler; | |
7492 | ||
7493 | if (FN_TRY_BLOCK_P (t)) | |
7494 | stmt = begin_function_try_block (); | |
7495 | else | |
7496 | stmt = begin_try_block (); | |
7497 | ||
7498 | tsubst_expr (TRY_STMTS (t), args, complain, in_decl); | |
7499 | ||
7500 | if (FN_TRY_BLOCK_P (t)) | |
7501 | finish_function_try_block (stmt); | |
7502 | else | |
7503 | finish_try_block (stmt); | |
7504 | ||
7505 | handler = TRY_HANDLERS (t); | |
7506 | for (; handler; handler = TREE_CHAIN (handler)) | |
7507 | tsubst_expr (handler, args, complain, in_decl); | |
7508 | if (FN_TRY_BLOCK_P (t)) | |
7509 | finish_function_handler_sequence (stmt); | |
7510 | else | |
7511 | finish_handler_sequence (stmt); | |
7512 | } | |
7513 | break; | |
7514 | ||
7515 | case HANDLER: | |
7516 | { | |
7517 | tree decl; | |
7518 | tree blocks; | |
7519 | ||
7520 | prep_stmt (t); | |
7521 | stmt = begin_handler (); | |
7522 | if (HANDLER_PARMS (t)) | |
7523 | { | |
7524 | decl = DECL_STMT_DECL (HANDLER_PARMS (t)); | |
7525 | decl = tsubst (decl, args, complain, in_decl); | |
7526 | /* Prevent instantiate_decl from trying to instantiate | |
7527 | this variable. We've already done all that needs to be | |
7528 | done. */ | |
7529 | DECL_TEMPLATE_INSTANTIATED (decl) = 1; | |
7530 | } | |
7531 | else | |
7532 | decl = NULL_TREE; | |
7533 | blocks = finish_handler_parms (decl, stmt); | |
7534 | tsubst_expr (HANDLER_BODY (t), args, complain, in_decl); | |
7535 | finish_handler (blocks, stmt); | |
7536 | } | |
7537 | break; | |
7538 | ||
7539 | case TAG_DEFN: | |
7540 | prep_stmt (t); | |
7541 | t = TREE_TYPE (t); | |
7542 | tsubst (t, args, complain, NULL_TREE); | |
7543 | break; | |
7544 | ||
7545 | default: | |
7546 | return build_expr_from_tree (tsubst_copy (t, args, complain, in_decl)); | |
7547 | } | |
7548 | return NULL_TREE; | |
7549 | } | |
7550 | ||
7551 | /* TMPL is a TEMPLATE_DECL for a cloned constructor or destructor. | |
7552 | Instantiate it with the ARGS. */ | |
7553 | ||
7554 | static tree | |
7555 | instantiate_clone (tmpl, args) | |
7556 | tree tmpl; | |
7557 | tree args; | |
7558 | { | |
7559 | tree spec; | |
7560 | tree clone; | |
7561 | ||
7562 | /* Instantiated the cloned function, rather than the clone. */ | |
7563 | spec = instantiate_template (DECL_CLONED_FUNCTION (tmpl), args); | |
7564 | ||
7565 | /* Then, see if we've already cloned the instantiation. */ | |
7566 | for (clone = TREE_CHAIN (spec); | |
7567 | clone && DECL_CLONED_FUNCTION_P (clone); | |
7568 | clone = TREE_CHAIN (clone)) | |
7569 | if (DECL_NAME (clone) == DECL_NAME (tmpl)) | |
7570 | return clone; | |
7571 | ||
7572 | /* If we haven't, do so know. */ | |
7573 | if (!clone) | |
7574 | clone_function_decl (spec, /*update_method_vec_p=*/0); | |
7575 | ||
7576 | /* Look again. */ | |
7577 | for (clone = TREE_CHAIN (spec); | |
7578 | clone && DECL_CLONED_FUNCTION_P (clone); | |
7579 | clone = TREE_CHAIN (clone)) | |
7580 | if (DECL_NAME (clone) == DECL_NAME (tmpl)) | |
7581 | return clone; | |
7582 | ||
7583 | /* We should always have found the clone by now. */ | |
7584 | my_friendly_abort (20000411); | |
7585 | return NULL_TREE; | |
7586 | } | |
7587 | ||
7588 | /* Instantiate the indicated variable or function template TMPL with | |
7589 | the template arguments in TARG_PTR. */ | |
7590 | ||
7591 | tree | |
7592 | instantiate_template (tmpl, targ_ptr) | |
7593 | tree tmpl, targ_ptr; | |
7594 | { | |
7595 | tree clone; | |
7596 | tree fndecl; | |
7597 | tree gen_tmpl; | |
7598 | tree spec; | |
7599 | int i, len; | |
7600 | tree inner_args; | |
7601 | ||
7602 | if (tmpl == error_mark_node) | |
7603 | return error_mark_node; | |
7604 | ||
7605 | my_friendly_assert (TREE_CODE (tmpl) == TEMPLATE_DECL, 283); | |
7606 | ||
7607 | /* If this function is a clone, handle it specially. */ | |
7608 | if (DECL_CLONED_FUNCTION_P (tmpl)) | |
7609 | return instantiate_clone (tmpl, targ_ptr); | |
7610 | ||
7611 | /* Check to see if we already have this specialization. */ | |
7612 | spec = retrieve_specialization (tmpl, targ_ptr); | |
7613 | if (spec != NULL_TREE) | |
7614 | return spec; | |
7615 | ||
7616 | gen_tmpl = most_general_template (tmpl); | |
7617 | if (tmpl != gen_tmpl) | |
7618 | { | |
7619 | /* The TMPL is a partial instantiation. To get a full set of | |
7620 | arguments we must add the arguments used to perform the | |
7621 | partial instantiation. */ | |
7622 | targ_ptr = add_outermost_template_args (DECL_TI_ARGS (tmpl), | |
7623 | targ_ptr); | |
7624 | ||
7625 | /* Check to see if we already have this specialization. */ | |
7626 | spec = retrieve_specialization (gen_tmpl, targ_ptr); | |
7627 | if (spec != NULL_TREE) | |
7628 | return spec; | |
7629 | } | |
7630 | ||
7631 | len = DECL_NTPARMS (gen_tmpl); | |
7632 | inner_args = INNERMOST_TEMPLATE_ARGS (targ_ptr); | |
7633 | i = len; | |
7634 | while (i--) | |
7635 | { | |
7636 | tree t = TREE_VEC_ELT (inner_args, i); | |
7637 | if (TYPE_P (t)) | |
7638 | { | |
7639 | tree nt = target_type (t); | |
7640 | if (IS_AGGR_TYPE (nt) && decl_function_context (TYPE_MAIN_DECL (nt))) | |
7641 | { | |
7642 | cp_error ("type `%T' composed from a local class is not a valid template-argument", t); | |
7643 | cp_error (" trying to instantiate `%D'", gen_tmpl); | |
7644 | return error_mark_node; | |
7645 | } | |
7646 | } | |
7647 | } | |
7648 | ||
7649 | /* substitute template parameters */ | |
7650 | fndecl = tsubst (DECL_TEMPLATE_RESULT (gen_tmpl), | |
7651 | targ_ptr, /*complain=*/1, gen_tmpl); | |
7652 | /* The DECL_TI_TEMPLATE should always be the immediate parent | |
7653 | template, not the most general template. */ | |
7654 | DECL_TI_TEMPLATE (fndecl) = tmpl; | |
7655 | ||
7656 | if (flag_external_templates) | |
7657 | add_pending_template (fndecl); | |
7658 | ||
7659 | /* If we've just instantiated the main entry point for a function, | |
7660 | instantiate all the alternate entry points as well. */ | |
7661 | for (clone = TREE_CHAIN (gen_tmpl); | |
7662 | clone && DECL_CLONED_FUNCTION_P (clone); | |
7663 | clone = TREE_CHAIN (clone)) | |
7664 | instantiate_template (clone, targ_ptr); | |
7665 | ||
7666 | return fndecl; | |
7667 | } | |
7668 | ||
7669 | /* The FN is a TEMPLATE_DECL for a function. The ARGS are the | |
7670 | arguments that are being used when calling it. TARGS is a vector | |
7671 | into which the deduced template arguments are placed. | |
7672 | ||
7673 | Return zero for success, 2 for an incomplete match that doesn't resolve | |
7674 | all the types, and 1 for complete failure. An error message will be | |
7675 | printed only for an incomplete match. | |
7676 | ||
7677 | If FN is a conversion operator, or we are trying to produce a specific | |
7678 | specialization, RETURN_TYPE is the return type desired. | |
7679 | ||
7680 | The EXPLICIT_TARGS are explicit template arguments provided via a | |
7681 | template-id. | |
7682 | ||
7683 | The parameter STRICT is one of: | |
7684 | ||
7685 | DEDUCE_CALL: | |
7686 | We are deducing arguments for a function call, as in | |
7687 | [temp.deduct.call]. | |
7688 | ||
7689 | DEDUCE_CONV: | |
7690 | We are deducing arguments for a conversion function, as in | |
7691 | [temp.deduct.conv]. | |
7692 | ||
7693 | DEDUCE_EXACT: | |
7694 | We are deducing arguments when doing an explicit instantiation | |
7695 | as in [temp.explicit], when determining an explicit specialization | |
7696 | as in [temp.expl.spec], or when taking the address of a function | |
7697 | template, as in [temp.deduct.funcaddr]. | |
7698 | ||
7699 | DEDUCE_ORDER: | |
7700 | We are deducing arguments when calculating the partial | |
7701 | ordering between specializations of function or class | |
7702 | templates, as in [temp.func.order] and [temp.class.order]. | |
7703 | ||
7704 | LEN is the number of parms to consider before returning success, or -1 | |
7705 | for all. This is used in partial ordering to avoid comparing parms for | |
7706 | which no actual argument was passed, since they are not considered in | |
7707 | overload resolution (and are explicitly excluded from consideration in | |
7708 | partial ordering in [temp.func.order]/6). */ | |
7709 | ||
7710 | int | |
7711 | fn_type_unification (fn, explicit_targs, targs, args, return_type, | |
7712 | strict, len) | |
7713 | tree fn, explicit_targs, targs, args, return_type; | |
7714 | unification_kind_t strict; | |
7715 | int len; | |
7716 | { | |
7717 | tree parms; | |
7718 | tree fntype; | |
7719 | int result; | |
7720 | ||
7721 | my_friendly_assert (TREE_CODE (fn) == TEMPLATE_DECL, 0); | |
7722 | ||
7723 | fntype = TREE_TYPE (fn); | |
7724 | if (explicit_targs) | |
7725 | { | |
7726 | /* [temp.deduct] | |
7727 | ||
7728 | The specified template arguments must match the template | |
7729 | parameters in kind (i.e., type, nontype, template), and there | |
7730 | must not be more arguments than there are parameters; | |
7731 | otherwise type deduction fails. | |
7732 | ||
7733 | Nontype arguments must match the types of the corresponding | |
7734 | nontype template parameters, or must be convertible to the | |
7735 | types of the corresponding nontype parameters as specified in | |
7736 | _temp.arg.nontype_, otherwise type deduction fails. | |
7737 | ||
7738 | All references in the function type of the function template | |
7739 | to the corresponding template parameters are replaced by the | |
7740 | specified template argument values. If a substitution in a | |
7741 | template parameter or in the function type of the function | |
7742 | template results in an invalid type, type deduction fails. */ | |
7743 | int i; | |
7744 | tree converted_args; | |
7745 | ||
7746 | converted_args | |
7747 | = (coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (fn), | |
7748 | explicit_targs, NULL_TREE, /*complain=*/0, | |
7749 | /*require_all_arguments=*/0)); | |
7750 | if (converted_args == error_mark_node) | |
7751 | return 1; | |
7752 | ||
7753 | fntype = tsubst (fntype, converted_args, /*complain=*/0, NULL_TREE); | |
7754 | if (fntype == error_mark_node) | |
7755 | return 1; | |
7756 | ||
7757 | /* Place the explicitly specified arguments in TARGS. */ | |
7758 | for (i = 0; i < TREE_VEC_LENGTH (targs); i++) | |
7759 | TREE_VEC_ELT (targs, i) = TREE_VEC_ELT (converted_args, i); | |
7760 | } | |
7761 | ||
7762 | parms = TYPE_ARG_TYPES (fntype); | |
7763 | /* Never do unification on the 'this' parameter. */ | |
7764 | if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fn)) | |
7765 | parms = TREE_CHAIN (parms); | |
7766 | ||
7767 | if (return_type) | |
7768 | { | |
7769 | /* We've been given a return type to match, prepend it. */ | |
7770 | parms = tree_cons (NULL_TREE, TREE_TYPE (fntype), parms); | |
7771 | args = tree_cons (NULL_TREE, return_type, args); | |
7772 | if (len >= 0) | |
7773 | ++len; | |
7774 | } | |
7775 | ||
7776 | /* We allow incomplete unification without an error message here | |
7777 | because the standard doesn't seem to explicitly prohibit it. Our | |
7778 | callers must be ready to deal with unification failures in any | |
7779 | event. */ | |
7780 | result = type_unification_real (DECL_INNERMOST_TEMPLATE_PARMS (fn), | |
7781 | targs, parms, args, /*subr=*/0, | |
7782 | strict, /*allow_incomplete*/1, len); | |
7783 | ||
7784 | if (result == 0) | |
7785 | /* All is well so far. Now, check: | |
7786 | ||
7787 | [temp.deduct] | |
7788 | ||
7789 | When all template arguments have been deduced, all uses of | |
7790 | template parameters in nondeduced contexts are replaced with | |
7791 | the corresponding deduced argument values. If the | |
7792 | substitution results in an invalid type, as described above, | |
7793 | type deduction fails. */ | |
7794 | if (tsubst (TREE_TYPE (fn), targs, /*complain=*/0, NULL_TREE) | |
7795 | == error_mark_node) | |
7796 | return 1; | |
7797 | ||
7798 | return result; | |
7799 | } | |
7800 | ||
7801 | /* Adjust types before performing type deduction, as described in | |
7802 | [temp.deduct.call] and [temp.deduct.conv]. The rules in these two | |
7803 | sections are symmetric. PARM is the type of a function parameter | |
7804 | or the return type of the conversion function. ARG is the type of | |
7805 | the argument passed to the call, or the type of the value | |
7806 | initialized with the result of the conversion function. */ | |
7807 | ||
7808 | static int | |
7809 | maybe_adjust_types_for_deduction (strict, parm, arg) | |
7810 | unification_kind_t strict; | |
7811 | tree* parm; | |
7812 | tree* arg; | |
7813 | { | |
7814 | int result = 0; | |
7815 | ||
7816 | switch (strict) | |
7817 | { | |
7818 | case DEDUCE_CALL: | |
7819 | break; | |
7820 | ||
7821 | case DEDUCE_CONV: | |
7822 | { | |
7823 | /* Swap PARM and ARG throughout the remainder of this | |
7824 | function; the handling is precisely symmetric since PARM | |
7825 | will initialize ARG rather than vice versa. */ | |
7826 | tree* temp = parm; | |
7827 | parm = arg; | |
7828 | arg = temp; | |
7829 | break; | |
7830 | } | |
7831 | ||
7832 | case DEDUCE_EXACT: | |
7833 | /* There is nothing to do in this case. */ | |
7834 | return 0; | |
7835 | ||
7836 | case DEDUCE_ORDER: | |
7837 | /* DR 214. [temp.func.order] is underspecified, and leads to no | |
7838 | ordering between things like `T *' and `T const &' for `U *'. | |
7839 | The former has T=U and the latter T=U*. The former looks more | |
7840 | specialized and John Spicer considers it well-formed (the EDG | |
7841 | compiler accepts it). | |
7842 | ||
7843 | John also confirms that deduction should proceed as in a function | |
7844 | call. Which implies the usual ARG and PARM conversions as DEDUCE_CALL. | |
7845 | However, in ordering, ARG can have REFERENCE_TYPE, but no argument | |
7846 | to an actual call can have such a type. | |
7847 | ||
7848 | If both ARG and PARM are REFERENCE_TYPE, we change neither. | |
7849 | If only ARG is a REFERENCE_TYPE, we look through that and then | |
7850 | proceed as with DEDUCE_CALL (which could further convert it). */ | |
7851 | if (TREE_CODE (*arg) == REFERENCE_TYPE) | |
7852 | { | |
7853 | if (TREE_CODE (*parm) == REFERENCE_TYPE) | |
7854 | return 0; | |
7855 | *arg = TREE_TYPE (*arg); | |
7856 | } | |
7857 | break; | |
7858 | default: | |
7859 | my_friendly_abort (0); | |
7860 | } | |
7861 | ||
7862 | if (TREE_CODE (*parm) != REFERENCE_TYPE) | |
7863 | { | |
7864 | /* [temp.deduct.call] | |
7865 | ||
7866 | If P is not a reference type: | |
7867 | ||
7868 | --If A is an array type, the pointer type produced by the | |
7869 | array-to-pointer standard conversion (_conv.array_) is | |
7870 | used in place of A for type deduction; otherwise, | |
7871 | ||
7872 | --If A is a function type, the pointer type produced by | |
7873 | the function-to-pointer standard conversion | |
7874 | (_conv.func_) is used in place of A for type deduction; | |
7875 | otherwise, | |
7876 | ||
7877 | --If A is a cv-qualified type, the top level | |
7878 | cv-qualifiers of A's type are ignored for type | |
7879 | deduction. */ | |
7880 | if (TREE_CODE (*arg) == ARRAY_TYPE) | |
7881 | *arg = build_pointer_type (TREE_TYPE (*arg)); | |
7882 | else if (TREE_CODE (*arg) == FUNCTION_TYPE) | |
7883 | *arg = build_pointer_type (*arg); | |
7884 | else | |
7885 | *arg = TYPE_MAIN_VARIANT (*arg); | |
7886 | } | |
7887 | ||
7888 | /* [temp.deduct.call] | |
7889 | ||
7890 | If P is a cv-qualified type, the top level cv-qualifiers | |
7891 | of P's type are ignored for type deduction. If P is a | |
7892 | reference type, the type referred to by P is used for | |
7893 | type deduction. */ | |
7894 | *parm = TYPE_MAIN_VARIANT (*parm); | |
7895 | if (TREE_CODE (*parm) == REFERENCE_TYPE) | |
7896 | { | |
7897 | *parm = TREE_TYPE (*parm); | |
7898 | result |= UNIFY_ALLOW_OUTER_MORE_CV_QUAL; | |
7899 | } | |
7900 | return result; | |
7901 | } | |
7902 | ||
7903 | /* Most parms like fn_type_unification. | |
7904 | ||
7905 | If SUBR is 1, we're being called recursively (to unify the | |
7906 | arguments of a function or method parameter of a function | |
7907 | template). */ | |
7908 | ||
7909 | static int | |
7910 | type_unification_real (tparms, targs, xparms, xargs, subr, | |
7911 | strict, allow_incomplete, xlen) | |
7912 | tree tparms, targs, xparms, xargs; | |
7913 | int subr; | |
7914 | unification_kind_t strict; | |
7915 | int allow_incomplete, xlen; | |
7916 | { | |
7917 | tree parm, arg; | |
7918 | int i; | |
7919 | int ntparms = TREE_VEC_LENGTH (tparms); | |
7920 | int sub_strict; | |
7921 | int saw_undeduced = 0; | |
7922 | tree parms, args; | |
7923 | int len; | |
7924 | ||
7925 | my_friendly_assert (TREE_CODE (tparms) == TREE_VEC, 289); | |
7926 | my_friendly_assert (xparms == NULL_TREE | |
7927 | || TREE_CODE (xparms) == TREE_LIST, 290); | |
7928 | /* ARGS could be NULL (via a call from parse.y to | |
7929 | build_x_function_call). */ | |
7930 | if (xargs) | |
7931 | my_friendly_assert (TREE_CODE (xargs) == TREE_LIST, 291); | |
7932 | my_friendly_assert (ntparms > 0, 292); | |
7933 | ||
7934 | switch (strict) | |
7935 | { | |
7936 | case DEDUCE_CALL: | |
7937 | sub_strict = (UNIFY_ALLOW_OUTER_LEVEL | UNIFY_ALLOW_MORE_CV_QUAL | |
7938 | | UNIFY_ALLOW_DERIVED); | |
7939 | break; | |
7940 | ||
7941 | case DEDUCE_CONV: | |
7942 | sub_strict = UNIFY_ALLOW_LESS_CV_QUAL; | |
7943 | break; | |
7944 | ||
7945 | case DEDUCE_EXACT: | |
7946 | sub_strict = UNIFY_ALLOW_NONE; | |
7947 | break; | |
7948 | ||
7949 | case DEDUCE_ORDER: | |
7950 | sub_strict = UNIFY_ALLOW_NONE; | |
7951 | break; | |
7952 | ||
7953 | default: | |
7954 | my_friendly_abort (0); | |
7955 | } | |
7956 | ||
7957 | if (xlen == 0) | |
7958 | return 0; | |
7959 | ||
7960 | again: | |
7961 | parms = xparms; | |
7962 | args = xargs; | |
7963 | len = xlen; | |
7964 | ||
7965 | while (parms | |
7966 | && parms != void_list_node | |
7967 | && args | |
7968 | && args != void_list_node) | |
7969 | { | |
7970 | parm = TREE_VALUE (parms); | |
7971 | parms = TREE_CHAIN (parms); | |
7972 | arg = TREE_VALUE (args); | |
7973 | args = TREE_CHAIN (args); | |
7974 | ||
7975 | if (arg == error_mark_node) | |
7976 | return 1; | |
7977 | if (arg == unknown_type_node) | |
7978 | /* We can't deduce anything from this, but we might get all the | |
7979 | template args from other function args. */ | |
7980 | continue; | |
7981 | ||
7982 | /* Conversions will be performed on a function argument that | |
7983 | corresponds with a function parameter that contains only | |
7984 | non-deducible template parameters and explicitly specified | |
7985 | template parameters. */ | |
7986 | if (! uses_template_parms (parm)) | |
7987 | { | |
7988 | tree type; | |
7989 | ||
7990 | if (!TYPE_P (arg)) | |
7991 | type = TREE_TYPE (arg); | |
7992 | else | |
7993 | { | |
7994 | type = arg; | |
7995 | arg = NULL_TREE; | |
7996 | } | |
7997 | ||
7998 | if (strict == DEDUCE_EXACT || strict == DEDUCE_ORDER) | |
7999 | { | |
8000 | if (same_type_p (parm, type)) | |
8001 | continue; | |
8002 | } | |
8003 | else | |
8004 | /* It might work; we shouldn't check now, because we might | |
8005 | get into infinite recursion. Overload resolution will | |
8006 | handle it. */ | |
8007 | continue; | |
8008 | ||
8009 | return 1; | |
8010 | } | |
8011 | ||
8012 | if (!TYPE_P (arg)) | |
8013 | { | |
8014 | my_friendly_assert (TREE_TYPE (arg) != NULL_TREE, 293); | |
8015 | if (type_unknown_p (arg)) | |
8016 | { | |
8017 | /* [temp.deduct.type] A template-argument can be deduced from | |
8018 | a pointer to function or pointer to member function | |
8019 | argument if the set of overloaded functions does not | |
8020 | contain function templates and at most one of a set of | |
8021 | overloaded functions provides a unique match. */ | |
8022 | ||
8023 | if (resolve_overloaded_unification | |
8024 | (tparms, targs, parm, arg, strict, sub_strict) | |
8025 | != 0) | |
8026 | return 1; | |
8027 | continue; | |
8028 | } | |
8029 | arg = TREE_TYPE (arg); | |
8030 | } | |
8031 | ||
8032 | { | |
8033 | int arg_strict = sub_strict; | |
8034 | ||
8035 | if (!subr) | |
8036 | arg_strict |= maybe_adjust_types_for_deduction (strict, &parm, &arg); | |
8037 | ||
8038 | if (unify (tparms, targs, parm, arg, arg_strict)) | |
8039 | return 1; | |
8040 | } | |
8041 | ||
8042 | /* Are we done with the interesting parms? */ | |
8043 | if (--len == 0) | |
8044 | goto done; | |
8045 | } | |
8046 | /* Fail if we've reached the end of the parm list, and more args | |
8047 | are present, and the parm list isn't variadic. */ | |
8048 | if (args && args != void_list_node && parms == void_list_node) | |
8049 | return 1; | |
8050 | /* Fail if parms are left and they don't have default values. */ | |
8051 | if (parms | |
8052 | && parms != void_list_node | |
8053 | && TREE_PURPOSE (parms) == NULL_TREE) | |
8054 | return 1; | |
8055 | ||
8056 | done: | |
8057 | if (!subr) | |
8058 | for (i = 0; i < ntparms; i++) | |
8059 | if (TREE_VEC_ELT (targs, i) == NULL_TREE) | |
8060 | { | |
8061 | tree tparm = TREE_VALUE (TREE_VEC_ELT (tparms, i)); | |
8062 | ||
8063 | /* If this is an undeduced nontype parameter that depends on | |
8064 | a type parameter, try another pass; its type may have been | |
8065 | deduced from a later argument than the one from which | |
8066 | this parameter can be deduced. */ | |
8067 | if (TREE_CODE (tparm) == PARM_DECL | |
8068 | && uses_template_parms (TREE_TYPE (tparm)) | |
8069 | && !saw_undeduced++) | |
8070 | goto again; | |
8071 | ||
8072 | if (!allow_incomplete) | |
8073 | error ("incomplete type unification"); | |
8074 | return 2; | |
8075 | } | |
8076 | return 0; | |
8077 | } | |
8078 | ||
8079 | /* Subroutine of type_unification_real. Args are like the variables at the | |
8080 | call site. ARG is an overloaded function (or template-id); we try | |
8081 | deducing template args from each of the overloads, and if only one | |
8082 | succeeds, we go with that. Modifies TARGS and returns 0 on success. */ | |
8083 | ||
8084 | static int | |
8085 | resolve_overloaded_unification (tparms, targs, parm, arg, strict, | |
8086 | sub_strict) | |
8087 | tree tparms, targs, parm, arg; | |
8088 | unification_kind_t strict; | |
8089 | int sub_strict; | |
8090 | { | |
8091 | tree tempargs = copy_node (targs); | |
8092 | int good = 0; | |
8093 | ||
8094 | if (TREE_CODE (arg) == ADDR_EXPR) | |
8095 | arg = TREE_OPERAND (arg, 0); | |
8096 | ||
8097 | if (TREE_CODE (arg) == COMPONENT_REF) | |
8098 | /* Handle `&x' where `x' is some static or non-static member | |
8099 | function name. */ | |
8100 | arg = TREE_OPERAND (arg, 1); | |
8101 | ||
8102 | if (TREE_CODE (arg) == OFFSET_REF) | |
8103 | arg = TREE_OPERAND (arg, 1); | |
8104 | ||
8105 | /* Strip baselink information. */ | |
8106 | while (TREE_CODE (arg) == TREE_LIST) | |
8107 | arg = TREE_VALUE (arg); | |
8108 | ||
8109 | if (TREE_CODE (arg) == TEMPLATE_ID_EXPR) | |
8110 | { | |
8111 | /* If we got some explicit template args, we need to plug them into | |
8112 | the affected templates before we try to unify, in case the | |
8113 | explicit args will completely resolve the templates in question. */ | |
8114 | ||
8115 | tree expl_subargs = TREE_OPERAND (arg, 1); | |
8116 | arg = TREE_OPERAND (arg, 0); | |
8117 | ||
8118 | for (; arg; arg = OVL_NEXT (arg)) | |
8119 | { | |
8120 | tree fn = OVL_CURRENT (arg); | |
8121 | tree subargs, elem; | |
8122 | ||
8123 | if (TREE_CODE (fn) != TEMPLATE_DECL) | |
8124 | continue; | |
8125 | ||
8126 | subargs = get_bindings_overload (fn, DECL_TEMPLATE_RESULT (fn), | |
8127 | expl_subargs); | |
8128 | if (subargs) | |
8129 | { | |
8130 | elem = tsubst (TREE_TYPE (fn), subargs, /*complain=*/0, | |
8131 | NULL_TREE); | |
8132 | if (TREE_CODE (elem) == METHOD_TYPE) | |
8133 | elem = build_ptrmemfunc_type (build_pointer_type (elem)); | |
8134 | good += try_one_overload (tparms, targs, tempargs, parm, elem, | |
8135 | strict, sub_strict); | |
8136 | } | |
8137 | } | |
8138 | } | |
8139 | else if (TREE_CODE (arg) == OVERLOAD) | |
8140 | { | |
8141 | for (; arg; arg = OVL_NEXT (arg)) | |
8142 | { | |
8143 | tree type = TREE_TYPE (OVL_CURRENT (arg)); | |
8144 | if (TREE_CODE (type) == METHOD_TYPE) | |
8145 | type = build_ptrmemfunc_type (build_pointer_type (type)); | |
8146 | good += try_one_overload (tparms, targs, tempargs, parm, | |
8147 | type, | |
8148 | strict, sub_strict); | |
8149 | } | |
8150 | } | |
8151 | else | |
8152 | my_friendly_abort (981006); | |
8153 | ||
8154 | /* [temp.deduct.type] A template-argument can be deduced from a pointer | |
8155 | to function or pointer to member function argument if the set of | |
8156 | overloaded functions does not contain function templates and at most | |
8157 | one of a set of overloaded functions provides a unique match. | |
8158 | ||
8159 | So if we found multiple possibilities, we return success but don't | |
8160 | deduce anything. */ | |
8161 | ||
8162 | if (good == 1) | |
8163 | { | |
8164 | int i = TREE_VEC_LENGTH (targs); | |
8165 | for (; i--; ) | |
8166 | if (TREE_VEC_ELT (tempargs, i)) | |
8167 | TREE_VEC_ELT (targs, i) = TREE_VEC_ELT (tempargs, i); | |
8168 | } | |
8169 | if (good) | |
8170 | return 0; | |
8171 | ||
8172 | return 1; | |
8173 | } | |
8174 | ||
8175 | /* Subroutine of resolve_overloaded_unification; does deduction for a single | |
8176 | overload. Fills TARGS with any deduced arguments, or error_mark_node if | |
8177 | different overloads deduce different arguments for a given parm. | |
8178 | Returns 1 on success. */ | |
8179 | ||
8180 | static int | |
8181 | try_one_overload (tparms, orig_targs, targs, parm, arg, strict, | |
8182 | sub_strict) | |
8183 | tree tparms, orig_targs, targs, parm, arg; | |
8184 | unification_kind_t strict; | |
8185 | int sub_strict; | |
8186 | { | |
8187 | int nargs; | |
8188 | tree tempargs; | |
8189 | int i; | |
8190 | ||
8191 | /* [temp.deduct.type] A template-argument can be deduced from a pointer | |
8192 | to function or pointer to member function argument if the set of | |
8193 | overloaded functions does not contain function templates and at most | |
8194 | one of a set of overloaded functions provides a unique match. | |
8195 | ||
8196 | So if this is a template, just return success. */ | |
8197 | ||
8198 | if (uses_template_parms (arg)) | |
8199 | return 1; | |
8200 | ||
8201 | sub_strict |= maybe_adjust_types_for_deduction (strict, &parm, &arg); | |
8202 | ||
8203 | /* We don't copy orig_targs for this because if we have already deduced | |
8204 | some template args from previous args, unify would complain when we | |
8205 | try to deduce a template parameter for the same argument, even though | |
8206 | there isn't really a conflict. */ | |
8207 | nargs = TREE_VEC_LENGTH (targs); | |
8208 | tempargs = make_tree_vec (nargs); | |
8209 | ||
8210 | if (unify (tparms, tempargs, parm, arg, sub_strict) != 0) | |
8211 | return 0; | |
8212 | ||
8213 | /* First make sure we didn't deduce anything that conflicts with | |
8214 | explicitly specified args. */ | |
8215 | for (i = nargs; i--; ) | |
8216 | { | |
8217 | tree elt = TREE_VEC_ELT (tempargs, i); | |
8218 | tree oldelt = TREE_VEC_ELT (orig_targs, i); | |
8219 | ||
8220 | if (elt == NULL_TREE) | |
8221 | continue; | |
8222 | else if (uses_template_parms (elt)) | |
8223 | { | |
8224 | /* Since we're unifying against ourselves, we will fill in template | |
8225 | args used in the function parm list with our own template parms. | |
8226 | Discard them. */ | |
8227 | TREE_VEC_ELT (tempargs, i) = NULL_TREE; | |
8228 | continue; | |
8229 | } | |
8230 | else if (oldelt && ! template_args_equal (oldelt, elt)) | |
8231 | return 0; | |
8232 | } | |
8233 | ||
8234 | for (i = nargs; i--; ) | |
8235 | { | |
8236 | tree elt = TREE_VEC_ELT (tempargs, i); | |
8237 | ||
8238 | if (elt) | |
8239 | TREE_VEC_ELT (targs, i) = elt; | |
8240 | } | |
8241 | ||
8242 | return 1; | |
8243 | } | |
8244 | ||
8245 | /* Verify that nondeduce template argument agrees with the type | |
8246 | obtained from argument deduction. Return nonzero if the | |
8247 | verification fails. | |
8248 | ||
8249 | For example: | |
8250 | ||
8251 | struct A { typedef int X; }; | |
8252 | template <class T, class U> struct C {}; | |
8253 | template <class T> struct C<T, typename T::X> {}; | |
8254 | ||
8255 | Then with the instantiation `C<A, int>', we can deduce that | |
8256 | `T' is `A' but unify () does not check whether `typename T::X' | |
8257 | is `int'. This function ensure that they agree. | |
8258 | ||
8259 | TARGS, PARMS are the same as the arguments of unify. | |
8260 | ARGS contains template arguments from all levels. */ | |
8261 | ||
8262 | static int | |
8263 | verify_class_unification (targs, parms, args) | |
8264 | tree targs, parms, args; | |
8265 | { | |
8266 | int i; | |
8267 | int nparms = TREE_VEC_LENGTH (parms); | |
8268 | tree new_parms = tsubst (parms, add_outermost_template_args (args, targs), | |
8269 | /*complain=*/0, NULL_TREE); | |
8270 | if (new_parms == error_mark_node) | |
8271 | return 1; | |
8272 | ||
8273 | args = INNERMOST_TEMPLATE_ARGS (args); | |
8274 | ||
8275 | for (i = 0; i < nparms; i++) | |
8276 | { | |
8277 | tree parm = TREE_VEC_ELT (new_parms, i); | |
8278 | tree arg = TREE_VEC_ELT (args, i); | |
8279 | ||
8280 | /* In case we are deducing from a function argument of a function | |
8281 | templates, some parameters may not be deduced yet. So we | |
8282 | make sure that only fully substituted elements of PARM are | |
8283 | compared below. */ | |
8284 | ||
8285 | if (!uses_template_parms (parm) && !template_args_equal (parm, arg)) | |
8286 | return 1; | |
8287 | } | |
8288 | return 0; | |
8289 | } | |
8290 | ||
8291 | /* PARM is a template class (perhaps with unbound template | |
8292 | parameters). ARG is a fully instantiated type. If ARG can be | |
8293 | bound to PARM, return ARG, otherwise return NULL_TREE. TPARMS and | |
8294 | TARGS are as for unify. */ | |
8295 | ||
8296 | static tree | |
8297 | try_class_unification (tparms, targs, parm, arg) | |
8298 | tree tparms; | |
8299 | tree targs; | |
8300 | tree parm; | |
8301 | tree arg; | |
8302 | { | |
8303 | tree copy_of_targs; | |
8304 | ||
8305 | if (!CLASSTYPE_TEMPLATE_INFO (arg) | |
8306 | || CLASSTYPE_TI_TEMPLATE (arg) != CLASSTYPE_TI_TEMPLATE (parm)) | |
8307 | return NULL_TREE; | |
8308 | ||
8309 | /* We need to make a new template argument vector for the call to | |
8310 | unify. If we used TARGS, we'd clutter it up with the result of | |
8311 | the attempted unification, even if this class didn't work out. | |
8312 | We also don't want to commit ourselves to all the unifications | |
8313 | we've already done, since unification is supposed to be done on | |
8314 | an argument-by-argument basis. In other words, consider the | |
8315 | following pathological case: | |
8316 | ||
8317 | template <int I, int J, int K> | |
8318 | struct S {}; | |
8319 | ||
8320 | template <int I, int J> | |
8321 | struct S<I, J, 2> : public S<I, I, I>, S<J, J, J> {}; | |
8322 | ||
8323 | template <int I, int J, int K> | |
8324 | void f(S<I, J, K>, S<I, I, I>); | |
8325 | ||
8326 | void g() { | |
8327 | S<0, 0, 0> s0; | |
8328 | S<0, 1, 2> s2; | |
8329 | ||
8330 | f(s0, s2); | |
8331 | } | |
8332 | ||
8333 | Now, by the time we consider the unification involving `s2', we | |
8334 | already know that we must have `f<0, 0, 0>'. But, even though | |
8335 | `S<0, 1, 2>' is derived from `S<0, 0, 0>', the code is not legal | |
8336 | because there are two ways to unify base classes of S<0, 1, 2> | |
8337 | with S<I, I, I>. If we kept the already deduced knowledge, we | |
8338 | would reject the possibility I=1. */ | |
8339 | copy_of_targs = make_tree_vec (TREE_VEC_LENGTH (targs)); | |
8340 | ||
8341 | /* If unification failed, we're done. */ | |
8342 | if (unify (tparms, copy_of_targs, CLASSTYPE_TI_ARGS (parm), | |
8343 | CLASSTYPE_TI_ARGS (arg), UNIFY_ALLOW_NONE)) | |
8344 | return NULL_TREE; | |
8345 | ||
8346 | return arg; | |
8347 | } | |
8348 | ||
8349 | /* Subroutine of get_template_base. RVAL, if non-NULL, is a base we | |
8350 | have already discovered to be satisfactory. ARG_BINFO is the binfo | |
8351 | for the base class of ARG that we are currently examining. */ | |
8352 | ||
8353 | static tree | |
8354 | get_template_base_recursive (tparms, targs, parm, | |
8355 | arg_binfo, rval, flags) | |
8356 | tree tparms; | |
8357 | tree targs; | |
8358 | tree arg_binfo; | |
8359 | tree rval; | |
8360 | tree parm; | |
8361 | int flags; | |
8362 | { | |
8363 | tree binfos; | |
8364 | int i, n_baselinks; | |
8365 | tree arg = BINFO_TYPE (arg_binfo); | |
8366 | ||
8367 | if (!(flags & GTB_IGNORE_TYPE)) | |
8368 | { | |
8369 | tree r = try_class_unification (tparms, targs, | |
8370 | parm, arg); | |
8371 | ||
8372 | /* If there is more than one satisfactory baseclass, then: | |
8373 | ||
8374 | [temp.deduct.call] | |
8375 | ||
8376 | If they yield more than one possible deduced A, the type | |
8377 | deduction fails. | |
8378 | ||
8379 | applies. */ | |
8380 | if (r && rval && !same_type_p (r, rval)) | |
8381 | return error_mark_node; | |
8382 | else if (r) | |
8383 | rval = r; | |
8384 | } | |
8385 | ||
8386 | binfos = BINFO_BASETYPES (arg_binfo); | |
8387 | n_baselinks = binfos ? TREE_VEC_LENGTH (binfos) : 0; | |
8388 | ||
8389 | /* Process base types. */ | |
8390 | for (i = 0; i < n_baselinks; i++) | |
8391 | { | |
8392 | tree base_binfo = TREE_VEC_ELT (binfos, i); | |
8393 | int this_virtual; | |
8394 | ||
8395 | /* Skip this base, if we've already seen it. */ | |
8396 | if (BINFO_MARKED (base_binfo)) | |
8397 | continue; | |
8398 | ||
8399 | this_virtual = | |
8400 | (flags & GTB_VIA_VIRTUAL) || TREE_VIA_VIRTUAL (base_binfo); | |
8401 | ||
8402 | /* When searching for a non-virtual, we cannot mark virtually | |
8403 | found binfos. */ | |
8404 | if (! this_virtual) | |
8405 | SET_BINFO_MARKED (base_binfo); | |
8406 | ||
8407 | rval = get_template_base_recursive (tparms, targs, | |
8408 | parm, | |
8409 | base_binfo, | |
8410 | rval, | |
8411 | GTB_VIA_VIRTUAL * this_virtual); | |
8412 | ||
8413 | /* If we discovered more than one matching base class, we can | |
8414 | stop now. */ | |
8415 | if (rval == error_mark_node) | |
8416 | return error_mark_node; | |
8417 | } | |
8418 | ||
8419 | return rval; | |
8420 | } | |
8421 | ||
8422 | /* Given a template type PARM and a class type ARG, find the unique | |
8423 | base type in ARG that is an instance of PARM. We do not examine | |
8424 | ARG itself; only its base-classes. If there is no appropriate base | |
8425 | class, return NULL_TREE. If there is more than one, return | |
8426 | error_mark_node. PARM may be the type of a partial specialization, | |
8427 | as well as a plain template type. Used by unify. */ | |
8428 | ||
8429 | static tree | |
8430 | get_template_base (tparms, targs, parm, arg) | |
8431 | tree tparms; | |
8432 | tree targs; | |
8433 | tree parm; | |
8434 | tree arg; | |
8435 | { | |
8436 | tree rval; | |
8437 | tree arg_binfo; | |
8438 | ||
8439 | my_friendly_assert (IS_AGGR_TYPE_CODE (TREE_CODE (arg)), 92); | |
8440 | ||
8441 | arg_binfo = TYPE_BINFO (complete_type (arg)); | |
8442 | rval = get_template_base_recursive (tparms, targs, | |
8443 | parm, arg_binfo, | |
8444 | NULL_TREE, | |
8445 | GTB_IGNORE_TYPE); | |
8446 | ||
8447 | /* Since get_template_base_recursive marks the bases classes, we | |
8448 | must unmark them here. */ | |
8449 | dfs_walk (arg_binfo, dfs_unmark, markedp, 0); | |
8450 | ||
8451 | return rval; | |
8452 | } | |
8453 | ||
8454 | /* Returns the level of DECL, which declares a template parameter. */ | |
8455 | ||
8456 | static int | |
8457 | template_decl_level (decl) | |
8458 | tree decl; | |
8459 | { | |
8460 | switch (TREE_CODE (decl)) | |
8461 | { | |
8462 | case TYPE_DECL: | |
8463 | case TEMPLATE_DECL: | |
8464 | return TEMPLATE_TYPE_LEVEL (TREE_TYPE (decl)); | |
8465 | ||
8466 | case PARM_DECL: | |
8467 | return TEMPLATE_PARM_LEVEL (DECL_INITIAL (decl)); | |
8468 | ||
8469 | default: | |
8470 | my_friendly_abort (0); | |
8471 | return 0; | |
8472 | } | |
8473 | } | |
8474 | ||
8475 | /* Decide whether ARG can be unified with PARM, considering only the | |
8476 | cv-qualifiers of each type, given STRICT as documented for unify. | |
8477 | Returns non-zero iff the unification is OK on that basis.*/ | |
8478 | ||
8479 | static int | |
8480 | check_cv_quals_for_unify (strict, arg, parm) | |
8481 | int strict; | |
8482 | tree arg; | |
8483 | tree parm; | |
8484 | { | |
8485 | if (!(strict & (UNIFY_ALLOW_MORE_CV_QUAL | UNIFY_ALLOW_OUTER_MORE_CV_QUAL)) | |
8486 | && !at_least_as_qualified_p (arg, parm)) | |
8487 | return 0; | |
8488 | ||
8489 | if (!(strict & (UNIFY_ALLOW_LESS_CV_QUAL | UNIFY_ALLOW_OUTER_LESS_CV_QUAL)) | |
8490 | && !at_least_as_qualified_p (parm, arg)) | |
8491 | return 0; | |
8492 | ||
8493 | return 1; | |
8494 | } | |
8495 | ||
8496 | /* Takes parameters as for type_unification. Returns 0 if the | |
8497 | type deduction succeeds, 1 otherwise. The parameter STRICT is a | |
8498 | bitwise or of the following flags: | |
8499 | ||
8500 | UNIFY_ALLOW_NONE: | |
8501 | Require an exact match between PARM and ARG. | |
8502 | UNIFY_ALLOW_MORE_CV_QUAL: | |
8503 | Allow the deduced ARG to be more cv-qualified (by qualification | |
8504 | conversion) than ARG. | |
8505 | UNIFY_ALLOW_LESS_CV_QUAL: | |
8506 | Allow the deduced ARG to be less cv-qualified than ARG. | |
8507 | UNIFY_ALLOW_DERIVED: | |
8508 | Allow the deduced ARG to be a template base class of ARG, | |
8509 | or a pointer to a template base class of the type pointed to by | |
8510 | ARG. | |
8511 | UNIFY_ALLOW_INTEGER: | |
8512 | Allow any integral type to be deduced. See the TEMPLATE_PARM_INDEX | |
8513 | case for more information. | |
8514 | UNIFY_ALLOW_OUTER_LEVEL: | |
8515 | This is the outermost level of a deduction. Used to determine validity | |
8516 | of qualification conversions. A valid qualification conversion must | |
8517 | have const qualified pointers leading up to the inner type which | |
8518 | requires additional CV quals, except at the outer level, where const | |
8519 | is not required [conv.qual]. It would be normal to set this flag in | |
8520 | addition to setting UNIFY_ALLOW_MORE_CV_QUAL. | |
8521 | UNIFY_ALLOW_OUTER_MORE_CV_QUAL: | |
8522 | This is the outermost level of a deduction, and PARM can be more CV | |
8523 | qualified at this point. | |
8524 | UNIFY_ALLOW_OUTER_LESS_CV_QUAL: | |
8525 | This is the outermost level of a deduction, and PARM can be less CV | |
8526 | qualified at this point. */ | |
8527 | ||
8528 | static int | |
8529 | unify (tparms, targs, parm, arg, strict) | |
8530 | tree tparms, targs, parm, arg; | |
8531 | int strict; | |
8532 | { | |
8533 | int idx; | |
8534 | tree targ; | |
8535 | tree tparm; | |
8536 | int strict_in = strict; | |
8537 | ||
8538 | /* I don't think this will do the right thing with respect to types. | |
8539 | But the only case I've seen it in so far has been array bounds, where | |
8540 | signedness is the only information lost, and I think that will be | |
8541 | okay. */ | |
8542 | while (TREE_CODE (parm) == NOP_EXPR) | |
8543 | parm = TREE_OPERAND (parm, 0); | |
8544 | ||
8545 | if (arg == error_mark_node) | |
8546 | return 1; | |
8547 | if (arg == unknown_type_node) | |
8548 | /* We can't deduce anything from this, but we might get all the | |
8549 | template args from other function args. */ | |
8550 | return 0; | |
8551 | ||
8552 | /* If PARM uses template parameters, then we can't bail out here, | |
8553 | even if ARG == PARM, since we won't record unifications for the | |
8554 | template parameters. We might need them if we're trying to | |
8555 | figure out which of two things is more specialized. */ | |
8556 | if (arg == parm && !uses_template_parms (parm)) | |
8557 | return 0; | |
8558 | ||
8559 | /* Immediately reject some pairs that won't unify because of | |
8560 | cv-qualification mismatches. */ | |
8561 | if (TREE_CODE (arg) == TREE_CODE (parm) | |
8562 | && TYPE_P (arg) | |
8563 | /* It is the elements of the array which hold the cv quals of an array | |
8564 | type, and the elements might be template type parms. We'll check | |
8565 | when we recurse. */ | |
8566 | && TREE_CODE (arg) != ARRAY_TYPE | |
8567 | /* We check the cv-qualifiers when unifying with template type | |
8568 | parameters below. We want to allow ARG `const T' to unify with | |
8569 | PARM `T' for example, when computing which of two templates | |
8570 | is more specialized, for example. */ | |
8571 | && TREE_CODE (arg) != TEMPLATE_TYPE_PARM | |
8572 | && !check_cv_quals_for_unify (strict_in, arg, parm)) | |
8573 | return 1; | |
8574 | ||
8575 | if (!(strict & UNIFY_ALLOW_OUTER_LEVEL) | |
8576 | && TYPE_P (arg) && !CP_TYPE_CONST_P (arg)) | |
8577 | strict &= ~UNIFY_ALLOW_MORE_CV_QUAL; | |
8578 | strict &= ~UNIFY_ALLOW_OUTER_LEVEL; | |
8579 | strict &= ~UNIFY_ALLOW_DERIVED; | |
8580 | strict &= ~UNIFY_ALLOW_OUTER_MORE_CV_QUAL; | |
8581 | strict &= ~UNIFY_ALLOW_OUTER_LESS_CV_QUAL; | |
8582 | ||
8583 | switch (TREE_CODE (parm)) | |
8584 | { | |
8585 | case TYPENAME_TYPE: | |
8586 | /* In a type which contains a nested-name-specifier, template | |
8587 | argument values cannot be deduced for template parameters used | |
8588 | within the nested-name-specifier. */ | |
8589 | return 0; | |
8590 | ||
8591 | case TEMPLATE_TYPE_PARM: | |
8592 | case TEMPLATE_TEMPLATE_PARM: | |
8593 | case BOUND_TEMPLATE_TEMPLATE_PARM: | |
8594 | tparm = TREE_VALUE (TREE_VEC_ELT (tparms, 0)); | |
8595 | ||
8596 | if (TEMPLATE_TYPE_LEVEL (parm) | |
8597 | != template_decl_level (tparm)) | |
8598 | /* The PARM is not one we're trying to unify. Just check | |
8599 | to see if it matches ARG. */ | |
8600 | return (TREE_CODE (arg) == TREE_CODE (parm) | |
8601 | && same_type_p (parm, arg)) ? 0 : 1; | |
8602 | idx = TEMPLATE_TYPE_IDX (parm); | |
8603 | targ = TREE_VEC_ELT (targs, idx); | |
8604 | tparm = TREE_VALUE (TREE_VEC_ELT (tparms, idx)); | |
8605 | ||
8606 | /* Check for mixed types and values. */ | |
8607 | if ((TREE_CODE (parm) == TEMPLATE_TYPE_PARM | |
8608 | && TREE_CODE (tparm) != TYPE_DECL) | |
8609 | || (TREE_CODE (parm) == TEMPLATE_TEMPLATE_PARM | |
8610 | && TREE_CODE (tparm) != TEMPLATE_DECL)) | |
8611 | return 1; | |
8612 | ||
8613 | if (TREE_CODE (parm) == BOUND_TEMPLATE_TEMPLATE_PARM) | |
8614 | { | |
8615 | /* ARG must be constructed from a template class or a template | |
8616 | template parameter. */ | |
8617 | if (TREE_CODE (arg) != BOUND_TEMPLATE_TEMPLATE_PARM | |
8618 | && (TREE_CODE (arg) != RECORD_TYPE || !CLASSTYPE_TEMPLATE_INFO (arg))) | |
8619 | return 1; | |
8620 | ||
8621 | { | |
8622 | tree parmtmpl = TYPE_TI_TEMPLATE (parm); | |
8623 | tree parmvec = TYPE_TI_ARGS (parm); | |
8624 | tree argvec = TYPE_TI_ARGS (arg); | |
8625 | tree argtmplvec | |
8626 | = DECL_INNERMOST_TEMPLATE_PARMS (TYPE_TI_TEMPLATE (arg)); | |
8627 | int i; | |
8628 | ||
8629 | /* The parameter and argument roles have to be switched here | |
8630 | in order to handle default arguments properly. For example, | |
8631 | template<template <class> class TT> void f(TT<int>) | |
8632 | should be able to accept vector<int> which comes from | |
8633 | template <class T, class Allocator = allocator> | |
8634 | class vector. */ | |
8635 | ||
8636 | if (coerce_template_parms (argtmplvec, parmvec, parmtmpl, 0, 1) | |
8637 | == error_mark_node) | |
8638 | return 1; | |
8639 | ||
8640 | /* Deduce arguments T, i from TT<T> or TT<i>. | |
8641 | We check each element of PARMVEC and ARGVEC individually | |
8642 | rather than the whole TREE_VEC since they can have | |
8643 | different number of elements. */ | |
8644 | ||
8645 | for (i = 0; i < TREE_VEC_LENGTH (parmvec); ++i) | |
8646 | { | |
8647 | tree t = TREE_VEC_ELT (parmvec, i); | |
8648 | ||
8649 | if (unify (tparms, targs, t, | |
8650 | TREE_VEC_ELT (argvec, i), | |
8651 | UNIFY_ALLOW_NONE)) | |
8652 | return 1; | |
8653 | } | |
8654 | } | |
8655 | arg = TYPE_TI_TEMPLATE (arg); | |
8656 | ||
8657 | /* Fall through to deduce template name. */ | |
8658 | } | |
8659 | ||
8660 | if (TREE_CODE (parm) == TEMPLATE_TEMPLATE_PARM | |
8661 | || TREE_CODE (parm) == BOUND_TEMPLATE_TEMPLATE_PARM) | |
8662 | { | |
8663 | /* Deduce template name TT from TT, TT<>, TT<T> and TT<i>. */ | |
8664 | ||
8665 | /* Simple cases: Value already set, does match or doesn't. */ | |
8666 | if (targ != NULL_TREE && template_args_equal (targ, arg)) | |
8667 | return 0; | |
8668 | else if (targ) | |
8669 | return 1; | |
8670 | } | |
8671 | else | |
8672 | { | |
8673 | /* If PARM is `const T' and ARG is only `int', we don't have | |
8674 | a match unless we are allowing additional qualification. | |
8675 | If ARG is `const int' and PARM is just `T' that's OK; | |
8676 | that binds `const int' to `T'. */ | |
8677 | if (!check_cv_quals_for_unify (strict_in | UNIFY_ALLOW_LESS_CV_QUAL, | |
8678 | arg, parm)) | |
8679 | return 1; | |
8680 | ||
8681 | /* Consider the case where ARG is `const volatile int' and | |
8682 | PARM is `const T'. Then, T should be `volatile int'. */ | |
8683 | arg = | |
8684 | cp_build_qualified_type_real (arg, | |
8685 | CP_TYPE_QUALS (arg) | |
8686 | & ~CP_TYPE_QUALS (parm), | |
8687 | /*complain=*/0); | |
8688 | if (arg == error_mark_node) | |
8689 | return 1; | |
8690 | ||
8691 | /* Simple cases: Value already set, does match or doesn't. */ | |
8692 | if (targ != NULL_TREE && same_type_p (targ, arg)) | |
8693 | return 0; | |
8694 | else if (targ) | |
8695 | return 1; | |
8696 | } | |
8697 | ||
8698 | /* Make sure that ARG is not a variable-sized array. (Note that | |
8699 | were talking about variable-sized arrays (like `int[n]'), | |
8700 | rather than arrays of unknown size (like `int[]').) We'll | |
8701 | get very confused by such a type since the bound of the array | |
8702 | will not be computable in an instantiation. Besides, such | |
8703 | types are not allowed in ISO C++, so we can do as we please | |
8704 | here. */ | |
8705 | if (TREE_CODE (arg) == ARRAY_TYPE | |
8706 | && !uses_template_parms (arg) | |
8707 | && TYPE_DOMAIN (arg) | |
8708 | && (TREE_CODE (TYPE_MAX_VALUE (TYPE_DOMAIN (arg))) | |
8709 | != INTEGER_CST)) | |
8710 | return 1; | |
8711 | ||
8712 | TREE_VEC_ELT (targs, idx) = arg; | |
8713 | return 0; | |
8714 | ||
8715 | case TEMPLATE_PARM_INDEX: | |
8716 | tparm = TREE_VALUE (TREE_VEC_ELT (tparms, 0)); | |
8717 | ||
8718 | if (TEMPLATE_PARM_LEVEL (parm) | |
8719 | != template_decl_level (tparm)) | |
8720 | /* The PARM is not one we're trying to unify. Just check | |
8721 | to see if it matches ARG. */ | |
8722 | return (TREE_CODE (arg) == TREE_CODE (parm) | |
8723 | && cp_tree_equal (parm, arg) > 0) ? 0 : 1; | |
8724 | ||
8725 | idx = TEMPLATE_PARM_IDX (parm); | |
8726 | targ = TREE_VEC_ELT (targs, idx); | |
8727 | ||
8728 | if (targ) | |
8729 | { | |
8730 | int i = (cp_tree_equal (targ, arg) > 0); | |
8731 | if (i == 1) | |
8732 | return 0; | |
8733 | else if (i == 0) | |
8734 | return 1; | |
8735 | else | |
8736 | my_friendly_abort (42); | |
8737 | } | |
8738 | ||
8739 | /* [temp.deduct.type] If, in the declaration of a function template | |
8740 | with a non-type template-parameter, the non-type | |
8741 | template-parameter is used in an expression in the function | |
8742 | parameter-list and, if the corresponding template-argument is | |
8743 | deduced, the template-argument type shall match the type of the | |
8744 | template-parameter exactly, except that a template-argument | |
8745 | deduced from an array bound may be of any integral type. | |
8746 | The non-type parameter might use already deduced type parameters. */ | |
8747 | tparm = tsubst (TREE_TYPE (parm), targs, 0, NULL_TREE); | |
8748 | if (same_type_p (TREE_TYPE (arg), tparm)) | |
8749 | /* OK */; | |
8750 | else if ((strict & UNIFY_ALLOW_INTEGER) | |
8751 | && (TREE_CODE (tparm) == INTEGER_TYPE | |
8752 | || TREE_CODE (tparm) == BOOLEAN_TYPE)) | |
8753 | /* OK */; | |
8754 | else if (uses_template_parms (tparm)) | |
8755 | /* We haven't deduced the type of this parameter yet. Try again | |
8756 | later. */ | |
8757 | return 0; | |
8758 | else | |
8759 | return 1; | |
8760 | ||
8761 | TREE_VEC_ELT (targs, idx) = arg; | |
8762 | return 0; | |
8763 | ||
8764 | case POINTER_TYPE: | |
8765 | { | |
8766 | if (TREE_CODE (arg) != POINTER_TYPE) | |
8767 | return 1; | |
8768 | ||
8769 | /* [temp.deduct.call] | |
8770 | ||
8771 | A can be another pointer or pointer to member type that can | |
8772 | be converted to the deduced A via a qualification | |
8773 | conversion (_conv.qual_). | |
8774 | ||
8775 | We pass down STRICT here rather than UNIFY_ALLOW_NONE. | |
8776 | This will allow for additional cv-qualification of the | |
8777 | pointed-to types if appropriate. */ | |
8778 | ||
8779 | if (TREE_CODE (TREE_TYPE (arg)) == RECORD_TYPE) | |
8780 | /* The derived-to-base conversion only persists through one | |
8781 | level of pointers. */ | |
8782 | strict |= (strict_in & UNIFY_ALLOW_DERIVED); | |
8783 | ||
8784 | return unify (tparms, targs, TREE_TYPE (parm), | |
8785 | TREE_TYPE (arg), strict); | |
8786 | } | |
8787 | ||
8788 | case REFERENCE_TYPE: | |
8789 | if (TREE_CODE (arg) != REFERENCE_TYPE) | |
8790 | return 1; | |
8791 | return unify (tparms, targs, TREE_TYPE (parm), TREE_TYPE (arg), | |
8792 | strict & UNIFY_ALLOW_MORE_CV_QUAL); | |
8793 | ||
8794 | case ARRAY_TYPE: | |
8795 | if (TREE_CODE (arg) != ARRAY_TYPE) | |
8796 | return 1; | |
8797 | if ((TYPE_DOMAIN (parm) == NULL_TREE) | |
8798 | != (TYPE_DOMAIN (arg) == NULL_TREE)) | |
8799 | return 1; | |
8800 | if (TYPE_DOMAIN (parm) != NULL_TREE | |
8801 | && unify (tparms, targs, TYPE_DOMAIN (parm), | |
8802 | TYPE_DOMAIN (arg), UNIFY_ALLOW_NONE) != 0) | |
8803 | return 1; | |
8804 | return unify (tparms, targs, TREE_TYPE (parm), TREE_TYPE (arg), | |
8805 | UNIFY_ALLOW_NONE); | |
8806 | ||
8807 | case REAL_TYPE: | |
8808 | case COMPLEX_TYPE: | |
8809 | case VECTOR_TYPE: | |
8810 | case INTEGER_TYPE: | |
8811 | case BOOLEAN_TYPE: | |
8812 | case VOID_TYPE: | |
8813 | if (TREE_CODE (arg) != TREE_CODE (parm)) | |
8814 | return 1; | |
8815 | ||
8816 | if (TREE_CODE (parm) == INTEGER_TYPE | |
8817 | && TREE_CODE (TYPE_MAX_VALUE (parm)) != INTEGER_CST) | |
8818 | { | |
8819 | if (TYPE_MIN_VALUE (parm) && TYPE_MIN_VALUE (arg) | |
8820 | && unify (tparms, targs, TYPE_MIN_VALUE (parm), | |
8821 | TYPE_MIN_VALUE (arg), UNIFY_ALLOW_INTEGER)) | |
8822 | return 1; | |
8823 | if (TYPE_MAX_VALUE (parm) && TYPE_MAX_VALUE (arg) | |
8824 | && unify (tparms, targs, TYPE_MAX_VALUE (parm), | |
8825 | TYPE_MAX_VALUE (arg), UNIFY_ALLOW_INTEGER)) | |
8826 | return 1; | |
8827 | } | |
8828 | /* We have already checked cv-qualification at the top of the | |
8829 | function. */ | |
8830 | else if (!same_type_ignoring_top_level_qualifiers_p (arg, parm)) | |
8831 | return 1; | |
8832 | ||
8833 | /* As far as unification is concerned, this wins. Later checks | |
8834 | will invalidate it if necessary. */ | |
8835 | return 0; | |
8836 | ||
8837 | /* Types INTEGER_CST and MINUS_EXPR can come from array bounds. */ | |
8838 | /* Type INTEGER_CST can come from ordinary constant template args. */ | |
8839 | case INTEGER_CST: | |
8840 | while (TREE_CODE (arg) == NOP_EXPR) | |
8841 | arg = TREE_OPERAND (arg, 0); | |
8842 | ||
8843 | if (TREE_CODE (arg) != INTEGER_CST) | |
8844 | return 1; | |
8845 | return !tree_int_cst_equal (parm, arg); | |
8846 | ||
8847 | case TREE_VEC: | |
8848 | { | |
8849 | int i; | |
8850 | if (TREE_CODE (arg) != TREE_VEC) | |
8851 | return 1; | |
8852 | if (TREE_VEC_LENGTH (parm) != TREE_VEC_LENGTH (arg)) | |
8853 | return 1; | |
8854 | for (i = 0; i < TREE_VEC_LENGTH (parm); ++i) | |
8855 | if (unify (tparms, targs, | |
8856 | TREE_VEC_ELT (parm, i), TREE_VEC_ELT (arg, i), | |
8857 | UNIFY_ALLOW_NONE)) | |
8858 | return 1; | |
8859 | return 0; | |
8860 | } | |
8861 | ||
8862 | case RECORD_TYPE: | |
8863 | case UNION_TYPE: | |
8864 | if (TREE_CODE (arg) != TREE_CODE (parm)) | |
8865 | return 1; | |
8866 | ||
8867 | if (TYPE_PTRMEMFUNC_P (parm)) | |
8868 | { | |
8869 | if (!TYPE_PTRMEMFUNC_P (arg)) | |
8870 | return 1; | |
8871 | ||
8872 | return unify (tparms, targs, | |
8873 | TYPE_PTRMEMFUNC_FN_TYPE (parm), | |
8874 | TYPE_PTRMEMFUNC_FN_TYPE (arg), | |
8875 | strict); | |
8876 | } | |
8877 | ||
8878 | if (CLASSTYPE_TEMPLATE_INFO (parm)) | |
8879 | { | |
8880 | tree t = NULL_TREE; | |
8881 | ||
8882 | if (strict_in & UNIFY_ALLOW_DERIVED) | |
8883 | { | |
8884 | /* First, we try to unify the PARM and ARG directly. */ | |
8885 | t = try_class_unification (tparms, targs, | |
8886 | parm, arg); | |
8887 | ||
8888 | if (!t) | |
8889 | { | |
8890 | /* Fallback to the special case allowed in | |
8891 | [temp.deduct.call]: | |
8892 | ||
8893 | If P is a class, and P has the form | |
8894 | template-id, then A can be a derived class of | |
8895 | the deduced A. Likewise, if P is a pointer to | |
8896 | a class of the form template-id, A can be a | |
8897 | pointer to a derived class pointed to by the | |
8898 | deduced A. */ | |
8899 | t = get_template_base (tparms, targs, | |
8900 | parm, arg); | |
8901 | ||
8902 | if (! t || t == error_mark_node) | |
8903 | return 1; | |
8904 | } | |
8905 | } | |
8906 | else if (CLASSTYPE_TEMPLATE_INFO (arg) | |
8907 | && (CLASSTYPE_TI_TEMPLATE (parm) | |
8908 | == CLASSTYPE_TI_TEMPLATE (arg))) | |
8909 | /* Perhaps PARM is something like S<U> and ARG is S<int>. | |
8910 | Then, we should unify `int' and `U'. */ | |
8911 | t = arg; | |
8912 | else | |
8913 | /* There's no chance of unification succeeding. */ | |
8914 | return 1; | |
8915 | ||
8916 | return unify (tparms, targs, CLASSTYPE_TI_ARGS (parm), | |
8917 | CLASSTYPE_TI_ARGS (t), UNIFY_ALLOW_NONE); | |
8918 | } | |
8919 | else if (!same_type_ignoring_top_level_qualifiers_p (parm, arg)) | |
8920 | return 1; | |
8921 | return 0; | |
8922 | ||
8923 | case METHOD_TYPE: | |
8924 | case FUNCTION_TYPE: | |
8925 | if (TREE_CODE (arg) != TREE_CODE (parm)) | |
8926 | return 1; | |
8927 | ||
8928 | if (unify (tparms, targs, TREE_TYPE (parm), | |
8929 | TREE_TYPE (arg), UNIFY_ALLOW_NONE)) | |
8930 | return 1; | |
8931 | return type_unification_real (tparms, targs, TYPE_ARG_TYPES (parm), | |
8932 | TYPE_ARG_TYPES (arg), 1, | |
8933 | DEDUCE_EXACT, 0, -1); | |
8934 | ||
8935 | case OFFSET_TYPE: | |
8936 | if (TREE_CODE (arg) != OFFSET_TYPE) | |
8937 | return 1; | |
8938 | if (unify (tparms, targs, TYPE_OFFSET_BASETYPE (parm), | |
8939 | TYPE_OFFSET_BASETYPE (arg), UNIFY_ALLOW_NONE)) | |
8940 | return 1; | |
8941 | return unify (tparms, targs, TREE_TYPE (parm), TREE_TYPE (arg), | |
8942 | strict); | |
8943 | ||
8944 | case CONST_DECL: | |
8945 | if (arg != decl_constant_value (parm)) | |
8946 | return 1; | |
8947 | return 0; | |
8948 | ||
8949 | case TEMPLATE_DECL: | |
8950 | /* Matched cases are handled by the ARG == PARM test above. */ | |
8951 | return 1; | |
8952 | ||
8953 | case MINUS_EXPR: | |
8954 | if (TREE_CODE (TREE_OPERAND (parm, 1)) == INTEGER_CST) | |
8955 | { | |
8956 | /* We handle this case specially, since it comes up with | |
8957 | arrays. In particular, something like: | |
8958 | ||
8959 | template <int N> void f(int (&x)[N]); | |
8960 | ||
8961 | Here, we are trying to unify the range type, which | |
8962 | looks like [0 ... (N - 1)]. */ | |
8963 | tree t, t1, t2; | |
8964 | t1 = TREE_OPERAND (parm, 0); | |
8965 | t2 = TREE_OPERAND (parm, 1); | |
8966 | ||
8967 | t = fold (build (PLUS_EXPR, integer_type_node, arg, t2)); | |
8968 | ||
8969 | return unify (tparms, targs, t1, t, strict); | |
8970 | } | |
8971 | /* else fall through */ | |
8972 | ||
8973 | default: | |
8974 | if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (TREE_CODE (parm)))) | |
8975 | { | |
8976 | ||
8977 | /* We're looking at an expression. This can happen with | |
8978 | something like: | |
8979 | ||
8980 | template <int I> | |
8981 | void foo(S<I>, S<I + 2>); | |
8982 | ||
8983 | This is a "nondeduced context": | |
8984 | ||
8985 | [deduct.type] | |
8986 | ||
8987 | The nondeduced contexts are: | |
8988 | ||
8989 | --A type that is a template-id in which one or more of | |
8990 | the template-arguments is an expression that references | |
8991 | a template-parameter. | |
8992 | ||
8993 | In these cases, we assume deduction succeeded, but don't | |
8994 | actually infer any unifications. */ | |
8995 | ||
8996 | if (!uses_template_parms (parm) | |
8997 | && !template_args_equal (parm, arg)) | |
8998 | return 1; | |
8999 | else | |
9000 | return 0; | |
9001 | } | |
9002 | else | |
9003 | sorry ("use of `%s' in template type unification", | |
9004 | tree_code_name [(int) TREE_CODE (parm)]); | |
9005 | ||
9006 | return 1; | |
9007 | } | |
9008 | } | |
9009 | \f | |
9010 | /* Called if RESULT is explicitly instantiated, or is a member of an | |
9011 | explicitly instantiated class, or if using -frepo and the | |
9012 | instantiation of RESULT has been assigned to this file. */ | |
9013 | ||
9014 | void | |
9015 | mark_decl_instantiated (result, extern_p) | |
9016 | tree result; | |
9017 | int extern_p; | |
9018 | { | |
9019 | if (TREE_CODE (result) != FUNCTION_DECL) | |
9020 | /* The TREE_PUBLIC flag for function declarations will have been | |
9021 | set correctly by tsubst. */ | |
9022 | TREE_PUBLIC (result) = 1; | |
9023 | ||
9024 | /* We used to set this unconditionally; we moved that to | |
9025 | do_decl_instantiation so it wouldn't get set on members of | |
9026 | explicit class template instantiations. But we still need to set | |
9027 | it here for the 'extern template' case in order to suppress | |
9028 | implicit instantiations. */ | |
9029 | if (extern_p) | |
9030 | SET_DECL_EXPLICIT_INSTANTIATION (result); | |
9031 | ||
9032 | if (! extern_p) | |
9033 | { | |
9034 | DECL_INTERFACE_KNOWN (result) = 1; | |
9035 | DECL_NOT_REALLY_EXTERN (result) = 1; | |
9036 | ||
9037 | /* Always make artificials weak. */ | |
9038 | if (DECL_ARTIFICIAL (result) && flag_weak) | |
9039 | comdat_linkage (result); | |
9040 | /* For WIN32 we also want to put explicit instantiations in | |
9041 | linkonce sections. */ | |
9042 | else if (TREE_PUBLIC (result)) | |
9043 | maybe_make_one_only (result); | |
9044 | } | |
9045 | else if (TREE_CODE (result) == FUNCTION_DECL) | |
9046 | defer_fn (result); | |
9047 | } | |
9048 | ||
9049 | /* Given two function templates PAT1 and PAT2, return: | |
9050 | ||
9051 | DEDUCE should be DEDUCE_EXACT or DEDUCE_ORDER. | |
9052 | ||
9053 | 1 if PAT1 is more specialized than PAT2 as described in [temp.func.order]. | |
9054 | -1 if PAT2 is more specialized than PAT1. | |
9055 | 0 if neither is more specialized. | |
9056 | ||
9057 | LEN is passed through to fn_type_unification. */ | |
9058 | ||
9059 | int | |
9060 | more_specialized (pat1, pat2, deduce, len) | |
9061 | tree pat1, pat2; | |
9062 | int deduce; | |
9063 | int len; | |
9064 | { | |
9065 | tree targs; | |
9066 | int winner = 0; | |
9067 | ||
9068 | targs = get_bindings_real (pat1, DECL_TEMPLATE_RESULT (pat2), | |
9069 | NULL_TREE, 0, deduce, len); | |
9070 | if (targs) | |
9071 | --winner; | |
9072 | ||
9073 | targs = get_bindings_real (pat2, DECL_TEMPLATE_RESULT (pat1), | |
9074 | NULL_TREE, 0, deduce, len); | |
9075 | if (targs) | |
9076 | ++winner; | |
9077 | ||
9078 | return winner; | |
9079 | } | |
9080 | ||
9081 | /* Given two class template specialization list nodes PAT1 and PAT2, return: | |
9082 | ||
9083 | 1 if PAT1 is more specialized than PAT2 as described in [temp.class.order]. | |
9084 | -1 if PAT2 is more specialized than PAT1. | |
9085 | 0 if neither is more specialized. */ | |
9086 | ||
9087 | int | |
9088 | more_specialized_class (pat1, pat2) | |
9089 | tree pat1, pat2; | |
9090 | { | |
9091 | tree targs; | |
9092 | int winner = 0; | |
9093 | ||
9094 | targs = get_class_bindings (TREE_VALUE (pat1), TREE_PURPOSE (pat1), | |
9095 | TREE_PURPOSE (pat2)); | |
9096 | if (targs) | |
9097 | --winner; | |
9098 | ||
9099 | targs = get_class_bindings (TREE_VALUE (pat2), TREE_PURPOSE (pat2), | |
9100 | TREE_PURPOSE (pat1)); | |
9101 | if (targs) | |
9102 | ++winner; | |
9103 | ||
9104 | return winner; | |
9105 | } | |
9106 | ||
9107 | /* Return the template arguments that will produce the function signature | |
9108 | DECL from the function template FN, with the explicit template | |
9109 | arguments EXPLICIT_ARGS. If CHECK_RETTYPE is 1, the return type must | |
9110 | also match. Return NULL_TREE if no satisfactory arguments could be | |
9111 | found. DEDUCE and LEN are passed through to fn_type_unification. */ | |
9112 | ||
9113 | static tree | |
9114 | get_bindings_real (fn, decl, explicit_args, check_rettype, deduce, len) | |
9115 | tree fn, decl, explicit_args; | |
9116 | int check_rettype, deduce, len; | |
9117 | { | |
9118 | int ntparms = DECL_NTPARMS (fn); | |
9119 | tree targs = make_tree_vec (ntparms); | |
9120 | tree decl_type; | |
9121 | tree decl_arg_types; | |
9122 | int i; | |
9123 | ||
9124 | /* Substitute the explicit template arguments into the type of DECL. | |
9125 | The call to fn_type_unification will handle substitution into the | |
9126 | FN. */ | |
9127 | decl_type = TREE_TYPE (decl); | |
9128 | if (explicit_args && uses_template_parms (decl_type)) | |
9129 | { | |
9130 | tree tmpl; | |
9131 | tree converted_args; | |
9132 | ||
9133 | if (DECL_TEMPLATE_INFO (decl)) | |
9134 | tmpl = DECL_TI_TEMPLATE (decl); | |
9135 | else | |
9136 | /* We can get here for some illegal specializations. */ | |
9137 | return NULL_TREE; | |
9138 | ||
9139 | converted_args | |
9140 | = (coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (tmpl), | |
9141 | explicit_args, NULL_TREE, | |
9142 | /*complain=*/0, | |
9143 | /*require_all_arguments=*/0)); | |
9144 | if (converted_args == error_mark_node) | |
9145 | return NULL_TREE; | |
9146 | ||
9147 | decl_type = tsubst (decl_type, converted_args, /*complain=*/0, | |
9148 | NULL_TREE); | |
9149 | if (decl_type == error_mark_node) | |
9150 | return NULL_TREE; | |
9151 | } | |
9152 | ||
9153 | decl_arg_types = TYPE_ARG_TYPES (decl_type); | |
9154 | /* Never do unification on the 'this' parameter. */ | |
9155 | if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl)) | |
9156 | decl_arg_types = TREE_CHAIN (decl_arg_types); | |
9157 | ||
9158 | i = fn_type_unification (fn, explicit_args, targs, | |
9159 | decl_arg_types, | |
9160 | (check_rettype || DECL_CONV_FN_P (fn) | |
9161 | ? TREE_TYPE (decl_type) : NULL_TREE), | |
9162 | deduce, len); | |
9163 | ||
9164 | if (i != 0) | |
9165 | return NULL_TREE; | |
9166 | ||
9167 | return targs; | |
9168 | } | |
9169 | ||
9170 | /* For most uses, we want to check the return type. */ | |
9171 | ||
9172 | tree | |
9173 | get_bindings (fn, decl, explicit_args) | |
9174 | tree fn, decl, explicit_args; | |
9175 | { | |
9176 | return get_bindings_real (fn, decl, explicit_args, 1, DEDUCE_EXACT, -1); | |
9177 | } | |
9178 | ||
9179 | /* But for resolve_overloaded_unification, we only care about the parameter | |
9180 | types. */ | |
9181 | ||
9182 | static tree | |
9183 | get_bindings_overload (fn, decl, explicit_args) | |
9184 | tree fn, decl, explicit_args; | |
9185 | { | |
9186 | return get_bindings_real (fn, decl, explicit_args, 0, DEDUCE_EXACT, -1); | |
9187 | } | |
9188 | ||
9189 | /* Return the innermost template arguments that, when applied to a | |
9190 | template specialization whose innermost template parameters are | |
9191 | TPARMS, and whose specialization arguments are ARGS, yield the | |
9192 | ARGS. | |
9193 | ||
9194 | For example, suppose we have: | |
9195 | ||
9196 | template <class T, class U> struct S {}; | |
9197 | template <class T> struct S<T*, int> {}; | |
9198 | ||
9199 | Then, suppose we want to get `S<double*, int>'. The TPARMS will be | |
9200 | {T}, the PARMS will be {T*, int} and the ARGS will be {double*, | |
9201 | int}. The resulting vector will be {double}, indicating that `T' | |
9202 | is bound to `double'. */ | |
9203 | ||
9204 | static tree | |
9205 | get_class_bindings (tparms, parms, args) | |
9206 | tree tparms, parms, args; | |
9207 | { | |
9208 | int i, ntparms = TREE_VEC_LENGTH (tparms); | |
9209 | tree vec = make_tree_vec (ntparms); | |
9210 | ||
9211 | if (unify (tparms, vec, parms, INNERMOST_TEMPLATE_ARGS (args), | |
9212 | UNIFY_ALLOW_NONE)) | |
9213 | return NULL_TREE; | |
9214 | ||
9215 | for (i = 0; i < ntparms; ++i) | |
9216 | if (! TREE_VEC_ELT (vec, i)) | |
9217 | return NULL_TREE; | |
9218 | ||
9219 | if (verify_class_unification (vec, parms, args)) | |
9220 | return NULL_TREE; | |
9221 | ||
9222 | return vec; | |
9223 | } | |
9224 | ||
9225 | /* In INSTANTIATIONS is a list of <INSTANTIATION, TEMPLATE> pairs. | |
9226 | Pick the most specialized template, and return the corresponding | |
9227 | instantiation, or if there is no corresponding instantiation, the | |
9228 | template itself. If there is no most specialized template, | |
9229 | error_mark_node is returned. If there are no templates at all, | |
9230 | NULL_TREE is returned. */ | |
9231 | ||
9232 | tree | |
9233 | most_specialized_instantiation (instantiations) | |
9234 | tree instantiations; | |
9235 | { | |
9236 | tree fn, champ; | |
9237 | int fate; | |
9238 | ||
9239 | if (!instantiations) | |
9240 | return NULL_TREE; | |
9241 | ||
9242 | champ = instantiations; | |
9243 | for (fn = TREE_CHAIN (instantiations); fn; fn = TREE_CHAIN (fn)) | |
9244 | { | |
9245 | fate = more_specialized (TREE_VALUE (champ), TREE_VALUE (fn), | |
9246 | DEDUCE_EXACT, -1); | |
9247 | if (fate == 1) | |
9248 | ; | |
9249 | else | |
9250 | { | |
9251 | if (fate == 0) | |
9252 | { | |
9253 | fn = TREE_CHAIN (fn); | |
9254 | if (! fn) | |
9255 | return error_mark_node; | |
9256 | } | |
9257 | champ = fn; | |
9258 | } | |
9259 | } | |
9260 | ||
9261 | for (fn = instantiations; fn && fn != champ; fn = TREE_CHAIN (fn)) | |
9262 | { | |
9263 | fate = more_specialized (TREE_VALUE (champ), TREE_VALUE (fn), | |
9264 | DEDUCE_EXACT, -1); | |
9265 | if (fate != 1) | |
9266 | return error_mark_node; | |
9267 | } | |
9268 | ||
9269 | return TREE_PURPOSE (champ) ? TREE_PURPOSE (champ) : TREE_VALUE (champ); | |
9270 | } | |
9271 | ||
9272 | /* Return the most specialized of the list of templates in FNS that can | |
9273 | produce an instantiation matching DECL, given the explicit template | |
9274 | arguments EXPLICIT_ARGS. */ | |
9275 | ||
9276 | static tree | |
9277 | most_specialized (fns, decl, explicit_args) | |
9278 | tree fns, decl, explicit_args; | |
9279 | { | |
9280 | tree candidates = NULL_TREE; | |
9281 | tree fn, args; | |
9282 | ||
9283 | for (fn = fns; fn; fn = TREE_CHAIN (fn)) | |
9284 | { | |
9285 | tree candidate = TREE_VALUE (fn); | |
9286 | ||
9287 | args = get_bindings (candidate, decl, explicit_args); | |
9288 | if (args) | |
9289 | candidates = tree_cons (NULL_TREE, candidate, candidates); | |
9290 | } | |
9291 | ||
9292 | return most_specialized_instantiation (candidates); | |
9293 | } | |
9294 | ||
9295 | /* If DECL is a specialization of some template, return the most | |
9296 | general such template. Otherwise, returns NULL_TREE. | |
9297 | ||
9298 | For example, given: | |
9299 | ||
9300 | template <class T> struct S { template <class U> void f(U); }; | |
9301 | ||
9302 | if TMPL is `template <class U> void S<int>::f(U)' this will return | |
9303 | the full template. This function will not trace past partial | |
9304 | specializations, however. For example, given in addition: | |
9305 | ||
9306 | template <class T> struct S<T*> { template <class U> void f(U); }; | |
9307 | ||
9308 | if TMPL is `template <class U> void S<int*>::f(U)' this will return | |
9309 | `template <class T> template <class U> S<T*>::f(U)'. */ | |
9310 | ||
9311 | tree | |
9312 | most_general_template (decl) | |
9313 | tree decl; | |
9314 | { | |
9315 | /* If DECL is a FUNCTION_DECL, find the TEMPLATE_DECL of which it is | |
9316 | an immediate specialization. */ | |
9317 | if (TREE_CODE (decl) == FUNCTION_DECL) | |
9318 | { | |
9319 | if (DECL_TEMPLATE_INFO (decl)) { | |
9320 | decl = DECL_TI_TEMPLATE (decl); | |
9321 | ||
9322 | /* The DECL_TI_TEMPLATE can be an IDENTIFIER_NODE for a | |
9323 | template friend. */ | |
9324 | if (TREE_CODE (decl) != TEMPLATE_DECL) | |
9325 | return NULL_TREE; | |
9326 | } else | |
9327 | return NULL_TREE; | |
9328 | } | |
9329 | ||
9330 | /* Look for more and more general templates. */ | |
9331 | while (DECL_TEMPLATE_INFO (decl)) | |
9332 | { | |
9333 | /* The DECL_TI_TEMPLATE can be a LOOKUP_EXPR or IDENTIFIER_NODE | |
9334 | in some cases. (See cp-tree.h for details.) */ | |
9335 | if (TREE_CODE (DECL_TI_TEMPLATE (decl)) != TEMPLATE_DECL) | |
9336 | break; | |
9337 | ||
9338 | /* Stop if we run into an explicitly specialized class template. */ | |
9339 | if (!DECL_NAMESPACE_SCOPE_P (decl) | |
9340 | && DECL_CONTEXT (decl) | |
9341 | && CLASSTYPE_TEMPLATE_SPECIALIZATION (DECL_CONTEXT (decl))) | |
9342 | break; | |
9343 | ||
9344 | decl = DECL_TI_TEMPLATE (decl); | |
9345 | } | |
9346 | ||
9347 | return decl; | |
9348 | } | |
9349 | ||
9350 | /* Return the most specialized of the class template specializations | |
9351 | of TMPL which can produce an instantiation matching ARGS, or | |
9352 | error_mark_node if the choice is ambiguous. */ | |
9353 | ||
9354 | static tree | |
9355 | most_specialized_class (tmpl, args) | |
9356 | tree tmpl; | |
9357 | tree args; | |
9358 | { | |
9359 | tree list = NULL_TREE; | |
9360 | tree t; | |
9361 | tree champ; | |
9362 | int fate; | |
9363 | ||
9364 | tmpl = most_general_template (tmpl); | |
9365 | for (t = DECL_TEMPLATE_SPECIALIZATIONS (tmpl); t; t = TREE_CHAIN (t)) | |
9366 | { | |
9367 | tree spec_args | |
9368 | = get_class_bindings (TREE_VALUE (t), TREE_PURPOSE (t), args); | |
9369 | if (spec_args) | |
9370 | { | |
9371 | list = tree_cons (TREE_PURPOSE (t), TREE_VALUE (t), list); | |
9372 | TREE_TYPE (list) = TREE_TYPE (t); | |
9373 | } | |
9374 | } | |
9375 | ||
9376 | if (! list) | |
9377 | return NULL_TREE; | |
9378 | ||
9379 | t = list; | |
9380 | champ = t; | |
9381 | t = TREE_CHAIN (t); | |
9382 | for (; t; t = TREE_CHAIN (t)) | |
9383 | { | |
9384 | fate = more_specialized_class (champ, t); | |
9385 | if (fate == 1) | |
9386 | ; | |
9387 | else | |
9388 | { | |
9389 | if (fate == 0) | |
9390 | { | |
9391 | t = TREE_CHAIN (t); | |
9392 | if (! t) | |
9393 | return error_mark_node; | |
9394 | } | |
9395 | champ = t; | |
9396 | } | |
9397 | } | |
9398 | ||
9399 | for (t = list; t && t != champ; t = TREE_CHAIN (t)) | |
9400 | { | |
9401 | fate = more_specialized_class (champ, t); | |
9402 | if (fate != 1) | |
9403 | return error_mark_node; | |
9404 | } | |
9405 | ||
9406 | return champ; | |
9407 | } | |
9408 | ||
9409 | /* called from the parser. */ | |
9410 | ||
9411 | void | |
9412 | do_decl_instantiation (declspecs, declarator, storage) | |
9413 | tree declspecs, declarator, storage; | |
9414 | { | |
9415 | tree decl = grokdeclarator (declarator, declspecs, NORMAL, 0, NULL_TREE); | |
9416 | tree result = NULL_TREE; | |
9417 | int extern_p = 0; | |
9418 | ||
9419 | if (!decl) | |
9420 | /* An error occurred, for which grokdeclarator has already issued | |
9421 | an appropriate message. */ | |
9422 | return; | |
9423 | else if (! DECL_LANG_SPECIFIC (decl)) | |
9424 | { | |
9425 | cp_error ("explicit instantiation of non-template `%#D'", decl); | |
9426 | return; | |
9427 | } | |
9428 | else if (TREE_CODE (decl) == VAR_DECL) | |
9429 | { | |
9430 | /* There is an asymmetry here in the way VAR_DECLs and | |
9431 | FUNCTION_DECLs are handled by grokdeclarator. In the case of | |
9432 | the latter, the DECL we get back will be marked as a | |
9433 | template instantiation, and the appropriate | |
9434 | DECL_TEMPLATE_INFO will be set up. This does not happen for | |
9435 | VAR_DECLs so we do the lookup here. Probably, grokdeclarator | |
9436 | should handle VAR_DECLs as it currently handles | |
9437 | FUNCTION_DECLs. */ | |
9438 | result = lookup_field (DECL_CONTEXT (decl), DECL_NAME (decl), 0, 0); | |
9439 | if (result && TREE_CODE (result) != VAR_DECL) | |
9440 | { | |
9441 | cp_error ("no matching template for `%D' found", result); | |
9442 | return; | |
9443 | } | |
9444 | } | |
9445 | else if (TREE_CODE (decl) != FUNCTION_DECL) | |
9446 | { | |
9447 | cp_error ("explicit instantiation of `%#D'", decl); | |
9448 | return; | |
9449 | } | |
9450 | else | |
9451 | result = decl; | |
9452 | ||
9453 | /* Check for various error cases. Note that if the explicit | |
9454 | instantiation is legal the RESULT will currently be marked as an | |
9455 | *implicit* instantiation; DECL_EXPLICIT_INSTANTIATION is not set | |
9456 | until we get here. */ | |
9457 | ||
9458 | if (DECL_TEMPLATE_SPECIALIZATION (result)) | |
9459 | { | |
9460 | /* [temp.spec] | |
9461 | ||
9462 | No program shall both explicitly instantiate and explicitly | |
9463 | specialize a template. */ | |
9464 | cp_pedwarn ("explicit instantiation of `%#D' after", result); | |
9465 | cp_pedwarn_at ("explicit specialization here", result); | |
9466 | return; | |
9467 | } | |
9468 | else if (DECL_EXPLICIT_INSTANTIATION (result)) | |
9469 | { | |
9470 | /* [temp.spec] | |
9471 | ||
9472 | No program shall explicitly instantiate any template more | |
9473 | than once. | |
9474 | ||
9475 | We check DECL_INTERFACE_KNOWN so as not to complain when the first | |
9476 | instantiation was `extern' and the second is not, and EXTERN_P for | |
9477 | the opposite case. If -frepo, chances are we already got marked | |
9478 | as an explicit instantiation because of the repo file. */ | |
9479 | if (DECL_INTERFACE_KNOWN (result) && !extern_p && !flag_use_repository) | |
9480 | cp_pedwarn ("duplicate explicit instantiation of `%#D'", result); | |
9481 | ||
9482 | /* If we've already instantiated the template, just return now. */ | |
9483 | if (DECL_INTERFACE_KNOWN (result)) | |
9484 | return; | |
9485 | } | |
9486 | else if (!DECL_IMPLICIT_INSTANTIATION (result)) | |
9487 | { | |
9488 | cp_error ("no matching template for `%D' found", result); | |
9489 | return; | |
9490 | } | |
9491 | else if (!DECL_TEMPLATE_INFO (result)) | |
9492 | { | |
9493 | cp_pedwarn ("explicit instantiation of non-template `%#D'", result); | |
9494 | return; | |
9495 | } | |
9496 | ||
9497 | if (flag_external_templates) | |
9498 | return; | |
9499 | ||
9500 | if (storage == NULL_TREE) | |
9501 | ; | |
9502 | else if (storage == ridpointers[(int) RID_EXTERN]) | |
9503 | { | |
9504 | if (pedantic) | |
9505 | cp_pedwarn ("ISO C++ forbids the use of `extern' on explicit instantiations"); | |
9506 | extern_p = 1; | |
9507 | } | |
9508 | else | |
9509 | cp_error ("storage class `%D' applied to template instantiation", | |
9510 | storage); | |
9511 | ||
9512 | SET_DECL_EXPLICIT_INSTANTIATION (result); | |
9513 | mark_decl_instantiated (result, extern_p); | |
9514 | repo_template_instantiated (result, extern_p); | |
9515 | if (! extern_p) | |
9516 | instantiate_decl (result, /*defer_ok=*/1); | |
9517 | } | |
9518 | ||
9519 | void | |
9520 | mark_class_instantiated (t, extern_p) | |
9521 | tree t; | |
9522 | int extern_p; | |
9523 | { | |
9524 | SET_CLASSTYPE_EXPLICIT_INSTANTIATION (t); | |
9525 | SET_CLASSTYPE_INTERFACE_KNOWN (t); | |
9526 | CLASSTYPE_INTERFACE_ONLY (t) = extern_p; | |
9527 | CLASSTYPE_VTABLE_NEEDS_WRITING (t) = ! extern_p; | |
9528 | TYPE_DECL_SUPPRESS_DEBUG (TYPE_NAME (t)) = extern_p; | |
9529 | if (! extern_p) | |
9530 | { | |
9531 | CLASSTYPE_DEBUG_REQUESTED (t) = 1; | |
9532 | rest_of_type_compilation (t, 1); | |
9533 | } | |
9534 | } | |
9535 | ||
9536 | /* Perform an explicit instantiation of template class T. STORAGE, if | |
9537 | non-null, is the RID for extern, inline or static. COMPLAIN is | |
9538 | non-zero if this is called from the parser, zero if called recursively, | |
9539 | since the standard is unclear (as detailed below). */ | |
9540 | ||
9541 | void | |
9542 | do_type_instantiation (t, storage, complain) | |
9543 | tree t, storage; | |
9544 | int complain; | |
9545 | { | |
9546 | int extern_p = 0; | |
9547 | int nomem_p = 0; | |
9548 | int static_p = 0; | |
9549 | ||
9550 | if (TREE_CODE (t) == TYPE_DECL) | |
9551 | t = TREE_TYPE (t); | |
9552 | ||
9553 | if (! CLASS_TYPE_P (t) || ! CLASSTYPE_TEMPLATE_INFO (t)) | |
9554 | { | |
9555 | cp_error ("explicit instantiation of non-template type `%T'", t); | |
9556 | return; | |
9557 | } | |
9558 | ||
9559 | complete_type (t); | |
9560 | ||
9561 | /* With -fexternal-templates, explicit instantiations are treated the same | |
9562 | as implicit ones. */ | |
9563 | if (flag_external_templates) | |
9564 | return; | |
9565 | ||
9566 | if (!COMPLETE_TYPE_P (t)) | |
9567 | { | |
9568 | if (complain) | |
9569 | cp_error ("explicit instantiation of `%#T' before definition of template", | |
9570 | t); | |
9571 | return; | |
9572 | } | |
9573 | ||
9574 | if (storage != NULL_TREE) | |
9575 | { | |
9576 | if (pedantic) | |
9577 | cp_pedwarn("ISO C++ forbids the use of `%s' on explicit instantiations", | |
9578 | IDENTIFIER_POINTER (storage)); | |
9579 | ||
9580 | if (storage == ridpointers[(int) RID_INLINE]) | |
9581 | nomem_p = 1; | |
9582 | else if (storage == ridpointers[(int) RID_EXTERN]) | |
9583 | extern_p = 1; | |
9584 | else if (storage == ridpointers[(int) RID_STATIC]) | |
9585 | static_p = 1; | |
9586 | else | |
9587 | { | |
9588 | cp_error ("storage class `%D' applied to template instantiation", | |
9589 | storage); | |
9590 | extern_p = 0; | |
9591 | } | |
9592 | } | |
9593 | ||
9594 | if (CLASSTYPE_TEMPLATE_SPECIALIZATION (t)) | |
9595 | { | |
9596 | /* [temp.spec] | |
9597 | ||
9598 | No program shall both explicitly instantiate and explicitly | |
9599 | specialize a template. */ | |
9600 | if (complain) | |
9601 | { | |
9602 | cp_error ("explicit instantiation of `%#T' after", t); | |
9603 | cp_error_at ("explicit specialization here", t); | |
9604 | } | |
9605 | return; | |
9606 | } | |
9607 | else if (CLASSTYPE_EXPLICIT_INSTANTIATION (t)) | |
9608 | { | |
9609 | /* [temp.spec] | |
9610 | ||
9611 | No program shall explicitly instantiate any template more | |
9612 | than once. | |
9613 | ||
9614 | If CLASSTYPE_INTERFACE_ONLY, then the first explicit instantiation | |
9615 | was `extern'. If EXTERN_P then the second is. If -frepo, chances | |
9616 | are we already got marked as an explicit instantion because of the | |
9617 | repo file. All these cases are OK. */ | |
9618 | if (!CLASSTYPE_INTERFACE_ONLY (t) && !extern_p && !flag_use_repository | |
9619 | && complain) | |
9620 | cp_pedwarn ("duplicate explicit instantiation of `%#T'", t); | |
9621 | ||
9622 | /* If we've already instantiated the template, just return now. */ | |
9623 | if (!CLASSTYPE_INTERFACE_ONLY (t)) | |
9624 | return; | |
9625 | } | |
9626 | ||
9627 | mark_class_instantiated (t, extern_p); | |
9628 | repo_template_instantiated (t, extern_p); | |
9629 | ||
9630 | if (nomem_p) | |
9631 | return; | |
9632 | ||
9633 | { | |
9634 | tree tmp; | |
9635 | ||
9636 | /* In contrast to implicit instantiation, where only the | |
9637 | declarations, and not the definitions, of members are | |
9638 | instantiated, we have here: | |
9639 | ||
9640 | [temp.explicit] | |
9641 | ||
9642 | The explicit instantiation of a class template specialization | |
9643 | implies the instantiation of all of its members not | |
9644 | previously explicitly specialized in the translation unit | |
9645 | containing the explicit instantiation. | |
9646 | ||
9647 | Of course, we can't instantiate member template classes, since | |
9648 | we don't have any arguments for them. Note that the standard | |
9649 | is unclear on whether the instantiation of the members are | |
9650 | *explicit* instantiations or not. We choose to be generous, | |
9651 | and not set DECL_EXPLICIT_INSTANTIATION. Therefore, we allow | |
9652 | the explicit instantiation of a class where some of the members | |
9653 | have no definition in the current translation unit. */ | |
9654 | ||
9655 | if (! static_p) | |
9656 | for (tmp = TYPE_METHODS (t); tmp; tmp = TREE_CHAIN (tmp)) | |
9657 | if (TREE_CODE (tmp) == FUNCTION_DECL | |
9658 | && DECL_TEMPLATE_INSTANTIATION (tmp)) | |
9659 | { | |
9660 | mark_decl_instantiated (tmp, extern_p); | |
9661 | repo_template_instantiated (tmp, extern_p); | |
9662 | if (! extern_p) | |
9663 | instantiate_decl (tmp, /*defer_ok=*/1); | |
9664 | } | |
9665 | ||
9666 | for (tmp = TYPE_FIELDS (t); tmp; tmp = TREE_CHAIN (tmp)) | |
9667 | if (TREE_CODE (tmp) == VAR_DECL && DECL_TEMPLATE_INSTANTIATION (tmp)) | |
9668 | { | |
9669 | mark_decl_instantiated (tmp, extern_p); | |
9670 | repo_template_instantiated (tmp, extern_p); | |
9671 | if (! extern_p) | |
9672 | instantiate_decl (tmp, /*defer_ok=*/1); | |
9673 | } | |
9674 | ||
9675 | for (tmp = CLASSTYPE_TAGS (t); tmp; tmp = TREE_CHAIN (tmp)) | |
9676 | if (IS_AGGR_TYPE (TREE_VALUE (tmp)) | |
9677 | && !uses_template_parms (CLASSTYPE_TI_ARGS (TREE_VALUE (tmp)))) | |
9678 | do_type_instantiation (TYPE_MAIN_DECL (TREE_VALUE (tmp)), storage, 0); | |
9679 | } | |
9680 | } | |
9681 | ||
9682 | /* Given a function DECL, which is a specialization of TMPL, modify | |
9683 | DECL to be a re-instantiation of TMPL with the same template | |
9684 | arguments. TMPL should be the template into which tsubst'ing | |
9685 | should occur for DECL, not the most general template. | |
9686 | ||
9687 | One reason for doing this is a scenario like this: | |
9688 | ||
9689 | template <class T> | |
9690 | void f(const T&, int i); | |
9691 | ||
9692 | void g() { f(3, 7); } | |
9693 | ||
9694 | template <class T> | |
9695 | void f(const T& t, const int i) { } | |
9696 | ||
9697 | Note that when the template is first instantiated, with | |
9698 | instantiate_template, the resulting DECL will have no name for the | |
9699 | first parameter, and the wrong type for the second. So, when we go | |
9700 | to instantiate the DECL, we regenerate it. */ | |
9701 | ||
9702 | static void | |
9703 | regenerate_decl_from_template (decl, tmpl) | |
9704 | tree decl; | |
9705 | tree tmpl; | |
9706 | { | |
9707 | /* The most general version of TMPL. */ | |
9708 | tree gen_tmpl; | |
9709 | /* The arguments used to instantiate DECL, from the most general | |
9710 | template. */ | |
9711 | tree args; | |
9712 | tree code_pattern; | |
9713 | tree new_decl; | |
9714 | int unregistered; | |
9715 | ||
9716 | args = DECL_TI_ARGS (decl); | |
9717 | code_pattern = DECL_TEMPLATE_RESULT (tmpl); | |
9718 | ||
9719 | /* Unregister the specialization so that when we tsubst we will not | |
9720 | just return DECL. We don't have to unregister DECL from TMPL | |
9721 | because if would only be registered there if it were a partial | |
9722 | instantiation of a specialization, which it isn't: it's a full | |
9723 | instantiation. */ | |
9724 | gen_tmpl = most_general_template (tmpl); | |
9725 | unregistered = unregister_specialization (decl, gen_tmpl); | |
9726 | ||
9727 | /* If the DECL was not unregistered then something peculiar is | |
9728 | happening: we created a specialization but did not call | |
9729 | register_specialization for it. */ | |
9730 | my_friendly_assert (unregistered, 0); | |
9731 | ||
9732 | if (TREE_CODE (decl) == VAR_DECL) | |
9733 | /* Make sure that we can see identifiers, and compute access | |
9734 | correctly, for the class members used in the declaration of | |
9735 | this static variable. */ | |
9736 | pushclass (DECL_CONTEXT (decl), 2); | |
9737 | ||
9738 | /* Do the substitution to get the new declaration. */ | |
9739 | new_decl = tsubst (code_pattern, args, /*complain=*/1, NULL_TREE); | |
9740 | ||
9741 | if (TREE_CODE (decl) == VAR_DECL) | |
9742 | { | |
9743 | /* Set up DECL_INITIAL, since tsubst doesn't. */ | |
9744 | DECL_INITIAL (new_decl) = | |
9745 | tsubst_expr (DECL_INITIAL (code_pattern), args, | |
9746 | /*complain=*/1, DECL_TI_TEMPLATE (decl)); | |
9747 | /* Pop the class context we pushed above. */ | |
9748 | popclass (); | |
9749 | } | |
9750 | else if (TREE_CODE (decl) == FUNCTION_DECL) | |
9751 | { | |
9752 | /* Convince duplicate_decls to use the DECL_ARGUMENTS from the | |
9753 | new decl. */ | |
9754 | DECL_INITIAL (new_decl) = error_mark_node; | |
9755 | /* And don't complain about a duplicate definition. */ | |
9756 | DECL_INITIAL (decl) = NULL_TREE; | |
9757 | } | |
9758 | ||
9759 | /* The immediate parent of the new template is still whatever it was | |
9760 | before, even though tsubst sets DECL_TI_TEMPLATE up as the most | |
9761 | general template. We also reset the DECL_ASSEMBLER_NAME since | |
9762 | tsubst always calculates the name as if the function in question | |
9763 | were really a template instance, and sometimes, with friend | |
9764 | functions, this is not so. See tsubst_friend_function for | |
9765 | details. */ | |
9766 | DECL_TI_TEMPLATE (new_decl) = DECL_TI_TEMPLATE (decl); | |
9767 | DECL_ASSEMBLER_NAME (new_decl) = DECL_ASSEMBLER_NAME (decl); | |
9768 | DECL_RTL (new_decl) = DECL_RTL (decl); | |
9769 | DECL_USE_TEMPLATE (new_decl) = DECL_USE_TEMPLATE (decl); | |
9770 | ||
9771 | /* Call duplicate decls to merge the old and new declarations. */ | |
9772 | duplicate_decls (new_decl, decl); | |
9773 | ||
9774 | /* Now, re-register the specialization. */ | |
9775 | register_specialization (decl, gen_tmpl, args); | |
9776 | } | |
9777 | ||
9778 | /* Produce the definition of D, a _DECL generated from a template. If | |
9779 | DEFER_OK is non-zero, then we don't have to actually do the | |
9780 | instantiation now; we just have to do it sometime. */ | |
9781 | ||
9782 | tree | |
9783 | instantiate_decl (d, defer_ok) | |
9784 | tree d; | |
9785 | int defer_ok; | |
9786 | { | |
9787 | tree tmpl = DECL_TI_TEMPLATE (d); | |
9788 | tree args = DECL_TI_ARGS (d); | |
9789 | tree td; | |
9790 | tree code_pattern; | |
9791 | tree spec; | |
9792 | tree gen_tmpl; | |
9793 | int pattern_defined; | |
9794 | int line = lineno; | |
9795 | int need_push; | |
9796 | const char *file = input_filename; | |
9797 | ||
9798 | /* This function should only be used to instantiate templates for | |
9799 | functions and static member variables. */ | |
9800 | my_friendly_assert (TREE_CODE (d) == FUNCTION_DECL | |
9801 | || TREE_CODE (d) == VAR_DECL, 0); | |
9802 | ||
9803 | /* Don't instantiate cloned functions. Instead, instantiate the | |
9804 | functions they cloned. */ | |
9805 | if (TREE_CODE (d) == FUNCTION_DECL && DECL_CLONED_FUNCTION_P (d)) | |
9806 | d = DECL_CLONED_FUNCTION (d); | |
9807 | ||
9808 | if (DECL_TEMPLATE_INSTANTIATED (d)) | |
9809 | /* D has already been instantiated. It might seem reasonable to | |
9810 | check whether or not D is an explicit instantiation, and, if so, | |
9811 | stop here. But when an explicit instantiation is deferred | |
9812 | until the end of the compilation, DECL_EXPLICIT_INSTANTIATION | |
9813 | is set, even though we still need to do the instantiation. */ | |
9814 | return d; | |
9815 | ||
9816 | /* If we already have a specialization of this declaration, then | |
9817 | there's no reason to instantiate it. Note that | |
9818 | retrieve_specialization gives us both instantiations and | |
9819 | specializations, so we must explicitly check | |
9820 | DECL_TEMPLATE_SPECIALIZATION. */ | |
9821 | gen_tmpl = most_general_template (tmpl); | |
9822 | spec = retrieve_specialization (gen_tmpl, args); | |
9823 | if (spec != NULL_TREE && DECL_TEMPLATE_SPECIALIZATION (spec)) | |
9824 | return spec; | |
9825 | ||
9826 | /* This needs to happen before any tsubsting. */ | |
9827 | if (! push_tinst_level (d)) | |
9828 | return d; | |
9829 | ||
9830 | timevar_push (TV_PARSE); | |
9831 | ||
9832 | /* Set TD to the template whose DECL_TEMPLATE_RESULT is the pattern | |
9833 | for the instantiation. This is not always the most general | |
9834 | template. Consider, for example: | |
9835 | ||
9836 | template <class T> | |
9837 | struct S { template <class U> void f(); | |
9838 | template <> void f<int>(); }; | |
9839 | ||
9840 | and an instantiation of S<double>::f<int>. We want TD to be the | |
9841 | specialization S<T>::f<int>, not the more general S<T>::f<U>. */ | |
9842 | td = tmpl; | |
9843 | while (/* An instantiation cannot have a definition, so we need a | |
9844 | more general template. */ | |
9845 | DECL_TEMPLATE_INSTANTIATION (td) | |
9846 | /* We must also deal with friend templates. Given: | |
9847 | ||
9848 | template <class T> struct S { | |
9849 | template <class U> friend void f() {}; | |
9850 | }; | |
9851 | ||
9852 | S<int>::f<U> say, is not an instantiation of S<T>::f<U>, | |
9853 | so far as the language is concerned, but that's still | |
9854 | where we get the pattern for the instantiation from. On | |
9855 | other hand, if the definition comes outside the class, say: | |
9856 | ||
9857 | template <class T> struct S { | |
9858 | template <class U> friend void f(); | |
9859 | }; | |
9860 | template <class U> friend void f() {} | |
9861 | ||
9862 | we don't need to look any further. That's what the check for | |
9863 | DECL_INITIAL is for. */ | |
9864 | || (TREE_CODE (d) == FUNCTION_DECL | |
9865 | && DECL_FRIEND_PSEUDO_TEMPLATE_INSTANTIATION (td) | |
9866 | && !DECL_INITIAL (DECL_TEMPLATE_RESULT (td)))) | |
9867 | { | |
9868 | /* The present template, TD, should not be a definition. If it | |
9869 | were a definition, we should be using it! Note that we | |
9870 | cannot restructure the loop to just keep going until we find | |
9871 | a template with a definition, since that might go too far if | |
9872 | a specialization was declared, but not defined. */ | |
9873 | my_friendly_assert (!(TREE_CODE (d) == VAR_DECL | |
9874 | && !DECL_IN_AGGR_P (DECL_TEMPLATE_RESULT (td))), | |
9875 | 0); | |
9876 | ||
9877 | /* Fetch the more general template. */ | |
9878 | td = DECL_TI_TEMPLATE (td); | |
9879 | } | |
9880 | ||
9881 | code_pattern = DECL_TEMPLATE_RESULT (td); | |
9882 | ||
9883 | if (TREE_CODE (d) == FUNCTION_DECL) | |
9884 | pattern_defined = (DECL_SAVED_TREE (code_pattern) != NULL_TREE); | |
9885 | else | |
9886 | pattern_defined = ! DECL_IN_AGGR_P (code_pattern); | |
9887 | ||
9888 | lineno = DECL_SOURCE_LINE (d); | |
9889 | input_filename = DECL_SOURCE_FILE (d); | |
9890 | ||
9891 | if (pattern_defined) | |
9892 | { | |
9893 | repo_template_used (d); | |
9894 | ||
9895 | if (flag_external_templates && ! DECL_INTERFACE_KNOWN (d)) | |
9896 | { | |
9897 | if (flag_alt_external_templates) | |
9898 | { | |
9899 | if (interface_unknown) | |
9900 | warn_if_unknown_interface (d); | |
9901 | } | |
9902 | else if (DECL_INTERFACE_KNOWN (code_pattern)) | |
9903 | { | |
9904 | DECL_INTERFACE_KNOWN (d) = 1; | |
9905 | DECL_NOT_REALLY_EXTERN (d) = ! DECL_EXTERNAL (code_pattern); | |
9906 | } | |
9907 | else | |
9908 | warn_if_unknown_interface (code_pattern); | |
9909 | } | |
9910 | ||
9911 | if (at_eof) | |
9912 | import_export_decl (d); | |
9913 | } | |
9914 | ||
9915 | /* We need to set up DECL_INITIAL regardless, if | |
9916 | the variable is initialized in the class body. */ | |
9917 | if (TREE_CODE (d) == VAR_DECL && DECL_INITIALIZED_IN_CLASS_P (d)) | |
9918 | ; | |
9919 | /* Reject all external templates except inline functions. */ | |
9920 | else if (DECL_INTERFACE_KNOWN (d) | |
9921 | && ! DECL_NOT_REALLY_EXTERN (d) | |
9922 | && ! (TREE_CODE (d) == FUNCTION_DECL && DECL_INLINE (d))) | |
9923 | goto out; | |
9924 | /* Defer all other templates, unless we have been explicitly | |
9925 | forbidden from doing so. We restore the source position here | |
9926 | because it's used by add_pending_template. */ | |
9927 | else if (! pattern_defined || defer_ok) | |
9928 | { | |
9929 | lineno = line; | |
9930 | input_filename = file; | |
9931 | ||
9932 | if (at_eof && !pattern_defined | |
9933 | && DECL_EXPLICIT_INSTANTIATION (d)) | |
9934 | /* [temp.explicit] | |
9935 | ||
9936 | The definition of a non-exported function template, a | |
9937 | non-exported member function template, or a non-exported | |
9938 | member function or static data member of a class template | |
9939 | shall be present in every translation unit in which it is | |
9940 | explicitly instantiated. */ | |
9941 | cp_error ("explicit instantiation of `%D' but no definition available", | |
9942 | d); | |
9943 | ||
9944 | add_pending_template (d); | |
9945 | goto out; | |
9946 | } | |
9947 | ||
9948 | need_push = !global_bindings_p (); | |
9949 | if (need_push) | |
9950 | push_to_top_level (); | |
9951 | ||
9952 | /* We're now committed to instantiating this template. Mark it as | |
9953 | instantiated so that recursive calls to instantiate_decl do not | |
9954 | try to instantiate it again. */ | |
9955 | DECL_TEMPLATE_INSTANTIATED (d) = 1; | |
9956 | ||
9957 | /* Regenerate the declaration in case the template has been modified | |
9958 | by a subsequent redeclaration. */ | |
9959 | regenerate_decl_from_template (d, td); | |
9960 | ||
9961 | /* We already set the file and line above. Reset them now in case | |
9962 | they changed as a result of calling regenerate_decl_from_template. */ | |
9963 | lineno = DECL_SOURCE_LINE (d); | |
9964 | input_filename = DECL_SOURCE_FILE (d); | |
9965 | ||
9966 | if (TREE_CODE (d) == VAR_DECL) | |
9967 | { | |
9968 | DECL_IN_AGGR_P (d) = 0; | |
9969 | if (DECL_INTERFACE_KNOWN (d)) | |
9970 | DECL_EXTERNAL (d) = ! DECL_NOT_REALLY_EXTERN (d); | |
9971 | else | |
9972 | { | |
9973 | DECL_EXTERNAL (d) = 1; | |
9974 | DECL_NOT_REALLY_EXTERN (d) = 1; | |
9975 | } | |
9976 | cp_finish_decl (d, DECL_INITIAL (d), NULL_TREE, 0); | |
9977 | } | |
9978 | else if (TREE_CODE (d) == FUNCTION_DECL) | |
9979 | { | |
9980 | htab_t saved_local_specializations; | |
9981 | ||
9982 | /* Save away the current list, in case we are instantiating one | |
9983 | template from within the body of another. */ | |
9984 | saved_local_specializations = local_specializations; | |
9985 | ||
9986 | /* Set up the list of local specializations. */ | |
9987 | local_specializations = htab_create (37, | |
9988 | htab_hash_pointer, | |
9989 | htab_eq_pointer, | |
9990 | NULL); | |
9991 | ||
9992 | /* Set up context. */ | |
9993 | start_function (NULL_TREE, d, NULL_TREE, SF_PRE_PARSED); | |
9994 | ||
9995 | /* We already set up __FUNCTION__, etc., so we don't want to do | |
9996 | it again now. */ | |
9997 | function_name_declared_p = 1; | |
9998 | ||
9999 | /* Substitute into the body of the function. */ | |
10000 | tsubst_expr (DECL_SAVED_TREE (code_pattern), args, | |
10001 | /*complain=*/1, tmpl); | |
10002 | ||
10003 | /* We don't need the local specializations any more. */ | |
10004 | htab_delete (local_specializations); | |
10005 | local_specializations = saved_local_specializations; | |
10006 | ||
10007 | /* Finish the function. */ | |
10008 | expand_body (finish_function (0)); | |
10009 | } | |
10010 | ||
10011 | /* We're not deferring instantiation any more. */ | |
10012 | TI_PENDING_TEMPLATE_FLAG (DECL_TEMPLATE_INFO (d)) = 0; | |
10013 | ||
10014 | if (need_push) | |
10015 | pop_from_top_level (); | |
10016 | ||
10017 | out: | |
10018 | lineno = line; | |
10019 | input_filename = file; | |
10020 | ||
10021 | pop_tinst_level (); | |
10022 | ||
10023 | timevar_pop (TV_PARSE); | |
10024 | ||
10025 | return d; | |
10026 | } | |
10027 | ||
10028 | /* Run through the list of templates that we wish we could | |
10029 | instantiate, and instantiate any we can. */ | |
10030 | ||
10031 | int | |
10032 | instantiate_pending_templates () | |
10033 | { | |
10034 | tree *t; | |
10035 | int instantiated_something = 0; | |
10036 | int reconsider; | |
10037 | ||
10038 | do | |
10039 | { | |
10040 | reconsider = 0; | |
10041 | ||
10042 | t = &pending_templates; | |
10043 | while (*t) | |
10044 | { | |
10045 | tree instantiation = TREE_VALUE (*t); | |
10046 | ||
10047 | reopen_tinst_level (TREE_PURPOSE (*t)); | |
10048 | ||
10049 | if (TYPE_P (instantiation)) | |
10050 | { | |
10051 | tree fn; | |
10052 | ||
10053 | if (!COMPLETE_TYPE_P (instantiation)) | |
10054 | { | |
10055 | instantiate_class_template (instantiation); | |
10056 | if (CLASSTYPE_TEMPLATE_INSTANTIATION (instantiation)) | |
10057 | for (fn = TYPE_METHODS (instantiation); | |
10058 | fn; | |
10059 | fn = TREE_CHAIN (fn)) | |
10060 | if (! DECL_ARTIFICIAL (fn)) | |
10061 | instantiate_decl (fn, /*defer_ok=*/0); | |
10062 | if (COMPLETE_TYPE_P (instantiation)) | |
10063 | { | |
10064 | instantiated_something = 1; | |
10065 | reconsider = 1; | |
10066 | } | |
10067 | } | |
10068 | ||
10069 | if (COMPLETE_TYPE_P (instantiation)) | |
10070 | /* If INSTANTIATION has been instantiated, then we don't | |
10071 | need to consider it again in the future. */ | |
10072 | *t = TREE_CHAIN (*t); | |
10073 | else | |
10074 | t = &TREE_CHAIN (*t); | |
10075 | } | |
10076 | else | |
10077 | { | |
10078 | if (!DECL_TEMPLATE_SPECIALIZATION (instantiation) | |
10079 | && !DECL_TEMPLATE_INSTANTIATED (instantiation)) | |
10080 | { | |
10081 | instantiation = instantiate_decl (instantiation, | |
10082 | /*defer_ok=*/0); | |
10083 | if (DECL_TEMPLATE_INSTANTIATED (instantiation)) | |
10084 | { | |
10085 | instantiated_something = 1; | |
10086 | reconsider = 1; | |
10087 | } | |
10088 | } | |
10089 | ||
10090 | if (DECL_TEMPLATE_SPECIALIZATION (instantiation) | |
10091 | || DECL_TEMPLATE_INSTANTIATED (instantiation)) | |
10092 | /* If INSTANTIATION has been instantiated, then we don't | |
10093 | need to consider it again in the future. */ | |
10094 | *t = TREE_CHAIN (*t); | |
10095 | else | |
10096 | t = &TREE_CHAIN (*t); | |
10097 | } | |
10098 | tinst_depth = 0; | |
10099 | current_tinst_level = NULL_TREE; | |
10100 | } | |
10101 | template_tail = t; | |
10102 | ||
10103 | /* Go through the things that are template instantiations if we are | |
10104 | using guiding declarations. */ | |
10105 | t = &maybe_templates; | |
10106 | while (*t) | |
10107 | { | |
10108 | tree template; | |
10109 | tree fn; | |
10110 | tree args; | |
10111 | ||
10112 | fn = TREE_VALUE (*t); | |
10113 | ||
10114 | if (DECL_INITIAL (fn)) | |
10115 | /* If the FN is already defined, then it was either already | |
10116 | instantiated or, even though guiding declarations were | |
10117 | allowed, a non-template definition was provided. */ | |
10118 | ; | |
10119 | else | |
10120 | { | |
10121 | template = TREE_PURPOSE (*t); | |
10122 | args = get_bindings (template, fn, NULL_TREE); | |
10123 | fn = instantiate_template (template, args); | |
10124 | instantiate_decl (fn, /*defer_ok=*/0); | |
10125 | reconsider = 1; | |
10126 | } | |
10127 | ||
10128 | /* Remove this entry from the chain. */ | |
10129 | *t = TREE_CHAIN (*t); | |
10130 | } | |
10131 | maybe_template_tail = t; | |
10132 | } | |
10133 | while (reconsider); | |
10134 | ||
10135 | return instantiated_something; | |
10136 | } | |
10137 | ||
10138 | /* Substitute ARGVEC into T, which is a list of initializers for | |
10139 | either base class or a non-static data member. The TREE_PURPOSEs | |
10140 | are DECLs, and the TREE_VALUEs are the initializer values. Used by | |
10141 | instantiate_decl. */ | |
10142 | ||
10143 | static tree | |
10144 | tsubst_initializer_list (t, argvec) | |
10145 | tree t, argvec; | |
10146 | { | |
10147 | tree first = NULL_TREE; | |
10148 | tree *p = &first; | |
10149 | ||
10150 | for (; t; t = TREE_CHAIN (t)) | |
10151 | { | |
10152 | tree decl; | |
10153 | tree init; | |
10154 | tree val; | |
10155 | ||
10156 | decl = tsubst_copy (TREE_PURPOSE (t), argvec, /*complain=*/1, | |
10157 | NULL_TREE); | |
10158 | init = tsubst_expr (TREE_VALUE (t), argvec, /*complain=*/1, | |
10159 | NULL_TREE); | |
10160 | ||
10161 | if (!init) | |
10162 | ; | |
10163 | else if (TREE_CODE (init) == TREE_LIST) | |
10164 | for (val = init; val; val = TREE_CHAIN (val)) | |
10165 | TREE_VALUE (val) = convert_from_reference (TREE_VALUE (val)); | |
10166 | else | |
10167 | init = convert_from_reference (init); | |
10168 | ||
10169 | *p = build_tree_list (decl, init); | |
10170 | p = &TREE_CHAIN (*p); | |
10171 | } | |
10172 | return first; | |
10173 | } | |
10174 | ||
10175 | /* Set CURRENT_ACCESS_SPECIFIER based on the protection of DECL. */ | |
10176 | ||
10177 | static void | |
10178 | set_current_access_from_decl (decl) | |
10179 | tree decl; | |
10180 | { | |
10181 | if (TREE_PRIVATE (decl)) | |
10182 | current_access_specifier = access_private_node; | |
10183 | else if (TREE_PROTECTED (decl)) | |
10184 | current_access_specifier = access_protected_node; | |
10185 | else | |
10186 | current_access_specifier = access_public_node; | |
10187 | } | |
10188 | ||
10189 | /* Instantiate an enumerated type. TAG is the template type, NEWTAG | |
10190 | is the instantiation (which should have been created with | |
10191 | start_enum) and ARGS are the template arguments to use. */ | |
10192 | ||
10193 | static void | |
10194 | tsubst_enum (tag, newtag, args) | |
10195 | tree tag; | |
10196 | tree newtag; | |
10197 | tree args; | |
10198 | { | |
10199 | tree e; | |
10200 | ||
10201 | for (e = TYPE_VALUES (tag); e; e = TREE_CHAIN (e)) | |
10202 | { | |
10203 | tree value; | |
10204 | ||
10205 | /* Note that in a template enum, the TREE_VALUE is the | |
10206 | CONST_DECL, not the corresponding INTEGER_CST. */ | |
10207 | value = tsubst_expr (DECL_INITIAL (TREE_VALUE (e)), | |
10208 | args, /*complain=*/1, | |
10209 | NULL_TREE); | |
10210 | ||
10211 | /* Give this enumeration constant the correct access. */ | |
10212 | set_current_access_from_decl (TREE_VALUE (e)); | |
10213 | ||
10214 | /* Actually build the enumerator itself. */ | |
10215 | build_enumerator (TREE_PURPOSE (e), value, newtag); | |
10216 | } | |
10217 | ||
10218 | finish_enum (newtag); | |
10219 | DECL_SOURCE_LINE (TYPE_NAME (newtag)) = DECL_SOURCE_LINE (TYPE_NAME (tag)); | |
10220 | DECL_SOURCE_FILE (TYPE_NAME (newtag)) = DECL_SOURCE_FILE (TYPE_NAME (tag)); | |
10221 | } | |
10222 | ||
10223 | /* DECL is a FUNCTION_DECL that is a template specialization. Return | |
10224 | its type -- but without substituting the innermost set of template | |
10225 | arguments. So, innermost set of template parameters will appear in | |
10226 | the type. If CONTEXTP is non-NULL, then the partially substituted | |
10227 | DECL_CONTEXT (if any) will also be filled in. Similarly, TPARMSP | |
10228 | will be filled in with the substituted template parameters, if it | |
10229 | is non-NULL. */ | |
10230 | ||
10231 | tree | |
10232 | get_mostly_instantiated_function_type (decl, contextp, tparmsp) | |
10233 | tree decl; | |
10234 | tree *contextp; | |
10235 | tree *tparmsp; | |
10236 | { | |
10237 | tree context = NULL_TREE; | |
10238 | tree fn_type; | |
10239 | tree tmpl; | |
10240 | tree targs; | |
10241 | tree tparms; | |
10242 | int parm_depth; | |
10243 | ||
10244 | tmpl = most_general_template (DECL_TI_TEMPLATE (decl)); | |
10245 | targs = DECL_TI_ARGS (decl); | |
10246 | tparms = DECL_TEMPLATE_PARMS (tmpl); | |
10247 | parm_depth = TMPL_PARMS_DEPTH (tparms); | |
10248 | ||
10249 | /* There should be as many levels of arguments as there are levels | |
10250 | of parameters. */ | |
10251 | my_friendly_assert (parm_depth == TMPL_ARGS_DEPTH (targs), 0); | |
10252 | ||
10253 | fn_type = TREE_TYPE (tmpl); | |
10254 | if (DECL_STATIC_FUNCTION_P (decl)) | |
10255 | context = DECL_CONTEXT (decl); | |
10256 | ||
10257 | if (parm_depth == 1) | |
10258 | /* No substitution is necessary. */ | |
10259 | ; | |
10260 | else | |
10261 | { | |
10262 | int i; | |
10263 | tree partial_args; | |
10264 | ||
10265 | /* Replace the innermost level of the TARGS with NULL_TREEs to | |
10266 | let tsubst know not to substitute for those parameters. */ | |
10267 | partial_args = make_tree_vec (TREE_VEC_LENGTH (targs)); | |
10268 | for (i = 1; i < TMPL_ARGS_DEPTH (targs); ++i) | |
10269 | SET_TMPL_ARGS_LEVEL (partial_args, i, | |
10270 | TMPL_ARGS_LEVEL (targs, i)); | |
10271 | SET_TMPL_ARGS_LEVEL (partial_args, | |
10272 | TMPL_ARGS_DEPTH (targs), | |
10273 | make_tree_vec (DECL_NTPARMS (tmpl))); | |
10274 | ||
10275 | /* Now, do the (partial) substitution to figure out the | |
10276 | appropriate function type. */ | |
10277 | fn_type = tsubst (fn_type, partial_args, /*complain=*/1, NULL_TREE); | |
10278 | if (DECL_STATIC_FUNCTION_P (decl)) | |
10279 | context = tsubst (context, partial_args, /*complain=*/1, NULL_TREE); | |
10280 | ||
10281 | /* Substitute into the template parameters to obtain the real | |
10282 | innermost set of parameters. This step is important if the | |
10283 | innermost set of template parameters contains value | |
10284 | parameters whose types depend on outer template parameters. */ | |
10285 | TREE_VEC_LENGTH (partial_args)--; | |
10286 | tparms = tsubst_template_parms (tparms, partial_args, /*complain=*/1); | |
10287 | } | |
10288 | ||
10289 | if (contextp) | |
10290 | *contextp = context; | |
10291 | if (tparmsp) | |
10292 | *tparmsp = tparms; | |
10293 | ||
10294 | return fn_type; | |
10295 | } | |
10296 | ||
10297 | /* Set the DECL_ASSEMBLER_NAME for DECL, which is a FUNCTION_DECL that | |
10298 | is either an instantiation or specialization of a template | |
10299 | function. */ | |
10300 | ||
10301 | static void | |
10302 | set_mangled_name_for_template_decl (decl) | |
10303 | tree decl; | |
10304 | { | |
10305 | my_friendly_assert (TREE_CODE (decl) == FUNCTION_DECL, 0); | |
10306 | my_friendly_assert (DECL_TEMPLATE_INFO (decl) != NULL_TREE, 0); | |
10307 | ||
10308 | /* Under the new ABI, we don't need special machinery. */ | |
10309 | set_mangled_name_for_decl (decl); | |
10310 | } | |
10311 | ||
10312 | /* Return truthvalue if we're processing a template different from | |
10313 | the last one involved in diagnostics. */ | |
10314 | int | |
10315 | problematic_instantiation_changed () | |
10316 | { | |
10317 | return last_template_error_tick != tinst_level_tick; | |
10318 | } | |
10319 | ||
10320 | /* Remember current template involved in diagnostics. */ | |
10321 | void | |
10322 | record_last_problematic_instantiation () | |
10323 | { | |
10324 | last_template_error_tick = tinst_level_tick; | |
10325 | } | |
10326 | ||
10327 | tree | |
10328 | current_instantiation () | |
10329 | { | |
10330 | return current_tinst_level; | |
10331 | } | |
10332 | ||
10333 | /* [temp.param] Check that template non-type parm TYPE is of an allowable | |
10334 | type. Return zero for ok, non-zero for disallowed. If COMPLAIN is | |
10335 | non-zero, then complain. */ | |
10336 | ||
10337 | static int | |
10338 | invalid_nontype_parm_type_p (type, complain) | |
10339 | tree type; | |
10340 | int complain; | |
10341 | { | |
10342 | if (INTEGRAL_TYPE_P (type)) | |
10343 | return 0; | |
10344 | else if (POINTER_TYPE_P (type)) | |
10345 | return 0; | |
10346 | else if (TYPE_PTRMEM_P (type)) | |
10347 | return 0; | |
10348 | else if (TYPE_PTRMEMFUNC_P (type)) | |
10349 | return 0; | |
10350 | else if (TREE_CODE (type) == TEMPLATE_TYPE_PARM) | |
10351 | return 0; | |
10352 | else if (TREE_CODE (type) == TYPENAME_TYPE) | |
10353 | return 0; | |
10354 | ||
10355 | if (complain) | |
10356 | cp_error ("`%#T' is not a valid type for a template constant parameter", | |
10357 | type); | |
10358 | return 1; | |
10359 | } |