]>
Commit | Line | Data |
---|---|---|
8d08fdba | 1 | /* Handle parameterized types (templates) for GNU C++. |
3febd123 | 2 | Copyright (C) 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000, |
cc23546e | 3 | 2001, 2002, 2003 Free Software Foundation, Inc. |
8d08fdba | 4 | Written by Ken Raeburn (raeburn@cygnus.com) while at Watchmaker Computing. |
fc378698 | 5 | Rewritten by Jason Merrill (jason@cygnus.com). |
8d08fdba | 6 | |
f5adbb8d | 7 | This file is part of GCC. |
8d08fdba | 8 | |
f5adbb8d | 9 | GCC is free software; you can redistribute it and/or modify |
8d08fdba MS |
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 | ||
f5adbb8d | 14 | GCC is distributed in the hope that it will be useful, |
8d08fdba MS |
15 | but WITHOUT ANY WARRANTY; without even the implied warranty of |
16 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
17 | GNU General Public License for more details. | |
18 | ||
19 | You should have received a copy of the GNU General Public License | |
f5adbb8d | 20 | along with GCC; see the file COPYING. If not, write to |
e9fa0c7c RK |
21 | the Free Software Foundation, 59 Temple Place - Suite 330, |
22 | Boston, MA 02111-1307, USA. */ | |
8d08fdba MS |
23 | |
24 | /* Known bugs or deficiencies include: | |
e92cc029 | 25 | |
e92cc029 MS |
26 | all methods must be provided in header files; can't use a source |
27 | file that contains only the method templates and "just win". */ | |
8d08fdba MS |
28 | |
29 | #include "config.h" | |
8d052bc7 | 30 | #include "system.h" |
4977bab6 ZW |
31 | #include "coretypes.h" |
32 | #include "tm.h" | |
8d08fdba | 33 | #include "obstack.h" |
8d08fdba MS |
34 | #include "tree.h" |
35 | #include "flags.h" | |
36 | #include "cp-tree.h" | |
25af8512 | 37 | #include "tree-inline.h" |
8d08fdba | 38 | #include "decl.h" |
f0e01782 | 39 | #include "lex.h" |
e8abc66f | 40 | #include "output.h" |
49c249e1 | 41 | #include "except.h" |
54f92bfb | 42 | #include "toplev.h" |
3dcaad8b | 43 | #include "rtl.h" |
297a5329 | 44 | #include "timevar.h" |
49c249e1 | 45 | |
050367a3 MM |
46 | /* The type of functions taking a tree, and some additional data, and |
47 | returning an int. */ | |
3a978d72 | 48 | typedef int (*tree_fn_t) (tree, void*); |
050367a3 | 49 | |
0aafb128 MM |
50 | /* The PENDING_TEMPLATES is a TREE_LIST of templates whose |
51 | instantiations have been deferred, either because their definitions | |
d78e771d ZW |
52 | were not yet available, or because we were putting off doing the work. |
53 | The TREE_PURPOSE of each entry is either a DECL (for a function or | |
54 | static data member), or a TYPE (for a class) indicating what we are | |
55 | hoping to instantiate. The TREE_VALUE is not used. */ | |
e2500fed | 56 | static GTY(()) tree pending_templates; |
13e73b29 | 57 | static GTY(()) tree last_pending_template; |
73aad9b9 | 58 | |
67ffc812 | 59 | int processing_template_parmlist; |
386b8a85 JM |
60 | static int template_header_count; |
61 | ||
e2500fed GK |
62 | static GTY(()) tree saved_trees; |
63 | static GTY(()) varray_type inline_parm_levels; | |
3dcaad8b | 64 | static size_t inline_parm_levels_used; |
75650646 | 65 | |
e2500fed | 66 | static GTY(()) tree current_tinst_level; |
3ae18eaf | 67 | |
2b59fc25 KL |
68 | static GTY(()) tree saved_access_scope; |
69 | ||
6dfbb909 MM |
70 | /* A map from local variable declarations in the body of the template |
71 | presently being instantiated to the corresponding instantiated | |
72 | local variables. */ | |
73 | static htab_t local_specializations; | |
74 | ||
830bfa74 MM |
75 | #define UNIFY_ALLOW_NONE 0 |
76 | #define UNIFY_ALLOW_MORE_CV_QUAL 1 | |
77 | #define UNIFY_ALLOW_LESS_CV_QUAL 2 | |
78 | #define UNIFY_ALLOW_DERIVED 4 | |
161c12b0 | 79 | #define UNIFY_ALLOW_INTEGER 8 |
028d1f20 | 80 | #define UNIFY_ALLOW_OUTER_LEVEL 16 |
62e4a758 NS |
81 | #define UNIFY_ALLOW_OUTER_MORE_CV_QUAL 32 |
82 | #define UNIFY_ALLOW_OUTER_LESS_CV_QUAL 64 | |
d9f818d9 | 83 | #define UNIFY_ALLOW_MAX_CORRECTION 128 |
830bfa74 | 84 | |
4393e105 MM |
85 | #define GTB_VIA_VIRTUAL 1 /* The base class we are examining is |
86 | virtual, or a base class of a virtual | |
87 | base. */ | |
88 | #define GTB_IGNORE_TYPE 2 /* We don't need to try to unify the current | |
89 | type with the desired type. */ | |
90 | ||
3a978d72 NN |
91 | static void push_access_scope (tree); |
92 | static void pop_access_scope (tree); | |
93 | static int resolve_overloaded_unification (tree, tree, tree, tree, | |
94 | unification_kind_t, int); | |
95 | static int try_one_overload (tree, tree, tree, tree, tree, | |
96 | unification_kind_t, int); | |
97 | static int unify (tree, tree, tree, tree, int); | |
98 | static void add_pending_template (tree); | |
99 | static void reopen_tinst_level (tree); | |
100 | static tree classtype_mangled_name (tree); | |
101 | static char* mangle_class_name_for_template (const char *, tree, tree); | |
102 | static tree tsubst_initializer_list (tree, tree); | |
3a978d72 NN |
103 | static tree get_class_bindings (tree, tree, tree); |
104 | static tree coerce_template_parms (tree, tree, tree, tsubst_flags_t, int); | |
105 | static void tsubst_enum (tree, tree, tree); | |
106 | static tree add_to_template_args (tree, tree); | |
107 | static tree add_outermost_template_args (tree, tree); | |
108 | static bool check_instantiated_args (tree, tree, tsubst_flags_t); | |
109 | static int maybe_adjust_types_for_deduction (unification_kind_t, tree*, tree*); | |
110 | static int type_unification_real (tree, tree, tree, tree, | |
111 | int, unification_kind_t, int, int); | |
112 | static void note_template_header (int); | |
3a978d72 NN |
113 | static tree convert_nontype_argument (tree, tree); |
114 | static tree convert_template_argument (tree, tree, tree, | |
115 | tsubst_flags_t, int, tree); | |
116 | static tree get_bindings_overload (tree, tree, tree); | |
117 | static int for_each_template_parm (tree, tree_fn_t, void*, htab_t); | |
118 | static tree build_template_parm_index (int, int, int, tree, tree); | |
119 | static int inline_needs_template_parms (tree); | |
120 | static void push_inline_template_parms_recursive (tree, int); | |
121 | static tree retrieve_specialization (tree, tree); | |
122 | static tree retrieve_local_specialization (tree); | |
123 | static tree register_specialization (tree, tree, tree); | |
124 | static void register_local_specialization (tree, tree); | |
3a978d72 NN |
125 | static tree reduce_template_parm_level (tree, tree, int); |
126 | static tree build_template_decl (tree, tree); | |
127 | static int mark_template_parm (tree, void *); | |
128 | static int template_parm_this_level_p (tree, void *); | |
129 | static tree tsubst_friend_function (tree, tree); | |
130 | static tree tsubst_friend_class (tree, tree); | |
131 | static int can_complete_type_without_circularity (tree); | |
10b1d5e7 | 132 | static tree get_bindings (tree, tree, tree); |
3a978d72 NN |
133 | static tree get_bindings_real (tree, tree, tree, int, int, int); |
134 | static int template_decl_level (tree); | |
135 | static int check_cv_quals_for_unify (int, tree, tree); | |
a91db711 NS |
136 | static tree tsubst_template_arg (tree, tree, tsubst_flags_t, tree); |
137 | static tree tsubst_template_args (tree, tree, tsubst_flags_t, tree); | |
3a978d72 NN |
138 | static tree tsubst_template_parms (tree, tree, tsubst_flags_t); |
139 | static void regenerate_decl_from_template (tree, tree); | |
140 | static tree most_specialized (tree, tree, tree); | |
141 | static tree most_specialized_class (tree, tree); | |
142 | static int template_class_depth_real (tree, int); | |
143 | static tree tsubst_aggr_type (tree, tree, tsubst_flags_t, tree, int); | |
144 | static tree tsubst_decl (tree, tree, tree, tsubst_flags_t); | |
145 | static tree tsubst_arg_types (tree, tree, tsubst_flags_t, tree); | |
146 | static tree tsubst_function_type (tree, tree, tsubst_flags_t, tree); | |
147 | static void check_specialization_scope (void); | |
148 | static tree process_partial_specialization (tree); | |
149 | static void set_current_access_from_decl (tree); | |
150 | static void check_default_tmpl_args (tree, tree, int, int); | |
151 | static tree tsubst_call_declarator_parms (tree, tree, tsubst_flags_t, tree); | |
152 | static tree get_template_base_recursive (tree, tree, tree, tree, tree, int); | |
153 | static tree get_template_base (tree, tree, tree, tree); | |
154 | static int verify_class_unification (tree, tree, tree); | |
155 | static tree try_class_unification (tree, tree, tree, tree); | |
156 | static int coerce_template_template_parms (tree, tree, tsubst_flags_t, | |
157 | tree, tree); | |
158 | static tree determine_specialization (tree, tree, tree *, int); | |
159 | static int template_args_equal (tree, tree); | |
160 | static void tsubst_default_arguments (tree); | |
161 | static tree for_each_template_parm_r (tree *, int *, void *); | |
162 | static tree copy_default_args_to_explicit_spec_1 (tree, tree); | |
163 | static void copy_default_args_to_explicit_spec (tree); | |
164 | static int invalid_nontype_parm_type_p (tree, tsubst_flags_t); | |
a723baf1 | 165 | static int eq_local_specializations (const void *, const void *); |
5552b43c | 166 | static bool dependent_type_p_r (tree); |
14d22dd6 MM |
167 | static tree tsubst (tree, tree, tsubst_flags_t, tree); |
168 | static tree tsubst_expr (tree, tree, tsubst_flags_t, tree); | |
169 | static tree tsubst_copy (tree, tree, tsubst_flags_t, tree); | |
36a117a5 | 170 | |
2b59fc25 KL |
171 | /* Make the current scope suitable for access checking when we are |
172 | processing T. T can be FUNCTION_DECL for instantiated function | |
2b907f5c KL |
173 | template, or VAR_DECL for static member variable (need by |
174 | instantiate_decl). */ | |
2b59fc25 | 175 | |
8ce33230 | 176 | static void |
2b907f5c | 177 | push_access_scope (tree t) |
2b59fc25 | 178 | { |
2b907f5c KL |
179 | my_friendly_assert (TREE_CODE (t) == FUNCTION_DECL |
180 | || TREE_CODE (t) == VAR_DECL, | |
181 | 0); | |
2b59fc25 | 182 | |
2b907f5c KL |
183 | if (DECL_CLASS_SCOPE_P (t)) |
184 | push_nested_class (DECL_CONTEXT (t)); | |
0f399e5f KL |
185 | else |
186 | push_to_top_level (); | |
187 | ||
2b907f5c | 188 | if (TREE_CODE (t) == FUNCTION_DECL) |
0f399e5f KL |
189 | { |
190 | saved_access_scope = tree_cons | |
191 | (NULL_TREE, current_function_decl, saved_access_scope); | |
192 | current_function_decl = t; | |
193 | } | |
2b59fc25 KL |
194 | } |
195 | ||
2b59fc25 KL |
196 | /* Restore the scope set up by push_access_scope. T is the node we |
197 | are processing. */ | |
198 | ||
8ce33230 | 199 | static void |
3a978d72 | 200 | pop_access_scope (tree t) |
2b59fc25 | 201 | { |
2b907f5c | 202 | if (TREE_CODE (t) == FUNCTION_DECL) |
2b59fc25 KL |
203 | { |
204 | current_function_decl = TREE_VALUE (saved_access_scope); | |
205 | saved_access_scope = TREE_CHAIN (saved_access_scope); | |
206 | } | |
0f399e5f KL |
207 | |
208 | if (DECL_CLASS_SCOPE_P (t)) | |
209 | pop_nested_class (); | |
210 | else | |
211 | pop_from_top_level (); | |
2b59fc25 KL |
212 | } |
213 | ||
a723baf1 MM |
214 | /* Do any processing required when DECL (a member template |
215 | declaration) is finished. Returns the TEMPLATE_DECL corresponding | |
216 | to DECL, unless it is a specialization, in which case the DECL | |
217 | itself is returned. */ | |
e1467ff2 MM |
218 | |
219 | tree | |
3a978d72 | 220 | finish_member_template_decl (tree decl) |
e1467ff2 | 221 | { |
a723baf1 MM |
222 | if (decl == error_mark_node) |
223 | return error_mark_node; | |
224 | ||
225 | my_friendly_assert (DECL_P (decl), 20020812); | |
226 | ||
227 | if (TREE_CODE (decl) == TYPE_DECL) | |
93cdc044 | 228 | { |
a723baf1 MM |
229 | tree type; |
230 | ||
231 | type = TREE_TYPE (decl); | |
232 | if (IS_AGGR_TYPE (type) | |
233 | && CLASSTYPE_TEMPLATE_INFO (type) | |
234 | && !CLASSTYPE_TEMPLATE_SPECIALIZATION (type)) | |
93cdc044 | 235 | { |
a723baf1 | 236 | tree tmpl = CLASSTYPE_TI_TEMPLATE (type); |
93cdc044 JM |
237 | check_member_template (tmpl); |
238 | return tmpl; | |
239 | } | |
8d019cef | 240 | return NULL_TREE; |
93cdc044 | 241 | } |
07c88314 | 242 | else if (TREE_CODE (decl) == FIELD_DECL) |
33bd39a2 | 243 | error ("data member `%D' cannot be a member template", decl); |
a1da6cba | 244 | else if (DECL_TEMPLATE_INFO (decl)) |
e1467ff2 | 245 | { |
a1da6cba MM |
246 | if (!DECL_TEMPLATE_SPECIALIZATION (decl)) |
247 | { | |
248 | check_member_template (DECL_TI_TEMPLATE (decl)); | |
249 | return DECL_TI_TEMPLATE (decl); | |
250 | } | |
251 | else | |
252 | return decl; | |
253 | } | |
254 | else | |
33bd39a2 | 255 | error ("invalid member template declaration `%D'", decl); |
e1467ff2 | 256 | |
a1da6cba | 257 | return error_mark_node; |
f84b4be9 | 258 | } |
e1467ff2 | 259 | |
f84b4be9 JM |
260 | /* Returns the template nesting level of the indicated class TYPE. |
261 | ||
262 | For example, in: | |
263 | template <class T> | |
264 | struct A | |
265 | { | |
266 | template <class U> | |
267 | struct B {}; | |
268 | }; | |
269 | ||
39c01e4c MM |
270 | A<T>::B<U> has depth two, while A<T> has depth one. |
271 | Both A<T>::B<int> and A<int>::B<U> have depth one, if | |
272 | COUNT_SPECIALIZATIONS is 0 or if they are instantiations, not | |
273 | specializations. | |
274 | ||
275 | This function is guaranteed to return 0 if passed NULL_TREE so | |
276 | that, for example, `template_class_depth (current_class_type)' is | |
277 | always safe. */ | |
f84b4be9 | 278 | |
e9659ab0 | 279 | static int |
3a978d72 | 280 | template_class_depth_real (tree type, int count_specializations) |
f84b4be9 | 281 | { |
93cdc044 | 282 | int depth; |
f84b4be9 | 283 | |
2c73f9f5 | 284 | for (depth = 0; |
ed44da02 MM |
285 | type && TREE_CODE (type) != NAMESPACE_DECL; |
286 | type = (TREE_CODE (type) == FUNCTION_DECL) | |
4f1c5b7d | 287 | ? CP_DECL_CONTEXT (type) : TYPE_CONTEXT (type)) |
ed44da02 MM |
288 | { |
289 | if (TREE_CODE (type) != FUNCTION_DECL) | |
290 | { | |
291 | if (CLASSTYPE_TEMPLATE_INFO (type) | |
292 | && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (type)) | |
293 | && ((count_specializations | |
370af2d5 | 294 | && CLASSTYPE_TEMPLATE_SPECIALIZATION (type)) |
ed44da02 MM |
295 | || uses_template_parms (CLASSTYPE_TI_ARGS (type)))) |
296 | ++depth; | |
297 | } | |
298 | else | |
299 | { | |
300 | if (DECL_TEMPLATE_INFO (type) | |
301 | && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (type)) | |
302 | && ((count_specializations | |
303 | && DECL_TEMPLATE_SPECIALIZATION (type)) | |
304 | || uses_template_parms (DECL_TI_ARGS (type)))) | |
305 | ++depth; | |
306 | } | |
307 | } | |
f84b4be9 JM |
308 | |
309 | return depth; | |
e1467ff2 | 310 | } |
98c1c668 | 311 | |
39c01e4c MM |
312 | /* Returns the template nesting level of the indicated class TYPE. |
313 | Like template_class_depth_real, but instantiations do not count in | |
314 | the depth. */ | |
315 | ||
316 | int | |
3a978d72 | 317 | template_class_depth (tree type) |
39c01e4c MM |
318 | { |
319 | return template_class_depth_real (type, /*count_specializations=*/0); | |
320 | } | |
321 | ||
cae40af6 JM |
322 | /* Returns 1 if processing DECL as part of do_pending_inlines |
323 | needs us to push template parms. */ | |
324 | ||
325 | static int | |
3a978d72 | 326 | inline_needs_template_parms (tree decl) |
cae40af6 JM |
327 | { |
328 | if (! DECL_TEMPLATE_INFO (decl)) | |
329 | return 0; | |
f84b4be9 | 330 | |
36a117a5 | 331 | return (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (most_general_template (decl))) |
cae40af6 JM |
332 | > (processing_template_decl + DECL_TEMPLATE_SPECIALIZATION (decl))); |
333 | } | |
334 | ||
335 | /* Subroutine of maybe_begin_member_template_processing. | |
336 | Push the template parms in PARMS, starting from LEVELS steps into the | |
337 | chain, and ending at the beginning, since template parms are listed | |
338 | innermost first. */ | |
339 | ||
340 | static void | |
3a978d72 | 341 | push_inline_template_parms_recursive (tree parmlist, int levels) |
cae40af6 JM |
342 | { |
343 | tree parms = TREE_VALUE (parmlist); | |
344 | int i; | |
345 | ||
346 | if (levels > 1) | |
347 | push_inline_template_parms_recursive (TREE_CHAIN (parmlist), levels - 1); | |
786b5245 | 348 | |
98c1c668 | 349 | ++processing_template_decl; |
cae40af6 | 350 | current_template_parms |
4890c2f4 | 351 | = tree_cons (size_int (processing_template_decl), |
98c1c668 | 352 | parms, current_template_parms); |
cae40af6 JM |
353 | TEMPLATE_PARMS_FOR_INLINE (current_template_parms) = 1; |
354 | ||
786b5245 | 355 | pushlevel (0); |
98c1c668 JM |
356 | for (i = 0; i < TREE_VEC_LENGTH (parms); ++i) |
357 | { | |
786b5245 | 358 | tree parm = TREE_VALUE (TREE_VEC_ELT (parms, i)); |
2f939d94 | 359 | my_friendly_assert (DECL_P (parm), 0); |
cae40af6 | 360 | |
98c1c668 JM |
361 | switch (TREE_CODE (parm)) |
362 | { | |
786b5245 | 363 | case TYPE_DECL: |
73b0fce8 | 364 | case TEMPLATE_DECL: |
98c1c668 JM |
365 | pushdecl (parm); |
366 | break; | |
786b5245 MM |
367 | |
368 | case PARM_DECL: | |
369 | { | |
fc03edb3 MM |
370 | /* Make a CONST_DECL as is done in process_template_parm. |
371 | It is ugly that we recreate this here; the original | |
372 | version built in process_template_parm is no longer | |
373 | available. */ | |
786b5245 MM |
374 | tree decl = build_decl (CONST_DECL, DECL_NAME (parm), |
375 | TREE_TYPE (parm)); | |
c727aa5e | 376 | DECL_ARTIFICIAL (decl) = 1; |
3e4a3562 | 377 | TREE_CONSTANT (decl) = TREE_READONLY (decl) = 1; |
786b5245 | 378 | DECL_INITIAL (decl) = DECL_INITIAL (parm); |
cd9f6678 | 379 | SET_DECL_TEMPLATE_PARM_P (decl); |
786b5245 MM |
380 | pushdecl (decl); |
381 | } | |
cae40af6 | 382 | break; |
786b5245 | 383 | |
98c1c668 | 384 | default: |
a98facb0 | 385 | abort (); |
98c1c668 JM |
386 | } |
387 | } | |
388 | } | |
389 | ||
cae40af6 JM |
390 | /* Restore the template parameter context for a member template or |
391 | a friend template defined in a class definition. */ | |
392 | ||
393 | void | |
3a978d72 | 394 | maybe_begin_member_template_processing (tree decl) |
cae40af6 JM |
395 | { |
396 | tree parms; | |
3dcaad8b | 397 | int levels = 0; |
cae40af6 | 398 | |
3dcaad8b MM |
399 | if (inline_needs_template_parms (decl)) |
400 | { | |
401 | parms = DECL_TEMPLATE_PARMS (most_general_template (decl)); | |
402 | levels = TMPL_PARMS_DEPTH (parms) - processing_template_decl; | |
cae40af6 | 403 | |
3dcaad8b MM |
404 | if (DECL_TEMPLATE_SPECIALIZATION (decl)) |
405 | { | |
406 | --levels; | |
407 | parms = TREE_CHAIN (parms); | |
408 | } | |
cae40af6 | 409 | |
3dcaad8b | 410 | push_inline_template_parms_recursive (parms, levels); |
cae40af6 JM |
411 | } |
412 | ||
3dcaad8b MM |
413 | /* Remember how many levels of template parameters we pushed so that |
414 | we can pop them later. */ | |
415 | if (!inline_parm_levels) | |
416 | VARRAY_INT_INIT (inline_parm_levels, 4, "inline_parm_levels"); | |
417 | if (inline_parm_levels_used == inline_parm_levels->num_elements) | |
418 | VARRAY_GROW (inline_parm_levels, 2 * inline_parm_levels_used); | |
419 | VARRAY_INT (inline_parm_levels, inline_parm_levels_used) = levels; | |
420 | ++inline_parm_levels_used; | |
cae40af6 JM |
421 | } |
422 | ||
c6002625 | 423 | /* Undo the effects of begin_member_template_processing. */ |
98c1c668 JM |
424 | |
425 | void | |
3a978d72 | 426 | maybe_end_member_template_processing (void) |
98c1c668 | 427 | { |
3dcaad8b MM |
428 | int i; |
429 | ||
430 | if (!inline_parm_levels_used) | |
98c1c668 JM |
431 | return; |
432 | ||
3dcaad8b MM |
433 | --inline_parm_levels_used; |
434 | for (i = 0; | |
435 | i < VARRAY_INT (inline_parm_levels, inline_parm_levels_used); | |
436 | ++i) | |
cae40af6 JM |
437 | { |
438 | --processing_template_decl; | |
439 | current_template_parms = TREE_CHAIN (current_template_parms); | |
440 | poplevel (0, 0, 0); | |
441 | } | |
98c1c668 JM |
442 | } |
443 | ||
838dfd8a | 444 | /* Returns nonzero iff T is a member template function. We must be |
f84b4be9 | 445 | careful as in |
75650646 MM |
446 | |
447 | template <class T> class C { void f(); } | |
448 | ||
449 | Here, f is a template function, and a member, but not a member | |
450 | template. This function does not concern itself with the origin of | |
451 | T, only its present state. So if we have | |
452 | ||
453 | template <class T> class C { template <class U> void f(U); } | |
454 | ||
455 | then neither C<int>::f<char> nor C<T>::f<double> is considered | |
f181d4ae MM |
456 | to be a member template. But, `template <class U> void |
457 | C<int>::f(U)' is considered a member template. */ | |
98c1c668 | 458 | |
cae40af6 | 459 | int |
3a978d72 | 460 | is_member_template (tree t) |
98c1c668 | 461 | { |
f181d4ae | 462 | if (!DECL_FUNCTION_TEMPLATE_P (t)) |
75650646 | 463 | /* Anything that isn't a function or a template function is |
aa5f3bad MM |
464 | certainly not a member template. */ |
465 | return 0; | |
466 | ||
cae40af6 | 467 | /* A local class can't have member templates. */ |
4f1c5b7d | 468 | if (decl_function_context (t)) |
cae40af6 JM |
469 | return 0; |
470 | ||
f181d4ae | 471 | return (DECL_FUNCTION_MEMBER_P (DECL_TEMPLATE_RESULT (t)) |
f84b4be9 JM |
472 | /* If there are more levels of template parameters than |
473 | there are template classes surrounding the declaration, | |
474 | then we have a member template. */ | |
f181d4ae | 475 | && (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (t)) > |
4f1c5b7d | 476 | template_class_depth (DECL_CONTEXT (t)))); |
f84b4be9 | 477 | } |
98c1c668 | 478 | |
ba4f4e5d | 479 | #if 0 /* UNUSED */ |
838dfd8a | 480 | /* Returns nonzero iff T is a member template class. See |
2ee4e084 MM |
481 | is_member_template for a description of what precisely constitutes |
482 | a member template. */ | |
483 | ||
484 | int | |
3a978d72 | 485 | is_member_template_class (tree t) |
2ee4e084 MM |
486 | { |
487 | if (!DECL_CLASS_TEMPLATE_P (t)) | |
488 | /* Anything that isn't a class template, is certainly not a member | |
489 | template. */ | |
490 | return 0; | |
491 | ||
492 | if (!DECL_CLASS_SCOPE_P (t)) | |
493 | /* Anything whose context isn't a class type is surely not a | |
494 | member template. */ | |
495 | return 0; | |
496 | ||
497 | /* If there are more levels of template parameters than there are | |
498 | template classes surrounding the declaration, then we have a | |
499 | member template. */ | |
36a117a5 | 500 | return (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (t)) > |
2ee4e084 MM |
501 | template_class_depth (DECL_CONTEXT (t))); |
502 | } | |
ba4f4e5d | 503 | #endif |
2ee4e084 | 504 | |
36a117a5 | 505 | /* Return a new template argument vector which contains all of ARGS, |
f9a7ae04 | 506 | but has as its innermost set of arguments the EXTRA_ARGS. */ |
e6f1275f JM |
507 | |
508 | static tree | |
3a978d72 | 509 | add_to_template_args (tree args, tree extra_args) |
e6f1275f | 510 | { |
36a117a5 MM |
511 | tree new_args; |
512 | int extra_depth; | |
513 | int i; | |
514 | int j; | |
e6f1275f | 515 | |
36a117a5 | 516 | extra_depth = TMPL_ARGS_DEPTH (extra_args); |
f31c0a32 | 517 | new_args = make_tree_vec (TMPL_ARGS_DEPTH (args) + extra_depth); |
e6f1275f | 518 | |
36a117a5 MM |
519 | for (i = 1; i <= TMPL_ARGS_DEPTH (args); ++i) |
520 | SET_TMPL_ARGS_LEVEL (new_args, i, TMPL_ARGS_LEVEL (args, i)); | |
e6f1275f | 521 | |
36a117a5 MM |
522 | for (j = 1; j <= extra_depth; ++j, ++i) |
523 | SET_TMPL_ARGS_LEVEL (new_args, i, TMPL_ARGS_LEVEL (extra_args, j)); | |
524 | ||
e6f1275f JM |
525 | return new_args; |
526 | } | |
527 | ||
36a117a5 MM |
528 | /* Like add_to_template_args, but only the outermost ARGS are added to |
529 | the EXTRA_ARGS. In particular, all but TMPL_ARGS_DEPTH | |
530 | (EXTRA_ARGS) levels are added. This function is used to combine | |
531 | the template arguments from a partial instantiation with the | |
532 | template arguments used to attain the full instantiation from the | |
533 | partial instantiation. */ | |
98c1c668 | 534 | |
4966381a | 535 | static tree |
3a978d72 | 536 | add_outermost_template_args (tree args, tree extra_args) |
98c1c668 JM |
537 | { |
538 | tree new_args; | |
539 | ||
e4a84209 MM |
540 | /* If there are more levels of EXTRA_ARGS than there are ARGS, |
541 | something very fishy is going on. */ | |
542 | my_friendly_assert (TMPL_ARGS_DEPTH (args) >= TMPL_ARGS_DEPTH (extra_args), | |
543 | 0); | |
544 | ||
545 | /* If *all* the new arguments will be the EXTRA_ARGS, just return | |
546 | them. */ | |
547 | if (TMPL_ARGS_DEPTH (args) == TMPL_ARGS_DEPTH (extra_args)) | |
548 | return extra_args; | |
549 | ||
36a117a5 MM |
550 | /* For the moment, we make ARGS look like it contains fewer levels. */ |
551 | TREE_VEC_LENGTH (args) -= TMPL_ARGS_DEPTH (extra_args); | |
552 | ||
553 | new_args = add_to_template_args (args, extra_args); | |
98c1c668 | 554 | |
36a117a5 MM |
555 | /* Now, we restore ARGS to its full dimensions. */ |
556 | TREE_VEC_LENGTH (args) += TMPL_ARGS_DEPTH (extra_args); | |
98c1c668 JM |
557 | |
558 | return new_args; | |
559 | } | |
5566b478 | 560 | |
f9a7ae04 MM |
561 | /* Return the N levels of innermost template arguments from the ARGS. */ |
562 | ||
563 | tree | |
3a978d72 | 564 | get_innermost_template_args (tree args, int n) |
f9a7ae04 MM |
565 | { |
566 | tree new_args; | |
567 | int extra_levels; | |
568 | int i; | |
569 | ||
570 | my_friendly_assert (n >= 0, 20000603); | |
571 | ||
572 | /* If N is 1, just return the innermost set of template arguments. */ | |
573 | if (n == 1) | |
574 | return TMPL_ARGS_LEVEL (args, TMPL_ARGS_DEPTH (args)); | |
575 | ||
576 | /* If we're not removing anything, just return the arguments we were | |
577 | given. */ | |
578 | extra_levels = TMPL_ARGS_DEPTH (args) - n; | |
579 | my_friendly_assert (extra_levels >= 0, 20000603); | |
580 | if (extra_levels == 0) | |
581 | return args; | |
582 | ||
583 | /* Make a new set of arguments, not containing the outer arguments. */ | |
584 | new_args = make_tree_vec (n); | |
585 | for (i = 1; i <= n; ++i) | |
586 | SET_TMPL_ARGS_LEVEL (new_args, i, | |
587 | TMPL_ARGS_LEVEL (args, i + extra_levels)); | |
588 | ||
589 | return new_args; | |
590 | } | |
591 | ||
5566b478 MS |
592 | /* We've got a template header coming up; push to a new level for storing |
593 | the parms. */ | |
8d08fdba | 594 | |
8d08fdba | 595 | void |
3a978d72 | 596 | begin_template_parm_list (void) |
8d08fdba | 597 | { |
6757edfe MM |
598 | /* We use a non-tag-transparent scope here, which causes pushtag to |
599 | put tags in this scope, rather than in the enclosing class or | |
600 | namespace scope. This is the right thing, since we want | |
601 | TEMPLATE_DECLS, and not TYPE_DECLS for template classes. For a | |
602 | global template class, push_template_decl handles putting the | |
603 | TEMPLATE_DECL into top-level scope. For a nested template class, | |
604 | e.g.: | |
605 | ||
606 | template <class T> struct S1 { | |
607 | template <class T> struct S2 {}; | |
608 | }; | |
609 | ||
610 | pushtag contains special code to call pushdecl_with_scope on the | |
611 | TEMPLATE_DECL for S2. */ | |
74b846e0 | 612 | begin_scope (sk_template_parms); |
5156628f | 613 | ++processing_template_decl; |
67ffc812 | 614 | ++processing_template_parmlist; |
386b8a85 JM |
615 | note_template_header (0); |
616 | } | |
617 | ||
6c30752f | 618 | /* This routine is called when a specialization is declared. If it is |
0e339752 | 619 | invalid to declare a specialization here, an error is reported. */ |
6c30752f | 620 | |
e9659ab0 | 621 | static void |
3a978d72 | 622 | check_specialization_scope (void) |
6c30752f MM |
623 | { |
624 | tree scope = current_scope (); | |
3ddfb0e6 | 625 | |
6c30752f MM |
626 | /* [temp.expl.spec] |
627 | ||
628 | An explicit specialization shall be declared in the namespace of | |
629 | which the template is a member, or, for member templates, in the | |
630 | namespace of which the enclosing class or enclosing class | |
631 | template is a member. An explicit specialization of a member | |
632 | function, member class or static data member of a class template | |
633 | shall be declared in the namespace of which the class template | |
634 | is a member. */ | |
635 | if (scope && TREE_CODE (scope) != NAMESPACE_DECL) | |
33bd39a2 | 636 | error ("explicit specialization in non-namespace scope `%D'", |
6c30752f | 637 | scope); |
3ddfb0e6 | 638 | |
6c30752f MM |
639 | /* [temp.expl.spec] |
640 | ||
641 | In an explicit specialization declaration for a member of a class | |
642 | template or a member template that appears in namespace scope, | |
643 | the member template and some of its enclosing class templates may | |
644 | remain unspecialized, except that the declaration shall not | |
645 | explicitly specialize a class member template if its enclosing | |
646 | class templates are not explicitly specialized as well. */ | |
647 | if (current_template_parms) | |
33bd39a2 | 648 | error ("enclosing class templates are not explicitly specialized"); |
6c30752f MM |
649 | } |
650 | ||
c6002625 | 651 | /* We've just seen template <>. */ |
386b8a85 JM |
652 | |
653 | void | |
3a978d72 | 654 | begin_specialization (void) |
386b8a85 | 655 | { |
74b846e0 | 656 | begin_scope (sk_template_spec); |
386b8a85 | 657 | note_template_header (1); |
6c30752f | 658 | check_specialization_scope (); |
386b8a85 JM |
659 | } |
660 | ||
dc957d14 | 661 | /* Called at then end of processing a declaration preceded by |
386b8a85 JM |
662 | template<>. */ |
663 | ||
664 | void | |
3a978d72 | 665 | end_specialization (void) |
386b8a85 | 666 | { |
74b846e0 | 667 | finish_scope (); |
386b8a85 JM |
668 | reset_specialization (); |
669 | } | |
670 | ||
386b8a85 | 671 | /* Any template <>'s that we have seen thus far are not referring to a |
c6002625 | 672 | function specialization. */ |
386b8a85 JM |
673 | |
674 | void | |
3a978d72 | 675 | reset_specialization (void) |
386b8a85 JM |
676 | { |
677 | processing_specialization = 0; | |
678 | template_header_count = 0; | |
679 | } | |
680 | ||
838dfd8a | 681 | /* We've just seen a template header. If SPECIALIZATION is nonzero, |
386b8a85 JM |
682 | it was of the form template <>. */ |
683 | ||
4966381a | 684 | static void |
3a978d72 | 685 | note_template_header (int specialization) |
386b8a85 JM |
686 | { |
687 | processing_specialization = specialization; | |
688 | template_header_count++; | |
689 | } | |
690 | ||
75650646 | 691 | /* We're beginning an explicit instantiation. */ |
386b8a85 | 692 | |
75650646 | 693 | void |
3a978d72 | 694 | begin_explicit_instantiation (void) |
386b8a85 | 695 | { |
a723baf1 MM |
696 | my_friendly_assert (!processing_explicit_instantiation, 20020913); |
697 | processing_explicit_instantiation = true; | |
75650646 | 698 | } |
386b8a85 | 699 | |
386b8a85 | 700 | |
75650646 | 701 | void |
3a978d72 | 702 | end_explicit_instantiation (void) |
75650646 | 703 | { |
a723baf1 MM |
704 | my_friendly_assert(processing_explicit_instantiation, 20020913); |
705 | processing_explicit_instantiation = false; | |
75650646 | 706 | } |
386b8a85 | 707 | |
36a117a5 MM |
708 | /* The TYPE is being declared. If it is a template type, that means it |
709 | is a partial specialization. Do appropriate error-checking. */ | |
710 | ||
711 | void | |
3a978d72 | 712 | maybe_process_partial_specialization (tree type) |
36a117a5 | 713 | { |
6e049fcd KL |
714 | /* TYPE maybe an ERROR_MARK_NODE. */ |
715 | tree context = TYPE_P (type) ? TYPE_CONTEXT (type) : NULL_TREE; | |
716 | ||
a723baf1 | 717 | if (CLASS_TYPE_P (type) && CLASSTYPE_USE_TEMPLATE (type)) |
36a117a5 | 718 | { |
6e049fcd KL |
719 | /* This is for ordinary explicit specialization and partial |
720 | specialization of a template class such as: | |
721 | ||
722 | template <> class C<int>; | |
723 | ||
724 | or: | |
725 | ||
726 | template <class T> class C<T*>; | |
727 | ||
728 | Make sure that `C<int>' and `C<T*>' are implicit instantiations. */ | |
729 | ||
36a117a5 | 730 | if (CLASSTYPE_IMPLICIT_INSTANTIATION (type) |
d0f062fb | 731 | && !COMPLETE_TYPE_P (type)) |
36a117a5 | 732 | { |
700466c2 JM |
733 | if (current_namespace |
734 | != decl_namespace_context (CLASSTYPE_TI_TEMPLATE (type))) | |
735 | { | |
33bd39a2 | 736 | pedwarn ("specializing `%#T' in different namespace", type); |
700466c2 JM |
737 | cp_pedwarn_at (" from definition of `%#D'", |
738 | CLASSTYPE_TI_TEMPLATE (type)); | |
739 | } | |
370af2d5 | 740 | SET_CLASSTYPE_TEMPLATE_SPECIALIZATION (type); |
36a117a5 MM |
741 | if (processing_template_decl) |
742 | push_template_decl (TYPE_MAIN_DECL (type)); | |
743 | } | |
744 | else if (CLASSTYPE_TEMPLATE_INSTANTIATION (type)) | |
33bd39a2 | 745 | error ("specialization of `%T' after instantiation", type); |
36a117a5 | 746 | } |
6e049fcd KL |
747 | else if (CLASS_TYPE_P (type) |
748 | && !CLASSTYPE_USE_TEMPLATE (type) | |
749 | && CLASSTYPE_TEMPLATE_INFO (type) | |
750 | && context && CLASS_TYPE_P (context) | |
751 | && CLASSTYPE_TEMPLATE_INFO (context)) | |
752 | { | |
753 | /* This is for an explicit specialization of member class | |
754 | template according to [temp.expl.spec/18]: | |
755 | ||
756 | template <> template <class U> class C<int>::D; | |
757 | ||
758 | The context `C<int>' must be an implicit instantiation. | |
759 | Otherwise this is just a member class template declared | |
760 | earlier like: | |
761 | ||
762 | template <> class C<int> { template <class U> class D; }; | |
763 | template <> template <class U> class C<int>::D; | |
764 | ||
765 | In the first case, `C<int>::D' is a specialization of `C<T>::D' | |
766 | while in the second case, `C<int>::D' is a primary template | |
767 | and `C<T>::D' may not exist. */ | |
768 | ||
769 | if (CLASSTYPE_IMPLICIT_INSTANTIATION (context) | |
770 | && !COMPLETE_TYPE_P (type)) | |
771 | { | |
772 | tree t; | |
773 | ||
774 | if (current_namespace | |
775 | != decl_namespace_context (CLASSTYPE_TI_TEMPLATE (type))) | |
776 | { | |
777 | pedwarn ("specializing `%#T' in different namespace", type); | |
778 | cp_pedwarn_at (" from definition of `%#D'", | |
779 | CLASSTYPE_TI_TEMPLATE (type)); | |
780 | } | |
781 | ||
782 | /* Check for invalid specialization after instantiation: | |
783 | ||
784 | template <> template <> class C<int>::D<int>; | |
785 | template <> template <class U> class C<int>::D; */ | |
786 | ||
787 | for (t = DECL_TEMPLATE_INSTANTIATIONS | |
788 | (most_general_template (CLASSTYPE_TI_TEMPLATE (type))); | |
789 | t; t = TREE_CHAIN (t)) | |
790 | if (TREE_VALUE (t) != type | |
791 | && TYPE_CONTEXT (TREE_VALUE (t)) == context) | |
792 | error ("specialization `%T' after instantiation `%T'", | |
793 | type, TREE_VALUE (t)); | |
794 | ||
795 | /* Mark TYPE as a specialization. And as a result, we only | |
796 | have one level of template argument for the innermost | |
797 | class template. */ | |
798 | SET_CLASSTYPE_TEMPLATE_SPECIALIZATION (type); | |
799 | CLASSTYPE_TI_ARGS (type) | |
800 | = INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (type)); | |
801 | } | |
802 | } | |
20496fa2 | 803 | else if (processing_specialization) |
33bd39a2 | 804 | error ("explicit specialization of non-template `%T'", type); |
36a117a5 MM |
805 | } |
806 | ||
75650646 MM |
807 | /* Retrieve the specialization (in the sense of [temp.spec] - a |
808 | specialization is either an instantiation or an explicit | |
809 | specialization) of TMPL for the given template ARGS. If there is | |
810 | no such specialization, return NULL_TREE. The ARGS are a vector of | |
811 | arguments, or a vector of vectors of arguments, in the case of | |
812 | templates with more than one level of parameters. */ | |
813 | ||
814 | static tree | |
3a978d72 | 815 | retrieve_specialization (tree tmpl, tree args) |
75650646 MM |
816 | { |
817 | tree s; | |
818 | ||
819 | my_friendly_assert (TREE_CODE (tmpl) == TEMPLATE_DECL, 0); | |
820 | ||
36a117a5 MM |
821 | /* There should be as many levels of arguments as there are |
822 | levels of parameters. */ | |
823 | my_friendly_assert (TMPL_ARGS_DEPTH (args) | |
824 | == TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl)), | |
825 | 0); | |
826 | ||
75650646 MM |
827 | for (s = DECL_TEMPLATE_SPECIALIZATIONS (tmpl); |
828 | s != NULL_TREE; | |
829 | s = TREE_CHAIN (s)) | |
830 | if (comp_template_args (TREE_PURPOSE (s), args)) | |
831 | return TREE_VALUE (s); | |
832 | ||
833 | return NULL_TREE; | |
386b8a85 JM |
834 | } |
835 | ||
dc957d14 | 836 | /* Like retrieve_specialization, but for local declarations. */ |
9188c363 MM |
837 | |
838 | static tree | |
3a978d72 | 839 | retrieve_local_specialization (tree tmpl) |
9188c363 | 840 | { |
c68b0a84 KG |
841 | tree spec = htab_find_with_hash (local_specializations, tmpl, |
842 | htab_hash_pointer (tmpl)); | |
a723baf1 | 843 | return spec ? TREE_PURPOSE (spec) : NULL_TREE; |
9188c363 MM |
844 | } |
845 | ||
838dfd8a | 846 | /* Returns nonzero iff DECL is a specialization of TMPL. */ |
6757edfe MM |
847 | |
848 | int | |
3a978d72 | 849 | is_specialization_of (tree decl, tree tmpl) |
6757edfe MM |
850 | { |
851 | tree t; | |
852 | ||
853 | if (TREE_CODE (decl) == FUNCTION_DECL) | |
854 | { | |
855 | for (t = decl; | |
856 | t != NULL_TREE; | |
857 | t = DECL_TEMPLATE_INFO (t) ? DECL_TI_TEMPLATE (t) : NULL_TREE) | |
858 | if (t == tmpl) | |
859 | return 1; | |
860 | } | |
861 | else | |
862 | { | |
863 | my_friendly_assert (TREE_CODE (decl) == TYPE_DECL, 0); | |
864 | ||
865 | for (t = TREE_TYPE (decl); | |
866 | t != NULL_TREE; | |
867 | t = CLASSTYPE_USE_TEMPLATE (t) | |
868 | ? TREE_TYPE (CLASSTYPE_TI_TEMPLATE (t)) : NULL_TREE) | |
9edc3913 | 869 | if (same_type_ignoring_top_level_qualifiers_p (t, TREE_TYPE (tmpl))) |
6757edfe MM |
870 | return 1; |
871 | } | |
386b8a85 | 872 | |
6757edfe MM |
873 | return 0; |
874 | } | |
75650646 MM |
875 | |
876 | /* Register the specialization SPEC as a specialization of TMPL with | |
36a117a5 MM |
877 | the indicated ARGS. Returns SPEC, or an equivalent prior |
878 | declaration, if available. */ | |
75650646 | 879 | |
36a117a5 | 880 | static tree |
3a978d72 | 881 | register_specialization (tree spec, tree tmpl, tree args) |
75650646 MM |
882 | { |
883 | tree s; | |
884 | ||
885 | my_friendly_assert (TREE_CODE (tmpl) == TEMPLATE_DECL, 0); | |
886 | ||
36a117a5 MM |
887 | if (TREE_CODE (spec) == FUNCTION_DECL |
888 | && uses_template_parms (DECL_TI_ARGS (spec))) | |
889 | /* This is the FUNCTION_DECL for a partial instantiation. Don't | |
890 | register it; we want the corresponding TEMPLATE_DECL instead. | |
891 | We use `uses_template_parms (DECL_TI_ARGS (spec))' rather than | |
892 | the more obvious `uses_template_parms (spec)' to avoid problems | |
893 | with default function arguments. In particular, given | |
894 | something like this: | |
895 | ||
896 | template <class T> void f(T t1, T t = T()) | |
897 | ||
898 | the default argument expression is not substituted for in an | |
899 | instantiation unless and until it is actually needed. */ | |
900 | return spec; | |
75650646 | 901 | |
36a117a5 MM |
902 | /* There should be as many levels of arguments as there are |
903 | levels of parameters. */ | |
904 | my_friendly_assert (TMPL_ARGS_DEPTH (args) | |
905 | == TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl)), | |
906 | 0); | |
907 | ||
75650646 MM |
908 | for (s = DECL_TEMPLATE_SPECIALIZATIONS (tmpl); |
909 | s != NULL_TREE; | |
910 | s = TREE_CHAIN (s)) | |
22e9174f MM |
911 | { |
912 | tree fn = TREE_VALUE (s); | |
913 | ||
914 | /* We can sometimes try to re-register a specialization that we've | |
915 | already got. In particular, regenerate_decl_from_template | |
916 | calls duplicate_decls which will update the specialization | |
917 | list. But, we'll still get called again here anyhow. It's | |
918 | more convenient to simply allow this than to try to prevent it. */ | |
919 | if (fn == spec) | |
920 | return spec; | |
921 | else if (comp_template_args (TREE_PURPOSE (s), args)) | |
922 | { | |
923 | if (DECL_TEMPLATE_SPECIALIZATION (spec)) | |
924 | { | |
925 | if (DECL_TEMPLATE_INSTANTIATION (fn)) | |
926 | { | |
927 | if (TREE_USED (fn) | |
928 | || DECL_EXPLICIT_INSTANTIATION (fn)) | |
929 | { | |
33bd39a2 | 930 | error ("specialization of %D after instantiation", |
22e9174f MM |
931 | fn); |
932 | return spec; | |
933 | } | |
934 | else | |
935 | { | |
936 | /* This situation should occur only if the first | |
937 | specialization is an implicit instantiation, | |
938 | the second is an explicit specialization, and | |
939 | the implicit instantiation has not yet been | |
940 | used. That situation can occur if we have | |
941 | implicitly instantiated a member function and | |
942 | then specialized it later. | |
943 | ||
944 | We can also wind up here if a friend | |
945 | declaration that looked like an instantiation | |
946 | turns out to be a specialization: | |
947 | ||
948 | template <class T> void foo(T); | |
949 | class S { friend void foo<>(int) }; | |
950 | template <> void foo(int); | |
951 | ||
952 | We transform the existing DECL in place so that | |
953 | any pointers to it become pointers to the | |
954 | updated declaration. | |
955 | ||
956 | If there was a definition for the template, but | |
957 | not for the specialization, we want this to | |
958 | look as if there is no definition, and vice | |
959 | versa. */ | |
960 | DECL_INITIAL (fn) = NULL_TREE; | |
961 | duplicate_decls (spec, fn); | |
962 | ||
963 | return fn; | |
964 | } | |
965 | } | |
966 | else if (DECL_TEMPLATE_SPECIALIZATION (fn)) | |
967 | { | |
b190f239 NS |
968 | if (!duplicate_decls (spec, fn) && DECL_INITIAL (spec)) |
969 | /* Dup decl failed, but this is a new | |
970 | definition. Set the line number so any errors | |
9bcb9aae | 971 | match this new definition. */ |
b190f239 NS |
972 | DECL_SOURCE_LOCATION (fn) = DECL_SOURCE_LOCATION (spec); |
973 | ||
22e9174f MM |
974 | return fn; |
975 | } | |
976 | } | |
977 | } | |
75650646 MM |
978 | } |
979 | ||
980 | DECL_TEMPLATE_SPECIALIZATIONS (tmpl) | |
e1b3e07d | 981 | = tree_cons (args, spec, DECL_TEMPLATE_SPECIALIZATIONS (tmpl)); |
36a117a5 MM |
982 | |
983 | return spec; | |
984 | } | |
985 | ||
986 | /* Unregister the specialization SPEC as a specialization of TMPL. | |
b3445994 MM |
987 | Replace it with NEW_SPEC, if NEW_SPEC is non-NULL. Returns true |
988 | if the SPEC was listed as a specialization of TMPL. */ | |
36a117a5 | 989 | |
b3445994 MM |
990 | bool |
991 | reregister_specialization (tree spec, tree tmpl, tree new_spec) | |
36a117a5 MM |
992 | { |
993 | tree* s; | |
994 | ||
995 | for (s = &DECL_TEMPLATE_SPECIALIZATIONS (tmpl); | |
996 | *s != NULL_TREE; | |
997 | s = &TREE_CHAIN (*s)) | |
998 | if (TREE_VALUE (*s) == spec) | |
999 | { | |
b3445994 MM |
1000 | if (!new_spec) |
1001 | *s = TREE_CHAIN (*s); | |
1002 | else | |
a3d87771 | 1003 | TREE_VALUE (*s) = new_spec; |
36a117a5 MM |
1004 | return 1; |
1005 | } | |
1006 | ||
1007 | return 0; | |
75650646 MM |
1008 | } |
1009 | ||
a723baf1 MM |
1010 | /* Compare an entry in the local specializations hash table P1 (which |
1011 | is really a pointer to a TREE_LIST) with P2 (which is really a | |
1012 | DECL). */ | |
1013 | ||
1014 | static int | |
1015 | eq_local_specializations (const void *p1, const void *p2) | |
1016 | { | |
1017 | return TREE_VALUE ((tree) p1) == (tree) p2; | |
1018 | } | |
1019 | ||
69f794a7 MM |
1020 | /* Hash P1, an entry in the local specializations table. */ |
1021 | ||
1022 | static hashval_t | |
1023 | hash_local_specialization (const void* p1) | |
1024 | { | |
1025 | return htab_hash_pointer (TREE_VALUE ((tree) p1)); | |
1026 | } | |
1027 | ||
6dfbb909 MM |
1028 | /* Like register_specialization, but for local declarations. We are |
1029 | registering SPEC, an instantiation of TMPL. */ | |
9188c363 | 1030 | |
414ea4aa | 1031 | static void |
3a978d72 | 1032 | register_local_specialization (tree spec, tree tmpl) |
9188c363 | 1033 | { |
6dfbb909 MM |
1034 | void **slot; |
1035 | ||
69f794a7 MM |
1036 | slot = htab_find_slot_with_hash (local_specializations, tmpl, |
1037 | htab_hash_pointer (tmpl), INSERT); | |
a723baf1 | 1038 | *slot = build_tree_list (spec, tmpl); |
9188c363 MM |
1039 | } |
1040 | ||
e1467ff2 MM |
1041 | /* Print the list of candidate FNS in an error message. */ |
1042 | ||
104bf76a | 1043 | void |
3a978d72 | 1044 | print_candidates (tree fns) |
e1467ff2 MM |
1045 | { |
1046 | tree fn; | |
1047 | ||
d8e178a0 | 1048 | const char *str = "candidates are:"; |
e1467ff2 MM |
1049 | |
1050 | for (fn = fns; fn != NULL_TREE; fn = TREE_CHAIN (fn)) | |
1051 | { | |
d6479fe7 MM |
1052 | tree f; |
1053 | ||
1054 | for (f = TREE_VALUE (fn); f; f = OVL_NEXT (f)) | |
1055 | cp_error_at ("%s %+#D", str, OVL_CURRENT (f)); | |
e1467ff2 MM |
1056 | str = " "; |
1057 | } | |
1058 | } | |
1059 | ||
75650646 | 1060 | /* Returns the template (one of the functions given by TEMPLATE_ID) |
e1467ff2 | 1061 | which can be specialized to match the indicated DECL with the |
03017874 MM |
1062 | explicit template args given in TEMPLATE_ID. The DECL may be |
1063 | NULL_TREE if none is available. In that case, the functions in | |
1064 | TEMPLATE_ID are non-members. | |
1065 | ||
838dfd8a | 1066 | If NEED_MEMBER_TEMPLATE is nonzero the function is known to be a |
03017874 MM |
1067 | specialization of a member template. |
1068 | ||
1069 | The template args (those explicitly specified and those deduced) | |
1070 | are output in a newly created vector *TARGS_OUT. | |
1071 | ||
1072 | If it is impossible to determine the result, an error message is | |
bf8f3f93 | 1073 | issued. The error_mark_node is returned to indicate failure. */ |
75650646 | 1074 | |
e9659ab0 | 1075 | static tree |
3a978d72 NN |
1076 | determine_specialization (tree template_id, |
1077 | tree decl, | |
1078 | tree* targs_out, | |
1079 | int need_member_template) | |
386b8a85 | 1080 | { |
03017874 MM |
1081 | tree fns; |
1082 | tree targs; | |
1083 | tree explicit_targs; | |
1084 | tree candidates = NULL_TREE; | |
1085 | tree templates = NULL_TREE; | |
386b8a85 | 1086 | |
e1467ff2 MM |
1087 | *targs_out = NULL_TREE; |
1088 | ||
f2e48b67 BK |
1089 | if (template_id == error_mark_node) |
1090 | return error_mark_node; | |
1091 | ||
1092 | fns = TREE_OPERAND (template_id, 0); | |
03017874 | 1093 | explicit_targs = TREE_OPERAND (template_id, 1); |
f2e48b67 | 1094 | |
27fafc8d JM |
1095 | if (fns == error_mark_node) |
1096 | return error_mark_node; | |
1097 | ||
c6002625 | 1098 | /* Check for baselinks. */ |
91e490ab | 1099 | if (BASELINK_P (fns)) |
da15dae6 | 1100 | fns = BASELINK_FUNCTIONS (fns); |
386b8a85 | 1101 | |
91e490ab MM |
1102 | if (!is_overloaded_fn (fns)) |
1103 | { | |
33bd39a2 | 1104 | error ("`%D' is not a function template", fns); |
91e490ab MM |
1105 | return error_mark_node; |
1106 | } | |
1107 | ||
2c73f9f5 | 1108 | for (; fns; fns = OVL_NEXT (fns)) |
386b8a85 | 1109 | { |
9dfce8fd | 1110 | tree fn = OVL_CURRENT (fns); |
03017874 MM |
1111 | |
1112 | if (TREE_CODE (fn) == TEMPLATE_DECL) | |
d955f6ea KL |
1113 | { |
1114 | tree decl_arg_types; | |
1115 | ||
1116 | /* DECL might be a specialization of FN. */ | |
1117 | ||
1118 | /* Adjust the type of DECL in case FN is a static member. */ | |
1119 | decl_arg_types = TYPE_ARG_TYPES (TREE_TYPE (decl)); | |
1120 | if (DECL_STATIC_FUNCTION_P (fn) | |
1121 | && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl)) | |
1122 | decl_arg_types = TREE_CHAIN (decl_arg_types); | |
1123 | ||
1124 | /* Check that the number of function parameters matches. | |
1125 | For example, | |
1126 | template <class T> void f(int i = 0); | |
1127 | template <> void f<int>(); | |
0e339752 | 1128 | The specialization f<int> is invalid but is not caught |
d955f6ea KL |
1129 | by get_bindings below. */ |
1130 | ||
1131 | if (list_length (TYPE_ARG_TYPES (TREE_TYPE (fn))) | |
1132 | != list_length (decl_arg_types)) | |
1133 | continue; | |
1134 | ||
1135 | /* See whether this function might be a specialization of this | |
1136 | template. */ | |
1137 | targs = get_bindings (fn, decl, explicit_targs); | |
1138 | ||
1139 | if (!targs) | |
1140 | /* We cannot deduce template arguments that when used to | |
1141 | specialize TMPL will produce DECL. */ | |
1142 | continue; | |
1143 | ||
1144 | /* Save this template, and the arguments deduced. */ | |
1145 | templates = tree_cons (targs, fn, templates); | |
1146 | } | |
03017874 MM |
1147 | else if (need_member_template) |
1148 | /* FN is an ordinary member function, and we need a | |
1149 | specialization of a member template. */ | |
d955f6ea | 1150 | ; |
03017874 MM |
1151 | else if (TREE_CODE (fn) != FUNCTION_DECL) |
1152 | /* We can get IDENTIFIER_NODEs here in certain erroneous | |
1153 | cases. */ | |
d955f6ea | 1154 | ; |
03017874 MM |
1155 | else if (!DECL_FUNCTION_MEMBER_P (fn)) |
1156 | /* This is just an ordinary non-member function. Nothing can | |
1157 | be a specialization of that. */ | |
d955f6ea | 1158 | ; |
3b82c249 KL |
1159 | else if (DECL_ARTIFICIAL (fn)) |
1160 | /* Cannot specialize functions that are created implicitly. */ | |
d955f6ea | 1161 | ; |
75650646 | 1162 | else |
03017874 MM |
1163 | { |
1164 | tree decl_arg_types; | |
386b8a85 | 1165 | |
03017874 MM |
1166 | /* This is an ordinary member function. However, since |
1167 | we're here, we can assume it's enclosing class is a | |
1168 | template class. For example, | |
1169 | ||
1170 | template <typename T> struct S { void f(); }; | |
1171 | template <> void S<int>::f() {} | |
1172 | ||
1173 | Here, S<int>::f is a non-template, but S<int> is a | |
1174 | template class. If FN has the same type as DECL, we | |
1175 | might be in business. */ | |
f5d47abd KL |
1176 | |
1177 | if (!DECL_TEMPLATE_INFO (fn)) | |
1178 | /* Its enclosing class is an explicit specialization | |
1179 | of a template class. This is not a candidate. */ | |
1180 | continue; | |
1181 | ||
03017874 MM |
1182 | if (!same_type_p (TREE_TYPE (TREE_TYPE (decl)), |
1183 | TREE_TYPE (TREE_TYPE (fn)))) | |
1184 | /* The return types differ. */ | |
1185 | continue; | |
1186 | ||
1187 | /* Adjust the type of DECL in case FN is a static member. */ | |
1188 | decl_arg_types = TYPE_ARG_TYPES (TREE_TYPE (decl)); | |
1189 | if (DECL_STATIC_FUNCTION_P (fn) | |
1190 | && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl)) | |
1191 | decl_arg_types = TREE_CHAIN (decl_arg_types); | |
1192 | ||
1193 | if (compparms (TYPE_ARG_TYPES (TREE_TYPE (fn)), | |
1194 | decl_arg_types)) | |
1195 | /* They match! */ | |
1196 | candidates = tree_cons (NULL_TREE, fn, candidates); | |
03017874 | 1197 | } |
386b8a85 | 1198 | } |
03017874 | 1199 | |
bf8f3f93 | 1200 | if (templates && TREE_CHAIN (templates)) |
386b8a85 | 1201 | { |
03017874 MM |
1202 | /* We have: |
1203 | ||
1204 | [temp.expl.spec] | |
1205 | ||
1206 | It is possible for a specialization with a given function | |
1207 | signature to be instantiated from more than one function | |
1208 | template. In such cases, explicit specification of the | |
1209 | template arguments must be used to uniquely identify the | |
1210 | function template specialization being specialized. | |
1211 | ||
1212 | Note that here, there's no suggestion that we're supposed to | |
1213 | determine which of the candidate templates is most | |
1214 | specialized. However, we, also have: | |
1215 | ||
1216 | [temp.func.order] | |
1217 | ||
1218 | Partial ordering of overloaded function template | |
1219 | declarations is used in the following contexts to select | |
1220 | the function template to which a function template | |
1221 | specialization refers: | |
1222 | ||
1223 | -- when an explicit specialization refers to a function | |
1224 | template. | |
1225 | ||
1226 | So, we do use the partial ordering rules, at least for now. | |
0e339752 | 1227 | This extension can only serve to make invalid programs valid, |
03017874 MM |
1228 | so it's safe. And, there is strong anecdotal evidence that |
1229 | the committee intended the partial ordering rules to apply; | |
1230 | the EDG front-end has that behavior, and John Spicer claims | |
1231 | that the committee simply forgot to delete the wording in | |
1232 | [temp.expl.spec]. */ | |
1233 | tree tmpl = most_specialized (templates, decl, explicit_targs); | |
1234 | if (tmpl && tmpl != error_mark_node) | |
1235 | { | |
1236 | targs = get_bindings (tmpl, decl, explicit_targs); | |
e1b3e07d | 1237 | templates = tree_cons (targs, tmpl, NULL_TREE); |
03017874 | 1238 | } |
e1467ff2 MM |
1239 | } |
1240 | ||
03017874 | 1241 | if (templates == NULL_TREE && candidates == NULL_TREE) |
e1467ff2 | 1242 | { |
bf8f3f93 MM |
1243 | cp_error_at ("template-id `%D' for `%+D' does not match any template declaration", |
1244 | template_id, decl); | |
03017874 | 1245 | return error_mark_node; |
386b8a85 | 1246 | } |
03017874 | 1247 | else if ((templates && TREE_CHAIN (templates)) |
bf8f3f93 MM |
1248 | || (candidates && TREE_CHAIN (candidates)) |
1249 | || (templates && candidates)) | |
386b8a85 | 1250 | { |
bf8f3f93 MM |
1251 | cp_error_at ("ambiguous template specialization `%D' for `%+D'", |
1252 | template_id, decl); | |
1253 | chainon (candidates, templates); | |
1254 | print_candidates (candidates); | |
03017874 | 1255 | return error_mark_node; |
386b8a85 JM |
1256 | } |
1257 | ||
c6002625 | 1258 | /* We have one, and exactly one, match. */ |
03017874 MM |
1259 | if (candidates) |
1260 | { | |
1261 | /* It was a specialization of an ordinary member function in a | |
1262 | template class. */ | |
1263 | *targs_out = copy_node (DECL_TI_ARGS (TREE_VALUE (candidates))); | |
1264 | return DECL_TI_TEMPLATE (TREE_VALUE (candidates)); | |
1265 | } | |
1266 | ||
1267 | /* It was a specialization of a template. */ | |
17aec3eb | 1268 | targs = DECL_TI_ARGS (DECL_TEMPLATE_RESULT (TREE_VALUE (templates))); |
03017874 MM |
1269 | if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (targs)) |
1270 | { | |
1271 | *targs_out = copy_node (targs); | |
1272 | SET_TMPL_ARGS_LEVEL (*targs_out, | |
1273 | TMPL_ARGS_DEPTH (*targs_out), | |
1274 | TREE_PURPOSE (templates)); | |
1275 | } | |
1276 | else | |
1277 | *targs_out = TREE_PURPOSE (templates); | |
e1467ff2 | 1278 | return TREE_VALUE (templates); |
8d08fdba | 1279 | } |
8afa707f MM |
1280 | |
1281 | /* Returns a chain of parameter types, exactly like the SPEC_TYPES, | |
1282 | but with the default argument values filled in from those in the | |
1283 | TMPL_TYPES. */ | |
6757edfe | 1284 | |
8afa707f | 1285 | static tree |
3a978d72 NN |
1286 | copy_default_args_to_explicit_spec_1 (tree spec_types, |
1287 | tree tmpl_types) | |
8afa707f MM |
1288 | { |
1289 | tree new_spec_types; | |
1290 | ||
1291 | if (!spec_types) | |
1292 | return NULL_TREE; | |
1293 | ||
1294 | if (spec_types == void_list_node) | |
1295 | return void_list_node; | |
1296 | ||
1297 | /* Substitute into the rest of the list. */ | |
1298 | new_spec_types = | |
1299 | copy_default_args_to_explicit_spec_1 (TREE_CHAIN (spec_types), | |
1300 | TREE_CHAIN (tmpl_types)); | |
1301 | ||
1302 | /* Add the default argument for this parameter. */ | |
1303 | return hash_tree_cons (TREE_PURPOSE (tmpl_types), | |
1304 | TREE_VALUE (spec_types), | |
1305 | new_spec_types); | |
1306 | } | |
1307 | ||
1308 | /* DECL is an explicit specialization. Replicate default arguments | |
1309 | from the template it specializes. (That way, code like: | |
1310 | ||
1311 | template <class T> void f(T = 3); | |
1312 | template <> void f(double); | |
1313 | void g () { f (); } | |
1314 | ||
1315 | works, as required.) An alternative approach would be to look up | |
1316 | the correct default arguments at the call-site, but this approach | |
1317 | is consistent with how implicit instantiations are handled. */ | |
1318 | ||
1319 | static void | |
3a978d72 | 1320 | copy_default_args_to_explicit_spec (tree decl) |
8afa707f MM |
1321 | { |
1322 | tree tmpl; | |
1323 | tree spec_types; | |
1324 | tree tmpl_types; | |
1325 | tree new_spec_types; | |
1326 | tree old_type; | |
1327 | tree new_type; | |
1328 | tree t; | |
08c2df0f NS |
1329 | tree object_type = NULL_TREE; |
1330 | tree in_charge = NULL_TREE; | |
e0fff4b3 | 1331 | tree vtt = NULL_TREE; |
8afa707f MM |
1332 | |
1333 | /* See if there's anything we need to do. */ | |
1334 | tmpl = DECL_TI_TEMPLATE (decl); | |
1335 | tmpl_types = TYPE_ARG_TYPES (TREE_TYPE (DECL_TEMPLATE_RESULT (tmpl))); | |
1336 | for (t = tmpl_types; t; t = TREE_CHAIN (t)) | |
1337 | if (TREE_PURPOSE (t)) | |
1338 | break; | |
1339 | if (!t) | |
1340 | return; | |
1341 | ||
1342 | old_type = TREE_TYPE (decl); | |
1343 | spec_types = TYPE_ARG_TYPES (old_type); | |
1344 | ||
8afa707f MM |
1345 | if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl)) |
1346 | { | |
08c2df0f NS |
1347 | /* Remove the this pointer, but remember the object's type for |
1348 | CV quals. */ | |
1349 | object_type = TREE_TYPE (TREE_VALUE (spec_types)); | |
8afa707f MM |
1350 | spec_types = TREE_CHAIN (spec_types); |
1351 | tmpl_types = TREE_CHAIN (tmpl_types); | |
08c2df0f | 1352 | |
8afa707f | 1353 | if (DECL_HAS_IN_CHARGE_PARM_P (decl)) |
08c2df0f NS |
1354 | { |
1355 | /* DECL may contain more parameters than TMPL due to the extra | |
1356 | in-charge parameter in constructors and destructors. */ | |
1357 | in_charge = spec_types; | |
1358 | spec_types = TREE_CHAIN (spec_types); | |
1359 | } | |
e0fff4b3 JM |
1360 | if (DECL_HAS_VTT_PARM_P (decl)) |
1361 | { | |
1362 | vtt = spec_types; | |
1363 | spec_types = TREE_CHAIN (spec_types); | |
1364 | } | |
8afa707f MM |
1365 | } |
1366 | ||
1367 | /* Compute the merged default arguments. */ | |
1368 | new_spec_types = | |
1369 | copy_default_args_to_explicit_spec_1 (spec_types, tmpl_types); | |
1370 | ||
08c2df0f NS |
1371 | /* Compute the new FUNCTION_TYPE. */ |
1372 | if (object_type) | |
8afa707f | 1373 | { |
e0fff4b3 JM |
1374 | if (vtt) |
1375 | new_spec_types = hash_tree_cons (TREE_PURPOSE (vtt), | |
1376 | TREE_VALUE (vtt), | |
1377 | new_spec_types); | |
1378 | ||
08c2df0f NS |
1379 | if (in_charge) |
1380 | /* Put the in-charge parameter back. */ | |
1381 | new_spec_types = hash_tree_cons (TREE_PURPOSE (in_charge), | |
1382 | TREE_VALUE (in_charge), | |
1383 | new_spec_types); | |
1384 | ||
43dc123f MM |
1385 | new_type = build_method_type_directly (object_type, |
1386 | TREE_TYPE (old_type), | |
1387 | new_spec_types); | |
8afa707f | 1388 | } |
8afa707f MM |
1389 | else |
1390 | new_type = build_function_type (TREE_TYPE (old_type), | |
08c2df0f | 1391 | new_spec_types); |
8afa707f MM |
1392 | new_type = build_type_attribute_variant (new_type, |
1393 | TYPE_ATTRIBUTES (old_type)); | |
1394 | new_type = build_exception_variant (new_type, | |
1395 | TYPE_RAISES_EXCEPTIONS (old_type)); | |
1396 | TREE_TYPE (decl) = new_type; | |
1397 | } | |
1398 | ||
386b8a85 | 1399 | /* Check to see if the function just declared, as indicated in |
75650646 MM |
1400 | DECLARATOR, and in DECL, is a specialization of a function |
1401 | template. We may also discover that the declaration is an explicit | |
1402 | instantiation at this point. | |
1403 | ||
e1467ff2 | 1404 | Returns DECL, or an equivalent declaration that should be used |
03017874 MM |
1405 | instead if all goes well. Issues an error message if something is |
1406 | amiss. Returns error_mark_node if the error is not easily | |
1407 | recoverable. | |
75650646 | 1408 | |
75650646 MM |
1409 | FLAGS is a bitmask consisting of the following flags: |
1410 | ||
75650646 MM |
1411 | 2: The function has a definition. |
1412 | 4: The function is a friend. | |
75650646 MM |
1413 | |
1414 | The TEMPLATE_COUNT is the number of references to qualifying | |
1415 | template classes that appeared in the name of the function. For | |
1416 | example, in | |
1417 | ||
1418 | template <class T> struct S { void f(); }; | |
1419 | void S<int>::f(); | |
1420 | ||
1421 | the TEMPLATE_COUNT would be 1. However, explicitly specialized | |
1422 | classes are not counted in the TEMPLATE_COUNT, so that in | |
1423 | ||
1424 | template <class T> struct S {}; | |
1425 | template <> struct S<int> { void f(); } | |
36a117a5 | 1426 | template <> void S<int>::f(); |
75650646 MM |
1427 | |
1428 | the TEMPLATE_COUNT would be 0. (Note that this declaration is | |
0e339752 | 1429 | invalid; there should be no template <>.) |
75650646 MM |
1430 | |
1431 | If the function is a specialization, it is marked as such via | |
1432 | DECL_TEMPLATE_SPECIALIZATION. Furthermore, its DECL_TEMPLATE_INFO | |
1433 | is set up correctly, and it is added to the list of specializations | |
1434 | for that template. */ | |
386b8a85 | 1435 | |
e1467ff2 | 1436 | tree |
3a978d72 NN |
1437 | check_explicit_specialization (tree declarator, |
1438 | tree decl, | |
1439 | int template_count, | |
1440 | int flags) | |
386b8a85 | 1441 | { |
75650646 MM |
1442 | int have_def = flags & 2; |
1443 | int is_friend = flags & 4; | |
1444 | int specialization = 0; | |
e1467ff2 | 1445 | int explicit_instantiation = 0; |
fd4de5ff | 1446 | int member_specialization = 0; |
75650646 MM |
1447 | tree ctype = DECL_CLASS_CONTEXT (decl); |
1448 | tree dname = DECL_NAME (decl); | |
74b846e0 | 1449 | tmpl_spec_kind tsk; |
386b8a85 | 1450 | |
74b846e0 | 1451 | tsk = current_tmpl_spec_kind (template_count); |
75650646 | 1452 | |
74b846e0 MM |
1453 | switch (tsk) |
1454 | { | |
1455 | case tsk_none: | |
1456 | if (processing_specialization) | |
75650646 | 1457 | { |
fd4de5ff MM |
1458 | specialization = 1; |
1459 | SET_DECL_TEMPLATE_SPECIALIZATION (decl); | |
75650646 | 1460 | } |
74b846e0 | 1461 | else if (TREE_CODE (declarator) == TEMPLATE_ID_EXPR) |
386b8a85 | 1462 | { |
74b846e0 MM |
1463 | if (is_friend) |
1464 | /* This could be something like: | |
75650646 | 1465 | |
74b846e0 MM |
1466 | template <class T> void f(T); |
1467 | class S { friend void f<>(int); } */ | |
1468 | specialization = 1; | |
1469 | else | |
1470 | { | |
1471 | /* This case handles bogus declarations like template <> | |
1472 | template <class T> void f<int>(); */ | |
1473 | ||
33bd39a2 | 1474 | error ("template-id `%D' in declaration of primary template", |
74b846e0 MM |
1475 | declarator); |
1476 | return decl; | |
1477 | } | |
1478 | } | |
1479 | break; | |
1480 | ||
1481 | case tsk_invalid_member_spec: | |
1482 | /* The error has already been reported in | |
1483 | check_specialization_scope. */ | |
1484 | return error_mark_node; | |
1485 | ||
1486 | case tsk_invalid_expl_inst: | |
33bd39a2 | 1487 | error ("template parameter list used in explicit instantiation"); |
74b846e0 MM |
1488 | |
1489 | /* Fall through. */ | |
1490 | ||
1491 | case tsk_expl_inst: | |
fd4de5ff | 1492 | if (have_def) |
33bd39a2 | 1493 | error ("definition provided for explicit instantiation"); |
74b846e0 | 1494 | |
fd4de5ff | 1495 | explicit_instantiation = 1; |
74b846e0 | 1496 | break; |
fd4de5ff | 1497 | |
74b846e0 | 1498 | case tsk_excessive_parms: |
33bd39a2 | 1499 | error ("too many template parameter lists in declaration of `%D'", |
74b846e0 MM |
1500 | decl); |
1501 | return error_mark_node; | |
75650646 | 1502 | |
74b846e0 MM |
1503 | /* Fall through. */ |
1504 | case tsk_expl_spec: | |
1505 | SET_DECL_TEMPLATE_SPECIALIZATION (decl); | |
1506 | if (ctype) | |
1507 | member_specialization = 1; | |
1508 | else | |
1509 | specialization = 1; | |
1510 | break; | |
1511 | ||
1512 | case tsk_insufficient_parms: | |
fd4de5ff MM |
1513 | if (template_header_count) |
1514 | { | |
33bd39a2 | 1515 | error("too few template parameter lists in declaration of `%D'", |
74b846e0 | 1516 | decl); |
fd4de5ff | 1517 | return decl; |
c6f2ed0d | 1518 | } |
74b846e0 MM |
1519 | else if (ctype != NULL_TREE |
1520 | && !TYPE_BEING_DEFINED (ctype) | |
1521 | && CLASSTYPE_TEMPLATE_INSTANTIATION (ctype) | |
1522 | && !is_friend) | |
1523 | { | |
1524 | /* For backwards compatibility, we accept: | |
fd4de5ff | 1525 | |
74b846e0 MM |
1526 | template <class T> struct S { void f(); }; |
1527 | void S<int>::f() {} // Missing template <> | |
fd4de5ff | 1528 | |
0e339752 | 1529 | That used to be valid C++. */ |
74b846e0 | 1530 | if (pedantic) |
33bd39a2 | 1531 | pedwarn |
74b846e0 MM |
1532 | ("explicit specialization not preceded by `template <>'"); |
1533 | specialization = 1; | |
1534 | SET_DECL_TEMPLATE_SPECIALIZATION (decl); | |
1535 | } | |
1536 | break; | |
1537 | ||
1538 | case tsk_template: | |
1539 | if (TREE_CODE (declarator) == TEMPLATE_ID_EXPR) | |
c6f2ed0d | 1540 | { |
fd4de5ff MM |
1541 | /* This case handles bogus declarations like template <> |
1542 | template <class T> void f<int>(); */ | |
75650646 | 1543 | |
655dc6ee | 1544 | if (uses_template_parms (declarator)) |
33bd39a2 | 1545 | error ("partial specialization `%D' of function template", |
655dc6ee JM |
1546 | declarator); |
1547 | else | |
33bd39a2 | 1548 | error ("template-id `%D' in declaration of primary template", |
655dc6ee | 1549 | declarator); |
fd4de5ff | 1550 | return decl; |
386b8a85 | 1551 | } |
74b846e0 MM |
1552 | |
1553 | if (ctype && CLASSTYPE_TEMPLATE_INSTANTIATION (ctype)) | |
1554 | /* This is a specialization of a member template, without | |
1555 | specialization the containing class. Something like: | |
1556 | ||
1557 | template <class T> struct S { | |
1558 | template <class U> void f (U); | |
1559 | }; | |
1560 | template <> template <class U> void S<int>::f(U) {} | |
1561 | ||
1562 | That's a specialization -- but of the entire template. */ | |
1563 | specialization = 1; | |
1564 | break; | |
1565 | ||
1566 | default: | |
a98facb0 | 1567 | abort (); |
75650646 | 1568 | } |
386b8a85 | 1569 | |
670960ac JM |
1570 | if (specialization || member_specialization) |
1571 | { | |
1572 | tree t = TYPE_ARG_TYPES (TREE_TYPE (decl)); | |
1573 | for (; t; t = TREE_CHAIN (t)) | |
1574 | if (TREE_PURPOSE (t)) | |
1575 | { | |
33bd39a2 | 1576 | pedwarn |
8251199e | 1577 | ("default argument specified in explicit specialization"); |
670960ac JM |
1578 | break; |
1579 | } | |
f3400fe2 | 1580 | if (current_lang_name == lang_name_c) |
33bd39a2 | 1581 | error ("template specialization with C linkage"); |
670960ac JM |
1582 | } |
1583 | ||
e1467ff2 | 1584 | if (specialization || member_specialization || explicit_instantiation) |
75650646 MM |
1585 | { |
1586 | tree tmpl = NULL_TREE; | |
1587 | tree targs = NULL_TREE; | |
75650646 MM |
1588 | |
1589 | /* Make sure that the declarator is a TEMPLATE_ID_EXPR. */ | |
386b8a85 JM |
1590 | if (TREE_CODE (declarator) != TEMPLATE_ID_EXPR) |
1591 | { | |
1592 | tree fns; | |
1593 | ||
2f54a1db GB |
1594 | my_friendly_assert (TREE_CODE (declarator) == IDENTIFIER_NODE, 0); |
1595 | if (ctype) | |
386b8a85 | 1596 | fns = dname; |
2f54a1db GB |
1597 | else |
1598 | { | |
1599 | /* If there is no class context, the explicit instantiation | |
1600 | must be at namespace scope. */ | |
1601 | my_friendly_assert (DECL_NAMESPACE_SCOPE_P (decl), 20030625); | |
1602 | ||
1603 | /* Find the namespace binding, using the declaration | |
1604 | context. */ | |
1605 | fns = namespace_binding (dname, CP_DECL_CONTEXT (decl)); | |
1606 | } | |
386b8a85 | 1607 | |
2f54a1db | 1608 | declarator = lookup_template_function (fns, NULL_TREE); |
386b8a85 JM |
1609 | } |
1610 | ||
f2e48b67 BK |
1611 | if (declarator == error_mark_node) |
1612 | return error_mark_node; | |
1613 | ||
75650646 MM |
1614 | if (ctype != NULL_TREE && TYPE_BEING_DEFINED (ctype)) |
1615 | { | |
8ec2ac34 | 1616 | if (!explicit_instantiation) |
0e339752 | 1617 | /* A specialization in class scope. This is invalid, |
6c30752f MM |
1618 | but the error will already have been flagged by |
1619 | check_specialization_scope. */ | |
1620 | return error_mark_node; | |
8ec2ac34 | 1621 | else |
b370501f | 1622 | { |
0e339752 | 1623 | /* It's not valid to write an explicit instantiation in |
b370501f | 1624 | class scope, e.g.: |
8ec2ac34 | 1625 | |
b370501f | 1626 | class C { template void f(); } |
8ec2ac34 | 1627 | |
b370501f KG |
1628 | This case is caught by the parser. However, on |
1629 | something like: | |
8ec2ac34 | 1630 | |
b370501f | 1631 | template class C { void f(); }; |
8ec2ac34 | 1632 | |
0e339752 | 1633 | (which is invalid) we can get here. The error will be |
b370501f KG |
1634 | issued later. */ |
1635 | ; | |
1636 | } | |
8ec2ac34 | 1637 | |
e1467ff2 | 1638 | return decl; |
75650646 MM |
1639 | } |
1640 | else if (ctype != NULL_TREE | |
1641 | && (TREE_CODE (TREE_OPERAND (declarator, 0)) == | |
1642 | IDENTIFIER_NODE)) | |
386b8a85 | 1643 | { |
75650646 MM |
1644 | /* Find the list of functions in ctype that have the same |
1645 | name as the declared function. */ | |
1646 | tree name = TREE_OPERAND (declarator, 0); | |
03017874 MM |
1647 | tree fns = NULL_TREE; |
1648 | int idx; | |
1649 | ||
8ba658ee | 1650 | if (constructor_name_p (name, ctype)) |
386b8a85 | 1651 | { |
75650646 MM |
1652 | int is_constructor = DECL_CONSTRUCTOR_P (decl); |
1653 | ||
1654 | if (is_constructor ? !TYPE_HAS_CONSTRUCTOR (ctype) | |
1655 | : !TYPE_HAS_DESTRUCTOR (ctype)) | |
1656 | { | |
1657 | /* From [temp.expl.spec]: | |
e1467ff2 | 1658 | |
75650646 MM |
1659 | If such an explicit specialization for the member |
1660 | of a class template names an implicitly-declared | |
1661 | special member function (clause _special_), the | |
e1467ff2 MM |
1662 | program is ill-formed. |
1663 | ||
1664 | Similar language is found in [temp.explicit]. */ | |
33bd39a2 | 1665 | error ("specialization of implicitly-declared special member function"); |
03017874 | 1666 | return error_mark_node; |
75650646 | 1667 | } |
386b8a85 | 1668 | |
42da2fd8 | 1669 | name = is_constructor ? ctor_identifier : dtor_identifier; |
75650646 | 1670 | } |
42da2fd8 | 1671 | |
421844e7 | 1672 | if (!DECL_CONV_FN_P (decl)) |
03017874 MM |
1673 | { |
1674 | idx = lookup_fnfields_1 (ctype, name); | |
1675 | if (idx >= 0) | |
1676 | fns = TREE_VEC_ELT (CLASSTYPE_METHOD_VEC (ctype), idx); | |
1677 | } | |
1678 | else | |
1679 | { | |
1680 | tree methods; | |
1681 | ||
1682 | /* For a type-conversion operator, we cannot do a | |
1683 | name-based lookup. We might be looking for `operator | |
1684 | int' which will be a specialization of `operator T'. | |
1685 | So, we find *all* the conversion operators, and then | |
1686 | select from them. */ | |
1687 | fns = NULL_TREE; | |
1688 | ||
1689 | methods = CLASSTYPE_METHOD_VEC (ctype); | |
1690 | if (methods) | |
5dd236e2 NS |
1691 | for (idx = CLASSTYPE_FIRST_CONVERSION_SLOT; |
1692 | idx < TREE_VEC_LENGTH (methods); ++idx) | |
03017874 MM |
1693 | { |
1694 | tree ovl = TREE_VEC_ELT (methods, idx); | |
1695 | ||
1696 | if (!ovl || !DECL_CONV_FN_P (OVL_CURRENT (ovl))) | |
1697 | /* There are no more conversion functions. */ | |
1698 | break; | |
1699 | ||
1700 | /* Glue all these conversion functions together | |
1701 | with those we already have. */ | |
1702 | for (; ovl; ovl = OVL_NEXT (ovl)) | |
1703 | fns = ovl_cons (OVL_CURRENT (ovl), fns); | |
1704 | } | |
1705 | } | |
1706 | ||
386b8a85 JM |
1707 | if (fns == NULL_TREE) |
1708 | { | |
33bd39a2 | 1709 | error ("no member function `%D' declared in `%T'", |
b3f738da | 1710 | name, ctype); |
03017874 | 1711 | return error_mark_node; |
386b8a85 JM |
1712 | } |
1713 | else | |
1714 | TREE_OPERAND (declarator, 0) = fns; | |
1715 | } | |
75650646 | 1716 | |
e1467ff2 MM |
1717 | /* Figure out what exactly is being specialized at this point. |
1718 | Note that for an explicit instantiation, even one for a | |
38e01259 | 1719 | member function, we cannot tell apriori whether the |
e1467ff2 | 1720 | instantiation is for a member template, or just a member |
36a117a5 MM |
1721 | function of a template class. Even if a member template is |
1722 | being instantiated, the member template arguments may be | |
1723 | elided if they can be deduced from the rest of the | |
1724 | declaration. */ | |
e1467ff2 MM |
1725 | tmpl = determine_specialization (declarator, decl, |
1726 | &targs, | |
bf8f3f93 | 1727 | member_specialization); |
386b8a85 | 1728 | |
03017874 MM |
1729 | if (!tmpl || tmpl == error_mark_node) |
1730 | /* We couldn't figure out what this declaration was | |
1731 | specializing. */ | |
1732 | return error_mark_node; | |
1733 | else | |
386b8a85 | 1734 | { |
25aab5d0 | 1735 | tree gen_tmpl = most_general_template (tmpl); |
36a117a5 | 1736 | |
e1467ff2 MM |
1737 | if (explicit_instantiation) |
1738 | { | |
03d0f4af | 1739 | /* We don't set DECL_EXPLICIT_INSTANTIATION here; that |
25aab5d0 MM |
1740 | is done by do_decl_instantiation later. */ |
1741 | ||
1742 | int arg_depth = TMPL_ARGS_DEPTH (targs); | |
1743 | int parm_depth = TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl)); | |
1744 | ||
1745 | if (arg_depth > parm_depth) | |
1746 | { | |
1747 | /* If TMPL is not the most general template (for | |
1748 | example, if TMPL is a friend template that is | |
1749 | injected into namespace scope), then there will | |
dc957d14 | 1750 | be too many levels of TARGS. Remove some of them |
25aab5d0 MM |
1751 | here. */ |
1752 | int i; | |
1753 | tree new_targs; | |
1754 | ||
f31c0a32 | 1755 | new_targs = make_tree_vec (parm_depth); |
25aab5d0 MM |
1756 | for (i = arg_depth - parm_depth; i < arg_depth; ++i) |
1757 | TREE_VEC_ELT (new_targs, i - (arg_depth - parm_depth)) | |
1758 | = TREE_VEC_ELT (targs, i); | |
1759 | targs = new_targs; | |
1760 | } | |
1761 | ||
3e4a3562 | 1762 | return instantiate_template (tmpl, targs, tf_error); |
e1467ff2 | 1763 | } |
74b846e0 | 1764 | |
6c07f448 KL |
1765 | /* If we thought that the DECL was a member function, but it |
1766 | turns out to be specializing a static member function, | |
1767 | make DECL a static member function as well. We also have | |
1768 | to adjust last_function_parms to avoid confusing | |
1769 | start_function later. */ | |
1770 | if (DECL_STATIC_FUNCTION_P (tmpl) | |
1771 | && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl)) | |
1772 | { | |
1773 | revert_static_member_fn (decl); | |
1774 | last_function_parms = TREE_CHAIN (last_function_parms); | |
1775 | } | |
1776 | ||
f9a7ae04 MM |
1777 | /* If this is a specialization of a member template of a |
1778 | template class. In we want to return the TEMPLATE_DECL, | |
1779 | not the specialization of it. */ | |
74b846e0 MM |
1780 | if (tsk == tsk_template) |
1781 | { | |
1782 | SET_DECL_TEMPLATE_SPECIALIZATION (tmpl); | |
f9a7ae04 | 1783 | DECL_INITIAL (DECL_TEMPLATE_RESULT (tmpl)) = NULL_TREE; |
b190f239 NS |
1784 | if (have_def) |
1785 | { | |
1786 | DECL_SOURCE_LOCATION (tmpl) = DECL_SOURCE_LOCATION (decl); | |
1787 | DECL_SOURCE_LOCATION (DECL_TEMPLATE_RESULT (tmpl)) | |
1788 | = DECL_SOURCE_LOCATION (decl); | |
1789 | } | |
74b846e0 MM |
1790 | return tmpl; |
1791 | } | |
1792 | ||
36a117a5 | 1793 | /* Set up the DECL_TEMPLATE_INFO for DECL. */ |
e1b3e07d | 1794 | DECL_TEMPLATE_INFO (decl) = tree_cons (tmpl, targs, NULL_TREE); |
36a117a5 | 1795 | |
8afa707f MM |
1796 | /* Inherit default function arguments from the template |
1797 | DECL is specializing. */ | |
1798 | copy_default_args_to_explicit_spec (decl); | |
1799 | ||
c750255c MM |
1800 | /* This specialization has the same protection as the |
1801 | template it specializes. */ | |
1802 | TREE_PRIVATE (decl) = TREE_PRIVATE (gen_tmpl); | |
1803 | TREE_PROTECTED (decl) = TREE_PROTECTED (gen_tmpl); | |
1804 | ||
386b8a85 | 1805 | if (is_friend && !have_def) |
36a117a5 MM |
1806 | /* This is not really a declaration of a specialization. |
1807 | It's just the name of an instantiation. But, it's not | |
1808 | a request for an instantiation, either. */ | |
fbf1c34b | 1809 | SET_DECL_IMPLICIT_INSTANTIATION (decl); |
08511114 KL |
1810 | else if (DECL_CONSTRUCTOR_P (decl) || DECL_DESTRUCTOR_P (decl)) |
1811 | /* This is indeed a specialization. In case of constructors | |
1812 | and destructors, we need in-charge and not-in-charge | |
1813 | versions in V3 ABI. */ | |
1814 | clone_function_decl (decl, /*update_method_vec_p=*/0); | |
75650646 | 1815 | |
36a117a5 MM |
1816 | /* Register this specialization so that we can find it |
1817 | again. */ | |
1818 | decl = register_specialization (decl, gen_tmpl, targs); | |
386b8a85 JM |
1819 | } |
1820 | } | |
75650646 | 1821 | |
e1467ff2 | 1822 | return decl; |
386b8a85 | 1823 | } |
75650646 | 1824 | |
39c01e4c MM |
1825 | /* TYPE is being declared. Verify that the use of template headers |
1826 | and such is reasonable. Issue error messages if not. */ | |
1827 | ||
1828 | void | |
3a978d72 | 1829 | maybe_check_template_type (tree type) |
39c01e4c MM |
1830 | { |
1831 | if (template_header_count) | |
1832 | { | |
1833 | /* We are in the scope of some `template <...>' header. */ | |
1834 | ||
1835 | int context_depth | |
1836 | = template_class_depth_real (TYPE_CONTEXT (type), | |
1837 | /*count_specializations=*/1); | |
1838 | ||
1839 | if (template_header_count <= context_depth) | |
1840 | /* This is OK; the template headers are for the context. We | |
1841 | are actually too lenient here; like | |
1842 | check_explicit_specialization we should consider the number | |
1843 | of template types included in the actual declaration. For | |
1844 | example, | |
1845 | ||
1846 | template <class T> struct S { | |
1847 | template <class U> template <class V> | |
1848 | struct I {}; | |
1849 | }; | |
1850 | ||
0e339752 | 1851 | is invalid, but: |
39c01e4c MM |
1852 | |
1853 | template <class T> struct S { | |
1854 | template <class U> struct I; | |
1855 | }; | |
1856 | ||
1857 | template <class T> template <class U. | |
1858 | struct S<T>::I {}; | |
1859 | ||
1860 | is not. */ | |
1861 | ; | |
1862 | else if (template_header_count > context_depth + 1) | |
1863 | /* There are two many template parameter lists. */ | |
33bd39a2 | 1864 | error ("too many template parameter lists in declaration of `%T'", type); |
39c01e4c MM |
1865 | } |
1866 | } | |
1867 | ||
75650646 MM |
1868 | /* Returns 1 iff PARMS1 and PARMS2 are identical sets of template |
1869 | parameters. These are represented in the same format used for | |
1870 | DECL_TEMPLATE_PARMS. */ | |
1871 | ||
3a978d72 | 1872 | int comp_template_parms (tree parms1, tree parms2) |
75650646 MM |
1873 | { |
1874 | tree p1; | |
1875 | tree p2; | |
1876 | ||
1877 | if (parms1 == parms2) | |
1878 | return 1; | |
1879 | ||
1880 | for (p1 = parms1, p2 = parms2; | |
1881 | p1 != NULL_TREE && p2 != NULL_TREE; | |
1882 | p1 = TREE_CHAIN (p1), p2 = TREE_CHAIN (p2)) | |
1883 | { | |
1884 | tree t1 = TREE_VALUE (p1); | |
1885 | tree t2 = TREE_VALUE (p2); | |
1886 | int i; | |
1887 | ||
1888 | my_friendly_assert (TREE_CODE (t1) == TREE_VEC, 0); | |
1889 | my_friendly_assert (TREE_CODE (t2) == TREE_VEC, 0); | |
1890 | ||
1891 | if (TREE_VEC_LENGTH (t1) != TREE_VEC_LENGTH (t2)) | |
1892 | return 0; | |
1893 | ||
1894 | for (i = 0; i < TREE_VEC_LENGTH (t2); ++i) | |
1895 | { | |
1896 | tree parm1 = TREE_VALUE (TREE_VEC_ELT (t1, i)); | |
1897 | tree parm2 = TREE_VALUE (TREE_VEC_ELT (t2, i)); | |
1898 | ||
1899 | if (TREE_CODE (parm1) != TREE_CODE (parm2)) | |
1900 | return 0; | |
1901 | ||
1902 | if (TREE_CODE (parm1) == TEMPLATE_TYPE_PARM) | |
1903 | continue; | |
3bfdc719 | 1904 | else if (!same_type_p (TREE_TYPE (parm1), TREE_TYPE (parm2))) |
75650646 MM |
1905 | return 0; |
1906 | } | |
1907 | } | |
1908 | ||
1909 | if ((p1 != NULL_TREE) != (p2 != NULL_TREE)) | |
1910 | /* One set of parameters has more parameters lists than the | |
1911 | other. */ | |
1912 | return 0; | |
1913 | ||
1914 | return 1; | |
1915 | } | |
1916 | ||
f3400fe2 JM |
1917 | /* Complain if DECL shadows a template parameter. |
1918 | ||
1919 | [temp.local]: A template-parameter shall not be redeclared within its | |
1920 | scope (including nested scopes). */ | |
1921 | ||
1922 | void | |
3a978d72 | 1923 | check_template_shadow (tree decl) |
f3400fe2 | 1924 | { |
8f032717 MM |
1925 | tree olddecl; |
1926 | ||
b5d9b9ab MM |
1927 | /* If we're not in a template, we can't possibly shadow a template |
1928 | parameter. */ | |
1929 | if (!current_template_parms) | |
1930 | return; | |
1931 | ||
1932 | /* Figure out what we're shadowing. */ | |
8f032717 MM |
1933 | if (TREE_CODE (decl) == OVERLOAD) |
1934 | decl = OVL_CURRENT (decl); | |
1935 | olddecl = IDENTIFIER_VALUE (DECL_NAME (decl)); | |
f3400fe2 | 1936 | |
b5d9b9ab MM |
1937 | /* If there's no previous binding for this name, we're not shadowing |
1938 | anything, let alone a template parameter. */ | |
1939 | if (!olddecl) | |
1940 | return; | |
1941 | ||
1942 | /* If we're not shadowing a template parameter, we're done. Note | |
1943 | that OLDDECL might be an OVERLOAD (or perhaps even an | |
1944 | ERROR_MARK), so we can't just blithely assume it to be a _DECL | |
1945 | node. */ | |
2f939d94 | 1946 | if (!DECL_P (olddecl) || !DECL_TEMPLATE_PARM_P (olddecl)) |
b5d9b9ab MM |
1947 | return; |
1948 | ||
1949 | /* We check for decl != olddecl to avoid bogus errors for using a | |
1950 | name inside a class. We check TPFI to avoid duplicate errors for | |
1951 | inline member templates. */ | |
1952 | if (decl == olddecl | |
1953 | || TEMPLATE_PARMS_FOR_INLINE (current_template_parms)) | |
1954 | return; | |
1955 | ||
1956 | cp_error_at ("declaration of `%#D'", decl); | |
1957 | cp_error_at (" shadows template parm `%#D'", olddecl); | |
f3400fe2 | 1958 | } |
22a7be53 | 1959 | |
f3400fe2 | 1960 | /* Return a new TEMPLATE_PARM_INDEX with the indicated INDEX, LEVEL, |
f84b4be9 JM |
1961 | ORIG_LEVEL, DECL, and TYPE. */ |
1962 | ||
1963 | static tree | |
3a978d72 NN |
1964 | build_template_parm_index (int index, |
1965 | int level, | |
1966 | int orig_level, | |
1967 | tree decl, | |
1968 | tree type) | |
f84b4be9 JM |
1969 | { |
1970 | tree t = make_node (TEMPLATE_PARM_INDEX); | |
1971 | TEMPLATE_PARM_IDX (t) = index; | |
1972 | TEMPLATE_PARM_LEVEL (t) = level; | |
1973 | TEMPLATE_PARM_ORIG_LEVEL (t) = orig_level; | |
1974 | TEMPLATE_PARM_DECL (t) = decl; | |
1975 | TREE_TYPE (t) = type; | |
3e4a3562 NS |
1976 | TREE_CONSTANT (t) = TREE_CONSTANT (decl); |
1977 | TREE_READONLY (t) = TREE_READONLY (decl); | |
f84b4be9 JM |
1978 | |
1979 | return t; | |
1980 | } | |
1981 | ||
f84b4be9 | 1982 | /* Return a TEMPLATE_PARM_INDEX, similar to INDEX, but whose |
93cdc044 | 1983 | TEMPLATE_PARM_LEVEL has been decreased by LEVELS. If such a |
f84b4be9 JM |
1984 | TEMPLATE_PARM_INDEX already exists, it is returned; otherwise, a |
1985 | new one is created. */ | |
1986 | ||
1987 | static tree | |
3a978d72 | 1988 | reduce_template_parm_level (tree index, tree type, int levels) |
f84b4be9 JM |
1989 | { |
1990 | if (TEMPLATE_PARM_DESCENDANTS (index) == NULL_TREE | |
1991 | || (TEMPLATE_PARM_LEVEL (TEMPLATE_PARM_DESCENDANTS (index)) | |
93cdc044 | 1992 | != TEMPLATE_PARM_LEVEL (index) - levels)) |
f84b4be9 | 1993 | { |
3e4a3562 NS |
1994 | tree orig_decl = TEMPLATE_PARM_DECL (index); |
1995 | tree decl, t; | |
1996 | ||
1997 | decl = build_decl (TREE_CODE (orig_decl), DECL_NAME (orig_decl), type); | |
1998 | TREE_CONSTANT (decl) = TREE_CONSTANT (orig_decl); | |
1999 | TREE_READONLY (decl) = TREE_READONLY (orig_decl); | |
2000 | DECL_ARTIFICIAL (decl) = 1; | |
2001 | SET_DECL_TEMPLATE_PARM_P (decl); | |
2002 | ||
2003 | t = build_template_parm_index (TEMPLATE_PARM_IDX (index), | |
93cdc044 | 2004 | TEMPLATE_PARM_LEVEL (index) - levels, |
f84b4be9 JM |
2005 | TEMPLATE_PARM_ORIG_LEVEL (index), |
2006 | decl, type); | |
2007 | TEMPLATE_PARM_DESCENDANTS (index) = t; | |
cae40af6 JM |
2008 | |
2009 | /* Template template parameters need this. */ | |
2010 | DECL_TEMPLATE_PARMS (decl) | |
2011 | = DECL_TEMPLATE_PARMS (TEMPLATE_PARM_DECL (index)); | |
f84b4be9 JM |
2012 | } |
2013 | ||
2014 | return TEMPLATE_PARM_DESCENDANTS (index); | |
2015 | } | |
2016 | ||
8d08fdba | 2017 | /* Process information from new template parameter NEXT and append it to the |
5566b478 | 2018 | LIST being built. */ |
e92cc029 | 2019 | |
8d08fdba | 2020 | tree |
3a978d72 | 2021 | process_template_parm (tree list, tree next) |
8d08fdba MS |
2022 | { |
2023 | tree parm; | |
2024 | tree decl = 0; | |
a292b002 | 2025 | tree defval; |
5566b478 | 2026 | int is_type, idx; |
f84b4be9 | 2027 | |
8d08fdba MS |
2028 | parm = next; |
2029 | my_friendly_assert (TREE_CODE (parm) == TREE_LIST, 259); | |
a292b002 MS |
2030 | defval = TREE_PURPOSE (parm); |
2031 | parm = TREE_VALUE (parm); | |
2032 | is_type = TREE_PURPOSE (parm) == class_type_node; | |
5566b478 MS |
2033 | |
2034 | if (list) | |
2035 | { | |
2036 | tree p = TREE_VALUE (tree_last (list)); | |
2037 | ||
1899c3a4 | 2038 | if (TREE_CODE (p) == TYPE_DECL || TREE_CODE (p) == TEMPLATE_DECL) |
5566b478 MS |
2039 | idx = TEMPLATE_TYPE_IDX (TREE_TYPE (p)); |
2040 | else | |
f84b4be9 | 2041 | idx = TEMPLATE_PARM_IDX (DECL_INITIAL (p)); |
5566b478 MS |
2042 | ++idx; |
2043 | } | |
2044 | else | |
2045 | idx = 0; | |
2046 | ||
8d08fdba MS |
2047 | if (!is_type) |
2048 | { | |
a292b002 | 2049 | my_friendly_assert (TREE_CODE (TREE_PURPOSE (parm)) == TREE_LIST, 260); |
8d08fdba | 2050 | /* is a const-param */ |
a292b002 | 2051 | parm = grokdeclarator (TREE_VALUE (parm), TREE_PURPOSE (parm), |
91d231cb | 2052 | PARM, 0, NULL); |
833aa4c4 | 2053 | SET_DECL_TEMPLATE_PARM_P (parm); |
d490621d MM |
2054 | |
2055 | /* [temp.param] | |
2056 | ||
2057 | The top-level cv-qualifiers on the template-parameter are | |
2058 | ignored when determining its type. */ | |
2059 | TREE_TYPE (parm) = TYPE_MAIN_VARIANT (TREE_TYPE (parm)); | |
2060 | ||
8d08fdba | 2061 | /* A template parameter is not modifiable. */ |
3e4a3562 | 2062 | TREE_READONLY (parm) = TREE_CONSTANT (parm) = 1; |
11b810f1 | 2063 | if (invalid_nontype_parm_type_p (TREE_TYPE (parm), 1)) |
db3f4e4e | 2064 | TREE_TYPE (parm) = void_type_node; |
8d08fdba | 2065 | decl = build_decl (CONST_DECL, DECL_NAME (parm), TREE_TYPE (parm)); |
3e4a3562 | 2066 | TREE_CONSTANT (decl) = TREE_READONLY (decl) = 1; |
f84b4be9 JM |
2067 | DECL_INITIAL (parm) = DECL_INITIAL (decl) |
2068 | = build_template_parm_index (idx, processing_template_decl, | |
2069 | processing_template_decl, | |
2070 | decl, TREE_TYPE (parm)); | |
8d08fdba MS |
2071 | } |
2072 | else | |
2073 | { | |
73b0fce8 KL |
2074 | tree t; |
2075 | parm = TREE_VALUE (parm); | |
2076 | ||
2077 | if (parm && TREE_CODE (parm) == TEMPLATE_DECL) | |
2078 | { | |
33848bb0 | 2079 | t = make_aggr_type (TEMPLATE_TEMPLATE_PARM); |
73b0fce8 KL |
2080 | /* This is for distinguishing between real templates and template |
2081 | template parameters */ | |
2082 | TREE_TYPE (parm) = t; | |
2083 | TREE_TYPE (DECL_TEMPLATE_RESULT (parm)) = t; | |
2084 | decl = parm; | |
2085 | } | |
2086 | else | |
2087 | { | |
33848bb0 | 2088 | t = make_aggr_type (TEMPLATE_TYPE_PARM); |
73b0fce8 KL |
2089 | /* parm is either IDENTIFIER_NODE or NULL_TREE */ |
2090 | decl = build_decl (TYPE_DECL, parm, t); | |
2091 | } | |
2092 | ||
d2e5ee5c MS |
2093 | TYPE_NAME (t) = decl; |
2094 | TYPE_STUB_DECL (t) = decl; | |
a292b002 | 2095 | parm = decl; |
f84b4be9 JM |
2096 | TEMPLATE_TYPE_PARM_INDEX (t) |
2097 | = build_template_parm_index (idx, processing_template_decl, | |
2098 | processing_template_decl, | |
2099 | decl, TREE_TYPE (parm)); | |
8d08fdba | 2100 | } |
c727aa5e | 2101 | DECL_ARTIFICIAL (decl) = 1; |
cd9f6678 | 2102 | SET_DECL_TEMPLATE_PARM_P (decl); |
8d08fdba | 2103 | pushdecl (decl); |
a292b002 | 2104 | parm = build_tree_list (defval, parm); |
8d08fdba MS |
2105 | return chainon (list, parm); |
2106 | } | |
2107 | ||
2108 | /* The end of a template parameter list has been reached. Process the | |
2109 | tree list into a parameter vector, converting each parameter into a more | |
2110 | useful form. Type parameters are saved as IDENTIFIER_NODEs, and others | |
2111 | as PARM_DECLs. */ | |
2112 | ||
2113 | tree | |
3a978d72 | 2114 | end_template_parm_list (tree parms) |
8d08fdba | 2115 | { |
5566b478 | 2116 | int nparms; |
9471d3e2 | 2117 | tree parm, next; |
5566b478 MS |
2118 | tree saved_parmlist = make_tree_vec (list_length (parms)); |
2119 | ||
5566b478 | 2120 | current_template_parms |
4890c2f4 | 2121 | = tree_cons (size_int (processing_template_decl), |
5566b478 | 2122 | saved_parmlist, current_template_parms); |
8d08fdba | 2123 | |
9471d3e2 NS |
2124 | for (parm = parms, nparms = 0; parm; parm = next, nparms++) |
2125 | { | |
2126 | next = TREE_CHAIN (parm); | |
2127 | TREE_VEC_ELT (saved_parmlist, nparms) = parm; | |
2128 | TREE_CHAIN (parm) = NULL_TREE; | |
2129 | } | |
a292b002 | 2130 | |
67ffc812 MM |
2131 | --processing_template_parmlist; |
2132 | ||
8d08fdba MS |
2133 | return saved_parmlist; |
2134 | } | |
2135 | ||
5566b478 MS |
2136 | /* end_template_decl is called after a template declaration is seen. */ |
2137 | ||
8d08fdba | 2138 | void |
3a978d72 | 2139 | end_template_decl (void) |
8d08fdba | 2140 | { |
386b8a85 JM |
2141 | reset_specialization (); |
2142 | ||
5156628f | 2143 | if (! processing_template_decl) |
73aad9b9 JM |
2144 | return; |
2145 | ||
5566b478 | 2146 | /* This matches the pushlevel in begin_template_parm_list. */ |
74b846e0 | 2147 | finish_scope (); |
8d08fdba | 2148 | |
5566b478 MS |
2149 | --processing_template_decl; |
2150 | current_template_parms = TREE_CHAIN (current_template_parms); | |
5566b478 | 2151 | } |
8d08fdba | 2152 | |
36a117a5 MM |
2153 | /* Given a template argument vector containing the template PARMS. |
2154 | The innermost PARMS are given first. */ | |
9a3b49ac MS |
2155 | |
2156 | tree | |
3a978d72 | 2157 | current_template_args (void) |
5566b478 | 2158 | { |
36a117a5 | 2159 | tree header; |
b370501f | 2160 | tree args = NULL_TREE; |
36a117a5 | 2161 | int length = TMPL_PARMS_DEPTH (current_template_parms); |
98c1c668 JM |
2162 | int l = length; |
2163 | ||
36a117a5 MM |
2164 | /* If there is only one level of template parameters, we do not |
2165 | create a TREE_VEC of TREE_VECs. Instead, we return a single | |
2166 | TREE_VEC containing the arguments. */ | |
2167 | if (length > 1) | |
2168 | args = make_tree_vec (length); | |
2169 | ||
2170 | for (header = current_template_parms; header; header = TREE_CHAIN (header)) | |
8d08fdba | 2171 | { |
5566b478 | 2172 | tree a = copy_node (TREE_VALUE (header)); |
36a117a5 MM |
2173 | int i; |
2174 | ||
5566b478 | 2175 | TREE_TYPE (a) = NULL_TREE; |
36a117a5 | 2176 | for (i = TREE_VEC_LENGTH (a) - 1; i >= 0; --i) |
5566b478 | 2177 | { |
98c1c668 JM |
2178 | tree t = TREE_VEC_ELT (a, i); |
2179 | ||
36a117a5 | 2180 | /* T will be a list if we are called from within a |
98c1c668 JM |
2181 | begin/end_template_parm_list pair, but a vector directly |
2182 | if within a begin/end_member_template_processing pair. */ | |
2183 | if (TREE_CODE (t) == TREE_LIST) | |
2184 | { | |
2185 | t = TREE_VALUE (t); | |
2186 | ||
73b0fce8 KL |
2187 | if (TREE_CODE (t) == TYPE_DECL |
2188 | || TREE_CODE (t) == TEMPLATE_DECL) | |
98c1c668 JM |
2189 | t = TREE_TYPE (t); |
2190 | else | |
2191 | t = DECL_INITIAL (t); | |
36a117a5 | 2192 | TREE_VEC_ELT (a, i) = t; |
98c1c668 | 2193 | } |
5566b478 | 2194 | } |
36a117a5 MM |
2195 | |
2196 | if (length > 1) | |
2197 | TREE_VEC_ELT (args, --l) = a; | |
2198 | else | |
2199 | args = a; | |
8d08fdba MS |
2200 | } |
2201 | ||
9a3b49ac MS |
2202 | return args; |
2203 | } | |
75650646 | 2204 | |
e1467ff2 MM |
2205 | /* Return a TEMPLATE_DECL corresponding to DECL, using the indicated |
2206 | template PARMS. Used by push_template_decl below. */ | |
2207 | ||
75650646 | 2208 | static tree |
3a978d72 | 2209 | build_template_decl (tree decl, tree parms) |
75650646 MM |
2210 | { |
2211 | tree tmpl = build_lang_decl (TEMPLATE_DECL, DECL_NAME (decl), NULL_TREE); | |
2212 | DECL_TEMPLATE_PARMS (tmpl) = parms; | |
2213 | DECL_CONTEXT (tmpl) = DECL_CONTEXT (decl); | |
2214 | if (DECL_LANG_SPECIFIC (decl)) | |
2215 | { | |
8f032717 MM |
2216 | DECL_STATIC_FUNCTION_P (tmpl) = DECL_STATIC_FUNCTION_P (decl); |
2217 | DECL_CONSTRUCTOR_P (tmpl) = DECL_CONSTRUCTOR_P (decl); | |
c8460010 | 2218 | DECL_DESTRUCTOR_P (tmpl) = DECL_DESTRUCTOR_P (decl); |
11f98788 | 2219 | DECL_NONCONVERTING_P (tmpl) = DECL_NONCONVERTING_P (decl); |
1f6e1acc AS |
2220 | DECL_ASSIGNMENT_OPERATOR_P (tmpl) = DECL_ASSIGNMENT_OPERATOR_P (decl); |
2221 | if (DECL_OVERLOADED_OPERATOR_P (decl)) | |
2222 | SET_OVERLOADED_OPERATOR_CODE (tmpl, | |
2223 | DECL_OVERLOADED_OPERATOR_P (decl)); | |
75650646 MM |
2224 | } |
2225 | ||
2226 | return tmpl; | |
2227 | } | |
2228 | ||
050367a3 MM |
2229 | struct template_parm_data |
2230 | { | |
6c30752f MM |
2231 | /* The level of the template parameters we are currently |
2232 | processing. */ | |
050367a3 | 2233 | int level; |
6c30752f MM |
2234 | |
2235 | /* The index of the specialization argument we are currently | |
2236 | processing. */ | |
2237 | int current_arg; | |
2238 | ||
2239 | /* An array whose size is the number of template parameters. The | |
838dfd8a | 2240 | elements are nonzero if the parameter has been used in any one |
6c30752f | 2241 | of the arguments processed so far. */ |
050367a3 | 2242 | int* parms; |
6c30752f MM |
2243 | |
2244 | /* An array whose size is the number of template arguments. The | |
838dfd8a | 2245 | elements are nonzero if the argument makes use of template |
6c30752f MM |
2246 | parameters of this level. */ |
2247 | int* arg_uses_template_parms; | |
050367a3 MM |
2248 | }; |
2249 | ||
2250 | /* Subroutine of push_template_decl used to see if each template | |
2251 | parameter in a partial specialization is used in the explicit | |
2252 | argument list. If T is of the LEVEL given in DATA (which is | |
2253 | treated as a template_parm_data*), then DATA->PARMS is marked | |
2254 | appropriately. */ | |
2255 | ||
2256 | static int | |
3a978d72 | 2257 | mark_template_parm (tree t, void* data) |
050367a3 MM |
2258 | { |
2259 | int level; | |
2260 | int idx; | |
2261 | struct template_parm_data* tpd = (struct template_parm_data*) data; | |
2262 | ||
2263 | if (TREE_CODE (t) == TEMPLATE_PARM_INDEX) | |
2264 | { | |
2265 | level = TEMPLATE_PARM_LEVEL (t); | |
2266 | idx = TEMPLATE_PARM_IDX (t); | |
2267 | } | |
2268 | else | |
2269 | { | |
2270 | level = TEMPLATE_TYPE_LEVEL (t); | |
2271 | idx = TEMPLATE_TYPE_IDX (t); | |
2272 | } | |
2273 | ||
2274 | if (level == tpd->level) | |
6c30752f MM |
2275 | { |
2276 | tpd->parms[idx] = 1; | |
2277 | tpd->arg_uses_template_parms[tpd->current_arg] = 1; | |
2278 | } | |
050367a3 MM |
2279 | |
2280 | /* Return zero so that for_each_template_parm will continue the | |
2281 | traversal of the tree; we want to mark *every* template parm. */ | |
2282 | return 0; | |
2283 | } | |
2284 | ||
6c30752f MM |
2285 | /* Process the partial specialization DECL. */ |
2286 | ||
e9659ab0 | 2287 | static tree |
3a978d72 | 2288 | process_partial_specialization (tree decl) |
6c30752f MM |
2289 | { |
2290 | tree type = TREE_TYPE (decl); | |
2291 | tree maintmpl = CLASSTYPE_TI_TEMPLATE (type); | |
2292 | tree specargs = CLASSTYPE_TI_ARGS (type); | |
f9a7ae04 | 2293 | tree inner_args = INNERMOST_TEMPLATE_ARGS (specargs); |
6c30752f MM |
2294 | tree inner_parms = INNERMOST_TEMPLATE_PARMS (current_template_parms); |
2295 | tree main_inner_parms = DECL_INNERMOST_TEMPLATE_PARMS (maintmpl); | |
2296 | int nargs = TREE_VEC_LENGTH (inner_args); | |
2297 | int ntparms = TREE_VEC_LENGTH (inner_parms); | |
2298 | int i; | |
2299 | int did_error_intro = 0; | |
6c30752f MM |
2300 | struct template_parm_data tpd; |
2301 | struct template_parm_data tpd2; | |
2302 | ||
6c30752f MM |
2303 | /* We check that each of the template parameters given in the |
2304 | partial specialization is used in the argument list to the | |
2305 | specialization. For example: | |
2306 | ||
2307 | template <class T> struct S; | |
2308 | template <class T> struct S<T*>; | |
2309 | ||
2310 | The second declaration is OK because `T*' uses the template | |
2311 | parameter T, whereas | |
2312 | ||
2313 | template <class T> struct S<int>; | |
2314 | ||
2315 | is no good. Even trickier is: | |
2316 | ||
2317 | template <class T> | |
2318 | struct S1 | |
2319 | { | |
2320 | template <class U> | |
2321 | struct S2; | |
2322 | template <class U> | |
2323 | struct S2<T>; | |
2324 | }; | |
2325 | ||
0e339752 | 2326 | The S2<T> declaration is actually invalid; it is a |
6c30752f MM |
2327 | full-specialization. Of course, |
2328 | ||
2329 | template <class U> | |
2330 | struct S2<T (*)(U)>; | |
2331 | ||
2332 | or some such would have been OK. */ | |
2333 | tpd.level = TMPL_PARMS_DEPTH (current_template_parms); | |
2334 | tpd.parms = alloca (sizeof (int) * ntparms); | |
fad205ff | 2335 | memset (tpd.parms, 0, sizeof (int) * ntparms); |
6c30752f MM |
2336 | |
2337 | tpd.arg_uses_template_parms = alloca (sizeof (int) * nargs); | |
fad205ff | 2338 | memset (tpd.arg_uses_template_parms, 0, sizeof (int) * nargs); |
6c30752f MM |
2339 | for (i = 0; i < nargs; ++i) |
2340 | { | |
2341 | tpd.current_arg = i; | |
2342 | for_each_template_parm (TREE_VEC_ELT (inner_args, i), | |
2343 | &mark_template_parm, | |
4f2c9d7e MM |
2344 | &tpd, |
2345 | NULL); | |
6c30752f MM |
2346 | } |
2347 | for (i = 0; i < ntparms; ++i) | |
2348 | if (tpd.parms[i] == 0) | |
2349 | { | |
2350 | /* One of the template parms was not used in the | |
f9a7ae04 | 2351 | specialization. */ |
6c30752f MM |
2352 | if (!did_error_intro) |
2353 | { | |
33bd39a2 | 2354 | error ("template parameters not used in partial specialization:"); |
6c30752f MM |
2355 | did_error_intro = 1; |
2356 | } | |
2357 | ||
33bd39a2 | 2358 | error (" `%D'", |
6c30752f MM |
2359 | TREE_VALUE (TREE_VEC_ELT (inner_parms, i))); |
2360 | } | |
2361 | ||
2362 | /* [temp.class.spec] | |
2363 | ||
2364 | The argument list of the specialization shall not be identical to | |
2365 | the implicit argument list of the primary template. */ | |
f9a7ae04 MM |
2366 | if (comp_template_args |
2367 | (inner_args, | |
2368 | INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (TREE_TYPE | |
2369 | (maintmpl))))) | |
33bd39a2 | 2370 | error ("partial specialization `%T' does not specialize any template arguments", type); |
6c30752f MM |
2371 | |
2372 | /* [temp.class.spec] | |
2373 | ||
2374 | A partially specialized non-type argument expression shall not | |
2375 | involve template parameters of the partial specialization except | |
2376 | when the argument expression is a simple identifier. | |
2377 | ||
2378 | The type of a template parameter corresponding to a specialized | |
2379 | non-type argument shall not be dependent on a parameter of the | |
2380 | specialization. */ | |
2381 | my_friendly_assert (nargs == DECL_NTPARMS (maintmpl), 0); | |
2382 | tpd2.parms = 0; | |
2383 | for (i = 0; i < nargs; ++i) | |
2384 | { | |
2385 | tree arg = TREE_VEC_ELT (inner_args, i); | |
2386 | if (/* These first two lines are the `non-type' bit. */ | |
2f939d94 | 2387 | !TYPE_P (arg) |
6c30752f MM |
2388 | && TREE_CODE (arg) != TEMPLATE_DECL |
2389 | /* This next line is the `argument expression is not just a | |
2390 | simple identifier' condition and also the `specialized | |
2391 | non-type argument' bit. */ | |
2392 | && TREE_CODE (arg) != TEMPLATE_PARM_INDEX) | |
2393 | { | |
2394 | if (tpd.arg_uses_template_parms[i]) | |
33bd39a2 | 2395 | error ("template argument `%E' involves template parameter(s)", arg); |
6c30752f MM |
2396 | else |
2397 | { | |
2398 | /* Look at the corresponding template parameter, | |
2399 | marking which template parameters its type depends | |
2400 | upon. */ | |
2401 | tree type = | |
2402 | TREE_TYPE (TREE_VALUE (TREE_VEC_ELT (main_inner_parms, | |
2403 | i))); | |
2404 | ||
2405 | if (!tpd2.parms) | |
2406 | { | |
2407 | /* We haven't yet initialized TPD2. Do so now. */ | |
2408 | tpd2.arg_uses_template_parms | |
c68b0a84 | 2409 | = alloca (sizeof (int) * nargs); |
104bf76a | 2410 | /* The number of parameters here is the number in the |
76a83782 RH |
2411 | main template, which, as checked in the assertion |
2412 | above, is NARGS. */ | |
c68b0a84 | 2413 | tpd2.parms = alloca (sizeof (int) * nargs); |
6c30752f MM |
2414 | tpd2.level = |
2415 | TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (maintmpl)); | |
2416 | } | |
2417 | ||
104bf76a | 2418 | /* Mark the template parameters. But this time, we're |
6c30752f MM |
2419 | looking for the template parameters of the main |
2420 | template, not in the specialization. */ | |
2421 | tpd2.current_arg = i; | |
2422 | tpd2.arg_uses_template_parms[i] = 0; | |
fad205ff | 2423 | memset (tpd2.parms, 0, sizeof (int) * nargs); |
6c30752f MM |
2424 | for_each_template_parm (type, |
2425 | &mark_template_parm, | |
4f2c9d7e MM |
2426 | &tpd2, |
2427 | NULL); | |
6c30752f MM |
2428 | |
2429 | if (tpd2.arg_uses_template_parms [i]) | |
2430 | { | |
2431 | /* The type depended on some template parameters. | |
2432 | If they are fully specialized in the | |
2433 | specialization, that's OK. */ | |
2434 | int j; | |
2435 | for (j = 0; j < nargs; ++j) | |
2436 | if (tpd2.parms[j] != 0 | |
2437 | && tpd.arg_uses_template_parms [j]) | |
2438 | { | |
33bd39a2 | 2439 | error ("type `%T' of template argument `%E' depends on template parameter(s)", |
6c30752f MM |
2440 | type, |
2441 | arg); | |
2442 | break; | |
2443 | } | |
2444 | } | |
2445 | } | |
2446 | } | |
2447 | } | |
2448 | ||
2449 | if (retrieve_specialization (maintmpl, specargs)) | |
2450 | /* We've already got this specialization. */ | |
2451 | return decl; | |
2452 | ||
d8b64f80 | 2453 | DECL_TEMPLATE_SPECIALIZATIONS (maintmpl) |
e1b3e07d MM |
2454 | = tree_cons (inner_args, inner_parms, |
2455 | DECL_TEMPLATE_SPECIALIZATIONS (maintmpl)); | |
6c30752f MM |
2456 | TREE_TYPE (DECL_TEMPLATE_SPECIALIZATIONS (maintmpl)) = type; |
2457 | return decl; | |
2458 | } | |
2459 | ||
6ba89f8e MM |
2460 | /* Check that a template declaration's use of default arguments is not |
2461 | invalid. Here, PARMS are the template parameters. IS_PRIMARY is | |
838dfd8a KH |
2462 | nonzero if DECL is the thing declared by a primary template. |
2463 | IS_PARTIAL is nonzero if DECL is a partial specialization. */ | |
6ba89f8e MM |
2464 | |
2465 | static void | |
3a978d72 | 2466 | check_default_tmpl_args (tree decl, tree parms, int is_primary, int is_partial) |
6ba89f8e | 2467 | { |
d8e178a0 | 2468 | const char *msg; |
66191c20 MM |
2469 | int last_level_to_check; |
2470 | tree parm_level; | |
6ba89f8e MM |
2471 | |
2472 | /* [temp.param] | |
2473 | ||
2474 | A default template-argument shall not be specified in a | |
2475 | function template declaration or a function template definition, nor | |
2476 | in the template-parameter-list of the definition of a member of a | |
2477 | class template. */ | |
2478 | ||
4f1c5b7d | 2479 | if (TREE_CODE (CP_DECL_CONTEXT (decl)) == FUNCTION_DECL) |
e0942dcd MM |
2480 | /* You can't have a function template declaration in a local |
2481 | scope, nor you can you define a member of a class template in a | |
2482 | local scope. */ | |
2483 | return; | |
2484 | ||
6ba89f8e MM |
2485 | if (current_class_type |
2486 | && !TYPE_BEING_DEFINED (current_class_type) | |
3d7de1fa | 2487 | && DECL_LANG_SPECIFIC (decl) |
5937a6f9 MM |
2488 | /* If this is either a friend defined in the scope of the class |
2489 | or a member function. */ | |
6df5158a NS |
2490 | && (DECL_FUNCTION_MEMBER_P (decl) |
2491 | ? same_type_p (DECL_CONTEXT (decl), current_class_type) | |
2492 | : DECL_FRIEND_CONTEXT (decl) | |
2493 | ? same_type_p (DECL_FRIEND_CONTEXT (decl), current_class_type) | |
2494 | : false) | |
5937a6f9 MM |
2495 | /* And, if it was a member function, it really was defined in |
2496 | the scope of the class. */ | |
6df5158a NS |
2497 | && (!DECL_FUNCTION_MEMBER_P (decl) |
2498 | || DECL_INITIALIZED_IN_CLASS_P (decl))) | |
6ba89f8e | 2499 | /* We already checked these parameters when the template was |
5937a6f9 MM |
2500 | declared, so there's no need to do it again now. This function |
2501 | was defined in class scope, but we're processing it's body now | |
2502 | that the class is complete. */ | |
6ba89f8e MM |
2503 | return; |
2504 | ||
66191c20 MM |
2505 | /* [temp.param] |
2506 | ||
2507 | If a template-parameter has a default template-argument, all | |
2508 | subsequent template-parameters shall have a default | |
2509 | template-argument supplied. */ | |
2510 | for (parm_level = parms; parm_level; parm_level = TREE_CHAIN (parm_level)) | |
2511 | { | |
2512 | tree inner_parms = TREE_VALUE (parm_level); | |
2513 | int ntparms = TREE_VEC_LENGTH (inner_parms); | |
2514 | int seen_def_arg_p = 0; | |
2515 | int i; | |
2516 | ||
2517 | for (i = 0; i < ntparms; ++i) | |
2518 | { | |
2519 | tree parm = TREE_VEC_ELT (inner_parms, i); | |
2520 | if (TREE_PURPOSE (parm)) | |
2521 | seen_def_arg_p = 1; | |
2522 | else if (seen_def_arg_p) | |
2523 | { | |
33bd39a2 | 2524 | error ("no default argument for `%D'", TREE_VALUE (parm)); |
66191c20 MM |
2525 | /* For better subsequent error-recovery, we indicate that |
2526 | there should have been a default argument. */ | |
2527 | TREE_PURPOSE (parm) = error_mark_node; | |
2528 | } | |
2529 | } | |
2530 | } | |
2531 | ||
6ba89f8e MM |
2532 | if (TREE_CODE (decl) != TYPE_DECL || is_partial || !is_primary) |
2533 | /* For an ordinary class template, default template arguments are | |
2534 | allowed at the innermost level, e.g.: | |
2535 | template <class T = int> | |
2536 | struct S {}; | |
2537 | but, in a partial specialization, they're not allowed even | |
2538 | there, as we have in [temp.class.spec]: | |
2539 | ||
2540 | The template parameter list of a specialization shall not | |
2541 | contain default template argument values. | |
2542 | ||
2543 | So, for a partial specialization, or for a function template, | |
2544 | we look at all of them. */ | |
2545 | ; | |
2546 | else | |
2547 | /* But, for a primary class template that is not a partial | |
2548 | specialization we look at all template parameters except the | |
2549 | innermost ones. */ | |
2550 | parms = TREE_CHAIN (parms); | |
2551 | ||
2552 | /* Figure out what error message to issue. */ | |
2553 | if (TREE_CODE (decl) == FUNCTION_DECL) | |
8653a2c3 | 2554 | msg = "default template arguments may not be used in function templates"; |
6ba89f8e | 2555 | else if (is_partial) |
8653a2c3 | 2556 | msg = "default template arguments may not be used in partial specializations"; |
6ba89f8e MM |
2557 | else |
2558 | msg = "default argument for template parameter for class enclosing `%D'"; | |
2559 | ||
2560 | if (current_class_type && TYPE_BEING_DEFINED (current_class_type)) | |
2561 | /* If we're inside a class definition, there's no need to | |
104bf76a | 2562 | examine the parameters to the class itself. On the one |
6ba89f8e | 2563 | hand, they will be checked when the class is defined, and, |
0e339752 | 2564 | on the other, default arguments are valid in things like: |
6ba89f8e MM |
2565 | template <class T = double> |
2566 | struct S { template <class U> void f(U); }; | |
2567 | Here the default argument for `S' has no bearing on the | |
2568 | declaration of `f'. */ | |
2569 | last_level_to_check = template_class_depth (current_class_type) + 1; | |
2570 | else | |
2571 | /* Check everything. */ | |
2572 | last_level_to_check = 0; | |
2573 | ||
66191c20 MM |
2574 | for (parm_level = parms; |
2575 | parm_level && TMPL_PARMS_DEPTH (parm_level) >= last_level_to_check; | |
2576 | parm_level = TREE_CHAIN (parm_level)) | |
6ba89f8e | 2577 | { |
66191c20 MM |
2578 | tree inner_parms = TREE_VALUE (parm_level); |
2579 | int i; | |
2580 | int ntparms; | |
6ba89f8e MM |
2581 | |
2582 | ntparms = TREE_VEC_LENGTH (inner_parms); | |
2583 | for (i = 0; i < ntparms; ++i) | |
2584 | if (TREE_PURPOSE (TREE_VEC_ELT (inner_parms, i))) | |
2585 | { | |
2586 | if (msg) | |
2587 | { | |
33bd39a2 | 2588 | error (msg, decl); |
6ba89f8e MM |
2589 | msg = 0; |
2590 | } | |
2591 | ||
2592 | /* Clear out the default argument so that we are not | |
2593 | confused later. */ | |
2594 | TREE_PURPOSE (TREE_VEC_ELT (inner_parms, i)) = NULL_TREE; | |
2595 | } | |
2596 | ||
2597 | /* At this point, if we're still interested in issuing messages, | |
2598 | they must apply to classes surrounding the object declared. */ | |
2599 | if (msg) | |
2600 | msg = "default argument for template parameter for class enclosing `%D'"; | |
2601 | } | |
2602 | } | |
2603 | ||
5dd236e2 NS |
2604 | /* Worker for push_template_decl_real, called via |
2605 | for_each_template_parm. DATA is really an int, indicating the | |
2606 | level of the parameters we are interested in. If T is a template | |
838dfd8a | 2607 | parameter of that level, return nonzero. */ |
5dd236e2 NS |
2608 | |
2609 | static int | |
3a978d72 | 2610 | template_parm_this_level_p (tree t, void* data) |
5dd236e2 | 2611 | { |
6e04241f | 2612 | int this_level = *(int *)data; |
5dd236e2 NS |
2613 | int level; |
2614 | ||
2615 | if (TREE_CODE (t) == TEMPLATE_PARM_INDEX) | |
2616 | level = TEMPLATE_PARM_LEVEL (t); | |
2617 | else | |
2618 | level = TEMPLATE_TYPE_LEVEL (t); | |
2619 | return level == this_level; | |
2620 | } | |
2621 | ||
3ac3d9ea | 2622 | /* Creates a TEMPLATE_DECL for the indicated DECL using the template |
f84b4be9 JM |
2623 | parameters given by current_template_args, or reuses a |
2624 | previously existing one, if appropriate. Returns the DECL, or an | |
6757edfe MM |
2625 | equivalent one, if it is replaced via a call to duplicate_decls. |
2626 | ||
838dfd8a | 2627 | If IS_FRIEND is nonzero, DECL is a friend declaration. */ |
3ac3d9ea MM |
2628 | |
2629 | tree | |
3a978d72 | 2630 | push_template_decl_real (tree decl, int is_friend) |
9a3b49ac MS |
2631 | { |
2632 | tree tmpl; | |
f84b4be9 | 2633 | tree args; |
9a3b49ac | 2634 | tree info; |
f84b4be9 JM |
2635 | tree ctx; |
2636 | int primary; | |
6ba89f8e | 2637 | int is_partial; |
cfe507be | 2638 | int new_template_p = 0; |
6ba89f8e MM |
2639 | |
2640 | /* See if this is a partial specialization. */ | |
9188c363 | 2641 | is_partial = (DECL_IMPLICIT_TYPEDEF_P (decl) |
6ba89f8e | 2642 | && TREE_CODE (TREE_TYPE (decl)) != ENUMERAL_TYPE |
370af2d5 | 2643 | && CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_TYPE (decl))); |
6757edfe MM |
2644 | |
2645 | is_friend |= (TREE_CODE (decl) == FUNCTION_DECL && DECL_FRIEND_P (decl)); | |
f84b4be9 JM |
2646 | |
2647 | if (is_friend) | |
2648 | /* For a friend, we want the context of the friend function, not | |
2649 | the type of which it is a friend. */ | |
2650 | ctx = DECL_CONTEXT (decl); | |
4f1c5b7d MM |
2651 | else if (CP_DECL_CONTEXT (decl) |
2652 | && TREE_CODE (CP_DECL_CONTEXT (decl)) != NAMESPACE_DECL) | |
f84b4be9 JM |
2653 | /* In the case of a virtual function, we want the class in which |
2654 | it is defined. */ | |
4f1c5b7d | 2655 | ctx = CP_DECL_CONTEXT (decl); |
f84b4be9 | 2656 | else |
dc957d14 | 2657 | /* Otherwise, if we're currently defining some class, the DECL |
f84b4be9 | 2658 | is assumed to be a member of the class. */ |
9188c363 | 2659 | ctx = current_scope (); |
f84b4be9 | 2660 | |
2c73f9f5 ML |
2661 | if (ctx && TREE_CODE (ctx) == NAMESPACE_DECL) |
2662 | ctx = NULL_TREE; | |
2663 | ||
2664 | if (!DECL_CONTEXT (decl)) | |
cb0dbb9a | 2665 | DECL_CONTEXT (decl) = FROB_CONTEXT (current_namespace); |
2c73f9f5 | 2666 | |
6ba89f8e | 2667 | /* See if this is a primary template. */ |
74b846e0 | 2668 | primary = template_parm_scope_p (); |
9a3b49ac | 2669 | |
83566abf JM |
2670 | if (primary) |
2671 | { | |
2672 | if (current_lang_name == lang_name_c) | |
33bd39a2 | 2673 | error ("template with C linkage"); |
4ce3d537 MM |
2674 | else if (TREE_CODE (decl) == TYPE_DECL |
2675 | && ANON_AGGRNAME_P (DECL_NAME (decl))) | |
33bd39a2 | 2676 | error ("template class without a name"); |
4b0d3cbe MM |
2677 | else if (TREE_CODE (decl) == FUNCTION_DECL |
2678 | && DECL_DESTRUCTOR_P (decl)) | |
2679 | { | |
2680 | /* [temp.mem] | |
2681 | ||
2682 | A destructor shall not be a member template. */ | |
2683 | error ("destructor `%D' declared as member template", decl); | |
2684 | return error_mark_node; | |
2685 | } | |
2aaf816d JM |
2686 | else if ((DECL_IMPLICIT_TYPEDEF_P (decl) |
2687 | && CLASS_TYPE_P (TREE_TYPE (decl))) | |
2688 | || (TREE_CODE (decl) == VAR_DECL && ctx && CLASS_TYPE_P (ctx)) | |
2689 | || TREE_CODE (decl) == FUNCTION_DECL) | |
2690 | /* OK */; | |
2691 | else | |
33bd39a2 | 2692 | error ("template declaration of `%#D'", decl); |
83566abf JM |
2693 | } |
2694 | ||
6ba89f8e MM |
2695 | /* Check to see that the rules regarding the use of default |
2696 | arguments are not being violated. */ | |
2697 | check_default_tmpl_args (decl, current_template_parms, | |
2698 | primary, is_partial); | |
73aad9b9 | 2699 | |
6ba89f8e MM |
2700 | if (is_partial) |
2701 | return process_partial_specialization (decl); | |
d32789d8 | 2702 | |
9a3b49ac MS |
2703 | args = current_template_args (); |
2704 | ||
f84b4be9 JM |
2705 | if (!ctx |
2706 | || TREE_CODE (ctx) == FUNCTION_DECL | |
a723baf1 | 2707 | || (CLASS_TYPE_P (ctx) && TYPE_BEING_DEFINED (ctx)) |
f84b4be9 | 2708 | || (is_friend && !DECL_TEMPLATE_INFO (decl))) |
8d08fdba | 2709 | { |
75650646 | 2710 | if (DECL_LANG_SPECIFIC (decl) |
f84b4be9 JM |
2711 | && DECL_TEMPLATE_INFO (decl) |
2712 | && DECL_TI_TEMPLATE (decl)) | |
2713 | tmpl = DECL_TI_TEMPLATE (decl); | |
1c10870d AS |
2714 | /* If DECL is a TYPE_DECL for a class-template, then there won't |
2715 | be DECL_LANG_SPECIFIC. The information equivalent to | |
2716 | DECL_TEMPLATE_INFO is found in TYPE_TEMPLATE_INFO instead. */ | |
2717 | else if (DECL_IMPLICIT_TYPEDEF_P (decl) | |
2718 | && TYPE_TEMPLATE_INFO (TREE_TYPE (decl)) | |
2719 | && TYPE_TI_TEMPLATE (TREE_TYPE (decl))) | |
2720 | { | |
2721 | /* Since a template declaration already existed for this | |
2722 | class-type, we must be redeclaring it here. Make sure | |
0e339752 | 2723 | that the redeclaration is valid. */ |
1c10870d AS |
2724 | redeclare_class_template (TREE_TYPE (decl), |
2725 | current_template_parms); | |
2726 | /* We don't need to create a new TEMPLATE_DECL; just use the | |
2727 | one we already had. */ | |
2728 | tmpl = TYPE_TI_TEMPLATE (TREE_TYPE (decl)); | |
2729 | } | |
f84b4be9 | 2730 | else |
786b5245 | 2731 | { |
f84b4be9 | 2732 | tmpl = build_template_decl (decl, current_template_parms); |
cfe507be MM |
2733 | new_template_p = 1; |
2734 | ||
f84b4be9 JM |
2735 | if (DECL_LANG_SPECIFIC (decl) |
2736 | && DECL_TEMPLATE_SPECIALIZATION (decl)) | |
2737 | { | |
2738 | /* A specialization of a member template of a template | |
c6002625 | 2739 | class. */ |
f84b4be9 JM |
2740 | SET_DECL_TEMPLATE_SPECIALIZATION (tmpl); |
2741 | DECL_TEMPLATE_INFO (tmpl) = DECL_TEMPLATE_INFO (decl); | |
2742 | DECL_TEMPLATE_INFO (decl) = NULL_TREE; | |
2743 | } | |
786b5245 | 2744 | } |
8d08fdba MS |
2745 | } |
2746 | else | |
2747 | { | |
e1a5ccf7 | 2748 | tree a, t, current, parms; |
ba4f4e5d | 2749 | int i; |
6633d636 | 2750 | |
6b9ab5cc MM |
2751 | if (TREE_CODE (decl) == TYPE_DECL) |
2752 | { | |
ed44da02 MM |
2753 | if ((IS_AGGR_TYPE_CODE (TREE_CODE (TREE_TYPE (decl))) |
2754 | || TREE_CODE (TREE_TYPE (decl)) == ENUMERAL_TYPE) | |
2755 | && TYPE_TEMPLATE_INFO (TREE_TYPE (decl)) | |
2756 | && TYPE_TI_TEMPLATE (TREE_TYPE (decl))) | |
2757 | tmpl = TYPE_TI_TEMPLATE (TREE_TYPE (decl)); | |
6b9ab5cc MM |
2758 | else |
2759 | { | |
33bd39a2 | 2760 | error ("`%D' does not declare a template type", decl); |
6b9ab5cc MM |
2761 | return decl; |
2762 | } | |
2763 | } | |
f3368a90 | 2764 | else if (!DECL_LANG_SPECIFIC (decl) || !DECL_TEMPLATE_INFO (decl)) |
c91a56d2 | 2765 | { |
33bd39a2 | 2766 | error ("template definition of non-template `%#D'", decl); |
3ac3d9ea | 2767 | return decl; |
c91a56d2 | 2768 | } |
8d08fdba | 2769 | else |
5566b478 | 2770 | tmpl = DECL_TI_TEMPLATE (decl); |
98c1c668 | 2771 | |
e1a5ccf7 JM |
2772 | if (is_member_template (tmpl) |
2773 | && DECL_FUNCTION_TEMPLATE_P (tmpl) | |
2774 | && DECL_TEMPLATE_INFO (decl) && DECL_TI_ARGS (decl) | |
2775 | && DECL_TEMPLATE_SPECIALIZATION (decl)) | |
98c1c668 | 2776 | { |
e1a5ccf7 JM |
2777 | tree new_tmpl; |
2778 | ||
2779 | /* The declaration is a specialization of a member | |
2780 | template, declared outside the class. Therefore, the | |
2781 | innermost template arguments will be NULL, so we | |
2782 | replace them with the arguments determined by the | |
2783 | earlier call to check_explicit_specialization. */ | |
2784 | args = DECL_TI_ARGS (decl); | |
2785 | ||
2786 | new_tmpl | |
2787 | = build_template_decl (decl, current_template_parms); | |
2788 | DECL_TEMPLATE_RESULT (new_tmpl) = decl; | |
2789 | TREE_TYPE (new_tmpl) = TREE_TYPE (decl); | |
2790 | DECL_TI_TEMPLATE (decl) = new_tmpl; | |
2791 | SET_DECL_TEMPLATE_SPECIALIZATION (new_tmpl); | |
e1b3e07d MM |
2792 | DECL_TEMPLATE_INFO (new_tmpl) |
2793 | = tree_cons (tmpl, args, NULL_TREE); | |
e1a5ccf7 | 2794 | |
f9a7ae04 MM |
2795 | register_specialization (new_tmpl, |
2796 | most_general_template (tmpl), | |
2797 | args); | |
e1a5ccf7 | 2798 | return decl; |
98c1c668 | 2799 | } |
98c1c668 | 2800 | |
e1a5ccf7 | 2801 | /* Make sure the template headers we got make sense. */ |
6633d636 | 2802 | |
e1a5ccf7 JM |
2803 | parms = DECL_TEMPLATE_PARMS (tmpl); |
2804 | i = TMPL_PARMS_DEPTH (parms); | |
2805 | if (TMPL_ARGS_DEPTH (args) != i) | |
98c1c668 | 2806 | { |
33bd39a2 | 2807 | error ("expected %d levels of template parms for `%#D', got %d", |
e1a5ccf7 | 2808 | i, decl, TMPL_ARGS_DEPTH (args)); |
98c1c668 | 2809 | } |
e1a5ccf7 JM |
2810 | else |
2811 | for (current = decl; i > 0; --i, parms = TREE_CHAIN (parms)) | |
2812 | { | |
2813 | a = TMPL_ARGS_LEVEL (args, i); | |
2814 | t = INNERMOST_TEMPLATE_PARMS (parms); | |
2815 | ||
2816 | if (TREE_VEC_LENGTH (t) != TREE_VEC_LENGTH (a)) | |
2817 | { | |
2818 | if (current == decl) | |
33bd39a2 | 2819 | error ("got %d template parameters for `%#D'", |
e1a5ccf7 JM |
2820 | TREE_VEC_LENGTH (a), decl); |
2821 | else | |
33bd39a2 | 2822 | error ("got %d template parameters for `%#T'", |
e1a5ccf7 | 2823 | TREE_VEC_LENGTH (a), current); |
33bd39a2 | 2824 | error (" but %d required", TREE_VEC_LENGTH (t)); |
e1a5ccf7 | 2825 | } |
98c1c668 | 2826 | |
e1a5ccf7 JM |
2827 | /* Perhaps we should also check that the parms are used in the |
2828 | appropriate qualifying scopes in the declarator? */ | |
6633d636 | 2829 | |
e1a5ccf7 JM |
2830 | if (current == decl) |
2831 | current = ctx; | |
2832 | else | |
2833 | current = TYPE_CONTEXT (current); | |
2834 | } | |
5566b478 | 2835 | } |
8d08fdba | 2836 | |
5566b478 MS |
2837 | DECL_TEMPLATE_RESULT (tmpl) = decl; |
2838 | TREE_TYPE (tmpl) = TREE_TYPE (decl); | |
8d08fdba | 2839 | |
36a117a5 MM |
2840 | /* Push template declarations for global functions and types. Note |
2841 | that we do not try to push a global template friend declared in a | |
2842 | template class; such a thing may well depend on the template | |
39c01e4c | 2843 | parameters of the class. */ |
cfe507be | 2844 | if (new_template_p && !ctx |
36a117a5 | 2845 | && !(is_friend && template_class_depth (current_class_type) > 0)) |
2c73f9f5 | 2846 | tmpl = pushdecl_namespace_level (tmpl); |
8d08fdba | 2847 | |
5566b478 | 2848 | if (primary) |
5dd236e2 NS |
2849 | { |
2850 | DECL_PRIMARY_TEMPLATE (tmpl) = tmpl; | |
2851 | if (DECL_CONV_FN_P (tmpl)) | |
2852 | { | |
6e04241f GS |
2853 | int depth = TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl)); |
2854 | ||
5dd236e2 NS |
2855 | /* It is a conversion operator. See if the type converted to |
2856 | depends on innermost template operands. */ | |
2857 | ||
6e04241f GS |
2858 | if (for_each_template_parm (TREE_TYPE (TREE_TYPE (tmpl)), |
2859 | template_parm_this_level_p, | |
4f2c9d7e MM |
2860 | &depth, |
2861 | NULL)) | |
5dd236e2 NS |
2862 | DECL_TEMPLATE_CONV_FN_P (tmpl) = 1; |
2863 | } | |
2864 | } | |
5566b478 | 2865 | |
e1b3e07d | 2866 | info = tree_cons (tmpl, args, NULL_TREE); |
5566b478 | 2867 | |
9188c363 | 2868 | if (DECL_IMPLICIT_TYPEDEF_P (decl)) |
8d08fdba | 2869 | { |
ed44da02 MM |
2870 | SET_TYPE_TEMPLATE_INFO (TREE_TYPE (tmpl), info); |
2871 | if ((!ctx || TREE_CODE (ctx) != FUNCTION_DECL) | |
b60ecc04 MM |
2872 | && TREE_CODE (TREE_TYPE (decl)) != ENUMERAL_TYPE |
2873 | /* Don't change the name if we've already set it up. */ | |
2874 | && !IDENTIFIER_TEMPLATE (DECL_NAME (decl))) | |
75650646 | 2875 | DECL_NAME (decl) = classtype_mangled_name (TREE_TYPE (decl)); |
51c184be | 2876 | } |
2aaf816d | 2877 | else if (DECL_LANG_SPECIFIC (decl)) |
5566b478 | 2878 | DECL_TEMPLATE_INFO (decl) = info; |
3ac3d9ea MM |
2879 | |
2880 | return DECL_TEMPLATE_RESULT (tmpl); | |
8d08fdba MS |
2881 | } |
2882 | ||
6757edfe | 2883 | tree |
3a978d72 | 2884 | push_template_decl (tree decl) |
6757edfe MM |
2885 | { |
2886 | return push_template_decl_real (decl, 0); | |
2887 | } | |
2888 | ||
2889 | /* Called when a class template TYPE is redeclared with the indicated | |
2890 | template PARMS, e.g.: | |
7fe6899f MM |
2891 | |
2892 | template <class T> struct S; | |
2893 | template <class T> struct S {}; */ | |
2894 | ||
2895 | void | |
3a978d72 | 2896 | redeclare_class_template (tree type, tree parms) |
7fe6899f | 2897 | { |
3d7de1fa | 2898 | tree tmpl; |
6757edfe | 2899 | tree tmpl_parms; |
7fe6899f MM |
2900 | int i; |
2901 | ||
3d7de1fa MM |
2902 | if (!TYPE_TEMPLATE_INFO (type)) |
2903 | { | |
33bd39a2 | 2904 | error ("`%T' is not a template type", type); |
3d7de1fa MM |
2905 | return; |
2906 | } | |
2907 | ||
2908 | tmpl = TYPE_TI_TEMPLATE (type); | |
7fe6899f MM |
2909 | if (!PRIMARY_TEMPLATE_P (tmpl)) |
2910 | /* The type is nested in some template class. Nothing to worry | |
2911 | about here; there are no new template parameters for the nested | |
2912 | type. */ | |
2913 | return; | |
2914 | ||
6757edfe MM |
2915 | parms = INNERMOST_TEMPLATE_PARMS (parms); |
2916 | tmpl_parms = DECL_INNERMOST_TEMPLATE_PARMS (tmpl); | |
2917 | ||
7fe6899f MM |
2918 | if (TREE_VEC_LENGTH (parms) != TREE_VEC_LENGTH (tmpl_parms)) |
2919 | { | |
8251199e | 2920 | cp_error_at ("previous declaration `%D'", tmpl); |
33bd39a2 | 2921 | error ("used %d template parameter%s instead of %d", |
7fe6899f MM |
2922 | TREE_VEC_LENGTH (tmpl_parms), |
2923 | TREE_VEC_LENGTH (tmpl_parms) == 1 ? "" : "s", | |
2924 | TREE_VEC_LENGTH (parms)); | |
2925 | return; | |
2926 | } | |
2927 | ||
2928 | for (i = 0; i < TREE_VEC_LENGTH (tmpl_parms); ++i) | |
2929 | { | |
2930 | tree tmpl_parm = TREE_VALUE (TREE_VEC_ELT (tmpl_parms, i)); | |
2931 | tree parm = TREE_VALUE (TREE_VEC_ELT (parms, i)); | |
2932 | tree tmpl_default = TREE_PURPOSE (TREE_VEC_ELT (tmpl_parms, i)); | |
2933 | tree parm_default = TREE_PURPOSE (TREE_VEC_ELT (parms, i)); | |
2934 | ||
2935 | if (TREE_CODE (tmpl_parm) != TREE_CODE (parm)) | |
2936 | { | |
8251199e | 2937 | cp_error_at ("template parameter `%#D'", tmpl_parm); |
33bd39a2 | 2938 | error ("redeclared here as `%#D'", parm); |
7fe6899f MM |
2939 | return; |
2940 | } | |
2941 | ||
2942 | if (tmpl_default != NULL_TREE && parm_default != NULL_TREE) | |
2943 | { | |
2944 | /* We have in [temp.param]: | |
2945 | ||
2946 | A template-parameter may not be given default arguments | |
2947 | by two different declarations in the same scope. */ | |
33bd39a2 | 2948 | error ("redefinition of default argument for `%#D'", parm); |
04d6ccbd KG |
2949 | error ("%H original definition appeared here", |
2950 | &DECL_SOURCE_LOCATION (tmpl_parm)); | |
7fe6899f MM |
2951 | return; |
2952 | } | |
2953 | ||
2954 | if (parm_default != NULL_TREE) | |
2955 | /* Update the previous template parameters (which are the ones | |
2956 | that will really count) with the new default value. */ | |
2957 | TREE_PURPOSE (TREE_VEC_ELT (tmpl_parms, i)) = parm_default; | |
7ce74c5e MM |
2958 | else if (tmpl_default != NULL_TREE) |
2959 | /* Update the new parameters, too; they'll be used as the | |
2960 | parameters for any members. */ | |
2961 | TREE_PURPOSE (TREE_VEC_ELT (parms, i)) = tmpl_default; | |
7fe6899f MM |
2962 | } |
2963 | } | |
75650646 | 2964 | |
75650646 MM |
2965 | /* Attempt to convert the non-type template parameter EXPR to the |
2966 | indicated TYPE. If the conversion is successful, return the | |
dc957d14 | 2967 | converted value. If the conversion is unsuccessful, return |
75650646 MM |
2968 | NULL_TREE if we issued an error message, or error_mark_node if we |
2969 | did not. We issue error messages for out-and-out bad template | |
2970 | parameters, but not simply because the conversion failed, since we | |
2971 | might be just trying to do argument deduction. By the time this | |
2972 | function is called, neither TYPE nor EXPR may make use of template | |
2973 | parameters. */ | |
2974 | ||
2975 | static tree | |
3a978d72 | 2976 | convert_nontype_argument (tree type, tree expr) |
75650646 MM |
2977 | { |
2978 | tree expr_type = TREE_TYPE (expr); | |
2979 | ||
2980 | /* A template-argument for a non-type, non-template | |
2981 | template-parameter shall be one of: | |
2982 | ||
2983 | --an integral constant-expression of integral or enumeration | |
2984 | type; or | |
2985 | ||
2986 | --the name of a non-type template-parameter; or | |
2987 | ||
2988 | --the name of an object or function with external linkage, | |
2989 | including function templates and function template-ids but | |
86052cc3 | 2990 | excluding non-static class members, expressed as id-expression; |
75650646 MM |
2991 | or |
2992 | ||
2993 | --the address of an object or function with external linkage, | |
2994 | including function templates and function template-ids but | |
2995 | excluding non-static class members, expressed as & id-expression | |
2996 | where the & is optional if the name refers to a function or | |
2997 | array; or | |
2998 | ||
2999 | --a pointer to member expressed as described in _expr.unary.op_. */ | |
3000 | ||
638dd8fc MM |
3001 | /* An integral constant-expression can include const variables or |
3002 | enumerators. Simplify things by folding them to their values, | |
3003 | unless we're about to bind the declaration to a reference | |
3004 | parameter. */ | |
fc611ce0 | 3005 | if (INTEGRAL_TYPE_P (expr_type) |
638dd8fc | 3006 | && TREE_CODE (type) != REFERENCE_TYPE) |
86052cc3 JM |
3007 | expr = decl_constant_value (expr); |
3008 | ||
7bf2682f MM |
3009 | if (is_overloaded_fn (expr)) |
3010 | /* OK for now. We'll check that it has external linkage later. | |
3011 | Check this first since if expr_type is the unknown_type_node | |
3012 | we would otherwise complain below. */ | |
3013 | ; | |
a5ac359a | 3014 | else if (TYPE_PTR_TO_MEMBER_P (expr_type)) |
e08a8f45 MM |
3015 | { |
3016 | if (TREE_CODE (expr) != PTRMEM_CST) | |
3017 | goto bad_argument; | |
3018 | } | |
f3400fe2 JM |
3019 | else if (TYPE_PTR_P (expr_type) |
3020 | || TREE_CODE (expr_type) == ARRAY_TYPE | |
3021 | || TREE_CODE (type) == REFERENCE_TYPE | |
75650646 MM |
3022 | /* If expr is the address of an overloaded function, we |
3023 | will get the unknown_type_node at this point. */ | |
3024 | || expr_type == unknown_type_node) | |
3025 | { | |
3026 | tree referent; | |
49bf0d6f MM |
3027 | tree e = expr; |
3028 | STRIP_NOPS (e); | |
75650646 | 3029 | |
0dc09a61 MM |
3030 | if (TREE_CODE (expr_type) == ARRAY_TYPE |
3031 | || (TREE_CODE (type) == REFERENCE_TYPE | |
3032 | && TREE_CODE (e) != ADDR_EXPR)) | |
f3400fe2 JM |
3033 | referent = e; |
3034 | else | |
75650646 | 3035 | { |
f3400fe2 JM |
3036 | if (TREE_CODE (e) != ADDR_EXPR) |
3037 | { | |
3038 | bad_argument: | |
33bd39a2 | 3039 | error ("`%E' is not a valid template argument", expr); |
e08a8f45 MM |
3040 | if (TYPE_PTR_P (expr_type)) |
3041 | { | |
3042 | if (TREE_CODE (TREE_TYPE (expr_type)) == FUNCTION_TYPE) | |
33bd39a2 | 3043 | error ("it must be the address of a function with external linkage"); |
e08a8f45 | 3044 | else |
33bd39a2 | 3045 | error ("it must be the address of an object with external linkage"); |
e08a8f45 | 3046 | } |
a5ac359a | 3047 | else if (TYPE_PTR_TO_MEMBER_P (expr_type)) |
33bd39a2 | 3048 | error ("it must be a pointer-to-member of the form `&X::Y'"); |
e08a8f45 | 3049 | |
f3400fe2 JM |
3050 | return NULL_TREE; |
3051 | } | |
3052 | ||
3053 | referent = TREE_OPERAND (e, 0); | |
3054 | STRIP_NOPS (referent); | |
75650646 MM |
3055 | } |
3056 | ||
75650646 MM |
3057 | if (TREE_CODE (referent) == STRING_CST) |
3058 | { | |
33bd39a2 | 3059 | error ("string literal %E is not a valid template argument because it is the address of an object with static linkage", |
75650646 | 3060 | referent); |
75650646 MM |
3061 | return NULL_TREE; |
3062 | } | |
3063 | ||
279b8466 MM |
3064 | if (TREE_CODE (referent) == SCOPE_REF) |
3065 | referent = TREE_OPERAND (referent, 1); | |
3066 | ||
75650646 MM |
3067 | if (is_overloaded_fn (referent)) |
3068 | /* We'll check that it has external linkage later. */ | |
3069 | ; | |
3070 | else if (TREE_CODE (referent) != VAR_DECL) | |
3071 | goto bad_argument; | |
ad50e811 | 3072 | else if (!DECL_EXTERNAL_LINKAGE_P (referent)) |
75650646 | 3073 | { |
33bd39a2 | 3074 | error ("address of non-extern `%E' cannot be used as template argument", referent); |
75650646 MM |
3075 | return error_mark_node; |
3076 | } | |
3077 | } | |
a5ac359a | 3078 | else if (INTEGRAL_TYPE_P (expr_type) || TYPE_PTR_TO_MEMBER_P (expr_type)) |
75650646 | 3079 | { |
f3400fe2 JM |
3080 | if (! TREE_CONSTANT (expr)) |
3081 | { | |
3082 | non_constant: | |
33bd39a2 | 3083 | error ("non-constant `%E' cannot be used as template argument", |
f3400fe2 JM |
3084 | expr); |
3085 | return NULL_TREE; | |
3086 | } | |
75650646 | 3087 | } |
75650646 MM |
3088 | else |
3089 | { | |
c61dce3a GDR |
3090 | if (TYPE_P (expr)) |
3091 | error ("type '%T' cannot be used as a value for a non-type " | |
3092 | "template-parameter", expr); | |
3093 | else if (DECL_P (expr)) | |
3094 | error ("invalid use of '%D' as a non-type template-argument", expr); | |
3095 | else | |
3096 | error ("invalid use of '%E' as a non-type template-argument", expr); | |
3097 | ||
75650646 MM |
3098 | return NULL_TREE; |
3099 | } | |
3100 | ||
3101 | switch (TREE_CODE (type)) | |
3102 | { | |
3103 | case INTEGER_TYPE: | |
3104 | case BOOLEAN_TYPE: | |
3105 | case ENUMERAL_TYPE: | |
3106 | /* For a non-type template-parameter of integral or enumeration | |
3107 | type, integral promotions (_conv.prom_) and integral | |
c6002625 | 3108 | conversions (_conv.integral_) are applied. */ |
75650646 MM |
3109 | if (!INTEGRAL_TYPE_P (expr_type)) |
3110 | return error_mark_node; | |
3111 | ||
3112 | /* It's safe to call digest_init in this case; we know we're | |
3113 | just converting one integral constant expression to another. */ | |
db02b6b9 | 3114 | expr = digest_init (type, expr, (tree*) 0); |
75650646 | 3115 | |
db02b6b9 | 3116 | if (TREE_CODE (expr) != INTEGER_CST) |
f3400fe2 | 3117 | /* Curiously, some TREE_CONSTANT integral expressions do not |
db02b6b9 MM |
3118 | simplify to integer constants. For example, `3 % 0', |
3119 | remains a TRUNC_MOD_EXPR. */ | |
3120 | goto non_constant; | |
3121 | ||
3122 | return expr; | |
a5ac359a MM |
3123 | |
3124 | case OFFSET_TYPE: | |
3125 | { | |
3126 | tree e; | |
3127 | ||
3128 | /* For a non-type template-parameter of type pointer to data | |
3129 | member, qualification conversions (_conv.qual_) are | |
3130 | applied. */ | |
3131 | e = perform_qualification_conversions (type, expr); | |
3132 | if (TREE_CODE (e) == NOP_EXPR) | |
3133 | /* The call to perform_qualification_conversions will | |
3134 | insert a NOP_EXPR over EXPR to do express conversion, | |
3135 | if necessary. But, that will confuse us if we use | |
3136 | this (converted) template parameter to instantiate | |
3137 | another template; then the thing will not look like a | |
3138 | valid template argument. So, just make a new | |
3139 | constant, of the appropriate type. */ | |
3140 | e = make_ptrmem_cst (type, PTRMEM_CST_MEMBER (expr)); | |
3141 | return e; | |
3142 | } | |
3143 | ||
75650646 MM |
3144 | case POINTER_TYPE: |
3145 | { | |
3146 | tree type_pointed_to = TREE_TYPE (type); | |
3147 | ||
a5ac359a | 3148 | if (TREE_CODE (type_pointed_to) == FUNCTION_TYPE) |
75650646 MM |
3149 | { |
3150 | /* For a non-type template-parameter of type pointer to | |
3151 | function, only the function-to-pointer conversion | |
3152 | (_conv.func_) is applied. If the template-argument | |
3153 | represents a set of overloaded functions (or a pointer to | |
3154 | such), the matching function is selected from the set | |
3155 | (_over.over_). */ | |
3156 | tree fns; | |
3157 | tree fn; | |
3158 | ||
7bf2682f | 3159 | if (TREE_CODE (expr) == ADDR_EXPR) |
75650646 MM |
3160 | fns = TREE_OPERAND (expr, 0); |
3161 | else | |
3162 | fns = expr; | |
3163 | ||
c2ea3a40 | 3164 | fn = instantiate_type (type_pointed_to, fns, tf_none); |
75650646 MM |
3165 | |
3166 | if (fn == error_mark_node) | |
3167 | return error_mark_node; | |
3168 | ||
ad50e811 | 3169 | if (!DECL_EXTERNAL_LINKAGE_P (fn)) |
75650646 MM |
3170 | { |
3171 | if (really_overloaded_fn (fns)) | |
3172 | return error_mark_node; | |
3173 | else | |
3174 | goto bad_argument; | |
3175 | } | |
3176 | ||
3177 | expr = build_unary_op (ADDR_EXPR, fn, 0); | |
3178 | ||
3bfdc719 | 3179 | my_friendly_assert (same_type_p (type, TREE_TYPE (expr)), |
75650646 MM |
3180 | 0); |
3181 | return expr; | |
3182 | } | |
3183 | else | |
3184 | { | |
3185 | /* For a non-type template-parameter of type pointer to | |
3186 | object, qualification conversions (_conv.qual_) and the | |
3187 | array-to-pointer conversion (_conv.array_) are applied. | |
3188 | [Note: In particular, neither the null pointer conversion | |
3189 | (_conv.ptr_) nor the derived-to-base conversion | |
3190 | (_conv.ptr_) are applied. Although 0 is a valid | |
3191 | template-argument for a non-type template-parameter of | |
3192 | integral type, it is not a valid template-argument for a | |
e1467ff2 MM |
3193 | non-type template-parameter of pointer type.] |
3194 | ||
3195 | The call to decay_conversion performs the | |
3196 | array-to-pointer conversion, if appropriate. */ | |
3197 | expr = decay_conversion (expr); | |
75650646 MM |
3198 | |
3199 | if (expr == error_mark_node) | |
3200 | return error_mark_node; | |
3201 | else | |
3202 | return perform_qualification_conversions (type, expr); | |
3203 | } | |
3204 | } | |
3205 | break; | |
3206 | ||
3207 | case REFERENCE_TYPE: | |
3208 | { | |
3209 | tree type_referred_to = TREE_TYPE (type); | |
3210 | ||
0dc09a61 MM |
3211 | /* If this expression already has reference type, get the |
3212 | underling object. */ | |
3213 | if (TREE_CODE (expr_type) == REFERENCE_TYPE) | |
3214 | { | |
3215 | my_friendly_assert (TREE_CODE (expr) == ADDR_EXPR, 20000604); | |
3216 | expr = TREE_OPERAND (expr, 0); | |
3217 | expr_type = TREE_TYPE (expr); | |
3218 | } | |
3219 | ||
75650646 MM |
3220 | if (TREE_CODE (type_referred_to) == FUNCTION_TYPE) |
3221 | { | |
3222 | /* For a non-type template-parameter of type reference to | |
39c01e4c MM |
3223 | function, no conversions apply. If the |
3224 | template-argument represents a set of overloaded | |
3225 | functions, the matching function is selected from the | |
3226 | set (_over.over_). */ | |
75650646 MM |
3227 | tree fn; |
3228 | ||
c2ea3a40 | 3229 | fn = instantiate_type (type_referred_to, expr, tf_none); |
e6e174e5 JM |
3230 | |
3231 | if (fn == error_mark_node) | |
3232 | return error_mark_node; | |
75650646 | 3233 | |
ad50e811 | 3234 | if (!DECL_EXTERNAL_LINKAGE_P (fn)) |
75650646 | 3235 | { |
0dc09a61 | 3236 | if (really_overloaded_fn (expr)) |
75650646 MM |
3237 | /* Don't issue an error here; we might get a different |
3238 | function if the overloading had worked out | |
3239 | differently. */ | |
3240 | return error_mark_node; | |
3241 | else | |
3242 | goto bad_argument; | |
3243 | } | |
3244 | ||
3bfdc719 MM |
3245 | my_friendly_assert (same_type_p (type_referred_to, |
3246 | TREE_TYPE (fn)), | |
75650646 MM |
3247 | 0); |
3248 | ||
0dc09a61 | 3249 | expr = fn; |
75650646 MM |
3250 | } |
3251 | else | |
3252 | { | |
3253 | /* For a non-type template-parameter of type reference to | |
3254 | object, no conversions apply. The type referred to by the | |
3255 | reference may be more cv-qualified than the (otherwise | |
3256 | identical) type of the template-argument. The | |
3257 | template-parameter is bound directly to the | |
3258 | template-argument, which must be an lvalue. */ | |
0dc09a61 MM |
3259 | if (!same_type_p (TYPE_MAIN_VARIANT (expr_type), |
3260 | TYPE_MAIN_VARIANT (type_referred_to)) | |
91063b51 MM |
3261 | || !at_least_as_qualified_p (type_referred_to, |
3262 | expr_type) | |
75650646 | 3263 | || !real_lvalue_p (expr)) |
fd74ca0b | 3264 | return error_mark_node; |
75650646 | 3265 | } |
0dc09a61 | 3266 | |
dffd7eb6 | 3267 | cxx_mark_addressable (expr); |
0dc09a61 | 3268 | return build1 (ADDR_EXPR, type, expr); |
75650646 MM |
3269 | } |
3270 | break; | |
3271 | ||
3272 | case RECORD_TYPE: | |
3273 | { | |
db3f4e4e | 3274 | my_friendly_assert (TYPE_PTRMEMFUNC_P (type), 20010112); |
75650646 MM |
3275 | |
3276 | /* For a non-type template-parameter of type pointer to member | |
3277 | function, no conversions apply. If the template-argument | |
3278 | represents a set of overloaded member functions, the | |
3279 | matching member function is selected from the set | |
3280 | (_over.over_). */ | |
3281 | ||
3282 | if (!TYPE_PTRMEMFUNC_P (expr_type) && | |
3283 | expr_type != unknown_type_node) | |
3284 | return error_mark_node; | |
3285 | ||
e08a8f45 | 3286 | if (TREE_CODE (expr) == PTRMEM_CST) |
75650646 MM |
3287 | { |
3288 | /* A ptr-to-member constant. */ | |
3bfdc719 | 3289 | if (!same_type_p (type, expr_type)) |
75650646 MM |
3290 | return error_mark_node; |
3291 | else | |
3292 | return expr; | |
3293 | } | |
3294 | ||
3295 | if (TREE_CODE (expr) != ADDR_EXPR) | |
3296 | return error_mark_node; | |
3297 | ||
c2ea3a40 | 3298 | expr = instantiate_type (type, expr, tf_none); |
75650646 | 3299 | |
d8f8dca1 | 3300 | if (expr == error_mark_node) |
75650646 MM |
3301 | return error_mark_node; |
3302 | ||
3bfdc719 | 3303 | my_friendly_assert (same_type_p (type, TREE_TYPE (expr)), |
75650646 MM |
3304 | 0); |
3305 | return expr; | |
3306 | } | |
3307 | break; | |
3308 | ||
3309 | default: | |
3310 | /* All non-type parameters must have one of these types. */ | |
a98facb0 | 3311 | abort (); |
75650646 MM |
3312 | break; |
3313 | } | |
3314 | ||
3315 | return error_mark_node; | |
3316 | } | |
3317 | ||
744fac59 KL |
3318 | /* Return 1 if PARM_PARMS and ARG_PARMS matches using rule for |
3319 | template template parameters. Both PARM_PARMS and ARG_PARMS are | |
3320 | vectors of TREE_LIST nodes containing TYPE_DECL, TEMPLATE_DECL | |
3321 | or PARM_DECL. | |
3322 | ||
3323 | ARG_PARMS may contain more parameters than PARM_PARMS. If this is | |
3324 | the case, then extra parameters must have default arguments. | |
3325 | ||
3326 | Consider the example: | |
3327 | template <class T, class Allocator = allocator> class vector; | |
3328 | template<template <class U> class TT> class C; | |
3329 | ||
3330 | C<vector> is a valid instantiation. PARM_PARMS for the above code | |
3331 | contains a TYPE_DECL (for U), ARG_PARMS contains two TYPE_DECLs (for | |
3332 | T and Allocator) and OUTER_ARGS contains the argument that is used to | |
3333 | substitute the TT parameter. */ | |
3334 | ||
3335 | static int | |
3a978d72 NN |
3336 | coerce_template_template_parms (tree parm_parms, |
3337 | tree arg_parms, | |
3338 | tsubst_flags_t complain, | |
3339 | tree in_decl, | |
3340 | tree outer_args) | |
744fac59 KL |
3341 | { |
3342 | int nparms, nargs, i; | |
3343 | tree parm, arg; | |
3344 | ||
3345 | my_friendly_assert (TREE_CODE (parm_parms) == TREE_VEC, 0); | |
3346 | my_friendly_assert (TREE_CODE (arg_parms) == TREE_VEC, 0); | |
3347 | ||
3348 | nparms = TREE_VEC_LENGTH (parm_parms); | |
3349 | nargs = TREE_VEC_LENGTH (arg_parms); | |
3350 | ||
3351 | /* The rule here is opposite of coerce_template_parms. */ | |
3352 | if (nargs < nparms | |
3353 | || (nargs > nparms | |
3354 | && TREE_PURPOSE (TREE_VEC_ELT (arg_parms, nparms)) == NULL_TREE)) | |
3355 | return 0; | |
3356 | ||
3357 | for (i = 0; i < nparms; ++i) | |
3358 | { | |
3359 | parm = TREE_VALUE (TREE_VEC_ELT (parm_parms, i)); | |
3360 | arg = TREE_VALUE (TREE_VEC_ELT (arg_parms, i)); | |
3361 | ||
3362 | if (arg == NULL_TREE || arg == error_mark_node | |
3363 | || parm == NULL_TREE || parm == error_mark_node) | |
3364 | return 0; | |
3365 | ||
3366 | if (TREE_CODE (arg) != TREE_CODE (parm)) | |
3367 | return 0; | |
3368 | ||
3369 | switch (TREE_CODE (parm)) | |
3370 | { | |
3371 | case TYPE_DECL: | |
3372 | break; | |
3373 | ||
3374 | case TEMPLATE_DECL: | |
3375 | /* We encounter instantiations of templates like | |
3376 | template <template <template <class> class> class TT> | |
3377 | class C; */ | |
700466c2 JM |
3378 | { |
3379 | tree parmparm = DECL_INNERMOST_TEMPLATE_PARMS (parm); | |
3380 | tree argparm = DECL_INNERMOST_TEMPLATE_PARMS (arg); | |
3381 | ||
8c6ab2db NS |
3382 | if (!coerce_template_template_parms |
3383 | (parmparm, argparm, complain, in_decl, outer_args)) | |
700466c2 JM |
3384 | return 0; |
3385 | } | |
3386 | break; | |
744fac59 KL |
3387 | |
3388 | case PARM_DECL: | |
3389 | /* The tsubst call is used to handle cases such as | |
3390 | template <class T, template <T> class TT> class D; | |
3391 | i.e. the parameter list of TT depends on earlier parameters. */ | |
8c6ab2db NS |
3392 | if (!same_type_p |
3393 | (tsubst (TREE_TYPE (parm), outer_args, complain, in_decl), | |
3394 | TREE_TYPE (arg))) | |
744fac59 KL |
3395 | return 0; |
3396 | break; | |
3397 | ||
3398 | default: | |
a98facb0 | 3399 | abort (); |
744fac59 KL |
3400 | } |
3401 | } | |
3402 | return 1; | |
3403 | } | |
3404 | ||
8b5b8b7c MM |
3405 | /* Convert the indicated template ARG as necessary to match the |
3406 | indicated template PARM. Returns the converted ARG, or | |
c2ea3a40 NS |
3407 | error_mark_node if the conversion was unsuccessful. Error and |
3408 | warning messages are issued under control of COMPLAIN. This | |
3409 | conversion is for the Ith parameter in the parameter list. ARGS is | |
3410 | the full set of template arguments deduced so far. */ | |
8b5b8b7c MM |
3411 | |
3412 | static tree | |
3a978d72 NN |
3413 | convert_template_argument (tree parm, |
3414 | tree arg, | |
3415 | tree args, | |
3416 | tsubst_flags_t complain, | |
3417 | int i, | |
3418 | tree in_decl) | |
8b5b8b7c MM |
3419 | { |
3420 | tree val; | |
3421 | tree inner_args; | |
3422 | int is_type, requires_type, is_tmpl_type, requires_tmpl_type; | |
3423 | ||
f9a7ae04 | 3424 | inner_args = INNERMOST_TEMPLATE_ARGS (args); |
8b5b8b7c MM |
3425 | |
3426 | if (TREE_CODE (arg) == TREE_LIST | |
a5ac359a | 3427 | && TREE_CODE (TREE_VALUE (arg)) == OFFSET_REF) |
8b5b8b7c MM |
3428 | { |
3429 | /* The template argument was the name of some | |
3430 | member function. That's usually | |
0e339752 | 3431 | invalid, but static members are OK. In any |
8b5b8b7c MM |
3432 | case, grab the underlying fields/functions |
3433 | and issue an error later if required. */ | |
3434 | arg = TREE_VALUE (arg); | |
3435 | TREE_TYPE (arg) = unknown_type_node; | |
3436 | } | |
3437 | ||
3438 | requires_tmpl_type = TREE_CODE (parm) == TEMPLATE_DECL; | |
3439 | requires_type = (TREE_CODE (parm) == TYPE_DECL | |
3440 | || requires_tmpl_type); | |
3441 | ||
cbd63935 KL |
3442 | is_tmpl_type = ((TREE_CODE (arg) == TEMPLATE_DECL |
3443 | && TREE_CODE (DECL_TEMPLATE_RESULT (arg)) == TYPE_DECL) | |
3444 | || TREE_CODE (arg) == TEMPLATE_TEMPLATE_PARM | |
3445 | || TREE_CODE (arg) == UNBOUND_CLASS_TEMPLATE); | |
303d1c55 | 3446 | |
b8c6534b KL |
3447 | if (is_tmpl_type |
3448 | && (TREE_CODE (arg) == TEMPLATE_TEMPLATE_PARM | |
3449 | || TREE_CODE (arg) == UNBOUND_CLASS_TEMPLATE)) | |
8b5b8b7c | 3450 | arg = TYPE_STUB_DECL (arg); |
8b5b8b7c | 3451 | |
2f939d94 | 3452 | is_type = TYPE_P (arg) || is_tmpl_type; |
8b5b8b7c MM |
3453 | |
3454 | if (requires_type && ! is_type && TREE_CODE (arg) == SCOPE_REF | |
3455 | && TREE_CODE (TREE_OPERAND (arg, 0)) == TEMPLATE_TYPE_PARM) | |
3456 | { | |
33bd39a2 | 3457 | pedwarn ("to refer to a type member of a template parameter, use `typename %E'", arg); |
8b5b8b7c MM |
3458 | |
3459 | arg = make_typename_type (TREE_OPERAND (arg, 0), | |
3baa501d | 3460 | TREE_OPERAND (arg, 1), |
c2ea3a40 | 3461 | complain & tf_error); |
8b5b8b7c MM |
3462 | is_type = 1; |
3463 | } | |
3464 | if (is_type != requires_type) | |
3465 | { | |
3466 | if (in_decl) | |
3467 | { | |
c2ea3a40 | 3468 | if (complain & tf_error) |
8b5b8b7c | 3469 | { |
33bd39a2 | 3470 | error ("type/value mismatch at argument %d in template parameter list for `%D'", |
8b5b8b7c MM |
3471 | i + 1, in_decl); |
3472 | if (is_type) | |
33bd39a2 | 3473 | error (" expected a constant of type `%T', got `%T'", |
8b5b8b7c MM |
3474 | TREE_TYPE (parm), |
3475 | (is_tmpl_type ? DECL_NAME (arg) : arg)); | |
d12a7283 KL |
3476 | else if (requires_tmpl_type) |
3477 | error (" expected a class template, got `%E'", arg); | |
8b5b8b7c | 3478 | else |
33bd39a2 | 3479 | error (" expected a type, got `%E'", arg); |
8b5b8b7c MM |
3480 | } |
3481 | } | |
3482 | return error_mark_node; | |
3483 | } | |
3484 | if (is_tmpl_type ^ requires_tmpl_type) | |
3485 | { | |
c2ea3a40 | 3486 | if (in_decl && (complain & tf_error)) |
8b5b8b7c | 3487 | { |
33bd39a2 | 3488 | error ("type/value mismatch at argument %d in template parameter list for `%D'", |
8b5b8b7c MM |
3489 | i + 1, in_decl); |
3490 | if (is_tmpl_type) | |
33bd39a2 | 3491 | error (" expected a type, got `%T'", DECL_NAME (arg)); |
8b5b8b7c | 3492 | else |
33bd39a2 | 3493 | error (" expected a class template, got `%T'", arg); |
8b5b8b7c MM |
3494 | } |
3495 | return error_mark_node; | |
3496 | } | |
3497 | ||
3498 | if (is_type) | |
3499 | { | |
3500 | if (requires_tmpl_type) | |
3501 | { | |
b8c6534b KL |
3502 | if (TREE_CODE (TREE_TYPE (arg)) == UNBOUND_CLASS_TEMPLATE) |
3503 | /* The number of argument required is not known yet. | |
3504 | Just accept it for now. */ | |
3505 | val = TREE_TYPE (arg); | |
8b5b8b7c MM |
3506 | else |
3507 | { | |
b8c6534b KL |
3508 | tree parmparm = DECL_INNERMOST_TEMPLATE_PARMS (parm); |
3509 | tree argparm = DECL_INNERMOST_TEMPLATE_PARMS (arg); | |
3510 | ||
3511 | if (coerce_template_template_parms (parmparm, argparm, | |
3512 | complain, in_decl, | |
3513 | inner_args)) | |
8b5b8b7c | 3514 | { |
b8c6534b KL |
3515 | val = arg; |
3516 | ||
3517 | /* TEMPLATE_TEMPLATE_PARM node is preferred over | |
3518 | TEMPLATE_DECL. */ | |
3519 | if (val != error_mark_node | |
3520 | && DECL_TEMPLATE_TEMPLATE_PARM_P (val)) | |
3521 | val = TREE_TYPE (val); | |
8b5b8b7c | 3522 | } |
b8c6534b KL |
3523 | else |
3524 | { | |
c2ea3a40 | 3525 | if (in_decl && (complain & tf_error)) |
b8c6534b | 3526 | { |
33bd39a2 | 3527 | error ("type/value mismatch at argument %d in template parameter list for `%D'", |
b8c6534b | 3528 | i + 1, in_decl); |
33bd39a2 | 3529 | error (" expected a template of type `%D', got `%D'", parm, arg); |
b8c6534b | 3530 | } |
8b5b8b7c | 3531 | |
b8c6534b KL |
3532 | val = error_mark_node; |
3533 | } | |
8b5b8b7c MM |
3534 | } |
3535 | } | |
3536 | else | |
3e4a3562 | 3537 | val = groktypename (arg); |
8b5b8b7c MM |
3538 | } |
3539 | else | |
3540 | { | |
4393e105 | 3541 | tree t = tsubst (TREE_TYPE (parm), args, complain, in_decl); |
8b5b8b7c | 3542 | |
11b810f1 | 3543 | if (invalid_nontype_parm_type_p (t, complain)) |
db3f4e4e NS |
3544 | return error_mark_node; |
3545 | ||
d768a589 | 3546 | if (!uses_template_parms (arg) && !uses_template_parms (t)) |
8b5b8b7c MM |
3547 | /* We used to call digest_init here. However, digest_init |
3548 | will report errors, which we don't want when complain | |
3549 | is zero. More importantly, digest_init will try too | |
3550 | hard to convert things: for example, `0' should not be | |
3551 | converted to pointer type at this point according to | |
3552 | the standard. Accepting this is not merely an | |
3553 | extension, since deciding whether or not these | |
3554 | conversions can occur is part of determining which | |
dc957d14 | 3555 | function template to call, or whether a given explicit |
0e339752 | 3556 | argument specification is valid. */ |
8b5b8b7c MM |
3557 | val = convert_nontype_argument (t, arg); |
3558 | else | |
3559 | val = arg; | |
3560 | ||
3561 | if (val == NULL_TREE) | |
3562 | val = error_mark_node; | |
c2ea3a40 | 3563 | else if (val == error_mark_node && (complain & tf_error)) |
33bd39a2 | 3564 | error ("could not convert template argument `%E' to `%T'", |
8b5b8b7c MM |
3565 | arg, t); |
3566 | } | |
3567 | ||
3568 | return val; | |
3569 | } | |
3570 | ||
3571 | /* Convert all template arguments to their appropriate types, and | |
3572 | return a vector containing the innermost resulting template | |
c2ea3a40 | 3573 | arguments. If any error occurs, return error_mark_node. Error and |
3e4a3562 | 3574 | warning messages are issued under control of COMPLAIN. |
75650646 | 3575 | |
838dfd8a | 3576 | If REQUIRE_ALL_ARGUMENTS is nonzero, all arguments must be |
75650646 MM |
3577 | provided in ARGLIST, or else trailing parameters must have default |
3578 | values. If REQUIRE_ALL_ARGUMENTS is zero, we will attempt argument | |
6dfbb909 | 3579 | deduction for any unspecified trailing arguments. */ |
de575009 | 3580 | |
8d08fdba | 3581 | static tree |
3a978d72 NN |
3582 | coerce_template_parms (tree parms, |
3583 | tree args, | |
3584 | tree in_decl, | |
3585 | tsubst_flags_t complain, | |
3586 | int require_all_arguments) | |
8d08fdba | 3587 | { |
a292b002 | 3588 | int nparms, nargs, i, lost = 0; |
e4a84209 | 3589 | tree inner_args; |
8b5b8b7c MM |
3590 | tree new_args; |
3591 | tree new_inner_args; | |
a292b002 | 3592 | |
f9a7ae04 | 3593 | inner_args = INNERMOST_TEMPLATE_ARGS (args); |
bf12d54d | 3594 | nargs = inner_args ? NUM_TMPL_ARGS (inner_args) : 0; |
a292b002 MS |
3595 | nparms = TREE_VEC_LENGTH (parms); |
3596 | ||
3597 | if (nargs > nparms | |
3598 | || (nargs < nparms | |
75650646 | 3599 | && require_all_arguments |
a292b002 | 3600 | && TREE_PURPOSE (TREE_VEC_ELT (parms, nargs)) == NULL_TREE)) |
8d08fdba | 3601 | { |
c2ea3a40 | 3602 | if (complain & tf_error) |
75650646 | 3603 | { |
33bd39a2 | 3604 | error ("wrong number of template arguments (%d, should be %d)", |
e4a84209 | 3605 | nargs, nparms); |
75650646 MM |
3606 | |
3607 | if (in_decl) | |
8251199e | 3608 | cp_error_at ("provided for `%D'", in_decl); |
75650646 MM |
3609 | } |
3610 | ||
8d08fdba MS |
3611 | return error_mark_node; |
3612 | } | |
3613 | ||
f31c0a32 | 3614 | new_inner_args = make_tree_vec (nparms); |
8b5b8b7c MM |
3615 | new_args = add_outermost_template_args (args, new_inner_args); |
3616 | for (i = 0; i < nparms; i++) | |
8d08fdba | 3617 | { |
8b5b8b7c MM |
3618 | tree arg; |
3619 | tree parm; | |
e4a84209 | 3620 | |
8b5b8b7c MM |
3621 | /* Get the Ith template parameter. */ |
3622 | parm = TREE_VEC_ELT (parms, i); | |
75650646 | 3623 | |
8b5b8b7c | 3624 | /* Calculate the Ith argument. */ |
bf12d54d | 3625 | if (i < nargs) |
8b5b8b7c | 3626 | arg = TREE_VEC_ELT (inner_args, i); |
ffd49b19 NS |
3627 | else if (require_all_arguments) |
3628 | /* There must be a default arg in this case. */ | |
a91db711 NS |
3629 | arg = tsubst_template_arg (TREE_PURPOSE (parm), new_args, |
3630 | complain, in_decl); | |
ffd49b19 NS |
3631 | else |
3632 | break; | |
3633 | ||
3634 | my_friendly_assert (arg, 20030727); | |
3635 | if (arg == error_mark_node) | |
3636 | error ("template argument %d is invalid", i + 1); | |
8b5b8b7c MM |
3637 | else |
3638 | arg = convert_template_argument (TREE_VALUE (parm), | |
3639 | arg, new_args, complain, i, | |
3640 | in_decl); | |
3641 | ||
3642 | if (arg == error_mark_node) | |
8d08fdba | 3643 | lost++; |
8b5b8b7c | 3644 | TREE_VEC_ELT (new_inner_args, i) = arg; |
8d08fdba | 3645 | } |
8b5b8b7c | 3646 | |
8d08fdba MS |
3647 | if (lost) |
3648 | return error_mark_node; | |
8b5b8b7c MM |
3649 | |
3650 | return new_inner_args; | |
8d08fdba MS |
3651 | } |
3652 | ||
34016c81 JM |
3653 | /* Returns 1 if template args OT and NT are equivalent. */ |
3654 | ||
d8e178a0 | 3655 | static int |
3a978d72 | 3656 | template_args_equal (tree ot, tree nt) |
34016c81 JM |
3657 | { |
3658 | if (nt == ot) | |
3659 | return 1; | |
74601d7c | 3660 | |
34016c81 JM |
3661 | if (TREE_CODE (nt) == TREE_VEC) |
3662 | /* For member templates */ | |
74601d7c KL |
3663 | return TREE_CODE (ot) == TREE_VEC && comp_template_args (ot, nt); |
3664 | else if (TYPE_P (nt)) | |
3665 | return TYPE_P (ot) && same_type_p (ot, nt); | |
3666 | else if (TREE_CODE (ot) == TREE_VEC || TYPE_P (ot)) | |
3667 | return 0; | |
34016c81 | 3668 | else |
c8a209ca | 3669 | return cp_tree_equal (ot, nt); |
34016c81 JM |
3670 | } |
3671 | ||
3672 | /* Returns 1 iff the OLDARGS and NEWARGS are in fact identical sets | |
f84b4be9 JM |
3673 | of template arguments. Returns 0 otherwise. */ |
3674 | ||
6757edfe | 3675 | int |
3a978d72 | 3676 | comp_template_args (tree oldargs, tree newargs) |
5566b478 MS |
3677 | { |
3678 | int i; | |
3679 | ||
386b8a85 JM |
3680 | if (TREE_VEC_LENGTH (oldargs) != TREE_VEC_LENGTH (newargs)) |
3681 | return 0; | |
3682 | ||
5566b478 MS |
3683 | for (i = 0; i < TREE_VEC_LENGTH (oldargs); ++i) |
3684 | { | |
3685 | tree nt = TREE_VEC_ELT (newargs, i); | |
3686 | tree ot = TREE_VEC_ELT (oldargs, i); | |
3687 | ||
34016c81 | 3688 | if (! template_args_equal (ot, nt)) |
61a127b3 | 3689 | return 0; |
5566b478 MS |
3690 | } |
3691 | return 1; | |
3692 | } | |
3693 | ||
8d08fdba MS |
3694 | /* Given class template name and parameter list, produce a user-friendly name |
3695 | for the instantiation. */ | |
e92cc029 | 3696 | |
8d08fdba | 3697 | static char * |
3a978d72 | 3698 | mangle_class_name_for_template (const char* name, tree parms, tree arglist) |
8d08fdba MS |
3699 | { |
3700 | static struct obstack scratch_obstack; | |
3701 | static char *scratch_firstobj; | |
3702 | int i, nparms; | |
8d08fdba MS |
3703 | |
3704 | if (!scratch_firstobj) | |
fc378698 | 3705 | gcc_obstack_init (&scratch_obstack); |
8d08fdba MS |
3706 | else |
3707 | obstack_free (&scratch_obstack, scratch_firstobj); | |
fc378698 | 3708 | scratch_firstobj = obstack_alloc (&scratch_obstack, 1); |
8d08fdba | 3709 | |
18e314ad GS |
3710 | #define ccat(C) obstack_1grow (&scratch_obstack, (C)); |
3711 | #define cat(S) obstack_grow (&scratch_obstack, (S), strlen (S)) | |
8d08fdba MS |
3712 | |
3713 | cat (name); | |
3714 | ccat ('<'); | |
3715 | nparms = TREE_VEC_LENGTH (parms); | |
f9a7ae04 | 3716 | arglist = INNERMOST_TEMPLATE_ARGS (arglist); |
8d08fdba MS |
3717 | my_friendly_assert (nparms == TREE_VEC_LENGTH (arglist), 268); |
3718 | for (i = 0; i < nparms; i++) | |
3719 | { | |
a292b002 MS |
3720 | tree parm = TREE_VALUE (TREE_VEC_ELT (parms, i)); |
3721 | tree arg = TREE_VEC_ELT (arglist, i); | |
8d08fdba MS |
3722 | |
3723 | if (i) | |
3724 | ccat (','); | |
3725 | ||
a292b002 | 3726 | if (TREE_CODE (parm) == TYPE_DECL) |
8d08fdba | 3727 | { |
761f0855 | 3728 | cat (type_as_string (arg, TFF_CHASE_TYPEDEF)); |
8d08fdba MS |
3729 | continue; |
3730 | } | |
73b0fce8 KL |
3731 | else if (TREE_CODE (parm) == TEMPLATE_DECL) |
3732 | { | |
3733 | if (TREE_CODE (arg) == TEMPLATE_DECL) | |
2c73f9f5 ML |
3734 | { |
3735 | /* Already substituted with real template. Just output | |
3736 | the template name here */ | |
cb0dbb9a | 3737 | tree context = DECL_CONTEXT (arg); |
ec4f972f AS |
3738 | if (context) |
3739 | { | |
3740 | /* The template may be defined in a namespace, or | |
3741 | may be a member template. */ | |
3742 | my_friendly_assert (TREE_CODE (context) == NAMESPACE_DECL | |
3743 | || CLASS_TYPE_P (context), | |
3744 | 980422); | |
761f0855 | 3745 | cat(decl_as_string (DECL_CONTEXT (arg), TFF_PLAIN_IDENTIFIER)); |
2c73f9f5 ML |
3746 | cat("::"); |
3747 | } | |
3748 | cat (IDENTIFIER_POINTER (DECL_NAME (arg))); | |
3749 | } | |
73b0fce8 KL |
3750 | else |
3751 | /* Output the parameter declaration */ | |
761f0855 | 3752 | cat (type_as_string (arg, TFF_CHASE_TYPEDEF)); |
73b0fce8 KL |
3753 | continue; |
3754 | } | |
8d08fdba MS |
3755 | else |
3756 | my_friendly_assert (TREE_CODE (parm) == PARM_DECL, 269); | |
3757 | ||
8d08fdba MS |
3758 | /* No need to check arglist against parmlist here; we did that |
3759 | in coerce_template_parms, called from lookup_template_class. */ | |
761f0855 | 3760 | cat (expr_as_string (arg, TFF_PLAIN_IDENTIFIER)); |
8d08fdba MS |
3761 | } |
3762 | { | |
3763 | char *bufp = obstack_next_free (&scratch_obstack); | |
3764 | int offset = 0; | |
3765 | while (bufp[offset - 1] == ' ') | |
3766 | offset--; | |
3767 | obstack_blank_fast (&scratch_obstack, offset); | |
3768 | ||
3769 | /* B<C<char> >, not B<C<char>> */ | |
3770 | if (bufp[offset - 1] == '>') | |
3771 | ccat (' '); | |
3772 | } | |
3773 | ccat ('>'); | |
3774 | ccat ('\0'); | |
3775 | return (char *) obstack_base (&scratch_obstack); | |
8d08fdba MS |
3776 | } |
3777 | ||
bd6dd845 | 3778 | static tree |
3a978d72 | 3779 | classtype_mangled_name (tree t) |
5566b478 MS |
3780 | { |
3781 | if (CLASSTYPE_TEMPLATE_INFO (t) | |
36a117a5 MM |
3782 | /* Specializations have already had their names set up in |
3783 | lookup_template_class. */ | |
370af2d5 | 3784 | && !CLASSTYPE_TEMPLATE_SPECIALIZATION (t)) |
9fbf56f7 MM |
3785 | { |
3786 | tree tmpl = most_general_template (CLASSTYPE_TI_TEMPLATE (t)); | |
3787 | ||
36a117a5 MM |
3788 | /* For non-primary templates, the template parameters are |
3789 | implicit from their surrounding context. */ | |
9fbf56f7 MM |
3790 | if (PRIMARY_TEMPLATE_P (tmpl)) |
3791 | { | |
3792 | tree name = DECL_NAME (tmpl); | |
3793 | char *mangled_name = mangle_class_name_for_template | |
3794 | (IDENTIFIER_POINTER (name), | |
3795 | DECL_INNERMOST_TEMPLATE_PARMS (tmpl), | |
3796 | CLASSTYPE_TI_ARGS (t)); | |
3797 | tree id = get_identifier (mangled_name); | |
3798 | IDENTIFIER_TEMPLATE (id) = name; | |
3799 | return id; | |
3800 | } | |
5566b478 | 3801 | } |
9fbf56f7 MM |
3802 | |
3803 | return TYPE_IDENTIFIER (t); | |
5566b478 MS |
3804 | } |
3805 | ||
3806 | static void | |
3a978d72 | 3807 | add_pending_template (tree d) |
5566b478 | 3808 | { |
3ae18eaf JM |
3809 | tree ti = (TYPE_P (d) |
3810 | ? CLASSTYPE_TEMPLATE_INFO (d) | |
3811 | : DECL_TEMPLATE_INFO (d)); | |
46ccf50a | 3812 | tree pt; |
3ae18eaf | 3813 | int level; |
e92cc029 | 3814 | |
824b9a4c | 3815 | if (TI_PENDING_TEMPLATE_FLAG (ti)) |
5566b478 MS |
3816 | return; |
3817 | ||
3ae18eaf JM |
3818 | /* We are called both from instantiate_decl, where we've already had a |
3819 | tinst_level pushed, and instantiate_template, where we haven't. | |
3820 | Compensate. */ | |
3821 | level = !(current_tinst_level && TINST_DECL (current_tinst_level) == d); | |
3822 | ||
3823 | if (level) | |
3824 | push_tinst_level (d); | |
3825 | ||
46ccf50a JM |
3826 | pt = tree_cons (current_tinst_level, d, NULL_TREE); |
3827 | if (last_pending_template) | |
3828 | TREE_CHAIN (last_pending_template) = pt; | |
3829 | else | |
3830 | pending_templates = pt; | |
3831 | ||
3832 | last_pending_template = pt; | |
3833 | ||
824b9a4c | 3834 | TI_PENDING_TEMPLATE_FLAG (ti) = 1; |
3ae18eaf JM |
3835 | |
3836 | if (level) | |
3837 | pop_tinst_level (); | |
5566b478 MS |
3838 | } |
3839 | ||
386b8a85 | 3840 | |
4ba126e4 MM |
3841 | /* Return a TEMPLATE_ID_EXPR corresponding to the indicated FNS and |
3842 | ARGLIST. Valid choices for FNS are given in the cp-tree.def | |
3843 | documentation for TEMPLATE_ID_EXPR. */ | |
386b8a85 JM |
3844 | |
3845 | tree | |
3a978d72 | 3846 | lookup_template_function (tree fns, tree arglist) |
386b8a85 | 3847 | { |
2c73f9f5 | 3848 | tree type; |
050367a3 | 3849 | |
4ba126e4 MM |
3850 | if (fns == error_mark_node || arglist == error_mark_node) |
3851 | return error_mark_node; | |
3852 | ||
bf12d54d | 3853 | my_friendly_assert (!arglist || TREE_CODE (arglist) == TREE_VEC, 20030726); |
386b8a85 JM |
3854 | if (fns == NULL_TREE) |
3855 | { | |
33bd39a2 | 3856 | error ("non-template used as template"); |
386b8a85 JM |
3857 | return error_mark_node; |
3858 | } | |
3859 | ||
4ba126e4 MM |
3860 | my_friendly_assert (TREE_CODE (fns) == TEMPLATE_DECL |
3861 | || TREE_CODE (fns) == OVERLOAD | |
50ad9642 | 3862 | || BASELINK_P (fns) |
10b1d5e7 | 3863 | || TREE_CODE (fns) == IDENTIFIER_NODE, |
4ba126e4 MM |
3864 | 20020730); |
3865 | ||
50ad9642 MM |
3866 | if (BASELINK_P (fns)) |
3867 | { | |
3868 | BASELINK_FUNCTIONS (fns) = build (TEMPLATE_ID_EXPR, | |
3869 | unknown_type_node, | |
3870 | BASELINK_FUNCTIONS (fns), | |
3871 | arglist); | |
3872 | return fns; | |
3873 | } | |
3874 | ||
2c73f9f5 ML |
3875 | type = TREE_TYPE (fns); |
3876 | if (TREE_CODE (fns) == OVERLOAD || !type) | |
3877 | type = unknown_type_node; | |
4ba126e4 MM |
3878 | |
3879 | return build (TEMPLATE_ID_EXPR, type, fns, arglist); | |
386b8a85 JM |
3880 | } |
3881 | ||
a2b60a0e MM |
3882 | /* Within the scope of a template class S<T>, the name S gets bound |
3883 | (in build_self_reference) to a TYPE_DECL for the class, not a | |
3884 | TEMPLATE_DECL. If DECL is a TYPE_DECL for current_class_type, | |
3885 | or one of its enclosing classes, and that type is a template, | |
3886 | return the associated TEMPLATE_DECL. Otherwise, the original | |
3887 | DECL is returned. */ | |
3888 | ||
a723baf1 | 3889 | tree |
3a978d72 | 3890 | maybe_get_template_decl_from_type_decl (tree decl) |
a2b60a0e MM |
3891 | { |
3892 | return (decl != NULL_TREE | |
3893 | && TREE_CODE (decl) == TYPE_DECL | |
3894 | && DECL_ARTIFICIAL (decl) | |
511b60ff | 3895 | && CLASS_TYPE_P (TREE_TYPE (decl)) |
a2b60a0e MM |
3896 | && CLASSTYPE_TEMPLATE_INFO (TREE_TYPE (decl))) |
3897 | ? CLASSTYPE_TI_TEMPLATE (TREE_TYPE (decl)) : decl; | |
3898 | } | |
386b8a85 | 3899 | |
8d08fdba MS |
3900 | /* Given an IDENTIFIER_NODE (type TEMPLATE_DECL) and a chain of |
3901 | parameters, find the desired type. | |
3902 | ||
3903 | D1 is the PTYPENAME terminal, and ARGLIST is the list of arguments. | |
8d08fdba MS |
3904 | |
3905 | IN_DECL, if non-NULL, is the template declaration we are trying to | |
75650646 MM |
3906 | instantiate. |
3907 | ||
838dfd8a | 3908 | If ENTERING_SCOPE is nonzero, we are about to enter the scope of |
36a117a5 | 3909 | the class we are looking up. |
f9c244b8 | 3910 | |
c2ea3a40 | 3911 | Issue error and warning messages under control of COMPLAIN. |
36a117a5 | 3912 | |
75650646 MM |
3913 | If the template class is really a local class in a template |
3914 | function, then the FUNCTION_CONTEXT is the function in which it is | |
3915 | being instantiated. */ | |
e92cc029 | 3916 | |
8d08fdba | 3917 | tree |
3a978d72 NN |
3918 | lookup_template_class (tree d1, |
3919 | tree arglist, | |
3920 | tree in_decl, | |
3921 | tree context, | |
3922 | int entering_scope, | |
3923 | tsubst_flags_t complain) | |
8d08fdba | 3924 | { |
a703fb38 | 3925 | tree template = NULL_TREE, parmlist; |
dbfe2124 | 3926 | tree t; |
42eaed49 | 3927 | |
fd295cb2 | 3928 | timevar_push (TV_NAME_LOOKUP); |
42eaed49 | 3929 | |
5566b478 MS |
3930 | if (TREE_CODE (d1) == IDENTIFIER_NODE) |
3931 | { | |
f181d4ae MM |
3932 | if (IDENTIFIER_VALUE (d1) |
3933 | && DECL_TEMPLATE_TEMPLATE_PARM_P (IDENTIFIER_VALUE (d1))) | |
3934 | template = IDENTIFIER_VALUE (d1); | |
73b0fce8 KL |
3935 | else |
3936 | { | |
2c73f9f5 ML |
3937 | if (context) |
3938 | push_decl_namespace (context); | |
3ebc5c52 MM |
3939 | template = lookup_name (d1, /*prefer_type=*/0); |
3940 | template = maybe_get_template_decl_from_type_decl (template); | |
2c73f9f5 ML |
3941 | if (context) |
3942 | pop_decl_namespace (); | |
73b0fce8 | 3943 | } |
8d019cef JM |
3944 | if (template) |
3945 | context = DECL_CONTEXT (template); | |
5566b478 | 3946 | } |
c91a56d2 MS |
3947 | else if (TREE_CODE (d1) == TYPE_DECL && IS_AGGR_TYPE (TREE_TYPE (d1))) |
3948 | { | |
802dbc34 JM |
3949 | tree type = TREE_TYPE (d1); |
3950 | ||
3951 | /* If we are declaring a constructor, say A<T>::A<T>, we will get | |
3952 | an implicit typename for the second A. Deal with it. */ | |
3953 | if (TREE_CODE (type) == TYPENAME_TYPE && TREE_TYPE (type)) | |
3954 | type = TREE_TYPE (type); | |
3955 | ||
3956 | if (CLASSTYPE_TEMPLATE_INFO (type)) | |
f3400fe2 | 3957 | { |
802dbc34 | 3958 | template = CLASSTYPE_TI_TEMPLATE (type); |
f3400fe2 JM |
3959 | d1 = DECL_NAME (template); |
3960 | } | |
c91a56d2 | 3961 | } |
ed44da02 | 3962 | else if (TREE_CODE (d1) == ENUMERAL_TYPE |
2f939d94 | 3963 | || (TYPE_P (d1) && IS_AGGR_TYPE (d1))) |
5566b478 | 3964 | { |
ed44da02 | 3965 | template = TYPE_TI_TEMPLATE (d1); |
5566b478 MS |
3966 | d1 = DECL_NAME (template); |
3967 | } | |
93cdc044 | 3968 | else if (TREE_CODE (d1) == TEMPLATE_DECL |
17aec3eb | 3969 | && TREE_CODE (DECL_TEMPLATE_RESULT (d1)) == TYPE_DECL) |
93cdc044 JM |
3970 | { |
3971 | template = d1; | |
3972 | d1 = DECL_NAME (template); | |
3973 | context = DECL_CONTEXT (template); | |
3974 | } | |
8d08fdba | 3975 | |
8d08fdba | 3976 | /* With something like `template <class T> class X class X { ... };' |
f181d4ae MM |
3977 | we could end up with D1 having nothing but an IDENTIFIER_VALUE. |
3978 | We don't want to do that, but we have to deal with the situation, | |
3979 | so let's give them some syntax errors to chew on instead of a | |
1bc0793e | 3980 | crash. Alternatively D1 might not be a template type at all. */ |
8d08fdba | 3981 | if (! template) |
f3400fe2 | 3982 | { |
c2ea3a40 | 3983 | if (complain & tf_error) |
33bd39a2 | 3984 | error ("`%T' is not a template", d1); |
fd295cb2 | 3985 | POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, error_mark_node); |
f3400fe2 | 3986 | } |
2c73f9f5 | 3987 | |
a87b4257 | 3988 | if (TREE_CODE (template) != TEMPLATE_DECL |
42eaed49 NS |
3989 | /* Make sure it's a user visible template, if it was named by |
3990 | the user. */ | |
3991 | || ((complain & tf_user) && !DECL_TEMPLATE_PARM_P (template) | |
3992 | && !PRIMARY_TEMPLATE_P (template))) | |
8d08fdba | 3993 | { |
c2ea3a40 | 3994 | if (complain & tf_error) |
f9c244b8 | 3995 | { |
33bd39a2 | 3996 | error ("non-template type `%T' used as a template", d1); |
f9c244b8 NS |
3997 | if (in_decl) |
3998 | cp_error_at ("for template declaration `%D'", in_decl); | |
3999 | } | |
fd295cb2 | 4000 | POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, error_mark_node); |
8d08fdba | 4001 | } |
8d08fdba | 4002 | |
42eaed49 NS |
4003 | complain &= ~tf_user; |
4004 | ||
73b0fce8 KL |
4005 | if (DECL_TEMPLATE_TEMPLATE_PARM_P (template)) |
4006 | { | |
4007 | /* Create a new TEMPLATE_DECL and TEMPLATE_TEMPLATE_PARM node to store | |
4008 | template arguments */ | |
4009 | ||
1899c3a4 | 4010 | tree parm; |
73b0fce8 KL |
4011 | tree arglist2; |
4012 | ||
73b0fce8 KL |
4013 | parmlist = DECL_INNERMOST_TEMPLATE_PARMS (template); |
4014 | ||
4f96ff63 KL |
4015 | /* Consider an example where a template template parameter declared as |
4016 | ||
4017 | template <class T, class U = std::allocator<T> > class TT | |
4018 | ||
4019 | The template parameter level of T and U are one level larger than | |
4020 | of TT. To proper process the default argument of U, say when an | |
4021 | instantiation `TT<int>' is seen, we need to build the full | |
342cea95 KL |
4022 | arguments containing {int} as the innermost level. Outer levels, |
4023 | available when not appearing as default template argument, can be | |
4024 | obtained from `current_template_args ()'. | |
4f96ff63 | 4025 | |
342cea95 KL |
4026 | Suppose that TT is later substituted with std::vector. The above |
4027 | instantiation is `TT<int, std::allocator<T> >' with TT at | |
4028 | level 1, and T at level 2, while the template arguments at level 1 | |
4029 | becomes {std::vector} and the inner level 2 is {int}. */ | |
4030 | ||
4031 | if (current_template_parms) | |
4f96ff63 KL |
4032 | arglist = add_to_template_args (current_template_args (), arglist); |
4033 | ||
f9c244b8 NS |
4034 | arglist2 = coerce_template_parms (parmlist, arglist, template, |
4035 | complain, /*require_all_args=*/1); | |
3e4a3562 | 4036 | if (arglist2 == error_mark_node |
544aef8c | 4037 | || (!uses_template_parms (arglist2) |
3e4a3562 | 4038 | && check_instantiated_args (template, arglist2, complain))) |
fd295cb2 | 4039 | POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, error_mark_node); |
73b0fce8 | 4040 | |
dac65501 | 4041 | parm = bind_template_template_parm (TREE_TYPE (template), arglist2); |
fd295cb2 | 4042 | POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, parm); |
73b0fce8 | 4043 | } |
36a117a5 | 4044 | else |
8d08fdba | 4045 | { |
36a117a5 | 4046 | tree template_type = TREE_TYPE (template); |
7ac7b28f | 4047 | tree gen_tmpl; |
36a117a5 MM |
4048 | tree type_decl; |
4049 | tree found = NULL_TREE; | |
414ea4aa | 4050 | tree *tp; |
36a117a5 MM |
4051 | int arg_depth; |
4052 | int parm_depth; | |
dbfe2124 | 4053 | int is_partial_instantiation; |
830bfa74 | 4054 | |
7ac7b28f MM |
4055 | gen_tmpl = most_general_template (template); |
4056 | parmlist = DECL_TEMPLATE_PARMS (gen_tmpl); | |
36a117a5 MM |
4057 | parm_depth = TMPL_PARMS_DEPTH (parmlist); |
4058 | arg_depth = TMPL_ARGS_DEPTH (arglist); | |
4059 | ||
4060 | if (arg_depth == 1 && parm_depth > 1) | |
4061 | { | |
39c01e4c | 4062 | /* We've been given an incomplete set of template arguments. |
36a117a5 MM |
4063 | For example, given: |
4064 | ||
4065 | template <class T> struct S1 { | |
4066 | template <class U> struct S2 {}; | |
4067 | template <class U> struct S2<U*> {}; | |
4068 | }; | |
4069 | ||
4070 | we will be called with an ARGLIST of `U*', but the | |
4071 | TEMPLATE will be `template <class T> template | |
4072 | <class U> struct S1<T>::S2'. We must fill in the missing | |
4073 | arguments. */ | |
7ac7b28f MM |
4074 | arglist |
4075 | = add_outermost_template_args (TYPE_TI_ARGS (TREE_TYPE (template)), | |
4076 | arglist); | |
36a117a5 MM |
4077 | arg_depth = TMPL_ARGS_DEPTH (arglist); |
4078 | } | |
5566b478 | 4079 | |
41f5d4b1 | 4080 | /* Now we should have enough arguments. */ |
36a117a5 MM |
4081 | my_friendly_assert (parm_depth == arg_depth, 0); |
4082 | ||
7ac7b28f MM |
4083 | /* From here on, we're only interested in the most general |
4084 | template. */ | |
4085 | template = gen_tmpl; | |
4086 | ||
36a117a5 MM |
4087 | /* Calculate the BOUND_ARGS. These will be the args that are |
4088 | actually tsubst'd into the definition to create the | |
4089 | instantiation. */ | |
4090 | if (parm_depth > 1) | |
830bfa74 MM |
4091 | { |
4092 | /* We have multiple levels of arguments to coerce, at once. */ | |
830bfa74 | 4093 | int i; |
e4a84209 | 4094 | int saved_depth = TMPL_ARGS_DEPTH (arglist); |
36a117a5 | 4095 | |
f31c0a32 | 4096 | tree bound_args = make_tree_vec (parm_depth); |
830bfa74 | 4097 | |
e4a84209 | 4098 | for (i = saved_depth, |
830bfa74 | 4099 | t = DECL_TEMPLATE_PARMS (template); |
e4a84209 | 4100 | i > 0 && t != NULL_TREE; |
830bfa74 | 4101 | --i, t = TREE_CHAIN (t)) |
e4a84209 | 4102 | { |
ee3071ef NS |
4103 | tree a = coerce_template_parms (TREE_VALUE (t), |
4104 | arglist, template, | |
4105 | complain, /*require_all_args=*/1); | |
88e98cfe KL |
4106 | |
4107 | /* Don't process further if one of the levels fails. */ | |
4108 | if (a == error_mark_node) | |
4109 | { | |
4110 | /* Restore the ARGLIST to its full size. */ | |
4111 | TREE_VEC_LENGTH (arglist) = saved_depth; | |
4112 | POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, error_mark_node); | |
4113 | } | |
4114 | ||
e4a84209 MM |
4115 | SET_TMPL_ARGS_LEVEL (bound_args, i, a); |
4116 | ||
4117 | /* We temporarily reduce the length of the ARGLIST so | |
4118 | that coerce_template_parms will see only the arguments | |
4119 | corresponding to the template parameters it is | |
4120 | examining. */ | |
4121 | TREE_VEC_LENGTH (arglist)--; | |
4122 | } | |
4123 | ||
4124 | /* Restore the ARGLIST to its full size. */ | |
4125 | TREE_VEC_LENGTH (arglist) = saved_depth; | |
4126 | ||
36a117a5 | 4127 | arglist = bound_args; |
830bfa74 MM |
4128 | } |
4129 | else | |
36a117a5 MM |
4130 | arglist |
4131 | = coerce_template_parms (INNERMOST_TEMPLATE_PARMS (parmlist), | |
f9a7ae04 | 4132 | INNERMOST_TEMPLATE_ARGS (arglist), |
f9c244b8 NS |
4133 | template, |
4134 | complain, /*require_all_args=*/1); | |
36a117a5 | 4135 | |
3e4a3562 | 4136 | if (arglist == error_mark_node |
544aef8c | 4137 | || (!uses_template_parms (INNERMOST_TEMPLATE_ARGS (arglist)) |
3e4a3562 NS |
4138 | && check_instantiated_args (template, |
4139 | INNERMOST_TEMPLATE_ARGS (arglist), | |
4140 | complain))) | |
36a117a5 | 4141 | /* We were unable to bind the arguments. */ |
fd295cb2 | 4142 | POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, error_mark_node); |
5566b478 | 4143 | |
36a117a5 MM |
4144 | /* In the scope of a template class, explicit references to the |
4145 | template class refer to the type of the template, not any | |
4146 | instantiation of it. For example, in: | |
4147 | ||
4148 | template <class T> class C { void f(C<T>); } | |
4149 | ||
4150 | the `C<T>' is just the same as `C'. Outside of the | |
4151 | class, however, such a reference is an instantiation. */ | |
ed44da02 | 4152 | if (comp_template_args (TYPE_TI_ARGS (template_type), |
36a117a5 MM |
4153 | arglist)) |
4154 | { | |
4155 | found = template_type; | |
4156 | ||
4157 | if (!entering_scope && PRIMARY_TEMPLATE_P (template)) | |
5566b478 | 4158 | { |
36a117a5 MM |
4159 | tree ctx; |
4160 | ||
36a117a5 MM |
4161 | for (ctx = current_class_type; |
4162 | ctx; | |
6df5158a NS |
4163 | ctx = TYPE_CONTEXT (ctx)) |
4164 | { | |
4165 | if (TREE_CODE (ctx) == NAMESPACE_DECL) | |
4166 | break; | |
4167 | if (same_type_p (ctx, template_type)) | |
4168 | goto found_ctx; | |
4169 | } | |
36a117a5 | 4170 | |
6df5158a NS |
4171 | /* We're not in the scope of the class, so the |
4172 | TEMPLATE_TYPE is not the type we want after all. */ | |
4173 | found = NULL_TREE; | |
4174 | found_ctx:; | |
5566b478 MS |
4175 | } |
4176 | } | |
36a117a5 | 4177 | if (found) |
fd295cb2 | 4178 | POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, found); |
414ea4aa MM |
4179 | |
4180 | for (tp = &DECL_TEMPLATE_INSTANTIATIONS (template); | |
4181 | *tp; | |
4182 | tp = &TREE_CHAIN (*tp)) | |
4183 | if (comp_template_args (TREE_PURPOSE (*tp), arglist)) | |
4184 | { | |
4185 | found = *tp; | |
7e7d9517 MM |
4186 | |
4187 | /* Use the move-to-front heuristic to speed up future | |
4188 | searches. */ | |
414ea4aa MM |
4189 | *tp = TREE_CHAIN (*tp); |
4190 | TREE_CHAIN (found) | |
4191 | = DECL_TEMPLATE_INSTANTIATIONS (template); | |
4192 | DECL_TEMPLATE_INSTANTIATIONS (template) = found; | |
7e7d9517 | 4193 | |
fd295cb2 | 4194 | POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, TREE_VALUE (found)); |
414ea4aa | 4195 | } |
5566b478 | 4196 | |
dbfe2124 | 4197 | /* This type is a "partial instantiation" if any of the template |
ab097535 | 4198 | arguments still involve template parameters. Note that we set |
486e4077 MM |
4199 | IS_PARTIAL_INSTANTIATION for partial specializations as |
4200 | well. */ | |
dbfe2124 MM |
4201 | is_partial_instantiation = uses_template_parms (arglist); |
4202 | ||
3ebc5c52 MM |
4203 | if (!is_partial_instantiation |
4204 | && !PRIMARY_TEMPLATE_P (template) | |
4205 | && TREE_CODE (CP_DECL_CONTEXT (template)) == NAMESPACE_DECL) | |
4206 | { | |
3ebc5c52 MM |
4207 | found = xref_tag_from_type (TREE_TYPE (template), |
4208 | DECL_NAME (template), | |
4209 | /*globalize=*/1); | |
fd295cb2 | 4210 | POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, found); |
3ebc5c52 | 4211 | } |
3ebc5c52 | 4212 | |
95ee998c | 4213 | context = tsubst (DECL_CONTEXT (template), arglist, |
c2ea3a40 | 4214 | complain, in_decl); |
95ee998c MM |
4215 | if (!context) |
4216 | context = global_namespace; | |
4217 | ||
36a117a5 | 4218 | /* Create the type. */ |
ed44da02 MM |
4219 | if (TREE_CODE (template_type) == ENUMERAL_TYPE) |
4220 | { | |
dbfe2124 | 4221 | if (!is_partial_instantiation) |
92777ce4 NS |
4222 | { |
4223 | set_current_access_from_decl (TYPE_NAME (template_type)); | |
4224 | t = start_enum (TYPE_IDENTIFIER (template_type)); | |
4225 | } | |
ed44da02 | 4226 | else |
dbfe2124 | 4227 | /* We don't want to call start_enum for this type, since |
ed44da02 MM |
4228 | the values for the enumeration constants may involve |
4229 | template parameters. And, no one should be interested | |
4230 | in the enumeration constants for such a type. */ | |
4231 | t = make_node (ENUMERAL_TYPE); | |
4232 | } | |
4233 | else | |
4234 | { | |
33848bb0 | 4235 | t = make_aggr_type (TREE_CODE (template_type)); |
ed44da02 MM |
4236 | CLASSTYPE_DECLARED_CLASS (t) |
4237 | = CLASSTYPE_DECLARED_CLASS (template_type); | |
ed44da02 | 4238 | SET_CLASSTYPE_IMPLICIT_INSTANTIATION (t); |
f668f160 | 4239 | TYPE_FOR_JAVA (t) = TYPE_FOR_JAVA (template_type); |
ae673f14 JM |
4240 | |
4241 | /* A local class. Make sure the decl gets registered properly. */ | |
4242 | if (context == current_function_decl) | |
4243 | pushtag (DECL_NAME (template), t, 0); | |
ed44da02 MM |
4244 | } |
4245 | ||
ae673f14 JM |
4246 | /* If we called start_enum or pushtag above, this information |
4247 | will already be set up. */ | |
ed44da02 MM |
4248 | if (!TYPE_NAME (t)) |
4249 | { | |
4250 | TYPE_CONTEXT (t) = FROB_CONTEXT (context); | |
36a117a5 | 4251 | |
9188c363 | 4252 | type_decl = create_implicit_typedef (DECL_NAME (template), t); |
ed44da02 | 4253 | DECL_CONTEXT (type_decl) = TYPE_CONTEXT (t); |
9188c363 | 4254 | TYPE_STUB_DECL (t) = type_decl; |
3e72ec9a GDR |
4255 | DECL_SOURCE_LOCATION (type_decl) |
4256 | = DECL_SOURCE_LOCATION (TYPE_STUB_DECL (template_type)); | |
ed44da02 MM |
4257 | } |
4258 | else | |
4259 | type_decl = TYPE_NAME (t); | |
36a117a5 | 4260 | |
cab7a9a3 KL |
4261 | TREE_PRIVATE (type_decl) |
4262 | = TREE_PRIVATE (TYPE_STUB_DECL (template_type)); | |
4263 | TREE_PROTECTED (type_decl) | |
4264 | = TREE_PROTECTED (TYPE_STUB_DECL (template_type)); | |
4265 | ||
9fbf56f7 MM |
4266 | /* Set up the template information. We have to figure out which |
4267 | template is the immediate parent if this is a full | |
4268 | instantiation. */ | |
4269 | if (parm_depth == 1 || is_partial_instantiation | |
4270 | || !PRIMARY_TEMPLATE_P (template)) | |
4271 | /* This case is easy; there are no member templates involved. */ | |
4272 | found = template; | |
4273 | else | |
4274 | { | |
ab097535 NS |
4275 | /* This is a full instantiation of a member template. Look |
4276 | for a partial instantiation of which this is an instance. */ | |
9fbf56f7 MM |
4277 | |
4278 | for (found = DECL_TEMPLATE_INSTANTIATIONS (template); | |
4279 | found; found = TREE_CHAIN (found)) | |
4280 | { | |
4281 | int success; | |
4282 | tree tmpl = CLASSTYPE_TI_TEMPLATE (TREE_VALUE (found)); | |
4283 | ||
4284 | /* We only want partial instantiations, here, not | |
4285 | specializations or full instantiations. */ | |
370af2d5 | 4286 | if (CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_VALUE (found)) |
9fbf56f7 MM |
4287 | || !uses_template_parms (TREE_VALUE (found))) |
4288 | continue; | |
4289 | ||
4290 | /* Temporarily reduce by one the number of levels in the | |
4291 | ARGLIST and in FOUND so as to avoid comparing the | |
4292 | last set of arguments. */ | |
4293 | TREE_VEC_LENGTH (arglist)--; | |
4294 | TREE_VEC_LENGTH (TREE_PURPOSE (found)) --; | |
4295 | ||
4296 | /* See if the arguments match. If they do, then TMPL is | |
4297 | the partial instantiation we want. */ | |
4298 | success = comp_template_args (TREE_PURPOSE (found), arglist); | |
4299 | ||
4300 | /* Restore the argument vectors to their full size. */ | |
4301 | TREE_VEC_LENGTH (arglist)++; | |
4302 | TREE_VEC_LENGTH (TREE_PURPOSE (found))++; | |
4303 | ||
4304 | if (success) | |
4305 | { | |
4306 | found = tmpl; | |
4307 | break; | |
4308 | } | |
4309 | } | |
4310 | ||
4311 | if (!found) | |
ab097535 NS |
4312 | { |
4313 | /* There was no partial instantiation. This happens | |
4314 | where C<T> is a member template of A<T> and it's used | |
4315 | in something like | |
4316 | ||
4317 | template <typename T> struct B { A<T>::C<int> m; }; | |
4318 | B<float>; | |
4319 | ||
4320 | Create the partial instantiation. | |
4321 | */ | |
4322 | TREE_VEC_LENGTH (arglist)--; | |
c2ea3a40 | 4323 | found = tsubst (template, arglist, complain, NULL_TREE); |
ab097535 | 4324 | TREE_VEC_LENGTH (arglist)++; |
ab097535 | 4325 | } |
9fbf56f7 MM |
4326 | } |
4327 | ||
ab097535 | 4328 | SET_TYPE_TEMPLATE_INFO (t, tree_cons (found, arglist, NULL_TREE)); |
dbfe2124 MM |
4329 | DECL_TEMPLATE_INSTANTIATIONS (template) |
4330 | = tree_cons (arglist, t, | |
4331 | DECL_TEMPLATE_INSTANTIATIONS (template)); | |
4332 | ||
4333 | if (TREE_CODE (t) == ENUMERAL_TYPE | |
4334 | && !is_partial_instantiation) | |
61a127b3 MM |
4335 | /* Now that the type has been registered on the instantiations |
4336 | list, we set up the enumerators. Because the enumeration | |
4337 | constants may involve the enumeration type itself, we make | |
4338 | sure to register the type first, and then create the | |
4339 | constants. That way, doing tsubst_expr for the enumeration | |
4340 | constants won't result in recursive calls here; we'll find | |
4341 | the instantiation and exit above. */ | |
4342 | tsubst_enum (template_type, t, arglist); | |
dbfe2124 | 4343 | |
36a117a5 MM |
4344 | /* Reset the name of the type, now that CLASSTYPE_TEMPLATE_INFO |
4345 | is set up. */ | |
ed44da02 MM |
4346 | if (TREE_CODE (t) != ENUMERAL_TYPE) |
4347 | DECL_NAME (type_decl) = classtype_mangled_name (t); | |
dbfe2124 | 4348 | if (!is_partial_instantiation) |
36a117a5 | 4349 | { |
50a6dbd7 JM |
4350 | /* For backwards compatibility; code that uses |
4351 | -fexternal-templates expects looking up a template to | |
4352 | instantiate it. I think DDD still relies on this. | |
4353 | (jason 8/20/1998) */ | |
ed44da02 MM |
4354 | if (TREE_CODE (t) != ENUMERAL_TYPE |
4355 | && flag_external_templates | |
36a117a5 MM |
4356 | && CLASSTYPE_INTERFACE_KNOWN (TREE_TYPE (template)) |
4357 | && ! CLASSTYPE_INTERFACE_ONLY (TREE_TYPE (template))) | |
4358 | add_pending_template (t); | |
4359 | } | |
4360 | else | |
077e7015 MM |
4361 | /* If the type makes use of template parameters, the |
4362 | code that generates debugging information will crash. */ | |
4363 | DECL_IGNORED_P (TYPE_STUB_DECL (t)) = 1; | |
8d08fdba | 4364 | |
fd295cb2 | 4365 | POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, t); |
36a117a5 | 4366 | } |
fd295cb2 | 4367 | timevar_pop (TV_NAME_LOOKUP); |
8d08fdba MS |
4368 | } |
4369 | \f | |
8dfaeb63 | 4370 | struct pair_fn_data |
8d08fdba | 4371 | { |
8dfaeb63 MM |
4372 | tree_fn_t fn; |
4373 | void *data; | |
4f2c9d7e | 4374 | htab_t visited; |
8dfaeb63 MM |
4375 | }; |
4376 | ||
4377 | /* Called from for_each_template_parm via walk_tree. */ | |
581d38d0 | 4378 | |
8dfaeb63 | 4379 | static tree |
3a978d72 | 4380 | for_each_template_parm_r (tree* tp, int* walk_subtrees, void* d) |
8dfaeb63 MM |
4381 | { |
4382 | tree t = *tp; | |
4383 | struct pair_fn_data *pfd = (struct pair_fn_data *) d; | |
4384 | tree_fn_t fn = pfd->fn; | |
4385 | void *data = pfd->data; | |
4f2c9d7e MM |
4386 | void **slot; |
4387 | ||
4388 | /* If we have already visited this tree, there's no need to walk | |
4389 | subtrees. Otherwise, add it to the visited table. */ | |
4390 | slot = htab_find_slot (pfd->visited, *tp, INSERT); | |
4391 | if (*slot) | |
4392 | { | |
4393 | *walk_subtrees = 0; | |
4394 | return NULL_TREE; | |
4395 | } | |
4396 | *slot = *tp; | |
4397 | ||
2f939d94 | 4398 | if (TYPE_P (t) |
4f2c9d7e | 4399 | && for_each_template_parm (TYPE_CONTEXT (t), fn, data, pfd->visited)) |
8dfaeb63 | 4400 | return error_mark_node; |
581d38d0 | 4401 | |
8d08fdba MS |
4402 | switch (TREE_CODE (t)) |
4403 | { | |
8d08fdba | 4404 | case RECORD_TYPE: |
9076e292 | 4405 | if (TYPE_PTRMEMFUNC_P (t)) |
8dfaeb63 | 4406 | break; |
ed44da02 MM |
4407 | /* Fall through. */ |
4408 | ||
8d08fdba | 4409 | case UNION_TYPE: |
ed44da02 | 4410 | case ENUMERAL_TYPE: |
8dfaeb63 MM |
4411 | if (!TYPE_TEMPLATE_INFO (t)) |
4412 | *walk_subtrees = 0; | |
4413 | else if (for_each_template_parm (TREE_VALUE (TYPE_TEMPLATE_INFO (t)), | |
4f2c9d7e | 4414 | fn, data, pfd->visited)) |
8dfaeb63 MM |
4415 | return error_mark_node; |
4416 | break; | |
4417 | ||
588c2d1c | 4418 | case METHOD_TYPE: |
8dfaeb63 MM |
4419 | /* Since we're not going to walk subtrees, we have to do this |
4420 | explicitly here. */ | |
4f2c9d7e MM |
4421 | if (for_each_template_parm (TYPE_METHOD_BASETYPE (t), fn, data, |
4422 | pfd->visited)) | |
8dfaeb63 | 4423 | return error_mark_node; |
4890c2f4 | 4424 | /* Fall through. */ |
588c2d1c MM |
4425 | |
4426 | case FUNCTION_TYPE: | |
8dfaeb63 | 4427 | /* Check the return type. */ |
4f2c9d7e | 4428 | if (for_each_template_parm (TREE_TYPE (t), fn, data, pfd->visited)) |
8dfaeb63 MM |
4429 | return error_mark_node; |
4430 | ||
588c2d1c MM |
4431 | /* Check the parameter types. Since default arguments are not |
4432 | instantiated until they are needed, the TYPE_ARG_TYPES may | |
4433 | contain expressions that involve template parameters. But, | |
4434 | no-one should be looking at them yet. And, once they're | |
4435 | instantiated, they don't contain template parameters, so | |
4436 | there's no point in looking at them then, either. */ | |
4437 | { | |
4438 | tree parm; | |
4439 | ||
4440 | for (parm = TYPE_ARG_TYPES (t); parm; parm = TREE_CHAIN (parm)) | |
4f2c9d7e MM |
4441 | if (for_each_template_parm (TREE_VALUE (parm), fn, data, |
4442 | pfd->visited)) | |
8dfaeb63 | 4443 | return error_mark_node; |
5566b478 | 4444 | |
8dfaeb63 MM |
4445 | /* Since we've already handled the TYPE_ARG_TYPES, we don't |
4446 | want walk_tree walking into them itself. */ | |
4447 | *walk_subtrees = 0; | |
4448 | } | |
4449 | break; | |
3ac3d9ea | 4450 | |
a723baf1 MM |
4451 | case TYPEOF_TYPE: |
4452 | if (for_each_template_parm (TYPE_FIELDS (t), fn, data, | |
4453 | pfd->visited)) | |
4454 | return error_mark_node; | |
4455 | break; | |
4456 | ||
8d08fdba | 4457 | case FUNCTION_DECL: |
5566b478 | 4458 | case VAR_DECL: |
5566b478 | 4459 | if (DECL_LANG_SPECIFIC (t) && DECL_TEMPLATE_INFO (t) |
4f2c9d7e MM |
4460 | && for_each_template_parm (DECL_TI_ARGS (t), fn, data, |
4461 | pfd->visited)) | |
8dfaeb63 MM |
4462 | return error_mark_node; |
4463 | /* Fall through. */ | |
4464 | ||
8d08fdba | 4465 | case PARM_DECL: |
a723baf1 MM |
4466 | case CONST_DECL: |
4467 | if (TREE_CODE (t) == CONST_DECL && DECL_TEMPLATE_PARM_P (t) | |
4468 | && for_each_template_parm (DECL_INITIAL (t), fn, data, | |
4469 | pfd->visited)) | |
4470 | return error_mark_node; | |
050367a3 | 4471 | if (DECL_CONTEXT (t) |
4f2c9d7e MM |
4472 | && for_each_template_parm (DECL_CONTEXT (t), fn, data, |
4473 | pfd->visited)) | |
8dfaeb63 MM |
4474 | return error_mark_node; |
4475 | break; | |
8d08fdba | 4476 | |
a1281f45 | 4477 | case BOUND_TEMPLATE_TEMPLATE_PARM: |
744fac59 | 4478 | /* Record template parameters such as `T' inside `TT<T>'. */ |
4f2c9d7e | 4479 | if (for_each_template_parm (TYPE_TI_ARGS (t), fn, data, pfd->visited)) |
8dfaeb63 MM |
4480 | return error_mark_node; |
4481 | /* Fall through. */ | |
4482 | ||
a1281f45 | 4483 | case TEMPLATE_TEMPLATE_PARM: |
744fac59 | 4484 | case TEMPLATE_TYPE_PARM: |
f84b4be9 | 4485 | case TEMPLATE_PARM_INDEX: |
8dfaeb63 MM |
4486 | if (fn && (*fn)(t, data)) |
4487 | return error_mark_node; | |
4488 | else if (!fn) | |
4489 | return error_mark_node; | |
4490 | break; | |
5156628f | 4491 | |
8dfaeb63 MM |
4492 | case TEMPLATE_DECL: |
4493 | /* A template template parameter is encountered */ | |
4494 | if (DECL_TEMPLATE_TEMPLATE_PARM_P (t) | |
4f2c9d7e | 4495 | && for_each_template_parm (TREE_TYPE (t), fn, data, pfd->visited)) |
8dfaeb63 | 4496 | return error_mark_node; |
db5ae43f | 4497 | |
8dfaeb63 MM |
4498 | /* Already substituted template template parameter */ |
4499 | *walk_subtrees = 0; | |
4500 | break; | |
b8865407 | 4501 | |
4699c561 | 4502 | case TYPENAME_TYPE: |
4f2c9d7e MM |
4503 | if (!fn |
4504 | || for_each_template_parm (TYPENAME_TYPE_FULLNAME (t), fn, | |
4505 | data, pfd->visited)) | |
8dfaeb63 MM |
4506 | return error_mark_node; |
4507 | break; | |
4699c561 | 4508 | |
8dfaeb63 MM |
4509 | case CONSTRUCTOR: |
4510 | if (TREE_TYPE (t) && TYPE_PTRMEMFUNC_P (TREE_TYPE (t)) | |
4511 | && for_each_template_parm (TYPE_PTRMEMFUNC_FN_TYPE | |
4f2c9d7e MM |
4512 | (TREE_TYPE (t)), fn, data, |
4513 | pfd->visited)) | |
8dfaeb63 MM |
4514 | return error_mark_node; |
4515 | break; | |
4516 | ||
b8865407 MM |
4517 | case INDIRECT_REF: |
4518 | case COMPONENT_REF: | |
4699c561 | 4519 | /* If there's no type, then this thing must be some expression |
b8865407 | 4520 | involving template parameters. */ |
4699c561 | 4521 | if (!fn && !TREE_TYPE (t)) |
8dfaeb63 MM |
4522 | return error_mark_node; |
4523 | break; | |
b8865407 | 4524 | |
42976354 BK |
4525 | case MODOP_EXPR: |
4526 | case CAST_EXPR: | |
4527 | case REINTERPRET_CAST_EXPR: | |
4528 | case CONST_CAST_EXPR: | |
4529 | case STATIC_CAST_EXPR: | |
4530 | case DYNAMIC_CAST_EXPR: | |
42976354 BK |
4531 | case ARROW_EXPR: |
4532 | case DOTSTAR_EXPR: | |
4533 | case TYPEID_EXPR: | |
40242ccf | 4534 | case PSEUDO_DTOR_EXPR: |
b8865407 | 4535 | if (!fn) |
8dfaeb63 MM |
4536 | return error_mark_node; |
4537 | break; | |
abff8e06 | 4538 | |
bd9bb3d2 MM |
4539 | case BASELINK: |
4540 | /* If we do not handle this case specially, we end up walking | |
4541 | the BINFO hierarchy, which is circular, and therefore | |
4542 | confuses walk_tree. */ | |
4543 | *walk_subtrees = 0; | |
4f2c9d7e MM |
4544 | if (for_each_template_parm (BASELINK_FUNCTIONS (*tp), fn, data, |
4545 | pfd->visited)) | |
bd9bb3d2 MM |
4546 | return error_mark_node; |
4547 | break; | |
4548 | ||
8d08fdba | 4549 | default: |
8dfaeb63 | 4550 | break; |
8d08fdba | 4551 | } |
8dfaeb63 MM |
4552 | |
4553 | /* We didn't find any template parameters we liked. */ | |
4554 | return NULL_TREE; | |
4555 | } | |
4556 | ||
a1281f45 KL |
4557 | /* For each TEMPLATE_TYPE_PARM, TEMPLATE_TEMPLATE_PARM, |
4558 | BOUND_TEMPLATE_TEMPLATE_PARM or TEMPLATE_PARM_INDEX in T, | |
4559 | call FN with the parameter and the DATA. | |
838dfd8a | 4560 | If FN returns nonzero, the iteration is terminated, and |
8dfaeb63 | 4561 | for_each_template_parm returns 1. Otherwise, the iteration |
838dfd8a | 4562 | continues. If FN never returns a nonzero value, the value |
8dfaeb63 MM |
4563 | returned by for_each_template_parm is 0. If FN is NULL, it is |
4564 | considered to be the function which always returns 1. */ | |
4565 | ||
4566 | static int | |
3a978d72 | 4567 | for_each_template_parm (tree t, tree_fn_t fn, void* data, htab_t visited) |
8dfaeb63 MM |
4568 | { |
4569 | struct pair_fn_data pfd; | |
ad2ae3b2 | 4570 | int result; |
8dfaeb63 MM |
4571 | |
4572 | /* Set up. */ | |
4573 | pfd.fn = fn; | |
4574 | pfd.data = data; | |
4575 | ||
4890c2f4 MM |
4576 | /* Walk the tree. (Conceptually, we would like to walk without |
4577 | duplicates, but for_each_template_parm_r recursively calls | |
4578 | for_each_template_parm, so we would need to reorganize a fair | |
4f2c9d7e MM |
4579 | bit to use walk_tree_without_duplicates, so we keep our own |
4580 | visited list.) */ | |
4581 | if (visited) | |
4582 | pfd.visited = visited; | |
4583 | else | |
4584 | pfd.visited = htab_create (37, htab_hash_pointer, htab_eq_pointer, | |
4585 | NULL); | |
ad2ae3b2 MM |
4586 | result = walk_tree (&t, |
4587 | for_each_template_parm_r, | |
4588 | &pfd, | |
4589 | NULL) != NULL_TREE; | |
4590 | ||
4591 | /* Clean up. */ | |
4592 | if (!visited) | |
4593 | htab_delete (pfd.visited); | |
4594 | ||
4595 | return result; | |
8d08fdba MS |
4596 | } |
4597 | ||
050367a3 | 4598 | int |
3a978d72 | 4599 | uses_template_parms (tree t) |
050367a3 | 4600 | { |
4f2c9d7e | 4601 | return for_each_template_parm (t, 0, 0, NULL); |
050367a3 MM |
4602 | } |
4603 | ||
27fafc8d | 4604 | static int tinst_depth; |
e9f32eb5 | 4605 | extern int max_tinst_depth; |
5566b478 | 4606 | #ifdef GATHER_STATISTICS |
27fafc8d | 4607 | int depth_reached; |
5566b478 | 4608 | #endif |
8dfaeb63 MM |
4609 | static int tinst_level_tick; |
4610 | static int last_template_error_tick; | |
8d08fdba | 4611 | |
3ae18eaf JM |
4612 | /* We're starting to instantiate D; record the template instantiation context |
4613 | for diagnostics and to restore it later. */ | |
4614 | ||
742a37d5 | 4615 | int |
3a978d72 | 4616 | push_tinst_level (tree d) |
8d08fdba | 4617 | { |
3ae18eaf | 4618 | tree new; |
8d08fdba | 4619 | |
7215f9a0 MS |
4620 | if (tinst_depth >= max_tinst_depth) |
4621 | { | |
8adf5b5e JM |
4622 | /* If the instantiation in question still has unbound template parms, |
4623 | we don't really care if we can't instantiate it, so just return. | |
4624 | This happens with base instantiation for implicit `typename'. */ | |
4625 | if (uses_template_parms (d)) | |
4626 | return 0; | |
4627 | ||
1139b3d8 | 4628 | last_template_error_tick = tinst_level_tick; |
33bd39a2 | 4629 | error ("template instantiation depth exceeds maximum of %d (use -ftemplate-depth-NN to increase the maximum) instantiating `%D'", |
b4f4233d | 4630 | max_tinst_depth, d); |
5566b478 | 4631 | |
cb753e49 | 4632 | print_instantiation_context (); |
5566b478 | 4633 | |
7215f9a0 MS |
4634 | return 0; |
4635 | } | |
4636 | ||
d479d37f | 4637 | new = build_expr_wfl (d, input_filename, input_line, 0); |
3ae18eaf | 4638 | TREE_CHAIN (new) = current_tinst_level; |
8d08fdba | 4639 | current_tinst_level = new; |
5566b478 | 4640 | |
7215f9a0 | 4641 | ++tinst_depth; |
5566b478 MS |
4642 | #ifdef GATHER_STATISTICS |
4643 | if (tinst_depth > depth_reached) | |
4644 | depth_reached = tinst_depth; | |
4645 | #endif | |
4646 | ||
27fafc8d | 4647 | ++tinst_level_tick; |
7215f9a0 | 4648 | return 1; |
8d08fdba MS |
4649 | } |
4650 | ||
3ae18eaf JM |
4651 | /* We're done instantiating this template; return to the instantiation |
4652 | context. */ | |
4653 | ||
8d08fdba | 4654 | void |
3a978d72 | 4655 | pop_tinst_level (void) |
8d08fdba | 4656 | { |
3ae18eaf | 4657 | tree old = current_tinst_level; |
8d08fdba | 4658 | |
ae58fa02 MM |
4659 | /* Restore the filename and line number stashed away when we started |
4660 | this instantiation. */ | |
d479d37f | 4661 | input_line = TINST_LINE (old); |
3ae18eaf | 4662 | input_filename = TINST_FILE (old); |
5f2c99c4 | 4663 | extract_interface_info (); |
ae58fa02 | 4664 | |
3ae18eaf | 4665 | current_tinst_level = TREE_CHAIN (old); |
7215f9a0 | 4666 | --tinst_depth; |
27fafc8d | 4667 | ++tinst_level_tick; |
8d08fdba MS |
4668 | } |
4669 | ||
3ae18eaf JM |
4670 | /* We're instantiating a deferred template; restore the template |
4671 | instantiation context in which the instantiation was requested, which | |
4672 | is one step out from LEVEL. */ | |
4673 | ||
4674 | static void | |
3a978d72 | 4675 | reopen_tinst_level (tree level) |
3ae18eaf JM |
4676 | { |
4677 | tree t; | |
4678 | ||
4679 | tinst_depth = 0; | |
4680 | for (t = level; t; t = TREE_CHAIN (t)) | |
4681 | ++tinst_depth; | |
4682 | ||
4683 | current_tinst_level = level; | |
4684 | pop_tinst_level (); | |
4685 | } | |
4686 | ||
4687 | /* Return the outermost template instantiation context, for use with | |
4688 | -falt-external-templates. */ | |
4689 | ||
4690 | tree | |
3a978d72 | 4691 | tinst_for_decl (void) |
8d08fdba | 4692 | { |
3ae18eaf | 4693 | tree p = current_tinst_level; |
8d08fdba MS |
4694 | |
4695 | if (p) | |
3ae18eaf | 4696 | for (; TREE_CHAIN (p) ; p = TREE_CHAIN (p)) |
8d08fdba MS |
4697 | ; |
4698 | return p; | |
4699 | } | |
4700 | ||
f84b4be9 JM |
4701 | /* DECL is a friend FUNCTION_DECL or TEMPLATE_DECL. ARGS is the |
4702 | vector of template arguments, as for tsubst. | |
4703 | ||
dc957d14 | 4704 | Returns an appropriate tsubst'd friend declaration. */ |
f84b4be9 JM |
4705 | |
4706 | static tree | |
3a978d72 | 4707 | tsubst_friend_function (tree decl, tree args) |
f84b4be9 JM |
4708 | { |
4709 | tree new_friend; | |
82a98427 | 4710 | location_t saved_loc = input_location; |
27fafc8d | 4711 | |
82a98427 | 4712 | input_location = DECL_SOURCE_LOCATION (decl); |
27fafc8d | 4713 | |
f84b4be9 JM |
4714 | if (TREE_CODE (decl) == FUNCTION_DECL |
4715 | && DECL_TEMPLATE_INSTANTIATION (decl) | |
4716 | && TREE_CODE (DECL_TI_TEMPLATE (decl)) != TEMPLATE_DECL) | |
4717 | /* This was a friend declared with an explicit template | |
4718 | argument list, e.g.: | |
4719 | ||
4720 | friend void f<>(T); | |
4721 | ||
4722 | to indicate that f was a template instantiation, not a new | |
4723 | function declaration. Now, we have to figure out what | |
4724 | instantiation of what template. */ | |
4725 | { | |
76e57b45 | 4726 | tree template_id, arglist, fns; |
f84b4be9 JM |
4727 | tree new_args; |
4728 | tree tmpl; | |
ed2fa432 | 4729 | tree ns = decl_namespace_context (TYPE_MAIN_DECL (current_class_type)); |
76e57b45 NS |
4730 | |
4731 | /* Friend functions are looked up in the containing namespace scope. | |
4732 | We must enter that scope, to avoid finding member functions of the | |
4733 | current cless with same name. */ | |
4734 | push_nested_namespace (ns); | |
4735 | fns = tsubst_expr (DECL_TI_TEMPLATE (decl), args, | |
c2ea3a40 | 4736 | tf_error | tf_warning, NULL_TREE); |
76e57b45 NS |
4737 | pop_nested_namespace (ns); |
4738 | arglist = tsubst (DECL_TI_ARGS (decl), args, | |
c2ea3a40 | 4739 | tf_error | tf_warning, NULL_TREE); |
76e57b45 NS |
4740 | template_id = lookup_template_function (fns, arglist); |
4741 | ||
c2ea3a40 | 4742 | new_friend = tsubst (decl, args, tf_error | tf_warning, NULL_TREE); |
36a117a5 MM |
4743 | tmpl = determine_specialization (template_id, new_friend, |
4744 | &new_args, | |
bf8f3f93 | 4745 | /*need_member_template=*/0); |
3e4a3562 | 4746 | new_friend = instantiate_template (tmpl, new_args, tf_error); |
27fafc8d | 4747 | goto done; |
f84b4be9 | 4748 | } |
36a117a5 | 4749 | |
c2ea3a40 | 4750 | new_friend = tsubst (decl, args, tf_error | tf_warning, NULL_TREE); |
f84b4be9 | 4751 | |
36a117a5 | 4752 | /* The NEW_FRIEND will look like an instantiation, to the |
f84b4be9 JM |
4753 | compiler, but is not an instantiation from the point of view of |
4754 | the language. For example, we might have had: | |
4755 | ||
4756 | template <class T> struct S { | |
4757 | template <class U> friend void f(T, U); | |
4758 | }; | |
4759 | ||
4760 | Then, in S<int>, template <class U> void f(int, U) is not an | |
4761 | instantiation of anything. */ | |
4762 | DECL_USE_TEMPLATE (new_friend) = 0; | |
4763 | if (TREE_CODE (decl) == TEMPLATE_DECL) | |
655dc6ee JM |
4764 | { |
4765 | DECL_USE_TEMPLATE (DECL_TEMPLATE_RESULT (new_friend)) = 0; | |
4766 | DECL_SAVED_TREE (DECL_TEMPLATE_RESULT (new_friend)) | |
4767 | = DECL_SAVED_TREE (DECL_TEMPLATE_RESULT (decl)); | |
4768 | } | |
36a117a5 | 4769 | |
92643fea MM |
4770 | /* The mangled name for the NEW_FRIEND is incorrect. The function |
4771 | is not a template instantiation and should not be mangled like | |
4772 | one. Therefore, we forget the mangling here; we'll recompute it | |
4773 | later if we need it. */ | |
36a117a5 MM |
4774 | if (TREE_CODE (new_friend) != TEMPLATE_DECL) |
4775 | { | |
19e7881c | 4776 | SET_DECL_RTL (new_friend, NULL_RTX); |
92643fea | 4777 | SET_DECL_ASSEMBLER_NAME (new_friend, NULL_TREE); |
36a117a5 MM |
4778 | } |
4779 | ||
6eb3bb27 | 4780 | if (DECL_NAMESPACE_SCOPE_P (new_friend)) |
f84b4be9 | 4781 | { |
36a117a5 | 4782 | tree old_decl; |
fbf1c34b MM |
4783 | tree new_friend_template_info; |
4784 | tree new_friend_result_template_info; | |
92da7074 | 4785 | tree ns; |
fbf1c34b MM |
4786 | int new_friend_is_defn; |
4787 | ||
4788 | /* We must save some information from NEW_FRIEND before calling | |
4789 | duplicate decls since that function will free NEW_FRIEND if | |
4790 | possible. */ | |
4791 | new_friend_template_info = DECL_TEMPLATE_INFO (new_friend); | |
f84b4be9 | 4792 | if (TREE_CODE (new_friend) == TEMPLATE_DECL) |
fbf1c34b MM |
4793 | { |
4794 | /* This declaration is a `primary' template. */ | |
4795 | DECL_PRIMARY_TEMPLATE (new_friend) = new_friend; | |
4796 | ||
4797 | new_friend_is_defn | |
17aec3eb | 4798 | = DECL_INITIAL (DECL_TEMPLATE_RESULT (new_friend)) != NULL_TREE; |
fbf1c34b | 4799 | new_friend_result_template_info |
17aec3eb | 4800 | = DECL_TEMPLATE_INFO (DECL_TEMPLATE_RESULT (new_friend)); |
fbf1c34b MM |
4801 | } |
4802 | else | |
4803 | { | |
4804 | new_friend_is_defn = DECL_INITIAL (new_friend) != NULL_TREE; | |
4805 | new_friend_result_template_info = NULL_TREE; | |
4806 | } | |
36a117a5 | 4807 | |
1c227897 MM |
4808 | /* Inside pushdecl_namespace_level, we will push into the |
4809 | current namespace. However, the friend function should go | |
c6002625 | 4810 | into the namespace of the template. */ |
92da7074 ML |
4811 | ns = decl_namespace_context (new_friend); |
4812 | push_nested_namespace (ns); | |
36a117a5 | 4813 | old_decl = pushdecl_namespace_level (new_friend); |
92da7074 | 4814 | pop_nested_namespace (ns); |
36a117a5 MM |
4815 | |
4816 | if (old_decl != new_friend) | |
4817 | { | |
4818 | /* This new friend declaration matched an existing | |
4819 | declaration. For example, given: | |
4820 | ||
4821 | template <class T> void f(T); | |
4822 | template <class U> class C { | |
4823 | template <class T> friend void f(T) {} | |
4824 | }; | |
4825 | ||
4826 | the friend declaration actually provides the definition | |
4827 | of `f', once C has been instantiated for some type. So, | |
4828 | old_decl will be the out-of-class template declaration, | |
4829 | while new_friend is the in-class definition. | |
4830 | ||
4831 | But, if `f' was called before this point, the | |
4832 | instantiation of `f' will have DECL_TI_ARGS corresponding | |
4833 | to `T' but not to `U', references to which might appear | |
4834 | in the definition of `f'. Previously, the most general | |
4835 | template for an instantiation of `f' was the out-of-class | |
4836 | version; now it is the in-class version. Therefore, we | |
4837 | run through all specialization of `f', adding to their | |
4838 | DECL_TI_ARGS appropriately. In particular, they need a | |
4839 | new set of outer arguments, corresponding to the | |
4840 | arguments for this class instantiation. | |
4841 | ||
4842 | The same situation can arise with something like this: | |
4843 | ||
4844 | friend void f(int); | |
4845 | template <class T> class C { | |
4846 | friend void f(T) {} | |
4847 | }; | |
4848 | ||
4849 | when `C<int>' is instantiated. Now, `f(int)' is defined | |
4850 | in the class. */ | |
4851 | ||
fbf1c34b MM |
4852 | if (!new_friend_is_defn) |
4853 | /* On the other hand, if the in-class declaration does | |
4854 | *not* provide a definition, then we don't want to alter | |
4855 | existing definitions. We can just leave everything | |
4856 | alone. */ | |
36a117a5 | 4857 | ; |
fbf1c34b | 4858 | else |
36a117a5 | 4859 | { |
fbf1c34b MM |
4860 | /* Overwrite whatever template info was there before, if |
4861 | any, with the new template information pertaining to | |
4862 | the declaration. */ | |
4863 | DECL_TEMPLATE_INFO (old_decl) = new_friend_template_info; | |
4864 | ||
4865 | if (TREE_CODE (old_decl) != TEMPLATE_DECL) | |
8d83f792 MM |
4866 | reregister_specialization (new_friend, |
4867 | most_general_template (old_decl), | |
4868 | old_decl); | |
fbf1c34b | 4869 | else |
36a117a5 | 4870 | { |
fbf1c34b MM |
4871 | tree t; |
4872 | tree new_friend_args; | |
4873 | ||
17aec3eb | 4874 | DECL_TEMPLATE_INFO (DECL_TEMPLATE_RESULT (old_decl)) |
fbf1c34b MM |
4875 | = new_friend_result_template_info; |
4876 | ||
4877 | new_friend_args = TI_ARGS (new_friend_template_info); | |
4878 | for (t = DECL_TEMPLATE_SPECIALIZATIONS (old_decl); | |
4879 | t != NULL_TREE; | |
4880 | t = TREE_CHAIN (t)) | |
4881 | { | |
4882 | tree spec = TREE_VALUE (t); | |
36a117a5 | 4883 | |
fbf1c34b MM |
4884 | DECL_TI_ARGS (spec) |
4885 | = add_outermost_template_args (new_friend_args, | |
4886 | DECL_TI_ARGS (spec)); | |
fbf1c34b MM |
4887 | } |
4888 | ||
4889 | /* Now, since specializations are always supposed to | |
4890 | hang off of the most general template, we must move | |
4891 | them. */ | |
4892 | t = most_general_template (old_decl); | |
4893 | if (t != old_decl) | |
4894 | { | |
4895 | DECL_TEMPLATE_SPECIALIZATIONS (t) | |
4896 | = chainon (DECL_TEMPLATE_SPECIALIZATIONS (t), | |
4897 | DECL_TEMPLATE_SPECIALIZATIONS (old_decl)); | |
4898 | DECL_TEMPLATE_SPECIALIZATIONS (old_decl) = NULL_TREE; | |
4899 | } | |
36a117a5 MM |
4900 | } |
4901 | } | |
4902 | ||
4903 | /* The information from NEW_FRIEND has been merged into OLD_DECL | |
4904 | by duplicate_decls. */ | |
4905 | new_friend = old_decl; | |
4906 | } | |
f84b4be9 | 4907 | } |
d0f062fb | 4908 | else if (COMPLETE_TYPE_P (DECL_CONTEXT (new_friend))) |
f84b4be9 JM |
4909 | { |
4910 | /* Check to see that the declaration is really present, and, | |
4911 | possibly obtain an improved declaration. */ | |
4912 | tree fn = check_classfn (DECL_CONTEXT (new_friend), | |
4913 | new_friend); | |
4914 | ||
4915 | if (fn) | |
4916 | new_friend = fn; | |
4917 | } | |
4918 | ||
27fafc8d | 4919 | done: |
82a98427 | 4920 | input_location = saved_loc; |
f84b4be9 JM |
4921 | return new_friend; |
4922 | } | |
4923 | ||
1aed5355 MM |
4924 | /* FRIEND_TMPL is a friend TEMPLATE_DECL. ARGS is the vector of |
4925 | template arguments, as for tsubst. | |
6757edfe | 4926 | |
dc957d14 | 4927 | Returns an appropriate tsubst'd friend type or error_mark_node on |
4b054b80 | 4928 | failure. */ |
6757edfe MM |
4929 | |
4930 | static tree | |
3a978d72 | 4931 | tsubst_friend_class (tree friend_tmpl, tree args) |
6757edfe | 4932 | { |
1aed5355 | 4933 | tree friend_type; |
25aab5d0 | 4934 | tree tmpl; |
3e0ec82f | 4935 | tree context; |
6757edfe | 4936 | |
3e0ec82f MM |
4937 | context = DECL_CONTEXT (friend_tmpl); |
4938 | ||
4939 | if (context) | |
77adef84 | 4940 | { |
3e0ec82f MM |
4941 | if (TREE_CODE (context) == NAMESPACE_DECL) |
4942 | push_nested_namespace (context); | |
4943 | else | |
14d22dd6 | 4944 | push_nested_class (tsubst (context, args, tf_none, NULL_TREE)); |
3e0ec82f | 4945 | } |
25aab5d0 | 4946 | |
3e0ec82f MM |
4947 | /* First, we look for a class template. */ |
4948 | tmpl = lookup_name (DECL_NAME (friend_tmpl), /*prefer_type=*/0); | |
25aab5d0 | 4949 | |
3e0ec82f MM |
4950 | /* But, if we don't find one, it might be because we're in a |
4951 | situation like this: | |
77adef84 | 4952 | |
3e0ec82f MM |
4953 | template <class T> |
4954 | struct S { | |
4955 | template <class U> | |
4956 | friend struct S; | |
4957 | }; | |
4958 | ||
4959 | Here, in the scope of (say) S<int>, `S' is bound to a TYPE_DECL | |
4960 | for `S<int>', not the TEMPLATE_DECL. */ | |
4961 | if (!tmpl || !DECL_CLASS_TEMPLATE_P (tmpl)) | |
4962 | { | |
4963 | tmpl = lookup_name (DECL_NAME (friend_tmpl), /*prefer_type=*/1); | |
4964 | tmpl = maybe_get_template_decl_from_type_decl (tmpl); | |
25aab5d0 | 4965 | } |
6757edfe | 4966 | |
25aab5d0 | 4967 | if (tmpl && DECL_CLASS_TEMPLATE_P (tmpl)) |
6757edfe MM |
4968 | { |
4969 | /* The friend template has already been declared. Just | |
36a117a5 MM |
4970 | check to see that the declarations match, and install any new |
4971 | default parameters. We must tsubst the default parameters, | |
4972 | of course. We only need the innermost template parameters | |
4973 | because that is all that redeclare_class_template will look | |
4974 | at. */ | |
3e0ec82f MM |
4975 | if (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (friend_tmpl)) |
4976 | > TMPL_ARGS_DEPTH (args)) | |
4977 | { | |
4978 | tree parms; | |
4979 | parms = tsubst_template_parms (DECL_TEMPLATE_PARMS (friend_tmpl), | |
4980 | args, tf_error | tf_warning); | |
4981 | redeclare_class_template (TREE_TYPE (tmpl), parms); | |
4982 | } | |
4983 | ||
6757edfe MM |
4984 | friend_type = TREE_TYPE (tmpl); |
4985 | } | |
4986 | else | |
4987 | { | |
4988 | /* The friend template has not already been declared. In this | |
4989 | case, the instantiation of the template class will cause the | |
4990 | injection of this template into the global scope. */ | |
c2ea3a40 | 4991 | tmpl = tsubst (friend_tmpl, args, tf_error | tf_warning, NULL_TREE); |
6757edfe MM |
4992 | |
4993 | /* The new TMPL is not an instantiation of anything, so we | |
4994 | forget its origins. We don't reset CLASSTYPE_TI_TEMPLATE for | |
4995 | the new type because that is supposed to be the corresponding | |
4996 | template decl, i.e., TMPL. */ | |
4997 | DECL_USE_TEMPLATE (tmpl) = 0; | |
4998 | DECL_TEMPLATE_INFO (tmpl) = NULL_TREE; | |
4999 | CLASSTYPE_USE_TEMPLATE (TREE_TYPE (tmpl)) = 0; | |
5000 | ||
5001 | /* Inject this template into the global scope. */ | |
5002 | friend_type = TREE_TYPE (pushdecl_top_level (tmpl)); | |
5003 | } | |
5004 | ||
3e0ec82f MM |
5005 | if (context) |
5006 | { | |
5007 | if (TREE_CODE (context) == NAMESPACE_DECL) | |
5008 | pop_nested_namespace (context); | |
5009 | else | |
5010 | pop_nested_class (); | |
5011 | } | |
5012 | ||
6757edfe MM |
5013 | return friend_type; |
5014 | } | |
f84b4be9 | 5015 | |
17f29637 KL |
5016 | /* Returns zero if TYPE cannot be completed later due to circularity. |
5017 | Otherwise returns one. */ | |
5018 | ||
d5372501 | 5019 | static int |
3a978d72 | 5020 | can_complete_type_without_circularity (tree type) |
17f29637 KL |
5021 | { |
5022 | if (type == NULL_TREE || type == error_mark_node) | |
5023 | return 0; | |
5024 | else if (COMPLETE_TYPE_P (type)) | |
5025 | return 1; | |
5026 | else if (TREE_CODE (type) == ARRAY_TYPE && TYPE_DOMAIN (type)) | |
5027 | return can_complete_type_without_circularity (TREE_TYPE (type)); | |
8c6ab2db NS |
5028 | else if (CLASS_TYPE_P (type) |
5029 | && TYPE_BEING_DEFINED (TYPE_MAIN_VARIANT (type))) | |
17f29637 KL |
5030 | return 0; |
5031 | else | |
5032 | return 1; | |
5033 | } | |
5034 | ||
8d08fdba | 5035 | tree |
3a978d72 | 5036 | instantiate_class_template (tree type) |
8d08fdba | 5037 | { |
7088fca9 | 5038 | tree template, args, pattern, t, member; |
36a117a5 | 5039 | tree typedecl; |
dbbf88d1 NS |
5040 | tree pbinfo; |
5041 | ||
5566b478 | 5042 | if (type == error_mark_node) |
8d08fdba MS |
5043 | return error_mark_node; |
5044 | ||
ca099ac8 MM |
5045 | if (TYPE_BEING_DEFINED (type) |
5046 | || COMPLETE_TYPE_P (type) | |
5047 | || dependent_type_p (type)) | |
5566b478 MS |
5048 | return type; |
5049 | ||
6bdb985f | 5050 | /* Figure out which template is being instantiated. */ |
36a117a5 | 5051 | template = most_general_template (CLASSTYPE_TI_TEMPLATE (type)); |
5566b478 | 5052 | my_friendly_assert (TREE_CODE (template) == TEMPLATE_DECL, 279); |
73aad9b9 | 5053 | |
6bdb985f MM |
5054 | /* Figure out which arguments are being used to do the |
5055 | instantiation. */ | |
5056 | args = CLASSTYPE_TI_ARGS (type); | |
4c571114 MM |
5057 | |
5058 | /* Determine what specialization of the original template to | |
5059 | instantiate. */ | |
8fbc5ae7 MM |
5060 | t = most_specialized_class (template, args); |
5061 | if (t == error_mark_node) | |
73aad9b9 | 5062 | { |
8fbc5ae7 MM |
5063 | const char *str = "candidates are:"; |
5064 | error ("ambiguous class template instantiation for `%#T'", type); | |
5065 | for (t = DECL_TEMPLATE_SPECIALIZATIONS (template); t; | |
5066 | t = TREE_CHAIN (t)) | |
73aad9b9 | 5067 | { |
8c6ab2db | 5068 | if (get_class_bindings (TREE_VALUE (t), TREE_PURPOSE (t), args)) |
73aad9b9 | 5069 | { |
8fbc5ae7 MM |
5070 | cp_error_at ("%s %+#T", str, TREE_TYPE (t)); |
5071 | str = " "; | |
73aad9b9 JM |
5072 | } |
5073 | } | |
8fbc5ae7 MM |
5074 | TYPE_BEING_DEFINED (type) = 1; |
5075 | return error_mark_node; | |
73aad9b9 | 5076 | } |
6bdb985f MM |
5077 | |
5078 | if (t) | |
73aad9b9 JM |
5079 | pattern = TREE_TYPE (t); |
5080 | else | |
5081 | pattern = TREE_TYPE (template); | |
5566b478 | 5082 | |
4c571114 MM |
5083 | /* If the template we're instantiating is incomplete, then clearly |
5084 | there's nothing we can do. */ | |
d0f062fb | 5085 | if (!COMPLETE_TYPE_P (pattern)) |
f31c0a32 | 5086 | return type; |
5566b478 | 5087 | |
4c571114 MM |
5088 | /* If we've recursively instantiated too many templates, stop. */ |
5089 | if (! push_tinst_level (type)) | |
f31c0a32 | 5090 | return type; |
4c571114 MM |
5091 | |
5092 | /* Now we're really doing the instantiation. Mark the type as in | |
5093 | the process of being defined. */ | |
5094 | TYPE_BEING_DEFINED (type) = 1; | |
5095 | ||
78757caa KL |
5096 | /* We may be in the middle of deferred access check. Disable |
5097 | it now. */ | |
5098 | push_deferring_access_checks (dk_no_deferred); | |
5099 | ||
4c571114 | 5100 | maybe_push_to_top_level (uses_template_parms (type)); |
4c571114 | 5101 | |
73aad9b9 | 5102 | if (t) |
36a117a5 | 5103 | { |
27631dae | 5104 | /* This TYPE is actually an instantiation of a partial |
36a117a5 MM |
5105 | specialization. We replace the innermost set of ARGS with |
5106 | the arguments appropriate for substitution. For example, | |
5107 | given: | |
5108 | ||
5109 | template <class T> struct S {}; | |
5110 | template <class T> struct S<T*> {}; | |
5111 | ||
5112 | and supposing that we are instantiating S<int*>, ARGS will | |
5113 | present be {int*} but we need {int}. */ | |
5114 | tree inner_args | |
5115 | = get_class_bindings (TREE_VALUE (t), TREE_PURPOSE (t), | |
5116 | args); | |
5117 | ||
5118 | /* If there were multiple levels in ARGS, replacing the | |
5119 | innermost level would alter CLASSTYPE_TI_ARGS, which we don't | |
5120 | want, so we make a copy first. */ | |
5121 | if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (args)) | |
5122 | { | |
5123 | args = copy_node (args); | |
5124 | SET_TMPL_ARGS_LEVEL (args, TMPL_ARGS_DEPTH (args), inner_args); | |
5125 | } | |
5126 | else | |
5127 | args = inner_args; | |
5128 | } | |
8d019cef | 5129 | |
5566b478 MS |
5130 | if (flag_external_templates) |
5131 | { | |
5132 | if (flag_alt_external_templates) | |
5133 | { | |
5134 | CLASSTYPE_INTERFACE_ONLY (type) = interface_only; | |
5135 | SET_CLASSTYPE_INTERFACE_UNKNOWN_X (type, interface_unknown); | |
5566b478 MS |
5136 | } |
5137 | else | |
5138 | { | |
5139 | CLASSTYPE_INTERFACE_ONLY (type) = CLASSTYPE_INTERFACE_ONLY (pattern); | |
5140 | SET_CLASSTYPE_INTERFACE_UNKNOWN_X | |
5141 | (type, CLASSTYPE_INTERFACE_UNKNOWN (pattern)); | |
5566b478 MS |
5142 | } |
5143 | } | |
5144 | else | |
8d08fdba | 5145 | { |
5566b478 | 5146 | SET_CLASSTYPE_INTERFACE_UNKNOWN (type); |
8d08fdba MS |
5147 | } |
5148 | ||
68ea098a NS |
5149 | /* Set the input location to the template definition. This is needed |
5150 | if tsubsting causes an error. */ | |
5151 | input_location = DECL_SOURCE_LOCATION (TYPE_NAME (pattern)); | |
5152 | ||
f7da6097 MS |
5153 | TYPE_HAS_CONSTRUCTOR (type) = TYPE_HAS_CONSTRUCTOR (pattern); |
5154 | TYPE_HAS_DESTRUCTOR (type) = TYPE_HAS_DESTRUCTOR (pattern); | |
834c6dff MM |
5155 | TYPE_HAS_NEW_OPERATOR (type) = TYPE_HAS_NEW_OPERATOR (pattern); |
5156 | TYPE_HAS_ARRAY_NEW_OPERATOR (type) = TYPE_HAS_ARRAY_NEW_OPERATOR (pattern); | |
f7da6097 | 5157 | TYPE_GETS_DELETE (type) = TYPE_GETS_DELETE (pattern); |
f7da6097 MS |
5158 | TYPE_HAS_ASSIGN_REF (type) = TYPE_HAS_ASSIGN_REF (pattern); |
5159 | TYPE_HAS_CONST_ASSIGN_REF (type) = TYPE_HAS_CONST_ASSIGN_REF (pattern); | |
5160 | TYPE_HAS_ABSTRACT_ASSIGN_REF (type) = TYPE_HAS_ABSTRACT_ASSIGN_REF (pattern); | |
5161 | TYPE_HAS_INIT_REF (type) = TYPE_HAS_INIT_REF (pattern); | |
5162 | TYPE_HAS_CONST_INIT_REF (type) = TYPE_HAS_CONST_INIT_REF (pattern); | |
f7da6097 MS |
5163 | TYPE_HAS_DEFAULT_CONSTRUCTOR (type) = TYPE_HAS_DEFAULT_CONSTRUCTOR (pattern); |
5164 | TYPE_HAS_CONVERSION (type) = TYPE_HAS_CONVERSION (pattern); | |
4c6b7393 MM |
5165 | TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (type) |
5166 | = TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (pattern); | |
f7da6097 MS |
5167 | TYPE_USES_MULTIPLE_INHERITANCE (type) |
5168 | = TYPE_USES_MULTIPLE_INHERITANCE (pattern); | |
5169 | TYPE_USES_VIRTUAL_BASECLASSES (type) | |
5170 | = TYPE_USES_VIRTUAL_BASECLASSES (pattern); | |
5171 | TYPE_PACKED (type) = TYPE_PACKED (pattern); | |
5172 | TYPE_ALIGN (type) = TYPE_ALIGN (pattern); | |
11cf4d18 | 5173 | TYPE_USER_ALIGN (type) = TYPE_USER_ALIGN (pattern); |
eff71ab0 | 5174 | TYPE_FOR_JAVA (type) = TYPE_FOR_JAVA (pattern); /* For libjava's JArray<T> */ |
6bdb8141 JM |
5175 | if (ANON_AGGR_TYPE_P (pattern)) |
5176 | SET_ANON_AGGR_TYPE_P (type); | |
f7da6097 | 5177 | |
dbbf88d1 NS |
5178 | pbinfo = TYPE_BINFO (pattern); |
5179 | ||
5180 | if (BINFO_BASETYPES (pbinfo)) | |
3fd71a52 MM |
5181 | { |
5182 | tree base_list = NULL_TREE; | |
dbbf88d1 NS |
5183 | tree pbases = BINFO_BASETYPES (pbinfo); |
5184 | tree paccesses = BINFO_BASEACCESSES (pbinfo); | |
a2507277 | 5185 | tree context = TYPE_CONTEXT (type); |
3fd71a52 | 5186 | int i; |
5566b478 | 5187 | |
a2507277 NS |
5188 | /* We must enter the scope containing the type, as that is where |
5189 | the accessibility of types named in dependent bases are | |
5190 | looked up from. */ | |
5191 | push_scope (context ? context : global_namespace); | |
5192 | ||
3fd71a52 MM |
5193 | /* Substitute into each of the bases to determine the actual |
5194 | basetypes. */ | |
5195 | for (i = 0; i < TREE_VEC_LENGTH (pbases); ++i) | |
5196 | { | |
5197 | tree base; | |
5198 | tree access; | |
5199 | tree pbase; | |
5566b478 | 5200 | |
3fd71a52 | 5201 | pbase = TREE_VEC_ELT (pbases, i); |
dbbf88d1 | 5202 | access = TREE_VEC_ELT (paccesses, i); |
711734a9 | 5203 | |
dc957d14 | 5204 | /* Substitute to figure out the base class. */ |
c2ea3a40 | 5205 | base = tsubst (BINFO_TYPE (pbase), args, tf_error, NULL_TREE); |
3fd71a52 MM |
5206 | if (base == error_mark_node) |
5207 | continue; | |
dbbf88d1 | 5208 | |
3fd71a52 | 5209 | base_list = tree_cons (access, base, base_list); |
dbbf88d1 | 5210 | TREE_VIA_VIRTUAL (base_list) = TREE_VIA_VIRTUAL (pbase); |
3fd71a52 | 5211 | } |
dfbcd65a | 5212 | |
3fd71a52 MM |
5213 | /* The list is now in reverse order; correct that. */ |
5214 | base_list = nreverse (base_list); | |
5215 | ||
5216 | /* Now call xref_basetypes to set up all the base-class | |
5217 | information. */ | |
da15dae6 | 5218 | xref_basetypes (type, base_list); |
a2507277 NS |
5219 | |
5220 | pop_scope (context ? context : global_namespace); | |
3fd71a52 | 5221 | } |
5566b478 | 5222 | |
b74a0560 MM |
5223 | /* Now that our base classes are set up, enter the scope of the |
5224 | class, so that name lookups into base classes, etc. will work | |
dc957d14 | 5225 | correctly. This is precisely analogous to what we do in |
b74a0560 MM |
5226 | begin_class_definition when defining an ordinary non-template |
5227 | class. */ | |
29370796 | 5228 | pushclass (type); |
b74a0560 | 5229 | |
7088fca9 | 5230 | /* Now members are processed in the order of declaration. */ |
8c6ab2db NS |
5231 | for (member = CLASSTYPE_DECL_LIST (pattern); |
5232 | member; member = TREE_CHAIN (member)) | |
8d08fdba | 5233 | { |
7088fca9 | 5234 | tree t = TREE_VALUE (member); |
5566b478 | 5235 | |
7088fca9 | 5236 | if (TREE_PURPOSE (member)) |
ed44da02 | 5237 | { |
7088fca9 KL |
5238 | if (TYPE_P (t)) |
5239 | { | |
5e0c54e5 | 5240 | /* Build new CLASSTYPE_NESTED_UTDS. */ |
8d08fdba | 5241 | |
7088fca9 KL |
5242 | tree tag = t; |
5243 | tree name = TYPE_IDENTIFIER (tag); | |
5244 | tree newtag; | |
ae58fa02 | 5245 | |
7088fca9 KL |
5246 | newtag = tsubst (tag, args, tf_error, NULL_TREE); |
5247 | my_friendly_assert (newtag != error_mark_node, 20010206); | |
5248 | if (TREE_CODE (newtag) != ENUMERAL_TYPE) | |
5249 | { | |
5250 | if (TYPE_LANG_SPECIFIC (tag) && CLASSTYPE_IS_TEMPLATE (tag)) | |
5251 | /* Unfortunately, lookup_template_class sets | |
5252 | CLASSTYPE_IMPLICIT_INSTANTIATION for a partial | |
5253 | instantiation (i.e., for the type of a member template | |
5254 | class nested within a template class.) This behavior is | |
5255 | required for maybe_process_partial_specialization to work | |
5256 | correctly, but is not accurate in this case; the TAG is not | |
5257 | an instantiation of anything. (The corresponding | |
5258 | TEMPLATE_DECL is an instantiation, but the TYPE is not.) */ | |
5259 | CLASSTYPE_USE_TEMPLATE (newtag) = 0; | |
5260 | ||
5261 | /* Now, we call pushtag to put this NEWTAG into the scope of | |
5262 | TYPE. We first set up the IDENTIFIER_TYPE_VALUE to avoid | |
5263 | pushtag calling push_template_decl. We don't have to do | |
5264 | this for enums because it will already have been done in | |
5265 | tsubst_enum. */ | |
5266 | if (name) | |
5267 | SET_IDENTIFIER_TYPE_VALUE (name, newtag); | |
5268 | pushtag (name, newtag, /*globalize=*/0); | |
5269 | } | |
5270 | } | |
5271 | else if (TREE_CODE (t) == FUNCTION_DECL | |
5272 | || DECL_FUNCTION_TEMPLATE_P (t)) | |
5273 | { | |
5274 | /* Build new TYPE_METHODS. */ | |
ae58fa02 | 5275 | |
7088fca9 KL |
5276 | tree r = tsubst (t, args, tf_error, NULL_TREE); |
5277 | set_current_access_from_decl (r); | |
5278 | grok_special_member_properties (r); | |
5279 | finish_member_declaration (r); | |
5280 | } | |
5281 | else | |
5282 | { | |
5283 | /* Build new TYPE_FIELDS. */ | |
fa8d6e85 | 5284 | |
7088fca9 KL |
5285 | if (TREE_CODE (t) != CONST_DECL) |
5286 | { | |
5287 | tree r; | |
fa8d6e85 | 5288 | |
d479d37f NS |
5289 | /* The the file and line for this declaration, to |
5290 | assist in error message reporting. Since we | |
5291 | called push_tinst_level above, we don't need to | |
5292 | restore these. */ | |
82a98427 | 5293 | input_location = DECL_SOURCE_LOCATION (t); |
fa8d6e85 | 5294 | |
fb5ce3c9 NS |
5295 | if (TREE_CODE (t) == TEMPLATE_DECL) |
5296 | processing_template_decl++; | |
7088fca9 | 5297 | r = tsubst (t, args, tf_error | tf_warning, NULL_TREE); |
fb5ce3c9 NS |
5298 | if (TREE_CODE (t) == TEMPLATE_DECL) |
5299 | processing_template_decl--; | |
7088fca9 KL |
5300 | if (TREE_CODE (r) == VAR_DECL) |
5301 | { | |
5302 | tree init; | |
17f29637 | 5303 | |
7088fca9 KL |
5304 | if (DECL_INITIALIZED_IN_CLASS_P (r)) |
5305 | init = tsubst_expr (DECL_INITIAL (t), args, | |
5306 | tf_error | tf_warning, NULL_TREE); | |
5307 | else | |
5308 | init = NULL_TREE; | |
8d08fdba | 5309 | |
8c6ab2db NS |
5310 | finish_static_data_member_decl |
5311 | (r, init, /*asmspec_tree=*/NULL_TREE, /*flags=*/0); | |
8d08fdba | 5312 | |
7088fca9 KL |
5313 | if (DECL_INITIALIZED_IN_CLASS_P (r)) |
5314 | check_static_variable_definition (r, TREE_TYPE (r)); | |
5315 | } | |
5316 | else if (TREE_CODE (r) == FIELD_DECL) | |
5317 | { | |
5318 | /* Determine whether R has a valid type and can be | |
5319 | completed later. If R is invalid, then it is | |
5320 | replaced by error_mark_node so that it will not be | |
5321 | added to TYPE_FIELDS. */ | |
5322 | tree rtype = TREE_TYPE (r); | |
5323 | if (can_complete_type_without_circularity (rtype)) | |
5324 | complete_type (rtype); | |
5325 | ||
5326 | if (!COMPLETE_TYPE_P (rtype)) | |
5327 | { | |
5328 | cxx_incomplete_type_error (r, rtype); | |
5329 | r = error_mark_node; | |
5330 | } | |
5331 | } | |
5566b478 | 5332 | |
7088fca9 KL |
5333 | /* If it is a TYPE_DECL for a class-scoped ENUMERAL_TYPE, |
5334 | such a thing will already have been added to the field | |
5335 | list by tsubst_enum in finish_member_declaration in the | |
5e0c54e5 | 5336 | CLASSTYPE_NESTED_UTDS case above. */ |
7088fca9 KL |
5337 | if (!(TREE_CODE (r) == TYPE_DECL |
5338 | && TREE_CODE (TREE_TYPE (r)) == ENUMERAL_TYPE | |
43b26a01 | 5339 | && DECL_ARTIFICIAL (r))) |
7088fca9 KL |
5340 | { |
5341 | set_current_access_from_decl (r); | |
5342 | finish_member_declaration (r); | |
5343 | } | |
5344 | } | |
5345 | } | |
61fc8c9e | 5346 | } |
7088fca9 KL |
5347 | else |
5348 | { | |
5349 | if (TYPE_P (t) || DECL_CLASS_TEMPLATE_P (t)) | |
5350 | { | |
5351 | /* Build new CLASSTYPE_FRIEND_CLASSES. */ | |
5352 | ||
5353 | tree friend_type = t; | |
5354 | tree new_friend_type; | |
1aed5355 | 5355 | |
7088fca9 KL |
5356 | if (TREE_CODE (friend_type) == TEMPLATE_DECL) |
5357 | new_friend_type = tsubst_friend_class (friend_type, args); | |
5358 | else if (uses_template_parms (friend_type)) | |
5359 | new_friend_type = tsubst (friend_type, args, | |
5360 | tf_error | tf_warning, NULL_TREE); | |
c4d0910c KL |
5361 | else if (CLASSTYPE_USE_TEMPLATE (friend_type)) |
5362 | new_friend_type = friend_type; | |
7088fca9 KL |
5363 | else |
5364 | { | |
5365 | tree ns = decl_namespace_context (TYPE_MAIN_DECL (friend_type)); | |
5366 | ||
5367 | /* The call to xref_tag_from_type does injection for friend | |
5368 | classes. */ | |
5369 | push_nested_namespace (ns); | |
5370 | new_friend_type = | |
5371 | xref_tag_from_type (friend_type, NULL_TREE, 1); | |
5372 | pop_nested_namespace (ns); | |
5373 | } | |
1aed5355 | 5374 | |
7088fca9 KL |
5375 | if (TREE_CODE (friend_type) == TEMPLATE_DECL) |
5376 | /* Trick make_friend_class into realizing that the friend | |
5377 | we're adding is a template, not an ordinary class. It's | |
5378 | important that we use make_friend_class since it will | |
5379 | perform some error-checking and output cross-reference | |
5380 | information. */ | |
5381 | ++processing_template_decl; | |
fc378698 | 5382 | |
7088fca9 | 5383 | if (new_friend_type != error_mark_node) |
19db77ce KL |
5384 | make_friend_class (type, new_friend_type, |
5385 | /*complain=*/false); | |
fc378698 | 5386 | |
7088fca9 KL |
5387 | if (TREE_CODE (friend_type) == TEMPLATE_DECL) |
5388 | --processing_template_decl; | |
5389 | } | |
5390 | else | |
963142fc | 5391 | /* Build new DECL_FRIENDLIST. */ |
19db77ce KL |
5392 | add_friend (type, tsubst_friend_function (t, args), |
5393 | /*complain=*/false); | |
7088fca9 KL |
5394 | } |
5395 | } | |
5566b478 | 5396 | |
61a127b3 MM |
5397 | /* Set the file and line number information to whatever is given for |
5398 | the class itself. This puts error messages involving generated | |
5399 | implicit functions at a predictable point, and the same point | |
5400 | that would be used for non-template classes. */ | |
7088fca9 | 5401 | typedecl = TYPE_MAIN_DECL (type); |
82a98427 NS |
5402 | input_location = DECL_SOURCE_LOCATION (typedecl); |
5403 | ||
61a127b3 | 5404 | unreverse_member_declarations (type); |
9f33663b | 5405 | finish_struct_1 (type); |
e92cc029 | 5406 | |
5524676d JM |
5407 | /* Clear this now so repo_template_used is happy. */ |
5408 | TYPE_BEING_DEFINED (type) = 0; | |
2604412d | 5409 | repo_template_used (type); |
8d08fdba | 5410 | |
9188c363 MM |
5411 | /* Now that the class is complete, instantiate default arguments for |
5412 | any member functions. We don't do this earlier because the | |
5413 | default arguments may reference members of the class. */ | |
5414 | if (!PRIMARY_TEMPLATE_P (template)) | |
5415 | for (t = TYPE_METHODS (type); t; t = TREE_CHAIN (t)) | |
5416 | if (TREE_CODE (t) == FUNCTION_DECL | |
dc957d14 | 5417 | /* Implicitly generated member functions will not have template |
9188c363 MM |
5418 | information; they are not instantiations, but instead are |
5419 | created "fresh" for each instantiation. */ | |
5420 | && DECL_TEMPLATE_INFO (t)) | |
5421 | tsubst_default_arguments (t); | |
5422 | ||
b74a0560 | 5423 | popclass (); |
5566b478 | 5424 | pop_from_top_level (); |
78757caa | 5425 | pop_deferring_access_checks (); |
5566b478 MS |
5426 | pop_tinst_level (); |
5427 | ||
9aad8f83 MA |
5428 | if (TYPE_CONTAINS_VPTR_P (type)) |
5429 | keyed_classes = tree_cons (NULL_TREE, type, keyed_classes); | |
5430 | ||
5566b478 | 5431 | return type; |
8d08fdba MS |
5432 | } |
5433 | ||
00d3396f | 5434 | static tree |
a91db711 | 5435 | tsubst_template_arg (tree t, tree args, tsubst_flags_t complain, tree in_decl) |
00d3396f | 5436 | { |
a91db711 NS |
5437 | tree r; |
5438 | ||
5439 | if (!t) | |
5440 | r = t; | |
5441 | else if (TYPE_P (t)) | |
5442 | r = tsubst (t, args, complain, in_decl); | |
5443 | else | |
00d3396f | 5444 | { |
a91db711 NS |
5445 | r = tsubst_expr (t, args, complain, in_decl); |
5446 | ||
5447 | if (!uses_template_parms (r)) | |
4d5f3fbd | 5448 | { |
a91db711 NS |
5449 | /* Sometimes, one of the args was an expression involving a |
5450 | template constant parameter, like N - 1. Now that we've | |
5451 | tsubst'd, we might have something like 2 - 1. This will | |
5452 | confuse lookup_template_class, so we do constant folding | |
5453 | here. We have to unset processing_template_decl, to fool | |
5454 | tsubst_copy_and_build() into building an actual tree. */ | |
5455 | ||
5456 | /* If the TREE_TYPE of ARG is not NULL_TREE, ARG is already | |
5457 | as simple as it's going to get, and trying to reprocess | |
5458 | the trees will break. Once tsubst_expr et al DTRT for | |
5459 | non-dependent exprs, this code can go away, as the type | |
5460 | will always be set. */ | |
5461 | if (!TREE_TYPE (r)) | |
5462 | { | |
5463 | int saved_processing_template_decl = processing_template_decl; | |
5464 | processing_template_decl = 0; | |
5465 | r = tsubst_copy_and_build (r, /*args=*/NULL_TREE, | |
5466 | tf_error, /*in_decl=*/NULL_TREE, | |
5467 | /*function_p=*/false); | |
5468 | processing_template_decl = saved_processing_template_decl; | |
5469 | } | |
5470 | r = fold (r); | |
4d5f3fbd | 5471 | } |
bd83b409 | 5472 | } |
a91db711 | 5473 | return r; |
bd83b409 NS |
5474 | } |
5475 | ||
a91db711 | 5476 | /* Substitute ARGS into the vector or list of template arguments T. */ |
830bfa74 | 5477 | |
e9659ab0 | 5478 | static tree |
a91db711 | 5479 | tsubst_template_args (tree t, tree args, tsubst_flags_t complain, tree in_decl) |
830bfa74 | 5480 | { |
bf12d54d | 5481 | int len = TREE_VEC_LENGTH (t); |
a91db711 | 5482 | int need_new = 0, i; |
c68b0a84 | 5483 | tree *elts = alloca (len * sizeof (tree)); |
830bfa74 | 5484 | |
830bfa74 MM |
5485 | for (i = 0; i < len; i++) |
5486 | { | |
bf12d54d NS |
5487 | tree orig_arg = TREE_VEC_ELT (t, i); |
5488 | tree new_arg; | |
a91db711 | 5489 | |
bf12d54d NS |
5490 | if (TREE_CODE (orig_arg) == TREE_VEC) |
5491 | new_arg = tsubst_template_args (orig_arg, args, complain, in_decl); | |
830bfa74 | 5492 | else |
a91db711 | 5493 | new_arg = tsubst_template_arg (orig_arg, args, complain, in_decl); |
830bfa74 | 5494 | |
a91db711 | 5495 | if (new_arg == error_mark_node) |
08e72a19 JM |
5496 | return error_mark_node; |
5497 | ||
a91db711 NS |
5498 | elts[i] = new_arg; |
5499 | if (new_arg != orig_arg) | |
830bfa74 MM |
5500 | need_new = 1; |
5501 | } | |
5502 | ||
5503 | if (!need_new) | |
5504 | return t; | |
a91db711 | 5505 | |
bf12d54d NS |
5506 | t = make_tree_vec (len); |
5507 | for (i = 0; i < len; i++) | |
5508 | TREE_VEC_ELT (t, i) = elts[i]; | |
830bfa74 MM |
5509 | |
5510 | return t; | |
5511 | } | |
5512 | ||
36a117a5 MM |
5513 | /* Return the result of substituting ARGS into the template parameters |
5514 | given by PARMS. If there are m levels of ARGS and m + n levels of | |
5515 | PARMS, then the result will contain n levels of PARMS. For | |
5516 | example, if PARMS is `template <class T> template <class U> | |
5517 | template <T*, U, class V>' and ARGS is {{int}, {double}} then the | |
5518 | result will be `template <int*, double, class V>'. */ | |
5519 | ||
e9659ab0 | 5520 | static tree |
3a978d72 | 5521 | tsubst_template_parms (tree parms, tree args, tsubst_flags_t complain) |
36a117a5 | 5522 | { |
f71f87f9 MM |
5523 | tree r = NULL_TREE; |
5524 | tree* new_parms; | |
36a117a5 MM |
5525 | |
5526 | for (new_parms = &r; | |
5527 | TMPL_PARMS_DEPTH (parms) > TMPL_ARGS_DEPTH (args); | |
5528 | new_parms = &(TREE_CHAIN (*new_parms)), | |
5529 | parms = TREE_CHAIN (parms)) | |
5530 | { | |
5531 | tree new_vec = | |
5532 | make_tree_vec (TREE_VEC_LENGTH (TREE_VALUE (parms))); | |
5533 | int i; | |
5534 | ||
5535 | for (i = 0; i < TREE_VEC_LENGTH (new_vec); ++i) | |
5536 | { | |
833aa4c4 NS |
5537 | tree tuple = TREE_VEC_ELT (TREE_VALUE (parms), i); |
5538 | tree default_value = TREE_PURPOSE (tuple); | |
5539 | tree parm_decl = TREE_VALUE (tuple); | |
5540 | ||
5541 | parm_decl = tsubst (parm_decl, args, complain, NULL_TREE); | |
a91db711 NS |
5542 | default_value = tsubst_template_arg (default_value, args, |
5543 | complain, NULL_TREE); | |
5544 | ||
5545 | tuple = build_tree_list (default_value, parm_decl); | |
833aa4c4 | 5546 | TREE_VEC_ELT (new_vec, i) = tuple; |
36a117a5 MM |
5547 | } |
5548 | ||
5549 | *new_parms = | |
4890c2f4 MM |
5550 | tree_cons (size_int (TMPL_PARMS_DEPTH (parms) |
5551 | - TMPL_ARGS_DEPTH (args)), | |
36a117a5 MM |
5552 | new_vec, NULL_TREE); |
5553 | } | |
5554 | ||
5555 | return r; | |
5556 | } | |
5557 | ||
ed44da02 MM |
5558 | /* Substitute the ARGS into the indicated aggregate (or enumeration) |
5559 | type T. If T is not an aggregate or enumeration type, it is | |
5560 | handled as if by tsubst. IN_DECL is as for tsubst. If | |
838dfd8a | 5561 | ENTERING_SCOPE is nonzero, T is the context for a template which |
dc957d14 | 5562 | we are presently tsubst'ing. Return the substituted value. */ |
36a117a5 | 5563 | |
e9659ab0 | 5564 | static tree |
3a978d72 NN |
5565 | tsubst_aggr_type (tree t, |
5566 | tree args, | |
5567 | tsubst_flags_t complain, | |
5568 | tree in_decl, | |
5569 | int entering_scope) | |
36a117a5 MM |
5570 | { |
5571 | if (t == NULL_TREE) | |
5572 | return NULL_TREE; | |
5573 | ||
5574 | switch (TREE_CODE (t)) | |
5575 | { | |
5576 | case RECORD_TYPE: | |
5577 | if (TYPE_PTRMEMFUNC_P (t)) | |
46c895ac | 5578 | return tsubst (TYPE_PTRMEMFUNC_FN_TYPE (t), args, complain, in_decl); |
36a117a5 MM |
5579 | |
5580 | /* else fall through */ | |
ed44da02 | 5581 | case ENUMERAL_TYPE: |
36a117a5 | 5582 | case UNION_TYPE: |
5db698f6 | 5583 | if (TYPE_TEMPLATE_INFO (t)) |
36a117a5 MM |
5584 | { |
5585 | tree argvec; | |
5586 | tree context; | |
5587 | tree r; | |
5588 | ||
5589 | /* First, determine the context for the type we are looking | |
5590 | up. */ | |
4f7847ca NS |
5591 | context = TYPE_CONTEXT (t); |
5592 | if (context) | |
5593 | context = tsubst_aggr_type (context, args, complain, | |
36a117a5 | 5594 | in_decl, /*entering_scope=*/1); |
36a117a5 MM |
5595 | |
5596 | /* Then, figure out what arguments are appropriate for the | |
5597 | type we are trying to find. For example, given: | |
5598 | ||
5599 | template <class T> struct S; | |
5600 | template <class T, class U> void f(T, U) { S<U> su; } | |
5601 | ||
5602 | and supposing that we are instantiating f<int, double>, | |
5603 | then our ARGS will be {int, double}, but, when looking up | |
5604 | S we only want {double}. */ | |
a91db711 NS |
5605 | argvec = tsubst_template_args (TYPE_TI_ARGS (t), args, |
5606 | complain, in_decl); | |
08e72a19 JM |
5607 | if (argvec == error_mark_node) |
5608 | return error_mark_node; | |
36a117a5 MM |
5609 | |
5610 | r = lookup_template_class (t, argvec, in_decl, context, | |
f9c244b8 | 5611 | entering_scope, complain); |
36a117a5 | 5612 | |
c2ea3a40 | 5613 | return cp_build_qualified_type_real (r, TYPE_QUALS (t), complain); |
36a117a5 MM |
5614 | } |
5615 | else | |
5616 | /* This is not a template type, so there's nothing to do. */ | |
5617 | return t; | |
5618 | ||
5619 | default: | |
4393e105 | 5620 | return tsubst (t, args, complain, in_decl); |
36a117a5 MM |
5621 | } |
5622 | } | |
5623 | ||
9188c363 MM |
5624 | /* Substitute into the default argument ARG (a default argument for |
5625 | FN), which has the indicated TYPE. */ | |
5626 | ||
5627 | tree | |
3a978d72 | 5628 | tsubst_default_argument (tree fn, tree type, tree arg) |
9188c363 MM |
5629 | { |
5630 | /* This default argument came from a template. Instantiate the | |
5631 | default argument here, not in tsubst. In the case of | |
5632 | something like: | |
5633 | ||
5634 | template <class T> | |
5635 | struct S { | |
5636 | static T t(); | |
5637 | void f(T = t()); | |
5638 | }; | |
5639 | ||
5640 | we must be careful to do name lookup in the scope of S<T>, | |
a29e1034 JM |
5641 | rather than in the current class. |
5642 | ||
5643 | ??? current_class_type affects a lot more than name lookup. This is | |
5644 | very fragile. Fortunately, it will go away when we do 2-phase name | |
5645 | binding properly. */ | |
2b59fc25 KL |
5646 | |
5647 | /* FN is already the desired FUNCTION_DECL. */ | |
5648 | push_access_scope (fn); | |
9188c363 | 5649 | |
c2ea3a40 NS |
5650 | arg = tsubst_expr (arg, DECL_TI_ARGS (fn), |
5651 | tf_error | tf_warning, NULL_TREE); | |
9188c363 | 5652 | |
2b59fc25 | 5653 | pop_access_scope (fn); |
9188c363 MM |
5654 | |
5655 | /* Make sure the default argument is reasonable. */ | |
5656 | arg = check_default_argument (type, arg); | |
5657 | ||
5658 | return arg; | |
5659 | } | |
5660 | ||
5661 | /* Substitute into all the default arguments for FN. */ | |
5662 | ||
5663 | static void | |
3a978d72 | 5664 | tsubst_default_arguments (tree fn) |
9188c363 MM |
5665 | { |
5666 | tree arg; | |
5667 | tree tmpl_args; | |
5668 | ||
5669 | tmpl_args = DECL_TI_ARGS (fn); | |
5670 | ||
5671 | /* If this function is not yet instantiated, we certainly don't need | |
5672 | its default arguments. */ | |
5673 | if (uses_template_parms (tmpl_args)) | |
5674 | return; | |
5675 | ||
5676 | for (arg = TYPE_ARG_TYPES (TREE_TYPE (fn)); | |
5677 | arg; | |
5678 | arg = TREE_CHAIN (arg)) | |
5679 | if (TREE_PURPOSE (arg)) | |
5680 | TREE_PURPOSE (arg) = tsubst_default_argument (fn, | |
5681 | TREE_VALUE (arg), | |
5682 | TREE_PURPOSE (arg)); | |
5683 | } | |
5684 | ||
ae58fa02 MM |
5685 | /* Substitute the ARGS into the T, which is a _DECL. TYPE is the |
5686 | (already computed) substitution of ARGS into TREE_TYPE (T), if | |
c2ea3a40 NS |
5687 | appropriate. Return the result of the substitution. Issue error |
5688 | and warning messages under control of COMPLAIN. */ | |
00d3396f | 5689 | |
e9659ab0 | 5690 | static tree |
3a978d72 | 5691 | tsubst_decl (tree t, tree args, tree type, tsubst_flags_t complain) |
8d08fdba | 5692 | { |
82a98427 | 5693 | location_t saved_loc; |
b370501f | 5694 | tree r = NULL_TREE; |
4b2811e9 | 5695 | tree in_decl = t; |
830bfa74 | 5696 | |
ae58fa02 | 5697 | /* Set the filename and linenumber to improve error-reporting. */ |
82a98427 NS |
5698 | saved_loc = input_location; |
5699 | input_location = DECL_SOURCE_LOCATION (t); | |
b7484fbe | 5700 | |
8d08fdba MS |
5701 | switch (TREE_CODE (t)) |
5702 | { | |
98c1c668 JM |
5703 | case TEMPLATE_DECL: |
5704 | { | |
5705 | /* We can get here when processing a member template function | |
5706 | of a template class. */ | |
98c1c668 | 5707 | tree decl = DECL_TEMPLATE_RESULT (t); |
386b8a85 | 5708 | tree spec; |
db2767b6 | 5709 | int is_template_template_parm = DECL_TEMPLATE_TEMPLATE_PARM_P (t); |
98c1c668 | 5710 | |
db2767b6 MM |
5711 | if (!is_template_template_parm) |
5712 | { | |
36a117a5 MM |
5713 | /* We might already have an instance of this template. |
5714 | The ARGS are for the surrounding class type, so the | |
5715 | full args contain the tsubst'd args for the context, | |
5716 | plus the innermost args from the template decl. */ | |
5717 | tree tmpl_args = DECL_CLASS_TEMPLATE_P (t) | |
5718 | ? CLASSTYPE_TI_ARGS (TREE_TYPE (t)) | |
17aec3eb | 5719 | : DECL_TI_ARGS (DECL_TEMPLATE_RESULT (t)); |
7ddedda4 MM |
5720 | tree full_args; |
5721 | ||
a91db711 NS |
5722 | full_args = tsubst_template_args (tmpl_args, args, |
5723 | complain, in_decl); | |
36a117a5 | 5724 | |
a91db711 | 5725 | /* tsubst_template_args doesn't copy the vector if |
36a117a5 MM |
5726 | nothing changed. But, *something* should have |
5727 | changed. */ | |
5728 | my_friendly_assert (full_args != tmpl_args, 0); | |
5729 | ||
5730 | spec = retrieve_specialization (t, full_args); | |
db2767b6 | 5731 | if (spec != NULL_TREE) |
ae58fa02 MM |
5732 | { |
5733 | r = spec; | |
5734 | break; | |
5735 | } | |
db2767b6 | 5736 | } |
98c1c668 JM |
5737 | |
5738 | /* Make a new template decl. It will be similar to the | |
5739 | original, but will record the current template arguments. | |
5740 | We also create a new function declaration, which is just | |
5741 | like the old one, but points to this new template, rather | |
5742 | than the old one. */ | |
0acf7199 | 5743 | r = copy_decl (t); |
ae58fa02 MM |
5744 | my_friendly_assert (DECL_LANG_SPECIFIC (r) != 0, 0); |
5745 | TREE_CHAIN (r) = NULL_TREE; | |
db2767b6 MM |
5746 | |
5747 | if (is_template_template_parm) | |
5748 | { | |
c2ea3a40 | 5749 | tree new_decl = tsubst (decl, args, complain, in_decl); |
17aec3eb | 5750 | DECL_TEMPLATE_RESULT (r) = new_decl; |
ae58fa02 MM |
5751 | TREE_TYPE (r) = TREE_TYPE (new_decl); |
5752 | break; | |
db2767b6 MM |
5753 | } |
5754 | ||
ae58fa02 | 5755 | DECL_CONTEXT (r) |
4f1c5b7d | 5756 | = tsubst_aggr_type (DECL_CONTEXT (t), args, |
c2ea3a40 | 5757 | complain, in_decl, |
4393e105 | 5758 | /*entering_scope=*/1); |
ae58fa02 | 5759 | DECL_TEMPLATE_INFO (r) = build_tree_list (t, args); |
93cdc044 JM |
5760 | |
5761 | if (TREE_CODE (decl) == TYPE_DECL) | |
5762 | { | |
c2ea3a40 | 5763 | tree new_type = tsubst (TREE_TYPE (t), args, complain, in_decl); |
ae58fa02 MM |
5764 | TREE_TYPE (r) = new_type; |
5765 | CLASSTYPE_TI_TEMPLATE (new_type) = r; | |
17aec3eb | 5766 | DECL_TEMPLATE_RESULT (r) = TYPE_MAIN_DECL (new_type); |
ae58fa02 | 5767 | DECL_TI_ARGS (r) = CLASSTYPE_TI_ARGS (new_type); |
93cdc044 JM |
5768 | } |
5769 | else | |
5770 | { | |
c2ea3a40 | 5771 | tree new_decl = tsubst (decl, args, complain, in_decl); |
caec1dc0 KL |
5772 | if (new_decl == error_mark_node) |
5773 | return error_mark_node; | |
17aec3eb RK |
5774 | |
5775 | DECL_TEMPLATE_RESULT (r) = new_decl; | |
ae58fa02 MM |
5776 | DECL_TI_TEMPLATE (new_decl) = r; |
5777 | TREE_TYPE (r) = TREE_TYPE (new_decl); | |
5778 | DECL_TI_ARGS (r) = DECL_TI_ARGS (new_decl); | |
93cdc044 JM |
5779 | } |
5780 | ||
ae58fa02 MM |
5781 | SET_DECL_IMPLICIT_INSTANTIATION (r); |
5782 | DECL_TEMPLATE_INSTANTIATIONS (r) = NULL_TREE; | |
5783 | DECL_TEMPLATE_SPECIALIZATIONS (r) = NULL_TREE; | |
98c1c668 JM |
5784 | |
5785 | /* The template parameters for this new template are all the | |
5786 | template parameters for the old template, except the | |
c6002625 | 5787 | outermost level of parameters. */ |
ae58fa02 | 5788 | DECL_TEMPLATE_PARMS (r) |
4393e105 | 5789 | = tsubst_template_parms (DECL_TEMPLATE_PARMS (t), args, |
c2ea3a40 | 5790 | complain); |
98c1c668 | 5791 | |
93cdc044 | 5792 | if (PRIMARY_TEMPLATE_P (t)) |
ae58fa02 | 5793 | DECL_PRIMARY_TEMPLATE (r) = r; |
93cdc044 | 5794 | |
8c6ab2db NS |
5795 | if (TREE_CODE (decl) != TYPE_DECL) |
5796 | /* Record this non-type partial instantiation. */ | |
5797 | register_specialization (r, t, | |
5798 | DECL_TI_ARGS (DECL_TEMPLATE_RESULT (r))); | |
98c1c668 | 5799 | } |
ae58fa02 | 5800 | break; |
8d08fdba MS |
5801 | |
5802 | case FUNCTION_DECL: | |
5803 | { | |
386b8a85 | 5804 | tree ctx; |
87603ed0 | 5805 | tree argvec = NULL_TREE; |
cf38f48a | 5806 | tree *friends; |
36a117a5 | 5807 | tree gen_tmpl; |
5566b478 | 5808 | int member; |
d8c4447d MM |
5809 | int args_depth; |
5810 | int parms_depth; | |
5566b478 | 5811 | |
36a117a5 MM |
5812 | /* Nobody should be tsubst'ing into non-template functions. */ |
5813 | my_friendly_assert (DECL_TEMPLATE_INFO (t) != NULL_TREE, 0); | |
5814 | ||
5815 | if (TREE_CODE (DECL_TI_TEMPLATE (t)) == TEMPLATE_DECL) | |
5816 | { | |
5817 | tree spec; | |
00cf3e31 MM |
5818 | bool dependent_p; |
5819 | ||
5820 | /* If T is not dependent, just return it. We have to | |
5821 | increment PROCESSING_TEMPLATE_DECL because | |
5822 | value_dependent_expression_p assumes that nothing is | |
5823 | dependent when PROCESSING_TEMPLATE_DECL is zero. */ | |
5824 | ++processing_template_decl; | |
5825 | dependent_p = value_dependent_expression_p (t); | |
5826 | --processing_template_decl; | |
5827 | if (!dependent_p) | |
5828 | return t; | |
36a117a5 MM |
5829 | |
5830 | /* Calculate the most general template of which R is a | |
5831 | specialization, and the complete set of arguments used to | |
5832 | specialize R. */ | |
5833 | gen_tmpl = most_general_template (DECL_TI_TEMPLATE (t)); | |
a91db711 NS |
5834 | argvec = tsubst_template_args (DECL_TI_ARGS |
5835 | (DECL_TEMPLATE_RESULT (gen_tmpl)), | |
5836 | args, complain, in_decl); | |
36a117a5 MM |
5837 | |
5838 | /* Check to see if we already have this specialization. */ | |
5839 | spec = retrieve_specialization (gen_tmpl, argvec); | |
7ddedda4 | 5840 | |
36a117a5 | 5841 | if (spec) |
ae58fa02 MM |
5842 | { |
5843 | r = spec; | |
5844 | break; | |
5845 | } | |
d8c4447d | 5846 | |
f9a7ae04 MM |
5847 | /* We can see more levels of arguments than parameters if |
5848 | there was a specialization of a member template, like | |
5849 | this: | |
5850 | ||
5851 | template <class T> struct S { template <class U> void f(); } | |
5852 | template <> template <class U> void S<int>::f(U); | |
5853 | ||
dc957d14 | 5854 | Here, we'll be substituting into the specialization, |
f9a7ae04 MM |
5855 | because that's where we can find the code we actually |
5856 | want to generate, but we'll have enough arguments for | |
5857 | the most general template. | |
5858 | ||
5859 | We also deal with the peculiar case: | |
d8c4447d MM |
5860 | |
5861 | template <class T> struct S { | |
5862 | template <class U> friend void f(); | |
5863 | }; | |
74b846e0 | 5864 | template <class U> void f() {} |
d8c4447d MM |
5865 | template S<int>; |
5866 | template void f<double>(); | |
5867 | ||
5868 | Here, the ARGS for the instantiation of will be {int, | |
5869 | double}. But, we only need as many ARGS as there are | |
5870 | levels of template parameters in CODE_PATTERN. We are | |
5871 | careful not to get fooled into reducing the ARGS in | |
5872 | situations like: | |
5873 | ||
5874 | template <class T> struct S { template <class U> void f(U); } | |
5875 | template <class T> template <> void S<T>::f(int) {} | |
5876 | ||
5877 | which we can spot because the pattern will be a | |
5878 | specialization in this case. */ | |
5879 | args_depth = TMPL_ARGS_DEPTH (args); | |
5880 | parms_depth = | |
5881 | TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (DECL_TI_TEMPLATE (t))); | |
5882 | if (args_depth > parms_depth | |
5883 | && !DECL_TEMPLATE_SPECIALIZATION (t)) | |
f9a7ae04 | 5884 | args = get_innermost_template_args (args, parms_depth); |
36a117a5 MM |
5885 | } |
5886 | else | |
5887 | { | |
5888 | /* This special case arises when we have something like this: | |
5889 | ||
5890 | template <class T> struct S { | |
5891 | friend void f<int>(int, double); | |
5892 | }; | |
5893 | ||
5894 | Here, the DECL_TI_TEMPLATE for the friend declaration | |
10b1d5e7 MM |
5895 | will be an IDENTIFIER_NODE. We are being called from |
5896 | tsubst_friend_function, and we want only to create a | |
5897 | new decl (R) with appropriate types so that we can call | |
5898 | determine_specialization. */ | |
36a117a5 MM |
5899 | gen_tmpl = NULL_TREE; |
5900 | } | |
5901 | ||
6eb3bb27 | 5902 | if (DECL_CLASS_SCOPE_P (t)) |
8d08fdba | 5903 | { |
5566b478 MS |
5904 | if (DECL_NAME (t) == constructor_name (DECL_CONTEXT (t))) |
5905 | member = 2; | |
5906 | else | |
5907 | member = 1; | |
4f1c5b7d | 5908 | ctx = tsubst_aggr_type (DECL_CONTEXT (t), args, |
8c6ab2db | 5909 | complain, t, /*entering_scope=*/1); |
5566b478 MS |
5910 | } |
5911 | else | |
5912 | { | |
5913 | member = 0; | |
4f1c5b7d | 5914 | ctx = DECL_CONTEXT (t); |
5566b478 | 5915 | } |
c2ea3a40 | 5916 | type = tsubst (type, args, complain, in_decl); |
b3da7bb1 MM |
5917 | if (type == error_mark_node) |
5918 | return error_mark_node; | |
8d08fdba | 5919 | |
5566b478 MS |
5920 | /* We do NOT check for matching decls pushed separately at this |
5921 | point, as they may not represent instantiations of this | |
5922 | template, and in any case are considered separate under the | |
0a7394bc | 5923 | discrete model. */ |
0acf7199 | 5924 | r = copy_decl (t); |
e1467ff2 | 5925 | DECL_USE_TEMPLATE (r) = 0; |
5566b478 | 5926 | TREE_TYPE (r) = type; |
92643fea MM |
5927 | /* Clear out the mangled name and RTL for the instantiation. */ |
5928 | SET_DECL_ASSEMBLER_NAME (r, NULL_TREE); | |
5929 | SET_DECL_RTL (r, NULL_RTX); | |
5566b478 | 5930 | |
4f1c5b7d | 5931 | DECL_CONTEXT (r) = ctx; |
5566b478 | 5932 | |
1f6e1acc | 5933 | if (member && DECL_CONV_FN_P (r)) |
1f84ec23 MM |
5934 | /* Type-conversion operator. Reconstruct the name, in |
5935 | case it's the name of one of the template's parameters. */ | |
5936 | DECL_NAME (r) = mangle_conv_op_name_for_type (TREE_TYPE (type)); | |
5566b478 | 5937 | |
4393e105 | 5938 | DECL_ARGUMENTS (r) = tsubst (DECL_ARGUMENTS (t), args, |
c2ea3a40 | 5939 | complain, t); |
477f6664 | 5940 | DECL_RESULT (r) = NULL_TREE; |
711734a9 JM |
5941 | |
5942 | TREE_STATIC (r) = 0; | |
5943 | TREE_PUBLIC (r) = TREE_PUBLIC (t); | |
5944 | DECL_EXTERNAL (r) = 1; | |
5945 | DECL_INTERFACE_KNOWN (r) = 0; | |
5946 | DECL_DEFER_OUTPUT (r) = 0; | |
5947 | TREE_CHAIN (r) = NULL_TREE; | |
5948 | DECL_PENDING_INLINE_INFO (r) = 0; | |
59026e79 | 5949 | DECL_PENDING_INLINE_P (r) = 0; |
655dc6ee | 5950 | DECL_SAVED_TREE (r) = NULL_TREE; |
711734a9 | 5951 | TREE_USED (r) = 0; |
db9b2174 MM |
5952 | if (DECL_CLONED_FUNCTION (r)) |
5953 | { | |
5954 | DECL_CLONED_FUNCTION (r) = tsubst (DECL_CLONED_FUNCTION (t), | |
c2ea3a40 | 5955 | args, complain, t); |
db9b2174 MM |
5956 | TREE_CHAIN (r) = TREE_CHAIN (DECL_CLONED_FUNCTION (r)); |
5957 | TREE_CHAIN (DECL_CLONED_FUNCTION (r)) = r; | |
5958 | } | |
711734a9 | 5959 | |
92643fea MM |
5960 | /* Set up the DECL_TEMPLATE_INFO for R. There's no need to do |
5961 | this in the special friend case mentioned above where | |
5962 | GEN_TMPL is NULL. */ | |
36a117a5 | 5963 | if (gen_tmpl) |
386b8a85 | 5964 | { |
36a117a5 | 5965 | DECL_TEMPLATE_INFO (r) |
e1b3e07d | 5966 | = tree_cons (gen_tmpl, argvec, NULL_TREE); |
36a117a5 MM |
5967 | SET_DECL_IMPLICIT_INSTANTIATION (r); |
5968 | register_specialization (r, gen_tmpl, argvec); | |
5969 | ||
9188c363 MM |
5970 | /* We're not supposed to instantiate default arguments |
5971 | until they are called, for a template. But, for a | |
5972 | declaration like: | |
5973 | ||
5974 | template <class T> void f () | |
5975 | { extern void g(int i = T()); } | |
5976 | ||
5977 | we should do the substitution when the template is | |
5978 | instantiated. We handle the member function case in | |
5979 | instantiate_class_template since the default arguments | |
5980 | might refer to other members of the class. */ | |
5981 | if (!member | |
5982 | && !PRIMARY_TEMPLATE_P (gen_tmpl) | |
5983 | && !uses_template_parms (argvec)) | |
5984 | tsubst_default_arguments (r); | |
386b8a85 | 5985 | } |
f181d4ae | 5986 | |
cf38f48a MM |
5987 | /* Copy the list of befriending classes. */ |
5988 | for (friends = &DECL_BEFRIENDING_CLASSES (r); | |
5989 | *friends; | |
5990 | friends = &TREE_CHAIN (*friends)) | |
5991 | { | |
5992 | *friends = copy_node (*friends); | |
5993 | TREE_VALUE (*friends) = tsubst (TREE_VALUE (*friends), | |
c2ea3a40 | 5994 | args, complain, |
cf38f48a MM |
5995 | in_decl); |
5996 | } | |
5997 | ||
212e7048 | 5998 | if (DECL_CONSTRUCTOR_P (r) || DECL_DESTRUCTOR_P (r)) |
f181d4ae MM |
5999 | { |
6000 | maybe_retrofit_in_chrg (r); | |
212e7048 MM |
6001 | if (DECL_CONSTRUCTOR_P (r)) |
6002 | grok_ctor_properties (ctx, r); | |
2be678ff JM |
6003 | /* If this is an instantiation of a member template, clone it. |
6004 | If it isn't, that'll be handled by | |
6005 | clone_constructors_and_destructors. */ | |
5e818b93 | 6006 | if (PRIMARY_TEMPLATE_P (gen_tmpl)) |
271e6f02 | 6007 | clone_function_decl (r, /*update_method_vec_p=*/0); |
f181d4ae | 6008 | } |
596ea4e5 | 6009 | else if (IDENTIFIER_OPNAME_P (DECL_NAME (r))) |
4b0d3cbe MM |
6010 | grok_op_properties (r, DECL_FRIEND_P (r), |
6011 | (complain & tf_error) != 0); | |
8d08fdba | 6012 | } |
ae58fa02 | 6013 | break; |
8d08fdba MS |
6014 | |
6015 | case PARM_DECL: | |
6016 | { | |
ae58fa02 | 6017 | r = copy_node (t); |
833aa4c4 NS |
6018 | if (DECL_TEMPLATE_PARM_P (t)) |
6019 | SET_DECL_TEMPLATE_PARM_P (r); | |
8e51619a | 6020 | |
5566b478 | 6021 | TREE_TYPE (r) = type; |
89d684bb | 6022 | c_apply_type_quals_to_decl (cp_type_quals (type), r); |
1b8899d1 | 6023 | |
560ad596 MM |
6024 | if (DECL_INITIAL (r)) |
6025 | { | |
6026 | if (TREE_CODE (DECL_INITIAL (r)) != TEMPLATE_PARM_INDEX) | |
6027 | DECL_INITIAL (r) = TREE_TYPE (r); | |
6028 | else | |
6029 | DECL_INITIAL (r) = tsubst (DECL_INITIAL (r), args, | |
6030 | complain, in_decl); | |
6031 | } | |
db2767b6 | 6032 | |
5566b478 | 6033 | DECL_CONTEXT (r) = NULL_TREE; |
8e51619a JM |
6034 | |
6035 | if (!DECL_TEMPLATE_PARM_P (r)) | |
6036 | DECL_ARG_TYPE (r) = type_passed_as (type); | |
8d08fdba | 6037 | if (TREE_CHAIN (t)) |
4393e105 | 6038 | TREE_CHAIN (r) = tsubst (TREE_CHAIN (t), args, |
c2ea3a40 | 6039 | complain, TREE_CHAIN (t)); |
8d08fdba | 6040 | } |
ae58fa02 | 6041 | break; |
8d08fdba | 6042 | |
5566b478 MS |
6043 | case FIELD_DECL: |
6044 | { | |
0acf7199 | 6045 | r = copy_decl (t); |
1b8899d1 | 6046 | TREE_TYPE (r) = type; |
89d684bb | 6047 | c_apply_type_quals_to_decl (cp_type_quals (type), r); |
1b8899d1 MM |
6048 | |
6049 | /* We don't have to set DECL_CONTEXT here; it is set by | |
6050 | finish_member_declaration. */ | |
4393e105 | 6051 | DECL_INITIAL (r) = tsubst_expr (DECL_INITIAL (t), args, |
c2ea3a40 | 6052 | complain, in_decl); |
5566b478 | 6053 | TREE_CHAIN (r) = NULL_TREE; |
dfbb4f34 NS |
6054 | if (VOID_TYPE_P (type)) |
6055 | cp_error_at ("instantiation of `%D' as type `%T'", r, type); | |
5566b478 | 6056 | } |
ae58fa02 | 6057 | break; |
5566b478 MS |
6058 | |
6059 | case USING_DECL: | |
6060 | { | |
ae58fa02 | 6061 | r = copy_node (t); |
fd9aef9d NS |
6062 | /* It is not a dependent using decl any more. */ |
6063 | TREE_TYPE (r) = void_type_node; | |
5566b478 | 6064 | DECL_INITIAL (r) |
c2ea3a40 | 6065 | = tsubst_copy (DECL_INITIAL (t), args, complain, in_decl); |
5566b478 | 6066 | TREE_CHAIN (r) = NULL_TREE; |
5566b478 | 6067 | } |
ae58fa02 | 6068 | break; |
5566b478 | 6069 | |
9188c363 | 6070 | case TYPE_DECL: |
88e1b92a JM |
6071 | if (TREE_CODE (type) == TEMPLATE_TEMPLATE_PARM |
6072 | || t == TYPE_MAIN_DECL (TREE_TYPE (t))) | |
9188c363 | 6073 | { |
88e1b92a JM |
6074 | /* If this is the canonical decl, we don't have to mess with |
6075 | instantiations, and often we can't (for typename, template | |
6076 | type parms and such). Note that TYPE_NAME is not correct for | |
6077 | the above test if we've copied the type for a typedef. */ | |
b9f39201 | 6078 | r = TYPE_NAME (type); |
9188c363 MM |
6079 | break; |
6080 | } | |
6081 | ||
6082 | /* Fall through. */ | |
6083 | ||
5566b478 MS |
6084 | case VAR_DECL: |
6085 | { | |
1cea0434 KG |
6086 | tree argvec = NULL_TREE; |
6087 | tree gen_tmpl = NULL_TREE; | |
36a117a5 | 6088 | tree spec; |
1cea0434 | 6089 | tree tmpl = NULL_TREE; |
9188c363 | 6090 | tree ctx; |
6dfbb909 | 6091 | int local_p; |
9188c363 | 6092 | |
6dfbb909 MM |
6093 | /* Assume this is a non-local variable. */ |
6094 | local_p = 0; | |
5566b478 | 6095 | |
de96bf57 | 6096 | if (TYPE_P (CP_DECL_CONTEXT (t))) |
9188c363 | 6097 | ctx = tsubst_aggr_type (DECL_CONTEXT (t), args, |
c2ea3a40 | 6098 | complain, |
9188c363 | 6099 | in_decl, /*entering_scope=*/1); |
2ba9c47e MM |
6100 | else if (DECL_NAMESPACE_SCOPE_P (t)) |
6101 | ctx = DECL_CONTEXT (t); | |
9188c363 | 6102 | else |
6dfbb909 MM |
6103 | { |
6104 | /* Subsequent calls to pushdecl will fill this in. */ | |
6105 | ctx = NULL_TREE; | |
2ba9c47e | 6106 | local_p = 1; |
6dfbb909 | 6107 | } |
9188c363 | 6108 | |
36a117a5 | 6109 | /* Check to see if we already have this specialization. */ |
6dfbb909 MM |
6110 | if (!local_p) |
6111 | { | |
6112 | tmpl = DECL_TI_TEMPLATE (t); | |
6113 | gen_tmpl = most_general_template (tmpl); | |
c2ea3a40 | 6114 | argvec = tsubst (DECL_TI_ARGS (t), args, complain, in_decl); |
6dfbb909 MM |
6115 | spec = retrieve_specialization (gen_tmpl, argvec); |
6116 | } | |
9188c363 | 6117 | else |
6dfbb909 | 6118 | spec = retrieve_local_specialization (t); |
9188c363 | 6119 | |
36a117a5 | 6120 | if (spec) |
ae58fa02 MM |
6121 | { |
6122 | r = spec; | |
6123 | break; | |
6124 | } | |
5566b478 | 6125 | |
0acf7199 | 6126 | r = copy_decl (t); |
edebf865 | 6127 | if (TREE_CODE (r) == VAR_DECL) |
39703eb9 MM |
6128 | { |
6129 | type = complete_type (type); | |
6130 | DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (r) | |
6131 | = DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (t); | |
6132 | } | |
a3d87771 MM |
6133 | else if (DECL_SELF_REFERENCE_P (t)) |
6134 | SET_DECL_SELF_REFERENCE_P (r); | |
01f4137f | 6135 | TREE_TYPE (r) = type; |
89d684bb | 6136 | c_apply_type_quals_to_decl (cp_type_quals (type), r); |
5566b478 | 6137 | DECL_CONTEXT (r) = ctx; |
92643fea MM |
6138 | /* Clear out the mangled name and RTL for the instantiation. */ |
6139 | SET_DECL_ASSEMBLER_NAME (r, NULL_TREE); | |
6140 | SET_DECL_RTL (r, NULL_RTX); | |
d11ad92e MS |
6141 | |
6142 | /* Don't try to expand the initializer until someone tries to use | |
6143 | this variable; otherwise we run into circular dependencies. */ | |
6144 | DECL_INITIAL (r) = NULL_TREE; | |
19e7881c | 6145 | SET_DECL_RTL (r, NULL_RTX); |
06ceef4e | 6146 | DECL_SIZE (r) = DECL_SIZE_UNIT (r) = 0; |
5566b478 | 6147 | |
e0942dcd MM |
6148 | /* Even if the original location is out of scope, the newly |
6149 | substituted one is not. */ | |
6150 | if (TREE_CODE (r) == VAR_DECL) | |
17bbb839 MM |
6151 | { |
6152 | DECL_DEAD_FOR_LOCAL (r) = 0; | |
6153 | DECL_INITIALIZED_P (r) = 0; | |
6154 | } | |
e0942dcd | 6155 | |
6dfbb909 MM |
6156 | if (!local_p) |
6157 | { | |
6158 | /* A static data member declaration is always marked | |
6159 | external when it is declared in-class, even if an | |
6160 | initializer is present. We mimic the non-template | |
6161 | processing here. */ | |
6162 | DECL_EXTERNAL (r) = 1; | |
fa8d6e85 | 6163 | |
6dfbb909 MM |
6164 | register_specialization (r, gen_tmpl, argvec); |
6165 | DECL_TEMPLATE_INFO (r) = tree_cons (tmpl, argvec, NULL_TREE); | |
6166 | SET_DECL_IMPLICIT_INSTANTIATION (r); | |
6167 | } | |
9188c363 | 6168 | else |
6dfbb909 | 6169 | register_local_specialization (r, t); |
5566b478 | 6170 | |
5566b478 | 6171 | TREE_CHAIN (r) = NULL_TREE; |
dfbb4f34 NS |
6172 | if (TREE_CODE (r) == VAR_DECL && VOID_TYPE_P (type)) |
6173 | cp_error_at ("instantiation of `%D' as type `%T'", r, type); | |
edebf865 MM |
6174 | /* Compute the size, alignment, etc. of R. */ |
6175 | layout_decl (r, 0); | |
5566b478 | 6176 | } |
ae58fa02 | 6177 | break; |
5566b478 | 6178 | |
ae58fa02 | 6179 | default: |
a98facb0 | 6180 | abort (); |
ae58fa02 MM |
6181 | } |
6182 | ||
6183 | /* Restore the file and line information. */ | |
82a98427 | 6184 | input_location = saved_loc; |
ae58fa02 MM |
6185 | |
6186 | return r; | |
6187 | } | |
6188 | ||
34cd5ae7 | 6189 | /* Substitute into the ARG_TYPES of a function type. */ |
cabc336a | 6190 | |
e9659ab0 | 6191 | static tree |
3a978d72 NN |
6192 | tsubst_arg_types (tree arg_types, |
6193 | tree args, | |
6194 | tsubst_flags_t complain, | |
6195 | tree in_decl) | |
cabc336a MM |
6196 | { |
6197 | tree remaining_arg_types; | |
cabc336a MM |
6198 | tree type; |
6199 | ||
6200 | if (!arg_types || arg_types == void_list_node) | |
6201 | return arg_types; | |
6202 | ||
6203 | remaining_arg_types = tsubst_arg_types (TREE_CHAIN (arg_types), | |
4393e105 MM |
6204 | args, complain, in_decl); |
6205 | if (remaining_arg_types == error_mark_node) | |
6206 | return error_mark_node; | |
6207 | ||
6208 | type = tsubst (TREE_VALUE (arg_types), args, complain, in_decl); | |
6209 | if (type == error_mark_node) | |
6210 | return error_mark_node; | |
4b2811e9 NS |
6211 | if (VOID_TYPE_P (type)) |
6212 | { | |
c2ea3a40 | 6213 | if (complain & tf_error) |
4b2811e9 | 6214 | { |
33bd39a2 | 6215 | error ("invalid parameter type `%T'", type); |
4b2811e9 NS |
6216 | if (in_decl) |
6217 | cp_error_at ("in declaration `%D'", in_decl); | |
6218 | } | |
6219 | return error_mark_node; | |
6220 | } | |
cabc336a | 6221 | |
4393e105 MM |
6222 | /* Do array-to-pointer, function-to-pointer conversion, and ignore |
6223 | top-level qualifiers as required. */ | |
6224 | type = TYPE_MAIN_VARIANT (type_decays_to (type)); | |
cabc336a MM |
6225 | |
6226 | /* Note that we do not substitute into default arguments here. The | |
6227 | standard mandates that they be instantiated only when needed, | |
6228 | which is done in build_over_call. */ | |
51632249 JM |
6229 | return hash_tree_cons (TREE_PURPOSE (arg_types), type, |
6230 | remaining_arg_types); | |
cabc336a MM |
6231 | |
6232 | } | |
6233 | ||
4393e105 MM |
6234 | /* Substitute into a FUNCTION_TYPE or METHOD_TYPE. This routine does |
6235 | *not* handle the exception-specification for FNTYPE, because the | |
6236 | initial substitution of explicitly provided template parameters | |
6237 | during argument deduction forbids substitution into the | |
6238 | exception-specification: | |
6239 | ||
6240 | [temp.deduct] | |
6241 | ||
6242 | All references in the function type of the function template to the | |
6243 | corresponding template parameters are replaced by the specified tem- | |
6244 | plate argument values. If a substitution in a template parameter or | |
6245 | in the function type of the function template results in an invalid | |
6246 | type, type deduction fails. [Note: The equivalent substitution in | |
6247 | exception specifications is done only when the function is instanti- | |
6248 | ated, at which point a program is ill-formed if the substitution | |
6249 | results in an invalid type.] */ | |
6250 | ||
6251 | static tree | |
3a978d72 NN |
6252 | tsubst_function_type (tree t, |
6253 | tree args, | |
6254 | tsubst_flags_t complain, | |
6255 | tree in_decl) | |
4393e105 MM |
6256 | { |
6257 | tree return_type; | |
6258 | tree arg_types; | |
6259 | tree fntype; | |
6260 | ||
8dd3f57a | 6261 | /* The TYPE_CONTEXT is not used for function/method types. */ |
4393e105 MM |
6262 | my_friendly_assert (TYPE_CONTEXT (t) == NULL_TREE, 0); |
6263 | ||
46c895ac | 6264 | /* Substitute the return type. */ |
4393e105 MM |
6265 | return_type = tsubst (TREE_TYPE (t), args, complain, in_decl); |
6266 | if (return_type == error_mark_node) | |
6267 | return error_mark_node; | |
6268 | ||
34cd5ae7 | 6269 | /* Substitute the argument types. */ |
4393e105 MM |
6270 | arg_types = tsubst_arg_types (TYPE_ARG_TYPES (t), args, |
6271 | complain, in_decl); | |
6272 | if (arg_types == error_mark_node) | |
6273 | return error_mark_node; | |
6274 | ||
6275 | /* Construct a new type node and return it. */ | |
6276 | if (TREE_CODE (t) == FUNCTION_TYPE) | |
6277 | fntype = build_function_type (return_type, arg_types); | |
6278 | else | |
6279 | { | |
6280 | tree r = TREE_TYPE (TREE_VALUE (arg_types)); | |
6281 | if (! IS_AGGR_TYPE (r)) | |
6282 | { | |
6283 | /* [temp.deduct] | |
6284 | ||
6285 | Type deduction may fail for any of the following | |
6286 | reasons: | |
6287 | ||
6288 | -- Attempting to create "pointer to member of T" when T | |
6289 | is not a class type. */ | |
c2ea3a40 | 6290 | if (complain & tf_error) |
33bd39a2 | 6291 | error ("creating pointer to member function of non-class type `%T'", |
4393e105 MM |
6292 | r); |
6293 | return error_mark_node; | |
6294 | } | |
6295 | ||
43dc123f MM |
6296 | fntype = build_method_type_directly (r, return_type, |
6297 | TREE_CHAIN (arg_types)); | |
4393e105 | 6298 | } |
c2ea3a40 | 6299 | fntype = cp_build_qualified_type_real (fntype, TYPE_QUALS (t), complain); |
ada846eb | 6300 | fntype = build_type_attribute_variant (fntype, TYPE_ATTRIBUTES (t)); |
4393e105 MM |
6301 | |
6302 | return fntype; | |
6303 | } | |
6304 | ||
297e73d8 MM |
6305 | /* Substitute into the PARMS of a call-declarator. */ |
6306 | ||
e9659ab0 | 6307 | static tree |
3a978d72 NN |
6308 | tsubst_call_declarator_parms (tree parms, |
6309 | tree args, | |
6310 | tsubst_flags_t complain, | |
6311 | tree in_decl) | |
297e73d8 MM |
6312 | { |
6313 | tree new_parms; | |
6314 | tree type; | |
6315 | tree defarg; | |
6316 | ||
6317 | if (!parms || parms == void_list_node) | |
6318 | return parms; | |
6319 | ||
6320 | new_parms = tsubst_call_declarator_parms (TREE_CHAIN (parms), | |
4393e105 | 6321 | args, complain, in_decl); |
297e73d8 MM |
6322 | |
6323 | /* Figure out the type of this parameter. */ | |
4393e105 | 6324 | type = tsubst (TREE_VALUE (parms), args, complain, in_decl); |
297e73d8 MM |
6325 | |
6326 | /* Figure out the default argument as well. Note that we use | |
4393e105 MM |
6327 | tsubst_expr since the default argument is really an expression. */ |
6328 | defarg = tsubst_expr (TREE_PURPOSE (parms), args, complain, in_decl); | |
297e73d8 MM |
6329 | |
6330 | /* Chain this parameter on to the front of those we have already | |
6331 | processed. We don't use hash_tree_cons because that function | |
6332 | doesn't check TREE_PARMLIST. */ | |
6333 | new_parms = tree_cons (defarg, type, new_parms); | |
6334 | ||
6335 | /* And note that these are parameters. */ | |
6336 | TREE_PARMLIST (new_parms) = 1; | |
6337 | ||
6338 | return new_parms; | |
6339 | } | |
6340 | ||
4393e105 MM |
6341 | /* Take the tree structure T and replace template parameters used |
6342 | therein with the argument vector ARGS. IN_DECL is an associated | |
6343 | decl for diagnostics. If an error occurs, returns ERROR_MARK_NODE. | |
c2ea3a40 NS |
6344 | Issue error and warning messages under control of COMPLAIN. Note |
6345 | that we must be relatively non-tolerant of extensions here, in | |
6346 | order to preserve conformance; if we allow substitutions that | |
6347 | should not be allowed, we may allow argument deductions that should | |
6348 | not succeed, and therefore report ambiguous overload situations | |
6349 | where there are none. In theory, we could allow the substitution, | |
6350 | but indicate that it should have failed, and allow our caller to | |
6351 | make sure that the right thing happens, but we don't try to do this | |
6352 | yet. | |
4393e105 MM |
6353 | |
6354 | This function is used for dealing with types, decls and the like; | |
6355 | for expressions, use tsubst_expr or tsubst_copy. */ | |
ae58fa02 | 6356 | |
14d22dd6 | 6357 | static tree |
3a978d72 | 6358 | tsubst (tree t, tree args, tsubst_flags_t complain, tree in_decl) |
ae58fa02 | 6359 | { |
0ecfe0b4 | 6360 | tree type, r; |
ae58fa02 MM |
6361 | |
6362 | if (t == NULL_TREE || t == error_mark_node | |
6363 | || t == integer_type_node | |
6364 | || t == void_type_node | |
6365 | || t == char_type_node | |
6366 | || TREE_CODE (t) == NAMESPACE_DECL) | |
6367 | return t; | |
6368 | ||
6369 | if (TREE_CODE (t) == IDENTIFIER_NODE) | |
6370 | type = IDENTIFIER_TYPE_VALUE (t); | |
6371 | else | |
6372 | type = TREE_TYPE (t); | |
399dedb9 | 6373 | |
fd9aef9d | 6374 | my_friendly_assert (type != unknown_type_node, 20030716); |
ae58fa02 MM |
6375 | |
6376 | if (type && TREE_CODE (t) != FUNCTION_DECL | |
6377 | && TREE_CODE (t) != TYPENAME_TYPE | |
6378 | && TREE_CODE (t) != TEMPLATE_DECL | |
4393e105 MM |
6379 | && TREE_CODE (t) != IDENTIFIER_NODE |
6380 | && TREE_CODE (t) != FUNCTION_TYPE | |
6381 | && TREE_CODE (t) != METHOD_TYPE) | |
6382 | type = tsubst (type, args, complain, in_decl); | |
6383 | if (type == error_mark_node) | |
6384 | return error_mark_node; | |
ae58fa02 | 6385 | |
2f939d94 | 6386 | if (DECL_P (t)) |
c2ea3a40 | 6387 | return tsubst_decl (t, args, type, complain); |
ae58fa02 MM |
6388 | |
6389 | switch (TREE_CODE (t)) | |
6390 | { | |
6391 | case RECORD_TYPE: | |
6392 | case UNION_TYPE: | |
6393 | case ENUMERAL_TYPE: | |
4393e105 MM |
6394 | return tsubst_aggr_type (t, args, complain, in_decl, |
6395 | /*entering_scope=*/0); | |
ae58fa02 MM |
6396 | |
6397 | case ERROR_MARK: | |
6398 | case IDENTIFIER_NODE: | |
ae58fa02 MM |
6399 | case VOID_TYPE: |
6400 | case REAL_TYPE: | |
6401 | case COMPLEX_TYPE: | |
c00996a3 | 6402 | case VECTOR_TYPE: |
ae58fa02 MM |
6403 | case BOOLEAN_TYPE: |
6404 | case INTEGER_CST: | |
6405 | case REAL_CST: | |
6406 | case STRING_CST: | |
6407 | return t; | |
6408 | ||
6409 | case INTEGER_TYPE: | |
6410 | if (t == integer_type_node) | |
6411 | return t; | |
6412 | ||
6413 | if (TREE_CODE (TYPE_MIN_VALUE (t)) == INTEGER_CST | |
6414 | && TREE_CODE (TYPE_MAX_VALUE (t)) == INTEGER_CST) | |
6415 | return t; | |
d2e5ee5c | 6416 | |
5566b478 | 6417 | { |
ddce3528 | 6418 | tree max, omax = TREE_OPERAND (TYPE_MAX_VALUE (t), 0); |
7ddedda4 | 6419 | |
a91db711 NS |
6420 | /* The array dimension behaves like a non-type template arg, |
6421 | in that we want to fold it as much as possible. */ | |
6422 | max = tsubst_template_arg (omax, args, complain, in_decl); | |
fc611ce0 | 6423 | if (!processing_template_decl) |
8dd3f57a MM |
6424 | max = decl_constant_value (max); |
6425 | ||
856216bb MM |
6426 | if (processing_template_decl |
6427 | /* When providing explicit arguments to a template | |
6428 | function, but leaving some arguments for subsequent | |
6429 | deduction, MAX may be template-dependent even if we're | |
c95cd22e JM |
6430 | not PROCESSING_TEMPLATE_DECL. We still need to check for |
6431 | template parms, though; MAX won't be an INTEGER_CST for | |
6432 | dynamic arrays, either. */ | |
6433 | || (TREE_CODE (max) != INTEGER_CST | |
6434 | && uses_template_parms (max))) | |
ae58fa02 | 6435 | { |
8dd3f57a MM |
6436 | tree itype = make_node (INTEGER_TYPE); |
6437 | TYPE_MIN_VALUE (itype) = size_zero_node; | |
6438 | TYPE_MAX_VALUE (itype) = build_min (MINUS_EXPR, sizetype, max, | |
6439 | integer_one_node); | |
6440 | return itype; | |
ae58fa02 MM |
6441 | } |
6442 | ||
ddce3528 JM |
6443 | if (integer_zerop (omax)) |
6444 | { | |
6445 | /* Still allow an explicit array of size zero. */ | |
6446 | if (pedantic) | |
6447 | pedwarn ("creating array with size zero"); | |
6448 | } | |
07c88314 MM |
6449 | else if (integer_zerop (max) |
6450 | || (TREE_CODE (max) == INTEGER_CST | |
6451 | && INT_CST_LT (max, integer_zero_node))) | |
0ecfe0b4 | 6452 | { |
4393e105 MM |
6453 | /* [temp.deduct] |
6454 | ||
6455 | Type deduction may fail for any of the following | |
6456 | reasons: | |
6457 | ||
bf8f3f93 MM |
6458 | Attempting to create an array with a size that is |
6459 | zero or negative. */ | |
c2ea3a40 | 6460 | if (complain & tf_error) |
33bd39a2 | 6461 | error ("creating array with size zero (`%E')", max); |
4393e105 MM |
6462 | |
6463 | return error_mark_node; | |
0ecfe0b4 JM |
6464 | } |
6465 | ||
c95cd22e | 6466 | return compute_array_index_type (NULL_TREE, max); |
ae58fa02 MM |
6467 | } |
6468 | ||
6469 | case TEMPLATE_TYPE_PARM: | |
6470 | case TEMPLATE_TEMPLATE_PARM: | |
a1281f45 | 6471 | case BOUND_TEMPLATE_TEMPLATE_PARM: |
ae58fa02 MM |
6472 | case TEMPLATE_PARM_INDEX: |
6473 | { | |
6474 | int idx; | |
6475 | int level; | |
6476 | int levels; | |
0ecfe0b4 JM |
6477 | |
6478 | r = NULL_TREE; | |
ae58fa02 MM |
6479 | |
6480 | if (TREE_CODE (t) == TEMPLATE_TYPE_PARM | |
a1281f45 KL |
6481 | || TREE_CODE (t) == TEMPLATE_TEMPLATE_PARM |
6482 | || TREE_CODE (t) == BOUND_TEMPLATE_TEMPLATE_PARM) | |
ae58fa02 MM |
6483 | { |
6484 | idx = TEMPLATE_TYPE_IDX (t); | |
6485 | level = TEMPLATE_TYPE_LEVEL (t); | |
6486 | } | |
6487 | else | |
6488 | { | |
6489 | idx = TEMPLATE_PARM_IDX (t); | |
6490 | level = TEMPLATE_PARM_LEVEL (t); | |
6491 | } | |
6492 | ||
6493 | if (TREE_VEC_LENGTH (args) > 0) | |
6494 | { | |
6495 | tree arg = NULL_TREE; | |
6496 | ||
6497 | levels = TMPL_ARGS_DEPTH (args); | |
6498 | if (level <= levels) | |
6499 | arg = TMPL_ARG (args, level, idx); | |
6500 | ||
8b5b8b7c MM |
6501 | if (arg == error_mark_node) |
6502 | return error_mark_node; | |
6503 | else if (arg != NULL_TREE) | |
ae58fa02 MM |
6504 | { |
6505 | if (TREE_CODE (t) == TEMPLATE_TYPE_PARM) | |
6506 | { | |
2f939d94 | 6507 | my_friendly_assert (TYPE_P (arg), 0); |
adecb3f4 | 6508 | return cp_build_qualified_type_real |
89d684bb | 6509 | (arg, cp_type_quals (arg) | cp_type_quals (t), |
4f2b0fb2 | 6510 | complain | tf_ignore_bad_quals); |
ae58fa02 | 6511 | } |
a1281f45 | 6512 | else if (TREE_CODE (t) == BOUND_TEMPLATE_TEMPLATE_PARM) |
ae58fa02 | 6513 | { |
a1281f45 KL |
6514 | /* We are processing a type constructed from |
6515 | a template template parameter */ | |
6516 | tree argvec = tsubst (TYPE_TI_ARGS (t), | |
6517 | args, complain, in_decl); | |
6518 | if (argvec == error_mark_node) | |
6519 | return error_mark_node; | |
4393e105 | 6520 | |
a1281f45 KL |
6521 | /* We can get a TEMPLATE_TEMPLATE_PARM here when |
6522 | we are resolving nested-types in the signature of | |
6523 | a member function templates. | |
6524 | Otherwise ARG is a TEMPLATE_DECL and is the real | |
6525 | template to be instantiated. */ | |
6526 | if (TREE_CODE (arg) == TEMPLATE_TEMPLATE_PARM) | |
6527 | arg = TYPE_NAME (arg); | |
6528 | ||
6529 | r = lookup_template_class (arg, | |
6530 | argvec, in_decl, | |
6531 | DECL_CONTEXT (arg), | |
f9c244b8 NS |
6532 | /*entering_scope=*/0, |
6533 | complain); | |
c2ea3a40 NS |
6534 | return cp_build_qualified_type_real |
6535 | (r, TYPE_QUALS (t), complain); | |
ae58fa02 MM |
6536 | } |
6537 | else | |
a1281f45 | 6538 | /* TEMPLATE_TEMPLATE_PARM or TEMPLATE_PARM_INDEX. */ |
ae58fa02 MM |
6539 | return arg; |
6540 | } | |
6541 | } | |
51924768 | 6542 | else |
a98facb0 | 6543 | abort (); |
ae58fa02 MM |
6544 | |
6545 | if (level == 1) | |
6546 | /* This can happen during the attempted tsubst'ing in | |
6547 | unify. This means that we don't yet have any information | |
6548 | about the template parameter in question. */ | |
6549 | return t; | |
6550 | ||
6551 | /* If we get here, we must have been looking at a parm for a | |
6552 | more deeply nested template. Make a new version of this | |
6553 | template parameter, but with a lower level. */ | |
6554 | switch (TREE_CODE (t)) | |
6555 | { | |
6556 | case TEMPLATE_TYPE_PARM: | |
6557 | case TEMPLATE_TEMPLATE_PARM: | |
a1281f45 | 6558 | case BOUND_TEMPLATE_TEMPLATE_PARM: |
89d684bb | 6559 | if (cp_type_quals (t)) |
ae58fa02 | 6560 | { |
9ccf6541 | 6561 | r = tsubst (TYPE_MAIN_VARIANT (t), args, complain, in_decl); |
4f2b0fb2 NS |
6562 | r = cp_build_qualified_type_real |
6563 | (r, cp_type_quals (t), | |
6564 | complain | (TREE_CODE (t) == TEMPLATE_TYPE_PARM | |
6565 | ? tf_ignore_bad_quals : 0)); | |
9ccf6541 MM |
6566 | } |
6567 | else | |
6568 | { | |
11e74ea6 | 6569 | r = copy_type (t); |
9ccf6541 MM |
6570 | TEMPLATE_TYPE_PARM_INDEX (r) |
6571 | = reduce_template_parm_level (TEMPLATE_TYPE_PARM_INDEX (t), | |
6572 | r, levels); | |
6573 | TYPE_STUB_DECL (r) = TYPE_NAME (r) = TEMPLATE_TYPE_DECL (r); | |
6574 | TYPE_MAIN_VARIANT (r) = r; | |
6575 | TYPE_POINTER_TO (r) = NULL_TREE; | |
6576 | TYPE_REFERENCE_TO (r) = NULL_TREE; | |
6577 | ||
a1281f45 | 6578 | if (TREE_CODE (t) == BOUND_TEMPLATE_TEMPLATE_PARM) |
9ccf6541 MM |
6579 | { |
6580 | tree argvec = tsubst (TYPE_TI_ARGS (t), args, | |
6581 | complain, in_decl); | |
6582 | if (argvec == error_mark_node) | |
6583 | return error_mark_node; | |
4393e105 | 6584 | |
9ccf6541 MM |
6585 | TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (r) |
6586 | = tree_cons (TYPE_TI_TEMPLATE (t), argvec, NULL_TREE); | |
6587 | } | |
ae58fa02 MM |
6588 | } |
6589 | break; | |
6590 | ||
6591 | case TEMPLATE_PARM_INDEX: | |
6592 | r = reduce_template_parm_level (t, type, levels); | |
6593 | break; | |
6594 | ||
6595 | default: | |
a98facb0 | 6596 | abort (); |
ae58fa02 MM |
6597 | } |
6598 | ||
5566b478 | 6599 | return r; |
ae58fa02 | 6600 | } |
5566b478 | 6601 | |
8d08fdba MS |
6602 | case TREE_LIST: |
6603 | { | |
6604 | tree purpose, value, chain, result; | |
8d08fdba MS |
6605 | |
6606 | if (t == void_list_node) | |
6607 | return t; | |
6608 | ||
8d08fdba MS |
6609 | purpose = TREE_PURPOSE (t); |
6610 | if (purpose) | |
4393e105 MM |
6611 | { |
6612 | purpose = tsubst (purpose, args, complain, in_decl); | |
6613 | if (purpose == error_mark_node) | |
6614 | return error_mark_node; | |
6615 | } | |
8d08fdba MS |
6616 | value = TREE_VALUE (t); |
6617 | if (value) | |
4393e105 MM |
6618 | { |
6619 | value = tsubst (value, args, complain, in_decl); | |
6620 | if (value == error_mark_node) | |
6621 | return error_mark_node; | |
6622 | } | |
8d08fdba MS |
6623 | chain = TREE_CHAIN (t); |
6624 | if (chain && chain != void_type_node) | |
4393e105 MM |
6625 | { |
6626 | chain = tsubst (chain, args, complain, in_decl); | |
6627 | if (chain == error_mark_node) | |
6628 | return error_mark_node; | |
6629 | } | |
8d08fdba MS |
6630 | if (purpose == TREE_PURPOSE (t) |
6631 | && value == TREE_VALUE (t) | |
6632 | && chain == TREE_CHAIN (t)) | |
6633 | return t; | |
cbd5937a MM |
6634 | if (TREE_PARMLIST (t)) |
6635 | { | |
6636 | result = tree_cons (purpose, value, chain); | |
6637 | TREE_PARMLIST (result) = 1; | |
6638 | } | |
6639 | else | |
6640 | result = hash_tree_cons (purpose, value, chain); | |
8d08fdba MS |
6641 | return result; |
6642 | } | |
6643 | case TREE_VEC: | |
5566b478 MS |
6644 | if (type != NULL_TREE) |
6645 | { | |
1ceaad38 JM |
6646 | /* A binfo node. We always need to make a copy, of the node |
6647 | itself and of its BINFO_BASETYPES. */ | |
85b71cf2 | 6648 | |
5566b478 MS |
6649 | t = copy_node (t); |
6650 | ||
c7449f2b JM |
6651 | /* Make sure type isn't a typedef copy. */ |
6652 | type = BINFO_TYPE (TYPE_BINFO (type)); | |
6653 | ||
5566b478 | 6654 | TREE_TYPE (t) = complete_type (type); |
6633d636 MS |
6655 | if (IS_AGGR_TYPE (type)) |
6656 | { | |
6657 | BINFO_VTABLE (t) = TYPE_BINFO_VTABLE (type); | |
6658 | BINFO_VIRTUALS (t) = TYPE_BINFO_VIRTUALS (type); | |
6659 | if (TYPE_BINFO_BASETYPES (type) != NULL_TREE) | |
6660 | BINFO_BASETYPES (t) = copy_node (TYPE_BINFO_BASETYPES (type)); | |
6661 | } | |
5566b478 MS |
6662 | return t; |
6663 | } | |
85b71cf2 JM |
6664 | |
6665 | /* Otherwise, a vector of template arguments. */ | |
a91db711 | 6666 | return tsubst_template_args (t, args, complain, in_decl); |
8d08fdba | 6667 | |
8d08fdba MS |
6668 | case POINTER_TYPE: |
6669 | case REFERENCE_TYPE: | |
6670 | { | |
8d08fdba | 6671 | enum tree_code code; |
79a7c7fa | 6672 | |
46c895ac | 6673 | if (type == TREE_TYPE (t) && TREE_CODE (type) != METHOD_TYPE) |
8d08fdba MS |
6674 | return t; |
6675 | ||
6676 | code = TREE_CODE (t); | |
4393e105 MM |
6677 | |
6678 | ||
6679 | /* [temp.deduct] | |
6680 | ||
6681 | Type deduction may fail for any of the following | |
6682 | reasons: | |
6683 | ||
6684 | -- Attempting to create a pointer to reference type. | |
6685 | -- Attempting to create a reference to a reference type or | |
6686 | a reference to void. */ | |
0ecfe0b4 JM |
6687 | if (TREE_CODE (type) == REFERENCE_TYPE |
6688 | || (code == REFERENCE_TYPE && TREE_CODE (type) == VOID_TYPE)) | |
79a7c7fa | 6689 | { |
82a98427 | 6690 | static location_t last_loc; |
79a7c7fa JM |
6691 | |
6692 | /* We keep track of the last time we issued this error | |
6693 | message to avoid spewing a ton of messages during a | |
6694 | single bad template instantiation. */ | |
c2ea3a40 | 6695 | if (complain & tf_error |
82a98427 NS |
6696 | && (last_loc.line != input_line |
6697 | || last_loc.file != input_filename)) | |
79a7c7fa | 6698 | { |
0ecfe0b4 | 6699 | if (TREE_CODE (type) == VOID_TYPE) |
33bd39a2 | 6700 | error ("forming reference to void"); |
0ecfe0b4 | 6701 | else |
33bd39a2 | 6702 | error ("forming %s to reference type `%T'", |
0ecfe0b4 JM |
6703 | (code == POINTER_TYPE) ? "pointer" : "reference", |
6704 | type); | |
82a98427 | 6705 | last_loc = input_location; |
79a7c7fa JM |
6706 | } |
6707 | ||
4393e105 | 6708 | return error_mark_node; |
79a7c7fa JM |
6709 | } |
6710 | else if (code == POINTER_TYPE) | |
46c895ac NS |
6711 | { |
6712 | r = build_pointer_type (type); | |
6713 | if (TREE_CODE (type) == METHOD_TYPE) | |
6714 | r = build_ptrmemfunc_type (r); | |
6715 | } | |
8d08fdba MS |
6716 | else |
6717 | r = build_reference_type (type); | |
adecb3f4 | 6718 | r = cp_build_qualified_type_real (r, TYPE_QUALS (t), complain); |
79a7c7fa | 6719 | |
a5f1c5f8 NS |
6720 | if (r != error_mark_node) |
6721 | /* Will this ever be needed for TYPE_..._TO values? */ | |
6722 | layout_type (r); | |
6723 | ||
8d08fdba MS |
6724 | return r; |
6725 | } | |
a4443a08 | 6726 | case OFFSET_TYPE: |
0ecfe0b4 | 6727 | { |
4393e105 MM |
6728 | r = tsubst (TYPE_OFFSET_BASETYPE (t), args, complain, in_decl); |
6729 | if (r == error_mark_node || !IS_AGGR_TYPE (r)) | |
6730 | { | |
6731 | /* [temp.deduct] | |
6732 | ||
6733 | Type deduction may fail for any of the following | |
6734 | reasons: | |
6735 | ||
6736 | -- Attempting to create "pointer to member of T" when T | |
6737 | is not a class type. */ | |
c2ea3a40 NS |
6738 | if (complain & tf_error) |
6739 | error ("creating pointer to member of non-class type `%T'", r); | |
4393e105 MM |
6740 | return error_mark_node; |
6741 | } | |
46c895ac NS |
6742 | if (TREE_CODE (type) == REFERENCE_TYPE) |
6743 | { | |
4f09be91 | 6744 | if (complain & tf_error) |
46c895ac NS |
6745 | error ("creating pointer to member reference type `%T'", type); |
6746 | ||
6747 | return error_mark_node; | |
6748 | } | |
6749 | my_friendly_assert (TREE_CODE (type) != METHOD_TYPE, 20011231); | |
6750 | if (TREE_CODE (type) == FUNCTION_TYPE) | |
a5ac359a MM |
6751 | { |
6752 | /* This is really a method type. The cv qualifiers of the | |
6753 | this pointer should _not_ be determined by the cv | |
6754 | qualifiers of the class type. They should be held | |
6755 | somewhere in the FUNCTION_TYPE, but we don't do that at | |
6756 | the moment. Consider | |
6757 | typedef void (Func) () const; | |
6758 | ||
6759 | template <typename T1> void Foo (Func T1::*); | |
6760 | ||
6761 | */ | |
6762 | tree method_type; | |
6763 | ||
43dc123f MM |
6764 | method_type = build_method_type_directly (TYPE_MAIN_VARIANT (r), |
6765 | TREE_TYPE (type), | |
6766 | TYPE_ARG_TYPES (type)); | |
a5ac359a MM |
6767 | return build_ptrmemfunc_type (build_pointer_type (method_type)); |
6768 | } | |
46c895ac | 6769 | else |
b7a78333 MM |
6770 | return cp_build_qualified_type_real (build_ptrmem_type (r, type), |
6771 | TYPE_QUALS (t), | |
6772 | complain); | |
0ecfe0b4 | 6773 | } |
8d08fdba MS |
6774 | case FUNCTION_TYPE: |
6775 | case METHOD_TYPE: | |
6776 | { | |
c11b6f21 | 6777 | tree fntype; |
4393e105 | 6778 | tree raises; |
8d08fdba | 6779 | |
4393e105 MM |
6780 | fntype = tsubst_function_type (t, args, complain, in_decl); |
6781 | if (fntype == error_mark_node) | |
6782 | return error_mark_node; | |
cabc336a | 6783 | |
34cd5ae7 | 6784 | /* Substitute the exception specification. */ |
cabc336a | 6785 | raises = TYPE_RAISES_EXCEPTIONS (t); |
c11b6f21 MS |
6786 | if (raises) |
6787 | { | |
4cc1d462 NS |
6788 | tree list = NULL_TREE; |
6789 | ||
6790 | if (! TREE_VALUE (raises)) | |
6791 | list = raises; | |
6792 | else | |
6793 | for (; raises != NULL_TREE; raises = TREE_CHAIN (raises)) | |
6794 | { | |
6795 | tree spec = TREE_VALUE (raises); | |
6796 | ||
6797 | spec = tsubst (spec, args, complain, in_decl); | |
6798 | if (spec == error_mark_node) | |
6799 | return spec; | |
6800 | list = add_exception_specifier (list, spec, complain); | |
6801 | } | |
6802 | fntype = build_exception_variant (fntype, list); | |
c11b6f21 MS |
6803 | } |
6804 | return fntype; | |
8d08fdba MS |
6805 | } |
6806 | case ARRAY_TYPE: | |
6807 | { | |
4393e105 MM |
6808 | tree domain = tsubst (TYPE_DOMAIN (t), args, complain, in_decl); |
6809 | if (domain == error_mark_node) | |
6810 | return error_mark_node; | |
6811 | ||
6812 | /* As an optimization, we avoid regenerating the array type if | |
6813 | it will obviously be the same as T. */ | |
8d08fdba MS |
6814 | if (type == TREE_TYPE (t) && domain == TYPE_DOMAIN (t)) |
6815 | return t; | |
0ecfe0b4 | 6816 | |
4393e105 MM |
6817 | /* These checks should match the ones in grokdeclarator. |
6818 | ||
6819 | [temp.deduct] | |
6820 | ||
6821 | The deduction may fail for any of the following reasons: | |
6822 | ||
6823 | -- Attempting to create an array with an element type that | |
6824 | is void, a function type, or a reference type. */ | |
6825 | if (TREE_CODE (type) == VOID_TYPE | |
6826 | || TREE_CODE (type) == FUNCTION_TYPE | |
6827 | || TREE_CODE (type) == REFERENCE_TYPE) | |
0ecfe0b4 | 6828 | { |
c2ea3a40 | 6829 | if (complain & tf_error) |
33bd39a2 | 6830 | error ("creating array of `%T'", type); |
4393e105 | 6831 | return error_mark_node; |
0ecfe0b4 JM |
6832 | } |
6833 | ||
8d08fdba MS |
6834 | r = build_cplus_array_type (type, domain); |
6835 | return r; | |
6836 | } | |
6837 | ||
8d08fdba | 6838 | case PLUS_EXPR: |
5566b478 | 6839 | case MINUS_EXPR: |
4393e105 | 6840 | { |
c2ea3a40 NS |
6841 | tree e1 = tsubst (TREE_OPERAND (t, 0), args, complain, in_decl); |
6842 | tree e2 = tsubst (TREE_OPERAND (t, 1), args, complain, in_decl); | |
4393e105 MM |
6843 | |
6844 | if (e1 == error_mark_node || e2 == error_mark_node) | |
6845 | return error_mark_node; | |
6846 | ||
6847 | return fold (build (TREE_CODE (t), TREE_TYPE (t), e1, e2)); | |
6848 | } | |
8d08fdba MS |
6849 | |
6850 | case NEGATE_EXPR: | |
6851 | case NOP_EXPR: | |
4393e105 | 6852 | { |
c2ea3a40 | 6853 | tree e = tsubst (TREE_OPERAND (t, 0), args, complain, in_decl); |
4393e105 MM |
6854 | if (e == error_mark_node) |
6855 | return error_mark_node; | |
6856 | ||
6857 | return fold (build (TREE_CODE (t), TREE_TYPE (t), e)); | |
6858 | } | |
8d08fdba | 6859 | |
5566b478 MS |
6860 | case TYPENAME_TYPE: |
6861 | { | |
4393e105 MM |
6862 | tree ctx = tsubst_aggr_type (TYPE_CONTEXT (t), args, complain, |
6863 | in_decl, /*entering_scope=*/1); | |
6864 | tree f = tsubst_copy (TYPENAME_TYPE_FULLNAME (t), args, | |
6865 | complain, in_decl); | |
6866 | ||
6867 | if (ctx == error_mark_node || f == error_mark_node) | |
6868 | return error_mark_node; | |
ae58fa02 | 6869 | |
bf8f3f93 MM |
6870 | if (!IS_AGGR_TYPE (ctx)) |
6871 | { | |
c2ea3a40 | 6872 | if (complain & tf_error) |
33bd39a2 | 6873 | error ("`%T' is not a class, struct, or union type", |
bf8f3f93 MM |
6874 | ctx); |
6875 | return error_mark_node; | |
6876 | } | |
6877 | else if (!uses_template_parms (ctx) && !TYPE_BEING_DEFINED (ctx)) | |
6878 | { | |
6879 | /* Normally, make_typename_type does not require that the CTX | |
6880 | have complete type in order to allow things like: | |
ae58fa02 | 6881 | |
bf8f3f93 | 6882 | template <class T> struct S { typename S<T>::X Y; }; |
ae58fa02 | 6883 | |
bf8f3f93 MM |
6884 | But, such constructs have already been resolved by this |
6885 | point, so here CTX really should have complete type, unless | |
6886 | it's a partial instantiation. */ | |
4393e105 | 6887 | ctx = complete_type (ctx); |
d0f062fb | 6888 | if (!COMPLETE_TYPE_P (ctx)) |
4393e105 | 6889 | { |
c2ea3a40 | 6890 | if (complain & tf_error) |
7a228918 | 6891 | cxx_incomplete_type_error (NULL_TREE, ctx); |
4393e105 MM |
6892 | return error_mark_node; |
6893 | } | |
6894 | } | |
ae58fa02 | 6895 | |
4f2b0fb2 NS |
6896 | f = make_typename_type (ctx, f, |
6897 | (complain & tf_error) | tf_keep_type_decl); | |
f0bcd168 MM |
6898 | if (f == error_mark_node) |
6899 | return f; | |
4f2b0fb2 NS |
6900 | if (TREE_CODE (f) == TYPE_DECL) |
6901 | { | |
6902 | complain |= tf_ignore_bad_quals; | |
6903 | f = TREE_TYPE (f); | |
6904 | } | |
6905 | ||
6906 | return cp_build_qualified_type_real | |
6907 | (f, cp_type_quals (f) | cp_type_quals (t), complain); | |
5566b478 | 6908 | } |
c2ea3a40 | 6909 | |
b8c6534b KL |
6910 | case UNBOUND_CLASS_TEMPLATE: |
6911 | { | |
6912 | tree ctx = tsubst_aggr_type (TYPE_CONTEXT (t), args, complain, | |
6913 | in_decl, /*entering_scope=*/1); | |
6914 | tree name = TYPE_IDENTIFIER (t); | |
6915 | ||
6916 | if (ctx == error_mark_node || name == error_mark_node) | |
6917 | return error_mark_node; | |
6918 | ||
6919 | return make_unbound_class_template (ctx, name, complain); | |
6920 | } | |
6921 | ||
5566b478 | 6922 | case INDIRECT_REF: |
4393e105 | 6923 | { |
c2ea3a40 | 6924 | tree e = tsubst (TREE_OPERAND (t, 0), args, complain, in_decl); |
4393e105 MM |
6925 | if (e == error_mark_node) |
6926 | return error_mark_node; | |
6927 | return make_pointer_declarator (type, e); | |
6928 | } | |
6929 | ||
5566b478 | 6930 | case ADDR_EXPR: |
4393e105 | 6931 | { |
c2ea3a40 | 6932 | tree e = tsubst (TREE_OPERAND (t, 0), args, complain, in_decl); |
4393e105 MM |
6933 | if (e == error_mark_node) |
6934 | return error_mark_node; | |
6935 | return make_reference_declarator (type, e); | |
6936 | } | |
5566b478 MS |
6937 | |
6938 | case ARRAY_REF: | |
4393e105 | 6939 | { |
c2ea3a40 NS |
6940 | tree e1 = tsubst (TREE_OPERAND (t, 0), args, complain, in_decl); |
6941 | tree e2 = tsubst_expr (TREE_OPERAND (t, 1), args, complain, in_decl); | |
4393e105 MM |
6942 | if (e1 == error_mark_node || e2 == error_mark_node) |
6943 | return error_mark_node; | |
6944 | ||
718b8ea5 | 6945 | return build_nt (ARRAY_REF, e1, e2, tsubst_expr); |
4393e105 | 6946 | } |
5566b478 MS |
6947 | |
6948 | case CALL_EXPR: | |
4393e105 | 6949 | { |
c2ea3a40 | 6950 | tree e1 = tsubst (TREE_OPERAND (t, 0), args, complain, in_decl); |
43f887f9 MM |
6951 | tree e2 = (tsubst_call_declarator_parms |
6952 | (CALL_DECLARATOR_PARMS (t), args, complain, in_decl)); | |
6953 | tree e3 = tsubst (CALL_DECLARATOR_EXCEPTION_SPEC (t), args, | |
6954 | complain, in_decl); | |
4393e105 MM |
6955 | |
6956 | if (e1 == error_mark_node || e2 == error_mark_node | |
6957 | || e3 == error_mark_node) | |
6958 | return error_mark_node; | |
6959 | ||
43f887f9 | 6960 | return make_call_declarator (e1, e2, CALL_DECLARATOR_QUALS (t), e3); |
4393e105 | 6961 | } |
5566b478 | 6962 | |
fc378698 | 6963 | case SCOPE_REF: |
4393e105 | 6964 | { |
c2ea3a40 | 6965 | tree e1 = tsubst (TREE_OPERAND (t, 0), args, complain, in_decl); |
4393e105 MM |
6966 | tree e2 = tsubst (TREE_OPERAND (t, 1), args, complain, in_decl); |
6967 | if (e1 == error_mark_node || e2 == error_mark_node) | |
6968 | return error_mark_node; | |
6969 | ||
718b8ea5 | 6970 | return build_nt (TREE_CODE (t), e1, e2); |
4393e105 | 6971 | } |
fc378698 | 6972 | |
b894fc05 | 6973 | case TYPEOF_TYPE: |
4393e105 | 6974 | { |
c2ea3a40 | 6975 | tree e1 = tsubst_expr (TYPE_FIELDS (t), args, complain, in_decl); |
4393e105 MM |
6976 | if (e1 == error_mark_node) |
6977 | return error_mark_node; | |
6978 | ||
dce50630 MM |
6979 | return cp_build_qualified_type_real (TREE_TYPE (e1), |
6980 | cp_type_quals (t) | |
6981 | | cp_type_quals (TREE_TYPE (e1)), | |
6982 | complain); | |
4393e105 | 6983 | } |
b894fc05 | 6984 | |
8d08fdba | 6985 | default: |
5566b478 | 6986 | sorry ("use of `%s' in template", |
8d08fdba MS |
6987 | tree_code_name [(int) TREE_CODE (t)]); |
6988 | return error_mark_node; | |
6989 | } | |
6990 | } | |
6991 | ||
ee76b931 MM |
6992 | /* Like tsubst_expr for a BASELINK. OBJECT_TYPE, if non-NULL, is the |
6993 | type of the expression on the left-hand side of the "." or "->" | |
6994 | operator. */ | |
6995 | ||
6996 | static tree | |
6997 | tsubst_baselink (tree baselink, tree object_type, | |
6998 | tree args, tsubst_flags_t complain, tree in_decl) | |
6999 | { | |
7000 | tree name; | |
7001 | tree qualifying_scope; | |
7002 | tree fns; | |
7003 | tree template_args = 0; | |
7004 | bool template_id_p = false; | |
7005 | ||
7006 | /* A baselink indicates a function from a base class. The | |
7007 | BASELINK_ACCESS_BINFO and BASELINK_BINFO are going to have | |
7008 | non-dependent types; otherwise, the lookup could not have | |
7009 | succeeded. However, they may indicate bases of the template | |
7010 | class, rather than the instantiated class. | |
7011 | ||
7012 | In addition, lookups that were not ambiguous before may be | |
7013 | ambiguous now. Therefore, we perform the lookup again. */ | |
7014 | qualifying_scope = BINFO_TYPE (BASELINK_ACCESS_BINFO (baselink)); | |
7015 | fns = BASELINK_FUNCTIONS (baselink); | |
7016 | if (TREE_CODE (fns) == TEMPLATE_ID_EXPR) | |
7017 | { | |
7018 | template_id_p = true; | |
7019 | template_args = TREE_OPERAND (fns, 1); | |
7020 | fns = TREE_OPERAND (fns, 0); | |
bf12d54d NS |
7021 | if (template_args) |
7022 | template_args = tsubst_template_args (template_args, args, | |
7023 | complain, in_decl); | |
ee76b931 MM |
7024 | } |
7025 | name = DECL_NAME (get_first_fn (fns)); | |
7026 | baselink = lookup_fnfields (qualifying_scope, name, /*protect=*/1); | |
7027 | if (BASELINK_P (baselink) && template_id_p) | |
7028 | BASELINK_FUNCTIONS (baselink) | |
7029 | = build_nt (TEMPLATE_ID_EXPR, | |
7030 | BASELINK_FUNCTIONS (baselink), | |
7031 | template_args); | |
7032 | if (!object_type) | |
7033 | object_type = current_class_type; | |
7034 | return adjust_result_of_qualified_name_lookup (baselink, | |
7035 | qualifying_scope, | |
7036 | object_type); | |
7037 | } | |
7038 | ||
7039 | /* Like tsubst_expr for a SCOPE_REF, given by QUALIFIED_ID. DONE is | |
7040 | true if the qualified-id will be a postfix-expression in-and-of | |
7041 | itself; false if more of the postfix-expression follows the | |
7042 | QUALIFIED_ID. ADDRESS_P is true if the qualified-id is the operand | |
7043 | of "&". */ | |
7044 | ||
7045 | static tree | |
7046 | tsubst_qualified_id (tree qualified_id, tree args, | |
7047 | tsubst_flags_t complain, tree in_decl, | |
7048 | bool done, bool address_p) | |
7049 | { | |
7050 | tree expr; | |
7051 | tree scope; | |
7052 | tree name; | |
7053 | bool is_template; | |
7054 | tree template_args; | |
7055 | ||
7056 | my_friendly_assert (TREE_CODE (qualified_id) == SCOPE_REF, 20030706); | |
7057 | ||
ee76b931 MM |
7058 | /* Figure out what name to look up. */ |
7059 | name = TREE_OPERAND (qualified_id, 1); | |
7060 | if (TREE_CODE (name) == TEMPLATE_ID_EXPR) | |
7061 | { | |
7062 | is_template = true; | |
bf12d54d NS |
7063 | template_args = TREE_OPERAND (name, 1); |
7064 | if (template_args) | |
7065 | template_args = tsubst_template_args (template_args, args, | |
7066 | complain, in_decl); | |
ee76b931 MM |
7067 | name = TREE_OPERAND (name, 0); |
7068 | } | |
7069 | else | |
7070 | { | |
7071 | is_template = false; | |
7072 | template_args = NULL_TREE; | |
7073 | } | |
7074 | ||
6eeba0cc MM |
7075 | /* Substitute into the qualifying scope. When there are no ARGS, we |
7076 | are just trying to simplify a non-dependent expression. In that | |
7077 | case the qualifying scope may be dependent, and, in any case, | |
7078 | substituting will not help. */ | |
7079 | scope = TREE_OPERAND (qualified_id, 0); | |
7080 | if (args) | |
7081 | { | |
7082 | scope = tsubst (scope, args, complain, in_decl); | |
7083 | expr = tsubst_copy (name, args, complain, in_decl); | |
7084 | } | |
7085 | else | |
7086 | expr = name; | |
10b1d5e7 | 7087 | |
fb5ce3c9 NS |
7088 | my_friendly_assert (!dependent_type_p (scope), 20030729); |
7089 | ||
5e08432e | 7090 | if (!BASELINK_P (name) && !DECL_P (expr)) |
22038b2c | 7091 | expr = lookup_qualified_name (scope, expr, /*is_type_p=*/0, false); |
fb5ce3c9 | 7092 | |
279b8466 | 7093 | if (DECL_P (expr)) |
fb5ce3c9 | 7094 | check_accessibility_of_qualified_id (expr, /*object_type=*/NULL_TREE, |
279b8466 | 7095 | scope); |
6eeba0cc | 7096 | |
ee76b931 MM |
7097 | /* Remember that there was a reference to this entity. */ |
7098 | if (DECL_P (expr)) | |
6eeba0cc MM |
7099 | { |
7100 | mark_used (expr); | |
7101 | if (!args && TREE_CODE (expr) == VAR_DECL) | |
7102 | expr = DECL_INITIAL (expr); | |
7103 | } | |
ee76b931 MM |
7104 | |
7105 | if (is_template) | |
10b1d5e7 | 7106 | expr = lookup_template_function (expr, template_args); |
ee76b931 | 7107 | |
22038b2c NS |
7108 | if (expr == error_mark_node && complain & tf_error) |
7109 | qualified_name_lookup_error (scope, TREE_OPERAND (qualified_id, 1)); | |
7110 | else if (TYPE_P (scope)) | |
ee76b931 MM |
7111 | { |
7112 | expr = (adjust_result_of_qualified_name_lookup | |
7113 | (expr, scope, current_class_type)); | |
7114 | expr = finish_qualified_id_expr (scope, expr, done, address_p); | |
7115 | } | |
7116 | ||
7117 | return expr; | |
7118 | } | |
7119 | ||
00d3396f JM |
7120 | /* Like tsubst, but deals with expressions. This function just replaces |
7121 | template parms; to finish processing the resultant expression, use | |
7122 | tsubst_expr. */ | |
7123 | ||
14d22dd6 | 7124 | static tree |
3a978d72 | 7125 | tsubst_copy (tree t, tree args, tsubst_flags_t complain, tree in_decl) |
5566b478 MS |
7126 | { |
7127 | enum tree_code code; | |
8452b1d3 | 7128 | tree r; |
8d08fdba | 7129 | |
5566b478 MS |
7130 | if (t == NULL_TREE || t == error_mark_node) |
7131 | return t; | |
7132 | ||
7133 | code = TREE_CODE (t); | |
b7484fbe | 7134 | |
5566b478 MS |
7135 | switch (code) |
7136 | { | |
7137 | case PARM_DECL: | |
a723baf1 MM |
7138 | r = retrieve_local_specialization (t); |
7139 | my_friendly_assert (r != NULL, 20020903); | |
7140 | return r; | |
5566b478 MS |
7141 | |
7142 | case CONST_DECL: | |
ed44da02 MM |
7143 | { |
7144 | tree enum_type; | |
7145 | tree v; | |
7146 | ||
a723baf1 MM |
7147 | if (DECL_TEMPLATE_PARM_P (t)) |
7148 | return tsubst_copy (DECL_INITIAL (t), args, complain, in_decl); | |
7b6d72fc MM |
7149 | /* There is no need to substitute into namespace-scope |
7150 | enumerators. */ | |
7151 | if (DECL_NAMESPACE_SCOPE_P (t)) | |
ed44da02 MM |
7152 | return t; |
7153 | ||
7154 | /* Unfortunately, we cannot just call lookup_name here. | |
9188c363 MM |
7155 | Consider: |
7156 | ||
7157 | template <int I> int f() { | |
7158 | enum E { a = I }; | |
7159 | struct S { void g() { E e = a; } }; | |
7160 | }; | |
7161 | ||
7162 | When we instantiate f<7>::S::g(), say, lookup_name is not | |
7163 | clever enough to find f<7>::a. */ | |
ed44da02 | 7164 | enum_type |
4393e105 | 7165 | = tsubst_aggr_type (TREE_TYPE (t), args, complain, in_decl, |
ed44da02 MM |
7166 | /*entering_scope=*/0); |
7167 | ||
7168 | for (v = TYPE_VALUES (enum_type); | |
7169 | v != NULL_TREE; | |
7170 | v = TREE_CHAIN (v)) | |
7171 | if (TREE_PURPOSE (v) == DECL_NAME (t)) | |
7172 | return TREE_VALUE (v); | |
7173 | ||
7174 | /* We didn't find the name. That should never happen; if | |
7175 | name-lookup found it during preliminary parsing, we | |
7176 | should find it again here during instantiation. */ | |
a98facb0 | 7177 | abort (); |
ed44da02 | 7178 | } |
db04386f | 7179 | return t; |
ed44da02 | 7180 | |
5566b478 MS |
7181 | case FIELD_DECL: |
7182 | if (DECL_CONTEXT (t)) | |
7183 | { | |
0978790f | 7184 | tree ctx; |
0978790f | 7185 | |
4393e105 | 7186 | ctx = tsubst_aggr_type (DECL_CONTEXT (t), args, complain, in_decl, |
36a117a5 | 7187 | /*entering_scope=*/1); |
0978790f | 7188 | if (ctx != DECL_CONTEXT (t)) |
86ac0575 | 7189 | return lookup_field (ctx, DECL_NAME (t), 0, false); |
5566b478 MS |
7190 | } |
7191 | return t; | |
7192 | ||
7193 | case VAR_DECL: | |
7194 | case FUNCTION_DECL: | |
a723baf1 MM |
7195 | if ((DECL_LANG_SPECIFIC (t) && DECL_TEMPLATE_INFO (t)) |
7196 | || local_variable_p (t)) | |
4393e105 | 7197 | t = tsubst (t, args, complain, in_decl); |
5566b478 MS |
7198 | mark_used (t); |
7199 | return t; | |
7200 | ||
a723baf1 | 7201 | case BASELINK: |
ee76b931 | 7202 | return tsubst_baselink (t, current_class_type, args, complain, in_decl); |
a723baf1 | 7203 | |
98c1c668 | 7204 | case TEMPLATE_DECL: |
a723baf1 MM |
7205 | if (DECL_TEMPLATE_TEMPLATE_PARM_P (t)) |
7206 | return tsubst (TREE_TYPE (DECL_TEMPLATE_RESULT (t)), | |
7207 | args, complain, in_decl); | |
7208 | else if (is_member_template (t)) | |
4393e105 | 7209 | return tsubst (t, args, complain, in_decl); |
fcea7401 KL |
7210 | else if (DECL_CLASS_SCOPE_P (t) |
7211 | && uses_template_parms (DECL_CONTEXT (t))) | |
7212 | { | |
7213 | /* Template template argument like the following example need | |
7214 | special treatment: | |
7215 | ||
7216 | template <template <class> class TT> struct C {}; | |
7217 | template <class T> struct D { | |
7218 | template <class U> struct E {}; | |
7219 | C<E> c; // #1 | |
7220 | }; | |
7221 | D<int> d; // #2 | |
7222 | ||
7223 | We are processing the template argument `E' in #1 for | |
7224 | the template instantiation #2. Originally, `E' is a | |
7225 | TEMPLATE_DECL with `D<T>' as its DECL_CONTEXT. Now we | |
7226 | have to substitute this with one having context `D<int>'. */ | |
7227 | ||
7228 | tree context = tsubst (DECL_CONTEXT (t), args, complain, in_decl); | |
7229 | return lookup_field (context, DECL_NAME(t), 0, false); | |
7230 | } | |
98c1c668 | 7231 | else |
fcea7401 | 7232 | /* Ordinary template template argument. */ |
98c1c668 JM |
7233 | return t; |
7234 | ||
5566b478 MS |
7235 | case CAST_EXPR: |
7236 | case REINTERPRET_CAST_EXPR: | |
e92cc029 MS |
7237 | case CONST_CAST_EXPR: |
7238 | case STATIC_CAST_EXPR: | |
7239 | case DYNAMIC_CAST_EXPR: | |
51924768 | 7240 | case NOP_EXPR: |
5566b478 | 7241 | return build1 |
4393e105 MM |
7242 | (code, tsubst (TREE_TYPE (t), args, complain, in_decl), |
7243 | tsubst_copy (TREE_OPERAND (t, 0), args, complain, in_decl)); | |
5566b478 MS |
7244 | |
7245 | case INDIRECT_REF: | |
5566b478 MS |
7246 | case NEGATE_EXPR: |
7247 | case TRUTH_NOT_EXPR: | |
b87692e5 | 7248 | case BIT_NOT_EXPR: |
5566b478 MS |
7249 | case ADDR_EXPR: |
7250 | case CONVERT_EXPR: /* Unary + */ | |
7251 | case SIZEOF_EXPR: | |
abff8e06 | 7252 | case ALIGNOF_EXPR: |
5566b478 | 7253 | case ARROW_EXPR: |
fc378698 | 7254 | case THROW_EXPR: |
5156628f | 7255 | case TYPEID_EXPR: |
f5733617 SS |
7256 | case REALPART_EXPR: |
7257 | case IMAGPART_EXPR: | |
5566b478 | 7258 | return build1 |
6a629cac | 7259 | (code, tsubst (TREE_TYPE (t), args, complain, in_decl), |
4393e105 | 7260 | tsubst_copy (TREE_OPERAND (t, 0), args, complain, in_decl)); |
5566b478 | 7261 | |
a723baf1 MM |
7262 | case COMPONENT_REF: |
7263 | { | |
7264 | tree object; | |
7265 | tree name; | |
7266 | ||
7267 | object = tsubst_copy (TREE_OPERAND (t, 0), args, complain, in_decl); | |
7268 | name = TREE_OPERAND (t, 1); | |
7269 | if (TREE_CODE (name) == BIT_NOT_EXPR) | |
7270 | { | |
7271 | name = tsubst_copy (TREE_OPERAND (name, 0), args, | |
7272 | complain, in_decl); | |
7273 | name = build1 (BIT_NOT_EXPR, NULL_TREE, name); | |
7274 | } | |
7275 | else if (TREE_CODE (name) == SCOPE_REF | |
7276 | && TREE_CODE (TREE_OPERAND (name, 1)) == BIT_NOT_EXPR) | |
7277 | { | |
7278 | tree base = tsubst_copy (TREE_OPERAND (name, 0), args, | |
7279 | complain, in_decl); | |
7280 | name = TREE_OPERAND (name, 1); | |
7281 | name = tsubst_copy (TREE_OPERAND (name, 0), args, | |
7282 | complain, in_decl); | |
7283 | name = build1 (BIT_NOT_EXPR, NULL_TREE, name); | |
7284 | name = build_nt (SCOPE_REF, base, name); | |
7285 | } | |
ee76b931 MM |
7286 | else if (TREE_CODE (name) == BASELINK) |
7287 | name = tsubst_baselink (name, | |
7288 | non_reference (TREE_TYPE (object)), | |
7289 | args, complain, | |
7290 | in_decl); | |
a723baf1 | 7291 | else |
ee76b931 | 7292 | name = tsubst_copy (name, args, complain, in_decl); |
a723baf1 MM |
7293 | return build_nt (COMPONENT_REF, object, name); |
7294 | } | |
7295 | ||
5566b478 MS |
7296 | case PLUS_EXPR: |
7297 | case MINUS_EXPR: | |
7298 | case MULT_EXPR: | |
7299 | case TRUNC_DIV_EXPR: | |
7300 | case CEIL_DIV_EXPR: | |
7301 | case FLOOR_DIV_EXPR: | |
7302 | case ROUND_DIV_EXPR: | |
7303 | case EXACT_DIV_EXPR: | |
7304 | case BIT_AND_EXPR: | |
5566b478 MS |
7305 | case BIT_IOR_EXPR: |
7306 | case BIT_XOR_EXPR: | |
7307 | case TRUNC_MOD_EXPR: | |
7308 | case FLOOR_MOD_EXPR: | |
7309 | case TRUTH_ANDIF_EXPR: | |
7310 | case TRUTH_ORIF_EXPR: | |
7311 | case TRUTH_AND_EXPR: | |
7312 | case TRUTH_OR_EXPR: | |
7313 | case RSHIFT_EXPR: | |
7314 | case LSHIFT_EXPR: | |
7315 | case RROTATE_EXPR: | |
7316 | case LROTATE_EXPR: | |
7317 | case EQ_EXPR: | |
7318 | case NE_EXPR: | |
7319 | case MAX_EXPR: | |
7320 | case MIN_EXPR: | |
7321 | case LE_EXPR: | |
7322 | case GE_EXPR: | |
7323 | case LT_EXPR: | |
7324 | case GT_EXPR: | |
5566b478 MS |
7325 | case ARRAY_REF: |
7326 | case COMPOUND_EXPR: | |
7327 | case SCOPE_REF: | |
7328 | case DOTSTAR_EXPR: | |
7329 | case MEMBER_REF: | |
519c9806 MM |
7330 | case PREDECREMENT_EXPR: |
7331 | case PREINCREMENT_EXPR: | |
7332 | case POSTDECREMENT_EXPR: | |
7333 | case POSTINCREMENT_EXPR: | |
5566b478 | 7334 | return build_nt |
4393e105 MM |
7335 | (code, tsubst_copy (TREE_OPERAND (t, 0), args, complain, in_decl), |
7336 | tsubst_copy (TREE_OPERAND (t, 1), args, complain, in_decl)); | |
5566b478 MS |
7337 | |
7338 | case CALL_EXPR: | |
a723baf1 MM |
7339 | return build_nt (code, |
7340 | tsubst_copy (TREE_OPERAND (t, 0), args, | |
7341 | complain, in_decl), | |
7342 | tsubst_copy (TREE_OPERAND (t, 1), args, complain, | |
7343 | in_decl), | |
7344 | NULL_TREE); | |
5566b478 | 7345 | |
558475f0 | 7346 | case STMT_EXPR: |
cc23546e | 7347 | /* This processing should really occur in tsubst_expr. However, |
558475f0 | 7348 | tsubst_expr does not recurse into expressions, since it |
cc23546e JO |
7349 | assumes that there aren't any statements inside them. So, we |
7350 | need to expand the STMT_EXPR here. */ | |
558475f0 MM |
7351 | if (!processing_template_decl) |
7352 | { | |
b5ac18ea | 7353 | tree stmt_expr = begin_stmt_expr (); |
a5bcc582 NS |
7354 | |
7355 | tsubst_expr (STMT_EXPR_STMT (t), args, | |
7356 | complain | tf_stmt_expr_cmpd, in_decl); | |
303b7406 | 7357 | return finish_stmt_expr (stmt_expr, false); |
558475f0 | 7358 | } |
9d9169de MM |
7359 | |
7360 | return t; | |
558475f0 | 7361 | |
5566b478 MS |
7362 | case COND_EXPR: |
7363 | case MODOP_EXPR: | |
40242ccf | 7364 | case PSEUDO_DTOR_EXPR: |
67da3287 | 7365 | { |
8452b1d3 | 7366 | r = build_nt |
4393e105 MM |
7367 | (code, tsubst_copy (TREE_OPERAND (t, 0), args, complain, in_decl), |
7368 | tsubst_copy (TREE_OPERAND (t, 1), args, complain, in_decl), | |
7369 | tsubst_copy (TREE_OPERAND (t, 2), args, complain, in_decl)); | |
67da3287 MM |
7370 | return r; |
7371 | } | |
5566b478 MS |
7372 | |
7373 | case NEW_EXPR: | |
7374 | { | |
8452b1d3 | 7375 | r = build_nt |
4393e105 MM |
7376 | (code, tsubst_copy (TREE_OPERAND (t, 0), args, complain, in_decl), |
7377 | tsubst_copy (TREE_OPERAND (t, 1), args, complain, in_decl), | |
7378 | tsubst_copy (TREE_OPERAND (t, 2), args, complain, in_decl)); | |
5566b478 MS |
7379 | NEW_EXPR_USE_GLOBAL (r) = NEW_EXPR_USE_GLOBAL (t); |
7380 | return r; | |
7381 | } | |
7382 | ||
7383 | case DELETE_EXPR: | |
7384 | { | |
8452b1d3 | 7385 | r = build_nt |
4393e105 MM |
7386 | (code, tsubst_copy (TREE_OPERAND (t, 0), args, complain, in_decl), |
7387 | tsubst_copy (TREE_OPERAND (t, 1), args, complain, in_decl)); | |
5566b478 MS |
7388 | DELETE_EXPR_USE_GLOBAL (r) = DELETE_EXPR_USE_GLOBAL (t); |
7389 | DELETE_EXPR_USE_VEC (r) = DELETE_EXPR_USE_VEC (t); | |
7390 | return r; | |
7391 | } | |
7392 | ||
386b8a85 JM |
7393 | case TEMPLATE_ID_EXPR: |
7394 | { | |
00d3396f | 7395 | /* Substituted template arguments */ |
a91db711 NS |
7396 | tree fn = TREE_OPERAND (t, 0); |
7397 | tree targs = TREE_OPERAND (t, 1); | |
856216bb | 7398 | |
a91db711 | 7399 | fn = tsubst_copy (fn, args, complain, in_decl); |
bf12d54d NS |
7400 | if (targs) |
7401 | targs = tsubst_template_args (targs, args, complain, in_decl); | |
a91db711 NS |
7402 | |
7403 | return lookup_template_function (fn, targs); | |
386b8a85 JM |
7404 | } |
7405 | ||
5566b478 MS |
7406 | case TREE_LIST: |
7407 | { | |
7408 | tree purpose, value, chain; | |
7409 | ||
7410 | if (t == void_list_node) | |
7411 | return t; | |
7412 | ||
7413 | purpose = TREE_PURPOSE (t); | |
7414 | if (purpose) | |
4393e105 | 7415 | purpose = tsubst_copy (purpose, args, complain, in_decl); |
5566b478 MS |
7416 | value = TREE_VALUE (t); |
7417 | if (value) | |
4393e105 | 7418 | value = tsubst_copy (value, args, complain, in_decl); |
5566b478 MS |
7419 | chain = TREE_CHAIN (t); |
7420 | if (chain && chain != void_type_node) | |
4393e105 | 7421 | chain = tsubst_copy (chain, args, complain, in_decl); |
5566b478 MS |
7422 | if (purpose == TREE_PURPOSE (t) |
7423 | && value == TREE_VALUE (t) | |
7424 | && chain == TREE_CHAIN (t)) | |
7425 | return t; | |
7426 | return tree_cons (purpose, value, chain); | |
7427 | } | |
7428 | ||
7429 | case RECORD_TYPE: | |
7430 | case UNION_TYPE: | |
7431 | case ENUMERAL_TYPE: | |
7432 | case INTEGER_TYPE: | |
7433 | case TEMPLATE_TYPE_PARM: | |
73b0fce8 | 7434 | case TEMPLATE_TEMPLATE_PARM: |
a1281f45 | 7435 | case BOUND_TEMPLATE_TEMPLATE_PARM: |
f84b4be9 | 7436 | case TEMPLATE_PARM_INDEX: |
5566b478 MS |
7437 | case POINTER_TYPE: |
7438 | case REFERENCE_TYPE: | |
7439 | case OFFSET_TYPE: | |
7440 | case FUNCTION_TYPE: | |
7441 | case METHOD_TYPE: | |
7442 | case ARRAY_TYPE: | |
7443 | case TYPENAME_TYPE: | |
b8c6534b | 7444 | case UNBOUND_CLASS_TEMPLATE: |
2a2b1d56 | 7445 | case TYPEOF_TYPE: |
f84b4be9 | 7446 | case TYPE_DECL: |
4393e105 | 7447 | return tsubst (t, args, complain, in_decl); |
5566b478 | 7448 | |
e92cc029 | 7449 | case IDENTIFIER_NODE: |
421844e7 | 7450 | if (IDENTIFIER_TYPENAME_P (t)) |
1f6e1acc AS |
7451 | { |
7452 | tree new_type = tsubst (TREE_TYPE (t), args, complain, in_decl); | |
1f84ec23 | 7453 | return mangle_conv_op_name_for_type (new_type); |
1f6e1acc | 7454 | } |
e92cc029 MS |
7455 | else |
7456 | return t; | |
7457 | ||
5156628f | 7458 | case CONSTRUCTOR: |
8452b1d3 | 7459 | { |
dcf92453 ZW |
7460 | r = build_constructor |
7461 | (tsubst (TREE_TYPE (t), args, complain, in_decl), | |
7462 | tsubst_copy (CONSTRUCTOR_ELTS (t), args, complain, in_decl)); | |
8452b1d3 JM |
7463 | TREE_HAS_CONSTRUCTOR (r) = TREE_HAS_CONSTRUCTOR (t); |
7464 | return r; | |
7465 | } | |
5156628f | 7466 | |
371534a9 | 7467 | case VA_ARG_EXPR: |
ea333e1c | 7468 | return build_x_va_arg (tsubst_copy (TREE_OPERAND (t, 0), args, complain, |
c2ea3a40 NS |
7469 | in_decl), |
7470 | tsubst (TREE_TYPE (t), args, complain, in_decl)); | |
f9817201 | 7471 | |
5566b478 MS |
7472 | default: |
7473 | return t; | |
7474 | } | |
7475 | } | |
7476 | ||
cc23546e JO |
7477 | /* Like tsubst_copy for expressions, etc. but also does semantic |
7478 | processing. */ | |
00d3396f | 7479 | |
14d22dd6 | 7480 | static tree |
3a978d72 | 7481 | tsubst_expr (tree t, tree args, tsubst_flags_t complain, tree in_decl) |
5566b478 | 7482 | { |
fd10dd09 | 7483 | tree stmt, tmp; |
a5bcc582 NS |
7484 | tsubst_flags_t stmt_expr |
7485 | = complain & (tf_stmt_expr_cmpd | tf_stmt_expr_body); | |
558475f0 | 7486 | |
a5bcc582 | 7487 | complain ^= stmt_expr; |
5566b478 MS |
7488 | if (t == NULL_TREE || t == error_mark_node) |
7489 | return t; | |
7490 | ||
5156628f | 7491 | if (processing_template_decl) |
4393e105 | 7492 | return tsubst_copy (t, args, complain, in_decl); |
5566b478 | 7493 | |
009ed910 | 7494 | if (!STATEMENT_CODE_P (TREE_CODE (t))) |
b3445994 MM |
7495 | return tsubst_copy_and_build (t, args, complain, in_decl, |
7496 | /*function_p=*/false); | |
fd10dd09 | 7497 | |
5566b478 | 7498 | switch (TREE_CODE (t)) |
8d08fdba | 7499 | { |
558475f0 | 7500 | case CTOR_INITIALIZER: |
2282d28d MM |
7501 | prep_stmt (t); |
7502 | finish_mem_initializers (tsubst_initializer_list | |
7503 | (TREE_OPERAND (t, 0), args)); | |
7504 | break; | |
558475f0 | 7505 | |
5566b478 | 7506 | case RETURN_STMT: |
a7e4cfa0 | 7507 | prep_stmt (t); |
d65b1d77 | 7508 | finish_return_stmt (tsubst_expr (RETURN_STMT_EXPR (t), |
4393e105 | 7509 | args, complain, in_decl)); |
5566b478 MS |
7510 | break; |
7511 | ||
7512 | case EXPR_STMT: | |
a5bcc582 NS |
7513 | { |
7514 | tree r; | |
7515 | ||
7516 | prep_stmt (t); | |
7517 | ||
7518 | r = tsubst_expr (EXPR_STMT_EXPR (t), args, complain, in_decl); | |
7519 | if (stmt_expr & tf_stmt_expr_body && !TREE_CHAIN (t)) | |
7520 | finish_stmt_expr_expr (r); | |
7521 | else | |
7522 | finish_expr_stmt (r); | |
7523 | break; | |
7524 | } | |
5566b478 | 7525 | |
9da99f7d NS |
7526 | case USING_STMT: |
7527 | prep_stmt (t); | |
7528 | do_using_directive (tsubst_expr (USING_STMT_NAMESPACE (t), | |
7529 | args, complain, in_decl)); | |
7530 | break; | |
7531 | ||
5566b478 MS |
7532 | case DECL_STMT: |
7533 | { | |
e0942dcd MM |
7534 | tree decl; |
7535 | tree init; | |
5566b478 | 7536 | |
a7e4cfa0 | 7537 | prep_stmt (t); |
e0942dcd | 7538 | decl = DECL_STMT_DECL (t); |
acef433b MM |
7539 | if (TREE_CODE (decl) == LABEL_DECL) |
7540 | finish_label_decl (DECL_NAME (decl)); | |
fbfe8c9e NS |
7541 | else if (TREE_CODE (decl) == USING_DECL) |
7542 | { | |
7543 | tree scope = DECL_INITIAL (decl); | |
7544 | tree name = DECL_NAME (decl); | |
22038b2c | 7545 | tree decl; |
fbfe8c9e NS |
7546 | |
7547 | scope = tsubst_expr (scope, args, complain, in_decl); | |
22038b2c NS |
7548 | decl = lookup_qualified_name (scope, name, |
7549 | /*is_type_p=*/0, /*complain=*/false); | |
7550 | if (decl == error_mark_node) | |
7551 | qualified_name_lookup_error (scope, name); | |
7552 | else | |
7553 | do_local_using_decl (decl); | |
fbfe8c9e | 7554 | } |
acef433b MM |
7555 | else |
7556 | { | |
7557 | init = DECL_INITIAL (decl); | |
7558 | decl = tsubst (decl, args, complain, in_decl); | |
ce2e5191 NS |
7559 | if (decl != error_mark_node) |
7560 | { | |
7561 | if (init) | |
7562 | DECL_INITIAL (decl) = error_mark_node; | |
7563 | /* By marking the declaration as instantiated, we avoid | |
7564 | trying to instantiate it. Since instantiate_decl can't | |
7565 | handle local variables, and since we've already done | |
7566 | all that needs to be done, that's the right thing to | |
7567 | do. */ | |
7568 | if (TREE_CODE (decl) == VAR_DECL) | |
7569 | DECL_TEMPLATE_INSTANTIATED (decl) = 1; | |
edebf865 MM |
7570 | if (TREE_CODE (decl) == VAR_DECL |
7571 | && ANON_AGGR_TYPE_P (TREE_TYPE (decl))) | |
7572 | /* Anonymous aggregates are a special case. */ | |
7573 | finish_anon_union (decl); | |
7574 | else | |
ed2fa432 | 7575 | { |
edebf865 | 7576 | maybe_push_decl (decl); |
39703eb9 MM |
7577 | if (TREE_CODE (decl) == VAR_DECL |
7578 | && DECL_PRETTY_FUNCTION_P (decl)) | |
edebf865 MM |
7579 | { |
7580 | /* For __PRETTY_FUNCTION__ we have to adjust the | |
7581 | initializer. */ | |
7582 | const char *const name | |
7583 | = cxx_printable_name (current_function_decl, 2); | |
7584 | init = cp_fname_init (name); | |
7585 | TREE_TYPE (decl) = TREE_TYPE (init); | |
7586 | } | |
7587 | else | |
7588 | init = tsubst_expr (init, args, complain, in_decl); | |
7589 | cp_finish_decl (decl, init, NULL_TREE, 0); | |
ed2fa432 | 7590 | } |
ce2e5191 | 7591 | } |
acef433b | 7592 | } |
fd10dd09 JM |
7593 | |
7594 | /* A DECL_STMT can also be used as an expression, in the condition | |
27631dae | 7595 | clause of an if/for/while construct. If we aren't followed by |
fd10dd09 JM |
7596 | another statement, return our decl. */ |
7597 | if (TREE_CHAIN (t) == NULL_TREE) | |
7598 | return decl; | |
5566b478 | 7599 | } |
fd10dd09 | 7600 | break; |
8d08fdba | 7601 | |
5566b478 MS |
7602 | case FOR_STMT: |
7603 | { | |
a7e4cfa0 | 7604 | prep_stmt (t); |
5566b478 | 7605 | |
558475f0 | 7606 | stmt = begin_for_stmt (); |
fd10dd09 | 7607 | tsubst_expr (FOR_INIT_STMT (t), args, complain, in_decl); |
558475f0 | 7608 | finish_for_init_stmt (stmt); |
c2ea3a40 NS |
7609 | finish_for_cond (tsubst_expr (FOR_COND (t), |
7610 | args, complain, in_decl), | |
558475f0 | 7611 | stmt); |
4393e105 | 7612 | tmp = tsubst_expr (FOR_EXPR (t), args, complain, in_decl); |
558475f0 | 7613 | finish_for_expr (tmp, stmt); |
4393e105 | 7614 | tsubst_expr (FOR_BODY (t), args, complain, in_decl); |
35b1567d | 7615 | finish_for_stmt (stmt); |
5566b478 MS |
7616 | } |
7617 | break; | |
8d08fdba | 7618 | |
5566b478 MS |
7619 | case WHILE_STMT: |
7620 | { | |
a7e4cfa0 | 7621 | prep_stmt (t); |
558475f0 | 7622 | stmt = begin_while_stmt (); |
ad321293 | 7623 | finish_while_stmt_cond (tsubst_expr (WHILE_COND (t), |
4393e105 | 7624 | args, complain, in_decl), |
558475f0 | 7625 | stmt); |
4393e105 | 7626 | tsubst_expr (WHILE_BODY (t), args, complain, in_decl); |
558475f0 | 7627 | finish_while_stmt (stmt); |
5566b478 MS |
7628 | } |
7629 | break; | |
8d08fdba | 7630 | |
5566b478 MS |
7631 | case DO_STMT: |
7632 | { | |
a7e4cfa0 | 7633 | prep_stmt (t); |
558475f0 | 7634 | stmt = begin_do_stmt (); |
4393e105 | 7635 | tsubst_expr (DO_BODY (t), args, complain, in_decl); |
558475f0 | 7636 | finish_do_body (stmt); |
c2ea3a40 NS |
7637 | finish_do_stmt (tsubst_expr (DO_COND (t), |
7638 | args, complain, in_decl), | |
558475f0 | 7639 | stmt); |
5566b478 MS |
7640 | } |
7641 | break; | |
a0a33927 | 7642 | |
5566b478 | 7643 | case IF_STMT: |
8d08fdba | 7644 | { |
a7e4cfa0 | 7645 | prep_stmt (t); |
558475f0 | 7646 | stmt = begin_if_stmt (); |
ad321293 | 7647 | finish_if_stmt_cond (tsubst_expr (IF_COND (t), |
4393e105 | 7648 | args, complain, in_decl), |
558475f0 | 7649 | stmt); |
db5ae43f | 7650 | |
ad321293 | 7651 | if (tmp = THEN_CLAUSE (t), tmp) |
db5ae43f | 7652 | { |
4393e105 | 7653 | tsubst_expr (tmp, args, complain, in_decl); |
558475f0 | 7654 | finish_then_clause (stmt); |
db5ae43f MS |
7655 | } |
7656 | ||
ad321293 MM |
7657 | if (tmp = ELSE_CLAUSE (t), tmp) |
7658 | { | |
7659 | begin_else_clause (); | |
4393e105 | 7660 | tsubst_expr (tmp, args, complain, in_decl); |
558475f0 | 7661 | finish_else_clause (stmt); |
ad321293 | 7662 | } |
8d08fdba | 7663 | |
ad321293 | 7664 | finish_if_stmt (); |
8d08fdba | 7665 | } |
5566b478 | 7666 | break; |
8d08fdba | 7667 | |
5566b478 MS |
7668 | case COMPOUND_STMT: |
7669 | { | |
a7e4cfa0 | 7670 | prep_stmt (t); |
ade3dc07 JM |
7671 | if (COMPOUND_STMT_BODY_BLOCK (t)) |
7672 | stmt = begin_function_body (); | |
7673 | else | |
7674 | stmt = begin_compound_stmt (COMPOUND_STMT_NO_SCOPE (t)); | |
7675 | ||
a5bcc582 NS |
7676 | tsubst_expr (COMPOUND_BODY (t), args, |
7677 | complain | ((stmt_expr & tf_stmt_expr_cmpd) << 1), | |
7678 | in_decl); | |
ade3dc07 JM |
7679 | |
7680 | if (COMPOUND_STMT_BODY_BLOCK (t)) | |
7681 | finish_function_body (stmt); | |
7682 | else | |
7a3397c7 | 7683 | finish_compound_stmt (stmt); |
5566b478 MS |
7684 | } |
7685 | break; | |
8d08fdba | 7686 | |
5566b478 | 7687 | case BREAK_STMT: |
a7e4cfa0 | 7688 | prep_stmt (t); |
ad321293 | 7689 | finish_break_stmt (); |
5566b478 | 7690 | break; |
8d08fdba | 7691 | |
6467930b | 7692 | case CONTINUE_STMT: |
a7e4cfa0 | 7693 | prep_stmt (t); |
ad321293 | 7694 | finish_continue_stmt (); |
6467930b MS |
7695 | break; |
7696 | ||
5566b478 MS |
7697 | case SWITCH_STMT: |
7698 | { | |
558475f0 | 7699 | tree val; |
5566b478 | 7700 | |
a7e4cfa0 | 7701 | prep_stmt (t); |
527f0080 | 7702 | stmt = begin_switch_stmt (); |
4393e105 | 7703 | val = tsubst_expr (SWITCH_COND (t), args, complain, in_decl); |
527f0080 | 7704 | finish_switch_cond (val, stmt); |
558475f0 | 7705 | tsubst_expr (SWITCH_BODY (t), args, complain, in_decl); |
35b1567d | 7706 | finish_switch_stmt (stmt); |
5566b478 MS |
7707 | } |
7708 | break; | |
7709 | ||
7710 | case CASE_LABEL: | |
a7e4cfa0 | 7711 | prep_stmt (t); |
4393e105 | 7712 | finish_case_label (tsubst_expr (CASE_LOW (t), args, complain, in_decl), |
56cb9733 MM |
7713 | tsubst_expr (CASE_HIGH (t), args, complain, |
7714 | in_decl)); | |
5566b478 MS |
7715 | break; |
7716 | ||
acef433b | 7717 | case LABEL_STMT: |
d479d37f | 7718 | input_line = STMT_LINENO (t); |
acef433b | 7719 | finish_label_stmt (DECL_NAME (LABEL_STMT_LABEL (t))); |
5566b478 MS |
7720 | break; |
7721 | ||
aa16c0fa KL |
7722 | case FILE_STMT: |
7723 | input_filename = FILE_STMT_FILENAME (t); | |
7724 | add_stmt (build_nt (FILE_STMT, FILE_STMT_FILENAME_NODE (t))); | |
7725 | break; | |
7726 | ||
5566b478 | 7727 | case GOTO_STMT: |
a7e4cfa0 | 7728 | prep_stmt (t); |
fd10dd09 JM |
7729 | tmp = GOTO_DESTINATION (t); |
7730 | if (TREE_CODE (tmp) != LABEL_DECL) | |
aa09da44 MM |
7731 | /* Computed goto's must be tsubst'd into. On the other hand, |
7732 | non-computed gotos must not be; the identifier in question | |
7733 | will have no binding. */ | |
fd10dd09 | 7734 | tmp = tsubst_expr (tmp, args, complain, in_decl); |
3fa56191 | 7735 | else |
fd10dd09 JM |
7736 | tmp = DECL_NAME (tmp); |
7737 | finish_goto_stmt (tmp); | |
ad321293 MM |
7738 | break; |
7739 | ||
7740 | case ASM_STMT: | |
a7e4cfa0 | 7741 | prep_stmt (t); |
c87978aa JM |
7742 | tmp = finish_asm_stmt |
7743 | (ASM_CV_QUAL (t), | |
7744 | tsubst_expr (ASM_STRING (t), args, complain, in_decl), | |
7745 | tsubst_expr (ASM_OUTPUTS (t), args, complain, in_decl), | |
7746 | tsubst_expr (ASM_INPUTS (t), args, complain, in_decl), | |
7747 | tsubst_expr (ASM_CLOBBERS (t), args, complain, in_decl)); | |
7748 | ASM_INPUT_P (tmp) = ASM_INPUT_P (t); | |
5566b478 | 7749 | break; |
faf5394a MS |
7750 | |
7751 | case TRY_BLOCK: | |
a7e4cfa0 | 7752 | prep_stmt (t); |
f1dedc31 | 7753 | if (CLEANUP_P (t)) |
62409b39 | 7754 | { |
57b52417 | 7755 | stmt = begin_try_block (); |
62409b39 MM |
7756 | tsubst_expr (TRY_STMTS (t), args, complain, in_decl); |
7757 | finish_cleanup_try_block (stmt); | |
7758 | finish_cleanup (tsubst_expr (TRY_HANDLERS (t), args, | |
7759 | complain, in_decl), | |
7760 | stmt); | |
7761 | } | |
f1dedc31 MM |
7762 | else |
7763 | { | |
62409b39 MM |
7764 | if (FN_TRY_BLOCK_P (t)) |
7765 | stmt = begin_function_try_block (); | |
7766 | else | |
7767 | stmt = begin_try_block (); | |
7768 | ||
7769 | tsubst_expr (TRY_STMTS (t), args, complain, in_decl); | |
7770 | ||
7771 | if (FN_TRY_BLOCK_P (t)) | |
7772 | finish_function_try_block (stmt); | |
7773 | else | |
7774 | finish_try_block (stmt); | |
7775 | ||
fd10dd09 | 7776 | tsubst_expr (TRY_HANDLERS (t), args, complain, in_decl); |
84df082b MM |
7777 | if (FN_TRY_BLOCK_P (t)) |
7778 | finish_function_handler_sequence (stmt); | |
7779 | else | |
7780 | finish_handler_sequence (stmt); | |
f1dedc31 | 7781 | } |
faf5394a | 7782 | break; |
b35d4555 | 7783 | |
faf5394a | 7784 | case HANDLER: |
b35d4555 MM |
7785 | { |
7786 | tree decl; | |
b35d4555 MM |
7787 | |
7788 | prep_stmt (t); | |
7789 | stmt = begin_handler (); | |
7790 | if (HANDLER_PARMS (t)) | |
7791 | { | |
7792 | decl = DECL_STMT_DECL (HANDLER_PARMS (t)); | |
7793 | decl = tsubst (decl, args, complain, in_decl); | |
f8191e64 MM |
7794 | /* Prevent instantiate_decl from trying to instantiate |
7795 | this variable. We've already done all that needs to be | |
7796 | done. */ | |
7797 | DECL_TEMPLATE_INSTANTIATED (decl) = 1; | |
b35d4555 MM |
7798 | } |
7799 | else | |
7800 | decl = NULL_TREE; | |
1a6025b4 | 7801 | finish_handler_parms (decl, stmt); |
b35d4555 | 7802 | tsubst_expr (HANDLER_BODY (t), args, complain, in_decl); |
1a6025b4 | 7803 | finish_handler (stmt); |
b35d4555 | 7804 | } |
faf5394a MS |
7805 | break; |
7806 | ||
b87692e5 | 7807 | case TAG_DEFN: |
a7e4cfa0 | 7808 | prep_stmt (t); |
fd10dd09 | 7809 | tsubst (TREE_TYPE (t), args, complain, NULL_TREE); |
b87692e5 MS |
7810 | break; |
7811 | ||
5566b478 | 7812 | default: |
fd10dd09 | 7813 | abort (); |
5566b478 | 7814 | } |
fd10dd09 | 7815 | |
a5bcc582 | 7816 | return tsubst_expr (TREE_CHAIN (t), args, complain | stmt_expr, in_decl); |
8d08fdba MS |
7817 | } |
7818 | ||
b3445994 MM |
7819 | /* T is a postfix-expression that is not being used in a function |
7820 | call. Return the substituted version of T. */ | |
7821 | ||
7822 | static tree | |
7823 | tsubst_non_call_postfix_expression (tree t, tree args, | |
7824 | tsubst_flags_t complain, | |
7825 | tree in_decl) | |
7826 | { | |
7827 | if (TREE_CODE (t) == SCOPE_REF) | |
7828 | t = tsubst_qualified_id (t, args, complain, in_decl, | |
7829 | /*done=*/false, /*address_p=*/false); | |
7830 | else | |
7831 | t = tsubst_copy_and_build (t, args, complain, in_decl, | |
7832 | /*function_p=*/false); | |
7833 | ||
7834 | return t; | |
7835 | } | |
7836 | ||
cc23546e | 7837 | /* Like tsubst but deals with expressions and performs semantic |
b3445994 | 7838 | analysis. FUNCTION_P is true if T is the "F" in "F (ARGS)". */ |
cc23546e | 7839 | |
ee76b931 | 7840 | tree |
3a978d72 NN |
7841 | tsubst_copy_and_build (tree t, |
7842 | tree args, | |
7843 | tsubst_flags_t complain, | |
b3445994 MM |
7844 | tree in_decl, |
7845 | bool function_p) | |
cc23546e | 7846 | { |
b3445994 MM |
7847 | #define RECUR(NODE) \ |
7848 | tsubst_copy_and_build (NODE, args, complain, in_decl, /*function_p=*/false) | |
7849 | ||
ee76b931 MM |
7850 | tree op1; |
7851 | ||
cc23546e JO |
7852 | if (t == NULL_TREE || t == error_mark_node) |
7853 | return t; | |
7854 | ||
7855 | switch (TREE_CODE (t)) | |
7856 | { | |
399dedb9 NS |
7857 | case USING_DECL: |
7858 | t = DECL_NAME (t); | |
7859 | /* Fallthrough. */ | |
b3445994 | 7860 | case IDENTIFIER_NODE: |
cc23546e | 7861 | { |
b3445994 | 7862 | tree decl; |
b3445994 MM |
7863 | cp_id_kind idk; |
7864 | tree qualifying_class; | |
7865 | bool non_constant_expression_p; | |
7866 | const char *error_msg; | |
7867 | ||
b3445994 | 7868 | if (IDENTIFIER_TYPENAME_P (t)) |
cc23546e | 7869 | { |
b3445994 MM |
7870 | tree new_type = tsubst (TREE_TYPE (t), args, complain, in_decl); |
7871 | t = mangle_conv_op_name_for_type (new_type); | |
cc23546e | 7872 | } |
b3445994 MM |
7873 | |
7874 | /* Look up the name. */ | |
10b1d5e7 | 7875 | decl = lookup_name (t, 0); |
b3445994 MM |
7876 | |
7877 | /* By convention, expressions use ERROR_MARK_NODE to indicate | |
7878 | failure, not NULL_TREE. */ | |
7879 | if (decl == NULL_TREE) | |
7880 | decl = error_mark_node; | |
7881 | ||
10b1d5e7 | 7882 | decl = finish_id_expression (t, decl, NULL_TREE, |
b3445994 MM |
7883 | &idk, |
7884 | &qualifying_class, | |
7885 | /*constant_expression_p=*/false, | |
7886 | /*allow_non_constant_expression_p=*/false, | |
7887 | &non_constant_expression_p, | |
7888 | &error_msg); | |
7889 | if (error_msg) | |
7890 | error (error_msg); | |
7891 | if (!function_p && TREE_CODE (decl) == IDENTIFIER_NODE) | |
7892 | decl = unqualified_name_lookup_error (decl); | |
7893 | return decl; | |
cc23546e JO |
7894 | } |
7895 | ||
7896 | case TEMPLATE_ID_EXPR: | |
7897 | { | |
7898 | tree object; | |
b3445994 | 7899 | tree template = RECUR (TREE_OPERAND (t, 0)); |
bf12d54d NS |
7900 | tree targs = TREE_OPERAND (t, 1); |
7901 | ||
7902 | if (targs) | |
7903 | targs = tsubst_template_args (targs, args, complain, in_decl); | |
cc23546e JO |
7904 | |
7905 | if (TREE_CODE (template) == COMPONENT_REF) | |
7906 | { | |
7907 | object = TREE_OPERAND (template, 0); | |
7908 | template = TREE_OPERAND (template, 1); | |
7909 | } | |
7910 | else | |
7911 | object = NULL_TREE; | |
bd83b409 | 7912 | template = lookup_template_function (template, targs); |
cc23546e JO |
7913 | |
7914 | if (object) | |
7915 | return build (COMPONENT_REF, TREE_TYPE (template), | |
7916 | object, template); | |
7917 | else | |
7918 | return template; | |
7919 | } | |
7920 | ||
7921 | case INDIRECT_REF: | |
b3445994 | 7922 | return build_x_indirect_ref (RECUR (TREE_OPERAND (t, 0)), "unary *"); |
cc23546e JO |
7923 | |
7924 | case CAST_EXPR: | |
7925 | return build_functional_cast | |
7926 | (tsubst (TREE_TYPE (t), args, complain, in_decl), | |
b3445994 | 7927 | RECUR (TREE_OPERAND (t, 0))); |
cc23546e JO |
7928 | |
7929 | case REINTERPRET_CAST_EXPR: | |
7930 | return build_reinterpret_cast | |
7931 | (tsubst (TREE_TYPE (t), args, complain, in_decl), | |
b3445994 | 7932 | RECUR (TREE_OPERAND (t, 0))); |
cc23546e JO |
7933 | |
7934 | case CONST_CAST_EXPR: | |
7935 | return build_const_cast | |
7936 | (tsubst (TREE_TYPE (t), args, complain, in_decl), | |
b3445994 | 7937 | RECUR (TREE_OPERAND (t, 0))); |
cc23546e JO |
7938 | |
7939 | case DYNAMIC_CAST_EXPR: | |
7940 | return build_dynamic_cast | |
7941 | (tsubst (TREE_TYPE (t), args, complain, in_decl), | |
b3445994 | 7942 | RECUR (TREE_OPERAND (t, 0))); |
cc23546e JO |
7943 | |
7944 | case STATIC_CAST_EXPR: | |
7945 | return build_static_cast | |
7946 | (tsubst (TREE_TYPE (t), args, complain, in_decl), | |
b3445994 | 7947 | RECUR (TREE_OPERAND (t, 0))); |
cc23546e | 7948 | |
cc23546e JO |
7949 | case POSTDECREMENT_EXPR: |
7950 | case POSTINCREMENT_EXPR: | |
b3445994 MM |
7951 | op1 = tsubst_non_call_postfix_expression (TREE_OPERAND (t, 0), |
7952 | args, complain, in_decl); | |
ee76b931 MM |
7953 | return build_x_unary_op (TREE_CODE (t), op1); |
7954 | ||
7955 | case PREDECREMENT_EXPR: | |
7956 | case PREINCREMENT_EXPR: | |
cc23546e JO |
7957 | case NEGATE_EXPR: |
7958 | case BIT_NOT_EXPR: | |
cc23546e | 7959 | case ABS_EXPR: |
d17811fd MM |
7960 | case TRUTH_NOT_EXPR: |
7961 | case CONVERT_EXPR: /* Unary + */ | |
7962 | case REALPART_EXPR: | |
7963 | case IMAGPART_EXPR: | |
b3445994 | 7964 | return build_x_unary_op (TREE_CODE (t), RECUR (TREE_OPERAND (t, 0))); |
cc23546e | 7965 | |
cc23546e | 7966 | case ADDR_EXPR: |
ee76b931 MM |
7967 | op1 = TREE_OPERAND (t, 0); |
7968 | if (TREE_CODE (op1) == SCOPE_REF) | |
7969 | op1 = tsubst_qualified_id (op1, args, complain, in_decl, | |
7970 | /*done=*/true, /*address_p=*/true); | |
7971 | else | |
b3445994 MM |
7972 | op1 = tsubst_non_call_postfix_expression (op1, args, complain, |
7973 | in_decl); | |
fc2b8477 MM |
7974 | if (TREE_CODE (op1) == LABEL_DECL) |
7975 | return finish_label_address_expr (DECL_NAME (op1)); | |
ee76b931 MM |
7976 | return build_x_unary_op (ADDR_EXPR, op1); |
7977 | ||
cc23546e JO |
7978 | case PLUS_EXPR: |
7979 | case MINUS_EXPR: | |
7980 | case MULT_EXPR: | |
7981 | case TRUNC_DIV_EXPR: | |
7982 | case CEIL_DIV_EXPR: | |
7983 | case FLOOR_DIV_EXPR: | |
7984 | case ROUND_DIV_EXPR: | |
7985 | case EXACT_DIV_EXPR: | |
7986 | case BIT_AND_EXPR: | |
cc23546e JO |
7987 | case BIT_IOR_EXPR: |
7988 | case BIT_XOR_EXPR: | |
7989 | case TRUNC_MOD_EXPR: | |
7990 | case FLOOR_MOD_EXPR: | |
7991 | case TRUTH_ANDIF_EXPR: | |
7992 | case TRUTH_ORIF_EXPR: | |
7993 | case TRUTH_AND_EXPR: | |
7994 | case TRUTH_OR_EXPR: | |
7995 | case RSHIFT_EXPR: | |
7996 | case LSHIFT_EXPR: | |
7997 | case RROTATE_EXPR: | |
7998 | case LROTATE_EXPR: | |
7999 | case EQ_EXPR: | |
8000 | case NE_EXPR: | |
8001 | case MAX_EXPR: | |
8002 | case MIN_EXPR: | |
8003 | case LE_EXPR: | |
8004 | case GE_EXPR: | |
8005 | case LT_EXPR: | |
8006 | case GT_EXPR: | |
8007 | case MEMBER_REF: | |
b3445994 | 8008 | case DOTSTAR_EXPR: |
cc23546e JO |
8009 | return build_x_binary_op |
8010 | (TREE_CODE (t), | |
b3445994 MM |
8011 | RECUR (TREE_OPERAND (t, 0)), |
8012 | RECUR (TREE_OPERAND (t, 1))); | |
cc23546e JO |
8013 | |
8014 | case SCOPE_REF: | |
ee76b931 MM |
8015 | return tsubst_qualified_id (t, args, complain, in_decl, /*done=*/true, |
8016 | /*address_p=*/false); | |
cc23546e JO |
8017 | |
8018 | case ARRAY_REF: | |
ee76b931 MM |
8019 | if (tsubst_copy (TREE_OPERAND (t, 0), args, complain, in_decl) |
8020 | == NULL_TREE) | |
8021 | /* new-type-id */ | |
b3445994 | 8022 | return build_nt (ARRAY_REF, NULL_TREE, RECUR (TREE_OPERAND (t, 1))); |
ee76b931 | 8023 | |
b3445994 MM |
8024 | op1 = tsubst_non_call_postfix_expression (TREE_OPERAND (t, 0), |
8025 | args, complain, in_decl); | |
ee76b931 MM |
8026 | /* Remember that there was a reference to this entity. */ |
8027 | if (DECL_P (op1)) | |
8028 | mark_used (op1); | |
b3445994 | 8029 | return grok_array_decl (op1, RECUR (TREE_OPERAND (t, 1))); |
cc23546e JO |
8030 | |
8031 | case SIZEOF_EXPR: | |
8032 | case ALIGNOF_EXPR: | |
d17811fd MM |
8033 | op1 = TREE_OPERAND (t, 0); |
8034 | if (!args) | |
8035 | { | |
8036 | /* When there are no ARGS, we are trying to evaluate a | |
8037 | non-dependent expression from the parser. Trying to do | |
8038 | the substitutions may not work. */ | |
8039 | if (!TYPE_P (op1)) | |
8040 | op1 = TREE_TYPE (op1); | |
8041 | } | |
8042 | else | |
8043 | { | |
8044 | ++skip_evaluation; | |
b3445994 | 8045 | op1 = RECUR (op1); |
d17811fd MM |
8046 | --skip_evaluation; |
8047 | } | |
8048 | if (TREE_CODE (t) == SIZEOF_EXPR) | |
8049 | return finish_sizeof (op1); | |
8050 | else | |
8051 | return finish_alignof (op1); | |
cc23546e JO |
8052 | |
8053 | case MODOP_EXPR: | |
8054 | return build_x_modify_expr | |
b3445994 | 8055 | (RECUR (TREE_OPERAND (t, 0)), |
cc23546e | 8056 | TREE_CODE (TREE_OPERAND (t, 1)), |
b3445994 | 8057 | RECUR (TREE_OPERAND (t, 2))); |
cc23546e JO |
8058 | |
8059 | case ARROW_EXPR: | |
b3445994 MM |
8060 | op1 = tsubst_non_call_postfix_expression (TREE_OPERAND (t, 0), |
8061 | args, complain, in_decl); | |
ee76b931 MM |
8062 | /* Remember that there was a reference to this entity. */ |
8063 | if (DECL_P (op1)) | |
8064 | mark_used (op1); | |
8065 | return build_x_arrow (op1); | |
cc23546e JO |
8066 | |
8067 | case NEW_EXPR: | |
8068 | return build_new | |
b3445994 MM |
8069 | (RECUR (TREE_OPERAND (t, 0)), |
8070 | RECUR (TREE_OPERAND (t, 1)), | |
8071 | RECUR (TREE_OPERAND (t, 2)), | |
cc23546e JO |
8072 | NEW_EXPR_USE_GLOBAL (t)); |
8073 | ||
8074 | case DELETE_EXPR: | |
8075 | return delete_sanity | |
b3445994 MM |
8076 | (RECUR (TREE_OPERAND (t, 0)), |
8077 | RECUR (TREE_OPERAND (t, 1)), | |
cc23546e JO |
8078 | DELETE_EXPR_USE_VEC (t), |
8079 | DELETE_EXPR_USE_GLOBAL (t)); | |
8080 | ||
8081 | case COMPOUND_EXPR: | |
b3445994 MM |
8082 | return build_x_compound_expr (RECUR (TREE_OPERAND (t, 0)), |
8083 | RECUR (TREE_OPERAND (t, 1))); | |
cc23546e | 8084 | |
ee76b931 | 8085 | case CALL_EXPR: |
cc23546e | 8086 | { |
ee76b931 MM |
8087 | tree function; |
8088 | tree call_args; | |
ee76b931 | 8089 | bool qualified_p; |
ee935db4 | 8090 | bool koenig_p; |
ee76b931 MM |
8091 | |
8092 | function = TREE_OPERAND (t, 0); | |
ee935db4 MM |
8093 | /* To determine whether or not we should perform Koenig lookup |
8094 | we must look at the form of the FUNCTION. */ | |
8095 | koenig_p = !(/* Koenig lookup does not apply to qualified | |
8096 | names. */ | |
8097 | TREE_CODE (function) == SCOPE_REF | |
8098 | /* Or to references to members of classes. */ | |
8099 | || TREE_CODE (function) == COMPONENT_REF | |
8100 | /* If it is a FUNCTION_DECL or a baselink, then | |
8101 | the name was already resolved when the | |
8102 | template was parsed. */ | |
8103 | || TREE_CODE (function) == FUNCTION_DECL | |
8104 | || TREE_CODE (function) == BASELINK); | |
ee76b931 | 8105 | if (TREE_CODE (function) == SCOPE_REF) |
cc23546e | 8106 | { |
ee76b931 MM |
8107 | qualified_p = true; |
8108 | function = tsubst_qualified_id (function, args, complain, in_decl, | |
8109 | /*done=*/false, | |
8110 | /*address_p=*/false); | |
cc23546e | 8111 | } |
ee76b931 | 8112 | else |
cc23546e | 8113 | { |
ee76b931 MM |
8114 | qualified_p = (TREE_CODE (function) == COMPONENT_REF |
8115 | && (TREE_CODE (TREE_OPERAND (function, 1)) | |
8116 | == SCOPE_REF)); | |
8117 | function = tsubst_copy_and_build (function, args, complain, | |
b3445994 MM |
8118 | in_decl, |
8119 | !qualified_p); | |
cc23546e | 8120 | } |
cc23546e | 8121 | |
b3445994 | 8122 | call_args = RECUR (TREE_OPERAND (t, 1)); |
bbaab916 NS |
8123 | |
8124 | if (BASELINK_P (function)) | |
d17811fd MM |
8125 | qualified_p = 1; |
8126 | ||
ee935db4 | 8127 | if (koenig_p |
b3445994 MM |
8128 | && TREE_CODE (function) != TEMPLATE_ID_EXPR |
8129 | && (is_overloaded_fn (function) | |
8130 | || DECL_P (function) | |
8131 | || TREE_CODE (function) == IDENTIFIER_NODE)) | |
8132 | { | |
8133 | if (call_args) | |
8134 | function = perform_koenig_lookup (function, call_args); | |
8135 | else if (TREE_CODE (function) == IDENTIFIER_NODE) | |
8136 | function = unqualified_name_lookup_error (function); | |
8137 | } | |
8138 | ||
8139 | /* Remember that there was a reference to this entity. */ | |
8140 | if (DECL_P (function)) | |
8141 | mark_used (function); | |
8142 | ||
8143 | function = convert_from_reference (function); | |
d17811fd MM |
8144 | |
8145 | if (TREE_CODE (function) == OFFSET_REF) | |
8146 | return build_offset_ref_call_from_tree (function, call_args); | |
8147 | if (TREE_CODE (function) == COMPONENT_REF) | |
8148 | return (build_new_method_call | |
8149 | (TREE_OPERAND (function, 0), | |
8150 | TREE_OPERAND (function, 1), | |
8151 | call_args, NULL_TREE, | |
8152 | qualified_p ? LOOKUP_NONVIRTUAL : LOOKUP_NORMAL)); | |
8153 | return finish_call_expr (function, call_args, | |
8154 | /*disallow_virtual=*/qualified_p); | |
cc23546e JO |
8155 | } |
8156 | ||
8157 | case COND_EXPR: | |
8158 | return build_x_conditional_expr | |
b3445994 MM |
8159 | (RECUR (TREE_OPERAND (t, 0)), |
8160 | RECUR (TREE_OPERAND (t, 1)), | |
8161 | RECUR (TREE_OPERAND (t, 2))); | |
cc23546e JO |
8162 | |
8163 | case PSEUDO_DTOR_EXPR: | |
8164 | return finish_pseudo_destructor_expr | |
b3445994 MM |
8165 | (RECUR (TREE_OPERAND (t, 0)), |
8166 | RECUR (TREE_OPERAND (t, 1)), | |
8167 | RECUR (TREE_OPERAND (t, 2))); | |
cc23546e JO |
8168 | |
8169 | case TREE_LIST: | |
8170 | { | |
8171 | tree purpose, value, chain; | |
8172 | ||
8173 | if (t == void_list_node) | |
8174 | return t; | |
8175 | ||
8176 | purpose = TREE_PURPOSE (t); | |
8177 | if (purpose) | |
b3445994 | 8178 | purpose = RECUR (purpose); |
cc23546e JO |
8179 | value = TREE_VALUE (t); |
8180 | if (value) | |
b3445994 | 8181 | value = RECUR (value); |
cc23546e JO |
8182 | chain = TREE_CHAIN (t); |
8183 | if (chain && chain != void_type_node) | |
b3445994 | 8184 | chain = RECUR (chain); |
cc23546e JO |
8185 | if (purpose == TREE_PURPOSE (t) |
8186 | && value == TREE_VALUE (t) | |
8187 | && chain == TREE_CHAIN (t)) | |
8188 | return t; | |
8189 | return tree_cons (purpose, value, chain); | |
8190 | } | |
8191 | ||
8192 | case COMPONENT_REF: | |
8193 | { | |
ee76b931 MM |
8194 | tree object; |
8195 | tree member; | |
8196 | ||
b3445994 MM |
8197 | object = tsubst_non_call_postfix_expression (TREE_OPERAND (t, 0), |
8198 | args, complain, in_decl); | |
ee76b931 MM |
8199 | /* Remember that there was a reference to this entity. */ |
8200 | if (DECL_P (object)) | |
8201 | mark_used (object); | |
8202 | ||
8203 | member = TREE_OPERAND (t, 1); | |
8204 | if (BASELINK_P (member)) | |
8205 | member = tsubst_baselink (member, | |
8206 | non_reference (TREE_TYPE (object)), | |
8207 | args, complain, in_decl); | |
8208 | else | |
8209 | member = tsubst_copy (member, args, complain, in_decl); | |
cc23546e JO |
8210 | |
8211 | if (!CLASS_TYPE_P (TREE_TYPE (object))) | |
8212 | { | |
8213 | if (TREE_CODE (member) == BIT_NOT_EXPR) | |
8214 | return finish_pseudo_destructor_expr (object, | |
8215 | NULL_TREE, | |
8216 | TREE_TYPE (object)); | |
8217 | else if (TREE_CODE (member) == SCOPE_REF | |
8218 | && (TREE_CODE (TREE_OPERAND (member, 1)) == BIT_NOT_EXPR)) | |
8219 | return finish_pseudo_destructor_expr (object, | |
8220 | object, | |
8221 | TREE_TYPE (object)); | |
8222 | } | |
8223 | else if (TREE_CODE (member) == SCOPE_REF | |
8224 | && TREE_CODE (TREE_OPERAND (member, 1)) == TEMPLATE_ID_EXPR) | |
8225 | { | |
8226 | tree tmpl; | |
8227 | tree args; | |
8228 | ||
8229 | /* Lookup the template functions now that we know what the | |
8230 | scope is. */ | |
8231 | tmpl = TREE_OPERAND (TREE_OPERAND (member, 1), 0); | |
8232 | args = TREE_OPERAND (TREE_OPERAND (member, 1), 1); | |
22038b2c NS |
8233 | member = lookup_qualified_name (TREE_OPERAND (member, 0), tmpl, |
8234 | /*is_type=*/0, /*complain=*/false); | |
cc23546e JO |
8235 | if (BASELINK_P (member)) |
8236 | BASELINK_FUNCTIONS (member) | |
8237 | = build_nt (TEMPLATE_ID_EXPR, BASELINK_FUNCTIONS (member), | |
8238 | args); | |
8239 | else | |
8240 | { | |
22038b2c | 8241 | qualified_name_lookup_error (TREE_TYPE (object), tmpl); |
cc23546e JO |
8242 | return error_mark_node; |
8243 | } | |
8244 | } | |
a3f10e50 NS |
8245 | else if (TREE_CODE (member) == FIELD_DECL) |
8246 | return finish_non_static_data_member (member, object, NULL_TREE); | |
cc23546e JO |
8247 | |
8248 | return finish_class_member_access_expr (object, member); | |
8249 | } | |
8250 | ||
8251 | case THROW_EXPR: | |
8252 | return build_throw | |
b3445994 | 8253 | (RECUR (TREE_OPERAND (t, 0))); |
cc23546e JO |
8254 | |
8255 | case CONSTRUCTOR: | |
8256 | { | |
8257 | tree r; | |
8258 | tree elts; | |
8259 | tree type = tsubst (TREE_TYPE (t), args, complain, in_decl); | |
8260 | bool purpose_p; | |
8261 | ||
8262 | /* digest_init will do the wrong thing if we let it. */ | |
8263 | if (type && TYPE_PTRMEMFUNC_P (type)) | |
8264 | return t; | |
8265 | ||
8266 | r = NULL_TREE; | |
8267 | /* We do not want to process the purpose of aggregate | |
8268 | initializers as they are identifier nodes which will be | |
8269 | looked up by digest_init. */ | |
8270 | purpose_p = !(type && IS_AGGR_TYPE (type)); | |
db77ef4c | 8271 | for (elts = CONSTRUCTOR_ELTS (t); |
cc23546e JO |
8272 | elts; |
8273 | elts = TREE_CHAIN (elts)) | |
8274 | { | |
8275 | tree purpose = TREE_PURPOSE (elts); | |
8276 | tree value = TREE_VALUE (elts); | |
8277 | ||
8278 | if (purpose && purpose_p) | |
b3445994 MM |
8279 | purpose = RECUR (purpose); |
8280 | value = RECUR (value); | |
cc23546e JO |
8281 | r = tree_cons (purpose, value, r); |
8282 | } | |
8283 | ||
dcf92453 | 8284 | r = build_constructor (NULL_TREE, nreverse (r)); |
cc23546e JO |
8285 | TREE_HAS_CONSTRUCTOR (r) = TREE_HAS_CONSTRUCTOR (t); |
8286 | ||
8287 | if (type) | |
8288 | return digest_init (type, r, 0); | |
8289 | return r; | |
8290 | } | |
8291 | ||
8292 | case TYPEID_EXPR: | |
8293 | { | |
b3445994 | 8294 | tree operand_0 = RECUR (TREE_OPERAND (t, 0)); |
cc23546e JO |
8295 | if (TYPE_P (operand_0)) |
8296 | return get_typeid (operand_0); | |
8297 | return build_typeid (operand_0); | |
8298 | } | |
8299 | ||
8300 | case PARM_DECL: | |
8301 | return convert_from_reference (tsubst_copy (t, args, complain, in_decl)); | |
8302 | ||
8303 | case VAR_DECL: | |
ee76b931 MM |
8304 | if (args) |
8305 | t = tsubst_copy (t, args, complain, in_decl); | |
d17811fd MM |
8306 | else |
8307 | /* If there are no ARGS, then we are evaluating a | |
8308 | non-dependent expression. If the expression is | |
8309 | non-dependent, the variable must be a constant. */ | |
8310 | t = DECL_INITIAL (t); | |
ee76b931 | 8311 | return convert_from_reference (t); |
cc23546e JO |
8312 | |
8313 | case VA_ARG_EXPR: | |
b3445994 MM |
8314 | return build_x_va_arg (RECUR (TREE_OPERAND (t, 0)), |
8315 | tsubst_copy (TREE_TYPE (t), args, complain, | |
8316 | in_decl)); | |
cc23546e JO |
8317 | |
8318 | default: | |
8319 | return tsubst_copy (t, args, complain, in_decl); | |
8320 | } | |
b3445994 MM |
8321 | |
8322 | #undef RECUR | |
cc23546e JO |
8323 | } |
8324 | ||
3e4a3562 NS |
8325 | /* Verify that the instantiated ARGS are valid. For type arguments, |
8326 | make sure that the type's linkage is ok. For non-type arguments, | |
34cd5ae7 | 8327 | make sure they are constants if they are integral or enumerations. |
9bcb9aae | 8328 | Emit an error under control of COMPLAIN, and return TRUE on error. */ |
3e4a3562 NS |
8329 | |
8330 | static bool | |
3a978d72 | 8331 | check_instantiated_args (tree tmpl, tree args, tsubst_flags_t complain) |
3e4a3562 NS |
8332 | { |
8333 | int ix, len = DECL_NTPARMS (tmpl); | |
8334 | bool result = false; | |
8335 | ||
8336 | for (ix = 0; ix != len; ix++) | |
8337 | { | |
8338 | tree t = TREE_VEC_ELT (args, ix); | |
8339 | ||
8340 | if (TYPE_P (t)) | |
8341 | { | |
8342 | /* [basic.link]: A name with no linkage (notably, the name | |
8343 | of a class or enumeration declared in a local scope) | |
8344 | shall not be used to declare an entity with linkage. | |
8345 | This implies that names with no linkage cannot be used as | |
8346 | template arguments. */ | |
8347 | tree nt = no_linkage_check (t); | |
8348 | ||
8349 | if (nt) | |
8350 | { | |
8351 | if (!(complain & tf_error)) | |
8352 | /*OK*/; | |
8353 | else if (TYPE_ANONYMOUS_P (nt)) | |
8354 | error ("`%T' uses anonymous type", t); | |
8355 | else | |
8356 | error ("`%T' uses local type `%T'", t, nt); | |
8357 | result = true; | |
8358 | } | |
8359 | /* In order to avoid all sorts of complications, we do not | |
8360 | allow variably-modified types as template arguments. */ | |
8361 | else if (variably_modified_type_p (t)) | |
8362 | { | |
8363 | if (complain & tf_error) | |
8364 | error ("`%T' is a variably modified type", t); | |
8365 | result = true; | |
8366 | } | |
8367 | } | |
8368 | /* A non-type argument of integral or enumerated type must be a | |
8369 | constant. */ | |
8370 | else if (TREE_TYPE (t) | |
8371 | && INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (t)) | |
8372 | && !TREE_CONSTANT (t)) | |
8373 | { | |
8374 | if (complain & tf_error) | |
8375 | error ("integral expression `%E' is not constant", t); | |
8376 | result = true; | |
8377 | } | |
8378 | } | |
8379 | if (result && complain & tf_error) | |
8380 | error (" trying to instantiate `%D'", tmpl); | |
8381 | return result; | |
8382 | } | |
8383 | ||
6ba89f8e | 8384 | /* Instantiate the indicated variable or function template TMPL with |
36a117a5 MM |
8385 | the template arguments in TARG_PTR. */ |
8386 | ||
5566b478 | 8387 | tree |
3a978d72 | 8388 | instantiate_template (tree tmpl, tree targ_ptr, tsubst_flags_t complain) |
8d08fdba | 8389 | { |
5566b478 | 8390 | tree fndecl; |
36a117a5 MM |
8391 | tree gen_tmpl; |
8392 | tree spec; | |
5566b478 | 8393 | |
27fafc8d JM |
8394 | if (tmpl == error_mark_node) |
8395 | return error_mark_node; | |
8396 | ||
386b8a85 JM |
8397 | my_friendly_assert (TREE_CODE (tmpl) == TEMPLATE_DECL, 283); |
8398 | ||
db9b2174 MM |
8399 | /* If this function is a clone, handle it specially. */ |
8400 | if (DECL_CLONED_FUNCTION_P (tmpl)) | |
3ad97789 | 8401 | { |
3e4a3562 NS |
8402 | tree spec = instantiate_template (DECL_CLONED_FUNCTION (tmpl), targ_ptr, |
8403 | complain); | |
3ad97789 NS |
8404 | tree clone; |
8405 | ||
c6002625 | 8406 | /* Look for the clone. */ |
3ad97789 NS |
8407 | for (clone = TREE_CHAIN (spec); |
8408 | clone && DECL_CLONED_FUNCTION_P (clone); | |
8409 | clone = TREE_CHAIN (clone)) | |
8410 | if (DECL_NAME (clone) == DECL_NAME (tmpl)) | |
8411 | return clone; | |
8412 | /* We should always have found the clone by now. */ | |
a98facb0 | 8413 | abort (); |
3ad97789 NS |
8414 | return NULL_TREE; |
8415 | } | |
8416 | ||
36a117a5 MM |
8417 | /* Check to see if we already have this specialization. */ |
8418 | spec = retrieve_specialization (tmpl, targ_ptr); | |
8419 | if (spec != NULL_TREE) | |
8420 | return spec; | |
8421 | ||
f9a7ae04 MM |
8422 | gen_tmpl = most_general_template (tmpl); |
8423 | if (tmpl != gen_tmpl) | |
386b8a85 | 8424 | { |
36a117a5 MM |
8425 | /* The TMPL is a partial instantiation. To get a full set of |
8426 | arguments we must add the arguments used to perform the | |
8427 | partial instantiation. */ | |
8428 | targ_ptr = add_outermost_template_args (DECL_TI_ARGS (tmpl), | |
8429 | targ_ptr); | |
36a117a5 MM |
8430 | |
8431 | /* Check to see if we already have this specialization. */ | |
8432 | spec = retrieve_specialization (gen_tmpl, targ_ptr); | |
75650646 MM |
8433 | if (spec != NULL_TREE) |
8434 | return spec; | |
386b8a85 JM |
8435 | } |
8436 | ||
3e4a3562 NS |
8437 | if (check_instantiated_args (gen_tmpl, INNERMOST_TEMPLATE_ARGS (targ_ptr), |
8438 | complain)) | |
8439 | return error_mark_node; | |
8440 | ||
2b907f5c KL |
8441 | /* We are building a FUNCTION_DECL, during which the access of its |
8442 | parameters and return types have to be checked. However this | |
8443 | FUNCTION_DECL which is the desired context for access checking | |
8444 | is not built yet. We solve this chicken-and-egg problem by | |
8445 | deferring all checks until we have the FUNCTION_DECL. */ | |
8446 | push_deferring_access_checks (dk_deferred); | |
5c74d5b0 | 8447 | |
5566b478 | 8448 | /* substitute template parameters */ |
17aec3eb | 8449 | fndecl = tsubst (DECL_TEMPLATE_RESULT (gen_tmpl), |
3e4a3562 | 8450 | targ_ptr, complain, gen_tmpl); |
5c74d5b0 | 8451 | |
2b907f5c KL |
8452 | /* Now we know the specialization, compute access previously |
8453 | deferred. */ | |
8454 | push_access_scope (fndecl); | |
8455 | perform_deferred_access_checks (); | |
8456 | pop_access_scope (fndecl); | |
8457 | pop_deferring_access_checks (); | |
5c74d5b0 | 8458 | |
36a117a5 MM |
8459 | /* The DECL_TI_TEMPLATE should always be the immediate parent |
8460 | template, not the most general template. */ | |
8461 | DECL_TI_TEMPLATE (fndecl) = tmpl; | |
8d08fdba | 8462 | |
824b9a4c MS |
8463 | if (flag_external_templates) |
8464 | add_pending_template (fndecl); | |
8465 | ||
94350948 | 8466 | /* If we've just instantiated the main entry point for a function, |
3ad97789 NS |
8467 | instantiate all the alternate entry points as well. We do this |
8468 | by cloning the instantiation of the main entry point, not by | |
8469 | instantiating the template clones. */ | |
8470 | if (TREE_CHAIN (gen_tmpl) && DECL_CLONED_FUNCTION_P (TREE_CHAIN (gen_tmpl))) | |
8471 | clone_function_decl (fndecl, /*update_method_vec_p=*/0); | |
94350948 | 8472 | |
5566b478 | 8473 | return fndecl; |
8d08fdba | 8474 | } |
5566b478 | 8475 | |
4393e105 MM |
8476 | /* The FN is a TEMPLATE_DECL for a function. The ARGS are the |
8477 | arguments that are being used when calling it. TARGS is a vector | |
8478 | into which the deduced template arguments are placed. | |
8d08fdba MS |
8479 | |
8480 | Return zero for success, 2 for an incomplete match that doesn't resolve | |
8481 | all the types, and 1 for complete failure. An error message will be | |
8482 | printed only for an incomplete match. | |
8483 | ||
e5214479 JM |
8484 | If FN is a conversion operator, or we are trying to produce a specific |
8485 | specialization, RETURN_TYPE is the return type desired. | |
9f54c803 MM |
8486 | |
8487 | The EXPLICIT_TARGS are explicit template arguments provided via a | |
8488 | template-id. | |
6467930b | 8489 | |
830bfa74 MM |
8490 | The parameter STRICT is one of: |
8491 | ||
8492 | DEDUCE_CALL: | |
8493 | We are deducing arguments for a function call, as in | |
8494 | [temp.deduct.call]. | |
8495 | ||
8496 | DEDUCE_CONV: | |
8497 | We are deducing arguments for a conversion function, as in | |
8498 | [temp.deduct.conv]. | |
8499 | ||
8500 | DEDUCE_EXACT: | |
62e4a758 NS |
8501 | We are deducing arguments when doing an explicit instantiation |
8502 | as in [temp.explicit], when determining an explicit specialization | |
8503 | as in [temp.expl.spec], or when taking the address of a function | |
8504 | template, as in [temp.deduct.funcaddr]. | |
8505 | ||
8506 | DEDUCE_ORDER: | |
830bfa74 MM |
8507 | We are deducing arguments when calculating the partial |
8508 | ordering between specializations of function or class | |
62e4a758 | 8509 | templates, as in [temp.func.order] and [temp.class.order]. |
4393e105 | 8510 | |
e5214479 JM |
8511 | LEN is the number of parms to consider before returning success, or -1 |
8512 | for all. This is used in partial ordering to avoid comparing parms for | |
8513 | which no actual argument was passed, since they are not considered in | |
8514 | overload resolution (and are explicitly excluded from consideration in | |
8515 | partial ordering in [temp.func.order]/6). */ | |
8d08fdba MS |
8516 | |
8517 | int | |
3a978d72 NN |
8518 | fn_type_unification (tree fn, |
8519 | tree explicit_targs, | |
8520 | tree targs, | |
8521 | tree args, | |
8522 | tree return_type, | |
8523 | unification_kind_t strict, | |
8524 | int len) | |
386b8a85 | 8525 | { |
4393e105 MM |
8526 | tree parms; |
8527 | tree fntype; | |
adecb3f4 | 8528 | int result; |
386b8a85 | 8529 | |
4393e105 | 8530 | my_friendly_assert (TREE_CODE (fn) == TEMPLATE_DECL, 0); |
2b59fc25 | 8531 | |
4393e105 MM |
8532 | fntype = TREE_TYPE (fn); |
8533 | if (explicit_targs) | |
75650646 | 8534 | { |
4393e105 MM |
8535 | /* [temp.deduct] |
8536 | ||
8537 | The specified template arguments must match the template | |
8538 | parameters in kind (i.e., type, nontype, template), and there | |
8539 | must not be more arguments than there are parameters; | |
8540 | otherwise type deduction fails. | |
8541 | ||
8542 | Nontype arguments must match the types of the corresponding | |
8543 | nontype template parameters, or must be convertible to the | |
8544 | types of the corresponding nontype parameters as specified in | |
8545 | _temp.arg.nontype_, otherwise type deduction fails. | |
8546 | ||
8547 | All references in the function type of the function template | |
8548 | to the corresponding template parameters are replaced by the | |
8549 | specified template argument values. If a substitution in a | |
8550 | template parameter or in the function type of the function | |
8551 | template results in an invalid type, type deduction fails. */ | |
8552 | int i; | |
8553 | tree converted_args; | |
ffd49b19 | 8554 | bool incomplete; |
75650646 | 8555 | |
4393e105 MM |
8556 | converted_args |
8557 | = (coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (fn), | |
c2ea3a40 | 8558 | explicit_targs, NULL_TREE, tf_none, |
4393e105 MM |
8559 | /*require_all_arguments=*/0)); |
8560 | if (converted_args == error_mark_node) | |
75650646 | 8561 | return 1; |
386b8a85 | 8562 | |
ffd49b19 NS |
8563 | /* Substitute the explicit args into the function type. This is |
8564 | necessary so that, for instance, explicitly declared function | |
8565 | arguments can match null pointed constants. If we were given | |
8566 | an incomplete set of explicit args, we must not do semantic | |
8567 | processing during substitution as we could create partial | |
8568 | instantiations. */ | |
8569 | incomplete = NUM_TMPL_ARGS (explicit_targs) != NUM_TMPL_ARGS (targs); | |
8570 | processing_template_decl += incomplete; | |
c2ea3a40 | 8571 | fntype = tsubst (fntype, converted_args, tf_none, NULL_TREE); |
ffd49b19 NS |
8572 | processing_template_decl -= incomplete; |
8573 | ||
4393e105 MM |
8574 | if (fntype == error_mark_node) |
8575 | return 1; | |
050367a3 | 8576 | |
4393e105 | 8577 | /* Place the explicitly specified arguments in TARGS. */ |
ffd49b19 | 8578 | for (i = NUM_TMPL_ARGS (converted_args); i--;) |
4393e105 | 8579 | TREE_VEC_ELT (targs, i) = TREE_VEC_ELT (converted_args, i); |
75650646 | 8580 | } |
4393e105 MM |
8581 | |
8582 | parms = TYPE_ARG_TYPES (fntype); | |
e5214479 JM |
8583 | /* Never do unification on the 'this' parameter. */ |
8584 | if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fn)) | |
8585 | parms = TREE_CHAIN (parms); | |
8d3631f8 NS |
8586 | |
8587 | if (return_type) | |
8588 | { | |
8589 | /* We've been given a return type to match, prepend it. */ | |
8590 | parms = tree_cons (NULL_TREE, TREE_TYPE (fntype), parms); | |
8591 | args = tree_cons (NULL_TREE, return_type, args); | |
16e42e7c JM |
8592 | if (len >= 0) |
8593 | ++len; | |
4393e105 MM |
8594 | } |
8595 | ||
4393e105 MM |
8596 | /* We allow incomplete unification without an error message here |
8597 | because the standard doesn't seem to explicitly prohibit it. Our | |
8598 | callers must be ready to deal with unification failures in any | |
8599 | event. */ | |
adecb3f4 MM |
8600 | result = type_unification_real (DECL_INNERMOST_TEMPLATE_PARMS (fn), |
8601 | targs, parms, args, /*subr=*/0, | |
e5214479 | 8602 | strict, /*allow_incomplete*/1, len); |
adecb3f4 MM |
8603 | |
8604 | if (result == 0) | |
8605 | /* All is well so far. Now, check: | |
8606 | ||
8607 | [temp.deduct] | |
8608 | ||
8609 | When all template arguments have been deduced, all uses of | |
8610 | template parameters in nondeduced contexts are replaced with | |
8611 | the corresponding deduced argument values. If the | |
8612 | substitution results in an invalid type, as described above, | |
8613 | type deduction fails. */ | |
c2ea3a40 | 8614 | if (tsubst (TREE_TYPE (fn), targs, tf_none, NULL_TREE) |
adecb3f4 MM |
8615 | == error_mark_node) |
8616 | return 1; | |
8617 | ||
8618 | return result; | |
830bfa74 MM |
8619 | } |
8620 | ||
8621 | /* Adjust types before performing type deduction, as described in | |
8622 | [temp.deduct.call] and [temp.deduct.conv]. The rules in these two | |
4c7d0dff MM |
8623 | sections are symmetric. PARM is the type of a function parameter |
8624 | or the return type of the conversion function. ARG is the type of | |
8625 | the argument passed to the call, or the type of the value | |
dc957d14 | 8626 | initialized with the result of the conversion function. */ |
386b8a85 | 8627 | |
62e4a758 | 8628 | static int |
3a978d72 NN |
8629 | maybe_adjust_types_for_deduction (unification_kind_t strict, |
8630 | tree* parm, | |
8631 | tree* arg) | |
830bfa74 | 8632 | { |
62e4a758 NS |
8633 | int result = 0; |
8634 | ||
830bfa74 MM |
8635 | switch (strict) |
8636 | { | |
8637 | case DEDUCE_CALL: | |
8638 | break; | |
8639 | ||
8640 | case DEDUCE_CONV: | |
8641 | { | |
4c7d0dff MM |
8642 | /* Swap PARM and ARG throughout the remainder of this |
8643 | function; the handling is precisely symmetric since PARM | |
8644 | will initialize ARG rather than vice versa. */ | |
830bfa74 MM |
8645 | tree* temp = parm; |
8646 | parm = arg; | |
8647 | arg = temp; | |
8648 | break; | |
8649 | } | |
8650 | ||
8651 | case DEDUCE_EXACT: | |
8652 | /* There is nothing to do in this case. */ | |
62e4a758 | 8653 | return 0; |
830bfa74 | 8654 | |
62e4a758 NS |
8655 | case DEDUCE_ORDER: |
8656 | /* DR 214. [temp.func.order] is underspecified, and leads to no | |
8657 | ordering between things like `T *' and `T const &' for `U *'. | |
8658 | The former has T=U and the latter T=U*. The former looks more | |
8659 | specialized and John Spicer considers it well-formed (the EDG | |
8660 | compiler accepts it). | |
8661 | ||
8662 | John also confirms that deduction should proceed as in a function | |
996065b4 | 8663 | call. Which implies the usual ARG and PARM conversions as DEDUCE_CALL. |
62e4a758 NS |
8664 | However, in ordering, ARG can have REFERENCE_TYPE, but no argument |
8665 | to an actual call can have such a type. | |
8666 | ||
996065b4 NS |
8667 | If both ARG and PARM are REFERENCE_TYPE, we change neither. |
8668 | If only ARG is a REFERENCE_TYPE, we look through that and then | |
8669 | proceed as with DEDUCE_CALL (which could further convert it). */ | |
62e4a758 NS |
8670 | if (TREE_CODE (*arg) == REFERENCE_TYPE) |
8671 | { | |
8672 | if (TREE_CODE (*parm) == REFERENCE_TYPE) | |
8673 | return 0; | |
8674 | *arg = TREE_TYPE (*arg); | |
62e4a758 NS |
8675 | } |
8676 | break; | |
830bfa74 | 8677 | default: |
a98facb0 | 8678 | abort (); |
830bfa74 MM |
8679 | } |
8680 | ||
8681 | if (TREE_CODE (*parm) != REFERENCE_TYPE) | |
8682 | { | |
8683 | /* [temp.deduct.call] | |
8684 | ||
8685 | If P is not a reference type: | |
8686 | ||
8687 | --If A is an array type, the pointer type produced by the | |
8688 | array-to-pointer standard conversion (_conv.array_) is | |
8689 | used in place of A for type deduction; otherwise, | |
8690 | ||
8691 | --If A is a function type, the pointer type produced by | |
8692 | the function-to-pointer standard conversion | |
8693 | (_conv.func_) is used in place of A for type deduction; | |
8694 | otherwise, | |
8695 | ||
8696 | --If A is a cv-qualified type, the top level | |
8697 | cv-qualifiers of A's type are ignored for type | |
8698 | deduction. */ | |
8699 | if (TREE_CODE (*arg) == ARRAY_TYPE) | |
8700 | *arg = build_pointer_type (TREE_TYPE (*arg)); | |
d8f8dca1 | 8701 | else if (TREE_CODE (*arg) == FUNCTION_TYPE) |
830bfa74 MM |
8702 | *arg = build_pointer_type (*arg); |
8703 | else | |
8704 | *arg = TYPE_MAIN_VARIANT (*arg); | |
8705 | } | |
8706 | ||
8707 | /* [temp.deduct.call] | |
8708 | ||
8709 | If P is a cv-qualified type, the top level cv-qualifiers | |
8710 | of P's type are ignored for type deduction. If P is a | |
8711 | reference type, the type referred to by P is used for | |
8712 | type deduction. */ | |
8713 | *parm = TYPE_MAIN_VARIANT (*parm); | |
8714 | if (TREE_CODE (*parm) == REFERENCE_TYPE) | |
62e4a758 NS |
8715 | { |
8716 | *parm = TREE_TYPE (*parm); | |
8717 | result |= UNIFY_ALLOW_OUTER_MORE_CV_QUAL; | |
8718 | } | |
1c82cc90 NS |
8719 | |
8720 | /* DR 322. For conversion deduction, remove a reference type on parm | |
8721 | too (which has been swapped into ARG). */ | |
8722 | if (strict == DEDUCE_CONV && TREE_CODE (*arg) == REFERENCE_TYPE) | |
8723 | *arg = TREE_TYPE (*arg); | |
8724 | ||
62e4a758 | 8725 | return result; |
386b8a85 JM |
8726 | } |
8727 | ||
e5214479 | 8728 | /* Most parms like fn_type_unification. |
9f54c803 MM |
8729 | |
8730 | If SUBR is 1, we're being called recursively (to unify the | |
8731 | arguments of a function or method parameter of a function | |
8732 | template). */ | |
386b8a85 | 8733 | |
4966381a | 8734 | static int |
3a978d72 NN |
8735 | type_unification_real (tree tparms, |
8736 | tree targs, | |
8737 | tree xparms, | |
8738 | tree xargs, | |
8739 | int subr, | |
8740 | unification_kind_t strict, | |
8741 | int allow_incomplete, | |
8742 | int xlen) | |
8d08fdba MS |
8743 | { |
8744 | tree parm, arg; | |
8745 | int i; | |
8746 | int ntparms = TREE_VEC_LENGTH (tparms); | |
830bfa74 | 8747 | int sub_strict; |
bd0d5d4a JM |
8748 | int saw_undeduced = 0; |
8749 | tree parms, args; | |
8750 | int len; | |
8d08fdba MS |
8751 | |
8752 | my_friendly_assert (TREE_CODE (tparms) == TREE_VEC, 289); | |
bd0d5d4a JM |
8753 | my_friendly_assert (xparms == NULL_TREE |
8754 | || TREE_CODE (xparms) == TREE_LIST, 290); | |
ee3071ef | 8755 | my_friendly_assert (!xargs || TREE_CODE (xargs) == TREE_LIST, 291); |
8d08fdba MS |
8756 | my_friendly_assert (ntparms > 0, 292); |
8757 | ||
830bfa74 MM |
8758 | switch (strict) |
8759 | { | |
8760 | case DEDUCE_CALL: | |
028d1f20 NS |
8761 | sub_strict = (UNIFY_ALLOW_OUTER_LEVEL | UNIFY_ALLOW_MORE_CV_QUAL |
8762 | | UNIFY_ALLOW_DERIVED); | |
830bfa74 MM |
8763 | break; |
8764 | ||
8765 | case DEDUCE_CONV: | |
8766 | sub_strict = UNIFY_ALLOW_LESS_CV_QUAL; | |
8767 | break; | |
8768 | ||
8769 | case DEDUCE_EXACT: | |
8770 | sub_strict = UNIFY_ALLOW_NONE; | |
8771 | break; | |
62e4a758 NS |
8772 | |
8773 | case DEDUCE_ORDER: | |
8774 | sub_strict = UNIFY_ALLOW_NONE; | |
8775 | break; | |
830bfa74 MM |
8776 | |
8777 | default: | |
a98facb0 | 8778 | abort (); |
830bfa74 MM |
8779 | } |
8780 | ||
bd0d5d4a | 8781 | if (xlen == 0) |
e5214479 JM |
8782 | return 0; |
8783 | ||
bd0d5d4a JM |
8784 | again: |
8785 | parms = xparms; | |
8786 | args = xargs; | |
8787 | len = xlen; | |
8788 | ||
8d08fdba MS |
8789 | while (parms |
8790 | && parms != void_list_node | |
8791 | && args | |
8792 | && args != void_list_node) | |
8793 | { | |
8794 | parm = TREE_VALUE (parms); | |
8795 | parms = TREE_CHAIN (parms); | |
8796 | arg = TREE_VALUE (args); | |
8797 | args = TREE_CHAIN (args); | |
8798 | ||
8799 | if (arg == error_mark_node) | |
8800 | return 1; | |
8801 | if (arg == unknown_type_node) | |
34016c81 JM |
8802 | /* We can't deduce anything from this, but we might get all the |
8803 | template args from other function args. */ | |
8804 | continue; | |
b7484fbe | 8805 | |
03e70705 JM |
8806 | /* Conversions will be performed on a function argument that |
8807 | corresponds with a function parameter that contains only | |
8808 | non-deducible template parameters and explicitly specified | |
8809 | template parameters. */ | |
8810 | if (! uses_template_parms (parm)) | |
b7484fbe | 8811 | { |
03e70705 JM |
8812 | tree type; |
8813 | ||
2f939d94 | 8814 | if (!TYPE_P (arg)) |
03e70705 JM |
8815 | type = TREE_TYPE (arg); |
8816 | else | |
8817 | { | |
8818 | type = arg; | |
8819 | arg = NULL_TREE; | |
8820 | } | |
8821 | ||
62e4a758 | 8822 | if (strict == DEDUCE_EXACT || strict == DEDUCE_ORDER) |
03e70705 | 8823 | { |
3bfdc719 | 8824 | if (same_type_p (parm, type)) |
03e70705 JM |
8825 | continue; |
8826 | } | |
03e70705 | 8827 | else |
343c89cd JM |
8828 | /* It might work; we shouldn't check now, because we might |
8829 | get into infinite recursion. Overload resolution will | |
8830 | handle it. */ | |
8831 | continue; | |
03e70705 | 8832 | |
b7484fbe MS |
8833 | return 1; |
8834 | } | |
8835 | ||
2f939d94 | 8836 | if (!TYPE_P (arg)) |
8d08fdba MS |
8837 | { |
8838 | my_friendly_assert (TREE_TYPE (arg) != NULL_TREE, 293); | |
34016c81 | 8839 | if (type_unknown_p (arg)) |
28cbf42c | 8840 | { |
34016c81 JM |
8841 | /* [temp.deduct.type] A template-argument can be deduced from |
8842 | a pointer to function or pointer to member function | |
8843 | argument if the set of overloaded functions does not | |
8844 | contain function templates and at most one of a set of | |
8845 | overloaded functions provides a unique match. */ | |
8846 | ||
8847 | if (resolve_overloaded_unification | |
4393e105 | 8848 | (tparms, targs, parm, arg, strict, sub_strict) |
34016c81 JM |
8849 | != 0) |
8850 | return 1; | |
8851 | continue; | |
28cbf42c | 8852 | } |
8d08fdba | 8853 | arg = TREE_TYPE (arg); |
08476342 NS |
8854 | if (arg == error_mark_node) |
8855 | return 1; | |
8d08fdba | 8856 | } |
62e4a758 NS |
8857 | |
8858 | { | |
8859 | int arg_strict = sub_strict; | |
8860 | ||
8861 | if (!subr) | |
8862 | arg_strict |= maybe_adjust_types_for_deduction (strict, &parm, &arg); | |
4393e105 | 8863 | |
62e4a758 NS |
8864 | if (unify (tparms, targs, parm, arg, arg_strict)) |
8865 | return 1; | |
8866 | } | |
e5214479 JM |
8867 | |
8868 | /* Are we done with the interesting parms? */ | |
8869 | if (--len == 0) | |
bd0d5d4a | 8870 | goto done; |
8d08fdba MS |
8871 | } |
8872 | /* Fail if we've reached the end of the parm list, and more args | |
8873 | are present, and the parm list isn't variadic. */ | |
8874 | if (args && args != void_list_node && parms == void_list_node) | |
8875 | return 1; | |
8876 | /* Fail if parms are left and they don't have default values. */ | |
8877 | if (parms | |
8878 | && parms != void_list_node | |
8879 | && TREE_PURPOSE (parms) == NULL_TREE) | |
8880 | return 1; | |
bd0d5d4a JM |
8881 | |
8882 | done: | |
8d08fdba MS |
8883 | if (!subr) |
8884 | for (i = 0; i < ntparms; i++) | |
050367a3 | 8885 | if (TREE_VEC_ELT (targs, i) == NULL_TREE) |
8d08fdba | 8886 | { |
bd0d5d4a JM |
8887 | tree tparm = TREE_VALUE (TREE_VEC_ELT (tparms, i)); |
8888 | ||
8889 | /* If this is an undeduced nontype parameter that depends on | |
8890 | a type parameter, try another pass; its type may have been | |
8891 | deduced from a later argument than the one from which | |
8892 | this parameter can be deduced. */ | |
8893 | if (TREE_CODE (tparm) == PARM_DECL | |
8894 | && uses_template_parms (TREE_TYPE (tparm)) | |
8895 | && !saw_undeduced++) | |
8896 | goto again; | |
8897 | ||
386b8a85 | 8898 | if (!allow_incomplete) |
8251199e | 8899 | error ("incomplete type unification"); |
8d08fdba MS |
8900 | return 2; |
8901 | } | |
8902 | return 0; | |
8903 | } | |
8904 | ||
34016c81 JM |
8905 | /* Subroutine of type_unification_real. Args are like the variables at the |
8906 | call site. ARG is an overloaded function (or template-id); we try | |
8907 | deducing template args from each of the overloads, and if only one | |
8908 | succeeds, we go with that. Modifies TARGS and returns 0 on success. */ | |
8909 | ||
8910 | static int | |
3a978d72 NN |
8911 | resolve_overloaded_unification (tree tparms, |
8912 | tree targs, | |
8913 | tree parm, | |
8914 | tree arg, | |
8915 | unification_kind_t strict, | |
8916 | int sub_strict) | |
34016c81 JM |
8917 | { |
8918 | tree tempargs = copy_node (targs); | |
8919 | int good = 0; | |
8920 | ||
8921 | if (TREE_CODE (arg) == ADDR_EXPR) | |
8922 | arg = TREE_OPERAND (arg, 0); | |
9f3d9e46 | 8923 | |
d8f8dca1 MM |
8924 | if (TREE_CODE (arg) == COMPONENT_REF) |
8925 | /* Handle `&x' where `x' is some static or non-static member | |
8926 | function name. */ | |
8927 | arg = TREE_OPERAND (arg, 1); | |
8928 | ||
05e0b2f4 JM |
8929 | if (TREE_CODE (arg) == OFFSET_REF) |
8930 | arg = TREE_OPERAND (arg, 1); | |
8931 | ||
9f3d9e46 | 8932 | /* Strip baselink information. */ |
50ad9642 MM |
8933 | if (BASELINK_P (arg)) |
8934 | arg = BASELINK_FUNCTIONS (arg); | |
9f3d9e46 | 8935 | |
34016c81 JM |
8936 | if (TREE_CODE (arg) == TEMPLATE_ID_EXPR) |
8937 | { | |
8938 | /* If we got some explicit template args, we need to plug them into | |
8939 | the affected templates before we try to unify, in case the | |
8940 | explicit args will completely resolve the templates in question. */ | |
8941 | ||
8942 | tree expl_subargs = TREE_OPERAND (arg, 1); | |
8943 | arg = TREE_OPERAND (arg, 0); | |
8944 | ||
8945 | for (; arg; arg = OVL_NEXT (arg)) | |
8946 | { | |
8947 | tree fn = OVL_CURRENT (arg); | |
8948 | tree subargs, elem; | |
8949 | ||
8950 | if (TREE_CODE (fn) != TEMPLATE_DECL) | |
8951 | continue; | |
8952 | ||
17aec3eb RK |
8953 | subargs = get_bindings_overload (fn, DECL_TEMPLATE_RESULT (fn), |
8954 | expl_subargs); | |
34016c81 JM |
8955 | if (subargs) |
8956 | { | |
c2ea3a40 | 8957 | elem = tsubst (TREE_TYPE (fn), subargs, tf_none, NULL_TREE); |
d8f8dca1 MM |
8958 | if (TREE_CODE (elem) == METHOD_TYPE) |
8959 | elem = build_ptrmemfunc_type (build_pointer_type (elem)); | |
e97e5263 | 8960 | good += try_one_overload (tparms, targs, tempargs, parm, elem, |
4393e105 | 8961 | strict, sub_strict); |
34016c81 JM |
8962 | } |
8963 | } | |
8964 | } | |
db0f613d KL |
8965 | else if (TREE_CODE (arg) == OVERLOAD |
8966 | || TREE_CODE (arg) == FUNCTION_DECL) | |
34016c81 JM |
8967 | { |
8968 | for (; arg; arg = OVL_NEXT (arg)) | |
d8f8dca1 MM |
8969 | { |
8970 | tree type = TREE_TYPE (OVL_CURRENT (arg)); | |
8971 | if (TREE_CODE (type) == METHOD_TYPE) | |
8972 | type = build_ptrmemfunc_type (build_pointer_type (type)); | |
8973 | good += try_one_overload (tparms, targs, tempargs, parm, | |
8974 | type, | |
4393e105 | 8975 | strict, sub_strict); |
d8f8dca1 | 8976 | } |
34016c81 JM |
8977 | } |
8978 | else | |
a98facb0 | 8979 | abort (); |
34016c81 JM |
8980 | |
8981 | /* [temp.deduct.type] A template-argument can be deduced from a pointer | |
8982 | to function or pointer to member function argument if the set of | |
8983 | overloaded functions does not contain function templates and at most | |
8984 | one of a set of overloaded functions provides a unique match. | |
8985 | ||
8986 | So if we found multiple possibilities, we return success but don't | |
8987 | deduce anything. */ | |
8988 | ||
8989 | if (good == 1) | |
8990 | { | |
8991 | int i = TREE_VEC_LENGTH (targs); | |
8992 | for (; i--; ) | |
8993 | if (TREE_VEC_ELT (tempargs, i)) | |
8994 | TREE_VEC_ELT (targs, i) = TREE_VEC_ELT (tempargs, i); | |
8995 | } | |
8996 | if (good) | |
8997 | return 0; | |
8998 | ||
8999 | return 1; | |
9000 | } | |
9001 | ||
9002 | /* Subroutine of resolve_overloaded_unification; does deduction for a single | |
9003 | overload. Fills TARGS with any deduced arguments, or error_mark_node if | |
9004 | different overloads deduce different arguments for a given parm. | |
9005 | Returns 1 on success. */ | |
9006 | ||
9007 | static int | |
3a978d72 NN |
9008 | try_one_overload (tree tparms, |
9009 | tree orig_targs, | |
9010 | tree targs, | |
9011 | tree parm, | |
9012 | tree arg, | |
9013 | unification_kind_t strict, | |
9014 | int sub_strict) | |
34016c81 JM |
9015 | { |
9016 | int nargs; | |
9017 | tree tempargs; | |
9018 | int i; | |
9019 | ||
9020 | /* [temp.deduct.type] A template-argument can be deduced from a pointer | |
9021 | to function or pointer to member function argument if the set of | |
9022 | overloaded functions does not contain function templates and at most | |
9023 | one of a set of overloaded functions provides a unique match. | |
9024 | ||
9025 | So if this is a template, just return success. */ | |
9026 | ||
9027 | if (uses_template_parms (arg)) | |
9028 | return 1; | |
9029 | ||
62e4a758 | 9030 | sub_strict |= maybe_adjust_types_for_deduction (strict, &parm, &arg); |
34016c81 JM |
9031 | |
9032 | /* We don't copy orig_targs for this because if we have already deduced | |
9033 | some template args from previous args, unify would complain when we | |
9034 | try to deduce a template parameter for the same argument, even though | |
9035 | there isn't really a conflict. */ | |
9036 | nargs = TREE_VEC_LENGTH (targs); | |
f31c0a32 | 9037 | tempargs = make_tree_vec (nargs); |
34016c81 | 9038 | |
4393e105 | 9039 | if (unify (tparms, tempargs, parm, arg, sub_strict) != 0) |
34016c81 JM |
9040 | return 0; |
9041 | ||
9042 | /* First make sure we didn't deduce anything that conflicts with | |
e97e5263 | 9043 | explicitly specified args. */ |
34016c81 JM |
9044 | for (i = nargs; i--; ) |
9045 | { | |
9046 | tree elt = TREE_VEC_ELT (tempargs, i); | |
e97e5263 | 9047 | tree oldelt = TREE_VEC_ELT (orig_targs, i); |
34016c81 JM |
9048 | |
9049 | if (elt == NULL_TREE) | |
9050 | continue; | |
9051 | else if (uses_template_parms (elt)) | |
9052 | { | |
9053 | /* Since we're unifying against ourselves, we will fill in template | |
9054 | args used in the function parm list with our own template parms. | |
9055 | Discard them. */ | |
9056 | TREE_VEC_ELT (tempargs, i) = NULL_TREE; | |
9057 | continue; | |
9058 | } | |
9059 | else if (oldelt && ! template_args_equal (oldelt, elt)) | |
9060 | return 0; | |
9061 | } | |
9062 | ||
9063 | for (i = nargs; i--; ) | |
9064 | { | |
9065 | tree elt = TREE_VEC_ELT (tempargs, i); | |
9066 | ||
9067 | if (elt) | |
9068 | TREE_VEC_ELT (targs, i) = elt; | |
9069 | } | |
9070 | ||
9071 | return 1; | |
9072 | } | |
9073 | ||
74601d7c KL |
9074 | /* Verify that nondeduce template argument agrees with the type |
9075 | obtained from argument deduction. Return nonzero if the | |
9076 | verification fails. | |
9077 | ||
9078 | For example: | |
9079 | ||
9080 | struct A { typedef int X; }; | |
9081 | template <class T, class U> struct C {}; | |
9082 | template <class T> struct C<T, typename T::X> {}; | |
9083 | ||
9084 | Then with the instantiation `C<A, int>', we can deduce that | |
9085 | `T' is `A' but unify () does not check whether `typename T::X' | |
9086 | is `int'. This function ensure that they agree. | |
9087 | ||
9088 | TARGS, PARMS are the same as the arguments of unify. | |
9089 | ARGS contains template arguments from all levels. */ | |
9090 | ||
9091 | static int | |
3a978d72 | 9092 | verify_class_unification (tree targs, tree parms, tree args) |
74601d7c | 9093 | { |
e2005c8d KL |
9094 | parms = tsubst (parms, add_outermost_template_args (args, targs), |
9095 | tf_none, NULL_TREE); | |
9096 | if (parms == error_mark_node) | |
74601d7c KL |
9097 | return 1; |
9098 | ||
e2005c8d | 9099 | return !comp_template_args (parms, INNERMOST_TEMPLATE_ARGS (args)); |
74601d7c KL |
9100 | } |
9101 | ||
4393e105 MM |
9102 | /* PARM is a template class (perhaps with unbound template |
9103 | parameters). ARG is a fully instantiated type. If ARG can be | |
9104 | bound to PARM, return ARG, otherwise return NULL_TREE. TPARMS and | |
9105 | TARGS are as for unify. */ | |
fcfb9f96 MM |
9106 | |
9107 | static tree | |
3a978d72 | 9108 | try_class_unification (tree tparms, tree targs, tree parm, tree arg) |
4393e105 | 9109 | { |
4393e105 MM |
9110 | tree copy_of_targs; |
9111 | ||
9112 | if (!CLASSTYPE_TEMPLATE_INFO (arg) | |
68361a03 MM |
9113 | || (most_general_template (CLASSTYPE_TI_TEMPLATE (arg)) |
9114 | != most_general_template (CLASSTYPE_TI_TEMPLATE (parm)))) | |
4393e105 MM |
9115 | return NULL_TREE; |
9116 | ||
9117 | /* We need to make a new template argument vector for the call to | |
9118 | unify. If we used TARGS, we'd clutter it up with the result of | |
9119 | the attempted unification, even if this class didn't work out. | |
9120 | We also don't want to commit ourselves to all the unifications | |
9121 | we've already done, since unification is supposed to be done on | |
9122 | an argument-by-argument basis. In other words, consider the | |
9123 | following pathological case: | |
9124 | ||
9125 | template <int I, int J, int K> | |
9126 | struct S {}; | |
9127 | ||
9128 | template <int I, int J> | |
9129 | struct S<I, J, 2> : public S<I, I, I>, S<J, J, J> {}; | |
9130 | ||
9131 | template <int I, int J, int K> | |
9132 | void f(S<I, J, K>, S<I, I, I>); | |
9133 | ||
9134 | void g() { | |
9135 | S<0, 0, 0> s0; | |
9136 | S<0, 1, 2> s2; | |
9137 | ||
9138 | f(s0, s2); | |
9139 | } | |
9140 | ||
9141 | Now, by the time we consider the unification involving `s2', we | |
9142 | already know that we must have `f<0, 0, 0>'. But, even though | |
0e339752 | 9143 | `S<0, 1, 2>' is derived from `S<0, 0, 0>', the code is invalid |
4393e105 MM |
9144 | because there are two ways to unify base classes of S<0, 1, 2> |
9145 | with S<I, I, I>. If we kept the already deduced knowledge, we | |
9146 | would reject the possibility I=1. */ | |
f31c0a32 | 9147 | copy_of_targs = make_tree_vec (TREE_VEC_LENGTH (targs)); |
4393e105 MM |
9148 | |
9149 | /* If unification failed, we're done. */ | |
74601d7c KL |
9150 | if (unify (tparms, copy_of_targs, CLASSTYPE_TI_ARGS (parm), |
9151 | CLASSTYPE_TI_ARGS (arg), UNIFY_ALLOW_NONE)) | |
4393e105 | 9152 | return NULL_TREE; |
74601d7c KL |
9153 | |
9154 | return arg; | |
4393e105 MM |
9155 | } |
9156 | ||
9157 | /* Subroutine of get_template_base. RVAL, if non-NULL, is a base we | |
dc957d14 | 9158 | have already discovered to be satisfactory. ARG_BINFO is the binfo |
4393e105 MM |
9159 | for the base class of ARG that we are currently examining. */ |
9160 | ||
9161 | static tree | |
3a978d72 NN |
9162 | get_template_base_recursive (tree tparms, |
9163 | tree targs, | |
9164 | tree parm, | |
9165 | tree arg_binfo, | |
9166 | tree rval, | |
9167 | int flags) | |
fcfb9f96 MM |
9168 | { |
9169 | tree binfos; | |
9170 | int i, n_baselinks; | |
4393e105 | 9171 | tree arg = BINFO_TYPE (arg_binfo); |
fcfb9f96 | 9172 | |
4393e105 | 9173 | if (!(flags & GTB_IGNORE_TYPE)) |
fcfb9f96 | 9174 | { |
4393e105 MM |
9175 | tree r = try_class_unification (tparms, targs, |
9176 | parm, arg); | |
fcfb9f96 | 9177 | |
4393e105 | 9178 | /* If there is more than one satisfactory baseclass, then: |
fcfb9f96 | 9179 | |
4393e105 MM |
9180 | [temp.deduct.call] |
9181 | ||
9182 | If they yield more than one possible deduced A, the type | |
9183 | deduction fails. | |
9184 | ||
9185 | applies. */ | |
9186 | if (r && rval && !same_type_p (r, rval)) | |
9187 | return error_mark_node; | |
9188 | else if (r) | |
9189 | rval = r; | |
fcfb9f96 MM |
9190 | } |
9191 | ||
4393e105 | 9192 | binfos = BINFO_BASETYPES (arg_binfo); |
fcfb9f96 MM |
9193 | n_baselinks = binfos ? TREE_VEC_LENGTH (binfos) : 0; |
9194 | ||
9195 | /* Process base types. */ | |
9196 | for (i = 0; i < n_baselinks; i++) | |
9197 | { | |
9198 | tree base_binfo = TREE_VEC_ELT (binfos, i); | |
4393e105 | 9199 | int this_virtual; |
fcfb9f96 | 9200 | |
4393e105 MM |
9201 | /* Skip this base, if we've already seen it. */ |
9202 | if (BINFO_MARKED (base_binfo)) | |
9203 | continue; | |
9204 | ||
9205 | this_virtual = | |
9206 | (flags & GTB_VIA_VIRTUAL) || TREE_VIA_VIRTUAL (base_binfo); | |
9207 | ||
9208 | /* When searching for a non-virtual, we cannot mark virtually | |
9209 | found binfos. */ | |
9210 | if (! this_virtual) | |
dbbf88d1 | 9211 | BINFO_MARKED (base_binfo) = 1; |
4393e105 MM |
9212 | |
9213 | rval = get_template_base_recursive (tparms, targs, | |
9214 | parm, | |
9215 | base_binfo, | |
9216 | rval, | |
9217 | GTB_VIA_VIRTUAL * this_virtual); | |
9218 | ||
9219 | /* If we discovered more than one matching base class, we can | |
9220 | stop now. */ | |
9221 | if (rval == error_mark_node) | |
9222 | return error_mark_node; | |
fcfb9f96 MM |
9223 | } |
9224 | ||
9225 | return rval; | |
9226 | } | |
9227 | ||
4393e105 MM |
9228 | /* Given a template type PARM and a class type ARG, find the unique |
9229 | base type in ARG that is an instance of PARM. We do not examine | |
9230 | ARG itself; only its base-classes. If there is no appropriate base | |
9231 | class, return NULL_TREE. If there is more than one, return | |
9232 | error_mark_node. PARM may be the type of a partial specialization, | |
9233 | as well as a plain template type. Used by unify. */ | |
fcfb9f96 MM |
9234 | |
9235 | static tree | |
3a978d72 | 9236 | get_template_base (tree tparms, tree targs, tree parm, tree arg) |
fcfb9f96 | 9237 | { |
4393e105 MM |
9238 | tree rval; |
9239 | tree arg_binfo; | |
fcfb9f96 | 9240 | |
4393e105 MM |
9241 | my_friendly_assert (IS_AGGR_TYPE_CODE (TREE_CODE (arg)), 92); |
9242 | ||
9243 | arg_binfo = TYPE_BINFO (complete_type (arg)); | |
9244 | rval = get_template_base_recursive (tparms, targs, | |
9245 | parm, arg_binfo, | |
9246 | NULL_TREE, | |
9247 | GTB_IGNORE_TYPE); | |
fcfb9f96 | 9248 | |
4393e105 MM |
9249 | /* Since get_template_base_recursive marks the bases classes, we |
9250 | must unmark them here. */ | |
d6479fe7 | 9251 | dfs_walk (arg_binfo, dfs_unmark, markedp, 0); |
fcfb9f96 MM |
9252 | |
9253 | return rval; | |
9254 | } | |
9255 | ||
db2767b6 MM |
9256 | /* Returns the level of DECL, which declares a template parameter. */ |
9257 | ||
e9659ab0 | 9258 | static int |
3a978d72 | 9259 | template_decl_level (tree decl) |
db2767b6 MM |
9260 | { |
9261 | switch (TREE_CODE (decl)) | |
9262 | { | |
9263 | case TYPE_DECL: | |
9264 | case TEMPLATE_DECL: | |
9265 | return TEMPLATE_TYPE_LEVEL (TREE_TYPE (decl)); | |
9266 | ||
9267 | case PARM_DECL: | |
9268 | return TEMPLATE_PARM_LEVEL (DECL_INITIAL (decl)); | |
9269 | ||
9270 | default: | |
a98facb0 | 9271 | abort (); |
5ffe581d | 9272 | return 0; |
db2767b6 MM |
9273 | } |
9274 | } | |
9275 | ||
830bfa74 MM |
9276 | /* Decide whether ARG can be unified with PARM, considering only the |
9277 | cv-qualifiers of each type, given STRICT as documented for unify. | |
838dfd8a | 9278 | Returns nonzero iff the unification is OK on that basis.*/ |
e92cc029 | 9279 | |
e9659ab0 | 9280 | static int |
3a978d72 | 9281 | check_cv_quals_for_unify (int strict, tree arg, tree parm) |
830bfa74 | 9282 | { |
4f2b0fb2 NS |
9283 | int arg_quals = cp_type_quals (arg); |
9284 | int parm_quals = cp_type_quals (parm); | |
9285 | ||
9286 | if (TREE_CODE (parm) == TEMPLATE_TYPE_PARM) | |
9287 | { | |
9288 | /* If the cvr quals of parm will not unify with ARG, they'll be | |
9289 | ignored in instantiation, so we have to do the same here. */ | |
171d2f50 | 9290 | if (TREE_CODE (arg) == REFERENCE_TYPE) |
4f2b0fb2 NS |
9291 | parm_quals &= ~(TYPE_QUAL_CONST | TYPE_QUAL_VOLATILE); |
9292 | if (!POINTER_TYPE_P (arg) && | |
9293 | TREE_CODE (arg) != TEMPLATE_TYPE_PARM) | |
9294 | parm_quals &= ~TYPE_QUAL_RESTRICT; | |
9295 | } | |
9296 | ||
62e4a758 | 9297 | if (!(strict & (UNIFY_ALLOW_MORE_CV_QUAL | UNIFY_ALLOW_OUTER_MORE_CV_QUAL)) |
4f2b0fb2 | 9298 | && (arg_quals & parm_quals) != parm_quals) |
ef637255 MM |
9299 | return 0; |
9300 | ||
62e4a758 | 9301 | if (!(strict & (UNIFY_ALLOW_LESS_CV_QUAL | UNIFY_ALLOW_OUTER_LESS_CV_QUAL)) |
4f2b0fb2 | 9302 | && (parm_quals & arg_quals) != arg_quals) |
ef637255 MM |
9303 | return 0; |
9304 | ||
ef637255 | 9305 | return 1; |
830bfa74 MM |
9306 | } |
9307 | ||
9308 | /* Takes parameters as for type_unification. Returns 0 if the | |
dc957d14 | 9309 | type deduction succeeds, 1 otherwise. The parameter STRICT is a |
830bfa74 MM |
9310 | bitwise or of the following flags: |
9311 | ||
9312 | UNIFY_ALLOW_NONE: | |
9313 | Require an exact match between PARM and ARG. | |
9314 | UNIFY_ALLOW_MORE_CV_QUAL: | |
028d1f20 NS |
9315 | Allow the deduced ARG to be more cv-qualified (by qualification |
9316 | conversion) than ARG. | |
830bfa74 MM |
9317 | UNIFY_ALLOW_LESS_CV_QUAL: |
9318 | Allow the deduced ARG to be less cv-qualified than ARG. | |
9319 | UNIFY_ALLOW_DERIVED: | |
9320 | Allow the deduced ARG to be a template base class of ARG, | |
9321 | or a pointer to a template base class of the type pointed to by | |
161c12b0 JM |
9322 | ARG. |
9323 | UNIFY_ALLOW_INTEGER: | |
9324 | Allow any integral type to be deduced. See the TEMPLATE_PARM_INDEX | |
028d1f20 NS |
9325 | case for more information. |
9326 | UNIFY_ALLOW_OUTER_LEVEL: | |
9327 | This is the outermost level of a deduction. Used to determine validity | |
9328 | of qualification conversions. A valid qualification conversion must | |
9329 | have const qualified pointers leading up to the inner type which | |
9330 | requires additional CV quals, except at the outer level, where const | |
9331 | is not required [conv.qual]. It would be normal to set this flag in | |
62e4a758 NS |
9332 | addition to setting UNIFY_ALLOW_MORE_CV_QUAL. |
9333 | UNIFY_ALLOW_OUTER_MORE_CV_QUAL: | |
9334 | This is the outermost level of a deduction, and PARM can be more CV | |
9335 | qualified at this point. | |
9336 | UNIFY_ALLOW_OUTER_LESS_CV_QUAL: | |
9337 | This is the outermost level of a deduction, and PARM can be less CV | |
d9f818d9 RS |
9338 | qualified at this point. |
9339 | UNIFY_ALLOW_MAX_CORRECTION: | |
9340 | This is an INTEGER_TYPE's maximum value. Used if the range may | |
9341 | have been derived from a size specification, such as an array size. | |
9342 | If the size was given by a nontype template parameter N, the maximum | |
9343 | value will have the form N-1. The flag says that we can (and indeed | |
9344 | must) unify N with (ARG + 1), an exception to the normal rules on | |
9345 | folding PARM. */ | |
830bfa74 | 9346 | |
e9659ab0 | 9347 | static int |
3a978d72 | 9348 | unify (tree tparms, tree targs, tree parm, tree arg, int strict) |
8d08fdba MS |
9349 | { |
9350 | int idx; | |
050367a3 | 9351 | tree targ; |
db2767b6 | 9352 | tree tparm; |
028d1f20 | 9353 | int strict_in = strict; |
8d08fdba MS |
9354 | |
9355 | /* I don't think this will do the right thing with respect to types. | |
9356 | But the only case I've seen it in so far has been array bounds, where | |
9357 | signedness is the only information lost, and I think that will be | |
9358 | okay. */ | |
9359 | while (TREE_CODE (parm) == NOP_EXPR) | |
9360 | parm = TREE_OPERAND (parm, 0); | |
9361 | ||
9362 | if (arg == error_mark_node) | |
9363 | return 1; | |
9364 | if (arg == unknown_type_node) | |
34016c81 JM |
9365 | /* We can't deduce anything from this, but we might get all the |
9366 | template args from other function args. */ | |
9367 | return 0; | |
9368 | ||
db2767b6 | 9369 | /* If PARM uses template parameters, then we can't bail out here, |
6bdb985f | 9370 | even if ARG == PARM, since we won't record unifications for the |
db2767b6 MM |
9371 | template parameters. We might need them if we're trying to |
9372 | figure out which of two things is more specialized. */ | |
9373 | if (arg == parm && !uses_template_parms (parm)) | |
8d08fdba MS |
9374 | return 0; |
9375 | ||
830bfa74 MM |
9376 | /* Immediately reject some pairs that won't unify because of |
9377 | cv-qualification mismatches. */ | |
9378 | if (TREE_CODE (arg) == TREE_CODE (parm) | |
2f939d94 | 9379 | && TYPE_P (arg) |
d0ab7624 NS |
9380 | /* It is the elements of the array which hold the cv quals of an array |
9381 | type, and the elements might be template type parms. We'll check | |
9382 | when we recurse. */ | |
9383 | && TREE_CODE (arg) != ARRAY_TYPE | |
830bfa74 MM |
9384 | /* We check the cv-qualifiers when unifying with template type |
9385 | parameters below. We want to allow ARG `const T' to unify with | |
9386 | PARM `T' for example, when computing which of two templates | |
9387 | is more specialized, for example. */ | |
9388 | && TREE_CODE (arg) != TEMPLATE_TYPE_PARM | |
028d1f20 | 9389 | && !check_cv_quals_for_unify (strict_in, arg, parm)) |
49432171 JM |
9390 | return 1; |
9391 | ||
028d1f20 | 9392 | if (!(strict & UNIFY_ALLOW_OUTER_LEVEL) |
3ea099f1 | 9393 | && TYPE_P (parm) && !CP_TYPE_CONST_P (parm)) |
028d1f20 NS |
9394 | strict &= ~UNIFY_ALLOW_MORE_CV_QUAL; |
9395 | strict &= ~UNIFY_ALLOW_OUTER_LEVEL; | |
9396 | strict &= ~UNIFY_ALLOW_DERIVED; | |
62e4a758 NS |
9397 | strict &= ~UNIFY_ALLOW_OUTER_MORE_CV_QUAL; |
9398 | strict &= ~UNIFY_ALLOW_OUTER_LESS_CV_QUAL; | |
d9f818d9 | 9399 | strict &= ~UNIFY_ALLOW_MAX_CORRECTION; |
028d1f20 | 9400 | |
8d08fdba MS |
9401 | switch (TREE_CODE (parm)) |
9402 | { | |
2ca340ae | 9403 | case TYPENAME_TYPE: |
fccef71e | 9404 | case SCOPE_REF: |
b8c6534b | 9405 | case UNBOUND_CLASS_TEMPLATE: |
2ca340ae JM |
9406 | /* In a type which contains a nested-name-specifier, template |
9407 | argument values cannot be deduced for template parameters used | |
9408 | within the nested-name-specifier. */ | |
9409 | return 0; | |
9410 | ||
8d08fdba | 9411 | case TEMPLATE_TYPE_PARM: |
73b0fce8 | 9412 | case TEMPLATE_TEMPLATE_PARM: |
a1281f45 | 9413 | case BOUND_TEMPLATE_TEMPLATE_PARM: |
db2767b6 MM |
9414 | tparm = TREE_VALUE (TREE_VEC_ELT (tparms, 0)); |
9415 | ||
9416 | if (TEMPLATE_TYPE_LEVEL (parm) | |
9417 | != template_decl_level (tparm)) | |
9418 | /* The PARM is not one we're trying to unify. Just check | |
9419 | to see if it matches ARG. */ | |
9420 | return (TREE_CODE (arg) == TREE_CODE (parm) | |
3bfdc719 | 9421 | && same_type_p (parm, arg)) ? 0 : 1; |
73b0fce8 | 9422 | idx = TEMPLATE_TYPE_IDX (parm); |
050367a3 | 9423 | targ = TREE_VEC_ELT (targs, idx); |
db2767b6 | 9424 | tparm = TREE_VALUE (TREE_VEC_ELT (tparms, idx)); |
050367a3 | 9425 | |
73b0fce8 | 9426 | /* Check for mixed types and values. */ |
db2767b6 MM |
9427 | if ((TREE_CODE (parm) == TEMPLATE_TYPE_PARM |
9428 | && TREE_CODE (tparm) != TYPE_DECL) | |
9429 | || (TREE_CODE (parm) == TEMPLATE_TEMPLATE_PARM | |
9430 | && TREE_CODE (tparm) != TEMPLATE_DECL)) | |
73b0fce8 KL |
9431 | return 1; |
9432 | ||
a1281f45 | 9433 | if (TREE_CODE (parm) == BOUND_TEMPLATE_TEMPLATE_PARM) |
73b0fce8 | 9434 | { |
b429fdf0 KL |
9435 | /* ARG must be constructed from a template class or a template |
9436 | template parameter. */ | |
9437 | if (TREE_CODE (arg) != BOUND_TEMPLATE_TEMPLATE_PARM | |
9438 | && (TREE_CODE (arg) != RECORD_TYPE || !CLASSTYPE_TEMPLATE_INFO (arg))) | |
a1281f45 | 9439 | return 1; |
73b0fce8 | 9440 | |
a1281f45 KL |
9441 | { |
9442 | tree parmtmpl = TYPE_TI_TEMPLATE (parm); | |
9443 | tree parmvec = TYPE_TI_ARGS (parm); | |
b429fdf0 | 9444 | tree argvec = TYPE_TI_ARGS (arg); |
a1281f45 | 9445 | tree argtmplvec |
b429fdf0 | 9446 | = DECL_INNERMOST_TEMPLATE_PARMS (TYPE_TI_TEMPLATE (arg)); |
a1281f45 | 9447 | int i; |
73b0fce8 | 9448 | |
a1281f45 KL |
9449 | /* The parameter and argument roles have to be switched here |
9450 | in order to handle default arguments properly. For example, | |
9451 | template<template <class> class TT> void f(TT<int>) | |
9452 | should be able to accept vector<int> which comes from | |
9453 | template <class T, class Allocator = allocator> | |
9454 | class vector. */ | |
9455 | ||
ee3071ef NS |
9456 | if (coerce_template_parms (argtmplvec, parmvec, parmtmpl, 0, 1) |
9457 | == error_mark_node) | |
a1281f45 | 9458 | return 1; |
73b0fce8 | 9459 | |
a1281f45 KL |
9460 | /* Deduce arguments T, i from TT<T> or TT<i>. |
9461 | We check each element of PARMVEC and ARGVEC individually | |
9462 | rather than the whole TREE_VEC since they can have | |
9463 | different number of elements. */ | |
6b9b6b15 | 9464 | |
a1281f45 KL |
9465 | for (i = 0; i < TREE_VEC_LENGTH (parmvec); ++i) |
9466 | { | |
9467 | tree t = TREE_VEC_ELT (parmvec, i); | |
73b0fce8 | 9468 | |
a1281f45 KL |
9469 | if (unify (tparms, targs, t, |
9470 | TREE_VEC_ELT (argvec, i), | |
9471 | UNIFY_ALLOW_NONE)) | |
9472 | return 1; | |
73b0fce8 | 9473 | } |
a1281f45 | 9474 | } |
b429fdf0 | 9475 | arg = TYPE_TI_TEMPLATE (arg); |
a1281f45 KL |
9476 | |
9477 | /* Fall through to deduce template name. */ | |
9478 | } | |
9479 | ||
9480 | if (TREE_CODE (parm) == TEMPLATE_TEMPLATE_PARM | |
9481 | || TREE_CODE (parm) == BOUND_TEMPLATE_TEMPLATE_PARM) | |
9482 | { | |
9483 | /* Deduce template name TT from TT, TT<>, TT<T> and TT<i>. */ | |
9484 | ||
9485 | /* Simple cases: Value already set, does match or doesn't. */ | |
9486 | if (targ != NULL_TREE && template_args_equal (targ, arg)) | |
9487 | return 0; | |
9488 | else if (targ) | |
9489 | return 1; | |
db2767b6 MM |
9490 | } |
9491 | else | |
9492 | { | |
830bfa74 MM |
9493 | /* If PARM is `const T' and ARG is only `int', we don't have |
9494 | a match unless we are allowing additional qualification. | |
9495 | If ARG is `const int' and PARM is just `T' that's OK; | |
9496 | that binds `const int' to `T'. */ | |
028d1f20 | 9497 | if (!check_cv_quals_for_unify (strict_in | UNIFY_ALLOW_LESS_CV_QUAL, |
830bfa74 | 9498 | arg, parm)) |
db2767b6 MM |
9499 | return 1; |
9500 | ||
830bfa74 MM |
9501 | /* Consider the case where ARG is `const volatile int' and |
9502 | PARM is `const T'. Then, T should be `volatile int'. */ | |
c2ea3a40 NS |
9503 | arg = cp_build_qualified_type_real |
9504 | (arg, cp_type_quals (arg) & ~cp_type_quals (parm), tf_none); | |
adecb3f4 MM |
9505 | if (arg == error_mark_node) |
9506 | return 1; | |
73b0fce8 | 9507 | |
a1281f45 KL |
9508 | /* Simple cases: Value already set, does match or doesn't. */ |
9509 | if (targ != NULL_TREE && same_type_p (targ, arg)) | |
9510 | return 0; | |
9511 | else if (targ) | |
9512 | return 1; | |
61cd552e | 9513 | |
94fc547c MM |
9514 | /* Make sure that ARG is not a variable-sized array. (Note |
9515 | that were talking about variable-sized arrays (like | |
9516 | `int[n]'), rather than arrays of unknown size (like | |
9517 | `int[]').) We'll get very confused by such a type since | |
9518 | the bound of the array will not be computable in an | |
9519 | instantiation. Besides, such types are not allowed in | |
9520 | ISO C++, so we can do as we please here. */ | |
9521 | if (variably_modified_type_p (arg)) | |
9522 | return 1; | |
9523 | } | |
61cd552e | 9524 | |
050367a3 | 9525 | TREE_VEC_ELT (targs, idx) = arg; |
73b0fce8 KL |
9526 | return 0; |
9527 | ||
f84b4be9 | 9528 | case TEMPLATE_PARM_INDEX: |
db2767b6 MM |
9529 | tparm = TREE_VALUE (TREE_VEC_ELT (tparms, 0)); |
9530 | ||
9531 | if (TEMPLATE_PARM_LEVEL (parm) | |
9532 | != template_decl_level (tparm)) | |
9533 | /* The PARM is not one we're trying to unify. Just check | |
9534 | to see if it matches ARG. */ | |
c8a209ca NS |
9535 | return !(TREE_CODE (arg) == TREE_CODE (parm) |
9536 | && cp_tree_equal (parm, arg)); | |
db2767b6 | 9537 | |
f84b4be9 | 9538 | idx = TEMPLATE_PARM_IDX (parm); |
050367a3 | 9539 | targ = TREE_VEC_ELT (targs, idx); |
db2767b6 | 9540 | |
050367a3 | 9541 | if (targ) |
c8a209ca | 9542 | return !cp_tree_equal (targ, arg); |
8d08fdba | 9543 | |
161c12b0 JM |
9544 | /* [temp.deduct.type] If, in the declaration of a function template |
9545 | with a non-type template-parameter, the non-type | |
9546 | template-parameter is used in an expression in the function | |
9547 | parameter-list and, if the corresponding template-argument is | |
9548 | deduced, the template-argument type shall match the type of the | |
9549 | template-parameter exactly, except that a template-argument | |
d7c4edd0 NS |
9550 | deduced from an array bound may be of any integral type. |
9551 | The non-type parameter might use already deduced type parameters. */ | |
bd0d5d4a | 9552 | tparm = tsubst (TREE_TYPE (parm), targs, 0, NULL_TREE); |
e2005c8d KL |
9553 | if (!TREE_TYPE (arg)) |
9554 | /* Template-parameter dependent expression. Just accept it for now. | |
9555 | It will later be processed in convert_template_argument. */ | |
9556 | ; | |
9557 | else if (same_type_p (TREE_TYPE (arg), tparm)) | |
9558 | /* OK */; | |
161c12b0 | 9559 | else if ((strict & UNIFY_ALLOW_INTEGER) |
bd0d5d4a JM |
9560 | && (TREE_CODE (tparm) == INTEGER_TYPE |
9561 | || TREE_CODE (tparm) == BOOLEAN_TYPE)) | |
161c12b0 | 9562 | /* OK */; |
bd0d5d4a JM |
9563 | else if (uses_template_parms (tparm)) |
9564 | /* We haven't deduced the type of this parameter yet. Try again | |
9565 | later. */ | |
9566 | return 0; | |
161c12b0 JM |
9567 | else |
9568 | return 1; | |
9569 | ||
2a1e9fdd | 9570 | TREE_VEC_ELT (targs, idx) = arg; |
8d08fdba MS |
9571 | return 0; |
9572 | ||
9573 | case POINTER_TYPE: | |
830bfa74 | 9574 | { |
830bfa74 MM |
9575 | if (TREE_CODE (arg) != POINTER_TYPE) |
9576 | return 1; | |
9577 | ||
9578 | /* [temp.deduct.call] | |
9579 | ||
9580 | A can be another pointer or pointer to member type that can | |
9581 | be converted to the deduced A via a qualification | |
9582 | conversion (_conv.qual_). | |
9583 | ||
9584 | We pass down STRICT here rather than UNIFY_ALLOW_NONE. | |
9585 | This will allow for additional cv-qualification of the | |
028d1f20 | 9586 | pointed-to types if appropriate. */ |
830bfa74 | 9587 | |
028d1f20 | 9588 | if (TREE_CODE (TREE_TYPE (arg)) == RECORD_TYPE) |
830bfa74 MM |
9589 | /* The derived-to-base conversion only persists through one |
9590 | level of pointers. */ | |
028d1f20 | 9591 | strict |= (strict_in & UNIFY_ALLOW_DERIVED); |
830bfa74 | 9592 | |
a7a64a77 | 9593 | return unify (tparms, targs, TREE_TYPE (parm), |
028d1f20 | 9594 | TREE_TYPE (arg), strict); |
830bfa74 | 9595 | } |
8d08fdba MS |
9596 | |
9597 | case REFERENCE_TYPE: | |
830bfa74 MM |
9598 | if (TREE_CODE (arg) != REFERENCE_TYPE) |
9599 | return 1; | |
9600 | return unify (tparms, targs, TREE_TYPE (parm), TREE_TYPE (arg), | |
028d1f20 | 9601 | strict & UNIFY_ALLOW_MORE_CV_QUAL); |
8d08fdba MS |
9602 | |
9603 | case ARRAY_TYPE: | |
9604 | if (TREE_CODE (arg) != ARRAY_TYPE) | |
9605 | return 1; | |
3042d5be MM |
9606 | if ((TYPE_DOMAIN (parm) == NULL_TREE) |
9607 | != (TYPE_DOMAIN (arg) == NULL_TREE)) | |
9608 | return 1; | |
9609 | if (TYPE_DOMAIN (parm) != NULL_TREE | |
830bfa74 | 9610 | && unify (tparms, targs, TYPE_DOMAIN (parm), |
4393e105 | 9611 | TYPE_DOMAIN (arg), UNIFY_ALLOW_NONE) != 0) |
8d08fdba | 9612 | return 1; |
830bfa74 | 9613 | return unify (tparms, targs, TREE_TYPE (parm), TREE_TYPE (arg), |
712467a4 | 9614 | strict & UNIFY_ALLOW_MORE_CV_QUAL); |
8d08fdba MS |
9615 | |
9616 | case REAL_TYPE: | |
37c46b43 | 9617 | case COMPLEX_TYPE: |
c00996a3 | 9618 | case VECTOR_TYPE: |
8d08fdba | 9619 | case INTEGER_TYPE: |
42976354 | 9620 | case BOOLEAN_TYPE: |
5ad5a526 | 9621 | case VOID_TYPE: |
f376e137 MS |
9622 | if (TREE_CODE (arg) != TREE_CODE (parm)) |
9623 | return 1; | |
9624 | ||
514a1f18 JM |
9625 | if (TREE_CODE (parm) == INTEGER_TYPE |
9626 | && TREE_CODE (TYPE_MAX_VALUE (parm)) != INTEGER_CST) | |
8d08fdba MS |
9627 | { |
9628 | if (TYPE_MIN_VALUE (parm) && TYPE_MIN_VALUE (arg) | |
830bfa74 | 9629 | && unify (tparms, targs, TYPE_MIN_VALUE (parm), |
4393e105 | 9630 | TYPE_MIN_VALUE (arg), UNIFY_ALLOW_INTEGER)) |
8d08fdba MS |
9631 | return 1; |
9632 | if (TYPE_MAX_VALUE (parm) && TYPE_MAX_VALUE (arg) | |
830bfa74 | 9633 | && unify (tparms, targs, TYPE_MAX_VALUE (parm), |
d9f818d9 RS |
9634 | TYPE_MAX_VALUE (arg), |
9635 | UNIFY_ALLOW_INTEGER | UNIFY_ALLOW_MAX_CORRECTION)) | |
8d08fdba MS |
9636 | return 1; |
9637 | } | |
9edc3913 | 9638 | /* We have already checked cv-qualification at the top of the |
514a1f18 | 9639 | function. */ |
9edc3913 | 9640 | else if (!same_type_ignoring_top_level_qualifiers_p (arg, parm)) |
ca79f85d JM |
9641 | return 1; |
9642 | ||
8d08fdba MS |
9643 | /* As far as unification is concerned, this wins. Later checks |
9644 | will invalidate it if necessary. */ | |
9645 | return 0; | |
9646 | ||
9647 | /* Types INTEGER_CST and MINUS_EXPR can come from array bounds. */ | |
bd6dd845 | 9648 | /* Type INTEGER_CST can come from ordinary constant template args. */ |
8d08fdba | 9649 | case INTEGER_CST: |
bd6dd845 MS |
9650 | while (TREE_CODE (arg) == NOP_EXPR) |
9651 | arg = TREE_OPERAND (arg, 0); | |
9652 | ||
8d08fdba MS |
9653 | if (TREE_CODE (arg) != INTEGER_CST) |
9654 | return 1; | |
9655 | return !tree_int_cst_equal (parm, arg); | |
9656 | ||
8d08fdba MS |
9657 | case TREE_VEC: |
9658 | { | |
9659 | int i; | |
9660 | if (TREE_CODE (arg) != TREE_VEC) | |
9661 | return 1; | |
9662 | if (TREE_VEC_LENGTH (parm) != TREE_VEC_LENGTH (arg)) | |
9663 | return 1; | |
0dc09a61 | 9664 | for (i = 0; i < TREE_VEC_LENGTH (parm); ++i) |
830bfa74 | 9665 | if (unify (tparms, targs, |
8d08fdba | 9666 | TREE_VEC_ELT (parm, i), TREE_VEC_ELT (arg, i), |
4393e105 | 9667 | UNIFY_ALLOW_NONE)) |
8d08fdba MS |
9668 | return 1; |
9669 | return 0; | |
9670 | } | |
9671 | ||
8d08fdba | 9672 | case RECORD_TYPE: |
f181d4ae | 9673 | case UNION_TYPE: |
f181d4ae | 9674 | if (TREE_CODE (arg) != TREE_CODE (parm)) |
a4443a08 | 9675 | return 1; |
830bfa74 | 9676 | |
a7a64a77 MM |
9677 | if (TYPE_PTRMEMFUNC_P (parm)) |
9678 | { | |
9679 | if (!TYPE_PTRMEMFUNC_P (arg)) | |
9680 | return 1; | |
9681 | ||
9682 | return unify (tparms, targs, | |
9683 | TYPE_PTRMEMFUNC_FN_TYPE (parm), | |
9684 | TYPE_PTRMEMFUNC_FN_TYPE (arg), | |
9685 | strict); | |
9686 | } | |
9687 | ||
5db698f6 | 9688 | if (CLASSTYPE_TEMPLATE_INFO (parm)) |
5566b478 | 9689 | { |
6467930b | 9690 | tree t = NULL_TREE; |
4393e105 | 9691 | |
028d1f20 | 9692 | if (strict_in & UNIFY_ALLOW_DERIVED) |
4393e105 MM |
9693 | { |
9694 | /* First, we try to unify the PARM and ARG directly. */ | |
9695 | t = try_class_unification (tparms, targs, | |
9696 | parm, arg); | |
9697 | ||
9698 | if (!t) | |
9699 | { | |
9700 | /* Fallback to the special case allowed in | |
9701 | [temp.deduct.call]: | |
9702 | ||
9703 | If P is a class, and P has the form | |
9704 | template-id, then A can be a derived class of | |
9705 | the deduced A. Likewise, if P is a pointer to | |
9706 | a class of the form template-id, A can be a | |
9707 | pointer to a derived class pointed to by the | |
9708 | deduced A. */ | |
9709 | t = get_template_base (tparms, targs, | |
9710 | parm, arg); | |
9711 | ||
9712 | if (! t || t == error_mark_node) | |
9713 | return 1; | |
9714 | } | |
9715 | } | |
6df47b06 | 9716 | else if (CLASSTYPE_TEMPLATE_INFO (arg) |
9fbf56f7 MM |
9717 | && (CLASSTYPE_TI_TEMPLATE (parm) |
9718 | == CLASSTYPE_TI_TEMPLATE (arg))) | |
6df47b06 MM |
9719 | /* Perhaps PARM is something like S<U> and ARG is S<int>. |
9720 | Then, we should unify `int' and `U'. */ | |
6467930b | 9721 | t = arg; |
4393e105 | 9722 | else |
dc957d14 | 9723 | /* There's no chance of unification succeeding. */ |
5566b478 | 9724 | return 1; |
6467930b | 9725 | |
830bfa74 | 9726 | return unify (tparms, targs, CLASSTYPE_TI_ARGS (parm), |
4393e105 | 9727 | CLASSTYPE_TI_ARGS (t), UNIFY_ALLOW_NONE); |
5566b478 | 9728 | } |
9edc3913 | 9729 | else if (!same_type_ignoring_top_level_qualifiers_p (parm, arg)) |
5566b478 | 9730 | return 1; |
a4443a08 | 9731 | return 0; |
8d08fdba MS |
9732 | |
9733 | case METHOD_TYPE: | |
8d08fdba | 9734 | case FUNCTION_TYPE: |
830bfa74 | 9735 | if (TREE_CODE (arg) != TREE_CODE (parm)) |
8d08fdba | 9736 | return 1; |
830bfa74 MM |
9737 | |
9738 | if (unify (tparms, targs, TREE_TYPE (parm), | |
4393e105 | 9739 | TREE_TYPE (arg), UNIFY_ALLOW_NONE)) |
28cbf42c | 9740 | return 1; |
386b8a85 | 9741 | return type_unification_real (tparms, targs, TYPE_ARG_TYPES (parm), |
3b3ba9f0 | 9742 | TYPE_ARG_TYPES (arg), 1, |
e5214479 | 9743 | DEDUCE_EXACT, 0, -1); |
a4443a08 MS |
9744 | |
9745 | case OFFSET_TYPE: | |
9746 | if (TREE_CODE (arg) != OFFSET_TYPE) | |
9747 | return 1; | |
830bfa74 | 9748 | if (unify (tparms, targs, TYPE_OFFSET_BASETYPE (parm), |
4393e105 | 9749 | TYPE_OFFSET_BASETYPE (arg), UNIFY_ALLOW_NONE)) |
a4443a08 | 9750 | return 1; |
830bfa74 | 9751 | return unify (tparms, targs, TREE_TYPE (parm), TREE_TYPE (arg), |
4393e105 | 9752 | strict); |
a4443a08 | 9753 | |
f62dbf03 | 9754 | case CONST_DECL: |
a723baf1 MM |
9755 | if (DECL_TEMPLATE_PARM_P (parm)) |
9756 | return unify (tparms, targs, DECL_INITIAL (parm), arg, strict); | |
830bfa74 | 9757 | if (arg != decl_constant_value (parm)) |
f62dbf03 JM |
9758 | return 1; |
9759 | return 0; | |
9760 | ||
027905b4 KL |
9761 | case TEMPLATE_DECL: |
9762 | /* Matched cases are handled by the ARG == PARM test above. */ | |
9763 | return 1; | |
9764 | ||
53929c47 | 9765 | case MINUS_EXPR: |
d9f818d9 RS |
9766 | if (tree_int_cst_equal (TREE_OPERAND (parm, 1), integer_one_node) |
9767 | && (strict_in & UNIFY_ALLOW_MAX_CORRECTION)) | |
53929c47 JM |
9768 | { |
9769 | /* We handle this case specially, since it comes up with | |
9770 | arrays. In particular, something like: | |
9771 | ||
9772 | template <int N> void f(int (&x)[N]); | |
9773 | ||
9774 | Here, we are trying to unify the range type, which | |
9775 | looks like [0 ... (N - 1)]. */ | |
9776 | tree t, t1, t2; | |
9777 | t1 = TREE_OPERAND (parm, 0); | |
9778 | t2 = TREE_OPERAND (parm, 1); | |
9779 | ||
24e2e58e | 9780 | t = fold (build (PLUS_EXPR, integer_type_node, arg, t2)); |
53929c47 | 9781 | |
4393e105 | 9782 | return unify (tparms, targs, t1, t, strict); |
53929c47 JM |
9783 | } |
9784 | /* else fall through */ | |
9785 | ||
8d08fdba | 9786 | default: |
050367a3 | 9787 | if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (TREE_CODE (parm)))) |
74601d7c KL |
9788 | { |
9789 | ||
9790 | /* We're looking at an expression. This can happen with | |
9791 | something like: | |
4393e105 | 9792 | |
74601d7c KL |
9793 | template <int I> |
9794 | void foo(S<I>, S<I + 2>); | |
050367a3 | 9795 | |
74601d7c | 9796 | This is a "nondeduced context": |
050367a3 | 9797 | |
74601d7c | 9798 | [deduct.type] |
4393e105 | 9799 | |
74601d7c | 9800 | The nondeduced contexts are: |
050367a3 | 9801 | |
74601d7c KL |
9802 | --A type that is a template-id in which one or more of |
9803 | the template-arguments is an expression that references | |
9804 | a template-parameter. | |
050367a3 | 9805 | |
74601d7c KL |
9806 | In these cases, we assume deduction succeeded, but don't |
9807 | actually infer any unifications. */ | |
9808 | ||
9809 | if (!uses_template_parms (parm) | |
9810 | && !template_args_equal (parm, arg)) | |
9811 | return 1; | |
9812 | else | |
9813 | return 0; | |
9814 | } | |
050367a3 | 9815 | else |
b4c4a9ec MM |
9816 | sorry ("use of `%s' in template type unification", |
9817 | tree_code_name [(int) TREE_CODE (parm)]); | |
050367a3 | 9818 | |
8d08fdba MS |
9819 | return 1; |
9820 | } | |
9821 | } | |
8d08fdba | 9822 | \f |
03d0f4af MM |
9823 | /* Called if RESULT is explicitly instantiated, or is a member of an |
9824 | explicitly instantiated class, or if using -frepo and the | |
9825 | instantiation of RESULT has been assigned to this file. */ | |
9826 | ||
faae18ab | 9827 | void |
3a978d72 | 9828 | mark_decl_instantiated (tree result, int extern_p) |
faae18ab | 9829 | { |
3ae18eaf JM |
9830 | /* We used to set this unconditionally; we moved that to |
9831 | do_decl_instantiation so it wouldn't get set on members of | |
9832 | explicit class template instantiations. But we still need to set | |
9833 | it here for the 'extern template' case in order to suppress | |
9834 | implicit instantiations. */ | |
9835 | if (extern_p) | |
9836 | SET_DECL_EXPLICIT_INSTANTIATION (result); | |
9837 | ||
1f6f0cb6 MM |
9838 | /* If this entity has already been written out, it's too late to |
9839 | make any modifications. */ | |
9840 | if (TREE_ASM_WRITTEN (result)) | |
9841 | return; | |
9842 | ||
9843 | if (TREE_CODE (result) != FUNCTION_DECL) | |
9844 | /* The TREE_PUBLIC flag for function declarations will have been | |
9845 | set correctly by tsubst. */ | |
9846 | TREE_PUBLIC (result) = 1; | |
9847 | ||
346eeb15 JM |
9848 | /* This might have been set by an earlier implicit instantiation. */ |
9849 | DECL_COMDAT (result) = 0; | |
9850 | ||
faae18ab MS |
9851 | if (! extern_p) |
9852 | { | |
9853 | DECL_INTERFACE_KNOWN (result) = 1; | |
9854 | DECL_NOT_REALLY_EXTERN (result) = 1; | |
a7d87521 | 9855 | |
1a408d07 JM |
9856 | /* Always make artificials weak. */ |
9857 | if (DECL_ARTIFICIAL (result) && flag_weak) | |
9858 | comdat_linkage (result); | |
a7d87521 JM |
9859 | /* For WIN32 we also want to put explicit instantiations in |
9860 | linkonce sections. */ | |
1a408d07 | 9861 | else if (TREE_PUBLIC (result)) |
b385c841 | 9862 | maybe_make_one_only (result); |
faae18ab | 9863 | } |
1f6f0cb6 MM |
9864 | |
9865 | if (TREE_CODE (result) == FUNCTION_DECL) | |
56e770bf | 9866 | defer_fn (result); |
faae18ab MS |
9867 | } |
9868 | ||
e5214479 | 9869 | /* Given two function templates PAT1 and PAT2, return: |
6467930b | 9870 | |
62e4a758 NS |
9871 | DEDUCE should be DEDUCE_EXACT or DEDUCE_ORDER. |
9872 | ||
6467930b MS |
9873 | 1 if PAT1 is more specialized than PAT2 as described in [temp.func.order]. |
9874 | -1 if PAT2 is more specialized than PAT1. | |
e5214479 JM |
9875 | 0 if neither is more specialized. |
9876 | ||
9877 | LEN is passed through to fn_type_unification. */ | |
6467930b MS |
9878 | |
9879 | int | |
3a978d72 | 9880 | more_specialized (tree pat1, tree pat2, int deduce, int len) |
6467930b | 9881 | { |
98c1c668 | 9882 | tree targs; |
73aad9b9 | 9883 | int winner = 0; |
6467930b | 9884 | |
35c18a20 MM |
9885 | /* If template argument deduction succeeds, we substitute the |
9886 | resulting arguments into non-deduced contexts. While doing that, | |
9887 | we must be aware that we may encounter dependent types. */ | |
9888 | ++processing_template_decl; | |
62e4a758 NS |
9889 | targs = get_bindings_real (pat1, DECL_TEMPLATE_RESULT (pat2), |
9890 | NULL_TREE, 0, deduce, len); | |
73aad9b9 | 9891 | if (targs) |
36a117a5 | 9892 | --winner; |
6467930b | 9893 | |
62e4a758 NS |
9894 | targs = get_bindings_real (pat2, DECL_TEMPLATE_RESULT (pat1), |
9895 | NULL_TREE, 0, deduce, len); | |
73aad9b9 | 9896 | if (targs) |
36a117a5 | 9897 | ++winner; |
35c18a20 | 9898 | --processing_template_decl; |
6467930b | 9899 | |
73aad9b9 JM |
9900 | return winner; |
9901 | } | |
6467930b | 9902 | |
73aad9b9 | 9903 | /* Given two class template specialization list nodes PAT1 and PAT2, return: |
6467930b | 9904 | |
73aad9b9 JM |
9905 | 1 if PAT1 is more specialized than PAT2 as described in [temp.class.order]. |
9906 | -1 if PAT2 is more specialized than PAT1. | |
55ece1b3 KL |
9907 | 0 if neither is more specialized. |
9908 | ||
9909 | FULL_ARGS is the full set of template arguments that triggers this | |
9910 | partial ordering. */ | |
73aad9b9 JM |
9911 | |
9912 | int | |
55ece1b3 | 9913 | more_specialized_class (tree pat1, tree pat2, tree full_args) |
73aad9b9 JM |
9914 | { |
9915 | tree targs; | |
9916 | int winner = 0; | |
9917 | ||
36a117a5 | 9918 | targs = get_class_bindings (TREE_VALUE (pat1), TREE_PURPOSE (pat1), |
55ece1b3 | 9919 | add_outermost_template_args (full_args, TREE_PURPOSE (pat2))); |
73aad9b9 JM |
9920 | if (targs) |
9921 | --winner; | |
9922 | ||
36a117a5 | 9923 | targs = get_class_bindings (TREE_VALUE (pat2), TREE_PURPOSE (pat2), |
55ece1b3 | 9924 | add_outermost_template_args (full_args, TREE_PURPOSE (pat1))); |
73aad9b9 | 9925 | if (targs) |
6467930b MS |
9926 | ++winner; |
9927 | ||
9928 | return winner; | |
9929 | } | |
73aad9b9 JM |
9930 | |
9931 | /* Return the template arguments that will produce the function signature | |
e1467ff2 | 9932 | DECL from the function template FN, with the explicit template |
76b9a14d | 9933 | arguments EXPLICIT_ARGS. If CHECK_RETTYPE is 1, the return type must |
4393e105 | 9934 | also match. Return NULL_TREE if no satisfactory arguments could be |
62e4a758 | 9935 | found. DEDUCE and LEN are passed through to fn_type_unification. */ |
e5214479 | 9936 | |
76b9a14d | 9937 | static tree |
3a978d72 NN |
9938 | get_bindings_real (tree fn, |
9939 | tree decl, | |
9940 | tree explicit_args, | |
9941 | int check_rettype, | |
9942 | int deduce, | |
9943 | int len) | |
73aad9b9 | 9944 | { |
98c1c668 | 9945 | int ntparms = DECL_NTPARMS (fn); |
f31c0a32 | 9946 | tree targs = make_tree_vec (ntparms); |
4393e105 | 9947 | tree decl_type; |
03017874 | 9948 | tree decl_arg_types; |
98c1c668 JM |
9949 | int i; |
9950 | ||
4393e105 MM |
9951 | /* Substitute the explicit template arguments into the type of DECL. |
9952 | The call to fn_type_unification will handle substitution into the | |
9953 | FN. */ | |
9954 | decl_type = TREE_TYPE (decl); | |
9955 | if (explicit_args && uses_template_parms (decl_type)) | |
9956 | { | |
9957 | tree tmpl; | |
9958 | tree converted_args; | |
9959 | ||
9960 | if (DECL_TEMPLATE_INFO (decl)) | |
9961 | tmpl = DECL_TI_TEMPLATE (decl); | |
9962 | else | |
0e339752 | 9963 | /* We can get here for some invalid specializations. */ |
4393e105 MM |
9964 | return NULL_TREE; |
9965 | ||
9966 | converted_args | |
9967 | = (coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (tmpl), | |
9968 | explicit_args, NULL_TREE, | |
c2ea3a40 | 9969 | tf_none, /*require_all_arguments=*/0)); |
4393e105 MM |
9970 | if (converted_args == error_mark_node) |
9971 | return NULL_TREE; | |
9972 | ||
c2ea3a40 | 9973 | decl_type = tsubst (decl_type, converted_args, tf_none, NULL_TREE); |
4393e105 MM |
9974 | if (decl_type == error_mark_node) |
9975 | return NULL_TREE; | |
9976 | } | |
9977 | ||
9978 | decl_arg_types = TYPE_ARG_TYPES (decl_type); | |
e5214479 JM |
9979 | /* Never do unification on the 'this' parameter. */ |
9980 | if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl)) | |
03017874 | 9981 | decl_arg_types = TREE_CHAIN (decl_arg_types); |
d7684f2d | 9982 | |
e1467ff2 | 9983 | i = fn_type_unification (fn, explicit_args, targs, |
03017874 | 9984 | decl_arg_types, |
8d3631f8 NS |
9985 | (check_rettype || DECL_CONV_FN_P (fn) |
9986 | ? TREE_TYPE (decl_type) : NULL_TREE), | |
62e4a758 | 9987 | deduce, len); |
98c1c668 | 9988 | |
76b9a14d JM |
9989 | if (i != 0) |
9990 | return NULL_TREE; | |
9991 | ||
76b9a14d JM |
9992 | return targs; |
9993 | } | |
9994 | ||
9995 | /* For most uses, we want to check the return type. */ | |
9996 | ||
eb1dfbb2 | 9997 | static tree |
3a978d72 | 9998 | get_bindings (tree fn, tree decl, tree explicit_args) |
76b9a14d | 9999 | { |
62e4a758 | 10000 | return get_bindings_real (fn, decl, explicit_args, 1, DEDUCE_EXACT, -1); |
76b9a14d JM |
10001 | } |
10002 | ||
e5214479 JM |
10003 | /* But for resolve_overloaded_unification, we only care about the parameter |
10004 | types. */ | |
76b9a14d JM |
10005 | |
10006 | static tree | |
3a978d72 | 10007 | get_bindings_overload (tree fn, tree decl, tree explicit_args) |
76b9a14d | 10008 | { |
62e4a758 | 10009 | return get_bindings_real (fn, decl, explicit_args, 0, DEDUCE_EXACT, -1); |
73aad9b9 JM |
10010 | } |
10011 | ||
36a117a5 MM |
10012 | /* Return the innermost template arguments that, when applied to a |
10013 | template specialization whose innermost template parameters are | |
9471d3e2 | 10014 | TPARMS, and whose specialization arguments are PARMS, yield the |
36a117a5 MM |
10015 | ARGS. |
10016 | ||
10017 | For example, suppose we have: | |
10018 | ||
10019 | template <class T, class U> struct S {}; | |
10020 | template <class T> struct S<T*, int> {}; | |
10021 | ||
10022 | Then, suppose we want to get `S<double*, int>'. The TPARMS will be | |
10023 | {T}, the PARMS will be {T*, int} and the ARGS will be {double*, | |
10024 | int}. The resulting vector will be {double}, indicating that `T' | |
10025 | is bound to `double'. */ | |
10026 | ||
bd6dd845 | 10027 | static tree |
3a978d72 | 10028 | get_class_bindings (tree tparms, tree parms, tree args) |
73aad9b9 | 10029 | { |
3b3ba9f0 | 10030 | int i, ntparms = TREE_VEC_LENGTH (tparms); |
f31c0a32 | 10031 | tree vec = make_tree_vec (ntparms); |
73aad9b9 | 10032 | |
74601d7c KL |
10033 | if (unify (tparms, vec, parms, INNERMOST_TEMPLATE_ARGS (args), |
10034 | UNIFY_ALLOW_NONE)) | |
fcfb9f96 | 10035 | return NULL_TREE; |
73aad9b9 JM |
10036 | |
10037 | for (i = 0; i < ntparms; ++i) | |
10038 | if (! TREE_VEC_ELT (vec, i)) | |
10039 | return NULL_TREE; | |
10040 | ||
74601d7c KL |
10041 | if (verify_class_unification (vec, parms, args)) |
10042 | return NULL_TREE; | |
10043 | ||
73aad9b9 JM |
10044 | return vec; |
10045 | } | |
10046 | ||
104bf76a MM |
10047 | /* In INSTANTIATIONS is a list of <INSTANTIATION, TEMPLATE> pairs. |
10048 | Pick the most specialized template, and return the corresponding | |
10049 | instantiation, or if there is no corresponding instantiation, the | |
e5214479 JM |
10050 | template itself. If there is no most specialized template, |
10051 | error_mark_node is returned. If there are no templates at all, | |
10052 | NULL_TREE is returned. */ | |
73aad9b9 JM |
10053 | |
10054 | tree | |
3a978d72 | 10055 | most_specialized_instantiation (tree instantiations) |
73aad9b9 | 10056 | { |
104bf76a | 10057 | tree fn, champ; |
73aad9b9 JM |
10058 | int fate; |
10059 | ||
104bf76a | 10060 | if (!instantiations) |
73aad9b9 JM |
10061 | return NULL_TREE; |
10062 | ||
104bf76a MM |
10063 | champ = instantiations; |
10064 | for (fn = TREE_CHAIN (instantiations); fn; fn = TREE_CHAIN (fn)) | |
73aad9b9 | 10065 | { |
62e4a758 NS |
10066 | fate = more_specialized (TREE_VALUE (champ), TREE_VALUE (fn), |
10067 | DEDUCE_EXACT, -1); | |
73aad9b9 JM |
10068 | if (fate == 1) |
10069 | ; | |
10070 | else | |
10071 | { | |
10072 | if (fate == 0) | |
10073 | { | |
10074 | fn = TREE_CHAIN (fn); | |
10075 | if (! fn) | |
10076 | return error_mark_node; | |
10077 | } | |
104bf76a | 10078 | champ = fn; |
73aad9b9 JM |
10079 | } |
10080 | } | |
10081 | ||
104bf76a | 10082 | for (fn = instantiations; fn && fn != champ; fn = TREE_CHAIN (fn)) |
73aad9b9 | 10083 | { |
62e4a758 NS |
10084 | fate = more_specialized (TREE_VALUE (champ), TREE_VALUE (fn), |
10085 | DEDUCE_EXACT, -1); | |
73aad9b9 JM |
10086 | if (fate != 1) |
10087 | return error_mark_node; | |
10088 | } | |
10089 | ||
104bf76a MM |
10090 | return TREE_PURPOSE (champ) ? TREE_PURPOSE (champ) : TREE_VALUE (champ); |
10091 | } | |
10092 | ||
10093 | /* Return the most specialized of the list of templates in FNS that can | |
10094 | produce an instantiation matching DECL, given the explicit template | |
10095 | arguments EXPLICIT_ARGS. */ | |
10096 | ||
e9659ab0 | 10097 | static tree |
3a978d72 | 10098 | most_specialized (tree fns, tree decl, tree explicit_args) |
104bf76a MM |
10099 | { |
10100 | tree candidates = NULL_TREE; | |
10101 | tree fn, args; | |
10102 | ||
10103 | for (fn = fns; fn; fn = TREE_CHAIN (fn)) | |
10104 | { | |
10105 | tree candidate = TREE_VALUE (fn); | |
10106 | ||
10107 | args = get_bindings (candidate, decl, explicit_args); | |
10108 | if (args) | |
e1b3e07d | 10109 | candidates = tree_cons (NULL_TREE, candidate, candidates); |
104bf76a MM |
10110 | } |
10111 | ||
e5214479 | 10112 | return most_specialized_instantiation (candidates); |
73aad9b9 JM |
10113 | } |
10114 | ||
36a117a5 | 10115 | /* If DECL is a specialization of some template, return the most |
f9a7ae04 MM |
10116 | general such template. Otherwise, returns NULL_TREE. |
10117 | ||
10118 | For example, given: | |
36a117a5 MM |
10119 | |
10120 | template <class T> struct S { template <class U> void f(U); }; | |
10121 | ||
10122 | if TMPL is `template <class U> void S<int>::f(U)' this will return | |
10123 | the full template. This function will not trace past partial | |
10124 | specializations, however. For example, given in addition: | |
10125 | ||
10126 | template <class T> struct S<T*> { template <class U> void f(U); }; | |
10127 | ||
10128 | if TMPL is `template <class U> void S<int*>::f(U)' this will return | |
10129 | `template <class T> template <class U> S<T*>::f(U)'. */ | |
73aad9b9 | 10130 | |
612c671a | 10131 | tree |
3a978d72 | 10132 | most_general_template (tree decl) |
73aad9b9 | 10133 | { |
f9a7ae04 MM |
10134 | /* If DECL is a FUNCTION_DECL, find the TEMPLATE_DECL of which it is |
10135 | an immediate specialization. */ | |
10136 | if (TREE_CODE (decl) == FUNCTION_DECL) | |
10137 | { | |
10138 | if (DECL_TEMPLATE_INFO (decl)) { | |
10139 | decl = DECL_TI_TEMPLATE (decl); | |
10140 | ||
10141 | /* The DECL_TI_TEMPLATE can be an IDENTIFIER_NODE for a | |
10142 | template friend. */ | |
10143 | if (TREE_CODE (decl) != TEMPLATE_DECL) | |
10144 | return NULL_TREE; | |
10145 | } else | |
10146 | return NULL_TREE; | |
10147 | } | |
10148 | ||
10149 | /* Look for more and more general templates. */ | |
10150 | while (DECL_TEMPLATE_INFO (decl)) | |
10151 | { | |
10b1d5e7 MM |
10152 | /* The DECL_TI_TEMPLATE can be an IDENTIFIER_NODE in some cases. |
10153 | (See cp-tree.h for details.) */ | |
f9a7ae04 MM |
10154 | if (TREE_CODE (DECL_TI_TEMPLATE (decl)) != TEMPLATE_DECL) |
10155 | break; | |
10156 | ||
6e049fcd KL |
10157 | if (CLASS_TYPE_P (TREE_TYPE (decl)) |
10158 | && CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_TYPE (decl))) | |
10159 | break; | |
10160 | ||
f9a7ae04 MM |
10161 | /* Stop if we run into an explicitly specialized class template. */ |
10162 | if (!DECL_NAMESPACE_SCOPE_P (decl) | |
10163 | && DECL_CONTEXT (decl) | |
10164 | && CLASSTYPE_TEMPLATE_SPECIALIZATION (DECL_CONTEXT (decl))) | |
10165 | break; | |
10166 | ||
10167 | decl = DECL_TI_TEMPLATE (decl); | |
10168 | } | |
36a117a5 MM |
10169 | |
10170 | return decl; | |
10171 | } | |
10172 | ||
10173 | /* Return the most specialized of the class template specializations | |
10174 | of TMPL which can produce an instantiation matching ARGS, or | |
10175 | error_mark_node if the choice is ambiguous. */ | |
10176 | ||
e9659ab0 | 10177 | static tree |
3a978d72 | 10178 | most_specialized_class (tree tmpl, tree args) |
36a117a5 MM |
10179 | { |
10180 | tree list = NULL_TREE; | |
10181 | tree t; | |
10182 | tree champ; | |
73aad9b9 JM |
10183 | int fate; |
10184 | ||
36a117a5 MM |
10185 | tmpl = most_general_template (tmpl); |
10186 | for (t = DECL_TEMPLATE_SPECIALIZATIONS (tmpl); t; t = TREE_CHAIN (t)) | |
73aad9b9 | 10187 | { |
36a117a5 MM |
10188 | tree spec_args |
10189 | = get_class_bindings (TREE_VALUE (t), TREE_PURPOSE (t), args); | |
10190 | if (spec_args) | |
73aad9b9 | 10191 | { |
1f8f4a0b | 10192 | list = tree_cons (TREE_PURPOSE (t), TREE_VALUE (t), list); |
73aad9b9 JM |
10193 | TREE_TYPE (list) = TREE_TYPE (t); |
10194 | } | |
10195 | } | |
10196 | ||
10197 | if (! list) | |
10198 | return NULL_TREE; | |
10199 | ||
10200 | t = list; | |
10201 | champ = t; | |
10202 | t = TREE_CHAIN (t); | |
10203 | for (; t; t = TREE_CHAIN (t)) | |
10204 | { | |
55ece1b3 | 10205 | fate = more_specialized_class (champ, t, args); |
73aad9b9 JM |
10206 | if (fate == 1) |
10207 | ; | |
10208 | else | |
10209 | { | |
10210 | if (fate == 0) | |
10211 | { | |
10212 | t = TREE_CHAIN (t); | |
10213 | if (! t) | |
10214 | return error_mark_node; | |
10215 | } | |
10216 | champ = t; | |
10217 | } | |
10218 | } | |
10219 | ||
10220 | for (t = list; t && t != champ; t = TREE_CHAIN (t)) | |
10221 | { | |
55ece1b3 | 10222 | fate = more_specialized_class (champ, t, args); |
73aad9b9 JM |
10223 | if (fate != 1) |
10224 | return error_mark_node; | |
10225 | } | |
10226 | ||
10227 | return champ; | |
10228 | } | |
10229 | ||
eb8845be | 10230 | /* Explicitly instantiate DECL. */ |
e92cc029 | 10231 | |
8d08fdba | 10232 | void |
eb8845be | 10233 | do_decl_instantiation (tree decl, tree storage) |
8d08fdba | 10234 | { |
8d08fdba | 10235 | tree result = NULL_TREE; |
faae18ab | 10236 | int extern_p = 0; |
e8abc66f | 10237 | |
3fa56191 | 10238 | if (!decl) |
dc957d14 | 10239 | /* An error occurred, for which grokdeclarator has already issued |
3fa56191 MM |
10240 | an appropriate message. */ |
10241 | return; | |
10242 | else if (! DECL_LANG_SPECIFIC (decl)) | |
ec255269 | 10243 | { |
33bd39a2 | 10244 | error ("explicit instantiation of non-template `%#D'", decl); |
ec255269 MS |
10245 | return; |
10246 | } | |
03d0f4af | 10247 | else if (TREE_CODE (decl) == VAR_DECL) |
6633d636 | 10248 | { |
03d0f4af MM |
10249 | /* There is an asymmetry here in the way VAR_DECLs and |
10250 | FUNCTION_DECLs are handled by grokdeclarator. In the case of | |
10251 | the latter, the DECL we get back will be marked as a | |
10252 | template instantiation, and the appropriate | |
10253 | DECL_TEMPLATE_INFO will be set up. This does not happen for | |
10254 | VAR_DECLs so we do the lookup here. Probably, grokdeclarator | |
10255 | should handle VAR_DECLs as it currently handles | |
10256 | FUNCTION_DECLs. */ | |
86ac0575 | 10257 | result = lookup_field (DECL_CONTEXT (decl), DECL_NAME (decl), 0, false); |
e0860732 | 10258 | if (!result || TREE_CODE (result) != VAR_DECL) |
03d0f4af | 10259 | { |
e0860732 | 10260 | error ("no matching template for `%D' found", decl); |
03d0f4af MM |
10261 | return; |
10262 | } | |
6633d636 MS |
10263 | } |
10264 | else if (TREE_CODE (decl) != FUNCTION_DECL) | |
10265 | { | |
33bd39a2 | 10266 | error ("explicit instantiation of `%#D'", decl); |
6633d636 MS |
10267 | return; |
10268 | } | |
03d0f4af MM |
10269 | else |
10270 | result = decl; | |
672476cb | 10271 | |
03d0f4af | 10272 | /* Check for various error cases. Note that if the explicit |
0e339752 | 10273 | instantiation is valid the RESULT will currently be marked as an |
03d0f4af MM |
10274 | *implicit* instantiation; DECL_EXPLICIT_INSTANTIATION is not set |
10275 | until we get here. */ | |
10276 | ||
10277 | if (DECL_TEMPLATE_SPECIALIZATION (result)) | |
672476cb | 10278 | { |
07782718 KL |
10279 | /* DR 259 [temp.spec]. |
10280 | ||
10281 | Both an explicit instantiation and a declaration of an explicit | |
10282 | specialization shall not appear in a program unless the explicit | |
10283 | instantiation follows a declaration of the explicit specialization. | |
03d0f4af | 10284 | |
07782718 KL |
10285 | For a given set of template parameters, if an explicit |
10286 | instantiation of a template appears after a declaration of an | |
10287 | explicit specialization for that template, the explicit | |
10288 | instantiation has no effect. */ | |
672476cb MM |
10289 | return; |
10290 | } | |
03d0f4af MM |
10291 | else if (DECL_EXPLICIT_INSTANTIATION (result)) |
10292 | { | |
10293 | /* [temp.spec] | |
98c1c668 | 10294 | |
03d0f4af MM |
10295 | No program shall explicitly instantiate any template more |
10296 | than once. | |
10297 | ||
2aaf816d JM |
10298 | We check DECL_INTERFACE_KNOWN so as not to complain when the first |
10299 | instantiation was `extern' and the second is not, and EXTERN_P for | |
10300 | the opposite case. If -frepo, chances are we already got marked | |
dc957d14 | 10301 | as an explicit instantiation because of the repo file. */ |
2aaf816d | 10302 | if (DECL_INTERFACE_KNOWN (result) && !extern_p && !flag_use_repository) |
33bd39a2 | 10303 | pedwarn ("duplicate explicit instantiation of `%#D'", result); |
03d0f4af MM |
10304 | |
10305 | /* If we've already instantiated the template, just return now. */ | |
10306 | if (DECL_INTERFACE_KNOWN (result)) | |
10307 | return; | |
10308 | } | |
10309 | else if (!DECL_IMPLICIT_INSTANTIATION (result)) | |
faae18ab | 10310 | { |
33bd39a2 | 10311 | error ("no matching template for `%D' found", result); |
faae18ab MS |
10312 | return; |
10313 | } | |
03d0f4af | 10314 | else if (!DECL_TEMPLATE_INFO (result)) |
6633d636 | 10315 | { |
33bd39a2 | 10316 | pedwarn ("explicit instantiation of non-template `%#D'", result); |
6633d636 MS |
10317 | return; |
10318 | } | |
10319 | ||
a0a33927 MS |
10320 | if (flag_external_templates) |
10321 | return; | |
10322 | ||
f0e01782 | 10323 | if (storage == NULL_TREE) |
00595019 | 10324 | ; |
faae18ab | 10325 | else if (storage == ridpointers[(int) RID_EXTERN]) |
03d0f4af | 10326 | { |
c02f5e29 | 10327 | if (pedantic && !in_system_header) |
33bd39a2 | 10328 | pedwarn ("ISO C++ forbids the use of `extern' on explicit instantiations"); |
03d0f4af MM |
10329 | extern_p = 1; |
10330 | } | |
f0e01782 | 10331 | else |
33bd39a2 | 10332 | error ("storage class `%D' applied to template instantiation", |
f0e01782 | 10333 | storage); |
5566b478 | 10334 | |
03d0f4af | 10335 | SET_DECL_EXPLICIT_INSTANTIATION (result); |
5566b478 | 10336 | mark_decl_instantiated (result, extern_p); |
44a8d0b3 | 10337 | repo_template_instantiated (result, extern_p); |
c91a56d2 | 10338 | if (! extern_p) |
16d53b64 | 10339 | instantiate_decl (result, /*defer_ok=*/1); |
7177d104 MS |
10340 | } |
10341 | ||
faae18ab | 10342 | void |
3a978d72 | 10343 | mark_class_instantiated (tree t, int extern_p) |
faae18ab MS |
10344 | { |
10345 | SET_CLASSTYPE_EXPLICIT_INSTANTIATION (t); | |
eb773359 JM |
10346 | SET_CLASSTYPE_INTERFACE_KNOWN (t); |
10347 | CLASSTYPE_INTERFACE_ONLY (t) = extern_p; | |
faae18ab MS |
10348 | TYPE_DECL_SUPPRESS_DEBUG (TYPE_NAME (t)) = extern_p; |
10349 | if (! extern_p) | |
10350 | { | |
10351 | CLASSTYPE_DEBUG_REQUESTED (t) = 1; | |
10352 | rest_of_type_compilation (t, 1); | |
10353 | } | |
10354 | } | |
e8abc66f | 10355 | |
5e0c54e5 | 10356 | /* Called from do_type_instantiation through binding_table_foreach to |
9bcb9aae | 10357 | do recursive instantiation for the type bound in ENTRY. */ |
5e0c54e5 GDR |
10358 | static void |
10359 | bt_instantiate_type_proc (binding_entry entry, void *data) | |
10360 | { | |
10361 | tree storage = *(tree *) data; | |
10362 | ||
10363 | if (IS_AGGR_TYPE (entry->type) | |
10364 | && !uses_template_parms (CLASSTYPE_TI_ARGS (entry->type))) | |
10365 | do_type_instantiation (TYPE_MAIN_DECL (entry->type), storage, 0); | |
10366 | } | |
10367 | ||
a1bcc528 JM |
10368 | /* Perform an explicit instantiation of template class T. STORAGE, if |
10369 | non-null, is the RID for extern, inline or static. COMPLAIN is | |
838dfd8a | 10370 | nonzero if this is called from the parser, zero if called recursively, |
a1bcc528 JM |
10371 | since the standard is unclear (as detailed below). */ |
10372 | ||
7177d104 | 10373 | void |
3a978d72 | 10374 | do_type_instantiation (tree t, tree storage, tsubst_flags_t complain) |
7177d104 | 10375 | { |
e8abc66f MS |
10376 | int extern_p = 0; |
10377 | int nomem_p = 0; | |
5566b478 MS |
10378 | int static_p = 0; |
10379 | ||
ca79f85d JM |
10380 | if (TREE_CODE (t) == TYPE_DECL) |
10381 | t = TREE_TYPE (t); | |
10382 | ||
7ddedda4 | 10383 | if (! CLASS_TYPE_P (t) || ! CLASSTYPE_TEMPLATE_INFO (t)) |
ca79f85d | 10384 | { |
33bd39a2 | 10385 | error ("explicit instantiation of non-template type `%T'", t); |
ca79f85d JM |
10386 | return; |
10387 | } | |
10388 | ||
5566b478 | 10389 | complete_type (t); |
7177d104 | 10390 | |
a292b002 MS |
10391 | /* With -fexternal-templates, explicit instantiations are treated the same |
10392 | as implicit ones. */ | |
a0a33927 MS |
10393 | if (flag_external_templates) |
10394 | return; | |
10395 | ||
d0f062fb | 10396 | if (!COMPLETE_TYPE_P (t)) |
f0e01782 | 10397 | { |
c2ea3a40 | 10398 | if (complain & tf_error) |
33bd39a2 | 10399 | error ("explicit instantiation of `%#T' before definition of template", |
a1bcc528 | 10400 | t); |
f0e01782 MS |
10401 | return; |
10402 | } | |
10403 | ||
03d0f4af | 10404 | if (storage != NULL_TREE) |
f0e01782 | 10405 | { |
c02f5e29 | 10406 | if (pedantic && !in_system_header) |
33bd39a2 | 10407 | pedwarn("ISO C++ forbids the use of `%s' on explicit instantiations", |
8251199e | 10408 | IDENTIFIER_POINTER (storage)); |
03d0f4af MM |
10409 | |
10410 | if (storage == ridpointers[(int) RID_INLINE]) | |
10411 | nomem_p = 1; | |
10412 | else if (storage == ridpointers[(int) RID_EXTERN]) | |
10413 | extern_p = 1; | |
10414 | else if (storage == ridpointers[(int) RID_STATIC]) | |
10415 | static_p = 1; | |
10416 | else | |
10417 | { | |
33bd39a2 | 10418 | error ("storage class `%D' applied to template instantiation", |
03d0f4af MM |
10419 | storage); |
10420 | extern_p = 0; | |
10421 | } | |
f0e01782 MS |
10422 | } |
10423 | ||
370af2d5 | 10424 | if (CLASSTYPE_TEMPLATE_SPECIALIZATION (t)) |
03d0f4af | 10425 | { |
07782718 | 10426 | /* DR 259 [temp.spec]. |
a292b002 | 10427 | |
07782718 KL |
10428 | Both an explicit instantiation and a declaration of an explicit |
10429 | specialization shall not appear in a program unless the explicit | |
10430 | instantiation follows a declaration of the explicit specialization. | |
10431 | ||
10432 | For a given set of template parameters, if an explicit | |
10433 | instantiation of a template appears after a declaration of an | |
10434 | explicit specialization for that template, the explicit | |
10435 | instantiation has no effect. */ | |
03d0f4af MM |
10436 | return; |
10437 | } | |
10438 | else if (CLASSTYPE_EXPLICIT_INSTANTIATION (t)) | |
44a8d0b3 | 10439 | { |
03d0f4af MM |
10440 | /* [temp.spec] |
10441 | ||
10442 | No program shall explicitly instantiate any template more | |
10443 | than once. | |
10444 | ||
2aaf816d JM |
10445 | If CLASSTYPE_INTERFACE_ONLY, then the first explicit instantiation |
10446 | was `extern'. If EXTERN_P then the second is. If -frepo, chances | |
aba649ba | 10447 | are we already got marked as an explicit instantiation because of the |
2aaf816d | 10448 | repo file. All these cases are OK. */ |
a1bcc528 | 10449 | if (!CLASSTYPE_INTERFACE_ONLY (t) && !extern_p && !flag_use_repository |
c2ea3a40 | 10450 | && (complain & tf_error)) |
33bd39a2 | 10451 | pedwarn ("duplicate explicit instantiation of `%#T'", t); |
03d0f4af MM |
10452 | |
10453 | /* If we've already instantiated the template, just return now. */ | |
10454 | if (!CLASSTYPE_INTERFACE_ONLY (t)) | |
10455 | return; | |
44a8d0b3 | 10456 | } |
e8abc66f | 10457 | |
03d0f4af MM |
10458 | mark_class_instantiated (t, extern_p); |
10459 | repo_template_instantiated (t, extern_p); | |
10460 | ||
e8abc66f MS |
10461 | if (nomem_p) |
10462 | return; | |
10463 | ||
7177d104 | 10464 | { |
db5ae43f | 10465 | tree tmp; |
5566b478 | 10466 | |
03d0f4af MM |
10467 | /* In contrast to implicit instantiation, where only the |
10468 | declarations, and not the definitions, of members are | |
10469 | instantiated, we have here: | |
10470 | ||
10471 | [temp.explicit] | |
10472 | ||
10473 | The explicit instantiation of a class template specialization | |
10474 | implies the instantiation of all of its members not | |
10475 | previously explicitly specialized in the translation unit | |
10476 | containing the explicit instantiation. | |
10477 | ||
10478 | Of course, we can't instantiate member template classes, since | |
10479 | we don't have any arguments for them. Note that the standard | |
dc957d14 | 10480 | is unclear on whether the instantiation of the members are |
03d0f4af MM |
10481 | *explicit* instantiations or not. We choose to be generous, |
10482 | and not set DECL_EXPLICIT_INSTANTIATION. Therefore, we allow | |
10483 | the explicit instantiation of a class where some of the members | |
10484 | have no definition in the current translation unit. */ | |
10485 | ||
5566b478 MS |
10486 | if (! static_p) |
10487 | for (tmp = TYPE_METHODS (t); tmp; tmp = TREE_CHAIN (tmp)) | |
a7d87521 | 10488 | if (TREE_CODE (tmp) == FUNCTION_DECL |
1f109f0f | 10489 | && DECL_TEMPLATE_INSTANTIATION (tmp)) |
5566b478 MS |
10490 | { |
10491 | mark_decl_instantiated (tmp, extern_p); | |
10492 | repo_template_instantiated (tmp, extern_p); | |
10493 | if (! extern_p) | |
16d53b64 | 10494 | instantiate_decl (tmp, /*defer_ok=*/1); |
5566b478 MS |
10495 | } |
10496 | ||
10497 | for (tmp = TYPE_FIELDS (t); tmp; tmp = TREE_CHAIN (tmp)) | |
10498 | if (TREE_CODE (tmp) == VAR_DECL && DECL_TEMPLATE_INSTANTIATION (tmp)) | |
863adfc0 | 10499 | { |
5566b478 | 10500 | mark_decl_instantiated (tmp, extern_p); |
863adfc0 | 10501 | repo_template_instantiated (tmp, extern_p); |
5566b478 | 10502 | if (! extern_p) |
16d53b64 | 10503 | instantiate_decl (tmp, /*defer_ok=*/1); |
863adfc0 | 10504 | } |
7177d104 | 10505 | |
5e0c54e5 GDR |
10506 | if (CLASSTYPE_NESTED_UTDS (t)) |
10507 | binding_table_foreach (CLASSTYPE_NESTED_UTDS (t), | |
10508 | bt_instantiate_type_proc, &storage); | |
a292b002 | 10509 | } |
8d08fdba | 10510 | } |
a28e3c7f | 10511 | |
36a117a5 MM |
10512 | /* Given a function DECL, which is a specialization of TMPL, modify |
10513 | DECL to be a re-instantiation of TMPL with the same template | |
10514 | arguments. TMPL should be the template into which tsubst'ing | |
10515 | should occur for DECL, not the most general template. | |
830bfa74 MM |
10516 | |
10517 | One reason for doing this is a scenario like this: | |
10518 | ||
10519 | template <class T> | |
10520 | void f(const T&, int i); | |
10521 | ||
10522 | void g() { f(3, 7); } | |
10523 | ||
10524 | template <class T> | |
10525 | void f(const T& t, const int i) { } | |
10526 | ||
10527 | Note that when the template is first instantiated, with | |
10528 | instantiate_template, the resulting DECL will have no name for the | |
10529 | first parameter, and the wrong type for the second. So, when we go | |
10530 | to instantiate the DECL, we regenerate it. */ | |
10531 | ||
e9659ab0 | 10532 | static void |
3a978d72 | 10533 | regenerate_decl_from_template (tree decl, tree tmpl) |
830bfa74 | 10534 | { |
f9a7ae04 MM |
10535 | /* The most general version of TMPL. */ |
10536 | tree gen_tmpl; | |
10537 | /* The arguments used to instantiate DECL, from the most general | |
10538 | template. */ | |
830bfa74 | 10539 | tree args; |
830bfa74 MM |
10540 | tree code_pattern; |
10541 | tree new_decl; | |
b3445994 | 10542 | bool unregistered; |
830bfa74 MM |
10543 | |
10544 | args = DECL_TI_ARGS (decl); | |
10545 | code_pattern = DECL_TEMPLATE_RESULT (tmpl); | |
10546 | ||
8251199e JM |
10547 | /* Unregister the specialization so that when we tsubst we will not |
10548 | just return DECL. We don't have to unregister DECL from TMPL | |
10549 | because if would only be registered there if it were a partial | |
10550 | instantiation of a specialization, which it isn't: it's a full | |
10551 | instantiation. */ | |
36a117a5 | 10552 | gen_tmpl = most_general_template (tmpl); |
b3445994 MM |
10553 | unregistered = reregister_specialization (decl, gen_tmpl, |
10554 | /*new_spec=*/NULL_TREE); | |
36a117a5 MM |
10555 | |
10556 | /* If the DECL was not unregistered then something peculiar is | |
10557 | happening: we created a specialization but did not call | |
10558 | register_specialization for it. */ | |
10559 | my_friendly_assert (unregistered, 0); | |
10560 | ||
2b907f5c KL |
10561 | /* Make sure that we can see identifiers, and compute access |
10562 | correctly. */ | |
10563 | push_access_scope (decl); | |
10564 | ||
d8c4447d | 10565 | /* Do the substitution to get the new declaration. */ |
c2ea3a40 | 10566 | new_decl = tsubst (code_pattern, args, tf_error, NULL_TREE); |
830bfa74 MM |
10567 | |
10568 | if (TREE_CODE (decl) == VAR_DECL) | |
10569 | { | |
10570 | /* Set up DECL_INITIAL, since tsubst doesn't. */ | |
17bbb839 MM |
10571 | if (!DECL_INITIALIZED_IN_CLASS_P (decl)) |
10572 | DECL_INITIAL (new_decl) = | |
10573 | tsubst_expr (DECL_INITIAL (code_pattern), args, | |
10574 | tf_error, DECL_TI_TEMPLATE (decl)); | |
830bfa74 | 10575 | } |
2b0a63a3 | 10576 | else if (TREE_CODE (decl) == FUNCTION_DECL) |
fbf1c34b MM |
10577 | { |
10578 | /* Convince duplicate_decls to use the DECL_ARGUMENTS from the | |
10579 | new decl. */ | |
10580 | DECL_INITIAL (new_decl) = error_mark_node; | |
10581 | /* And don't complain about a duplicate definition. */ | |
10582 | DECL_INITIAL (decl) = NULL_TREE; | |
10583 | } | |
36a117a5 | 10584 | |
2b59fc25 | 10585 | pop_access_scope (decl); |
0e902d98 | 10586 | |
36a117a5 MM |
10587 | /* The immediate parent of the new template is still whatever it was |
10588 | before, even though tsubst sets DECL_TI_TEMPLATE up as the most | |
10589 | general template. We also reset the DECL_ASSEMBLER_NAME since | |
10590 | tsubst always calculates the name as if the function in question | |
10591 | were really a template instance, and sometimes, with friend | |
10592 | functions, this is not so. See tsubst_friend_function for | |
10593 | details. */ | |
10594 | DECL_TI_TEMPLATE (new_decl) = DECL_TI_TEMPLATE (decl); | |
92643fea | 10595 | COPY_DECL_ASSEMBLER_NAME (decl, new_decl); |
19e7881c | 10596 | COPY_DECL_RTL (decl, new_decl); |
459c43ad | 10597 | DECL_USE_TEMPLATE (new_decl) = DECL_USE_TEMPLATE (decl); |
36a117a5 MM |
10598 | |
10599 | /* Call duplicate decls to merge the old and new declarations. */ | |
830bfa74 MM |
10600 | duplicate_decls (new_decl, decl); |
10601 | ||
36a117a5 MM |
10602 | /* Now, re-register the specialization. */ |
10603 | register_specialization (decl, gen_tmpl, args); | |
830bfa74 MM |
10604 | } |
10605 | ||
a723baf1 MM |
10606 | /* Return the TEMPLATE_DECL into which DECL_TI_ARGS(DECL) should be |
10607 | substituted to get DECL. */ | |
10608 | ||
d58b7c2d | 10609 | tree |
a723baf1 MM |
10610 | template_for_substitution (tree decl) |
10611 | { | |
10612 | tree tmpl = DECL_TI_TEMPLATE (decl); | |
10613 | ||
10614 | /* Set TMPL to the template whose DECL_TEMPLATE_RESULT is the pattern | |
10615 | for the instantiation. This is not always the most general | |
10616 | template. Consider, for example: | |
10617 | ||
10618 | template <class T> | |
10619 | struct S { template <class U> void f(); | |
10620 | template <> void f<int>(); }; | |
10621 | ||
10622 | and an instantiation of S<double>::f<int>. We want TD to be the | |
10623 | specialization S<T>::f<int>, not the more general S<T>::f<U>. */ | |
10624 | while (/* An instantiation cannot have a definition, so we need a | |
10625 | more general template. */ | |
10626 | DECL_TEMPLATE_INSTANTIATION (tmpl) | |
10627 | /* We must also deal with friend templates. Given: | |
10628 | ||
10629 | template <class T> struct S { | |
10630 | template <class U> friend void f() {}; | |
10631 | }; | |
10632 | ||
10633 | S<int>::f<U> say, is not an instantiation of S<T>::f<U>, | |
10634 | so far as the language is concerned, but that's still | |
10635 | where we get the pattern for the instantiation from. On | |
10636 | other hand, if the definition comes outside the class, say: | |
10637 | ||
10638 | template <class T> struct S { | |
10639 | template <class U> friend void f(); | |
10640 | }; | |
10641 | template <class U> friend void f() {} | |
10642 | ||
10643 | we don't need to look any further. That's what the check for | |
10644 | DECL_INITIAL is for. */ | |
10645 | || (TREE_CODE (decl) == FUNCTION_DECL | |
10646 | && DECL_FRIEND_PSEUDO_TEMPLATE_INSTANTIATION (tmpl) | |
10647 | && !DECL_INITIAL (DECL_TEMPLATE_RESULT (tmpl)))) | |
10648 | { | |
10649 | /* The present template, TD, should not be a definition. If it | |
10650 | were a definition, we should be using it! Note that we | |
10651 | cannot restructure the loop to just keep going until we find | |
10652 | a template with a definition, since that might go too far if | |
10653 | a specialization was declared, but not defined. */ | |
10654 | my_friendly_assert (!(TREE_CODE (decl) == VAR_DECL | |
10655 | && !DECL_IN_AGGR_P (DECL_TEMPLATE_RESULT (tmpl))), | |
10656 | 0); | |
10657 | ||
10658 | /* Fetch the more general template. */ | |
10659 | tmpl = DECL_TI_TEMPLATE (tmpl); | |
10660 | } | |
10661 | ||
10662 | return tmpl; | |
10663 | } | |
10664 | ||
16d53b64 | 10665 | /* Produce the definition of D, a _DECL generated from a template. If |
838dfd8a | 10666 | DEFER_OK is nonzero, then we don't have to actually do the |
16d53b64 | 10667 | instantiation now; we just have to do it sometime. */ |
f84b4be9 | 10668 | |
a28e3c7f | 10669 | tree |
3a978d72 | 10670 | instantiate_decl (tree d, int defer_ok) |
a28e3c7f | 10671 | { |
36a117a5 | 10672 | tree tmpl = DECL_TI_TEMPLATE (d); |
65f8b0fb MM |
10673 | tree gen_args; |
10674 | tree args; | |
830bfa74 | 10675 | tree td; |
36a117a5 MM |
10676 | tree code_pattern; |
10677 | tree spec; | |
10678 | tree gen_tmpl; | |
5566b478 | 10679 | int pattern_defined; |
31a714f6 | 10680 | int need_push; |
82a98427 NS |
10681 | location_t saved_loc = input_location; |
10682 | ||
36a117a5 MM |
10683 | /* This function should only be used to instantiate templates for |
10684 | functions and static member variables. */ | |
10685 | my_friendly_assert (TREE_CODE (d) == FUNCTION_DECL | |
10686 | || TREE_CODE (d) == VAR_DECL, 0); | |
10687 | ||
cec24319 MM |
10688 | /* Variables are never deferred; if instantiation is required, they |
10689 | are instantiated right away. That allows for better code in the | |
10690 | case that an expression refers to the value of the variable -- | |
10691 | if the variable has a constant value the referring expression can | |
10692 | take advantage of that fact. */ | |
10693 | if (TREE_CODE (d) == VAR_DECL) | |
10694 | defer_ok = 0; | |
10695 | ||
db9b2174 MM |
10696 | /* Don't instantiate cloned functions. Instead, instantiate the |
10697 | functions they cloned. */ | |
10698 | if (TREE_CODE (d) == FUNCTION_DECL && DECL_CLONED_FUNCTION_P (d)) | |
10699 | d = DECL_CLONED_FUNCTION (d); | |
10700 | ||
fbf1c34b | 10701 | if (DECL_TEMPLATE_INSTANTIATED (d)) |
03d0f4af | 10702 | /* D has already been instantiated. It might seem reasonable to |
dc957d14 | 10703 | check whether or not D is an explicit instantiation, and, if so, |
03d0f4af MM |
10704 | stop here. But when an explicit instantiation is deferred |
10705 | until the end of the compilation, DECL_EXPLICIT_INSTANTIATION | |
10706 | is set, even though we still need to do the instantiation. */ | |
36a117a5 MM |
10707 | return d; |
10708 | ||
10709 | /* If we already have a specialization of this declaration, then | |
10710 | there's no reason to instantiate it. Note that | |
10711 | retrieve_specialization gives us both instantiations and | |
10712 | specializations, so we must explicitly check | |
10713 | DECL_TEMPLATE_SPECIALIZATION. */ | |
10714 | gen_tmpl = most_general_template (tmpl); | |
65f8b0fb MM |
10715 | gen_args = DECL_TI_ARGS (d); |
10716 | spec = retrieve_specialization (gen_tmpl, gen_args); | |
36a117a5 MM |
10717 | if (spec != NULL_TREE && DECL_TEMPLATE_SPECIALIZATION (spec)) |
10718 | return spec; | |
10719 | ||
10720 | /* This needs to happen before any tsubsting. */ | |
10721 | if (! push_tinst_level (d)) | |
10722 | return d; | |
10723 | ||
297a5329 JM |
10724 | timevar_push (TV_PARSE); |
10725 | ||
7d021397 KL |
10726 | /* We may be in the middle of deferred access check. Disable |
10727 | it now. */ | |
10728 | push_deferring_access_checks (dk_no_deferred); | |
10729 | ||
4d85e00e | 10730 | /* Set TD to the template whose DECL_TEMPLATE_RESULT is the pattern |
a723baf1 MM |
10731 | for the instantiation. */ |
10732 | td = template_for_substitution (d); | |
fee23f54 | 10733 | code_pattern = DECL_TEMPLATE_RESULT (td); |
27bb8339 | 10734 | |
76d3baad KL |
10735 | if ((DECL_NAMESPACE_SCOPE_P (d) && !DECL_INITIALIZED_IN_CLASS_P (d)) |
10736 | || DECL_TEMPLATE_SPECIALIZATION (td)) | |
649fc72d NS |
10737 | /* In the case of a friend template whose definition is provided |
10738 | outside the class, we may have too many arguments. Drop the | |
76d3baad | 10739 | ones we don't need. The same is true for specializations. */ |
649fc72d NS |
10740 | args = get_innermost_template_args |
10741 | (gen_args, TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (td))); | |
10742 | else | |
10743 | args = gen_args; | |
65f8b0fb | 10744 | |
5566b478 | 10745 | if (TREE_CODE (d) == FUNCTION_DECL) |
39c76b4f | 10746 | pattern_defined = (DECL_SAVED_TREE (code_pattern) != NULL_TREE); |
5566b478 | 10747 | else |
36a117a5 | 10748 | pattern_defined = ! DECL_IN_AGGR_P (code_pattern); |
de22184b | 10749 | |
82a98427 | 10750 | input_location = DECL_SOURCE_LOCATION (d); |
de22184b | 10751 | |
de22184b | 10752 | if (pattern_defined) |
5566b478 | 10753 | { |
7e9abee9 MM |
10754 | /* Let the repository code that this template definition is |
10755 | available. | |
10756 | ||
10757 | The repository doesn't need to know about cloned functions | |
10758 | because they never actually show up in the object file. It | |
10759 | does need to know about the clones; those are the symbols | |
10760 | that the linker will be emitting error messages about. */ | |
10761 | if (DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (d) | |
10762 | || DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (d)) | |
10763 | { | |
10764 | tree t; | |
10765 | ||
10766 | for (t = TREE_CHAIN (d); | |
10767 | t && DECL_CLONED_FUNCTION_P (t); | |
10768 | t = TREE_CHAIN (t)) | |
10769 | repo_template_used (t); | |
10770 | } | |
10771 | else | |
10772 | repo_template_used (d); | |
5566b478 MS |
10773 | |
10774 | if (flag_external_templates && ! DECL_INTERFACE_KNOWN (d)) | |
10775 | { | |
10776 | if (flag_alt_external_templates) | |
10777 | { | |
10778 | if (interface_unknown) | |
10779 | warn_if_unknown_interface (d); | |
10780 | } | |
fee23f54 | 10781 | else if (DECL_INTERFACE_KNOWN (code_pattern)) |
5566b478 MS |
10782 | { |
10783 | DECL_INTERFACE_KNOWN (d) = 1; | |
fee23f54 | 10784 | DECL_NOT_REALLY_EXTERN (d) = ! DECL_EXTERNAL (code_pattern); |
5566b478 MS |
10785 | } |
10786 | else | |
fee23f54 | 10787 | warn_if_unknown_interface (code_pattern); |
5566b478 MS |
10788 | } |
10789 | ||
e92cc029 | 10790 | if (at_eof) |
5566b478 MS |
10791 | import_export_decl (d); |
10792 | } | |
10793 | ||
4f2b0fb2 NS |
10794 | if (!defer_ok) |
10795 | { | |
10796 | /* Recheck the substitutions to obtain any warning messages | |
10797 | about ignoring cv qualifiers. */ | |
10798 | tree gen = DECL_TEMPLATE_RESULT (gen_tmpl); | |
10799 | tree type = TREE_TYPE (gen); | |
10800 | ||
0e902d98 | 10801 | /* Make sure that we can see identifiers, and compute access |
2b59fc25 KL |
10802 | correctly. D is already the target FUNCTION_DECL with the |
10803 | right context. */ | |
10804 | push_access_scope (d); | |
0e902d98 | 10805 | |
4f2b0fb2 NS |
10806 | if (TREE_CODE (gen) == FUNCTION_DECL) |
10807 | { | |
65f8b0fb MM |
10808 | tsubst (DECL_ARGUMENTS (gen), gen_args, tf_error | tf_warning, d); |
10809 | tsubst (TYPE_RAISES_EXCEPTIONS (type), gen_args, | |
4f2b0fb2 NS |
10810 | tf_error | tf_warning, d); |
10811 | /* Don't simply tsubst the function type, as that will give | |
10812 | duplicate warnings about poor parameter qualifications. | |
10813 | The function arguments are the same as the decl_arguments | |
c6002625 | 10814 | without the top level cv qualifiers. */ |
4f2b0fb2 NS |
10815 | type = TREE_TYPE (type); |
10816 | } | |
65f8b0fb | 10817 | tsubst (type, gen_args, tf_error | tf_warning, d); |
0e902d98 | 10818 | |
2b59fc25 | 10819 | pop_access_scope (d); |
4f2b0fb2 NS |
10820 | } |
10821 | ||
46ccf50a JM |
10822 | if (TREE_CODE (d) == VAR_DECL && DECL_INITIALIZED_IN_CLASS_P (d) |
10823 | && DECL_INITIAL (d) == NULL_TREE) | |
10824 | /* We should have set up DECL_INITIAL in instantiate_class_template. */ | |
10825 | abort (); | |
930cd796 MM |
10826 | /* Reject all external templates except inline functions. */ |
10827 | else if (DECL_INTERFACE_KNOWN (d) | |
10828 | && ! DECL_NOT_REALLY_EXTERN (d) | |
4f8e1232 MM |
10829 | && ! (TREE_CODE (d) == FUNCTION_DECL |
10830 | && DECL_INLINE (d))) | |
930cd796 | 10831 | goto out; |
16d53b64 MM |
10832 | /* Defer all other templates, unless we have been explicitly |
10833 | forbidden from doing so. We restore the source position here | |
10834 | because it's used by add_pending_template. */ | |
10835 | else if (! pattern_defined || defer_ok) | |
10836 | { | |
82a98427 | 10837 | input_location = saved_loc; |
c27be9b9 | 10838 | |
03d0f4af MM |
10839 | if (at_eof && !pattern_defined |
10840 | && DECL_EXPLICIT_INSTANTIATION (d)) | |
10841 | /* [temp.explicit] | |
10842 | ||
10843 | The definition of a non-exported function template, a | |
10844 | non-exported member function template, or a non-exported | |
10845 | member function or static data member of a class template | |
10846 | shall be present in every translation unit in which it is | |
10847 | explicitly instantiated. */ | |
33bd39a2 | 10848 | pedwarn |
46ccf50a | 10849 | ("explicit instantiation of `%D' but no definition available", d); |
03d0f4af | 10850 | |
5566b478 | 10851 | add_pending_template (d); |
de22184b | 10852 | goto out; |
5566b478 MS |
10853 | } |
10854 | ||
31a714f6 MM |
10855 | need_push = !global_bindings_p (); |
10856 | if (need_push) | |
10857 | push_to_top_level (); | |
414ea4aa | 10858 | |
2b0a63a3 MM |
10859 | /* Regenerate the declaration in case the template has been modified |
10860 | by a subsequent redeclaration. */ | |
10861 | regenerate_decl_from_template (d, td); | |
1d62c33e | 10862 | |
120722ac | 10863 | /* We already set the file and line above. Reset them now in case |
82a98427 NS |
10864 | they changed as a result of calling |
10865 | regenerate_decl_from_template. */ | |
10866 | input_location = DECL_SOURCE_LOCATION (d); | |
5156628f | 10867 | |
5566b478 MS |
10868 | if (TREE_CODE (d) == VAR_DECL) |
10869 | { | |
1d62c33e MM |
10870 | /* Clear out DECL_RTL; whatever was there before may not be right |
10871 | since we've reset the type of the declaration. */ | |
10872 | SET_DECL_RTL (d, NULL_RTX); | |
10873 | ||
5566b478 | 10874 | DECL_IN_AGGR_P (d) = 0; |
b2dd096b MM |
10875 | import_export_decl (d); |
10876 | DECL_EXTERNAL (d) = ! DECL_NOT_REALLY_EXTERN (d); | |
ea56c40c MM |
10877 | |
10878 | if (DECL_EXTERNAL (d)) | |
10879 | { | |
10880 | /* The fact that this code is executing indicates that: | |
10881 | ||
10882 | (1) D is a template static data member, for which a | |
10883 | definition is available. | |
10884 | ||
34cd5ae7 | 10885 | (2) An implicit or explicit instantiation has occurred. |
ea56c40c MM |
10886 | |
10887 | (3) We are not going to emit a definition of the static | |
10888 | data member at this time. | |
10889 | ||
10890 | This situation is peculiar, but it occurs on platforms | |
10891 | without weak symbols when performing an implicit | |
10892 | instantiation. There, we cannot implicitly instantiate a | |
10893 | defined static data member in more than one translation | |
10894 | unit, so import_export_decl marks the declaration as | |
10895 | external; we must rely on explicit instantiation. */ | |
10896 | } | |
10897 | else | |
10898 | { | |
10899 | /* Mark D as instantiated so that recursive calls to | |
10900 | instantiate_decl do not try to instantiate it again. */ | |
10901 | DECL_TEMPLATE_INSTANTIATED (d) = 1; | |
10902 | cp_finish_decl (d, | |
10903 | (!DECL_INITIALIZED_IN_CLASS_P (d) | |
10904 | ? DECL_INITIAL (d) : NULL_TREE), | |
10905 | NULL_TREE, 0); | |
10906 | } | |
5566b478 MS |
10907 | } |
10908 | else if (TREE_CODE (d) == FUNCTION_DECL) | |
10909 | { | |
6bbf1598 | 10910 | htab_t saved_local_specializations; |
a723baf1 MM |
10911 | tree subst_decl; |
10912 | tree tmpl_parm; | |
10913 | tree spec_parm; | |
6bbf1598 | 10914 | |
ea56c40c MM |
10915 | /* Mark D as instantiated so that recursive calls to |
10916 | instantiate_decl do not try to instantiate it again. */ | |
10917 | DECL_TEMPLATE_INSTANTIATED (d) = 1; | |
10918 | ||
6bbf1598 MM |
10919 | /* Save away the current list, in case we are instantiating one |
10920 | template from within the body of another. */ | |
10921 | saved_local_specializations = local_specializations; | |
10922 | ||
6dfbb909 | 10923 | /* Set up the list of local specializations. */ |
6dfbb909 | 10924 | local_specializations = htab_create (37, |
69f794a7 | 10925 | hash_local_specialization, |
a723baf1 | 10926 | eq_local_specializations, |
6dfbb909 MM |
10927 | NULL); |
10928 | ||
558475f0 | 10929 | /* Set up context. */ |
0b50d7f1 | 10930 | import_export_decl (d); |
a8f73d4b | 10931 | start_function (NULL_TREE, d, NULL_TREE, SF_PRE_PARSED); |
5566b478 | 10932 | |
a723baf1 MM |
10933 | /* Create substitution entries for the parameters. */ |
10934 | subst_decl = DECL_TEMPLATE_RESULT (template_for_substitution (d)); | |
10935 | tmpl_parm = DECL_ARGUMENTS (subst_decl); | |
10936 | spec_parm = DECL_ARGUMENTS (d); | |
10937 | if (DECL_NONSTATIC_MEMBER_FUNCTION_P (d)) | |
10938 | { | |
10939 | register_local_specialization (spec_parm, tmpl_parm); | |
10940 | spec_parm = skip_artificial_parms_for (d, spec_parm); | |
10941 | tmpl_parm = skip_artificial_parms_for (subst_decl, tmpl_parm); | |
10942 | } | |
10943 | while (tmpl_parm) | |
10944 | { | |
10945 | register_local_specialization (spec_parm, tmpl_parm); | |
10946 | tmpl_parm = TREE_CHAIN (tmpl_parm); | |
10947 | spec_parm = TREE_CHAIN (spec_parm); | |
10948 | } | |
10949 | my_friendly_assert (!spec_parm, 20020813); | |
10950 | ||
558475f0 MM |
10951 | /* Substitute into the body of the function. */ |
10952 | tsubst_expr (DECL_SAVED_TREE (code_pattern), args, | |
c2ea3a40 | 10953 | tf_error | tf_warning, tmpl); |
558475f0 | 10954 | |
6dfbb909 MM |
10955 | /* We don't need the local specializations any more. */ |
10956 | htab_delete (local_specializations); | |
6bbf1598 | 10957 | local_specializations = saved_local_specializations; |
6dfbb909 | 10958 | |
4d6abc1c | 10959 | /* Finish the function. */ |
b2dd096b | 10960 | d = finish_function (0); |
8cd2462c | 10961 | expand_or_defer_fn (d); |
5566b478 MS |
10962 | } |
10963 | ||
971cbc14 MM |
10964 | /* We're not deferring instantiation any more. */ |
10965 | TI_PENDING_TEMPLATE_FLAG (DECL_TEMPLATE_INFO (d)) = 0; | |
10966 | ||
31a714f6 MM |
10967 | if (need_push) |
10968 | pop_from_top_level (); | |
414ea4aa | 10969 | |
de22184b | 10970 | out: |
82a98427 | 10971 | input_location = saved_loc; |
7d021397 | 10972 | pop_deferring_access_checks (); |
5566b478 | 10973 | pop_tinst_level (); |
a28e3c7f | 10974 | |
297a5329 JM |
10975 | timevar_pop (TV_PARSE); |
10976 | ||
a28e3c7f MS |
10977 | return d; |
10978 | } | |
5566b478 | 10979 | |
0aafb128 MM |
10980 | /* Run through the list of templates that we wish we could |
10981 | instantiate, and instantiate any we can. */ | |
10982 | ||
10983 | int | |
3a978d72 | 10984 | instantiate_pending_templates (void) |
0aafb128 MM |
10985 | { |
10986 | tree *t; | |
46ccf50a | 10987 | tree last = NULL_TREE; |
0aafb128 MM |
10988 | int instantiated_something = 0; |
10989 | int reconsider; | |
10990 | ||
10991 | do | |
10992 | { | |
10993 | reconsider = 0; | |
10994 | ||
10995 | t = &pending_templates; | |
10996 | while (*t) | |
10997 | { | |
0aafb128 MM |
10998 | tree instantiation = TREE_VALUE (*t); |
10999 | ||
3ae18eaf | 11000 | reopen_tinst_level (TREE_PURPOSE (*t)); |
0aafb128 | 11001 | |
2f939d94 | 11002 | if (TYPE_P (instantiation)) |
0aafb128 MM |
11003 | { |
11004 | tree fn; | |
11005 | ||
d0f062fb | 11006 | if (!COMPLETE_TYPE_P (instantiation)) |
0aafb128 MM |
11007 | { |
11008 | instantiate_class_template (instantiation); | |
11009 | if (CLASSTYPE_TEMPLATE_INSTANTIATION (instantiation)) | |
11010 | for (fn = TYPE_METHODS (instantiation); | |
11011 | fn; | |
11012 | fn = TREE_CHAIN (fn)) | |
11013 | if (! DECL_ARTIFICIAL (fn)) | |
16d53b64 | 11014 | instantiate_decl (fn, /*defer_ok=*/0); |
d0f062fb | 11015 | if (COMPLETE_TYPE_P (instantiation)) |
0aafb128 MM |
11016 | { |
11017 | instantiated_something = 1; | |
11018 | reconsider = 1; | |
11019 | } | |
11020 | } | |
11021 | ||
d0f062fb | 11022 | if (COMPLETE_TYPE_P (instantiation)) |
0aafb128 MM |
11023 | /* If INSTANTIATION has been instantiated, then we don't |
11024 | need to consider it again in the future. */ | |
11025 | *t = TREE_CHAIN (*t); | |
46ccf50a JM |
11026 | else |
11027 | { | |
11028 | last = *t; | |
11029 | t = &TREE_CHAIN (*t); | |
11030 | } | |
0aafb128 MM |
11031 | } |
11032 | else | |
11033 | { | |
16d53b64 | 11034 | if (!DECL_TEMPLATE_SPECIALIZATION (instantiation) |
0aafb128 MM |
11035 | && !DECL_TEMPLATE_INSTANTIATED (instantiation)) |
11036 | { | |
16d53b64 MM |
11037 | instantiation = instantiate_decl (instantiation, |
11038 | /*defer_ok=*/0); | |
0aafb128 MM |
11039 | if (DECL_TEMPLATE_INSTANTIATED (instantiation)) |
11040 | { | |
11041 | instantiated_something = 1; | |
11042 | reconsider = 1; | |
11043 | } | |
11044 | } | |
11045 | ||
16d53b64 | 11046 | if (DECL_TEMPLATE_SPECIALIZATION (instantiation) |
0aafb128 MM |
11047 | || DECL_TEMPLATE_INSTANTIATED (instantiation)) |
11048 | /* If INSTANTIATION has been instantiated, then we don't | |
11049 | need to consider it again in the future. */ | |
11050 | *t = TREE_CHAIN (*t); | |
46ccf50a JM |
11051 | else |
11052 | { | |
11053 | last = *t; | |
11054 | t = &TREE_CHAIN (*t); | |
11055 | } | |
0aafb128 | 11056 | } |
84e5ca0f NS |
11057 | tinst_depth = 0; |
11058 | current_tinst_level = NULL_TREE; | |
0aafb128 | 11059 | } |
46ccf50a | 11060 | last_pending_template = last; |
0aafb128 MM |
11061 | } |
11062 | while (reconsider); | |
11063 | ||
11064 | return instantiated_something; | |
11065 | } | |
11066 | ||
fd74ca0b MM |
11067 | /* Substitute ARGVEC into T, which is a list of initializers for |
11068 | either base class or a non-static data member. The TREE_PURPOSEs | |
11069 | are DECLs, and the TREE_VALUEs are the initializer values. Used by | |
11070 | instantiate_decl. */ | |
4393e105 | 11071 | |
824b9a4c | 11072 | static tree |
3a978d72 | 11073 | tsubst_initializer_list (tree t, tree argvec) |
5566b478 | 11074 | { |
2282d28d | 11075 | tree inits = NULL_TREE; |
5566b478 MS |
11076 | |
11077 | for (; t; t = TREE_CHAIN (t)) | |
11078 | { | |
fd74ca0b MM |
11079 | tree decl; |
11080 | tree init; | |
11081 | tree val; | |
11082 | ||
c2ea3a40 | 11083 | decl = tsubst_copy (TREE_PURPOSE (t), argvec, tf_error | tf_warning, |
fd74ca0b | 11084 | NULL_TREE); |
1f5a253a NS |
11085 | decl = expand_member_init (decl); |
11086 | if (decl && !DECL_P (decl)) | |
11087 | in_base_initializer = 1; | |
11088 | ||
c2ea3a40 | 11089 | init = tsubst_expr (TREE_VALUE (t), argvec, tf_error | tf_warning, |
fd74ca0b | 11090 | NULL_TREE); |
fd74ca0b MM |
11091 | if (!init) |
11092 | ; | |
11093 | else if (TREE_CODE (init) == TREE_LIST) | |
11094 | for (val = init; val; val = TREE_CHAIN (val)) | |
11095 | TREE_VALUE (val) = convert_from_reference (TREE_VALUE (val)); | |
2282d28d | 11096 | else if (init != void_type_node) |
fd74ca0b MM |
11097 | init = convert_from_reference (init); |
11098 | ||
1f5a253a NS |
11099 | in_base_initializer = 0; |
11100 | ||
11101 | if (decl) | |
2282d28d | 11102 | { |
1f5a253a | 11103 | init = build_tree_list (decl, init); |
2282d28d MM |
11104 | TREE_CHAIN (init) = inits; |
11105 | inits = init; | |
11106 | } | |
5566b478 | 11107 | } |
2282d28d | 11108 | return inits; |
5566b478 MS |
11109 | } |
11110 | ||
61a127b3 MM |
11111 | /* Set CURRENT_ACCESS_SPECIFIER based on the protection of DECL. */ |
11112 | ||
11113 | static void | |
3a978d72 | 11114 | set_current_access_from_decl (tree decl) |
61a127b3 MM |
11115 | { |
11116 | if (TREE_PRIVATE (decl)) | |
11117 | current_access_specifier = access_private_node; | |
11118 | else if (TREE_PROTECTED (decl)) | |
11119 | current_access_specifier = access_protected_node; | |
11120 | else | |
11121 | current_access_specifier = access_public_node; | |
11122 | } | |
11123 | ||
dbfe2124 MM |
11124 | /* Instantiate an enumerated type. TAG is the template type, NEWTAG |
11125 | is the instantiation (which should have been created with | |
11126 | start_enum) and ARGS are the template arguments to use. */ | |
b87692e5 | 11127 | |
dbfe2124 | 11128 | static void |
3a978d72 | 11129 | tsubst_enum (tree tag, tree newtag, tree args) |
b87692e5 | 11130 | { |
dbfe2124 | 11131 | tree e; |
b87692e5 MS |
11132 | |
11133 | for (e = TYPE_VALUES (tag); e; e = TREE_CHAIN (e)) | |
11134 | { | |
61a127b3 | 11135 | tree value; |
7b6d72fc MM |
11136 | tree decl; |
11137 | ||
11138 | decl = TREE_VALUE (e); | |
61a127b3 MM |
11139 | /* Note that in a template enum, the TREE_VALUE is the |
11140 | CONST_DECL, not the corresponding INTEGER_CST. */ | |
7b6d72fc | 11141 | value = tsubst_expr (DECL_INITIAL (decl), |
c2ea3a40 | 11142 | args, tf_error | tf_warning, |
4393e105 | 11143 | NULL_TREE); |
61a127b3 MM |
11144 | |
11145 | /* Give this enumeration constant the correct access. */ | |
7b6d72fc | 11146 | set_current_access_from_decl (decl); |
61a127b3 MM |
11147 | |
11148 | /* Actually build the enumerator itself. */ | |
7b6d72fc | 11149 | build_enumerator (DECL_NAME (decl), value, newtag); |
dbfe2124 | 11150 | } |
b3d5a58b | 11151 | |
219670f1 | 11152 | finish_enum (newtag); |
3e72ec9a GDR |
11153 | DECL_SOURCE_LOCATION (TYPE_NAME (newtag)) |
11154 | = DECL_SOURCE_LOCATION (TYPE_NAME (tag)); | |
b87692e5 | 11155 | } |
36a117a5 | 11156 | |
1f6e1acc AS |
11157 | /* DECL is a FUNCTION_DECL that is a template specialization. Return |
11158 | its type -- but without substituting the innermost set of template | |
11159 | arguments. So, innermost set of template parameters will appear in | |
5c74d5b0 | 11160 | the type. */ |
1f6e1acc AS |
11161 | |
11162 | tree | |
3a978d72 | 11163 | get_mostly_instantiated_function_type (tree decl) |
1f6e1acc | 11164 | { |
1f6e1acc AS |
11165 | tree fn_type; |
11166 | tree tmpl; | |
11167 | tree targs; | |
11168 | tree tparms; | |
11169 | int parm_depth; | |
11170 | ||
11171 | tmpl = most_general_template (DECL_TI_TEMPLATE (decl)); | |
11172 | targs = DECL_TI_ARGS (decl); | |
11173 | tparms = DECL_TEMPLATE_PARMS (tmpl); | |
11174 | parm_depth = TMPL_PARMS_DEPTH (tparms); | |
11175 | ||
11176 | /* There should be as many levels of arguments as there are levels | |
11177 | of parameters. */ | |
11178 | my_friendly_assert (parm_depth == TMPL_ARGS_DEPTH (targs), 0); | |
11179 | ||
11180 | fn_type = TREE_TYPE (tmpl); | |
1f6e1acc AS |
11181 | |
11182 | if (parm_depth == 1) | |
11183 | /* No substitution is necessary. */ | |
11184 | ; | |
11185 | else | |
11186 | { | |
11187 | int i; | |
11188 | tree partial_args; | |
11189 | ||
11190 | /* Replace the innermost level of the TARGS with NULL_TREEs to | |
dc957d14 | 11191 | let tsubst know not to substitute for those parameters. */ |
1f6e1acc AS |
11192 | partial_args = make_tree_vec (TREE_VEC_LENGTH (targs)); |
11193 | for (i = 1; i < TMPL_ARGS_DEPTH (targs); ++i) | |
11194 | SET_TMPL_ARGS_LEVEL (partial_args, i, | |
11195 | TMPL_ARGS_LEVEL (targs, i)); | |
11196 | SET_TMPL_ARGS_LEVEL (partial_args, | |
11197 | TMPL_ARGS_DEPTH (targs), | |
11198 | make_tree_vec (DECL_NTPARMS (tmpl))); | |
11199 | ||
5c74d5b0 KL |
11200 | /* Make sure that we can see identifiers, and compute access |
11201 | correctly. We can just use the context of DECL for the | |
11202 | partial substitution here. It depends only on outer template | |
11203 | parameters, regardless of whether the innermost level is | |
11204 | specialized or not. */ | |
2b59fc25 | 11205 | push_access_scope (decl); |
5c74d5b0 | 11206 | |
1f6e1acc AS |
11207 | /* Now, do the (partial) substitution to figure out the |
11208 | appropriate function type. */ | |
c2ea3a40 | 11209 | fn_type = tsubst (fn_type, partial_args, tf_error, NULL_TREE); |
1f6e1acc AS |
11210 | |
11211 | /* Substitute into the template parameters to obtain the real | |
11212 | innermost set of parameters. This step is important if the | |
11213 | innermost set of template parameters contains value | |
11214 | parameters whose types depend on outer template parameters. */ | |
11215 | TREE_VEC_LENGTH (partial_args)--; | |
c2ea3a40 | 11216 | tparms = tsubst_template_parms (tparms, partial_args, tf_error); |
1f6e1acc | 11217 | |
2b59fc25 | 11218 | pop_access_scope (decl); |
5c74d5b0 | 11219 | } |
1f6e1acc AS |
11220 | |
11221 | return fn_type; | |
11222 | } | |
669ec2b4 | 11223 | |
cb753e49 | 11224 | /* Return truthvalue if we're processing a template different from |
dc957d14 | 11225 | the last one involved in diagnostics. */ |
cb753e49 | 11226 | int |
3a978d72 | 11227 | problematic_instantiation_changed (void) |
cb753e49 GDR |
11228 | { |
11229 | return last_template_error_tick != tinst_level_tick; | |
11230 | } | |
11231 | ||
11232 | /* Remember current template involved in diagnostics. */ | |
11233 | void | |
3a978d72 | 11234 | record_last_problematic_instantiation (void) |
cb753e49 GDR |
11235 | { |
11236 | last_template_error_tick = tinst_level_tick; | |
11237 | } | |
11238 | ||
11239 | tree | |
3a978d72 | 11240 | current_instantiation (void) |
cb753e49 GDR |
11241 | { |
11242 | return current_tinst_level; | |
11243 | } | |
db3f4e4e NS |
11244 | |
11245 | /* [temp.param] Check that template non-type parm TYPE is of an allowable | |
838dfd8a | 11246 | type. Return zero for ok, nonzero for disallowed. Issue error and |
c2ea3a40 | 11247 | warning messages under control of COMPLAIN. */ |
db3f4e4e NS |
11248 | |
11249 | static int | |
3a978d72 | 11250 | invalid_nontype_parm_type_p (tree type, tsubst_flags_t complain) |
db3f4e4e NS |
11251 | { |
11252 | if (INTEGRAL_TYPE_P (type)) | |
11253 | return 0; | |
11254 | else if (POINTER_TYPE_P (type)) | |
11255 | return 0; | |
a5ac359a | 11256 | else if (TYPE_PTR_TO_MEMBER_P (type)) |
db3f4e4e | 11257 | return 0; |
db3f4e4e NS |
11258 | else if (TREE_CODE (type) == TEMPLATE_TYPE_PARM) |
11259 | return 0; | |
11260 | else if (TREE_CODE (type) == TYPENAME_TYPE) | |
11261 | return 0; | |
11262 | ||
c2ea3a40 | 11263 | if (complain & tf_error) |
33bd39a2 | 11264 | error ("`%#T' is not a valid type for a template constant parameter", |
db3f4e4e NS |
11265 | type); |
11266 | return 1; | |
11267 | } | |
e2500fed | 11268 | |
5552b43c MM |
11269 | /* Returns TRUE if TYPE is dependent, in the sense of [temp.dep.type]. |
11270 | Assumes that TYPE really is a type, and not the ERROR_MARK_NODE.*/ | |
1fb3244a | 11271 | |
5552b43c MM |
11272 | static bool |
11273 | dependent_type_p_r (tree type) | |
1fb3244a MM |
11274 | { |
11275 | tree scope; | |
11276 | ||
1fb3244a MM |
11277 | /* [temp.dep.type] |
11278 | ||
11279 | A type is dependent if it is: | |
11280 | ||
11281 | -- a template parameter. */ | |
11282 | if (TREE_CODE (type) == TEMPLATE_TYPE_PARM) | |
11283 | return true; | |
11284 | /* -- a qualified-id with a nested-name-specifier which contains a | |
11285 | class-name that names a dependent type or whose unqualified-id | |
11286 | names a dependent type. */ | |
11287 | if (TREE_CODE (type) == TYPENAME_TYPE) | |
11288 | return true; | |
11289 | /* -- a cv-qualified type where the cv-unqualified type is | |
11290 | dependent. */ | |
11291 | type = TYPE_MAIN_VARIANT (type); | |
11292 | /* -- a compound type constructed from any dependent type. */ | |
a5ac359a | 11293 | if (TYPE_PTR_TO_MEMBER_P (type)) |
1fb3244a MM |
11294 | return (dependent_type_p (TYPE_PTRMEM_CLASS_TYPE (type)) |
11295 | || dependent_type_p (TYPE_PTRMEM_POINTED_TO_TYPE | |
11296 | (type))); | |
11297 | else if (TREE_CODE (type) == POINTER_TYPE | |
11298 | || TREE_CODE (type) == REFERENCE_TYPE) | |
11299 | return dependent_type_p (TREE_TYPE (type)); | |
11300 | else if (TREE_CODE (type) == FUNCTION_TYPE | |
11301 | || TREE_CODE (type) == METHOD_TYPE) | |
11302 | { | |
11303 | tree arg_type; | |
11304 | ||
11305 | if (dependent_type_p (TREE_TYPE (type))) | |
11306 | return true; | |
11307 | for (arg_type = TYPE_ARG_TYPES (type); | |
11308 | arg_type; | |
11309 | arg_type = TREE_CHAIN (arg_type)) | |
11310 | if (dependent_type_p (TREE_VALUE (arg_type))) | |
11311 | return true; | |
11312 | return false; | |
11313 | } | |
11314 | /* -- an array type constructed from any dependent type or whose | |
11315 | size is specified by a constant expression that is | |
11316 | value-dependent. */ | |
11317 | if (TREE_CODE (type) == ARRAY_TYPE) | |
11318 | { | |
11319 | if (TYPE_DOMAIN (type) | |
11320 | && ((value_dependent_expression_p | |
11321 | (TYPE_MAX_VALUE (TYPE_DOMAIN (type)))) | |
11322 | || (type_dependent_expression_p | |
11323 | (TYPE_MAX_VALUE (TYPE_DOMAIN (type)))))) | |
11324 | return true; | |
11325 | return dependent_type_p (TREE_TYPE (type)); | |
11326 | } | |
86306a6b | 11327 | |
1fb3244a | 11328 | /* -- a template-id in which either the template name is a template |
86306a6b NS |
11329 | parameter ... */ |
11330 | if (TREE_CODE (type) == BOUND_TEMPLATE_TEMPLATE_PARM) | |
1fb3244a | 11331 | return true; |
86306a6b NS |
11332 | /* ... or any of the template arguments is a dependent type or |
11333 | an expression that is type-dependent or value-dependent. */ | |
11334 | else if (CLASS_TYPE_P (type) && CLASSTYPE_TEMPLATE_INFO (type) | |
11335 | && any_dependent_template_arguments_p (CLASSTYPE_TI_ARGS (type))) | |
1fb3244a | 11336 | return true; |
86306a6b | 11337 | |
1fb3244a MM |
11338 | /* All TYPEOF_TYPEs are dependent; if the argument of the `typeof' |
11339 | expression is not type-dependent, then it should already been | |
11340 | have resolved. */ | |
11341 | if (TREE_CODE (type) == TYPEOF_TYPE) | |
11342 | return true; | |
86306a6b | 11343 | |
1fb3244a MM |
11344 | /* The standard does not specifically mention types that are local |
11345 | to template functions or local classes, but they should be | |
11346 | considered dependent too. For example: | |
11347 | ||
11348 | template <int I> void f() { | |
11349 | enum E { a = I }; | |
11350 | S<sizeof (E)> s; | |
11351 | } | |
11352 | ||
11353 | The size of `E' cannot be known until the value of `I' has been | |
11354 | determined. Therefore, `E' must be considered dependent. */ | |
11355 | scope = TYPE_CONTEXT (type); | |
11356 | if (scope && TYPE_P (scope)) | |
11357 | return dependent_type_p (scope); | |
11358 | else if (scope && TREE_CODE (scope) == FUNCTION_DECL) | |
11359 | return type_dependent_expression_p (scope); | |
11360 | ||
11361 | /* Other types are non-dependent. */ | |
11362 | return false; | |
11363 | } | |
11364 | ||
5552b43c MM |
11365 | /* Returns TRUE if TYPE is dependent, in the sense of |
11366 | [temp.dep.type]. */ | |
11367 | ||
11368 | bool | |
11369 | dependent_type_p (tree type) | |
11370 | { | |
11371 | /* If there are no template parameters in scope, then there can't be | |
11372 | any dependent types. */ | |
11373 | if (!processing_template_decl) | |
11374 | return false; | |
11375 | ||
11376 | /* If the type is NULL, we have not computed a type for the entity | |
11377 | in question; in that case, the type is dependent. */ | |
11378 | if (!type) | |
11379 | return true; | |
11380 | ||
11381 | /* Erroneous types can be considered non-dependent. */ | |
11382 | if (type == error_mark_node) | |
11383 | return false; | |
11384 | ||
11385 | /* If we have not already computed the appropriate value for TYPE, | |
11386 | do so now. */ | |
11387 | if (!TYPE_DEPENDENT_P_VALID (type)) | |
11388 | { | |
11389 | TYPE_DEPENDENT_P (type) = dependent_type_p_r (type); | |
11390 | TYPE_DEPENDENT_P_VALID (type) = 1; | |
11391 | } | |
11392 | ||
11393 | return TYPE_DEPENDENT_P (type); | |
11394 | } | |
11395 | ||
8d83f792 MM |
11396 | /* Returns TRUE if EXPRESSION is dependent, according to CRITERION. */ |
11397 | ||
11398 | static bool | |
11399 | dependent_scope_ref_p (tree expression, bool criterion (tree)) | |
11400 | { | |
11401 | tree scope; | |
11402 | tree name; | |
11403 | ||
11404 | my_friendly_assert (TREE_CODE (expression) == SCOPE_REF, 20030714); | |
11405 | ||
11406 | if (!TYPE_P (TREE_OPERAND (expression, 0))) | |
11407 | return true; | |
11408 | ||
11409 | scope = TREE_OPERAND (expression, 0); | |
11410 | name = TREE_OPERAND (expression, 1); | |
11411 | ||
11412 | /* [temp.dep.expr] | |
11413 | ||
11414 | An id-expression is type-dependent if it contains a | |
11415 | nested-name-specifier that contains a class-name that names a | |
11416 | dependent type. */ | |
11417 | /* The suggested resolution to Core Issue 2 implies that if the | |
11418 | qualifying type is the current class, then we must peek | |
11419 | inside it. */ | |
11420 | if (DECL_P (name) | |
11421 | && currently_open_class (scope) | |
11422 | && !criterion (name)) | |
11423 | return false; | |
11424 | if (dependent_type_p (scope)) | |
11425 | return true; | |
11426 | ||
11427 | return false; | |
11428 | } | |
11429 | ||
20929c7f GB |
11430 | /* Returns TRUE if the EXPRESSION is value-dependent, in the sense of |
11431 | [temp.dep.constexpr] */ | |
1fb3244a | 11432 | |
14d22dd6 | 11433 | bool |
1fb3244a MM |
11434 | value_dependent_expression_p (tree expression) |
11435 | { | |
11436 | if (!processing_template_decl) | |
11437 | return false; | |
11438 | ||
11439 | /* A name declared with a dependent type. */ | |
10b1d5e7 | 11440 | if (TREE_CODE (expression) == IDENTIFIER_NODE |
00cf3e31 MM |
11441 | || (DECL_P (expression) |
11442 | && type_dependent_expression_p (expression))) | |
1fb3244a MM |
11443 | return true; |
11444 | /* A non-type template parameter. */ | |
11445 | if ((TREE_CODE (expression) == CONST_DECL | |
11446 | && DECL_TEMPLATE_PARM_P (expression)) | |
11447 | || TREE_CODE (expression) == TEMPLATE_PARM_INDEX) | |
11448 | return true; | |
11449 | /* A constant with integral or enumeration type and is initialized | |
11450 | with an expression that is value-dependent. */ | |
11451 | if (TREE_CODE (expression) == VAR_DECL | |
11452 | && DECL_INITIAL (expression) | |
d17811fd | 11453 | && INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (expression)) |
1fb3244a MM |
11454 | && value_dependent_expression_p (DECL_INITIAL (expression))) |
11455 | return true; | |
11456 | /* These expressions are value-dependent if the type to which the | |
20929c7f GB |
11457 | cast occurs is dependent or the expression being casted is |
11458 | value-dependent. */ | |
d17811fd MM |
11459 | if (TREE_CODE (expression) == DYNAMIC_CAST_EXPR |
11460 | || TREE_CODE (expression) == STATIC_CAST_EXPR | |
11461 | || TREE_CODE (expression) == CONST_CAST_EXPR | |
11462 | || TREE_CODE (expression) == REINTERPRET_CAST_EXPR | |
11463 | || TREE_CODE (expression) == CAST_EXPR) | |
11464 | { | |
11465 | if (dependent_type_p (TREE_TYPE (expression))) | |
11466 | return true; | |
11467 | /* A functional cast has a list of operands. */ | |
11468 | expression = TREE_OPERAND (expression, 0); | |
11469 | if (TREE_CODE (expression) == TREE_LIST) | |
11470 | { | |
11471 | do | |
11472 | { | |
11473 | if (value_dependent_expression_p (TREE_VALUE (expression))) | |
11474 | return true; | |
11475 | expression = TREE_CHAIN (expression); | |
11476 | } | |
11477 | while (expression); | |
11478 | return false; | |
11479 | } | |
11480 | else | |
11481 | return value_dependent_expression_p (expression); | |
11482 | } | |
11483 | /* A `sizeof' expression is value-dependent if the operand is | |
11484 | type-dependent. */ | |
11485 | if (TREE_CODE (expression) == SIZEOF_EXPR | |
11486 | || TREE_CODE (expression) == ALIGNOF_EXPR) | |
11487 | { | |
11488 | expression = TREE_OPERAND (expression, 0); | |
11489 | if (TYPE_P (expression)) | |
11490 | return dependent_type_p (expression); | |
11491 | return type_dependent_expression_p (expression); | |
11492 | } | |
8d83f792 MM |
11493 | if (TREE_CODE (expression) == SCOPE_REF) |
11494 | return dependent_scope_ref_p (expression, value_dependent_expression_p); | |
1fb3244a MM |
11495 | /* A constant expression is value-dependent if any subexpression is |
11496 | value-dependent. */ | |
11497 | if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (TREE_CODE (expression)))) | |
11498 | { | |
11499 | switch (TREE_CODE_CLASS (TREE_CODE (expression))) | |
11500 | { | |
11501 | case '1': | |
11502 | return (value_dependent_expression_p | |
11503 | (TREE_OPERAND (expression, 0))); | |
11504 | case '<': | |
11505 | case '2': | |
11506 | return ((value_dependent_expression_p | |
11507 | (TREE_OPERAND (expression, 0))) | |
11508 | || (value_dependent_expression_p | |
11509 | (TREE_OPERAND (expression, 1)))); | |
11510 | case 'e': | |
11511 | { | |
11512 | int i; | |
14d22dd6 MM |
11513 | for (i = 0; i < first_rtl_op (TREE_CODE (expression)); ++i) |
11514 | /* In some cases, some of the operands may be missing. | |
11515 | (For example, in the case of PREDECREMENT_EXPR, the | |
11516 | amount to increment by may be missing.) That doesn't | |
11517 | make the expression dependent. */ | |
11518 | if (TREE_OPERAND (expression, i) | |
11519 | && (value_dependent_expression_p | |
11520 | (TREE_OPERAND (expression, i)))) | |
1fb3244a MM |
11521 | return true; |
11522 | return false; | |
11523 | } | |
11524 | } | |
11525 | } | |
11526 | ||
11527 | /* The expression is not value-dependent. */ | |
11528 | return false; | |
11529 | } | |
11530 | ||
11531 | /* Returns TRUE if the EXPRESSION is type-dependent, in the sense of | |
11532 | [temp.dep.expr]. */ | |
11533 | ||
11534 | bool | |
3a978d72 | 11535 | type_dependent_expression_p (tree expression) |
1fb3244a MM |
11536 | { |
11537 | if (!processing_template_decl) | |
11538 | return false; | |
11539 | ||
7efa3e22 NS |
11540 | if (expression == error_mark_node) |
11541 | return false; | |
10b1d5e7 MM |
11542 | |
11543 | /* An unresolved name is always dependent. */ | |
11544 | if (TREE_CODE (expression) == IDENTIFIER_NODE) | |
11545 | return true; | |
7efa3e22 | 11546 | |
1fb3244a MM |
11547 | /* Some expression forms are never type-dependent. */ |
11548 | if (TREE_CODE (expression) == PSEUDO_DTOR_EXPR | |
11549 | || TREE_CODE (expression) == SIZEOF_EXPR | |
11550 | || TREE_CODE (expression) == ALIGNOF_EXPR | |
11551 | || TREE_CODE (expression) == TYPEID_EXPR | |
11552 | || TREE_CODE (expression) == DELETE_EXPR | |
11553 | || TREE_CODE (expression) == VEC_DELETE_EXPR | |
11554 | || TREE_CODE (expression) == THROW_EXPR) | |
11555 | return false; | |
11556 | ||
11557 | /* The types of these expressions depends only on the type to which | |
11558 | the cast occurs. */ | |
11559 | if (TREE_CODE (expression) == DYNAMIC_CAST_EXPR | |
11560 | || TREE_CODE (expression) == STATIC_CAST_EXPR | |
11561 | || TREE_CODE (expression) == CONST_CAST_EXPR | |
11562 | || TREE_CODE (expression) == REINTERPRET_CAST_EXPR | |
11563 | || TREE_CODE (expression) == CAST_EXPR) | |
11564 | return dependent_type_p (TREE_TYPE (expression)); | |
d17811fd | 11565 | |
1fb3244a MM |
11566 | /* The types of these expressions depends only on the type created |
11567 | by the expression. */ | |
d17811fd MM |
11568 | if (TREE_CODE (expression) == NEW_EXPR |
11569 | || TREE_CODE (expression) == VEC_NEW_EXPR) | |
09d2f85f KL |
11570 | { |
11571 | /* For NEW_EXPR tree nodes created inside a template, either | |
11572 | the object type itself or a TREE_LIST may appear as the | |
11573 | operand 1. */ | |
11574 | tree type = TREE_OPERAND (expression, 1); | |
11575 | if (TREE_CODE (type) == TREE_LIST) | |
11576 | /* This is an array type. We need to check array dimensions | |
11577 | as well. */ | |
11578 | return dependent_type_p (TREE_VALUE (TREE_PURPOSE (type))) | |
11579 | || value_dependent_expression_p | |
11580 | (TREE_OPERAND (TREE_VALUE (type), 1)); | |
11581 | else | |
11582 | return dependent_type_p (type); | |
11583 | } | |
1fb3244a | 11584 | |
6eeba0cc | 11585 | if (TREE_CODE (expression) == SCOPE_REF |
8d83f792 MM |
11586 | && dependent_scope_ref_p (expression, |
11587 | type_dependent_expression_p)) | |
11588 | return true; | |
6eeba0cc | 11589 | |
1fb3244a MM |
11590 | if (TREE_CODE (expression) == FUNCTION_DECL |
11591 | && DECL_LANG_SPECIFIC (expression) | |
11592 | && DECL_TEMPLATE_INFO (expression) | |
86306a6b NS |
11593 | && (any_dependent_template_arguments_p |
11594 | (INNERMOST_TEMPLATE_ARGS (DECL_TI_ARGS (expression))))) | |
1fb3244a MM |
11595 | return true; |
11596 | ||
d17811fd MM |
11597 | if (TREE_TYPE (expression) == unknown_type_node) |
11598 | { | |
11599 | if (TREE_CODE (expression) == ADDR_EXPR) | |
11600 | return type_dependent_expression_p (TREE_OPERAND (expression, 0)); | |
6cb89308 NS |
11601 | if (TREE_CODE (expression) == COMPONENT_REF) |
11602 | { | |
11603 | if (type_dependent_expression_p (TREE_OPERAND (expression, 0))) | |
11604 | return true; | |
11605 | expression = TREE_OPERAND (expression, 1); | |
11606 | if (TREE_CODE (expression) == IDENTIFIER_NODE) | |
11607 | return false; | |
11608 | } | |
11609 | ||
d17811fd MM |
11610 | if (TREE_CODE (expression) == BASELINK) |
11611 | expression = BASELINK_FUNCTIONS (expression); | |
11612 | if (TREE_CODE (expression) == TEMPLATE_ID_EXPR) | |
11613 | { | |
ee3071ef NS |
11614 | if (any_dependent_template_arguments_p |
11615 | (TREE_OPERAND (expression, 1))) | |
d17811fd MM |
11616 | return true; |
11617 | expression = TREE_OPERAND (expression, 0); | |
11618 | } | |
11619 | if (TREE_CODE (expression) == OVERLOAD) | |
11620 | { | |
11621 | while (expression) | |
11622 | { | |
11623 | if (type_dependent_expression_p (OVL_CURRENT (expression))) | |
11624 | return true; | |
11625 | expression = OVL_NEXT (expression); | |
11626 | } | |
11627 | return false; | |
11628 | } | |
11629 | abort (); | |
11630 | } | |
11631 | ||
1fb3244a MM |
11632 | return (dependent_type_p (TREE_TYPE (expression))); |
11633 | } | |
11634 | ||
d17811fd MM |
11635 | /* Returns TRUE if ARGS (a TREE_LIST of arguments to a function call) |
11636 | contains a type-dependent expression. */ | |
1fb3244a MM |
11637 | |
11638 | bool | |
d17811fd MM |
11639 | any_type_dependent_arguments_p (tree args) |
11640 | { | |
11641 | while (args) | |
11642 | { | |
7efa3e22 NS |
11643 | tree arg = TREE_VALUE (args); |
11644 | ||
11645 | if (type_dependent_expression_p (arg)) | |
d17811fd MM |
11646 | return true; |
11647 | args = TREE_CHAIN (args); | |
11648 | } | |
11649 | return false; | |
11650 | } | |
11651 | ||
11652 | /* Returns TRUE if the ARG (a template argument) is dependent. */ | |
11653 | ||
11654 | static bool | |
1fb3244a MM |
11655 | dependent_template_arg_p (tree arg) |
11656 | { | |
11657 | if (!processing_template_decl) | |
11658 | return false; | |
11659 | ||
11660 | if (TREE_CODE (arg) == TEMPLATE_DECL | |
11661 | || TREE_CODE (arg) == TEMPLATE_TEMPLATE_PARM) | |
11662 | return dependent_template_p (arg); | |
11663 | else if (TYPE_P (arg)) | |
11664 | return dependent_type_p (arg); | |
11665 | else | |
11666 | return (type_dependent_expression_p (arg) | |
11667 | || value_dependent_expression_p (arg)); | |
11668 | } | |
11669 | ||
d17811fd MM |
11670 | /* Returns true if ARGS (a collection of template arguments) contains |
11671 | any dependent arguments. */ | |
1fb3244a | 11672 | |
d17811fd MM |
11673 | bool |
11674 | any_dependent_template_arguments_p (tree args) | |
1fb3244a | 11675 | { |
bf12d54d NS |
11676 | int i; |
11677 | ||
d17811fd MM |
11678 | if (!args) |
11679 | return false; | |
11680 | ||
bf12d54d NS |
11681 | for (i = 0; i < TREE_VEC_LENGTH (args); ++i) |
11682 | if (dependent_template_arg_p (TREE_VEC_ELT (args, i))) | |
11683 | return true; | |
1fb3244a | 11684 | |
1fb3244a MM |
11685 | return false; |
11686 | } | |
11687 | ||
11688 | /* Returns TRUE if the template TMPL is dependent. */ | |
11689 | ||
11690 | bool | |
11691 | dependent_template_p (tree tmpl) | |
11692 | { | |
11693 | /* Template template parameters are dependent. */ | |
11694 | if (DECL_TEMPLATE_TEMPLATE_PARM_P (tmpl) | |
11695 | || TREE_CODE (tmpl) == TEMPLATE_TEMPLATE_PARM) | |
11696 | return true; | |
d17811fd MM |
11697 | /* So are qualified names that have not been looked up. */ |
11698 | if (TREE_CODE (tmpl) == SCOPE_REF) | |
11699 | return true; | |
1fb3244a MM |
11700 | /* So are member templates of dependent classes. */ |
11701 | if (TYPE_P (CP_DECL_CONTEXT (tmpl))) | |
11702 | return dependent_type_p (DECL_CONTEXT (tmpl)); | |
11703 | return false; | |
11704 | } | |
11705 | ||
d17811fd MM |
11706 | /* Returns TRUE if the specialization TMPL<ARGS> is dependent. */ |
11707 | ||
11708 | bool | |
11709 | dependent_template_id_p (tree tmpl, tree args) | |
11710 | { | |
11711 | return (dependent_template_p (tmpl) | |
11712 | || any_dependent_template_arguments_p (args)); | |
11713 | } | |
11714 | ||
14d22dd6 MM |
11715 | /* TYPE is a TYPENAME_TYPE. Returns the ordinary TYPE to which the |
11716 | TYPENAME_TYPE corresponds. Returns ERROR_MARK_NODE if no such TYPE | |
11717 | can be found. Note that this function peers inside uninstantiated | |
11718 | templates and therefore should be used only in extremely limited | |
11719 | situations. */ | |
11720 | ||
11721 | tree | |
11722 | resolve_typename_type (tree type, bool only_current_p) | |
11723 | { | |
11724 | tree scope; | |
11725 | tree name; | |
11726 | tree decl; | |
11727 | int quals; | |
11728 | ||
11729 | my_friendly_assert (TREE_CODE (type) == TYPENAME_TYPE, | |
11730 | 20010702); | |
11731 | ||
11732 | scope = TYPE_CONTEXT (type); | |
11733 | name = TYPE_IDENTIFIER (type); | |
11734 | ||
11735 | /* If the SCOPE is itself a TYPENAME_TYPE, then we need to resolve | |
11736 | it first before we can figure out what NAME refers to. */ | |
11737 | if (TREE_CODE (scope) == TYPENAME_TYPE) | |
11738 | scope = resolve_typename_type (scope, only_current_p); | |
11739 | /* If we don't know what SCOPE refers to, then we cannot resolve the | |
11740 | TYPENAME_TYPE. */ | |
11741 | if (scope == error_mark_node || TREE_CODE (scope) == TYPENAME_TYPE) | |
11742 | return error_mark_node; | |
11743 | /* If the SCOPE is a template type parameter, we have no way of | |
11744 | resolving the name. */ | |
11745 | if (TREE_CODE (scope) == TEMPLATE_TYPE_PARM) | |
11746 | return type; | |
11747 | /* If the SCOPE is not the current instantiation, there's no reason | |
11748 | to look inside it. */ | |
11749 | if (only_current_p && !currently_open_class (scope)) | |
11750 | return error_mark_node; | |
ca099ac8 MM |
11751 | /* If SCOPE is a partial instantiation, it will not have a valid |
11752 | TYPE_FIELDS list, so use the original template. */ | |
353b4fc0 | 11753 | scope = CLASSTYPE_PRIMARY_TEMPLATE_TYPE (scope); |
14d22dd6 MM |
11754 | /* Enter the SCOPE so that name lookup will be resolved as if we |
11755 | were in the class definition. In particular, SCOPE will no | |
11756 | longer be considered a dependent type. */ | |
11757 | push_scope (scope); | |
11758 | /* Look up the declaration. */ | |
86ac0575 | 11759 | decl = lookup_member (scope, name, /*protect=*/0, /*want_type=*/true); |
14d22dd6 MM |
11760 | /* Obtain the set of qualifiers applied to the TYPE. */ |
11761 | quals = cp_type_quals (type); | |
11762 | /* For a TYPENAME_TYPE like "typename X::template Y<T>", we want to | |
11763 | find a TEMPLATE_DECL. Otherwise, we want to find a TYPE_DECL. */ | |
11764 | if (!decl) | |
11765 | type = error_mark_node; | |
11766 | else if (TREE_CODE (TYPENAME_TYPE_FULLNAME (type)) == IDENTIFIER_NODE | |
11767 | && TREE_CODE (decl) == TYPE_DECL) | |
11768 | type = TREE_TYPE (decl); | |
11769 | else if (TREE_CODE (TYPENAME_TYPE_FULLNAME (type)) == TEMPLATE_ID_EXPR | |
11770 | && DECL_CLASS_TEMPLATE_P (decl)) | |
11771 | { | |
11772 | tree tmpl; | |
11773 | tree args; | |
11774 | /* Obtain the template and the arguments. */ | |
11775 | tmpl = TREE_OPERAND (TYPENAME_TYPE_FULLNAME (type), 0); | |
11776 | args = TREE_OPERAND (TYPENAME_TYPE_FULLNAME (type), 1); | |
11777 | /* Instantiate the template. */ | |
11778 | type = lookup_template_class (tmpl, args, NULL_TREE, NULL_TREE, | |
42eaed49 | 11779 | /*entering_scope=*/0, tf_error | tf_user); |
14d22dd6 MM |
11780 | } |
11781 | else | |
11782 | type = error_mark_node; | |
11783 | /* Qualify the resulting type. */ | |
11784 | if (type != error_mark_node && quals) | |
11785 | type = cp_build_qualified_type (type, quals); | |
11786 | /* Leave the SCOPE. */ | |
11787 | pop_scope (scope); | |
11788 | ||
11789 | return type; | |
11790 | } | |
11791 | ||
d17811fd MM |
11792 | /* EXPR is an expression which is not type-dependent. Return a proxy |
11793 | for EXPR that can be used to compute the types of larger | |
11794 | expressions containing EXPR. */ | |
11795 | ||
11796 | tree | |
11797 | build_non_dependent_expr (tree expr) | |
11798 | { | |
11799 | /* Preserve null pointer constants so that the type of things like | |
11800 | "p == 0" where "p" is a pointer can be determined. */ | |
11801 | if (null_ptr_cst_p (expr)) | |
11802 | return expr; | |
11803 | /* Preserve OVERLOADs; the functions must be available to resolve | |
11804 | types. */ | |
11805 | if (TREE_CODE (expr) == OVERLOAD) | |
11806 | return expr; | |
7433e6d4 MM |
11807 | /* Preserve string constants; conversions from string constants to |
11808 | "char *" are allowed, even though normally a "const char *" | |
11809 | cannot be used to initialize a "char *". */ | |
11810 | if (TREE_CODE (expr) == STRING_CST) | |
11811 | return expr; | |
47d4c811 NS |
11812 | |
11813 | if (TREE_CODE (expr) == COND_EXPR) | |
11814 | return build (COND_EXPR, | |
11815 | TREE_TYPE (expr), | |
11816 | TREE_OPERAND (expr, 0), | |
11817 | build_non_dependent_expr (TREE_OPERAND (expr, 1)), | |
11818 | build_non_dependent_expr (TREE_OPERAND (expr, 2))); | |
11819 | if (TREE_CODE (expr) == COMPOUND_EXPR) | |
11820 | return build (COMPOUND_EXPR, | |
11821 | TREE_TYPE (expr), | |
11822 | TREE_OPERAND (expr, 0), | |
11823 | build_non_dependent_expr (TREE_OPERAND (expr, 1))); | |
11824 | ||
d17811fd MM |
11825 | /* Otherwise, build a NON_DEPENDENT_EXPR. |
11826 | ||
11827 | REFERENCE_TYPEs are not stripped for expressions in templates | |
11828 | because doing so would play havoc with mangling. Consider, for | |
11829 | example: | |
11830 | ||
11831 | template <typename T> void f<T& g>() { g(); } | |
11832 | ||
11833 | In the body of "f", the expression for "g" will have | |
11834 | REFERENCE_TYPE, even though the standard says that it should | |
11835 | not. The reason is that we must preserve the syntactic form of | |
11836 | the expression so that mangling (say) "f<g>" inside the body of | |
11837 | "f" works out correctly. Therefore, the REFERENCE_TYPE is | |
11838 | stripped here. */ | |
018a5803 | 11839 | return build1 (NON_DEPENDENT_EXPR, non_reference (TREE_TYPE (expr)), expr); |
d17811fd MM |
11840 | } |
11841 | ||
11842 | /* ARGS is a TREE_LIST of expressions as arguments to a function call. | |
11843 | Return a new TREE_LIST with the various arguments replaced with | |
11844 | equivalent non-dependent expressions. */ | |
11845 | ||
11846 | tree | |
11847 | build_non_dependent_args (tree args) | |
11848 | { | |
11849 | tree a; | |
11850 | tree new_args; | |
11851 | ||
11852 | new_args = NULL_TREE; | |
11853 | for (a = args; a; a = TREE_CHAIN (a)) | |
11854 | new_args = tree_cons (NULL_TREE, | |
11855 | build_non_dependent_expr (TREE_VALUE (a)), | |
11856 | new_args); | |
11857 | return nreverse (new_args); | |
11858 | } | |
11859 | ||
e2500fed | 11860 | #include "gt-cp-pt.h" |