]>
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, | |
f23fb7f5 | 96 | unification_kind_t, int, bool); |
3a978d72 NN |
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 | ||
ac20c67a GDR |
355 | begin_scope (TREE_VEC_LENGTH (parms) ? sk_template_parms : sk_template_spec, |
356 | NULL); | |
98c1c668 JM |
357 | for (i = 0; i < TREE_VEC_LENGTH (parms); ++i) |
358 | { | |
786b5245 | 359 | tree parm = TREE_VALUE (TREE_VEC_ELT (parms, i)); |
2f939d94 | 360 | my_friendly_assert (DECL_P (parm), 0); |
cae40af6 | 361 | |
98c1c668 JM |
362 | switch (TREE_CODE (parm)) |
363 | { | |
786b5245 | 364 | case TYPE_DECL: |
73b0fce8 | 365 | case TEMPLATE_DECL: |
98c1c668 JM |
366 | pushdecl (parm); |
367 | break; | |
786b5245 MM |
368 | |
369 | case PARM_DECL: | |
370 | { | |
fc03edb3 MM |
371 | /* Make a CONST_DECL as is done in process_template_parm. |
372 | It is ugly that we recreate this here; the original | |
373 | version built in process_template_parm is no longer | |
374 | available. */ | |
786b5245 MM |
375 | tree decl = build_decl (CONST_DECL, DECL_NAME (parm), |
376 | TREE_TYPE (parm)); | |
c727aa5e | 377 | DECL_ARTIFICIAL (decl) = 1; |
3e4a3562 | 378 | TREE_CONSTANT (decl) = TREE_READONLY (decl) = 1; |
786b5245 | 379 | DECL_INITIAL (decl) = DECL_INITIAL (parm); |
cd9f6678 | 380 | SET_DECL_TEMPLATE_PARM_P (decl); |
786b5245 MM |
381 | pushdecl (decl); |
382 | } | |
cae40af6 | 383 | break; |
786b5245 | 384 | |
98c1c668 | 385 | default: |
a98facb0 | 386 | abort (); |
98c1c668 JM |
387 | } |
388 | } | |
389 | } | |
390 | ||
cae40af6 JM |
391 | /* Restore the template parameter context for a member template or |
392 | a friend template defined in a class definition. */ | |
393 | ||
394 | void | |
3a978d72 | 395 | maybe_begin_member_template_processing (tree decl) |
cae40af6 JM |
396 | { |
397 | tree parms; | |
3dcaad8b | 398 | int levels = 0; |
cae40af6 | 399 | |
3dcaad8b MM |
400 | if (inline_needs_template_parms (decl)) |
401 | { | |
402 | parms = DECL_TEMPLATE_PARMS (most_general_template (decl)); | |
403 | levels = TMPL_PARMS_DEPTH (parms) - processing_template_decl; | |
cae40af6 | 404 | |
3dcaad8b MM |
405 | if (DECL_TEMPLATE_SPECIALIZATION (decl)) |
406 | { | |
407 | --levels; | |
408 | parms = TREE_CHAIN (parms); | |
409 | } | |
cae40af6 | 410 | |
3dcaad8b | 411 | push_inline_template_parms_recursive (parms, levels); |
cae40af6 JM |
412 | } |
413 | ||
3dcaad8b MM |
414 | /* Remember how many levels of template parameters we pushed so that |
415 | we can pop them later. */ | |
416 | if (!inline_parm_levels) | |
417 | VARRAY_INT_INIT (inline_parm_levels, 4, "inline_parm_levels"); | |
418 | if (inline_parm_levels_used == inline_parm_levels->num_elements) | |
419 | VARRAY_GROW (inline_parm_levels, 2 * inline_parm_levels_used); | |
420 | VARRAY_INT (inline_parm_levels, inline_parm_levels_used) = levels; | |
421 | ++inline_parm_levels_used; | |
cae40af6 JM |
422 | } |
423 | ||
c6002625 | 424 | /* Undo the effects of begin_member_template_processing. */ |
98c1c668 JM |
425 | |
426 | void | |
3a978d72 | 427 | maybe_end_member_template_processing (void) |
98c1c668 | 428 | { |
3dcaad8b MM |
429 | int i; |
430 | ||
431 | if (!inline_parm_levels_used) | |
98c1c668 JM |
432 | return; |
433 | ||
3dcaad8b MM |
434 | --inline_parm_levels_used; |
435 | for (i = 0; | |
436 | i < VARRAY_INT (inline_parm_levels, inline_parm_levels_used); | |
437 | ++i) | |
cae40af6 JM |
438 | { |
439 | --processing_template_decl; | |
440 | current_template_parms = TREE_CHAIN (current_template_parms); | |
441 | poplevel (0, 0, 0); | |
442 | } | |
98c1c668 JM |
443 | } |
444 | ||
838dfd8a | 445 | /* Returns nonzero iff T is a member template function. We must be |
f84b4be9 | 446 | careful as in |
75650646 MM |
447 | |
448 | template <class T> class C { void f(); } | |
449 | ||
450 | Here, f is a template function, and a member, but not a member | |
451 | template. This function does not concern itself with the origin of | |
452 | T, only its present state. So if we have | |
453 | ||
454 | template <class T> class C { template <class U> void f(U); } | |
455 | ||
456 | then neither C<int>::f<char> nor C<T>::f<double> is considered | |
f181d4ae MM |
457 | to be a member template. But, `template <class U> void |
458 | C<int>::f(U)' is considered a member template. */ | |
98c1c668 | 459 | |
cae40af6 | 460 | int |
3a978d72 | 461 | is_member_template (tree t) |
98c1c668 | 462 | { |
f181d4ae | 463 | if (!DECL_FUNCTION_TEMPLATE_P (t)) |
75650646 | 464 | /* Anything that isn't a function or a template function is |
aa5f3bad MM |
465 | certainly not a member template. */ |
466 | return 0; | |
467 | ||
cae40af6 | 468 | /* A local class can't have member templates. */ |
4f1c5b7d | 469 | if (decl_function_context (t)) |
cae40af6 JM |
470 | return 0; |
471 | ||
f181d4ae | 472 | return (DECL_FUNCTION_MEMBER_P (DECL_TEMPLATE_RESULT (t)) |
f84b4be9 JM |
473 | /* If there are more levels of template parameters than |
474 | there are template classes surrounding the declaration, | |
475 | then we have a member template. */ | |
f181d4ae | 476 | && (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (t)) > |
4f1c5b7d | 477 | template_class_depth (DECL_CONTEXT (t)))); |
f84b4be9 | 478 | } |
98c1c668 | 479 | |
ba4f4e5d | 480 | #if 0 /* UNUSED */ |
838dfd8a | 481 | /* Returns nonzero iff T is a member template class. See |
2ee4e084 MM |
482 | is_member_template for a description of what precisely constitutes |
483 | a member template. */ | |
484 | ||
485 | int | |
3a978d72 | 486 | is_member_template_class (tree t) |
2ee4e084 MM |
487 | { |
488 | if (!DECL_CLASS_TEMPLATE_P (t)) | |
489 | /* Anything that isn't a class template, is certainly not a member | |
490 | template. */ | |
491 | return 0; | |
492 | ||
493 | if (!DECL_CLASS_SCOPE_P (t)) | |
494 | /* Anything whose context isn't a class type is surely not a | |
495 | member template. */ | |
496 | return 0; | |
497 | ||
498 | /* If there are more levels of template parameters than there are | |
499 | template classes surrounding the declaration, then we have a | |
500 | member template. */ | |
36a117a5 | 501 | return (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (t)) > |
2ee4e084 MM |
502 | template_class_depth (DECL_CONTEXT (t))); |
503 | } | |
ba4f4e5d | 504 | #endif |
2ee4e084 | 505 | |
36a117a5 | 506 | /* Return a new template argument vector which contains all of ARGS, |
f9a7ae04 | 507 | but has as its innermost set of arguments the EXTRA_ARGS. */ |
e6f1275f JM |
508 | |
509 | static tree | |
3a978d72 | 510 | add_to_template_args (tree args, tree extra_args) |
e6f1275f | 511 | { |
36a117a5 MM |
512 | tree new_args; |
513 | int extra_depth; | |
514 | int i; | |
515 | int j; | |
e6f1275f | 516 | |
36a117a5 | 517 | extra_depth = TMPL_ARGS_DEPTH (extra_args); |
f31c0a32 | 518 | new_args = make_tree_vec (TMPL_ARGS_DEPTH (args) + extra_depth); |
e6f1275f | 519 | |
36a117a5 MM |
520 | for (i = 1; i <= TMPL_ARGS_DEPTH (args); ++i) |
521 | SET_TMPL_ARGS_LEVEL (new_args, i, TMPL_ARGS_LEVEL (args, i)); | |
e6f1275f | 522 | |
36a117a5 MM |
523 | for (j = 1; j <= extra_depth; ++j, ++i) |
524 | SET_TMPL_ARGS_LEVEL (new_args, i, TMPL_ARGS_LEVEL (extra_args, j)); | |
525 | ||
e6f1275f JM |
526 | return new_args; |
527 | } | |
528 | ||
36a117a5 MM |
529 | /* Like add_to_template_args, but only the outermost ARGS are added to |
530 | the EXTRA_ARGS. In particular, all but TMPL_ARGS_DEPTH | |
531 | (EXTRA_ARGS) levels are added. This function is used to combine | |
532 | the template arguments from a partial instantiation with the | |
533 | template arguments used to attain the full instantiation from the | |
534 | partial instantiation. */ | |
98c1c668 | 535 | |
4966381a | 536 | static tree |
3a978d72 | 537 | add_outermost_template_args (tree args, tree extra_args) |
98c1c668 JM |
538 | { |
539 | tree new_args; | |
540 | ||
e4a84209 MM |
541 | /* If there are more levels of EXTRA_ARGS than there are ARGS, |
542 | something very fishy is going on. */ | |
543 | my_friendly_assert (TMPL_ARGS_DEPTH (args) >= TMPL_ARGS_DEPTH (extra_args), | |
544 | 0); | |
545 | ||
546 | /* If *all* the new arguments will be the EXTRA_ARGS, just return | |
547 | them. */ | |
548 | if (TMPL_ARGS_DEPTH (args) == TMPL_ARGS_DEPTH (extra_args)) | |
549 | return extra_args; | |
550 | ||
36a117a5 MM |
551 | /* For the moment, we make ARGS look like it contains fewer levels. */ |
552 | TREE_VEC_LENGTH (args) -= TMPL_ARGS_DEPTH (extra_args); | |
553 | ||
554 | new_args = add_to_template_args (args, extra_args); | |
98c1c668 | 555 | |
36a117a5 MM |
556 | /* Now, we restore ARGS to its full dimensions. */ |
557 | TREE_VEC_LENGTH (args) += TMPL_ARGS_DEPTH (extra_args); | |
98c1c668 JM |
558 | |
559 | return new_args; | |
560 | } | |
5566b478 | 561 | |
f9a7ae04 MM |
562 | /* Return the N levels of innermost template arguments from the ARGS. */ |
563 | ||
564 | tree | |
3a978d72 | 565 | get_innermost_template_args (tree args, int n) |
f9a7ae04 MM |
566 | { |
567 | tree new_args; | |
568 | int extra_levels; | |
569 | int i; | |
570 | ||
571 | my_friendly_assert (n >= 0, 20000603); | |
572 | ||
573 | /* If N is 1, just return the innermost set of template arguments. */ | |
574 | if (n == 1) | |
575 | return TMPL_ARGS_LEVEL (args, TMPL_ARGS_DEPTH (args)); | |
576 | ||
577 | /* If we're not removing anything, just return the arguments we were | |
578 | given. */ | |
579 | extra_levels = TMPL_ARGS_DEPTH (args) - n; | |
580 | my_friendly_assert (extra_levels >= 0, 20000603); | |
581 | if (extra_levels == 0) | |
582 | return args; | |
583 | ||
584 | /* Make a new set of arguments, not containing the outer arguments. */ | |
585 | new_args = make_tree_vec (n); | |
586 | for (i = 1; i <= n; ++i) | |
587 | SET_TMPL_ARGS_LEVEL (new_args, i, | |
588 | TMPL_ARGS_LEVEL (args, i + extra_levels)); | |
589 | ||
590 | return new_args; | |
591 | } | |
592 | ||
5566b478 MS |
593 | /* We've got a template header coming up; push to a new level for storing |
594 | the parms. */ | |
8d08fdba | 595 | |
8d08fdba | 596 | void |
3a978d72 | 597 | begin_template_parm_list (void) |
8d08fdba | 598 | { |
6757edfe MM |
599 | /* We use a non-tag-transparent scope here, which causes pushtag to |
600 | put tags in this scope, rather than in the enclosing class or | |
601 | namespace scope. This is the right thing, since we want | |
602 | TEMPLATE_DECLS, and not TYPE_DECLS for template classes. For a | |
603 | global template class, push_template_decl handles putting the | |
604 | TEMPLATE_DECL into top-level scope. For a nested template class, | |
605 | e.g.: | |
606 | ||
607 | template <class T> struct S1 { | |
608 | template <class T> struct S2 {}; | |
609 | }; | |
610 | ||
611 | pushtag contains special code to call pushdecl_with_scope on the | |
612 | TEMPLATE_DECL for S2. */ | |
ac20c67a | 613 | begin_scope (sk_template_parms, NULL); |
5156628f | 614 | ++processing_template_decl; |
67ffc812 | 615 | ++processing_template_parmlist; |
386b8a85 JM |
616 | note_template_header (0); |
617 | } | |
618 | ||
6c30752f | 619 | /* This routine is called when a specialization is declared. If it is |
0e339752 | 620 | invalid to declare a specialization here, an error is reported. */ |
6c30752f | 621 | |
e9659ab0 | 622 | static void |
3a978d72 | 623 | check_specialization_scope (void) |
6c30752f MM |
624 | { |
625 | tree scope = current_scope (); | |
3ddfb0e6 | 626 | |
6c30752f MM |
627 | /* [temp.expl.spec] |
628 | ||
629 | An explicit specialization shall be declared in the namespace of | |
630 | which the template is a member, or, for member templates, in the | |
631 | namespace of which the enclosing class or enclosing class | |
632 | template is a member. An explicit specialization of a member | |
633 | function, member class or static data member of a class template | |
634 | shall be declared in the namespace of which the class template | |
635 | is a member. */ | |
636 | if (scope && TREE_CODE (scope) != NAMESPACE_DECL) | |
33bd39a2 | 637 | error ("explicit specialization in non-namespace scope `%D'", |
6c30752f | 638 | scope); |
3ddfb0e6 | 639 | |
6c30752f MM |
640 | /* [temp.expl.spec] |
641 | ||
642 | In an explicit specialization declaration for a member of a class | |
643 | template or a member template that appears in namespace scope, | |
644 | the member template and some of its enclosing class templates may | |
645 | remain unspecialized, except that the declaration shall not | |
646 | explicitly specialize a class member template if its enclosing | |
647 | class templates are not explicitly specialized as well. */ | |
648 | if (current_template_parms) | |
33bd39a2 | 649 | error ("enclosing class templates are not explicitly specialized"); |
6c30752f MM |
650 | } |
651 | ||
c6002625 | 652 | /* We've just seen template <>. */ |
386b8a85 JM |
653 | |
654 | void | |
3a978d72 | 655 | begin_specialization (void) |
386b8a85 | 656 | { |
ac20c67a | 657 | begin_scope (sk_template_spec, NULL); |
386b8a85 | 658 | note_template_header (1); |
6c30752f | 659 | check_specialization_scope (); |
386b8a85 JM |
660 | } |
661 | ||
dc957d14 | 662 | /* Called at then end of processing a declaration preceded by |
386b8a85 JM |
663 | template<>. */ |
664 | ||
665 | void | |
3a978d72 | 666 | end_specialization (void) |
386b8a85 | 667 | { |
74b846e0 | 668 | finish_scope (); |
386b8a85 JM |
669 | reset_specialization (); |
670 | } | |
671 | ||
386b8a85 | 672 | /* Any template <>'s that we have seen thus far are not referring to a |
c6002625 | 673 | function specialization. */ |
386b8a85 JM |
674 | |
675 | void | |
3a978d72 | 676 | reset_specialization (void) |
386b8a85 JM |
677 | { |
678 | processing_specialization = 0; | |
679 | template_header_count = 0; | |
680 | } | |
681 | ||
838dfd8a | 682 | /* We've just seen a template header. If SPECIALIZATION is nonzero, |
386b8a85 JM |
683 | it was of the form template <>. */ |
684 | ||
4966381a | 685 | static void |
3a978d72 | 686 | note_template_header (int specialization) |
386b8a85 JM |
687 | { |
688 | processing_specialization = specialization; | |
689 | template_header_count++; | |
690 | } | |
691 | ||
75650646 | 692 | /* We're beginning an explicit instantiation. */ |
386b8a85 | 693 | |
75650646 | 694 | void |
3a978d72 | 695 | begin_explicit_instantiation (void) |
386b8a85 | 696 | { |
a723baf1 MM |
697 | my_friendly_assert (!processing_explicit_instantiation, 20020913); |
698 | processing_explicit_instantiation = true; | |
75650646 | 699 | } |
386b8a85 | 700 | |
386b8a85 | 701 | |
75650646 | 702 | void |
3a978d72 | 703 | end_explicit_instantiation (void) |
75650646 | 704 | { |
a723baf1 MM |
705 | my_friendly_assert(processing_explicit_instantiation, 20020913); |
706 | processing_explicit_instantiation = false; | |
75650646 | 707 | } |
386b8a85 | 708 | |
36a117a5 MM |
709 | /* The TYPE is being declared. If it is a template type, that means it |
710 | is a partial specialization. Do appropriate error-checking. */ | |
711 | ||
712 | void | |
3a978d72 | 713 | maybe_process_partial_specialization (tree type) |
36a117a5 | 714 | { |
6e049fcd KL |
715 | /* TYPE maybe an ERROR_MARK_NODE. */ |
716 | tree context = TYPE_P (type) ? TYPE_CONTEXT (type) : NULL_TREE; | |
717 | ||
a723baf1 | 718 | if (CLASS_TYPE_P (type) && CLASSTYPE_USE_TEMPLATE (type)) |
36a117a5 | 719 | { |
6e049fcd KL |
720 | /* This is for ordinary explicit specialization and partial |
721 | specialization of a template class such as: | |
722 | ||
723 | template <> class C<int>; | |
724 | ||
725 | or: | |
726 | ||
727 | template <class T> class C<T*>; | |
728 | ||
729 | Make sure that `C<int>' and `C<T*>' are implicit instantiations. */ | |
730 | ||
36a117a5 | 731 | if (CLASSTYPE_IMPLICIT_INSTANTIATION (type) |
d0f062fb | 732 | && !COMPLETE_TYPE_P (type)) |
36a117a5 | 733 | { |
700466c2 JM |
734 | if (current_namespace |
735 | != decl_namespace_context (CLASSTYPE_TI_TEMPLATE (type))) | |
736 | { | |
33bd39a2 | 737 | pedwarn ("specializing `%#T' in different namespace", type); |
700466c2 JM |
738 | cp_pedwarn_at (" from definition of `%#D'", |
739 | CLASSTYPE_TI_TEMPLATE (type)); | |
740 | } | |
370af2d5 | 741 | SET_CLASSTYPE_TEMPLATE_SPECIALIZATION (type); |
36a117a5 MM |
742 | if (processing_template_decl) |
743 | push_template_decl (TYPE_MAIN_DECL (type)); | |
744 | } | |
745 | else if (CLASSTYPE_TEMPLATE_INSTANTIATION (type)) | |
33bd39a2 | 746 | error ("specialization of `%T' after instantiation", type); |
36a117a5 | 747 | } |
6e049fcd KL |
748 | else if (CLASS_TYPE_P (type) |
749 | && !CLASSTYPE_USE_TEMPLATE (type) | |
750 | && CLASSTYPE_TEMPLATE_INFO (type) | |
751 | && context && CLASS_TYPE_P (context) | |
752 | && CLASSTYPE_TEMPLATE_INFO (context)) | |
753 | { | |
754 | /* This is for an explicit specialization of member class | |
755 | template according to [temp.expl.spec/18]: | |
756 | ||
757 | template <> template <class U> class C<int>::D; | |
758 | ||
759 | The context `C<int>' must be an implicit instantiation. | |
760 | Otherwise this is just a member class template declared | |
761 | earlier like: | |
762 | ||
763 | template <> class C<int> { template <class U> class D; }; | |
764 | template <> template <class U> class C<int>::D; | |
765 | ||
766 | In the first case, `C<int>::D' is a specialization of `C<T>::D' | |
767 | while in the second case, `C<int>::D' is a primary template | |
768 | and `C<T>::D' may not exist. */ | |
769 | ||
770 | if (CLASSTYPE_IMPLICIT_INSTANTIATION (context) | |
771 | && !COMPLETE_TYPE_P (type)) | |
772 | { | |
773 | tree t; | |
774 | ||
775 | if (current_namespace | |
776 | != decl_namespace_context (CLASSTYPE_TI_TEMPLATE (type))) | |
777 | { | |
778 | pedwarn ("specializing `%#T' in different namespace", type); | |
779 | cp_pedwarn_at (" from definition of `%#D'", | |
780 | CLASSTYPE_TI_TEMPLATE (type)); | |
781 | } | |
782 | ||
783 | /* Check for invalid specialization after instantiation: | |
784 | ||
785 | template <> template <> class C<int>::D<int>; | |
786 | template <> template <class U> class C<int>::D; */ | |
787 | ||
788 | for (t = DECL_TEMPLATE_INSTANTIATIONS | |
789 | (most_general_template (CLASSTYPE_TI_TEMPLATE (type))); | |
790 | t; t = TREE_CHAIN (t)) | |
791 | if (TREE_VALUE (t) != type | |
792 | && TYPE_CONTEXT (TREE_VALUE (t)) == context) | |
793 | error ("specialization `%T' after instantiation `%T'", | |
794 | type, TREE_VALUE (t)); | |
795 | ||
796 | /* Mark TYPE as a specialization. And as a result, we only | |
797 | have one level of template argument for the innermost | |
798 | class template. */ | |
799 | SET_CLASSTYPE_TEMPLATE_SPECIALIZATION (type); | |
800 | CLASSTYPE_TI_ARGS (type) | |
801 | = INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (type)); | |
802 | } | |
803 | } | |
20496fa2 | 804 | else if (processing_specialization) |
33bd39a2 | 805 | error ("explicit specialization of non-template `%T'", type); |
36a117a5 MM |
806 | } |
807 | ||
75650646 MM |
808 | /* Retrieve the specialization (in the sense of [temp.spec] - a |
809 | specialization is either an instantiation or an explicit | |
810 | specialization) of TMPL for the given template ARGS. If there is | |
811 | no such specialization, return NULL_TREE. The ARGS are a vector of | |
812 | arguments, or a vector of vectors of arguments, in the case of | |
813 | templates with more than one level of parameters. */ | |
814 | ||
815 | static tree | |
3a978d72 | 816 | retrieve_specialization (tree tmpl, tree args) |
75650646 MM |
817 | { |
818 | tree s; | |
819 | ||
820 | my_friendly_assert (TREE_CODE (tmpl) == TEMPLATE_DECL, 0); | |
821 | ||
36a117a5 MM |
822 | /* There should be as many levels of arguments as there are |
823 | levels of parameters. */ | |
824 | my_friendly_assert (TMPL_ARGS_DEPTH (args) | |
825 | == TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl)), | |
826 | 0); | |
827 | ||
75650646 MM |
828 | for (s = DECL_TEMPLATE_SPECIALIZATIONS (tmpl); |
829 | s != NULL_TREE; | |
830 | s = TREE_CHAIN (s)) | |
831 | if (comp_template_args (TREE_PURPOSE (s), args)) | |
832 | return TREE_VALUE (s); | |
833 | ||
834 | return NULL_TREE; | |
386b8a85 JM |
835 | } |
836 | ||
dc957d14 | 837 | /* Like retrieve_specialization, but for local declarations. */ |
9188c363 MM |
838 | |
839 | static tree | |
3a978d72 | 840 | retrieve_local_specialization (tree tmpl) |
9188c363 | 841 | { |
c68b0a84 KG |
842 | tree spec = htab_find_with_hash (local_specializations, tmpl, |
843 | htab_hash_pointer (tmpl)); | |
a723baf1 | 844 | return spec ? TREE_PURPOSE (spec) : NULL_TREE; |
9188c363 MM |
845 | } |
846 | ||
838dfd8a | 847 | /* Returns nonzero iff DECL is a specialization of TMPL. */ |
6757edfe MM |
848 | |
849 | int | |
3a978d72 | 850 | is_specialization_of (tree decl, tree tmpl) |
6757edfe MM |
851 | { |
852 | tree t; | |
853 | ||
854 | if (TREE_CODE (decl) == FUNCTION_DECL) | |
855 | { | |
856 | for (t = decl; | |
857 | t != NULL_TREE; | |
858 | t = DECL_TEMPLATE_INFO (t) ? DECL_TI_TEMPLATE (t) : NULL_TREE) | |
859 | if (t == tmpl) | |
860 | return 1; | |
861 | } | |
862 | else | |
863 | { | |
864 | my_friendly_assert (TREE_CODE (decl) == TYPE_DECL, 0); | |
865 | ||
866 | for (t = TREE_TYPE (decl); | |
867 | t != NULL_TREE; | |
868 | t = CLASSTYPE_USE_TEMPLATE (t) | |
869 | ? TREE_TYPE (CLASSTYPE_TI_TEMPLATE (t)) : NULL_TREE) | |
9edc3913 | 870 | if (same_type_ignoring_top_level_qualifiers_p (t, TREE_TYPE (tmpl))) |
6757edfe MM |
871 | return 1; |
872 | } | |
386b8a85 | 873 | |
6757edfe MM |
874 | return 0; |
875 | } | |
75650646 MM |
876 | |
877 | /* Register the specialization SPEC as a specialization of TMPL with | |
36a117a5 MM |
878 | the indicated ARGS. Returns SPEC, or an equivalent prior |
879 | declaration, if available. */ | |
75650646 | 880 | |
36a117a5 | 881 | static tree |
3a978d72 | 882 | register_specialization (tree spec, tree tmpl, tree args) |
75650646 MM |
883 | { |
884 | tree s; | |
885 | ||
886 | my_friendly_assert (TREE_CODE (tmpl) == TEMPLATE_DECL, 0); | |
887 | ||
36a117a5 MM |
888 | if (TREE_CODE (spec) == FUNCTION_DECL |
889 | && uses_template_parms (DECL_TI_ARGS (spec))) | |
890 | /* This is the FUNCTION_DECL for a partial instantiation. Don't | |
891 | register it; we want the corresponding TEMPLATE_DECL instead. | |
892 | We use `uses_template_parms (DECL_TI_ARGS (spec))' rather than | |
893 | the more obvious `uses_template_parms (spec)' to avoid problems | |
894 | with default function arguments. In particular, given | |
895 | something like this: | |
896 | ||
897 | template <class T> void f(T t1, T t = T()) | |
898 | ||
899 | the default argument expression is not substituted for in an | |
900 | instantiation unless and until it is actually needed. */ | |
901 | return spec; | |
75650646 | 902 | |
36a117a5 MM |
903 | /* There should be as many levels of arguments as there are |
904 | levels of parameters. */ | |
905 | my_friendly_assert (TMPL_ARGS_DEPTH (args) | |
906 | == TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl)), | |
907 | 0); | |
908 | ||
75650646 MM |
909 | for (s = DECL_TEMPLATE_SPECIALIZATIONS (tmpl); |
910 | s != NULL_TREE; | |
911 | s = TREE_CHAIN (s)) | |
22e9174f MM |
912 | { |
913 | tree fn = TREE_VALUE (s); | |
914 | ||
915 | /* We can sometimes try to re-register a specialization that we've | |
916 | already got. In particular, regenerate_decl_from_template | |
917 | calls duplicate_decls which will update the specialization | |
918 | list. But, we'll still get called again here anyhow. It's | |
919 | more convenient to simply allow this than to try to prevent it. */ | |
920 | if (fn == spec) | |
921 | return spec; | |
922 | else if (comp_template_args (TREE_PURPOSE (s), args)) | |
923 | { | |
924 | if (DECL_TEMPLATE_SPECIALIZATION (spec)) | |
925 | { | |
926 | if (DECL_TEMPLATE_INSTANTIATION (fn)) | |
927 | { | |
928 | if (TREE_USED (fn) | |
929 | || DECL_EXPLICIT_INSTANTIATION (fn)) | |
930 | { | |
33bd39a2 | 931 | error ("specialization of %D after instantiation", |
22e9174f MM |
932 | fn); |
933 | return spec; | |
934 | } | |
935 | else | |
936 | { | |
937 | /* This situation should occur only if the first | |
938 | specialization is an implicit instantiation, | |
939 | the second is an explicit specialization, and | |
940 | the implicit instantiation has not yet been | |
941 | used. That situation can occur if we have | |
942 | implicitly instantiated a member function and | |
943 | then specialized it later. | |
944 | ||
945 | We can also wind up here if a friend | |
946 | declaration that looked like an instantiation | |
947 | turns out to be a specialization: | |
948 | ||
949 | template <class T> void foo(T); | |
950 | class S { friend void foo<>(int) }; | |
951 | template <> void foo(int); | |
952 | ||
953 | We transform the existing DECL in place so that | |
954 | any pointers to it become pointers to the | |
955 | updated declaration. | |
956 | ||
957 | If there was a definition for the template, but | |
958 | not for the specialization, we want this to | |
959 | look as if there is no definition, and vice | |
960 | versa. */ | |
961 | DECL_INITIAL (fn) = NULL_TREE; | |
962 | duplicate_decls (spec, fn); | |
963 | ||
964 | return fn; | |
965 | } | |
966 | } | |
967 | else if (DECL_TEMPLATE_SPECIALIZATION (fn)) | |
968 | { | |
b190f239 | 969 | if (!duplicate_decls (spec, fn) && DECL_INITIAL (spec)) |
f31686a3 RH |
970 | /* Dup decl failed, but this is a new |
971 | definition. Set the line number so any errors | |
972 | match this new definition. */ | |
973 | DECL_SOURCE_LOCATION (fn) = DECL_SOURCE_LOCATION (spec); | |
b190f239 | 974 | |
22e9174f MM |
975 | return fn; |
976 | } | |
977 | } | |
978 | } | |
75650646 MM |
979 | } |
980 | ||
981 | DECL_TEMPLATE_SPECIALIZATIONS (tmpl) | |
e1b3e07d | 982 | = tree_cons (args, spec, DECL_TEMPLATE_SPECIALIZATIONS (tmpl)); |
36a117a5 MM |
983 | |
984 | return spec; | |
985 | } | |
986 | ||
987 | /* Unregister the specialization SPEC as a specialization of TMPL. | |
b3445994 MM |
988 | Replace it with NEW_SPEC, if NEW_SPEC is non-NULL. Returns true |
989 | if the SPEC was listed as a specialization of TMPL. */ | |
36a117a5 | 990 | |
b3445994 MM |
991 | bool |
992 | reregister_specialization (tree spec, tree tmpl, tree new_spec) | |
36a117a5 MM |
993 | { |
994 | tree* s; | |
995 | ||
996 | for (s = &DECL_TEMPLATE_SPECIALIZATIONS (tmpl); | |
997 | *s != NULL_TREE; | |
998 | s = &TREE_CHAIN (*s)) | |
999 | if (TREE_VALUE (*s) == spec) | |
1000 | { | |
b3445994 MM |
1001 | if (!new_spec) |
1002 | *s = TREE_CHAIN (*s); | |
1003 | else | |
a3d87771 | 1004 | TREE_VALUE (*s) = new_spec; |
36a117a5 MM |
1005 | return 1; |
1006 | } | |
1007 | ||
1008 | return 0; | |
75650646 MM |
1009 | } |
1010 | ||
a723baf1 MM |
1011 | /* Compare an entry in the local specializations hash table P1 (which |
1012 | is really a pointer to a TREE_LIST) with P2 (which is really a | |
1013 | DECL). */ | |
1014 | ||
1015 | static int | |
1016 | eq_local_specializations (const void *p1, const void *p2) | |
1017 | { | |
1018 | return TREE_VALUE ((tree) p1) == (tree) p2; | |
1019 | } | |
1020 | ||
69f794a7 MM |
1021 | /* Hash P1, an entry in the local specializations table. */ |
1022 | ||
1023 | static hashval_t | |
1024 | hash_local_specialization (const void* p1) | |
1025 | { | |
1026 | return htab_hash_pointer (TREE_VALUE ((tree) p1)); | |
1027 | } | |
1028 | ||
6dfbb909 MM |
1029 | /* Like register_specialization, but for local declarations. We are |
1030 | registering SPEC, an instantiation of TMPL. */ | |
9188c363 | 1031 | |
414ea4aa | 1032 | static void |
3a978d72 | 1033 | register_local_specialization (tree spec, tree tmpl) |
9188c363 | 1034 | { |
6dfbb909 MM |
1035 | void **slot; |
1036 | ||
69f794a7 MM |
1037 | slot = htab_find_slot_with_hash (local_specializations, tmpl, |
1038 | htab_hash_pointer (tmpl), INSERT); | |
a723baf1 | 1039 | *slot = build_tree_list (spec, tmpl); |
9188c363 MM |
1040 | } |
1041 | ||
e1467ff2 MM |
1042 | /* Print the list of candidate FNS in an error message. */ |
1043 | ||
104bf76a | 1044 | void |
3a978d72 | 1045 | print_candidates (tree fns) |
e1467ff2 MM |
1046 | { |
1047 | tree fn; | |
1048 | ||
d8e178a0 | 1049 | const char *str = "candidates are:"; |
e1467ff2 MM |
1050 | |
1051 | for (fn = fns; fn != NULL_TREE; fn = TREE_CHAIN (fn)) | |
1052 | { | |
d6479fe7 MM |
1053 | tree f; |
1054 | ||
1055 | for (f = TREE_VALUE (fn); f; f = OVL_NEXT (f)) | |
1056 | cp_error_at ("%s %+#D", str, OVL_CURRENT (f)); | |
e1467ff2 MM |
1057 | str = " "; |
1058 | } | |
1059 | } | |
1060 | ||
75650646 | 1061 | /* Returns the template (one of the functions given by TEMPLATE_ID) |
e1467ff2 | 1062 | which can be specialized to match the indicated DECL with the |
03017874 MM |
1063 | explicit template args given in TEMPLATE_ID. The DECL may be |
1064 | NULL_TREE if none is available. In that case, the functions in | |
1065 | TEMPLATE_ID are non-members. | |
1066 | ||
838dfd8a | 1067 | If NEED_MEMBER_TEMPLATE is nonzero the function is known to be a |
03017874 MM |
1068 | specialization of a member template. |
1069 | ||
1070 | The template args (those explicitly specified and those deduced) | |
1071 | are output in a newly created vector *TARGS_OUT. | |
1072 | ||
1073 | If it is impossible to determine the result, an error message is | |
bf8f3f93 | 1074 | issued. The error_mark_node is returned to indicate failure. */ |
75650646 | 1075 | |
e9659ab0 | 1076 | static tree |
3a978d72 NN |
1077 | determine_specialization (tree template_id, |
1078 | tree decl, | |
1079 | tree* targs_out, | |
1080 | int need_member_template) | |
386b8a85 | 1081 | { |
03017874 MM |
1082 | tree fns; |
1083 | tree targs; | |
1084 | tree explicit_targs; | |
1085 | tree candidates = NULL_TREE; | |
1086 | tree templates = NULL_TREE; | |
386b8a85 | 1087 | |
e1467ff2 MM |
1088 | *targs_out = NULL_TREE; |
1089 | ||
f2e48b67 BK |
1090 | if (template_id == error_mark_node) |
1091 | return error_mark_node; | |
1092 | ||
1093 | fns = TREE_OPERAND (template_id, 0); | |
03017874 | 1094 | explicit_targs = TREE_OPERAND (template_id, 1); |
f2e48b67 | 1095 | |
27fafc8d JM |
1096 | if (fns == error_mark_node) |
1097 | return error_mark_node; | |
1098 | ||
c6002625 | 1099 | /* Check for baselinks. */ |
91e490ab | 1100 | if (BASELINK_P (fns)) |
da15dae6 | 1101 | fns = BASELINK_FUNCTIONS (fns); |
386b8a85 | 1102 | |
91e490ab MM |
1103 | if (!is_overloaded_fn (fns)) |
1104 | { | |
33bd39a2 | 1105 | error ("`%D' is not a function template", fns); |
91e490ab MM |
1106 | return error_mark_node; |
1107 | } | |
1108 | ||
2c73f9f5 | 1109 | for (; fns; fns = OVL_NEXT (fns)) |
386b8a85 | 1110 | { |
9dfce8fd | 1111 | tree fn = OVL_CURRENT (fns); |
03017874 MM |
1112 | |
1113 | if (TREE_CODE (fn) == TEMPLATE_DECL) | |
d955f6ea KL |
1114 | { |
1115 | tree decl_arg_types; | |
1116 | ||
1117 | /* DECL might be a specialization of FN. */ | |
1118 | ||
1119 | /* Adjust the type of DECL in case FN is a static member. */ | |
1120 | decl_arg_types = TYPE_ARG_TYPES (TREE_TYPE (decl)); | |
1121 | if (DECL_STATIC_FUNCTION_P (fn) | |
1122 | && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl)) | |
1123 | decl_arg_types = TREE_CHAIN (decl_arg_types); | |
1124 | ||
1125 | /* Check that the number of function parameters matches. | |
1126 | For example, | |
1127 | template <class T> void f(int i = 0); | |
1128 | template <> void f<int>(); | |
0e339752 | 1129 | The specialization f<int> is invalid but is not caught |
d955f6ea KL |
1130 | by get_bindings below. */ |
1131 | ||
1132 | if (list_length (TYPE_ARG_TYPES (TREE_TYPE (fn))) | |
1133 | != list_length (decl_arg_types)) | |
1134 | continue; | |
1135 | ||
1136 | /* See whether this function might be a specialization of this | |
1137 | template. */ | |
1138 | targs = get_bindings (fn, decl, explicit_targs); | |
1139 | ||
1140 | if (!targs) | |
1141 | /* We cannot deduce template arguments that when used to | |
1142 | specialize TMPL will produce DECL. */ | |
1143 | continue; | |
1144 | ||
1145 | /* Save this template, and the arguments deduced. */ | |
1146 | templates = tree_cons (targs, fn, templates); | |
1147 | } | |
03017874 MM |
1148 | else if (need_member_template) |
1149 | /* FN is an ordinary member function, and we need a | |
1150 | specialization of a member template. */ | |
d955f6ea | 1151 | ; |
03017874 MM |
1152 | else if (TREE_CODE (fn) != FUNCTION_DECL) |
1153 | /* We can get IDENTIFIER_NODEs here in certain erroneous | |
1154 | cases. */ | |
d955f6ea | 1155 | ; |
03017874 MM |
1156 | else if (!DECL_FUNCTION_MEMBER_P (fn)) |
1157 | /* This is just an ordinary non-member function. Nothing can | |
1158 | be a specialization of that. */ | |
d955f6ea | 1159 | ; |
3b82c249 KL |
1160 | else if (DECL_ARTIFICIAL (fn)) |
1161 | /* Cannot specialize functions that are created implicitly. */ | |
d955f6ea | 1162 | ; |
75650646 | 1163 | else |
03017874 MM |
1164 | { |
1165 | tree decl_arg_types; | |
386b8a85 | 1166 | |
03017874 MM |
1167 | /* This is an ordinary member function. However, since |
1168 | we're here, we can assume it's enclosing class is a | |
1169 | template class. For example, | |
1170 | ||
1171 | template <typename T> struct S { void f(); }; | |
1172 | template <> void S<int>::f() {} | |
1173 | ||
1174 | Here, S<int>::f is a non-template, but S<int> is a | |
1175 | template class. If FN has the same type as DECL, we | |
1176 | might be in business. */ | |
f5d47abd KL |
1177 | |
1178 | if (!DECL_TEMPLATE_INFO (fn)) | |
1179 | /* Its enclosing class is an explicit specialization | |
1180 | of a template class. This is not a candidate. */ | |
1181 | continue; | |
1182 | ||
03017874 MM |
1183 | if (!same_type_p (TREE_TYPE (TREE_TYPE (decl)), |
1184 | TREE_TYPE (TREE_TYPE (fn)))) | |
1185 | /* The return types differ. */ | |
1186 | continue; | |
1187 | ||
1188 | /* Adjust the type of DECL in case FN is a static member. */ | |
1189 | decl_arg_types = TYPE_ARG_TYPES (TREE_TYPE (decl)); | |
1190 | if (DECL_STATIC_FUNCTION_P (fn) | |
1191 | && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl)) | |
1192 | decl_arg_types = TREE_CHAIN (decl_arg_types); | |
1193 | ||
1194 | if (compparms (TYPE_ARG_TYPES (TREE_TYPE (fn)), | |
1195 | decl_arg_types)) | |
1196 | /* They match! */ | |
1197 | candidates = tree_cons (NULL_TREE, fn, candidates); | |
03017874 | 1198 | } |
386b8a85 | 1199 | } |
03017874 | 1200 | |
bf8f3f93 | 1201 | if (templates && TREE_CHAIN (templates)) |
386b8a85 | 1202 | { |
03017874 MM |
1203 | /* We have: |
1204 | ||
1205 | [temp.expl.spec] | |
1206 | ||
1207 | It is possible for a specialization with a given function | |
1208 | signature to be instantiated from more than one function | |
1209 | template. In such cases, explicit specification of the | |
1210 | template arguments must be used to uniquely identify the | |
1211 | function template specialization being specialized. | |
1212 | ||
1213 | Note that here, there's no suggestion that we're supposed to | |
1214 | determine which of the candidate templates is most | |
1215 | specialized. However, we, also have: | |
1216 | ||
1217 | [temp.func.order] | |
1218 | ||
1219 | Partial ordering of overloaded function template | |
1220 | declarations is used in the following contexts to select | |
1221 | the function template to which a function template | |
1222 | specialization refers: | |
1223 | ||
1224 | -- when an explicit specialization refers to a function | |
1225 | template. | |
1226 | ||
1227 | So, we do use the partial ordering rules, at least for now. | |
0e339752 | 1228 | This extension can only serve to make invalid programs valid, |
03017874 MM |
1229 | so it's safe. And, there is strong anecdotal evidence that |
1230 | the committee intended the partial ordering rules to apply; | |
1231 | the EDG front-end has that behavior, and John Spicer claims | |
1232 | that the committee simply forgot to delete the wording in | |
1233 | [temp.expl.spec]. */ | |
1234 | tree tmpl = most_specialized (templates, decl, explicit_targs); | |
1235 | if (tmpl && tmpl != error_mark_node) | |
1236 | { | |
1237 | targs = get_bindings (tmpl, decl, explicit_targs); | |
e1b3e07d | 1238 | templates = tree_cons (targs, tmpl, NULL_TREE); |
03017874 | 1239 | } |
e1467ff2 MM |
1240 | } |
1241 | ||
03017874 | 1242 | if (templates == NULL_TREE && candidates == NULL_TREE) |
e1467ff2 | 1243 | { |
bf8f3f93 MM |
1244 | cp_error_at ("template-id `%D' for `%+D' does not match any template declaration", |
1245 | template_id, decl); | |
03017874 | 1246 | return error_mark_node; |
386b8a85 | 1247 | } |
03017874 | 1248 | else if ((templates && TREE_CHAIN (templates)) |
bf8f3f93 MM |
1249 | || (candidates && TREE_CHAIN (candidates)) |
1250 | || (templates && candidates)) | |
386b8a85 | 1251 | { |
bf8f3f93 MM |
1252 | cp_error_at ("ambiguous template specialization `%D' for `%+D'", |
1253 | template_id, decl); | |
1254 | chainon (candidates, templates); | |
1255 | print_candidates (candidates); | |
03017874 | 1256 | return error_mark_node; |
386b8a85 JM |
1257 | } |
1258 | ||
c6002625 | 1259 | /* We have one, and exactly one, match. */ |
03017874 MM |
1260 | if (candidates) |
1261 | { | |
1262 | /* It was a specialization of an ordinary member function in a | |
1263 | template class. */ | |
1264 | *targs_out = copy_node (DECL_TI_ARGS (TREE_VALUE (candidates))); | |
1265 | return DECL_TI_TEMPLATE (TREE_VALUE (candidates)); | |
1266 | } | |
1267 | ||
1268 | /* It was a specialization of a template. */ | |
17aec3eb | 1269 | targs = DECL_TI_ARGS (DECL_TEMPLATE_RESULT (TREE_VALUE (templates))); |
03017874 MM |
1270 | if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (targs)) |
1271 | { | |
1272 | *targs_out = copy_node (targs); | |
1273 | SET_TMPL_ARGS_LEVEL (*targs_out, | |
1274 | TMPL_ARGS_DEPTH (*targs_out), | |
1275 | TREE_PURPOSE (templates)); | |
1276 | } | |
1277 | else | |
1278 | *targs_out = TREE_PURPOSE (templates); | |
e1467ff2 | 1279 | return TREE_VALUE (templates); |
8d08fdba | 1280 | } |
8afa707f MM |
1281 | |
1282 | /* Returns a chain of parameter types, exactly like the SPEC_TYPES, | |
1283 | but with the default argument values filled in from those in the | |
1284 | TMPL_TYPES. */ | |
6757edfe | 1285 | |
8afa707f | 1286 | static tree |
3a978d72 NN |
1287 | copy_default_args_to_explicit_spec_1 (tree spec_types, |
1288 | tree tmpl_types) | |
8afa707f MM |
1289 | { |
1290 | tree new_spec_types; | |
1291 | ||
1292 | if (!spec_types) | |
1293 | return NULL_TREE; | |
1294 | ||
1295 | if (spec_types == void_list_node) | |
1296 | return void_list_node; | |
1297 | ||
1298 | /* Substitute into the rest of the list. */ | |
1299 | new_spec_types = | |
1300 | copy_default_args_to_explicit_spec_1 (TREE_CHAIN (spec_types), | |
1301 | TREE_CHAIN (tmpl_types)); | |
1302 | ||
1303 | /* Add the default argument for this parameter. */ | |
1304 | return hash_tree_cons (TREE_PURPOSE (tmpl_types), | |
1305 | TREE_VALUE (spec_types), | |
1306 | new_spec_types); | |
1307 | } | |
1308 | ||
1309 | /* DECL is an explicit specialization. Replicate default arguments | |
1310 | from the template it specializes. (That way, code like: | |
1311 | ||
1312 | template <class T> void f(T = 3); | |
1313 | template <> void f(double); | |
1314 | void g () { f (); } | |
1315 | ||
1316 | works, as required.) An alternative approach would be to look up | |
1317 | the correct default arguments at the call-site, but this approach | |
1318 | is consistent with how implicit instantiations are handled. */ | |
1319 | ||
1320 | static void | |
3a978d72 | 1321 | copy_default_args_to_explicit_spec (tree decl) |
8afa707f MM |
1322 | { |
1323 | tree tmpl; | |
1324 | tree spec_types; | |
1325 | tree tmpl_types; | |
1326 | tree new_spec_types; | |
1327 | tree old_type; | |
1328 | tree new_type; | |
1329 | tree t; | |
08c2df0f NS |
1330 | tree object_type = NULL_TREE; |
1331 | tree in_charge = NULL_TREE; | |
e0fff4b3 | 1332 | tree vtt = NULL_TREE; |
8afa707f MM |
1333 | |
1334 | /* See if there's anything we need to do. */ | |
1335 | tmpl = DECL_TI_TEMPLATE (decl); | |
1336 | tmpl_types = TYPE_ARG_TYPES (TREE_TYPE (DECL_TEMPLATE_RESULT (tmpl))); | |
1337 | for (t = tmpl_types; t; t = TREE_CHAIN (t)) | |
1338 | if (TREE_PURPOSE (t)) | |
1339 | break; | |
1340 | if (!t) | |
1341 | return; | |
1342 | ||
1343 | old_type = TREE_TYPE (decl); | |
1344 | spec_types = TYPE_ARG_TYPES (old_type); | |
1345 | ||
8afa707f MM |
1346 | if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl)) |
1347 | { | |
08c2df0f NS |
1348 | /* Remove the this pointer, but remember the object's type for |
1349 | CV quals. */ | |
1350 | object_type = TREE_TYPE (TREE_VALUE (spec_types)); | |
8afa707f MM |
1351 | spec_types = TREE_CHAIN (spec_types); |
1352 | tmpl_types = TREE_CHAIN (tmpl_types); | |
08c2df0f | 1353 | |
8afa707f | 1354 | if (DECL_HAS_IN_CHARGE_PARM_P (decl)) |
08c2df0f NS |
1355 | { |
1356 | /* DECL may contain more parameters than TMPL due to the extra | |
1357 | in-charge parameter in constructors and destructors. */ | |
1358 | in_charge = spec_types; | |
1359 | spec_types = TREE_CHAIN (spec_types); | |
1360 | } | |
e0fff4b3 JM |
1361 | if (DECL_HAS_VTT_PARM_P (decl)) |
1362 | { | |
1363 | vtt = spec_types; | |
1364 | spec_types = TREE_CHAIN (spec_types); | |
1365 | } | |
8afa707f MM |
1366 | } |
1367 | ||
1368 | /* Compute the merged default arguments. */ | |
1369 | new_spec_types = | |
1370 | copy_default_args_to_explicit_spec_1 (spec_types, tmpl_types); | |
1371 | ||
08c2df0f NS |
1372 | /* Compute the new FUNCTION_TYPE. */ |
1373 | if (object_type) | |
8afa707f | 1374 | { |
e0fff4b3 JM |
1375 | if (vtt) |
1376 | new_spec_types = hash_tree_cons (TREE_PURPOSE (vtt), | |
1377 | TREE_VALUE (vtt), | |
1378 | new_spec_types); | |
1379 | ||
08c2df0f NS |
1380 | if (in_charge) |
1381 | /* Put the in-charge parameter back. */ | |
1382 | new_spec_types = hash_tree_cons (TREE_PURPOSE (in_charge), | |
1383 | TREE_VALUE (in_charge), | |
1384 | new_spec_types); | |
1385 | ||
43dc123f MM |
1386 | new_type = build_method_type_directly (object_type, |
1387 | TREE_TYPE (old_type), | |
1388 | new_spec_types); | |
8afa707f | 1389 | } |
8afa707f MM |
1390 | else |
1391 | new_type = build_function_type (TREE_TYPE (old_type), | |
08c2df0f | 1392 | new_spec_types); |
8afa707f MM |
1393 | new_type = build_type_attribute_variant (new_type, |
1394 | TYPE_ATTRIBUTES (old_type)); | |
1395 | new_type = build_exception_variant (new_type, | |
1396 | TYPE_RAISES_EXCEPTIONS (old_type)); | |
1397 | TREE_TYPE (decl) = new_type; | |
1398 | } | |
1399 | ||
386b8a85 | 1400 | /* Check to see if the function just declared, as indicated in |
75650646 MM |
1401 | DECLARATOR, and in DECL, is a specialization of a function |
1402 | template. We may also discover that the declaration is an explicit | |
1403 | instantiation at this point. | |
1404 | ||
e1467ff2 | 1405 | Returns DECL, or an equivalent declaration that should be used |
03017874 MM |
1406 | instead if all goes well. Issues an error message if something is |
1407 | amiss. Returns error_mark_node if the error is not easily | |
1408 | recoverable. | |
75650646 | 1409 | |
75650646 MM |
1410 | FLAGS is a bitmask consisting of the following flags: |
1411 | ||
75650646 MM |
1412 | 2: The function has a definition. |
1413 | 4: The function is a friend. | |
75650646 MM |
1414 | |
1415 | The TEMPLATE_COUNT is the number of references to qualifying | |
1416 | template classes that appeared in the name of the function. For | |
1417 | example, in | |
1418 | ||
1419 | template <class T> struct S { void f(); }; | |
1420 | void S<int>::f(); | |
1421 | ||
1422 | the TEMPLATE_COUNT would be 1. However, explicitly specialized | |
1423 | classes are not counted in the TEMPLATE_COUNT, so that in | |
1424 | ||
1425 | template <class T> struct S {}; | |
1426 | template <> struct S<int> { void f(); } | |
36a117a5 | 1427 | template <> void S<int>::f(); |
75650646 MM |
1428 | |
1429 | the TEMPLATE_COUNT would be 0. (Note that this declaration is | |
0e339752 | 1430 | invalid; there should be no template <>.) |
75650646 MM |
1431 | |
1432 | If the function is a specialization, it is marked as such via | |
1433 | DECL_TEMPLATE_SPECIALIZATION. Furthermore, its DECL_TEMPLATE_INFO | |
1434 | is set up correctly, and it is added to the list of specializations | |
1435 | for that template. */ | |
386b8a85 | 1436 | |
e1467ff2 | 1437 | tree |
3a978d72 NN |
1438 | check_explicit_specialization (tree declarator, |
1439 | tree decl, | |
1440 | int template_count, | |
1441 | int flags) | |
386b8a85 | 1442 | { |
75650646 MM |
1443 | int have_def = flags & 2; |
1444 | int is_friend = flags & 4; | |
1445 | int specialization = 0; | |
e1467ff2 | 1446 | int explicit_instantiation = 0; |
fd4de5ff | 1447 | int member_specialization = 0; |
75650646 MM |
1448 | tree ctype = DECL_CLASS_CONTEXT (decl); |
1449 | tree dname = DECL_NAME (decl); | |
74b846e0 | 1450 | tmpl_spec_kind tsk; |
386b8a85 | 1451 | |
74b846e0 | 1452 | tsk = current_tmpl_spec_kind (template_count); |
75650646 | 1453 | |
74b846e0 MM |
1454 | switch (tsk) |
1455 | { | |
1456 | case tsk_none: | |
1457 | if (processing_specialization) | |
75650646 | 1458 | { |
fd4de5ff MM |
1459 | specialization = 1; |
1460 | SET_DECL_TEMPLATE_SPECIALIZATION (decl); | |
75650646 | 1461 | } |
74b846e0 | 1462 | else if (TREE_CODE (declarator) == TEMPLATE_ID_EXPR) |
386b8a85 | 1463 | { |
74b846e0 MM |
1464 | if (is_friend) |
1465 | /* This could be something like: | |
75650646 | 1466 | |
74b846e0 MM |
1467 | template <class T> void f(T); |
1468 | class S { friend void f<>(int); } */ | |
1469 | specialization = 1; | |
1470 | else | |
1471 | { | |
1472 | /* This case handles bogus declarations like template <> | |
1473 | template <class T> void f<int>(); */ | |
1474 | ||
33bd39a2 | 1475 | error ("template-id `%D' in declaration of primary template", |
74b846e0 MM |
1476 | declarator); |
1477 | return decl; | |
1478 | } | |
1479 | } | |
1480 | break; | |
1481 | ||
1482 | case tsk_invalid_member_spec: | |
1483 | /* The error has already been reported in | |
1484 | check_specialization_scope. */ | |
1485 | return error_mark_node; | |
1486 | ||
1487 | case tsk_invalid_expl_inst: | |
33bd39a2 | 1488 | error ("template parameter list used in explicit instantiation"); |
74b846e0 MM |
1489 | |
1490 | /* Fall through. */ | |
1491 | ||
1492 | case tsk_expl_inst: | |
fd4de5ff | 1493 | if (have_def) |
33bd39a2 | 1494 | error ("definition provided for explicit instantiation"); |
74b846e0 | 1495 | |
fd4de5ff | 1496 | explicit_instantiation = 1; |
74b846e0 | 1497 | break; |
fd4de5ff | 1498 | |
74b846e0 | 1499 | case tsk_excessive_parms: |
33bd39a2 | 1500 | error ("too many template parameter lists in declaration of `%D'", |
74b846e0 MM |
1501 | decl); |
1502 | return error_mark_node; | |
75650646 | 1503 | |
74b846e0 MM |
1504 | /* Fall through. */ |
1505 | case tsk_expl_spec: | |
1506 | SET_DECL_TEMPLATE_SPECIALIZATION (decl); | |
1507 | if (ctype) | |
1508 | member_specialization = 1; | |
1509 | else | |
1510 | specialization = 1; | |
1511 | break; | |
1512 | ||
1513 | case tsk_insufficient_parms: | |
fd4de5ff MM |
1514 | if (template_header_count) |
1515 | { | |
33bd39a2 | 1516 | error("too few template parameter lists in declaration of `%D'", |
74b846e0 | 1517 | decl); |
fd4de5ff | 1518 | return decl; |
c6f2ed0d | 1519 | } |
74b846e0 MM |
1520 | else if (ctype != NULL_TREE |
1521 | && !TYPE_BEING_DEFINED (ctype) | |
1522 | && CLASSTYPE_TEMPLATE_INSTANTIATION (ctype) | |
1523 | && !is_friend) | |
1524 | { | |
1525 | /* For backwards compatibility, we accept: | |
fd4de5ff | 1526 | |
74b846e0 MM |
1527 | template <class T> struct S { void f(); }; |
1528 | void S<int>::f() {} // Missing template <> | |
fd4de5ff | 1529 | |
0e339752 | 1530 | That used to be valid C++. */ |
74b846e0 | 1531 | if (pedantic) |
33bd39a2 | 1532 | pedwarn |
74b846e0 MM |
1533 | ("explicit specialization not preceded by `template <>'"); |
1534 | specialization = 1; | |
1535 | SET_DECL_TEMPLATE_SPECIALIZATION (decl); | |
1536 | } | |
1537 | break; | |
1538 | ||
1539 | case tsk_template: | |
1540 | if (TREE_CODE (declarator) == TEMPLATE_ID_EXPR) | |
c6f2ed0d | 1541 | { |
fd4de5ff MM |
1542 | /* This case handles bogus declarations like template <> |
1543 | template <class T> void f<int>(); */ | |
75650646 | 1544 | |
655dc6ee | 1545 | if (uses_template_parms (declarator)) |
33bd39a2 | 1546 | error ("partial specialization `%D' of function template", |
655dc6ee JM |
1547 | declarator); |
1548 | else | |
33bd39a2 | 1549 | error ("template-id `%D' in declaration of primary template", |
655dc6ee | 1550 | declarator); |
fd4de5ff | 1551 | return decl; |
386b8a85 | 1552 | } |
74b846e0 MM |
1553 | |
1554 | if (ctype && CLASSTYPE_TEMPLATE_INSTANTIATION (ctype)) | |
1555 | /* This is a specialization of a member template, without | |
1556 | specialization the containing class. Something like: | |
1557 | ||
1558 | template <class T> struct S { | |
1559 | template <class U> void f (U); | |
1560 | }; | |
1561 | template <> template <class U> void S<int>::f(U) {} | |
1562 | ||
1563 | That's a specialization -- but of the entire template. */ | |
1564 | specialization = 1; | |
1565 | break; | |
1566 | ||
1567 | default: | |
a98facb0 | 1568 | abort (); |
75650646 | 1569 | } |
386b8a85 | 1570 | |
670960ac JM |
1571 | if (specialization || member_specialization) |
1572 | { | |
1573 | tree t = TYPE_ARG_TYPES (TREE_TYPE (decl)); | |
1574 | for (; t; t = TREE_CHAIN (t)) | |
1575 | if (TREE_PURPOSE (t)) | |
1576 | { | |
33bd39a2 | 1577 | pedwarn |
8251199e | 1578 | ("default argument specified in explicit specialization"); |
670960ac JM |
1579 | break; |
1580 | } | |
f3400fe2 | 1581 | if (current_lang_name == lang_name_c) |
33bd39a2 | 1582 | error ("template specialization with C linkage"); |
670960ac JM |
1583 | } |
1584 | ||
e1467ff2 | 1585 | if (specialization || member_specialization || explicit_instantiation) |
75650646 MM |
1586 | { |
1587 | tree tmpl = NULL_TREE; | |
1588 | tree targs = NULL_TREE; | |
75650646 MM |
1589 | |
1590 | /* Make sure that the declarator is a TEMPLATE_ID_EXPR. */ | |
386b8a85 JM |
1591 | if (TREE_CODE (declarator) != TEMPLATE_ID_EXPR) |
1592 | { | |
1593 | tree fns; | |
1594 | ||
2f54a1db GB |
1595 | my_friendly_assert (TREE_CODE (declarator) == IDENTIFIER_NODE, 0); |
1596 | if (ctype) | |
386b8a85 | 1597 | fns = dname; |
2f54a1db GB |
1598 | else |
1599 | { | |
1600 | /* If there is no class context, the explicit instantiation | |
1601 | must be at namespace scope. */ | |
1602 | my_friendly_assert (DECL_NAMESPACE_SCOPE_P (decl), 20030625); | |
1603 | ||
1604 | /* Find the namespace binding, using the declaration | |
1605 | context. */ | |
1606 | fns = namespace_binding (dname, CP_DECL_CONTEXT (decl)); | |
1607 | } | |
386b8a85 | 1608 | |
2f54a1db | 1609 | declarator = lookup_template_function (fns, NULL_TREE); |
386b8a85 JM |
1610 | } |
1611 | ||
f2e48b67 BK |
1612 | if (declarator == error_mark_node) |
1613 | return error_mark_node; | |
1614 | ||
75650646 MM |
1615 | if (ctype != NULL_TREE && TYPE_BEING_DEFINED (ctype)) |
1616 | { | |
8ec2ac34 | 1617 | if (!explicit_instantiation) |
0e339752 | 1618 | /* A specialization in class scope. This is invalid, |
6c30752f MM |
1619 | but the error will already have been flagged by |
1620 | check_specialization_scope. */ | |
1621 | return error_mark_node; | |
8ec2ac34 | 1622 | else |
b370501f | 1623 | { |
0e339752 | 1624 | /* It's not valid to write an explicit instantiation in |
b370501f | 1625 | class scope, e.g.: |
8ec2ac34 | 1626 | |
b370501f | 1627 | class C { template void f(); } |
8ec2ac34 | 1628 | |
b370501f KG |
1629 | This case is caught by the parser. However, on |
1630 | something like: | |
8ec2ac34 | 1631 | |
b370501f | 1632 | template class C { void f(); }; |
8ec2ac34 | 1633 | |
0e339752 | 1634 | (which is invalid) we can get here. The error will be |
b370501f KG |
1635 | issued later. */ |
1636 | ; | |
1637 | } | |
8ec2ac34 | 1638 | |
e1467ff2 | 1639 | return decl; |
75650646 MM |
1640 | } |
1641 | else if (ctype != NULL_TREE | |
1642 | && (TREE_CODE (TREE_OPERAND (declarator, 0)) == | |
1643 | IDENTIFIER_NODE)) | |
386b8a85 | 1644 | { |
75650646 MM |
1645 | /* Find the list of functions in ctype that have the same |
1646 | name as the declared function. */ | |
1647 | tree name = TREE_OPERAND (declarator, 0); | |
03017874 MM |
1648 | tree fns = NULL_TREE; |
1649 | int idx; | |
1650 | ||
8ba658ee | 1651 | if (constructor_name_p (name, ctype)) |
386b8a85 | 1652 | { |
75650646 MM |
1653 | int is_constructor = DECL_CONSTRUCTOR_P (decl); |
1654 | ||
1655 | if (is_constructor ? !TYPE_HAS_CONSTRUCTOR (ctype) | |
1656 | : !TYPE_HAS_DESTRUCTOR (ctype)) | |
1657 | { | |
1658 | /* From [temp.expl.spec]: | |
e1467ff2 | 1659 | |
75650646 MM |
1660 | If such an explicit specialization for the member |
1661 | of a class template names an implicitly-declared | |
1662 | special member function (clause _special_), the | |
e1467ff2 MM |
1663 | program is ill-formed. |
1664 | ||
1665 | Similar language is found in [temp.explicit]. */ | |
33bd39a2 | 1666 | error ("specialization of implicitly-declared special member function"); |
03017874 | 1667 | return error_mark_node; |
75650646 | 1668 | } |
386b8a85 | 1669 | |
42da2fd8 | 1670 | name = is_constructor ? ctor_identifier : dtor_identifier; |
75650646 | 1671 | } |
42da2fd8 | 1672 | |
421844e7 | 1673 | if (!DECL_CONV_FN_P (decl)) |
03017874 MM |
1674 | { |
1675 | idx = lookup_fnfields_1 (ctype, name); | |
1676 | if (idx >= 0) | |
1677 | fns = TREE_VEC_ELT (CLASSTYPE_METHOD_VEC (ctype), idx); | |
1678 | } | |
1679 | else | |
1680 | { | |
1681 | tree methods; | |
1682 | ||
1683 | /* For a type-conversion operator, we cannot do a | |
1684 | name-based lookup. We might be looking for `operator | |
1685 | int' which will be a specialization of `operator T'. | |
1686 | So, we find *all* the conversion operators, and then | |
1687 | select from them. */ | |
1688 | fns = NULL_TREE; | |
1689 | ||
1690 | methods = CLASSTYPE_METHOD_VEC (ctype); | |
1691 | if (methods) | |
5dd236e2 NS |
1692 | for (idx = CLASSTYPE_FIRST_CONVERSION_SLOT; |
1693 | idx < TREE_VEC_LENGTH (methods); ++idx) | |
03017874 MM |
1694 | { |
1695 | tree ovl = TREE_VEC_ELT (methods, idx); | |
1696 | ||
1697 | if (!ovl || !DECL_CONV_FN_P (OVL_CURRENT (ovl))) | |
1698 | /* There are no more conversion functions. */ | |
1699 | break; | |
1700 | ||
1701 | /* Glue all these conversion functions together | |
1702 | with those we already have. */ | |
1703 | for (; ovl; ovl = OVL_NEXT (ovl)) | |
1704 | fns = ovl_cons (OVL_CURRENT (ovl), fns); | |
1705 | } | |
1706 | } | |
1707 | ||
386b8a85 JM |
1708 | if (fns == NULL_TREE) |
1709 | { | |
33bd39a2 | 1710 | error ("no member function `%D' declared in `%T'", |
b3f738da | 1711 | name, ctype); |
03017874 | 1712 | return error_mark_node; |
386b8a85 JM |
1713 | } |
1714 | else | |
1715 | TREE_OPERAND (declarator, 0) = fns; | |
1716 | } | |
75650646 | 1717 | |
e1467ff2 MM |
1718 | /* Figure out what exactly is being specialized at this point. |
1719 | Note that for an explicit instantiation, even one for a | |
38e01259 | 1720 | member function, we cannot tell apriori whether the |
e1467ff2 | 1721 | instantiation is for a member template, or just a member |
36a117a5 MM |
1722 | function of a template class. Even if a member template is |
1723 | being instantiated, the member template arguments may be | |
1724 | elided if they can be deduced from the rest of the | |
1725 | declaration. */ | |
e1467ff2 MM |
1726 | tmpl = determine_specialization (declarator, decl, |
1727 | &targs, | |
bf8f3f93 | 1728 | member_specialization); |
386b8a85 | 1729 | |
03017874 MM |
1730 | if (!tmpl || tmpl == error_mark_node) |
1731 | /* We couldn't figure out what this declaration was | |
1732 | specializing. */ | |
1733 | return error_mark_node; | |
1734 | else | |
386b8a85 | 1735 | { |
25aab5d0 | 1736 | tree gen_tmpl = most_general_template (tmpl); |
36a117a5 | 1737 | |
e1467ff2 MM |
1738 | if (explicit_instantiation) |
1739 | { | |
03d0f4af | 1740 | /* We don't set DECL_EXPLICIT_INSTANTIATION here; that |
25aab5d0 MM |
1741 | is done by do_decl_instantiation later. */ |
1742 | ||
1743 | int arg_depth = TMPL_ARGS_DEPTH (targs); | |
1744 | int parm_depth = TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl)); | |
1745 | ||
1746 | if (arg_depth > parm_depth) | |
1747 | { | |
1748 | /* If TMPL is not the most general template (for | |
1749 | example, if TMPL is a friend template that is | |
1750 | injected into namespace scope), then there will | |
dc957d14 | 1751 | be too many levels of TARGS. Remove some of them |
25aab5d0 MM |
1752 | here. */ |
1753 | int i; | |
1754 | tree new_targs; | |
1755 | ||
f31c0a32 | 1756 | new_targs = make_tree_vec (parm_depth); |
25aab5d0 MM |
1757 | for (i = arg_depth - parm_depth; i < arg_depth; ++i) |
1758 | TREE_VEC_ELT (new_targs, i - (arg_depth - parm_depth)) | |
1759 | = TREE_VEC_ELT (targs, i); | |
1760 | targs = new_targs; | |
1761 | } | |
1762 | ||
3e4a3562 | 1763 | return instantiate_template (tmpl, targs, tf_error); |
e1467ff2 | 1764 | } |
74b846e0 | 1765 | |
6c07f448 KL |
1766 | /* If we thought that the DECL was a member function, but it |
1767 | turns out to be specializing a static member function, | |
1768 | make DECL a static member function as well. We also have | |
1769 | to adjust last_function_parms to avoid confusing | |
1770 | start_function later. */ | |
1771 | if (DECL_STATIC_FUNCTION_P (tmpl) | |
1772 | && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl)) | |
1773 | { | |
1774 | revert_static_member_fn (decl); | |
1775 | last_function_parms = TREE_CHAIN (last_function_parms); | |
1776 | } | |
1777 | ||
f9a7ae04 MM |
1778 | /* If this is a specialization of a member template of a |
1779 | template class. In we want to return the TEMPLATE_DECL, | |
1780 | not the specialization of it. */ | |
74b846e0 MM |
1781 | if (tsk == tsk_template) |
1782 | { | |
1783 | SET_DECL_TEMPLATE_SPECIALIZATION (tmpl); | |
f9a7ae04 | 1784 | DECL_INITIAL (DECL_TEMPLATE_RESULT (tmpl)) = NULL_TREE; |
b190f239 NS |
1785 | if (have_def) |
1786 | { | |
f31686a3 RH |
1787 | DECL_SOURCE_LOCATION (tmpl) = DECL_SOURCE_LOCATION (decl); |
1788 | DECL_SOURCE_LOCATION (DECL_TEMPLATE_RESULT (tmpl)) | |
1789 | = DECL_SOURCE_LOCATION (decl); | |
b190f239 | 1790 | } |
74b846e0 MM |
1791 | return tmpl; |
1792 | } | |
1793 | ||
36a117a5 | 1794 | /* Set up the DECL_TEMPLATE_INFO for DECL. */ |
e1b3e07d | 1795 | DECL_TEMPLATE_INFO (decl) = tree_cons (tmpl, targs, NULL_TREE); |
36a117a5 | 1796 | |
8afa707f MM |
1797 | /* Inherit default function arguments from the template |
1798 | DECL is specializing. */ | |
1799 | copy_default_args_to_explicit_spec (decl); | |
1800 | ||
c750255c MM |
1801 | /* This specialization has the same protection as the |
1802 | template it specializes. */ | |
1803 | TREE_PRIVATE (decl) = TREE_PRIVATE (gen_tmpl); | |
1804 | TREE_PROTECTED (decl) = TREE_PROTECTED (gen_tmpl); | |
1805 | ||
386b8a85 | 1806 | if (is_friend && !have_def) |
36a117a5 MM |
1807 | /* This is not really a declaration of a specialization. |
1808 | It's just the name of an instantiation. But, it's not | |
1809 | a request for an instantiation, either. */ | |
fbf1c34b | 1810 | SET_DECL_IMPLICIT_INSTANTIATION (decl); |
08511114 KL |
1811 | else if (DECL_CONSTRUCTOR_P (decl) || DECL_DESTRUCTOR_P (decl)) |
1812 | /* This is indeed a specialization. In case of constructors | |
1813 | and destructors, we need in-charge and not-in-charge | |
1814 | versions in V3 ABI. */ | |
1815 | clone_function_decl (decl, /*update_method_vec_p=*/0); | |
75650646 | 1816 | |
36a117a5 MM |
1817 | /* Register this specialization so that we can find it |
1818 | again. */ | |
1819 | decl = register_specialization (decl, gen_tmpl, targs); | |
386b8a85 JM |
1820 | } |
1821 | } | |
75650646 | 1822 | |
e1467ff2 | 1823 | return decl; |
386b8a85 | 1824 | } |
75650646 | 1825 | |
39c01e4c MM |
1826 | /* TYPE is being declared. Verify that the use of template headers |
1827 | and such is reasonable. Issue error messages if not. */ | |
1828 | ||
1829 | void | |
3a978d72 | 1830 | maybe_check_template_type (tree type) |
39c01e4c MM |
1831 | { |
1832 | if (template_header_count) | |
1833 | { | |
1834 | /* We are in the scope of some `template <...>' header. */ | |
1835 | ||
1836 | int context_depth | |
1837 | = template_class_depth_real (TYPE_CONTEXT (type), | |
1838 | /*count_specializations=*/1); | |
1839 | ||
1840 | if (template_header_count <= context_depth) | |
1841 | /* This is OK; the template headers are for the context. We | |
1842 | are actually too lenient here; like | |
1843 | check_explicit_specialization we should consider the number | |
1844 | of template types included in the actual declaration. For | |
1845 | example, | |
1846 | ||
1847 | template <class T> struct S { | |
1848 | template <class U> template <class V> | |
1849 | struct I {}; | |
1850 | }; | |
1851 | ||
0e339752 | 1852 | is invalid, but: |
39c01e4c MM |
1853 | |
1854 | template <class T> struct S { | |
1855 | template <class U> struct I; | |
1856 | }; | |
1857 | ||
1858 | template <class T> template <class U. | |
1859 | struct S<T>::I {}; | |
1860 | ||
1861 | is not. */ | |
1862 | ; | |
1863 | else if (template_header_count > context_depth + 1) | |
1864 | /* There are two many template parameter lists. */ | |
33bd39a2 | 1865 | error ("too many template parameter lists in declaration of `%T'", type); |
39c01e4c MM |
1866 | } |
1867 | } | |
1868 | ||
75650646 MM |
1869 | /* Returns 1 iff PARMS1 and PARMS2 are identical sets of template |
1870 | parameters. These are represented in the same format used for | |
1871 | DECL_TEMPLATE_PARMS. */ | |
1872 | ||
3a978d72 | 1873 | int comp_template_parms (tree parms1, tree parms2) |
75650646 MM |
1874 | { |
1875 | tree p1; | |
1876 | tree p2; | |
1877 | ||
1878 | if (parms1 == parms2) | |
1879 | return 1; | |
1880 | ||
1881 | for (p1 = parms1, p2 = parms2; | |
1882 | p1 != NULL_TREE && p2 != NULL_TREE; | |
1883 | p1 = TREE_CHAIN (p1), p2 = TREE_CHAIN (p2)) | |
1884 | { | |
1885 | tree t1 = TREE_VALUE (p1); | |
1886 | tree t2 = TREE_VALUE (p2); | |
1887 | int i; | |
1888 | ||
1889 | my_friendly_assert (TREE_CODE (t1) == TREE_VEC, 0); | |
1890 | my_friendly_assert (TREE_CODE (t2) == TREE_VEC, 0); | |
1891 | ||
1892 | if (TREE_VEC_LENGTH (t1) != TREE_VEC_LENGTH (t2)) | |
1893 | return 0; | |
1894 | ||
1895 | for (i = 0; i < TREE_VEC_LENGTH (t2); ++i) | |
1896 | { | |
1897 | tree parm1 = TREE_VALUE (TREE_VEC_ELT (t1, i)); | |
1898 | tree parm2 = TREE_VALUE (TREE_VEC_ELT (t2, i)); | |
1899 | ||
1900 | if (TREE_CODE (parm1) != TREE_CODE (parm2)) | |
1901 | return 0; | |
1902 | ||
1903 | if (TREE_CODE (parm1) == TEMPLATE_TYPE_PARM) | |
1904 | continue; | |
3bfdc719 | 1905 | else if (!same_type_p (TREE_TYPE (parm1), TREE_TYPE (parm2))) |
75650646 MM |
1906 | return 0; |
1907 | } | |
1908 | } | |
1909 | ||
1910 | if ((p1 != NULL_TREE) != (p2 != NULL_TREE)) | |
1911 | /* One set of parameters has more parameters lists than the | |
1912 | other. */ | |
1913 | return 0; | |
1914 | ||
1915 | return 1; | |
1916 | } | |
1917 | ||
f3400fe2 JM |
1918 | /* Complain if DECL shadows a template parameter. |
1919 | ||
1920 | [temp.local]: A template-parameter shall not be redeclared within its | |
1921 | scope (including nested scopes). */ | |
1922 | ||
1923 | void | |
3a978d72 | 1924 | check_template_shadow (tree decl) |
f3400fe2 | 1925 | { |
8f032717 MM |
1926 | tree olddecl; |
1927 | ||
b5d9b9ab MM |
1928 | /* If we're not in a template, we can't possibly shadow a template |
1929 | parameter. */ | |
1930 | if (!current_template_parms) | |
1931 | return; | |
1932 | ||
1933 | /* Figure out what we're shadowing. */ | |
8f032717 MM |
1934 | if (TREE_CODE (decl) == OVERLOAD) |
1935 | decl = OVL_CURRENT (decl); | |
1936 | olddecl = IDENTIFIER_VALUE (DECL_NAME (decl)); | |
f3400fe2 | 1937 | |
b5d9b9ab MM |
1938 | /* If there's no previous binding for this name, we're not shadowing |
1939 | anything, let alone a template parameter. */ | |
1940 | if (!olddecl) | |
1941 | return; | |
1942 | ||
1943 | /* If we're not shadowing a template parameter, we're done. Note | |
1944 | that OLDDECL might be an OVERLOAD (or perhaps even an | |
1945 | ERROR_MARK), so we can't just blithely assume it to be a _DECL | |
1946 | node. */ | |
2f939d94 | 1947 | if (!DECL_P (olddecl) || !DECL_TEMPLATE_PARM_P (olddecl)) |
b5d9b9ab MM |
1948 | return; |
1949 | ||
1950 | /* We check for decl != olddecl to avoid bogus errors for using a | |
1951 | name inside a class. We check TPFI to avoid duplicate errors for | |
1952 | inline member templates. */ | |
1953 | if (decl == olddecl | |
1954 | || TEMPLATE_PARMS_FOR_INLINE (current_template_parms)) | |
1955 | return; | |
1956 | ||
1957 | cp_error_at ("declaration of `%#D'", decl); | |
1958 | cp_error_at (" shadows template parm `%#D'", olddecl); | |
f3400fe2 | 1959 | } |
22a7be53 | 1960 | |
f3400fe2 | 1961 | /* Return a new TEMPLATE_PARM_INDEX with the indicated INDEX, LEVEL, |
f84b4be9 JM |
1962 | ORIG_LEVEL, DECL, and TYPE. */ |
1963 | ||
1964 | static tree | |
3a978d72 NN |
1965 | build_template_parm_index (int index, |
1966 | int level, | |
1967 | int orig_level, | |
1968 | tree decl, | |
1969 | tree type) | |
f84b4be9 JM |
1970 | { |
1971 | tree t = make_node (TEMPLATE_PARM_INDEX); | |
1972 | TEMPLATE_PARM_IDX (t) = index; | |
1973 | TEMPLATE_PARM_LEVEL (t) = level; | |
1974 | TEMPLATE_PARM_ORIG_LEVEL (t) = orig_level; | |
1975 | TEMPLATE_PARM_DECL (t) = decl; | |
1976 | TREE_TYPE (t) = type; | |
3e4a3562 NS |
1977 | TREE_CONSTANT (t) = TREE_CONSTANT (decl); |
1978 | TREE_READONLY (t) = TREE_READONLY (decl); | |
f84b4be9 JM |
1979 | |
1980 | return t; | |
1981 | } | |
1982 | ||
f84b4be9 | 1983 | /* Return a TEMPLATE_PARM_INDEX, similar to INDEX, but whose |
93cdc044 | 1984 | TEMPLATE_PARM_LEVEL has been decreased by LEVELS. If such a |
f84b4be9 JM |
1985 | TEMPLATE_PARM_INDEX already exists, it is returned; otherwise, a |
1986 | new one is created. */ | |
1987 | ||
1988 | static tree | |
3a978d72 | 1989 | reduce_template_parm_level (tree index, tree type, int levels) |
f84b4be9 JM |
1990 | { |
1991 | if (TEMPLATE_PARM_DESCENDANTS (index) == NULL_TREE | |
1992 | || (TEMPLATE_PARM_LEVEL (TEMPLATE_PARM_DESCENDANTS (index)) | |
93cdc044 | 1993 | != TEMPLATE_PARM_LEVEL (index) - levels)) |
f84b4be9 | 1994 | { |
3e4a3562 NS |
1995 | tree orig_decl = TEMPLATE_PARM_DECL (index); |
1996 | tree decl, t; | |
1997 | ||
1998 | decl = build_decl (TREE_CODE (orig_decl), DECL_NAME (orig_decl), type); | |
1999 | TREE_CONSTANT (decl) = TREE_CONSTANT (orig_decl); | |
2000 | TREE_READONLY (decl) = TREE_READONLY (orig_decl); | |
2001 | DECL_ARTIFICIAL (decl) = 1; | |
2002 | SET_DECL_TEMPLATE_PARM_P (decl); | |
2003 | ||
2004 | t = build_template_parm_index (TEMPLATE_PARM_IDX (index), | |
93cdc044 | 2005 | TEMPLATE_PARM_LEVEL (index) - levels, |
f84b4be9 JM |
2006 | TEMPLATE_PARM_ORIG_LEVEL (index), |
2007 | decl, type); | |
2008 | TEMPLATE_PARM_DESCENDANTS (index) = t; | |
cae40af6 JM |
2009 | |
2010 | /* Template template parameters need this. */ | |
2011 | DECL_TEMPLATE_PARMS (decl) | |
2012 | = DECL_TEMPLATE_PARMS (TEMPLATE_PARM_DECL (index)); | |
f84b4be9 JM |
2013 | } |
2014 | ||
2015 | return TEMPLATE_PARM_DESCENDANTS (index); | |
2016 | } | |
2017 | ||
8d08fdba | 2018 | /* Process information from new template parameter NEXT and append it to the |
5566b478 | 2019 | LIST being built. */ |
e92cc029 | 2020 | |
8d08fdba | 2021 | tree |
3a978d72 | 2022 | process_template_parm (tree list, tree next) |
8d08fdba MS |
2023 | { |
2024 | tree parm; | |
2025 | tree decl = 0; | |
a292b002 | 2026 | tree defval; |
5566b478 | 2027 | int is_type, idx; |
f84b4be9 | 2028 | |
8d08fdba MS |
2029 | parm = next; |
2030 | my_friendly_assert (TREE_CODE (parm) == TREE_LIST, 259); | |
a292b002 MS |
2031 | defval = TREE_PURPOSE (parm); |
2032 | parm = TREE_VALUE (parm); | |
2033 | is_type = TREE_PURPOSE (parm) == class_type_node; | |
5566b478 MS |
2034 | |
2035 | if (list) | |
2036 | { | |
2037 | tree p = TREE_VALUE (tree_last (list)); | |
2038 | ||
1899c3a4 | 2039 | if (TREE_CODE (p) == TYPE_DECL || TREE_CODE (p) == TEMPLATE_DECL) |
5566b478 MS |
2040 | idx = TEMPLATE_TYPE_IDX (TREE_TYPE (p)); |
2041 | else | |
f84b4be9 | 2042 | idx = TEMPLATE_PARM_IDX (DECL_INITIAL (p)); |
5566b478 MS |
2043 | ++idx; |
2044 | } | |
2045 | else | |
2046 | idx = 0; | |
2047 | ||
8d08fdba MS |
2048 | if (!is_type) |
2049 | { | |
a292b002 | 2050 | my_friendly_assert (TREE_CODE (TREE_PURPOSE (parm)) == TREE_LIST, 260); |
8d08fdba | 2051 | /* is a const-param */ |
a292b002 | 2052 | parm = grokdeclarator (TREE_VALUE (parm), TREE_PURPOSE (parm), |
91d231cb | 2053 | PARM, 0, NULL); |
833aa4c4 | 2054 | SET_DECL_TEMPLATE_PARM_P (parm); |
d490621d MM |
2055 | |
2056 | /* [temp.param] | |
2057 | ||
2058 | The top-level cv-qualifiers on the template-parameter are | |
2059 | ignored when determining its type. */ | |
2060 | TREE_TYPE (parm) = TYPE_MAIN_VARIANT (TREE_TYPE (parm)); | |
2061 | ||
8d08fdba | 2062 | /* A template parameter is not modifiable. */ |
3e4a3562 | 2063 | TREE_READONLY (parm) = TREE_CONSTANT (parm) = 1; |
11b810f1 | 2064 | if (invalid_nontype_parm_type_p (TREE_TYPE (parm), 1)) |
db3f4e4e | 2065 | TREE_TYPE (parm) = void_type_node; |
8d08fdba | 2066 | decl = build_decl (CONST_DECL, DECL_NAME (parm), TREE_TYPE (parm)); |
3e4a3562 | 2067 | TREE_CONSTANT (decl) = TREE_READONLY (decl) = 1; |
f84b4be9 JM |
2068 | DECL_INITIAL (parm) = DECL_INITIAL (decl) |
2069 | = build_template_parm_index (idx, processing_template_decl, | |
2070 | processing_template_decl, | |
2071 | decl, TREE_TYPE (parm)); | |
8d08fdba MS |
2072 | } |
2073 | else | |
2074 | { | |
73b0fce8 KL |
2075 | tree t; |
2076 | parm = TREE_VALUE (parm); | |
2077 | ||
2078 | if (parm && TREE_CODE (parm) == TEMPLATE_DECL) | |
2079 | { | |
33848bb0 | 2080 | t = make_aggr_type (TEMPLATE_TEMPLATE_PARM); |
73b0fce8 KL |
2081 | /* This is for distinguishing between real templates and template |
2082 | template parameters */ | |
2083 | TREE_TYPE (parm) = t; | |
2084 | TREE_TYPE (DECL_TEMPLATE_RESULT (parm)) = t; | |
2085 | decl = parm; | |
2086 | } | |
2087 | else | |
2088 | { | |
33848bb0 | 2089 | t = make_aggr_type (TEMPLATE_TYPE_PARM); |
73b0fce8 KL |
2090 | /* parm is either IDENTIFIER_NODE or NULL_TREE */ |
2091 | decl = build_decl (TYPE_DECL, parm, t); | |
2092 | } | |
2093 | ||
d2e5ee5c MS |
2094 | TYPE_NAME (t) = decl; |
2095 | TYPE_STUB_DECL (t) = decl; | |
a292b002 | 2096 | parm = decl; |
f84b4be9 JM |
2097 | TEMPLATE_TYPE_PARM_INDEX (t) |
2098 | = build_template_parm_index (idx, processing_template_decl, | |
2099 | processing_template_decl, | |
2100 | decl, TREE_TYPE (parm)); | |
8d08fdba | 2101 | } |
c727aa5e | 2102 | DECL_ARTIFICIAL (decl) = 1; |
cd9f6678 | 2103 | SET_DECL_TEMPLATE_PARM_P (decl); |
8d08fdba | 2104 | pushdecl (decl); |
a292b002 | 2105 | parm = build_tree_list (defval, parm); |
8d08fdba MS |
2106 | return chainon (list, parm); |
2107 | } | |
2108 | ||
2109 | /* The end of a template parameter list has been reached. Process the | |
2110 | tree list into a parameter vector, converting each parameter into a more | |
2111 | useful form. Type parameters are saved as IDENTIFIER_NODEs, and others | |
2112 | as PARM_DECLs. */ | |
2113 | ||
2114 | tree | |
3a978d72 | 2115 | end_template_parm_list (tree parms) |
8d08fdba | 2116 | { |
5566b478 | 2117 | int nparms; |
9471d3e2 | 2118 | tree parm, next; |
5566b478 MS |
2119 | tree saved_parmlist = make_tree_vec (list_length (parms)); |
2120 | ||
5566b478 | 2121 | current_template_parms |
4890c2f4 | 2122 | = tree_cons (size_int (processing_template_decl), |
5566b478 | 2123 | saved_parmlist, current_template_parms); |
8d08fdba | 2124 | |
9471d3e2 NS |
2125 | for (parm = parms, nparms = 0; parm; parm = next, nparms++) |
2126 | { | |
2127 | next = TREE_CHAIN (parm); | |
2128 | TREE_VEC_ELT (saved_parmlist, nparms) = parm; | |
2129 | TREE_CHAIN (parm) = NULL_TREE; | |
2130 | } | |
a292b002 | 2131 | |
67ffc812 MM |
2132 | --processing_template_parmlist; |
2133 | ||
8d08fdba MS |
2134 | return saved_parmlist; |
2135 | } | |
2136 | ||
5566b478 MS |
2137 | /* end_template_decl is called after a template declaration is seen. */ |
2138 | ||
8d08fdba | 2139 | void |
3a978d72 | 2140 | end_template_decl (void) |
8d08fdba | 2141 | { |
386b8a85 JM |
2142 | reset_specialization (); |
2143 | ||
5156628f | 2144 | if (! processing_template_decl) |
73aad9b9 JM |
2145 | return; |
2146 | ||
5566b478 | 2147 | /* This matches the pushlevel in begin_template_parm_list. */ |
74b846e0 | 2148 | finish_scope (); |
8d08fdba | 2149 | |
5566b478 MS |
2150 | --processing_template_decl; |
2151 | current_template_parms = TREE_CHAIN (current_template_parms); | |
5566b478 | 2152 | } |
8d08fdba | 2153 | |
36a117a5 MM |
2154 | /* Given a template argument vector containing the template PARMS. |
2155 | The innermost PARMS are given first. */ | |
9a3b49ac MS |
2156 | |
2157 | tree | |
3a978d72 | 2158 | current_template_args (void) |
5566b478 | 2159 | { |
36a117a5 | 2160 | tree header; |
b370501f | 2161 | tree args = NULL_TREE; |
36a117a5 | 2162 | int length = TMPL_PARMS_DEPTH (current_template_parms); |
98c1c668 JM |
2163 | int l = length; |
2164 | ||
36a117a5 MM |
2165 | /* If there is only one level of template parameters, we do not |
2166 | create a TREE_VEC of TREE_VECs. Instead, we return a single | |
2167 | TREE_VEC containing the arguments. */ | |
2168 | if (length > 1) | |
2169 | args = make_tree_vec (length); | |
2170 | ||
2171 | for (header = current_template_parms; header; header = TREE_CHAIN (header)) | |
8d08fdba | 2172 | { |
5566b478 | 2173 | tree a = copy_node (TREE_VALUE (header)); |
36a117a5 MM |
2174 | int i; |
2175 | ||
5566b478 | 2176 | TREE_TYPE (a) = NULL_TREE; |
36a117a5 | 2177 | for (i = TREE_VEC_LENGTH (a) - 1; i >= 0; --i) |
5566b478 | 2178 | { |
98c1c668 JM |
2179 | tree t = TREE_VEC_ELT (a, i); |
2180 | ||
36a117a5 | 2181 | /* T will be a list if we are called from within a |
98c1c668 JM |
2182 | begin/end_template_parm_list pair, but a vector directly |
2183 | if within a begin/end_member_template_processing pair. */ | |
2184 | if (TREE_CODE (t) == TREE_LIST) | |
2185 | { | |
2186 | t = TREE_VALUE (t); | |
2187 | ||
73b0fce8 KL |
2188 | if (TREE_CODE (t) == TYPE_DECL |
2189 | || TREE_CODE (t) == TEMPLATE_DECL) | |
98c1c668 JM |
2190 | t = TREE_TYPE (t); |
2191 | else | |
2192 | t = DECL_INITIAL (t); | |
36a117a5 | 2193 | TREE_VEC_ELT (a, i) = t; |
98c1c668 | 2194 | } |
5566b478 | 2195 | } |
36a117a5 MM |
2196 | |
2197 | if (length > 1) | |
2198 | TREE_VEC_ELT (args, --l) = a; | |
2199 | else | |
2200 | args = a; | |
8d08fdba MS |
2201 | } |
2202 | ||
9a3b49ac MS |
2203 | return args; |
2204 | } | |
75650646 | 2205 | |
e1467ff2 MM |
2206 | /* Return a TEMPLATE_DECL corresponding to DECL, using the indicated |
2207 | template PARMS. Used by push_template_decl below. */ | |
2208 | ||
75650646 | 2209 | static tree |
3a978d72 | 2210 | build_template_decl (tree decl, tree parms) |
75650646 MM |
2211 | { |
2212 | tree tmpl = build_lang_decl (TEMPLATE_DECL, DECL_NAME (decl), NULL_TREE); | |
2213 | DECL_TEMPLATE_PARMS (tmpl) = parms; | |
2214 | DECL_CONTEXT (tmpl) = DECL_CONTEXT (decl); | |
2215 | if (DECL_LANG_SPECIFIC (decl)) | |
2216 | { | |
8f032717 MM |
2217 | DECL_STATIC_FUNCTION_P (tmpl) = DECL_STATIC_FUNCTION_P (decl); |
2218 | DECL_CONSTRUCTOR_P (tmpl) = DECL_CONSTRUCTOR_P (decl); | |
c8460010 | 2219 | DECL_DESTRUCTOR_P (tmpl) = DECL_DESTRUCTOR_P (decl); |
11f98788 | 2220 | DECL_NONCONVERTING_P (tmpl) = DECL_NONCONVERTING_P (decl); |
1f6e1acc AS |
2221 | DECL_ASSIGNMENT_OPERATOR_P (tmpl) = DECL_ASSIGNMENT_OPERATOR_P (decl); |
2222 | if (DECL_OVERLOADED_OPERATOR_P (decl)) | |
2223 | SET_OVERLOADED_OPERATOR_CODE (tmpl, | |
2224 | DECL_OVERLOADED_OPERATOR_P (decl)); | |
75650646 MM |
2225 | } |
2226 | ||
2227 | return tmpl; | |
2228 | } | |
2229 | ||
050367a3 MM |
2230 | struct template_parm_data |
2231 | { | |
6c30752f MM |
2232 | /* The level of the template parameters we are currently |
2233 | processing. */ | |
050367a3 | 2234 | int level; |
6c30752f MM |
2235 | |
2236 | /* The index of the specialization argument we are currently | |
2237 | processing. */ | |
2238 | int current_arg; | |
2239 | ||
2240 | /* An array whose size is the number of template parameters. The | |
838dfd8a | 2241 | elements are nonzero if the parameter has been used in any one |
6c30752f | 2242 | of the arguments processed so far. */ |
050367a3 | 2243 | int* parms; |
6c30752f MM |
2244 | |
2245 | /* An array whose size is the number of template arguments. The | |
838dfd8a | 2246 | elements are nonzero if the argument makes use of template |
6c30752f MM |
2247 | parameters of this level. */ |
2248 | int* arg_uses_template_parms; | |
050367a3 MM |
2249 | }; |
2250 | ||
2251 | /* Subroutine of push_template_decl used to see if each template | |
2252 | parameter in a partial specialization is used in the explicit | |
2253 | argument list. If T is of the LEVEL given in DATA (which is | |
2254 | treated as a template_parm_data*), then DATA->PARMS is marked | |
2255 | appropriately. */ | |
2256 | ||
2257 | static int | |
3a978d72 | 2258 | mark_template_parm (tree t, void* data) |
050367a3 MM |
2259 | { |
2260 | int level; | |
2261 | int idx; | |
2262 | struct template_parm_data* tpd = (struct template_parm_data*) data; | |
2263 | ||
2264 | if (TREE_CODE (t) == TEMPLATE_PARM_INDEX) | |
2265 | { | |
2266 | level = TEMPLATE_PARM_LEVEL (t); | |
2267 | idx = TEMPLATE_PARM_IDX (t); | |
2268 | } | |
2269 | else | |
2270 | { | |
2271 | level = TEMPLATE_TYPE_LEVEL (t); | |
2272 | idx = TEMPLATE_TYPE_IDX (t); | |
2273 | } | |
2274 | ||
2275 | if (level == tpd->level) | |
6c30752f MM |
2276 | { |
2277 | tpd->parms[idx] = 1; | |
2278 | tpd->arg_uses_template_parms[tpd->current_arg] = 1; | |
2279 | } | |
050367a3 MM |
2280 | |
2281 | /* Return zero so that for_each_template_parm will continue the | |
2282 | traversal of the tree; we want to mark *every* template parm. */ | |
2283 | return 0; | |
2284 | } | |
2285 | ||
6c30752f MM |
2286 | /* Process the partial specialization DECL. */ |
2287 | ||
e9659ab0 | 2288 | static tree |
3a978d72 | 2289 | process_partial_specialization (tree decl) |
6c30752f MM |
2290 | { |
2291 | tree type = TREE_TYPE (decl); | |
2292 | tree maintmpl = CLASSTYPE_TI_TEMPLATE (type); | |
2293 | tree specargs = CLASSTYPE_TI_ARGS (type); | |
f9a7ae04 | 2294 | tree inner_args = INNERMOST_TEMPLATE_ARGS (specargs); |
6c30752f MM |
2295 | tree inner_parms = INNERMOST_TEMPLATE_PARMS (current_template_parms); |
2296 | tree main_inner_parms = DECL_INNERMOST_TEMPLATE_PARMS (maintmpl); | |
2297 | int nargs = TREE_VEC_LENGTH (inner_args); | |
2298 | int ntparms = TREE_VEC_LENGTH (inner_parms); | |
2299 | int i; | |
2300 | int did_error_intro = 0; | |
6c30752f MM |
2301 | struct template_parm_data tpd; |
2302 | struct template_parm_data tpd2; | |
2303 | ||
6c30752f MM |
2304 | /* We check that each of the template parameters given in the |
2305 | partial specialization is used in the argument list to the | |
2306 | specialization. For example: | |
2307 | ||
2308 | template <class T> struct S; | |
2309 | template <class T> struct S<T*>; | |
2310 | ||
2311 | The second declaration is OK because `T*' uses the template | |
2312 | parameter T, whereas | |
2313 | ||
2314 | template <class T> struct S<int>; | |
2315 | ||
2316 | is no good. Even trickier is: | |
2317 | ||
2318 | template <class T> | |
2319 | struct S1 | |
2320 | { | |
2321 | template <class U> | |
2322 | struct S2; | |
2323 | template <class U> | |
2324 | struct S2<T>; | |
2325 | }; | |
2326 | ||
0e339752 | 2327 | The S2<T> declaration is actually invalid; it is a |
6c30752f MM |
2328 | full-specialization. Of course, |
2329 | ||
2330 | template <class U> | |
2331 | struct S2<T (*)(U)>; | |
2332 | ||
2333 | or some such would have been OK. */ | |
2334 | tpd.level = TMPL_PARMS_DEPTH (current_template_parms); | |
2335 | tpd.parms = alloca (sizeof (int) * ntparms); | |
fad205ff | 2336 | memset (tpd.parms, 0, sizeof (int) * ntparms); |
6c30752f MM |
2337 | |
2338 | tpd.arg_uses_template_parms = alloca (sizeof (int) * nargs); | |
fad205ff | 2339 | memset (tpd.arg_uses_template_parms, 0, sizeof (int) * nargs); |
6c30752f MM |
2340 | for (i = 0; i < nargs; ++i) |
2341 | { | |
2342 | tpd.current_arg = i; | |
2343 | for_each_template_parm (TREE_VEC_ELT (inner_args, i), | |
2344 | &mark_template_parm, | |
4f2c9d7e MM |
2345 | &tpd, |
2346 | NULL); | |
6c30752f MM |
2347 | } |
2348 | for (i = 0; i < ntparms; ++i) | |
2349 | if (tpd.parms[i] == 0) | |
2350 | { | |
2351 | /* One of the template parms was not used in the | |
f9a7ae04 | 2352 | specialization. */ |
6c30752f MM |
2353 | if (!did_error_intro) |
2354 | { | |
33bd39a2 | 2355 | error ("template parameters not used in partial specialization:"); |
6c30752f MM |
2356 | did_error_intro = 1; |
2357 | } | |
2358 | ||
33bd39a2 | 2359 | error (" `%D'", |
6c30752f MM |
2360 | TREE_VALUE (TREE_VEC_ELT (inner_parms, i))); |
2361 | } | |
2362 | ||
2363 | /* [temp.class.spec] | |
2364 | ||
2365 | The argument list of the specialization shall not be identical to | |
2366 | the implicit argument list of the primary template. */ | |
f9a7ae04 MM |
2367 | if (comp_template_args |
2368 | (inner_args, | |
2369 | INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (TREE_TYPE | |
2370 | (maintmpl))))) | |
33bd39a2 | 2371 | error ("partial specialization `%T' does not specialize any template arguments", type); |
6c30752f MM |
2372 | |
2373 | /* [temp.class.spec] | |
2374 | ||
2375 | A partially specialized non-type argument expression shall not | |
2376 | involve template parameters of the partial specialization except | |
2377 | when the argument expression is a simple identifier. | |
2378 | ||
2379 | The type of a template parameter corresponding to a specialized | |
2380 | non-type argument shall not be dependent on a parameter of the | |
2381 | specialization. */ | |
2382 | my_friendly_assert (nargs == DECL_NTPARMS (maintmpl), 0); | |
2383 | tpd2.parms = 0; | |
2384 | for (i = 0; i < nargs; ++i) | |
2385 | { | |
2386 | tree arg = TREE_VEC_ELT (inner_args, i); | |
2387 | if (/* These first two lines are the `non-type' bit. */ | |
2f939d94 | 2388 | !TYPE_P (arg) |
6c30752f MM |
2389 | && TREE_CODE (arg) != TEMPLATE_DECL |
2390 | /* This next line is the `argument expression is not just a | |
2391 | simple identifier' condition and also the `specialized | |
2392 | non-type argument' bit. */ | |
2393 | && TREE_CODE (arg) != TEMPLATE_PARM_INDEX) | |
2394 | { | |
2395 | if (tpd.arg_uses_template_parms[i]) | |
33bd39a2 | 2396 | error ("template argument `%E' involves template parameter(s)", arg); |
6c30752f MM |
2397 | else |
2398 | { | |
2399 | /* Look at the corresponding template parameter, | |
2400 | marking which template parameters its type depends | |
2401 | upon. */ | |
2402 | tree type = | |
2403 | TREE_TYPE (TREE_VALUE (TREE_VEC_ELT (main_inner_parms, | |
2404 | i))); | |
2405 | ||
2406 | if (!tpd2.parms) | |
2407 | { | |
2408 | /* We haven't yet initialized TPD2. Do so now. */ | |
2409 | tpd2.arg_uses_template_parms | |
c68b0a84 | 2410 | = alloca (sizeof (int) * nargs); |
104bf76a | 2411 | /* The number of parameters here is the number in the |
76a83782 RH |
2412 | main template, which, as checked in the assertion |
2413 | above, is NARGS. */ | |
c68b0a84 | 2414 | tpd2.parms = alloca (sizeof (int) * nargs); |
6c30752f MM |
2415 | tpd2.level = |
2416 | TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (maintmpl)); | |
2417 | } | |
2418 | ||
104bf76a | 2419 | /* Mark the template parameters. But this time, we're |
6c30752f MM |
2420 | looking for the template parameters of the main |
2421 | template, not in the specialization. */ | |
2422 | tpd2.current_arg = i; | |
2423 | tpd2.arg_uses_template_parms[i] = 0; | |
fad205ff | 2424 | memset (tpd2.parms, 0, sizeof (int) * nargs); |
6c30752f MM |
2425 | for_each_template_parm (type, |
2426 | &mark_template_parm, | |
4f2c9d7e MM |
2427 | &tpd2, |
2428 | NULL); | |
6c30752f MM |
2429 | |
2430 | if (tpd2.arg_uses_template_parms [i]) | |
2431 | { | |
2432 | /* The type depended on some template parameters. | |
2433 | If they are fully specialized in the | |
2434 | specialization, that's OK. */ | |
2435 | int j; | |
2436 | for (j = 0; j < nargs; ++j) | |
2437 | if (tpd2.parms[j] != 0 | |
2438 | && tpd.arg_uses_template_parms [j]) | |
2439 | { | |
33bd39a2 | 2440 | error ("type `%T' of template argument `%E' depends on template parameter(s)", |
6c30752f MM |
2441 | type, |
2442 | arg); | |
2443 | break; | |
2444 | } | |
2445 | } | |
2446 | } | |
2447 | } | |
2448 | } | |
2449 | ||
2450 | if (retrieve_specialization (maintmpl, specargs)) | |
2451 | /* We've already got this specialization. */ | |
2452 | return decl; | |
2453 | ||
d8b64f80 | 2454 | DECL_TEMPLATE_SPECIALIZATIONS (maintmpl) |
e1b3e07d MM |
2455 | = tree_cons (inner_args, inner_parms, |
2456 | DECL_TEMPLATE_SPECIALIZATIONS (maintmpl)); | |
6c30752f MM |
2457 | TREE_TYPE (DECL_TEMPLATE_SPECIALIZATIONS (maintmpl)) = type; |
2458 | return decl; | |
2459 | } | |
2460 | ||
6ba89f8e MM |
2461 | /* Check that a template declaration's use of default arguments is not |
2462 | invalid. Here, PARMS are the template parameters. IS_PRIMARY is | |
838dfd8a KH |
2463 | nonzero if DECL is the thing declared by a primary template. |
2464 | IS_PARTIAL is nonzero if DECL is a partial specialization. */ | |
6ba89f8e MM |
2465 | |
2466 | static void | |
3a978d72 | 2467 | check_default_tmpl_args (tree decl, tree parms, int is_primary, int is_partial) |
6ba89f8e | 2468 | { |
d8e178a0 | 2469 | const char *msg; |
66191c20 MM |
2470 | int last_level_to_check; |
2471 | tree parm_level; | |
6ba89f8e MM |
2472 | |
2473 | /* [temp.param] | |
2474 | ||
2475 | A default template-argument shall not be specified in a | |
2476 | function template declaration or a function template definition, nor | |
2477 | in the template-parameter-list of the definition of a member of a | |
2478 | class template. */ | |
2479 | ||
4f1c5b7d | 2480 | if (TREE_CODE (CP_DECL_CONTEXT (decl)) == FUNCTION_DECL) |
e0942dcd MM |
2481 | /* You can't have a function template declaration in a local |
2482 | scope, nor you can you define a member of a class template in a | |
2483 | local scope. */ | |
2484 | return; | |
2485 | ||
6ba89f8e MM |
2486 | if (current_class_type |
2487 | && !TYPE_BEING_DEFINED (current_class_type) | |
3d7de1fa | 2488 | && DECL_LANG_SPECIFIC (decl) |
5937a6f9 MM |
2489 | /* If this is either a friend defined in the scope of the class |
2490 | or a member function. */ | |
6df5158a NS |
2491 | && (DECL_FUNCTION_MEMBER_P (decl) |
2492 | ? same_type_p (DECL_CONTEXT (decl), current_class_type) | |
2493 | : DECL_FRIEND_CONTEXT (decl) | |
2494 | ? same_type_p (DECL_FRIEND_CONTEXT (decl), current_class_type) | |
2495 | : false) | |
5937a6f9 MM |
2496 | /* And, if it was a member function, it really was defined in |
2497 | the scope of the class. */ | |
6df5158a NS |
2498 | && (!DECL_FUNCTION_MEMBER_P (decl) |
2499 | || DECL_INITIALIZED_IN_CLASS_P (decl))) | |
6ba89f8e | 2500 | /* We already checked these parameters when the template was |
5937a6f9 MM |
2501 | declared, so there's no need to do it again now. This function |
2502 | was defined in class scope, but we're processing it's body now | |
2503 | that the class is complete. */ | |
6ba89f8e MM |
2504 | return; |
2505 | ||
66191c20 MM |
2506 | /* [temp.param] |
2507 | ||
2508 | If a template-parameter has a default template-argument, all | |
2509 | subsequent template-parameters shall have a default | |
2510 | template-argument supplied. */ | |
2511 | for (parm_level = parms; parm_level; parm_level = TREE_CHAIN (parm_level)) | |
2512 | { | |
2513 | tree inner_parms = TREE_VALUE (parm_level); | |
2514 | int ntparms = TREE_VEC_LENGTH (inner_parms); | |
2515 | int seen_def_arg_p = 0; | |
2516 | int i; | |
2517 | ||
2518 | for (i = 0; i < ntparms; ++i) | |
2519 | { | |
2520 | tree parm = TREE_VEC_ELT (inner_parms, i); | |
2521 | if (TREE_PURPOSE (parm)) | |
2522 | seen_def_arg_p = 1; | |
2523 | else if (seen_def_arg_p) | |
2524 | { | |
33bd39a2 | 2525 | error ("no default argument for `%D'", TREE_VALUE (parm)); |
66191c20 MM |
2526 | /* For better subsequent error-recovery, we indicate that |
2527 | there should have been a default argument. */ | |
2528 | TREE_PURPOSE (parm) = error_mark_node; | |
2529 | } | |
2530 | } | |
2531 | } | |
2532 | ||
6ba89f8e MM |
2533 | if (TREE_CODE (decl) != TYPE_DECL || is_partial || !is_primary) |
2534 | /* For an ordinary class template, default template arguments are | |
2535 | allowed at the innermost level, e.g.: | |
2536 | template <class T = int> | |
2537 | struct S {}; | |
2538 | but, in a partial specialization, they're not allowed even | |
2539 | there, as we have in [temp.class.spec]: | |
2540 | ||
2541 | The template parameter list of a specialization shall not | |
2542 | contain default template argument values. | |
2543 | ||
2544 | So, for a partial specialization, or for a function template, | |
2545 | we look at all of them. */ | |
2546 | ; | |
2547 | else | |
2548 | /* But, for a primary class template that is not a partial | |
2549 | specialization we look at all template parameters except the | |
2550 | innermost ones. */ | |
2551 | parms = TREE_CHAIN (parms); | |
2552 | ||
2553 | /* Figure out what error message to issue. */ | |
2554 | if (TREE_CODE (decl) == FUNCTION_DECL) | |
8653a2c3 | 2555 | msg = "default template arguments may not be used in function templates"; |
6ba89f8e | 2556 | else if (is_partial) |
8653a2c3 | 2557 | msg = "default template arguments may not be used in partial specializations"; |
6ba89f8e MM |
2558 | else |
2559 | msg = "default argument for template parameter for class enclosing `%D'"; | |
2560 | ||
2561 | if (current_class_type && TYPE_BEING_DEFINED (current_class_type)) | |
2562 | /* If we're inside a class definition, there's no need to | |
104bf76a | 2563 | examine the parameters to the class itself. On the one |
6ba89f8e | 2564 | hand, they will be checked when the class is defined, and, |
0e339752 | 2565 | on the other, default arguments are valid in things like: |
6ba89f8e MM |
2566 | template <class T = double> |
2567 | struct S { template <class U> void f(U); }; | |
2568 | Here the default argument for `S' has no bearing on the | |
2569 | declaration of `f'. */ | |
2570 | last_level_to_check = template_class_depth (current_class_type) + 1; | |
2571 | else | |
2572 | /* Check everything. */ | |
2573 | last_level_to_check = 0; | |
2574 | ||
66191c20 MM |
2575 | for (parm_level = parms; |
2576 | parm_level && TMPL_PARMS_DEPTH (parm_level) >= last_level_to_check; | |
2577 | parm_level = TREE_CHAIN (parm_level)) | |
6ba89f8e | 2578 | { |
66191c20 MM |
2579 | tree inner_parms = TREE_VALUE (parm_level); |
2580 | int i; | |
2581 | int ntparms; | |
6ba89f8e MM |
2582 | |
2583 | ntparms = TREE_VEC_LENGTH (inner_parms); | |
2584 | for (i = 0; i < ntparms; ++i) | |
2585 | if (TREE_PURPOSE (TREE_VEC_ELT (inner_parms, i))) | |
2586 | { | |
2587 | if (msg) | |
2588 | { | |
33bd39a2 | 2589 | error (msg, decl); |
6ba89f8e MM |
2590 | msg = 0; |
2591 | } | |
2592 | ||
2593 | /* Clear out the default argument so that we are not | |
2594 | confused later. */ | |
2595 | TREE_PURPOSE (TREE_VEC_ELT (inner_parms, i)) = NULL_TREE; | |
2596 | } | |
2597 | ||
2598 | /* At this point, if we're still interested in issuing messages, | |
2599 | they must apply to classes surrounding the object declared. */ | |
2600 | if (msg) | |
2601 | msg = "default argument for template parameter for class enclosing `%D'"; | |
2602 | } | |
2603 | } | |
2604 | ||
5dd236e2 NS |
2605 | /* Worker for push_template_decl_real, called via |
2606 | for_each_template_parm. DATA is really an int, indicating the | |
2607 | level of the parameters we are interested in. If T is a template | |
838dfd8a | 2608 | parameter of that level, return nonzero. */ |
5dd236e2 NS |
2609 | |
2610 | static int | |
3a978d72 | 2611 | template_parm_this_level_p (tree t, void* data) |
5dd236e2 | 2612 | { |
6e04241f | 2613 | int this_level = *(int *)data; |
5dd236e2 NS |
2614 | int level; |
2615 | ||
2616 | if (TREE_CODE (t) == TEMPLATE_PARM_INDEX) | |
2617 | level = TEMPLATE_PARM_LEVEL (t); | |
2618 | else | |
2619 | level = TEMPLATE_TYPE_LEVEL (t); | |
2620 | return level == this_level; | |
2621 | } | |
2622 | ||
3ac3d9ea | 2623 | /* Creates a TEMPLATE_DECL for the indicated DECL using the template |
f84b4be9 JM |
2624 | parameters given by current_template_args, or reuses a |
2625 | previously existing one, if appropriate. Returns the DECL, or an | |
6757edfe MM |
2626 | equivalent one, if it is replaced via a call to duplicate_decls. |
2627 | ||
838dfd8a | 2628 | If IS_FRIEND is nonzero, DECL is a friend declaration. */ |
3ac3d9ea MM |
2629 | |
2630 | tree | |
3a978d72 | 2631 | push_template_decl_real (tree decl, int is_friend) |
9a3b49ac MS |
2632 | { |
2633 | tree tmpl; | |
f84b4be9 | 2634 | tree args; |
9a3b49ac | 2635 | tree info; |
f84b4be9 JM |
2636 | tree ctx; |
2637 | int primary; | |
6ba89f8e | 2638 | int is_partial; |
cfe507be | 2639 | int new_template_p = 0; |
6ba89f8e MM |
2640 | |
2641 | /* See if this is a partial specialization. */ | |
9188c363 | 2642 | is_partial = (DECL_IMPLICIT_TYPEDEF_P (decl) |
6ba89f8e | 2643 | && TREE_CODE (TREE_TYPE (decl)) != ENUMERAL_TYPE |
370af2d5 | 2644 | && CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_TYPE (decl))); |
6757edfe MM |
2645 | |
2646 | is_friend |= (TREE_CODE (decl) == FUNCTION_DECL && DECL_FRIEND_P (decl)); | |
f84b4be9 JM |
2647 | |
2648 | if (is_friend) | |
2649 | /* For a friend, we want the context of the friend function, not | |
2650 | the type of which it is a friend. */ | |
2651 | ctx = DECL_CONTEXT (decl); | |
4f1c5b7d MM |
2652 | else if (CP_DECL_CONTEXT (decl) |
2653 | && TREE_CODE (CP_DECL_CONTEXT (decl)) != NAMESPACE_DECL) | |
f84b4be9 JM |
2654 | /* In the case of a virtual function, we want the class in which |
2655 | it is defined. */ | |
4f1c5b7d | 2656 | ctx = CP_DECL_CONTEXT (decl); |
f84b4be9 | 2657 | else |
dc957d14 | 2658 | /* Otherwise, if we're currently defining some class, the DECL |
f84b4be9 | 2659 | is assumed to be a member of the class. */ |
9188c363 | 2660 | ctx = current_scope (); |
f84b4be9 | 2661 | |
2c73f9f5 ML |
2662 | if (ctx && TREE_CODE (ctx) == NAMESPACE_DECL) |
2663 | ctx = NULL_TREE; | |
2664 | ||
2665 | if (!DECL_CONTEXT (decl)) | |
cb0dbb9a | 2666 | DECL_CONTEXT (decl) = FROB_CONTEXT (current_namespace); |
2c73f9f5 | 2667 | |
6ba89f8e | 2668 | /* See if this is a primary template. */ |
74b846e0 | 2669 | primary = template_parm_scope_p (); |
9a3b49ac | 2670 | |
83566abf JM |
2671 | if (primary) |
2672 | { | |
2673 | if (current_lang_name == lang_name_c) | |
33bd39a2 | 2674 | error ("template with C linkage"); |
4ce3d537 MM |
2675 | else if (TREE_CODE (decl) == TYPE_DECL |
2676 | && ANON_AGGRNAME_P (DECL_NAME (decl))) | |
33bd39a2 | 2677 | error ("template class without a name"); |
4b0d3cbe MM |
2678 | else if (TREE_CODE (decl) == FUNCTION_DECL |
2679 | && DECL_DESTRUCTOR_P (decl)) | |
2680 | { | |
2681 | /* [temp.mem] | |
2682 | ||
2683 | A destructor shall not be a member template. */ | |
2684 | error ("destructor `%D' declared as member template", decl); | |
2685 | return error_mark_node; | |
2686 | } | |
2aaf816d JM |
2687 | else if ((DECL_IMPLICIT_TYPEDEF_P (decl) |
2688 | && CLASS_TYPE_P (TREE_TYPE (decl))) | |
2689 | || (TREE_CODE (decl) == VAR_DECL && ctx && CLASS_TYPE_P (ctx)) | |
2690 | || TREE_CODE (decl) == FUNCTION_DECL) | |
2691 | /* OK */; | |
2692 | else | |
33bd39a2 | 2693 | error ("template declaration of `%#D'", decl); |
83566abf JM |
2694 | } |
2695 | ||
6ba89f8e MM |
2696 | /* Check to see that the rules regarding the use of default |
2697 | arguments are not being violated. */ | |
2698 | check_default_tmpl_args (decl, current_template_parms, | |
2699 | primary, is_partial); | |
73aad9b9 | 2700 | |
6ba89f8e MM |
2701 | if (is_partial) |
2702 | return process_partial_specialization (decl); | |
d32789d8 | 2703 | |
9a3b49ac MS |
2704 | args = current_template_args (); |
2705 | ||
f84b4be9 JM |
2706 | if (!ctx |
2707 | || TREE_CODE (ctx) == FUNCTION_DECL | |
a723baf1 | 2708 | || (CLASS_TYPE_P (ctx) && TYPE_BEING_DEFINED (ctx)) |
f84b4be9 | 2709 | || (is_friend && !DECL_TEMPLATE_INFO (decl))) |
8d08fdba | 2710 | { |
75650646 | 2711 | if (DECL_LANG_SPECIFIC (decl) |
f84b4be9 JM |
2712 | && DECL_TEMPLATE_INFO (decl) |
2713 | && DECL_TI_TEMPLATE (decl)) | |
2714 | tmpl = DECL_TI_TEMPLATE (decl); | |
1c10870d AS |
2715 | /* If DECL is a TYPE_DECL for a class-template, then there won't |
2716 | be DECL_LANG_SPECIFIC. The information equivalent to | |
2717 | DECL_TEMPLATE_INFO is found in TYPE_TEMPLATE_INFO instead. */ | |
2718 | else if (DECL_IMPLICIT_TYPEDEF_P (decl) | |
2719 | && TYPE_TEMPLATE_INFO (TREE_TYPE (decl)) | |
2720 | && TYPE_TI_TEMPLATE (TREE_TYPE (decl))) | |
2721 | { | |
2722 | /* Since a template declaration already existed for this | |
2723 | class-type, we must be redeclaring it here. Make sure | |
0e339752 | 2724 | that the redeclaration is valid. */ |
1c10870d AS |
2725 | redeclare_class_template (TREE_TYPE (decl), |
2726 | current_template_parms); | |
2727 | /* We don't need to create a new TEMPLATE_DECL; just use the | |
2728 | one we already had. */ | |
2729 | tmpl = TYPE_TI_TEMPLATE (TREE_TYPE (decl)); | |
2730 | } | |
f84b4be9 | 2731 | else |
786b5245 | 2732 | { |
f84b4be9 | 2733 | tmpl = build_template_decl (decl, current_template_parms); |
cfe507be MM |
2734 | new_template_p = 1; |
2735 | ||
f84b4be9 JM |
2736 | if (DECL_LANG_SPECIFIC (decl) |
2737 | && DECL_TEMPLATE_SPECIALIZATION (decl)) | |
2738 | { | |
2739 | /* A specialization of a member template of a template | |
c6002625 | 2740 | class. */ |
f84b4be9 JM |
2741 | SET_DECL_TEMPLATE_SPECIALIZATION (tmpl); |
2742 | DECL_TEMPLATE_INFO (tmpl) = DECL_TEMPLATE_INFO (decl); | |
2743 | DECL_TEMPLATE_INFO (decl) = NULL_TREE; | |
2744 | } | |
786b5245 | 2745 | } |
8d08fdba MS |
2746 | } |
2747 | else | |
2748 | { | |
e1a5ccf7 | 2749 | tree a, t, current, parms; |
ba4f4e5d | 2750 | int i; |
6633d636 | 2751 | |
6b9ab5cc MM |
2752 | if (TREE_CODE (decl) == TYPE_DECL) |
2753 | { | |
ed44da02 MM |
2754 | if ((IS_AGGR_TYPE_CODE (TREE_CODE (TREE_TYPE (decl))) |
2755 | || TREE_CODE (TREE_TYPE (decl)) == ENUMERAL_TYPE) | |
2756 | && TYPE_TEMPLATE_INFO (TREE_TYPE (decl)) | |
2757 | && TYPE_TI_TEMPLATE (TREE_TYPE (decl))) | |
2758 | tmpl = TYPE_TI_TEMPLATE (TREE_TYPE (decl)); | |
6b9ab5cc MM |
2759 | else |
2760 | { | |
33bd39a2 | 2761 | error ("`%D' does not declare a template type", decl); |
6b9ab5cc MM |
2762 | return decl; |
2763 | } | |
2764 | } | |
f3368a90 | 2765 | else if (!DECL_LANG_SPECIFIC (decl) || !DECL_TEMPLATE_INFO (decl)) |
c91a56d2 | 2766 | { |
33bd39a2 | 2767 | error ("template definition of non-template `%#D'", decl); |
3ac3d9ea | 2768 | return decl; |
c91a56d2 | 2769 | } |
8d08fdba | 2770 | else |
5566b478 | 2771 | tmpl = DECL_TI_TEMPLATE (decl); |
98c1c668 | 2772 | |
e1a5ccf7 JM |
2773 | if (is_member_template (tmpl) |
2774 | && DECL_FUNCTION_TEMPLATE_P (tmpl) | |
2775 | && DECL_TEMPLATE_INFO (decl) && DECL_TI_ARGS (decl) | |
2776 | && DECL_TEMPLATE_SPECIALIZATION (decl)) | |
98c1c668 | 2777 | { |
e1a5ccf7 JM |
2778 | tree new_tmpl; |
2779 | ||
2780 | /* The declaration is a specialization of a member | |
2781 | template, declared outside the class. Therefore, the | |
2782 | innermost template arguments will be NULL, so we | |
2783 | replace them with the arguments determined by the | |
2784 | earlier call to check_explicit_specialization. */ | |
2785 | args = DECL_TI_ARGS (decl); | |
2786 | ||
2787 | new_tmpl | |
2788 | = build_template_decl (decl, current_template_parms); | |
2789 | DECL_TEMPLATE_RESULT (new_tmpl) = decl; | |
2790 | TREE_TYPE (new_tmpl) = TREE_TYPE (decl); | |
2791 | DECL_TI_TEMPLATE (decl) = new_tmpl; | |
2792 | SET_DECL_TEMPLATE_SPECIALIZATION (new_tmpl); | |
e1b3e07d MM |
2793 | DECL_TEMPLATE_INFO (new_tmpl) |
2794 | = tree_cons (tmpl, args, NULL_TREE); | |
e1a5ccf7 | 2795 | |
f9a7ae04 MM |
2796 | register_specialization (new_tmpl, |
2797 | most_general_template (tmpl), | |
2798 | args); | |
e1a5ccf7 | 2799 | return decl; |
98c1c668 | 2800 | } |
98c1c668 | 2801 | |
e1a5ccf7 | 2802 | /* Make sure the template headers we got make sense. */ |
6633d636 | 2803 | |
e1a5ccf7 JM |
2804 | parms = DECL_TEMPLATE_PARMS (tmpl); |
2805 | i = TMPL_PARMS_DEPTH (parms); | |
2806 | if (TMPL_ARGS_DEPTH (args) != i) | |
98c1c668 | 2807 | { |
33bd39a2 | 2808 | error ("expected %d levels of template parms for `%#D', got %d", |
e1a5ccf7 | 2809 | i, decl, TMPL_ARGS_DEPTH (args)); |
98c1c668 | 2810 | } |
e1a5ccf7 JM |
2811 | else |
2812 | for (current = decl; i > 0; --i, parms = TREE_CHAIN (parms)) | |
2813 | { | |
2814 | a = TMPL_ARGS_LEVEL (args, i); | |
2815 | t = INNERMOST_TEMPLATE_PARMS (parms); | |
2816 | ||
2817 | if (TREE_VEC_LENGTH (t) != TREE_VEC_LENGTH (a)) | |
2818 | { | |
2819 | if (current == decl) | |
33bd39a2 | 2820 | error ("got %d template parameters for `%#D'", |
e1a5ccf7 JM |
2821 | TREE_VEC_LENGTH (a), decl); |
2822 | else | |
33bd39a2 | 2823 | error ("got %d template parameters for `%#T'", |
e1a5ccf7 | 2824 | TREE_VEC_LENGTH (a), current); |
33bd39a2 | 2825 | error (" but %d required", TREE_VEC_LENGTH (t)); |
e1a5ccf7 | 2826 | } |
98c1c668 | 2827 | |
e1a5ccf7 JM |
2828 | /* Perhaps we should also check that the parms are used in the |
2829 | appropriate qualifying scopes in the declarator? */ | |
6633d636 | 2830 | |
e1a5ccf7 JM |
2831 | if (current == decl) |
2832 | current = ctx; | |
2833 | else | |
2834 | current = TYPE_CONTEXT (current); | |
2835 | } | |
5566b478 | 2836 | } |
8d08fdba | 2837 | |
5566b478 MS |
2838 | DECL_TEMPLATE_RESULT (tmpl) = decl; |
2839 | TREE_TYPE (tmpl) = TREE_TYPE (decl); | |
8d08fdba | 2840 | |
36a117a5 MM |
2841 | /* Push template declarations for global functions and types. Note |
2842 | that we do not try to push a global template friend declared in a | |
2843 | template class; such a thing may well depend on the template | |
39c01e4c | 2844 | parameters of the class. */ |
cfe507be | 2845 | if (new_template_p && !ctx |
36a117a5 | 2846 | && !(is_friend && template_class_depth (current_class_type) > 0)) |
2c73f9f5 | 2847 | tmpl = pushdecl_namespace_level (tmpl); |
8d08fdba | 2848 | |
5566b478 | 2849 | if (primary) |
5dd236e2 NS |
2850 | { |
2851 | DECL_PRIMARY_TEMPLATE (tmpl) = tmpl; | |
2852 | if (DECL_CONV_FN_P (tmpl)) | |
2853 | { | |
6e04241f GS |
2854 | int depth = TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl)); |
2855 | ||
5dd236e2 NS |
2856 | /* It is a conversion operator. See if the type converted to |
2857 | depends on innermost template operands. */ | |
2858 | ||
6e04241f GS |
2859 | if (for_each_template_parm (TREE_TYPE (TREE_TYPE (tmpl)), |
2860 | template_parm_this_level_p, | |
4f2c9d7e MM |
2861 | &depth, |
2862 | NULL)) | |
5dd236e2 NS |
2863 | DECL_TEMPLATE_CONV_FN_P (tmpl) = 1; |
2864 | } | |
2865 | } | |
5566b478 | 2866 | |
e1b3e07d | 2867 | info = tree_cons (tmpl, args, NULL_TREE); |
5566b478 | 2868 | |
9188c363 | 2869 | if (DECL_IMPLICIT_TYPEDEF_P (decl)) |
8d08fdba | 2870 | { |
ed44da02 MM |
2871 | SET_TYPE_TEMPLATE_INFO (TREE_TYPE (tmpl), info); |
2872 | if ((!ctx || TREE_CODE (ctx) != FUNCTION_DECL) | |
b60ecc04 MM |
2873 | && TREE_CODE (TREE_TYPE (decl)) != ENUMERAL_TYPE |
2874 | /* Don't change the name if we've already set it up. */ | |
2875 | && !IDENTIFIER_TEMPLATE (DECL_NAME (decl))) | |
75650646 | 2876 | DECL_NAME (decl) = classtype_mangled_name (TREE_TYPE (decl)); |
51c184be | 2877 | } |
2aaf816d | 2878 | else if (DECL_LANG_SPECIFIC (decl)) |
5566b478 | 2879 | DECL_TEMPLATE_INFO (decl) = info; |
3ac3d9ea MM |
2880 | |
2881 | return DECL_TEMPLATE_RESULT (tmpl); | |
8d08fdba MS |
2882 | } |
2883 | ||
6757edfe | 2884 | tree |
3a978d72 | 2885 | push_template_decl (tree decl) |
6757edfe MM |
2886 | { |
2887 | return push_template_decl_real (decl, 0); | |
2888 | } | |
2889 | ||
2890 | /* Called when a class template TYPE is redeclared with the indicated | |
2891 | template PARMS, e.g.: | |
7fe6899f MM |
2892 | |
2893 | template <class T> struct S; | |
2894 | template <class T> struct S {}; */ | |
2895 | ||
2896 | void | |
3a978d72 | 2897 | redeclare_class_template (tree type, tree parms) |
7fe6899f | 2898 | { |
3d7de1fa | 2899 | tree tmpl; |
6757edfe | 2900 | tree tmpl_parms; |
7fe6899f MM |
2901 | int i; |
2902 | ||
3d7de1fa MM |
2903 | if (!TYPE_TEMPLATE_INFO (type)) |
2904 | { | |
33bd39a2 | 2905 | error ("`%T' is not a template type", type); |
3d7de1fa MM |
2906 | return; |
2907 | } | |
2908 | ||
2909 | tmpl = TYPE_TI_TEMPLATE (type); | |
7fe6899f MM |
2910 | if (!PRIMARY_TEMPLATE_P (tmpl)) |
2911 | /* The type is nested in some template class. Nothing to worry | |
2912 | about here; there are no new template parameters for the nested | |
2913 | type. */ | |
2914 | return; | |
2915 | ||
6757edfe MM |
2916 | parms = INNERMOST_TEMPLATE_PARMS (parms); |
2917 | tmpl_parms = DECL_INNERMOST_TEMPLATE_PARMS (tmpl); | |
2918 | ||
7fe6899f MM |
2919 | if (TREE_VEC_LENGTH (parms) != TREE_VEC_LENGTH (tmpl_parms)) |
2920 | { | |
8251199e | 2921 | cp_error_at ("previous declaration `%D'", tmpl); |
33bd39a2 | 2922 | error ("used %d template parameter%s instead of %d", |
7fe6899f MM |
2923 | TREE_VEC_LENGTH (tmpl_parms), |
2924 | TREE_VEC_LENGTH (tmpl_parms) == 1 ? "" : "s", | |
2925 | TREE_VEC_LENGTH (parms)); | |
2926 | return; | |
2927 | } | |
2928 | ||
2929 | for (i = 0; i < TREE_VEC_LENGTH (tmpl_parms); ++i) | |
2930 | { | |
2931 | tree tmpl_parm = TREE_VALUE (TREE_VEC_ELT (tmpl_parms, i)); | |
2932 | tree parm = TREE_VALUE (TREE_VEC_ELT (parms, i)); | |
2933 | tree tmpl_default = TREE_PURPOSE (TREE_VEC_ELT (tmpl_parms, i)); | |
2934 | tree parm_default = TREE_PURPOSE (TREE_VEC_ELT (parms, i)); | |
2935 | ||
2936 | if (TREE_CODE (tmpl_parm) != TREE_CODE (parm)) | |
2937 | { | |
8251199e | 2938 | cp_error_at ("template parameter `%#D'", tmpl_parm); |
33bd39a2 | 2939 | error ("redeclared here as `%#D'", parm); |
7fe6899f MM |
2940 | return; |
2941 | } | |
2942 | ||
2943 | if (tmpl_default != NULL_TREE && parm_default != NULL_TREE) | |
2944 | { | |
2945 | /* We have in [temp.param]: | |
2946 | ||
2947 | A template-parameter may not be given default arguments | |
2948 | by two different declarations in the same scope. */ | |
33bd39a2 | 2949 | error ("redefinition of default argument for `%#D'", parm); |
ddd2d57e | 2950 | error ("%J original definition appeared here", 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 | 3211 | /* If this expression already has reference type, get the |
3281be05 | 3212 | underlying object. */ |
0dc09a61 MM |
3213 | if (TREE_CODE (expr_type) == REFERENCE_TYPE) |
3214 | { | |
3281be05 MM |
3215 | if (TREE_CODE (expr) == NOP_EXPR |
3216 | && TREE_CODE (TREE_OPERAND (expr, 0)) == ADDR_EXPR) | |
3217 | STRIP_NOPS (expr); | |
0dc09a61 MM |
3218 | my_friendly_assert (TREE_CODE (expr) == ADDR_EXPR, 20000604); |
3219 | expr = TREE_OPERAND (expr, 0); | |
3220 | expr_type = TREE_TYPE (expr); | |
3221 | } | |
3222 | ||
75650646 MM |
3223 | if (TREE_CODE (type_referred_to) == FUNCTION_TYPE) |
3224 | { | |
3225 | /* For a non-type template-parameter of type reference to | |
39c01e4c MM |
3226 | function, no conversions apply. If the |
3227 | template-argument represents a set of overloaded | |
3228 | functions, the matching function is selected from the | |
3229 | set (_over.over_). */ | |
75650646 MM |
3230 | tree fn; |
3231 | ||
c2ea3a40 | 3232 | fn = instantiate_type (type_referred_to, expr, tf_none); |
e6e174e5 JM |
3233 | |
3234 | if (fn == error_mark_node) | |
3235 | return error_mark_node; | |
75650646 | 3236 | |
ad50e811 | 3237 | if (!DECL_EXTERNAL_LINKAGE_P (fn)) |
75650646 | 3238 | { |
0dc09a61 | 3239 | if (really_overloaded_fn (expr)) |
75650646 MM |
3240 | /* Don't issue an error here; we might get a different |
3241 | function if the overloading had worked out | |
3242 | differently. */ | |
3243 | return error_mark_node; | |
3244 | else | |
3245 | goto bad_argument; | |
3246 | } | |
3247 | ||
3bfdc719 MM |
3248 | my_friendly_assert (same_type_p (type_referred_to, |
3249 | TREE_TYPE (fn)), | |
75650646 MM |
3250 | 0); |
3251 | ||
0dc09a61 | 3252 | expr = fn; |
75650646 MM |
3253 | } |
3254 | else | |
3255 | { | |
3256 | /* For a non-type template-parameter of type reference to | |
3257 | object, no conversions apply. The type referred to by the | |
3258 | reference may be more cv-qualified than the (otherwise | |
3259 | identical) type of the template-argument. The | |
3260 | template-parameter is bound directly to the | |
3261 | template-argument, which must be an lvalue. */ | |
0dc09a61 MM |
3262 | if (!same_type_p (TYPE_MAIN_VARIANT (expr_type), |
3263 | TYPE_MAIN_VARIANT (type_referred_to)) | |
91063b51 MM |
3264 | || !at_least_as_qualified_p (type_referred_to, |
3265 | expr_type) | |
75650646 | 3266 | || !real_lvalue_p (expr)) |
fd74ca0b | 3267 | return error_mark_node; |
75650646 | 3268 | } |
0dc09a61 | 3269 | |
dffd7eb6 | 3270 | cxx_mark_addressable (expr); |
3281be05 | 3271 | return build_nop (type, build_address (expr)); |
75650646 MM |
3272 | } |
3273 | break; | |
3274 | ||
3275 | case RECORD_TYPE: | |
3276 | { | |
db3f4e4e | 3277 | my_friendly_assert (TYPE_PTRMEMFUNC_P (type), 20010112); |
75650646 MM |
3278 | |
3279 | /* For a non-type template-parameter of type pointer to member | |
3280 | function, no conversions apply. If the template-argument | |
3281 | represents a set of overloaded member functions, the | |
3282 | matching member function is selected from the set | |
3283 | (_over.over_). */ | |
3284 | ||
3285 | if (!TYPE_PTRMEMFUNC_P (expr_type) && | |
3286 | expr_type != unknown_type_node) | |
3287 | return error_mark_node; | |
3288 | ||
e08a8f45 | 3289 | if (TREE_CODE (expr) == PTRMEM_CST) |
75650646 MM |
3290 | { |
3291 | /* A ptr-to-member constant. */ | |
3bfdc719 | 3292 | if (!same_type_p (type, expr_type)) |
75650646 MM |
3293 | return error_mark_node; |
3294 | else | |
3295 | return expr; | |
3296 | } | |
3297 | ||
3298 | if (TREE_CODE (expr) != ADDR_EXPR) | |
3299 | return error_mark_node; | |
3300 | ||
c2ea3a40 | 3301 | expr = instantiate_type (type, expr, tf_none); |
75650646 | 3302 | |
d8f8dca1 | 3303 | if (expr == error_mark_node) |
75650646 MM |
3304 | return error_mark_node; |
3305 | ||
3bfdc719 | 3306 | my_friendly_assert (same_type_p (type, TREE_TYPE (expr)), |
75650646 MM |
3307 | 0); |
3308 | return expr; | |
3309 | } | |
3310 | break; | |
3311 | ||
3312 | default: | |
3313 | /* All non-type parameters must have one of these types. */ | |
a98facb0 | 3314 | abort (); |
75650646 MM |
3315 | break; |
3316 | } | |
3317 | ||
3318 | return error_mark_node; | |
3319 | } | |
3320 | ||
744fac59 KL |
3321 | /* Return 1 if PARM_PARMS and ARG_PARMS matches using rule for |
3322 | template template parameters. Both PARM_PARMS and ARG_PARMS are | |
3323 | vectors of TREE_LIST nodes containing TYPE_DECL, TEMPLATE_DECL | |
3324 | or PARM_DECL. | |
3325 | ||
3326 | ARG_PARMS may contain more parameters than PARM_PARMS. If this is | |
3327 | the case, then extra parameters must have default arguments. | |
3328 | ||
3329 | Consider the example: | |
3330 | template <class T, class Allocator = allocator> class vector; | |
3331 | template<template <class U> class TT> class C; | |
3332 | ||
3333 | C<vector> is a valid instantiation. PARM_PARMS for the above code | |
3334 | contains a TYPE_DECL (for U), ARG_PARMS contains two TYPE_DECLs (for | |
3335 | T and Allocator) and OUTER_ARGS contains the argument that is used to | |
3336 | substitute the TT parameter. */ | |
3337 | ||
3338 | static int | |
3a978d72 NN |
3339 | coerce_template_template_parms (tree parm_parms, |
3340 | tree arg_parms, | |
3341 | tsubst_flags_t complain, | |
3342 | tree in_decl, | |
3343 | tree outer_args) | |
744fac59 KL |
3344 | { |
3345 | int nparms, nargs, i; | |
3346 | tree parm, arg; | |
3347 | ||
3348 | my_friendly_assert (TREE_CODE (parm_parms) == TREE_VEC, 0); | |
3349 | my_friendly_assert (TREE_CODE (arg_parms) == TREE_VEC, 0); | |
3350 | ||
3351 | nparms = TREE_VEC_LENGTH (parm_parms); | |
3352 | nargs = TREE_VEC_LENGTH (arg_parms); | |
3353 | ||
3354 | /* The rule here is opposite of coerce_template_parms. */ | |
3355 | if (nargs < nparms | |
3356 | || (nargs > nparms | |
3357 | && TREE_PURPOSE (TREE_VEC_ELT (arg_parms, nparms)) == NULL_TREE)) | |
3358 | return 0; | |
3359 | ||
3360 | for (i = 0; i < nparms; ++i) | |
3361 | { | |
3362 | parm = TREE_VALUE (TREE_VEC_ELT (parm_parms, i)); | |
3363 | arg = TREE_VALUE (TREE_VEC_ELT (arg_parms, i)); | |
3364 | ||
3365 | if (arg == NULL_TREE || arg == error_mark_node | |
3366 | || parm == NULL_TREE || parm == error_mark_node) | |
3367 | return 0; | |
3368 | ||
3369 | if (TREE_CODE (arg) != TREE_CODE (parm)) | |
3370 | return 0; | |
3371 | ||
3372 | switch (TREE_CODE (parm)) | |
3373 | { | |
3374 | case TYPE_DECL: | |
3375 | break; | |
3376 | ||
3377 | case TEMPLATE_DECL: | |
3378 | /* We encounter instantiations of templates like | |
3379 | template <template <template <class> class> class TT> | |
3380 | class C; */ | |
700466c2 JM |
3381 | { |
3382 | tree parmparm = DECL_INNERMOST_TEMPLATE_PARMS (parm); | |
3383 | tree argparm = DECL_INNERMOST_TEMPLATE_PARMS (arg); | |
3384 | ||
8c6ab2db NS |
3385 | if (!coerce_template_template_parms |
3386 | (parmparm, argparm, complain, in_decl, outer_args)) | |
700466c2 JM |
3387 | return 0; |
3388 | } | |
3389 | break; | |
744fac59 KL |
3390 | |
3391 | case PARM_DECL: | |
3392 | /* The tsubst call is used to handle cases such as | |
3393 | template <class T, template <T> class TT> class D; | |
3394 | i.e. the parameter list of TT depends on earlier parameters. */ | |
8c6ab2db NS |
3395 | if (!same_type_p |
3396 | (tsubst (TREE_TYPE (parm), outer_args, complain, in_decl), | |
3397 | TREE_TYPE (arg))) | |
744fac59 KL |
3398 | return 0; |
3399 | break; | |
3400 | ||
3401 | default: | |
a98facb0 | 3402 | abort (); |
744fac59 KL |
3403 | } |
3404 | } | |
3405 | return 1; | |
3406 | } | |
3407 | ||
8b5b8b7c MM |
3408 | /* Convert the indicated template ARG as necessary to match the |
3409 | indicated template PARM. Returns the converted ARG, or | |
c2ea3a40 NS |
3410 | error_mark_node if the conversion was unsuccessful. Error and |
3411 | warning messages are issued under control of COMPLAIN. This | |
3412 | conversion is for the Ith parameter in the parameter list. ARGS is | |
3413 | the full set of template arguments deduced so far. */ | |
8b5b8b7c MM |
3414 | |
3415 | static tree | |
3a978d72 NN |
3416 | convert_template_argument (tree parm, |
3417 | tree arg, | |
3418 | tree args, | |
3419 | tsubst_flags_t complain, | |
3420 | int i, | |
3421 | tree in_decl) | |
8b5b8b7c MM |
3422 | { |
3423 | tree val; | |
3424 | tree inner_args; | |
3425 | int is_type, requires_type, is_tmpl_type, requires_tmpl_type; | |
3426 | ||
f9a7ae04 | 3427 | inner_args = INNERMOST_TEMPLATE_ARGS (args); |
8b5b8b7c MM |
3428 | |
3429 | if (TREE_CODE (arg) == TREE_LIST | |
a5ac359a | 3430 | && TREE_CODE (TREE_VALUE (arg)) == OFFSET_REF) |
8b5b8b7c MM |
3431 | { |
3432 | /* The template argument was the name of some | |
3433 | member function. That's usually | |
0e339752 | 3434 | invalid, but static members are OK. In any |
8b5b8b7c MM |
3435 | case, grab the underlying fields/functions |
3436 | and issue an error later if required. */ | |
3437 | arg = TREE_VALUE (arg); | |
3438 | TREE_TYPE (arg) = unknown_type_node; | |
3439 | } | |
3440 | ||
3441 | requires_tmpl_type = TREE_CODE (parm) == TEMPLATE_DECL; | |
3442 | requires_type = (TREE_CODE (parm) == TYPE_DECL | |
3443 | || requires_tmpl_type); | |
3444 | ||
cbd63935 KL |
3445 | is_tmpl_type = ((TREE_CODE (arg) == TEMPLATE_DECL |
3446 | && TREE_CODE (DECL_TEMPLATE_RESULT (arg)) == TYPE_DECL) | |
3447 | || TREE_CODE (arg) == TEMPLATE_TEMPLATE_PARM | |
3448 | || TREE_CODE (arg) == UNBOUND_CLASS_TEMPLATE); | |
303d1c55 | 3449 | |
b8c6534b KL |
3450 | if (is_tmpl_type |
3451 | && (TREE_CODE (arg) == TEMPLATE_TEMPLATE_PARM | |
3452 | || TREE_CODE (arg) == UNBOUND_CLASS_TEMPLATE)) | |
8b5b8b7c | 3453 | arg = TYPE_STUB_DECL (arg); |
8b5b8b7c | 3454 | |
2f939d94 | 3455 | is_type = TYPE_P (arg) || is_tmpl_type; |
8b5b8b7c MM |
3456 | |
3457 | if (requires_type && ! is_type && TREE_CODE (arg) == SCOPE_REF | |
3458 | && TREE_CODE (TREE_OPERAND (arg, 0)) == TEMPLATE_TYPE_PARM) | |
3459 | { | |
33bd39a2 | 3460 | pedwarn ("to refer to a type member of a template parameter, use `typename %E'", arg); |
8b5b8b7c MM |
3461 | |
3462 | arg = make_typename_type (TREE_OPERAND (arg, 0), | |
3baa501d | 3463 | TREE_OPERAND (arg, 1), |
c2ea3a40 | 3464 | complain & tf_error); |
8b5b8b7c MM |
3465 | is_type = 1; |
3466 | } | |
3467 | if (is_type != requires_type) | |
3468 | { | |
3469 | if (in_decl) | |
3470 | { | |
c2ea3a40 | 3471 | if (complain & tf_error) |
8b5b8b7c | 3472 | { |
33bd39a2 | 3473 | error ("type/value mismatch at argument %d in template parameter list for `%D'", |
8b5b8b7c MM |
3474 | i + 1, in_decl); |
3475 | if (is_type) | |
33bd39a2 | 3476 | error (" expected a constant of type `%T', got `%T'", |
8b5b8b7c MM |
3477 | TREE_TYPE (parm), |
3478 | (is_tmpl_type ? DECL_NAME (arg) : arg)); | |
d12a7283 KL |
3479 | else if (requires_tmpl_type) |
3480 | error (" expected a class template, got `%E'", arg); | |
8b5b8b7c | 3481 | else |
33bd39a2 | 3482 | error (" expected a type, got `%E'", arg); |
8b5b8b7c MM |
3483 | } |
3484 | } | |
3485 | return error_mark_node; | |
3486 | } | |
3487 | if (is_tmpl_type ^ requires_tmpl_type) | |
3488 | { | |
c2ea3a40 | 3489 | if (in_decl && (complain & tf_error)) |
8b5b8b7c | 3490 | { |
33bd39a2 | 3491 | error ("type/value mismatch at argument %d in template parameter list for `%D'", |
8b5b8b7c MM |
3492 | i + 1, in_decl); |
3493 | if (is_tmpl_type) | |
33bd39a2 | 3494 | error (" expected a type, got `%T'", DECL_NAME (arg)); |
8b5b8b7c | 3495 | else |
33bd39a2 | 3496 | error (" expected a class template, got `%T'", arg); |
8b5b8b7c MM |
3497 | } |
3498 | return error_mark_node; | |
3499 | } | |
3500 | ||
3501 | if (is_type) | |
3502 | { | |
3503 | if (requires_tmpl_type) | |
3504 | { | |
b8c6534b KL |
3505 | if (TREE_CODE (TREE_TYPE (arg)) == UNBOUND_CLASS_TEMPLATE) |
3506 | /* The number of argument required is not known yet. | |
3507 | Just accept it for now. */ | |
3508 | val = TREE_TYPE (arg); | |
8b5b8b7c MM |
3509 | else |
3510 | { | |
b8c6534b KL |
3511 | tree parmparm = DECL_INNERMOST_TEMPLATE_PARMS (parm); |
3512 | tree argparm = DECL_INNERMOST_TEMPLATE_PARMS (arg); | |
3513 | ||
3514 | if (coerce_template_template_parms (parmparm, argparm, | |
3515 | complain, in_decl, | |
3516 | inner_args)) | |
8b5b8b7c | 3517 | { |
b8c6534b KL |
3518 | val = arg; |
3519 | ||
3520 | /* TEMPLATE_TEMPLATE_PARM node is preferred over | |
3521 | TEMPLATE_DECL. */ | |
3522 | if (val != error_mark_node | |
3523 | && DECL_TEMPLATE_TEMPLATE_PARM_P (val)) | |
3524 | val = TREE_TYPE (val); | |
8b5b8b7c | 3525 | } |
b8c6534b KL |
3526 | else |
3527 | { | |
c2ea3a40 | 3528 | if (in_decl && (complain & tf_error)) |
b8c6534b | 3529 | { |
33bd39a2 | 3530 | error ("type/value mismatch at argument %d in template parameter list for `%D'", |
b8c6534b | 3531 | i + 1, in_decl); |
33bd39a2 | 3532 | error (" expected a template of type `%D', got `%D'", parm, arg); |
b8c6534b | 3533 | } |
8b5b8b7c | 3534 | |
b8c6534b KL |
3535 | val = error_mark_node; |
3536 | } | |
8b5b8b7c MM |
3537 | } |
3538 | } | |
3539 | else | |
3e4a3562 | 3540 | val = groktypename (arg); |
8b5b8b7c MM |
3541 | } |
3542 | else | |
3543 | { | |
4393e105 | 3544 | tree t = tsubst (TREE_TYPE (parm), args, complain, in_decl); |
8b5b8b7c | 3545 | |
11b810f1 | 3546 | if (invalid_nontype_parm_type_p (t, complain)) |
db3f4e4e NS |
3547 | return error_mark_node; |
3548 | ||
d768a589 | 3549 | if (!uses_template_parms (arg) && !uses_template_parms (t)) |
8b5b8b7c MM |
3550 | /* We used to call digest_init here. However, digest_init |
3551 | will report errors, which we don't want when complain | |
3552 | is zero. More importantly, digest_init will try too | |
3553 | hard to convert things: for example, `0' should not be | |
3554 | converted to pointer type at this point according to | |
3555 | the standard. Accepting this is not merely an | |
3556 | extension, since deciding whether or not these | |
3557 | conversions can occur is part of determining which | |
dc957d14 | 3558 | function template to call, or whether a given explicit |
0e339752 | 3559 | argument specification is valid. */ |
8b5b8b7c MM |
3560 | val = convert_nontype_argument (t, arg); |
3561 | else | |
3562 | val = arg; | |
3563 | ||
3564 | if (val == NULL_TREE) | |
3565 | val = error_mark_node; | |
c2ea3a40 | 3566 | else if (val == error_mark_node && (complain & tf_error)) |
33bd39a2 | 3567 | error ("could not convert template argument `%E' to `%T'", |
8b5b8b7c MM |
3568 | arg, t); |
3569 | } | |
3570 | ||
3571 | return val; | |
3572 | } | |
3573 | ||
3574 | /* Convert all template arguments to their appropriate types, and | |
3575 | return a vector containing the innermost resulting template | |
c2ea3a40 | 3576 | arguments. If any error occurs, return error_mark_node. Error and |
3e4a3562 | 3577 | warning messages are issued under control of COMPLAIN. |
75650646 | 3578 | |
838dfd8a | 3579 | If REQUIRE_ALL_ARGUMENTS is nonzero, all arguments must be |
75650646 MM |
3580 | provided in ARGLIST, or else trailing parameters must have default |
3581 | values. If REQUIRE_ALL_ARGUMENTS is zero, we will attempt argument | |
6dfbb909 | 3582 | deduction for any unspecified trailing arguments. */ |
de575009 | 3583 | |
8d08fdba | 3584 | static tree |
3a978d72 NN |
3585 | coerce_template_parms (tree parms, |
3586 | tree args, | |
3587 | tree in_decl, | |
3588 | tsubst_flags_t complain, | |
3589 | int require_all_arguments) | |
8d08fdba | 3590 | { |
a292b002 | 3591 | int nparms, nargs, i, lost = 0; |
e4a84209 | 3592 | tree inner_args; |
8b5b8b7c MM |
3593 | tree new_args; |
3594 | tree new_inner_args; | |
a292b002 | 3595 | |
f9a7ae04 | 3596 | inner_args = INNERMOST_TEMPLATE_ARGS (args); |
bf12d54d | 3597 | nargs = inner_args ? NUM_TMPL_ARGS (inner_args) : 0; |
a292b002 MS |
3598 | nparms = TREE_VEC_LENGTH (parms); |
3599 | ||
3600 | if (nargs > nparms | |
3601 | || (nargs < nparms | |
75650646 | 3602 | && require_all_arguments |
a292b002 | 3603 | && TREE_PURPOSE (TREE_VEC_ELT (parms, nargs)) == NULL_TREE)) |
8d08fdba | 3604 | { |
c2ea3a40 | 3605 | if (complain & tf_error) |
75650646 | 3606 | { |
33bd39a2 | 3607 | error ("wrong number of template arguments (%d, should be %d)", |
e4a84209 | 3608 | nargs, nparms); |
75650646 MM |
3609 | |
3610 | if (in_decl) | |
8251199e | 3611 | cp_error_at ("provided for `%D'", in_decl); |
75650646 MM |
3612 | } |
3613 | ||
8d08fdba MS |
3614 | return error_mark_node; |
3615 | } | |
3616 | ||
f31c0a32 | 3617 | new_inner_args = make_tree_vec (nparms); |
8b5b8b7c MM |
3618 | new_args = add_outermost_template_args (args, new_inner_args); |
3619 | for (i = 0; i < nparms; i++) | |
8d08fdba | 3620 | { |
8b5b8b7c MM |
3621 | tree arg; |
3622 | tree parm; | |
e4a84209 | 3623 | |
8b5b8b7c MM |
3624 | /* Get the Ith template parameter. */ |
3625 | parm = TREE_VEC_ELT (parms, i); | |
75650646 | 3626 | |
8b5b8b7c | 3627 | /* Calculate the Ith argument. */ |
bf12d54d | 3628 | if (i < nargs) |
8b5b8b7c | 3629 | arg = TREE_VEC_ELT (inner_args, i); |
ffd49b19 NS |
3630 | else if (require_all_arguments) |
3631 | /* There must be a default arg in this case. */ | |
a91db711 NS |
3632 | arg = tsubst_template_arg (TREE_PURPOSE (parm), new_args, |
3633 | complain, in_decl); | |
ffd49b19 NS |
3634 | else |
3635 | break; | |
3636 | ||
3637 | my_friendly_assert (arg, 20030727); | |
3638 | if (arg == error_mark_node) | |
3639 | error ("template argument %d is invalid", i + 1); | |
8b5b8b7c MM |
3640 | else |
3641 | arg = convert_template_argument (TREE_VALUE (parm), | |
3642 | arg, new_args, complain, i, | |
3643 | in_decl); | |
3644 | ||
3645 | if (arg == error_mark_node) | |
8d08fdba | 3646 | lost++; |
8b5b8b7c | 3647 | TREE_VEC_ELT (new_inner_args, i) = arg; |
8d08fdba | 3648 | } |
8b5b8b7c | 3649 | |
8d08fdba MS |
3650 | if (lost) |
3651 | return error_mark_node; | |
8b5b8b7c MM |
3652 | |
3653 | return new_inner_args; | |
8d08fdba MS |
3654 | } |
3655 | ||
34016c81 JM |
3656 | /* Returns 1 if template args OT and NT are equivalent. */ |
3657 | ||
d8e178a0 | 3658 | static int |
3a978d72 | 3659 | template_args_equal (tree ot, tree nt) |
34016c81 JM |
3660 | { |
3661 | if (nt == ot) | |
3662 | return 1; | |
74601d7c | 3663 | |
34016c81 JM |
3664 | if (TREE_CODE (nt) == TREE_VEC) |
3665 | /* For member templates */ | |
74601d7c KL |
3666 | return TREE_CODE (ot) == TREE_VEC && comp_template_args (ot, nt); |
3667 | else if (TYPE_P (nt)) | |
3668 | return TYPE_P (ot) && same_type_p (ot, nt); | |
3669 | else if (TREE_CODE (ot) == TREE_VEC || TYPE_P (ot)) | |
3670 | return 0; | |
34016c81 | 3671 | else |
c8a209ca | 3672 | return cp_tree_equal (ot, nt); |
34016c81 JM |
3673 | } |
3674 | ||
3675 | /* Returns 1 iff the OLDARGS and NEWARGS are in fact identical sets | |
f84b4be9 JM |
3676 | of template arguments. Returns 0 otherwise. */ |
3677 | ||
6757edfe | 3678 | int |
3a978d72 | 3679 | comp_template_args (tree oldargs, tree newargs) |
5566b478 MS |
3680 | { |
3681 | int i; | |
3682 | ||
386b8a85 JM |
3683 | if (TREE_VEC_LENGTH (oldargs) != TREE_VEC_LENGTH (newargs)) |
3684 | return 0; | |
3685 | ||
5566b478 MS |
3686 | for (i = 0; i < TREE_VEC_LENGTH (oldargs); ++i) |
3687 | { | |
3688 | tree nt = TREE_VEC_ELT (newargs, i); | |
3689 | tree ot = TREE_VEC_ELT (oldargs, i); | |
3690 | ||
34016c81 | 3691 | if (! template_args_equal (ot, nt)) |
61a127b3 | 3692 | return 0; |
5566b478 MS |
3693 | } |
3694 | return 1; | |
3695 | } | |
3696 | ||
8d08fdba MS |
3697 | /* Given class template name and parameter list, produce a user-friendly name |
3698 | for the instantiation. */ | |
e92cc029 | 3699 | |
8d08fdba | 3700 | static char * |
3a978d72 | 3701 | mangle_class_name_for_template (const char* name, tree parms, tree arglist) |
8d08fdba MS |
3702 | { |
3703 | static struct obstack scratch_obstack; | |
3704 | static char *scratch_firstobj; | |
3705 | int i, nparms; | |
8d08fdba MS |
3706 | |
3707 | if (!scratch_firstobj) | |
fc378698 | 3708 | gcc_obstack_init (&scratch_obstack); |
8d08fdba MS |
3709 | else |
3710 | obstack_free (&scratch_obstack, scratch_firstobj); | |
fc378698 | 3711 | scratch_firstobj = obstack_alloc (&scratch_obstack, 1); |
8d08fdba | 3712 | |
18e314ad GS |
3713 | #define ccat(C) obstack_1grow (&scratch_obstack, (C)); |
3714 | #define cat(S) obstack_grow (&scratch_obstack, (S), strlen (S)) | |
8d08fdba MS |
3715 | |
3716 | cat (name); | |
3717 | ccat ('<'); | |
3718 | nparms = TREE_VEC_LENGTH (parms); | |
f9a7ae04 | 3719 | arglist = INNERMOST_TEMPLATE_ARGS (arglist); |
8d08fdba MS |
3720 | my_friendly_assert (nparms == TREE_VEC_LENGTH (arglist), 268); |
3721 | for (i = 0; i < nparms; i++) | |
3722 | { | |
a292b002 MS |
3723 | tree parm = TREE_VALUE (TREE_VEC_ELT (parms, i)); |
3724 | tree arg = TREE_VEC_ELT (arglist, i); | |
8d08fdba MS |
3725 | |
3726 | if (i) | |
3727 | ccat (','); | |
3728 | ||
a292b002 | 3729 | if (TREE_CODE (parm) == TYPE_DECL) |
8d08fdba | 3730 | { |
761f0855 | 3731 | cat (type_as_string (arg, TFF_CHASE_TYPEDEF)); |
8d08fdba MS |
3732 | continue; |
3733 | } | |
73b0fce8 KL |
3734 | else if (TREE_CODE (parm) == TEMPLATE_DECL) |
3735 | { | |
3736 | if (TREE_CODE (arg) == TEMPLATE_DECL) | |
2c73f9f5 ML |
3737 | { |
3738 | /* Already substituted with real template. Just output | |
3739 | the template name here */ | |
cb0dbb9a | 3740 | tree context = DECL_CONTEXT (arg); |
ec4f972f AS |
3741 | if (context) |
3742 | { | |
3743 | /* The template may be defined in a namespace, or | |
3744 | may be a member template. */ | |
3745 | my_friendly_assert (TREE_CODE (context) == NAMESPACE_DECL | |
3746 | || CLASS_TYPE_P (context), | |
3747 | 980422); | |
761f0855 | 3748 | cat(decl_as_string (DECL_CONTEXT (arg), TFF_PLAIN_IDENTIFIER)); |
2c73f9f5 ML |
3749 | cat("::"); |
3750 | } | |
3751 | cat (IDENTIFIER_POINTER (DECL_NAME (arg))); | |
3752 | } | |
73b0fce8 KL |
3753 | else |
3754 | /* Output the parameter declaration */ | |
761f0855 | 3755 | cat (type_as_string (arg, TFF_CHASE_TYPEDEF)); |
73b0fce8 KL |
3756 | continue; |
3757 | } | |
8d08fdba MS |
3758 | else |
3759 | my_friendly_assert (TREE_CODE (parm) == PARM_DECL, 269); | |
3760 | ||
8d08fdba MS |
3761 | /* No need to check arglist against parmlist here; we did that |
3762 | in coerce_template_parms, called from lookup_template_class. */ | |
761f0855 | 3763 | cat (expr_as_string (arg, TFF_PLAIN_IDENTIFIER)); |
8d08fdba MS |
3764 | } |
3765 | { | |
3766 | char *bufp = obstack_next_free (&scratch_obstack); | |
3767 | int offset = 0; | |
3768 | while (bufp[offset - 1] == ' ') | |
3769 | offset--; | |
3770 | obstack_blank_fast (&scratch_obstack, offset); | |
3771 | ||
3772 | /* B<C<char> >, not B<C<char>> */ | |
3773 | if (bufp[offset - 1] == '>') | |
3774 | ccat (' '); | |
3775 | } | |
3776 | ccat ('>'); | |
3777 | ccat ('\0'); | |
3778 | return (char *) obstack_base (&scratch_obstack); | |
8d08fdba MS |
3779 | } |
3780 | ||
bd6dd845 | 3781 | static tree |
3a978d72 | 3782 | classtype_mangled_name (tree t) |
5566b478 MS |
3783 | { |
3784 | if (CLASSTYPE_TEMPLATE_INFO (t) | |
36a117a5 MM |
3785 | /* Specializations have already had their names set up in |
3786 | lookup_template_class. */ | |
370af2d5 | 3787 | && !CLASSTYPE_TEMPLATE_SPECIALIZATION (t)) |
9fbf56f7 MM |
3788 | { |
3789 | tree tmpl = most_general_template (CLASSTYPE_TI_TEMPLATE (t)); | |
3790 | ||
36a117a5 MM |
3791 | /* For non-primary templates, the template parameters are |
3792 | implicit from their surrounding context. */ | |
9fbf56f7 MM |
3793 | if (PRIMARY_TEMPLATE_P (tmpl)) |
3794 | { | |
3795 | tree name = DECL_NAME (tmpl); | |
3796 | char *mangled_name = mangle_class_name_for_template | |
3797 | (IDENTIFIER_POINTER (name), | |
3798 | DECL_INNERMOST_TEMPLATE_PARMS (tmpl), | |
3799 | CLASSTYPE_TI_ARGS (t)); | |
3800 | tree id = get_identifier (mangled_name); | |
3801 | IDENTIFIER_TEMPLATE (id) = name; | |
3802 | return id; | |
3803 | } | |
5566b478 | 3804 | } |
9fbf56f7 MM |
3805 | |
3806 | return TYPE_IDENTIFIER (t); | |
5566b478 MS |
3807 | } |
3808 | ||
3809 | static void | |
3a978d72 | 3810 | add_pending_template (tree d) |
5566b478 | 3811 | { |
3ae18eaf JM |
3812 | tree ti = (TYPE_P (d) |
3813 | ? CLASSTYPE_TEMPLATE_INFO (d) | |
3814 | : DECL_TEMPLATE_INFO (d)); | |
46ccf50a | 3815 | tree pt; |
3ae18eaf | 3816 | int level; |
e92cc029 | 3817 | |
824b9a4c | 3818 | if (TI_PENDING_TEMPLATE_FLAG (ti)) |
5566b478 MS |
3819 | return; |
3820 | ||
3ae18eaf JM |
3821 | /* We are called both from instantiate_decl, where we've already had a |
3822 | tinst_level pushed, and instantiate_template, where we haven't. | |
3823 | Compensate. */ | |
3824 | level = !(current_tinst_level && TINST_DECL (current_tinst_level) == d); | |
3825 | ||
3826 | if (level) | |
3827 | push_tinst_level (d); | |
3828 | ||
46ccf50a JM |
3829 | pt = tree_cons (current_tinst_level, d, NULL_TREE); |
3830 | if (last_pending_template) | |
3831 | TREE_CHAIN (last_pending_template) = pt; | |
3832 | else | |
3833 | pending_templates = pt; | |
3834 | ||
3835 | last_pending_template = pt; | |
3836 | ||
824b9a4c | 3837 | TI_PENDING_TEMPLATE_FLAG (ti) = 1; |
3ae18eaf JM |
3838 | |
3839 | if (level) | |
3840 | pop_tinst_level (); | |
5566b478 MS |
3841 | } |
3842 | ||
386b8a85 | 3843 | |
4ba126e4 MM |
3844 | /* Return a TEMPLATE_ID_EXPR corresponding to the indicated FNS and |
3845 | ARGLIST. Valid choices for FNS are given in the cp-tree.def | |
3846 | documentation for TEMPLATE_ID_EXPR. */ | |
386b8a85 JM |
3847 | |
3848 | tree | |
3a978d72 | 3849 | lookup_template_function (tree fns, tree arglist) |
386b8a85 | 3850 | { |
2c73f9f5 | 3851 | tree type; |
050367a3 | 3852 | |
4ba126e4 MM |
3853 | if (fns == error_mark_node || arglist == error_mark_node) |
3854 | return error_mark_node; | |
3855 | ||
bf12d54d | 3856 | my_friendly_assert (!arglist || TREE_CODE (arglist) == TREE_VEC, 20030726); |
ceeae2d1 MM |
3857 | if (fns == NULL_TREE |
3858 | || TREE_CODE (fns) == FUNCTION_DECL) | |
386b8a85 | 3859 | { |
33bd39a2 | 3860 | error ("non-template used as template"); |
386b8a85 JM |
3861 | return error_mark_node; |
3862 | } | |
3863 | ||
4ba126e4 MM |
3864 | my_friendly_assert (TREE_CODE (fns) == TEMPLATE_DECL |
3865 | || TREE_CODE (fns) == OVERLOAD | |
50ad9642 | 3866 | || BASELINK_P (fns) |
10b1d5e7 | 3867 | || TREE_CODE (fns) == IDENTIFIER_NODE, |
4ba126e4 MM |
3868 | 20020730); |
3869 | ||
50ad9642 MM |
3870 | if (BASELINK_P (fns)) |
3871 | { | |
3872 | BASELINK_FUNCTIONS (fns) = build (TEMPLATE_ID_EXPR, | |
3873 | unknown_type_node, | |
3874 | BASELINK_FUNCTIONS (fns), | |
3875 | arglist); | |
3876 | return fns; | |
3877 | } | |
3878 | ||
2c73f9f5 ML |
3879 | type = TREE_TYPE (fns); |
3880 | if (TREE_CODE (fns) == OVERLOAD || !type) | |
3881 | type = unknown_type_node; | |
4ba126e4 MM |
3882 | |
3883 | return build (TEMPLATE_ID_EXPR, type, fns, arglist); | |
386b8a85 JM |
3884 | } |
3885 | ||
a2b60a0e MM |
3886 | /* Within the scope of a template class S<T>, the name S gets bound |
3887 | (in build_self_reference) to a TYPE_DECL for the class, not a | |
3888 | TEMPLATE_DECL. If DECL is a TYPE_DECL for current_class_type, | |
3889 | or one of its enclosing classes, and that type is a template, | |
3890 | return the associated TEMPLATE_DECL. Otherwise, the original | |
3891 | DECL is returned. */ | |
3892 | ||
a723baf1 | 3893 | tree |
3a978d72 | 3894 | maybe_get_template_decl_from_type_decl (tree decl) |
a2b60a0e MM |
3895 | { |
3896 | return (decl != NULL_TREE | |
3897 | && TREE_CODE (decl) == TYPE_DECL | |
3898 | && DECL_ARTIFICIAL (decl) | |
511b60ff | 3899 | && CLASS_TYPE_P (TREE_TYPE (decl)) |
a2b60a0e MM |
3900 | && CLASSTYPE_TEMPLATE_INFO (TREE_TYPE (decl))) |
3901 | ? CLASSTYPE_TI_TEMPLATE (TREE_TYPE (decl)) : decl; | |
3902 | } | |
386b8a85 | 3903 | |
8d08fdba MS |
3904 | /* Given an IDENTIFIER_NODE (type TEMPLATE_DECL) and a chain of |
3905 | parameters, find the desired type. | |
3906 | ||
3907 | D1 is the PTYPENAME terminal, and ARGLIST is the list of arguments. | |
8d08fdba MS |
3908 | |
3909 | IN_DECL, if non-NULL, is the template declaration we are trying to | |
75650646 MM |
3910 | instantiate. |
3911 | ||
838dfd8a | 3912 | If ENTERING_SCOPE is nonzero, we are about to enter the scope of |
36a117a5 | 3913 | the class we are looking up. |
f9c244b8 | 3914 | |
c2ea3a40 | 3915 | Issue error and warning messages under control of COMPLAIN. |
36a117a5 | 3916 | |
75650646 MM |
3917 | If the template class is really a local class in a template |
3918 | function, then the FUNCTION_CONTEXT is the function in which it is | |
3919 | being instantiated. */ | |
e92cc029 | 3920 | |
8d08fdba | 3921 | tree |
3a978d72 NN |
3922 | lookup_template_class (tree d1, |
3923 | tree arglist, | |
3924 | tree in_decl, | |
3925 | tree context, | |
3926 | int entering_scope, | |
3927 | tsubst_flags_t complain) | |
8d08fdba | 3928 | { |
a703fb38 | 3929 | tree template = NULL_TREE, parmlist; |
dbfe2124 | 3930 | tree t; |
42eaed49 | 3931 | |
fd295cb2 | 3932 | timevar_push (TV_NAME_LOOKUP); |
42eaed49 | 3933 | |
5566b478 MS |
3934 | if (TREE_CODE (d1) == IDENTIFIER_NODE) |
3935 | { | |
f181d4ae MM |
3936 | if (IDENTIFIER_VALUE (d1) |
3937 | && DECL_TEMPLATE_TEMPLATE_PARM_P (IDENTIFIER_VALUE (d1))) | |
3938 | template = IDENTIFIER_VALUE (d1); | |
73b0fce8 KL |
3939 | else |
3940 | { | |
2c73f9f5 ML |
3941 | if (context) |
3942 | push_decl_namespace (context); | |
3ebc5c52 MM |
3943 | template = lookup_name (d1, /*prefer_type=*/0); |
3944 | template = maybe_get_template_decl_from_type_decl (template); | |
2c73f9f5 ML |
3945 | if (context) |
3946 | pop_decl_namespace (); | |
73b0fce8 | 3947 | } |
8d019cef JM |
3948 | if (template) |
3949 | context = DECL_CONTEXT (template); | |
5566b478 | 3950 | } |
c91a56d2 MS |
3951 | else if (TREE_CODE (d1) == TYPE_DECL && IS_AGGR_TYPE (TREE_TYPE (d1))) |
3952 | { | |
802dbc34 JM |
3953 | tree type = TREE_TYPE (d1); |
3954 | ||
3955 | /* If we are declaring a constructor, say A<T>::A<T>, we will get | |
3956 | an implicit typename for the second A. Deal with it. */ | |
3957 | if (TREE_CODE (type) == TYPENAME_TYPE && TREE_TYPE (type)) | |
3958 | type = TREE_TYPE (type); | |
3959 | ||
3960 | if (CLASSTYPE_TEMPLATE_INFO (type)) | |
f3400fe2 | 3961 | { |
802dbc34 | 3962 | template = CLASSTYPE_TI_TEMPLATE (type); |
f3400fe2 JM |
3963 | d1 = DECL_NAME (template); |
3964 | } | |
c91a56d2 | 3965 | } |
ed44da02 | 3966 | else if (TREE_CODE (d1) == ENUMERAL_TYPE |
2f939d94 | 3967 | || (TYPE_P (d1) && IS_AGGR_TYPE (d1))) |
5566b478 | 3968 | { |
ed44da02 | 3969 | template = TYPE_TI_TEMPLATE (d1); |
5566b478 MS |
3970 | d1 = DECL_NAME (template); |
3971 | } | |
93cdc044 | 3972 | else if (TREE_CODE (d1) == TEMPLATE_DECL |
17aec3eb | 3973 | && TREE_CODE (DECL_TEMPLATE_RESULT (d1)) == TYPE_DECL) |
93cdc044 JM |
3974 | { |
3975 | template = d1; | |
3976 | d1 = DECL_NAME (template); | |
3977 | context = DECL_CONTEXT (template); | |
3978 | } | |
8d08fdba | 3979 | |
8d08fdba | 3980 | /* With something like `template <class T> class X class X { ... };' |
f181d4ae MM |
3981 | we could end up with D1 having nothing but an IDENTIFIER_VALUE. |
3982 | We don't want to do that, but we have to deal with the situation, | |
3983 | so let's give them some syntax errors to chew on instead of a | |
1bc0793e | 3984 | crash. Alternatively D1 might not be a template type at all. */ |
8d08fdba | 3985 | if (! template) |
f3400fe2 | 3986 | { |
c2ea3a40 | 3987 | if (complain & tf_error) |
33bd39a2 | 3988 | error ("`%T' is not a template", d1); |
fd295cb2 | 3989 | POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, error_mark_node); |
f3400fe2 | 3990 | } |
2c73f9f5 | 3991 | |
a87b4257 | 3992 | if (TREE_CODE (template) != TEMPLATE_DECL |
42eaed49 NS |
3993 | /* Make sure it's a user visible template, if it was named by |
3994 | the user. */ | |
3995 | || ((complain & tf_user) && !DECL_TEMPLATE_PARM_P (template) | |
3996 | && !PRIMARY_TEMPLATE_P (template))) | |
8d08fdba | 3997 | { |
c2ea3a40 | 3998 | if (complain & tf_error) |
f9c244b8 | 3999 | { |
33bd39a2 | 4000 | error ("non-template type `%T' used as a template", d1); |
f9c244b8 NS |
4001 | if (in_decl) |
4002 | cp_error_at ("for template declaration `%D'", in_decl); | |
4003 | } | |
fd295cb2 | 4004 | POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, error_mark_node); |
8d08fdba | 4005 | } |
8d08fdba | 4006 | |
42eaed49 NS |
4007 | complain &= ~tf_user; |
4008 | ||
73b0fce8 KL |
4009 | if (DECL_TEMPLATE_TEMPLATE_PARM_P (template)) |
4010 | { | |
4011 | /* Create a new TEMPLATE_DECL and TEMPLATE_TEMPLATE_PARM node to store | |
4012 | template arguments */ | |
4013 | ||
1899c3a4 | 4014 | tree parm; |
73b0fce8 KL |
4015 | tree arglist2; |
4016 | ||
73b0fce8 KL |
4017 | parmlist = DECL_INNERMOST_TEMPLATE_PARMS (template); |
4018 | ||
4f96ff63 KL |
4019 | /* Consider an example where a template template parameter declared as |
4020 | ||
4021 | template <class T, class U = std::allocator<T> > class TT | |
4022 | ||
4023 | The template parameter level of T and U are one level larger than | |
4024 | of TT. To proper process the default argument of U, say when an | |
4025 | instantiation `TT<int>' is seen, we need to build the full | |
342cea95 KL |
4026 | arguments containing {int} as the innermost level. Outer levels, |
4027 | available when not appearing as default template argument, can be | |
4028 | obtained from `current_template_args ()'. | |
4f96ff63 | 4029 | |
342cea95 KL |
4030 | Suppose that TT is later substituted with std::vector. The above |
4031 | instantiation is `TT<int, std::allocator<T> >' with TT at | |
4032 | level 1, and T at level 2, while the template arguments at level 1 | |
4033 | becomes {std::vector} and the inner level 2 is {int}. */ | |
4034 | ||
4035 | if (current_template_parms) | |
4f96ff63 KL |
4036 | arglist = add_to_template_args (current_template_args (), arglist); |
4037 | ||
f9c244b8 NS |
4038 | arglist2 = coerce_template_parms (parmlist, arglist, template, |
4039 | complain, /*require_all_args=*/1); | |
3e4a3562 | 4040 | if (arglist2 == error_mark_node |
544aef8c | 4041 | || (!uses_template_parms (arglist2) |
3e4a3562 | 4042 | && check_instantiated_args (template, arglist2, complain))) |
fd295cb2 | 4043 | POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, error_mark_node); |
73b0fce8 | 4044 | |
dac65501 | 4045 | parm = bind_template_template_parm (TREE_TYPE (template), arglist2); |
fd295cb2 | 4046 | POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, parm); |
73b0fce8 | 4047 | } |
36a117a5 | 4048 | else |
8d08fdba | 4049 | { |
36a117a5 | 4050 | tree template_type = TREE_TYPE (template); |
7ac7b28f | 4051 | tree gen_tmpl; |
36a117a5 MM |
4052 | tree type_decl; |
4053 | tree found = NULL_TREE; | |
414ea4aa | 4054 | tree *tp; |
36a117a5 MM |
4055 | int arg_depth; |
4056 | int parm_depth; | |
dbfe2124 | 4057 | int is_partial_instantiation; |
830bfa74 | 4058 | |
7ac7b28f MM |
4059 | gen_tmpl = most_general_template (template); |
4060 | parmlist = DECL_TEMPLATE_PARMS (gen_tmpl); | |
36a117a5 MM |
4061 | parm_depth = TMPL_PARMS_DEPTH (parmlist); |
4062 | arg_depth = TMPL_ARGS_DEPTH (arglist); | |
4063 | ||
4064 | if (arg_depth == 1 && parm_depth > 1) | |
4065 | { | |
39c01e4c | 4066 | /* We've been given an incomplete set of template arguments. |
36a117a5 MM |
4067 | For example, given: |
4068 | ||
4069 | template <class T> struct S1 { | |
4070 | template <class U> struct S2 {}; | |
4071 | template <class U> struct S2<U*> {}; | |
4072 | }; | |
4073 | ||
4074 | we will be called with an ARGLIST of `U*', but the | |
4075 | TEMPLATE will be `template <class T> template | |
4076 | <class U> struct S1<T>::S2'. We must fill in the missing | |
4077 | arguments. */ | |
7ac7b28f MM |
4078 | arglist |
4079 | = add_outermost_template_args (TYPE_TI_ARGS (TREE_TYPE (template)), | |
4080 | arglist); | |
36a117a5 MM |
4081 | arg_depth = TMPL_ARGS_DEPTH (arglist); |
4082 | } | |
5566b478 | 4083 | |
41f5d4b1 | 4084 | /* Now we should have enough arguments. */ |
36a117a5 MM |
4085 | my_friendly_assert (parm_depth == arg_depth, 0); |
4086 | ||
7ac7b28f MM |
4087 | /* From here on, we're only interested in the most general |
4088 | template. */ | |
4089 | template = gen_tmpl; | |
4090 | ||
36a117a5 MM |
4091 | /* Calculate the BOUND_ARGS. These will be the args that are |
4092 | actually tsubst'd into the definition to create the | |
4093 | instantiation. */ | |
4094 | if (parm_depth > 1) | |
830bfa74 MM |
4095 | { |
4096 | /* We have multiple levels of arguments to coerce, at once. */ | |
830bfa74 | 4097 | int i; |
e4a84209 | 4098 | int saved_depth = TMPL_ARGS_DEPTH (arglist); |
36a117a5 | 4099 | |
f31c0a32 | 4100 | tree bound_args = make_tree_vec (parm_depth); |
830bfa74 | 4101 | |
e4a84209 | 4102 | for (i = saved_depth, |
830bfa74 | 4103 | t = DECL_TEMPLATE_PARMS (template); |
e4a84209 | 4104 | i > 0 && t != NULL_TREE; |
830bfa74 | 4105 | --i, t = TREE_CHAIN (t)) |
e4a84209 | 4106 | { |
ee3071ef NS |
4107 | tree a = coerce_template_parms (TREE_VALUE (t), |
4108 | arglist, template, | |
4109 | complain, /*require_all_args=*/1); | |
88e98cfe KL |
4110 | |
4111 | /* Don't process further if one of the levels fails. */ | |
4112 | if (a == error_mark_node) | |
4113 | { | |
4114 | /* Restore the ARGLIST to its full size. */ | |
4115 | TREE_VEC_LENGTH (arglist) = saved_depth; | |
4116 | POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, error_mark_node); | |
4117 | } | |
4118 | ||
e4a84209 MM |
4119 | SET_TMPL_ARGS_LEVEL (bound_args, i, a); |
4120 | ||
4121 | /* We temporarily reduce the length of the ARGLIST so | |
4122 | that coerce_template_parms will see only the arguments | |
4123 | corresponding to the template parameters it is | |
4124 | examining. */ | |
4125 | TREE_VEC_LENGTH (arglist)--; | |
4126 | } | |
4127 | ||
4128 | /* Restore the ARGLIST to its full size. */ | |
4129 | TREE_VEC_LENGTH (arglist) = saved_depth; | |
4130 | ||
36a117a5 | 4131 | arglist = bound_args; |
830bfa74 MM |
4132 | } |
4133 | else | |
36a117a5 MM |
4134 | arglist |
4135 | = coerce_template_parms (INNERMOST_TEMPLATE_PARMS (parmlist), | |
f9a7ae04 | 4136 | INNERMOST_TEMPLATE_ARGS (arglist), |
f9c244b8 NS |
4137 | template, |
4138 | complain, /*require_all_args=*/1); | |
36a117a5 | 4139 | |
3e4a3562 | 4140 | if (arglist == error_mark_node |
544aef8c | 4141 | || (!uses_template_parms (INNERMOST_TEMPLATE_ARGS (arglist)) |
3e4a3562 NS |
4142 | && check_instantiated_args (template, |
4143 | INNERMOST_TEMPLATE_ARGS (arglist), | |
4144 | complain))) | |
36a117a5 | 4145 | /* We were unable to bind the arguments. */ |
fd295cb2 | 4146 | POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, error_mark_node); |
5566b478 | 4147 | |
36a117a5 MM |
4148 | /* In the scope of a template class, explicit references to the |
4149 | template class refer to the type of the template, not any | |
4150 | instantiation of it. For example, in: | |
4151 | ||
4152 | template <class T> class C { void f(C<T>); } | |
4153 | ||
4154 | the `C<T>' is just the same as `C'. Outside of the | |
4155 | class, however, such a reference is an instantiation. */ | |
ed44da02 | 4156 | if (comp_template_args (TYPE_TI_ARGS (template_type), |
36a117a5 MM |
4157 | arglist)) |
4158 | { | |
4159 | found = template_type; | |
4160 | ||
4161 | if (!entering_scope && PRIMARY_TEMPLATE_P (template)) | |
5566b478 | 4162 | { |
36a117a5 MM |
4163 | tree ctx; |
4164 | ||
36a117a5 MM |
4165 | for (ctx = current_class_type; |
4166 | ctx; | |
6df5158a NS |
4167 | ctx = TYPE_CONTEXT (ctx)) |
4168 | { | |
4169 | if (TREE_CODE (ctx) == NAMESPACE_DECL) | |
4170 | break; | |
4171 | if (same_type_p (ctx, template_type)) | |
4172 | goto found_ctx; | |
4173 | } | |
36a117a5 | 4174 | |
6df5158a NS |
4175 | /* We're not in the scope of the class, so the |
4176 | TEMPLATE_TYPE is not the type we want after all. */ | |
4177 | found = NULL_TREE; | |
4178 | found_ctx:; | |
5566b478 MS |
4179 | } |
4180 | } | |
36a117a5 | 4181 | if (found) |
fd295cb2 | 4182 | POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, found); |
414ea4aa MM |
4183 | |
4184 | for (tp = &DECL_TEMPLATE_INSTANTIATIONS (template); | |
4185 | *tp; | |
4186 | tp = &TREE_CHAIN (*tp)) | |
4187 | if (comp_template_args (TREE_PURPOSE (*tp), arglist)) | |
4188 | { | |
4189 | found = *tp; | |
7e7d9517 MM |
4190 | |
4191 | /* Use the move-to-front heuristic to speed up future | |
4192 | searches. */ | |
414ea4aa MM |
4193 | *tp = TREE_CHAIN (*tp); |
4194 | TREE_CHAIN (found) | |
4195 | = DECL_TEMPLATE_INSTANTIATIONS (template); | |
4196 | DECL_TEMPLATE_INSTANTIATIONS (template) = found; | |
7e7d9517 | 4197 | |
fd295cb2 | 4198 | POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, TREE_VALUE (found)); |
414ea4aa | 4199 | } |
5566b478 | 4200 | |
dbfe2124 | 4201 | /* This type is a "partial instantiation" if any of the template |
ab097535 | 4202 | arguments still involve template parameters. Note that we set |
486e4077 MM |
4203 | IS_PARTIAL_INSTANTIATION for partial specializations as |
4204 | well. */ | |
dbfe2124 MM |
4205 | is_partial_instantiation = uses_template_parms (arglist); |
4206 | ||
3ebc5c52 MM |
4207 | if (!is_partial_instantiation |
4208 | && !PRIMARY_TEMPLATE_P (template) | |
4209 | && TREE_CODE (CP_DECL_CONTEXT (template)) == NAMESPACE_DECL) | |
4210 | { | |
3ebc5c52 MM |
4211 | found = xref_tag_from_type (TREE_TYPE (template), |
4212 | DECL_NAME (template), | |
4213 | /*globalize=*/1); | |
fd295cb2 | 4214 | POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, found); |
3ebc5c52 | 4215 | } |
3ebc5c52 | 4216 | |
95ee998c | 4217 | context = tsubst (DECL_CONTEXT (template), arglist, |
c2ea3a40 | 4218 | complain, in_decl); |
95ee998c MM |
4219 | if (!context) |
4220 | context = global_namespace; | |
4221 | ||
36a117a5 | 4222 | /* Create the type. */ |
ed44da02 MM |
4223 | if (TREE_CODE (template_type) == ENUMERAL_TYPE) |
4224 | { | |
dbfe2124 | 4225 | if (!is_partial_instantiation) |
92777ce4 NS |
4226 | { |
4227 | set_current_access_from_decl (TYPE_NAME (template_type)); | |
4228 | t = start_enum (TYPE_IDENTIFIER (template_type)); | |
4229 | } | |
ed44da02 | 4230 | else |
dbfe2124 | 4231 | /* We don't want to call start_enum for this type, since |
ed44da02 MM |
4232 | the values for the enumeration constants may involve |
4233 | template parameters. And, no one should be interested | |
4234 | in the enumeration constants for such a type. */ | |
4235 | t = make_node (ENUMERAL_TYPE); | |
4236 | } | |
4237 | else | |
4238 | { | |
33848bb0 | 4239 | t = make_aggr_type (TREE_CODE (template_type)); |
ed44da02 MM |
4240 | CLASSTYPE_DECLARED_CLASS (t) |
4241 | = CLASSTYPE_DECLARED_CLASS (template_type); | |
ed44da02 | 4242 | SET_CLASSTYPE_IMPLICIT_INSTANTIATION (t); |
f668f160 | 4243 | TYPE_FOR_JAVA (t) = TYPE_FOR_JAVA (template_type); |
ae673f14 JM |
4244 | |
4245 | /* A local class. Make sure the decl gets registered properly. */ | |
4246 | if (context == current_function_decl) | |
4247 | pushtag (DECL_NAME (template), t, 0); | |
ed44da02 MM |
4248 | } |
4249 | ||
ae673f14 JM |
4250 | /* If we called start_enum or pushtag above, this information |
4251 | will already be set up. */ | |
ed44da02 MM |
4252 | if (!TYPE_NAME (t)) |
4253 | { | |
4254 | TYPE_CONTEXT (t) = FROB_CONTEXT (context); | |
36a117a5 | 4255 | |
9188c363 | 4256 | type_decl = create_implicit_typedef (DECL_NAME (template), t); |
ed44da02 | 4257 | DECL_CONTEXT (type_decl) = TYPE_CONTEXT (t); |
9188c363 | 4258 | TYPE_STUB_DECL (t) = type_decl; |
f31686a3 RH |
4259 | DECL_SOURCE_LOCATION (type_decl) |
4260 | = DECL_SOURCE_LOCATION (TYPE_STUB_DECL (template_type)); | |
ed44da02 MM |
4261 | } |
4262 | else | |
4263 | type_decl = TYPE_NAME (t); | |
36a117a5 | 4264 | |
cab7a9a3 KL |
4265 | TREE_PRIVATE (type_decl) |
4266 | = TREE_PRIVATE (TYPE_STUB_DECL (template_type)); | |
4267 | TREE_PROTECTED (type_decl) | |
4268 | = TREE_PROTECTED (TYPE_STUB_DECL (template_type)); | |
4269 | ||
9fbf56f7 MM |
4270 | /* Set up the template information. We have to figure out which |
4271 | template is the immediate parent if this is a full | |
4272 | instantiation. */ | |
4273 | if (parm_depth == 1 || is_partial_instantiation | |
4274 | || !PRIMARY_TEMPLATE_P (template)) | |
4275 | /* This case is easy; there are no member templates involved. */ | |
4276 | found = template; | |
4277 | else | |
4278 | { | |
ab097535 NS |
4279 | /* This is a full instantiation of a member template. Look |
4280 | for a partial instantiation of which this is an instance. */ | |
9fbf56f7 MM |
4281 | |
4282 | for (found = DECL_TEMPLATE_INSTANTIATIONS (template); | |
4283 | found; found = TREE_CHAIN (found)) | |
4284 | { | |
4285 | int success; | |
4286 | tree tmpl = CLASSTYPE_TI_TEMPLATE (TREE_VALUE (found)); | |
4287 | ||
4288 | /* We only want partial instantiations, here, not | |
4289 | specializations or full instantiations. */ | |
370af2d5 | 4290 | if (CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_VALUE (found)) |
9fbf56f7 MM |
4291 | || !uses_template_parms (TREE_VALUE (found))) |
4292 | continue; | |
4293 | ||
4294 | /* Temporarily reduce by one the number of levels in the | |
4295 | ARGLIST and in FOUND so as to avoid comparing the | |
4296 | last set of arguments. */ | |
4297 | TREE_VEC_LENGTH (arglist)--; | |
4298 | TREE_VEC_LENGTH (TREE_PURPOSE (found)) --; | |
4299 | ||
4300 | /* See if the arguments match. If they do, then TMPL is | |
4301 | the partial instantiation we want. */ | |
4302 | success = comp_template_args (TREE_PURPOSE (found), arglist); | |
4303 | ||
4304 | /* Restore the argument vectors to their full size. */ | |
4305 | TREE_VEC_LENGTH (arglist)++; | |
4306 | TREE_VEC_LENGTH (TREE_PURPOSE (found))++; | |
4307 | ||
4308 | if (success) | |
4309 | { | |
4310 | found = tmpl; | |
4311 | break; | |
4312 | } | |
4313 | } | |
4314 | ||
4315 | if (!found) | |
ab097535 NS |
4316 | { |
4317 | /* There was no partial instantiation. This happens | |
4318 | where C<T> is a member template of A<T> and it's used | |
4319 | in something like | |
4320 | ||
4321 | template <typename T> struct B { A<T>::C<int> m; }; | |
4322 | B<float>; | |
4323 | ||
4324 | Create the partial instantiation. | |
4325 | */ | |
4326 | TREE_VEC_LENGTH (arglist)--; | |
c2ea3a40 | 4327 | found = tsubst (template, arglist, complain, NULL_TREE); |
ab097535 | 4328 | TREE_VEC_LENGTH (arglist)++; |
ab097535 | 4329 | } |
9fbf56f7 MM |
4330 | } |
4331 | ||
ab097535 | 4332 | SET_TYPE_TEMPLATE_INFO (t, tree_cons (found, arglist, NULL_TREE)); |
dbfe2124 MM |
4333 | DECL_TEMPLATE_INSTANTIATIONS (template) |
4334 | = tree_cons (arglist, t, | |
4335 | DECL_TEMPLATE_INSTANTIATIONS (template)); | |
4336 | ||
4337 | if (TREE_CODE (t) == ENUMERAL_TYPE | |
4338 | && !is_partial_instantiation) | |
61a127b3 MM |
4339 | /* Now that the type has been registered on the instantiations |
4340 | list, we set up the enumerators. Because the enumeration | |
4341 | constants may involve the enumeration type itself, we make | |
4342 | sure to register the type first, and then create the | |
4343 | constants. That way, doing tsubst_expr for the enumeration | |
4344 | constants won't result in recursive calls here; we'll find | |
4345 | the instantiation and exit above. */ | |
4346 | tsubst_enum (template_type, t, arglist); | |
dbfe2124 | 4347 | |
36a117a5 MM |
4348 | /* Reset the name of the type, now that CLASSTYPE_TEMPLATE_INFO |
4349 | is set up. */ | |
ed44da02 MM |
4350 | if (TREE_CODE (t) != ENUMERAL_TYPE) |
4351 | DECL_NAME (type_decl) = classtype_mangled_name (t); | |
dbfe2124 | 4352 | if (!is_partial_instantiation) |
36a117a5 | 4353 | { |
50a6dbd7 JM |
4354 | /* For backwards compatibility; code that uses |
4355 | -fexternal-templates expects looking up a template to | |
4356 | instantiate it. I think DDD still relies on this. | |
4357 | (jason 8/20/1998) */ | |
ed44da02 MM |
4358 | if (TREE_CODE (t) != ENUMERAL_TYPE |
4359 | && flag_external_templates | |
36a117a5 MM |
4360 | && CLASSTYPE_INTERFACE_KNOWN (TREE_TYPE (template)) |
4361 | && ! CLASSTYPE_INTERFACE_ONLY (TREE_TYPE (template))) | |
4362 | add_pending_template (t); | |
4363 | } | |
4364 | else | |
077e7015 MM |
4365 | /* If the type makes use of template parameters, the |
4366 | code that generates debugging information will crash. */ | |
4367 | DECL_IGNORED_P (TYPE_STUB_DECL (t)) = 1; | |
8d08fdba | 4368 | |
fd295cb2 | 4369 | POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, t); |
36a117a5 | 4370 | } |
fd295cb2 | 4371 | timevar_pop (TV_NAME_LOOKUP); |
8d08fdba MS |
4372 | } |
4373 | \f | |
8dfaeb63 | 4374 | struct pair_fn_data |
8d08fdba | 4375 | { |
8dfaeb63 MM |
4376 | tree_fn_t fn; |
4377 | void *data; | |
4f2c9d7e | 4378 | htab_t visited; |
8dfaeb63 MM |
4379 | }; |
4380 | ||
4381 | /* Called from for_each_template_parm via walk_tree. */ | |
581d38d0 | 4382 | |
8dfaeb63 | 4383 | static tree |
3a978d72 | 4384 | for_each_template_parm_r (tree* tp, int* walk_subtrees, void* d) |
8dfaeb63 MM |
4385 | { |
4386 | tree t = *tp; | |
4387 | struct pair_fn_data *pfd = (struct pair_fn_data *) d; | |
4388 | tree_fn_t fn = pfd->fn; | |
4389 | void *data = pfd->data; | |
4f2c9d7e MM |
4390 | void **slot; |
4391 | ||
4392 | /* If we have already visited this tree, there's no need to walk | |
4393 | subtrees. Otherwise, add it to the visited table. */ | |
4394 | slot = htab_find_slot (pfd->visited, *tp, INSERT); | |
4395 | if (*slot) | |
4396 | { | |
4397 | *walk_subtrees = 0; | |
4398 | return NULL_TREE; | |
4399 | } | |
4400 | *slot = *tp; | |
4401 | ||
2f939d94 | 4402 | if (TYPE_P (t) |
4f2c9d7e | 4403 | && for_each_template_parm (TYPE_CONTEXT (t), fn, data, pfd->visited)) |
8dfaeb63 | 4404 | return error_mark_node; |
581d38d0 | 4405 | |
8d08fdba MS |
4406 | switch (TREE_CODE (t)) |
4407 | { | |
8d08fdba | 4408 | case RECORD_TYPE: |
9076e292 | 4409 | if (TYPE_PTRMEMFUNC_P (t)) |
8dfaeb63 | 4410 | break; |
ed44da02 MM |
4411 | /* Fall through. */ |
4412 | ||
8d08fdba | 4413 | case UNION_TYPE: |
ed44da02 | 4414 | case ENUMERAL_TYPE: |
8dfaeb63 MM |
4415 | if (!TYPE_TEMPLATE_INFO (t)) |
4416 | *walk_subtrees = 0; | |
4417 | else if (for_each_template_parm (TREE_VALUE (TYPE_TEMPLATE_INFO (t)), | |
4f2c9d7e | 4418 | fn, data, pfd->visited)) |
8dfaeb63 MM |
4419 | return error_mark_node; |
4420 | break; | |
4421 | ||
588c2d1c | 4422 | case METHOD_TYPE: |
8dfaeb63 MM |
4423 | /* Since we're not going to walk subtrees, we have to do this |
4424 | explicitly here. */ | |
4f2c9d7e MM |
4425 | if (for_each_template_parm (TYPE_METHOD_BASETYPE (t), fn, data, |
4426 | pfd->visited)) | |
8dfaeb63 | 4427 | return error_mark_node; |
4890c2f4 | 4428 | /* Fall through. */ |
588c2d1c MM |
4429 | |
4430 | case FUNCTION_TYPE: | |
8dfaeb63 | 4431 | /* Check the return type. */ |
4f2c9d7e | 4432 | if (for_each_template_parm (TREE_TYPE (t), fn, data, pfd->visited)) |
8dfaeb63 MM |
4433 | return error_mark_node; |
4434 | ||
588c2d1c MM |
4435 | /* Check the parameter types. Since default arguments are not |
4436 | instantiated until they are needed, the TYPE_ARG_TYPES may | |
4437 | contain expressions that involve template parameters. But, | |
4438 | no-one should be looking at them yet. And, once they're | |
4439 | instantiated, they don't contain template parameters, so | |
4440 | there's no point in looking at them then, either. */ | |
4441 | { | |
4442 | tree parm; | |
4443 | ||
4444 | for (parm = TYPE_ARG_TYPES (t); parm; parm = TREE_CHAIN (parm)) | |
4f2c9d7e MM |
4445 | if (for_each_template_parm (TREE_VALUE (parm), fn, data, |
4446 | pfd->visited)) | |
8dfaeb63 | 4447 | return error_mark_node; |
5566b478 | 4448 | |
8dfaeb63 MM |
4449 | /* Since we've already handled the TYPE_ARG_TYPES, we don't |
4450 | want walk_tree walking into them itself. */ | |
4451 | *walk_subtrees = 0; | |
4452 | } | |
4453 | break; | |
3ac3d9ea | 4454 | |
a723baf1 MM |
4455 | case TYPEOF_TYPE: |
4456 | if (for_each_template_parm (TYPE_FIELDS (t), fn, data, | |
4457 | pfd->visited)) | |
4458 | return error_mark_node; | |
4459 | break; | |
4460 | ||
8d08fdba | 4461 | case FUNCTION_DECL: |
5566b478 | 4462 | case VAR_DECL: |
5566b478 | 4463 | if (DECL_LANG_SPECIFIC (t) && DECL_TEMPLATE_INFO (t) |
4f2c9d7e MM |
4464 | && for_each_template_parm (DECL_TI_ARGS (t), fn, data, |
4465 | pfd->visited)) | |
8dfaeb63 MM |
4466 | return error_mark_node; |
4467 | /* Fall through. */ | |
4468 | ||
8d08fdba | 4469 | case PARM_DECL: |
a723baf1 MM |
4470 | case CONST_DECL: |
4471 | if (TREE_CODE (t) == CONST_DECL && DECL_TEMPLATE_PARM_P (t) | |
4472 | && for_each_template_parm (DECL_INITIAL (t), fn, data, | |
4473 | pfd->visited)) | |
4474 | return error_mark_node; | |
050367a3 | 4475 | if (DECL_CONTEXT (t) |
4f2c9d7e MM |
4476 | && for_each_template_parm (DECL_CONTEXT (t), fn, data, |
4477 | pfd->visited)) | |
8dfaeb63 MM |
4478 | return error_mark_node; |
4479 | break; | |
8d08fdba | 4480 | |
a1281f45 | 4481 | case BOUND_TEMPLATE_TEMPLATE_PARM: |
744fac59 | 4482 | /* Record template parameters such as `T' inside `TT<T>'. */ |
4f2c9d7e | 4483 | if (for_each_template_parm (TYPE_TI_ARGS (t), fn, data, pfd->visited)) |
8dfaeb63 MM |
4484 | return error_mark_node; |
4485 | /* Fall through. */ | |
4486 | ||
a1281f45 | 4487 | case TEMPLATE_TEMPLATE_PARM: |
744fac59 | 4488 | case TEMPLATE_TYPE_PARM: |
f84b4be9 | 4489 | case TEMPLATE_PARM_INDEX: |
8dfaeb63 MM |
4490 | if (fn && (*fn)(t, data)) |
4491 | return error_mark_node; | |
4492 | else if (!fn) | |
4493 | return error_mark_node; | |
4494 | break; | |
5156628f | 4495 | |
8dfaeb63 MM |
4496 | case TEMPLATE_DECL: |
4497 | /* A template template parameter is encountered */ | |
4498 | if (DECL_TEMPLATE_TEMPLATE_PARM_P (t) | |
4f2c9d7e | 4499 | && for_each_template_parm (TREE_TYPE (t), fn, data, pfd->visited)) |
8dfaeb63 | 4500 | return error_mark_node; |
db5ae43f | 4501 | |
8dfaeb63 MM |
4502 | /* Already substituted template template parameter */ |
4503 | *walk_subtrees = 0; | |
4504 | break; | |
b8865407 | 4505 | |
4699c561 | 4506 | case TYPENAME_TYPE: |
4f2c9d7e MM |
4507 | if (!fn |
4508 | || for_each_template_parm (TYPENAME_TYPE_FULLNAME (t), fn, | |
4509 | data, pfd->visited)) | |
8dfaeb63 MM |
4510 | return error_mark_node; |
4511 | break; | |
4699c561 | 4512 | |
8dfaeb63 MM |
4513 | case CONSTRUCTOR: |
4514 | if (TREE_TYPE (t) && TYPE_PTRMEMFUNC_P (TREE_TYPE (t)) | |
4515 | && for_each_template_parm (TYPE_PTRMEMFUNC_FN_TYPE | |
4f2c9d7e MM |
4516 | (TREE_TYPE (t)), fn, data, |
4517 | pfd->visited)) | |
8dfaeb63 MM |
4518 | return error_mark_node; |
4519 | break; | |
4520 | ||
b8865407 MM |
4521 | case INDIRECT_REF: |
4522 | case COMPONENT_REF: | |
4699c561 | 4523 | /* If there's no type, then this thing must be some expression |
b8865407 | 4524 | involving template parameters. */ |
4699c561 | 4525 | if (!fn && !TREE_TYPE (t)) |
8dfaeb63 MM |
4526 | return error_mark_node; |
4527 | break; | |
b8865407 | 4528 | |
42976354 BK |
4529 | case MODOP_EXPR: |
4530 | case CAST_EXPR: | |
4531 | case REINTERPRET_CAST_EXPR: | |
4532 | case CONST_CAST_EXPR: | |
4533 | case STATIC_CAST_EXPR: | |
4534 | case DYNAMIC_CAST_EXPR: | |
42976354 BK |
4535 | case ARROW_EXPR: |
4536 | case DOTSTAR_EXPR: | |
4537 | case TYPEID_EXPR: | |
40242ccf | 4538 | case PSEUDO_DTOR_EXPR: |
b8865407 | 4539 | if (!fn) |
8dfaeb63 MM |
4540 | return error_mark_node; |
4541 | break; | |
abff8e06 | 4542 | |
bd9bb3d2 MM |
4543 | case BASELINK: |
4544 | /* If we do not handle this case specially, we end up walking | |
4545 | the BINFO hierarchy, which is circular, and therefore | |
4546 | confuses walk_tree. */ | |
4547 | *walk_subtrees = 0; | |
4f2c9d7e MM |
4548 | if (for_each_template_parm (BASELINK_FUNCTIONS (*tp), fn, data, |
4549 | pfd->visited)) | |
bd9bb3d2 MM |
4550 | return error_mark_node; |
4551 | break; | |
4552 | ||
8d08fdba | 4553 | default: |
8dfaeb63 | 4554 | break; |
8d08fdba | 4555 | } |
8dfaeb63 MM |
4556 | |
4557 | /* We didn't find any template parameters we liked. */ | |
4558 | return NULL_TREE; | |
4559 | } | |
4560 | ||
a1281f45 KL |
4561 | /* For each TEMPLATE_TYPE_PARM, TEMPLATE_TEMPLATE_PARM, |
4562 | BOUND_TEMPLATE_TEMPLATE_PARM or TEMPLATE_PARM_INDEX in T, | |
4563 | call FN with the parameter and the DATA. | |
838dfd8a | 4564 | If FN returns nonzero, the iteration is terminated, and |
8dfaeb63 | 4565 | for_each_template_parm returns 1. Otherwise, the iteration |
838dfd8a | 4566 | continues. If FN never returns a nonzero value, the value |
8dfaeb63 MM |
4567 | returned by for_each_template_parm is 0. If FN is NULL, it is |
4568 | considered to be the function which always returns 1. */ | |
4569 | ||
4570 | static int | |
3a978d72 | 4571 | for_each_template_parm (tree t, tree_fn_t fn, void* data, htab_t visited) |
8dfaeb63 MM |
4572 | { |
4573 | struct pair_fn_data pfd; | |
ad2ae3b2 | 4574 | int result; |
8dfaeb63 MM |
4575 | |
4576 | /* Set up. */ | |
4577 | pfd.fn = fn; | |
4578 | pfd.data = data; | |
4579 | ||
4890c2f4 MM |
4580 | /* Walk the tree. (Conceptually, we would like to walk without |
4581 | duplicates, but for_each_template_parm_r recursively calls | |
4582 | for_each_template_parm, so we would need to reorganize a fair | |
4f2c9d7e MM |
4583 | bit to use walk_tree_without_duplicates, so we keep our own |
4584 | visited list.) */ | |
4585 | if (visited) | |
4586 | pfd.visited = visited; | |
4587 | else | |
4588 | pfd.visited = htab_create (37, htab_hash_pointer, htab_eq_pointer, | |
4589 | NULL); | |
ad2ae3b2 MM |
4590 | result = walk_tree (&t, |
4591 | for_each_template_parm_r, | |
4592 | &pfd, | |
4593 | NULL) != NULL_TREE; | |
4594 | ||
4595 | /* Clean up. */ | |
4596 | if (!visited) | |
4597 | htab_delete (pfd.visited); | |
4598 | ||
4599 | return result; | |
8d08fdba MS |
4600 | } |
4601 | ||
050367a3 | 4602 | int |
3a978d72 | 4603 | uses_template_parms (tree t) |
050367a3 | 4604 | { |
4f2c9d7e | 4605 | return for_each_template_parm (t, 0, 0, NULL); |
050367a3 MM |
4606 | } |
4607 | ||
27fafc8d | 4608 | static int tinst_depth; |
e9f32eb5 | 4609 | extern int max_tinst_depth; |
5566b478 | 4610 | #ifdef GATHER_STATISTICS |
27fafc8d | 4611 | int depth_reached; |
5566b478 | 4612 | #endif |
8dfaeb63 MM |
4613 | static int tinst_level_tick; |
4614 | static int last_template_error_tick; | |
8d08fdba | 4615 | |
3ae18eaf JM |
4616 | /* We're starting to instantiate D; record the template instantiation context |
4617 | for diagnostics and to restore it later. */ | |
4618 | ||
742a37d5 | 4619 | int |
3a978d72 | 4620 | push_tinst_level (tree d) |
8d08fdba | 4621 | { |
3ae18eaf | 4622 | tree new; |
8d08fdba | 4623 | |
7215f9a0 MS |
4624 | if (tinst_depth >= max_tinst_depth) |
4625 | { | |
8adf5b5e JM |
4626 | /* If the instantiation in question still has unbound template parms, |
4627 | we don't really care if we can't instantiate it, so just return. | |
4628 | This happens with base instantiation for implicit `typename'. */ | |
4629 | if (uses_template_parms (d)) | |
4630 | return 0; | |
4631 | ||
1139b3d8 | 4632 | last_template_error_tick = tinst_level_tick; |
33bd39a2 | 4633 | error ("template instantiation depth exceeds maximum of %d (use -ftemplate-depth-NN to increase the maximum) instantiating `%D'", |
b4f4233d | 4634 | max_tinst_depth, d); |
5566b478 | 4635 | |
cb753e49 | 4636 | print_instantiation_context (); |
5566b478 | 4637 | |
7215f9a0 MS |
4638 | return 0; |
4639 | } | |
4640 | ||
d479d37f | 4641 | new = build_expr_wfl (d, input_filename, input_line, 0); |
3ae18eaf | 4642 | TREE_CHAIN (new) = current_tinst_level; |
8d08fdba | 4643 | current_tinst_level = new; |
5566b478 | 4644 | |
7215f9a0 | 4645 | ++tinst_depth; |
5566b478 MS |
4646 | #ifdef GATHER_STATISTICS |
4647 | if (tinst_depth > depth_reached) | |
4648 | depth_reached = tinst_depth; | |
4649 | #endif | |
4650 | ||
27fafc8d | 4651 | ++tinst_level_tick; |
7215f9a0 | 4652 | return 1; |
8d08fdba MS |
4653 | } |
4654 | ||
3ae18eaf JM |
4655 | /* We're done instantiating this template; return to the instantiation |
4656 | context. */ | |
4657 | ||
8d08fdba | 4658 | void |
3a978d72 | 4659 | pop_tinst_level (void) |
8d08fdba | 4660 | { |
3ae18eaf | 4661 | tree old = current_tinst_level; |
8d08fdba | 4662 | |
ae58fa02 MM |
4663 | /* Restore the filename and line number stashed away when we started |
4664 | this instantiation. */ | |
d479d37f | 4665 | input_line = TINST_LINE (old); |
3ae18eaf | 4666 | input_filename = TINST_FILE (old); |
5f2c99c4 | 4667 | extract_interface_info (); |
ae58fa02 | 4668 | |
3ae18eaf | 4669 | current_tinst_level = TREE_CHAIN (old); |
7215f9a0 | 4670 | --tinst_depth; |
27fafc8d | 4671 | ++tinst_level_tick; |
8d08fdba MS |
4672 | } |
4673 | ||
3ae18eaf JM |
4674 | /* We're instantiating a deferred template; restore the template |
4675 | instantiation context in which the instantiation was requested, which | |
4676 | is one step out from LEVEL. */ | |
4677 | ||
4678 | static void | |
3a978d72 | 4679 | reopen_tinst_level (tree level) |
3ae18eaf JM |
4680 | { |
4681 | tree t; | |
4682 | ||
4683 | tinst_depth = 0; | |
4684 | for (t = level; t; t = TREE_CHAIN (t)) | |
4685 | ++tinst_depth; | |
4686 | ||
4687 | current_tinst_level = level; | |
4688 | pop_tinst_level (); | |
4689 | } | |
4690 | ||
4691 | /* Return the outermost template instantiation context, for use with | |
4692 | -falt-external-templates. */ | |
4693 | ||
4694 | tree | |
3a978d72 | 4695 | tinst_for_decl (void) |
8d08fdba | 4696 | { |
3ae18eaf | 4697 | tree p = current_tinst_level; |
8d08fdba MS |
4698 | |
4699 | if (p) | |
3ae18eaf | 4700 | for (; TREE_CHAIN (p) ; p = TREE_CHAIN (p)) |
8d08fdba MS |
4701 | ; |
4702 | return p; | |
4703 | } | |
4704 | ||
f84b4be9 JM |
4705 | /* DECL is a friend FUNCTION_DECL or TEMPLATE_DECL. ARGS is the |
4706 | vector of template arguments, as for tsubst. | |
4707 | ||
dc957d14 | 4708 | Returns an appropriate tsubst'd friend declaration. */ |
f84b4be9 JM |
4709 | |
4710 | static tree | |
3a978d72 | 4711 | tsubst_friend_function (tree decl, tree args) |
f84b4be9 JM |
4712 | { |
4713 | tree new_friend; | |
82a98427 | 4714 | location_t saved_loc = input_location; |
27fafc8d | 4715 | |
f31686a3 | 4716 | input_location = DECL_SOURCE_LOCATION (decl); |
27fafc8d | 4717 | |
f84b4be9 JM |
4718 | if (TREE_CODE (decl) == FUNCTION_DECL |
4719 | && DECL_TEMPLATE_INSTANTIATION (decl) | |
4720 | && TREE_CODE (DECL_TI_TEMPLATE (decl)) != TEMPLATE_DECL) | |
4721 | /* This was a friend declared with an explicit template | |
4722 | argument list, e.g.: | |
4723 | ||
4724 | friend void f<>(T); | |
4725 | ||
4726 | to indicate that f was a template instantiation, not a new | |
4727 | function declaration. Now, we have to figure out what | |
4728 | instantiation of what template. */ | |
4729 | { | |
76e57b45 | 4730 | tree template_id, arglist, fns; |
f84b4be9 JM |
4731 | tree new_args; |
4732 | tree tmpl; | |
ed2fa432 | 4733 | tree ns = decl_namespace_context (TYPE_MAIN_DECL (current_class_type)); |
76e57b45 NS |
4734 | |
4735 | /* Friend functions are looked up in the containing namespace scope. | |
4736 | We must enter that scope, to avoid finding member functions of the | |
4737 | current cless with same name. */ | |
4738 | push_nested_namespace (ns); | |
4739 | fns = tsubst_expr (DECL_TI_TEMPLATE (decl), args, | |
c2ea3a40 | 4740 | tf_error | tf_warning, NULL_TREE); |
76e57b45 NS |
4741 | pop_nested_namespace (ns); |
4742 | arglist = tsubst (DECL_TI_ARGS (decl), args, | |
c2ea3a40 | 4743 | tf_error | tf_warning, NULL_TREE); |
76e57b45 NS |
4744 | template_id = lookup_template_function (fns, arglist); |
4745 | ||
c2ea3a40 | 4746 | new_friend = tsubst (decl, args, tf_error | tf_warning, NULL_TREE); |
36a117a5 MM |
4747 | tmpl = determine_specialization (template_id, new_friend, |
4748 | &new_args, | |
bf8f3f93 | 4749 | /*need_member_template=*/0); |
3e4a3562 | 4750 | new_friend = instantiate_template (tmpl, new_args, tf_error); |
27fafc8d | 4751 | goto done; |
f84b4be9 | 4752 | } |
36a117a5 | 4753 | |
c2ea3a40 | 4754 | new_friend = tsubst (decl, args, tf_error | tf_warning, NULL_TREE); |
f84b4be9 | 4755 | |
36a117a5 | 4756 | /* The NEW_FRIEND will look like an instantiation, to the |
f84b4be9 JM |
4757 | compiler, but is not an instantiation from the point of view of |
4758 | the language. For example, we might have had: | |
4759 | ||
4760 | template <class T> struct S { | |
4761 | template <class U> friend void f(T, U); | |
4762 | }; | |
4763 | ||
4764 | Then, in S<int>, template <class U> void f(int, U) is not an | |
4765 | instantiation of anything. */ | |
4766 | DECL_USE_TEMPLATE (new_friend) = 0; | |
4767 | if (TREE_CODE (decl) == TEMPLATE_DECL) | |
655dc6ee JM |
4768 | { |
4769 | DECL_USE_TEMPLATE (DECL_TEMPLATE_RESULT (new_friend)) = 0; | |
4770 | DECL_SAVED_TREE (DECL_TEMPLATE_RESULT (new_friend)) | |
4771 | = DECL_SAVED_TREE (DECL_TEMPLATE_RESULT (decl)); | |
4772 | } | |
36a117a5 | 4773 | |
92643fea MM |
4774 | /* The mangled name for the NEW_FRIEND is incorrect. The function |
4775 | is not a template instantiation and should not be mangled like | |
4776 | one. Therefore, we forget the mangling here; we'll recompute it | |
4777 | later if we need it. */ | |
36a117a5 MM |
4778 | if (TREE_CODE (new_friend) != TEMPLATE_DECL) |
4779 | { | |
19e7881c | 4780 | SET_DECL_RTL (new_friend, NULL_RTX); |
92643fea | 4781 | SET_DECL_ASSEMBLER_NAME (new_friend, NULL_TREE); |
36a117a5 MM |
4782 | } |
4783 | ||
6eb3bb27 | 4784 | if (DECL_NAMESPACE_SCOPE_P (new_friend)) |
f84b4be9 | 4785 | { |
36a117a5 | 4786 | tree old_decl; |
fbf1c34b MM |
4787 | tree new_friend_template_info; |
4788 | tree new_friend_result_template_info; | |
92da7074 | 4789 | tree ns; |
fbf1c34b MM |
4790 | int new_friend_is_defn; |
4791 | ||
4792 | /* We must save some information from NEW_FRIEND before calling | |
4793 | duplicate decls since that function will free NEW_FRIEND if | |
4794 | possible. */ | |
4795 | new_friend_template_info = DECL_TEMPLATE_INFO (new_friend); | |
f84b4be9 | 4796 | if (TREE_CODE (new_friend) == TEMPLATE_DECL) |
fbf1c34b MM |
4797 | { |
4798 | /* This declaration is a `primary' template. */ | |
4799 | DECL_PRIMARY_TEMPLATE (new_friend) = new_friend; | |
4800 | ||
4801 | new_friend_is_defn | |
17aec3eb | 4802 | = DECL_INITIAL (DECL_TEMPLATE_RESULT (new_friend)) != NULL_TREE; |
fbf1c34b | 4803 | new_friend_result_template_info |
17aec3eb | 4804 | = DECL_TEMPLATE_INFO (DECL_TEMPLATE_RESULT (new_friend)); |
fbf1c34b MM |
4805 | } |
4806 | else | |
4807 | { | |
4808 | new_friend_is_defn = DECL_INITIAL (new_friend) != NULL_TREE; | |
4809 | new_friend_result_template_info = NULL_TREE; | |
4810 | } | |
36a117a5 | 4811 | |
1c227897 MM |
4812 | /* Inside pushdecl_namespace_level, we will push into the |
4813 | current namespace. However, the friend function should go | |
c6002625 | 4814 | into the namespace of the template. */ |
92da7074 ML |
4815 | ns = decl_namespace_context (new_friend); |
4816 | push_nested_namespace (ns); | |
36a117a5 | 4817 | old_decl = pushdecl_namespace_level (new_friend); |
92da7074 | 4818 | pop_nested_namespace (ns); |
36a117a5 MM |
4819 | |
4820 | if (old_decl != new_friend) | |
4821 | { | |
4822 | /* This new friend declaration matched an existing | |
4823 | declaration. For example, given: | |
4824 | ||
4825 | template <class T> void f(T); | |
4826 | template <class U> class C { | |
4827 | template <class T> friend void f(T) {} | |
4828 | }; | |
4829 | ||
4830 | the friend declaration actually provides the definition | |
4831 | of `f', once C has been instantiated for some type. So, | |
4832 | old_decl will be the out-of-class template declaration, | |
4833 | while new_friend is the in-class definition. | |
4834 | ||
4835 | But, if `f' was called before this point, the | |
4836 | instantiation of `f' will have DECL_TI_ARGS corresponding | |
4837 | to `T' but not to `U', references to which might appear | |
4838 | in the definition of `f'. Previously, the most general | |
4839 | template for an instantiation of `f' was the out-of-class | |
4840 | version; now it is the in-class version. Therefore, we | |
4841 | run through all specialization of `f', adding to their | |
4842 | DECL_TI_ARGS appropriately. In particular, they need a | |
4843 | new set of outer arguments, corresponding to the | |
4844 | arguments for this class instantiation. | |
4845 | ||
4846 | The same situation can arise with something like this: | |
4847 | ||
4848 | friend void f(int); | |
4849 | template <class T> class C { | |
4850 | friend void f(T) {} | |
4851 | }; | |
4852 | ||
4853 | when `C<int>' is instantiated. Now, `f(int)' is defined | |
4854 | in the class. */ | |
4855 | ||
fbf1c34b MM |
4856 | if (!new_friend_is_defn) |
4857 | /* On the other hand, if the in-class declaration does | |
4858 | *not* provide a definition, then we don't want to alter | |
4859 | existing definitions. We can just leave everything | |
4860 | alone. */ | |
36a117a5 | 4861 | ; |
fbf1c34b | 4862 | else |
36a117a5 | 4863 | { |
fbf1c34b MM |
4864 | /* Overwrite whatever template info was there before, if |
4865 | any, with the new template information pertaining to | |
4866 | the declaration. */ | |
4867 | DECL_TEMPLATE_INFO (old_decl) = new_friend_template_info; | |
4868 | ||
4869 | if (TREE_CODE (old_decl) != TEMPLATE_DECL) | |
8d83f792 MM |
4870 | reregister_specialization (new_friend, |
4871 | most_general_template (old_decl), | |
4872 | old_decl); | |
fbf1c34b | 4873 | else |
36a117a5 | 4874 | { |
fbf1c34b MM |
4875 | tree t; |
4876 | tree new_friend_args; | |
4877 | ||
17aec3eb | 4878 | DECL_TEMPLATE_INFO (DECL_TEMPLATE_RESULT (old_decl)) |
fbf1c34b MM |
4879 | = new_friend_result_template_info; |
4880 | ||
4881 | new_friend_args = TI_ARGS (new_friend_template_info); | |
4882 | for (t = DECL_TEMPLATE_SPECIALIZATIONS (old_decl); | |
4883 | t != NULL_TREE; | |
4884 | t = TREE_CHAIN (t)) | |
4885 | { | |
4886 | tree spec = TREE_VALUE (t); | |
36a117a5 | 4887 | |
fbf1c34b MM |
4888 | DECL_TI_ARGS (spec) |
4889 | = add_outermost_template_args (new_friend_args, | |
4890 | DECL_TI_ARGS (spec)); | |
fbf1c34b MM |
4891 | } |
4892 | ||
4893 | /* Now, since specializations are always supposed to | |
4894 | hang off of the most general template, we must move | |
4895 | them. */ | |
4896 | t = most_general_template (old_decl); | |
4897 | if (t != old_decl) | |
4898 | { | |
4899 | DECL_TEMPLATE_SPECIALIZATIONS (t) | |
4900 | = chainon (DECL_TEMPLATE_SPECIALIZATIONS (t), | |
4901 | DECL_TEMPLATE_SPECIALIZATIONS (old_decl)); | |
4902 | DECL_TEMPLATE_SPECIALIZATIONS (old_decl) = NULL_TREE; | |
4903 | } | |
36a117a5 MM |
4904 | } |
4905 | } | |
4906 | ||
4907 | /* The information from NEW_FRIEND has been merged into OLD_DECL | |
4908 | by duplicate_decls. */ | |
4909 | new_friend = old_decl; | |
4910 | } | |
f84b4be9 | 4911 | } |
d0f062fb | 4912 | else if (COMPLETE_TYPE_P (DECL_CONTEXT (new_friend))) |
f84b4be9 JM |
4913 | { |
4914 | /* Check to see that the declaration is really present, and, | |
4915 | possibly obtain an improved declaration. */ | |
4916 | tree fn = check_classfn (DECL_CONTEXT (new_friend), | |
4917 | new_friend); | |
4918 | ||
4919 | if (fn) | |
4920 | new_friend = fn; | |
4921 | } | |
4922 | ||
27fafc8d | 4923 | done: |
82a98427 | 4924 | input_location = saved_loc; |
f84b4be9 JM |
4925 | return new_friend; |
4926 | } | |
4927 | ||
1aed5355 MM |
4928 | /* FRIEND_TMPL is a friend TEMPLATE_DECL. ARGS is the vector of |
4929 | template arguments, as for tsubst. | |
6757edfe | 4930 | |
dc957d14 | 4931 | Returns an appropriate tsubst'd friend type or error_mark_node on |
4b054b80 | 4932 | failure. */ |
6757edfe MM |
4933 | |
4934 | static tree | |
3a978d72 | 4935 | tsubst_friend_class (tree friend_tmpl, tree args) |
6757edfe | 4936 | { |
1aed5355 | 4937 | tree friend_type; |
25aab5d0 | 4938 | tree tmpl; |
3e0ec82f | 4939 | tree context; |
6757edfe | 4940 | |
3e0ec82f MM |
4941 | context = DECL_CONTEXT (friend_tmpl); |
4942 | ||
4943 | if (context) | |
77adef84 | 4944 | { |
3e0ec82f MM |
4945 | if (TREE_CODE (context) == NAMESPACE_DECL) |
4946 | push_nested_namespace (context); | |
4947 | else | |
14d22dd6 | 4948 | push_nested_class (tsubst (context, args, tf_none, NULL_TREE)); |
3e0ec82f | 4949 | } |
25aab5d0 | 4950 | |
3e0ec82f MM |
4951 | /* First, we look for a class template. */ |
4952 | tmpl = lookup_name (DECL_NAME (friend_tmpl), /*prefer_type=*/0); | |
25aab5d0 | 4953 | |
3e0ec82f MM |
4954 | /* But, if we don't find one, it might be because we're in a |
4955 | situation like this: | |
77adef84 | 4956 | |
3e0ec82f MM |
4957 | template <class T> |
4958 | struct S { | |
4959 | template <class U> | |
4960 | friend struct S; | |
4961 | }; | |
4962 | ||
4963 | Here, in the scope of (say) S<int>, `S' is bound to a TYPE_DECL | |
4964 | for `S<int>', not the TEMPLATE_DECL. */ | |
4965 | if (!tmpl || !DECL_CLASS_TEMPLATE_P (tmpl)) | |
4966 | { | |
4967 | tmpl = lookup_name (DECL_NAME (friend_tmpl), /*prefer_type=*/1); | |
4968 | tmpl = maybe_get_template_decl_from_type_decl (tmpl); | |
25aab5d0 | 4969 | } |
6757edfe | 4970 | |
25aab5d0 | 4971 | if (tmpl && DECL_CLASS_TEMPLATE_P (tmpl)) |
6757edfe MM |
4972 | { |
4973 | /* The friend template has already been declared. Just | |
36a117a5 MM |
4974 | check to see that the declarations match, and install any new |
4975 | default parameters. We must tsubst the default parameters, | |
4976 | of course. We only need the innermost template parameters | |
4977 | because that is all that redeclare_class_template will look | |
4978 | at. */ | |
3e0ec82f MM |
4979 | if (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (friend_tmpl)) |
4980 | > TMPL_ARGS_DEPTH (args)) | |
4981 | { | |
4982 | tree parms; | |
4983 | parms = tsubst_template_parms (DECL_TEMPLATE_PARMS (friend_tmpl), | |
4984 | args, tf_error | tf_warning); | |
4985 | redeclare_class_template (TREE_TYPE (tmpl), parms); | |
4986 | } | |
4987 | ||
6757edfe MM |
4988 | friend_type = TREE_TYPE (tmpl); |
4989 | } | |
4990 | else | |
4991 | { | |
4992 | /* The friend template has not already been declared. In this | |
4993 | case, the instantiation of the template class will cause the | |
4994 | injection of this template into the global scope. */ | |
c2ea3a40 | 4995 | tmpl = tsubst (friend_tmpl, args, tf_error | tf_warning, NULL_TREE); |
6757edfe MM |
4996 | |
4997 | /* The new TMPL is not an instantiation of anything, so we | |
4998 | forget its origins. We don't reset CLASSTYPE_TI_TEMPLATE for | |
4999 | the new type because that is supposed to be the corresponding | |
5000 | template decl, i.e., TMPL. */ | |
5001 | DECL_USE_TEMPLATE (tmpl) = 0; | |
5002 | DECL_TEMPLATE_INFO (tmpl) = NULL_TREE; | |
5003 | CLASSTYPE_USE_TEMPLATE (TREE_TYPE (tmpl)) = 0; | |
68c78847 KL |
5004 | CLASSTYPE_TI_ARGS (TREE_TYPE (tmpl)) |
5005 | = INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (TREE_TYPE (tmpl))); | |
6757edfe MM |
5006 | |
5007 | /* Inject this template into the global scope. */ | |
5008 | friend_type = TREE_TYPE (pushdecl_top_level (tmpl)); | |
5009 | } | |
5010 | ||
3e0ec82f MM |
5011 | if (context) |
5012 | { | |
5013 | if (TREE_CODE (context) == NAMESPACE_DECL) | |
5014 | pop_nested_namespace (context); | |
5015 | else | |
5016 | pop_nested_class (); | |
5017 | } | |
5018 | ||
6757edfe MM |
5019 | return friend_type; |
5020 | } | |
f84b4be9 | 5021 | |
17f29637 KL |
5022 | /* Returns zero if TYPE cannot be completed later due to circularity. |
5023 | Otherwise returns one. */ | |
5024 | ||
d5372501 | 5025 | static int |
3a978d72 | 5026 | can_complete_type_without_circularity (tree type) |
17f29637 KL |
5027 | { |
5028 | if (type == NULL_TREE || type == error_mark_node) | |
5029 | return 0; | |
5030 | else if (COMPLETE_TYPE_P (type)) | |
5031 | return 1; | |
5032 | else if (TREE_CODE (type) == ARRAY_TYPE && TYPE_DOMAIN (type)) | |
5033 | return can_complete_type_without_circularity (TREE_TYPE (type)); | |
8c6ab2db NS |
5034 | else if (CLASS_TYPE_P (type) |
5035 | && TYPE_BEING_DEFINED (TYPE_MAIN_VARIANT (type))) | |
17f29637 KL |
5036 | return 0; |
5037 | else | |
5038 | return 1; | |
5039 | } | |
5040 | ||
8d08fdba | 5041 | tree |
3a978d72 | 5042 | instantiate_class_template (tree type) |
8d08fdba | 5043 | { |
7088fca9 | 5044 | tree template, args, pattern, t, member; |
36a117a5 | 5045 | tree typedecl; |
dbbf88d1 NS |
5046 | tree pbinfo; |
5047 | ||
5566b478 | 5048 | if (type == error_mark_node) |
8d08fdba MS |
5049 | return error_mark_node; |
5050 | ||
ca099ac8 MM |
5051 | if (TYPE_BEING_DEFINED (type) |
5052 | || COMPLETE_TYPE_P (type) | |
5053 | || dependent_type_p (type)) | |
5566b478 MS |
5054 | return type; |
5055 | ||
6bdb985f | 5056 | /* Figure out which template is being instantiated. */ |
36a117a5 | 5057 | template = most_general_template (CLASSTYPE_TI_TEMPLATE (type)); |
5566b478 | 5058 | my_friendly_assert (TREE_CODE (template) == TEMPLATE_DECL, 279); |
73aad9b9 | 5059 | |
6bdb985f MM |
5060 | /* Figure out which arguments are being used to do the |
5061 | instantiation. */ | |
5062 | args = CLASSTYPE_TI_ARGS (type); | |
4c571114 MM |
5063 | |
5064 | /* Determine what specialization of the original template to | |
5065 | instantiate. */ | |
8fbc5ae7 MM |
5066 | t = most_specialized_class (template, args); |
5067 | if (t == error_mark_node) | |
73aad9b9 | 5068 | { |
8fbc5ae7 MM |
5069 | const char *str = "candidates are:"; |
5070 | error ("ambiguous class template instantiation for `%#T'", type); | |
5071 | for (t = DECL_TEMPLATE_SPECIALIZATIONS (template); t; | |
5072 | t = TREE_CHAIN (t)) | |
73aad9b9 | 5073 | { |
8c6ab2db | 5074 | if (get_class_bindings (TREE_VALUE (t), TREE_PURPOSE (t), args)) |
73aad9b9 | 5075 | { |
8fbc5ae7 MM |
5076 | cp_error_at ("%s %+#T", str, TREE_TYPE (t)); |
5077 | str = " "; | |
73aad9b9 JM |
5078 | } |
5079 | } | |
8fbc5ae7 MM |
5080 | TYPE_BEING_DEFINED (type) = 1; |
5081 | return error_mark_node; | |
73aad9b9 | 5082 | } |
6bdb985f MM |
5083 | |
5084 | if (t) | |
73aad9b9 JM |
5085 | pattern = TREE_TYPE (t); |
5086 | else | |
5087 | pattern = TREE_TYPE (template); | |
5566b478 | 5088 | |
4c571114 MM |
5089 | /* If the template we're instantiating is incomplete, then clearly |
5090 | there's nothing we can do. */ | |
d0f062fb | 5091 | if (!COMPLETE_TYPE_P (pattern)) |
f31c0a32 | 5092 | return type; |
5566b478 | 5093 | |
4c571114 MM |
5094 | /* If we've recursively instantiated too many templates, stop. */ |
5095 | if (! push_tinst_level (type)) | |
f31c0a32 | 5096 | return type; |
4c571114 MM |
5097 | |
5098 | /* Now we're really doing the instantiation. Mark the type as in | |
5099 | the process of being defined. */ | |
5100 | TYPE_BEING_DEFINED (type) = 1; | |
5101 | ||
78757caa KL |
5102 | /* We may be in the middle of deferred access check. Disable |
5103 | it now. */ | |
5104 | push_deferring_access_checks (dk_no_deferred); | |
5105 | ||
4c571114 | 5106 | maybe_push_to_top_level (uses_template_parms (type)); |
4c571114 | 5107 | |
73aad9b9 | 5108 | if (t) |
36a117a5 | 5109 | { |
27631dae | 5110 | /* This TYPE is actually an instantiation of a partial |
36a117a5 MM |
5111 | specialization. We replace the innermost set of ARGS with |
5112 | the arguments appropriate for substitution. For example, | |
5113 | given: | |
5114 | ||
5115 | template <class T> struct S {}; | |
5116 | template <class T> struct S<T*> {}; | |
5117 | ||
5118 | and supposing that we are instantiating S<int*>, ARGS will | |
5119 | present be {int*} but we need {int}. */ | |
5120 | tree inner_args | |
5121 | = get_class_bindings (TREE_VALUE (t), TREE_PURPOSE (t), | |
5122 | args); | |
5123 | ||
5124 | /* If there were multiple levels in ARGS, replacing the | |
5125 | innermost level would alter CLASSTYPE_TI_ARGS, which we don't | |
5126 | want, so we make a copy first. */ | |
5127 | if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (args)) | |
5128 | { | |
5129 | args = copy_node (args); | |
5130 | SET_TMPL_ARGS_LEVEL (args, TMPL_ARGS_DEPTH (args), inner_args); | |
5131 | } | |
5132 | else | |
5133 | args = inner_args; | |
5134 | } | |
8d019cef | 5135 | |
5566b478 MS |
5136 | if (flag_external_templates) |
5137 | { | |
5138 | if (flag_alt_external_templates) | |
5139 | { | |
5140 | CLASSTYPE_INTERFACE_ONLY (type) = interface_only; | |
5141 | SET_CLASSTYPE_INTERFACE_UNKNOWN_X (type, interface_unknown); | |
5566b478 MS |
5142 | } |
5143 | else | |
5144 | { | |
5145 | CLASSTYPE_INTERFACE_ONLY (type) = CLASSTYPE_INTERFACE_ONLY (pattern); | |
5146 | SET_CLASSTYPE_INTERFACE_UNKNOWN_X | |
5147 | (type, CLASSTYPE_INTERFACE_UNKNOWN (pattern)); | |
5566b478 MS |
5148 | } |
5149 | } | |
5150 | else | |
8d08fdba | 5151 | { |
5566b478 | 5152 | SET_CLASSTYPE_INTERFACE_UNKNOWN (type); |
8d08fdba MS |
5153 | } |
5154 | ||
68ea098a NS |
5155 | /* Set the input location to the template definition. This is needed |
5156 | if tsubsting causes an error. */ | |
f31686a3 | 5157 | input_location = DECL_SOURCE_LOCATION (TYPE_NAME (pattern)); |
68ea098a | 5158 | |
f7da6097 MS |
5159 | TYPE_HAS_CONSTRUCTOR (type) = TYPE_HAS_CONSTRUCTOR (pattern); |
5160 | TYPE_HAS_DESTRUCTOR (type) = TYPE_HAS_DESTRUCTOR (pattern); | |
834c6dff MM |
5161 | TYPE_HAS_NEW_OPERATOR (type) = TYPE_HAS_NEW_OPERATOR (pattern); |
5162 | TYPE_HAS_ARRAY_NEW_OPERATOR (type) = TYPE_HAS_ARRAY_NEW_OPERATOR (pattern); | |
f7da6097 | 5163 | TYPE_GETS_DELETE (type) = TYPE_GETS_DELETE (pattern); |
f7da6097 MS |
5164 | TYPE_HAS_ASSIGN_REF (type) = TYPE_HAS_ASSIGN_REF (pattern); |
5165 | TYPE_HAS_CONST_ASSIGN_REF (type) = TYPE_HAS_CONST_ASSIGN_REF (pattern); | |
5166 | TYPE_HAS_ABSTRACT_ASSIGN_REF (type) = TYPE_HAS_ABSTRACT_ASSIGN_REF (pattern); | |
5167 | TYPE_HAS_INIT_REF (type) = TYPE_HAS_INIT_REF (pattern); | |
5168 | TYPE_HAS_CONST_INIT_REF (type) = TYPE_HAS_CONST_INIT_REF (pattern); | |
f7da6097 MS |
5169 | TYPE_HAS_DEFAULT_CONSTRUCTOR (type) = TYPE_HAS_DEFAULT_CONSTRUCTOR (pattern); |
5170 | TYPE_HAS_CONVERSION (type) = TYPE_HAS_CONVERSION (pattern); | |
4c6b7393 MM |
5171 | TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (type) |
5172 | = TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (pattern); | |
f7da6097 MS |
5173 | TYPE_USES_MULTIPLE_INHERITANCE (type) |
5174 | = TYPE_USES_MULTIPLE_INHERITANCE (pattern); | |
5175 | TYPE_USES_VIRTUAL_BASECLASSES (type) | |
5176 | = TYPE_USES_VIRTUAL_BASECLASSES (pattern); | |
5177 | TYPE_PACKED (type) = TYPE_PACKED (pattern); | |
5178 | TYPE_ALIGN (type) = TYPE_ALIGN (pattern); | |
11cf4d18 | 5179 | TYPE_USER_ALIGN (type) = TYPE_USER_ALIGN (pattern); |
eff71ab0 | 5180 | TYPE_FOR_JAVA (type) = TYPE_FOR_JAVA (pattern); /* For libjava's JArray<T> */ |
6bdb8141 JM |
5181 | if (ANON_AGGR_TYPE_P (pattern)) |
5182 | SET_ANON_AGGR_TYPE_P (type); | |
f7da6097 | 5183 | |
dbbf88d1 NS |
5184 | pbinfo = TYPE_BINFO (pattern); |
5185 | ||
5186 | if (BINFO_BASETYPES (pbinfo)) | |
3fd71a52 MM |
5187 | { |
5188 | tree base_list = NULL_TREE; | |
dbbf88d1 NS |
5189 | tree pbases = BINFO_BASETYPES (pbinfo); |
5190 | tree paccesses = BINFO_BASEACCESSES (pbinfo); | |
a2507277 | 5191 | tree context = TYPE_CONTEXT (type); |
3fd71a52 | 5192 | int i; |
5566b478 | 5193 | |
a2507277 NS |
5194 | /* We must enter the scope containing the type, as that is where |
5195 | the accessibility of types named in dependent bases are | |
5196 | looked up from. */ | |
5197 | push_scope (context ? context : global_namespace); | |
5198 | ||
3fd71a52 MM |
5199 | /* Substitute into each of the bases to determine the actual |
5200 | basetypes. */ | |
5201 | for (i = 0; i < TREE_VEC_LENGTH (pbases); ++i) | |
5202 | { | |
5203 | tree base; | |
5204 | tree access; | |
5205 | tree pbase; | |
5566b478 | 5206 | |
3fd71a52 | 5207 | pbase = TREE_VEC_ELT (pbases, i); |
dbbf88d1 | 5208 | access = TREE_VEC_ELT (paccesses, i); |
711734a9 | 5209 | |
dc957d14 | 5210 | /* Substitute to figure out the base class. */ |
c2ea3a40 | 5211 | base = tsubst (BINFO_TYPE (pbase), args, tf_error, NULL_TREE); |
3fd71a52 MM |
5212 | if (base == error_mark_node) |
5213 | continue; | |
dbbf88d1 | 5214 | |
3fd71a52 | 5215 | base_list = tree_cons (access, base, base_list); |
dbbf88d1 | 5216 | TREE_VIA_VIRTUAL (base_list) = TREE_VIA_VIRTUAL (pbase); |
3fd71a52 | 5217 | } |
dfbcd65a | 5218 | |
3fd71a52 MM |
5219 | /* The list is now in reverse order; correct that. */ |
5220 | base_list = nreverse (base_list); | |
5221 | ||
5222 | /* Now call xref_basetypes to set up all the base-class | |
5223 | information. */ | |
da15dae6 | 5224 | xref_basetypes (type, base_list); |
a2507277 NS |
5225 | |
5226 | pop_scope (context ? context : global_namespace); | |
3fd71a52 | 5227 | } |
5566b478 | 5228 | |
b74a0560 MM |
5229 | /* Now that our base classes are set up, enter the scope of the |
5230 | class, so that name lookups into base classes, etc. will work | |
dc957d14 | 5231 | correctly. This is precisely analogous to what we do in |
b74a0560 MM |
5232 | begin_class_definition when defining an ordinary non-template |
5233 | class. */ | |
29370796 | 5234 | pushclass (type); |
b74a0560 | 5235 | |
7088fca9 | 5236 | /* Now members are processed in the order of declaration. */ |
8c6ab2db NS |
5237 | for (member = CLASSTYPE_DECL_LIST (pattern); |
5238 | member; member = TREE_CHAIN (member)) | |
8d08fdba | 5239 | { |
7088fca9 | 5240 | tree t = TREE_VALUE (member); |
5566b478 | 5241 | |
7088fca9 | 5242 | if (TREE_PURPOSE (member)) |
ed44da02 | 5243 | { |
7088fca9 KL |
5244 | if (TYPE_P (t)) |
5245 | { | |
5e0c54e5 | 5246 | /* Build new CLASSTYPE_NESTED_UTDS. */ |
8d08fdba | 5247 | |
7088fca9 KL |
5248 | tree tag = t; |
5249 | tree name = TYPE_IDENTIFIER (tag); | |
5250 | tree newtag; | |
ae58fa02 | 5251 | |
7088fca9 KL |
5252 | newtag = tsubst (tag, args, tf_error, NULL_TREE); |
5253 | my_friendly_assert (newtag != error_mark_node, 20010206); | |
5254 | if (TREE_CODE (newtag) != ENUMERAL_TYPE) | |
5255 | { | |
5256 | if (TYPE_LANG_SPECIFIC (tag) && CLASSTYPE_IS_TEMPLATE (tag)) | |
5257 | /* Unfortunately, lookup_template_class sets | |
5258 | CLASSTYPE_IMPLICIT_INSTANTIATION for a partial | |
3afd2e20 NS |
5259 | instantiation (i.e., for the type of a member |
5260 | template class nested within a template class.) | |
5261 | This behavior is required for | |
5262 | maybe_process_partial_specialization to work | |
5263 | correctly, but is not accurate in this case; | |
5264 | the TAG is not an instantiation of anything. | |
5265 | (The corresponding TEMPLATE_DECL is an | |
5266 | instantiation, but the TYPE is not.) */ | |
7088fca9 KL |
5267 | CLASSTYPE_USE_TEMPLATE (newtag) = 0; |
5268 | ||
5269 | /* Now, we call pushtag to put this NEWTAG into the scope of | |
5270 | TYPE. We first set up the IDENTIFIER_TYPE_VALUE to avoid | |
5271 | pushtag calling push_template_decl. We don't have to do | |
5272 | this for enums because it will already have been done in | |
5273 | tsubst_enum. */ | |
5274 | if (name) | |
5275 | SET_IDENTIFIER_TYPE_VALUE (name, newtag); | |
5276 | pushtag (name, newtag, /*globalize=*/0); | |
5277 | } | |
5278 | } | |
5279 | else if (TREE_CODE (t) == FUNCTION_DECL | |
5280 | || DECL_FUNCTION_TEMPLATE_P (t)) | |
5281 | { | |
5282 | /* Build new TYPE_METHODS. */ | |
fecafe5e NS |
5283 | tree r; |
5284 | ||
5285 | if (TREE_CODE (t) == TEMPLATE_DECL) | |
5286 | processing_template_decl++; | |
5287 | r = tsubst (t, args, tf_error, NULL_TREE); | |
5288 | if (TREE_CODE (t) == TEMPLATE_DECL) | |
5289 | processing_template_decl--; | |
7088fca9 KL |
5290 | set_current_access_from_decl (r); |
5291 | grok_special_member_properties (r); | |
5292 | finish_member_declaration (r); | |
5293 | } | |
5294 | else | |
5295 | { | |
5296 | /* Build new TYPE_FIELDS. */ | |
fa8d6e85 | 5297 | |
7088fca9 KL |
5298 | if (TREE_CODE (t) != CONST_DECL) |
5299 | { | |
5300 | tree r; | |
fa8d6e85 | 5301 | |
d479d37f NS |
5302 | /* The the file and line for this declaration, to |
5303 | assist in error message reporting. Since we | |
5304 | called push_tinst_level above, we don't need to | |
5305 | restore these. */ | |
f31686a3 | 5306 | input_location = DECL_SOURCE_LOCATION (t); |
fa8d6e85 | 5307 | |
fb5ce3c9 NS |
5308 | if (TREE_CODE (t) == TEMPLATE_DECL) |
5309 | processing_template_decl++; | |
7088fca9 | 5310 | r = tsubst (t, args, tf_error | tf_warning, NULL_TREE); |
fb5ce3c9 NS |
5311 | if (TREE_CODE (t) == TEMPLATE_DECL) |
5312 | processing_template_decl--; | |
7088fca9 KL |
5313 | if (TREE_CODE (r) == VAR_DECL) |
5314 | { | |
5315 | tree init; | |
17f29637 | 5316 | |
7088fca9 KL |
5317 | if (DECL_INITIALIZED_IN_CLASS_P (r)) |
5318 | init = tsubst_expr (DECL_INITIAL (t), args, | |
5319 | tf_error | tf_warning, NULL_TREE); | |
5320 | else | |
5321 | init = NULL_TREE; | |
8d08fdba | 5322 | |
8c6ab2db NS |
5323 | finish_static_data_member_decl |
5324 | (r, init, /*asmspec_tree=*/NULL_TREE, /*flags=*/0); | |
8d08fdba | 5325 | |
7088fca9 KL |
5326 | if (DECL_INITIALIZED_IN_CLASS_P (r)) |
5327 | check_static_variable_definition (r, TREE_TYPE (r)); | |
5328 | } | |
5329 | else if (TREE_CODE (r) == FIELD_DECL) | |
5330 | { | |
5331 | /* Determine whether R has a valid type and can be | |
5332 | completed later. If R is invalid, then it is | |
5333 | replaced by error_mark_node so that it will not be | |
5334 | added to TYPE_FIELDS. */ | |
5335 | tree rtype = TREE_TYPE (r); | |
5336 | if (can_complete_type_without_circularity (rtype)) | |
5337 | complete_type (rtype); | |
5338 | ||
5339 | if (!COMPLETE_TYPE_P (rtype)) | |
5340 | { | |
5341 | cxx_incomplete_type_error (r, rtype); | |
5342 | r = error_mark_node; | |
5343 | } | |
5344 | } | |
5566b478 | 5345 | |
7088fca9 KL |
5346 | /* If it is a TYPE_DECL for a class-scoped ENUMERAL_TYPE, |
5347 | such a thing will already have been added to the field | |
5348 | list by tsubst_enum in finish_member_declaration in the | |
5e0c54e5 | 5349 | CLASSTYPE_NESTED_UTDS case above. */ |
7088fca9 KL |
5350 | if (!(TREE_CODE (r) == TYPE_DECL |
5351 | && TREE_CODE (TREE_TYPE (r)) == ENUMERAL_TYPE | |
43b26a01 | 5352 | && DECL_ARTIFICIAL (r))) |
7088fca9 KL |
5353 | { |
5354 | set_current_access_from_decl (r); | |
5355 | finish_member_declaration (r); | |
5356 | } | |
5357 | } | |
5358 | } | |
61fc8c9e | 5359 | } |
7088fca9 KL |
5360 | else |
5361 | { | |
5362 | if (TYPE_P (t) || DECL_CLASS_TEMPLATE_P (t)) | |
5363 | { | |
5364 | /* Build new CLASSTYPE_FRIEND_CLASSES. */ | |
5365 | ||
5366 | tree friend_type = t; | |
5367 | tree new_friend_type; | |
1aed5355 | 5368 | |
7088fca9 KL |
5369 | if (TREE_CODE (friend_type) == TEMPLATE_DECL) |
5370 | new_friend_type = tsubst_friend_class (friend_type, args); | |
5371 | else if (uses_template_parms (friend_type)) | |
5372 | new_friend_type = tsubst (friend_type, args, | |
5373 | tf_error | tf_warning, NULL_TREE); | |
c4d0910c KL |
5374 | else if (CLASSTYPE_USE_TEMPLATE (friend_type)) |
5375 | new_friend_type = friend_type; | |
7088fca9 KL |
5376 | else |
5377 | { | |
5378 | tree ns = decl_namespace_context (TYPE_MAIN_DECL (friend_type)); | |
5379 | ||
5380 | /* The call to xref_tag_from_type does injection for friend | |
5381 | classes. */ | |
5382 | push_nested_namespace (ns); | |
5383 | new_friend_type = | |
5384 | xref_tag_from_type (friend_type, NULL_TREE, 1); | |
5385 | pop_nested_namespace (ns); | |
5386 | } | |
1aed5355 | 5387 | |
7088fca9 KL |
5388 | if (TREE_CODE (friend_type) == TEMPLATE_DECL) |
5389 | /* Trick make_friend_class into realizing that the friend | |
5390 | we're adding is a template, not an ordinary class. It's | |
5391 | important that we use make_friend_class since it will | |
5392 | perform some error-checking and output cross-reference | |
5393 | information. */ | |
5394 | ++processing_template_decl; | |
fc378698 | 5395 | |
7088fca9 | 5396 | if (new_friend_type != error_mark_node) |
19db77ce KL |
5397 | make_friend_class (type, new_friend_type, |
5398 | /*complain=*/false); | |
fc378698 | 5399 | |
7088fca9 KL |
5400 | if (TREE_CODE (friend_type) == TEMPLATE_DECL) |
5401 | --processing_template_decl; | |
5402 | } | |
5403 | else | |
963142fc | 5404 | /* Build new DECL_FRIENDLIST. */ |
19db77ce KL |
5405 | add_friend (type, tsubst_friend_function (t, args), |
5406 | /*complain=*/false); | |
7088fca9 KL |
5407 | } |
5408 | } | |
5566b478 | 5409 | |
61a127b3 MM |
5410 | /* Set the file and line number information to whatever is given for |
5411 | the class itself. This puts error messages involving generated | |
5412 | implicit functions at a predictable point, and the same point | |
5413 | that would be used for non-template classes. */ | |
7088fca9 | 5414 | typedecl = TYPE_MAIN_DECL (type); |
f31686a3 | 5415 | input_location = DECL_SOURCE_LOCATION (typedecl); |
82a98427 | 5416 | |
61a127b3 | 5417 | unreverse_member_declarations (type); |
9f33663b | 5418 | finish_struct_1 (type); |
e92cc029 | 5419 | |
5524676d JM |
5420 | /* Clear this now so repo_template_used is happy. */ |
5421 | TYPE_BEING_DEFINED (type) = 0; | |
2604412d | 5422 | repo_template_used (type); |
8d08fdba | 5423 | |
9188c363 MM |
5424 | /* Now that the class is complete, instantiate default arguments for |
5425 | any member functions. We don't do this earlier because the | |
5426 | default arguments may reference members of the class. */ | |
5427 | if (!PRIMARY_TEMPLATE_P (template)) | |
5428 | for (t = TYPE_METHODS (type); t; t = TREE_CHAIN (t)) | |
5429 | if (TREE_CODE (t) == FUNCTION_DECL | |
dc957d14 | 5430 | /* Implicitly generated member functions will not have template |
9188c363 MM |
5431 | information; they are not instantiations, but instead are |
5432 | created "fresh" for each instantiation. */ | |
5433 | && DECL_TEMPLATE_INFO (t)) | |
5434 | tsubst_default_arguments (t); | |
5435 | ||
b74a0560 | 5436 | popclass (); |
5566b478 | 5437 | pop_from_top_level (); |
78757caa | 5438 | pop_deferring_access_checks (); |
5566b478 MS |
5439 | pop_tinst_level (); |
5440 | ||
9aad8f83 MA |
5441 | if (TYPE_CONTAINS_VPTR_P (type)) |
5442 | keyed_classes = tree_cons (NULL_TREE, type, keyed_classes); | |
5443 | ||
5566b478 | 5444 | return type; |
8d08fdba MS |
5445 | } |
5446 | ||
00d3396f | 5447 | static tree |
a91db711 | 5448 | tsubst_template_arg (tree t, tree args, tsubst_flags_t complain, tree in_decl) |
00d3396f | 5449 | { |
a91db711 NS |
5450 | tree r; |
5451 | ||
5452 | if (!t) | |
5453 | r = t; | |
5454 | else if (TYPE_P (t)) | |
5455 | r = tsubst (t, args, complain, in_decl); | |
5456 | else | |
00d3396f | 5457 | { |
a91db711 NS |
5458 | r = tsubst_expr (t, args, complain, in_decl); |
5459 | ||
5460 | if (!uses_template_parms (r)) | |
4d5f3fbd | 5461 | { |
a91db711 NS |
5462 | /* Sometimes, one of the args was an expression involving a |
5463 | template constant parameter, like N - 1. Now that we've | |
5464 | tsubst'd, we might have something like 2 - 1. This will | |
5465 | confuse lookup_template_class, so we do constant folding | |
5466 | here. We have to unset processing_template_decl, to fool | |
5467 | tsubst_copy_and_build() into building an actual tree. */ | |
5468 | ||
5469 | /* If the TREE_TYPE of ARG is not NULL_TREE, ARG is already | |
5470 | as simple as it's going to get, and trying to reprocess | |
5471 | the trees will break. Once tsubst_expr et al DTRT for | |
5472 | non-dependent exprs, this code can go away, as the type | |
5473 | will always be set. */ | |
5474 | if (!TREE_TYPE (r)) | |
5475 | { | |
5476 | int saved_processing_template_decl = processing_template_decl; | |
5477 | processing_template_decl = 0; | |
5478 | r = tsubst_copy_and_build (r, /*args=*/NULL_TREE, | |
5479 | tf_error, /*in_decl=*/NULL_TREE, | |
5480 | /*function_p=*/false); | |
5481 | processing_template_decl = saved_processing_template_decl; | |
5482 | } | |
5483 | r = fold (r); | |
4d5f3fbd | 5484 | } |
bd83b409 | 5485 | } |
a91db711 | 5486 | return r; |
bd83b409 NS |
5487 | } |
5488 | ||
a91db711 | 5489 | /* Substitute ARGS into the vector or list of template arguments T. */ |
830bfa74 | 5490 | |
e9659ab0 | 5491 | static tree |
a91db711 | 5492 | tsubst_template_args (tree t, tree args, tsubst_flags_t complain, tree in_decl) |
830bfa74 | 5493 | { |
bf12d54d | 5494 | int len = TREE_VEC_LENGTH (t); |
a91db711 | 5495 | int need_new = 0, i; |
c68b0a84 | 5496 | tree *elts = alloca (len * sizeof (tree)); |
830bfa74 | 5497 | |
830bfa74 MM |
5498 | for (i = 0; i < len; i++) |
5499 | { | |
bf12d54d NS |
5500 | tree orig_arg = TREE_VEC_ELT (t, i); |
5501 | tree new_arg; | |
a91db711 | 5502 | |
bf12d54d NS |
5503 | if (TREE_CODE (orig_arg) == TREE_VEC) |
5504 | new_arg = tsubst_template_args (orig_arg, args, complain, in_decl); | |
830bfa74 | 5505 | else |
a91db711 | 5506 | new_arg = tsubst_template_arg (orig_arg, args, complain, in_decl); |
830bfa74 | 5507 | |
a91db711 | 5508 | if (new_arg == error_mark_node) |
08e72a19 JM |
5509 | return error_mark_node; |
5510 | ||
a91db711 NS |
5511 | elts[i] = new_arg; |
5512 | if (new_arg != orig_arg) | |
830bfa74 MM |
5513 | need_new = 1; |
5514 | } | |
5515 | ||
5516 | if (!need_new) | |
5517 | return t; | |
a91db711 | 5518 | |
bf12d54d NS |
5519 | t = make_tree_vec (len); |
5520 | for (i = 0; i < len; i++) | |
5521 | TREE_VEC_ELT (t, i) = elts[i]; | |
830bfa74 MM |
5522 | |
5523 | return t; | |
5524 | } | |
5525 | ||
36a117a5 MM |
5526 | /* Return the result of substituting ARGS into the template parameters |
5527 | given by PARMS. If there are m levels of ARGS and m + n levels of | |
5528 | PARMS, then the result will contain n levels of PARMS. For | |
5529 | example, if PARMS is `template <class T> template <class U> | |
5530 | template <T*, U, class V>' and ARGS is {{int}, {double}} then the | |
5531 | result will be `template <int*, double, class V>'. */ | |
5532 | ||
e9659ab0 | 5533 | static tree |
3a978d72 | 5534 | tsubst_template_parms (tree parms, tree args, tsubst_flags_t complain) |
36a117a5 | 5535 | { |
f71f87f9 MM |
5536 | tree r = NULL_TREE; |
5537 | tree* new_parms; | |
36a117a5 MM |
5538 | |
5539 | for (new_parms = &r; | |
5540 | TMPL_PARMS_DEPTH (parms) > TMPL_ARGS_DEPTH (args); | |
5541 | new_parms = &(TREE_CHAIN (*new_parms)), | |
5542 | parms = TREE_CHAIN (parms)) | |
5543 | { | |
5544 | tree new_vec = | |
5545 | make_tree_vec (TREE_VEC_LENGTH (TREE_VALUE (parms))); | |
5546 | int i; | |
5547 | ||
5548 | for (i = 0; i < TREE_VEC_LENGTH (new_vec); ++i) | |
5549 | { | |
833aa4c4 NS |
5550 | tree tuple = TREE_VEC_ELT (TREE_VALUE (parms), i); |
5551 | tree default_value = TREE_PURPOSE (tuple); | |
5552 | tree parm_decl = TREE_VALUE (tuple); | |
5553 | ||
5554 | parm_decl = tsubst (parm_decl, args, complain, NULL_TREE); | |
a91db711 NS |
5555 | default_value = tsubst_template_arg (default_value, args, |
5556 | complain, NULL_TREE); | |
5557 | ||
5558 | tuple = build_tree_list (default_value, parm_decl); | |
833aa4c4 | 5559 | TREE_VEC_ELT (new_vec, i) = tuple; |
36a117a5 MM |
5560 | } |
5561 | ||
5562 | *new_parms = | |
4890c2f4 MM |
5563 | tree_cons (size_int (TMPL_PARMS_DEPTH (parms) |
5564 | - TMPL_ARGS_DEPTH (args)), | |
36a117a5 MM |
5565 | new_vec, NULL_TREE); |
5566 | } | |
5567 | ||
5568 | return r; | |
5569 | } | |
5570 | ||
ed44da02 MM |
5571 | /* Substitute the ARGS into the indicated aggregate (or enumeration) |
5572 | type T. If T is not an aggregate or enumeration type, it is | |
5573 | handled as if by tsubst. IN_DECL is as for tsubst. If | |
838dfd8a | 5574 | ENTERING_SCOPE is nonzero, T is the context for a template which |
dc957d14 | 5575 | we are presently tsubst'ing. Return the substituted value. */ |
36a117a5 | 5576 | |
e9659ab0 | 5577 | static tree |
3a978d72 NN |
5578 | tsubst_aggr_type (tree t, |
5579 | tree args, | |
5580 | tsubst_flags_t complain, | |
5581 | tree in_decl, | |
5582 | int entering_scope) | |
36a117a5 MM |
5583 | { |
5584 | if (t == NULL_TREE) | |
5585 | return NULL_TREE; | |
5586 | ||
5587 | switch (TREE_CODE (t)) | |
5588 | { | |
5589 | case RECORD_TYPE: | |
5590 | if (TYPE_PTRMEMFUNC_P (t)) | |
46c895ac | 5591 | return tsubst (TYPE_PTRMEMFUNC_FN_TYPE (t), args, complain, in_decl); |
36a117a5 MM |
5592 | |
5593 | /* else fall through */ | |
ed44da02 | 5594 | case ENUMERAL_TYPE: |
36a117a5 | 5595 | case UNION_TYPE: |
5db698f6 | 5596 | if (TYPE_TEMPLATE_INFO (t)) |
36a117a5 MM |
5597 | { |
5598 | tree argvec; | |
5599 | tree context; | |
5600 | tree r; | |
5601 | ||
5602 | /* First, determine the context for the type we are looking | |
5603 | up. */ | |
4f7847ca NS |
5604 | context = TYPE_CONTEXT (t); |
5605 | if (context) | |
5606 | context = tsubst_aggr_type (context, args, complain, | |
36a117a5 | 5607 | in_decl, /*entering_scope=*/1); |
36a117a5 MM |
5608 | |
5609 | /* Then, figure out what arguments are appropriate for the | |
5610 | type we are trying to find. For example, given: | |
5611 | ||
5612 | template <class T> struct S; | |
5613 | template <class T, class U> void f(T, U) { S<U> su; } | |
5614 | ||
5615 | and supposing that we are instantiating f<int, double>, | |
5616 | then our ARGS will be {int, double}, but, when looking up | |
5617 | S we only want {double}. */ | |
a91db711 NS |
5618 | argvec = tsubst_template_args (TYPE_TI_ARGS (t), args, |
5619 | complain, in_decl); | |
08e72a19 JM |
5620 | if (argvec == error_mark_node) |
5621 | return error_mark_node; | |
36a117a5 MM |
5622 | |
5623 | r = lookup_template_class (t, argvec, in_decl, context, | |
f9c244b8 | 5624 | entering_scope, complain); |
36a117a5 | 5625 | |
c2ea3a40 | 5626 | return cp_build_qualified_type_real (r, TYPE_QUALS (t), complain); |
36a117a5 MM |
5627 | } |
5628 | else | |
5629 | /* This is not a template type, so there's nothing to do. */ | |
5630 | return t; | |
5631 | ||
5632 | default: | |
4393e105 | 5633 | return tsubst (t, args, complain, in_decl); |
36a117a5 MM |
5634 | } |
5635 | } | |
5636 | ||
9188c363 MM |
5637 | /* Substitute into the default argument ARG (a default argument for |
5638 | FN), which has the indicated TYPE. */ | |
5639 | ||
5640 | tree | |
3a978d72 | 5641 | tsubst_default_argument (tree fn, tree type, tree arg) |
9188c363 MM |
5642 | { |
5643 | /* This default argument came from a template. Instantiate the | |
5644 | default argument here, not in tsubst. In the case of | |
5645 | something like: | |
5646 | ||
5647 | template <class T> | |
5648 | struct S { | |
5649 | static T t(); | |
5650 | void f(T = t()); | |
5651 | }; | |
5652 | ||
5653 | we must be careful to do name lookup in the scope of S<T>, | |
a29e1034 JM |
5654 | rather than in the current class. |
5655 | ||
5656 | ??? current_class_type affects a lot more than name lookup. This is | |
5657 | very fragile. Fortunately, it will go away when we do 2-phase name | |
5658 | binding properly. */ | |
2b59fc25 KL |
5659 | |
5660 | /* FN is already the desired FUNCTION_DECL. */ | |
5661 | push_access_scope (fn); | |
9188c363 | 5662 | |
c2ea3a40 NS |
5663 | arg = tsubst_expr (arg, DECL_TI_ARGS (fn), |
5664 | tf_error | tf_warning, NULL_TREE); | |
9188c363 | 5665 | |
2b59fc25 | 5666 | pop_access_scope (fn); |
9188c363 MM |
5667 | |
5668 | /* Make sure the default argument is reasonable. */ | |
5669 | arg = check_default_argument (type, arg); | |
5670 | ||
5671 | return arg; | |
5672 | } | |
5673 | ||
5674 | /* Substitute into all the default arguments for FN. */ | |
5675 | ||
5676 | static void | |
3a978d72 | 5677 | tsubst_default_arguments (tree fn) |
9188c363 MM |
5678 | { |
5679 | tree arg; | |
5680 | tree tmpl_args; | |
5681 | ||
5682 | tmpl_args = DECL_TI_ARGS (fn); | |
5683 | ||
5684 | /* If this function is not yet instantiated, we certainly don't need | |
5685 | its default arguments. */ | |
5686 | if (uses_template_parms (tmpl_args)) | |
5687 | return; | |
5688 | ||
5689 | for (arg = TYPE_ARG_TYPES (TREE_TYPE (fn)); | |
5690 | arg; | |
5691 | arg = TREE_CHAIN (arg)) | |
5692 | if (TREE_PURPOSE (arg)) | |
5693 | TREE_PURPOSE (arg) = tsubst_default_argument (fn, | |
5694 | TREE_VALUE (arg), | |
5695 | TREE_PURPOSE (arg)); | |
5696 | } | |
5697 | ||
ae58fa02 MM |
5698 | /* Substitute the ARGS into the T, which is a _DECL. TYPE is the |
5699 | (already computed) substitution of ARGS into TREE_TYPE (T), if | |
c2ea3a40 NS |
5700 | appropriate. Return the result of the substitution. Issue error |
5701 | and warning messages under control of COMPLAIN. */ | |
00d3396f | 5702 | |
e9659ab0 | 5703 | static tree |
3a978d72 | 5704 | tsubst_decl (tree t, tree args, tree type, tsubst_flags_t complain) |
8d08fdba | 5705 | { |
82a98427 | 5706 | location_t saved_loc; |
b370501f | 5707 | tree r = NULL_TREE; |
4b2811e9 | 5708 | tree in_decl = t; |
830bfa74 | 5709 | |
ae58fa02 | 5710 | /* Set the filename and linenumber to improve error-reporting. */ |
82a98427 | 5711 | saved_loc = input_location; |
f31686a3 | 5712 | input_location = DECL_SOURCE_LOCATION (t); |
b7484fbe | 5713 | |
8d08fdba MS |
5714 | switch (TREE_CODE (t)) |
5715 | { | |
98c1c668 JM |
5716 | case TEMPLATE_DECL: |
5717 | { | |
5718 | /* We can get here when processing a member template function | |
5719 | of a template class. */ | |
98c1c668 | 5720 | tree decl = DECL_TEMPLATE_RESULT (t); |
386b8a85 | 5721 | tree spec; |
db2767b6 | 5722 | int is_template_template_parm = DECL_TEMPLATE_TEMPLATE_PARM_P (t); |
98c1c668 | 5723 | |
db2767b6 MM |
5724 | if (!is_template_template_parm) |
5725 | { | |
36a117a5 MM |
5726 | /* We might already have an instance of this template. |
5727 | The ARGS are for the surrounding class type, so the | |
5728 | full args contain the tsubst'd args for the context, | |
5729 | plus the innermost args from the template decl. */ | |
5730 | tree tmpl_args = DECL_CLASS_TEMPLATE_P (t) | |
5731 | ? CLASSTYPE_TI_ARGS (TREE_TYPE (t)) | |
17aec3eb | 5732 | : DECL_TI_ARGS (DECL_TEMPLATE_RESULT (t)); |
7ddedda4 MM |
5733 | tree full_args; |
5734 | ||
a91db711 NS |
5735 | full_args = tsubst_template_args (tmpl_args, args, |
5736 | complain, in_decl); | |
36a117a5 | 5737 | |
a91db711 | 5738 | /* tsubst_template_args doesn't copy the vector if |
36a117a5 MM |
5739 | nothing changed. But, *something* should have |
5740 | changed. */ | |
5741 | my_friendly_assert (full_args != tmpl_args, 0); | |
5742 | ||
5743 | spec = retrieve_specialization (t, full_args); | |
db2767b6 | 5744 | if (spec != NULL_TREE) |
ae58fa02 MM |
5745 | { |
5746 | r = spec; | |
5747 | break; | |
5748 | } | |
db2767b6 | 5749 | } |
98c1c668 JM |
5750 | |
5751 | /* Make a new template decl. It will be similar to the | |
5752 | original, but will record the current template arguments. | |
5753 | We also create a new function declaration, which is just | |
5754 | like the old one, but points to this new template, rather | |
5755 | than the old one. */ | |
0acf7199 | 5756 | r = copy_decl (t); |
ae58fa02 MM |
5757 | my_friendly_assert (DECL_LANG_SPECIFIC (r) != 0, 0); |
5758 | TREE_CHAIN (r) = NULL_TREE; | |
db2767b6 MM |
5759 | |
5760 | if (is_template_template_parm) | |
5761 | { | |
c2ea3a40 | 5762 | tree new_decl = tsubst (decl, args, complain, in_decl); |
17aec3eb | 5763 | DECL_TEMPLATE_RESULT (r) = new_decl; |
ae58fa02 MM |
5764 | TREE_TYPE (r) = TREE_TYPE (new_decl); |
5765 | break; | |
db2767b6 MM |
5766 | } |
5767 | ||
ae58fa02 | 5768 | DECL_CONTEXT (r) |
4f1c5b7d | 5769 | = tsubst_aggr_type (DECL_CONTEXT (t), args, |
c2ea3a40 | 5770 | complain, in_decl, |
4393e105 | 5771 | /*entering_scope=*/1); |
ae58fa02 | 5772 | DECL_TEMPLATE_INFO (r) = build_tree_list (t, args); |
93cdc044 JM |
5773 | |
5774 | if (TREE_CODE (decl) == TYPE_DECL) | |
5775 | { | |
c2ea3a40 | 5776 | tree new_type = tsubst (TREE_TYPE (t), args, complain, in_decl); |
ae58fa02 MM |
5777 | TREE_TYPE (r) = new_type; |
5778 | CLASSTYPE_TI_TEMPLATE (new_type) = r; | |
17aec3eb | 5779 | DECL_TEMPLATE_RESULT (r) = TYPE_MAIN_DECL (new_type); |
ae58fa02 | 5780 | DECL_TI_ARGS (r) = CLASSTYPE_TI_ARGS (new_type); |
93cdc044 JM |
5781 | } |
5782 | else | |
5783 | { | |
c2ea3a40 | 5784 | tree new_decl = tsubst (decl, args, complain, in_decl); |
caec1dc0 KL |
5785 | if (new_decl == error_mark_node) |
5786 | return error_mark_node; | |
17aec3eb RK |
5787 | |
5788 | DECL_TEMPLATE_RESULT (r) = new_decl; | |
ae58fa02 MM |
5789 | DECL_TI_TEMPLATE (new_decl) = r; |
5790 | TREE_TYPE (r) = TREE_TYPE (new_decl); | |
5791 | DECL_TI_ARGS (r) = DECL_TI_ARGS (new_decl); | |
93cdc044 JM |
5792 | } |
5793 | ||
ae58fa02 MM |
5794 | SET_DECL_IMPLICIT_INSTANTIATION (r); |
5795 | DECL_TEMPLATE_INSTANTIATIONS (r) = NULL_TREE; | |
5796 | DECL_TEMPLATE_SPECIALIZATIONS (r) = NULL_TREE; | |
98c1c668 JM |
5797 | |
5798 | /* The template parameters for this new template are all the | |
5799 | template parameters for the old template, except the | |
c6002625 | 5800 | outermost level of parameters. */ |
ae58fa02 | 5801 | DECL_TEMPLATE_PARMS (r) |
4393e105 | 5802 | = tsubst_template_parms (DECL_TEMPLATE_PARMS (t), args, |
c2ea3a40 | 5803 | complain); |
98c1c668 | 5804 | |
93cdc044 | 5805 | if (PRIMARY_TEMPLATE_P (t)) |
ae58fa02 | 5806 | DECL_PRIMARY_TEMPLATE (r) = r; |
93cdc044 | 5807 | |
8c6ab2db NS |
5808 | if (TREE_CODE (decl) != TYPE_DECL) |
5809 | /* Record this non-type partial instantiation. */ | |
5810 | register_specialization (r, t, | |
5811 | DECL_TI_ARGS (DECL_TEMPLATE_RESULT (r))); | |
98c1c668 | 5812 | } |
ae58fa02 | 5813 | break; |
8d08fdba MS |
5814 | |
5815 | case FUNCTION_DECL: | |
5816 | { | |
386b8a85 | 5817 | tree ctx; |
87603ed0 | 5818 | tree argvec = NULL_TREE; |
cf38f48a | 5819 | tree *friends; |
36a117a5 | 5820 | tree gen_tmpl; |
5566b478 | 5821 | int member; |
d8c4447d MM |
5822 | int args_depth; |
5823 | int parms_depth; | |
5566b478 | 5824 | |
36a117a5 MM |
5825 | /* Nobody should be tsubst'ing into non-template functions. */ |
5826 | my_friendly_assert (DECL_TEMPLATE_INFO (t) != NULL_TREE, 0); | |
5827 | ||
5828 | if (TREE_CODE (DECL_TI_TEMPLATE (t)) == TEMPLATE_DECL) | |
5829 | { | |
5830 | tree spec; | |
00cf3e31 MM |
5831 | bool dependent_p; |
5832 | ||
5833 | /* If T is not dependent, just return it. We have to | |
5834 | increment PROCESSING_TEMPLATE_DECL because | |
5835 | value_dependent_expression_p assumes that nothing is | |
5836 | dependent when PROCESSING_TEMPLATE_DECL is zero. */ | |
5837 | ++processing_template_decl; | |
5838 | dependent_p = value_dependent_expression_p (t); | |
5839 | --processing_template_decl; | |
5840 | if (!dependent_p) | |
5841 | return t; | |
36a117a5 MM |
5842 | |
5843 | /* Calculate the most general template of which R is a | |
5844 | specialization, and the complete set of arguments used to | |
5845 | specialize R. */ | |
5846 | gen_tmpl = most_general_template (DECL_TI_TEMPLATE (t)); | |
a91db711 NS |
5847 | argvec = tsubst_template_args (DECL_TI_ARGS |
5848 | (DECL_TEMPLATE_RESULT (gen_tmpl)), | |
5849 | args, complain, in_decl); | |
36a117a5 MM |
5850 | |
5851 | /* Check to see if we already have this specialization. */ | |
5852 | spec = retrieve_specialization (gen_tmpl, argvec); | |
7ddedda4 | 5853 | |
36a117a5 | 5854 | if (spec) |
ae58fa02 MM |
5855 | { |
5856 | r = spec; | |
5857 | break; | |
5858 | } | |
d8c4447d | 5859 | |
f9a7ae04 MM |
5860 | /* We can see more levels of arguments than parameters if |
5861 | there was a specialization of a member template, like | |
5862 | this: | |
5863 | ||
5864 | template <class T> struct S { template <class U> void f(); } | |
5865 | template <> template <class U> void S<int>::f(U); | |
5866 | ||
dc957d14 | 5867 | Here, we'll be substituting into the specialization, |
f9a7ae04 MM |
5868 | because that's where we can find the code we actually |
5869 | want to generate, but we'll have enough arguments for | |
5870 | the most general template. | |
5871 | ||
5872 | We also deal with the peculiar case: | |
d8c4447d MM |
5873 | |
5874 | template <class T> struct S { | |
5875 | template <class U> friend void f(); | |
5876 | }; | |
74b846e0 | 5877 | template <class U> void f() {} |
d8c4447d MM |
5878 | template S<int>; |
5879 | template void f<double>(); | |
5880 | ||
5881 | Here, the ARGS for the instantiation of will be {int, | |
5882 | double}. But, we only need as many ARGS as there are | |
5883 | levels of template parameters in CODE_PATTERN. We are | |
5884 | careful not to get fooled into reducing the ARGS in | |
5885 | situations like: | |
5886 | ||
5887 | template <class T> struct S { template <class U> void f(U); } | |
5888 | template <class T> template <> void S<T>::f(int) {} | |
5889 | ||
5890 | which we can spot because the pattern will be a | |
5891 | specialization in this case. */ | |
5892 | args_depth = TMPL_ARGS_DEPTH (args); | |
5893 | parms_depth = | |
5894 | TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (DECL_TI_TEMPLATE (t))); | |
5895 | if (args_depth > parms_depth | |
5896 | && !DECL_TEMPLATE_SPECIALIZATION (t)) | |
f9a7ae04 | 5897 | args = get_innermost_template_args (args, parms_depth); |
36a117a5 MM |
5898 | } |
5899 | else | |
5900 | { | |
5901 | /* This special case arises when we have something like this: | |
5902 | ||
5903 | template <class T> struct S { | |
5904 | friend void f<int>(int, double); | |
5905 | }; | |
5906 | ||
5907 | Here, the DECL_TI_TEMPLATE for the friend declaration | |
10b1d5e7 MM |
5908 | will be an IDENTIFIER_NODE. We are being called from |
5909 | tsubst_friend_function, and we want only to create a | |
5910 | new decl (R) with appropriate types so that we can call | |
5911 | determine_specialization. */ | |
36a117a5 MM |
5912 | gen_tmpl = NULL_TREE; |
5913 | } | |
5914 | ||
6eb3bb27 | 5915 | if (DECL_CLASS_SCOPE_P (t)) |
8d08fdba | 5916 | { |
5566b478 MS |
5917 | if (DECL_NAME (t) == constructor_name (DECL_CONTEXT (t))) |
5918 | member = 2; | |
5919 | else | |
5920 | member = 1; | |
4f1c5b7d | 5921 | ctx = tsubst_aggr_type (DECL_CONTEXT (t), args, |
8c6ab2db | 5922 | complain, t, /*entering_scope=*/1); |
5566b478 MS |
5923 | } |
5924 | else | |
5925 | { | |
5926 | member = 0; | |
4f1c5b7d | 5927 | ctx = DECL_CONTEXT (t); |
5566b478 | 5928 | } |
c2ea3a40 | 5929 | type = tsubst (type, args, complain, in_decl); |
b3da7bb1 MM |
5930 | if (type == error_mark_node) |
5931 | return error_mark_node; | |
8d08fdba | 5932 | |
5566b478 MS |
5933 | /* We do NOT check for matching decls pushed separately at this |
5934 | point, as they may not represent instantiations of this | |
5935 | template, and in any case are considered separate under the | |
0a7394bc | 5936 | discrete model. */ |
0acf7199 | 5937 | r = copy_decl (t); |
e1467ff2 | 5938 | DECL_USE_TEMPLATE (r) = 0; |
5566b478 | 5939 | TREE_TYPE (r) = type; |
92643fea MM |
5940 | /* Clear out the mangled name and RTL for the instantiation. */ |
5941 | SET_DECL_ASSEMBLER_NAME (r, NULL_TREE); | |
5942 | SET_DECL_RTL (r, NULL_RTX); | |
5566b478 | 5943 | |
4f1c5b7d | 5944 | DECL_CONTEXT (r) = ctx; |
5566b478 | 5945 | |
1f6e1acc | 5946 | if (member && DECL_CONV_FN_P (r)) |
1f84ec23 MM |
5947 | /* Type-conversion operator. Reconstruct the name, in |
5948 | case it's the name of one of the template's parameters. */ | |
5949 | DECL_NAME (r) = mangle_conv_op_name_for_type (TREE_TYPE (type)); | |
5566b478 | 5950 | |
4393e105 | 5951 | DECL_ARGUMENTS (r) = tsubst (DECL_ARGUMENTS (t), args, |
c2ea3a40 | 5952 | complain, t); |
477f6664 | 5953 | DECL_RESULT (r) = NULL_TREE; |
711734a9 JM |
5954 | |
5955 | TREE_STATIC (r) = 0; | |
5956 | TREE_PUBLIC (r) = TREE_PUBLIC (t); | |
5957 | DECL_EXTERNAL (r) = 1; | |
5958 | DECL_INTERFACE_KNOWN (r) = 0; | |
5959 | DECL_DEFER_OUTPUT (r) = 0; | |
5960 | TREE_CHAIN (r) = NULL_TREE; | |
5961 | DECL_PENDING_INLINE_INFO (r) = 0; | |
59026e79 | 5962 | DECL_PENDING_INLINE_P (r) = 0; |
655dc6ee | 5963 | DECL_SAVED_TREE (r) = NULL_TREE; |
711734a9 | 5964 | TREE_USED (r) = 0; |
db9b2174 MM |
5965 | if (DECL_CLONED_FUNCTION (r)) |
5966 | { | |
5967 | DECL_CLONED_FUNCTION (r) = tsubst (DECL_CLONED_FUNCTION (t), | |
c2ea3a40 | 5968 | args, complain, t); |
db9b2174 MM |
5969 | TREE_CHAIN (r) = TREE_CHAIN (DECL_CLONED_FUNCTION (r)); |
5970 | TREE_CHAIN (DECL_CLONED_FUNCTION (r)) = r; | |
5971 | } | |
711734a9 | 5972 | |
92643fea MM |
5973 | /* Set up the DECL_TEMPLATE_INFO for R. There's no need to do |
5974 | this in the special friend case mentioned above where | |
5975 | GEN_TMPL is NULL. */ | |
36a117a5 | 5976 | if (gen_tmpl) |
386b8a85 | 5977 | { |
36a117a5 | 5978 | DECL_TEMPLATE_INFO (r) |
e1b3e07d | 5979 | = tree_cons (gen_tmpl, argvec, NULL_TREE); |
36a117a5 MM |
5980 | SET_DECL_IMPLICIT_INSTANTIATION (r); |
5981 | register_specialization (r, gen_tmpl, argvec); | |
5982 | ||
9188c363 MM |
5983 | /* We're not supposed to instantiate default arguments |
5984 | until they are called, for a template. But, for a | |
5985 | declaration like: | |
5986 | ||
5987 | template <class T> void f () | |
5988 | { extern void g(int i = T()); } | |
5989 | ||
5990 | we should do the substitution when the template is | |
5991 | instantiated. We handle the member function case in | |
5992 | instantiate_class_template since the default arguments | |
5993 | might refer to other members of the class. */ | |
5994 | if (!member | |
5995 | && !PRIMARY_TEMPLATE_P (gen_tmpl) | |
5996 | && !uses_template_parms (argvec)) | |
5997 | tsubst_default_arguments (r); | |
386b8a85 | 5998 | } |
f181d4ae | 5999 | |
cf38f48a MM |
6000 | /* Copy the list of befriending classes. */ |
6001 | for (friends = &DECL_BEFRIENDING_CLASSES (r); | |
6002 | *friends; | |
6003 | friends = &TREE_CHAIN (*friends)) | |
6004 | { | |
6005 | *friends = copy_node (*friends); | |
6006 | TREE_VALUE (*friends) = tsubst (TREE_VALUE (*friends), | |
c2ea3a40 | 6007 | args, complain, |
cf38f48a MM |
6008 | in_decl); |
6009 | } | |
6010 | ||
212e7048 | 6011 | if (DECL_CONSTRUCTOR_P (r) || DECL_DESTRUCTOR_P (r)) |
f181d4ae MM |
6012 | { |
6013 | maybe_retrofit_in_chrg (r); | |
212e7048 MM |
6014 | if (DECL_CONSTRUCTOR_P (r)) |
6015 | grok_ctor_properties (ctx, r); | |
2be678ff JM |
6016 | /* If this is an instantiation of a member template, clone it. |
6017 | If it isn't, that'll be handled by | |
6018 | clone_constructors_and_destructors. */ | |
5e818b93 | 6019 | if (PRIMARY_TEMPLATE_P (gen_tmpl)) |
271e6f02 | 6020 | clone_function_decl (r, /*update_method_vec_p=*/0); |
f181d4ae | 6021 | } |
596ea4e5 | 6022 | else if (IDENTIFIER_OPNAME_P (DECL_NAME (r))) |
4b0d3cbe MM |
6023 | grok_op_properties (r, DECL_FRIEND_P (r), |
6024 | (complain & tf_error) != 0); | |
8d08fdba | 6025 | } |
ae58fa02 | 6026 | break; |
8d08fdba MS |
6027 | |
6028 | case PARM_DECL: | |
6029 | { | |
ae58fa02 | 6030 | r = copy_node (t); |
833aa4c4 NS |
6031 | if (DECL_TEMPLATE_PARM_P (t)) |
6032 | SET_DECL_TEMPLATE_PARM_P (r); | |
8e51619a | 6033 | |
5566b478 | 6034 | TREE_TYPE (r) = type; |
89d684bb | 6035 | c_apply_type_quals_to_decl (cp_type_quals (type), r); |
1b8899d1 | 6036 | |
560ad596 MM |
6037 | if (DECL_INITIAL (r)) |
6038 | { | |
6039 | if (TREE_CODE (DECL_INITIAL (r)) != TEMPLATE_PARM_INDEX) | |
6040 | DECL_INITIAL (r) = TREE_TYPE (r); | |
6041 | else | |
6042 | DECL_INITIAL (r) = tsubst (DECL_INITIAL (r), args, | |
6043 | complain, in_decl); | |
6044 | } | |
db2767b6 | 6045 | |
5566b478 | 6046 | DECL_CONTEXT (r) = NULL_TREE; |
8e51619a JM |
6047 | |
6048 | if (!DECL_TEMPLATE_PARM_P (r)) | |
6049 | DECL_ARG_TYPE (r) = type_passed_as (type); | |
8d08fdba | 6050 | if (TREE_CHAIN (t)) |
4393e105 | 6051 | TREE_CHAIN (r) = tsubst (TREE_CHAIN (t), args, |
c2ea3a40 | 6052 | complain, TREE_CHAIN (t)); |
8d08fdba | 6053 | } |
ae58fa02 | 6054 | break; |
8d08fdba | 6055 | |
5566b478 MS |
6056 | case FIELD_DECL: |
6057 | { | |
0acf7199 | 6058 | r = copy_decl (t); |
1b8899d1 | 6059 | TREE_TYPE (r) = type; |
89d684bb | 6060 | c_apply_type_quals_to_decl (cp_type_quals (type), r); |
1b8899d1 MM |
6061 | |
6062 | /* We don't have to set DECL_CONTEXT here; it is set by | |
6063 | finish_member_declaration. */ | |
4393e105 | 6064 | DECL_INITIAL (r) = tsubst_expr (DECL_INITIAL (t), args, |
c2ea3a40 | 6065 | complain, in_decl); |
5566b478 | 6066 | TREE_CHAIN (r) = NULL_TREE; |
dfbb4f34 NS |
6067 | if (VOID_TYPE_P (type)) |
6068 | cp_error_at ("instantiation of `%D' as type `%T'", r, type); | |
5566b478 | 6069 | } |
ae58fa02 | 6070 | break; |
5566b478 MS |
6071 | |
6072 | case USING_DECL: | |
6073 | { | |
ae58fa02 | 6074 | r = copy_node (t); |
fd9aef9d NS |
6075 | /* It is not a dependent using decl any more. */ |
6076 | TREE_TYPE (r) = void_type_node; | |
5566b478 | 6077 | DECL_INITIAL (r) |
c2ea3a40 | 6078 | = tsubst_copy (DECL_INITIAL (t), args, complain, in_decl); |
5566b478 | 6079 | TREE_CHAIN (r) = NULL_TREE; |
5566b478 | 6080 | } |
ae58fa02 | 6081 | break; |
5566b478 | 6082 | |
9188c363 | 6083 | case TYPE_DECL: |
88e1b92a JM |
6084 | if (TREE_CODE (type) == TEMPLATE_TEMPLATE_PARM |
6085 | || t == TYPE_MAIN_DECL (TREE_TYPE (t))) | |
9188c363 | 6086 | { |
88e1b92a JM |
6087 | /* If this is the canonical decl, we don't have to mess with |
6088 | instantiations, and often we can't (for typename, template | |
6089 | type parms and such). Note that TYPE_NAME is not correct for | |
6090 | the above test if we've copied the type for a typedef. */ | |
b9f39201 | 6091 | r = TYPE_NAME (type); |
9188c363 MM |
6092 | break; |
6093 | } | |
6094 | ||
6095 | /* Fall through. */ | |
6096 | ||
5566b478 MS |
6097 | case VAR_DECL: |
6098 | { | |
1cea0434 KG |
6099 | tree argvec = NULL_TREE; |
6100 | tree gen_tmpl = NULL_TREE; | |
36a117a5 | 6101 | tree spec; |
1cea0434 | 6102 | tree tmpl = NULL_TREE; |
9188c363 | 6103 | tree ctx; |
6dfbb909 | 6104 | int local_p; |
9188c363 | 6105 | |
6dfbb909 MM |
6106 | /* Assume this is a non-local variable. */ |
6107 | local_p = 0; | |
5566b478 | 6108 | |
de96bf57 | 6109 | if (TYPE_P (CP_DECL_CONTEXT (t))) |
9188c363 | 6110 | ctx = tsubst_aggr_type (DECL_CONTEXT (t), args, |
c2ea3a40 | 6111 | complain, |
9188c363 | 6112 | in_decl, /*entering_scope=*/1); |
2ba9c47e MM |
6113 | else if (DECL_NAMESPACE_SCOPE_P (t)) |
6114 | ctx = DECL_CONTEXT (t); | |
9188c363 | 6115 | else |
6dfbb909 MM |
6116 | { |
6117 | /* Subsequent calls to pushdecl will fill this in. */ | |
6118 | ctx = NULL_TREE; | |
2ba9c47e | 6119 | local_p = 1; |
6dfbb909 | 6120 | } |
9188c363 | 6121 | |
36a117a5 | 6122 | /* Check to see if we already have this specialization. */ |
6dfbb909 MM |
6123 | if (!local_p) |
6124 | { | |
6125 | tmpl = DECL_TI_TEMPLATE (t); | |
6126 | gen_tmpl = most_general_template (tmpl); | |
c2ea3a40 | 6127 | argvec = tsubst (DECL_TI_ARGS (t), args, complain, in_decl); |
6dfbb909 MM |
6128 | spec = retrieve_specialization (gen_tmpl, argvec); |
6129 | } | |
9188c363 | 6130 | else |
6dfbb909 | 6131 | spec = retrieve_local_specialization (t); |
9188c363 | 6132 | |
36a117a5 | 6133 | if (spec) |
ae58fa02 MM |
6134 | { |
6135 | r = spec; | |
6136 | break; | |
6137 | } | |
5566b478 | 6138 | |
0acf7199 | 6139 | r = copy_decl (t); |
edebf865 | 6140 | if (TREE_CODE (r) == VAR_DECL) |
39703eb9 MM |
6141 | { |
6142 | type = complete_type (type); | |
6143 | DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (r) | |
6144 | = DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (t); | |
6145 | } | |
a3d87771 MM |
6146 | else if (DECL_SELF_REFERENCE_P (t)) |
6147 | SET_DECL_SELF_REFERENCE_P (r); | |
01f4137f | 6148 | TREE_TYPE (r) = type; |
89d684bb | 6149 | c_apply_type_quals_to_decl (cp_type_quals (type), r); |
5566b478 | 6150 | DECL_CONTEXT (r) = ctx; |
92643fea MM |
6151 | /* Clear out the mangled name and RTL for the instantiation. */ |
6152 | SET_DECL_ASSEMBLER_NAME (r, NULL_TREE); | |
6153 | SET_DECL_RTL (r, NULL_RTX); | |
d11ad92e MS |
6154 | |
6155 | /* Don't try to expand the initializer until someone tries to use | |
6156 | this variable; otherwise we run into circular dependencies. */ | |
6157 | DECL_INITIAL (r) = NULL_TREE; | |
19e7881c | 6158 | SET_DECL_RTL (r, NULL_RTX); |
06ceef4e | 6159 | DECL_SIZE (r) = DECL_SIZE_UNIT (r) = 0; |
5566b478 | 6160 | |
e0942dcd MM |
6161 | /* Even if the original location is out of scope, the newly |
6162 | substituted one is not. */ | |
6163 | if (TREE_CODE (r) == VAR_DECL) | |
17bbb839 MM |
6164 | { |
6165 | DECL_DEAD_FOR_LOCAL (r) = 0; | |
6166 | DECL_INITIALIZED_P (r) = 0; | |
6167 | } | |
e0942dcd | 6168 | |
6dfbb909 MM |
6169 | if (!local_p) |
6170 | { | |
6171 | /* A static data member declaration is always marked | |
6172 | external when it is declared in-class, even if an | |
6173 | initializer is present. We mimic the non-template | |
6174 | processing here. */ | |
6175 | DECL_EXTERNAL (r) = 1; | |
fa8d6e85 | 6176 | |
6dfbb909 MM |
6177 | register_specialization (r, gen_tmpl, argvec); |
6178 | DECL_TEMPLATE_INFO (r) = tree_cons (tmpl, argvec, NULL_TREE); | |
6179 | SET_DECL_IMPLICIT_INSTANTIATION (r); | |
6180 | } | |
9188c363 | 6181 | else |
6dfbb909 | 6182 | register_local_specialization (r, t); |
5566b478 | 6183 | |
5566b478 | 6184 | TREE_CHAIN (r) = NULL_TREE; |
dfbb4f34 NS |
6185 | if (TREE_CODE (r) == VAR_DECL && VOID_TYPE_P (type)) |
6186 | cp_error_at ("instantiation of `%D' as type `%T'", r, type); | |
edebf865 MM |
6187 | /* Compute the size, alignment, etc. of R. */ |
6188 | layout_decl (r, 0); | |
5566b478 | 6189 | } |
ae58fa02 | 6190 | break; |
5566b478 | 6191 | |
ae58fa02 | 6192 | default: |
a98facb0 | 6193 | abort (); |
ae58fa02 MM |
6194 | } |
6195 | ||
6196 | /* Restore the file and line information. */ | |
82a98427 | 6197 | input_location = saved_loc; |
ae58fa02 MM |
6198 | |
6199 | return r; | |
6200 | } | |
6201 | ||
34cd5ae7 | 6202 | /* Substitute into the ARG_TYPES of a function type. */ |
cabc336a | 6203 | |
e9659ab0 | 6204 | static tree |
3a978d72 NN |
6205 | tsubst_arg_types (tree arg_types, |
6206 | tree args, | |
6207 | tsubst_flags_t complain, | |
6208 | tree in_decl) | |
cabc336a MM |
6209 | { |
6210 | tree remaining_arg_types; | |
cabc336a MM |
6211 | tree type; |
6212 | ||
6213 | if (!arg_types || arg_types == void_list_node) | |
6214 | return arg_types; | |
6215 | ||
6216 | remaining_arg_types = tsubst_arg_types (TREE_CHAIN (arg_types), | |
4393e105 MM |
6217 | args, complain, in_decl); |
6218 | if (remaining_arg_types == error_mark_node) | |
6219 | return error_mark_node; | |
6220 | ||
6221 | type = tsubst (TREE_VALUE (arg_types), args, complain, in_decl); | |
6222 | if (type == error_mark_node) | |
6223 | return error_mark_node; | |
4b2811e9 NS |
6224 | if (VOID_TYPE_P (type)) |
6225 | { | |
c2ea3a40 | 6226 | if (complain & tf_error) |
4b2811e9 | 6227 | { |
33bd39a2 | 6228 | error ("invalid parameter type `%T'", type); |
4b2811e9 NS |
6229 | if (in_decl) |
6230 | cp_error_at ("in declaration `%D'", in_decl); | |
6231 | } | |
6232 | return error_mark_node; | |
6233 | } | |
cabc336a | 6234 | |
4393e105 MM |
6235 | /* Do array-to-pointer, function-to-pointer conversion, and ignore |
6236 | top-level qualifiers as required. */ | |
6237 | type = TYPE_MAIN_VARIANT (type_decays_to (type)); | |
cabc336a MM |
6238 | |
6239 | /* Note that we do not substitute into default arguments here. The | |
6240 | standard mandates that they be instantiated only when needed, | |
6241 | which is done in build_over_call. */ | |
51632249 JM |
6242 | return hash_tree_cons (TREE_PURPOSE (arg_types), type, |
6243 | remaining_arg_types); | |
cabc336a MM |
6244 | |
6245 | } | |
6246 | ||
4393e105 MM |
6247 | /* Substitute into a FUNCTION_TYPE or METHOD_TYPE. This routine does |
6248 | *not* handle the exception-specification for FNTYPE, because the | |
6249 | initial substitution of explicitly provided template parameters | |
6250 | during argument deduction forbids substitution into the | |
6251 | exception-specification: | |
6252 | ||
6253 | [temp.deduct] | |
6254 | ||
6255 | All references in the function type of the function template to the | |
6256 | corresponding template parameters are replaced by the specified tem- | |
6257 | plate argument values. If a substitution in a template parameter or | |
6258 | in the function type of the function template results in an invalid | |
6259 | type, type deduction fails. [Note: The equivalent substitution in | |
6260 | exception specifications is done only when the function is instanti- | |
6261 | ated, at which point a program is ill-formed if the substitution | |
6262 | results in an invalid type.] */ | |
6263 | ||
6264 | static tree | |
3a978d72 NN |
6265 | tsubst_function_type (tree t, |
6266 | tree args, | |
6267 | tsubst_flags_t complain, | |
6268 | tree in_decl) | |
4393e105 MM |
6269 | { |
6270 | tree return_type; | |
6271 | tree arg_types; | |
6272 | tree fntype; | |
6273 | ||
8dd3f57a | 6274 | /* The TYPE_CONTEXT is not used for function/method types. */ |
4393e105 MM |
6275 | my_friendly_assert (TYPE_CONTEXT (t) == NULL_TREE, 0); |
6276 | ||
46c895ac | 6277 | /* Substitute the return type. */ |
4393e105 MM |
6278 | return_type = tsubst (TREE_TYPE (t), args, complain, in_decl); |
6279 | if (return_type == error_mark_node) | |
6280 | return error_mark_node; | |
6281 | ||
34cd5ae7 | 6282 | /* Substitute the argument types. */ |
4393e105 MM |
6283 | arg_types = tsubst_arg_types (TYPE_ARG_TYPES (t), args, |
6284 | complain, in_decl); | |
6285 | if (arg_types == error_mark_node) | |
6286 | return error_mark_node; | |
6287 | ||
6288 | /* Construct a new type node and return it. */ | |
6289 | if (TREE_CODE (t) == FUNCTION_TYPE) | |
6290 | fntype = build_function_type (return_type, arg_types); | |
6291 | else | |
6292 | { | |
6293 | tree r = TREE_TYPE (TREE_VALUE (arg_types)); | |
6294 | if (! IS_AGGR_TYPE (r)) | |
6295 | { | |
6296 | /* [temp.deduct] | |
6297 | ||
6298 | Type deduction may fail for any of the following | |
6299 | reasons: | |
6300 | ||
6301 | -- Attempting to create "pointer to member of T" when T | |
6302 | is not a class type. */ | |
c2ea3a40 | 6303 | if (complain & tf_error) |
33bd39a2 | 6304 | error ("creating pointer to member function of non-class type `%T'", |
4393e105 MM |
6305 | r); |
6306 | return error_mark_node; | |
6307 | } | |
6308 | ||
43dc123f MM |
6309 | fntype = build_method_type_directly (r, return_type, |
6310 | TREE_CHAIN (arg_types)); | |
4393e105 | 6311 | } |
c2ea3a40 | 6312 | fntype = cp_build_qualified_type_real (fntype, TYPE_QUALS (t), complain); |
ada846eb | 6313 | fntype = build_type_attribute_variant (fntype, TYPE_ATTRIBUTES (t)); |
4393e105 MM |
6314 | |
6315 | return fntype; | |
6316 | } | |
6317 | ||
297e73d8 MM |
6318 | /* Substitute into the PARMS of a call-declarator. */ |
6319 | ||
e9659ab0 | 6320 | static tree |
3a978d72 NN |
6321 | tsubst_call_declarator_parms (tree parms, |
6322 | tree args, | |
6323 | tsubst_flags_t complain, | |
6324 | tree in_decl) | |
297e73d8 MM |
6325 | { |
6326 | tree new_parms; | |
6327 | tree type; | |
6328 | tree defarg; | |
6329 | ||
6330 | if (!parms || parms == void_list_node) | |
6331 | return parms; | |
6332 | ||
6333 | new_parms = tsubst_call_declarator_parms (TREE_CHAIN (parms), | |
4393e105 | 6334 | args, complain, in_decl); |
297e73d8 MM |
6335 | |
6336 | /* Figure out the type of this parameter. */ | |
4393e105 | 6337 | type = tsubst (TREE_VALUE (parms), args, complain, in_decl); |
297e73d8 MM |
6338 | |
6339 | /* Figure out the default argument as well. Note that we use | |
4393e105 MM |
6340 | tsubst_expr since the default argument is really an expression. */ |
6341 | defarg = tsubst_expr (TREE_PURPOSE (parms), args, complain, in_decl); | |
297e73d8 MM |
6342 | |
6343 | /* Chain this parameter on to the front of those we have already | |
6344 | processed. We don't use hash_tree_cons because that function | |
6345 | doesn't check TREE_PARMLIST. */ | |
6346 | new_parms = tree_cons (defarg, type, new_parms); | |
6347 | ||
6348 | /* And note that these are parameters. */ | |
6349 | TREE_PARMLIST (new_parms) = 1; | |
6350 | ||
6351 | return new_parms; | |
6352 | } | |
6353 | ||
4393e105 MM |
6354 | /* Take the tree structure T and replace template parameters used |
6355 | therein with the argument vector ARGS. IN_DECL is an associated | |
6356 | decl for diagnostics. If an error occurs, returns ERROR_MARK_NODE. | |
c2ea3a40 NS |
6357 | Issue error and warning messages under control of COMPLAIN. Note |
6358 | that we must be relatively non-tolerant of extensions here, in | |
6359 | order to preserve conformance; if we allow substitutions that | |
6360 | should not be allowed, we may allow argument deductions that should | |
6361 | not succeed, and therefore report ambiguous overload situations | |
6362 | where there are none. In theory, we could allow the substitution, | |
6363 | but indicate that it should have failed, and allow our caller to | |
6364 | make sure that the right thing happens, but we don't try to do this | |
6365 | yet. | |
4393e105 MM |
6366 | |
6367 | This function is used for dealing with types, decls and the like; | |
6368 | for expressions, use tsubst_expr or tsubst_copy. */ | |
ae58fa02 | 6369 | |
14d22dd6 | 6370 | static tree |
3a978d72 | 6371 | tsubst (tree t, tree args, tsubst_flags_t complain, tree in_decl) |
ae58fa02 | 6372 | { |
0ecfe0b4 | 6373 | tree type, r; |
ae58fa02 MM |
6374 | |
6375 | if (t == NULL_TREE || t == error_mark_node | |
6376 | || t == integer_type_node | |
6377 | || t == void_type_node | |
6378 | || t == char_type_node | |
6379 | || TREE_CODE (t) == NAMESPACE_DECL) | |
6380 | return t; | |
6381 | ||
6382 | if (TREE_CODE (t) == IDENTIFIER_NODE) | |
6383 | type = IDENTIFIER_TYPE_VALUE (t); | |
6384 | else | |
6385 | type = TREE_TYPE (t); | |
399dedb9 | 6386 | |
fd9aef9d | 6387 | my_friendly_assert (type != unknown_type_node, 20030716); |
ae58fa02 MM |
6388 | |
6389 | if (type && TREE_CODE (t) != FUNCTION_DECL | |
6390 | && TREE_CODE (t) != TYPENAME_TYPE | |
6391 | && TREE_CODE (t) != TEMPLATE_DECL | |
4393e105 MM |
6392 | && TREE_CODE (t) != IDENTIFIER_NODE |
6393 | && TREE_CODE (t) != FUNCTION_TYPE | |
6394 | && TREE_CODE (t) != METHOD_TYPE) | |
6395 | type = tsubst (type, args, complain, in_decl); | |
6396 | if (type == error_mark_node) | |
6397 | return error_mark_node; | |
ae58fa02 | 6398 | |
2f939d94 | 6399 | if (DECL_P (t)) |
c2ea3a40 | 6400 | return tsubst_decl (t, args, type, complain); |
ae58fa02 MM |
6401 | |
6402 | switch (TREE_CODE (t)) | |
6403 | { | |
6404 | case RECORD_TYPE: | |
6405 | case UNION_TYPE: | |
6406 | case ENUMERAL_TYPE: | |
4393e105 MM |
6407 | return tsubst_aggr_type (t, args, complain, in_decl, |
6408 | /*entering_scope=*/0); | |
ae58fa02 MM |
6409 | |
6410 | case ERROR_MARK: | |
6411 | case IDENTIFIER_NODE: | |
ae58fa02 MM |
6412 | case VOID_TYPE: |
6413 | case REAL_TYPE: | |
6414 | case COMPLEX_TYPE: | |
c00996a3 | 6415 | case VECTOR_TYPE: |
ae58fa02 MM |
6416 | case BOOLEAN_TYPE: |
6417 | case INTEGER_CST: | |
6418 | case REAL_CST: | |
6419 | case STRING_CST: | |
6420 | return t; | |
6421 | ||
6422 | case INTEGER_TYPE: | |
6423 | if (t == integer_type_node) | |
6424 | return t; | |
6425 | ||
6426 | if (TREE_CODE (TYPE_MIN_VALUE (t)) == INTEGER_CST | |
6427 | && TREE_CODE (TYPE_MAX_VALUE (t)) == INTEGER_CST) | |
6428 | return t; | |
d2e5ee5c | 6429 | |
5566b478 | 6430 | { |
ddce3528 | 6431 | tree max, omax = TREE_OPERAND (TYPE_MAX_VALUE (t), 0); |
7ddedda4 | 6432 | |
a91db711 NS |
6433 | /* The array dimension behaves like a non-type template arg, |
6434 | in that we want to fold it as much as possible. */ | |
6435 | max = tsubst_template_arg (omax, args, complain, in_decl); | |
fc611ce0 | 6436 | if (!processing_template_decl) |
8dd3f57a MM |
6437 | max = decl_constant_value (max); |
6438 | ||
856216bb MM |
6439 | if (processing_template_decl |
6440 | /* When providing explicit arguments to a template | |
6441 | function, but leaving some arguments for subsequent | |
6442 | deduction, MAX may be template-dependent even if we're | |
c95cd22e JM |
6443 | not PROCESSING_TEMPLATE_DECL. We still need to check for |
6444 | template parms, though; MAX won't be an INTEGER_CST for | |
6445 | dynamic arrays, either. */ | |
6446 | || (TREE_CODE (max) != INTEGER_CST | |
6447 | && uses_template_parms (max))) | |
ae58fa02 | 6448 | { |
8dd3f57a MM |
6449 | tree itype = make_node (INTEGER_TYPE); |
6450 | TYPE_MIN_VALUE (itype) = size_zero_node; | |
6451 | TYPE_MAX_VALUE (itype) = build_min (MINUS_EXPR, sizetype, max, | |
6452 | integer_one_node); | |
6453 | return itype; | |
ae58fa02 MM |
6454 | } |
6455 | ||
ddce3528 JM |
6456 | if (integer_zerop (omax)) |
6457 | { | |
6458 | /* Still allow an explicit array of size zero. */ | |
6459 | if (pedantic) | |
6460 | pedwarn ("creating array with size zero"); | |
6461 | } | |
07c88314 MM |
6462 | else if (integer_zerop (max) |
6463 | || (TREE_CODE (max) == INTEGER_CST | |
6464 | && INT_CST_LT (max, integer_zero_node))) | |
0ecfe0b4 | 6465 | { |
4393e105 MM |
6466 | /* [temp.deduct] |
6467 | ||
6468 | Type deduction may fail for any of the following | |
6469 | reasons: | |
6470 | ||
bf8f3f93 MM |
6471 | Attempting to create an array with a size that is |
6472 | zero or negative. */ | |
c2ea3a40 | 6473 | if (complain & tf_error) |
33bd39a2 | 6474 | error ("creating array with size zero (`%E')", max); |
4393e105 MM |
6475 | |
6476 | return error_mark_node; | |
0ecfe0b4 JM |
6477 | } |
6478 | ||
c95cd22e | 6479 | return compute_array_index_type (NULL_TREE, max); |
ae58fa02 MM |
6480 | } |
6481 | ||
6482 | case TEMPLATE_TYPE_PARM: | |
6483 | case TEMPLATE_TEMPLATE_PARM: | |
a1281f45 | 6484 | case BOUND_TEMPLATE_TEMPLATE_PARM: |
ae58fa02 MM |
6485 | case TEMPLATE_PARM_INDEX: |
6486 | { | |
6487 | int idx; | |
6488 | int level; | |
6489 | int levels; | |
0ecfe0b4 JM |
6490 | |
6491 | r = NULL_TREE; | |
ae58fa02 MM |
6492 | |
6493 | if (TREE_CODE (t) == TEMPLATE_TYPE_PARM | |
a1281f45 KL |
6494 | || TREE_CODE (t) == TEMPLATE_TEMPLATE_PARM |
6495 | || TREE_CODE (t) == BOUND_TEMPLATE_TEMPLATE_PARM) | |
ae58fa02 MM |
6496 | { |
6497 | idx = TEMPLATE_TYPE_IDX (t); | |
6498 | level = TEMPLATE_TYPE_LEVEL (t); | |
6499 | } | |
6500 | else | |
6501 | { | |
6502 | idx = TEMPLATE_PARM_IDX (t); | |
6503 | level = TEMPLATE_PARM_LEVEL (t); | |
6504 | } | |
6505 | ||
6506 | if (TREE_VEC_LENGTH (args) > 0) | |
6507 | { | |
6508 | tree arg = NULL_TREE; | |
6509 | ||
6510 | levels = TMPL_ARGS_DEPTH (args); | |
6511 | if (level <= levels) | |
6512 | arg = TMPL_ARG (args, level, idx); | |
6513 | ||
8b5b8b7c MM |
6514 | if (arg == error_mark_node) |
6515 | return error_mark_node; | |
6516 | else if (arg != NULL_TREE) | |
ae58fa02 MM |
6517 | { |
6518 | if (TREE_CODE (t) == TEMPLATE_TYPE_PARM) | |
6519 | { | |
2f939d94 | 6520 | my_friendly_assert (TYPE_P (arg), 0); |
adecb3f4 | 6521 | return cp_build_qualified_type_real |
89d684bb | 6522 | (arg, cp_type_quals (arg) | cp_type_quals (t), |
4f2b0fb2 | 6523 | complain | tf_ignore_bad_quals); |
ae58fa02 | 6524 | } |
a1281f45 | 6525 | else if (TREE_CODE (t) == BOUND_TEMPLATE_TEMPLATE_PARM) |
ae58fa02 | 6526 | { |
a1281f45 KL |
6527 | /* We are processing a type constructed from |
6528 | a template template parameter */ | |
6529 | tree argvec = tsubst (TYPE_TI_ARGS (t), | |
6530 | args, complain, in_decl); | |
6531 | if (argvec == error_mark_node) | |
6532 | return error_mark_node; | |
4393e105 | 6533 | |
a1281f45 KL |
6534 | /* We can get a TEMPLATE_TEMPLATE_PARM here when |
6535 | we are resolving nested-types in the signature of | |
6536 | a member function templates. | |
6537 | Otherwise ARG is a TEMPLATE_DECL and is the real | |
6538 | template to be instantiated. */ | |
6539 | if (TREE_CODE (arg) == TEMPLATE_TEMPLATE_PARM) | |
6540 | arg = TYPE_NAME (arg); | |
6541 | ||
6542 | r = lookup_template_class (arg, | |
6543 | argvec, in_decl, | |
6544 | DECL_CONTEXT (arg), | |
f9c244b8 NS |
6545 | /*entering_scope=*/0, |
6546 | complain); | |
c2ea3a40 NS |
6547 | return cp_build_qualified_type_real |
6548 | (r, TYPE_QUALS (t), complain); | |
ae58fa02 MM |
6549 | } |
6550 | else | |
a1281f45 | 6551 | /* TEMPLATE_TEMPLATE_PARM or TEMPLATE_PARM_INDEX. */ |
ae58fa02 MM |
6552 | return arg; |
6553 | } | |
6554 | } | |
51924768 | 6555 | else |
a98facb0 | 6556 | abort (); |
ae58fa02 MM |
6557 | |
6558 | if (level == 1) | |
6559 | /* This can happen during the attempted tsubst'ing in | |
6560 | unify. This means that we don't yet have any information | |
6561 | about the template parameter in question. */ | |
6562 | return t; | |
6563 | ||
6564 | /* If we get here, we must have been looking at a parm for a | |
6565 | more deeply nested template. Make a new version of this | |
6566 | template parameter, but with a lower level. */ | |
6567 | switch (TREE_CODE (t)) | |
6568 | { | |
6569 | case TEMPLATE_TYPE_PARM: | |
6570 | case TEMPLATE_TEMPLATE_PARM: | |
a1281f45 | 6571 | case BOUND_TEMPLATE_TEMPLATE_PARM: |
89d684bb | 6572 | if (cp_type_quals (t)) |
ae58fa02 | 6573 | { |
9ccf6541 | 6574 | r = tsubst (TYPE_MAIN_VARIANT (t), args, complain, in_decl); |
4f2b0fb2 NS |
6575 | r = cp_build_qualified_type_real |
6576 | (r, cp_type_quals (t), | |
6577 | complain | (TREE_CODE (t) == TEMPLATE_TYPE_PARM | |
6578 | ? tf_ignore_bad_quals : 0)); | |
9ccf6541 MM |
6579 | } |
6580 | else | |
6581 | { | |
11e74ea6 | 6582 | r = copy_type (t); |
9ccf6541 MM |
6583 | TEMPLATE_TYPE_PARM_INDEX (r) |
6584 | = reduce_template_parm_level (TEMPLATE_TYPE_PARM_INDEX (t), | |
6585 | r, levels); | |
6586 | TYPE_STUB_DECL (r) = TYPE_NAME (r) = TEMPLATE_TYPE_DECL (r); | |
6587 | TYPE_MAIN_VARIANT (r) = r; | |
6588 | TYPE_POINTER_TO (r) = NULL_TREE; | |
6589 | TYPE_REFERENCE_TO (r) = NULL_TREE; | |
6590 | ||
a1281f45 | 6591 | if (TREE_CODE (t) == BOUND_TEMPLATE_TEMPLATE_PARM) |
9ccf6541 MM |
6592 | { |
6593 | tree argvec = tsubst (TYPE_TI_ARGS (t), args, | |
6594 | complain, in_decl); | |
6595 | if (argvec == error_mark_node) | |
6596 | return error_mark_node; | |
4393e105 | 6597 | |
9ccf6541 MM |
6598 | TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (r) |
6599 | = tree_cons (TYPE_TI_TEMPLATE (t), argvec, NULL_TREE); | |
6600 | } | |
ae58fa02 MM |
6601 | } |
6602 | break; | |
6603 | ||
6604 | case TEMPLATE_PARM_INDEX: | |
6605 | r = reduce_template_parm_level (t, type, levels); | |
6606 | break; | |
6607 | ||
6608 | default: | |
a98facb0 | 6609 | abort (); |
ae58fa02 MM |
6610 | } |
6611 | ||
5566b478 | 6612 | return r; |
ae58fa02 | 6613 | } |
5566b478 | 6614 | |
8d08fdba MS |
6615 | case TREE_LIST: |
6616 | { | |
6617 | tree purpose, value, chain, result; | |
8d08fdba MS |
6618 | |
6619 | if (t == void_list_node) | |
6620 | return t; | |
6621 | ||
8d08fdba MS |
6622 | purpose = TREE_PURPOSE (t); |
6623 | if (purpose) | |
4393e105 MM |
6624 | { |
6625 | purpose = tsubst (purpose, args, complain, in_decl); | |
6626 | if (purpose == error_mark_node) | |
6627 | return error_mark_node; | |
6628 | } | |
8d08fdba MS |
6629 | value = TREE_VALUE (t); |
6630 | if (value) | |
4393e105 MM |
6631 | { |
6632 | value = tsubst (value, args, complain, in_decl); | |
6633 | if (value == error_mark_node) | |
6634 | return error_mark_node; | |
6635 | } | |
8d08fdba MS |
6636 | chain = TREE_CHAIN (t); |
6637 | if (chain && chain != void_type_node) | |
4393e105 MM |
6638 | { |
6639 | chain = tsubst (chain, args, complain, in_decl); | |
6640 | if (chain == error_mark_node) | |
6641 | return error_mark_node; | |
6642 | } | |
8d08fdba MS |
6643 | if (purpose == TREE_PURPOSE (t) |
6644 | && value == TREE_VALUE (t) | |
6645 | && chain == TREE_CHAIN (t)) | |
6646 | return t; | |
cbd5937a MM |
6647 | if (TREE_PARMLIST (t)) |
6648 | { | |
6649 | result = tree_cons (purpose, value, chain); | |
6650 | TREE_PARMLIST (result) = 1; | |
6651 | } | |
6652 | else | |
6653 | result = hash_tree_cons (purpose, value, chain); | |
8d08fdba MS |
6654 | return result; |
6655 | } | |
6656 | case TREE_VEC: | |
5566b478 MS |
6657 | if (type != NULL_TREE) |
6658 | { | |
1ceaad38 JM |
6659 | /* A binfo node. We always need to make a copy, of the node |
6660 | itself and of its BINFO_BASETYPES. */ | |
85b71cf2 | 6661 | |
5566b478 MS |
6662 | t = copy_node (t); |
6663 | ||
c7449f2b JM |
6664 | /* Make sure type isn't a typedef copy. */ |
6665 | type = BINFO_TYPE (TYPE_BINFO (type)); | |
6666 | ||
5566b478 | 6667 | TREE_TYPE (t) = complete_type (type); |
6633d636 MS |
6668 | if (IS_AGGR_TYPE (type)) |
6669 | { | |
6670 | BINFO_VTABLE (t) = TYPE_BINFO_VTABLE (type); | |
6671 | BINFO_VIRTUALS (t) = TYPE_BINFO_VIRTUALS (type); | |
6672 | if (TYPE_BINFO_BASETYPES (type) != NULL_TREE) | |
6673 | BINFO_BASETYPES (t) = copy_node (TYPE_BINFO_BASETYPES (type)); | |
6674 | } | |
5566b478 MS |
6675 | return t; |
6676 | } | |
85b71cf2 JM |
6677 | |
6678 | /* Otherwise, a vector of template arguments. */ | |
a91db711 | 6679 | return tsubst_template_args (t, args, complain, in_decl); |
8d08fdba | 6680 | |
8d08fdba MS |
6681 | case POINTER_TYPE: |
6682 | case REFERENCE_TYPE: | |
6683 | { | |
8d08fdba | 6684 | enum tree_code code; |
79a7c7fa | 6685 | |
46c895ac | 6686 | if (type == TREE_TYPE (t) && TREE_CODE (type) != METHOD_TYPE) |
8d08fdba MS |
6687 | return t; |
6688 | ||
6689 | code = TREE_CODE (t); | |
4393e105 MM |
6690 | |
6691 | ||
6692 | /* [temp.deduct] | |
6693 | ||
6694 | Type deduction may fail for any of the following | |
6695 | reasons: | |
6696 | ||
6697 | -- Attempting to create a pointer to reference type. | |
6698 | -- Attempting to create a reference to a reference type or | |
6699 | a reference to void. */ | |
0ecfe0b4 JM |
6700 | if (TREE_CODE (type) == REFERENCE_TYPE |
6701 | || (code == REFERENCE_TYPE && TREE_CODE (type) == VOID_TYPE)) | |
79a7c7fa | 6702 | { |
82a98427 | 6703 | static location_t last_loc; |
79a7c7fa JM |
6704 | |
6705 | /* We keep track of the last time we issued this error | |
6706 | message to avoid spewing a ton of messages during a | |
6707 | single bad template instantiation. */ | |
c2ea3a40 | 6708 | if (complain & tf_error |
82a98427 NS |
6709 | && (last_loc.line != input_line |
6710 | || last_loc.file != input_filename)) | |
79a7c7fa | 6711 | { |
0ecfe0b4 | 6712 | if (TREE_CODE (type) == VOID_TYPE) |
33bd39a2 | 6713 | error ("forming reference to void"); |
0ecfe0b4 | 6714 | else |
33bd39a2 | 6715 | error ("forming %s to reference type `%T'", |
0ecfe0b4 JM |
6716 | (code == POINTER_TYPE) ? "pointer" : "reference", |
6717 | type); | |
82a98427 | 6718 | last_loc = input_location; |
79a7c7fa JM |
6719 | } |
6720 | ||
4393e105 | 6721 | return error_mark_node; |
79a7c7fa JM |
6722 | } |
6723 | else if (code == POINTER_TYPE) | |
46c895ac NS |
6724 | { |
6725 | r = build_pointer_type (type); | |
6726 | if (TREE_CODE (type) == METHOD_TYPE) | |
6727 | r = build_ptrmemfunc_type (r); | |
6728 | } | |
8d08fdba MS |
6729 | else |
6730 | r = build_reference_type (type); | |
adecb3f4 | 6731 | r = cp_build_qualified_type_real (r, TYPE_QUALS (t), complain); |
79a7c7fa | 6732 | |
a5f1c5f8 NS |
6733 | if (r != error_mark_node) |
6734 | /* Will this ever be needed for TYPE_..._TO values? */ | |
6735 | layout_type (r); | |
6736 | ||
8d08fdba MS |
6737 | return r; |
6738 | } | |
a4443a08 | 6739 | case OFFSET_TYPE: |
0ecfe0b4 | 6740 | { |
4393e105 MM |
6741 | r = tsubst (TYPE_OFFSET_BASETYPE (t), args, complain, in_decl); |
6742 | if (r == error_mark_node || !IS_AGGR_TYPE (r)) | |
6743 | { | |
6744 | /* [temp.deduct] | |
6745 | ||
6746 | Type deduction may fail for any of the following | |
6747 | reasons: | |
6748 | ||
6749 | -- Attempting to create "pointer to member of T" when T | |
6750 | is not a class type. */ | |
c2ea3a40 NS |
6751 | if (complain & tf_error) |
6752 | error ("creating pointer to member of non-class type `%T'", r); | |
4393e105 MM |
6753 | return error_mark_node; |
6754 | } | |
46c895ac NS |
6755 | if (TREE_CODE (type) == REFERENCE_TYPE) |
6756 | { | |
4f09be91 | 6757 | if (complain & tf_error) |
46c895ac NS |
6758 | error ("creating pointer to member reference type `%T'", type); |
6759 | ||
6760 | return error_mark_node; | |
6761 | } | |
6762 | my_friendly_assert (TREE_CODE (type) != METHOD_TYPE, 20011231); | |
6763 | if (TREE_CODE (type) == FUNCTION_TYPE) | |
a5ac359a MM |
6764 | { |
6765 | /* This is really a method type. The cv qualifiers of the | |
6766 | this pointer should _not_ be determined by the cv | |
6767 | qualifiers of the class type. They should be held | |
6768 | somewhere in the FUNCTION_TYPE, but we don't do that at | |
6769 | the moment. Consider | |
6770 | typedef void (Func) () const; | |
6771 | ||
6772 | template <typename T1> void Foo (Func T1::*); | |
6773 | ||
6774 | */ | |
6775 | tree method_type; | |
6776 | ||
43dc123f MM |
6777 | method_type = build_method_type_directly (TYPE_MAIN_VARIANT (r), |
6778 | TREE_TYPE (type), | |
6779 | TYPE_ARG_TYPES (type)); | |
a5ac359a MM |
6780 | return build_ptrmemfunc_type (build_pointer_type (method_type)); |
6781 | } | |
46c895ac | 6782 | else |
b7a78333 MM |
6783 | return cp_build_qualified_type_real (build_ptrmem_type (r, type), |
6784 | TYPE_QUALS (t), | |
6785 | complain); | |
0ecfe0b4 | 6786 | } |
8d08fdba MS |
6787 | case FUNCTION_TYPE: |
6788 | case METHOD_TYPE: | |
6789 | { | |
c11b6f21 | 6790 | tree fntype; |
4393e105 | 6791 | tree raises; |
8d08fdba | 6792 | |
4393e105 MM |
6793 | fntype = tsubst_function_type (t, args, complain, in_decl); |
6794 | if (fntype == error_mark_node) | |
6795 | return error_mark_node; | |
cabc336a | 6796 | |
34cd5ae7 | 6797 | /* Substitute the exception specification. */ |
cabc336a | 6798 | raises = TYPE_RAISES_EXCEPTIONS (t); |
c11b6f21 MS |
6799 | if (raises) |
6800 | { | |
4cc1d462 NS |
6801 | tree list = NULL_TREE; |
6802 | ||
6803 | if (! TREE_VALUE (raises)) | |
6804 | list = raises; | |
6805 | else | |
6806 | for (; raises != NULL_TREE; raises = TREE_CHAIN (raises)) | |
6807 | { | |
6808 | tree spec = TREE_VALUE (raises); | |
6809 | ||
6810 | spec = tsubst (spec, args, complain, in_decl); | |
6811 | if (spec == error_mark_node) | |
6812 | return spec; | |
6813 | list = add_exception_specifier (list, spec, complain); | |
6814 | } | |
6815 | fntype = build_exception_variant (fntype, list); | |
c11b6f21 MS |
6816 | } |
6817 | return fntype; | |
8d08fdba MS |
6818 | } |
6819 | case ARRAY_TYPE: | |
6820 | { | |
4393e105 MM |
6821 | tree domain = tsubst (TYPE_DOMAIN (t), args, complain, in_decl); |
6822 | if (domain == error_mark_node) | |
6823 | return error_mark_node; | |
6824 | ||
6825 | /* As an optimization, we avoid regenerating the array type if | |
6826 | it will obviously be the same as T. */ | |
8d08fdba MS |
6827 | if (type == TREE_TYPE (t) && domain == TYPE_DOMAIN (t)) |
6828 | return t; | |
0ecfe0b4 | 6829 | |
4393e105 MM |
6830 | /* These checks should match the ones in grokdeclarator. |
6831 | ||
6832 | [temp.deduct] | |
6833 | ||
6834 | The deduction may fail for any of the following reasons: | |
6835 | ||
6836 | -- Attempting to create an array with an element type that | |
6837 | is void, a function type, or a reference type. */ | |
6838 | if (TREE_CODE (type) == VOID_TYPE | |
6839 | || TREE_CODE (type) == FUNCTION_TYPE | |
6840 | || TREE_CODE (type) == REFERENCE_TYPE) | |
0ecfe0b4 | 6841 | { |
c2ea3a40 | 6842 | if (complain & tf_error) |
33bd39a2 | 6843 | error ("creating array of `%T'", type); |
4393e105 | 6844 | return error_mark_node; |
0ecfe0b4 JM |
6845 | } |
6846 | ||
8d08fdba MS |
6847 | r = build_cplus_array_type (type, domain); |
6848 | return r; | |
6849 | } | |
6850 | ||
8d08fdba | 6851 | case PLUS_EXPR: |
5566b478 | 6852 | case MINUS_EXPR: |
4393e105 | 6853 | { |
c2ea3a40 NS |
6854 | tree e1 = tsubst (TREE_OPERAND (t, 0), args, complain, in_decl); |
6855 | tree e2 = tsubst (TREE_OPERAND (t, 1), args, complain, in_decl); | |
4393e105 MM |
6856 | |
6857 | if (e1 == error_mark_node || e2 == error_mark_node) | |
6858 | return error_mark_node; | |
6859 | ||
6860 | return fold (build (TREE_CODE (t), TREE_TYPE (t), e1, e2)); | |
6861 | } | |
8d08fdba MS |
6862 | |
6863 | case NEGATE_EXPR: | |
6864 | case NOP_EXPR: | |
4393e105 | 6865 | { |
c2ea3a40 | 6866 | tree e = tsubst (TREE_OPERAND (t, 0), args, complain, in_decl); |
4393e105 MM |
6867 | if (e == error_mark_node) |
6868 | return error_mark_node; | |
6869 | ||
6870 | return fold (build (TREE_CODE (t), TREE_TYPE (t), e)); | |
6871 | } | |
8d08fdba | 6872 | |
5566b478 MS |
6873 | case TYPENAME_TYPE: |
6874 | { | |
4393e105 MM |
6875 | tree ctx = tsubst_aggr_type (TYPE_CONTEXT (t), args, complain, |
6876 | in_decl, /*entering_scope=*/1); | |
6877 | tree f = tsubst_copy (TYPENAME_TYPE_FULLNAME (t), args, | |
6878 | complain, in_decl); | |
6879 | ||
6880 | if (ctx == error_mark_node || f == error_mark_node) | |
6881 | return error_mark_node; | |
ae58fa02 | 6882 | |
bf8f3f93 MM |
6883 | if (!IS_AGGR_TYPE (ctx)) |
6884 | { | |
c2ea3a40 | 6885 | if (complain & tf_error) |
33bd39a2 | 6886 | error ("`%T' is not a class, struct, or union type", |
bf8f3f93 MM |
6887 | ctx); |
6888 | return error_mark_node; | |
6889 | } | |
6890 | else if (!uses_template_parms (ctx) && !TYPE_BEING_DEFINED (ctx)) | |
6891 | { | |
6892 | /* Normally, make_typename_type does not require that the CTX | |
6893 | have complete type in order to allow things like: | |
ae58fa02 | 6894 | |
bf8f3f93 | 6895 | template <class T> struct S { typename S<T>::X Y; }; |
ae58fa02 | 6896 | |
bf8f3f93 MM |
6897 | But, such constructs have already been resolved by this |
6898 | point, so here CTX really should have complete type, unless | |
6899 | it's a partial instantiation. */ | |
4393e105 | 6900 | ctx = complete_type (ctx); |
d0f062fb | 6901 | if (!COMPLETE_TYPE_P (ctx)) |
4393e105 | 6902 | { |
c2ea3a40 | 6903 | if (complain & tf_error) |
7a228918 | 6904 | cxx_incomplete_type_error (NULL_TREE, ctx); |
4393e105 MM |
6905 | return error_mark_node; |
6906 | } | |
6907 | } | |
ae58fa02 | 6908 | |
4f2b0fb2 NS |
6909 | f = make_typename_type (ctx, f, |
6910 | (complain & tf_error) | tf_keep_type_decl); | |
f0bcd168 MM |
6911 | if (f == error_mark_node) |
6912 | return f; | |
4f2b0fb2 NS |
6913 | if (TREE_CODE (f) == TYPE_DECL) |
6914 | { | |
6915 | complain |= tf_ignore_bad_quals; | |
6916 | f = TREE_TYPE (f); | |
6917 | } | |
6918 | ||
6919 | return cp_build_qualified_type_real | |
6920 | (f, cp_type_quals (f) | cp_type_quals (t), complain); | |
5566b478 | 6921 | } |
c2ea3a40 | 6922 | |
b8c6534b KL |
6923 | case UNBOUND_CLASS_TEMPLATE: |
6924 | { | |
6925 | tree ctx = tsubst_aggr_type (TYPE_CONTEXT (t), args, complain, | |
6926 | in_decl, /*entering_scope=*/1); | |
6927 | tree name = TYPE_IDENTIFIER (t); | |
6928 | ||
6929 | if (ctx == error_mark_node || name == error_mark_node) | |
6930 | return error_mark_node; | |
6931 | ||
6932 | return make_unbound_class_template (ctx, name, complain); | |
6933 | } | |
6934 | ||
5566b478 | 6935 | case INDIRECT_REF: |
4393e105 | 6936 | { |
c2ea3a40 | 6937 | tree e = tsubst (TREE_OPERAND (t, 0), args, complain, in_decl); |
4393e105 MM |
6938 | if (e == error_mark_node) |
6939 | return error_mark_node; | |
6940 | return make_pointer_declarator (type, e); | |
6941 | } | |
6942 | ||
5566b478 | 6943 | case ADDR_EXPR: |
4393e105 | 6944 | { |
c2ea3a40 | 6945 | tree e = tsubst (TREE_OPERAND (t, 0), args, complain, in_decl); |
4393e105 MM |
6946 | if (e == error_mark_node) |
6947 | return error_mark_node; | |
6948 | return make_reference_declarator (type, e); | |
6949 | } | |
5566b478 MS |
6950 | |
6951 | case ARRAY_REF: | |
4393e105 | 6952 | { |
c2ea3a40 NS |
6953 | tree e1 = tsubst (TREE_OPERAND (t, 0), args, complain, in_decl); |
6954 | tree e2 = tsubst_expr (TREE_OPERAND (t, 1), args, complain, in_decl); | |
4393e105 MM |
6955 | if (e1 == error_mark_node || e2 == error_mark_node) |
6956 | return error_mark_node; | |
6957 | ||
718b8ea5 | 6958 | return build_nt (ARRAY_REF, e1, e2, tsubst_expr); |
4393e105 | 6959 | } |
5566b478 MS |
6960 | |
6961 | case CALL_EXPR: | |
4393e105 | 6962 | { |
c2ea3a40 | 6963 | tree e1 = tsubst (TREE_OPERAND (t, 0), args, complain, in_decl); |
43f887f9 MM |
6964 | tree e2 = (tsubst_call_declarator_parms |
6965 | (CALL_DECLARATOR_PARMS (t), args, complain, in_decl)); | |
6966 | tree e3 = tsubst (CALL_DECLARATOR_EXCEPTION_SPEC (t), args, | |
6967 | complain, in_decl); | |
4393e105 MM |
6968 | |
6969 | if (e1 == error_mark_node || e2 == error_mark_node | |
6970 | || e3 == error_mark_node) | |
6971 | return error_mark_node; | |
6972 | ||
43f887f9 | 6973 | return make_call_declarator (e1, e2, CALL_DECLARATOR_QUALS (t), e3); |
4393e105 | 6974 | } |
5566b478 | 6975 | |
fc378698 | 6976 | case SCOPE_REF: |
4393e105 | 6977 | { |
c2ea3a40 | 6978 | tree e1 = tsubst (TREE_OPERAND (t, 0), args, complain, in_decl); |
4393e105 MM |
6979 | tree e2 = tsubst (TREE_OPERAND (t, 1), args, complain, in_decl); |
6980 | if (e1 == error_mark_node || e2 == error_mark_node) | |
6981 | return error_mark_node; | |
6982 | ||
718b8ea5 | 6983 | return build_nt (TREE_CODE (t), e1, e2); |
4393e105 | 6984 | } |
fc378698 | 6985 | |
b894fc05 | 6986 | case TYPEOF_TYPE: |
4393e105 | 6987 | { |
c2ea3a40 | 6988 | tree e1 = tsubst_expr (TYPE_FIELDS (t), args, complain, in_decl); |
4393e105 MM |
6989 | if (e1 == error_mark_node) |
6990 | return error_mark_node; | |
6991 | ||
dce50630 MM |
6992 | return cp_build_qualified_type_real (TREE_TYPE (e1), |
6993 | cp_type_quals (t) | |
6994 | | cp_type_quals (TREE_TYPE (e1)), | |
6995 | complain); | |
4393e105 | 6996 | } |
b894fc05 | 6997 | |
8d08fdba | 6998 | default: |
5566b478 | 6999 | sorry ("use of `%s' in template", |
8d08fdba MS |
7000 | tree_code_name [(int) TREE_CODE (t)]); |
7001 | return error_mark_node; | |
7002 | } | |
7003 | } | |
7004 | ||
ee76b931 MM |
7005 | /* Like tsubst_expr for a BASELINK. OBJECT_TYPE, if non-NULL, is the |
7006 | type of the expression on the left-hand side of the "." or "->" | |
7007 | operator. */ | |
7008 | ||
7009 | static tree | |
7010 | tsubst_baselink (tree baselink, tree object_type, | |
7011 | tree args, tsubst_flags_t complain, tree in_decl) | |
7012 | { | |
7013 | tree name; | |
7014 | tree qualifying_scope; | |
7015 | tree fns; | |
7016 | tree template_args = 0; | |
7017 | bool template_id_p = false; | |
7018 | ||
7019 | /* A baselink indicates a function from a base class. The | |
7020 | BASELINK_ACCESS_BINFO and BASELINK_BINFO are going to have | |
7021 | non-dependent types; otherwise, the lookup could not have | |
7022 | succeeded. However, they may indicate bases of the template | |
7023 | class, rather than the instantiated class. | |
7024 | ||
7025 | In addition, lookups that were not ambiguous before may be | |
7026 | ambiguous now. Therefore, we perform the lookup again. */ | |
7027 | qualifying_scope = BINFO_TYPE (BASELINK_ACCESS_BINFO (baselink)); | |
7028 | fns = BASELINK_FUNCTIONS (baselink); | |
7029 | if (TREE_CODE (fns) == TEMPLATE_ID_EXPR) | |
7030 | { | |
7031 | template_id_p = true; | |
7032 | template_args = TREE_OPERAND (fns, 1); | |
7033 | fns = TREE_OPERAND (fns, 0); | |
bf12d54d NS |
7034 | if (template_args) |
7035 | template_args = tsubst_template_args (template_args, args, | |
7036 | complain, in_decl); | |
ee76b931 MM |
7037 | } |
7038 | name = DECL_NAME (get_first_fn (fns)); | |
7039 | baselink = lookup_fnfields (qualifying_scope, name, /*protect=*/1); | |
7040 | if (BASELINK_P (baselink) && template_id_p) | |
7041 | BASELINK_FUNCTIONS (baselink) | |
7042 | = build_nt (TEMPLATE_ID_EXPR, | |
7043 | BASELINK_FUNCTIONS (baselink), | |
7044 | template_args); | |
7045 | if (!object_type) | |
7046 | object_type = current_class_type; | |
7047 | return adjust_result_of_qualified_name_lookup (baselink, | |
7048 | qualifying_scope, | |
7049 | object_type); | |
7050 | } | |
7051 | ||
7052 | /* Like tsubst_expr for a SCOPE_REF, given by QUALIFIED_ID. DONE is | |
7053 | true if the qualified-id will be a postfix-expression in-and-of | |
7054 | itself; false if more of the postfix-expression follows the | |
7055 | QUALIFIED_ID. ADDRESS_P is true if the qualified-id is the operand | |
7056 | of "&". */ | |
7057 | ||
7058 | static tree | |
7059 | tsubst_qualified_id (tree qualified_id, tree args, | |
7060 | tsubst_flags_t complain, tree in_decl, | |
7061 | bool done, bool address_p) | |
7062 | { | |
7063 | tree expr; | |
7064 | tree scope; | |
7065 | tree name; | |
7066 | bool is_template; | |
7067 | tree template_args; | |
7068 | ||
7069 | my_friendly_assert (TREE_CODE (qualified_id) == SCOPE_REF, 20030706); | |
7070 | ||
ee76b931 MM |
7071 | /* Figure out what name to look up. */ |
7072 | name = TREE_OPERAND (qualified_id, 1); | |
7073 | if (TREE_CODE (name) == TEMPLATE_ID_EXPR) | |
7074 | { | |
7075 | is_template = true; | |
bf12d54d NS |
7076 | template_args = TREE_OPERAND (name, 1); |
7077 | if (template_args) | |
7078 | template_args = tsubst_template_args (template_args, args, | |
7079 | complain, in_decl); | |
ee76b931 MM |
7080 | name = TREE_OPERAND (name, 0); |
7081 | } | |
7082 | else | |
7083 | { | |
7084 | is_template = false; | |
7085 | template_args = NULL_TREE; | |
7086 | } | |
7087 | ||
6eeba0cc MM |
7088 | /* Substitute into the qualifying scope. When there are no ARGS, we |
7089 | are just trying to simplify a non-dependent expression. In that | |
7090 | case the qualifying scope may be dependent, and, in any case, | |
7091 | substituting will not help. */ | |
7092 | scope = TREE_OPERAND (qualified_id, 0); | |
7093 | if (args) | |
7094 | { | |
7095 | scope = tsubst (scope, args, complain, in_decl); | |
7096 | expr = tsubst_copy (name, args, complain, in_decl); | |
7097 | } | |
7098 | else | |
7099 | expr = name; | |
10b1d5e7 | 7100 | |
fb5ce3c9 NS |
7101 | my_friendly_assert (!dependent_type_p (scope), 20030729); |
7102 | ||
5e08432e | 7103 | if (!BASELINK_P (name) && !DECL_P (expr)) |
12483c9f NS |
7104 | { |
7105 | expr = lookup_qualified_name (scope, expr, /*is_type_p=*/0, false); | |
7106 | if (TREE_CODE (TREE_CODE (expr) == TEMPLATE_DECL | |
7107 | ? DECL_TEMPLATE_RESULT (expr) : expr) == TYPE_DECL) | |
7108 | { | |
7109 | if (complain & tf_error) | |
7110 | error ("`%E' names a type, but a non-type is expected", | |
7111 | qualified_id); | |
7112 | return error_mark_node; | |
7113 | } | |
7114 | } | |
fb5ce3c9 | 7115 | |
279b8466 | 7116 | if (DECL_P (expr)) |
fb5ce3c9 | 7117 | check_accessibility_of_qualified_id (expr, /*object_type=*/NULL_TREE, |
279b8466 | 7118 | scope); |
6eeba0cc | 7119 | |
ee76b931 MM |
7120 | /* Remember that there was a reference to this entity. */ |
7121 | if (DECL_P (expr)) | |
6eeba0cc MM |
7122 | { |
7123 | mark_used (expr); | |
7124 | if (!args && TREE_CODE (expr) == VAR_DECL) | |
7125 | expr = DECL_INITIAL (expr); | |
7126 | } | |
ee76b931 MM |
7127 | |
7128 | if (is_template) | |
10b1d5e7 | 7129 | expr = lookup_template_function (expr, template_args); |
ee76b931 | 7130 | |
22038b2c NS |
7131 | if (expr == error_mark_node && complain & tf_error) |
7132 | qualified_name_lookup_error (scope, TREE_OPERAND (qualified_id, 1)); | |
7133 | else if (TYPE_P (scope)) | |
ee76b931 MM |
7134 | { |
7135 | expr = (adjust_result_of_qualified_name_lookup | |
7136 | (expr, scope, current_class_type)); | |
7137 | expr = finish_qualified_id_expr (scope, expr, done, address_p); | |
7138 | } | |
7139 | ||
7140 | return expr; | |
7141 | } | |
7142 | ||
00d3396f JM |
7143 | /* Like tsubst, but deals with expressions. This function just replaces |
7144 | template parms; to finish processing the resultant expression, use | |
7145 | tsubst_expr. */ | |
7146 | ||
14d22dd6 | 7147 | static tree |
3a978d72 | 7148 | tsubst_copy (tree t, tree args, tsubst_flags_t complain, tree in_decl) |
5566b478 MS |
7149 | { |
7150 | enum tree_code code; | |
8452b1d3 | 7151 | tree r; |
8d08fdba | 7152 | |
5566b478 MS |
7153 | if (t == NULL_TREE || t == error_mark_node) |
7154 | return t; | |
7155 | ||
7156 | code = TREE_CODE (t); | |
b7484fbe | 7157 | |
5566b478 MS |
7158 | switch (code) |
7159 | { | |
7160 | case PARM_DECL: | |
a723baf1 MM |
7161 | r = retrieve_local_specialization (t); |
7162 | my_friendly_assert (r != NULL, 20020903); | |
7163 | return r; | |
5566b478 MS |
7164 | |
7165 | case CONST_DECL: | |
ed44da02 MM |
7166 | { |
7167 | tree enum_type; | |
7168 | tree v; | |
7169 | ||
a723baf1 MM |
7170 | if (DECL_TEMPLATE_PARM_P (t)) |
7171 | return tsubst_copy (DECL_INITIAL (t), args, complain, in_decl); | |
7b6d72fc MM |
7172 | /* There is no need to substitute into namespace-scope |
7173 | enumerators. */ | |
7174 | if (DECL_NAMESPACE_SCOPE_P (t)) | |
ed44da02 MM |
7175 | return t; |
7176 | ||
7177 | /* Unfortunately, we cannot just call lookup_name here. | |
9188c363 MM |
7178 | Consider: |
7179 | ||
7180 | template <int I> int f() { | |
7181 | enum E { a = I }; | |
7182 | struct S { void g() { E e = a; } }; | |
7183 | }; | |
7184 | ||
7185 | When we instantiate f<7>::S::g(), say, lookup_name is not | |
7186 | clever enough to find f<7>::a. */ | |
ed44da02 | 7187 | enum_type |
4393e105 | 7188 | = tsubst_aggr_type (TREE_TYPE (t), args, complain, in_decl, |
ed44da02 MM |
7189 | /*entering_scope=*/0); |
7190 | ||
7191 | for (v = TYPE_VALUES (enum_type); | |
7192 | v != NULL_TREE; | |
7193 | v = TREE_CHAIN (v)) | |
7194 | if (TREE_PURPOSE (v) == DECL_NAME (t)) | |
7195 | return TREE_VALUE (v); | |
7196 | ||
7197 | /* We didn't find the name. That should never happen; if | |
7198 | name-lookup found it during preliminary parsing, we | |
7199 | should find it again here during instantiation. */ | |
a98facb0 | 7200 | abort (); |
ed44da02 | 7201 | } |
db04386f | 7202 | return t; |
ed44da02 | 7203 | |
5566b478 MS |
7204 | case FIELD_DECL: |
7205 | if (DECL_CONTEXT (t)) | |
7206 | { | |
0978790f | 7207 | tree ctx; |
0978790f | 7208 | |
4393e105 | 7209 | ctx = tsubst_aggr_type (DECL_CONTEXT (t), args, complain, in_decl, |
36a117a5 | 7210 | /*entering_scope=*/1); |
0978790f | 7211 | if (ctx != DECL_CONTEXT (t)) |
86ac0575 | 7212 | return lookup_field (ctx, DECL_NAME (t), 0, false); |
5566b478 MS |
7213 | } |
7214 | return t; | |
7215 | ||
7216 | case VAR_DECL: | |
7217 | case FUNCTION_DECL: | |
a723baf1 MM |
7218 | if ((DECL_LANG_SPECIFIC (t) && DECL_TEMPLATE_INFO (t)) |
7219 | || local_variable_p (t)) | |
4393e105 | 7220 | t = tsubst (t, args, complain, in_decl); |
5566b478 MS |
7221 | mark_used (t); |
7222 | return t; | |
7223 | ||
a723baf1 | 7224 | case BASELINK: |
ee76b931 | 7225 | return tsubst_baselink (t, current_class_type, args, complain, in_decl); |
a723baf1 | 7226 | |
98c1c668 | 7227 | case TEMPLATE_DECL: |
a723baf1 MM |
7228 | if (DECL_TEMPLATE_TEMPLATE_PARM_P (t)) |
7229 | return tsubst (TREE_TYPE (DECL_TEMPLATE_RESULT (t)), | |
7230 | args, complain, in_decl); | |
7231 | else if (is_member_template (t)) | |
4393e105 | 7232 | return tsubst (t, args, complain, in_decl); |
fcea7401 KL |
7233 | else if (DECL_CLASS_SCOPE_P (t) |
7234 | && uses_template_parms (DECL_CONTEXT (t))) | |
7235 | { | |
7236 | /* Template template argument like the following example need | |
7237 | special treatment: | |
7238 | ||
7239 | template <template <class> class TT> struct C {}; | |
7240 | template <class T> struct D { | |
7241 | template <class U> struct E {}; | |
7242 | C<E> c; // #1 | |
7243 | }; | |
7244 | D<int> d; // #2 | |
7245 | ||
7246 | We are processing the template argument `E' in #1 for | |
7247 | the template instantiation #2. Originally, `E' is a | |
7248 | TEMPLATE_DECL with `D<T>' as its DECL_CONTEXT. Now we | |
7249 | have to substitute this with one having context `D<int>'. */ | |
7250 | ||
7251 | tree context = tsubst (DECL_CONTEXT (t), args, complain, in_decl); | |
7252 | return lookup_field (context, DECL_NAME(t), 0, false); | |
7253 | } | |
98c1c668 | 7254 | else |
fcea7401 | 7255 | /* Ordinary template template argument. */ |
98c1c668 JM |
7256 | return t; |
7257 | ||
5566b478 MS |
7258 | case CAST_EXPR: |
7259 | case REINTERPRET_CAST_EXPR: | |
e92cc029 MS |
7260 | case CONST_CAST_EXPR: |
7261 | case STATIC_CAST_EXPR: | |
7262 | case DYNAMIC_CAST_EXPR: | |
51924768 | 7263 | case NOP_EXPR: |
5566b478 | 7264 | return build1 |
4393e105 MM |
7265 | (code, tsubst (TREE_TYPE (t), args, complain, in_decl), |
7266 | tsubst_copy (TREE_OPERAND (t, 0), args, complain, in_decl)); | |
5566b478 MS |
7267 | |
7268 | case INDIRECT_REF: | |
5566b478 MS |
7269 | case NEGATE_EXPR: |
7270 | case TRUTH_NOT_EXPR: | |
b87692e5 | 7271 | case BIT_NOT_EXPR: |
5566b478 MS |
7272 | case ADDR_EXPR: |
7273 | case CONVERT_EXPR: /* Unary + */ | |
7274 | case SIZEOF_EXPR: | |
abff8e06 | 7275 | case ALIGNOF_EXPR: |
5566b478 | 7276 | case ARROW_EXPR: |
fc378698 | 7277 | case THROW_EXPR: |
5156628f | 7278 | case TYPEID_EXPR: |
f5733617 SS |
7279 | case REALPART_EXPR: |
7280 | case IMAGPART_EXPR: | |
5566b478 | 7281 | return build1 |
6a629cac | 7282 | (code, tsubst (TREE_TYPE (t), args, complain, in_decl), |
4393e105 | 7283 | tsubst_copy (TREE_OPERAND (t, 0), args, complain, in_decl)); |
5566b478 | 7284 | |
a723baf1 MM |
7285 | case COMPONENT_REF: |
7286 | { | |
7287 | tree object; | |
7288 | tree name; | |
7289 | ||
7290 | object = tsubst_copy (TREE_OPERAND (t, 0), args, complain, in_decl); | |
7291 | name = TREE_OPERAND (t, 1); | |
7292 | if (TREE_CODE (name) == BIT_NOT_EXPR) | |
7293 | { | |
7294 | name = tsubst_copy (TREE_OPERAND (name, 0), args, | |
7295 | complain, in_decl); | |
7296 | name = build1 (BIT_NOT_EXPR, NULL_TREE, name); | |
7297 | } | |
7298 | else if (TREE_CODE (name) == SCOPE_REF | |
7299 | && TREE_CODE (TREE_OPERAND (name, 1)) == BIT_NOT_EXPR) | |
7300 | { | |
7301 | tree base = tsubst_copy (TREE_OPERAND (name, 0), args, | |
7302 | complain, in_decl); | |
7303 | name = TREE_OPERAND (name, 1); | |
7304 | name = tsubst_copy (TREE_OPERAND (name, 0), args, | |
7305 | complain, in_decl); | |
7306 | name = build1 (BIT_NOT_EXPR, NULL_TREE, name); | |
7307 | name = build_nt (SCOPE_REF, base, name); | |
7308 | } | |
ee76b931 MM |
7309 | else if (TREE_CODE (name) == BASELINK) |
7310 | name = tsubst_baselink (name, | |
7311 | non_reference (TREE_TYPE (object)), | |
7312 | args, complain, | |
7313 | in_decl); | |
a723baf1 | 7314 | else |
ee76b931 | 7315 | name = tsubst_copy (name, args, complain, in_decl); |
a723baf1 MM |
7316 | return build_nt (COMPONENT_REF, object, name); |
7317 | } | |
7318 | ||
5566b478 MS |
7319 | case PLUS_EXPR: |
7320 | case MINUS_EXPR: | |
7321 | case MULT_EXPR: | |
7322 | case TRUNC_DIV_EXPR: | |
7323 | case CEIL_DIV_EXPR: | |
7324 | case FLOOR_DIV_EXPR: | |
7325 | case ROUND_DIV_EXPR: | |
7326 | case EXACT_DIV_EXPR: | |
7327 | case BIT_AND_EXPR: | |
5566b478 MS |
7328 | case BIT_IOR_EXPR: |
7329 | case BIT_XOR_EXPR: | |
7330 | case TRUNC_MOD_EXPR: | |
7331 | case FLOOR_MOD_EXPR: | |
7332 | case TRUTH_ANDIF_EXPR: | |
7333 | case TRUTH_ORIF_EXPR: | |
7334 | case TRUTH_AND_EXPR: | |
7335 | case TRUTH_OR_EXPR: | |
7336 | case RSHIFT_EXPR: | |
7337 | case LSHIFT_EXPR: | |
7338 | case RROTATE_EXPR: | |
7339 | case LROTATE_EXPR: | |
7340 | case EQ_EXPR: | |
7341 | case NE_EXPR: | |
7342 | case MAX_EXPR: | |
7343 | case MIN_EXPR: | |
7344 | case LE_EXPR: | |
7345 | case GE_EXPR: | |
7346 | case LT_EXPR: | |
7347 | case GT_EXPR: | |
5566b478 MS |
7348 | case ARRAY_REF: |
7349 | case COMPOUND_EXPR: | |
7350 | case SCOPE_REF: | |
7351 | case DOTSTAR_EXPR: | |
7352 | case MEMBER_REF: | |
519c9806 MM |
7353 | case PREDECREMENT_EXPR: |
7354 | case PREINCREMENT_EXPR: | |
7355 | case POSTDECREMENT_EXPR: | |
7356 | case POSTINCREMENT_EXPR: | |
5566b478 | 7357 | return build_nt |
4393e105 MM |
7358 | (code, tsubst_copy (TREE_OPERAND (t, 0), args, complain, in_decl), |
7359 | tsubst_copy (TREE_OPERAND (t, 1), args, complain, in_decl)); | |
5566b478 MS |
7360 | |
7361 | case CALL_EXPR: | |
a723baf1 MM |
7362 | return build_nt (code, |
7363 | tsubst_copy (TREE_OPERAND (t, 0), args, | |
7364 | complain, in_decl), | |
7365 | tsubst_copy (TREE_OPERAND (t, 1), args, complain, | |
7366 | in_decl), | |
7367 | NULL_TREE); | |
5566b478 | 7368 | |
558475f0 | 7369 | case STMT_EXPR: |
cc23546e | 7370 | /* This processing should really occur in tsubst_expr. However, |
558475f0 | 7371 | tsubst_expr does not recurse into expressions, since it |
cc23546e JO |
7372 | assumes that there aren't any statements inside them. So, we |
7373 | need to expand the STMT_EXPR here. */ | |
558475f0 MM |
7374 | if (!processing_template_decl) |
7375 | { | |
b5ac18ea | 7376 | tree stmt_expr = begin_stmt_expr (); |
a5bcc582 NS |
7377 | |
7378 | tsubst_expr (STMT_EXPR_STMT (t), args, | |
7379 | complain | tf_stmt_expr_cmpd, in_decl); | |
303b7406 | 7380 | return finish_stmt_expr (stmt_expr, false); |
558475f0 | 7381 | } |
9d9169de MM |
7382 | |
7383 | return t; | |
558475f0 | 7384 | |
5566b478 MS |
7385 | case COND_EXPR: |
7386 | case MODOP_EXPR: | |
40242ccf | 7387 | case PSEUDO_DTOR_EXPR: |
67da3287 | 7388 | { |
8452b1d3 | 7389 | r = build_nt |
4393e105 MM |
7390 | (code, tsubst_copy (TREE_OPERAND (t, 0), args, complain, in_decl), |
7391 | tsubst_copy (TREE_OPERAND (t, 1), args, complain, in_decl), | |
7392 | tsubst_copy (TREE_OPERAND (t, 2), args, complain, in_decl)); | |
67da3287 MM |
7393 | return r; |
7394 | } | |
5566b478 MS |
7395 | |
7396 | case NEW_EXPR: | |
7397 | { | |
8452b1d3 | 7398 | r = build_nt |
4393e105 MM |
7399 | (code, tsubst_copy (TREE_OPERAND (t, 0), args, complain, in_decl), |
7400 | tsubst_copy (TREE_OPERAND (t, 1), args, complain, in_decl), | |
7401 | tsubst_copy (TREE_OPERAND (t, 2), args, complain, in_decl)); | |
5566b478 MS |
7402 | NEW_EXPR_USE_GLOBAL (r) = NEW_EXPR_USE_GLOBAL (t); |
7403 | return r; | |
7404 | } | |
7405 | ||
7406 | case DELETE_EXPR: | |
7407 | { | |
8452b1d3 | 7408 | r = build_nt |
4393e105 MM |
7409 | (code, tsubst_copy (TREE_OPERAND (t, 0), args, complain, in_decl), |
7410 | tsubst_copy (TREE_OPERAND (t, 1), args, complain, in_decl)); | |
5566b478 MS |
7411 | DELETE_EXPR_USE_GLOBAL (r) = DELETE_EXPR_USE_GLOBAL (t); |
7412 | DELETE_EXPR_USE_VEC (r) = DELETE_EXPR_USE_VEC (t); | |
7413 | return r; | |
7414 | } | |
7415 | ||
386b8a85 JM |
7416 | case TEMPLATE_ID_EXPR: |
7417 | { | |
00d3396f | 7418 | /* Substituted template arguments */ |
a91db711 NS |
7419 | tree fn = TREE_OPERAND (t, 0); |
7420 | tree targs = TREE_OPERAND (t, 1); | |
856216bb | 7421 | |
a91db711 | 7422 | fn = tsubst_copy (fn, args, complain, in_decl); |
bf12d54d NS |
7423 | if (targs) |
7424 | targs = tsubst_template_args (targs, args, complain, in_decl); | |
a91db711 NS |
7425 | |
7426 | return lookup_template_function (fn, targs); | |
386b8a85 JM |
7427 | } |
7428 | ||
5566b478 MS |
7429 | case TREE_LIST: |
7430 | { | |
7431 | tree purpose, value, chain; | |
7432 | ||
7433 | if (t == void_list_node) | |
7434 | return t; | |
7435 | ||
7436 | purpose = TREE_PURPOSE (t); | |
7437 | if (purpose) | |
4393e105 | 7438 | purpose = tsubst_copy (purpose, args, complain, in_decl); |
5566b478 MS |
7439 | value = TREE_VALUE (t); |
7440 | if (value) | |
4393e105 | 7441 | value = tsubst_copy (value, args, complain, in_decl); |
5566b478 MS |
7442 | chain = TREE_CHAIN (t); |
7443 | if (chain && chain != void_type_node) | |
4393e105 | 7444 | chain = tsubst_copy (chain, args, complain, in_decl); |
5566b478 MS |
7445 | if (purpose == TREE_PURPOSE (t) |
7446 | && value == TREE_VALUE (t) | |
7447 | && chain == TREE_CHAIN (t)) | |
7448 | return t; | |
7449 | return tree_cons (purpose, value, chain); | |
7450 | } | |
7451 | ||
7452 | case RECORD_TYPE: | |
7453 | case UNION_TYPE: | |
7454 | case ENUMERAL_TYPE: | |
7455 | case INTEGER_TYPE: | |
7456 | case TEMPLATE_TYPE_PARM: | |
73b0fce8 | 7457 | case TEMPLATE_TEMPLATE_PARM: |
a1281f45 | 7458 | case BOUND_TEMPLATE_TEMPLATE_PARM: |
f84b4be9 | 7459 | case TEMPLATE_PARM_INDEX: |
5566b478 MS |
7460 | case POINTER_TYPE: |
7461 | case REFERENCE_TYPE: | |
7462 | case OFFSET_TYPE: | |
7463 | case FUNCTION_TYPE: | |
7464 | case METHOD_TYPE: | |
7465 | case ARRAY_TYPE: | |
7466 | case TYPENAME_TYPE: | |
b8c6534b | 7467 | case UNBOUND_CLASS_TEMPLATE: |
2a2b1d56 | 7468 | case TYPEOF_TYPE: |
f84b4be9 | 7469 | case TYPE_DECL: |
4393e105 | 7470 | return tsubst (t, args, complain, in_decl); |
5566b478 | 7471 | |
e92cc029 | 7472 | case IDENTIFIER_NODE: |
421844e7 | 7473 | if (IDENTIFIER_TYPENAME_P (t)) |
1f6e1acc AS |
7474 | { |
7475 | tree new_type = tsubst (TREE_TYPE (t), args, complain, in_decl); | |
1f84ec23 | 7476 | return mangle_conv_op_name_for_type (new_type); |
1f6e1acc | 7477 | } |
e92cc029 MS |
7478 | else |
7479 | return t; | |
7480 | ||
5156628f | 7481 | case CONSTRUCTOR: |
8452b1d3 | 7482 | { |
dcf92453 ZW |
7483 | r = build_constructor |
7484 | (tsubst (TREE_TYPE (t), args, complain, in_decl), | |
7485 | tsubst_copy (CONSTRUCTOR_ELTS (t), args, complain, in_decl)); | |
8452b1d3 JM |
7486 | TREE_HAS_CONSTRUCTOR (r) = TREE_HAS_CONSTRUCTOR (t); |
7487 | return r; | |
7488 | } | |
5156628f | 7489 | |
371534a9 | 7490 | case VA_ARG_EXPR: |
ea333e1c | 7491 | return build_x_va_arg (tsubst_copy (TREE_OPERAND (t, 0), args, complain, |
c2ea3a40 NS |
7492 | in_decl), |
7493 | tsubst (TREE_TYPE (t), args, complain, in_decl)); | |
f9817201 | 7494 | |
5566b478 MS |
7495 | default: |
7496 | return t; | |
7497 | } | |
7498 | } | |
7499 | ||
cc23546e JO |
7500 | /* Like tsubst_copy for expressions, etc. but also does semantic |
7501 | processing. */ | |
00d3396f | 7502 | |
14d22dd6 | 7503 | static tree |
3a978d72 | 7504 | tsubst_expr (tree t, tree args, tsubst_flags_t complain, tree in_decl) |
5566b478 | 7505 | { |
fd10dd09 | 7506 | tree stmt, tmp; |
a5bcc582 NS |
7507 | tsubst_flags_t stmt_expr |
7508 | = complain & (tf_stmt_expr_cmpd | tf_stmt_expr_body); | |
558475f0 | 7509 | |
a5bcc582 | 7510 | complain ^= stmt_expr; |
5566b478 MS |
7511 | if (t == NULL_TREE || t == error_mark_node) |
7512 | return t; | |
7513 | ||
5156628f | 7514 | if (processing_template_decl) |
4393e105 | 7515 | return tsubst_copy (t, args, complain, in_decl); |
5566b478 | 7516 | |
009ed910 | 7517 | if (!STATEMENT_CODE_P (TREE_CODE (t))) |
b3445994 MM |
7518 | return tsubst_copy_and_build (t, args, complain, in_decl, |
7519 | /*function_p=*/false); | |
fd10dd09 | 7520 | |
5566b478 | 7521 | switch (TREE_CODE (t)) |
8d08fdba | 7522 | { |
558475f0 | 7523 | case CTOR_INITIALIZER: |
2282d28d MM |
7524 | prep_stmt (t); |
7525 | finish_mem_initializers (tsubst_initializer_list | |
7526 | (TREE_OPERAND (t, 0), args)); | |
7527 | break; | |
558475f0 | 7528 | |
5566b478 | 7529 | case RETURN_STMT: |
a7e4cfa0 | 7530 | prep_stmt (t); |
d65b1d77 | 7531 | finish_return_stmt (tsubst_expr (RETURN_STMT_EXPR (t), |
4393e105 | 7532 | args, complain, in_decl)); |
5566b478 MS |
7533 | break; |
7534 | ||
7535 | case EXPR_STMT: | |
a5bcc582 NS |
7536 | { |
7537 | tree r; | |
7538 | ||
7539 | prep_stmt (t); | |
7540 | ||
7541 | r = tsubst_expr (EXPR_STMT_EXPR (t), args, complain, in_decl); | |
7542 | if (stmt_expr & tf_stmt_expr_body && !TREE_CHAIN (t)) | |
7543 | finish_stmt_expr_expr (r); | |
7544 | else | |
7545 | finish_expr_stmt (r); | |
7546 | break; | |
7547 | } | |
5566b478 | 7548 | |
9da99f7d NS |
7549 | case USING_STMT: |
7550 | prep_stmt (t); | |
7551 | do_using_directive (tsubst_expr (USING_STMT_NAMESPACE (t), | |
7552 | args, complain, in_decl)); | |
7553 | break; | |
7554 | ||
5566b478 MS |
7555 | case DECL_STMT: |
7556 | { | |
e0942dcd MM |
7557 | tree decl; |
7558 | tree init; | |
5566b478 | 7559 | |
a7e4cfa0 | 7560 | prep_stmt (t); |
e0942dcd | 7561 | decl = DECL_STMT_DECL (t); |
acef433b MM |
7562 | if (TREE_CODE (decl) == LABEL_DECL) |
7563 | finish_label_decl (DECL_NAME (decl)); | |
fbfe8c9e NS |
7564 | else if (TREE_CODE (decl) == USING_DECL) |
7565 | { | |
7566 | tree scope = DECL_INITIAL (decl); | |
7567 | tree name = DECL_NAME (decl); | |
22038b2c | 7568 | tree decl; |
fbfe8c9e NS |
7569 | |
7570 | scope = tsubst_expr (scope, args, complain, in_decl); | |
22038b2c | 7571 | decl = lookup_qualified_name (scope, name, |
12483c9f NS |
7572 | /*is_type_p=*/false, |
7573 | /*complain=*/false); | |
22038b2c NS |
7574 | if (decl == error_mark_node) |
7575 | qualified_name_lookup_error (scope, name); | |
7576 | else | |
7577 | do_local_using_decl (decl); | |
fbfe8c9e | 7578 | } |
acef433b MM |
7579 | else |
7580 | { | |
7581 | init = DECL_INITIAL (decl); | |
7582 | decl = tsubst (decl, args, complain, in_decl); | |
ce2e5191 NS |
7583 | if (decl != error_mark_node) |
7584 | { | |
7585 | if (init) | |
7586 | DECL_INITIAL (decl) = error_mark_node; | |
7587 | /* By marking the declaration as instantiated, we avoid | |
7588 | trying to instantiate it. Since instantiate_decl can't | |
7589 | handle local variables, and since we've already done | |
7590 | all that needs to be done, that's the right thing to | |
7591 | do. */ | |
7592 | if (TREE_CODE (decl) == VAR_DECL) | |
7593 | DECL_TEMPLATE_INSTANTIATED (decl) = 1; | |
edebf865 MM |
7594 | if (TREE_CODE (decl) == VAR_DECL |
7595 | && ANON_AGGR_TYPE_P (TREE_TYPE (decl))) | |
7596 | /* Anonymous aggregates are a special case. */ | |
7597 | finish_anon_union (decl); | |
7598 | else | |
ed2fa432 | 7599 | { |
edebf865 | 7600 | maybe_push_decl (decl); |
39703eb9 MM |
7601 | if (TREE_CODE (decl) == VAR_DECL |
7602 | && DECL_PRETTY_FUNCTION_P (decl)) | |
edebf865 MM |
7603 | { |
7604 | /* For __PRETTY_FUNCTION__ we have to adjust the | |
7605 | initializer. */ | |
7606 | const char *const name | |
7607 | = cxx_printable_name (current_function_decl, 2); | |
7608 | init = cp_fname_init (name); | |
7609 | TREE_TYPE (decl) = TREE_TYPE (init); | |
7610 | } | |
7611 | else | |
7612 | init = tsubst_expr (init, args, complain, in_decl); | |
7613 | cp_finish_decl (decl, init, NULL_TREE, 0); | |
ed2fa432 | 7614 | } |
ce2e5191 | 7615 | } |
acef433b | 7616 | } |
fd10dd09 JM |
7617 | |
7618 | /* A DECL_STMT can also be used as an expression, in the condition | |
27631dae | 7619 | clause of an if/for/while construct. If we aren't followed by |
fd10dd09 JM |
7620 | another statement, return our decl. */ |
7621 | if (TREE_CHAIN (t) == NULL_TREE) | |
7622 | return decl; | |
5566b478 | 7623 | } |
fd10dd09 | 7624 | break; |
8d08fdba | 7625 | |
5566b478 MS |
7626 | case FOR_STMT: |
7627 | { | |
a7e4cfa0 | 7628 | prep_stmt (t); |
5566b478 | 7629 | |
558475f0 | 7630 | stmt = begin_for_stmt (); |
fd10dd09 | 7631 | tsubst_expr (FOR_INIT_STMT (t), args, complain, in_decl); |
558475f0 | 7632 | finish_for_init_stmt (stmt); |
c2ea3a40 NS |
7633 | finish_for_cond (tsubst_expr (FOR_COND (t), |
7634 | args, complain, in_decl), | |
558475f0 | 7635 | stmt); |
4393e105 | 7636 | tmp = tsubst_expr (FOR_EXPR (t), args, complain, in_decl); |
558475f0 | 7637 | finish_for_expr (tmp, stmt); |
4393e105 | 7638 | tsubst_expr (FOR_BODY (t), args, complain, in_decl); |
35b1567d | 7639 | finish_for_stmt (stmt); |
5566b478 MS |
7640 | } |
7641 | break; | |
8d08fdba | 7642 | |
5566b478 MS |
7643 | case WHILE_STMT: |
7644 | { | |
a7e4cfa0 | 7645 | prep_stmt (t); |
558475f0 | 7646 | stmt = begin_while_stmt (); |
ad321293 | 7647 | finish_while_stmt_cond (tsubst_expr (WHILE_COND (t), |
4393e105 | 7648 | args, complain, in_decl), |
558475f0 | 7649 | stmt); |
4393e105 | 7650 | tsubst_expr (WHILE_BODY (t), args, complain, in_decl); |
558475f0 | 7651 | finish_while_stmt (stmt); |
5566b478 MS |
7652 | } |
7653 | break; | |
8d08fdba | 7654 | |
5566b478 MS |
7655 | case DO_STMT: |
7656 | { | |
a7e4cfa0 | 7657 | prep_stmt (t); |
558475f0 | 7658 | stmt = begin_do_stmt (); |
4393e105 | 7659 | tsubst_expr (DO_BODY (t), args, complain, in_decl); |
558475f0 | 7660 | finish_do_body (stmt); |
c2ea3a40 NS |
7661 | finish_do_stmt (tsubst_expr (DO_COND (t), |
7662 | args, complain, in_decl), | |
558475f0 | 7663 | stmt); |
5566b478 MS |
7664 | } |
7665 | break; | |
a0a33927 | 7666 | |
5566b478 | 7667 | case IF_STMT: |
8d08fdba | 7668 | { |
a7e4cfa0 | 7669 | prep_stmt (t); |
558475f0 | 7670 | stmt = begin_if_stmt (); |
ad321293 | 7671 | finish_if_stmt_cond (tsubst_expr (IF_COND (t), |
4393e105 | 7672 | args, complain, in_decl), |
558475f0 | 7673 | stmt); |
db5ae43f | 7674 | |
ad321293 | 7675 | if (tmp = THEN_CLAUSE (t), tmp) |
db5ae43f | 7676 | { |
4393e105 | 7677 | tsubst_expr (tmp, args, complain, in_decl); |
558475f0 | 7678 | finish_then_clause (stmt); |
db5ae43f MS |
7679 | } |
7680 | ||
ad321293 MM |
7681 | if (tmp = ELSE_CLAUSE (t), tmp) |
7682 | { | |
7683 | begin_else_clause (); | |
4393e105 | 7684 | tsubst_expr (tmp, args, complain, in_decl); |
558475f0 | 7685 | finish_else_clause (stmt); |
ad321293 | 7686 | } |
8d08fdba | 7687 | |
ad321293 | 7688 | finish_if_stmt (); |
8d08fdba | 7689 | } |
5566b478 | 7690 | break; |
8d08fdba | 7691 | |
5566b478 MS |
7692 | case COMPOUND_STMT: |
7693 | { | |
a7e4cfa0 | 7694 | prep_stmt (t); |
ade3dc07 JM |
7695 | if (COMPOUND_STMT_BODY_BLOCK (t)) |
7696 | stmt = begin_function_body (); | |
7697 | else | |
7698 | stmt = begin_compound_stmt (COMPOUND_STMT_NO_SCOPE (t)); | |
7699 | ||
a5bcc582 NS |
7700 | tsubst_expr (COMPOUND_BODY (t), args, |
7701 | complain | ((stmt_expr & tf_stmt_expr_cmpd) << 1), | |
7702 | in_decl); | |
ade3dc07 JM |
7703 | |
7704 | if (COMPOUND_STMT_BODY_BLOCK (t)) | |
7705 | finish_function_body (stmt); | |
7706 | else | |
7a3397c7 | 7707 | finish_compound_stmt (stmt); |
5566b478 MS |
7708 | } |
7709 | break; | |
8d08fdba | 7710 | |
5566b478 | 7711 | case BREAK_STMT: |
a7e4cfa0 | 7712 | prep_stmt (t); |
ad321293 | 7713 | finish_break_stmt (); |
5566b478 | 7714 | break; |
8d08fdba | 7715 | |
6467930b | 7716 | case CONTINUE_STMT: |
a7e4cfa0 | 7717 | prep_stmt (t); |
ad321293 | 7718 | finish_continue_stmt (); |
6467930b MS |
7719 | break; |
7720 | ||
5566b478 MS |
7721 | case SWITCH_STMT: |
7722 | { | |
558475f0 | 7723 | tree val; |
5566b478 | 7724 | |
a7e4cfa0 | 7725 | prep_stmt (t); |
527f0080 | 7726 | stmt = begin_switch_stmt (); |
4393e105 | 7727 | val = tsubst_expr (SWITCH_COND (t), args, complain, in_decl); |
527f0080 | 7728 | finish_switch_cond (val, stmt); |
558475f0 | 7729 | tsubst_expr (SWITCH_BODY (t), args, complain, in_decl); |
35b1567d | 7730 | finish_switch_stmt (stmt); |
5566b478 MS |
7731 | } |
7732 | break; | |
7733 | ||
7734 | case CASE_LABEL: | |
a7e4cfa0 | 7735 | prep_stmt (t); |
4393e105 | 7736 | finish_case_label (tsubst_expr (CASE_LOW (t), args, complain, in_decl), |
56cb9733 MM |
7737 | tsubst_expr (CASE_HIGH (t), args, complain, |
7738 | in_decl)); | |
5566b478 MS |
7739 | break; |
7740 | ||
acef433b | 7741 | case LABEL_STMT: |
d479d37f | 7742 | input_line = STMT_LINENO (t); |
acef433b | 7743 | finish_label_stmt (DECL_NAME (LABEL_STMT_LABEL (t))); |
5566b478 MS |
7744 | break; |
7745 | ||
aa16c0fa KL |
7746 | case FILE_STMT: |
7747 | input_filename = FILE_STMT_FILENAME (t); | |
7748 | add_stmt (build_nt (FILE_STMT, FILE_STMT_FILENAME_NODE (t))); | |
7749 | break; | |
7750 | ||
5566b478 | 7751 | case GOTO_STMT: |
a7e4cfa0 | 7752 | prep_stmt (t); |
fd10dd09 JM |
7753 | tmp = GOTO_DESTINATION (t); |
7754 | if (TREE_CODE (tmp) != LABEL_DECL) | |
aa09da44 MM |
7755 | /* Computed goto's must be tsubst'd into. On the other hand, |
7756 | non-computed gotos must not be; the identifier in question | |
7757 | will have no binding. */ | |
fd10dd09 | 7758 | tmp = tsubst_expr (tmp, args, complain, in_decl); |
3fa56191 | 7759 | else |
fd10dd09 JM |
7760 | tmp = DECL_NAME (tmp); |
7761 | finish_goto_stmt (tmp); | |
ad321293 MM |
7762 | break; |
7763 | ||
7764 | case ASM_STMT: | |
a7e4cfa0 | 7765 | prep_stmt (t); |
c87978aa JM |
7766 | tmp = finish_asm_stmt |
7767 | (ASM_CV_QUAL (t), | |
7768 | tsubst_expr (ASM_STRING (t), args, complain, in_decl), | |
7769 | tsubst_expr (ASM_OUTPUTS (t), args, complain, in_decl), | |
7770 | tsubst_expr (ASM_INPUTS (t), args, complain, in_decl), | |
7771 | tsubst_expr (ASM_CLOBBERS (t), args, complain, in_decl)); | |
7772 | ASM_INPUT_P (tmp) = ASM_INPUT_P (t); | |
5566b478 | 7773 | break; |
faf5394a MS |
7774 | |
7775 | case TRY_BLOCK: | |
a7e4cfa0 | 7776 | prep_stmt (t); |
f1dedc31 | 7777 | if (CLEANUP_P (t)) |
62409b39 | 7778 | { |
57b52417 | 7779 | stmt = begin_try_block (); |
62409b39 MM |
7780 | tsubst_expr (TRY_STMTS (t), args, complain, in_decl); |
7781 | finish_cleanup_try_block (stmt); | |
7782 | finish_cleanup (tsubst_expr (TRY_HANDLERS (t), args, | |
7783 | complain, in_decl), | |
7784 | stmt); | |
7785 | } | |
f1dedc31 MM |
7786 | else |
7787 | { | |
62409b39 MM |
7788 | if (FN_TRY_BLOCK_P (t)) |
7789 | stmt = begin_function_try_block (); | |
7790 | else | |
7791 | stmt = begin_try_block (); | |
7792 | ||
7793 | tsubst_expr (TRY_STMTS (t), args, complain, in_decl); | |
7794 | ||
7795 | if (FN_TRY_BLOCK_P (t)) | |
7796 | finish_function_try_block (stmt); | |
7797 | else | |
7798 | finish_try_block (stmt); | |
7799 | ||
fd10dd09 | 7800 | tsubst_expr (TRY_HANDLERS (t), args, complain, in_decl); |
84df082b MM |
7801 | if (FN_TRY_BLOCK_P (t)) |
7802 | finish_function_handler_sequence (stmt); | |
7803 | else | |
7804 | finish_handler_sequence (stmt); | |
f1dedc31 | 7805 | } |
faf5394a | 7806 | break; |
b35d4555 | 7807 | |
faf5394a | 7808 | case HANDLER: |
b35d4555 MM |
7809 | { |
7810 | tree decl; | |
b35d4555 MM |
7811 | |
7812 | prep_stmt (t); | |
7813 | stmt = begin_handler (); | |
7814 | if (HANDLER_PARMS (t)) | |
7815 | { | |
7816 | decl = DECL_STMT_DECL (HANDLER_PARMS (t)); | |
7817 | decl = tsubst (decl, args, complain, in_decl); | |
f8191e64 MM |
7818 | /* Prevent instantiate_decl from trying to instantiate |
7819 | this variable. We've already done all that needs to be | |
7820 | done. */ | |
7821 | DECL_TEMPLATE_INSTANTIATED (decl) = 1; | |
b35d4555 MM |
7822 | } |
7823 | else | |
7824 | decl = NULL_TREE; | |
1a6025b4 | 7825 | finish_handler_parms (decl, stmt); |
b35d4555 | 7826 | tsubst_expr (HANDLER_BODY (t), args, complain, in_decl); |
1a6025b4 | 7827 | finish_handler (stmt); |
b35d4555 | 7828 | } |
faf5394a MS |
7829 | break; |
7830 | ||
b87692e5 | 7831 | case TAG_DEFN: |
a7e4cfa0 | 7832 | prep_stmt (t); |
fd10dd09 | 7833 | tsubst (TREE_TYPE (t), args, complain, NULL_TREE); |
b87692e5 MS |
7834 | break; |
7835 | ||
5566b478 | 7836 | default: |
fd10dd09 | 7837 | abort (); |
5566b478 | 7838 | } |
fd10dd09 | 7839 | |
a5bcc582 | 7840 | return tsubst_expr (TREE_CHAIN (t), args, complain | stmt_expr, in_decl); |
8d08fdba MS |
7841 | } |
7842 | ||
b3445994 MM |
7843 | /* T is a postfix-expression that is not being used in a function |
7844 | call. Return the substituted version of T. */ | |
7845 | ||
7846 | static tree | |
7847 | tsubst_non_call_postfix_expression (tree t, tree args, | |
7848 | tsubst_flags_t complain, | |
7849 | tree in_decl) | |
7850 | { | |
7851 | if (TREE_CODE (t) == SCOPE_REF) | |
7852 | t = tsubst_qualified_id (t, args, complain, in_decl, | |
7853 | /*done=*/false, /*address_p=*/false); | |
7854 | else | |
7855 | t = tsubst_copy_and_build (t, args, complain, in_decl, | |
7856 | /*function_p=*/false); | |
7857 | ||
7858 | return t; | |
7859 | } | |
7860 | ||
cc23546e | 7861 | /* Like tsubst but deals with expressions and performs semantic |
b3445994 | 7862 | analysis. FUNCTION_P is true if T is the "F" in "F (ARGS)". */ |
cc23546e | 7863 | |
ee76b931 | 7864 | tree |
3a978d72 NN |
7865 | tsubst_copy_and_build (tree t, |
7866 | tree args, | |
7867 | tsubst_flags_t complain, | |
b3445994 MM |
7868 | tree in_decl, |
7869 | bool function_p) | |
cc23546e | 7870 | { |
b3445994 MM |
7871 | #define RECUR(NODE) \ |
7872 | tsubst_copy_and_build (NODE, args, complain, in_decl, /*function_p=*/false) | |
7873 | ||
ee76b931 MM |
7874 | tree op1; |
7875 | ||
cc23546e JO |
7876 | if (t == NULL_TREE || t == error_mark_node) |
7877 | return t; | |
7878 | ||
7879 | switch (TREE_CODE (t)) | |
7880 | { | |
399dedb9 NS |
7881 | case USING_DECL: |
7882 | t = DECL_NAME (t); | |
7883 | /* Fallthrough. */ | |
b3445994 | 7884 | case IDENTIFIER_NODE: |
cc23546e | 7885 | { |
b3445994 | 7886 | tree decl; |
b3445994 MM |
7887 | cp_id_kind idk; |
7888 | tree qualifying_class; | |
7889 | bool non_constant_expression_p; | |
7890 | const char *error_msg; | |
7891 | ||
b3445994 | 7892 | if (IDENTIFIER_TYPENAME_P (t)) |
cc23546e | 7893 | { |
b3445994 MM |
7894 | tree new_type = tsubst (TREE_TYPE (t), args, complain, in_decl); |
7895 | t = mangle_conv_op_name_for_type (new_type); | |
cc23546e | 7896 | } |
b3445994 MM |
7897 | |
7898 | /* Look up the name. */ | |
10b1d5e7 | 7899 | decl = lookup_name (t, 0); |
b3445994 MM |
7900 | |
7901 | /* By convention, expressions use ERROR_MARK_NODE to indicate | |
7902 | failure, not NULL_TREE. */ | |
7903 | if (decl == NULL_TREE) | |
7904 | decl = error_mark_node; | |
7905 | ||
10b1d5e7 | 7906 | decl = finish_id_expression (t, decl, NULL_TREE, |
b3445994 MM |
7907 | &idk, |
7908 | &qualifying_class, | |
7909 | /*constant_expression_p=*/false, | |
7910 | /*allow_non_constant_expression_p=*/false, | |
7911 | &non_constant_expression_p, | |
7912 | &error_msg); | |
7913 | if (error_msg) | |
7914 | error (error_msg); | |
7915 | if (!function_p && TREE_CODE (decl) == IDENTIFIER_NODE) | |
7916 | decl = unqualified_name_lookup_error (decl); | |
7917 | return decl; | |
cc23546e JO |
7918 | } |
7919 | ||
7920 | case TEMPLATE_ID_EXPR: | |
7921 | { | |
7922 | tree object; | |
b3445994 | 7923 | tree template = RECUR (TREE_OPERAND (t, 0)); |
bf12d54d NS |
7924 | tree targs = TREE_OPERAND (t, 1); |
7925 | ||
7926 | if (targs) | |
7927 | targs = tsubst_template_args (targs, args, complain, in_decl); | |
cc23546e JO |
7928 | |
7929 | if (TREE_CODE (template) == COMPONENT_REF) | |
7930 | { | |
7931 | object = TREE_OPERAND (template, 0); | |
7932 | template = TREE_OPERAND (template, 1); | |
7933 | } | |
7934 | else | |
7935 | object = NULL_TREE; | |
bd83b409 | 7936 | template = lookup_template_function (template, targs); |
cc23546e JO |
7937 | |
7938 | if (object) | |
7939 | return build (COMPONENT_REF, TREE_TYPE (template), | |
7940 | object, template); | |
7941 | else | |
7942 | return template; | |
7943 | } | |
7944 | ||
7945 | case INDIRECT_REF: | |
b3445994 | 7946 | return build_x_indirect_ref (RECUR (TREE_OPERAND (t, 0)), "unary *"); |
cc23546e JO |
7947 | |
7948 | case CAST_EXPR: | |
7949 | return build_functional_cast | |
7950 | (tsubst (TREE_TYPE (t), args, complain, in_decl), | |
b3445994 | 7951 | RECUR (TREE_OPERAND (t, 0))); |
cc23546e JO |
7952 | |
7953 | case REINTERPRET_CAST_EXPR: | |
7954 | return build_reinterpret_cast | |
7955 | (tsubst (TREE_TYPE (t), args, complain, in_decl), | |
b3445994 | 7956 | RECUR (TREE_OPERAND (t, 0))); |
cc23546e JO |
7957 | |
7958 | case CONST_CAST_EXPR: | |
7959 | return build_const_cast | |
7960 | (tsubst (TREE_TYPE (t), args, complain, in_decl), | |
b3445994 | 7961 | RECUR (TREE_OPERAND (t, 0))); |
cc23546e JO |
7962 | |
7963 | case DYNAMIC_CAST_EXPR: | |
7964 | return build_dynamic_cast | |
7965 | (tsubst (TREE_TYPE (t), args, complain, in_decl), | |
b3445994 | 7966 | RECUR (TREE_OPERAND (t, 0))); |
cc23546e JO |
7967 | |
7968 | case STATIC_CAST_EXPR: | |
7969 | return build_static_cast | |
7970 | (tsubst (TREE_TYPE (t), args, complain, in_decl), | |
b3445994 | 7971 | RECUR (TREE_OPERAND (t, 0))); |
cc23546e | 7972 | |
cc23546e JO |
7973 | case POSTDECREMENT_EXPR: |
7974 | case POSTINCREMENT_EXPR: | |
b3445994 MM |
7975 | op1 = tsubst_non_call_postfix_expression (TREE_OPERAND (t, 0), |
7976 | args, complain, in_decl); | |
ee76b931 MM |
7977 | return build_x_unary_op (TREE_CODE (t), op1); |
7978 | ||
7979 | case PREDECREMENT_EXPR: | |
7980 | case PREINCREMENT_EXPR: | |
cc23546e JO |
7981 | case NEGATE_EXPR: |
7982 | case BIT_NOT_EXPR: | |
cc23546e | 7983 | case ABS_EXPR: |
d17811fd MM |
7984 | case TRUTH_NOT_EXPR: |
7985 | case CONVERT_EXPR: /* Unary + */ | |
7986 | case REALPART_EXPR: | |
7987 | case IMAGPART_EXPR: | |
b3445994 | 7988 | return build_x_unary_op (TREE_CODE (t), RECUR (TREE_OPERAND (t, 0))); |
cc23546e | 7989 | |
cc23546e | 7990 | case ADDR_EXPR: |
ee76b931 MM |
7991 | op1 = TREE_OPERAND (t, 0); |
7992 | if (TREE_CODE (op1) == SCOPE_REF) | |
7993 | op1 = tsubst_qualified_id (op1, args, complain, in_decl, | |
7994 | /*done=*/true, /*address_p=*/true); | |
7995 | else | |
b3445994 MM |
7996 | op1 = tsubst_non_call_postfix_expression (op1, args, complain, |
7997 | in_decl); | |
fc2b8477 MM |
7998 | if (TREE_CODE (op1) == LABEL_DECL) |
7999 | return finish_label_address_expr (DECL_NAME (op1)); | |
ee76b931 MM |
8000 | return build_x_unary_op (ADDR_EXPR, op1); |
8001 | ||
cc23546e JO |
8002 | case PLUS_EXPR: |
8003 | case MINUS_EXPR: | |
8004 | case MULT_EXPR: | |
8005 | case TRUNC_DIV_EXPR: | |
8006 | case CEIL_DIV_EXPR: | |
8007 | case FLOOR_DIV_EXPR: | |
8008 | case ROUND_DIV_EXPR: | |
8009 | case EXACT_DIV_EXPR: | |
8010 | case BIT_AND_EXPR: | |
cc23546e JO |
8011 | case BIT_IOR_EXPR: |
8012 | case BIT_XOR_EXPR: | |
8013 | case TRUNC_MOD_EXPR: | |
8014 | case FLOOR_MOD_EXPR: | |
8015 | case TRUTH_ANDIF_EXPR: | |
8016 | case TRUTH_ORIF_EXPR: | |
8017 | case TRUTH_AND_EXPR: | |
8018 | case TRUTH_OR_EXPR: | |
8019 | case RSHIFT_EXPR: | |
8020 | case LSHIFT_EXPR: | |
8021 | case RROTATE_EXPR: | |
8022 | case LROTATE_EXPR: | |
8023 | case EQ_EXPR: | |
8024 | case NE_EXPR: | |
8025 | case MAX_EXPR: | |
8026 | case MIN_EXPR: | |
8027 | case LE_EXPR: | |
8028 | case GE_EXPR: | |
8029 | case LT_EXPR: | |
8030 | case GT_EXPR: | |
8031 | case MEMBER_REF: | |
b3445994 | 8032 | case DOTSTAR_EXPR: |
cc23546e JO |
8033 | return build_x_binary_op |
8034 | (TREE_CODE (t), | |
b3445994 MM |
8035 | RECUR (TREE_OPERAND (t, 0)), |
8036 | RECUR (TREE_OPERAND (t, 1))); | |
cc23546e JO |
8037 | |
8038 | case SCOPE_REF: | |
ee76b931 MM |
8039 | return tsubst_qualified_id (t, args, complain, in_decl, /*done=*/true, |
8040 | /*address_p=*/false); | |
cc23546e JO |
8041 | |
8042 | case ARRAY_REF: | |
ee76b931 MM |
8043 | if (tsubst_copy (TREE_OPERAND (t, 0), args, complain, in_decl) |
8044 | == NULL_TREE) | |
8045 | /* new-type-id */ | |
b3445994 | 8046 | return build_nt (ARRAY_REF, NULL_TREE, RECUR (TREE_OPERAND (t, 1))); |
ee76b931 | 8047 | |
b3445994 MM |
8048 | op1 = tsubst_non_call_postfix_expression (TREE_OPERAND (t, 0), |
8049 | args, complain, in_decl); | |
ee76b931 MM |
8050 | /* Remember that there was a reference to this entity. */ |
8051 | if (DECL_P (op1)) | |
8052 | mark_used (op1); | |
b3445994 | 8053 | return grok_array_decl (op1, RECUR (TREE_OPERAND (t, 1))); |
cc23546e JO |
8054 | |
8055 | case SIZEOF_EXPR: | |
8056 | case ALIGNOF_EXPR: | |
d17811fd MM |
8057 | op1 = TREE_OPERAND (t, 0); |
8058 | if (!args) | |
8059 | { | |
8060 | /* When there are no ARGS, we are trying to evaluate a | |
8061 | non-dependent expression from the parser. Trying to do | |
8062 | the substitutions may not work. */ | |
8063 | if (!TYPE_P (op1)) | |
8064 | op1 = TREE_TYPE (op1); | |
8065 | } | |
8066 | else | |
8067 | { | |
8068 | ++skip_evaluation; | |
b3445994 | 8069 | op1 = RECUR (op1); |
d17811fd MM |
8070 | --skip_evaluation; |
8071 | } | |
7a18b933 NS |
8072 | if (TYPE_P (op1)) |
8073 | return cxx_sizeof_or_alignof_type (op1, TREE_CODE (t), true); | |
d17811fd | 8074 | else |
7a18b933 | 8075 | return cxx_sizeof_or_alignof_expr (op1, TREE_CODE (t)); |
cc23546e JO |
8076 | |
8077 | case MODOP_EXPR: | |
8078 | return build_x_modify_expr | |
b3445994 | 8079 | (RECUR (TREE_OPERAND (t, 0)), |
cc23546e | 8080 | TREE_CODE (TREE_OPERAND (t, 1)), |
b3445994 | 8081 | RECUR (TREE_OPERAND (t, 2))); |
cc23546e JO |
8082 | |
8083 | case ARROW_EXPR: | |
b3445994 MM |
8084 | op1 = tsubst_non_call_postfix_expression (TREE_OPERAND (t, 0), |
8085 | args, complain, in_decl); | |
ee76b931 MM |
8086 | /* Remember that there was a reference to this entity. */ |
8087 | if (DECL_P (op1)) | |
8088 | mark_used (op1); | |
8089 | return build_x_arrow (op1); | |
cc23546e JO |
8090 | |
8091 | case NEW_EXPR: | |
8092 | return build_new | |
b3445994 MM |
8093 | (RECUR (TREE_OPERAND (t, 0)), |
8094 | RECUR (TREE_OPERAND (t, 1)), | |
8095 | RECUR (TREE_OPERAND (t, 2)), | |
cc23546e JO |
8096 | NEW_EXPR_USE_GLOBAL (t)); |
8097 | ||
8098 | case DELETE_EXPR: | |
8099 | return delete_sanity | |
b3445994 MM |
8100 | (RECUR (TREE_OPERAND (t, 0)), |
8101 | RECUR (TREE_OPERAND (t, 1)), | |
cc23546e JO |
8102 | DELETE_EXPR_USE_VEC (t), |
8103 | DELETE_EXPR_USE_GLOBAL (t)); | |
8104 | ||
8105 | case COMPOUND_EXPR: | |
b3445994 MM |
8106 | return build_x_compound_expr (RECUR (TREE_OPERAND (t, 0)), |
8107 | RECUR (TREE_OPERAND (t, 1))); | |
cc23546e | 8108 | |
ee76b931 | 8109 | case CALL_EXPR: |
cc23546e | 8110 | { |
ee76b931 MM |
8111 | tree function; |
8112 | tree call_args; | |
ee76b931 | 8113 | bool qualified_p; |
ee935db4 | 8114 | bool koenig_p; |
ee76b931 MM |
8115 | |
8116 | function = TREE_OPERAND (t, 0); | |
6d80c4b9 MM |
8117 | /* When we parsed the expression, we determined whether or |
8118 | not Koenig lookup should be performed. */ | |
8119 | koenig_p = KOENIG_LOOKUP_P (t); | |
ee76b931 | 8120 | if (TREE_CODE (function) == SCOPE_REF) |
cc23546e | 8121 | { |
ee76b931 MM |
8122 | qualified_p = true; |
8123 | function = tsubst_qualified_id (function, args, complain, in_decl, | |
8124 | /*done=*/false, | |
8125 | /*address_p=*/false); | |
cc23546e | 8126 | } |
ee76b931 | 8127 | else |
cc23546e | 8128 | { |
ee76b931 MM |
8129 | qualified_p = (TREE_CODE (function) == COMPONENT_REF |
8130 | && (TREE_CODE (TREE_OPERAND (function, 1)) | |
8131 | == SCOPE_REF)); | |
8132 | function = tsubst_copy_and_build (function, args, complain, | |
b3445994 MM |
8133 | in_decl, |
8134 | !qualified_p); | |
6d80c4b9 MM |
8135 | if (BASELINK_P (function)) |
8136 | qualified_p = true; | |
cc23546e | 8137 | } |
cc23546e | 8138 | |
b3445994 | 8139 | call_args = RECUR (TREE_OPERAND (t, 1)); |
bbaab916 | 8140 | |
ee935db4 | 8141 | if (koenig_p |
b3445994 MM |
8142 | && (is_overloaded_fn (function) |
8143 | || DECL_P (function) | |
8144 | || TREE_CODE (function) == IDENTIFIER_NODE)) | |
6d80c4b9 MM |
8145 | function = perform_koenig_lookup (function, call_args); |
8146 | ||
8147 | if (TREE_CODE (function) == IDENTIFIER_NODE) | |
b3445994 | 8148 | { |
6d80c4b9 MM |
8149 | unqualified_name_lookup_error (function); |
8150 | return error_mark_node; | |
b3445994 MM |
8151 | } |
8152 | ||
8153 | /* Remember that there was a reference to this entity. */ | |
8154 | if (DECL_P (function)) | |
8155 | mark_used (function); | |
8156 | ||
8157 | function = convert_from_reference (function); | |
d17811fd MM |
8158 | |
8159 | if (TREE_CODE (function) == OFFSET_REF) | |
8160 | return build_offset_ref_call_from_tree (function, call_args); | |
8161 | if (TREE_CODE (function) == COMPONENT_REF) | |
8162 | return (build_new_method_call | |
8163 | (TREE_OPERAND (function, 0), | |
8164 | TREE_OPERAND (function, 1), | |
8165 | call_args, NULL_TREE, | |
8166 | qualified_p ? LOOKUP_NONVIRTUAL : LOOKUP_NORMAL)); | |
8167 | return finish_call_expr (function, call_args, | |
6d80c4b9 MM |
8168 | /*disallow_virtual=*/qualified_p, |
8169 | koenig_p); | |
cc23546e JO |
8170 | } |
8171 | ||
8172 | case COND_EXPR: | |
8173 | return build_x_conditional_expr | |
b3445994 MM |
8174 | (RECUR (TREE_OPERAND (t, 0)), |
8175 | RECUR (TREE_OPERAND (t, 1)), | |
8176 | RECUR (TREE_OPERAND (t, 2))); | |
cc23546e JO |
8177 | |
8178 | case PSEUDO_DTOR_EXPR: | |
8179 | return finish_pseudo_destructor_expr | |
b3445994 MM |
8180 | (RECUR (TREE_OPERAND (t, 0)), |
8181 | RECUR (TREE_OPERAND (t, 1)), | |
8182 | RECUR (TREE_OPERAND (t, 2))); | |
cc23546e JO |
8183 | |
8184 | case TREE_LIST: | |
8185 | { | |
8186 | tree purpose, value, chain; | |
8187 | ||
8188 | if (t == void_list_node) | |
8189 | return t; | |
8190 | ||
8191 | purpose = TREE_PURPOSE (t); | |
8192 | if (purpose) | |
b3445994 | 8193 | purpose = RECUR (purpose); |
cc23546e JO |
8194 | value = TREE_VALUE (t); |
8195 | if (value) | |
b3445994 | 8196 | value = RECUR (value); |
cc23546e JO |
8197 | chain = TREE_CHAIN (t); |
8198 | if (chain && chain != void_type_node) | |
b3445994 | 8199 | chain = RECUR (chain); |
cc23546e JO |
8200 | if (purpose == TREE_PURPOSE (t) |
8201 | && value == TREE_VALUE (t) | |
8202 | && chain == TREE_CHAIN (t)) | |
8203 | return t; | |
8204 | return tree_cons (purpose, value, chain); | |
8205 | } | |
8206 | ||
8207 | case COMPONENT_REF: | |
8208 | { | |
ee76b931 MM |
8209 | tree object; |
8210 | tree member; | |
8211 | ||
b3445994 MM |
8212 | object = tsubst_non_call_postfix_expression (TREE_OPERAND (t, 0), |
8213 | args, complain, in_decl); | |
ee76b931 MM |
8214 | /* Remember that there was a reference to this entity. */ |
8215 | if (DECL_P (object)) | |
8216 | mark_used (object); | |
8217 | ||
8218 | member = TREE_OPERAND (t, 1); | |
8219 | if (BASELINK_P (member)) | |
8220 | member = tsubst_baselink (member, | |
8221 | non_reference (TREE_TYPE (object)), | |
8222 | args, complain, in_decl); | |
8223 | else | |
8224 | member = tsubst_copy (member, args, complain, in_decl); | |
cc23546e JO |
8225 | |
8226 | if (!CLASS_TYPE_P (TREE_TYPE (object))) | |
8227 | { | |
8228 | if (TREE_CODE (member) == BIT_NOT_EXPR) | |
8229 | return finish_pseudo_destructor_expr (object, | |
8230 | NULL_TREE, | |
8231 | TREE_TYPE (object)); | |
8232 | else if (TREE_CODE (member) == SCOPE_REF | |
8233 | && (TREE_CODE (TREE_OPERAND (member, 1)) == BIT_NOT_EXPR)) | |
8234 | return finish_pseudo_destructor_expr (object, | |
8235 | object, | |
8236 | TREE_TYPE (object)); | |
8237 | } | |
8238 | else if (TREE_CODE (member) == SCOPE_REF | |
8239 | && TREE_CODE (TREE_OPERAND (member, 1)) == TEMPLATE_ID_EXPR) | |
8240 | { | |
8241 | tree tmpl; | |
8242 | tree args; | |
8243 | ||
8244 | /* Lookup the template functions now that we know what the | |
8245 | scope is. */ | |
8246 | tmpl = TREE_OPERAND (TREE_OPERAND (member, 1), 0); | |
8247 | args = TREE_OPERAND (TREE_OPERAND (member, 1), 1); | |
22038b2c | 8248 | member = lookup_qualified_name (TREE_OPERAND (member, 0), tmpl, |
12483c9f NS |
8249 | /*is_type_p=*/false, |
8250 | /*complain=*/false); | |
cc23546e JO |
8251 | if (BASELINK_P (member)) |
8252 | BASELINK_FUNCTIONS (member) | |
8253 | = build_nt (TEMPLATE_ID_EXPR, BASELINK_FUNCTIONS (member), | |
8254 | args); | |
8255 | else | |
8256 | { | |
22038b2c | 8257 | qualified_name_lookup_error (TREE_TYPE (object), tmpl); |
cc23546e JO |
8258 | return error_mark_node; |
8259 | } | |
8260 | } | |
a3f10e50 NS |
8261 | else if (TREE_CODE (member) == FIELD_DECL) |
8262 | return finish_non_static_data_member (member, object, NULL_TREE); | |
cc23546e JO |
8263 | |
8264 | return finish_class_member_access_expr (object, member); | |
8265 | } | |
8266 | ||
8267 | case THROW_EXPR: | |
8268 | return build_throw | |
b3445994 | 8269 | (RECUR (TREE_OPERAND (t, 0))); |
cc23546e JO |
8270 | |
8271 | case CONSTRUCTOR: | |
8272 | { | |
8273 | tree r; | |
8274 | tree elts; | |
8275 | tree type = tsubst (TREE_TYPE (t), args, complain, in_decl); | |
8276 | bool purpose_p; | |
8277 | ||
8278 | /* digest_init will do the wrong thing if we let it. */ | |
8279 | if (type && TYPE_PTRMEMFUNC_P (type)) | |
8280 | return t; | |
8281 | ||
8282 | r = NULL_TREE; | |
8283 | /* We do not want to process the purpose of aggregate | |
8284 | initializers as they are identifier nodes which will be | |
8285 | looked up by digest_init. */ | |
8286 | purpose_p = !(type && IS_AGGR_TYPE (type)); | |
db77ef4c | 8287 | for (elts = CONSTRUCTOR_ELTS (t); |
cc23546e JO |
8288 | elts; |
8289 | elts = TREE_CHAIN (elts)) | |
8290 | { | |
8291 | tree purpose = TREE_PURPOSE (elts); | |
8292 | tree value = TREE_VALUE (elts); | |
8293 | ||
8294 | if (purpose && purpose_p) | |
b3445994 MM |
8295 | purpose = RECUR (purpose); |
8296 | value = RECUR (value); | |
cc23546e JO |
8297 | r = tree_cons (purpose, value, r); |
8298 | } | |
8299 | ||
dcf92453 | 8300 | r = build_constructor (NULL_TREE, nreverse (r)); |
cc23546e JO |
8301 | TREE_HAS_CONSTRUCTOR (r) = TREE_HAS_CONSTRUCTOR (t); |
8302 | ||
8303 | if (type) | |
8304 | return digest_init (type, r, 0); | |
8305 | return r; | |
8306 | } | |
8307 | ||
8308 | case TYPEID_EXPR: | |
8309 | { | |
b3445994 | 8310 | tree operand_0 = RECUR (TREE_OPERAND (t, 0)); |
cc23546e JO |
8311 | if (TYPE_P (operand_0)) |
8312 | return get_typeid (operand_0); | |
8313 | return build_typeid (operand_0); | |
8314 | } | |
8315 | ||
8316 | case PARM_DECL: | |
8317 | return convert_from_reference (tsubst_copy (t, args, complain, in_decl)); | |
8318 | ||
8319 | case VAR_DECL: | |
ee76b931 MM |
8320 | if (args) |
8321 | t = tsubst_copy (t, args, complain, in_decl); | |
d17811fd MM |
8322 | else |
8323 | /* If there are no ARGS, then we are evaluating a | |
8324 | non-dependent expression. If the expression is | |
8325 | non-dependent, the variable must be a constant. */ | |
8326 | t = DECL_INITIAL (t); | |
ee76b931 | 8327 | return convert_from_reference (t); |
cc23546e JO |
8328 | |
8329 | case VA_ARG_EXPR: | |
b3445994 MM |
8330 | return build_x_va_arg (RECUR (TREE_OPERAND (t, 0)), |
8331 | tsubst_copy (TREE_TYPE (t), args, complain, | |
8332 | in_decl)); | |
cc23546e JO |
8333 | |
8334 | default: | |
8335 | return tsubst_copy (t, args, complain, in_decl); | |
8336 | } | |
b3445994 MM |
8337 | |
8338 | #undef RECUR | |
cc23546e JO |
8339 | } |
8340 | ||
3e4a3562 NS |
8341 | /* Verify that the instantiated ARGS are valid. For type arguments, |
8342 | make sure that the type's linkage is ok. For non-type arguments, | |
34cd5ae7 | 8343 | make sure they are constants if they are integral or enumerations. |
9bcb9aae | 8344 | Emit an error under control of COMPLAIN, and return TRUE on error. */ |
3e4a3562 NS |
8345 | |
8346 | static bool | |
3a978d72 | 8347 | check_instantiated_args (tree tmpl, tree args, tsubst_flags_t complain) |
3e4a3562 NS |
8348 | { |
8349 | int ix, len = DECL_NTPARMS (tmpl); | |
8350 | bool result = false; | |
8351 | ||
8352 | for (ix = 0; ix != len; ix++) | |
8353 | { | |
8354 | tree t = TREE_VEC_ELT (args, ix); | |
8355 | ||
8356 | if (TYPE_P (t)) | |
8357 | { | |
8358 | /* [basic.link]: A name with no linkage (notably, the name | |
8359 | of a class or enumeration declared in a local scope) | |
8360 | shall not be used to declare an entity with linkage. | |
8361 | This implies that names with no linkage cannot be used as | |
8362 | template arguments. */ | |
8363 | tree nt = no_linkage_check (t); | |
8364 | ||
8365 | if (nt) | |
8366 | { | |
8367 | if (!(complain & tf_error)) | |
8368 | /*OK*/; | |
8369 | else if (TYPE_ANONYMOUS_P (nt)) | |
8370 | error ("`%T' uses anonymous type", t); | |
8371 | else | |
8372 | error ("`%T' uses local type `%T'", t, nt); | |
8373 | result = true; | |
8374 | } | |
8375 | /* In order to avoid all sorts of complications, we do not | |
8376 | allow variably-modified types as template arguments. */ | |
8377 | else if (variably_modified_type_p (t)) | |
8378 | { | |
8379 | if (complain & tf_error) | |
8380 | error ("`%T' is a variably modified type", t); | |
8381 | result = true; | |
8382 | } | |
8383 | } | |
8384 | /* A non-type argument of integral or enumerated type must be a | |
8385 | constant. */ | |
8386 | else if (TREE_TYPE (t) | |
8387 | && INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (t)) | |
8388 | && !TREE_CONSTANT (t)) | |
8389 | { | |
8390 | if (complain & tf_error) | |
8391 | error ("integral expression `%E' is not constant", t); | |
8392 | result = true; | |
8393 | } | |
8394 | } | |
8395 | if (result && complain & tf_error) | |
8396 | error (" trying to instantiate `%D'", tmpl); | |
8397 | return result; | |
8398 | } | |
8399 | ||
6ba89f8e | 8400 | /* Instantiate the indicated variable or function template TMPL with |
36a117a5 MM |
8401 | the template arguments in TARG_PTR. */ |
8402 | ||
5566b478 | 8403 | tree |
3a978d72 | 8404 | instantiate_template (tree tmpl, tree targ_ptr, tsubst_flags_t complain) |
8d08fdba | 8405 | { |
5566b478 | 8406 | tree fndecl; |
36a117a5 MM |
8407 | tree gen_tmpl; |
8408 | tree spec; | |
5566b478 | 8409 | |
27fafc8d JM |
8410 | if (tmpl == error_mark_node) |
8411 | return error_mark_node; | |
8412 | ||
386b8a85 JM |
8413 | my_friendly_assert (TREE_CODE (tmpl) == TEMPLATE_DECL, 283); |
8414 | ||
db9b2174 MM |
8415 | /* If this function is a clone, handle it specially. */ |
8416 | if (DECL_CLONED_FUNCTION_P (tmpl)) | |
3ad97789 | 8417 | { |
3e4a3562 NS |
8418 | tree spec = instantiate_template (DECL_CLONED_FUNCTION (tmpl), targ_ptr, |
8419 | complain); | |
3ad97789 NS |
8420 | tree clone; |
8421 | ||
c6002625 | 8422 | /* Look for the clone. */ |
3ad97789 NS |
8423 | for (clone = TREE_CHAIN (spec); |
8424 | clone && DECL_CLONED_FUNCTION_P (clone); | |
8425 | clone = TREE_CHAIN (clone)) | |
8426 | if (DECL_NAME (clone) == DECL_NAME (tmpl)) | |
8427 | return clone; | |
8428 | /* We should always have found the clone by now. */ | |
a98facb0 | 8429 | abort (); |
3ad97789 NS |
8430 | return NULL_TREE; |
8431 | } | |
8432 | ||
36a117a5 MM |
8433 | /* Check to see if we already have this specialization. */ |
8434 | spec = retrieve_specialization (tmpl, targ_ptr); | |
8435 | if (spec != NULL_TREE) | |
8436 | return spec; | |
8437 | ||
f9a7ae04 MM |
8438 | gen_tmpl = most_general_template (tmpl); |
8439 | if (tmpl != gen_tmpl) | |
386b8a85 | 8440 | { |
36a117a5 MM |
8441 | /* The TMPL is a partial instantiation. To get a full set of |
8442 | arguments we must add the arguments used to perform the | |
8443 | partial instantiation. */ | |
8444 | targ_ptr = add_outermost_template_args (DECL_TI_ARGS (tmpl), | |
8445 | targ_ptr); | |
36a117a5 MM |
8446 | |
8447 | /* Check to see if we already have this specialization. */ | |
8448 | spec = retrieve_specialization (gen_tmpl, targ_ptr); | |
75650646 MM |
8449 | if (spec != NULL_TREE) |
8450 | return spec; | |
386b8a85 JM |
8451 | } |
8452 | ||
3e4a3562 NS |
8453 | if (check_instantiated_args (gen_tmpl, INNERMOST_TEMPLATE_ARGS (targ_ptr), |
8454 | complain)) | |
8455 | return error_mark_node; | |
8456 | ||
2b907f5c KL |
8457 | /* We are building a FUNCTION_DECL, during which the access of its |
8458 | parameters and return types have to be checked. However this | |
8459 | FUNCTION_DECL which is the desired context for access checking | |
8460 | is not built yet. We solve this chicken-and-egg problem by | |
8461 | deferring all checks until we have the FUNCTION_DECL. */ | |
8462 | push_deferring_access_checks (dk_deferred); | |
5c74d5b0 | 8463 | |
5566b478 | 8464 | /* substitute template parameters */ |
17aec3eb | 8465 | fndecl = tsubst (DECL_TEMPLATE_RESULT (gen_tmpl), |
3e4a3562 | 8466 | targ_ptr, complain, gen_tmpl); |
5c74d5b0 | 8467 | |
2b907f5c KL |
8468 | /* Now we know the specialization, compute access previously |
8469 | deferred. */ | |
8470 | push_access_scope (fndecl); | |
8471 | perform_deferred_access_checks (); | |
8472 | pop_access_scope (fndecl); | |
8473 | pop_deferring_access_checks (); | |
5c74d5b0 | 8474 | |
36a117a5 MM |
8475 | /* The DECL_TI_TEMPLATE should always be the immediate parent |
8476 | template, not the most general template. */ | |
8477 | DECL_TI_TEMPLATE (fndecl) = tmpl; | |
8d08fdba | 8478 | |
824b9a4c MS |
8479 | if (flag_external_templates) |
8480 | add_pending_template (fndecl); | |
8481 | ||
94350948 | 8482 | /* If we've just instantiated the main entry point for a function, |
3ad97789 NS |
8483 | instantiate all the alternate entry points as well. We do this |
8484 | by cloning the instantiation of the main entry point, not by | |
8485 | instantiating the template clones. */ | |
8486 | if (TREE_CHAIN (gen_tmpl) && DECL_CLONED_FUNCTION_P (TREE_CHAIN (gen_tmpl))) | |
8487 | clone_function_decl (fndecl, /*update_method_vec_p=*/0); | |
94350948 | 8488 | |
5566b478 | 8489 | return fndecl; |
8d08fdba | 8490 | } |
5566b478 | 8491 | |
4393e105 MM |
8492 | /* The FN is a TEMPLATE_DECL for a function. The ARGS are the |
8493 | arguments that are being used when calling it. TARGS is a vector | |
8494 | into which the deduced template arguments are placed. | |
8d08fdba MS |
8495 | |
8496 | Return zero for success, 2 for an incomplete match that doesn't resolve | |
8497 | all the types, and 1 for complete failure. An error message will be | |
8498 | printed only for an incomplete match. | |
8499 | ||
e5214479 JM |
8500 | If FN is a conversion operator, or we are trying to produce a specific |
8501 | specialization, RETURN_TYPE is the return type desired. | |
9f54c803 MM |
8502 | |
8503 | The EXPLICIT_TARGS are explicit template arguments provided via a | |
8504 | template-id. | |
6467930b | 8505 | |
830bfa74 MM |
8506 | The parameter STRICT is one of: |
8507 | ||
8508 | DEDUCE_CALL: | |
8509 | We are deducing arguments for a function call, as in | |
8510 | [temp.deduct.call]. | |
8511 | ||
8512 | DEDUCE_CONV: | |
8513 | We are deducing arguments for a conversion function, as in | |
8514 | [temp.deduct.conv]. | |
8515 | ||
8516 | DEDUCE_EXACT: | |
62e4a758 NS |
8517 | We are deducing arguments when doing an explicit instantiation |
8518 | as in [temp.explicit], when determining an explicit specialization | |
8519 | as in [temp.expl.spec], or when taking the address of a function | |
8520 | template, as in [temp.deduct.funcaddr]. | |
8521 | ||
8522 | DEDUCE_ORDER: | |
830bfa74 MM |
8523 | We are deducing arguments when calculating the partial |
8524 | ordering between specializations of function or class | |
62e4a758 | 8525 | templates, as in [temp.func.order] and [temp.class.order]. |
4393e105 | 8526 | |
e5214479 JM |
8527 | LEN is the number of parms to consider before returning success, or -1 |
8528 | for all. This is used in partial ordering to avoid comparing parms for | |
8529 | which no actual argument was passed, since they are not considered in | |
8530 | overload resolution (and are explicitly excluded from consideration in | |
8531 | partial ordering in [temp.func.order]/6). */ | |
8d08fdba MS |
8532 | |
8533 | int | |
3a978d72 NN |
8534 | fn_type_unification (tree fn, |
8535 | tree explicit_targs, | |
8536 | tree targs, | |
8537 | tree args, | |
8538 | tree return_type, | |
8539 | unification_kind_t strict, | |
8540 | int len) | |
386b8a85 | 8541 | { |
4393e105 MM |
8542 | tree parms; |
8543 | tree fntype; | |
adecb3f4 | 8544 | int result; |
386b8a85 | 8545 | |
4393e105 | 8546 | my_friendly_assert (TREE_CODE (fn) == TEMPLATE_DECL, 0); |
2b59fc25 | 8547 | |
4393e105 MM |
8548 | fntype = TREE_TYPE (fn); |
8549 | if (explicit_targs) | |
75650646 | 8550 | { |
4393e105 MM |
8551 | /* [temp.deduct] |
8552 | ||
8553 | The specified template arguments must match the template | |
8554 | parameters in kind (i.e., type, nontype, template), and there | |
8555 | must not be more arguments than there are parameters; | |
8556 | otherwise type deduction fails. | |
8557 | ||
8558 | Nontype arguments must match the types of the corresponding | |
8559 | nontype template parameters, or must be convertible to the | |
8560 | types of the corresponding nontype parameters as specified in | |
8561 | _temp.arg.nontype_, otherwise type deduction fails. | |
8562 | ||
8563 | All references in the function type of the function template | |
8564 | to the corresponding template parameters are replaced by the | |
8565 | specified template argument values. If a substitution in a | |
8566 | template parameter or in the function type of the function | |
8567 | template results in an invalid type, type deduction fails. */ | |
8568 | int i; | |
8569 | tree converted_args; | |
ffd49b19 | 8570 | bool incomplete; |
75650646 | 8571 | |
4393e105 MM |
8572 | converted_args |
8573 | = (coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (fn), | |
c2ea3a40 | 8574 | explicit_targs, NULL_TREE, tf_none, |
4393e105 MM |
8575 | /*require_all_arguments=*/0)); |
8576 | if (converted_args == error_mark_node) | |
75650646 | 8577 | return 1; |
386b8a85 | 8578 | |
ffd49b19 NS |
8579 | /* Substitute the explicit args into the function type. This is |
8580 | necessary so that, for instance, explicitly declared function | |
8581 | arguments can match null pointed constants. If we were given | |
8582 | an incomplete set of explicit args, we must not do semantic | |
8583 | processing during substitution as we could create partial | |
8584 | instantiations. */ | |
8585 | incomplete = NUM_TMPL_ARGS (explicit_targs) != NUM_TMPL_ARGS (targs); | |
8586 | processing_template_decl += incomplete; | |
c2ea3a40 | 8587 | fntype = tsubst (fntype, converted_args, tf_none, NULL_TREE); |
ffd49b19 NS |
8588 | processing_template_decl -= incomplete; |
8589 | ||
4393e105 MM |
8590 | if (fntype == error_mark_node) |
8591 | return 1; | |
050367a3 | 8592 | |
4393e105 | 8593 | /* Place the explicitly specified arguments in TARGS. */ |
ffd49b19 | 8594 | for (i = NUM_TMPL_ARGS (converted_args); i--;) |
4393e105 | 8595 | TREE_VEC_ELT (targs, i) = TREE_VEC_ELT (converted_args, i); |
75650646 | 8596 | } |
4393e105 MM |
8597 | |
8598 | parms = TYPE_ARG_TYPES (fntype); | |
e5214479 JM |
8599 | /* Never do unification on the 'this' parameter. */ |
8600 | if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fn)) | |
8601 | parms = TREE_CHAIN (parms); | |
8d3631f8 NS |
8602 | |
8603 | if (return_type) | |
8604 | { | |
8605 | /* We've been given a return type to match, prepend it. */ | |
8606 | parms = tree_cons (NULL_TREE, TREE_TYPE (fntype), parms); | |
8607 | args = tree_cons (NULL_TREE, return_type, args); | |
16e42e7c JM |
8608 | if (len >= 0) |
8609 | ++len; | |
4393e105 MM |
8610 | } |
8611 | ||
4393e105 MM |
8612 | /* We allow incomplete unification without an error message here |
8613 | because the standard doesn't seem to explicitly prohibit it. Our | |
8614 | callers must be ready to deal with unification failures in any | |
8615 | event. */ | |
adecb3f4 MM |
8616 | result = type_unification_real (DECL_INNERMOST_TEMPLATE_PARMS (fn), |
8617 | targs, parms, args, /*subr=*/0, | |
e5214479 | 8618 | strict, /*allow_incomplete*/1, len); |
adecb3f4 MM |
8619 | |
8620 | if (result == 0) | |
8621 | /* All is well so far. Now, check: | |
8622 | ||
8623 | [temp.deduct] | |
8624 | ||
8625 | When all template arguments have been deduced, all uses of | |
8626 | template parameters in nondeduced contexts are replaced with | |
8627 | the corresponding deduced argument values. If the | |
8628 | substitution results in an invalid type, as described above, | |
8629 | type deduction fails. */ | |
c2ea3a40 | 8630 | if (tsubst (TREE_TYPE (fn), targs, tf_none, NULL_TREE) |
adecb3f4 MM |
8631 | == error_mark_node) |
8632 | return 1; | |
8633 | ||
8634 | return result; | |
830bfa74 MM |
8635 | } |
8636 | ||
8637 | /* Adjust types before performing type deduction, as described in | |
8638 | [temp.deduct.call] and [temp.deduct.conv]. The rules in these two | |
4c7d0dff MM |
8639 | sections are symmetric. PARM is the type of a function parameter |
8640 | or the return type of the conversion function. ARG is the type of | |
8641 | the argument passed to the call, or the type of the value | |
dc957d14 | 8642 | initialized with the result of the conversion function. */ |
386b8a85 | 8643 | |
62e4a758 | 8644 | static int |
3a978d72 NN |
8645 | maybe_adjust_types_for_deduction (unification_kind_t strict, |
8646 | tree* parm, | |
8647 | tree* arg) | |
830bfa74 | 8648 | { |
62e4a758 NS |
8649 | int result = 0; |
8650 | ||
830bfa74 MM |
8651 | switch (strict) |
8652 | { | |
8653 | case DEDUCE_CALL: | |
8654 | break; | |
8655 | ||
8656 | case DEDUCE_CONV: | |
8657 | { | |
4c7d0dff MM |
8658 | /* Swap PARM and ARG throughout the remainder of this |
8659 | function; the handling is precisely symmetric since PARM | |
8660 | will initialize ARG rather than vice versa. */ | |
830bfa74 MM |
8661 | tree* temp = parm; |
8662 | parm = arg; | |
8663 | arg = temp; | |
8664 | break; | |
8665 | } | |
8666 | ||
8667 | case DEDUCE_EXACT: | |
8668 | /* There is nothing to do in this case. */ | |
62e4a758 | 8669 | return 0; |
830bfa74 | 8670 | |
62e4a758 NS |
8671 | case DEDUCE_ORDER: |
8672 | /* DR 214. [temp.func.order] is underspecified, and leads to no | |
8673 | ordering between things like `T *' and `T const &' for `U *'. | |
8674 | The former has T=U and the latter T=U*. The former looks more | |
8675 | specialized and John Spicer considers it well-formed (the EDG | |
8676 | compiler accepts it). | |
8677 | ||
8678 | John also confirms that deduction should proceed as in a function | |
996065b4 | 8679 | call. Which implies the usual ARG and PARM conversions as DEDUCE_CALL. |
62e4a758 NS |
8680 | However, in ordering, ARG can have REFERENCE_TYPE, but no argument |
8681 | to an actual call can have such a type. | |
8682 | ||
996065b4 NS |
8683 | If both ARG and PARM are REFERENCE_TYPE, we change neither. |
8684 | If only ARG is a REFERENCE_TYPE, we look through that and then | |
8685 | proceed as with DEDUCE_CALL (which could further convert it). */ | |
62e4a758 NS |
8686 | if (TREE_CODE (*arg) == REFERENCE_TYPE) |
8687 | { | |
8688 | if (TREE_CODE (*parm) == REFERENCE_TYPE) | |
8689 | return 0; | |
8690 | *arg = TREE_TYPE (*arg); | |
62e4a758 NS |
8691 | } |
8692 | break; | |
830bfa74 | 8693 | default: |
a98facb0 | 8694 | abort (); |
830bfa74 MM |
8695 | } |
8696 | ||
8697 | if (TREE_CODE (*parm) != REFERENCE_TYPE) | |
8698 | { | |
8699 | /* [temp.deduct.call] | |
8700 | ||
8701 | If P is not a reference type: | |
8702 | ||
8703 | --If A is an array type, the pointer type produced by the | |
8704 | array-to-pointer standard conversion (_conv.array_) is | |
8705 | used in place of A for type deduction; otherwise, | |
8706 | ||
8707 | --If A is a function type, the pointer type produced by | |
8708 | the function-to-pointer standard conversion | |
8709 | (_conv.func_) is used in place of A for type deduction; | |
8710 | otherwise, | |
8711 | ||
8712 | --If A is a cv-qualified type, the top level | |
8713 | cv-qualifiers of A's type are ignored for type | |
8714 | deduction. */ | |
8715 | if (TREE_CODE (*arg) == ARRAY_TYPE) | |
8716 | *arg = build_pointer_type (TREE_TYPE (*arg)); | |
d8f8dca1 | 8717 | else if (TREE_CODE (*arg) == FUNCTION_TYPE) |
830bfa74 MM |
8718 | *arg = build_pointer_type (*arg); |
8719 | else | |
8720 | *arg = TYPE_MAIN_VARIANT (*arg); | |
8721 | } | |
8722 | ||
8723 | /* [temp.deduct.call] | |
8724 | ||
8725 | If P is a cv-qualified type, the top level cv-qualifiers | |
8726 | of P's type are ignored for type deduction. If P is a | |
8727 | reference type, the type referred to by P is used for | |
8728 | type deduction. */ | |
8729 | *parm = TYPE_MAIN_VARIANT (*parm); | |
8730 | if (TREE_CODE (*parm) == REFERENCE_TYPE) | |
62e4a758 NS |
8731 | { |
8732 | *parm = TREE_TYPE (*parm); | |
8733 | result |= UNIFY_ALLOW_OUTER_MORE_CV_QUAL; | |
8734 | } | |
1c82cc90 NS |
8735 | |
8736 | /* DR 322. For conversion deduction, remove a reference type on parm | |
8737 | too (which has been swapped into ARG). */ | |
8738 | if (strict == DEDUCE_CONV && TREE_CODE (*arg) == REFERENCE_TYPE) | |
8739 | *arg = TREE_TYPE (*arg); | |
8740 | ||
62e4a758 | 8741 | return result; |
386b8a85 JM |
8742 | } |
8743 | ||
e5214479 | 8744 | /* Most parms like fn_type_unification. |
9f54c803 MM |
8745 | |
8746 | If SUBR is 1, we're being called recursively (to unify the | |
8747 | arguments of a function or method parameter of a function | |
8748 | template). */ | |
386b8a85 | 8749 | |
4966381a | 8750 | static int |
3a978d72 NN |
8751 | type_unification_real (tree tparms, |
8752 | tree targs, | |
8753 | tree xparms, | |
8754 | tree xargs, | |
8755 | int subr, | |
8756 | unification_kind_t strict, | |
8757 | int allow_incomplete, | |
8758 | int xlen) | |
8d08fdba MS |
8759 | { |
8760 | tree parm, arg; | |
8761 | int i; | |
8762 | int ntparms = TREE_VEC_LENGTH (tparms); | |
830bfa74 | 8763 | int sub_strict; |
bd0d5d4a JM |
8764 | int saw_undeduced = 0; |
8765 | tree parms, args; | |
8766 | int len; | |
8d08fdba MS |
8767 | |
8768 | my_friendly_assert (TREE_CODE (tparms) == TREE_VEC, 289); | |
bd0d5d4a JM |
8769 | my_friendly_assert (xparms == NULL_TREE |
8770 | || TREE_CODE (xparms) == TREE_LIST, 290); | |
ee3071ef | 8771 | my_friendly_assert (!xargs || TREE_CODE (xargs) == TREE_LIST, 291); |
8d08fdba MS |
8772 | my_friendly_assert (ntparms > 0, 292); |
8773 | ||
830bfa74 MM |
8774 | switch (strict) |
8775 | { | |
8776 | case DEDUCE_CALL: | |
028d1f20 NS |
8777 | sub_strict = (UNIFY_ALLOW_OUTER_LEVEL | UNIFY_ALLOW_MORE_CV_QUAL |
8778 | | UNIFY_ALLOW_DERIVED); | |
830bfa74 MM |
8779 | break; |
8780 | ||
8781 | case DEDUCE_CONV: | |
8782 | sub_strict = UNIFY_ALLOW_LESS_CV_QUAL; | |
8783 | break; | |
8784 | ||
8785 | case DEDUCE_EXACT: | |
8786 | sub_strict = UNIFY_ALLOW_NONE; | |
8787 | break; | |
62e4a758 NS |
8788 | |
8789 | case DEDUCE_ORDER: | |
8790 | sub_strict = UNIFY_ALLOW_NONE; | |
8791 | break; | |
830bfa74 MM |
8792 | |
8793 | default: | |
a98facb0 | 8794 | abort (); |
830bfa74 MM |
8795 | } |
8796 | ||
bd0d5d4a | 8797 | if (xlen == 0) |
e5214479 JM |
8798 | return 0; |
8799 | ||
bd0d5d4a JM |
8800 | again: |
8801 | parms = xparms; | |
8802 | args = xargs; | |
8803 | len = xlen; | |
8804 | ||
8d08fdba MS |
8805 | while (parms |
8806 | && parms != void_list_node | |
8807 | && args | |
8808 | && args != void_list_node) | |
8809 | { | |
8810 | parm = TREE_VALUE (parms); | |
8811 | parms = TREE_CHAIN (parms); | |
8812 | arg = TREE_VALUE (args); | |
8813 | args = TREE_CHAIN (args); | |
8814 | ||
8815 | if (arg == error_mark_node) | |
8816 | return 1; | |
8817 | if (arg == unknown_type_node) | |
34016c81 JM |
8818 | /* We can't deduce anything from this, but we might get all the |
8819 | template args from other function args. */ | |
8820 | continue; | |
b7484fbe | 8821 | |
03e70705 JM |
8822 | /* Conversions will be performed on a function argument that |
8823 | corresponds with a function parameter that contains only | |
8824 | non-deducible template parameters and explicitly specified | |
8825 | template parameters. */ | |
8826 | if (! uses_template_parms (parm)) | |
b7484fbe | 8827 | { |
03e70705 JM |
8828 | tree type; |
8829 | ||
2f939d94 | 8830 | if (!TYPE_P (arg)) |
03e70705 JM |
8831 | type = TREE_TYPE (arg); |
8832 | else | |
8833 | { | |
8834 | type = arg; | |
8835 | arg = NULL_TREE; | |
8836 | } | |
8837 | ||
62e4a758 | 8838 | if (strict == DEDUCE_EXACT || strict == DEDUCE_ORDER) |
03e70705 | 8839 | { |
3bfdc719 | 8840 | if (same_type_p (parm, type)) |
03e70705 JM |
8841 | continue; |
8842 | } | |
03e70705 | 8843 | else |
343c89cd JM |
8844 | /* It might work; we shouldn't check now, because we might |
8845 | get into infinite recursion. Overload resolution will | |
8846 | handle it. */ | |
8847 | continue; | |
03e70705 | 8848 | |
b7484fbe MS |
8849 | return 1; |
8850 | } | |
8851 | ||
2f939d94 | 8852 | if (!TYPE_P (arg)) |
8d08fdba MS |
8853 | { |
8854 | my_friendly_assert (TREE_TYPE (arg) != NULL_TREE, 293); | |
34016c81 | 8855 | if (type_unknown_p (arg)) |
28cbf42c | 8856 | { |
34016c81 JM |
8857 | /* [temp.deduct.type] A template-argument can be deduced from |
8858 | a pointer to function or pointer to member function | |
8859 | argument if the set of overloaded functions does not | |
8860 | contain function templates and at most one of a set of | |
8861 | overloaded functions provides a unique match. */ | |
8862 | ||
8863 | if (resolve_overloaded_unification | |
4393e105 | 8864 | (tparms, targs, parm, arg, strict, sub_strict) |
34016c81 JM |
8865 | != 0) |
8866 | return 1; | |
8867 | continue; | |
28cbf42c | 8868 | } |
8d08fdba | 8869 | arg = TREE_TYPE (arg); |
08476342 NS |
8870 | if (arg == error_mark_node) |
8871 | return 1; | |
8d08fdba | 8872 | } |
62e4a758 NS |
8873 | |
8874 | { | |
8875 | int arg_strict = sub_strict; | |
8876 | ||
8877 | if (!subr) | |
8878 | arg_strict |= maybe_adjust_types_for_deduction (strict, &parm, &arg); | |
4393e105 | 8879 | |
62e4a758 NS |
8880 | if (unify (tparms, targs, parm, arg, arg_strict)) |
8881 | return 1; | |
8882 | } | |
e5214479 JM |
8883 | |
8884 | /* Are we done with the interesting parms? */ | |
8885 | if (--len == 0) | |
bd0d5d4a | 8886 | goto done; |
8d08fdba MS |
8887 | } |
8888 | /* Fail if we've reached the end of the parm list, and more args | |
8889 | are present, and the parm list isn't variadic. */ | |
8890 | if (args && args != void_list_node && parms == void_list_node) | |
8891 | return 1; | |
8892 | /* Fail if parms are left and they don't have default values. */ | |
8893 | if (parms | |
8894 | && parms != void_list_node | |
8895 | && TREE_PURPOSE (parms) == NULL_TREE) | |
8896 | return 1; | |
bd0d5d4a JM |
8897 | |
8898 | done: | |
8d08fdba MS |
8899 | if (!subr) |
8900 | for (i = 0; i < ntparms; i++) | |
050367a3 | 8901 | if (TREE_VEC_ELT (targs, i) == NULL_TREE) |
8d08fdba | 8902 | { |
bd0d5d4a JM |
8903 | tree tparm = TREE_VALUE (TREE_VEC_ELT (tparms, i)); |
8904 | ||
8905 | /* If this is an undeduced nontype parameter that depends on | |
8906 | a type parameter, try another pass; its type may have been | |
8907 | deduced from a later argument than the one from which | |
8908 | this parameter can be deduced. */ | |
8909 | if (TREE_CODE (tparm) == PARM_DECL | |
8910 | && uses_template_parms (TREE_TYPE (tparm)) | |
8911 | && !saw_undeduced++) | |
8912 | goto again; | |
8913 | ||
386b8a85 | 8914 | if (!allow_incomplete) |
8251199e | 8915 | error ("incomplete type unification"); |
8d08fdba MS |
8916 | return 2; |
8917 | } | |
8918 | return 0; | |
8919 | } | |
8920 | ||
34016c81 JM |
8921 | /* Subroutine of type_unification_real. Args are like the variables at the |
8922 | call site. ARG is an overloaded function (or template-id); we try | |
8923 | deducing template args from each of the overloads, and if only one | |
8924 | succeeds, we go with that. Modifies TARGS and returns 0 on success. */ | |
8925 | ||
8926 | static int | |
3a978d72 NN |
8927 | resolve_overloaded_unification (tree tparms, |
8928 | tree targs, | |
8929 | tree parm, | |
8930 | tree arg, | |
8931 | unification_kind_t strict, | |
8932 | int sub_strict) | |
34016c81 JM |
8933 | { |
8934 | tree tempargs = copy_node (targs); | |
8935 | int good = 0; | |
f23fb7f5 | 8936 | bool addr_p; |
34016c81 JM |
8937 | |
8938 | if (TREE_CODE (arg) == ADDR_EXPR) | |
f23fb7f5 MM |
8939 | { |
8940 | arg = TREE_OPERAND (arg, 0); | |
8941 | addr_p = true; | |
8942 | } | |
8943 | else | |
8944 | addr_p = false; | |
9f3d9e46 | 8945 | |
d8f8dca1 MM |
8946 | if (TREE_CODE (arg) == COMPONENT_REF) |
8947 | /* Handle `&x' where `x' is some static or non-static member | |
8948 | function name. */ | |
8949 | arg = TREE_OPERAND (arg, 1); | |
8950 | ||
05e0b2f4 JM |
8951 | if (TREE_CODE (arg) == OFFSET_REF) |
8952 | arg = TREE_OPERAND (arg, 1); | |
8953 | ||
9f3d9e46 | 8954 | /* Strip baselink information. */ |
50ad9642 MM |
8955 | if (BASELINK_P (arg)) |
8956 | arg = BASELINK_FUNCTIONS (arg); | |
9f3d9e46 | 8957 | |
34016c81 JM |
8958 | if (TREE_CODE (arg) == TEMPLATE_ID_EXPR) |
8959 | { | |
8960 | /* If we got some explicit template args, we need to plug them into | |
8961 | the affected templates before we try to unify, in case the | |
8962 | explicit args will completely resolve the templates in question. */ | |
8963 | ||
8964 | tree expl_subargs = TREE_OPERAND (arg, 1); | |
8965 | arg = TREE_OPERAND (arg, 0); | |
8966 | ||
8967 | for (; arg; arg = OVL_NEXT (arg)) | |
8968 | { | |
8969 | tree fn = OVL_CURRENT (arg); | |
8970 | tree subargs, elem; | |
8971 | ||
8972 | if (TREE_CODE (fn) != TEMPLATE_DECL) | |
8973 | continue; | |
8974 | ||
17aec3eb RK |
8975 | subargs = get_bindings_overload (fn, DECL_TEMPLATE_RESULT (fn), |
8976 | expl_subargs); | |
34016c81 JM |
8977 | if (subargs) |
8978 | { | |
c2ea3a40 | 8979 | elem = tsubst (TREE_TYPE (fn), subargs, tf_none, NULL_TREE); |
f23fb7f5 MM |
8980 | good += try_one_overload (tparms, targs, tempargs, parm, |
8981 | elem, strict, sub_strict, addr_p); | |
34016c81 JM |
8982 | } |
8983 | } | |
8984 | } | |
db0f613d KL |
8985 | else if (TREE_CODE (arg) == OVERLOAD |
8986 | || TREE_CODE (arg) == FUNCTION_DECL) | |
34016c81 JM |
8987 | { |
8988 | for (; arg; arg = OVL_NEXT (arg)) | |
f23fb7f5 MM |
8989 | good += try_one_overload (tparms, targs, tempargs, parm, |
8990 | TREE_TYPE (OVL_CURRENT (arg)), | |
8991 | strict, sub_strict, addr_p); | |
34016c81 JM |
8992 | } |
8993 | else | |
a98facb0 | 8994 | abort (); |
34016c81 JM |
8995 | |
8996 | /* [temp.deduct.type] A template-argument can be deduced from a pointer | |
8997 | to function or pointer to member function argument if the set of | |
8998 | overloaded functions does not contain function templates and at most | |
8999 | one of a set of overloaded functions provides a unique match. | |
9000 | ||
9001 | So if we found multiple possibilities, we return success but don't | |
9002 | deduce anything. */ | |
9003 | ||
9004 | if (good == 1) | |
9005 | { | |
9006 | int i = TREE_VEC_LENGTH (targs); | |
9007 | for (; i--; ) | |
9008 | if (TREE_VEC_ELT (tempargs, i)) | |
9009 | TREE_VEC_ELT (targs, i) = TREE_VEC_ELT (tempargs, i); | |
9010 | } | |
9011 | if (good) | |
9012 | return 0; | |
9013 | ||
9014 | return 1; | |
9015 | } | |
9016 | ||
9017 | /* Subroutine of resolve_overloaded_unification; does deduction for a single | |
9018 | overload. Fills TARGS with any deduced arguments, or error_mark_node if | |
9019 | different overloads deduce different arguments for a given parm. | |
f23fb7f5 MM |
9020 | ADDR_P is true if the expression for which deduction is being |
9021 | performed was of the form "& fn" rather than simply "fn". | |
9022 | ||
34016c81 JM |
9023 | Returns 1 on success. */ |
9024 | ||
9025 | static int | |
3a978d72 NN |
9026 | try_one_overload (tree tparms, |
9027 | tree orig_targs, | |
9028 | tree targs, | |
9029 | tree parm, | |
9030 | tree arg, | |
9031 | unification_kind_t strict, | |
f23fb7f5 MM |
9032 | int sub_strict, |
9033 | bool addr_p) | |
34016c81 JM |
9034 | { |
9035 | int nargs; | |
9036 | tree tempargs; | |
9037 | int i; | |
9038 | ||
9039 | /* [temp.deduct.type] A template-argument can be deduced from a pointer | |
9040 | to function or pointer to member function argument if the set of | |
9041 | overloaded functions does not contain function templates and at most | |
9042 | one of a set of overloaded functions provides a unique match. | |
9043 | ||
9044 | So if this is a template, just return success. */ | |
9045 | ||
9046 | if (uses_template_parms (arg)) | |
9047 | return 1; | |
9048 | ||
f23fb7f5 MM |
9049 | if (TREE_CODE (arg) == METHOD_TYPE) |
9050 | arg = build_ptrmemfunc_type (build_pointer_type (arg)); | |
9051 | else if (addr_p) | |
9052 | arg = build_pointer_type (arg); | |
9053 | ||
62e4a758 | 9054 | sub_strict |= maybe_adjust_types_for_deduction (strict, &parm, &arg); |
34016c81 JM |
9055 | |
9056 | /* We don't copy orig_targs for this because if we have already deduced | |
9057 | some template args from previous args, unify would complain when we | |
9058 | try to deduce a template parameter for the same argument, even though | |
9059 | there isn't really a conflict. */ | |
9060 | nargs = TREE_VEC_LENGTH (targs); | |
f31c0a32 | 9061 | tempargs = make_tree_vec (nargs); |
34016c81 | 9062 | |
4393e105 | 9063 | if (unify (tparms, tempargs, parm, arg, sub_strict) != 0) |
34016c81 JM |
9064 | return 0; |
9065 | ||
9066 | /* First make sure we didn't deduce anything that conflicts with | |
e97e5263 | 9067 | explicitly specified args. */ |
34016c81 JM |
9068 | for (i = nargs; i--; ) |
9069 | { | |
9070 | tree elt = TREE_VEC_ELT (tempargs, i); | |
e97e5263 | 9071 | tree oldelt = TREE_VEC_ELT (orig_targs, i); |
34016c81 JM |
9072 | |
9073 | if (elt == NULL_TREE) | |
9074 | continue; | |
9075 | else if (uses_template_parms (elt)) | |
9076 | { | |
9077 | /* Since we're unifying against ourselves, we will fill in template | |
9078 | args used in the function parm list with our own template parms. | |
9079 | Discard them. */ | |
9080 | TREE_VEC_ELT (tempargs, i) = NULL_TREE; | |
9081 | continue; | |
9082 | } | |
9083 | else if (oldelt && ! template_args_equal (oldelt, elt)) | |
9084 | return 0; | |
9085 | } | |
9086 | ||
9087 | for (i = nargs; i--; ) | |
9088 | { | |
9089 | tree elt = TREE_VEC_ELT (tempargs, i); | |
9090 | ||
9091 | if (elt) | |
9092 | TREE_VEC_ELT (targs, i) = elt; | |
9093 | } | |
9094 | ||
9095 | return 1; | |
9096 | } | |
9097 | ||
74601d7c KL |
9098 | /* Verify that nondeduce template argument agrees with the type |
9099 | obtained from argument deduction. Return nonzero if the | |
9100 | verification fails. | |
9101 | ||
9102 | For example: | |
9103 | ||
9104 | struct A { typedef int X; }; | |
9105 | template <class T, class U> struct C {}; | |
9106 | template <class T> struct C<T, typename T::X> {}; | |
9107 | ||
9108 | Then with the instantiation `C<A, int>', we can deduce that | |
9109 | `T' is `A' but unify () does not check whether `typename T::X' | |
9110 | is `int'. This function ensure that they agree. | |
9111 | ||
9112 | TARGS, PARMS are the same as the arguments of unify. | |
9113 | ARGS contains template arguments from all levels. */ | |
9114 | ||
9115 | static int | |
3a978d72 | 9116 | verify_class_unification (tree targs, tree parms, tree args) |
74601d7c | 9117 | { |
e2005c8d KL |
9118 | parms = tsubst (parms, add_outermost_template_args (args, targs), |
9119 | tf_none, NULL_TREE); | |
9120 | if (parms == error_mark_node) | |
74601d7c KL |
9121 | return 1; |
9122 | ||
e2005c8d | 9123 | return !comp_template_args (parms, INNERMOST_TEMPLATE_ARGS (args)); |
74601d7c KL |
9124 | } |
9125 | ||
4393e105 MM |
9126 | /* PARM is a template class (perhaps with unbound template |
9127 | parameters). ARG is a fully instantiated type. If ARG can be | |
9128 | bound to PARM, return ARG, otherwise return NULL_TREE. TPARMS and | |
9129 | TARGS are as for unify. */ | |
fcfb9f96 MM |
9130 | |
9131 | static tree | |
3a978d72 | 9132 | try_class_unification (tree tparms, tree targs, tree parm, tree arg) |
4393e105 | 9133 | { |
4393e105 MM |
9134 | tree copy_of_targs; |
9135 | ||
9136 | if (!CLASSTYPE_TEMPLATE_INFO (arg) | |
68361a03 MM |
9137 | || (most_general_template (CLASSTYPE_TI_TEMPLATE (arg)) |
9138 | != most_general_template (CLASSTYPE_TI_TEMPLATE (parm)))) | |
4393e105 MM |
9139 | return NULL_TREE; |
9140 | ||
9141 | /* We need to make a new template argument vector for the call to | |
9142 | unify. If we used TARGS, we'd clutter it up with the result of | |
9143 | the attempted unification, even if this class didn't work out. | |
9144 | We also don't want to commit ourselves to all the unifications | |
9145 | we've already done, since unification is supposed to be done on | |
9146 | an argument-by-argument basis. In other words, consider the | |
9147 | following pathological case: | |
9148 | ||
9149 | template <int I, int J, int K> | |
9150 | struct S {}; | |
9151 | ||
9152 | template <int I, int J> | |
9153 | struct S<I, J, 2> : public S<I, I, I>, S<J, J, J> {}; | |
9154 | ||
9155 | template <int I, int J, int K> | |
9156 | void f(S<I, J, K>, S<I, I, I>); | |
9157 | ||
9158 | void g() { | |
9159 | S<0, 0, 0> s0; | |
9160 | S<0, 1, 2> s2; | |
9161 | ||
9162 | f(s0, s2); | |
9163 | } | |
9164 | ||
9165 | Now, by the time we consider the unification involving `s2', we | |
9166 | already know that we must have `f<0, 0, 0>'. But, even though | |
0e339752 | 9167 | `S<0, 1, 2>' is derived from `S<0, 0, 0>', the code is invalid |
4393e105 MM |
9168 | because there are two ways to unify base classes of S<0, 1, 2> |
9169 | with S<I, I, I>. If we kept the already deduced knowledge, we | |
9170 | would reject the possibility I=1. */ | |
f31c0a32 | 9171 | copy_of_targs = make_tree_vec (TREE_VEC_LENGTH (targs)); |
4393e105 MM |
9172 | |
9173 | /* If unification failed, we're done. */ | |
74601d7c KL |
9174 | if (unify (tparms, copy_of_targs, CLASSTYPE_TI_ARGS (parm), |
9175 | CLASSTYPE_TI_ARGS (arg), UNIFY_ALLOW_NONE)) | |
4393e105 | 9176 | return NULL_TREE; |
74601d7c KL |
9177 | |
9178 | return arg; | |
4393e105 MM |
9179 | } |
9180 | ||
9181 | /* Subroutine of get_template_base. RVAL, if non-NULL, is a base we | |
dc957d14 | 9182 | have already discovered to be satisfactory. ARG_BINFO is the binfo |
4393e105 MM |
9183 | for the base class of ARG that we are currently examining. */ |
9184 | ||
9185 | static tree | |
3a978d72 NN |
9186 | get_template_base_recursive (tree tparms, |
9187 | tree targs, | |
9188 | tree parm, | |
9189 | tree arg_binfo, | |
9190 | tree rval, | |
9191 | int flags) | |
fcfb9f96 MM |
9192 | { |
9193 | tree binfos; | |
9194 | int i, n_baselinks; | |
4393e105 | 9195 | tree arg = BINFO_TYPE (arg_binfo); |
fcfb9f96 | 9196 | |
4393e105 | 9197 | if (!(flags & GTB_IGNORE_TYPE)) |
fcfb9f96 | 9198 | { |
4393e105 MM |
9199 | tree r = try_class_unification (tparms, targs, |
9200 | parm, arg); | |
fcfb9f96 | 9201 | |
4393e105 | 9202 | /* If there is more than one satisfactory baseclass, then: |
fcfb9f96 | 9203 | |
4393e105 MM |
9204 | [temp.deduct.call] |
9205 | ||
9206 | If they yield more than one possible deduced A, the type | |
9207 | deduction fails. | |
9208 | ||
9209 | applies. */ | |
9210 | if (r && rval && !same_type_p (r, rval)) | |
9211 | return error_mark_node; | |
9212 | else if (r) | |
9213 | rval = r; | |
fcfb9f96 MM |
9214 | } |
9215 | ||
4393e105 | 9216 | binfos = BINFO_BASETYPES (arg_binfo); |
fcfb9f96 MM |
9217 | n_baselinks = binfos ? TREE_VEC_LENGTH (binfos) : 0; |
9218 | ||
9219 | /* Process base types. */ | |
9220 | for (i = 0; i < n_baselinks; i++) | |
9221 | { | |
9222 | tree base_binfo = TREE_VEC_ELT (binfos, i); | |
4393e105 | 9223 | int this_virtual; |
fcfb9f96 | 9224 | |
4393e105 MM |
9225 | /* Skip this base, if we've already seen it. */ |
9226 | if (BINFO_MARKED (base_binfo)) | |
9227 | continue; | |
9228 | ||
9229 | this_virtual = | |
9230 | (flags & GTB_VIA_VIRTUAL) || TREE_VIA_VIRTUAL (base_binfo); | |
9231 | ||
9232 | /* When searching for a non-virtual, we cannot mark virtually | |
9233 | found binfos. */ | |
9234 | if (! this_virtual) | |
dbbf88d1 | 9235 | BINFO_MARKED (base_binfo) = 1; |
4393e105 MM |
9236 | |
9237 | rval = get_template_base_recursive (tparms, targs, | |
9238 | parm, | |
9239 | base_binfo, | |
9240 | rval, | |
9241 | GTB_VIA_VIRTUAL * this_virtual); | |
9242 | ||
9243 | /* If we discovered more than one matching base class, we can | |
9244 | stop now. */ | |
9245 | if (rval == error_mark_node) | |
9246 | return error_mark_node; | |
fcfb9f96 MM |
9247 | } |
9248 | ||
9249 | return rval; | |
9250 | } | |
9251 | ||
4393e105 MM |
9252 | /* Given a template type PARM and a class type ARG, find the unique |
9253 | base type in ARG that is an instance of PARM. We do not examine | |
9254 | ARG itself; only its base-classes. If there is no appropriate base | |
9255 | class, return NULL_TREE. If there is more than one, return | |
9256 | error_mark_node. PARM may be the type of a partial specialization, | |
9257 | as well as a plain template type. Used by unify. */ | |
fcfb9f96 MM |
9258 | |
9259 | static tree | |
3a978d72 | 9260 | get_template_base (tree tparms, tree targs, tree parm, tree arg) |
fcfb9f96 | 9261 | { |
4393e105 MM |
9262 | tree rval; |
9263 | tree arg_binfo; | |
fcfb9f96 | 9264 | |
4393e105 MM |
9265 | my_friendly_assert (IS_AGGR_TYPE_CODE (TREE_CODE (arg)), 92); |
9266 | ||
9267 | arg_binfo = TYPE_BINFO (complete_type (arg)); | |
9268 | rval = get_template_base_recursive (tparms, targs, | |
9269 | parm, arg_binfo, | |
9270 | NULL_TREE, | |
9271 | GTB_IGNORE_TYPE); | |
fcfb9f96 | 9272 | |
4393e105 MM |
9273 | /* Since get_template_base_recursive marks the bases classes, we |
9274 | must unmark them here. */ | |
d6479fe7 | 9275 | dfs_walk (arg_binfo, dfs_unmark, markedp, 0); |
fcfb9f96 MM |
9276 | |
9277 | return rval; | |
9278 | } | |
9279 | ||
db2767b6 MM |
9280 | /* Returns the level of DECL, which declares a template parameter. */ |
9281 | ||
e9659ab0 | 9282 | static int |
3a978d72 | 9283 | template_decl_level (tree decl) |
db2767b6 MM |
9284 | { |
9285 | switch (TREE_CODE (decl)) | |
9286 | { | |
9287 | case TYPE_DECL: | |
9288 | case TEMPLATE_DECL: | |
9289 | return TEMPLATE_TYPE_LEVEL (TREE_TYPE (decl)); | |
9290 | ||
9291 | case PARM_DECL: | |
9292 | return TEMPLATE_PARM_LEVEL (DECL_INITIAL (decl)); | |
9293 | ||
9294 | default: | |
a98facb0 | 9295 | abort (); |
5ffe581d | 9296 | return 0; |
db2767b6 MM |
9297 | } |
9298 | } | |
9299 | ||
830bfa74 MM |
9300 | /* Decide whether ARG can be unified with PARM, considering only the |
9301 | cv-qualifiers of each type, given STRICT as documented for unify. | |
838dfd8a | 9302 | Returns nonzero iff the unification is OK on that basis.*/ |
e92cc029 | 9303 | |
e9659ab0 | 9304 | static int |
3a978d72 | 9305 | check_cv_quals_for_unify (int strict, tree arg, tree parm) |
830bfa74 | 9306 | { |
4f2b0fb2 NS |
9307 | int arg_quals = cp_type_quals (arg); |
9308 | int parm_quals = cp_type_quals (parm); | |
9309 | ||
9310 | if (TREE_CODE (parm) == TEMPLATE_TYPE_PARM) | |
9311 | { | |
9312 | /* If the cvr quals of parm will not unify with ARG, they'll be | |
9313 | ignored in instantiation, so we have to do the same here. */ | |
171d2f50 | 9314 | if (TREE_CODE (arg) == REFERENCE_TYPE) |
4f2b0fb2 NS |
9315 | parm_quals &= ~(TYPE_QUAL_CONST | TYPE_QUAL_VOLATILE); |
9316 | if (!POINTER_TYPE_P (arg) && | |
9317 | TREE_CODE (arg) != TEMPLATE_TYPE_PARM) | |
9318 | parm_quals &= ~TYPE_QUAL_RESTRICT; | |
9319 | } | |
9320 | ||
62e4a758 | 9321 | if (!(strict & (UNIFY_ALLOW_MORE_CV_QUAL | UNIFY_ALLOW_OUTER_MORE_CV_QUAL)) |
4f2b0fb2 | 9322 | && (arg_quals & parm_quals) != parm_quals) |
ef637255 MM |
9323 | return 0; |
9324 | ||
62e4a758 | 9325 | if (!(strict & (UNIFY_ALLOW_LESS_CV_QUAL | UNIFY_ALLOW_OUTER_LESS_CV_QUAL)) |
4f2b0fb2 | 9326 | && (parm_quals & arg_quals) != arg_quals) |
ef637255 MM |
9327 | return 0; |
9328 | ||
ef637255 | 9329 | return 1; |
830bfa74 MM |
9330 | } |
9331 | ||
9332 | /* Takes parameters as for type_unification. Returns 0 if the | |
dc957d14 | 9333 | type deduction succeeds, 1 otherwise. The parameter STRICT is a |
830bfa74 MM |
9334 | bitwise or of the following flags: |
9335 | ||
9336 | UNIFY_ALLOW_NONE: | |
9337 | Require an exact match between PARM and ARG. | |
9338 | UNIFY_ALLOW_MORE_CV_QUAL: | |
028d1f20 NS |
9339 | Allow the deduced ARG to be more cv-qualified (by qualification |
9340 | conversion) than ARG. | |
830bfa74 MM |
9341 | UNIFY_ALLOW_LESS_CV_QUAL: |
9342 | Allow the deduced ARG to be less cv-qualified than ARG. | |
9343 | UNIFY_ALLOW_DERIVED: | |
9344 | Allow the deduced ARG to be a template base class of ARG, | |
9345 | or a pointer to a template base class of the type pointed to by | |
161c12b0 JM |
9346 | ARG. |
9347 | UNIFY_ALLOW_INTEGER: | |
9348 | Allow any integral type to be deduced. See the TEMPLATE_PARM_INDEX | |
028d1f20 NS |
9349 | case for more information. |
9350 | UNIFY_ALLOW_OUTER_LEVEL: | |
9351 | This is the outermost level of a deduction. Used to determine validity | |
9352 | of qualification conversions. A valid qualification conversion must | |
9353 | have const qualified pointers leading up to the inner type which | |
9354 | requires additional CV quals, except at the outer level, where const | |
9355 | is not required [conv.qual]. It would be normal to set this flag in | |
62e4a758 NS |
9356 | addition to setting UNIFY_ALLOW_MORE_CV_QUAL. |
9357 | UNIFY_ALLOW_OUTER_MORE_CV_QUAL: | |
9358 | This is the outermost level of a deduction, and PARM can be more CV | |
9359 | qualified at this point. | |
9360 | UNIFY_ALLOW_OUTER_LESS_CV_QUAL: | |
9361 | This is the outermost level of a deduction, and PARM can be less CV | |
d9f818d9 RS |
9362 | qualified at this point. |
9363 | UNIFY_ALLOW_MAX_CORRECTION: | |
9364 | This is an INTEGER_TYPE's maximum value. Used if the range may | |
9365 | have been derived from a size specification, such as an array size. | |
9366 | If the size was given by a nontype template parameter N, the maximum | |
9367 | value will have the form N-1. The flag says that we can (and indeed | |
9368 | must) unify N with (ARG + 1), an exception to the normal rules on | |
9369 | folding PARM. */ | |
830bfa74 | 9370 | |
e9659ab0 | 9371 | static int |
3a978d72 | 9372 | unify (tree tparms, tree targs, tree parm, tree arg, int strict) |
8d08fdba MS |
9373 | { |
9374 | int idx; | |
050367a3 | 9375 | tree targ; |
db2767b6 | 9376 | tree tparm; |
028d1f20 | 9377 | int strict_in = strict; |
8d08fdba MS |
9378 | |
9379 | /* I don't think this will do the right thing with respect to types. | |
9380 | But the only case I've seen it in so far has been array bounds, where | |
9381 | signedness is the only information lost, and I think that will be | |
9382 | okay. */ | |
9383 | while (TREE_CODE (parm) == NOP_EXPR) | |
9384 | parm = TREE_OPERAND (parm, 0); | |
9385 | ||
9386 | if (arg == error_mark_node) | |
9387 | return 1; | |
9388 | if (arg == unknown_type_node) | |
34016c81 JM |
9389 | /* We can't deduce anything from this, but we might get all the |
9390 | template args from other function args. */ | |
9391 | return 0; | |
9392 | ||
db2767b6 | 9393 | /* If PARM uses template parameters, then we can't bail out here, |
6bdb985f | 9394 | even if ARG == PARM, since we won't record unifications for the |
db2767b6 MM |
9395 | template parameters. We might need them if we're trying to |
9396 | figure out which of two things is more specialized. */ | |
9397 | if (arg == parm && !uses_template_parms (parm)) | |
8d08fdba MS |
9398 | return 0; |
9399 | ||
830bfa74 MM |
9400 | /* Immediately reject some pairs that won't unify because of |
9401 | cv-qualification mismatches. */ | |
9402 | if (TREE_CODE (arg) == TREE_CODE (parm) | |
2f939d94 | 9403 | && TYPE_P (arg) |
d0ab7624 NS |
9404 | /* It is the elements of the array which hold the cv quals of an array |
9405 | type, and the elements might be template type parms. We'll check | |
9406 | when we recurse. */ | |
9407 | && TREE_CODE (arg) != ARRAY_TYPE | |
830bfa74 MM |
9408 | /* We check the cv-qualifiers when unifying with template type |
9409 | parameters below. We want to allow ARG `const T' to unify with | |
9410 | PARM `T' for example, when computing which of two templates | |
9411 | is more specialized, for example. */ | |
9412 | && TREE_CODE (arg) != TEMPLATE_TYPE_PARM | |
028d1f20 | 9413 | && !check_cv_quals_for_unify (strict_in, arg, parm)) |
49432171 JM |
9414 | return 1; |
9415 | ||
028d1f20 | 9416 | if (!(strict & UNIFY_ALLOW_OUTER_LEVEL) |
3ea099f1 | 9417 | && TYPE_P (parm) && !CP_TYPE_CONST_P (parm)) |
028d1f20 NS |
9418 | strict &= ~UNIFY_ALLOW_MORE_CV_QUAL; |
9419 | strict &= ~UNIFY_ALLOW_OUTER_LEVEL; | |
9420 | strict &= ~UNIFY_ALLOW_DERIVED; | |
62e4a758 NS |
9421 | strict &= ~UNIFY_ALLOW_OUTER_MORE_CV_QUAL; |
9422 | strict &= ~UNIFY_ALLOW_OUTER_LESS_CV_QUAL; | |
d9f818d9 | 9423 | strict &= ~UNIFY_ALLOW_MAX_CORRECTION; |
028d1f20 | 9424 | |
8d08fdba MS |
9425 | switch (TREE_CODE (parm)) |
9426 | { | |
2ca340ae | 9427 | case TYPENAME_TYPE: |
fccef71e | 9428 | case SCOPE_REF: |
b8c6534b | 9429 | case UNBOUND_CLASS_TEMPLATE: |
2ca340ae JM |
9430 | /* In a type which contains a nested-name-specifier, template |
9431 | argument values cannot be deduced for template parameters used | |
9432 | within the nested-name-specifier. */ | |
9433 | return 0; | |
9434 | ||
8d08fdba | 9435 | case TEMPLATE_TYPE_PARM: |
73b0fce8 | 9436 | case TEMPLATE_TEMPLATE_PARM: |
a1281f45 | 9437 | case BOUND_TEMPLATE_TEMPLATE_PARM: |
db2767b6 MM |
9438 | tparm = TREE_VALUE (TREE_VEC_ELT (tparms, 0)); |
9439 | ||
9440 | if (TEMPLATE_TYPE_LEVEL (parm) | |
9441 | != template_decl_level (tparm)) | |
9442 | /* The PARM is not one we're trying to unify. Just check | |
9443 | to see if it matches ARG. */ | |
9444 | return (TREE_CODE (arg) == TREE_CODE (parm) | |
3bfdc719 | 9445 | && same_type_p (parm, arg)) ? 0 : 1; |
73b0fce8 | 9446 | idx = TEMPLATE_TYPE_IDX (parm); |
050367a3 | 9447 | targ = TREE_VEC_ELT (targs, idx); |
db2767b6 | 9448 | tparm = TREE_VALUE (TREE_VEC_ELT (tparms, idx)); |
050367a3 | 9449 | |
73b0fce8 | 9450 | /* Check for mixed types and values. */ |
db2767b6 MM |
9451 | if ((TREE_CODE (parm) == TEMPLATE_TYPE_PARM |
9452 | && TREE_CODE (tparm) != TYPE_DECL) | |
9453 | || (TREE_CODE (parm) == TEMPLATE_TEMPLATE_PARM | |
9454 | && TREE_CODE (tparm) != TEMPLATE_DECL)) | |
73b0fce8 KL |
9455 | return 1; |
9456 | ||
a1281f45 | 9457 | if (TREE_CODE (parm) == BOUND_TEMPLATE_TEMPLATE_PARM) |
73b0fce8 | 9458 | { |
b429fdf0 KL |
9459 | /* ARG must be constructed from a template class or a template |
9460 | template parameter. */ | |
9461 | if (TREE_CODE (arg) != BOUND_TEMPLATE_TEMPLATE_PARM | |
9462 | && (TREE_CODE (arg) != RECORD_TYPE || !CLASSTYPE_TEMPLATE_INFO (arg))) | |
a1281f45 | 9463 | return 1; |
73b0fce8 | 9464 | |
a1281f45 KL |
9465 | { |
9466 | tree parmtmpl = TYPE_TI_TEMPLATE (parm); | |
9467 | tree parmvec = TYPE_TI_ARGS (parm); | |
b429fdf0 | 9468 | tree argvec = TYPE_TI_ARGS (arg); |
a1281f45 | 9469 | tree argtmplvec |
b429fdf0 | 9470 | = DECL_INNERMOST_TEMPLATE_PARMS (TYPE_TI_TEMPLATE (arg)); |
a1281f45 | 9471 | int i; |
73b0fce8 | 9472 | |
a1281f45 KL |
9473 | /* The parameter and argument roles have to be switched here |
9474 | in order to handle default arguments properly. For example, | |
9475 | template<template <class> class TT> void f(TT<int>) | |
9476 | should be able to accept vector<int> which comes from | |
9477 | template <class T, class Allocator = allocator> | |
9478 | class vector. */ | |
9479 | ||
ee3071ef NS |
9480 | if (coerce_template_parms (argtmplvec, parmvec, parmtmpl, 0, 1) |
9481 | == error_mark_node) | |
a1281f45 | 9482 | return 1; |
73b0fce8 | 9483 | |
a1281f45 KL |
9484 | /* Deduce arguments T, i from TT<T> or TT<i>. |
9485 | We check each element of PARMVEC and ARGVEC individually | |
9486 | rather than the whole TREE_VEC since they can have | |
9487 | different number of elements. */ | |
6b9b6b15 | 9488 | |
a1281f45 KL |
9489 | for (i = 0; i < TREE_VEC_LENGTH (parmvec); ++i) |
9490 | { | |
9491 | tree t = TREE_VEC_ELT (parmvec, i); | |
73b0fce8 | 9492 | |
a1281f45 KL |
9493 | if (unify (tparms, targs, t, |
9494 | TREE_VEC_ELT (argvec, i), | |
9495 | UNIFY_ALLOW_NONE)) | |
9496 | return 1; | |
73b0fce8 | 9497 | } |
a1281f45 | 9498 | } |
b429fdf0 | 9499 | arg = TYPE_TI_TEMPLATE (arg); |
a1281f45 KL |
9500 | |
9501 | /* Fall through to deduce template name. */ | |
9502 | } | |
9503 | ||
9504 | if (TREE_CODE (parm) == TEMPLATE_TEMPLATE_PARM | |
9505 | || TREE_CODE (parm) == BOUND_TEMPLATE_TEMPLATE_PARM) | |
9506 | { | |
9507 | /* Deduce template name TT from TT, TT<>, TT<T> and TT<i>. */ | |
9508 | ||
9509 | /* Simple cases: Value already set, does match or doesn't. */ | |
9510 | if (targ != NULL_TREE && template_args_equal (targ, arg)) | |
9511 | return 0; | |
9512 | else if (targ) | |
9513 | return 1; | |
db2767b6 MM |
9514 | } |
9515 | else | |
9516 | { | |
830bfa74 MM |
9517 | /* If PARM is `const T' and ARG is only `int', we don't have |
9518 | a match unless we are allowing additional qualification. | |
9519 | If ARG is `const int' and PARM is just `T' that's OK; | |
9520 | that binds `const int' to `T'. */ | |
028d1f20 | 9521 | if (!check_cv_quals_for_unify (strict_in | UNIFY_ALLOW_LESS_CV_QUAL, |
830bfa74 | 9522 | arg, parm)) |
db2767b6 MM |
9523 | return 1; |
9524 | ||
830bfa74 MM |
9525 | /* Consider the case where ARG is `const volatile int' and |
9526 | PARM is `const T'. Then, T should be `volatile int'. */ | |
c2ea3a40 NS |
9527 | arg = cp_build_qualified_type_real |
9528 | (arg, cp_type_quals (arg) & ~cp_type_quals (parm), tf_none); | |
adecb3f4 MM |
9529 | if (arg == error_mark_node) |
9530 | return 1; | |
73b0fce8 | 9531 | |
a1281f45 KL |
9532 | /* Simple cases: Value already set, does match or doesn't. */ |
9533 | if (targ != NULL_TREE && same_type_p (targ, arg)) | |
9534 | return 0; | |
9535 | else if (targ) | |
9536 | return 1; | |
61cd552e | 9537 | |
94fc547c MM |
9538 | /* Make sure that ARG is not a variable-sized array. (Note |
9539 | that were talking about variable-sized arrays (like | |
9540 | `int[n]'), rather than arrays of unknown size (like | |
9541 | `int[]').) We'll get very confused by such a type since | |
9542 | the bound of the array will not be computable in an | |
9543 | instantiation. Besides, such types are not allowed in | |
9544 | ISO C++, so we can do as we please here. */ | |
9545 | if (variably_modified_type_p (arg)) | |
9546 | return 1; | |
9547 | } | |
61cd552e | 9548 | |
050367a3 | 9549 | TREE_VEC_ELT (targs, idx) = arg; |
73b0fce8 KL |
9550 | return 0; |
9551 | ||
f84b4be9 | 9552 | case TEMPLATE_PARM_INDEX: |
db2767b6 MM |
9553 | tparm = TREE_VALUE (TREE_VEC_ELT (tparms, 0)); |
9554 | ||
9555 | if (TEMPLATE_PARM_LEVEL (parm) | |
9556 | != template_decl_level (tparm)) | |
9557 | /* The PARM is not one we're trying to unify. Just check | |
9558 | to see if it matches ARG. */ | |
c8a209ca NS |
9559 | return !(TREE_CODE (arg) == TREE_CODE (parm) |
9560 | && cp_tree_equal (parm, arg)); | |
db2767b6 | 9561 | |
f84b4be9 | 9562 | idx = TEMPLATE_PARM_IDX (parm); |
050367a3 | 9563 | targ = TREE_VEC_ELT (targs, idx); |
db2767b6 | 9564 | |
050367a3 | 9565 | if (targ) |
c8a209ca | 9566 | return !cp_tree_equal (targ, arg); |
8d08fdba | 9567 | |
161c12b0 JM |
9568 | /* [temp.deduct.type] If, in the declaration of a function template |
9569 | with a non-type template-parameter, the non-type | |
9570 | template-parameter is used in an expression in the function | |
9571 | parameter-list and, if the corresponding template-argument is | |
9572 | deduced, the template-argument type shall match the type of the | |
9573 | template-parameter exactly, except that a template-argument | |
d7c4edd0 NS |
9574 | deduced from an array bound may be of any integral type. |
9575 | The non-type parameter might use already deduced type parameters. */ | |
bd0d5d4a | 9576 | tparm = tsubst (TREE_TYPE (parm), targs, 0, NULL_TREE); |
e2005c8d KL |
9577 | if (!TREE_TYPE (arg)) |
9578 | /* Template-parameter dependent expression. Just accept it for now. | |
9579 | It will later be processed in convert_template_argument. */ | |
9580 | ; | |
9581 | else if (same_type_p (TREE_TYPE (arg), tparm)) | |
9582 | /* OK */; | |
161c12b0 | 9583 | else if ((strict & UNIFY_ALLOW_INTEGER) |
bd0d5d4a JM |
9584 | && (TREE_CODE (tparm) == INTEGER_TYPE |
9585 | || TREE_CODE (tparm) == BOOLEAN_TYPE)) | |
161c12b0 | 9586 | /* OK */; |
bd0d5d4a JM |
9587 | else if (uses_template_parms (tparm)) |
9588 | /* We haven't deduced the type of this parameter yet. Try again | |
9589 | later. */ | |
9590 | return 0; | |
161c12b0 JM |
9591 | else |
9592 | return 1; | |
9593 | ||
2a1e9fdd | 9594 | TREE_VEC_ELT (targs, idx) = arg; |
8d08fdba MS |
9595 | return 0; |
9596 | ||
9597 | case POINTER_TYPE: | |
830bfa74 | 9598 | { |
830bfa74 MM |
9599 | if (TREE_CODE (arg) != POINTER_TYPE) |
9600 | return 1; | |
9601 | ||
9602 | /* [temp.deduct.call] | |
9603 | ||
9604 | A can be another pointer or pointer to member type that can | |
9605 | be converted to the deduced A via a qualification | |
9606 | conversion (_conv.qual_). | |
9607 | ||
9608 | We pass down STRICT here rather than UNIFY_ALLOW_NONE. | |
9609 | This will allow for additional cv-qualification of the | |
028d1f20 | 9610 | pointed-to types if appropriate. */ |
830bfa74 | 9611 | |
028d1f20 | 9612 | if (TREE_CODE (TREE_TYPE (arg)) == RECORD_TYPE) |
830bfa74 MM |
9613 | /* The derived-to-base conversion only persists through one |
9614 | level of pointers. */ | |
028d1f20 | 9615 | strict |= (strict_in & UNIFY_ALLOW_DERIVED); |
830bfa74 | 9616 | |
a7a64a77 | 9617 | return unify (tparms, targs, TREE_TYPE (parm), |
028d1f20 | 9618 | TREE_TYPE (arg), strict); |
830bfa74 | 9619 | } |
8d08fdba MS |
9620 | |
9621 | case REFERENCE_TYPE: | |
830bfa74 MM |
9622 | if (TREE_CODE (arg) != REFERENCE_TYPE) |
9623 | return 1; | |
9624 | return unify (tparms, targs, TREE_TYPE (parm), TREE_TYPE (arg), | |
028d1f20 | 9625 | strict & UNIFY_ALLOW_MORE_CV_QUAL); |
8d08fdba MS |
9626 | |
9627 | case ARRAY_TYPE: | |
9628 | if (TREE_CODE (arg) != ARRAY_TYPE) | |
9629 | return 1; | |
3042d5be MM |
9630 | if ((TYPE_DOMAIN (parm) == NULL_TREE) |
9631 | != (TYPE_DOMAIN (arg) == NULL_TREE)) | |
9632 | return 1; | |
9633 | if (TYPE_DOMAIN (parm) != NULL_TREE | |
830bfa74 | 9634 | && unify (tparms, targs, TYPE_DOMAIN (parm), |
4393e105 | 9635 | TYPE_DOMAIN (arg), UNIFY_ALLOW_NONE) != 0) |
8d08fdba | 9636 | return 1; |
830bfa74 | 9637 | return unify (tparms, targs, TREE_TYPE (parm), TREE_TYPE (arg), |
712467a4 | 9638 | strict & UNIFY_ALLOW_MORE_CV_QUAL); |
8d08fdba MS |
9639 | |
9640 | case REAL_TYPE: | |
37c46b43 | 9641 | case COMPLEX_TYPE: |
c00996a3 | 9642 | case VECTOR_TYPE: |
8d08fdba | 9643 | case INTEGER_TYPE: |
42976354 | 9644 | case BOOLEAN_TYPE: |
5ad5a526 | 9645 | case VOID_TYPE: |
f376e137 MS |
9646 | if (TREE_CODE (arg) != TREE_CODE (parm)) |
9647 | return 1; | |
9648 | ||
514a1f18 JM |
9649 | if (TREE_CODE (parm) == INTEGER_TYPE |
9650 | && TREE_CODE (TYPE_MAX_VALUE (parm)) != INTEGER_CST) | |
8d08fdba MS |
9651 | { |
9652 | if (TYPE_MIN_VALUE (parm) && TYPE_MIN_VALUE (arg) | |
830bfa74 | 9653 | && unify (tparms, targs, TYPE_MIN_VALUE (parm), |
4393e105 | 9654 | TYPE_MIN_VALUE (arg), UNIFY_ALLOW_INTEGER)) |
8d08fdba MS |
9655 | return 1; |
9656 | if (TYPE_MAX_VALUE (parm) && TYPE_MAX_VALUE (arg) | |
830bfa74 | 9657 | && unify (tparms, targs, TYPE_MAX_VALUE (parm), |
d9f818d9 RS |
9658 | TYPE_MAX_VALUE (arg), |
9659 | UNIFY_ALLOW_INTEGER | UNIFY_ALLOW_MAX_CORRECTION)) | |
8d08fdba MS |
9660 | return 1; |
9661 | } | |
9edc3913 | 9662 | /* We have already checked cv-qualification at the top of the |
514a1f18 | 9663 | function. */ |
9edc3913 | 9664 | else if (!same_type_ignoring_top_level_qualifiers_p (arg, parm)) |
ca79f85d JM |
9665 | return 1; |
9666 | ||
8d08fdba MS |
9667 | /* As far as unification is concerned, this wins. Later checks |
9668 | will invalidate it if necessary. */ | |
9669 | return 0; | |
9670 | ||
9671 | /* Types INTEGER_CST and MINUS_EXPR can come from array bounds. */ | |
bd6dd845 | 9672 | /* Type INTEGER_CST can come from ordinary constant template args. */ |
8d08fdba | 9673 | case INTEGER_CST: |
bd6dd845 MS |
9674 | while (TREE_CODE (arg) == NOP_EXPR) |
9675 | arg = TREE_OPERAND (arg, 0); | |
9676 | ||
8d08fdba MS |
9677 | if (TREE_CODE (arg) != INTEGER_CST) |
9678 | return 1; | |
9679 | return !tree_int_cst_equal (parm, arg); | |
9680 | ||
8d08fdba MS |
9681 | case TREE_VEC: |
9682 | { | |
9683 | int i; | |
9684 | if (TREE_CODE (arg) != TREE_VEC) | |
9685 | return 1; | |
9686 | if (TREE_VEC_LENGTH (parm) != TREE_VEC_LENGTH (arg)) | |
9687 | return 1; | |
0dc09a61 | 9688 | for (i = 0; i < TREE_VEC_LENGTH (parm); ++i) |
830bfa74 | 9689 | if (unify (tparms, targs, |
8d08fdba | 9690 | TREE_VEC_ELT (parm, i), TREE_VEC_ELT (arg, i), |
4393e105 | 9691 | UNIFY_ALLOW_NONE)) |
8d08fdba MS |
9692 | return 1; |
9693 | return 0; | |
9694 | } | |
9695 | ||
8d08fdba | 9696 | case RECORD_TYPE: |
f181d4ae | 9697 | case UNION_TYPE: |
f181d4ae | 9698 | if (TREE_CODE (arg) != TREE_CODE (parm)) |
a4443a08 | 9699 | return 1; |
830bfa74 | 9700 | |
a7a64a77 MM |
9701 | if (TYPE_PTRMEMFUNC_P (parm)) |
9702 | { | |
9703 | if (!TYPE_PTRMEMFUNC_P (arg)) | |
9704 | return 1; | |
9705 | ||
9706 | return unify (tparms, targs, | |
9707 | TYPE_PTRMEMFUNC_FN_TYPE (parm), | |
9708 | TYPE_PTRMEMFUNC_FN_TYPE (arg), | |
9709 | strict); | |
9710 | } | |
9711 | ||
5db698f6 | 9712 | if (CLASSTYPE_TEMPLATE_INFO (parm)) |
5566b478 | 9713 | { |
6467930b | 9714 | tree t = NULL_TREE; |
4393e105 | 9715 | |
028d1f20 | 9716 | if (strict_in & UNIFY_ALLOW_DERIVED) |
4393e105 MM |
9717 | { |
9718 | /* First, we try to unify the PARM and ARG directly. */ | |
9719 | t = try_class_unification (tparms, targs, | |
9720 | parm, arg); | |
9721 | ||
9722 | if (!t) | |
9723 | { | |
9724 | /* Fallback to the special case allowed in | |
9725 | [temp.deduct.call]: | |
9726 | ||
9727 | If P is a class, and P has the form | |
9728 | template-id, then A can be a derived class of | |
9729 | the deduced A. Likewise, if P is a pointer to | |
9730 | a class of the form template-id, A can be a | |
9731 | pointer to a derived class pointed to by the | |
9732 | deduced A. */ | |
9733 | t = get_template_base (tparms, targs, | |
9734 | parm, arg); | |
9735 | ||
9736 | if (! t || t == error_mark_node) | |
9737 | return 1; | |
9738 | } | |
9739 | } | |
6df47b06 | 9740 | else if (CLASSTYPE_TEMPLATE_INFO (arg) |
9fbf56f7 MM |
9741 | && (CLASSTYPE_TI_TEMPLATE (parm) |
9742 | == CLASSTYPE_TI_TEMPLATE (arg))) | |
6df47b06 MM |
9743 | /* Perhaps PARM is something like S<U> and ARG is S<int>. |
9744 | Then, we should unify `int' and `U'. */ | |
6467930b | 9745 | t = arg; |
4393e105 | 9746 | else |
dc957d14 | 9747 | /* There's no chance of unification succeeding. */ |
5566b478 | 9748 | return 1; |
6467930b | 9749 | |
830bfa74 | 9750 | return unify (tparms, targs, CLASSTYPE_TI_ARGS (parm), |
4393e105 | 9751 | CLASSTYPE_TI_ARGS (t), UNIFY_ALLOW_NONE); |
5566b478 | 9752 | } |
9edc3913 | 9753 | else if (!same_type_ignoring_top_level_qualifiers_p (parm, arg)) |
5566b478 | 9754 | return 1; |
a4443a08 | 9755 | return 0; |
8d08fdba MS |
9756 | |
9757 | case METHOD_TYPE: | |
8d08fdba | 9758 | case FUNCTION_TYPE: |
830bfa74 | 9759 | if (TREE_CODE (arg) != TREE_CODE (parm)) |
8d08fdba | 9760 | return 1; |
830bfa74 MM |
9761 | |
9762 | if (unify (tparms, targs, TREE_TYPE (parm), | |
4393e105 | 9763 | TREE_TYPE (arg), UNIFY_ALLOW_NONE)) |
28cbf42c | 9764 | return 1; |
386b8a85 | 9765 | return type_unification_real (tparms, targs, TYPE_ARG_TYPES (parm), |
3b3ba9f0 | 9766 | TYPE_ARG_TYPES (arg), 1, |
e5214479 | 9767 | DEDUCE_EXACT, 0, -1); |
a4443a08 MS |
9768 | |
9769 | case OFFSET_TYPE: | |
9770 | if (TREE_CODE (arg) != OFFSET_TYPE) | |
9771 | return 1; | |
830bfa74 | 9772 | if (unify (tparms, targs, TYPE_OFFSET_BASETYPE (parm), |
4393e105 | 9773 | TYPE_OFFSET_BASETYPE (arg), UNIFY_ALLOW_NONE)) |
a4443a08 | 9774 | return 1; |
830bfa74 | 9775 | return unify (tparms, targs, TREE_TYPE (parm), TREE_TYPE (arg), |
4393e105 | 9776 | strict); |
a4443a08 | 9777 | |
f62dbf03 | 9778 | case CONST_DECL: |
a723baf1 MM |
9779 | if (DECL_TEMPLATE_PARM_P (parm)) |
9780 | return unify (tparms, targs, DECL_INITIAL (parm), arg, strict); | |
830bfa74 | 9781 | if (arg != decl_constant_value (parm)) |
f62dbf03 JM |
9782 | return 1; |
9783 | return 0; | |
9784 | ||
027905b4 KL |
9785 | case TEMPLATE_DECL: |
9786 | /* Matched cases are handled by the ARG == PARM test above. */ | |
9787 | return 1; | |
9788 | ||
53929c47 | 9789 | case MINUS_EXPR: |
d9f818d9 RS |
9790 | if (tree_int_cst_equal (TREE_OPERAND (parm, 1), integer_one_node) |
9791 | && (strict_in & UNIFY_ALLOW_MAX_CORRECTION)) | |
53929c47 JM |
9792 | { |
9793 | /* We handle this case specially, since it comes up with | |
9794 | arrays. In particular, something like: | |
9795 | ||
9796 | template <int N> void f(int (&x)[N]); | |
9797 | ||
9798 | Here, we are trying to unify the range type, which | |
9799 | looks like [0 ... (N - 1)]. */ | |
9800 | tree t, t1, t2; | |
9801 | t1 = TREE_OPERAND (parm, 0); | |
9802 | t2 = TREE_OPERAND (parm, 1); | |
9803 | ||
24e2e58e | 9804 | t = fold (build (PLUS_EXPR, integer_type_node, arg, t2)); |
53929c47 | 9805 | |
4393e105 | 9806 | return unify (tparms, targs, t1, t, strict); |
53929c47 JM |
9807 | } |
9808 | /* else fall through */ | |
9809 | ||
8d08fdba | 9810 | default: |
050367a3 | 9811 | if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (TREE_CODE (parm)))) |
74601d7c KL |
9812 | { |
9813 | ||
9814 | /* We're looking at an expression. This can happen with | |
9815 | something like: | |
4393e105 | 9816 | |
74601d7c KL |
9817 | template <int I> |
9818 | void foo(S<I>, S<I + 2>); | |
050367a3 | 9819 | |
74601d7c | 9820 | This is a "nondeduced context": |
050367a3 | 9821 | |
74601d7c | 9822 | [deduct.type] |
4393e105 | 9823 | |
74601d7c | 9824 | The nondeduced contexts are: |
050367a3 | 9825 | |
74601d7c KL |
9826 | --A type that is a template-id in which one or more of |
9827 | the template-arguments is an expression that references | |
9828 | a template-parameter. | |
050367a3 | 9829 | |
74601d7c KL |
9830 | In these cases, we assume deduction succeeded, but don't |
9831 | actually infer any unifications. */ | |
9832 | ||
9833 | if (!uses_template_parms (parm) | |
9834 | && !template_args_equal (parm, arg)) | |
9835 | return 1; | |
9836 | else | |
9837 | return 0; | |
9838 | } | |
050367a3 | 9839 | else |
b4c4a9ec MM |
9840 | sorry ("use of `%s' in template type unification", |
9841 | tree_code_name [(int) TREE_CODE (parm)]); | |
050367a3 | 9842 | |
8d08fdba MS |
9843 | return 1; |
9844 | } | |
9845 | } | |
8d08fdba | 9846 | \f |
03d0f4af MM |
9847 | /* Called if RESULT is explicitly instantiated, or is a member of an |
9848 | explicitly instantiated class, or if using -frepo and the | |
9849 | instantiation of RESULT has been assigned to this file. */ | |
9850 | ||
faae18ab | 9851 | void |
3a978d72 | 9852 | mark_decl_instantiated (tree result, int extern_p) |
faae18ab | 9853 | { |
3ae18eaf JM |
9854 | /* We used to set this unconditionally; we moved that to |
9855 | do_decl_instantiation so it wouldn't get set on members of | |
9856 | explicit class template instantiations. But we still need to set | |
9857 | it here for the 'extern template' case in order to suppress | |
9858 | implicit instantiations. */ | |
9859 | if (extern_p) | |
9860 | SET_DECL_EXPLICIT_INSTANTIATION (result); | |
9861 | ||
1f6f0cb6 MM |
9862 | /* If this entity has already been written out, it's too late to |
9863 | make any modifications. */ | |
9864 | if (TREE_ASM_WRITTEN (result)) | |
9865 | return; | |
9866 | ||
9867 | if (TREE_CODE (result) != FUNCTION_DECL) | |
9868 | /* The TREE_PUBLIC flag for function declarations will have been | |
9869 | set correctly by tsubst. */ | |
9870 | TREE_PUBLIC (result) = 1; | |
9871 | ||
346eeb15 JM |
9872 | /* This might have been set by an earlier implicit instantiation. */ |
9873 | DECL_COMDAT (result) = 0; | |
9874 | ||
faae18ab MS |
9875 | if (! extern_p) |
9876 | { | |
9877 | DECL_INTERFACE_KNOWN (result) = 1; | |
9878 | DECL_NOT_REALLY_EXTERN (result) = 1; | |
a7d87521 | 9879 | |
1a408d07 JM |
9880 | /* Always make artificials weak. */ |
9881 | if (DECL_ARTIFICIAL (result) && flag_weak) | |
9882 | comdat_linkage (result); | |
a7d87521 JM |
9883 | /* For WIN32 we also want to put explicit instantiations in |
9884 | linkonce sections. */ | |
1a408d07 | 9885 | else if (TREE_PUBLIC (result)) |
b385c841 | 9886 | maybe_make_one_only (result); |
faae18ab | 9887 | } |
1f6f0cb6 MM |
9888 | |
9889 | if (TREE_CODE (result) == FUNCTION_DECL) | |
56e770bf | 9890 | defer_fn (result); |
faae18ab MS |
9891 | } |
9892 | ||
e5214479 | 9893 | /* Given two function templates PAT1 and PAT2, return: |
6467930b | 9894 | |
62e4a758 NS |
9895 | DEDUCE should be DEDUCE_EXACT or DEDUCE_ORDER. |
9896 | ||
6467930b MS |
9897 | 1 if PAT1 is more specialized than PAT2 as described in [temp.func.order]. |
9898 | -1 if PAT2 is more specialized than PAT1. | |
e5214479 JM |
9899 | 0 if neither is more specialized. |
9900 | ||
9901 | LEN is passed through to fn_type_unification. */ | |
6467930b MS |
9902 | |
9903 | int | |
3a978d72 | 9904 | more_specialized (tree pat1, tree pat2, int deduce, int len) |
6467930b | 9905 | { |
98c1c668 | 9906 | tree targs; |
73aad9b9 | 9907 | int winner = 0; |
6467930b | 9908 | |
35c18a20 MM |
9909 | /* If template argument deduction succeeds, we substitute the |
9910 | resulting arguments into non-deduced contexts. While doing that, | |
9911 | we must be aware that we may encounter dependent types. */ | |
9912 | ++processing_template_decl; | |
62e4a758 NS |
9913 | targs = get_bindings_real (pat1, DECL_TEMPLATE_RESULT (pat2), |
9914 | NULL_TREE, 0, deduce, len); | |
73aad9b9 | 9915 | if (targs) |
36a117a5 | 9916 | --winner; |
6467930b | 9917 | |
62e4a758 NS |
9918 | targs = get_bindings_real (pat2, DECL_TEMPLATE_RESULT (pat1), |
9919 | NULL_TREE, 0, deduce, len); | |
73aad9b9 | 9920 | if (targs) |
36a117a5 | 9921 | ++winner; |
35c18a20 | 9922 | --processing_template_decl; |
6467930b | 9923 | |
73aad9b9 JM |
9924 | return winner; |
9925 | } | |
6467930b | 9926 | |
73aad9b9 | 9927 | /* Given two class template specialization list nodes PAT1 and PAT2, return: |
6467930b | 9928 | |
73aad9b9 JM |
9929 | 1 if PAT1 is more specialized than PAT2 as described in [temp.class.order]. |
9930 | -1 if PAT2 is more specialized than PAT1. | |
55ece1b3 KL |
9931 | 0 if neither is more specialized. |
9932 | ||
9933 | FULL_ARGS is the full set of template arguments that triggers this | |
9934 | partial ordering. */ | |
73aad9b9 JM |
9935 | |
9936 | int | |
55ece1b3 | 9937 | more_specialized_class (tree pat1, tree pat2, tree full_args) |
73aad9b9 JM |
9938 | { |
9939 | tree targs; | |
9940 | int winner = 0; | |
9941 | ||
36a117a5 | 9942 | targs = get_class_bindings (TREE_VALUE (pat1), TREE_PURPOSE (pat1), |
55ece1b3 | 9943 | add_outermost_template_args (full_args, TREE_PURPOSE (pat2))); |
73aad9b9 JM |
9944 | if (targs) |
9945 | --winner; | |
9946 | ||
36a117a5 | 9947 | targs = get_class_bindings (TREE_VALUE (pat2), TREE_PURPOSE (pat2), |
55ece1b3 | 9948 | add_outermost_template_args (full_args, TREE_PURPOSE (pat1))); |
73aad9b9 | 9949 | if (targs) |
6467930b MS |
9950 | ++winner; |
9951 | ||
9952 | return winner; | |
9953 | } | |
73aad9b9 JM |
9954 | |
9955 | /* Return the template arguments that will produce the function signature | |
e1467ff2 | 9956 | DECL from the function template FN, with the explicit template |
76b9a14d | 9957 | arguments EXPLICIT_ARGS. If CHECK_RETTYPE is 1, the return type must |
4393e105 | 9958 | also match. Return NULL_TREE if no satisfactory arguments could be |
62e4a758 | 9959 | found. DEDUCE and LEN are passed through to fn_type_unification. */ |
e5214479 | 9960 | |
76b9a14d | 9961 | static tree |
3a978d72 NN |
9962 | get_bindings_real (tree fn, |
9963 | tree decl, | |
9964 | tree explicit_args, | |
9965 | int check_rettype, | |
9966 | int deduce, | |
9967 | int len) | |
73aad9b9 | 9968 | { |
98c1c668 | 9969 | int ntparms = DECL_NTPARMS (fn); |
f31c0a32 | 9970 | tree targs = make_tree_vec (ntparms); |
4393e105 | 9971 | tree decl_type; |
03017874 | 9972 | tree decl_arg_types; |
98c1c668 JM |
9973 | int i; |
9974 | ||
4393e105 MM |
9975 | /* Substitute the explicit template arguments into the type of DECL. |
9976 | The call to fn_type_unification will handle substitution into the | |
9977 | FN. */ | |
9978 | decl_type = TREE_TYPE (decl); | |
9979 | if (explicit_args && uses_template_parms (decl_type)) | |
9980 | { | |
9981 | tree tmpl; | |
9982 | tree converted_args; | |
9983 | ||
9984 | if (DECL_TEMPLATE_INFO (decl)) | |
9985 | tmpl = DECL_TI_TEMPLATE (decl); | |
9986 | else | |
0e339752 | 9987 | /* We can get here for some invalid specializations. */ |
4393e105 MM |
9988 | return NULL_TREE; |
9989 | ||
9990 | converted_args | |
9991 | = (coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (tmpl), | |
9992 | explicit_args, NULL_TREE, | |
c2ea3a40 | 9993 | tf_none, /*require_all_arguments=*/0)); |
4393e105 MM |
9994 | if (converted_args == error_mark_node) |
9995 | return NULL_TREE; | |
9996 | ||
c2ea3a40 | 9997 | decl_type = tsubst (decl_type, converted_args, tf_none, NULL_TREE); |
4393e105 MM |
9998 | if (decl_type == error_mark_node) |
9999 | return NULL_TREE; | |
10000 | } | |
10001 | ||
10002 | decl_arg_types = TYPE_ARG_TYPES (decl_type); | |
e5214479 JM |
10003 | /* Never do unification on the 'this' parameter. */ |
10004 | if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl)) | |
03017874 | 10005 | decl_arg_types = TREE_CHAIN (decl_arg_types); |
d7684f2d | 10006 | |
e1467ff2 | 10007 | i = fn_type_unification (fn, explicit_args, targs, |
03017874 | 10008 | decl_arg_types, |
8d3631f8 NS |
10009 | (check_rettype || DECL_CONV_FN_P (fn) |
10010 | ? TREE_TYPE (decl_type) : NULL_TREE), | |
62e4a758 | 10011 | deduce, len); |
98c1c668 | 10012 | |
76b9a14d JM |
10013 | if (i != 0) |
10014 | return NULL_TREE; | |
10015 | ||
76b9a14d JM |
10016 | return targs; |
10017 | } | |
10018 | ||
10019 | /* For most uses, we want to check the return type. */ | |
10020 | ||
eb1dfbb2 | 10021 | static tree |
3a978d72 | 10022 | get_bindings (tree fn, tree decl, tree explicit_args) |
76b9a14d | 10023 | { |
62e4a758 | 10024 | return get_bindings_real (fn, decl, explicit_args, 1, DEDUCE_EXACT, -1); |
76b9a14d JM |
10025 | } |
10026 | ||
e5214479 JM |
10027 | /* But for resolve_overloaded_unification, we only care about the parameter |
10028 | types. */ | |
76b9a14d JM |
10029 | |
10030 | static tree | |
3a978d72 | 10031 | get_bindings_overload (tree fn, tree decl, tree explicit_args) |
76b9a14d | 10032 | { |
62e4a758 | 10033 | return get_bindings_real (fn, decl, explicit_args, 0, DEDUCE_EXACT, -1); |
73aad9b9 JM |
10034 | } |
10035 | ||
36a117a5 MM |
10036 | /* Return the innermost template arguments that, when applied to a |
10037 | template specialization whose innermost template parameters are | |
9471d3e2 | 10038 | TPARMS, and whose specialization arguments are PARMS, yield the |
36a117a5 MM |
10039 | ARGS. |
10040 | ||
10041 | For example, suppose we have: | |
10042 | ||
10043 | template <class T, class U> struct S {}; | |
10044 | template <class T> struct S<T*, int> {}; | |
10045 | ||
10046 | Then, suppose we want to get `S<double*, int>'. The TPARMS will be | |
10047 | {T}, the PARMS will be {T*, int} and the ARGS will be {double*, | |
10048 | int}. The resulting vector will be {double}, indicating that `T' | |
10049 | is bound to `double'. */ | |
10050 | ||
bd6dd845 | 10051 | static tree |
3a978d72 | 10052 | get_class_bindings (tree tparms, tree parms, tree args) |
73aad9b9 | 10053 | { |
3b3ba9f0 | 10054 | int i, ntparms = TREE_VEC_LENGTH (tparms); |
f31c0a32 | 10055 | tree vec = make_tree_vec (ntparms); |
73aad9b9 | 10056 | |
74601d7c KL |
10057 | if (unify (tparms, vec, parms, INNERMOST_TEMPLATE_ARGS (args), |
10058 | UNIFY_ALLOW_NONE)) | |
fcfb9f96 | 10059 | return NULL_TREE; |
73aad9b9 JM |
10060 | |
10061 | for (i = 0; i < ntparms; ++i) | |
10062 | if (! TREE_VEC_ELT (vec, i)) | |
10063 | return NULL_TREE; | |
10064 | ||
74601d7c KL |
10065 | if (verify_class_unification (vec, parms, args)) |
10066 | return NULL_TREE; | |
10067 | ||
73aad9b9 JM |
10068 | return vec; |
10069 | } | |
10070 | ||
104bf76a MM |
10071 | /* In INSTANTIATIONS is a list of <INSTANTIATION, TEMPLATE> pairs. |
10072 | Pick the most specialized template, and return the corresponding | |
10073 | instantiation, or if there is no corresponding instantiation, the | |
e5214479 JM |
10074 | template itself. If there is no most specialized template, |
10075 | error_mark_node is returned. If there are no templates at all, | |
10076 | NULL_TREE is returned. */ | |
73aad9b9 JM |
10077 | |
10078 | tree | |
3a978d72 | 10079 | most_specialized_instantiation (tree instantiations) |
73aad9b9 | 10080 | { |
104bf76a | 10081 | tree fn, champ; |
73aad9b9 JM |
10082 | int fate; |
10083 | ||
104bf76a | 10084 | if (!instantiations) |
73aad9b9 JM |
10085 | return NULL_TREE; |
10086 | ||
104bf76a MM |
10087 | champ = instantiations; |
10088 | for (fn = TREE_CHAIN (instantiations); fn; fn = TREE_CHAIN (fn)) | |
73aad9b9 | 10089 | { |
62e4a758 NS |
10090 | fate = more_specialized (TREE_VALUE (champ), TREE_VALUE (fn), |
10091 | DEDUCE_EXACT, -1); | |
73aad9b9 JM |
10092 | if (fate == 1) |
10093 | ; | |
10094 | else | |
10095 | { | |
10096 | if (fate == 0) | |
10097 | { | |
10098 | fn = TREE_CHAIN (fn); | |
10099 | if (! fn) | |
10100 | return error_mark_node; | |
10101 | } | |
104bf76a | 10102 | champ = fn; |
73aad9b9 JM |
10103 | } |
10104 | } | |
10105 | ||
104bf76a | 10106 | for (fn = instantiations; fn && fn != champ; fn = TREE_CHAIN (fn)) |
73aad9b9 | 10107 | { |
62e4a758 NS |
10108 | fate = more_specialized (TREE_VALUE (champ), TREE_VALUE (fn), |
10109 | DEDUCE_EXACT, -1); | |
73aad9b9 JM |
10110 | if (fate != 1) |
10111 | return error_mark_node; | |
10112 | } | |
10113 | ||
104bf76a MM |
10114 | return TREE_PURPOSE (champ) ? TREE_PURPOSE (champ) : TREE_VALUE (champ); |
10115 | } | |
10116 | ||
10117 | /* Return the most specialized of the list of templates in FNS that can | |
10118 | produce an instantiation matching DECL, given the explicit template | |
10119 | arguments EXPLICIT_ARGS. */ | |
10120 | ||
e9659ab0 | 10121 | static tree |
3a978d72 | 10122 | most_specialized (tree fns, tree decl, tree explicit_args) |
104bf76a MM |
10123 | { |
10124 | tree candidates = NULL_TREE; | |
10125 | tree fn, args; | |
10126 | ||
10127 | for (fn = fns; fn; fn = TREE_CHAIN (fn)) | |
10128 | { | |
10129 | tree candidate = TREE_VALUE (fn); | |
10130 | ||
10131 | args = get_bindings (candidate, decl, explicit_args); | |
10132 | if (args) | |
e1b3e07d | 10133 | candidates = tree_cons (NULL_TREE, candidate, candidates); |
104bf76a MM |
10134 | } |
10135 | ||
e5214479 | 10136 | return most_specialized_instantiation (candidates); |
73aad9b9 JM |
10137 | } |
10138 | ||
36a117a5 | 10139 | /* If DECL is a specialization of some template, return the most |
f9a7ae04 MM |
10140 | general such template. Otherwise, returns NULL_TREE. |
10141 | ||
10142 | For example, given: | |
36a117a5 MM |
10143 | |
10144 | template <class T> struct S { template <class U> void f(U); }; | |
10145 | ||
10146 | if TMPL is `template <class U> void S<int>::f(U)' this will return | |
10147 | the full template. This function will not trace past partial | |
10148 | specializations, however. For example, given in addition: | |
10149 | ||
10150 | template <class T> struct S<T*> { template <class U> void f(U); }; | |
10151 | ||
10152 | if TMPL is `template <class U> void S<int*>::f(U)' this will return | |
10153 | `template <class T> template <class U> S<T*>::f(U)'. */ | |
73aad9b9 | 10154 | |
612c671a | 10155 | tree |
3a978d72 | 10156 | most_general_template (tree decl) |
73aad9b9 | 10157 | { |
f9a7ae04 MM |
10158 | /* If DECL is a FUNCTION_DECL, find the TEMPLATE_DECL of which it is |
10159 | an immediate specialization. */ | |
10160 | if (TREE_CODE (decl) == FUNCTION_DECL) | |
10161 | { | |
10162 | if (DECL_TEMPLATE_INFO (decl)) { | |
10163 | decl = DECL_TI_TEMPLATE (decl); | |
10164 | ||
10165 | /* The DECL_TI_TEMPLATE can be an IDENTIFIER_NODE for a | |
10166 | template friend. */ | |
10167 | if (TREE_CODE (decl) != TEMPLATE_DECL) | |
10168 | return NULL_TREE; | |
10169 | } else | |
10170 | return NULL_TREE; | |
10171 | } | |
10172 | ||
10173 | /* Look for more and more general templates. */ | |
10174 | while (DECL_TEMPLATE_INFO (decl)) | |
10175 | { | |
10b1d5e7 MM |
10176 | /* The DECL_TI_TEMPLATE can be an IDENTIFIER_NODE in some cases. |
10177 | (See cp-tree.h for details.) */ | |
f9a7ae04 MM |
10178 | if (TREE_CODE (DECL_TI_TEMPLATE (decl)) != TEMPLATE_DECL) |
10179 | break; | |
10180 | ||
6e049fcd KL |
10181 | if (CLASS_TYPE_P (TREE_TYPE (decl)) |
10182 | && CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_TYPE (decl))) | |
10183 | break; | |
10184 | ||
f9a7ae04 MM |
10185 | /* Stop if we run into an explicitly specialized class template. */ |
10186 | if (!DECL_NAMESPACE_SCOPE_P (decl) | |
10187 | && DECL_CONTEXT (decl) | |
10188 | && CLASSTYPE_TEMPLATE_SPECIALIZATION (DECL_CONTEXT (decl))) | |
10189 | break; | |
10190 | ||
10191 | decl = DECL_TI_TEMPLATE (decl); | |
10192 | } | |
36a117a5 MM |
10193 | |
10194 | return decl; | |
10195 | } | |
10196 | ||
10197 | /* Return the most specialized of the class template specializations | |
10198 | of TMPL which can produce an instantiation matching ARGS, or | |
10199 | error_mark_node if the choice is ambiguous. */ | |
10200 | ||
e9659ab0 | 10201 | static tree |
3a978d72 | 10202 | most_specialized_class (tree tmpl, tree args) |
36a117a5 MM |
10203 | { |
10204 | tree list = NULL_TREE; | |
10205 | tree t; | |
10206 | tree champ; | |
73aad9b9 JM |
10207 | int fate; |
10208 | ||
36a117a5 MM |
10209 | tmpl = most_general_template (tmpl); |
10210 | for (t = DECL_TEMPLATE_SPECIALIZATIONS (tmpl); t; t = TREE_CHAIN (t)) | |
73aad9b9 | 10211 | { |
36a117a5 MM |
10212 | tree spec_args |
10213 | = get_class_bindings (TREE_VALUE (t), TREE_PURPOSE (t), args); | |
10214 | if (spec_args) | |
73aad9b9 | 10215 | { |
1f8f4a0b | 10216 | list = tree_cons (TREE_PURPOSE (t), TREE_VALUE (t), list); |
73aad9b9 JM |
10217 | TREE_TYPE (list) = TREE_TYPE (t); |
10218 | } | |
10219 | } | |
10220 | ||
10221 | if (! list) | |
10222 | return NULL_TREE; | |
10223 | ||
10224 | t = list; | |
10225 | champ = t; | |
10226 | t = TREE_CHAIN (t); | |
10227 | for (; t; t = TREE_CHAIN (t)) | |
10228 | { | |
55ece1b3 | 10229 | fate = more_specialized_class (champ, t, args); |
73aad9b9 JM |
10230 | if (fate == 1) |
10231 | ; | |
10232 | else | |
10233 | { | |
10234 | if (fate == 0) | |
10235 | { | |
10236 | t = TREE_CHAIN (t); | |
10237 | if (! t) | |
10238 | return error_mark_node; | |
10239 | } | |
10240 | champ = t; | |
10241 | } | |
10242 | } | |
10243 | ||
10244 | for (t = list; t && t != champ; t = TREE_CHAIN (t)) | |
10245 | { | |
55ece1b3 | 10246 | fate = more_specialized_class (champ, t, args); |
73aad9b9 JM |
10247 | if (fate != 1) |
10248 | return error_mark_node; | |
10249 | } | |
10250 | ||
10251 | return champ; | |
10252 | } | |
10253 | ||
eb8845be | 10254 | /* Explicitly instantiate DECL. */ |
e92cc029 | 10255 | |
8d08fdba | 10256 | void |
eb8845be | 10257 | do_decl_instantiation (tree decl, tree storage) |
8d08fdba | 10258 | { |
8d08fdba | 10259 | tree result = NULL_TREE; |
faae18ab | 10260 | int extern_p = 0; |
e8abc66f | 10261 | |
3fa56191 | 10262 | if (!decl) |
dc957d14 | 10263 | /* An error occurred, for which grokdeclarator has already issued |
3fa56191 MM |
10264 | an appropriate message. */ |
10265 | return; | |
10266 | else if (! DECL_LANG_SPECIFIC (decl)) | |
ec255269 | 10267 | { |
33bd39a2 | 10268 | error ("explicit instantiation of non-template `%#D'", decl); |
ec255269 MS |
10269 | return; |
10270 | } | |
03d0f4af | 10271 | else if (TREE_CODE (decl) == VAR_DECL) |
6633d636 | 10272 | { |
03d0f4af MM |
10273 | /* There is an asymmetry here in the way VAR_DECLs and |
10274 | FUNCTION_DECLs are handled by grokdeclarator. In the case of | |
10275 | the latter, the DECL we get back will be marked as a | |
10276 | template instantiation, and the appropriate | |
10277 | DECL_TEMPLATE_INFO will be set up. This does not happen for | |
10278 | VAR_DECLs so we do the lookup here. Probably, grokdeclarator | |
10279 | should handle VAR_DECLs as it currently handles | |
10280 | FUNCTION_DECLs. */ | |
86ac0575 | 10281 | result = lookup_field (DECL_CONTEXT (decl), DECL_NAME (decl), 0, false); |
e0860732 | 10282 | if (!result || TREE_CODE (result) != VAR_DECL) |
03d0f4af | 10283 | { |
e0860732 | 10284 | error ("no matching template for `%D' found", decl); |
03d0f4af MM |
10285 | return; |
10286 | } | |
6633d636 MS |
10287 | } |
10288 | else if (TREE_CODE (decl) != FUNCTION_DECL) | |
10289 | { | |
33bd39a2 | 10290 | error ("explicit instantiation of `%#D'", decl); |
6633d636 MS |
10291 | return; |
10292 | } | |
03d0f4af MM |
10293 | else |
10294 | result = decl; | |
672476cb | 10295 | |
03d0f4af | 10296 | /* Check for various error cases. Note that if the explicit |
0e339752 | 10297 | instantiation is valid the RESULT will currently be marked as an |
03d0f4af MM |
10298 | *implicit* instantiation; DECL_EXPLICIT_INSTANTIATION is not set |
10299 | until we get here. */ | |
10300 | ||
10301 | if (DECL_TEMPLATE_SPECIALIZATION (result)) | |
672476cb | 10302 | { |
07782718 KL |
10303 | /* DR 259 [temp.spec]. |
10304 | ||
10305 | Both an explicit instantiation and a declaration of an explicit | |
10306 | specialization shall not appear in a program unless the explicit | |
10307 | instantiation follows a declaration of the explicit specialization. | |
03d0f4af | 10308 | |
07782718 KL |
10309 | For a given set of template parameters, if an explicit |
10310 | instantiation of a template appears after a declaration of an | |
10311 | explicit specialization for that template, the explicit | |
10312 | instantiation has no effect. */ | |
672476cb MM |
10313 | return; |
10314 | } | |
03d0f4af MM |
10315 | else if (DECL_EXPLICIT_INSTANTIATION (result)) |
10316 | { | |
10317 | /* [temp.spec] | |
98c1c668 | 10318 | |
03d0f4af MM |
10319 | No program shall explicitly instantiate any template more |
10320 | than once. | |
10321 | ||
2aaf816d JM |
10322 | We check DECL_INTERFACE_KNOWN so as not to complain when the first |
10323 | instantiation was `extern' and the second is not, and EXTERN_P for | |
10324 | the opposite case. If -frepo, chances are we already got marked | |
dc957d14 | 10325 | as an explicit instantiation because of the repo file. */ |
2aaf816d | 10326 | if (DECL_INTERFACE_KNOWN (result) && !extern_p && !flag_use_repository) |
33bd39a2 | 10327 | pedwarn ("duplicate explicit instantiation of `%#D'", result); |
03d0f4af MM |
10328 | |
10329 | /* If we've already instantiated the template, just return now. */ | |
10330 | if (DECL_INTERFACE_KNOWN (result)) | |
10331 | return; | |
10332 | } | |
10333 | else if (!DECL_IMPLICIT_INSTANTIATION (result)) | |
faae18ab | 10334 | { |
33bd39a2 | 10335 | error ("no matching template for `%D' found", result); |
faae18ab MS |
10336 | return; |
10337 | } | |
03d0f4af | 10338 | else if (!DECL_TEMPLATE_INFO (result)) |
6633d636 | 10339 | { |
33bd39a2 | 10340 | pedwarn ("explicit instantiation of non-template `%#D'", result); |
6633d636 MS |
10341 | return; |
10342 | } | |
10343 | ||
a0a33927 MS |
10344 | if (flag_external_templates) |
10345 | return; | |
10346 | ||
f0e01782 | 10347 | if (storage == NULL_TREE) |
00595019 | 10348 | ; |
faae18ab | 10349 | else if (storage == ridpointers[(int) RID_EXTERN]) |
03d0f4af | 10350 | { |
c02f5e29 | 10351 | if (pedantic && !in_system_header) |
33bd39a2 | 10352 | pedwarn ("ISO C++ forbids the use of `extern' on explicit instantiations"); |
03d0f4af MM |
10353 | extern_p = 1; |
10354 | } | |
f0e01782 | 10355 | else |
33bd39a2 | 10356 | error ("storage class `%D' applied to template instantiation", |
f0e01782 | 10357 | storage); |
5566b478 | 10358 | |
03d0f4af | 10359 | SET_DECL_EXPLICIT_INSTANTIATION (result); |
5566b478 | 10360 | mark_decl_instantiated (result, extern_p); |
44a8d0b3 | 10361 | repo_template_instantiated (result, extern_p); |
c91a56d2 | 10362 | if (! extern_p) |
16d53b64 | 10363 | instantiate_decl (result, /*defer_ok=*/1); |
7177d104 MS |
10364 | } |
10365 | ||
faae18ab | 10366 | void |
3a978d72 | 10367 | mark_class_instantiated (tree t, int extern_p) |
faae18ab MS |
10368 | { |
10369 | SET_CLASSTYPE_EXPLICIT_INSTANTIATION (t); | |
eb773359 JM |
10370 | SET_CLASSTYPE_INTERFACE_KNOWN (t); |
10371 | CLASSTYPE_INTERFACE_ONLY (t) = extern_p; | |
faae18ab MS |
10372 | TYPE_DECL_SUPPRESS_DEBUG (TYPE_NAME (t)) = extern_p; |
10373 | if (! extern_p) | |
10374 | { | |
10375 | CLASSTYPE_DEBUG_REQUESTED (t) = 1; | |
10376 | rest_of_type_compilation (t, 1); | |
10377 | } | |
10378 | } | |
e8abc66f | 10379 | |
5e0c54e5 | 10380 | /* Called from do_type_instantiation through binding_table_foreach to |
9bcb9aae | 10381 | do recursive instantiation for the type bound in ENTRY. */ |
5e0c54e5 GDR |
10382 | static void |
10383 | bt_instantiate_type_proc (binding_entry entry, void *data) | |
10384 | { | |
10385 | tree storage = *(tree *) data; | |
10386 | ||
10387 | if (IS_AGGR_TYPE (entry->type) | |
10388 | && !uses_template_parms (CLASSTYPE_TI_ARGS (entry->type))) | |
10389 | do_type_instantiation (TYPE_MAIN_DECL (entry->type), storage, 0); | |
10390 | } | |
10391 | ||
a1bcc528 JM |
10392 | /* Perform an explicit instantiation of template class T. STORAGE, if |
10393 | non-null, is the RID for extern, inline or static. COMPLAIN is | |
838dfd8a | 10394 | nonzero if this is called from the parser, zero if called recursively, |
a1bcc528 JM |
10395 | since the standard is unclear (as detailed below). */ |
10396 | ||
7177d104 | 10397 | void |
3a978d72 | 10398 | do_type_instantiation (tree t, tree storage, tsubst_flags_t complain) |
7177d104 | 10399 | { |
e8abc66f MS |
10400 | int extern_p = 0; |
10401 | int nomem_p = 0; | |
5566b478 MS |
10402 | int static_p = 0; |
10403 | ||
ca79f85d JM |
10404 | if (TREE_CODE (t) == TYPE_DECL) |
10405 | t = TREE_TYPE (t); | |
10406 | ||
7ddedda4 | 10407 | if (! CLASS_TYPE_P (t) || ! CLASSTYPE_TEMPLATE_INFO (t)) |
ca79f85d | 10408 | { |
33bd39a2 | 10409 | error ("explicit instantiation of non-template type `%T'", t); |
ca79f85d JM |
10410 | return; |
10411 | } | |
10412 | ||
5566b478 | 10413 | complete_type (t); |
7177d104 | 10414 | |
a292b002 MS |
10415 | /* With -fexternal-templates, explicit instantiations are treated the same |
10416 | as implicit ones. */ | |
a0a33927 MS |
10417 | if (flag_external_templates) |
10418 | return; | |
10419 | ||
d0f062fb | 10420 | if (!COMPLETE_TYPE_P (t)) |
f0e01782 | 10421 | { |
c2ea3a40 | 10422 | if (complain & tf_error) |
33bd39a2 | 10423 | error ("explicit instantiation of `%#T' before definition of template", |
a1bcc528 | 10424 | t); |
f0e01782 MS |
10425 | return; |
10426 | } | |
10427 | ||
03d0f4af | 10428 | if (storage != NULL_TREE) |
f0e01782 | 10429 | { |
c02f5e29 | 10430 | if (pedantic && !in_system_header) |
33bd39a2 | 10431 | pedwarn("ISO C++ forbids the use of `%s' on explicit instantiations", |
8251199e | 10432 | IDENTIFIER_POINTER (storage)); |
03d0f4af MM |
10433 | |
10434 | if (storage == ridpointers[(int) RID_INLINE]) | |
10435 | nomem_p = 1; | |
10436 | else if (storage == ridpointers[(int) RID_EXTERN]) | |
10437 | extern_p = 1; | |
10438 | else if (storage == ridpointers[(int) RID_STATIC]) | |
10439 | static_p = 1; | |
10440 | else | |
10441 | { | |
33bd39a2 | 10442 | error ("storage class `%D' applied to template instantiation", |
03d0f4af MM |
10443 | storage); |
10444 | extern_p = 0; | |
10445 | } | |
f0e01782 MS |
10446 | } |
10447 | ||
370af2d5 | 10448 | if (CLASSTYPE_TEMPLATE_SPECIALIZATION (t)) |
03d0f4af | 10449 | { |
07782718 | 10450 | /* DR 259 [temp.spec]. |
a292b002 | 10451 | |
07782718 KL |
10452 | Both an explicit instantiation and a declaration of an explicit |
10453 | specialization shall not appear in a program unless the explicit | |
10454 | instantiation follows a declaration of the explicit specialization. | |
10455 | ||
10456 | For a given set of template parameters, if an explicit | |
10457 | instantiation of a template appears after a declaration of an | |
10458 | explicit specialization for that template, the explicit | |
10459 | instantiation has no effect. */ | |
03d0f4af MM |
10460 | return; |
10461 | } | |
10462 | else if (CLASSTYPE_EXPLICIT_INSTANTIATION (t)) | |
44a8d0b3 | 10463 | { |
03d0f4af MM |
10464 | /* [temp.spec] |
10465 | ||
10466 | No program shall explicitly instantiate any template more | |
10467 | than once. | |
10468 | ||
2aaf816d JM |
10469 | If CLASSTYPE_INTERFACE_ONLY, then the first explicit instantiation |
10470 | was `extern'. If EXTERN_P then the second is. If -frepo, chances | |
aba649ba | 10471 | are we already got marked as an explicit instantiation because of the |
2aaf816d | 10472 | repo file. All these cases are OK. */ |
a1bcc528 | 10473 | if (!CLASSTYPE_INTERFACE_ONLY (t) && !extern_p && !flag_use_repository |
c2ea3a40 | 10474 | && (complain & tf_error)) |
33bd39a2 | 10475 | pedwarn ("duplicate explicit instantiation of `%#T'", t); |
03d0f4af MM |
10476 | |
10477 | /* If we've already instantiated the template, just return now. */ | |
10478 | if (!CLASSTYPE_INTERFACE_ONLY (t)) | |
10479 | return; | |
44a8d0b3 | 10480 | } |
e8abc66f | 10481 | |
03d0f4af MM |
10482 | mark_class_instantiated (t, extern_p); |
10483 | repo_template_instantiated (t, extern_p); | |
10484 | ||
e8abc66f MS |
10485 | if (nomem_p) |
10486 | return; | |
10487 | ||
7177d104 | 10488 | { |
db5ae43f | 10489 | tree tmp; |
5566b478 | 10490 | |
03d0f4af MM |
10491 | /* In contrast to implicit instantiation, where only the |
10492 | declarations, and not the definitions, of members are | |
10493 | instantiated, we have here: | |
10494 | ||
10495 | [temp.explicit] | |
10496 | ||
10497 | The explicit instantiation of a class template specialization | |
10498 | implies the instantiation of all of its members not | |
10499 | previously explicitly specialized in the translation unit | |
10500 | containing the explicit instantiation. | |
10501 | ||
10502 | Of course, we can't instantiate member template classes, since | |
10503 | we don't have any arguments for them. Note that the standard | |
dc957d14 | 10504 | is unclear on whether the instantiation of the members are |
03d0f4af MM |
10505 | *explicit* instantiations or not. We choose to be generous, |
10506 | and not set DECL_EXPLICIT_INSTANTIATION. Therefore, we allow | |
10507 | the explicit instantiation of a class where some of the members | |
10508 | have no definition in the current translation unit. */ | |
10509 | ||
5566b478 MS |
10510 | if (! static_p) |
10511 | for (tmp = TYPE_METHODS (t); tmp; tmp = TREE_CHAIN (tmp)) | |
a7d87521 | 10512 | if (TREE_CODE (tmp) == FUNCTION_DECL |
1f109f0f | 10513 | && DECL_TEMPLATE_INSTANTIATION (tmp)) |
5566b478 MS |
10514 | { |
10515 | mark_decl_instantiated (tmp, extern_p); | |
10516 | repo_template_instantiated (tmp, extern_p); | |
10517 | if (! extern_p) | |
16d53b64 | 10518 | instantiate_decl (tmp, /*defer_ok=*/1); |
5566b478 MS |
10519 | } |
10520 | ||
10521 | for (tmp = TYPE_FIELDS (t); tmp; tmp = TREE_CHAIN (tmp)) | |
10522 | if (TREE_CODE (tmp) == VAR_DECL && DECL_TEMPLATE_INSTANTIATION (tmp)) | |
863adfc0 | 10523 | { |
5566b478 | 10524 | mark_decl_instantiated (tmp, extern_p); |
863adfc0 | 10525 | repo_template_instantiated (tmp, extern_p); |
5566b478 | 10526 | if (! extern_p) |
16d53b64 | 10527 | instantiate_decl (tmp, /*defer_ok=*/1); |
863adfc0 | 10528 | } |
7177d104 | 10529 | |
5e0c54e5 GDR |
10530 | if (CLASSTYPE_NESTED_UTDS (t)) |
10531 | binding_table_foreach (CLASSTYPE_NESTED_UTDS (t), | |
10532 | bt_instantiate_type_proc, &storage); | |
a292b002 | 10533 | } |
8d08fdba | 10534 | } |
a28e3c7f | 10535 | |
36a117a5 MM |
10536 | /* Given a function DECL, which is a specialization of TMPL, modify |
10537 | DECL to be a re-instantiation of TMPL with the same template | |
10538 | arguments. TMPL should be the template into which tsubst'ing | |
10539 | should occur for DECL, not the most general template. | |
830bfa74 MM |
10540 | |
10541 | One reason for doing this is a scenario like this: | |
10542 | ||
10543 | template <class T> | |
10544 | void f(const T&, int i); | |
10545 | ||
10546 | void g() { f(3, 7); } | |
10547 | ||
10548 | template <class T> | |
10549 | void f(const T& t, const int i) { } | |
10550 | ||
10551 | Note that when the template is first instantiated, with | |
10552 | instantiate_template, the resulting DECL will have no name for the | |
10553 | first parameter, and the wrong type for the second. So, when we go | |
10554 | to instantiate the DECL, we regenerate it. */ | |
10555 | ||
e9659ab0 | 10556 | static void |
3a978d72 | 10557 | regenerate_decl_from_template (tree decl, tree tmpl) |
830bfa74 | 10558 | { |
f9a7ae04 MM |
10559 | /* The most general version of TMPL. */ |
10560 | tree gen_tmpl; | |
10561 | /* The arguments used to instantiate DECL, from the most general | |
10562 | template. */ | |
830bfa74 | 10563 | tree args; |
830bfa74 MM |
10564 | tree code_pattern; |
10565 | tree new_decl; | |
b3445994 | 10566 | bool unregistered; |
830bfa74 MM |
10567 | |
10568 | args = DECL_TI_ARGS (decl); | |
10569 | code_pattern = DECL_TEMPLATE_RESULT (tmpl); | |
10570 | ||
8251199e JM |
10571 | /* Unregister the specialization so that when we tsubst we will not |
10572 | just return DECL. We don't have to unregister DECL from TMPL | |
10573 | because if would only be registered there if it were a partial | |
10574 | instantiation of a specialization, which it isn't: it's a full | |
10575 | instantiation. */ | |
36a117a5 | 10576 | gen_tmpl = most_general_template (tmpl); |
b3445994 MM |
10577 | unregistered = reregister_specialization (decl, gen_tmpl, |
10578 | /*new_spec=*/NULL_TREE); | |
36a117a5 MM |
10579 | |
10580 | /* If the DECL was not unregistered then something peculiar is | |
10581 | happening: we created a specialization but did not call | |
10582 | register_specialization for it. */ | |
10583 | my_friendly_assert (unregistered, 0); | |
10584 | ||
2b907f5c KL |
10585 | /* Make sure that we can see identifiers, and compute access |
10586 | correctly. */ | |
10587 | push_access_scope (decl); | |
10588 | ||
d8c4447d | 10589 | /* Do the substitution to get the new declaration. */ |
c2ea3a40 | 10590 | new_decl = tsubst (code_pattern, args, tf_error, NULL_TREE); |
830bfa74 MM |
10591 | |
10592 | if (TREE_CODE (decl) == VAR_DECL) | |
10593 | { | |
10594 | /* Set up DECL_INITIAL, since tsubst doesn't. */ | |
17bbb839 MM |
10595 | if (!DECL_INITIALIZED_IN_CLASS_P (decl)) |
10596 | DECL_INITIAL (new_decl) = | |
10597 | tsubst_expr (DECL_INITIAL (code_pattern), args, | |
10598 | tf_error, DECL_TI_TEMPLATE (decl)); | |
830bfa74 | 10599 | } |
2b0a63a3 | 10600 | else if (TREE_CODE (decl) == FUNCTION_DECL) |
fbf1c34b MM |
10601 | { |
10602 | /* Convince duplicate_decls to use the DECL_ARGUMENTS from the | |
10603 | new decl. */ | |
10604 | DECL_INITIAL (new_decl) = error_mark_node; | |
10605 | /* And don't complain about a duplicate definition. */ | |
10606 | DECL_INITIAL (decl) = NULL_TREE; | |
10607 | } | |
36a117a5 | 10608 | |
2b59fc25 | 10609 | pop_access_scope (decl); |
0e902d98 | 10610 | |
36a117a5 MM |
10611 | /* The immediate parent of the new template is still whatever it was |
10612 | before, even though tsubst sets DECL_TI_TEMPLATE up as the most | |
10613 | general template. We also reset the DECL_ASSEMBLER_NAME since | |
10614 | tsubst always calculates the name as if the function in question | |
10615 | were really a template instance, and sometimes, with friend | |
10616 | functions, this is not so. See tsubst_friend_function for | |
10617 | details. */ | |
10618 | DECL_TI_TEMPLATE (new_decl) = DECL_TI_TEMPLATE (decl); | |
92643fea | 10619 | COPY_DECL_ASSEMBLER_NAME (decl, new_decl); |
19e7881c | 10620 | COPY_DECL_RTL (decl, new_decl); |
459c43ad | 10621 | DECL_USE_TEMPLATE (new_decl) = DECL_USE_TEMPLATE (decl); |
36a117a5 MM |
10622 | |
10623 | /* Call duplicate decls to merge the old and new declarations. */ | |
830bfa74 MM |
10624 | duplicate_decls (new_decl, decl); |
10625 | ||
36a117a5 MM |
10626 | /* Now, re-register the specialization. */ |
10627 | register_specialization (decl, gen_tmpl, args); | |
830bfa74 MM |
10628 | } |
10629 | ||
a723baf1 MM |
10630 | /* Return the TEMPLATE_DECL into which DECL_TI_ARGS(DECL) should be |
10631 | substituted to get DECL. */ | |
10632 | ||
d58b7c2d | 10633 | tree |
a723baf1 MM |
10634 | template_for_substitution (tree decl) |
10635 | { | |
10636 | tree tmpl = DECL_TI_TEMPLATE (decl); | |
10637 | ||
10638 | /* Set TMPL to the template whose DECL_TEMPLATE_RESULT is the pattern | |
10639 | for the instantiation. This is not always the most general | |
10640 | template. Consider, for example: | |
10641 | ||
10642 | template <class T> | |
10643 | struct S { template <class U> void f(); | |
10644 | template <> void f<int>(); }; | |
10645 | ||
10646 | and an instantiation of S<double>::f<int>. We want TD to be the | |
10647 | specialization S<T>::f<int>, not the more general S<T>::f<U>. */ | |
10648 | while (/* An instantiation cannot have a definition, so we need a | |
10649 | more general template. */ | |
10650 | DECL_TEMPLATE_INSTANTIATION (tmpl) | |
10651 | /* We must also deal with friend templates. Given: | |
10652 | ||
10653 | template <class T> struct S { | |
10654 | template <class U> friend void f() {}; | |
10655 | }; | |
10656 | ||
10657 | S<int>::f<U> say, is not an instantiation of S<T>::f<U>, | |
10658 | so far as the language is concerned, but that's still | |
10659 | where we get the pattern for the instantiation from. On | |
10660 | other hand, if the definition comes outside the class, say: | |
10661 | ||
10662 | template <class T> struct S { | |
10663 | template <class U> friend void f(); | |
10664 | }; | |
10665 | template <class U> friend void f() {} | |
10666 | ||
10667 | we don't need to look any further. That's what the check for | |
10668 | DECL_INITIAL is for. */ | |
10669 | || (TREE_CODE (decl) == FUNCTION_DECL | |
10670 | && DECL_FRIEND_PSEUDO_TEMPLATE_INSTANTIATION (tmpl) | |
10671 | && !DECL_INITIAL (DECL_TEMPLATE_RESULT (tmpl)))) | |
10672 | { | |
10673 | /* The present template, TD, should not be a definition. If it | |
10674 | were a definition, we should be using it! Note that we | |
10675 | cannot restructure the loop to just keep going until we find | |
10676 | a template with a definition, since that might go too far if | |
10677 | a specialization was declared, but not defined. */ | |
10678 | my_friendly_assert (!(TREE_CODE (decl) == VAR_DECL | |
10679 | && !DECL_IN_AGGR_P (DECL_TEMPLATE_RESULT (tmpl))), | |
10680 | 0); | |
10681 | ||
10682 | /* Fetch the more general template. */ | |
10683 | tmpl = DECL_TI_TEMPLATE (tmpl); | |
10684 | } | |
10685 | ||
10686 | return tmpl; | |
10687 | } | |
10688 | ||
16d53b64 | 10689 | /* Produce the definition of D, a _DECL generated from a template. If |
838dfd8a | 10690 | DEFER_OK is nonzero, then we don't have to actually do the |
16d53b64 | 10691 | instantiation now; we just have to do it sometime. */ |
f84b4be9 | 10692 | |
a28e3c7f | 10693 | tree |
3a978d72 | 10694 | instantiate_decl (tree d, int defer_ok) |
a28e3c7f | 10695 | { |
36a117a5 | 10696 | tree tmpl = DECL_TI_TEMPLATE (d); |
65f8b0fb MM |
10697 | tree gen_args; |
10698 | tree args; | |
830bfa74 | 10699 | tree td; |
36a117a5 MM |
10700 | tree code_pattern; |
10701 | tree spec; | |
10702 | tree gen_tmpl; | |
5566b478 | 10703 | int pattern_defined; |
31a714f6 | 10704 | int need_push; |
82a98427 NS |
10705 | location_t saved_loc = input_location; |
10706 | ||
36a117a5 MM |
10707 | /* This function should only be used to instantiate templates for |
10708 | functions and static member variables. */ | |
10709 | my_friendly_assert (TREE_CODE (d) == FUNCTION_DECL | |
10710 | || TREE_CODE (d) == VAR_DECL, 0); | |
10711 | ||
cec24319 MM |
10712 | /* Variables are never deferred; if instantiation is required, they |
10713 | are instantiated right away. That allows for better code in the | |
10714 | case that an expression refers to the value of the variable -- | |
10715 | if the variable has a constant value the referring expression can | |
10716 | take advantage of that fact. */ | |
10717 | if (TREE_CODE (d) == VAR_DECL) | |
10718 | defer_ok = 0; | |
10719 | ||
db9b2174 MM |
10720 | /* Don't instantiate cloned functions. Instead, instantiate the |
10721 | functions they cloned. */ | |
10722 | if (TREE_CODE (d) == FUNCTION_DECL && DECL_CLONED_FUNCTION_P (d)) | |
10723 | d = DECL_CLONED_FUNCTION (d); | |
10724 | ||
fbf1c34b | 10725 | if (DECL_TEMPLATE_INSTANTIATED (d)) |
03d0f4af | 10726 | /* D has already been instantiated. It might seem reasonable to |
dc957d14 | 10727 | check whether or not D is an explicit instantiation, and, if so, |
03d0f4af MM |
10728 | stop here. But when an explicit instantiation is deferred |
10729 | until the end of the compilation, DECL_EXPLICIT_INSTANTIATION | |
10730 | is set, even though we still need to do the instantiation. */ | |
36a117a5 MM |
10731 | return d; |
10732 | ||
10733 | /* If we already have a specialization of this declaration, then | |
10734 | there's no reason to instantiate it. Note that | |
10735 | retrieve_specialization gives us both instantiations and | |
10736 | specializations, so we must explicitly check | |
10737 | DECL_TEMPLATE_SPECIALIZATION. */ | |
10738 | gen_tmpl = most_general_template (tmpl); | |
65f8b0fb MM |
10739 | gen_args = DECL_TI_ARGS (d); |
10740 | spec = retrieve_specialization (gen_tmpl, gen_args); | |
36a117a5 MM |
10741 | if (spec != NULL_TREE && DECL_TEMPLATE_SPECIALIZATION (spec)) |
10742 | return spec; | |
10743 | ||
10744 | /* This needs to happen before any tsubsting. */ | |
10745 | if (! push_tinst_level (d)) | |
10746 | return d; | |
10747 | ||
297a5329 JM |
10748 | timevar_push (TV_PARSE); |
10749 | ||
c1f927e8 | 10750 | /* We may be in the middle of deferred access check. Disable it now. */ |
7d021397 KL |
10751 | push_deferring_access_checks (dk_no_deferred); |
10752 | ||
c1f927e8 RH |
10753 | /* Our caller does not expect collection to happen, which it might if |
10754 | we decide to compile the function to rtl now. Arrange for a new | |
10755 | gc context to be created if so. */ | |
10756 | function_depth++; | |
10757 | ||
4d85e00e | 10758 | /* Set TD to the template whose DECL_TEMPLATE_RESULT is the pattern |
a723baf1 MM |
10759 | for the instantiation. */ |
10760 | td = template_for_substitution (d); | |
fee23f54 | 10761 | code_pattern = DECL_TEMPLATE_RESULT (td); |
27bb8339 | 10762 | |
76d3baad KL |
10763 | if ((DECL_NAMESPACE_SCOPE_P (d) && !DECL_INITIALIZED_IN_CLASS_P (d)) |
10764 | || DECL_TEMPLATE_SPECIALIZATION (td)) | |
649fc72d NS |
10765 | /* In the case of a friend template whose definition is provided |
10766 | outside the class, we may have too many arguments. Drop the | |
76d3baad | 10767 | ones we don't need. The same is true for specializations. */ |
649fc72d NS |
10768 | args = get_innermost_template_args |
10769 | (gen_args, TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (td))); | |
10770 | else | |
10771 | args = gen_args; | |
65f8b0fb | 10772 | |
5566b478 | 10773 | if (TREE_CODE (d) == FUNCTION_DECL) |
39c76b4f | 10774 | pattern_defined = (DECL_SAVED_TREE (code_pattern) != NULL_TREE); |
5566b478 | 10775 | else |
36a117a5 | 10776 | pattern_defined = ! DECL_IN_AGGR_P (code_pattern); |
de22184b | 10777 | |
f31686a3 | 10778 | input_location = DECL_SOURCE_LOCATION (d); |
de22184b | 10779 | |
de22184b | 10780 | if (pattern_defined) |
5566b478 | 10781 | { |
7e9abee9 MM |
10782 | /* Let the repository code that this template definition is |
10783 | available. | |
10784 | ||
10785 | The repository doesn't need to know about cloned functions | |
10786 | because they never actually show up in the object file. It | |
10787 | does need to know about the clones; those are the symbols | |
10788 | that the linker will be emitting error messages about. */ | |
10789 | if (DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (d) | |
10790 | || DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (d)) | |
10791 | { | |
10792 | tree t; | |
10793 | ||
10794 | for (t = TREE_CHAIN (d); | |
10795 | t && DECL_CLONED_FUNCTION_P (t); | |
10796 | t = TREE_CHAIN (t)) | |
10797 | repo_template_used (t); | |
10798 | } | |
10799 | else | |
10800 | repo_template_used (d); | |
5566b478 MS |
10801 | |
10802 | if (flag_external_templates && ! DECL_INTERFACE_KNOWN (d)) | |
10803 | { | |
10804 | if (flag_alt_external_templates) | |
10805 | { | |
10806 | if (interface_unknown) | |
10807 | warn_if_unknown_interface (d); | |
10808 | } | |
fee23f54 | 10809 | else if (DECL_INTERFACE_KNOWN (code_pattern)) |
5566b478 MS |
10810 | { |
10811 | DECL_INTERFACE_KNOWN (d) = 1; | |
fee23f54 | 10812 | DECL_NOT_REALLY_EXTERN (d) = ! DECL_EXTERNAL (code_pattern); |
5566b478 MS |
10813 | } |
10814 | else | |
fee23f54 | 10815 | warn_if_unknown_interface (code_pattern); |
5566b478 MS |
10816 | } |
10817 | ||
e92cc029 | 10818 | if (at_eof) |
5566b478 MS |
10819 | import_export_decl (d); |
10820 | } | |
10821 | ||
4f2b0fb2 NS |
10822 | if (!defer_ok) |
10823 | { | |
10824 | /* Recheck the substitutions to obtain any warning messages | |
10825 | about ignoring cv qualifiers. */ | |
10826 | tree gen = DECL_TEMPLATE_RESULT (gen_tmpl); | |
10827 | tree type = TREE_TYPE (gen); | |
10828 | ||
0e902d98 | 10829 | /* Make sure that we can see identifiers, and compute access |
2b59fc25 KL |
10830 | correctly. D is already the target FUNCTION_DECL with the |
10831 | right context. */ | |
10832 | push_access_scope (d); | |
0e902d98 | 10833 | |
4f2b0fb2 NS |
10834 | if (TREE_CODE (gen) == FUNCTION_DECL) |
10835 | { | |
65f8b0fb MM |
10836 | tsubst (DECL_ARGUMENTS (gen), gen_args, tf_error | tf_warning, d); |
10837 | tsubst (TYPE_RAISES_EXCEPTIONS (type), gen_args, | |
4f2b0fb2 NS |
10838 | tf_error | tf_warning, d); |
10839 | /* Don't simply tsubst the function type, as that will give | |
10840 | duplicate warnings about poor parameter qualifications. | |
10841 | The function arguments are the same as the decl_arguments | |
c6002625 | 10842 | without the top level cv qualifiers. */ |
4f2b0fb2 NS |
10843 | type = TREE_TYPE (type); |
10844 | } | |
65f8b0fb | 10845 | tsubst (type, gen_args, tf_error | tf_warning, d); |
0e902d98 | 10846 | |
2b59fc25 | 10847 | pop_access_scope (d); |
4f2b0fb2 NS |
10848 | } |
10849 | ||
46ccf50a JM |
10850 | if (TREE_CODE (d) == VAR_DECL && DECL_INITIALIZED_IN_CLASS_P (d) |
10851 | && DECL_INITIAL (d) == NULL_TREE) | |
10852 | /* We should have set up DECL_INITIAL in instantiate_class_template. */ | |
10853 | abort (); | |
930cd796 MM |
10854 | /* Reject all external templates except inline functions. */ |
10855 | else if (DECL_INTERFACE_KNOWN (d) | |
10856 | && ! DECL_NOT_REALLY_EXTERN (d) | |
4f8e1232 MM |
10857 | && ! (TREE_CODE (d) == FUNCTION_DECL |
10858 | && DECL_INLINE (d))) | |
930cd796 | 10859 | goto out; |
16d53b64 MM |
10860 | /* Defer all other templates, unless we have been explicitly |
10861 | forbidden from doing so. We restore the source position here | |
10862 | because it's used by add_pending_template. */ | |
10863 | else if (! pattern_defined || defer_ok) | |
10864 | { | |
82a98427 | 10865 | input_location = saved_loc; |
c27be9b9 | 10866 | |
03d0f4af MM |
10867 | if (at_eof && !pattern_defined |
10868 | && DECL_EXPLICIT_INSTANTIATION (d)) | |
10869 | /* [temp.explicit] | |
10870 | ||
10871 | The definition of a non-exported function template, a | |
10872 | non-exported member function template, or a non-exported | |
10873 | member function or static data member of a class template | |
10874 | shall be present in every translation unit in which it is | |
10875 | explicitly instantiated. */ | |
33bd39a2 | 10876 | pedwarn |
46ccf50a | 10877 | ("explicit instantiation of `%D' but no definition available", d); |
03d0f4af | 10878 | |
5566b478 | 10879 | add_pending_template (d); |
de22184b | 10880 | goto out; |
5566b478 MS |
10881 | } |
10882 | ||
31a714f6 MM |
10883 | need_push = !global_bindings_p (); |
10884 | if (need_push) | |
10885 | push_to_top_level (); | |
414ea4aa | 10886 | |
2b0a63a3 MM |
10887 | /* Regenerate the declaration in case the template has been modified |
10888 | by a subsequent redeclaration. */ | |
10889 | regenerate_decl_from_template (d, td); | |
1d62c33e | 10890 | |
120722ac | 10891 | /* We already set the file and line above. Reset them now in case |
82a98427 NS |
10892 | they changed as a result of calling |
10893 | regenerate_decl_from_template. */ | |
f31686a3 | 10894 | input_location = DECL_SOURCE_LOCATION (d); |
5156628f | 10895 | |
5566b478 MS |
10896 | if (TREE_CODE (d) == VAR_DECL) |
10897 | { | |
1d62c33e MM |
10898 | /* Clear out DECL_RTL; whatever was there before may not be right |
10899 | since we've reset the type of the declaration. */ | |
10900 | SET_DECL_RTL (d, NULL_RTX); | |
10901 | ||
5566b478 | 10902 | DECL_IN_AGGR_P (d) = 0; |
b2dd096b MM |
10903 | import_export_decl (d); |
10904 | DECL_EXTERNAL (d) = ! DECL_NOT_REALLY_EXTERN (d); | |
ea56c40c MM |
10905 | |
10906 | if (DECL_EXTERNAL (d)) | |
10907 | { | |
10908 | /* The fact that this code is executing indicates that: | |
10909 | ||
10910 | (1) D is a template static data member, for which a | |
10911 | definition is available. | |
10912 | ||
34cd5ae7 | 10913 | (2) An implicit or explicit instantiation has occurred. |
ea56c40c MM |
10914 | |
10915 | (3) We are not going to emit a definition of the static | |
10916 | data member at this time. | |
10917 | ||
10918 | This situation is peculiar, but it occurs on platforms | |
10919 | without weak symbols when performing an implicit | |
10920 | instantiation. There, we cannot implicitly instantiate a | |
10921 | defined static data member in more than one translation | |
10922 | unit, so import_export_decl marks the declaration as | |
10923 | external; we must rely on explicit instantiation. */ | |
10924 | } | |
10925 | else | |
10926 | { | |
10927 | /* Mark D as instantiated so that recursive calls to | |
10928 | instantiate_decl do not try to instantiate it again. */ | |
10929 | DECL_TEMPLATE_INSTANTIATED (d) = 1; | |
10930 | cp_finish_decl (d, | |
10931 | (!DECL_INITIALIZED_IN_CLASS_P (d) | |
10932 | ? DECL_INITIAL (d) : NULL_TREE), | |
10933 | NULL_TREE, 0); | |
10934 | } | |
5566b478 MS |
10935 | } |
10936 | else if (TREE_CODE (d) == FUNCTION_DECL) | |
10937 | { | |
6bbf1598 | 10938 | htab_t saved_local_specializations; |
a723baf1 MM |
10939 | tree subst_decl; |
10940 | tree tmpl_parm; | |
10941 | tree spec_parm; | |
6bbf1598 | 10942 | |
ea56c40c MM |
10943 | /* Mark D as instantiated so that recursive calls to |
10944 | instantiate_decl do not try to instantiate it again. */ | |
10945 | DECL_TEMPLATE_INSTANTIATED (d) = 1; | |
10946 | ||
6bbf1598 MM |
10947 | /* Save away the current list, in case we are instantiating one |
10948 | template from within the body of another. */ | |
10949 | saved_local_specializations = local_specializations; | |
10950 | ||
6dfbb909 | 10951 | /* Set up the list of local specializations. */ |
6dfbb909 | 10952 | local_specializations = htab_create (37, |
69f794a7 | 10953 | hash_local_specialization, |
a723baf1 | 10954 | eq_local_specializations, |
6dfbb909 MM |
10955 | NULL); |
10956 | ||
558475f0 | 10957 | /* Set up context. */ |
0b50d7f1 | 10958 | import_export_decl (d); |
a8f73d4b | 10959 | start_function (NULL_TREE, d, NULL_TREE, SF_PRE_PARSED); |
5566b478 | 10960 | |
a723baf1 MM |
10961 | /* Create substitution entries for the parameters. */ |
10962 | subst_decl = DECL_TEMPLATE_RESULT (template_for_substitution (d)); | |
10963 | tmpl_parm = DECL_ARGUMENTS (subst_decl); | |
10964 | spec_parm = DECL_ARGUMENTS (d); | |
10965 | if (DECL_NONSTATIC_MEMBER_FUNCTION_P (d)) | |
10966 | { | |
10967 | register_local_specialization (spec_parm, tmpl_parm); | |
10968 | spec_parm = skip_artificial_parms_for (d, spec_parm); | |
10969 | tmpl_parm = skip_artificial_parms_for (subst_decl, tmpl_parm); | |
10970 | } | |
10971 | while (tmpl_parm) | |
10972 | { | |
10973 | register_local_specialization (spec_parm, tmpl_parm); | |
10974 | tmpl_parm = TREE_CHAIN (tmpl_parm); | |
10975 | spec_parm = TREE_CHAIN (spec_parm); | |
10976 | } | |
10977 | my_friendly_assert (!spec_parm, 20020813); | |
10978 | ||
558475f0 MM |
10979 | /* Substitute into the body of the function. */ |
10980 | tsubst_expr (DECL_SAVED_TREE (code_pattern), args, | |
c2ea3a40 | 10981 | tf_error | tf_warning, tmpl); |
558475f0 | 10982 | |
6dfbb909 MM |
10983 | /* We don't need the local specializations any more. */ |
10984 | htab_delete (local_specializations); | |
6bbf1598 | 10985 | local_specializations = saved_local_specializations; |
6dfbb909 | 10986 | |
4d6abc1c | 10987 | /* Finish the function. */ |
b2dd096b | 10988 | d = finish_function (0); |
8cd2462c | 10989 | expand_or_defer_fn (d); |
5566b478 MS |
10990 | } |
10991 | ||
971cbc14 MM |
10992 | /* We're not deferring instantiation any more. */ |
10993 | TI_PENDING_TEMPLATE_FLAG (DECL_TEMPLATE_INFO (d)) = 0; | |
10994 | ||
31a714f6 MM |
10995 | if (need_push) |
10996 | pop_from_top_level (); | |
414ea4aa | 10997 | |
de22184b | 10998 | out: |
82a98427 | 10999 | input_location = saved_loc; |
7d021397 | 11000 | pop_deferring_access_checks (); |
5566b478 | 11001 | pop_tinst_level (); |
c1f927e8 | 11002 | function_depth--; |
a28e3c7f | 11003 | |
297a5329 JM |
11004 | timevar_pop (TV_PARSE); |
11005 | ||
a28e3c7f MS |
11006 | return d; |
11007 | } | |
5566b478 | 11008 | |
0aafb128 MM |
11009 | /* Run through the list of templates that we wish we could |
11010 | instantiate, and instantiate any we can. */ | |
11011 | ||
11012 | int | |
3a978d72 | 11013 | instantiate_pending_templates (void) |
0aafb128 MM |
11014 | { |
11015 | tree *t; | |
46ccf50a | 11016 | tree last = NULL_TREE; |
0aafb128 MM |
11017 | int instantiated_something = 0; |
11018 | int reconsider; | |
11019 | ||
11020 | do | |
11021 | { | |
11022 | reconsider = 0; | |
11023 | ||
11024 | t = &pending_templates; | |
11025 | while (*t) | |
11026 | { | |
0aafb128 MM |
11027 | tree instantiation = TREE_VALUE (*t); |
11028 | ||
3ae18eaf | 11029 | reopen_tinst_level (TREE_PURPOSE (*t)); |
0aafb128 | 11030 | |
2f939d94 | 11031 | if (TYPE_P (instantiation)) |
0aafb128 MM |
11032 | { |
11033 | tree fn; | |
11034 | ||
d0f062fb | 11035 | if (!COMPLETE_TYPE_P (instantiation)) |
0aafb128 MM |
11036 | { |
11037 | instantiate_class_template (instantiation); | |
11038 | if (CLASSTYPE_TEMPLATE_INSTANTIATION (instantiation)) | |
11039 | for (fn = TYPE_METHODS (instantiation); | |
11040 | fn; | |
11041 | fn = TREE_CHAIN (fn)) | |
11042 | if (! DECL_ARTIFICIAL (fn)) | |
16d53b64 | 11043 | instantiate_decl (fn, /*defer_ok=*/0); |
d0f062fb | 11044 | if (COMPLETE_TYPE_P (instantiation)) |
0aafb128 MM |
11045 | { |
11046 | instantiated_something = 1; | |
11047 | reconsider = 1; | |
11048 | } | |
11049 | } | |
11050 | ||
d0f062fb | 11051 | if (COMPLETE_TYPE_P (instantiation)) |
0aafb128 MM |
11052 | /* If INSTANTIATION has been instantiated, then we don't |
11053 | need to consider it again in the future. */ | |
11054 | *t = TREE_CHAIN (*t); | |
46ccf50a JM |
11055 | else |
11056 | { | |
11057 | last = *t; | |
11058 | t = &TREE_CHAIN (*t); | |
11059 | } | |
0aafb128 MM |
11060 | } |
11061 | else | |
11062 | { | |
16d53b64 | 11063 | if (!DECL_TEMPLATE_SPECIALIZATION (instantiation) |
0aafb128 MM |
11064 | && !DECL_TEMPLATE_INSTANTIATED (instantiation)) |
11065 | { | |
16d53b64 MM |
11066 | instantiation = instantiate_decl (instantiation, |
11067 | /*defer_ok=*/0); | |
0aafb128 MM |
11068 | if (DECL_TEMPLATE_INSTANTIATED (instantiation)) |
11069 | { | |
11070 | instantiated_something = 1; | |
11071 | reconsider = 1; | |
11072 | } | |
11073 | } | |
11074 | ||
16d53b64 | 11075 | if (DECL_TEMPLATE_SPECIALIZATION (instantiation) |
0aafb128 MM |
11076 | || DECL_TEMPLATE_INSTANTIATED (instantiation)) |
11077 | /* If INSTANTIATION has been instantiated, then we don't | |
11078 | need to consider it again in the future. */ | |
11079 | *t = TREE_CHAIN (*t); | |
46ccf50a JM |
11080 | else |
11081 | { | |
11082 | last = *t; | |
11083 | t = &TREE_CHAIN (*t); | |
11084 | } | |
0aafb128 | 11085 | } |
84e5ca0f NS |
11086 | tinst_depth = 0; |
11087 | current_tinst_level = NULL_TREE; | |
0aafb128 | 11088 | } |
46ccf50a | 11089 | last_pending_template = last; |
0aafb128 MM |
11090 | } |
11091 | while (reconsider); | |
11092 | ||
11093 | return instantiated_something; | |
11094 | } | |
11095 | ||
fd74ca0b MM |
11096 | /* Substitute ARGVEC into T, which is a list of initializers for |
11097 | either base class or a non-static data member. The TREE_PURPOSEs | |
11098 | are DECLs, and the TREE_VALUEs are the initializer values. Used by | |
11099 | instantiate_decl. */ | |
4393e105 | 11100 | |
824b9a4c | 11101 | static tree |
3a978d72 | 11102 | tsubst_initializer_list (tree t, tree argvec) |
5566b478 | 11103 | { |
2282d28d | 11104 | tree inits = NULL_TREE; |
5566b478 MS |
11105 | |
11106 | for (; t; t = TREE_CHAIN (t)) | |
11107 | { | |
fd74ca0b MM |
11108 | tree decl; |
11109 | tree init; | |
11110 | tree val; | |
11111 | ||
c2ea3a40 | 11112 | decl = tsubst_copy (TREE_PURPOSE (t), argvec, tf_error | tf_warning, |
fd74ca0b | 11113 | NULL_TREE); |
1f5a253a NS |
11114 | decl = expand_member_init (decl); |
11115 | if (decl && !DECL_P (decl)) | |
11116 | in_base_initializer = 1; | |
11117 | ||
c2ea3a40 | 11118 | init = tsubst_expr (TREE_VALUE (t), argvec, tf_error | tf_warning, |
fd74ca0b | 11119 | NULL_TREE); |
fd74ca0b MM |
11120 | if (!init) |
11121 | ; | |
11122 | else if (TREE_CODE (init) == TREE_LIST) | |
11123 | for (val = init; val; val = TREE_CHAIN (val)) | |
11124 | TREE_VALUE (val) = convert_from_reference (TREE_VALUE (val)); | |
2282d28d | 11125 | else if (init != void_type_node) |
fd74ca0b MM |
11126 | init = convert_from_reference (init); |
11127 | ||
1f5a253a NS |
11128 | in_base_initializer = 0; |
11129 | ||
11130 | if (decl) | |
2282d28d | 11131 | { |
1f5a253a | 11132 | init = build_tree_list (decl, init); |
2282d28d MM |
11133 | TREE_CHAIN (init) = inits; |
11134 | inits = init; | |
11135 | } | |
5566b478 | 11136 | } |
2282d28d | 11137 | return inits; |
5566b478 MS |
11138 | } |
11139 | ||
61a127b3 MM |
11140 | /* Set CURRENT_ACCESS_SPECIFIER based on the protection of DECL. */ |
11141 | ||
11142 | static void | |
3a978d72 | 11143 | set_current_access_from_decl (tree decl) |
61a127b3 MM |
11144 | { |
11145 | if (TREE_PRIVATE (decl)) | |
11146 | current_access_specifier = access_private_node; | |
11147 | else if (TREE_PROTECTED (decl)) | |
11148 | current_access_specifier = access_protected_node; | |
11149 | else | |
11150 | current_access_specifier = access_public_node; | |
11151 | } | |
11152 | ||
dbfe2124 MM |
11153 | /* Instantiate an enumerated type. TAG is the template type, NEWTAG |
11154 | is the instantiation (which should have been created with | |
11155 | start_enum) and ARGS are the template arguments to use. */ | |
b87692e5 | 11156 | |
dbfe2124 | 11157 | static void |
3a978d72 | 11158 | tsubst_enum (tree tag, tree newtag, tree args) |
b87692e5 | 11159 | { |
dbfe2124 | 11160 | tree e; |
b87692e5 MS |
11161 | |
11162 | for (e = TYPE_VALUES (tag); e; e = TREE_CHAIN (e)) | |
11163 | { | |
61a127b3 | 11164 | tree value; |
7b6d72fc MM |
11165 | tree decl; |
11166 | ||
11167 | decl = TREE_VALUE (e); | |
61a127b3 MM |
11168 | /* Note that in a template enum, the TREE_VALUE is the |
11169 | CONST_DECL, not the corresponding INTEGER_CST. */ | |
7b6d72fc | 11170 | value = tsubst_expr (DECL_INITIAL (decl), |
c2ea3a40 | 11171 | args, tf_error | tf_warning, |
4393e105 | 11172 | NULL_TREE); |
61a127b3 MM |
11173 | |
11174 | /* Give this enumeration constant the correct access. */ | |
7b6d72fc | 11175 | set_current_access_from_decl (decl); |
61a127b3 MM |
11176 | |
11177 | /* Actually build the enumerator itself. */ | |
7b6d72fc | 11178 | build_enumerator (DECL_NAME (decl), value, newtag); |
dbfe2124 | 11179 | } |
b3d5a58b | 11180 | |
219670f1 | 11181 | finish_enum (newtag); |
f31686a3 RH |
11182 | DECL_SOURCE_LOCATION (TYPE_NAME (newtag)) |
11183 | = DECL_SOURCE_LOCATION (TYPE_NAME (tag)); | |
b87692e5 | 11184 | } |
36a117a5 | 11185 | |
1f6e1acc AS |
11186 | /* DECL is a FUNCTION_DECL that is a template specialization. Return |
11187 | its type -- but without substituting the innermost set of template | |
11188 | arguments. So, innermost set of template parameters will appear in | |
5c74d5b0 | 11189 | the type. */ |
1f6e1acc AS |
11190 | |
11191 | tree | |
3a978d72 | 11192 | get_mostly_instantiated_function_type (tree decl) |
1f6e1acc | 11193 | { |
1f6e1acc AS |
11194 | tree fn_type; |
11195 | tree tmpl; | |
11196 | tree targs; | |
11197 | tree tparms; | |
11198 | int parm_depth; | |
11199 | ||
11200 | tmpl = most_general_template (DECL_TI_TEMPLATE (decl)); | |
11201 | targs = DECL_TI_ARGS (decl); | |
11202 | tparms = DECL_TEMPLATE_PARMS (tmpl); | |
11203 | parm_depth = TMPL_PARMS_DEPTH (tparms); | |
11204 | ||
11205 | /* There should be as many levels of arguments as there are levels | |
11206 | of parameters. */ | |
11207 | my_friendly_assert (parm_depth == TMPL_ARGS_DEPTH (targs), 0); | |
11208 | ||
11209 | fn_type = TREE_TYPE (tmpl); | |
1f6e1acc AS |
11210 | |
11211 | if (parm_depth == 1) | |
11212 | /* No substitution is necessary. */ | |
11213 | ; | |
11214 | else | |
11215 | { | |
11216 | int i; | |
11217 | tree partial_args; | |
11218 | ||
11219 | /* Replace the innermost level of the TARGS with NULL_TREEs to | |
dc957d14 | 11220 | let tsubst know not to substitute for those parameters. */ |
1f6e1acc AS |
11221 | partial_args = make_tree_vec (TREE_VEC_LENGTH (targs)); |
11222 | for (i = 1; i < TMPL_ARGS_DEPTH (targs); ++i) | |
11223 | SET_TMPL_ARGS_LEVEL (partial_args, i, | |
11224 | TMPL_ARGS_LEVEL (targs, i)); | |
11225 | SET_TMPL_ARGS_LEVEL (partial_args, | |
11226 | TMPL_ARGS_DEPTH (targs), | |
11227 | make_tree_vec (DECL_NTPARMS (tmpl))); | |
11228 | ||
5c74d5b0 KL |
11229 | /* Make sure that we can see identifiers, and compute access |
11230 | correctly. We can just use the context of DECL for the | |
11231 | partial substitution here. It depends only on outer template | |
11232 | parameters, regardless of whether the innermost level is | |
11233 | specialized or not. */ | |
2b59fc25 | 11234 | push_access_scope (decl); |
5c74d5b0 | 11235 | |
1f6e1acc AS |
11236 | /* Now, do the (partial) substitution to figure out the |
11237 | appropriate function type. */ | |
c2ea3a40 | 11238 | fn_type = tsubst (fn_type, partial_args, tf_error, NULL_TREE); |
1f6e1acc AS |
11239 | |
11240 | /* Substitute into the template parameters to obtain the real | |
11241 | innermost set of parameters. This step is important if the | |
11242 | innermost set of template parameters contains value | |
11243 | parameters whose types depend on outer template parameters. */ | |
11244 | TREE_VEC_LENGTH (partial_args)--; | |
c2ea3a40 | 11245 | tparms = tsubst_template_parms (tparms, partial_args, tf_error); |
1f6e1acc | 11246 | |
2b59fc25 | 11247 | pop_access_scope (decl); |
5c74d5b0 | 11248 | } |
1f6e1acc AS |
11249 | |
11250 | return fn_type; | |
11251 | } | |
669ec2b4 | 11252 | |
cb753e49 | 11253 | /* Return truthvalue if we're processing a template different from |
dc957d14 | 11254 | the last one involved in diagnostics. */ |
cb753e49 | 11255 | int |
3a978d72 | 11256 | problematic_instantiation_changed (void) |
cb753e49 GDR |
11257 | { |
11258 | return last_template_error_tick != tinst_level_tick; | |
11259 | } | |
11260 | ||
11261 | /* Remember current template involved in diagnostics. */ | |
11262 | void | |
3a978d72 | 11263 | record_last_problematic_instantiation (void) |
cb753e49 GDR |
11264 | { |
11265 | last_template_error_tick = tinst_level_tick; | |
11266 | } | |
11267 | ||
11268 | tree | |
3a978d72 | 11269 | current_instantiation (void) |
cb753e49 GDR |
11270 | { |
11271 | return current_tinst_level; | |
11272 | } | |
db3f4e4e NS |
11273 | |
11274 | /* [temp.param] Check that template non-type parm TYPE is of an allowable | |
838dfd8a | 11275 | type. Return zero for ok, nonzero for disallowed. Issue error and |
c2ea3a40 | 11276 | warning messages under control of COMPLAIN. */ |
db3f4e4e NS |
11277 | |
11278 | static int | |
3a978d72 | 11279 | invalid_nontype_parm_type_p (tree type, tsubst_flags_t complain) |
db3f4e4e NS |
11280 | { |
11281 | if (INTEGRAL_TYPE_P (type)) | |
11282 | return 0; | |
11283 | else if (POINTER_TYPE_P (type)) | |
11284 | return 0; | |
a5ac359a | 11285 | else if (TYPE_PTR_TO_MEMBER_P (type)) |
db3f4e4e | 11286 | return 0; |
db3f4e4e NS |
11287 | else if (TREE_CODE (type) == TEMPLATE_TYPE_PARM) |
11288 | return 0; | |
11289 | else if (TREE_CODE (type) == TYPENAME_TYPE) | |
11290 | return 0; | |
11291 | ||
c2ea3a40 | 11292 | if (complain & tf_error) |
33bd39a2 | 11293 | error ("`%#T' is not a valid type for a template constant parameter", |
db3f4e4e NS |
11294 | type); |
11295 | return 1; | |
11296 | } | |
e2500fed | 11297 | |
5552b43c MM |
11298 | /* Returns TRUE if TYPE is dependent, in the sense of [temp.dep.type]. |
11299 | Assumes that TYPE really is a type, and not the ERROR_MARK_NODE.*/ | |
1fb3244a | 11300 | |
5552b43c MM |
11301 | static bool |
11302 | dependent_type_p_r (tree type) | |
1fb3244a MM |
11303 | { |
11304 | tree scope; | |
11305 | ||
1fb3244a MM |
11306 | /* [temp.dep.type] |
11307 | ||
11308 | A type is dependent if it is: | |
11309 | ||
11310 | -- a template parameter. */ | |
11311 | if (TREE_CODE (type) == TEMPLATE_TYPE_PARM) | |
11312 | return true; | |
11313 | /* -- a qualified-id with a nested-name-specifier which contains a | |
11314 | class-name that names a dependent type or whose unqualified-id | |
11315 | names a dependent type. */ | |
11316 | if (TREE_CODE (type) == TYPENAME_TYPE) | |
11317 | return true; | |
11318 | /* -- a cv-qualified type where the cv-unqualified type is | |
11319 | dependent. */ | |
11320 | type = TYPE_MAIN_VARIANT (type); | |
11321 | /* -- a compound type constructed from any dependent type. */ | |
a5ac359a | 11322 | if (TYPE_PTR_TO_MEMBER_P (type)) |
1fb3244a MM |
11323 | return (dependent_type_p (TYPE_PTRMEM_CLASS_TYPE (type)) |
11324 | || dependent_type_p (TYPE_PTRMEM_POINTED_TO_TYPE | |
11325 | (type))); | |
11326 | else if (TREE_CODE (type) == POINTER_TYPE | |
11327 | || TREE_CODE (type) == REFERENCE_TYPE) | |
11328 | return dependent_type_p (TREE_TYPE (type)); | |
11329 | else if (TREE_CODE (type) == FUNCTION_TYPE | |
11330 | || TREE_CODE (type) == METHOD_TYPE) | |
11331 | { | |
11332 | tree arg_type; | |
11333 | ||
11334 | if (dependent_type_p (TREE_TYPE (type))) | |
11335 | return true; | |
11336 | for (arg_type = TYPE_ARG_TYPES (type); | |
11337 | arg_type; | |
11338 | arg_type = TREE_CHAIN (arg_type)) | |
11339 | if (dependent_type_p (TREE_VALUE (arg_type))) | |
11340 | return true; | |
11341 | return false; | |
11342 | } | |
11343 | /* -- an array type constructed from any dependent type or whose | |
11344 | size is specified by a constant expression that is | |
11345 | value-dependent. */ | |
11346 | if (TREE_CODE (type) == ARRAY_TYPE) | |
11347 | { | |
11348 | if (TYPE_DOMAIN (type) | |
11349 | && ((value_dependent_expression_p | |
11350 | (TYPE_MAX_VALUE (TYPE_DOMAIN (type)))) | |
11351 | || (type_dependent_expression_p | |
11352 | (TYPE_MAX_VALUE (TYPE_DOMAIN (type)))))) | |
11353 | return true; | |
11354 | return dependent_type_p (TREE_TYPE (type)); | |
11355 | } | |
86306a6b | 11356 | |
1fb3244a | 11357 | /* -- a template-id in which either the template name is a template |
86306a6b NS |
11358 | parameter ... */ |
11359 | if (TREE_CODE (type) == BOUND_TEMPLATE_TEMPLATE_PARM) | |
1fb3244a | 11360 | return true; |
86306a6b NS |
11361 | /* ... or any of the template arguments is a dependent type or |
11362 | an expression that is type-dependent or value-dependent. */ | |
11363 | else if (CLASS_TYPE_P (type) && CLASSTYPE_TEMPLATE_INFO (type) | |
7e99327d MM |
11364 | && (any_dependent_template_arguments_p |
11365 | (INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (type))))) | |
1fb3244a | 11366 | return true; |
86306a6b | 11367 | |
1fb3244a MM |
11368 | /* All TYPEOF_TYPEs are dependent; if the argument of the `typeof' |
11369 | expression is not type-dependent, then it should already been | |
11370 | have resolved. */ | |
11371 | if (TREE_CODE (type) == TYPEOF_TYPE) | |
11372 | return true; | |
86306a6b | 11373 | |
1fb3244a MM |
11374 | /* The standard does not specifically mention types that are local |
11375 | to template functions or local classes, but they should be | |
11376 | considered dependent too. For example: | |
11377 | ||
11378 | template <int I> void f() { | |
11379 | enum E { a = I }; | |
11380 | S<sizeof (E)> s; | |
11381 | } | |
11382 | ||
11383 | The size of `E' cannot be known until the value of `I' has been | |
11384 | determined. Therefore, `E' must be considered dependent. */ | |
11385 | scope = TYPE_CONTEXT (type); | |
11386 | if (scope && TYPE_P (scope)) | |
11387 | return dependent_type_p (scope); | |
11388 | else if (scope && TREE_CODE (scope) == FUNCTION_DECL) | |
11389 | return type_dependent_expression_p (scope); | |
11390 | ||
11391 | /* Other types are non-dependent. */ | |
11392 | return false; | |
11393 | } | |
11394 | ||
5552b43c MM |
11395 | /* Returns TRUE if TYPE is dependent, in the sense of |
11396 | [temp.dep.type]. */ | |
11397 | ||
11398 | bool | |
11399 | dependent_type_p (tree type) | |
11400 | { | |
11401 | /* If there are no template parameters in scope, then there can't be | |
11402 | any dependent types. */ | |
11403 | if (!processing_template_decl) | |
11404 | return false; | |
11405 | ||
11406 | /* If the type is NULL, we have not computed a type for the entity | |
11407 | in question; in that case, the type is dependent. */ | |
11408 | if (!type) | |
11409 | return true; | |
11410 | ||
11411 | /* Erroneous types can be considered non-dependent. */ | |
11412 | if (type == error_mark_node) | |
11413 | return false; | |
11414 | ||
11415 | /* If we have not already computed the appropriate value for TYPE, | |
11416 | do so now. */ | |
11417 | if (!TYPE_DEPENDENT_P_VALID (type)) | |
11418 | { | |
11419 | TYPE_DEPENDENT_P (type) = dependent_type_p_r (type); | |
11420 | TYPE_DEPENDENT_P_VALID (type) = 1; | |
11421 | } | |
11422 | ||
11423 | return TYPE_DEPENDENT_P (type); | |
11424 | } | |
11425 | ||
8d83f792 MM |
11426 | /* Returns TRUE if EXPRESSION is dependent, according to CRITERION. */ |
11427 | ||
11428 | static bool | |
11429 | dependent_scope_ref_p (tree expression, bool criterion (tree)) | |
11430 | { | |
11431 | tree scope; | |
11432 | tree name; | |
11433 | ||
11434 | my_friendly_assert (TREE_CODE (expression) == SCOPE_REF, 20030714); | |
11435 | ||
11436 | if (!TYPE_P (TREE_OPERAND (expression, 0))) | |
11437 | return true; | |
11438 | ||
11439 | scope = TREE_OPERAND (expression, 0); | |
11440 | name = TREE_OPERAND (expression, 1); | |
11441 | ||
11442 | /* [temp.dep.expr] | |
11443 | ||
11444 | An id-expression is type-dependent if it contains a | |
11445 | nested-name-specifier that contains a class-name that names a | |
11446 | dependent type. */ | |
11447 | /* The suggested resolution to Core Issue 2 implies that if the | |
11448 | qualifying type is the current class, then we must peek | |
11449 | inside it. */ | |
11450 | if (DECL_P (name) | |
11451 | && currently_open_class (scope) | |
11452 | && !criterion (name)) | |
11453 | return false; | |
11454 | if (dependent_type_p (scope)) | |
11455 | return true; | |
11456 | ||
11457 | return false; | |
11458 | } | |
11459 | ||
20929c7f GB |
11460 | /* Returns TRUE if the EXPRESSION is value-dependent, in the sense of |
11461 | [temp.dep.constexpr] */ | |
1fb3244a | 11462 | |
14d22dd6 | 11463 | bool |
1fb3244a MM |
11464 | value_dependent_expression_p (tree expression) |
11465 | { | |
11466 | if (!processing_template_decl) | |
11467 | return false; | |
11468 | ||
11469 | /* A name declared with a dependent type. */ | |
10b1d5e7 | 11470 | if (TREE_CODE (expression) == IDENTIFIER_NODE |
00cf3e31 MM |
11471 | || (DECL_P (expression) |
11472 | && type_dependent_expression_p (expression))) | |
1fb3244a MM |
11473 | return true; |
11474 | /* A non-type template parameter. */ | |
11475 | if ((TREE_CODE (expression) == CONST_DECL | |
11476 | && DECL_TEMPLATE_PARM_P (expression)) | |
11477 | || TREE_CODE (expression) == TEMPLATE_PARM_INDEX) | |
11478 | return true; | |
11479 | /* A constant with integral or enumeration type and is initialized | |
11480 | with an expression that is value-dependent. */ | |
11481 | if (TREE_CODE (expression) == VAR_DECL | |
11482 | && DECL_INITIAL (expression) | |
d17811fd | 11483 | && INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (expression)) |
1fb3244a MM |
11484 | && value_dependent_expression_p (DECL_INITIAL (expression))) |
11485 | return true; | |
11486 | /* These expressions are value-dependent if the type to which the | |
20929c7f GB |
11487 | cast occurs is dependent or the expression being casted is |
11488 | value-dependent. */ | |
d17811fd MM |
11489 | if (TREE_CODE (expression) == DYNAMIC_CAST_EXPR |
11490 | || TREE_CODE (expression) == STATIC_CAST_EXPR | |
11491 | || TREE_CODE (expression) == CONST_CAST_EXPR | |
11492 | || TREE_CODE (expression) == REINTERPRET_CAST_EXPR | |
11493 | || TREE_CODE (expression) == CAST_EXPR) | |
11494 | { | |
11495 | if (dependent_type_p (TREE_TYPE (expression))) | |
11496 | return true; | |
11497 | /* A functional cast has a list of operands. */ | |
11498 | expression = TREE_OPERAND (expression, 0); | |
11499 | if (TREE_CODE (expression) == TREE_LIST) | |
11500 | { | |
11501 | do | |
11502 | { | |
11503 | if (value_dependent_expression_p (TREE_VALUE (expression))) | |
11504 | return true; | |
11505 | expression = TREE_CHAIN (expression); | |
11506 | } | |
11507 | while (expression); | |
11508 | return false; | |
11509 | } | |
11510 | else | |
11511 | return value_dependent_expression_p (expression); | |
11512 | } | |
11513 | /* A `sizeof' expression is value-dependent if the operand is | |
11514 | type-dependent. */ | |
11515 | if (TREE_CODE (expression) == SIZEOF_EXPR | |
11516 | || TREE_CODE (expression) == ALIGNOF_EXPR) | |
11517 | { | |
11518 | expression = TREE_OPERAND (expression, 0); | |
11519 | if (TYPE_P (expression)) | |
11520 | return dependent_type_p (expression); | |
11521 | return type_dependent_expression_p (expression); | |
11522 | } | |
8d83f792 MM |
11523 | if (TREE_CODE (expression) == SCOPE_REF) |
11524 | return dependent_scope_ref_p (expression, value_dependent_expression_p); | |
1fb3244a MM |
11525 | /* A constant expression is value-dependent if any subexpression is |
11526 | value-dependent. */ | |
11527 | if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (TREE_CODE (expression)))) | |
11528 | { | |
11529 | switch (TREE_CODE_CLASS (TREE_CODE (expression))) | |
11530 | { | |
11531 | case '1': | |
11532 | return (value_dependent_expression_p | |
11533 | (TREE_OPERAND (expression, 0))); | |
11534 | case '<': | |
11535 | case '2': | |
11536 | return ((value_dependent_expression_p | |
11537 | (TREE_OPERAND (expression, 0))) | |
11538 | || (value_dependent_expression_p | |
11539 | (TREE_OPERAND (expression, 1)))); | |
11540 | case 'e': | |
11541 | { | |
11542 | int i; | |
14d22dd6 MM |
11543 | for (i = 0; i < first_rtl_op (TREE_CODE (expression)); ++i) |
11544 | /* In some cases, some of the operands may be missing. | |
11545 | (For example, in the case of PREDECREMENT_EXPR, the | |
11546 | amount to increment by may be missing.) That doesn't | |
11547 | make the expression dependent. */ | |
11548 | if (TREE_OPERAND (expression, i) | |
11549 | && (value_dependent_expression_p | |
11550 | (TREE_OPERAND (expression, i)))) | |
1fb3244a MM |
11551 | return true; |
11552 | return false; | |
11553 | } | |
11554 | } | |
11555 | } | |
11556 | ||
11557 | /* The expression is not value-dependent. */ | |
11558 | return false; | |
11559 | } | |
11560 | ||
11561 | /* Returns TRUE if the EXPRESSION is type-dependent, in the sense of | |
11562 | [temp.dep.expr]. */ | |
11563 | ||
11564 | bool | |
3a978d72 | 11565 | type_dependent_expression_p (tree expression) |
1fb3244a MM |
11566 | { |
11567 | if (!processing_template_decl) | |
11568 | return false; | |
11569 | ||
7efa3e22 NS |
11570 | if (expression == error_mark_node) |
11571 | return false; | |
10b1d5e7 MM |
11572 | |
11573 | /* An unresolved name is always dependent. */ | |
11574 | if (TREE_CODE (expression) == IDENTIFIER_NODE) | |
11575 | return true; | |
7efa3e22 | 11576 | |
1fb3244a MM |
11577 | /* Some expression forms are never type-dependent. */ |
11578 | if (TREE_CODE (expression) == PSEUDO_DTOR_EXPR | |
11579 | || TREE_CODE (expression) == SIZEOF_EXPR | |
11580 | || TREE_CODE (expression) == ALIGNOF_EXPR | |
11581 | || TREE_CODE (expression) == TYPEID_EXPR | |
11582 | || TREE_CODE (expression) == DELETE_EXPR | |
11583 | || TREE_CODE (expression) == VEC_DELETE_EXPR | |
11584 | || TREE_CODE (expression) == THROW_EXPR) | |
11585 | return false; | |
11586 | ||
11587 | /* The types of these expressions depends only on the type to which | |
11588 | the cast occurs. */ | |
11589 | if (TREE_CODE (expression) == DYNAMIC_CAST_EXPR | |
11590 | || TREE_CODE (expression) == STATIC_CAST_EXPR | |
11591 | || TREE_CODE (expression) == CONST_CAST_EXPR | |
11592 | || TREE_CODE (expression) == REINTERPRET_CAST_EXPR | |
11593 | || TREE_CODE (expression) == CAST_EXPR) | |
11594 | return dependent_type_p (TREE_TYPE (expression)); | |
d17811fd | 11595 | |
1fb3244a MM |
11596 | /* The types of these expressions depends only on the type created |
11597 | by the expression. */ | |
d17811fd MM |
11598 | if (TREE_CODE (expression) == NEW_EXPR |
11599 | || TREE_CODE (expression) == VEC_NEW_EXPR) | |
09d2f85f KL |
11600 | { |
11601 | /* For NEW_EXPR tree nodes created inside a template, either | |
11602 | the object type itself or a TREE_LIST may appear as the | |
11603 | operand 1. */ | |
11604 | tree type = TREE_OPERAND (expression, 1); | |
11605 | if (TREE_CODE (type) == TREE_LIST) | |
11606 | /* This is an array type. We need to check array dimensions | |
11607 | as well. */ | |
11608 | return dependent_type_p (TREE_VALUE (TREE_PURPOSE (type))) | |
11609 | || value_dependent_expression_p | |
11610 | (TREE_OPERAND (TREE_VALUE (type), 1)); | |
11611 | else | |
11612 | return dependent_type_p (type); | |
11613 | } | |
1fb3244a | 11614 | |
6eeba0cc | 11615 | if (TREE_CODE (expression) == SCOPE_REF |
8d83f792 MM |
11616 | && dependent_scope_ref_p (expression, |
11617 | type_dependent_expression_p)) | |
11618 | return true; | |
6eeba0cc | 11619 | |
1fb3244a MM |
11620 | if (TREE_CODE (expression) == FUNCTION_DECL |
11621 | && DECL_LANG_SPECIFIC (expression) | |
11622 | && DECL_TEMPLATE_INFO (expression) | |
86306a6b NS |
11623 | && (any_dependent_template_arguments_p |
11624 | (INNERMOST_TEMPLATE_ARGS (DECL_TI_ARGS (expression))))) | |
1fb3244a MM |
11625 | return true; |
11626 | ||
d17811fd MM |
11627 | if (TREE_TYPE (expression) == unknown_type_node) |
11628 | { | |
11629 | if (TREE_CODE (expression) == ADDR_EXPR) | |
11630 | return type_dependent_expression_p (TREE_OPERAND (expression, 0)); | |
6cb89308 NS |
11631 | if (TREE_CODE (expression) == COMPONENT_REF) |
11632 | { | |
11633 | if (type_dependent_expression_p (TREE_OPERAND (expression, 0))) | |
11634 | return true; | |
11635 | expression = TREE_OPERAND (expression, 1); | |
11636 | if (TREE_CODE (expression) == IDENTIFIER_NODE) | |
11637 | return false; | |
11638 | } | |
11639 | ||
d17811fd MM |
11640 | if (TREE_CODE (expression) == BASELINK) |
11641 | expression = BASELINK_FUNCTIONS (expression); | |
11642 | if (TREE_CODE (expression) == TEMPLATE_ID_EXPR) | |
11643 | { | |
ee3071ef NS |
11644 | if (any_dependent_template_arguments_p |
11645 | (TREE_OPERAND (expression, 1))) | |
d17811fd MM |
11646 | return true; |
11647 | expression = TREE_OPERAND (expression, 0); | |
11648 | } | |
11649 | if (TREE_CODE (expression) == OVERLOAD) | |
11650 | { | |
11651 | while (expression) | |
11652 | { | |
11653 | if (type_dependent_expression_p (OVL_CURRENT (expression))) | |
11654 | return true; | |
11655 | expression = OVL_NEXT (expression); | |
11656 | } | |
11657 | return false; | |
11658 | } | |
11659 | abort (); | |
11660 | } | |
11661 | ||
1fb3244a MM |
11662 | return (dependent_type_p (TREE_TYPE (expression))); |
11663 | } | |
11664 | ||
d17811fd MM |
11665 | /* Returns TRUE if ARGS (a TREE_LIST of arguments to a function call) |
11666 | contains a type-dependent expression. */ | |
1fb3244a MM |
11667 | |
11668 | bool | |
d17811fd MM |
11669 | any_type_dependent_arguments_p (tree args) |
11670 | { | |
11671 | while (args) | |
11672 | { | |
7efa3e22 NS |
11673 | tree arg = TREE_VALUE (args); |
11674 | ||
11675 | if (type_dependent_expression_p (arg)) | |
d17811fd MM |
11676 | return true; |
11677 | args = TREE_CHAIN (args); | |
11678 | } | |
11679 | return false; | |
11680 | } | |
11681 | ||
11682 | /* Returns TRUE if the ARG (a template argument) is dependent. */ | |
11683 | ||
11684 | static bool | |
1fb3244a MM |
11685 | dependent_template_arg_p (tree arg) |
11686 | { | |
11687 | if (!processing_template_decl) | |
11688 | return false; | |
11689 | ||
11690 | if (TREE_CODE (arg) == TEMPLATE_DECL | |
11691 | || TREE_CODE (arg) == TEMPLATE_TEMPLATE_PARM) | |
11692 | return dependent_template_p (arg); | |
11693 | else if (TYPE_P (arg)) | |
11694 | return dependent_type_p (arg); | |
11695 | else | |
11696 | return (type_dependent_expression_p (arg) | |
11697 | || value_dependent_expression_p (arg)); | |
11698 | } | |
11699 | ||
d17811fd MM |
11700 | /* Returns true if ARGS (a collection of template arguments) contains |
11701 | any dependent arguments. */ | |
1fb3244a | 11702 | |
d17811fd MM |
11703 | bool |
11704 | any_dependent_template_arguments_p (tree args) | |
1fb3244a | 11705 | { |
bf12d54d NS |
11706 | int i; |
11707 | ||
d17811fd MM |
11708 | if (!args) |
11709 | return false; | |
11710 | ||
bf12d54d NS |
11711 | for (i = 0; i < TREE_VEC_LENGTH (args); ++i) |
11712 | if (dependent_template_arg_p (TREE_VEC_ELT (args, i))) | |
11713 | return true; | |
1fb3244a | 11714 | |
1fb3244a MM |
11715 | return false; |
11716 | } | |
11717 | ||
11718 | /* Returns TRUE if the template TMPL is dependent. */ | |
11719 | ||
11720 | bool | |
11721 | dependent_template_p (tree tmpl) | |
11722 | { | |
11723 | /* Template template parameters are dependent. */ | |
11724 | if (DECL_TEMPLATE_TEMPLATE_PARM_P (tmpl) | |
11725 | || TREE_CODE (tmpl) == TEMPLATE_TEMPLATE_PARM) | |
11726 | return true; | |
d17811fd MM |
11727 | /* So are qualified names that have not been looked up. */ |
11728 | if (TREE_CODE (tmpl) == SCOPE_REF) | |
11729 | return true; | |
1fb3244a MM |
11730 | /* So are member templates of dependent classes. */ |
11731 | if (TYPE_P (CP_DECL_CONTEXT (tmpl))) | |
11732 | return dependent_type_p (DECL_CONTEXT (tmpl)); | |
11733 | return false; | |
11734 | } | |
11735 | ||
d17811fd MM |
11736 | /* Returns TRUE if the specialization TMPL<ARGS> is dependent. */ |
11737 | ||
11738 | bool | |
11739 | dependent_template_id_p (tree tmpl, tree args) | |
11740 | { | |
11741 | return (dependent_template_p (tmpl) | |
11742 | || any_dependent_template_arguments_p (args)); | |
11743 | } | |
11744 | ||
14d22dd6 MM |
11745 | /* TYPE is a TYPENAME_TYPE. Returns the ordinary TYPE to which the |
11746 | TYPENAME_TYPE corresponds. Returns ERROR_MARK_NODE if no such TYPE | |
11747 | can be found. Note that this function peers inside uninstantiated | |
11748 | templates and therefore should be used only in extremely limited | |
11749 | situations. */ | |
11750 | ||
11751 | tree | |
11752 | resolve_typename_type (tree type, bool only_current_p) | |
11753 | { | |
11754 | tree scope; | |
11755 | tree name; | |
11756 | tree decl; | |
11757 | int quals; | |
11758 | ||
11759 | my_friendly_assert (TREE_CODE (type) == TYPENAME_TYPE, | |
11760 | 20010702); | |
11761 | ||
11762 | scope = TYPE_CONTEXT (type); | |
11763 | name = TYPE_IDENTIFIER (type); | |
11764 | ||
11765 | /* If the SCOPE is itself a TYPENAME_TYPE, then we need to resolve | |
11766 | it first before we can figure out what NAME refers to. */ | |
11767 | if (TREE_CODE (scope) == TYPENAME_TYPE) | |
11768 | scope = resolve_typename_type (scope, only_current_p); | |
11769 | /* If we don't know what SCOPE refers to, then we cannot resolve the | |
11770 | TYPENAME_TYPE. */ | |
11771 | if (scope == error_mark_node || TREE_CODE (scope) == TYPENAME_TYPE) | |
11772 | return error_mark_node; | |
11773 | /* If the SCOPE is a template type parameter, we have no way of | |
11774 | resolving the name. */ | |
11775 | if (TREE_CODE (scope) == TEMPLATE_TYPE_PARM) | |
11776 | return type; | |
11777 | /* If the SCOPE is not the current instantiation, there's no reason | |
11778 | to look inside it. */ | |
11779 | if (only_current_p && !currently_open_class (scope)) | |
11780 | return error_mark_node; | |
ca099ac8 MM |
11781 | /* If SCOPE is a partial instantiation, it will not have a valid |
11782 | TYPE_FIELDS list, so use the original template. */ | |
353b4fc0 | 11783 | scope = CLASSTYPE_PRIMARY_TEMPLATE_TYPE (scope); |
14d22dd6 MM |
11784 | /* Enter the SCOPE so that name lookup will be resolved as if we |
11785 | were in the class definition. In particular, SCOPE will no | |
11786 | longer be considered a dependent type. */ | |
11787 | push_scope (scope); | |
11788 | /* Look up the declaration. */ | |
86ac0575 | 11789 | decl = lookup_member (scope, name, /*protect=*/0, /*want_type=*/true); |
14d22dd6 MM |
11790 | /* Obtain the set of qualifiers applied to the TYPE. */ |
11791 | quals = cp_type_quals (type); | |
11792 | /* For a TYPENAME_TYPE like "typename X::template Y<T>", we want to | |
11793 | find a TEMPLATE_DECL. Otherwise, we want to find a TYPE_DECL. */ | |
11794 | if (!decl) | |
11795 | type = error_mark_node; | |
11796 | else if (TREE_CODE (TYPENAME_TYPE_FULLNAME (type)) == IDENTIFIER_NODE | |
11797 | && TREE_CODE (decl) == TYPE_DECL) | |
11798 | type = TREE_TYPE (decl); | |
11799 | else if (TREE_CODE (TYPENAME_TYPE_FULLNAME (type)) == TEMPLATE_ID_EXPR | |
11800 | && DECL_CLASS_TEMPLATE_P (decl)) | |
11801 | { | |
11802 | tree tmpl; | |
11803 | tree args; | |
11804 | /* Obtain the template and the arguments. */ | |
11805 | tmpl = TREE_OPERAND (TYPENAME_TYPE_FULLNAME (type), 0); | |
11806 | args = TREE_OPERAND (TYPENAME_TYPE_FULLNAME (type), 1); | |
11807 | /* Instantiate the template. */ | |
11808 | type = lookup_template_class (tmpl, args, NULL_TREE, NULL_TREE, | |
42eaed49 | 11809 | /*entering_scope=*/0, tf_error | tf_user); |
14d22dd6 MM |
11810 | } |
11811 | else | |
11812 | type = error_mark_node; | |
11813 | /* Qualify the resulting type. */ | |
11814 | if (type != error_mark_node && quals) | |
11815 | type = cp_build_qualified_type (type, quals); | |
11816 | /* Leave the SCOPE. */ | |
11817 | pop_scope (scope); | |
11818 | ||
11819 | return type; | |
11820 | } | |
11821 | ||
d17811fd MM |
11822 | /* EXPR is an expression which is not type-dependent. Return a proxy |
11823 | for EXPR that can be used to compute the types of larger | |
11824 | expressions containing EXPR. */ | |
11825 | ||
11826 | tree | |
11827 | build_non_dependent_expr (tree expr) | |
11828 | { | |
11829 | /* Preserve null pointer constants so that the type of things like | |
11830 | "p == 0" where "p" is a pointer can be determined. */ | |
11831 | if (null_ptr_cst_p (expr)) | |
11832 | return expr; | |
11833 | /* Preserve OVERLOADs; the functions must be available to resolve | |
11834 | types. */ | |
11835 | if (TREE_CODE (expr) == OVERLOAD) | |
11836 | return expr; | |
7433e6d4 MM |
11837 | /* Preserve string constants; conversions from string constants to |
11838 | "char *" are allowed, even though normally a "const char *" | |
11839 | cannot be used to initialize a "char *". */ | |
11840 | if (TREE_CODE (expr) == STRING_CST) | |
11841 | return expr; | |
47d4c811 NS |
11842 | |
11843 | if (TREE_CODE (expr) == COND_EXPR) | |
11844 | return build (COND_EXPR, | |
11845 | TREE_TYPE (expr), | |
11846 | TREE_OPERAND (expr, 0), | |
11847 | build_non_dependent_expr (TREE_OPERAND (expr, 1)), | |
11848 | build_non_dependent_expr (TREE_OPERAND (expr, 2))); | |
8e1daa34 NS |
11849 | if (TREE_CODE (expr) == COMPOUND_EXPR |
11850 | && !COMPOUND_EXPR_OVERLOADED (expr)) | |
47d4c811 NS |
11851 | return build (COMPOUND_EXPR, |
11852 | TREE_TYPE (expr), | |
11853 | TREE_OPERAND (expr, 0), | |
11854 | build_non_dependent_expr (TREE_OPERAND (expr, 1))); | |
11855 | ||
d17811fd MM |
11856 | /* Otherwise, build a NON_DEPENDENT_EXPR. |
11857 | ||
11858 | REFERENCE_TYPEs are not stripped for expressions in templates | |
11859 | because doing so would play havoc with mangling. Consider, for | |
11860 | example: | |
11861 | ||
11862 | template <typename T> void f<T& g>() { g(); } | |
11863 | ||
11864 | In the body of "f", the expression for "g" will have | |
11865 | REFERENCE_TYPE, even though the standard says that it should | |
11866 | not. The reason is that we must preserve the syntactic form of | |
11867 | the expression so that mangling (say) "f<g>" inside the body of | |
11868 | "f" works out correctly. Therefore, the REFERENCE_TYPE is | |
11869 | stripped here. */ | |
018a5803 | 11870 | return build1 (NON_DEPENDENT_EXPR, non_reference (TREE_TYPE (expr)), expr); |
d17811fd MM |
11871 | } |
11872 | ||
11873 | /* ARGS is a TREE_LIST of expressions as arguments to a function call. | |
11874 | Return a new TREE_LIST with the various arguments replaced with | |
11875 | equivalent non-dependent expressions. */ | |
11876 | ||
11877 | tree | |
11878 | build_non_dependent_args (tree args) | |
11879 | { | |
11880 | tree a; | |
11881 | tree new_args; | |
11882 | ||
11883 | new_args = NULL_TREE; | |
11884 | for (a = args; a; a = TREE_CHAIN (a)) | |
11885 | new_args = tree_cons (NULL_TREE, | |
11886 | build_non_dependent_expr (TREE_VALUE (a)), | |
11887 | new_args); | |
11888 | return nreverse (new_args); | |
11889 | } | |
11890 | ||
e2500fed | 11891 | #include "gt-cp-pt.h" |