]>
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, |
faa5faee | 3 | 2001, 2002, 2003, 2004 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; |
6de9cd9a DN |
378 | TREE_CONSTANT (decl) = 1; |
379 | TREE_INVARIANT (decl) = 1; | |
380 | TREE_READONLY (decl) = 1; | |
786b5245 | 381 | DECL_INITIAL (decl) = DECL_INITIAL (parm); |
cd9f6678 | 382 | SET_DECL_TEMPLATE_PARM_P (decl); |
786b5245 MM |
383 | pushdecl (decl); |
384 | } | |
cae40af6 | 385 | break; |
786b5245 | 386 | |
98c1c668 | 387 | default: |
a98facb0 | 388 | abort (); |
98c1c668 JM |
389 | } |
390 | } | |
391 | } | |
392 | ||
cae40af6 JM |
393 | /* Restore the template parameter context for a member template or |
394 | a friend template defined in a class definition. */ | |
395 | ||
396 | void | |
3a978d72 | 397 | maybe_begin_member_template_processing (tree decl) |
cae40af6 JM |
398 | { |
399 | tree parms; | |
3dcaad8b | 400 | int levels = 0; |
cae40af6 | 401 | |
3dcaad8b MM |
402 | if (inline_needs_template_parms (decl)) |
403 | { | |
404 | parms = DECL_TEMPLATE_PARMS (most_general_template (decl)); | |
405 | levels = TMPL_PARMS_DEPTH (parms) - processing_template_decl; | |
cae40af6 | 406 | |
3dcaad8b MM |
407 | if (DECL_TEMPLATE_SPECIALIZATION (decl)) |
408 | { | |
409 | --levels; | |
410 | parms = TREE_CHAIN (parms); | |
411 | } | |
cae40af6 | 412 | |
3dcaad8b | 413 | push_inline_template_parms_recursive (parms, levels); |
cae40af6 JM |
414 | } |
415 | ||
3dcaad8b MM |
416 | /* Remember how many levels of template parameters we pushed so that |
417 | we can pop them later. */ | |
418 | if (!inline_parm_levels) | |
419 | VARRAY_INT_INIT (inline_parm_levels, 4, "inline_parm_levels"); | |
420 | if (inline_parm_levels_used == inline_parm_levels->num_elements) | |
421 | VARRAY_GROW (inline_parm_levels, 2 * inline_parm_levels_used); | |
422 | VARRAY_INT (inline_parm_levels, inline_parm_levels_used) = levels; | |
423 | ++inline_parm_levels_used; | |
cae40af6 JM |
424 | } |
425 | ||
c6002625 | 426 | /* Undo the effects of begin_member_template_processing. */ |
98c1c668 JM |
427 | |
428 | void | |
3a978d72 | 429 | maybe_end_member_template_processing (void) |
98c1c668 | 430 | { |
3dcaad8b MM |
431 | int i; |
432 | ||
433 | if (!inline_parm_levels_used) | |
98c1c668 JM |
434 | return; |
435 | ||
3dcaad8b MM |
436 | --inline_parm_levels_used; |
437 | for (i = 0; | |
438 | i < VARRAY_INT (inline_parm_levels, inline_parm_levels_used); | |
439 | ++i) | |
cae40af6 JM |
440 | { |
441 | --processing_template_decl; | |
442 | current_template_parms = TREE_CHAIN (current_template_parms); | |
443 | poplevel (0, 0, 0); | |
444 | } | |
98c1c668 JM |
445 | } |
446 | ||
838dfd8a | 447 | /* Returns nonzero iff T is a member template function. We must be |
f84b4be9 | 448 | careful as in |
75650646 MM |
449 | |
450 | template <class T> class C { void f(); } | |
451 | ||
452 | Here, f is a template function, and a member, but not a member | |
453 | template. This function does not concern itself with the origin of | |
454 | T, only its present state. So if we have | |
455 | ||
456 | template <class T> class C { template <class U> void f(U); } | |
457 | ||
458 | then neither C<int>::f<char> nor C<T>::f<double> is considered | |
f181d4ae MM |
459 | to be a member template. But, `template <class U> void |
460 | C<int>::f(U)' is considered a member template. */ | |
98c1c668 | 461 | |
cae40af6 | 462 | int |
3a978d72 | 463 | is_member_template (tree t) |
98c1c668 | 464 | { |
f181d4ae | 465 | if (!DECL_FUNCTION_TEMPLATE_P (t)) |
75650646 | 466 | /* Anything that isn't a function or a template function is |
aa5f3bad MM |
467 | certainly not a member template. */ |
468 | return 0; | |
469 | ||
cae40af6 | 470 | /* A local class can't have member templates. */ |
4f1c5b7d | 471 | if (decl_function_context (t)) |
cae40af6 JM |
472 | return 0; |
473 | ||
f181d4ae | 474 | return (DECL_FUNCTION_MEMBER_P (DECL_TEMPLATE_RESULT (t)) |
f84b4be9 JM |
475 | /* If there are more levels of template parameters than |
476 | there are template classes surrounding the declaration, | |
477 | then we have a member template. */ | |
f181d4ae | 478 | && (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (t)) > |
4f1c5b7d | 479 | template_class_depth (DECL_CONTEXT (t)))); |
f84b4be9 | 480 | } |
98c1c668 | 481 | |
ba4f4e5d | 482 | #if 0 /* UNUSED */ |
838dfd8a | 483 | /* Returns nonzero iff T is a member template class. See |
2ee4e084 MM |
484 | is_member_template for a description of what precisely constitutes |
485 | a member template. */ | |
486 | ||
487 | int | |
3a978d72 | 488 | is_member_template_class (tree t) |
2ee4e084 MM |
489 | { |
490 | if (!DECL_CLASS_TEMPLATE_P (t)) | |
491 | /* Anything that isn't a class template, is certainly not a member | |
492 | template. */ | |
493 | return 0; | |
494 | ||
495 | if (!DECL_CLASS_SCOPE_P (t)) | |
496 | /* Anything whose context isn't a class type is surely not a | |
497 | member template. */ | |
498 | return 0; | |
499 | ||
500 | /* If there are more levels of template parameters than there are | |
501 | template classes surrounding the declaration, then we have a | |
502 | member template. */ | |
36a117a5 | 503 | return (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (t)) > |
2ee4e084 MM |
504 | template_class_depth (DECL_CONTEXT (t))); |
505 | } | |
ba4f4e5d | 506 | #endif |
2ee4e084 | 507 | |
36a117a5 | 508 | /* Return a new template argument vector which contains all of ARGS, |
f9a7ae04 | 509 | but has as its innermost set of arguments the EXTRA_ARGS. */ |
e6f1275f JM |
510 | |
511 | static tree | |
3a978d72 | 512 | add_to_template_args (tree args, tree extra_args) |
e6f1275f | 513 | { |
36a117a5 MM |
514 | tree new_args; |
515 | int extra_depth; | |
516 | int i; | |
517 | int j; | |
e6f1275f | 518 | |
36a117a5 | 519 | extra_depth = TMPL_ARGS_DEPTH (extra_args); |
f31c0a32 | 520 | new_args = make_tree_vec (TMPL_ARGS_DEPTH (args) + extra_depth); |
e6f1275f | 521 | |
36a117a5 MM |
522 | for (i = 1; i <= TMPL_ARGS_DEPTH (args); ++i) |
523 | SET_TMPL_ARGS_LEVEL (new_args, i, TMPL_ARGS_LEVEL (args, i)); | |
e6f1275f | 524 | |
36a117a5 MM |
525 | for (j = 1; j <= extra_depth; ++j, ++i) |
526 | SET_TMPL_ARGS_LEVEL (new_args, i, TMPL_ARGS_LEVEL (extra_args, j)); | |
527 | ||
e6f1275f JM |
528 | return new_args; |
529 | } | |
530 | ||
36a117a5 MM |
531 | /* Like add_to_template_args, but only the outermost ARGS are added to |
532 | the EXTRA_ARGS. In particular, all but TMPL_ARGS_DEPTH | |
533 | (EXTRA_ARGS) levels are added. This function is used to combine | |
534 | the template arguments from a partial instantiation with the | |
535 | template arguments used to attain the full instantiation from the | |
536 | partial instantiation. */ | |
98c1c668 | 537 | |
4966381a | 538 | static tree |
3a978d72 | 539 | add_outermost_template_args (tree args, tree extra_args) |
98c1c668 JM |
540 | { |
541 | tree new_args; | |
542 | ||
e4a84209 MM |
543 | /* If there are more levels of EXTRA_ARGS than there are ARGS, |
544 | something very fishy is going on. */ | |
545 | my_friendly_assert (TMPL_ARGS_DEPTH (args) >= TMPL_ARGS_DEPTH (extra_args), | |
546 | 0); | |
547 | ||
548 | /* If *all* the new arguments will be the EXTRA_ARGS, just return | |
549 | them. */ | |
550 | if (TMPL_ARGS_DEPTH (args) == TMPL_ARGS_DEPTH (extra_args)) | |
551 | return extra_args; | |
552 | ||
36a117a5 MM |
553 | /* For the moment, we make ARGS look like it contains fewer levels. */ |
554 | TREE_VEC_LENGTH (args) -= TMPL_ARGS_DEPTH (extra_args); | |
555 | ||
556 | new_args = add_to_template_args (args, extra_args); | |
98c1c668 | 557 | |
36a117a5 MM |
558 | /* Now, we restore ARGS to its full dimensions. */ |
559 | TREE_VEC_LENGTH (args) += TMPL_ARGS_DEPTH (extra_args); | |
98c1c668 JM |
560 | |
561 | return new_args; | |
562 | } | |
5566b478 | 563 | |
f9a7ae04 MM |
564 | /* Return the N levels of innermost template arguments from the ARGS. */ |
565 | ||
566 | tree | |
3a978d72 | 567 | get_innermost_template_args (tree args, int n) |
f9a7ae04 MM |
568 | { |
569 | tree new_args; | |
570 | int extra_levels; | |
571 | int i; | |
572 | ||
573 | my_friendly_assert (n >= 0, 20000603); | |
574 | ||
575 | /* If N is 1, just return the innermost set of template arguments. */ | |
576 | if (n == 1) | |
577 | return TMPL_ARGS_LEVEL (args, TMPL_ARGS_DEPTH (args)); | |
578 | ||
579 | /* If we're not removing anything, just return the arguments we were | |
580 | given. */ | |
581 | extra_levels = TMPL_ARGS_DEPTH (args) - n; | |
582 | my_friendly_assert (extra_levels >= 0, 20000603); | |
583 | if (extra_levels == 0) | |
584 | return args; | |
585 | ||
586 | /* Make a new set of arguments, not containing the outer arguments. */ | |
587 | new_args = make_tree_vec (n); | |
588 | for (i = 1; i <= n; ++i) | |
589 | SET_TMPL_ARGS_LEVEL (new_args, i, | |
590 | TMPL_ARGS_LEVEL (args, i + extra_levels)); | |
591 | ||
592 | return new_args; | |
593 | } | |
594 | ||
5566b478 MS |
595 | /* We've got a template header coming up; push to a new level for storing |
596 | the parms. */ | |
8d08fdba | 597 | |
8d08fdba | 598 | void |
3a978d72 | 599 | begin_template_parm_list (void) |
8d08fdba | 600 | { |
6757edfe MM |
601 | /* We use a non-tag-transparent scope here, which causes pushtag to |
602 | put tags in this scope, rather than in the enclosing class or | |
603 | namespace scope. This is the right thing, since we want | |
604 | TEMPLATE_DECLS, and not TYPE_DECLS for template classes. For a | |
605 | global template class, push_template_decl handles putting the | |
606 | TEMPLATE_DECL into top-level scope. For a nested template class, | |
607 | e.g.: | |
608 | ||
609 | template <class T> struct S1 { | |
610 | template <class T> struct S2 {}; | |
611 | }; | |
612 | ||
613 | pushtag contains special code to call pushdecl_with_scope on the | |
614 | TEMPLATE_DECL for S2. */ | |
ac20c67a | 615 | begin_scope (sk_template_parms, NULL); |
5156628f | 616 | ++processing_template_decl; |
67ffc812 | 617 | ++processing_template_parmlist; |
386b8a85 JM |
618 | note_template_header (0); |
619 | } | |
620 | ||
6c30752f | 621 | /* This routine is called when a specialization is declared. If it is |
0e339752 | 622 | invalid to declare a specialization here, an error is reported. */ |
6c30752f | 623 | |
e9659ab0 | 624 | static void |
3a978d72 | 625 | check_specialization_scope (void) |
6c30752f MM |
626 | { |
627 | tree scope = current_scope (); | |
3ddfb0e6 | 628 | |
6c30752f MM |
629 | /* [temp.expl.spec] |
630 | ||
631 | An explicit specialization shall be declared in the namespace of | |
632 | which the template is a member, or, for member templates, in the | |
633 | namespace of which the enclosing class or enclosing class | |
634 | template is a member. An explicit specialization of a member | |
635 | function, member class or static data member of a class template | |
636 | shall be declared in the namespace of which the class template | |
637 | is a member. */ | |
638 | if (scope && TREE_CODE (scope) != NAMESPACE_DECL) | |
33bd39a2 | 639 | error ("explicit specialization in non-namespace scope `%D'", |
6c30752f | 640 | scope); |
3ddfb0e6 | 641 | |
6c30752f MM |
642 | /* [temp.expl.spec] |
643 | ||
644 | In an explicit specialization declaration for a member of a class | |
645 | template or a member template that appears in namespace scope, | |
646 | the member template and some of its enclosing class templates may | |
647 | remain unspecialized, except that the declaration shall not | |
648 | explicitly specialize a class member template if its enclosing | |
649 | class templates are not explicitly specialized as well. */ | |
650 | if (current_template_parms) | |
33bd39a2 | 651 | error ("enclosing class templates are not explicitly specialized"); |
6c30752f MM |
652 | } |
653 | ||
c6002625 | 654 | /* We've just seen template <>. */ |
386b8a85 JM |
655 | |
656 | void | |
3a978d72 | 657 | begin_specialization (void) |
386b8a85 | 658 | { |
ac20c67a | 659 | begin_scope (sk_template_spec, NULL); |
386b8a85 | 660 | note_template_header (1); |
6c30752f | 661 | check_specialization_scope (); |
386b8a85 JM |
662 | } |
663 | ||
dc957d14 | 664 | /* Called at then end of processing a declaration preceded by |
386b8a85 JM |
665 | template<>. */ |
666 | ||
667 | void | |
3a978d72 | 668 | end_specialization (void) |
386b8a85 | 669 | { |
74b846e0 | 670 | finish_scope (); |
386b8a85 JM |
671 | reset_specialization (); |
672 | } | |
673 | ||
386b8a85 | 674 | /* Any template <>'s that we have seen thus far are not referring to a |
c6002625 | 675 | function specialization. */ |
386b8a85 JM |
676 | |
677 | void | |
3a978d72 | 678 | reset_specialization (void) |
386b8a85 JM |
679 | { |
680 | processing_specialization = 0; | |
681 | template_header_count = 0; | |
682 | } | |
683 | ||
838dfd8a | 684 | /* We've just seen a template header. If SPECIALIZATION is nonzero, |
386b8a85 JM |
685 | it was of the form template <>. */ |
686 | ||
4966381a | 687 | static void |
3a978d72 | 688 | note_template_header (int specialization) |
386b8a85 JM |
689 | { |
690 | processing_specialization = specialization; | |
691 | template_header_count++; | |
692 | } | |
693 | ||
75650646 | 694 | /* We're beginning an explicit instantiation. */ |
386b8a85 | 695 | |
75650646 | 696 | void |
3a978d72 | 697 | begin_explicit_instantiation (void) |
386b8a85 | 698 | { |
a723baf1 MM |
699 | my_friendly_assert (!processing_explicit_instantiation, 20020913); |
700 | processing_explicit_instantiation = true; | |
75650646 | 701 | } |
386b8a85 | 702 | |
386b8a85 | 703 | |
75650646 | 704 | void |
3a978d72 | 705 | end_explicit_instantiation (void) |
75650646 | 706 | { |
a723baf1 MM |
707 | my_friendly_assert(processing_explicit_instantiation, 20020913); |
708 | processing_explicit_instantiation = false; | |
75650646 | 709 | } |
386b8a85 | 710 | |
36a117a5 MM |
711 | /* The TYPE is being declared. If it is a template type, that means it |
712 | is a partial specialization. Do appropriate error-checking. */ | |
713 | ||
714 | void | |
3a978d72 | 715 | maybe_process_partial_specialization (tree type) |
36a117a5 | 716 | { |
6e049fcd KL |
717 | /* TYPE maybe an ERROR_MARK_NODE. */ |
718 | tree context = TYPE_P (type) ? TYPE_CONTEXT (type) : NULL_TREE; | |
719 | ||
a723baf1 | 720 | if (CLASS_TYPE_P (type) && CLASSTYPE_USE_TEMPLATE (type)) |
36a117a5 | 721 | { |
6e049fcd KL |
722 | /* This is for ordinary explicit specialization and partial |
723 | specialization of a template class such as: | |
724 | ||
725 | template <> class C<int>; | |
726 | ||
727 | or: | |
728 | ||
729 | template <class T> class C<T*>; | |
730 | ||
731 | Make sure that `C<int>' and `C<T*>' are implicit instantiations. */ | |
732 | ||
36a117a5 | 733 | if (CLASSTYPE_IMPLICIT_INSTANTIATION (type) |
d0f062fb | 734 | && !COMPLETE_TYPE_P (type)) |
36a117a5 | 735 | { |
86098eb8 JM |
736 | tree tpl_ns = decl_namespace_context (CLASSTYPE_TI_TEMPLATE (type)); |
737 | if (is_associated_namespace (current_namespace, tpl_ns)) | |
8329559d | 738 | /* Same or super-using namespace. */; |
86098eb8 | 739 | else |
700466c2 | 740 | { |
33bd39a2 | 741 | pedwarn ("specializing `%#T' in different namespace", type); |
700466c2 JM |
742 | cp_pedwarn_at (" from definition of `%#D'", |
743 | CLASSTYPE_TI_TEMPLATE (type)); | |
744 | } | |
370af2d5 | 745 | SET_CLASSTYPE_TEMPLATE_SPECIALIZATION (type); |
36a117a5 MM |
746 | if (processing_template_decl) |
747 | push_template_decl (TYPE_MAIN_DECL (type)); | |
748 | } | |
749 | else if (CLASSTYPE_TEMPLATE_INSTANTIATION (type)) | |
33bd39a2 | 750 | error ("specialization of `%T' after instantiation", type); |
36a117a5 | 751 | } |
6e049fcd KL |
752 | else if (CLASS_TYPE_P (type) |
753 | && !CLASSTYPE_USE_TEMPLATE (type) | |
754 | && CLASSTYPE_TEMPLATE_INFO (type) | |
755 | && context && CLASS_TYPE_P (context) | |
756 | && CLASSTYPE_TEMPLATE_INFO (context)) | |
757 | { | |
758 | /* This is for an explicit specialization of member class | |
759 | template according to [temp.expl.spec/18]: | |
760 | ||
761 | template <> template <class U> class C<int>::D; | |
762 | ||
763 | The context `C<int>' must be an implicit instantiation. | |
764 | Otherwise this is just a member class template declared | |
765 | earlier like: | |
766 | ||
767 | template <> class C<int> { template <class U> class D; }; | |
768 | template <> template <class U> class C<int>::D; | |
769 | ||
770 | In the first case, `C<int>::D' is a specialization of `C<T>::D' | |
771 | while in the second case, `C<int>::D' is a primary template | |
772 | and `C<T>::D' may not exist. */ | |
773 | ||
774 | if (CLASSTYPE_IMPLICIT_INSTANTIATION (context) | |
775 | && !COMPLETE_TYPE_P (type)) | |
776 | { | |
777 | tree t; | |
778 | ||
779 | if (current_namespace | |
780 | != decl_namespace_context (CLASSTYPE_TI_TEMPLATE (type))) | |
781 | { | |
782 | pedwarn ("specializing `%#T' in different namespace", type); | |
783 | cp_pedwarn_at (" from definition of `%#D'", | |
784 | CLASSTYPE_TI_TEMPLATE (type)); | |
785 | } | |
786 | ||
787 | /* Check for invalid specialization after instantiation: | |
788 | ||
789 | template <> template <> class C<int>::D<int>; | |
790 | template <> template <class U> class C<int>::D; */ | |
791 | ||
792 | for (t = DECL_TEMPLATE_INSTANTIATIONS | |
793 | (most_general_template (CLASSTYPE_TI_TEMPLATE (type))); | |
794 | t; t = TREE_CHAIN (t)) | |
795 | if (TREE_VALUE (t) != type | |
796 | && TYPE_CONTEXT (TREE_VALUE (t)) == context) | |
797 | error ("specialization `%T' after instantiation `%T'", | |
798 | type, TREE_VALUE (t)); | |
799 | ||
800 | /* Mark TYPE as a specialization. And as a result, we only | |
801 | have one level of template argument for the innermost | |
802 | class template. */ | |
803 | SET_CLASSTYPE_TEMPLATE_SPECIALIZATION (type); | |
804 | CLASSTYPE_TI_ARGS (type) | |
805 | = INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (type)); | |
806 | } | |
807 | } | |
20496fa2 | 808 | else if (processing_specialization) |
33bd39a2 | 809 | error ("explicit specialization of non-template `%T'", type); |
36a117a5 MM |
810 | } |
811 | ||
75650646 MM |
812 | /* Retrieve the specialization (in the sense of [temp.spec] - a |
813 | specialization is either an instantiation or an explicit | |
814 | specialization) of TMPL for the given template ARGS. If there is | |
815 | no such specialization, return NULL_TREE. The ARGS are a vector of | |
816 | arguments, or a vector of vectors of arguments, in the case of | |
817 | templates with more than one level of parameters. */ | |
818 | ||
819 | static tree | |
3a978d72 | 820 | retrieve_specialization (tree tmpl, tree args) |
75650646 MM |
821 | { |
822 | tree s; | |
823 | ||
824 | my_friendly_assert (TREE_CODE (tmpl) == TEMPLATE_DECL, 0); | |
825 | ||
36a117a5 MM |
826 | /* There should be as many levels of arguments as there are |
827 | levels of parameters. */ | |
828 | my_friendly_assert (TMPL_ARGS_DEPTH (args) | |
829 | == TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl)), | |
830 | 0); | |
831 | ||
75650646 MM |
832 | for (s = DECL_TEMPLATE_SPECIALIZATIONS (tmpl); |
833 | s != NULL_TREE; | |
834 | s = TREE_CHAIN (s)) | |
835 | if (comp_template_args (TREE_PURPOSE (s), args)) | |
836 | return TREE_VALUE (s); | |
837 | ||
838 | return NULL_TREE; | |
386b8a85 JM |
839 | } |
840 | ||
dc957d14 | 841 | /* Like retrieve_specialization, but for local declarations. */ |
9188c363 MM |
842 | |
843 | static tree | |
3a978d72 | 844 | retrieve_local_specialization (tree tmpl) |
9188c363 | 845 | { |
c68b0a84 KG |
846 | tree spec = htab_find_with_hash (local_specializations, tmpl, |
847 | htab_hash_pointer (tmpl)); | |
a723baf1 | 848 | return spec ? TREE_PURPOSE (spec) : NULL_TREE; |
9188c363 MM |
849 | } |
850 | ||
838dfd8a | 851 | /* Returns nonzero iff DECL is a specialization of TMPL. */ |
6757edfe MM |
852 | |
853 | int | |
3a978d72 | 854 | is_specialization_of (tree decl, tree tmpl) |
6757edfe MM |
855 | { |
856 | tree t; | |
857 | ||
858 | if (TREE_CODE (decl) == FUNCTION_DECL) | |
859 | { | |
860 | for (t = decl; | |
861 | t != NULL_TREE; | |
862 | t = DECL_TEMPLATE_INFO (t) ? DECL_TI_TEMPLATE (t) : NULL_TREE) | |
863 | if (t == tmpl) | |
864 | return 1; | |
865 | } | |
866 | else | |
867 | { | |
868 | my_friendly_assert (TREE_CODE (decl) == TYPE_DECL, 0); | |
869 | ||
870 | for (t = TREE_TYPE (decl); | |
871 | t != NULL_TREE; | |
872 | t = CLASSTYPE_USE_TEMPLATE (t) | |
873 | ? TREE_TYPE (CLASSTYPE_TI_TEMPLATE (t)) : NULL_TREE) | |
9edc3913 | 874 | if (same_type_ignoring_top_level_qualifiers_p (t, TREE_TYPE (tmpl))) |
6757edfe MM |
875 | return 1; |
876 | } | |
386b8a85 | 877 | |
6757edfe MM |
878 | return 0; |
879 | } | |
75650646 | 880 | |
d43f603d KL |
881 | /* Returns nonzero iff DECL is a specialization of friend declaration |
882 | FRIEND according to [temp.friend]. */ | |
883 | ||
884 | bool | |
885 | is_specialization_of_friend (tree decl, tree friend) | |
886 | { | |
887 | bool need_template = true; | |
888 | int template_depth; | |
889 | ||
890 | my_friendly_assert (TREE_CODE (decl) == FUNCTION_DECL, 0); | |
891 | ||
892 | /* For [temp.friend/6] when FRIEND is an ordinary member function | |
893 | of a template class, we want to check if DECL is a specialization | |
894 | if this. */ | |
895 | if (TREE_CODE (friend) == FUNCTION_DECL | |
896 | && DECL_TEMPLATE_INFO (friend) | |
897 | && !DECL_USE_TEMPLATE (friend)) | |
898 | { | |
899 | friend = DECL_TI_TEMPLATE (friend); | |
900 | need_template = false; | |
901 | } | |
902 | ||
903 | /* There is nothing to do if this is not a template friend. */ | |
904 | if (TREE_CODE (friend) != TEMPLATE_DECL) | |
905 | return 0; | |
906 | ||
907 | if (is_specialization_of (decl, friend)) | |
908 | return 1; | |
909 | ||
910 | /* [temp.friend/6] | |
911 | A member of a class template may be declared to be a friend of a | |
912 | non-template class. In this case, the corresponding member of | |
913 | every specialization of the class template is a friend of the | |
914 | class granting friendship. | |
915 | ||
916 | For example, given a template friend declaration | |
917 | ||
918 | template <class T> friend void A<T>::f(); | |
919 | ||
920 | the member function below is considered a friend | |
921 | ||
922 | template <> struct A<int> { | |
923 | void f(); | |
924 | }; | |
925 | ||
926 | For this type of template friend, TEMPLATE_DEPTH below will be | |
5c425df5 | 927 | nonzero. To determine if DECL is a friend of FRIEND, we first |
d43f603d KL |
928 | check if the enclosing class is a specialization of another. */ |
929 | ||
930 | template_depth = template_class_depth (DECL_CONTEXT (friend)); | |
931 | if (template_depth | |
932 | && DECL_CLASS_SCOPE_P (decl) | |
933 | && is_specialization_of (TYPE_NAME (DECL_CONTEXT (decl)), | |
934 | CLASSTYPE_TI_TEMPLATE (DECL_CONTEXT (friend)))) | |
935 | { | |
936 | /* Next, we check the members themselves. In order to handle | |
937 | a few tricky cases like | |
938 | ||
939 | template <class T> friend void A<T>::g(T t); | |
940 | template <class T> template <T t> friend void A<T>::h(); | |
941 | ||
942 | we need to figure out what ARGS is (corresponding to `T' in above | |
943 | examples) from DECL for later processing. */ | |
944 | ||
945 | tree context = DECL_CONTEXT (decl); | |
946 | tree args = NULL_TREE; | |
947 | int current_depth = 0; | |
948 | while (current_depth < template_depth) | |
949 | { | |
950 | if (CLASSTYPE_TEMPLATE_INFO (context)) | |
951 | { | |
952 | if (current_depth == 0) | |
953 | args = TYPE_TI_ARGS (context); | |
954 | else | |
955 | args = add_to_template_args (TYPE_TI_ARGS (context), args); | |
956 | current_depth++; | |
957 | } | |
958 | context = TYPE_CONTEXT (context); | |
959 | } | |
960 | ||
961 | if (TREE_CODE (decl) == FUNCTION_DECL) | |
962 | { | |
963 | bool is_template; | |
964 | tree friend_type; | |
965 | tree decl_type; | |
966 | tree friend_args_type; | |
967 | tree decl_args_type; | |
968 | ||
969 | /* Make sure that both DECL and FRIEND are templates or | |
970 | non-templates. */ | |
971 | is_template = DECL_TEMPLATE_INFO (decl) | |
972 | && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (decl)); | |
973 | if (need_template ^ is_template) | |
974 | return 0; | |
975 | else if (is_template) | |
976 | { | |
da1d7781 | 977 | /* If both are templates, check template parameter list. */ |
d43f603d KL |
978 | tree friend_parms |
979 | = tsubst_template_parms (DECL_TEMPLATE_PARMS (friend), | |
980 | args, tf_none); | |
981 | if (!comp_template_parms | |
982 | (DECL_TEMPLATE_PARMS (DECL_TI_TEMPLATE (decl)), | |
983 | friend_parms)) | |
984 | return 0; | |
985 | ||
986 | decl_type = TREE_TYPE (DECL_TI_TEMPLATE (decl)); | |
987 | } | |
988 | else | |
989 | decl_type = TREE_TYPE (decl); | |
990 | ||
991 | friend_type = tsubst_function_type (TREE_TYPE (friend), args, | |
992 | tf_none, NULL_TREE); | |
993 | if (friend_type == error_mark_node) | |
994 | return 0; | |
995 | ||
996 | /* Check if return types match. */ | |
997 | if (!same_type_p (TREE_TYPE (decl_type), TREE_TYPE (friend_type))) | |
998 | return 0; | |
999 | ||
1000 | /* Check if function parameter types match, ignoring the | |
1001 | `this' parameter. */ | |
1002 | friend_args_type = TYPE_ARG_TYPES (friend_type); | |
1003 | decl_args_type = TYPE_ARG_TYPES (decl_type); | |
1004 | if (DECL_NONSTATIC_MEMBER_FUNCTION_P (friend)) | |
1005 | friend_args_type = TREE_CHAIN (friend_args_type); | |
1006 | if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl)) | |
1007 | decl_args_type = TREE_CHAIN (decl_args_type); | |
1008 | if (compparms (decl_args_type, friend_args_type)) | |
1009 | return 1; | |
1010 | } | |
1011 | } | |
1012 | return 0; | |
1013 | } | |
1014 | ||
75650646 | 1015 | /* Register the specialization SPEC as a specialization of TMPL with |
36a117a5 MM |
1016 | the indicated ARGS. Returns SPEC, or an equivalent prior |
1017 | declaration, if available. */ | |
75650646 | 1018 | |
36a117a5 | 1019 | static tree |
3a978d72 | 1020 | register_specialization (tree spec, tree tmpl, tree args) |
75650646 MM |
1021 | { |
1022 | tree s; | |
1023 | ||
1024 | my_friendly_assert (TREE_CODE (tmpl) == TEMPLATE_DECL, 0); | |
1025 | ||
36a117a5 MM |
1026 | if (TREE_CODE (spec) == FUNCTION_DECL |
1027 | && uses_template_parms (DECL_TI_ARGS (spec))) | |
1028 | /* This is the FUNCTION_DECL for a partial instantiation. Don't | |
1029 | register it; we want the corresponding TEMPLATE_DECL instead. | |
1030 | We use `uses_template_parms (DECL_TI_ARGS (spec))' rather than | |
1031 | the more obvious `uses_template_parms (spec)' to avoid problems | |
1032 | with default function arguments. In particular, given | |
1033 | something like this: | |
1034 | ||
1035 | template <class T> void f(T t1, T t = T()) | |
1036 | ||
1037 | the default argument expression is not substituted for in an | |
1038 | instantiation unless and until it is actually needed. */ | |
1039 | return spec; | |
28ba38e3 | 1040 | |
36a117a5 MM |
1041 | /* There should be as many levels of arguments as there are |
1042 | levels of parameters. */ | |
1043 | my_friendly_assert (TMPL_ARGS_DEPTH (args) | |
1044 | == TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl)), | |
1045 | 0); | |
1046 | ||
75650646 MM |
1047 | for (s = DECL_TEMPLATE_SPECIALIZATIONS (tmpl); |
1048 | s != NULL_TREE; | |
1049 | s = TREE_CHAIN (s)) | |
22e9174f MM |
1050 | { |
1051 | tree fn = TREE_VALUE (s); | |
1052 | ||
1053 | /* We can sometimes try to re-register a specialization that we've | |
1054 | already got. In particular, regenerate_decl_from_template | |
1055 | calls duplicate_decls which will update the specialization | |
1056 | list. But, we'll still get called again here anyhow. It's | |
1057 | more convenient to simply allow this than to try to prevent it. */ | |
1058 | if (fn == spec) | |
1059 | return spec; | |
1060 | else if (comp_template_args (TREE_PURPOSE (s), args)) | |
1061 | { | |
1062 | if (DECL_TEMPLATE_SPECIALIZATION (spec)) | |
1063 | { | |
1064 | if (DECL_TEMPLATE_INSTANTIATION (fn)) | |
1065 | { | |
1066 | if (TREE_USED (fn) | |
1067 | || DECL_EXPLICIT_INSTANTIATION (fn)) | |
1068 | { | |
33bd39a2 | 1069 | error ("specialization of %D after instantiation", |
22e9174f MM |
1070 | fn); |
1071 | return spec; | |
1072 | } | |
1073 | else | |
1074 | { | |
1075 | /* This situation should occur only if the first | |
1076 | specialization is an implicit instantiation, | |
1077 | the second is an explicit specialization, and | |
1078 | the implicit instantiation has not yet been | |
1079 | used. That situation can occur if we have | |
1080 | implicitly instantiated a member function and | |
1081 | then specialized it later. | |
1082 | ||
1083 | We can also wind up here if a friend | |
1084 | declaration that looked like an instantiation | |
1085 | turns out to be a specialization: | |
1086 | ||
1087 | template <class T> void foo(T); | |
1088 | class S { friend void foo<>(int) }; | |
1089 | template <> void foo(int); | |
1090 | ||
1091 | We transform the existing DECL in place so that | |
1092 | any pointers to it become pointers to the | |
1093 | updated declaration. | |
1094 | ||
1095 | If there was a definition for the template, but | |
1096 | not for the specialization, we want this to | |
852dcbdd | 1097 | look as if there were no definition, and vice |
22e9174f MM |
1098 | versa. */ |
1099 | DECL_INITIAL (fn) = NULL_TREE; | |
1100 | duplicate_decls (spec, fn); | |
1101 | ||
1102 | return fn; | |
1103 | } | |
1104 | } | |
1105 | else if (DECL_TEMPLATE_SPECIALIZATION (fn)) | |
1106 | { | |
b190f239 | 1107 | if (!duplicate_decls (spec, fn) && DECL_INITIAL (spec)) |
f31686a3 RH |
1108 | /* Dup decl failed, but this is a new |
1109 | definition. Set the line number so any errors | |
1110 | match this new definition. */ | |
1111 | DECL_SOURCE_LOCATION (fn) = DECL_SOURCE_LOCATION (spec); | |
b190f239 | 1112 | |
22e9174f MM |
1113 | return fn; |
1114 | } | |
1115 | } | |
1116 | } | |
75650646 MM |
1117 | } |
1118 | ||
1119 | DECL_TEMPLATE_SPECIALIZATIONS (tmpl) | |
e1b3e07d | 1120 | = tree_cons (args, spec, DECL_TEMPLATE_SPECIALIZATIONS (tmpl)); |
36a117a5 MM |
1121 | |
1122 | return spec; | |
1123 | } | |
1124 | ||
1125 | /* Unregister the specialization SPEC as a specialization of TMPL. | |
b3445994 MM |
1126 | Replace it with NEW_SPEC, if NEW_SPEC is non-NULL. Returns true |
1127 | if the SPEC was listed as a specialization of TMPL. */ | |
36a117a5 | 1128 | |
b3445994 MM |
1129 | bool |
1130 | reregister_specialization (tree spec, tree tmpl, tree new_spec) | |
36a117a5 MM |
1131 | { |
1132 | tree* s; | |
1133 | ||
1134 | for (s = &DECL_TEMPLATE_SPECIALIZATIONS (tmpl); | |
1135 | *s != NULL_TREE; | |
1136 | s = &TREE_CHAIN (*s)) | |
1137 | if (TREE_VALUE (*s) == spec) | |
1138 | { | |
b3445994 MM |
1139 | if (!new_spec) |
1140 | *s = TREE_CHAIN (*s); | |
1141 | else | |
a3d87771 | 1142 | TREE_VALUE (*s) = new_spec; |
36a117a5 MM |
1143 | return 1; |
1144 | } | |
1145 | ||
1146 | return 0; | |
75650646 MM |
1147 | } |
1148 | ||
a723baf1 MM |
1149 | /* Compare an entry in the local specializations hash table P1 (which |
1150 | is really a pointer to a TREE_LIST) with P2 (which is really a | |
1151 | DECL). */ | |
1152 | ||
1153 | static int | |
1154 | eq_local_specializations (const void *p1, const void *p2) | |
1155 | { | |
1156 | return TREE_VALUE ((tree) p1) == (tree) p2; | |
1157 | } | |
1158 | ||
69f794a7 MM |
1159 | /* Hash P1, an entry in the local specializations table. */ |
1160 | ||
1161 | static hashval_t | |
1162 | hash_local_specialization (const void* p1) | |
1163 | { | |
1164 | return htab_hash_pointer (TREE_VALUE ((tree) p1)); | |
1165 | } | |
1166 | ||
6dfbb909 MM |
1167 | /* Like register_specialization, but for local declarations. We are |
1168 | registering SPEC, an instantiation of TMPL. */ | |
9188c363 | 1169 | |
414ea4aa | 1170 | static void |
3a978d72 | 1171 | register_local_specialization (tree spec, tree tmpl) |
9188c363 | 1172 | { |
6dfbb909 MM |
1173 | void **slot; |
1174 | ||
69f794a7 MM |
1175 | slot = htab_find_slot_with_hash (local_specializations, tmpl, |
1176 | htab_hash_pointer (tmpl), INSERT); | |
a723baf1 | 1177 | *slot = build_tree_list (spec, tmpl); |
9188c363 MM |
1178 | } |
1179 | ||
e1467ff2 MM |
1180 | /* Print the list of candidate FNS in an error message. */ |
1181 | ||
104bf76a | 1182 | void |
3a978d72 | 1183 | print_candidates (tree fns) |
e1467ff2 MM |
1184 | { |
1185 | tree fn; | |
1186 | ||
d8e178a0 | 1187 | const char *str = "candidates are:"; |
e1467ff2 MM |
1188 | |
1189 | for (fn = fns; fn != NULL_TREE; fn = TREE_CHAIN (fn)) | |
1190 | { | |
d6479fe7 MM |
1191 | tree f; |
1192 | ||
1193 | for (f = TREE_VALUE (fn); f; f = OVL_NEXT (f)) | |
1194 | cp_error_at ("%s %+#D", str, OVL_CURRENT (f)); | |
e1467ff2 MM |
1195 | str = " "; |
1196 | } | |
1197 | } | |
1198 | ||
75650646 | 1199 | /* Returns the template (one of the functions given by TEMPLATE_ID) |
e1467ff2 | 1200 | which can be specialized to match the indicated DECL with the |
03017874 MM |
1201 | explicit template args given in TEMPLATE_ID. The DECL may be |
1202 | NULL_TREE if none is available. In that case, the functions in | |
1203 | TEMPLATE_ID are non-members. | |
1204 | ||
838dfd8a | 1205 | If NEED_MEMBER_TEMPLATE is nonzero the function is known to be a |
03017874 MM |
1206 | specialization of a member template. |
1207 | ||
1208 | The template args (those explicitly specified and those deduced) | |
1209 | are output in a newly created vector *TARGS_OUT. | |
1210 | ||
1211 | If it is impossible to determine the result, an error message is | |
bf8f3f93 | 1212 | issued. The error_mark_node is returned to indicate failure. */ |
75650646 | 1213 | |
e9659ab0 | 1214 | static tree |
3a978d72 NN |
1215 | determine_specialization (tree template_id, |
1216 | tree decl, | |
1217 | tree* targs_out, | |
1218 | int need_member_template) | |
386b8a85 | 1219 | { |
03017874 MM |
1220 | tree fns; |
1221 | tree targs; | |
1222 | tree explicit_targs; | |
1223 | tree candidates = NULL_TREE; | |
1224 | tree templates = NULL_TREE; | |
386b8a85 | 1225 | |
e1467ff2 MM |
1226 | *targs_out = NULL_TREE; |
1227 | ||
f2e48b67 BK |
1228 | if (template_id == error_mark_node) |
1229 | return error_mark_node; | |
1230 | ||
1231 | fns = TREE_OPERAND (template_id, 0); | |
03017874 | 1232 | explicit_targs = TREE_OPERAND (template_id, 1); |
f2e48b67 | 1233 | |
27fafc8d JM |
1234 | if (fns == error_mark_node) |
1235 | return error_mark_node; | |
1236 | ||
c6002625 | 1237 | /* Check for baselinks. */ |
91e490ab | 1238 | if (BASELINK_P (fns)) |
da15dae6 | 1239 | fns = BASELINK_FUNCTIONS (fns); |
386b8a85 | 1240 | |
91e490ab MM |
1241 | if (!is_overloaded_fn (fns)) |
1242 | { | |
33bd39a2 | 1243 | error ("`%D' is not a function template", fns); |
91e490ab MM |
1244 | return error_mark_node; |
1245 | } | |
1246 | ||
2c73f9f5 | 1247 | for (; fns; fns = OVL_NEXT (fns)) |
386b8a85 | 1248 | { |
9dfce8fd | 1249 | tree fn = OVL_CURRENT (fns); |
03017874 MM |
1250 | |
1251 | if (TREE_CODE (fn) == TEMPLATE_DECL) | |
d955f6ea KL |
1252 | { |
1253 | tree decl_arg_types; | |
0da99d4e | 1254 | tree fn_arg_types; |
d955f6ea KL |
1255 | |
1256 | /* DECL might be a specialization of FN. */ | |
1257 | ||
1258 | /* Adjust the type of DECL in case FN is a static member. */ | |
1259 | decl_arg_types = TYPE_ARG_TYPES (TREE_TYPE (decl)); | |
1260 | if (DECL_STATIC_FUNCTION_P (fn) | |
1261 | && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl)) | |
1262 | decl_arg_types = TREE_CHAIN (decl_arg_types); | |
1263 | ||
1264 | /* Check that the number of function parameters matches. | |
1265 | For example, | |
1266 | template <class T> void f(int i = 0); | |
1267 | template <> void f<int>(); | |
0e339752 | 1268 | The specialization f<int> is invalid but is not caught |
d955f6ea KL |
1269 | by get_bindings below. */ |
1270 | ||
0da99d4e GB |
1271 | fn_arg_types = TYPE_ARG_TYPES (TREE_TYPE (fn)); |
1272 | if (list_length (fn_arg_types) != list_length (decl_arg_types)) | |
1273 | continue; | |
1274 | ||
1275 | /* For a non-static member function, we need to make sure that | |
1276 | the const qualification is the same. This can be done by | |
1277 | checking the 'this' in the argument list. */ | |
1278 | if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fn) | |
1279 | && !same_type_p (TREE_VALUE (fn_arg_types), | |
1280 | TREE_VALUE (decl_arg_types))) | |
d955f6ea KL |
1281 | continue; |
1282 | ||
1283 | /* See whether this function might be a specialization of this | |
1284 | template. */ | |
1285 | targs = get_bindings (fn, decl, explicit_targs); | |
1286 | ||
1287 | if (!targs) | |
1288 | /* We cannot deduce template arguments that when used to | |
1289 | specialize TMPL will produce DECL. */ | |
1290 | continue; | |
1291 | ||
1292 | /* Save this template, and the arguments deduced. */ | |
1293 | templates = tree_cons (targs, fn, templates); | |
1294 | } | |
03017874 MM |
1295 | else if (need_member_template) |
1296 | /* FN is an ordinary member function, and we need a | |
1297 | specialization of a member template. */ | |
d955f6ea | 1298 | ; |
03017874 MM |
1299 | else if (TREE_CODE (fn) != FUNCTION_DECL) |
1300 | /* We can get IDENTIFIER_NODEs here in certain erroneous | |
1301 | cases. */ | |
d955f6ea | 1302 | ; |
03017874 MM |
1303 | else if (!DECL_FUNCTION_MEMBER_P (fn)) |
1304 | /* This is just an ordinary non-member function. Nothing can | |
1305 | be a specialization of that. */ | |
d955f6ea | 1306 | ; |
3b82c249 KL |
1307 | else if (DECL_ARTIFICIAL (fn)) |
1308 | /* Cannot specialize functions that are created implicitly. */ | |
d955f6ea | 1309 | ; |
75650646 | 1310 | else |
03017874 MM |
1311 | { |
1312 | tree decl_arg_types; | |
386b8a85 | 1313 | |
03017874 MM |
1314 | /* This is an ordinary member function. However, since |
1315 | we're here, we can assume it's enclosing class is a | |
1316 | template class. For example, | |
1317 | ||
1318 | template <typename T> struct S { void f(); }; | |
1319 | template <> void S<int>::f() {} | |
1320 | ||
1321 | Here, S<int>::f is a non-template, but S<int> is a | |
1322 | template class. If FN has the same type as DECL, we | |
1323 | might be in business. */ | |
f5d47abd KL |
1324 | |
1325 | if (!DECL_TEMPLATE_INFO (fn)) | |
1326 | /* Its enclosing class is an explicit specialization | |
1327 | of a template class. This is not a candidate. */ | |
1328 | continue; | |
1329 | ||
03017874 MM |
1330 | if (!same_type_p (TREE_TYPE (TREE_TYPE (decl)), |
1331 | TREE_TYPE (TREE_TYPE (fn)))) | |
1332 | /* The return types differ. */ | |
1333 | continue; | |
1334 | ||
1335 | /* Adjust the type of DECL in case FN is a static member. */ | |
1336 | decl_arg_types = TYPE_ARG_TYPES (TREE_TYPE (decl)); | |
1337 | if (DECL_STATIC_FUNCTION_P (fn) | |
1338 | && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl)) | |
1339 | decl_arg_types = TREE_CHAIN (decl_arg_types); | |
1340 | ||
1341 | if (compparms (TYPE_ARG_TYPES (TREE_TYPE (fn)), | |
1342 | decl_arg_types)) | |
1343 | /* They match! */ | |
1344 | candidates = tree_cons (NULL_TREE, fn, candidates); | |
03017874 | 1345 | } |
386b8a85 | 1346 | } |
03017874 | 1347 | |
bf8f3f93 | 1348 | if (templates && TREE_CHAIN (templates)) |
386b8a85 | 1349 | { |
03017874 MM |
1350 | /* We have: |
1351 | ||
1352 | [temp.expl.spec] | |
1353 | ||
1354 | It is possible for a specialization with a given function | |
1355 | signature to be instantiated from more than one function | |
1356 | template. In such cases, explicit specification of the | |
1357 | template arguments must be used to uniquely identify the | |
1358 | function template specialization being specialized. | |
1359 | ||
1360 | Note that here, there's no suggestion that we're supposed to | |
1361 | determine which of the candidate templates is most | |
1362 | specialized. However, we, also have: | |
1363 | ||
1364 | [temp.func.order] | |
1365 | ||
1366 | Partial ordering of overloaded function template | |
1367 | declarations is used in the following contexts to select | |
1368 | the function template to which a function template | |
1369 | specialization refers: | |
1370 | ||
1371 | -- when an explicit specialization refers to a function | |
1372 | template. | |
1373 | ||
1374 | So, we do use the partial ordering rules, at least for now. | |
0e339752 | 1375 | This extension can only serve to make invalid programs valid, |
03017874 MM |
1376 | so it's safe. And, there is strong anecdotal evidence that |
1377 | the committee intended the partial ordering rules to apply; | |
1378 | the EDG front-end has that behavior, and John Spicer claims | |
1379 | that the committee simply forgot to delete the wording in | |
1380 | [temp.expl.spec]. */ | |
1381 | tree tmpl = most_specialized (templates, decl, explicit_targs); | |
1382 | if (tmpl && tmpl != error_mark_node) | |
1383 | { | |
1384 | targs = get_bindings (tmpl, decl, explicit_targs); | |
e1b3e07d | 1385 | templates = tree_cons (targs, tmpl, NULL_TREE); |
03017874 | 1386 | } |
e1467ff2 MM |
1387 | } |
1388 | ||
03017874 | 1389 | if (templates == NULL_TREE && candidates == NULL_TREE) |
e1467ff2 | 1390 | { |
bf8f3f93 MM |
1391 | cp_error_at ("template-id `%D' for `%+D' does not match any template declaration", |
1392 | template_id, decl); | |
03017874 | 1393 | return error_mark_node; |
386b8a85 | 1394 | } |
03017874 | 1395 | else if ((templates && TREE_CHAIN (templates)) |
bf8f3f93 MM |
1396 | || (candidates && TREE_CHAIN (candidates)) |
1397 | || (templates && candidates)) | |
386b8a85 | 1398 | { |
bf8f3f93 MM |
1399 | cp_error_at ("ambiguous template specialization `%D' for `%+D'", |
1400 | template_id, decl); | |
1401 | chainon (candidates, templates); | |
1402 | print_candidates (candidates); | |
03017874 | 1403 | return error_mark_node; |
386b8a85 JM |
1404 | } |
1405 | ||
c6002625 | 1406 | /* We have one, and exactly one, match. */ |
03017874 MM |
1407 | if (candidates) |
1408 | { | |
1409 | /* It was a specialization of an ordinary member function in a | |
1410 | template class. */ | |
1411 | *targs_out = copy_node (DECL_TI_ARGS (TREE_VALUE (candidates))); | |
1412 | return DECL_TI_TEMPLATE (TREE_VALUE (candidates)); | |
1413 | } | |
1414 | ||
1415 | /* It was a specialization of a template. */ | |
17aec3eb | 1416 | targs = DECL_TI_ARGS (DECL_TEMPLATE_RESULT (TREE_VALUE (templates))); |
03017874 MM |
1417 | if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (targs)) |
1418 | { | |
1419 | *targs_out = copy_node (targs); | |
1420 | SET_TMPL_ARGS_LEVEL (*targs_out, | |
1421 | TMPL_ARGS_DEPTH (*targs_out), | |
1422 | TREE_PURPOSE (templates)); | |
1423 | } | |
1424 | else | |
1425 | *targs_out = TREE_PURPOSE (templates); | |
e1467ff2 | 1426 | return TREE_VALUE (templates); |
8d08fdba | 1427 | } |
8afa707f MM |
1428 | |
1429 | /* Returns a chain of parameter types, exactly like the SPEC_TYPES, | |
1430 | but with the default argument values filled in from those in the | |
1431 | TMPL_TYPES. */ | |
6757edfe | 1432 | |
8afa707f | 1433 | static tree |
3a978d72 NN |
1434 | copy_default_args_to_explicit_spec_1 (tree spec_types, |
1435 | tree tmpl_types) | |
8afa707f MM |
1436 | { |
1437 | tree new_spec_types; | |
1438 | ||
1439 | if (!spec_types) | |
1440 | return NULL_TREE; | |
1441 | ||
1442 | if (spec_types == void_list_node) | |
1443 | return void_list_node; | |
1444 | ||
1445 | /* Substitute into the rest of the list. */ | |
1446 | new_spec_types = | |
1447 | copy_default_args_to_explicit_spec_1 (TREE_CHAIN (spec_types), | |
1448 | TREE_CHAIN (tmpl_types)); | |
1449 | ||
1450 | /* Add the default argument for this parameter. */ | |
1451 | return hash_tree_cons (TREE_PURPOSE (tmpl_types), | |
1452 | TREE_VALUE (spec_types), | |
1453 | new_spec_types); | |
1454 | } | |
1455 | ||
1456 | /* DECL is an explicit specialization. Replicate default arguments | |
1457 | from the template it specializes. (That way, code like: | |
1458 | ||
1459 | template <class T> void f(T = 3); | |
1460 | template <> void f(double); | |
1461 | void g () { f (); } | |
1462 | ||
1463 | works, as required.) An alternative approach would be to look up | |
1464 | the correct default arguments at the call-site, but this approach | |
1465 | is consistent with how implicit instantiations are handled. */ | |
1466 | ||
1467 | static void | |
3a978d72 | 1468 | copy_default_args_to_explicit_spec (tree decl) |
8afa707f MM |
1469 | { |
1470 | tree tmpl; | |
1471 | tree spec_types; | |
1472 | tree tmpl_types; | |
1473 | tree new_spec_types; | |
1474 | tree old_type; | |
1475 | tree new_type; | |
1476 | tree t; | |
08c2df0f NS |
1477 | tree object_type = NULL_TREE; |
1478 | tree in_charge = NULL_TREE; | |
e0fff4b3 | 1479 | tree vtt = NULL_TREE; |
8afa707f MM |
1480 | |
1481 | /* See if there's anything we need to do. */ | |
1482 | tmpl = DECL_TI_TEMPLATE (decl); | |
1483 | tmpl_types = TYPE_ARG_TYPES (TREE_TYPE (DECL_TEMPLATE_RESULT (tmpl))); | |
1484 | for (t = tmpl_types; t; t = TREE_CHAIN (t)) | |
1485 | if (TREE_PURPOSE (t)) | |
1486 | break; | |
1487 | if (!t) | |
1488 | return; | |
1489 | ||
1490 | old_type = TREE_TYPE (decl); | |
1491 | spec_types = TYPE_ARG_TYPES (old_type); | |
1492 | ||
8afa707f MM |
1493 | if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl)) |
1494 | { | |
08c2df0f NS |
1495 | /* Remove the this pointer, but remember the object's type for |
1496 | CV quals. */ | |
1497 | object_type = TREE_TYPE (TREE_VALUE (spec_types)); | |
8afa707f MM |
1498 | spec_types = TREE_CHAIN (spec_types); |
1499 | tmpl_types = TREE_CHAIN (tmpl_types); | |
08c2df0f | 1500 | |
8afa707f | 1501 | if (DECL_HAS_IN_CHARGE_PARM_P (decl)) |
08c2df0f NS |
1502 | { |
1503 | /* DECL may contain more parameters than TMPL due to the extra | |
1504 | in-charge parameter in constructors and destructors. */ | |
1505 | in_charge = spec_types; | |
1506 | spec_types = TREE_CHAIN (spec_types); | |
1507 | } | |
e0fff4b3 JM |
1508 | if (DECL_HAS_VTT_PARM_P (decl)) |
1509 | { | |
1510 | vtt = spec_types; | |
1511 | spec_types = TREE_CHAIN (spec_types); | |
1512 | } | |
8afa707f MM |
1513 | } |
1514 | ||
1515 | /* Compute the merged default arguments. */ | |
1516 | new_spec_types = | |
1517 | copy_default_args_to_explicit_spec_1 (spec_types, tmpl_types); | |
1518 | ||
08c2df0f NS |
1519 | /* Compute the new FUNCTION_TYPE. */ |
1520 | if (object_type) | |
8afa707f | 1521 | { |
e0fff4b3 JM |
1522 | if (vtt) |
1523 | new_spec_types = hash_tree_cons (TREE_PURPOSE (vtt), | |
1524 | TREE_VALUE (vtt), | |
1525 | new_spec_types); | |
1526 | ||
08c2df0f NS |
1527 | if (in_charge) |
1528 | /* Put the in-charge parameter back. */ | |
1529 | new_spec_types = hash_tree_cons (TREE_PURPOSE (in_charge), | |
1530 | TREE_VALUE (in_charge), | |
1531 | new_spec_types); | |
1532 | ||
43dc123f MM |
1533 | new_type = build_method_type_directly (object_type, |
1534 | TREE_TYPE (old_type), | |
1535 | new_spec_types); | |
8afa707f | 1536 | } |
8afa707f MM |
1537 | else |
1538 | new_type = build_function_type (TREE_TYPE (old_type), | |
08c2df0f | 1539 | new_spec_types); |
e9525111 MM |
1540 | new_type = cp_build_type_attribute_variant (new_type, |
1541 | TYPE_ATTRIBUTES (old_type)); | |
8afa707f MM |
1542 | new_type = build_exception_variant (new_type, |
1543 | TYPE_RAISES_EXCEPTIONS (old_type)); | |
1544 | TREE_TYPE (decl) = new_type; | |
1545 | } | |
1546 | ||
386b8a85 | 1547 | /* Check to see if the function just declared, as indicated in |
75650646 MM |
1548 | DECLARATOR, and in DECL, is a specialization of a function |
1549 | template. We may also discover that the declaration is an explicit | |
1550 | instantiation at this point. | |
1551 | ||
e1467ff2 | 1552 | Returns DECL, or an equivalent declaration that should be used |
03017874 MM |
1553 | instead if all goes well. Issues an error message if something is |
1554 | amiss. Returns error_mark_node if the error is not easily | |
1555 | recoverable. | |
75650646 | 1556 | |
75650646 MM |
1557 | FLAGS is a bitmask consisting of the following flags: |
1558 | ||
75650646 MM |
1559 | 2: The function has a definition. |
1560 | 4: The function is a friend. | |
75650646 MM |
1561 | |
1562 | The TEMPLATE_COUNT is the number of references to qualifying | |
1563 | template classes that appeared in the name of the function. For | |
1564 | example, in | |
1565 | ||
1566 | template <class T> struct S { void f(); }; | |
1567 | void S<int>::f(); | |
1568 | ||
1569 | the TEMPLATE_COUNT would be 1. However, explicitly specialized | |
1570 | classes are not counted in the TEMPLATE_COUNT, so that in | |
1571 | ||
1572 | template <class T> struct S {}; | |
1573 | template <> struct S<int> { void f(); } | |
36a117a5 | 1574 | template <> void S<int>::f(); |
75650646 MM |
1575 | |
1576 | the TEMPLATE_COUNT would be 0. (Note that this declaration is | |
0e339752 | 1577 | invalid; there should be no template <>.) |
75650646 MM |
1578 | |
1579 | If the function is a specialization, it is marked as such via | |
1580 | DECL_TEMPLATE_SPECIALIZATION. Furthermore, its DECL_TEMPLATE_INFO | |
1581 | is set up correctly, and it is added to the list of specializations | |
1582 | for that template. */ | |
386b8a85 | 1583 | |
e1467ff2 | 1584 | tree |
3a978d72 NN |
1585 | check_explicit_specialization (tree declarator, |
1586 | tree decl, | |
1587 | int template_count, | |
1588 | int flags) | |
386b8a85 | 1589 | { |
75650646 MM |
1590 | int have_def = flags & 2; |
1591 | int is_friend = flags & 4; | |
1592 | int specialization = 0; | |
e1467ff2 | 1593 | int explicit_instantiation = 0; |
fd4de5ff | 1594 | int member_specialization = 0; |
75650646 MM |
1595 | tree ctype = DECL_CLASS_CONTEXT (decl); |
1596 | tree dname = DECL_NAME (decl); | |
74b846e0 | 1597 | tmpl_spec_kind tsk; |
386b8a85 | 1598 | |
74b846e0 | 1599 | tsk = current_tmpl_spec_kind (template_count); |
75650646 | 1600 | |
74b846e0 MM |
1601 | switch (tsk) |
1602 | { | |
1603 | case tsk_none: | |
1604 | if (processing_specialization) | |
75650646 | 1605 | { |
fd4de5ff MM |
1606 | specialization = 1; |
1607 | SET_DECL_TEMPLATE_SPECIALIZATION (decl); | |
75650646 | 1608 | } |
74b846e0 | 1609 | else if (TREE_CODE (declarator) == TEMPLATE_ID_EXPR) |
386b8a85 | 1610 | { |
74b846e0 MM |
1611 | if (is_friend) |
1612 | /* This could be something like: | |
75650646 | 1613 | |
74b846e0 MM |
1614 | template <class T> void f(T); |
1615 | class S { friend void f<>(int); } */ | |
1616 | specialization = 1; | |
1617 | else | |
1618 | { | |
1619 | /* This case handles bogus declarations like template <> | |
1620 | template <class T> void f<int>(); */ | |
1621 | ||
33bd39a2 | 1622 | error ("template-id `%D' in declaration of primary template", |
74b846e0 MM |
1623 | declarator); |
1624 | return decl; | |
1625 | } | |
1626 | } | |
1627 | break; | |
1628 | ||
1629 | case tsk_invalid_member_spec: | |
1630 | /* The error has already been reported in | |
1631 | check_specialization_scope. */ | |
1632 | return error_mark_node; | |
1633 | ||
1634 | case tsk_invalid_expl_inst: | |
33bd39a2 | 1635 | error ("template parameter list used in explicit instantiation"); |
74b846e0 MM |
1636 | |
1637 | /* Fall through. */ | |
1638 | ||
1639 | case tsk_expl_inst: | |
fd4de5ff | 1640 | if (have_def) |
33bd39a2 | 1641 | error ("definition provided for explicit instantiation"); |
74b846e0 | 1642 | |
fd4de5ff | 1643 | explicit_instantiation = 1; |
74b846e0 | 1644 | break; |
fd4de5ff | 1645 | |
74b846e0 | 1646 | case tsk_excessive_parms: |
33bd39a2 | 1647 | error ("too many template parameter lists in declaration of `%D'", |
74b846e0 MM |
1648 | decl); |
1649 | return error_mark_node; | |
75650646 | 1650 | |
74b846e0 MM |
1651 | /* Fall through. */ |
1652 | case tsk_expl_spec: | |
1653 | SET_DECL_TEMPLATE_SPECIALIZATION (decl); | |
1654 | if (ctype) | |
1655 | member_specialization = 1; | |
1656 | else | |
1657 | specialization = 1; | |
1658 | break; | |
1659 | ||
1660 | case tsk_insufficient_parms: | |
fd4de5ff MM |
1661 | if (template_header_count) |
1662 | { | |
33bd39a2 | 1663 | error("too few template parameter lists in declaration of `%D'", |
74b846e0 | 1664 | decl); |
fd4de5ff | 1665 | return decl; |
c6f2ed0d | 1666 | } |
74b846e0 MM |
1667 | else if (ctype != NULL_TREE |
1668 | && !TYPE_BEING_DEFINED (ctype) | |
1669 | && CLASSTYPE_TEMPLATE_INSTANTIATION (ctype) | |
1670 | && !is_friend) | |
1671 | { | |
1672 | /* For backwards compatibility, we accept: | |
fd4de5ff | 1673 | |
74b846e0 MM |
1674 | template <class T> struct S { void f(); }; |
1675 | void S<int>::f() {} // Missing template <> | |
fd4de5ff | 1676 | |
0e339752 | 1677 | That used to be valid C++. */ |
74b846e0 | 1678 | if (pedantic) |
33bd39a2 | 1679 | pedwarn |
74b846e0 MM |
1680 | ("explicit specialization not preceded by `template <>'"); |
1681 | specialization = 1; | |
1682 | SET_DECL_TEMPLATE_SPECIALIZATION (decl); | |
1683 | } | |
1684 | break; | |
1685 | ||
1686 | case tsk_template: | |
1687 | if (TREE_CODE (declarator) == TEMPLATE_ID_EXPR) | |
c6f2ed0d | 1688 | { |
fd4de5ff MM |
1689 | /* This case handles bogus declarations like template <> |
1690 | template <class T> void f<int>(); */ | |
75650646 | 1691 | |
655dc6ee | 1692 | if (uses_template_parms (declarator)) |
33bd39a2 | 1693 | error ("partial specialization `%D' of function template", |
655dc6ee JM |
1694 | declarator); |
1695 | else | |
33bd39a2 | 1696 | error ("template-id `%D' in declaration of primary template", |
655dc6ee | 1697 | declarator); |
fd4de5ff | 1698 | return decl; |
386b8a85 | 1699 | } |
74b846e0 MM |
1700 | |
1701 | if (ctype && CLASSTYPE_TEMPLATE_INSTANTIATION (ctype)) | |
1702 | /* This is a specialization of a member template, without | |
1703 | specialization the containing class. Something like: | |
1704 | ||
1705 | template <class T> struct S { | |
1706 | template <class U> void f (U); | |
1707 | }; | |
1708 | template <> template <class U> void S<int>::f(U) {} | |
1709 | ||
1710 | That's a specialization -- but of the entire template. */ | |
1711 | specialization = 1; | |
1712 | break; | |
1713 | ||
1714 | default: | |
a98facb0 | 1715 | abort (); |
75650646 | 1716 | } |
386b8a85 | 1717 | |
670960ac JM |
1718 | if (specialization || member_specialization) |
1719 | { | |
1720 | tree t = TYPE_ARG_TYPES (TREE_TYPE (decl)); | |
1721 | for (; t; t = TREE_CHAIN (t)) | |
1722 | if (TREE_PURPOSE (t)) | |
1723 | { | |
33bd39a2 | 1724 | pedwarn |
8251199e | 1725 | ("default argument specified in explicit specialization"); |
670960ac JM |
1726 | break; |
1727 | } | |
f3400fe2 | 1728 | if (current_lang_name == lang_name_c) |
33bd39a2 | 1729 | error ("template specialization with C linkage"); |
670960ac JM |
1730 | } |
1731 | ||
e1467ff2 | 1732 | if (specialization || member_specialization || explicit_instantiation) |
75650646 MM |
1733 | { |
1734 | tree tmpl = NULL_TREE; | |
1735 | tree targs = NULL_TREE; | |
75650646 MM |
1736 | |
1737 | /* Make sure that the declarator is a TEMPLATE_ID_EXPR. */ | |
386b8a85 JM |
1738 | if (TREE_CODE (declarator) != TEMPLATE_ID_EXPR) |
1739 | { | |
1740 | tree fns; | |
1741 | ||
2f54a1db GB |
1742 | my_friendly_assert (TREE_CODE (declarator) == IDENTIFIER_NODE, 0); |
1743 | if (ctype) | |
386b8a85 | 1744 | fns = dname; |
2f54a1db GB |
1745 | else |
1746 | { | |
1747 | /* If there is no class context, the explicit instantiation | |
1748 | must be at namespace scope. */ | |
1749 | my_friendly_assert (DECL_NAMESPACE_SCOPE_P (decl), 20030625); | |
1750 | ||
1751 | /* Find the namespace binding, using the declaration | |
1752 | context. */ | |
1753 | fns = namespace_binding (dname, CP_DECL_CONTEXT (decl)); | |
1754 | } | |
386b8a85 | 1755 | |
2f54a1db | 1756 | declarator = lookup_template_function (fns, NULL_TREE); |
386b8a85 JM |
1757 | } |
1758 | ||
f2e48b67 BK |
1759 | if (declarator == error_mark_node) |
1760 | return error_mark_node; | |
1761 | ||
75650646 MM |
1762 | if (ctype != NULL_TREE && TYPE_BEING_DEFINED (ctype)) |
1763 | { | |
8ec2ac34 | 1764 | if (!explicit_instantiation) |
0e339752 | 1765 | /* A specialization in class scope. This is invalid, |
6c30752f MM |
1766 | but the error will already have been flagged by |
1767 | check_specialization_scope. */ | |
1768 | return error_mark_node; | |
8ec2ac34 | 1769 | else |
b370501f | 1770 | { |
0e339752 | 1771 | /* It's not valid to write an explicit instantiation in |
b370501f | 1772 | class scope, e.g.: |
8ec2ac34 | 1773 | |
b370501f | 1774 | class C { template void f(); } |
8ec2ac34 | 1775 | |
b370501f KG |
1776 | This case is caught by the parser. However, on |
1777 | something like: | |
8ec2ac34 | 1778 | |
b370501f | 1779 | template class C { void f(); }; |
8ec2ac34 | 1780 | |
0e339752 | 1781 | (which is invalid) we can get here. The error will be |
b370501f KG |
1782 | issued later. */ |
1783 | ; | |
1784 | } | |
8ec2ac34 | 1785 | |
e1467ff2 | 1786 | return decl; |
75650646 MM |
1787 | } |
1788 | else if (ctype != NULL_TREE | |
1789 | && (TREE_CODE (TREE_OPERAND (declarator, 0)) == | |
1790 | IDENTIFIER_NODE)) | |
386b8a85 | 1791 | { |
75650646 MM |
1792 | /* Find the list of functions in ctype that have the same |
1793 | name as the declared function. */ | |
1794 | tree name = TREE_OPERAND (declarator, 0); | |
03017874 MM |
1795 | tree fns = NULL_TREE; |
1796 | int idx; | |
1797 | ||
8ba658ee | 1798 | if (constructor_name_p (name, ctype)) |
386b8a85 | 1799 | { |
75650646 MM |
1800 | int is_constructor = DECL_CONSTRUCTOR_P (decl); |
1801 | ||
1802 | if (is_constructor ? !TYPE_HAS_CONSTRUCTOR (ctype) | |
1803 | : !TYPE_HAS_DESTRUCTOR (ctype)) | |
1804 | { | |
1805 | /* From [temp.expl.spec]: | |
e1467ff2 | 1806 | |
75650646 MM |
1807 | If such an explicit specialization for the member |
1808 | of a class template names an implicitly-declared | |
1809 | special member function (clause _special_), the | |
e1467ff2 MM |
1810 | program is ill-formed. |
1811 | ||
1812 | Similar language is found in [temp.explicit]. */ | |
33bd39a2 | 1813 | error ("specialization of implicitly-declared special member function"); |
03017874 | 1814 | return error_mark_node; |
75650646 | 1815 | } |
386b8a85 | 1816 | |
42da2fd8 | 1817 | name = is_constructor ? ctor_identifier : dtor_identifier; |
75650646 | 1818 | } |
42da2fd8 | 1819 | |
421844e7 | 1820 | if (!DECL_CONV_FN_P (decl)) |
03017874 MM |
1821 | { |
1822 | idx = lookup_fnfields_1 (ctype, name); | |
1823 | if (idx >= 0) | |
1824 | fns = TREE_VEC_ELT (CLASSTYPE_METHOD_VEC (ctype), idx); | |
1825 | } | |
1826 | else | |
1827 | { | |
1828 | tree methods; | |
1829 | ||
1830 | /* For a type-conversion operator, we cannot do a | |
1831 | name-based lookup. We might be looking for `operator | |
1832 | int' which will be a specialization of `operator T'. | |
1833 | So, we find *all* the conversion operators, and then | |
1834 | select from them. */ | |
1835 | fns = NULL_TREE; | |
1836 | ||
1837 | methods = CLASSTYPE_METHOD_VEC (ctype); | |
1838 | if (methods) | |
5dd236e2 NS |
1839 | for (idx = CLASSTYPE_FIRST_CONVERSION_SLOT; |
1840 | idx < TREE_VEC_LENGTH (methods); ++idx) | |
03017874 MM |
1841 | { |
1842 | tree ovl = TREE_VEC_ELT (methods, idx); | |
1843 | ||
1844 | if (!ovl || !DECL_CONV_FN_P (OVL_CURRENT (ovl))) | |
1845 | /* There are no more conversion functions. */ | |
1846 | break; | |
1847 | ||
1848 | /* Glue all these conversion functions together | |
1849 | with those we already have. */ | |
1850 | for (; ovl; ovl = OVL_NEXT (ovl)) | |
1851 | fns = ovl_cons (OVL_CURRENT (ovl), fns); | |
1852 | } | |
1853 | } | |
1854 | ||
386b8a85 JM |
1855 | if (fns == NULL_TREE) |
1856 | { | |
33bd39a2 | 1857 | error ("no member function `%D' declared in `%T'", |
b3f738da | 1858 | name, ctype); |
03017874 | 1859 | return error_mark_node; |
386b8a85 JM |
1860 | } |
1861 | else | |
1862 | TREE_OPERAND (declarator, 0) = fns; | |
1863 | } | |
75650646 | 1864 | |
e1467ff2 MM |
1865 | /* Figure out what exactly is being specialized at this point. |
1866 | Note that for an explicit instantiation, even one for a | |
38e01259 | 1867 | member function, we cannot tell apriori whether the |
e1467ff2 | 1868 | instantiation is for a member template, or just a member |
36a117a5 MM |
1869 | function of a template class. Even if a member template is |
1870 | being instantiated, the member template arguments may be | |
1871 | elided if they can be deduced from the rest of the | |
1872 | declaration. */ | |
e1467ff2 MM |
1873 | tmpl = determine_specialization (declarator, decl, |
1874 | &targs, | |
bf8f3f93 | 1875 | member_specialization); |
386b8a85 | 1876 | |
03017874 MM |
1877 | if (!tmpl || tmpl == error_mark_node) |
1878 | /* We couldn't figure out what this declaration was | |
1879 | specializing. */ | |
1880 | return error_mark_node; | |
1881 | else | |
386b8a85 | 1882 | { |
25aab5d0 | 1883 | tree gen_tmpl = most_general_template (tmpl); |
36a117a5 | 1884 | |
e1467ff2 MM |
1885 | if (explicit_instantiation) |
1886 | { | |
03d0f4af | 1887 | /* We don't set DECL_EXPLICIT_INSTANTIATION here; that |
25aab5d0 MM |
1888 | is done by do_decl_instantiation later. */ |
1889 | ||
1890 | int arg_depth = TMPL_ARGS_DEPTH (targs); | |
1891 | int parm_depth = TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl)); | |
1892 | ||
1893 | if (arg_depth > parm_depth) | |
1894 | { | |
1895 | /* If TMPL is not the most general template (for | |
1896 | example, if TMPL is a friend template that is | |
1897 | injected into namespace scope), then there will | |
dc957d14 | 1898 | be too many levels of TARGS. Remove some of them |
25aab5d0 MM |
1899 | here. */ |
1900 | int i; | |
1901 | tree new_targs; | |
1902 | ||
f31c0a32 | 1903 | new_targs = make_tree_vec (parm_depth); |
25aab5d0 MM |
1904 | for (i = arg_depth - parm_depth; i < arg_depth; ++i) |
1905 | TREE_VEC_ELT (new_targs, i - (arg_depth - parm_depth)) | |
1906 | = TREE_VEC_ELT (targs, i); | |
1907 | targs = new_targs; | |
1908 | } | |
1909 | ||
3e4a3562 | 1910 | return instantiate_template (tmpl, targs, tf_error); |
e1467ff2 | 1911 | } |
74b846e0 | 1912 | |
6c07f448 KL |
1913 | /* If we thought that the DECL was a member function, but it |
1914 | turns out to be specializing a static member function, | |
4546865e | 1915 | make DECL a static member function as well. */ |
6c07f448 KL |
1916 | if (DECL_STATIC_FUNCTION_P (tmpl) |
1917 | && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl)) | |
4546865e | 1918 | revert_static_member_fn (decl); |
6c07f448 | 1919 | |
f9a7ae04 MM |
1920 | /* If this is a specialization of a member template of a |
1921 | template class. In we want to return the TEMPLATE_DECL, | |
1922 | not the specialization of it. */ | |
74b846e0 MM |
1923 | if (tsk == tsk_template) |
1924 | { | |
1925 | SET_DECL_TEMPLATE_SPECIALIZATION (tmpl); | |
f9a7ae04 | 1926 | DECL_INITIAL (DECL_TEMPLATE_RESULT (tmpl)) = NULL_TREE; |
b190f239 NS |
1927 | if (have_def) |
1928 | { | |
f31686a3 RH |
1929 | DECL_SOURCE_LOCATION (tmpl) = DECL_SOURCE_LOCATION (decl); |
1930 | DECL_SOURCE_LOCATION (DECL_TEMPLATE_RESULT (tmpl)) | |
1931 | = DECL_SOURCE_LOCATION (decl); | |
b190f239 | 1932 | } |
74b846e0 MM |
1933 | return tmpl; |
1934 | } | |
1935 | ||
36a117a5 | 1936 | /* Set up the DECL_TEMPLATE_INFO for DECL. */ |
e1b3e07d | 1937 | DECL_TEMPLATE_INFO (decl) = tree_cons (tmpl, targs, NULL_TREE); |
36a117a5 | 1938 | |
8afa707f MM |
1939 | /* Inherit default function arguments from the template |
1940 | DECL is specializing. */ | |
1941 | copy_default_args_to_explicit_spec (decl); | |
1942 | ||
c750255c MM |
1943 | /* This specialization has the same protection as the |
1944 | template it specializes. */ | |
1945 | TREE_PRIVATE (decl) = TREE_PRIVATE (gen_tmpl); | |
1946 | TREE_PROTECTED (decl) = TREE_PROTECTED (gen_tmpl); | |
1947 | ||
386b8a85 | 1948 | if (is_friend && !have_def) |
36a117a5 MM |
1949 | /* This is not really a declaration of a specialization. |
1950 | It's just the name of an instantiation. But, it's not | |
1951 | a request for an instantiation, either. */ | |
fbf1c34b | 1952 | SET_DECL_IMPLICIT_INSTANTIATION (decl); |
08511114 KL |
1953 | else if (DECL_CONSTRUCTOR_P (decl) || DECL_DESTRUCTOR_P (decl)) |
1954 | /* This is indeed a specialization. In case of constructors | |
1955 | and destructors, we need in-charge and not-in-charge | |
1956 | versions in V3 ABI. */ | |
1957 | clone_function_decl (decl, /*update_method_vec_p=*/0); | |
75650646 | 1958 | |
36a117a5 MM |
1959 | /* Register this specialization so that we can find it |
1960 | again. */ | |
1961 | decl = register_specialization (decl, gen_tmpl, targs); | |
386b8a85 JM |
1962 | } |
1963 | } | |
75650646 | 1964 | |
e1467ff2 | 1965 | return decl; |
386b8a85 | 1966 | } |
75650646 | 1967 | |
39c01e4c MM |
1968 | /* TYPE is being declared. Verify that the use of template headers |
1969 | and such is reasonable. Issue error messages if not. */ | |
1970 | ||
1971 | void | |
3a978d72 | 1972 | maybe_check_template_type (tree type) |
39c01e4c MM |
1973 | { |
1974 | if (template_header_count) | |
1975 | { | |
1976 | /* We are in the scope of some `template <...>' header. */ | |
1977 | ||
1978 | int context_depth | |
1979 | = template_class_depth_real (TYPE_CONTEXT (type), | |
1980 | /*count_specializations=*/1); | |
1981 | ||
1982 | if (template_header_count <= context_depth) | |
1983 | /* This is OK; the template headers are for the context. We | |
1984 | are actually too lenient here; like | |
1985 | check_explicit_specialization we should consider the number | |
1986 | of template types included in the actual declaration. For | |
1987 | example, | |
1988 | ||
1989 | template <class T> struct S { | |
1990 | template <class U> template <class V> | |
1991 | struct I {}; | |
1992 | }; | |
1993 | ||
0e339752 | 1994 | is invalid, but: |
39c01e4c MM |
1995 | |
1996 | template <class T> struct S { | |
1997 | template <class U> struct I; | |
1998 | }; | |
1999 | ||
2000 | template <class T> template <class U. | |
2001 | struct S<T>::I {}; | |
2002 | ||
2003 | is not. */ | |
2004 | ; | |
2005 | else if (template_header_count > context_depth + 1) | |
2006 | /* There are two many template parameter lists. */ | |
33bd39a2 | 2007 | error ("too many template parameter lists in declaration of `%T'", type); |
39c01e4c MM |
2008 | } |
2009 | } | |
2010 | ||
75650646 MM |
2011 | /* Returns 1 iff PARMS1 and PARMS2 are identical sets of template |
2012 | parameters. These are represented in the same format used for | |
2013 | DECL_TEMPLATE_PARMS. */ | |
2014 | ||
3a978d72 | 2015 | int comp_template_parms (tree parms1, tree parms2) |
75650646 MM |
2016 | { |
2017 | tree p1; | |
2018 | tree p2; | |
2019 | ||
2020 | if (parms1 == parms2) | |
2021 | return 1; | |
2022 | ||
2023 | for (p1 = parms1, p2 = parms2; | |
2024 | p1 != NULL_TREE && p2 != NULL_TREE; | |
2025 | p1 = TREE_CHAIN (p1), p2 = TREE_CHAIN (p2)) | |
2026 | { | |
2027 | tree t1 = TREE_VALUE (p1); | |
2028 | tree t2 = TREE_VALUE (p2); | |
2029 | int i; | |
2030 | ||
2031 | my_friendly_assert (TREE_CODE (t1) == TREE_VEC, 0); | |
2032 | my_friendly_assert (TREE_CODE (t2) == TREE_VEC, 0); | |
2033 | ||
2034 | if (TREE_VEC_LENGTH (t1) != TREE_VEC_LENGTH (t2)) | |
2035 | return 0; | |
2036 | ||
2037 | for (i = 0; i < TREE_VEC_LENGTH (t2); ++i) | |
2038 | { | |
2039 | tree parm1 = TREE_VALUE (TREE_VEC_ELT (t1, i)); | |
2040 | tree parm2 = TREE_VALUE (TREE_VEC_ELT (t2, i)); | |
2041 | ||
2042 | if (TREE_CODE (parm1) != TREE_CODE (parm2)) | |
2043 | return 0; | |
2044 | ||
2045 | if (TREE_CODE (parm1) == TEMPLATE_TYPE_PARM) | |
2046 | continue; | |
3bfdc719 | 2047 | else if (!same_type_p (TREE_TYPE (parm1), TREE_TYPE (parm2))) |
75650646 MM |
2048 | return 0; |
2049 | } | |
2050 | } | |
2051 | ||
2052 | if ((p1 != NULL_TREE) != (p2 != NULL_TREE)) | |
2053 | /* One set of parameters has more parameters lists than the | |
2054 | other. */ | |
2055 | return 0; | |
2056 | ||
2057 | return 1; | |
2058 | } | |
2059 | ||
f3400fe2 JM |
2060 | /* Complain if DECL shadows a template parameter. |
2061 | ||
2062 | [temp.local]: A template-parameter shall not be redeclared within its | |
2063 | scope (including nested scopes). */ | |
2064 | ||
2065 | void | |
3a978d72 | 2066 | check_template_shadow (tree decl) |
f3400fe2 | 2067 | { |
8f032717 MM |
2068 | tree olddecl; |
2069 | ||
b5d9b9ab MM |
2070 | /* If we're not in a template, we can't possibly shadow a template |
2071 | parameter. */ | |
2072 | if (!current_template_parms) | |
2073 | return; | |
2074 | ||
2075 | /* Figure out what we're shadowing. */ | |
8f032717 MM |
2076 | if (TREE_CODE (decl) == OVERLOAD) |
2077 | decl = OVL_CURRENT (decl); | |
2078 | olddecl = IDENTIFIER_VALUE (DECL_NAME (decl)); | |
f3400fe2 | 2079 | |
b5d9b9ab MM |
2080 | /* If there's no previous binding for this name, we're not shadowing |
2081 | anything, let alone a template parameter. */ | |
2082 | if (!olddecl) | |
2083 | return; | |
2084 | ||
2085 | /* If we're not shadowing a template parameter, we're done. Note | |
2086 | that OLDDECL might be an OVERLOAD (or perhaps even an | |
2087 | ERROR_MARK), so we can't just blithely assume it to be a _DECL | |
2088 | node. */ | |
2f939d94 | 2089 | if (!DECL_P (olddecl) || !DECL_TEMPLATE_PARM_P (olddecl)) |
b5d9b9ab MM |
2090 | return; |
2091 | ||
2092 | /* We check for decl != olddecl to avoid bogus errors for using a | |
2093 | name inside a class. We check TPFI to avoid duplicate errors for | |
2094 | inline member templates. */ | |
2095 | if (decl == olddecl | |
2096 | || TEMPLATE_PARMS_FOR_INLINE (current_template_parms)) | |
2097 | return; | |
2098 | ||
2099 | cp_error_at ("declaration of `%#D'", decl); | |
2100 | cp_error_at (" shadows template parm `%#D'", olddecl); | |
f3400fe2 | 2101 | } |
22a7be53 | 2102 | |
f3400fe2 | 2103 | /* Return a new TEMPLATE_PARM_INDEX with the indicated INDEX, LEVEL, |
f84b4be9 JM |
2104 | ORIG_LEVEL, DECL, and TYPE. */ |
2105 | ||
2106 | static tree | |
3a978d72 NN |
2107 | build_template_parm_index (int index, |
2108 | int level, | |
2109 | int orig_level, | |
2110 | tree decl, | |
2111 | tree type) | |
f84b4be9 JM |
2112 | { |
2113 | tree t = make_node (TEMPLATE_PARM_INDEX); | |
2114 | TEMPLATE_PARM_IDX (t) = index; | |
2115 | TEMPLATE_PARM_LEVEL (t) = level; | |
2116 | TEMPLATE_PARM_ORIG_LEVEL (t) = orig_level; | |
2117 | TEMPLATE_PARM_DECL (t) = decl; | |
2118 | TREE_TYPE (t) = type; | |
3e4a3562 | 2119 | TREE_CONSTANT (t) = TREE_CONSTANT (decl); |
6de9cd9a | 2120 | TREE_INVARIANT (t) = TREE_INVARIANT (decl); |
3e4a3562 | 2121 | TREE_READONLY (t) = TREE_READONLY (decl); |
f84b4be9 JM |
2122 | |
2123 | return t; | |
2124 | } | |
2125 | ||
f84b4be9 | 2126 | /* Return a TEMPLATE_PARM_INDEX, similar to INDEX, but whose |
93cdc044 | 2127 | TEMPLATE_PARM_LEVEL has been decreased by LEVELS. If such a |
f84b4be9 JM |
2128 | TEMPLATE_PARM_INDEX already exists, it is returned; otherwise, a |
2129 | new one is created. */ | |
2130 | ||
2131 | static tree | |
3a978d72 | 2132 | reduce_template_parm_level (tree index, tree type, int levels) |
f84b4be9 JM |
2133 | { |
2134 | if (TEMPLATE_PARM_DESCENDANTS (index) == NULL_TREE | |
2135 | || (TEMPLATE_PARM_LEVEL (TEMPLATE_PARM_DESCENDANTS (index)) | |
93cdc044 | 2136 | != TEMPLATE_PARM_LEVEL (index) - levels)) |
f84b4be9 | 2137 | { |
3e4a3562 NS |
2138 | tree orig_decl = TEMPLATE_PARM_DECL (index); |
2139 | tree decl, t; | |
2140 | ||
2141 | decl = build_decl (TREE_CODE (orig_decl), DECL_NAME (orig_decl), type); | |
2142 | TREE_CONSTANT (decl) = TREE_CONSTANT (orig_decl); | |
6de9cd9a | 2143 | TREE_INVARIANT (decl) = TREE_INVARIANT (orig_decl); |
3e4a3562 NS |
2144 | TREE_READONLY (decl) = TREE_READONLY (orig_decl); |
2145 | DECL_ARTIFICIAL (decl) = 1; | |
2146 | SET_DECL_TEMPLATE_PARM_P (decl); | |
2147 | ||
2148 | t = build_template_parm_index (TEMPLATE_PARM_IDX (index), | |
93cdc044 | 2149 | TEMPLATE_PARM_LEVEL (index) - levels, |
f84b4be9 JM |
2150 | TEMPLATE_PARM_ORIG_LEVEL (index), |
2151 | decl, type); | |
2152 | TEMPLATE_PARM_DESCENDANTS (index) = t; | |
cae40af6 JM |
2153 | |
2154 | /* Template template parameters need this. */ | |
2155 | DECL_TEMPLATE_PARMS (decl) | |
2156 | = DECL_TEMPLATE_PARMS (TEMPLATE_PARM_DECL (index)); | |
f84b4be9 JM |
2157 | } |
2158 | ||
2159 | return TEMPLATE_PARM_DESCENDANTS (index); | |
2160 | } | |
2161 | ||
8d08fdba | 2162 | /* Process information from new template parameter NEXT and append it to the |
5566b478 | 2163 | LIST being built. */ |
e92cc029 | 2164 | |
8d08fdba | 2165 | tree |
3a978d72 | 2166 | process_template_parm (tree list, tree next) |
8d08fdba MS |
2167 | { |
2168 | tree parm; | |
2169 | tree decl = 0; | |
a292b002 | 2170 | tree defval; |
5566b478 | 2171 | int is_type, idx; |
f84b4be9 | 2172 | |
8d08fdba MS |
2173 | parm = next; |
2174 | my_friendly_assert (TREE_CODE (parm) == TREE_LIST, 259); | |
a292b002 MS |
2175 | defval = TREE_PURPOSE (parm); |
2176 | parm = TREE_VALUE (parm); | |
2177 | is_type = TREE_PURPOSE (parm) == class_type_node; | |
5566b478 MS |
2178 | |
2179 | if (list) | |
2180 | { | |
2181 | tree p = TREE_VALUE (tree_last (list)); | |
2182 | ||
1899c3a4 | 2183 | if (TREE_CODE (p) == TYPE_DECL || TREE_CODE (p) == TEMPLATE_DECL) |
5566b478 MS |
2184 | idx = TEMPLATE_TYPE_IDX (TREE_TYPE (p)); |
2185 | else | |
f84b4be9 | 2186 | idx = TEMPLATE_PARM_IDX (DECL_INITIAL (p)); |
5566b478 MS |
2187 | ++idx; |
2188 | } | |
2189 | else | |
2190 | idx = 0; | |
2191 | ||
8d08fdba MS |
2192 | if (!is_type) |
2193 | { | |
a292b002 | 2194 | my_friendly_assert (TREE_CODE (TREE_PURPOSE (parm)) == TREE_LIST, 260); |
8d08fdba | 2195 | /* is a const-param */ |
a292b002 | 2196 | parm = grokdeclarator (TREE_VALUE (parm), TREE_PURPOSE (parm), |
91d231cb | 2197 | PARM, 0, NULL); |
833aa4c4 | 2198 | SET_DECL_TEMPLATE_PARM_P (parm); |
d490621d MM |
2199 | |
2200 | /* [temp.param] | |
2201 | ||
2202 | The top-level cv-qualifiers on the template-parameter are | |
2203 | ignored when determining its type. */ | |
2204 | TREE_TYPE (parm) = TYPE_MAIN_VARIANT (TREE_TYPE (parm)); | |
2205 | ||
8d08fdba | 2206 | /* A template parameter is not modifiable. */ |
6de9cd9a DN |
2207 | TREE_CONSTANT (parm) = 1; |
2208 | TREE_INVARIANT (parm) = 1; | |
2209 | TREE_READONLY (parm) = 1; | |
11b810f1 | 2210 | if (invalid_nontype_parm_type_p (TREE_TYPE (parm), 1)) |
db3f4e4e | 2211 | TREE_TYPE (parm) = void_type_node; |
8d08fdba | 2212 | decl = build_decl (CONST_DECL, DECL_NAME (parm), TREE_TYPE (parm)); |
6de9cd9a DN |
2213 | TREE_CONSTANT (decl) = 1; |
2214 | TREE_INVARIANT (decl) = 1; | |
2215 | TREE_READONLY (decl) = 1; | |
f84b4be9 JM |
2216 | DECL_INITIAL (parm) = DECL_INITIAL (decl) |
2217 | = build_template_parm_index (idx, processing_template_decl, | |
2218 | processing_template_decl, | |
2219 | decl, TREE_TYPE (parm)); | |
8d08fdba MS |
2220 | } |
2221 | else | |
2222 | { | |
73b0fce8 KL |
2223 | tree t; |
2224 | parm = TREE_VALUE (parm); | |
2225 | ||
2226 | if (parm && TREE_CODE (parm) == TEMPLATE_DECL) | |
2227 | { | |
33848bb0 | 2228 | t = make_aggr_type (TEMPLATE_TEMPLATE_PARM); |
73b0fce8 KL |
2229 | /* This is for distinguishing between real templates and template |
2230 | template parameters */ | |
2231 | TREE_TYPE (parm) = t; | |
2232 | TREE_TYPE (DECL_TEMPLATE_RESULT (parm)) = t; | |
2233 | decl = parm; | |
2234 | } | |
2235 | else | |
2236 | { | |
33848bb0 | 2237 | t = make_aggr_type (TEMPLATE_TYPE_PARM); |
f4f206f4 | 2238 | /* parm is either IDENTIFIER_NODE or NULL_TREE. */ |
73b0fce8 KL |
2239 | decl = build_decl (TYPE_DECL, parm, t); |
2240 | } | |
2241 | ||
d2e5ee5c MS |
2242 | TYPE_NAME (t) = decl; |
2243 | TYPE_STUB_DECL (t) = decl; | |
a292b002 | 2244 | parm = decl; |
f84b4be9 JM |
2245 | TEMPLATE_TYPE_PARM_INDEX (t) |
2246 | = build_template_parm_index (idx, processing_template_decl, | |
2247 | processing_template_decl, | |
2248 | decl, TREE_TYPE (parm)); | |
8d08fdba | 2249 | } |
c727aa5e | 2250 | DECL_ARTIFICIAL (decl) = 1; |
cd9f6678 | 2251 | SET_DECL_TEMPLATE_PARM_P (decl); |
8d08fdba | 2252 | pushdecl (decl); |
a292b002 | 2253 | parm = build_tree_list (defval, parm); |
8d08fdba MS |
2254 | return chainon (list, parm); |
2255 | } | |
2256 | ||
2257 | /* The end of a template parameter list has been reached. Process the | |
2258 | tree list into a parameter vector, converting each parameter into a more | |
2259 | useful form. Type parameters are saved as IDENTIFIER_NODEs, and others | |
2260 | as PARM_DECLs. */ | |
2261 | ||
2262 | tree | |
3a978d72 | 2263 | end_template_parm_list (tree parms) |
8d08fdba | 2264 | { |
5566b478 | 2265 | int nparms; |
9471d3e2 | 2266 | tree parm, next; |
5566b478 MS |
2267 | tree saved_parmlist = make_tree_vec (list_length (parms)); |
2268 | ||
5566b478 | 2269 | current_template_parms |
4890c2f4 | 2270 | = tree_cons (size_int (processing_template_decl), |
5566b478 | 2271 | saved_parmlist, current_template_parms); |
8d08fdba | 2272 | |
9471d3e2 NS |
2273 | for (parm = parms, nparms = 0; parm; parm = next, nparms++) |
2274 | { | |
2275 | next = TREE_CHAIN (parm); | |
2276 | TREE_VEC_ELT (saved_parmlist, nparms) = parm; | |
2277 | TREE_CHAIN (parm) = NULL_TREE; | |
2278 | } | |
a292b002 | 2279 | |
67ffc812 MM |
2280 | --processing_template_parmlist; |
2281 | ||
8d08fdba MS |
2282 | return saved_parmlist; |
2283 | } | |
2284 | ||
5566b478 MS |
2285 | /* end_template_decl is called after a template declaration is seen. */ |
2286 | ||
8d08fdba | 2287 | void |
3a978d72 | 2288 | end_template_decl (void) |
8d08fdba | 2289 | { |
386b8a85 JM |
2290 | reset_specialization (); |
2291 | ||
5156628f | 2292 | if (! processing_template_decl) |
73aad9b9 JM |
2293 | return; |
2294 | ||
5566b478 | 2295 | /* This matches the pushlevel in begin_template_parm_list. */ |
74b846e0 | 2296 | finish_scope (); |
8d08fdba | 2297 | |
5566b478 MS |
2298 | --processing_template_decl; |
2299 | current_template_parms = TREE_CHAIN (current_template_parms); | |
5566b478 | 2300 | } |
8d08fdba | 2301 | |
36a117a5 MM |
2302 | /* Given a template argument vector containing the template PARMS. |
2303 | The innermost PARMS are given first. */ | |
9a3b49ac MS |
2304 | |
2305 | tree | |
3a978d72 | 2306 | current_template_args (void) |
5566b478 | 2307 | { |
36a117a5 | 2308 | tree header; |
b370501f | 2309 | tree args = NULL_TREE; |
36a117a5 | 2310 | int length = TMPL_PARMS_DEPTH (current_template_parms); |
98c1c668 JM |
2311 | int l = length; |
2312 | ||
36a117a5 MM |
2313 | /* If there is only one level of template parameters, we do not |
2314 | create a TREE_VEC of TREE_VECs. Instead, we return a single | |
2315 | TREE_VEC containing the arguments. */ | |
2316 | if (length > 1) | |
2317 | args = make_tree_vec (length); | |
2318 | ||
2319 | for (header = current_template_parms; header; header = TREE_CHAIN (header)) | |
8d08fdba | 2320 | { |
5566b478 | 2321 | tree a = copy_node (TREE_VALUE (header)); |
36a117a5 MM |
2322 | int i; |
2323 | ||
5566b478 | 2324 | TREE_TYPE (a) = NULL_TREE; |
36a117a5 | 2325 | for (i = TREE_VEC_LENGTH (a) - 1; i >= 0; --i) |
5566b478 | 2326 | { |
98c1c668 JM |
2327 | tree t = TREE_VEC_ELT (a, i); |
2328 | ||
36a117a5 | 2329 | /* T will be a list if we are called from within a |
98c1c668 JM |
2330 | begin/end_template_parm_list pair, but a vector directly |
2331 | if within a begin/end_member_template_processing pair. */ | |
2332 | if (TREE_CODE (t) == TREE_LIST) | |
2333 | { | |
2334 | t = TREE_VALUE (t); | |
2335 | ||
73b0fce8 KL |
2336 | if (TREE_CODE (t) == TYPE_DECL |
2337 | || TREE_CODE (t) == TEMPLATE_DECL) | |
98c1c668 JM |
2338 | t = TREE_TYPE (t); |
2339 | else | |
2340 | t = DECL_INITIAL (t); | |
36a117a5 | 2341 | TREE_VEC_ELT (a, i) = t; |
98c1c668 | 2342 | } |
5566b478 | 2343 | } |
36a117a5 MM |
2344 | |
2345 | if (length > 1) | |
2346 | TREE_VEC_ELT (args, --l) = a; | |
2347 | else | |
2348 | args = a; | |
8d08fdba MS |
2349 | } |
2350 | ||
9a3b49ac MS |
2351 | return args; |
2352 | } | |
75650646 | 2353 | |
e1467ff2 MM |
2354 | /* Return a TEMPLATE_DECL corresponding to DECL, using the indicated |
2355 | template PARMS. Used by push_template_decl below. */ | |
2356 | ||
75650646 | 2357 | static tree |
3a978d72 | 2358 | build_template_decl (tree decl, tree parms) |
75650646 MM |
2359 | { |
2360 | tree tmpl = build_lang_decl (TEMPLATE_DECL, DECL_NAME (decl), NULL_TREE); | |
2361 | DECL_TEMPLATE_PARMS (tmpl) = parms; | |
2362 | DECL_CONTEXT (tmpl) = DECL_CONTEXT (decl); | |
2363 | if (DECL_LANG_SPECIFIC (decl)) | |
2364 | { | |
8f032717 MM |
2365 | DECL_STATIC_FUNCTION_P (tmpl) = DECL_STATIC_FUNCTION_P (decl); |
2366 | DECL_CONSTRUCTOR_P (tmpl) = DECL_CONSTRUCTOR_P (decl); | |
c8460010 | 2367 | DECL_DESTRUCTOR_P (tmpl) = DECL_DESTRUCTOR_P (decl); |
11f98788 | 2368 | DECL_NONCONVERTING_P (tmpl) = DECL_NONCONVERTING_P (decl); |
1f6e1acc AS |
2369 | DECL_ASSIGNMENT_OPERATOR_P (tmpl) = DECL_ASSIGNMENT_OPERATOR_P (decl); |
2370 | if (DECL_OVERLOADED_OPERATOR_P (decl)) | |
2371 | SET_OVERLOADED_OPERATOR_CODE (tmpl, | |
2372 | DECL_OVERLOADED_OPERATOR_P (decl)); | |
75650646 MM |
2373 | } |
2374 | ||
2375 | return tmpl; | |
2376 | } | |
2377 | ||
050367a3 MM |
2378 | struct template_parm_data |
2379 | { | |
6c30752f MM |
2380 | /* The level of the template parameters we are currently |
2381 | processing. */ | |
050367a3 | 2382 | int level; |
6c30752f MM |
2383 | |
2384 | /* The index of the specialization argument we are currently | |
2385 | processing. */ | |
2386 | int current_arg; | |
2387 | ||
2388 | /* An array whose size is the number of template parameters. The | |
838dfd8a | 2389 | elements are nonzero if the parameter has been used in any one |
6c30752f | 2390 | of the arguments processed so far. */ |
050367a3 | 2391 | int* parms; |
6c30752f MM |
2392 | |
2393 | /* An array whose size is the number of template arguments. The | |
838dfd8a | 2394 | elements are nonzero if the argument makes use of template |
6c30752f MM |
2395 | parameters of this level. */ |
2396 | int* arg_uses_template_parms; | |
050367a3 MM |
2397 | }; |
2398 | ||
2399 | /* Subroutine of push_template_decl used to see if each template | |
2400 | parameter in a partial specialization is used in the explicit | |
2401 | argument list. If T is of the LEVEL given in DATA (which is | |
2402 | treated as a template_parm_data*), then DATA->PARMS is marked | |
2403 | appropriately. */ | |
2404 | ||
2405 | static int | |
3a978d72 | 2406 | mark_template_parm (tree t, void* data) |
050367a3 MM |
2407 | { |
2408 | int level; | |
2409 | int idx; | |
2410 | struct template_parm_data* tpd = (struct template_parm_data*) data; | |
2411 | ||
2412 | if (TREE_CODE (t) == TEMPLATE_PARM_INDEX) | |
2413 | { | |
2414 | level = TEMPLATE_PARM_LEVEL (t); | |
2415 | idx = TEMPLATE_PARM_IDX (t); | |
2416 | } | |
2417 | else | |
2418 | { | |
2419 | level = TEMPLATE_TYPE_LEVEL (t); | |
2420 | idx = TEMPLATE_TYPE_IDX (t); | |
2421 | } | |
2422 | ||
2423 | if (level == tpd->level) | |
6c30752f MM |
2424 | { |
2425 | tpd->parms[idx] = 1; | |
2426 | tpd->arg_uses_template_parms[tpd->current_arg] = 1; | |
2427 | } | |
050367a3 MM |
2428 | |
2429 | /* Return zero so that for_each_template_parm will continue the | |
2430 | traversal of the tree; we want to mark *every* template parm. */ | |
2431 | return 0; | |
2432 | } | |
2433 | ||
6c30752f MM |
2434 | /* Process the partial specialization DECL. */ |
2435 | ||
e9659ab0 | 2436 | static tree |
3a978d72 | 2437 | process_partial_specialization (tree decl) |
6c30752f MM |
2438 | { |
2439 | tree type = TREE_TYPE (decl); | |
2440 | tree maintmpl = CLASSTYPE_TI_TEMPLATE (type); | |
2441 | tree specargs = CLASSTYPE_TI_ARGS (type); | |
f9a7ae04 | 2442 | tree inner_args = INNERMOST_TEMPLATE_ARGS (specargs); |
6c30752f MM |
2443 | tree inner_parms = INNERMOST_TEMPLATE_PARMS (current_template_parms); |
2444 | tree main_inner_parms = DECL_INNERMOST_TEMPLATE_PARMS (maintmpl); | |
2445 | int nargs = TREE_VEC_LENGTH (inner_args); | |
2446 | int ntparms = TREE_VEC_LENGTH (inner_parms); | |
2447 | int i; | |
2448 | int did_error_intro = 0; | |
6c30752f MM |
2449 | struct template_parm_data tpd; |
2450 | struct template_parm_data tpd2; | |
2451 | ||
6c30752f MM |
2452 | /* We check that each of the template parameters given in the |
2453 | partial specialization is used in the argument list to the | |
2454 | specialization. For example: | |
2455 | ||
2456 | template <class T> struct S; | |
2457 | template <class T> struct S<T*>; | |
2458 | ||
2459 | The second declaration is OK because `T*' uses the template | |
2460 | parameter T, whereas | |
2461 | ||
2462 | template <class T> struct S<int>; | |
2463 | ||
2464 | is no good. Even trickier is: | |
2465 | ||
2466 | template <class T> | |
2467 | struct S1 | |
2468 | { | |
2469 | template <class U> | |
2470 | struct S2; | |
2471 | template <class U> | |
2472 | struct S2<T>; | |
2473 | }; | |
2474 | ||
0e339752 | 2475 | The S2<T> declaration is actually invalid; it is a |
6c30752f MM |
2476 | full-specialization. Of course, |
2477 | ||
2478 | template <class U> | |
2479 | struct S2<T (*)(U)>; | |
2480 | ||
2481 | or some such would have been OK. */ | |
2482 | tpd.level = TMPL_PARMS_DEPTH (current_template_parms); | |
2483 | tpd.parms = alloca (sizeof (int) * ntparms); | |
fad205ff | 2484 | memset (tpd.parms, 0, sizeof (int) * ntparms); |
6c30752f MM |
2485 | |
2486 | tpd.arg_uses_template_parms = alloca (sizeof (int) * nargs); | |
fad205ff | 2487 | memset (tpd.arg_uses_template_parms, 0, sizeof (int) * nargs); |
6c30752f MM |
2488 | for (i = 0; i < nargs; ++i) |
2489 | { | |
2490 | tpd.current_arg = i; | |
2491 | for_each_template_parm (TREE_VEC_ELT (inner_args, i), | |
2492 | &mark_template_parm, | |
4f2c9d7e MM |
2493 | &tpd, |
2494 | NULL); | |
6c30752f MM |
2495 | } |
2496 | for (i = 0; i < ntparms; ++i) | |
2497 | if (tpd.parms[i] == 0) | |
2498 | { | |
2499 | /* One of the template parms was not used in the | |
f9a7ae04 | 2500 | specialization. */ |
6c30752f MM |
2501 | if (!did_error_intro) |
2502 | { | |
33bd39a2 | 2503 | error ("template parameters not used in partial specialization:"); |
6c30752f MM |
2504 | did_error_intro = 1; |
2505 | } | |
2506 | ||
33bd39a2 | 2507 | error (" `%D'", |
6c30752f MM |
2508 | TREE_VALUE (TREE_VEC_ELT (inner_parms, i))); |
2509 | } | |
2510 | ||
2511 | /* [temp.class.spec] | |
2512 | ||
2513 | The argument list of the specialization shall not be identical to | |
2514 | the implicit argument list of the primary template. */ | |
f9a7ae04 MM |
2515 | if (comp_template_args |
2516 | (inner_args, | |
2517 | INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (TREE_TYPE | |
2518 | (maintmpl))))) | |
33bd39a2 | 2519 | error ("partial specialization `%T' does not specialize any template arguments", type); |
6c30752f MM |
2520 | |
2521 | /* [temp.class.spec] | |
2522 | ||
2523 | A partially specialized non-type argument expression shall not | |
2524 | involve template parameters of the partial specialization except | |
2525 | when the argument expression is a simple identifier. | |
2526 | ||
2527 | The type of a template parameter corresponding to a specialized | |
2528 | non-type argument shall not be dependent on a parameter of the | |
2529 | specialization. */ | |
2530 | my_friendly_assert (nargs == DECL_NTPARMS (maintmpl), 0); | |
2531 | tpd2.parms = 0; | |
2532 | for (i = 0; i < nargs; ++i) | |
2533 | { | |
2534 | tree arg = TREE_VEC_ELT (inner_args, i); | |
2535 | if (/* These first two lines are the `non-type' bit. */ | |
2f939d94 | 2536 | !TYPE_P (arg) |
6c30752f MM |
2537 | && TREE_CODE (arg) != TEMPLATE_DECL |
2538 | /* This next line is the `argument expression is not just a | |
2539 | simple identifier' condition and also the `specialized | |
2540 | non-type argument' bit. */ | |
2541 | && TREE_CODE (arg) != TEMPLATE_PARM_INDEX) | |
2542 | { | |
2543 | if (tpd.arg_uses_template_parms[i]) | |
33bd39a2 | 2544 | error ("template argument `%E' involves template parameter(s)", arg); |
6c30752f MM |
2545 | else |
2546 | { | |
2547 | /* Look at the corresponding template parameter, | |
2548 | marking which template parameters its type depends | |
2549 | upon. */ | |
2550 | tree type = | |
2551 | TREE_TYPE (TREE_VALUE (TREE_VEC_ELT (main_inner_parms, | |
2552 | i))); | |
2553 | ||
2554 | if (!tpd2.parms) | |
2555 | { | |
2556 | /* We haven't yet initialized TPD2. Do so now. */ | |
2557 | tpd2.arg_uses_template_parms | |
c68b0a84 | 2558 | = alloca (sizeof (int) * nargs); |
104bf76a | 2559 | /* The number of parameters here is the number in the |
76a83782 RH |
2560 | main template, which, as checked in the assertion |
2561 | above, is NARGS. */ | |
c68b0a84 | 2562 | tpd2.parms = alloca (sizeof (int) * nargs); |
6c30752f MM |
2563 | tpd2.level = |
2564 | TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (maintmpl)); | |
2565 | } | |
2566 | ||
104bf76a | 2567 | /* Mark the template parameters. But this time, we're |
6c30752f MM |
2568 | looking for the template parameters of the main |
2569 | template, not in the specialization. */ | |
2570 | tpd2.current_arg = i; | |
2571 | tpd2.arg_uses_template_parms[i] = 0; | |
fad205ff | 2572 | memset (tpd2.parms, 0, sizeof (int) * nargs); |
6c30752f MM |
2573 | for_each_template_parm (type, |
2574 | &mark_template_parm, | |
4f2c9d7e MM |
2575 | &tpd2, |
2576 | NULL); | |
6c30752f MM |
2577 | |
2578 | if (tpd2.arg_uses_template_parms [i]) | |
2579 | { | |
2580 | /* The type depended on some template parameters. | |
2581 | If they are fully specialized in the | |
2582 | specialization, that's OK. */ | |
2583 | int j; | |
2584 | for (j = 0; j < nargs; ++j) | |
2585 | if (tpd2.parms[j] != 0 | |
2586 | && tpd.arg_uses_template_parms [j]) | |
2587 | { | |
33bd39a2 | 2588 | error ("type `%T' of template argument `%E' depends on template parameter(s)", |
6c30752f MM |
2589 | type, |
2590 | arg); | |
2591 | break; | |
2592 | } | |
2593 | } | |
2594 | } | |
2595 | } | |
2596 | } | |
2597 | ||
2598 | if (retrieve_specialization (maintmpl, specargs)) | |
2599 | /* We've already got this specialization. */ | |
2600 | return decl; | |
2601 | ||
d8b64f80 | 2602 | DECL_TEMPLATE_SPECIALIZATIONS (maintmpl) |
e1b3e07d MM |
2603 | = tree_cons (inner_args, inner_parms, |
2604 | DECL_TEMPLATE_SPECIALIZATIONS (maintmpl)); | |
6c30752f MM |
2605 | TREE_TYPE (DECL_TEMPLATE_SPECIALIZATIONS (maintmpl)) = type; |
2606 | return decl; | |
2607 | } | |
2608 | ||
6ba89f8e MM |
2609 | /* Check that a template declaration's use of default arguments is not |
2610 | invalid. Here, PARMS are the template parameters. IS_PRIMARY is | |
838dfd8a KH |
2611 | nonzero if DECL is the thing declared by a primary template. |
2612 | IS_PARTIAL is nonzero if DECL is a partial specialization. */ | |
6ba89f8e MM |
2613 | |
2614 | static void | |
3a978d72 | 2615 | check_default_tmpl_args (tree decl, tree parms, int is_primary, int is_partial) |
6ba89f8e | 2616 | { |
d8e178a0 | 2617 | const char *msg; |
66191c20 MM |
2618 | int last_level_to_check; |
2619 | tree parm_level; | |
6ba89f8e MM |
2620 | |
2621 | /* [temp.param] | |
2622 | ||
2623 | A default template-argument shall not be specified in a | |
2624 | function template declaration or a function template definition, nor | |
2625 | in the template-parameter-list of the definition of a member of a | |
2626 | class template. */ | |
2627 | ||
4f1c5b7d | 2628 | if (TREE_CODE (CP_DECL_CONTEXT (decl)) == FUNCTION_DECL) |
e0942dcd MM |
2629 | /* You can't have a function template declaration in a local |
2630 | scope, nor you can you define a member of a class template in a | |
2631 | local scope. */ | |
2632 | return; | |
2633 | ||
6ba89f8e MM |
2634 | if (current_class_type |
2635 | && !TYPE_BEING_DEFINED (current_class_type) | |
3d7de1fa | 2636 | && DECL_LANG_SPECIFIC (decl) |
5937a6f9 MM |
2637 | /* If this is either a friend defined in the scope of the class |
2638 | or a member function. */ | |
6df5158a NS |
2639 | && (DECL_FUNCTION_MEMBER_P (decl) |
2640 | ? same_type_p (DECL_CONTEXT (decl), current_class_type) | |
2641 | : DECL_FRIEND_CONTEXT (decl) | |
2642 | ? same_type_p (DECL_FRIEND_CONTEXT (decl), current_class_type) | |
2643 | : false) | |
5937a6f9 MM |
2644 | /* And, if it was a member function, it really was defined in |
2645 | the scope of the class. */ | |
6df5158a NS |
2646 | && (!DECL_FUNCTION_MEMBER_P (decl) |
2647 | || DECL_INITIALIZED_IN_CLASS_P (decl))) | |
6ba89f8e | 2648 | /* We already checked these parameters when the template was |
5937a6f9 MM |
2649 | declared, so there's no need to do it again now. This function |
2650 | was defined in class scope, but we're processing it's body now | |
2651 | that the class is complete. */ | |
6ba89f8e MM |
2652 | return; |
2653 | ||
66191c20 MM |
2654 | /* [temp.param] |
2655 | ||
2656 | If a template-parameter has a default template-argument, all | |
2657 | subsequent template-parameters shall have a default | |
2658 | template-argument supplied. */ | |
2659 | for (parm_level = parms; parm_level; parm_level = TREE_CHAIN (parm_level)) | |
2660 | { | |
2661 | tree inner_parms = TREE_VALUE (parm_level); | |
2662 | int ntparms = TREE_VEC_LENGTH (inner_parms); | |
2663 | int seen_def_arg_p = 0; | |
2664 | int i; | |
2665 | ||
2666 | for (i = 0; i < ntparms; ++i) | |
2667 | { | |
2668 | tree parm = TREE_VEC_ELT (inner_parms, i); | |
2669 | if (TREE_PURPOSE (parm)) | |
2670 | seen_def_arg_p = 1; | |
2671 | else if (seen_def_arg_p) | |
2672 | { | |
33bd39a2 | 2673 | error ("no default argument for `%D'", TREE_VALUE (parm)); |
66191c20 MM |
2674 | /* For better subsequent error-recovery, we indicate that |
2675 | there should have been a default argument. */ | |
2676 | TREE_PURPOSE (parm) = error_mark_node; | |
2677 | } | |
2678 | } | |
2679 | } | |
2680 | ||
6ba89f8e MM |
2681 | if (TREE_CODE (decl) != TYPE_DECL || is_partial || !is_primary) |
2682 | /* For an ordinary class template, default template arguments are | |
2683 | allowed at the innermost level, e.g.: | |
2684 | template <class T = int> | |
2685 | struct S {}; | |
2686 | but, in a partial specialization, they're not allowed even | |
2687 | there, as we have in [temp.class.spec]: | |
2688 | ||
2689 | The template parameter list of a specialization shall not | |
2690 | contain default template argument values. | |
2691 | ||
2692 | So, for a partial specialization, or for a function template, | |
2693 | we look at all of them. */ | |
2694 | ; | |
2695 | else | |
2696 | /* But, for a primary class template that is not a partial | |
2697 | specialization we look at all template parameters except the | |
2698 | innermost ones. */ | |
2699 | parms = TREE_CHAIN (parms); | |
2700 | ||
2701 | /* Figure out what error message to issue. */ | |
2702 | if (TREE_CODE (decl) == FUNCTION_DECL) | |
8653a2c3 | 2703 | msg = "default template arguments may not be used in function templates"; |
6ba89f8e | 2704 | else if (is_partial) |
8653a2c3 | 2705 | msg = "default template arguments may not be used in partial specializations"; |
6ba89f8e MM |
2706 | else |
2707 | msg = "default argument for template parameter for class enclosing `%D'"; | |
2708 | ||
2709 | if (current_class_type && TYPE_BEING_DEFINED (current_class_type)) | |
2710 | /* If we're inside a class definition, there's no need to | |
104bf76a | 2711 | examine the parameters to the class itself. On the one |
6ba89f8e | 2712 | hand, they will be checked when the class is defined, and, |
0e339752 | 2713 | on the other, default arguments are valid in things like: |
6ba89f8e MM |
2714 | template <class T = double> |
2715 | struct S { template <class U> void f(U); }; | |
2716 | Here the default argument for `S' has no bearing on the | |
2717 | declaration of `f'. */ | |
2718 | last_level_to_check = template_class_depth (current_class_type) + 1; | |
2719 | else | |
2720 | /* Check everything. */ | |
2721 | last_level_to_check = 0; | |
2722 | ||
66191c20 MM |
2723 | for (parm_level = parms; |
2724 | parm_level && TMPL_PARMS_DEPTH (parm_level) >= last_level_to_check; | |
2725 | parm_level = TREE_CHAIN (parm_level)) | |
6ba89f8e | 2726 | { |
66191c20 MM |
2727 | tree inner_parms = TREE_VALUE (parm_level); |
2728 | int i; | |
2729 | int ntparms; | |
6ba89f8e MM |
2730 | |
2731 | ntparms = TREE_VEC_LENGTH (inner_parms); | |
2732 | for (i = 0; i < ntparms; ++i) | |
2733 | if (TREE_PURPOSE (TREE_VEC_ELT (inner_parms, i))) | |
2734 | { | |
2735 | if (msg) | |
2736 | { | |
33bd39a2 | 2737 | error (msg, decl); |
6ba89f8e MM |
2738 | msg = 0; |
2739 | } | |
2740 | ||
2741 | /* Clear out the default argument so that we are not | |
2742 | confused later. */ | |
2743 | TREE_PURPOSE (TREE_VEC_ELT (inner_parms, i)) = NULL_TREE; | |
2744 | } | |
2745 | ||
2746 | /* At this point, if we're still interested in issuing messages, | |
2747 | they must apply to classes surrounding the object declared. */ | |
2748 | if (msg) | |
2749 | msg = "default argument for template parameter for class enclosing `%D'"; | |
2750 | } | |
2751 | } | |
2752 | ||
5dd236e2 NS |
2753 | /* Worker for push_template_decl_real, called via |
2754 | for_each_template_parm. DATA is really an int, indicating the | |
2755 | level of the parameters we are interested in. If T is a template | |
838dfd8a | 2756 | parameter of that level, return nonzero. */ |
5dd236e2 NS |
2757 | |
2758 | static int | |
3a978d72 | 2759 | template_parm_this_level_p (tree t, void* data) |
5dd236e2 | 2760 | { |
6e04241f | 2761 | int this_level = *(int *)data; |
5dd236e2 NS |
2762 | int level; |
2763 | ||
2764 | if (TREE_CODE (t) == TEMPLATE_PARM_INDEX) | |
2765 | level = TEMPLATE_PARM_LEVEL (t); | |
2766 | else | |
2767 | level = TEMPLATE_TYPE_LEVEL (t); | |
2768 | return level == this_level; | |
2769 | } | |
2770 | ||
3ac3d9ea | 2771 | /* Creates a TEMPLATE_DECL for the indicated DECL using the template |
f84b4be9 JM |
2772 | parameters given by current_template_args, or reuses a |
2773 | previously existing one, if appropriate. Returns the DECL, or an | |
6757edfe MM |
2774 | equivalent one, if it is replaced via a call to duplicate_decls. |
2775 | ||
838dfd8a | 2776 | If IS_FRIEND is nonzero, DECL is a friend declaration. */ |
3ac3d9ea MM |
2777 | |
2778 | tree | |
3a978d72 | 2779 | push_template_decl_real (tree decl, int is_friend) |
9a3b49ac MS |
2780 | { |
2781 | tree tmpl; | |
f84b4be9 | 2782 | tree args; |
9a3b49ac | 2783 | tree info; |
f84b4be9 JM |
2784 | tree ctx; |
2785 | int primary; | |
6ba89f8e | 2786 | int is_partial; |
cfe507be | 2787 | int new_template_p = 0; |
6ba89f8e | 2788 | |
c0694c4b MM |
2789 | if (decl == error_mark_node) |
2790 | return decl; | |
2791 | ||
6ba89f8e | 2792 | /* See if this is a partial specialization. */ |
9188c363 | 2793 | is_partial = (DECL_IMPLICIT_TYPEDEF_P (decl) |
6ba89f8e | 2794 | && TREE_CODE (TREE_TYPE (decl)) != ENUMERAL_TYPE |
370af2d5 | 2795 | && CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_TYPE (decl))); |
6757edfe MM |
2796 | |
2797 | is_friend |= (TREE_CODE (decl) == FUNCTION_DECL && DECL_FRIEND_P (decl)); | |
f84b4be9 JM |
2798 | |
2799 | if (is_friend) | |
2800 | /* For a friend, we want the context of the friend function, not | |
2801 | the type of which it is a friend. */ | |
2802 | ctx = DECL_CONTEXT (decl); | |
4f1c5b7d MM |
2803 | else if (CP_DECL_CONTEXT (decl) |
2804 | && TREE_CODE (CP_DECL_CONTEXT (decl)) != NAMESPACE_DECL) | |
f84b4be9 JM |
2805 | /* In the case of a virtual function, we want the class in which |
2806 | it is defined. */ | |
4f1c5b7d | 2807 | ctx = CP_DECL_CONTEXT (decl); |
f84b4be9 | 2808 | else |
dc957d14 | 2809 | /* Otherwise, if we're currently defining some class, the DECL |
f84b4be9 | 2810 | is assumed to be a member of the class. */ |
9188c363 | 2811 | ctx = current_scope (); |
f84b4be9 | 2812 | |
2c73f9f5 ML |
2813 | if (ctx && TREE_CODE (ctx) == NAMESPACE_DECL) |
2814 | ctx = NULL_TREE; | |
2815 | ||
2816 | if (!DECL_CONTEXT (decl)) | |
cb0dbb9a | 2817 | DECL_CONTEXT (decl) = FROB_CONTEXT (current_namespace); |
2c73f9f5 | 2818 | |
6ba89f8e | 2819 | /* See if this is a primary template. */ |
74b846e0 | 2820 | primary = template_parm_scope_p (); |
9a3b49ac | 2821 | |
83566abf JM |
2822 | if (primary) |
2823 | { | |
2824 | if (current_lang_name == lang_name_c) | |
33bd39a2 | 2825 | error ("template with C linkage"); |
4ce3d537 MM |
2826 | else if (TREE_CODE (decl) == TYPE_DECL |
2827 | && ANON_AGGRNAME_P (DECL_NAME (decl))) | |
33bd39a2 | 2828 | error ("template class without a name"); |
4b0d3cbe MM |
2829 | else if (TREE_CODE (decl) == FUNCTION_DECL |
2830 | && DECL_DESTRUCTOR_P (decl)) | |
2831 | { | |
2832 | /* [temp.mem] | |
2833 | ||
2834 | A destructor shall not be a member template. */ | |
2835 | error ("destructor `%D' declared as member template", decl); | |
2836 | return error_mark_node; | |
2837 | } | |
2aaf816d JM |
2838 | else if ((DECL_IMPLICIT_TYPEDEF_P (decl) |
2839 | && CLASS_TYPE_P (TREE_TYPE (decl))) | |
2840 | || (TREE_CODE (decl) == VAR_DECL && ctx && CLASS_TYPE_P (ctx)) | |
2841 | || TREE_CODE (decl) == FUNCTION_DECL) | |
2842 | /* OK */; | |
2843 | else | |
11325dcd KL |
2844 | { |
2845 | error ("template declaration of `%#D'", decl); | |
2846 | return error_mark_node; | |
2847 | } | |
83566abf JM |
2848 | } |
2849 | ||
6ba89f8e MM |
2850 | /* Check to see that the rules regarding the use of default |
2851 | arguments are not being violated. */ | |
2852 | check_default_tmpl_args (decl, current_template_parms, | |
2853 | primary, is_partial); | |
73aad9b9 | 2854 | |
6ba89f8e MM |
2855 | if (is_partial) |
2856 | return process_partial_specialization (decl); | |
d32789d8 | 2857 | |
9a3b49ac MS |
2858 | args = current_template_args (); |
2859 | ||
f84b4be9 JM |
2860 | if (!ctx |
2861 | || TREE_CODE (ctx) == FUNCTION_DECL | |
a723baf1 | 2862 | || (CLASS_TYPE_P (ctx) && TYPE_BEING_DEFINED (ctx)) |
f84b4be9 | 2863 | || (is_friend && !DECL_TEMPLATE_INFO (decl))) |
8d08fdba | 2864 | { |
75650646 | 2865 | if (DECL_LANG_SPECIFIC (decl) |
f84b4be9 JM |
2866 | && DECL_TEMPLATE_INFO (decl) |
2867 | && DECL_TI_TEMPLATE (decl)) | |
2868 | tmpl = DECL_TI_TEMPLATE (decl); | |
1c10870d AS |
2869 | /* If DECL is a TYPE_DECL for a class-template, then there won't |
2870 | be DECL_LANG_SPECIFIC. The information equivalent to | |
2871 | DECL_TEMPLATE_INFO is found in TYPE_TEMPLATE_INFO instead. */ | |
2872 | else if (DECL_IMPLICIT_TYPEDEF_P (decl) | |
2873 | && TYPE_TEMPLATE_INFO (TREE_TYPE (decl)) | |
2874 | && TYPE_TI_TEMPLATE (TREE_TYPE (decl))) | |
2875 | { | |
2876 | /* Since a template declaration already existed for this | |
2877 | class-type, we must be redeclaring it here. Make sure | |
0e339752 | 2878 | that the redeclaration is valid. */ |
1c10870d AS |
2879 | redeclare_class_template (TREE_TYPE (decl), |
2880 | current_template_parms); | |
2881 | /* We don't need to create a new TEMPLATE_DECL; just use the | |
2882 | one we already had. */ | |
2883 | tmpl = TYPE_TI_TEMPLATE (TREE_TYPE (decl)); | |
2884 | } | |
f84b4be9 | 2885 | else |
786b5245 | 2886 | { |
f84b4be9 | 2887 | tmpl = build_template_decl (decl, current_template_parms); |
cfe507be MM |
2888 | new_template_p = 1; |
2889 | ||
f84b4be9 JM |
2890 | if (DECL_LANG_SPECIFIC (decl) |
2891 | && DECL_TEMPLATE_SPECIALIZATION (decl)) | |
2892 | { | |
2893 | /* A specialization of a member template of a template | |
c6002625 | 2894 | class. */ |
f84b4be9 JM |
2895 | SET_DECL_TEMPLATE_SPECIALIZATION (tmpl); |
2896 | DECL_TEMPLATE_INFO (tmpl) = DECL_TEMPLATE_INFO (decl); | |
2897 | DECL_TEMPLATE_INFO (decl) = NULL_TREE; | |
2898 | } | |
786b5245 | 2899 | } |
8d08fdba MS |
2900 | } |
2901 | else | |
2902 | { | |
e1a5ccf7 | 2903 | tree a, t, current, parms; |
ba4f4e5d | 2904 | int i; |
6633d636 | 2905 | |
6b9ab5cc MM |
2906 | if (TREE_CODE (decl) == TYPE_DECL) |
2907 | { | |
ed44da02 MM |
2908 | if ((IS_AGGR_TYPE_CODE (TREE_CODE (TREE_TYPE (decl))) |
2909 | || TREE_CODE (TREE_TYPE (decl)) == ENUMERAL_TYPE) | |
2910 | && TYPE_TEMPLATE_INFO (TREE_TYPE (decl)) | |
2911 | && TYPE_TI_TEMPLATE (TREE_TYPE (decl))) | |
2912 | tmpl = TYPE_TI_TEMPLATE (TREE_TYPE (decl)); | |
6b9ab5cc MM |
2913 | else |
2914 | { | |
33bd39a2 | 2915 | error ("`%D' does not declare a template type", decl); |
6b9ab5cc MM |
2916 | return decl; |
2917 | } | |
2918 | } | |
f3368a90 | 2919 | else if (!DECL_LANG_SPECIFIC (decl) || !DECL_TEMPLATE_INFO (decl)) |
c91a56d2 | 2920 | { |
33bd39a2 | 2921 | error ("template definition of non-template `%#D'", decl); |
3ac3d9ea | 2922 | return decl; |
c91a56d2 | 2923 | } |
8d08fdba | 2924 | else |
5566b478 | 2925 | tmpl = DECL_TI_TEMPLATE (decl); |
98c1c668 | 2926 | |
c353b8e3 | 2927 | if (DECL_FUNCTION_TEMPLATE_P (tmpl) |
e1a5ccf7 | 2928 | && DECL_TEMPLATE_INFO (decl) && DECL_TI_ARGS (decl) |
c353b8e3 MM |
2929 | && DECL_TEMPLATE_SPECIALIZATION (decl) |
2930 | && is_member_template (tmpl)) | |
98c1c668 | 2931 | { |
e1a5ccf7 JM |
2932 | tree new_tmpl; |
2933 | ||
2934 | /* The declaration is a specialization of a member | |
2935 | template, declared outside the class. Therefore, the | |
2936 | innermost template arguments will be NULL, so we | |
2937 | replace them with the arguments determined by the | |
2938 | earlier call to check_explicit_specialization. */ | |
2939 | args = DECL_TI_ARGS (decl); | |
2940 | ||
2941 | new_tmpl | |
2942 | = build_template_decl (decl, current_template_parms); | |
2943 | DECL_TEMPLATE_RESULT (new_tmpl) = decl; | |
2944 | TREE_TYPE (new_tmpl) = TREE_TYPE (decl); | |
2945 | DECL_TI_TEMPLATE (decl) = new_tmpl; | |
2946 | SET_DECL_TEMPLATE_SPECIALIZATION (new_tmpl); | |
e1b3e07d MM |
2947 | DECL_TEMPLATE_INFO (new_tmpl) |
2948 | = tree_cons (tmpl, args, NULL_TREE); | |
e1a5ccf7 | 2949 | |
f9a7ae04 MM |
2950 | register_specialization (new_tmpl, |
2951 | most_general_template (tmpl), | |
2952 | args); | |
e1a5ccf7 | 2953 | return decl; |
98c1c668 | 2954 | } |
98c1c668 | 2955 | |
e1a5ccf7 | 2956 | /* Make sure the template headers we got make sense. */ |
6633d636 | 2957 | |
e1a5ccf7 JM |
2958 | parms = DECL_TEMPLATE_PARMS (tmpl); |
2959 | i = TMPL_PARMS_DEPTH (parms); | |
2960 | if (TMPL_ARGS_DEPTH (args) != i) | |
98c1c668 | 2961 | { |
33bd39a2 | 2962 | error ("expected %d levels of template parms for `%#D', got %d", |
e1a5ccf7 | 2963 | i, decl, TMPL_ARGS_DEPTH (args)); |
98c1c668 | 2964 | } |
e1a5ccf7 JM |
2965 | else |
2966 | for (current = decl; i > 0; --i, parms = TREE_CHAIN (parms)) | |
2967 | { | |
2968 | a = TMPL_ARGS_LEVEL (args, i); | |
2969 | t = INNERMOST_TEMPLATE_PARMS (parms); | |
2970 | ||
2971 | if (TREE_VEC_LENGTH (t) != TREE_VEC_LENGTH (a)) | |
2972 | { | |
2973 | if (current == decl) | |
33bd39a2 | 2974 | error ("got %d template parameters for `%#D'", |
e1a5ccf7 JM |
2975 | TREE_VEC_LENGTH (a), decl); |
2976 | else | |
33bd39a2 | 2977 | error ("got %d template parameters for `%#T'", |
e1a5ccf7 | 2978 | TREE_VEC_LENGTH (a), current); |
33bd39a2 | 2979 | error (" but %d required", TREE_VEC_LENGTH (t)); |
e1a5ccf7 | 2980 | } |
98c1c668 | 2981 | |
e1a5ccf7 JM |
2982 | /* Perhaps we should also check that the parms are used in the |
2983 | appropriate qualifying scopes in the declarator? */ | |
6633d636 | 2984 | |
e1a5ccf7 JM |
2985 | if (current == decl) |
2986 | current = ctx; | |
2987 | else | |
2988 | current = TYPE_CONTEXT (current); | |
2989 | } | |
5566b478 | 2990 | } |
8d08fdba | 2991 | |
5566b478 MS |
2992 | DECL_TEMPLATE_RESULT (tmpl) = decl; |
2993 | TREE_TYPE (tmpl) = TREE_TYPE (decl); | |
8d08fdba | 2994 | |
36a117a5 MM |
2995 | /* Push template declarations for global functions and types. Note |
2996 | that we do not try to push a global template friend declared in a | |
2997 | template class; such a thing may well depend on the template | |
39c01e4c | 2998 | parameters of the class. */ |
cfe507be | 2999 | if (new_template_p && !ctx |
36a117a5 | 3000 | && !(is_friend && template_class_depth (current_class_type) > 0)) |
2c73f9f5 | 3001 | tmpl = pushdecl_namespace_level (tmpl); |
8d08fdba | 3002 | |
5566b478 | 3003 | if (primary) |
5dd236e2 NS |
3004 | { |
3005 | DECL_PRIMARY_TEMPLATE (tmpl) = tmpl; | |
3006 | if (DECL_CONV_FN_P (tmpl)) | |
3007 | { | |
6e04241f GS |
3008 | int depth = TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl)); |
3009 | ||
5dd236e2 NS |
3010 | /* It is a conversion operator. See if the type converted to |
3011 | depends on innermost template operands. */ | |
3012 | ||
d43f603d KL |
3013 | if (uses_template_parms_level (TREE_TYPE (TREE_TYPE (tmpl)), |
3014 | depth)) | |
5dd236e2 NS |
3015 | DECL_TEMPLATE_CONV_FN_P (tmpl) = 1; |
3016 | } | |
3017 | } | |
5566b478 | 3018 | |
a692ad2e | 3019 | /* The DECL_TI_ARGS of DECL contains full set of arguments referring |
28ba38e3 KL |
3020 | back to its most general template. If TMPL is a specialization, |
3021 | ARGS may only have the innermost set of arguments. Add the missing | |
3022 | argument levels if necessary. */ | |
3023 | if (DECL_TEMPLATE_INFO (tmpl)) | |
3024 | args = add_outermost_template_args (DECL_TI_ARGS (tmpl), args); | |
3025 | ||
e1b3e07d | 3026 | info = tree_cons (tmpl, args, NULL_TREE); |
5566b478 | 3027 | |
9188c363 | 3028 | if (DECL_IMPLICIT_TYPEDEF_P (decl)) |
8d08fdba | 3029 | { |
ed44da02 MM |
3030 | SET_TYPE_TEMPLATE_INFO (TREE_TYPE (tmpl), info); |
3031 | if ((!ctx || TREE_CODE (ctx) != FUNCTION_DECL) | |
b60ecc04 MM |
3032 | && TREE_CODE (TREE_TYPE (decl)) != ENUMERAL_TYPE |
3033 | /* Don't change the name if we've already set it up. */ | |
3034 | && !IDENTIFIER_TEMPLATE (DECL_NAME (decl))) | |
75650646 | 3035 | DECL_NAME (decl) = classtype_mangled_name (TREE_TYPE (decl)); |
51c184be | 3036 | } |
2aaf816d | 3037 | else if (DECL_LANG_SPECIFIC (decl)) |
5566b478 | 3038 | DECL_TEMPLATE_INFO (decl) = info; |
3ac3d9ea MM |
3039 | |
3040 | return DECL_TEMPLATE_RESULT (tmpl); | |
8d08fdba MS |
3041 | } |
3042 | ||
6757edfe | 3043 | tree |
3a978d72 | 3044 | push_template_decl (tree decl) |
6757edfe MM |
3045 | { |
3046 | return push_template_decl_real (decl, 0); | |
3047 | } | |
3048 | ||
3049 | /* Called when a class template TYPE is redeclared with the indicated | |
3050 | template PARMS, e.g.: | |
7fe6899f MM |
3051 | |
3052 | template <class T> struct S; | |
3053 | template <class T> struct S {}; */ | |
3054 | ||
3055 | void | |
3a978d72 | 3056 | redeclare_class_template (tree type, tree parms) |
7fe6899f | 3057 | { |
3d7de1fa | 3058 | tree tmpl; |
6757edfe | 3059 | tree tmpl_parms; |
7fe6899f MM |
3060 | int i; |
3061 | ||
3d7de1fa MM |
3062 | if (!TYPE_TEMPLATE_INFO (type)) |
3063 | { | |
33bd39a2 | 3064 | error ("`%T' is not a template type", type); |
3d7de1fa MM |
3065 | return; |
3066 | } | |
3067 | ||
3068 | tmpl = TYPE_TI_TEMPLATE (type); | |
7fe6899f MM |
3069 | if (!PRIMARY_TEMPLATE_P (tmpl)) |
3070 | /* The type is nested in some template class. Nothing to worry | |
3071 | about here; there are no new template parameters for the nested | |
3072 | type. */ | |
3073 | return; | |
3074 | ||
6757edfe MM |
3075 | parms = INNERMOST_TEMPLATE_PARMS (parms); |
3076 | tmpl_parms = DECL_INNERMOST_TEMPLATE_PARMS (tmpl); | |
3077 | ||
7fe6899f MM |
3078 | if (TREE_VEC_LENGTH (parms) != TREE_VEC_LENGTH (tmpl_parms)) |
3079 | { | |
8251199e | 3080 | cp_error_at ("previous declaration `%D'", tmpl); |
33bd39a2 | 3081 | error ("used %d template parameter%s instead of %d", |
7fe6899f MM |
3082 | TREE_VEC_LENGTH (tmpl_parms), |
3083 | TREE_VEC_LENGTH (tmpl_parms) == 1 ? "" : "s", | |
3084 | TREE_VEC_LENGTH (parms)); | |
3085 | return; | |
3086 | } | |
3087 | ||
3088 | for (i = 0; i < TREE_VEC_LENGTH (tmpl_parms); ++i) | |
3089 | { | |
3090 | tree tmpl_parm = TREE_VALUE (TREE_VEC_ELT (tmpl_parms, i)); | |
3091 | tree parm = TREE_VALUE (TREE_VEC_ELT (parms, i)); | |
3092 | tree tmpl_default = TREE_PURPOSE (TREE_VEC_ELT (tmpl_parms, i)); | |
3093 | tree parm_default = TREE_PURPOSE (TREE_VEC_ELT (parms, i)); | |
3094 | ||
3095 | if (TREE_CODE (tmpl_parm) != TREE_CODE (parm)) | |
3096 | { | |
8251199e | 3097 | cp_error_at ("template parameter `%#D'", tmpl_parm); |
33bd39a2 | 3098 | error ("redeclared here as `%#D'", parm); |
7fe6899f MM |
3099 | return; |
3100 | } | |
3101 | ||
3102 | if (tmpl_default != NULL_TREE && parm_default != NULL_TREE) | |
3103 | { | |
3104 | /* We have in [temp.param]: | |
3105 | ||
3106 | A template-parameter may not be given default arguments | |
3107 | by two different declarations in the same scope. */ | |
33bd39a2 | 3108 | error ("redefinition of default argument for `%#D'", parm); |
ddd2d57e | 3109 | error ("%J original definition appeared here", tmpl_parm); |
7fe6899f MM |
3110 | return; |
3111 | } | |
3112 | ||
3113 | if (parm_default != NULL_TREE) | |
3114 | /* Update the previous template parameters (which are the ones | |
3115 | that will really count) with the new default value. */ | |
3116 | TREE_PURPOSE (TREE_VEC_ELT (tmpl_parms, i)) = parm_default; | |
7ce74c5e MM |
3117 | else if (tmpl_default != NULL_TREE) |
3118 | /* Update the new parameters, too; they'll be used as the | |
3119 | parameters for any members. */ | |
3120 | TREE_PURPOSE (TREE_VEC_ELT (parms, i)) = tmpl_default; | |
7fe6899f MM |
3121 | } |
3122 | } | |
75650646 | 3123 | |
9baa27a9 MM |
3124 | /* Simplify EXPR if it is a non-dependent expression. Returns the |
3125 | (possibly simplified) expression. */ | |
3126 | ||
3127 | tree | |
3128 | fold_non_dependent_expr (tree expr) | |
3129 | { | |
3130 | /* If we're in a template, but EXPR isn't value dependent, simplify | |
3131 | it. We're supposed to treat: | |
3132 | ||
3133 | template <typename T> void f(T[1 + 1]); | |
3134 | template <typename T> void f(T[2]); | |
3135 | ||
3136 | as two declarations of the same function, for example. */ | |
3137 | if (processing_template_decl | |
3138 | && !type_dependent_expression_p (expr) | |
3139 | && !value_dependent_expression_p (expr)) | |
3140 | { | |
3141 | HOST_WIDE_INT saved_processing_template_decl; | |
3142 | ||
3143 | saved_processing_template_decl = processing_template_decl; | |
3144 | processing_template_decl = 0; | |
3145 | expr = tsubst_copy_and_build (expr, | |
3146 | /*args=*/NULL_TREE, | |
3147 | tf_error, | |
3148 | /*in_decl=*/NULL_TREE, | |
3149 | /*function_p=*/false); | |
3150 | processing_template_decl = saved_processing_template_decl; | |
3151 | } | |
3152 | return expr; | |
3153 | } | |
3154 | ||
75650646 MM |
3155 | /* Attempt to convert the non-type template parameter EXPR to the |
3156 | indicated TYPE. If the conversion is successful, return the | |
dc957d14 | 3157 | converted value. If the conversion is unsuccessful, return |
75650646 MM |
3158 | NULL_TREE if we issued an error message, or error_mark_node if we |
3159 | did not. We issue error messages for out-and-out bad template | |
3160 | parameters, but not simply because the conversion failed, since we | |
9baa27a9 MM |
3161 | might be just trying to do argument deduction. Both TYPE and EXPR |
3162 | must be non-dependent. */ | |
75650646 MM |
3163 | |
3164 | static tree | |
3a978d72 | 3165 | convert_nontype_argument (tree type, tree expr) |
75650646 | 3166 | { |
9baa27a9 MM |
3167 | tree expr_type; |
3168 | ||
3169 | /* If we are in a template, EXPR may be non-dependent, but still | |
3170 | have a syntactic, rather than semantic, form. For example, EXPR | |
3171 | might be a SCOPE_REF, rather than the VAR_DECL to which the | |
3172 | SCOPE_REF refers. Preserving the qualifying scope is necessary | |
3173 | so that access checking can be performed when the template is | |
3174 | instantiated -- but here we need the resolved form so that we can | |
3175 | convert the argument. */ | |
3176 | expr = fold_non_dependent_expr (expr); | |
3177 | expr_type = TREE_TYPE (expr); | |
75650646 MM |
3178 | |
3179 | /* A template-argument for a non-type, non-template | |
3180 | template-parameter shall be one of: | |
3181 | ||
3182 | --an integral constant-expression of integral or enumeration | |
3183 | type; or | |
3184 | ||
3185 | --the name of a non-type template-parameter; or | |
3186 | ||
3187 | --the name of an object or function with external linkage, | |
3188 | including function templates and function template-ids but | |
86052cc3 | 3189 | excluding non-static class members, expressed as id-expression; |
75650646 MM |
3190 | or |
3191 | ||
3192 | --the address of an object or function with external linkage, | |
3193 | including function templates and function template-ids but | |
3194 | excluding non-static class members, expressed as & id-expression | |
3195 | where the & is optional if the name refers to a function or | |
3196 | array; or | |
3197 | ||
3198 | --a pointer to member expressed as described in _expr.unary.op_. */ | |
3199 | ||
638dd8fc | 3200 | /* An integral constant-expression can include const variables or |
9baa27a9 | 3201 | . enumerators. Simplify things by folding them to their values, |
638dd8fc MM |
3202 | unless we're about to bind the declaration to a reference |
3203 | parameter. */ | |
9baa27a9 MM |
3204 | if (INTEGRAL_TYPE_P (expr_type) && TREE_CODE (type) != REFERENCE_TYPE) |
3205 | while (true) | |
3206 | { | |
3207 | tree const_expr = decl_constant_value (expr); | |
3208 | /* In a template, the initializer for a VAR_DECL may not be | |
3209 | marked as TREE_CONSTANT, in which case decl_constant_value | |
3210 | will not return the initializer. Handle that special case | |
3211 | here. */ | |
3212 | if (expr == const_expr | |
3213 | && TREE_CODE (expr) == VAR_DECL | |
3214 | && DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (expr) | |
3215 | && CP_TYPE_CONST_NON_VOLATILE_P (TREE_TYPE (expr)) | |
3216 | /* DECL_INITIAL can be NULL if we are processing a | |
3217 | variable initialized to an expression involving itself. | |
3218 | We know it is initialized to a constant -- but not what | |
3219 | constant, yet. */ | |
3220 | && DECL_INITIAL (expr)) | |
3221 | const_expr = DECL_INITIAL (expr); | |
3222 | if (expr == const_expr) | |
3223 | break; | |
3224 | expr = fold_non_dependent_expr (const_expr); | |
3225 | } | |
86052cc3 | 3226 | |
7bf2682f MM |
3227 | if (is_overloaded_fn (expr)) |
3228 | /* OK for now. We'll check that it has external linkage later. | |
3229 | Check this first since if expr_type is the unknown_type_node | |
3230 | we would otherwise complain below. */ | |
3231 | ; | |
a5ac359a | 3232 | else if (TYPE_PTR_TO_MEMBER_P (expr_type)) |
e08a8f45 MM |
3233 | { |
3234 | if (TREE_CODE (expr) != PTRMEM_CST) | |
3235 | goto bad_argument; | |
3236 | } | |
f3400fe2 JM |
3237 | else if (TYPE_PTR_P (expr_type) |
3238 | || TREE_CODE (expr_type) == ARRAY_TYPE | |
3239 | || TREE_CODE (type) == REFERENCE_TYPE | |
75650646 MM |
3240 | /* If expr is the address of an overloaded function, we |
3241 | will get the unknown_type_node at this point. */ | |
3242 | || expr_type == unknown_type_node) | |
3243 | { | |
3244 | tree referent; | |
49bf0d6f MM |
3245 | tree e = expr; |
3246 | STRIP_NOPS (e); | |
75650646 | 3247 | |
0dc09a61 MM |
3248 | if (TREE_CODE (expr_type) == ARRAY_TYPE |
3249 | || (TREE_CODE (type) == REFERENCE_TYPE | |
3250 | && TREE_CODE (e) != ADDR_EXPR)) | |
f3400fe2 JM |
3251 | referent = e; |
3252 | else | |
75650646 | 3253 | { |
f3400fe2 JM |
3254 | if (TREE_CODE (e) != ADDR_EXPR) |
3255 | { | |
3256 | bad_argument: | |
33bd39a2 | 3257 | error ("`%E' is not a valid template argument", expr); |
e08a8f45 MM |
3258 | if (TYPE_PTR_P (expr_type)) |
3259 | { | |
3260 | if (TREE_CODE (TREE_TYPE (expr_type)) == FUNCTION_TYPE) | |
33bd39a2 | 3261 | error ("it must be the address of a function with external linkage"); |
e08a8f45 | 3262 | else |
33bd39a2 | 3263 | error ("it must be the address of an object with external linkage"); |
e08a8f45 | 3264 | } |
a5ac359a | 3265 | else if (TYPE_PTR_TO_MEMBER_P (expr_type)) |
33bd39a2 | 3266 | error ("it must be a pointer-to-member of the form `&X::Y'"); |
e08a8f45 | 3267 | |
f3400fe2 JM |
3268 | return NULL_TREE; |
3269 | } | |
3270 | ||
3271 | referent = TREE_OPERAND (e, 0); | |
3272 | STRIP_NOPS (referent); | |
75650646 MM |
3273 | } |
3274 | ||
75650646 MM |
3275 | if (TREE_CODE (referent) == STRING_CST) |
3276 | { | |
33bd39a2 | 3277 | error ("string literal %E is not a valid template argument because it is the address of an object with static linkage", |
75650646 | 3278 | referent); |
75650646 MM |
3279 | return NULL_TREE; |
3280 | } | |
3281 | ||
279b8466 MM |
3282 | if (TREE_CODE (referent) == SCOPE_REF) |
3283 | referent = TREE_OPERAND (referent, 1); | |
3284 | ||
75650646 MM |
3285 | if (is_overloaded_fn (referent)) |
3286 | /* We'll check that it has external linkage later. */ | |
3287 | ; | |
3288 | else if (TREE_CODE (referent) != VAR_DECL) | |
3289 | goto bad_argument; | |
ad50e811 | 3290 | else if (!DECL_EXTERNAL_LINKAGE_P (referent)) |
75650646 | 3291 | { |
33bd39a2 | 3292 | error ("address of non-extern `%E' cannot be used as template argument", referent); |
75650646 MM |
3293 | return error_mark_node; |
3294 | } | |
3295 | } | |
a5ac359a | 3296 | else if (INTEGRAL_TYPE_P (expr_type) || TYPE_PTR_TO_MEMBER_P (expr_type)) |
75650646 | 3297 | { |
f3400fe2 JM |
3298 | if (! TREE_CONSTANT (expr)) |
3299 | { | |
3300 | non_constant: | |
33bd39a2 | 3301 | error ("non-constant `%E' cannot be used as template argument", |
f3400fe2 JM |
3302 | expr); |
3303 | return NULL_TREE; | |
3304 | } | |
75650646 | 3305 | } |
75650646 MM |
3306 | else |
3307 | { | |
c61dce3a GDR |
3308 | if (TYPE_P (expr)) |
3309 | error ("type '%T' cannot be used as a value for a non-type " | |
3310 | "template-parameter", expr); | |
3311 | else if (DECL_P (expr)) | |
3312 | error ("invalid use of '%D' as a non-type template-argument", expr); | |
3313 | else | |
3314 | error ("invalid use of '%E' as a non-type template-argument", expr); | |
3315 | ||
75650646 MM |
3316 | return NULL_TREE; |
3317 | } | |
3318 | ||
3319 | switch (TREE_CODE (type)) | |
3320 | { | |
3321 | case INTEGER_TYPE: | |
3322 | case BOOLEAN_TYPE: | |
3323 | case ENUMERAL_TYPE: | |
3324 | /* For a non-type template-parameter of integral or enumeration | |
3325 | type, integral promotions (_conv.prom_) and integral | |
c6002625 | 3326 | conversions (_conv.integral_) are applied. */ |
75650646 MM |
3327 | if (!INTEGRAL_TYPE_P (expr_type)) |
3328 | return error_mark_node; | |
3329 | ||
3330 | /* It's safe to call digest_init in this case; we know we're | |
3331 | just converting one integral constant expression to another. */ | |
db02b6b9 | 3332 | expr = digest_init (type, expr, (tree*) 0); |
75650646 | 3333 | |
db02b6b9 | 3334 | if (TREE_CODE (expr) != INTEGER_CST) |
f3400fe2 | 3335 | /* Curiously, some TREE_CONSTANT integral expressions do not |
db02b6b9 MM |
3336 | simplify to integer constants. For example, `3 % 0', |
3337 | remains a TRUNC_MOD_EXPR. */ | |
3338 | goto non_constant; | |
3339 | ||
3340 | return expr; | |
a5ac359a MM |
3341 | |
3342 | case OFFSET_TYPE: | |
3343 | { | |
3344 | tree e; | |
3345 | ||
3346 | /* For a non-type template-parameter of type pointer to data | |
3347 | member, qualification conversions (_conv.qual_) are | |
3348 | applied. */ | |
3349 | e = perform_qualification_conversions (type, expr); | |
3350 | if (TREE_CODE (e) == NOP_EXPR) | |
3351 | /* The call to perform_qualification_conversions will | |
3352 | insert a NOP_EXPR over EXPR to do express conversion, | |
3353 | if necessary. But, that will confuse us if we use | |
3354 | this (converted) template parameter to instantiate | |
3355 | another template; then the thing will not look like a | |
3356 | valid template argument. So, just make a new | |
3357 | constant, of the appropriate type. */ | |
3358 | e = make_ptrmem_cst (type, PTRMEM_CST_MEMBER (expr)); | |
3359 | return e; | |
3360 | } | |
3361 | ||
75650646 MM |
3362 | case POINTER_TYPE: |
3363 | { | |
3364 | tree type_pointed_to = TREE_TYPE (type); | |
3365 | ||
a5ac359a | 3366 | if (TREE_CODE (type_pointed_to) == FUNCTION_TYPE) |
75650646 MM |
3367 | { |
3368 | /* For a non-type template-parameter of type pointer to | |
3369 | function, only the function-to-pointer conversion | |
3370 | (_conv.func_) is applied. If the template-argument | |
3371 | represents a set of overloaded functions (or a pointer to | |
3372 | such), the matching function is selected from the set | |
3373 | (_over.over_). */ | |
3374 | tree fns; | |
3375 | tree fn; | |
3376 | ||
7bf2682f | 3377 | if (TREE_CODE (expr) == ADDR_EXPR) |
75650646 MM |
3378 | fns = TREE_OPERAND (expr, 0); |
3379 | else | |
3380 | fns = expr; | |
3381 | ||
c2ea3a40 | 3382 | fn = instantiate_type (type_pointed_to, fns, tf_none); |
75650646 MM |
3383 | |
3384 | if (fn == error_mark_node) | |
3385 | return error_mark_node; | |
3386 | ||
ad50e811 | 3387 | if (!DECL_EXTERNAL_LINKAGE_P (fn)) |
75650646 MM |
3388 | { |
3389 | if (really_overloaded_fn (fns)) | |
3390 | return error_mark_node; | |
3391 | else | |
3392 | goto bad_argument; | |
3393 | } | |
3394 | ||
3395 | expr = build_unary_op (ADDR_EXPR, fn, 0); | |
3396 | ||
3bfdc719 | 3397 | my_friendly_assert (same_type_p (type, TREE_TYPE (expr)), |
75650646 MM |
3398 | 0); |
3399 | return expr; | |
3400 | } | |
3401 | else | |
3402 | { | |
3403 | /* For a non-type template-parameter of type pointer to | |
3404 | object, qualification conversions (_conv.qual_) and the | |
3405 | array-to-pointer conversion (_conv.array_) are applied. | |
3406 | [Note: In particular, neither the null pointer conversion | |
3407 | (_conv.ptr_) nor the derived-to-base conversion | |
3408 | (_conv.ptr_) are applied. Although 0 is a valid | |
3409 | template-argument for a non-type template-parameter of | |
3410 | integral type, it is not a valid template-argument for a | |
e1467ff2 MM |
3411 | non-type template-parameter of pointer type.] |
3412 | ||
3413 | The call to decay_conversion performs the | |
3414 | array-to-pointer conversion, if appropriate. */ | |
3415 | expr = decay_conversion (expr); | |
75650646 MM |
3416 | |
3417 | if (expr == error_mark_node) | |
3418 | return error_mark_node; | |
3419 | else | |
3420 | return perform_qualification_conversions (type, expr); | |
3421 | } | |
3422 | } | |
3423 | break; | |
3424 | ||
3425 | case REFERENCE_TYPE: | |
3426 | { | |
3427 | tree type_referred_to = TREE_TYPE (type); | |
3428 | ||
0dc09a61 | 3429 | /* If this expression already has reference type, get the |
3281be05 | 3430 | underlying object. */ |
0dc09a61 MM |
3431 | if (TREE_CODE (expr_type) == REFERENCE_TYPE) |
3432 | { | |
3281be05 MM |
3433 | if (TREE_CODE (expr) == NOP_EXPR |
3434 | && TREE_CODE (TREE_OPERAND (expr, 0)) == ADDR_EXPR) | |
3435 | STRIP_NOPS (expr); | |
0dc09a61 MM |
3436 | my_friendly_assert (TREE_CODE (expr) == ADDR_EXPR, 20000604); |
3437 | expr = TREE_OPERAND (expr, 0); | |
3438 | expr_type = TREE_TYPE (expr); | |
3439 | } | |
3440 | ||
75650646 MM |
3441 | if (TREE_CODE (type_referred_to) == FUNCTION_TYPE) |
3442 | { | |
3443 | /* For a non-type template-parameter of type reference to | |
39c01e4c MM |
3444 | function, no conversions apply. If the |
3445 | template-argument represents a set of overloaded | |
3446 | functions, the matching function is selected from the | |
3447 | set (_over.over_). */ | |
75650646 MM |
3448 | tree fn; |
3449 | ||
c2ea3a40 | 3450 | fn = instantiate_type (type_referred_to, expr, tf_none); |
e6e174e5 JM |
3451 | |
3452 | if (fn == error_mark_node) | |
3453 | return error_mark_node; | |
75650646 | 3454 | |
ad50e811 | 3455 | if (!DECL_EXTERNAL_LINKAGE_P (fn)) |
75650646 | 3456 | { |
0dc09a61 | 3457 | if (really_overloaded_fn (expr)) |
75650646 MM |
3458 | /* Don't issue an error here; we might get a different |
3459 | function if the overloading had worked out | |
3460 | differently. */ | |
3461 | return error_mark_node; | |
3462 | else | |
3463 | goto bad_argument; | |
3464 | } | |
3465 | ||
3bfdc719 MM |
3466 | my_friendly_assert (same_type_p (type_referred_to, |
3467 | TREE_TYPE (fn)), | |
75650646 MM |
3468 | 0); |
3469 | ||
0dc09a61 | 3470 | expr = fn; |
75650646 MM |
3471 | } |
3472 | else | |
3473 | { | |
3474 | /* For a non-type template-parameter of type reference to | |
3475 | object, no conversions apply. The type referred to by the | |
3476 | reference may be more cv-qualified than the (otherwise | |
3477 | identical) type of the template-argument. The | |
3478 | template-parameter is bound directly to the | |
3479 | template-argument, which must be an lvalue. */ | |
0dc09a61 MM |
3480 | if (!same_type_p (TYPE_MAIN_VARIANT (expr_type), |
3481 | TYPE_MAIN_VARIANT (type_referred_to)) | |
91063b51 MM |
3482 | || !at_least_as_qualified_p (type_referred_to, |
3483 | expr_type) | |
75650646 | 3484 | || !real_lvalue_p (expr)) |
fd74ca0b | 3485 | return error_mark_node; |
75650646 | 3486 | } |
0dc09a61 | 3487 | |
dffd7eb6 | 3488 | cxx_mark_addressable (expr); |
3281be05 | 3489 | return build_nop (type, build_address (expr)); |
75650646 MM |
3490 | } |
3491 | break; | |
3492 | ||
3493 | case RECORD_TYPE: | |
3494 | { | |
db3f4e4e | 3495 | my_friendly_assert (TYPE_PTRMEMFUNC_P (type), 20010112); |
75650646 MM |
3496 | |
3497 | /* For a non-type template-parameter of type pointer to member | |
3498 | function, no conversions apply. If the template-argument | |
3499 | represents a set of overloaded member functions, the | |
3500 | matching member function is selected from the set | |
3501 | (_over.over_). */ | |
3502 | ||
3503 | if (!TYPE_PTRMEMFUNC_P (expr_type) && | |
3504 | expr_type != unknown_type_node) | |
3505 | return error_mark_node; | |
3506 | ||
e08a8f45 | 3507 | if (TREE_CODE (expr) == PTRMEM_CST) |
75650646 MM |
3508 | { |
3509 | /* A ptr-to-member constant. */ | |
3bfdc719 | 3510 | if (!same_type_p (type, expr_type)) |
75650646 MM |
3511 | return error_mark_node; |
3512 | else | |
3513 | return expr; | |
3514 | } | |
3515 | ||
3516 | if (TREE_CODE (expr) != ADDR_EXPR) | |
3517 | return error_mark_node; | |
3518 | ||
c2ea3a40 | 3519 | expr = instantiate_type (type, expr, tf_none); |
75650646 | 3520 | |
d8f8dca1 | 3521 | if (expr == error_mark_node) |
75650646 MM |
3522 | return error_mark_node; |
3523 | ||
59e7a901 GB |
3524 | if (!same_type_p (type, TREE_TYPE (expr))) |
3525 | return error_mark_node; | |
3526 | ||
75650646 MM |
3527 | return expr; |
3528 | } | |
3529 | break; | |
3530 | ||
3531 | default: | |
3532 | /* All non-type parameters must have one of these types. */ | |
a98facb0 | 3533 | abort (); |
75650646 MM |
3534 | break; |
3535 | } | |
3536 | ||
3537 | return error_mark_node; | |
3538 | } | |
3539 | ||
744fac59 KL |
3540 | /* Return 1 if PARM_PARMS and ARG_PARMS matches using rule for |
3541 | template template parameters. Both PARM_PARMS and ARG_PARMS are | |
3542 | vectors of TREE_LIST nodes containing TYPE_DECL, TEMPLATE_DECL | |
3543 | or PARM_DECL. | |
3544 | ||
3545 | ARG_PARMS may contain more parameters than PARM_PARMS. If this is | |
3546 | the case, then extra parameters must have default arguments. | |
3547 | ||
3548 | Consider the example: | |
3549 | template <class T, class Allocator = allocator> class vector; | |
3550 | template<template <class U> class TT> class C; | |
3551 | ||
3552 | C<vector> is a valid instantiation. PARM_PARMS for the above code | |
3553 | contains a TYPE_DECL (for U), ARG_PARMS contains two TYPE_DECLs (for | |
3554 | T and Allocator) and OUTER_ARGS contains the argument that is used to | |
3555 | substitute the TT parameter. */ | |
3556 | ||
3557 | static int | |
3a978d72 NN |
3558 | coerce_template_template_parms (tree parm_parms, |
3559 | tree arg_parms, | |
3560 | tsubst_flags_t complain, | |
3561 | tree in_decl, | |
3562 | tree outer_args) | |
744fac59 KL |
3563 | { |
3564 | int nparms, nargs, i; | |
3565 | tree parm, arg; | |
3566 | ||
3567 | my_friendly_assert (TREE_CODE (parm_parms) == TREE_VEC, 0); | |
3568 | my_friendly_assert (TREE_CODE (arg_parms) == TREE_VEC, 0); | |
3569 | ||
3570 | nparms = TREE_VEC_LENGTH (parm_parms); | |
3571 | nargs = TREE_VEC_LENGTH (arg_parms); | |
3572 | ||
3573 | /* The rule here is opposite of coerce_template_parms. */ | |
3574 | if (nargs < nparms | |
3575 | || (nargs > nparms | |
3576 | && TREE_PURPOSE (TREE_VEC_ELT (arg_parms, nparms)) == NULL_TREE)) | |
3577 | return 0; | |
3578 | ||
3579 | for (i = 0; i < nparms; ++i) | |
3580 | { | |
3581 | parm = TREE_VALUE (TREE_VEC_ELT (parm_parms, i)); | |
3582 | arg = TREE_VALUE (TREE_VEC_ELT (arg_parms, i)); | |
3583 | ||
3584 | if (arg == NULL_TREE || arg == error_mark_node | |
3585 | || parm == NULL_TREE || parm == error_mark_node) | |
3586 | return 0; | |
3587 | ||
3588 | if (TREE_CODE (arg) != TREE_CODE (parm)) | |
3589 | return 0; | |
3590 | ||
3591 | switch (TREE_CODE (parm)) | |
3592 | { | |
3593 | case TYPE_DECL: | |
3594 | break; | |
3595 | ||
3596 | case TEMPLATE_DECL: | |
3597 | /* We encounter instantiations of templates like | |
3598 | template <template <template <class> class> class TT> | |
3599 | class C; */ | |
700466c2 JM |
3600 | { |
3601 | tree parmparm = DECL_INNERMOST_TEMPLATE_PARMS (parm); | |
3602 | tree argparm = DECL_INNERMOST_TEMPLATE_PARMS (arg); | |
3603 | ||
8c6ab2db NS |
3604 | if (!coerce_template_template_parms |
3605 | (parmparm, argparm, complain, in_decl, outer_args)) | |
700466c2 JM |
3606 | return 0; |
3607 | } | |
3608 | break; | |
744fac59 KL |
3609 | |
3610 | case PARM_DECL: | |
3611 | /* The tsubst call is used to handle cases such as | |
3612 | template <class T, template <T> class TT> class D; | |
3613 | i.e. the parameter list of TT depends on earlier parameters. */ | |
8c6ab2db NS |
3614 | if (!same_type_p |
3615 | (tsubst (TREE_TYPE (parm), outer_args, complain, in_decl), | |
3616 | TREE_TYPE (arg))) | |
744fac59 KL |
3617 | return 0; |
3618 | break; | |
3619 | ||
3620 | default: | |
a98facb0 | 3621 | abort (); |
744fac59 KL |
3622 | } |
3623 | } | |
3624 | return 1; | |
3625 | } | |
3626 | ||
8b5b8b7c MM |
3627 | /* Convert the indicated template ARG as necessary to match the |
3628 | indicated template PARM. Returns the converted ARG, or | |
c2ea3a40 NS |
3629 | error_mark_node if the conversion was unsuccessful. Error and |
3630 | warning messages are issued under control of COMPLAIN. This | |
3631 | conversion is for the Ith parameter in the parameter list. ARGS is | |
3632 | the full set of template arguments deduced so far. */ | |
8b5b8b7c MM |
3633 | |
3634 | static tree | |
3a978d72 NN |
3635 | convert_template_argument (tree parm, |
3636 | tree arg, | |
3637 | tree args, | |
3638 | tsubst_flags_t complain, | |
3639 | int i, | |
3640 | tree in_decl) | |
8b5b8b7c MM |
3641 | { |
3642 | tree val; | |
3643 | tree inner_args; | |
3644 | int is_type, requires_type, is_tmpl_type, requires_tmpl_type; | |
3645 | ||
f9a7ae04 | 3646 | inner_args = INNERMOST_TEMPLATE_ARGS (args); |
8b5b8b7c MM |
3647 | |
3648 | if (TREE_CODE (arg) == TREE_LIST | |
a5ac359a | 3649 | && TREE_CODE (TREE_VALUE (arg)) == OFFSET_REF) |
8b5b8b7c MM |
3650 | { |
3651 | /* The template argument was the name of some | |
3652 | member function. That's usually | |
0e339752 | 3653 | invalid, but static members are OK. In any |
8b5b8b7c MM |
3654 | case, grab the underlying fields/functions |
3655 | and issue an error later if required. */ | |
3656 | arg = TREE_VALUE (arg); | |
3657 | TREE_TYPE (arg) = unknown_type_node; | |
3658 | } | |
3659 | ||
3660 | requires_tmpl_type = TREE_CODE (parm) == TEMPLATE_DECL; | |
3661 | requires_type = (TREE_CODE (parm) == TYPE_DECL | |
3662 | || requires_tmpl_type); | |
3663 | ||
cbd63935 KL |
3664 | is_tmpl_type = ((TREE_CODE (arg) == TEMPLATE_DECL |
3665 | && TREE_CODE (DECL_TEMPLATE_RESULT (arg)) == TYPE_DECL) | |
3666 | || TREE_CODE (arg) == TEMPLATE_TEMPLATE_PARM | |
3667 | || TREE_CODE (arg) == UNBOUND_CLASS_TEMPLATE); | |
303d1c55 | 3668 | |
b8c6534b KL |
3669 | if (is_tmpl_type |
3670 | && (TREE_CODE (arg) == TEMPLATE_TEMPLATE_PARM | |
3671 | || TREE_CODE (arg) == UNBOUND_CLASS_TEMPLATE)) | |
8b5b8b7c | 3672 | arg = TYPE_STUB_DECL (arg); |
8b5b8b7c | 3673 | |
2f939d94 | 3674 | is_type = TYPE_P (arg) || is_tmpl_type; |
8b5b8b7c MM |
3675 | |
3676 | if (requires_type && ! is_type && TREE_CODE (arg) == SCOPE_REF | |
3677 | && TREE_CODE (TREE_OPERAND (arg, 0)) == TEMPLATE_TYPE_PARM) | |
3678 | { | |
33bd39a2 | 3679 | pedwarn ("to refer to a type member of a template parameter, use `typename %E'", arg); |
8b5b8b7c MM |
3680 | |
3681 | arg = make_typename_type (TREE_OPERAND (arg, 0), | |
3baa501d | 3682 | TREE_OPERAND (arg, 1), |
c2ea3a40 | 3683 | complain & tf_error); |
8b5b8b7c MM |
3684 | is_type = 1; |
3685 | } | |
3686 | if (is_type != requires_type) | |
3687 | { | |
3688 | if (in_decl) | |
3689 | { | |
c2ea3a40 | 3690 | if (complain & tf_error) |
8b5b8b7c | 3691 | { |
33bd39a2 | 3692 | error ("type/value mismatch at argument %d in template parameter list for `%D'", |
8b5b8b7c MM |
3693 | i + 1, in_decl); |
3694 | if (is_type) | |
33bd39a2 | 3695 | error (" expected a constant of type `%T', got `%T'", |
8b5b8b7c MM |
3696 | TREE_TYPE (parm), |
3697 | (is_tmpl_type ? DECL_NAME (arg) : arg)); | |
d12a7283 KL |
3698 | else if (requires_tmpl_type) |
3699 | error (" expected a class template, got `%E'", arg); | |
8b5b8b7c | 3700 | else |
33bd39a2 | 3701 | error (" expected a type, got `%E'", arg); |
8b5b8b7c MM |
3702 | } |
3703 | } | |
3704 | return error_mark_node; | |
3705 | } | |
3706 | if (is_tmpl_type ^ requires_tmpl_type) | |
3707 | { | |
c2ea3a40 | 3708 | if (in_decl && (complain & tf_error)) |
8b5b8b7c | 3709 | { |
33bd39a2 | 3710 | error ("type/value mismatch at argument %d in template parameter list for `%D'", |
8b5b8b7c MM |
3711 | i + 1, in_decl); |
3712 | if (is_tmpl_type) | |
33bd39a2 | 3713 | error (" expected a type, got `%T'", DECL_NAME (arg)); |
8b5b8b7c | 3714 | else |
33bd39a2 | 3715 | error (" expected a class template, got `%T'", arg); |
8b5b8b7c MM |
3716 | } |
3717 | return error_mark_node; | |
3718 | } | |
3719 | ||
3720 | if (is_type) | |
3721 | { | |
3722 | if (requires_tmpl_type) | |
3723 | { | |
b8c6534b KL |
3724 | if (TREE_CODE (TREE_TYPE (arg)) == UNBOUND_CLASS_TEMPLATE) |
3725 | /* The number of argument required is not known yet. | |
3726 | Just accept it for now. */ | |
3727 | val = TREE_TYPE (arg); | |
8b5b8b7c MM |
3728 | else |
3729 | { | |
b8c6534b KL |
3730 | tree parmparm = DECL_INNERMOST_TEMPLATE_PARMS (parm); |
3731 | tree argparm = DECL_INNERMOST_TEMPLATE_PARMS (arg); | |
3732 | ||
3733 | if (coerce_template_template_parms (parmparm, argparm, | |
3734 | complain, in_decl, | |
3735 | inner_args)) | |
8b5b8b7c | 3736 | { |
b8c6534b KL |
3737 | val = arg; |
3738 | ||
3739 | /* TEMPLATE_TEMPLATE_PARM node is preferred over | |
3740 | TEMPLATE_DECL. */ | |
3741 | if (val != error_mark_node | |
3742 | && DECL_TEMPLATE_TEMPLATE_PARM_P (val)) | |
3743 | val = TREE_TYPE (val); | |
8b5b8b7c | 3744 | } |
b8c6534b KL |
3745 | else |
3746 | { | |
c2ea3a40 | 3747 | if (in_decl && (complain & tf_error)) |
b8c6534b | 3748 | { |
33bd39a2 | 3749 | error ("type/value mismatch at argument %d in template parameter list for `%D'", |
b8c6534b | 3750 | i + 1, in_decl); |
33bd39a2 | 3751 | error (" expected a template of type `%D', got `%D'", parm, arg); |
b8c6534b | 3752 | } |
8b5b8b7c | 3753 | |
b8c6534b KL |
3754 | val = error_mark_node; |
3755 | } | |
8b5b8b7c MM |
3756 | } |
3757 | } | |
3758 | else | |
3e4a3562 | 3759 | val = groktypename (arg); |
8b5b8b7c MM |
3760 | } |
3761 | else | |
3762 | { | |
4393e105 | 3763 | tree t = tsubst (TREE_TYPE (parm), args, complain, in_decl); |
8b5b8b7c | 3764 | |
11b810f1 | 3765 | if (invalid_nontype_parm_type_p (t, complain)) |
db3f4e4e NS |
3766 | return error_mark_node; |
3767 | ||
d768a589 | 3768 | if (!uses_template_parms (arg) && !uses_template_parms (t)) |
8b5b8b7c MM |
3769 | /* We used to call digest_init here. However, digest_init |
3770 | will report errors, which we don't want when complain | |
3771 | is zero. More importantly, digest_init will try too | |
3772 | hard to convert things: for example, `0' should not be | |
3773 | converted to pointer type at this point according to | |
3774 | the standard. Accepting this is not merely an | |
3775 | extension, since deciding whether or not these | |
3776 | conversions can occur is part of determining which | |
dc957d14 | 3777 | function template to call, or whether a given explicit |
0e339752 | 3778 | argument specification is valid. */ |
8b5b8b7c MM |
3779 | val = convert_nontype_argument (t, arg); |
3780 | else | |
3781 | val = arg; | |
3782 | ||
3783 | if (val == NULL_TREE) | |
3784 | val = error_mark_node; | |
c2ea3a40 | 3785 | else if (val == error_mark_node && (complain & tf_error)) |
33bd39a2 | 3786 | error ("could not convert template argument `%E' to `%T'", |
8b5b8b7c MM |
3787 | arg, t); |
3788 | } | |
3789 | ||
3790 | return val; | |
3791 | } | |
3792 | ||
3793 | /* Convert all template arguments to their appropriate types, and | |
3794 | return a vector containing the innermost resulting template | |
c2ea3a40 | 3795 | arguments. If any error occurs, return error_mark_node. Error and |
3e4a3562 | 3796 | warning messages are issued under control of COMPLAIN. |
75650646 | 3797 | |
838dfd8a | 3798 | If REQUIRE_ALL_ARGUMENTS is nonzero, all arguments must be |
75650646 MM |
3799 | provided in ARGLIST, or else trailing parameters must have default |
3800 | values. If REQUIRE_ALL_ARGUMENTS is zero, we will attempt argument | |
6dfbb909 | 3801 | deduction for any unspecified trailing arguments. */ |
de575009 | 3802 | |
8d08fdba | 3803 | static tree |
3a978d72 NN |
3804 | coerce_template_parms (tree parms, |
3805 | tree args, | |
3806 | tree in_decl, | |
3807 | tsubst_flags_t complain, | |
3808 | int require_all_arguments) | |
8d08fdba | 3809 | { |
a292b002 | 3810 | int nparms, nargs, i, lost = 0; |
e4a84209 | 3811 | tree inner_args; |
8b5b8b7c MM |
3812 | tree new_args; |
3813 | tree new_inner_args; | |
a292b002 | 3814 | |
f9a7ae04 | 3815 | inner_args = INNERMOST_TEMPLATE_ARGS (args); |
bf12d54d | 3816 | nargs = inner_args ? NUM_TMPL_ARGS (inner_args) : 0; |
a292b002 MS |
3817 | nparms = TREE_VEC_LENGTH (parms); |
3818 | ||
3819 | if (nargs > nparms | |
3820 | || (nargs < nparms | |
75650646 | 3821 | && require_all_arguments |
a292b002 | 3822 | && TREE_PURPOSE (TREE_VEC_ELT (parms, nargs)) == NULL_TREE)) |
8d08fdba | 3823 | { |
c2ea3a40 | 3824 | if (complain & tf_error) |
75650646 | 3825 | { |
33bd39a2 | 3826 | error ("wrong number of template arguments (%d, should be %d)", |
e4a84209 | 3827 | nargs, nparms); |
75650646 MM |
3828 | |
3829 | if (in_decl) | |
8251199e | 3830 | cp_error_at ("provided for `%D'", in_decl); |
75650646 MM |
3831 | } |
3832 | ||
8d08fdba MS |
3833 | return error_mark_node; |
3834 | } | |
3835 | ||
f31c0a32 | 3836 | new_inner_args = make_tree_vec (nparms); |
8b5b8b7c MM |
3837 | new_args = add_outermost_template_args (args, new_inner_args); |
3838 | for (i = 0; i < nparms; i++) | |
8d08fdba | 3839 | { |
8b5b8b7c MM |
3840 | tree arg; |
3841 | tree parm; | |
e4a84209 | 3842 | |
8b5b8b7c MM |
3843 | /* Get the Ith template parameter. */ |
3844 | parm = TREE_VEC_ELT (parms, i); | |
75650646 | 3845 | |
8b5b8b7c | 3846 | /* Calculate the Ith argument. */ |
bf12d54d | 3847 | if (i < nargs) |
8b5b8b7c | 3848 | arg = TREE_VEC_ELT (inner_args, i); |
ffd49b19 | 3849 | else if (require_all_arguments) |
04c06002 | 3850 | /* There must be a default arg in this case. */ |
a91db711 NS |
3851 | arg = tsubst_template_arg (TREE_PURPOSE (parm), new_args, |
3852 | complain, in_decl); | |
ffd49b19 NS |
3853 | else |
3854 | break; | |
3855 | ||
3856 | my_friendly_assert (arg, 20030727); | |
3857 | if (arg == error_mark_node) | |
3858 | error ("template argument %d is invalid", i + 1); | |
8b5b8b7c MM |
3859 | else |
3860 | arg = convert_template_argument (TREE_VALUE (parm), | |
3861 | arg, new_args, complain, i, | |
3862 | in_decl); | |
3863 | ||
3864 | if (arg == error_mark_node) | |
8d08fdba | 3865 | lost++; |
8b5b8b7c | 3866 | TREE_VEC_ELT (new_inner_args, i) = arg; |
8d08fdba | 3867 | } |
8b5b8b7c | 3868 | |
8d08fdba MS |
3869 | if (lost) |
3870 | return error_mark_node; | |
8b5b8b7c MM |
3871 | |
3872 | return new_inner_args; | |
8d08fdba MS |
3873 | } |
3874 | ||
34016c81 JM |
3875 | /* Returns 1 if template args OT and NT are equivalent. */ |
3876 | ||
d8e178a0 | 3877 | static int |
3a978d72 | 3878 | template_args_equal (tree ot, tree nt) |
34016c81 JM |
3879 | { |
3880 | if (nt == ot) | |
3881 | return 1; | |
74601d7c | 3882 | |
34016c81 JM |
3883 | if (TREE_CODE (nt) == TREE_VEC) |
3884 | /* For member templates */ | |
74601d7c KL |
3885 | return TREE_CODE (ot) == TREE_VEC && comp_template_args (ot, nt); |
3886 | else if (TYPE_P (nt)) | |
3887 | return TYPE_P (ot) && same_type_p (ot, nt); | |
3888 | else if (TREE_CODE (ot) == TREE_VEC || TYPE_P (ot)) | |
3889 | return 0; | |
34016c81 | 3890 | else |
c8a209ca | 3891 | return cp_tree_equal (ot, nt); |
34016c81 JM |
3892 | } |
3893 | ||
3894 | /* Returns 1 iff the OLDARGS and NEWARGS are in fact identical sets | |
f84b4be9 JM |
3895 | of template arguments. Returns 0 otherwise. */ |
3896 | ||
6757edfe | 3897 | int |
3a978d72 | 3898 | comp_template_args (tree oldargs, tree newargs) |
5566b478 MS |
3899 | { |
3900 | int i; | |
3901 | ||
386b8a85 JM |
3902 | if (TREE_VEC_LENGTH (oldargs) != TREE_VEC_LENGTH (newargs)) |
3903 | return 0; | |
3904 | ||
5566b478 MS |
3905 | for (i = 0; i < TREE_VEC_LENGTH (oldargs); ++i) |
3906 | { | |
3907 | tree nt = TREE_VEC_ELT (newargs, i); | |
3908 | tree ot = TREE_VEC_ELT (oldargs, i); | |
3909 | ||
34016c81 | 3910 | if (! template_args_equal (ot, nt)) |
61a127b3 | 3911 | return 0; |
5566b478 MS |
3912 | } |
3913 | return 1; | |
3914 | } | |
3915 | ||
8d08fdba MS |
3916 | /* Given class template name and parameter list, produce a user-friendly name |
3917 | for the instantiation. */ | |
e92cc029 | 3918 | |
8d08fdba | 3919 | static char * |
3a978d72 | 3920 | mangle_class_name_for_template (const char* name, tree parms, tree arglist) |
8d08fdba MS |
3921 | { |
3922 | static struct obstack scratch_obstack; | |
3923 | static char *scratch_firstobj; | |
3924 | int i, nparms; | |
8d08fdba MS |
3925 | |
3926 | if (!scratch_firstobj) | |
fc378698 | 3927 | gcc_obstack_init (&scratch_obstack); |
8d08fdba MS |
3928 | else |
3929 | obstack_free (&scratch_obstack, scratch_firstobj); | |
fc378698 | 3930 | scratch_firstobj = obstack_alloc (&scratch_obstack, 1); |
8d08fdba | 3931 | |
18e314ad GS |
3932 | #define ccat(C) obstack_1grow (&scratch_obstack, (C)); |
3933 | #define cat(S) obstack_grow (&scratch_obstack, (S), strlen (S)) | |
8d08fdba MS |
3934 | |
3935 | cat (name); | |
3936 | ccat ('<'); | |
3937 | nparms = TREE_VEC_LENGTH (parms); | |
f9a7ae04 | 3938 | arglist = INNERMOST_TEMPLATE_ARGS (arglist); |
8d08fdba MS |
3939 | my_friendly_assert (nparms == TREE_VEC_LENGTH (arglist), 268); |
3940 | for (i = 0; i < nparms; i++) | |
3941 | { | |
a292b002 MS |
3942 | tree parm = TREE_VALUE (TREE_VEC_ELT (parms, i)); |
3943 | tree arg = TREE_VEC_ELT (arglist, i); | |
8d08fdba MS |
3944 | |
3945 | if (i) | |
3946 | ccat (','); | |
3947 | ||
a292b002 | 3948 | if (TREE_CODE (parm) == TYPE_DECL) |
8d08fdba | 3949 | { |
761f0855 | 3950 | cat (type_as_string (arg, TFF_CHASE_TYPEDEF)); |
8d08fdba MS |
3951 | continue; |
3952 | } | |
73b0fce8 KL |
3953 | else if (TREE_CODE (parm) == TEMPLATE_DECL) |
3954 | { | |
3955 | if (TREE_CODE (arg) == TEMPLATE_DECL) | |
2c73f9f5 ML |
3956 | { |
3957 | /* Already substituted with real template. Just output | |
3958 | the template name here */ | |
cb0dbb9a | 3959 | tree context = DECL_CONTEXT (arg); |
ec4f972f AS |
3960 | if (context) |
3961 | { | |
3962 | /* The template may be defined in a namespace, or | |
3963 | may be a member template. */ | |
3964 | my_friendly_assert (TREE_CODE (context) == NAMESPACE_DECL | |
3965 | || CLASS_TYPE_P (context), | |
3966 | 980422); | |
761f0855 | 3967 | cat(decl_as_string (DECL_CONTEXT (arg), TFF_PLAIN_IDENTIFIER)); |
2c73f9f5 ML |
3968 | cat("::"); |
3969 | } | |
3970 | cat (IDENTIFIER_POINTER (DECL_NAME (arg))); | |
3971 | } | |
73b0fce8 | 3972 | else |
f4f206f4 | 3973 | /* Output the parameter declaration. */ |
761f0855 | 3974 | cat (type_as_string (arg, TFF_CHASE_TYPEDEF)); |
73b0fce8 KL |
3975 | continue; |
3976 | } | |
8d08fdba MS |
3977 | else |
3978 | my_friendly_assert (TREE_CODE (parm) == PARM_DECL, 269); | |
3979 | ||
8d08fdba MS |
3980 | /* No need to check arglist against parmlist here; we did that |
3981 | in coerce_template_parms, called from lookup_template_class. */ | |
761f0855 | 3982 | cat (expr_as_string (arg, TFF_PLAIN_IDENTIFIER)); |
8d08fdba MS |
3983 | } |
3984 | { | |
3985 | char *bufp = obstack_next_free (&scratch_obstack); | |
3986 | int offset = 0; | |
3987 | while (bufp[offset - 1] == ' ') | |
3988 | offset--; | |
3989 | obstack_blank_fast (&scratch_obstack, offset); | |
3990 | ||
3991 | /* B<C<char> >, not B<C<char>> */ | |
3992 | if (bufp[offset - 1] == '>') | |
3993 | ccat (' '); | |
3994 | } | |
3995 | ccat ('>'); | |
3996 | ccat ('\0'); | |
3997 | return (char *) obstack_base (&scratch_obstack); | |
8d08fdba MS |
3998 | } |
3999 | ||
bd6dd845 | 4000 | static tree |
3a978d72 | 4001 | classtype_mangled_name (tree t) |
5566b478 MS |
4002 | { |
4003 | if (CLASSTYPE_TEMPLATE_INFO (t) | |
36a117a5 MM |
4004 | /* Specializations have already had their names set up in |
4005 | lookup_template_class. */ | |
370af2d5 | 4006 | && !CLASSTYPE_TEMPLATE_SPECIALIZATION (t)) |
9fbf56f7 MM |
4007 | { |
4008 | tree tmpl = most_general_template (CLASSTYPE_TI_TEMPLATE (t)); | |
4009 | ||
36a117a5 MM |
4010 | /* For non-primary templates, the template parameters are |
4011 | implicit from their surrounding context. */ | |
9fbf56f7 MM |
4012 | if (PRIMARY_TEMPLATE_P (tmpl)) |
4013 | { | |
4014 | tree name = DECL_NAME (tmpl); | |
4015 | char *mangled_name = mangle_class_name_for_template | |
4016 | (IDENTIFIER_POINTER (name), | |
4017 | DECL_INNERMOST_TEMPLATE_PARMS (tmpl), | |
4018 | CLASSTYPE_TI_ARGS (t)); | |
4019 | tree id = get_identifier (mangled_name); | |
4020 | IDENTIFIER_TEMPLATE (id) = name; | |
4021 | return id; | |
4022 | } | |
5566b478 | 4023 | } |
9fbf56f7 MM |
4024 | |
4025 | return TYPE_IDENTIFIER (t); | |
5566b478 MS |
4026 | } |
4027 | ||
4028 | static void | |
3a978d72 | 4029 | add_pending_template (tree d) |
5566b478 | 4030 | { |
3ae18eaf JM |
4031 | tree ti = (TYPE_P (d) |
4032 | ? CLASSTYPE_TEMPLATE_INFO (d) | |
4033 | : DECL_TEMPLATE_INFO (d)); | |
46ccf50a | 4034 | tree pt; |
3ae18eaf | 4035 | int level; |
e92cc029 | 4036 | |
824b9a4c | 4037 | if (TI_PENDING_TEMPLATE_FLAG (ti)) |
5566b478 MS |
4038 | return; |
4039 | ||
3ae18eaf JM |
4040 | /* We are called both from instantiate_decl, where we've already had a |
4041 | tinst_level pushed, and instantiate_template, where we haven't. | |
4042 | Compensate. */ | |
4043 | level = !(current_tinst_level && TINST_DECL (current_tinst_level) == d); | |
4044 | ||
4045 | if (level) | |
4046 | push_tinst_level (d); | |
4047 | ||
46ccf50a JM |
4048 | pt = tree_cons (current_tinst_level, d, NULL_TREE); |
4049 | if (last_pending_template) | |
4050 | TREE_CHAIN (last_pending_template) = pt; | |
4051 | else | |
4052 | pending_templates = pt; | |
4053 | ||
4054 | last_pending_template = pt; | |
4055 | ||
824b9a4c | 4056 | TI_PENDING_TEMPLATE_FLAG (ti) = 1; |
3ae18eaf JM |
4057 | |
4058 | if (level) | |
4059 | pop_tinst_level (); | |
5566b478 MS |
4060 | } |
4061 | ||
386b8a85 | 4062 | |
4ba126e4 MM |
4063 | /* Return a TEMPLATE_ID_EXPR corresponding to the indicated FNS and |
4064 | ARGLIST. Valid choices for FNS are given in the cp-tree.def | |
4065 | documentation for TEMPLATE_ID_EXPR. */ | |
386b8a85 JM |
4066 | |
4067 | tree | |
3a978d72 | 4068 | lookup_template_function (tree fns, tree arglist) |
386b8a85 | 4069 | { |
2c73f9f5 | 4070 | tree type; |
050367a3 | 4071 | |
4ba126e4 MM |
4072 | if (fns == error_mark_node || arglist == error_mark_node) |
4073 | return error_mark_node; | |
4074 | ||
bf12d54d | 4075 | my_friendly_assert (!arglist || TREE_CODE (arglist) == TREE_VEC, 20030726); |
ceeae2d1 MM |
4076 | if (fns == NULL_TREE |
4077 | || TREE_CODE (fns) == FUNCTION_DECL) | |
386b8a85 | 4078 | { |
33bd39a2 | 4079 | error ("non-template used as template"); |
386b8a85 JM |
4080 | return error_mark_node; |
4081 | } | |
4082 | ||
4ba126e4 MM |
4083 | my_friendly_assert (TREE_CODE (fns) == TEMPLATE_DECL |
4084 | || TREE_CODE (fns) == OVERLOAD | |
50ad9642 | 4085 | || BASELINK_P (fns) |
10b1d5e7 | 4086 | || TREE_CODE (fns) == IDENTIFIER_NODE, |
4ba126e4 MM |
4087 | 20020730); |
4088 | ||
50ad9642 MM |
4089 | if (BASELINK_P (fns)) |
4090 | { | |
4091 | BASELINK_FUNCTIONS (fns) = build (TEMPLATE_ID_EXPR, | |
4092 | unknown_type_node, | |
4093 | BASELINK_FUNCTIONS (fns), | |
4094 | arglist); | |
4095 | return fns; | |
4096 | } | |
4097 | ||
2c73f9f5 ML |
4098 | type = TREE_TYPE (fns); |
4099 | if (TREE_CODE (fns) == OVERLOAD || !type) | |
4100 | type = unknown_type_node; | |
4ba126e4 MM |
4101 | |
4102 | return build (TEMPLATE_ID_EXPR, type, fns, arglist); | |
386b8a85 JM |
4103 | } |
4104 | ||
a2b60a0e MM |
4105 | /* Within the scope of a template class S<T>, the name S gets bound |
4106 | (in build_self_reference) to a TYPE_DECL for the class, not a | |
4107 | TEMPLATE_DECL. If DECL is a TYPE_DECL for current_class_type, | |
4108 | or one of its enclosing classes, and that type is a template, | |
4109 | return the associated TEMPLATE_DECL. Otherwise, the original | |
4110 | DECL is returned. */ | |
4111 | ||
a723baf1 | 4112 | tree |
3a978d72 | 4113 | maybe_get_template_decl_from_type_decl (tree decl) |
a2b60a0e MM |
4114 | { |
4115 | return (decl != NULL_TREE | |
4116 | && TREE_CODE (decl) == TYPE_DECL | |
4117 | && DECL_ARTIFICIAL (decl) | |
511b60ff | 4118 | && CLASS_TYPE_P (TREE_TYPE (decl)) |
a2b60a0e MM |
4119 | && CLASSTYPE_TEMPLATE_INFO (TREE_TYPE (decl))) |
4120 | ? CLASSTYPE_TI_TEMPLATE (TREE_TYPE (decl)) : decl; | |
4121 | } | |
386b8a85 | 4122 | |
8d08fdba MS |
4123 | /* Given an IDENTIFIER_NODE (type TEMPLATE_DECL) and a chain of |
4124 | parameters, find the desired type. | |
4125 | ||
4126 | D1 is the PTYPENAME terminal, and ARGLIST is the list of arguments. | |
8d08fdba MS |
4127 | |
4128 | IN_DECL, if non-NULL, is the template declaration we are trying to | |
75650646 MM |
4129 | instantiate. |
4130 | ||
838dfd8a | 4131 | If ENTERING_SCOPE is nonzero, we are about to enter the scope of |
36a117a5 | 4132 | the class we are looking up. |
f9c244b8 | 4133 | |
c2ea3a40 | 4134 | Issue error and warning messages under control of COMPLAIN. |
36a117a5 | 4135 | |
75650646 MM |
4136 | If the template class is really a local class in a template |
4137 | function, then the FUNCTION_CONTEXT is the function in which it is | |
4138 | being instantiated. */ | |
e92cc029 | 4139 | |
8d08fdba | 4140 | tree |
3a978d72 NN |
4141 | lookup_template_class (tree d1, |
4142 | tree arglist, | |
4143 | tree in_decl, | |
4144 | tree context, | |
4145 | int entering_scope, | |
4146 | tsubst_flags_t complain) | |
8d08fdba | 4147 | { |
a703fb38 | 4148 | tree template = NULL_TREE, parmlist; |
dbfe2124 | 4149 | tree t; |
42eaed49 | 4150 | |
fd295cb2 | 4151 | timevar_push (TV_NAME_LOOKUP); |
42eaed49 | 4152 | |
5566b478 MS |
4153 | if (TREE_CODE (d1) == IDENTIFIER_NODE) |
4154 | { | |
f181d4ae MM |
4155 | if (IDENTIFIER_VALUE (d1) |
4156 | && DECL_TEMPLATE_TEMPLATE_PARM_P (IDENTIFIER_VALUE (d1))) | |
4157 | template = IDENTIFIER_VALUE (d1); | |
73b0fce8 KL |
4158 | else |
4159 | { | |
2c73f9f5 ML |
4160 | if (context) |
4161 | push_decl_namespace (context); | |
3ebc5c52 MM |
4162 | template = lookup_name (d1, /*prefer_type=*/0); |
4163 | template = maybe_get_template_decl_from_type_decl (template); | |
2c73f9f5 ML |
4164 | if (context) |
4165 | pop_decl_namespace (); | |
73b0fce8 | 4166 | } |
8d019cef JM |
4167 | if (template) |
4168 | context = DECL_CONTEXT (template); | |
5566b478 | 4169 | } |
c91a56d2 MS |
4170 | else if (TREE_CODE (d1) == TYPE_DECL && IS_AGGR_TYPE (TREE_TYPE (d1))) |
4171 | { | |
802dbc34 JM |
4172 | tree type = TREE_TYPE (d1); |
4173 | ||
4174 | /* If we are declaring a constructor, say A<T>::A<T>, we will get | |
4175 | an implicit typename for the second A. Deal with it. */ | |
4176 | if (TREE_CODE (type) == TYPENAME_TYPE && TREE_TYPE (type)) | |
4177 | type = TREE_TYPE (type); | |
4178 | ||
4179 | if (CLASSTYPE_TEMPLATE_INFO (type)) | |
f3400fe2 | 4180 | { |
802dbc34 | 4181 | template = CLASSTYPE_TI_TEMPLATE (type); |
f3400fe2 JM |
4182 | d1 = DECL_NAME (template); |
4183 | } | |
c91a56d2 | 4184 | } |
ed44da02 | 4185 | else if (TREE_CODE (d1) == ENUMERAL_TYPE |
2f939d94 | 4186 | || (TYPE_P (d1) && IS_AGGR_TYPE (d1))) |
5566b478 | 4187 | { |
ed44da02 | 4188 | template = TYPE_TI_TEMPLATE (d1); |
5566b478 MS |
4189 | d1 = DECL_NAME (template); |
4190 | } | |
93cdc044 | 4191 | else if (TREE_CODE (d1) == TEMPLATE_DECL |
17aec3eb | 4192 | && TREE_CODE (DECL_TEMPLATE_RESULT (d1)) == TYPE_DECL) |
93cdc044 JM |
4193 | { |
4194 | template = d1; | |
4195 | d1 = DECL_NAME (template); | |
4196 | context = DECL_CONTEXT (template); | |
4197 | } | |
8d08fdba | 4198 | |
8d08fdba | 4199 | /* With something like `template <class T> class X class X { ... };' |
f181d4ae MM |
4200 | we could end up with D1 having nothing but an IDENTIFIER_VALUE. |
4201 | We don't want to do that, but we have to deal with the situation, | |
4202 | so let's give them some syntax errors to chew on instead of a | |
1bc0793e | 4203 | crash. Alternatively D1 might not be a template type at all. */ |
8d08fdba | 4204 | if (! template) |
f3400fe2 | 4205 | { |
c2ea3a40 | 4206 | if (complain & tf_error) |
33bd39a2 | 4207 | error ("`%T' is not a template", d1); |
fd295cb2 | 4208 | POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, error_mark_node); |
f3400fe2 | 4209 | } |
2c73f9f5 | 4210 | |
a87b4257 | 4211 | if (TREE_CODE (template) != TEMPLATE_DECL |
42eaed49 NS |
4212 | /* Make sure it's a user visible template, if it was named by |
4213 | the user. */ | |
4214 | || ((complain & tf_user) && !DECL_TEMPLATE_PARM_P (template) | |
4215 | && !PRIMARY_TEMPLATE_P (template))) | |
8d08fdba | 4216 | { |
c2ea3a40 | 4217 | if (complain & tf_error) |
f9c244b8 | 4218 | { |
33bd39a2 | 4219 | error ("non-template type `%T' used as a template", d1); |
f9c244b8 NS |
4220 | if (in_decl) |
4221 | cp_error_at ("for template declaration `%D'", in_decl); | |
4222 | } | |
fd295cb2 | 4223 | POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, error_mark_node); |
8d08fdba | 4224 | } |
8d08fdba | 4225 | |
42eaed49 NS |
4226 | complain &= ~tf_user; |
4227 | ||
73b0fce8 KL |
4228 | if (DECL_TEMPLATE_TEMPLATE_PARM_P (template)) |
4229 | { | |
4230 | /* Create a new TEMPLATE_DECL and TEMPLATE_TEMPLATE_PARM node to store | |
4231 | template arguments */ | |
4232 | ||
1899c3a4 | 4233 | tree parm; |
73b0fce8 KL |
4234 | tree arglist2; |
4235 | ||
73b0fce8 KL |
4236 | parmlist = DECL_INNERMOST_TEMPLATE_PARMS (template); |
4237 | ||
4f96ff63 KL |
4238 | /* Consider an example where a template template parameter declared as |
4239 | ||
4240 | template <class T, class U = std::allocator<T> > class TT | |
4241 | ||
4242 | The template parameter level of T and U are one level larger than | |
4243 | of TT. To proper process the default argument of U, say when an | |
4244 | instantiation `TT<int>' is seen, we need to build the full | |
342cea95 KL |
4245 | arguments containing {int} as the innermost level. Outer levels, |
4246 | available when not appearing as default template argument, can be | |
4247 | obtained from `current_template_args ()'. | |
4f96ff63 | 4248 | |
342cea95 KL |
4249 | Suppose that TT is later substituted with std::vector. The above |
4250 | instantiation is `TT<int, std::allocator<T> >' with TT at | |
4251 | level 1, and T at level 2, while the template arguments at level 1 | |
4252 | becomes {std::vector} and the inner level 2 is {int}. */ | |
4253 | ||
4254 | if (current_template_parms) | |
4f96ff63 KL |
4255 | arglist = add_to_template_args (current_template_args (), arglist); |
4256 | ||
f9c244b8 NS |
4257 | arglist2 = coerce_template_parms (parmlist, arglist, template, |
4258 | complain, /*require_all_args=*/1); | |
3e4a3562 | 4259 | if (arglist2 == error_mark_node |
544aef8c | 4260 | || (!uses_template_parms (arglist2) |
3e4a3562 | 4261 | && check_instantiated_args (template, arglist2, complain))) |
fd295cb2 | 4262 | POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, error_mark_node); |
73b0fce8 | 4263 | |
dac65501 | 4264 | parm = bind_template_template_parm (TREE_TYPE (template), arglist2); |
fd295cb2 | 4265 | POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, parm); |
73b0fce8 | 4266 | } |
36a117a5 | 4267 | else |
8d08fdba | 4268 | { |
36a117a5 | 4269 | tree template_type = TREE_TYPE (template); |
7ac7b28f | 4270 | tree gen_tmpl; |
36a117a5 MM |
4271 | tree type_decl; |
4272 | tree found = NULL_TREE; | |
414ea4aa | 4273 | tree *tp; |
36a117a5 MM |
4274 | int arg_depth; |
4275 | int parm_depth; | |
dbfe2124 | 4276 | int is_partial_instantiation; |
830bfa74 | 4277 | |
7ac7b28f MM |
4278 | gen_tmpl = most_general_template (template); |
4279 | parmlist = DECL_TEMPLATE_PARMS (gen_tmpl); | |
36a117a5 MM |
4280 | parm_depth = TMPL_PARMS_DEPTH (parmlist); |
4281 | arg_depth = TMPL_ARGS_DEPTH (arglist); | |
4282 | ||
4283 | if (arg_depth == 1 && parm_depth > 1) | |
4284 | { | |
39c01e4c | 4285 | /* We've been given an incomplete set of template arguments. |
36a117a5 MM |
4286 | For example, given: |
4287 | ||
4288 | template <class T> struct S1 { | |
4289 | template <class U> struct S2 {}; | |
4290 | template <class U> struct S2<U*> {}; | |
4291 | }; | |
4292 | ||
4293 | we will be called with an ARGLIST of `U*', but the | |
4294 | TEMPLATE will be `template <class T> template | |
4295 | <class U> struct S1<T>::S2'. We must fill in the missing | |
4296 | arguments. */ | |
7ac7b28f MM |
4297 | arglist |
4298 | = add_outermost_template_args (TYPE_TI_ARGS (TREE_TYPE (template)), | |
4299 | arglist); | |
36a117a5 MM |
4300 | arg_depth = TMPL_ARGS_DEPTH (arglist); |
4301 | } | |
5566b478 | 4302 | |
41f5d4b1 | 4303 | /* Now we should have enough arguments. */ |
36a117a5 MM |
4304 | my_friendly_assert (parm_depth == arg_depth, 0); |
4305 | ||
7ac7b28f MM |
4306 | /* From here on, we're only interested in the most general |
4307 | template. */ | |
4308 | template = gen_tmpl; | |
4309 | ||
36a117a5 MM |
4310 | /* Calculate the BOUND_ARGS. These will be the args that are |
4311 | actually tsubst'd into the definition to create the | |
4312 | instantiation. */ | |
4313 | if (parm_depth > 1) | |
830bfa74 MM |
4314 | { |
4315 | /* We have multiple levels of arguments to coerce, at once. */ | |
830bfa74 | 4316 | int i; |
e4a84209 | 4317 | int saved_depth = TMPL_ARGS_DEPTH (arglist); |
36a117a5 | 4318 | |
f31c0a32 | 4319 | tree bound_args = make_tree_vec (parm_depth); |
830bfa74 | 4320 | |
e4a84209 | 4321 | for (i = saved_depth, |
830bfa74 | 4322 | t = DECL_TEMPLATE_PARMS (template); |
e4a84209 | 4323 | i > 0 && t != NULL_TREE; |
830bfa74 | 4324 | --i, t = TREE_CHAIN (t)) |
e4a84209 | 4325 | { |
ee3071ef NS |
4326 | tree a = coerce_template_parms (TREE_VALUE (t), |
4327 | arglist, template, | |
4328 | complain, /*require_all_args=*/1); | |
88e98cfe KL |
4329 | |
4330 | /* Don't process further if one of the levels fails. */ | |
4331 | if (a == error_mark_node) | |
4332 | { | |
4333 | /* Restore the ARGLIST to its full size. */ | |
4334 | TREE_VEC_LENGTH (arglist) = saved_depth; | |
4335 | POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, error_mark_node); | |
4336 | } | |
4337 | ||
e4a84209 MM |
4338 | SET_TMPL_ARGS_LEVEL (bound_args, i, a); |
4339 | ||
4340 | /* We temporarily reduce the length of the ARGLIST so | |
4341 | that coerce_template_parms will see only the arguments | |
4342 | corresponding to the template parameters it is | |
4343 | examining. */ | |
4344 | TREE_VEC_LENGTH (arglist)--; | |
4345 | } | |
4346 | ||
4347 | /* Restore the ARGLIST to its full size. */ | |
4348 | TREE_VEC_LENGTH (arglist) = saved_depth; | |
4349 | ||
36a117a5 | 4350 | arglist = bound_args; |
830bfa74 MM |
4351 | } |
4352 | else | |
36a117a5 MM |
4353 | arglist |
4354 | = coerce_template_parms (INNERMOST_TEMPLATE_PARMS (parmlist), | |
f9a7ae04 | 4355 | INNERMOST_TEMPLATE_ARGS (arglist), |
f9c244b8 NS |
4356 | template, |
4357 | complain, /*require_all_args=*/1); | |
36a117a5 | 4358 | |
c353b8e3 | 4359 | if (arglist == error_mark_node) |
36a117a5 | 4360 | /* We were unable to bind the arguments. */ |
fd295cb2 | 4361 | POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, error_mark_node); |
5566b478 | 4362 | |
36a117a5 MM |
4363 | /* In the scope of a template class, explicit references to the |
4364 | template class refer to the type of the template, not any | |
4365 | instantiation of it. For example, in: | |
4366 | ||
4367 | template <class T> class C { void f(C<T>); } | |
4368 | ||
4369 | the `C<T>' is just the same as `C'. Outside of the | |
4370 | class, however, such a reference is an instantiation. */ | |
ed44da02 | 4371 | if (comp_template_args (TYPE_TI_ARGS (template_type), |
36a117a5 MM |
4372 | arglist)) |
4373 | { | |
4374 | found = template_type; | |
4375 | ||
4376 | if (!entering_scope && PRIMARY_TEMPLATE_P (template)) | |
5566b478 | 4377 | { |
36a117a5 MM |
4378 | tree ctx; |
4379 | ||
36a117a5 | 4380 | for (ctx = current_class_type; |
5f04800c KL |
4381 | ctx && TREE_CODE (ctx) != NAMESPACE_DECL; |
4382 | ctx = (TYPE_P (ctx) | |
4383 | ? TYPE_CONTEXT (ctx) | |
4384 | : DECL_CONTEXT (ctx))) | |
4385 | if (TYPE_P (ctx) && same_type_p (ctx, template_type)) | |
4386 | goto found_ctx; | |
36a117a5 | 4387 | |
6df5158a NS |
4388 | /* We're not in the scope of the class, so the |
4389 | TEMPLATE_TYPE is not the type we want after all. */ | |
4390 | found = NULL_TREE; | |
4391 | found_ctx:; | |
5566b478 MS |
4392 | } |
4393 | } | |
36a117a5 | 4394 | if (found) |
fd295cb2 | 4395 | POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, found); |
414ea4aa MM |
4396 | |
4397 | for (tp = &DECL_TEMPLATE_INSTANTIATIONS (template); | |
4398 | *tp; | |
4399 | tp = &TREE_CHAIN (*tp)) | |
4400 | if (comp_template_args (TREE_PURPOSE (*tp), arglist)) | |
4401 | { | |
4402 | found = *tp; | |
7e7d9517 MM |
4403 | |
4404 | /* Use the move-to-front heuristic to speed up future | |
4405 | searches. */ | |
414ea4aa MM |
4406 | *tp = TREE_CHAIN (*tp); |
4407 | TREE_CHAIN (found) | |
4408 | = DECL_TEMPLATE_INSTANTIATIONS (template); | |
4409 | DECL_TEMPLATE_INSTANTIATIONS (template) = found; | |
7e7d9517 | 4410 | |
fd295cb2 | 4411 | POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, TREE_VALUE (found)); |
414ea4aa | 4412 | } |
5566b478 | 4413 | |
dbfe2124 | 4414 | /* This type is a "partial instantiation" if any of the template |
ab097535 | 4415 | arguments still involve template parameters. Note that we set |
486e4077 MM |
4416 | IS_PARTIAL_INSTANTIATION for partial specializations as |
4417 | well. */ | |
dbfe2124 MM |
4418 | is_partial_instantiation = uses_template_parms (arglist); |
4419 | ||
c353b8e3 MM |
4420 | /* If the deduced arguments are invalid, then the binding |
4421 | failed. */ | |
4422 | if (!is_partial_instantiation | |
4423 | && check_instantiated_args (template, | |
4424 | INNERMOST_TEMPLATE_ARGS (arglist), | |
4425 | complain)) | |
4426 | POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, error_mark_node); | |
4427 | ||
3ebc5c52 MM |
4428 | if (!is_partial_instantiation |
4429 | && !PRIMARY_TEMPLATE_P (template) | |
4430 | && TREE_CODE (CP_DECL_CONTEXT (template)) == NAMESPACE_DECL) | |
4431 | { | |
3ebc5c52 MM |
4432 | found = xref_tag_from_type (TREE_TYPE (template), |
4433 | DECL_NAME (template), | |
4434 | /*globalize=*/1); | |
fd295cb2 | 4435 | POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, found); |
3ebc5c52 | 4436 | } |
3ebc5c52 | 4437 | |
95ee998c | 4438 | context = tsubst (DECL_CONTEXT (template), arglist, |
c2ea3a40 | 4439 | complain, in_decl); |
95ee998c MM |
4440 | if (!context) |
4441 | context = global_namespace; | |
4442 | ||
36a117a5 | 4443 | /* Create the type. */ |
ed44da02 MM |
4444 | if (TREE_CODE (template_type) == ENUMERAL_TYPE) |
4445 | { | |
dbfe2124 | 4446 | if (!is_partial_instantiation) |
92777ce4 NS |
4447 | { |
4448 | set_current_access_from_decl (TYPE_NAME (template_type)); | |
4449 | t = start_enum (TYPE_IDENTIFIER (template_type)); | |
4450 | } | |
ed44da02 | 4451 | else |
dbfe2124 | 4452 | /* We don't want to call start_enum for this type, since |
ed44da02 MM |
4453 | the values for the enumeration constants may involve |
4454 | template parameters. And, no one should be interested | |
4455 | in the enumeration constants for such a type. */ | |
4456 | t = make_node (ENUMERAL_TYPE); | |
4457 | } | |
4458 | else | |
4459 | { | |
33848bb0 | 4460 | t = make_aggr_type (TREE_CODE (template_type)); |
ed44da02 MM |
4461 | CLASSTYPE_DECLARED_CLASS (t) |
4462 | = CLASSTYPE_DECLARED_CLASS (template_type); | |
ed44da02 | 4463 | SET_CLASSTYPE_IMPLICIT_INSTANTIATION (t); |
f668f160 | 4464 | TYPE_FOR_JAVA (t) = TYPE_FOR_JAVA (template_type); |
ae673f14 JM |
4465 | |
4466 | /* A local class. Make sure the decl gets registered properly. */ | |
4467 | if (context == current_function_decl) | |
4468 | pushtag (DECL_NAME (template), t, 0); | |
ed44da02 MM |
4469 | } |
4470 | ||
ae673f14 JM |
4471 | /* If we called start_enum or pushtag above, this information |
4472 | will already be set up. */ | |
ed44da02 MM |
4473 | if (!TYPE_NAME (t)) |
4474 | { | |
4475 | TYPE_CONTEXT (t) = FROB_CONTEXT (context); | |
36a117a5 | 4476 | |
9188c363 | 4477 | type_decl = create_implicit_typedef (DECL_NAME (template), t); |
ed44da02 | 4478 | DECL_CONTEXT (type_decl) = TYPE_CONTEXT (t); |
9188c363 | 4479 | TYPE_STUB_DECL (t) = type_decl; |
f31686a3 RH |
4480 | DECL_SOURCE_LOCATION (type_decl) |
4481 | = DECL_SOURCE_LOCATION (TYPE_STUB_DECL (template_type)); | |
ed44da02 MM |
4482 | } |
4483 | else | |
4484 | type_decl = TYPE_NAME (t); | |
36a117a5 | 4485 | |
cab7a9a3 KL |
4486 | TREE_PRIVATE (type_decl) |
4487 | = TREE_PRIVATE (TYPE_STUB_DECL (template_type)); | |
4488 | TREE_PROTECTED (type_decl) | |
4489 | = TREE_PROTECTED (TYPE_STUB_DECL (template_type)); | |
4490 | ||
9fbf56f7 MM |
4491 | /* Set up the template information. We have to figure out which |
4492 | template is the immediate parent if this is a full | |
4493 | instantiation. */ | |
4494 | if (parm_depth == 1 || is_partial_instantiation | |
4495 | || !PRIMARY_TEMPLATE_P (template)) | |
4496 | /* This case is easy; there are no member templates involved. */ | |
4497 | found = template; | |
4498 | else | |
4499 | { | |
ab097535 NS |
4500 | /* This is a full instantiation of a member template. Look |
4501 | for a partial instantiation of which this is an instance. */ | |
9fbf56f7 MM |
4502 | |
4503 | for (found = DECL_TEMPLATE_INSTANTIATIONS (template); | |
4504 | found; found = TREE_CHAIN (found)) | |
4505 | { | |
4506 | int success; | |
4507 | tree tmpl = CLASSTYPE_TI_TEMPLATE (TREE_VALUE (found)); | |
4508 | ||
4509 | /* We only want partial instantiations, here, not | |
4510 | specializations or full instantiations. */ | |
370af2d5 | 4511 | if (CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_VALUE (found)) |
9fbf56f7 MM |
4512 | || !uses_template_parms (TREE_VALUE (found))) |
4513 | continue; | |
4514 | ||
4515 | /* Temporarily reduce by one the number of levels in the | |
4516 | ARGLIST and in FOUND so as to avoid comparing the | |
4517 | last set of arguments. */ | |
4518 | TREE_VEC_LENGTH (arglist)--; | |
4519 | TREE_VEC_LENGTH (TREE_PURPOSE (found)) --; | |
4520 | ||
4521 | /* See if the arguments match. If they do, then TMPL is | |
4522 | the partial instantiation we want. */ | |
4523 | success = comp_template_args (TREE_PURPOSE (found), arglist); | |
4524 | ||
4525 | /* Restore the argument vectors to their full size. */ | |
4526 | TREE_VEC_LENGTH (arglist)++; | |
4527 | TREE_VEC_LENGTH (TREE_PURPOSE (found))++; | |
4528 | ||
4529 | if (success) | |
4530 | { | |
4531 | found = tmpl; | |
4532 | break; | |
4533 | } | |
4534 | } | |
4535 | ||
4536 | if (!found) | |
ab097535 NS |
4537 | { |
4538 | /* There was no partial instantiation. This happens | |
4539 | where C<T> is a member template of A<T> and it's used | |
4540 | in something like | |
4541 | ||
4542 | template <typename T> struct B { A<T>::C<int> m; }; | |
4543 | B<float>; | |
4544 | ||
4545 | Create the partial instantiation. | |
4546 | */ | |
4547 | TREE_VEC_LENGTH (arglist)--; | |
c2ea3a40 | 4548 | found = tsubst (template, arglist, complain, NULL_TREE); |
ab097535 | 4549 | TREE_VEC_LENGTH (arglist)++; |
ab097535 | 4550 | } |
9fbf56f7 MM |
4551 | } |
4552 | ||
ab097535 | 4553 | SET_TYPE_TEMPLATE_INFO (t, tree_cons (found, arglist, NULL_TREE)); |
dbfe2124 MM |
4554 | DECL_TEMPLATE_INSTANTIATIONS (template) |
4555 | = tree_cons (arglist, t, | |
4556 | DECL_TEMPLATE_INSTANTIATIONS (template)); | |
4557 | ||
4558 | if (TREE_CODE (t) == ENUMERAL_TYPE | |
4559 | && !is_partial_instantiation) | |
61a127b3 MM |
4560 | /* Now that the type has been registered on the instantiations |
4561 | list, we set up the enumerators. Because the enumeration | |
4562 | constants may involve the enumeration type itself, we make | |
4563 | sure to register the type first, and then create the | |
4564 | constants. That way, doing tsubst_expr for the enumeration | |
4565 | constants won't result in recursive calls here; we'll find | |
4566 | the instantiation and exit above. */ | |
4567 | tsubst_enum (template_type, t, arglist); | |
dbfe2124 | 4568 | |
36a117a5 MM |
4569 | /* Reset the name of the type, now that CLASSTYPE_TEMPLATE_INFO |
4570 | is set up. */ | |
ed44da02 MM |
4571 | if (TREE_CODE (t) != ENUMERAL_TYPE) |
4572 | DECL_NAME (type_decl) = classtype_mangled_name (t); | |
7813d14c | 4573 | if (is_partial_instantiation) |
077e7015 MM |
4574 | /* If the type makes use of template parameters, the |
4575 | code that generates debugging information will crash. */ | |
4576 | DECL_IGNORED_P (TYPE_STUB_DECL (t)) = 1; | |
8d08fdba | 4577 | |
fd295cb2 | 4578 | POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, t); |
36a117a5 | 4579 | } |
fd295cb2 | 4580 | timevar_pop (TV_NAME_LOOKUP); |
8d08fdba MS |
4581 | } |
4582 | \f | |
8dfaeb63 | 4583 | struct pair_fn_data |
8d08fdba | 4584 | { |
8dfaeb63 MM |
4585 | tree_fn_t fn; |
4586 | void *data; | |
4f2c9d7e | 4587 | htab_t visited; |
8dfaeb63 MM |
4588 | }; |
4589 | ||
4590 | /* Called from for_each_template_parm via walk_tree. */ | |
581d38d0 | 4591 | |
8dfaeb63 | 4592 | static tree |
3a978d72 | 4593 | for_each_template_parm_r (tree* tp, int* walk_subtrees, void* d) |
8dfaeb63 MM |
4594 | { |
4595 | tree t = *tp; | |
4596 | struct pair_fn_data *pfd = (struct pair_fn_data *) d; | |
4597 | tree_fn_t fn = pfd->fn; | |
4598 | void *data = pfd->data; | |
4f2c9d7e | 4599 | |
2f939d94 | 4600 | if (TYPE_P (t) |
4f2c9d7e | 4601 | && for_each_template_parm (TYPE_CONTEXT (t), fn, data, pfd->visited)) |
8dfaeb63 | 4602 | return error_mark_node; |
581d38d0 | 4603 | |
8d08fdba MS |
4604 | switch (TREE_CODE (t)) |
4605 | { | |
8d08fdba | 4606 | case RECORD_TYPE: |
9076e292 | 4607 | if (TYPE_PTRMEMFUNC_P (t)) |
8dfaeb63 | 4608 | break; |
ed44da02 MM |
4609 | /* Fall through. */ |
4610 | ||
8d08fdba | 4611 | case UNION_TYPE: |
ed44da02 | 4612 | case ENUMERAL_TYPE: |
8dfaeb63 MM |
4613 | if (!TYPE_TEMPLATE_INFO (t)) |
4614 | *walk_subtrees = 0; | |
4615 | else if (for_each_template_parm (TREE_VALUE (TYPE_TEMPLATE_INFO (t)), | |
4f2c9d7e | 4616 | fn, data, pfd->visited)) |
8dfaeb63 MM |
4617 | return error_mark_node; |
4618 | break; | |
4619 | ||
588c2d1c | 4620 | case METHOD_TYPE: |
8dfaeb63 MM |
4621 | /* Since we're not going to walk subtrees, we have to do this |
4622 | explicitly here. */ | |
4f2c9d7e MM |
4623 | if (for_each_template_parm (TYPE_METHOD_BASETYPE (t), fn, data, |
4624 | pfd->visited)) | |
8dfaeb63 | 4625 | return error_mark_node; |
4890c2f4 | 4626 | /* Fall through. */ |
588c2d1c MM |
4627 | |
4628 | case FUNCTION_TYPE: | |
8dfaeb63 | 4629 | /* Check the return type. */ |
4f2c9d7e | 4630 | if (for_each_template_parm (TREE_TYPE (t), fn, data, pfd->visited)) |
8dfaeb63 MM |
4631 | return error_mark_node; |
4632 | ||
588c2d1c MM |
4633 | /* Check the parameter types. Since default arguments are not |
4634 | instantiated until they are needed, the TYPE_ARG_TYPES may | |
4635 | contain expressions that involve template parameters. But, | |
4636 | no-one should be looking at them yet. And, once they're | |
4637 | instantiated, they don't contain template parameters, so | |
4638 | there's no point in looking at them then, either. */ | |
4639 | { | |
4640 | tree parm; | |
4641 | ||
4642 | for (parm = TYPE_ARG_TYPES (t); parm; parm = TREE_CHAIN (parm)) | |
4f2c9d7e MM |
4643 | if (for_each_template_parm (TREE_VALUE (parm), fn, data, |
4644 | pfd->visited)) | |
8dfaeb63 | 4645 | return error_mark_node; |
5566b478 | 4646 | |
8dfaeb63 MM |
4647 | /* Since we've already handled the TYPE_ARG_TYPES, we don't |
4648 | want walk_tree walking into them itself. */ | |
4649 | *walk_subtrees = 0; | |
4650 | } | |
4651 | break; | |
3ac3d9ea | 4652 | |
a723baf1 MM |
4653 | case TYPEOF_TYPE: |
4654 | if (for_each_template_parm (TYPE_FIELDS (t), fn, data, | |
4655 | pfd->visited)) | |
4656 | return error_mark_node; | |
4657 | break; | |
4658 | ||
8d08fdba | 4659 | case FUNCTION_DECL: |
5566b478 | 4660 | case VAR_DECL: |
5566b478 | 4661 | if (DECL_LANG_SPECIFIC (t) && DECL_TEMPLATE_INFO (t) |
4f2c9d7e MM |
4662 | && for_each_template_parm (DECL_TI_ARGS (t), fn, data, |
4663 | pfd->visited)) | |
8dfaeb63 MM |
4664 | return error_mark_node; |
4665 | /* Fall through. */ | |
4666 | ||
8d08fdba | 4667 | case PARM_DECL: |
a723baf1 MM |
4668 | case CONST_DECL: |
4669 | if (TREE_CODE (t) == CONST_DECL && DECL_TEMPLATE_PARM_P (t) | |
4670 | && for_each_template_parm (DECL_INITIAL (t), fn, data, | |
4671 | pfd->visited)) | |
4672 | return error_mark_node; | |
050367a3 | 4673 | if (DECL_CONTEXT (t) |
4f2c9d7e MM |
4674 | && for_each_template_parm (DECL_CONTEXT (t), fn, data, |
4675 | pfd->visited)) | |
8dfaeb63 MM |
4676 | return error_mark_node; |
4677 | break; | |
8d08fdba | 4678 | |
a1281f45 | 4679 | case BOUND_TEMPLATE_TEMPLATE_PARM: |
744fac59 | 4680 | /* Record template parameters such as `T' inside `TT<T>'. */ |
4f2c9d7e | 4681 | if (for_each_template_parm (TYPE_TI_ARGS (t), fn, data, pfd->visited)) |
8dfaeb63 MM |
4682 | return error_mark_node; |
4683 | /* Fall through. */ | |
4684 | ||
a1281f45 | 4685 | case TEMPLATE_TEMPLATE_PARM: |
744fac59 | 4686 | case TEMPLATE_TYPE_PARM: |
f84b4be9 | 4687 | case TEMPLATE_PARM_INDEX: |
8dfaeb63 MM |
4688 | if (fn && (*fn)(t, data)) |
4689 | return error_mark_node; | |
4690 | else if (!fn) | |
4691 | return error_mark_node; | |
4692 | break; | |
5156628f | 4693 | |
8dfaeb63 | 4694 | case TEMPLATE_DECL: |
f4f206f4 | 4695 | /* A template template parameter is encountered. */ |
8dfaeb63 | 4696 | if (DECL_TEMPLATE_TEMPLATE_PARM_P (t) |
4f2c9d7e | 4697 | && for_each_template_parm (TREE_TYPE (t), fn, data, pfd->visited)) |
8dfaeb63 | 4698 | return error_mark_node; |
db5ae43f | 4699 | |
8dfaeb63 MM |
4700 | /* Already substituted template template parameter */ |
4701 | *walk_subtrees = 0; | |
4702 | break; | |
b8865407 | 4703 | |
4699c561 | 4704 | case TYPENAME_TYPE: |
4f2c9d7e MM |
4705 | if (!fn |
4706 | || for_each_template_parm (TYPENAME_TYPE_FULLNAME (t), fn, | |
4707 | data, pfd->visited)) | |
8dfaeb63 MM |
4708 | return error_mark_node; |
4709 | break; | |
4699c561 | 4710 | |
8dfaeb63 MM |
4711 | case CONSTRUCTOR: |
4712 | if (TREE_TYPE (t) && TYPE_PTRMEMFUNC_P (TREE_TYPE (t)) | |
4713 | && for_each_template_parm (TYPE_PTRMEMFUNC_FN_TYPE | |
4f2c9d7e MM |
4714 | (TREE_TYPE (t)), fn, data, |
4715 | pfd->visited)) | |
8dfaeb63 MM |
4716 | return error_mark_node; |
4717 | break; | |
4718 | ||
b8865407 MM |
4719 | case INDIRECT_REF: |
4720 | case COMPONENT_REF: | |
4699c561 | 4721 | /* If there's no type, then this thing must be some expression |
b8865407 | 4722 | involving template parameters. */ |
4699c561 | 4723 | if (!fn && !TREE_TYPE (t)) |
8dfaeb63 MM |
4724 | return error_mark_node; |
4725 | break; | |
b8865407 | 4726 | |
42976354 BK |
4727 | case MODOP_EXPR: |
4728 | case CAST_EXPR: | |
4729 | case REINTERPRET_CAST_EXPR: | |
4730 | case CONST_CAST_EXPR: | |
4731 | case STATIC_CAST_EXPR: | |
4732 | case DYNAMIC_CAST_EXPR: | |
42976354 BK |
4733 | case ARROW_EXPR: |
4734 | case DOTSTAR_EXPR: | |
4735 | case TYPEID_EXPR: | |
40242ccf | 4736 | case PSEUDO_DTOR_EXPR: |
b8865407 | 4737 | if (!fn) |
8dfaeb63 MM |
4738 | return error_mark_node; |
4739 | break; | |
abff8e06 | 4740 | |
bd9bb3d2 MM |
4741 | case BASELINK: |
4742 | /* If we do not handle this case specially, we end up walking | |
4743 | the BINFO hierarchy, which is circular, and therefore | |
4744 | confuses walk_tree. */ | |
4745 | *walk_subtrees = 0; | |
4f2c9d7e MM |
4746 | if (for_each_template_parm (BASELINK_FUNCTIONS (*tp), fn, data, |
4747 | pfd->visited)) | |
bd9bb3d2 MM |
4748 | return error_mark_node; |
4749 | break; | |
4750 | ||
8d08fdba | 4751 | default: |
8dfaeb63 | 4752 | break; |
8d08fdba | 4753 | } |
8dfaeb63 MM |
4754 | |
4755 | /* We didn't find any template parameters we liked. */ | |
4756 | return NULL_TREE; | |
4757 | } | |
4758 | ||
a1281f45 KL |
4759 | /* For each TEMPLATE_TYPE_PARM, TEMPLATE_TEMPLATE_PARM, |
4760 | BOUND_TEMPLATE_TEMPLATE_PARM or TEMPLATE_PARM_INDEX in T, | |
4761 | call FN with the parameter and the DATA. | |
838dfd8a | 4762 | If FN returns nonzero, the iteration is terminated, and |
8dfaeb63 | 4763 | for_each_template_parm returns 1. Otherwise, the iteration |
838dfd8a | 4764 | continues. If FN never returns a nonzero value, the value |
8dfaeb63 MM |
4765 | returned by for_each_template_parm is 0. If FN is NULL, it is |
4766 | considered to be the function which always returns 1. */ | |
4767 | ||
4768 | static int | |
3a978d72 | 4769 | for_each_template_parm (tree t, tree_fn_t fn, void* data, htab_t visited) |
8dfaeb63 MM |
4770 | { |
4771 | struct pair_fn_data pfd; | |
ad2ae3b2 | 4772 | int result; |
8dfaeb63 MM |
4773 | |
4774 | /* Set up. */ | |
4775 | pfd.fn = fn; | |
4776 | pfd.data = data; | |
4777 | ||
4890c2f4 MM |
4778 | /* Walk the tree. (Conceptually, we would like to walk without |
4779 | duplicates, but for_each_template_parm_r recursively calls | |
4780 | for_each_template_parm, so we would need to reorganize a fair | |
4f2c9d7e MM |
4781 | bit to use walk_tree_without_duplicates, so we keep our own |
4782 | visited list.) */ | |
4783 | if (visited) | |
4784 | pfd.visited = visited; | |
4785 | else | |
4786 | pfd.visited = htab_create (37, htab_hash_pointer, htab_eq_pointer, | |
4787 | NULL); | |
ad2ae3b2 MM |
4788 | result = walk_tree (&t, |
4789 | for_each_template_parm_r, | |
4790 | &pfd, | |
c1e39976 | 4791 | pfd.visited) != NULL_TREE; |
ad2ae3b2 MM |
4792 | |
4793 | /* Clean up. */ | |
4794 | if (!visited) | |
4795 | htab_delete (pfd.visited); | |
4796 | ||
4797 | return result; | |
8d08fdba MS |
4798 | } |
4799 | ||
d43f603d KL |
4800 | /* Returns true if T depends on any template parameter. */ |
4801 | ||
050367a3 | 4802 | int |
3a978d72 | 4803 | uses_template_parms (tree t) |
050367a3 | 4804 | { |
c353b8e3 MM |
4805 | bool dependent_p; |
4806 | int saved_processing_template_decl; | |
4807 | ||
4808 | saved_processing_template_decl = processing_template_decl; | |
4809 | if (!saved_processing_template_decl) | |
4810 | processing_template_decl = 1; | |
4811 | if (TYPE_P (t)) | |
4812 | dependent_p = dependent_type_p (t); | |
4813 | else if (TREE_CODE (t) == TREE_VEC) | |
4814 | dependent_p = any_dependent_template_arguments_p (t); | |
4815 | else if (TREE_CODE (t) == TREE_LIST) | |
4816 | dependent_p = (uses_template_parms (TREE_VALUE (t)) | |
4817 | || uses_template_parms (TREE_CHAIN (t))); | |
4818 | else if (DECL_P (t) | |
4819 | || EXPR_P (t) | |
4820 | || TREE_CODE (t) == TEMPLATE_PARM_INDEX | |
4821 | || TREE_CODE (t) == OVERLOAD | |
4822 | || TREE_CODE (t) == BASELINK | |
4823 | || TREE_CODE_CLASS (TREE_CODE (t)) == 'c') | |
4824 | dependent_p = (type_dependent_expression_p (t) | |
4825 | || value_dependent_expression_p (t)); | |
4826 | else if (t == error_mark_node) | |
4827 | dependent_p = false; | |
4828 | else | |
4829 | abort (); | |
4830 | processing_template_decl = saved_processing_template_decl; | |
4831 | ||
4832 | return dependent_p; | |
050367a3 MM |
4833 | } |
4834 | ||
d43f603d KL |
4835 | /* Returns true if T depends on any template parameter with level LEVEL. */ |
4836 | ||
4837 | int | |
4838 | uses_template_parms_level (tree t, int level) | |
4839 | { | |
4840 | return for_each_template_parm (t, template_parm_this_level_p, &level, NULL); | |
4841 | } | |
4842 | ||
27fafc8d | 4843 | static int tinst_depth; |
e9f32eb5 | 4844 | extern int max_tinst_depth; |
5566b478 | 4845 | #ifdef GATHER_STATISTICS |
27fafc8d | 4846 | int depth_reached; |
5566b478 | 4847 | #endif |
8dfaeb63 MM |
4848 | static int tinst_level_tick; |
4849 | static int last_template_error_tick; | |
8d08fdba | 4850 | |
3ae18eaf JM |
4851 | /* We're starting to instantiate D; record the template instantiation context |
4852 | for diagnostics and to restore it later. */ | |
4853 | ||
742a37d5 | 4854 | int |
3a978d72 | 4855 | push_tinst_level (tree d) |
8d08fdba | 4856 | { |
3ae18eaf | 4857 | tree new; |
8d08fdba | 4858 | |
7215f9a0 MS |
4859 | if (tinst_depth >= max_tinst_depth) |
4860 | { | |
8adf5b5e JM |
4861 | /* If the instantiation in question still has unbound template parms, |
4862 | we don't really care if we can't instantiate it, so just return. | |
4863 | This happens with base instantiation for implicit `typename'. */ | |
4864 | if (uses_template_parms (d)) | |
4865 | return 0; | |
4866 | ||
1139b3d8 | 4867 | last_template_error_tick = tinst_level_tick; |
33bd39a2 | 4868 | error ("template instantiation depth exceeds maximum of %d (use -ftemplate-depth-NN to increase the maximum) instantiating `%D'", |
b4f4233d | 4869 | max_tinst_depth, d); |
5566b478 | 4870 | |
cb753e49 | 4871 | print_instantiation_context (); |
5566b478 | 4872 | |
7215f9a0 MS |
4873 | return 0; |
4874 | } | |
4875 | ||
6de9cd9a DN |
4876 | new = make_node (TINST_LEVEL); |
4877 | annotate_with_locus (new, input_location); | |
4878 | TINST_DECL (new) = d; | |
3ae18eaf | 4879 | TREE_CHAIN (new) = current_tinst_level; |
8d08fdba | 4880 | current_tinst_level = new; |
5566b478 | 4881 | |
7215f9a0 | 4882 | ++tinst_depth; |
5566b478 MS |
4883 | #ifdef GATHER_STATISTICS |
4884 | if (tinst_depth > depth_reached) | |
4885 | depth_reached = tinst_depth; | |
4886 | #endif | |
4887 | ||
27fafc8d | 4888 | ++tinst_level_tick; |
7215f9a0 | 4889 | return 1; |
8d08fdba MS |
4890 | } |
4891 | ||
3ae18eaf JM |
4892 | /* We're done instantiating this template; return to the instantiation |
4893 | context. */ | |
4894 | ||
8d08fdba | 4895 | void |
3a978d72 | 4896 | pop_tinst_level (void) |
8d08fdba | 4897 | { |
3ae18eaf | 4898 | tree old = current_tinst_level; |
8d08fdba | 4899 | |
ae58fa02 MM |
4900 | /* Restore the filename and line number stashed away when we started |
4901 | this instantiation. */ | |
6de9cd9a | 4902 | input_location = *EXPR_LOCUS (old); |
5f2c99c4 | 4903 | extract_interface_info (); |
ae58fa02 | 4904 | |
3ae18eaf | 4905 | current_tinst_level = TREE_CHAIN (old); |
7215f9a0 | 4906 | --tinst_depth; |
27fafc8d | 4907 | ++tinst_level_tick; |
8d08fdba MS |
4908 | } |
4909 | ||
3ae18eaf JM |
4910 | /* We're instantiating a deferred template; restore the template |
4911 | instantiation context in which the instantiation was requested, which | |
4912 | is one step out from LEVEL. */ | |
4913 | ||
4914 | static void | |
3a978d72 | 4915 | reopen_tinst_level (tree level) |
3ae18eaf JM |
4916 | { |
4917 | tree t; | |
4918 | ||
4919 | tinst_depth = 0; | |
4920 | for (t = level; t; t = TREE_CHAIN (t)) | |
4921 | ++tinst_depth; | |
4922 | ||
4923 | current_tinst_level = level; | |
4924 | pop_tinst_level (); | |
4925 | } | |
4926 | ||
4927 | /* Return the outermost template instantiation context, for use with | |
4928 | -falt-external-templates. */ | |
4929 | ||
4930 | tree | |
3a978d72 | 4931 | tinst_for_decl (void) |
8d08fdba | 4932 | { |
3ae18eaf | 4933 | tree p = current_tinst_level; |
8d08fdba MS |
4934 | |
4935 | if (p) | |
3ae18eaf | 4936 | for (; TREE_CHAIN (p) ; p = TREE_CHAIN (p)) |
8d08fdba MS |
4937 | ; |
4938 | return p; | |
4939 | } | |
4940 | ||
f84b4be9 JM |
4941 | /* DECL is a friend FUNCTION_DECL or TEMPLATE_DECL. ARGS is the |
4942 | vector of template arguments, as for tsubst. | |
4943 | ||
dc957d14 | 4944 | Returns an appropriate tsubst'd friend declaration. */ |
f84b4be9 JM |
4945 | |
4946 | static tree | |
3a978d72 | 4947 | tsubst_friend_function (tree decl, tree args) |
f84b4be9 JM |
4948 | { |
4949 | tree new_friend; | |
82a98427 | 4950 | location_t saved_loc = input_location; |
27fafc8d | 4951 | |
f31686a3 | 4952 | input_location = DECL_SOURCE_LOCATION (decl); |
27fafc8d | 4953 | |
f84b4be9 JM |
4954 | if (TREE_CODE (decl) == FUNCTION_DECL |
4955 | && DECL_TEMPLATE_INSTANTIATION (decl) | |
4956 | && TREE_CODE (DECL_TI_TEMPLATE (decl)) != TEMPLATE_DECL) | |
4957 | /* This was a friend declared with an explicit template | |
4958 | argument list, e.g.: | |
4959 | ||
4960 | friend void f<>(T); | |
4961 | ||
4962 | to indicate that f was a template instantiation, not a new | |
4963 | function declaration. Now, we have to figure out what | |
4964 | instantiation of what template. */ | |
4965 | { | |
76e57b45 | 4966 | tree template_id, arglist, fns; |
f84b4be9 JM |
4967 | tree new_args; |
4968 | tree tmpl; | |
ed2fa432 | 4969 | tree ns = decl_namespace_context (TYPE_MAIN_DECL (current_class_type)); |
76e57b45 NS |
4970 | |
4971 | /* Friend functions are looked up in the containing namespace scope. | |
4972 | We must enter that scope, to avoid finding member functions of the | |
4973 | current cless with same name. */ | |
4974 | push_nested_namespace (ns); | |
4975 | fns = tsubst_expr (DECL_TI_TEMPLATE (decl), args, | |
c2ea3a40 | 4976 | tf_error | tf_warning, NULL_TREE); |
76e57b45 NS |
4977 | pop_nested_namespace (ns); |
4978 | arglist = tsubst (DECL_TI_ARGS (decl), args, | |
c2ea3a40 | 4979 | tf_error | tf_warning, NULL_TREE); |
76e57b45 NS |
4980 | template_id = lookup_template_function (fns, arglist); |
4981 | ||
c2ea3a40 | 4982 | new_friend = tsubst (decl, args, tf_error | tf_warning, NULL_TREE); |
36a117a5 MM |
4983 | tmpl = determine_specialization (template_id, new_friend, |
4984 | &new_args, | |
bf8f3f93 | 4985 | /*need_member_template=*/0); |
3e4a3562 | 4986 | new_friend = instantiate_template (tmpl, new_args, tf_error); |
27fafc8d | 4987 | goto done; |
f84b4be9 | 4988 | } |
36a117a5 | 4989 | |
c2ea3a40 | 4990 | new_friend = tsubst (decl, args, tf_error | tf_warning, NULL_TREE); |
f84b4be9 | 4991 | |
36a117a5 | 4992 | /* The NEW_FRIEND will look like an instantiation, to the |
f84b4be9 JM |
4993 | compiler, but is not an instantiation from the point of view of |
4994 | the language. For example, we might have had: | |
4995 | ||
4996 | template <class T> struct S { | |
4997 | template <class U> friend void f(T, U); | |
4998 | }; | |
4999 | ||
5000 | Then, in S<int>, template <class U> void f(int, U) is not an | |
5001 | instantiation of anything. */ | |
ac2b3222 AP |
5002 | if (new_friend == error_mark_node) |
5003 | return error_mark_node; | |
5004 | ||
f84b4be9 JM |
5005 | DECL_USE_TEMPLATE (new_friend) = 0; |
5006 | if (TREE_CODE (decl) == TEMPLATE_DECL) | |
655dc6ee JM |
5007 | { |
5008 | DECL_USE_TEMPLATE (DECL_TEMPLATE_RESULT (new_friend)) = 0; | |
5009 | DECL_SAVED_TREE (DECL_TEMPLATE_RESULT (new_friend)) | |
5010 | = DECL_SAVED_TREE (DECL_TEMPLATE_RESULT (decl)); | |
5011 | } | |
36a117a5 | 5012 | |
92643fea MM |
5013 | /* The mangled name for the NEW_FRIEND is incorrect. The function |
5014 | is not a template instantiation and should not be mangled like | |
5015 | one. Therefore, we forget the mangling here; we'll recompute it | |
5016 | later if we need it. */ | |
36a117a5 MM |
5017 | if (TREE_CODE (new_friend) != TEMPLATE_DECL) |
5018 | { | |
19e7881c | 5019 | SET_DECL_RTL (new_friend, NULL_RTX); |
92643fea | 5020 | SET_DECL_ASSEMBLER_NAME (new_friend, NULL_TREE); |
36a117a5 MM |
5021 | } |
5022 | ||
6eb3bb27 | 5023 | if (DECL_NAMESPACE_SCOPE_P (new_friend)) |
f84b4be9 | 5024 | { |
36a117a5 | 5025 | tree old_decl; |
fbf1c34b MM |
5026 | tree new_friend_template_info; |
5027 | tree new_friend_result_template_info; | |
92da7074 | 5028 | tree ns; |
fbf1c34b MM |
5029 | int new_friend_is_defn; |
5030 | ||
5031 | /* We must save some information from NEW_FRIEND before calling | |
5032 | duplicate decls since that function will free NEW_FRIEND if | |
5033 | possible. */ | |
5034 | new_friend_template_info = DECL_TEMPLATE_INFO (new_friend); | |
5bd61841 MM |
5035 | new_friend_is_defn = |
5036 | (DECL_INITIAL (DECL_TEMPLATE_RESULT | |
5037 | (template_for_substitution (new_friend))) | |
5038 | != NULL_TREE); | |
f84b4be9 | 5039 | if (TREE_CODE (new_friend) == TEMPLATE_DECL) |
fbf1c34b MM |
5040 | { |
5041 | /* This declaration is a `primary' template. */ | |
5042 | DECL_PRIMARY_TEMPLATE (new_friend) = new_friend; | |
5043 | ||
fbf1c34b | 5044 | new_friend_result_template_info |
17aec3eb | 5045 | = DECL_TEMPLATE_INFO (DECL_TEMPLATE_RESULT (new_friend)); |
fbf1c34b MM |
5046 | } |
5047 | else | |
5bd61841 | 5048 | new_friend_result_template_info = NULL_TREE; |
36a117a5 | 5049 | |
1c227897 MM |
5050 | /* Inside pushdecl_namespace_level, we will push into the |
5051 | current namespace. However, the friend function should go | |
c6002625 | 5052 | into the namespace of the template. */ |
92da7074 ML |
5053 | ns = decl_namespace_context (new_friend); |
5054 | push_nested_namespace (ns); | |
36a117a5 | 5055 | old_decl = pushdecl_namespace_level (new_friend); |
92da7074 | 5056 | pop_nested_namespace (ns); |
36a117a5 MM |
5057 | |
5058 | if (old_decl != new_friend) | |
5059 | { | |
5060 | /* This new friend declaration matched an existing | |
5061 | declaration. For example, given: | |
5062 | ||
5063 | template <class T> void f(T); | |
5064 | template <class U> class C { | |
5065 | template <class T> friend void f(T) {} | |
5066 | }; | |
5067 | ||
5068 | the friend declaration actually provides the definition | |
5069 | of `f', once C has been instantiated for some type. So, | |
5070 | old_decl will be the out-of-class template declaration, | |
5071 | while new_friend is the in-class definition. | |
5072 | ||
5073 | But, if `f' was called before this point, the | |
5074 | instantiation of `f' will have DECL_TI_ARGS corresponding | |
5075 | to `T' but not to `U', references to which might appear | |
5076 | in the definition of `f'. Previously, the most general | |
5077 | template for an instantiation of `f' was the out-of-class | |
5078 | version; now it is the in-class version. Therefore, we | |
5079 | run through all specialization of `f', adding to their | |
5080 | DECL_TI_ARGS appropriately. In particular, they need a | |
5081 | new set of outer arguments, corresponding to the | |
5082 | arguments for this class instantiation. | |
5083 | ||
5084 | The same situation can arise with something like this: | |
5085 | ||
5086 | friend void f(int); | |
5087 | template <class T> class C { | |
5088 | friend void f(T) {} | |
5089 | }; | |
5090 | ||
5091 | when `C<int>' is instantiated. Now, `f(int)' is defined | |
5092 | in the class. */ | |
5093 | ||
fbf1c34b MM |
5094 | if (!new_friend_is_defn) |
5095 | /* On the other hand, if the in-class declaration does | |
5096 | *not* provide a definition, then we don't want to alter | |
5097 | existing definitions. We can just leave everything | |
5098 | alone. */ | |
36a117a5 | 5099 | ; |
fbf1c34b | 5100 | else |
36a117a5 | 5101 | { |
fbf1c34b MM |
5102 | /* Overwrite whatever template info was there before, if |
5103 | any, with the new template information pertaining to | |
5104 | the declaration. */ | |
5105 | DECL_TEMPLATE_INFO (old_decl) = new_friend_template_info; | |
5106 | ||
5107 | if (TREE_CODE (old_decl) != TEMPLATE_DECL) | |
8d83f792 MM |
5108 | reregister_specialization (new_friend, |
5109 | most_general_template (old_decl), | |
5110 | old_decl); | |
fbf1c34b | 5111 | else |
36a117a5 | 5112 | { |
fbf1c34b MM |
5113 | tree t; |
5114 | tree new_friend_args; | |
5115 | ||
17aec3eb | 5116 | DECL_TEMPLATE_INFO (DECL_TEMPLATE_RESULT (old_decl)) |
fbf1c34b MM |
5117 | = new_friend_result_template_info; |
5118 | ||
5119 | new_friend_args = TI_ARGS (new_friend_template_info); | |
5120 | for (t = DECL_TEMPLATE_SPECIALIZATIONS (old_decl); | |
5121 | t != NULL_TREE; | |
5122 | t = TREE_CHAIN (t)) | |
5123 | { | |
5124 | tree spec = TREE_VALUE (t); | |
36a117a5 | 5125 | |
fbf1c34b MM |
5126 | DECL_TI_ARGS (spec) |
5127 | = add_outermost_template_args (new_friend_args, | |
5128 | DECL_TI_ARGS (spec)); | |
fbf1c34b MM |
5129 | } |
5130 | ||
5131 | /* Now, since specializations are always supposed to | |
5132 | hang off of the most general template, we must move | |
5133 | them. */ | |
5134 | t = most_general_template (old_decl); | |
5135 | if (t != old_decl) | |
5136 | { | |
5137 | DECL_TEMPLATE_SPECIALIZATIONS (t) | |
5138 | = chainon (DECL_TEMPLATE_SPECIALIZATIONS (t), | |
5139 | DECL_TEMPLATE_SPECIALIZATIONS (old_decl)); | |
5140 | DECL_TEMPLATE_SPECIALIZATIONS (old_decl) = NULL_TREE; | |
5141 | } | |
36a117a5 MM |
5142 | } |
5143 | } | |
5144 | ||
5145 | /* The information from NEW_FRIEND has been merged into OLD_DECL | |
5146 | by duplicate_decls. */ | |
5147 | new_friend = old_decl; | |
5148 | } | |
f84b4be9 | 5149 | } |
d0f062fb | 5150 | else if (COMPLETE_TYPE_P (DECL_CONTEXT (new_friend))) |
f84b4be9 JM |
5151 | { |
5152 | /* Check to see that the declaration is really present, and, | |
5153 | possibly obtain an improved declaration. */ | |
44021471 GB |
5154 | tree fn = check_classfn (DECL_CONTEXT (new_friend), |
5155 | new_friend, NULL_TREE); | |
f84b4be9 JM |
5156 | |
5157 | if (fn) | |
5158 | new_friend = fn; | |
5159 | } | |
5160 | ||
27fafc8d | 5161 | done: |
82a98427 | 5162 | input_location = saved_loc; |
f84b4be9 JM |
5163 | return new_friend; |
5164 | } | |
5165 | ||
1aed5355 MM |
5166 | /* FRIEND_TMPL is a friend TEMPLATE_DECL. ARGS is the vector of |
5167 | template arguments, as for tsubst. | |
6757edfe | 5168 | |
dc957d14 | 5169 | Returns an appropriate tsubst'd friend type or error_mark_node on |
4b054b80 | 5170 | failure. */ |
6757edfe MM |
5171 | |
5172 | static tree | |
3a978d72 | 5173 | tsubst_friend_class (tree friend_tmpl, tree args) |
6757edfe | 5174 | { |
1aed5355 | 5175 | tree friend_type; |
25aab5d0 | 5176 | tree tmpl; |
3e0ec82f | 5177 | tree context; |
6757edfe | 5178 | |
3e0ec82f MM |
5179 | context = DECL_CONTEXT (friend_tmpl); |
5180 | ||
5181 | if (context) | |
77adef84 | 5182 | { |
3e0ec82f MM |
5183 | if (TREE_CODE (context) == NAMESPACE_DECL) |
5184 | push_nested_namespace (context); | |
5185 | else | |
14d22dd6 | 5186 | push_nested_class (tsubst (context, args, tf_none, NULL_TREE)); |
3e0ec82f | 5187 | } |
25aab5d0 | 5188 | |
3e0ec82f MM |
5189 | /* First, we look for a class template. */ |
5190 | tmpl = lookup_name (DECL_NAME (friend_tmpl), /*prefer_type=*/0); | |
25aab5d0 | 5191 | |
3e0ec82f MM |
5192 | /* But, if we don't find one, it might be because we're in a |
5193 | situation like this: | |
77adef84 | 5194 | |
3e0ec82f MM |
5195 | template <class T> |
5196 | struct S { | |
5197 | template <class U> | |
5198 | friend struct S; | |
5199 | }; | |
5200 | ||
5201 | Here, in the scope of (say) S<int>, `S' is bound to a TYPE_DECL | |
5202 | for `S<int>', not the TEMPLATE_DECL. */ | |
5203 | if (!tmpl || !DECL_CLASS_TEMPLATE_P (tmpl)) | |
5204 | { | |
5205 | tmpl = lookup_name (DECL_NAME (friend_tmpl), /*prefer_type=*/1); | |
5206 | tmpl = maybe_get_template_decl_from_type_decl (tmpl); | |
25aab5d0 | 5207 | } |
6757edfe | 5208 | |
25aab5d0 | 5209 | if (tmpl && DECL_CLASS_TEMPLATE_P (tmpl)) |
6757edfe MM |
5210 | { |
5211 | /* The friend template has already been declared. Just | |
36a117a5 MM |
5212 | check to see that the declarations match, and install any new |
5213 | default parameters. We must tsubst the default parameters, | |
5214 | of course. We only need the innermost template parameters | |
5215 | because that is all that redeclare_class_template will look | |
5216 | at. */ | |
3e0ec82f MM |
5217 | if (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (friend_tmpl)) |
5218 | > TMPL_ARGS_DEPTH (args)) | |
5219 | { | |
5220 | tree parms; | |
5221 | parms = tsubst_template_parms (DECL_TEMPLATE_PARMS (friend_tmpl), | |
5222 | args, tf_error | tf_warning); | |
5223 | redeclare_class_template (TREE_TYPE (tmpl), parms); | |
5224 | } | |
5225 | ||
6757edfe MM |
5226 | friend_type = TREE_TYPE (tmpl); |
5227 | } | |
5228 | else | |
5229 | { | |
5230 | /* The friend template has not already been declared. In this | |
5231 | case, the instantiation of the template class will cause the | |
5232 | injection of this template into the global scope. */ | |
c2ea3a40 | 5233 | tmpl = tsubst (friend_tmpl, args, tf_error | tf_warning, NULL_TREE); |
6757edfe MM |
5234 | |
5235 | /* The new TMPL is not an instantiation of anything, so we | |
5236 | forget its origins. We don't reset CLASSTYPE_TI_TEMPLATE for | |
5237 | the new type because that is supposed to be the corresponding | |
5238 | template decl, i.e., TMPL. */ | |
5239 | DECL_USE_TEMPLATE (tmpl) = 0; | |
5240 | DECL_TEMPLATE_INFO (tmpl) = NULL_TREE; | |
5241 | CLASSTYPE_USE_TEMPLATE (TREE_TYPE (tmpl)) = 0; | |
68c78847 KL |
5242 | CLASSTYPE_TI_ARGS (TREE_TYPE (tmpl)) |
5243 | = INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (TREE_TYPE (tmpl))); | |
6757edfe MM |
5244 | |
5245 | /* Inject this template into the global scope. */ | |
5246 | friend_type = TREE_TYPE (pushdecl_top_level (tmpl)); | |
5247 | } | |
5248 | ||
3e0ec82f MM |
5249 | if (context) |
5250 | { | |
5251 | if (TREE_CODE (context) == NAMESPACE_DECL) | |
5252 | pop_nested_namespace (context); | |
5253 | else | |
5254 | pop_nested_class (); | |
5255 | } | |
5256 | ||
6757edfe MM |
5257 | return friend_type; |
5258 | } | |
f84b4be9 | 5259 | |
17f29637 KL |
5260 | /* Returns zero if TYPE cannot be completed later due to circularity. |
5261 | Otherwise returns one. */ | |
5262 | ||
d5372501 | 5263 | static int |
3a978d72 | 5264 | can_complete_type_without_circularity (tree type) |
17f29637 KL |
5265 | { |
5266 | if (type == NULL_TREE || type == error_mark_node) | |
5267 | return 0; | |
5268 | else if (COMPLETE_TYPE_P (type)) | |
5269 | return 1; | |
5270 | else if (TREE_CODE (type) == ARRAY_TYPE && TYPE_DOMAIN (type)) | |
5271 | return can_complete_type_without_circularity (TREE_TYPE (type)); | |
8c6ab2db NS |
5272 | else if (CLASS_TYPE_P (type) |
5273 | && TYPE_BEING_DEFINED (TYPE_MAIN_VARIANT (type))) | |
17f29637 KL |
5274 | return 0; |
5275 | else | |
5276 | return 1; | |
5277 | } | |
5278 | ||
8d08fdba | 5279 | tree |
3a978d72 | 5280 | instantiate_class_template (tree type) |
8d08fdba | 5281 | { |
7088fca9 | 5282 | tree template, args, pattern, t, member; |
36a117a5 | 5283 | tree typedecl; |
dbbf88d1 NS |
5284 | tree pbinfo; |
5285 | ||
5566b478 | 5286 | if (type == error_mark_node) |
8d08fdba MS |
5287 | return error_mark_node; |
5288 | ||
ca099ac8 MM |
5289 | if (TYPE_BEING_DEFINED (type) |
5290 | || COMPLETE_TYPE_P (type) | |
5291 | || dependent_type_p (type)) | |
5566b478 MS |
5292 | return type; |
5293 | ||
6bdb985f | 5294 | /* Figure out which template is being instantiated. */ |
36a117a5 | 5295 | template = most_general_template (CLASSTYPE_TI_TEMPLATE (type)); |
5566b478 | 5296 | my_friendly_assert (TREE_CODE (template) == TEMPLATE_DECL, 279); |
73aad9b9 | 5297 | |
6bdb985f MM |
5298 | /* Figure out which arguments are being used to do the |
5299 | instantiation. */ | |
5300 | args = CLASSTYPE_TI_ARGS (type); | |
4c571114 MM |
5301 | |
5302 | /* Determine what specialization of the original template to | |
5303 | instantiate. */ | |
8fbc5ae7 MM |
5304 | t = most_specialized_class (template, args); |
5305 | if (t == error_mark_node) | |
73aad9b9 | 5306 | { |
8fbc5ae7 MM |
5307 | const char *str = "candidates are:"; |
5308 | error ("ambiguous class template instantiation for `%#T'", type); | |
5309 | for (t = DECL_TEMPLATE_SPECIALIZATIONS (template); t; | |
5310 | t = TREE_CHAIN (t)) | |
73aad9b9 | 5311 | { |
8c6ab2db | 5312 | if (get_class_bindings (TREE_VALUE (t), TREE_PURPOSE (t), args)) |
73aad9b9 | 5313 | { |
8fbc5ae7 MM |
5314 | cp_error_at ("%s %+#T", str, TREE_TYPE (t)); |
5315 | str = " "; | |
73aad9b9 JM |
5316 | } |
5317 | } | |
8fbc5ae7 MM |
5318 | TYPE_BEING_DEFINED (type) = 1; |
5319 | return error_mark_node; | |
73aad9b9 | 5320 | } |
6bdb985f MM |
5321 | |
5322 | if (t) | |
73aad9b9 JM |
5323 | pattern = TREE_TYPE (t); |
5324 | else | |
5325 | pattern = TREE_TYPE (template); | |
5566b478 | 5326 | |
4c571114 MM |
5327 | /* If the template we're instantiating is incomplete, then clearly |
5328 | there's nothing we can do. */ | |
d0f062fb | 5329 | if (!COMPLETE_TYPE_P (pattern)) |
f31c0a32 | 5330 | return type; |
5566b478 | 5331 | |
4c571114 MM |
5332 | /* If we've recursively instantiated too many templates, stop. */ |
5333 | if (! push_tinst_level (type)) | |
f31c0a32 | 5334 | return type; |
4c571114 MM |
5335 | |
5336 | /* Now we're really doing the instantiation. Mark the type as in | |
5337 | the process of being defined. */ | |
5338 | TYPE_BEING_DEFINED (type) = 1; | |
5339 | ||
78757caa KL |
5340 | /* We may be in the middle of deferred access check. Disable |
5341 | it now. */ | |
5342 | push_deferring_access_checks (dk_no_deferred); | |
5343 | ||
c353b8e3 | 5344 | push_to_top_level (); |
4c571114 | 5345 | |
73aad9b9 | 5346 | if (t) |
36a117a5 | 5347 | { |
27631dae | 5348 | /* This TYPE is actually an instantiation of a partial |
36a117a5 MM |
5349 | specialization. We replace the innermost set of ARGS with |
5350 | the arguments appropriate for substitution. For example, | |
5351 | given: | |
5352 | ||
5353 | template <class T> struct S {}; | |
5354 | template <class T> struct S<T*> {}; | |
5355 | ||
5356 | and supposing that we are instantiating S<int*>, ARGS will | |
5357 | present be {int*} but we need {int}. */ | |
5358 | tree inner_args | |
5359 | = get_class_bindings (TREE_VALUE (t), TREE_PURPOSE (t), | |
5360 | args); | |
5361 | ||
5362 | /* If there were multiple levels in ARGS, replacing the | |
5363 | innermost level would alter CLASSTYPE_TI_ARGS, which we don't | |
5364 | want, so we make a copy first. */ | |
5365 | if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (args)) | |
5366 | { | |
5367 | args = copy_node (args); | |
5368 | SET_TMPL_ARGS_LEVEL (args, TMPL_ARGS_DEPTH (args), inner_args); | |
5369 | } | |
5370 | else | |
5371 | args = inner_args; | |
5372 | } | |
8d019cef | 5373 | |
7813d14c | 5374 | SET_CLASSTYPE_INTERFACE_UNKNOWN (type); |
8d08fdba | 5375 | |
68ea098a NS |
5376 | /* Set the input location to the template definition. This is needed |
5377 | if tsubsting causes an error. */ | |
f31686a3 | 5378 | input_location = DECL_SOURCE_LOCATION (TYPE_NAME (pattern)); |
68ea098a | 5379 | |
f7da6097 MS |
5380 | TYPE_HAS_CONSTRUCTOR (type) = TYPE_HAS_CONSTRUCTOR (pattern); |
5381 | TYPE_HAS_DESTRUCTOR (type) = TYPE_HAS_DESTRUCTOR (pattern); | |
834c6dff MM |
5382 | TYPE_HAS_NEW_OPERATOR (type) = TYPE_HAS_NEW_OPERATOR (pattern); |
5383 | TYPE_HAS_ARRAY_NEW_OPERATOR (type) = TYPE_HAS_ARRAY_NEW_OPERATOR (pattern); | |
f7da6097 | 5384 | TYPE_GETS_DELETE (type) = TYPE_GETS_DELETE (pattern); |
f7da6097 MS |
5385 | TYPE_HAS_ASSIGN_REF (type) = TYPE_HAS_ASSIGN_REF (pattern); |
5386 | TYPE_HAS_CONST_ASSIGN_REF (type) = TYPE_HAS_CONST_ASSIGN_REF (pattern); | |
5387 | TYPE_HAS_ABSTRACT_ASSIGN_REF (type) = TYPE_HAS_ABSTRACT_ASSIGN_REF (pattern); | |
5388 | TYPE_HAS_INIT_REF (type) = TYPE_HAS_INIT_REF (pattern); | |
5389 | TYPE_HAS_CONST_INIT_REF (type) = TYPE_HAS_CONST_INIT_REF (pattern); | |
f7da6097 MS |
5390 | TYPE_HAS_DEFAULT_CONSTRUCTOR (type) = TYPE_HAS_DEFAULT_CONSTRUCTOR (pattern); |
5391 | TYPE_HAS_CONVERSION (type) = TYPE_HAS_CONVERSION (pattern); | |
4c6b7393 MM |
5392 | TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (type) |
5393 | = TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (pattern); | |
f7da6097 MS |
5394 | TYPE_USES_MULTIPLE_INHERITANCE (type) |
5395 | = TYPE_USES_MULTIPLE_INHERITANCE (pattern); | |
5396 | TYPE_USES_VIRTUAL_BASECLASSES (type) | |
5397 | = TYPE_USES_VIRTUAL_BASECLASSES (pattern); | |
5398 | TYPE_PACKED (type) = TYPE_PACKED (pattern); | |
5399 | TYPE_ALIGN (type) = TYPE_ALIGN (pattern); | |
11cf4d18 | 5400 | TYPE_USER_ALIGN (type) = TYPE_USER_ALIGN (pattern); |
eff71ab0 | 5401 | TYPE_FOR_JAVA (type) = TYPE_FOR_JAVA (pattern); /* For libjava's JArray<T> */ |
6bdb8141 JM |
5402 | if (ANON_AGGR_TYPE_P (pattern)) |
5403 | SET_ANON_AGGR_TYPE_P (type); | |
f7da6097 | 5404 | |
dbbf88d1 | 5405 | pbinfo = TYPE_BINFO (pattern); |
1456deaf JM |
5406 | |
5407 | #ifdef ENABLE_CHECKING | |
5408 | if (DECL_CLASS_SCOPE_P (TYPE_MAIN_DECL (pattern)) | |
5409 | && ! COMPLETE_TYPE_P (TYPE_CONTEXT (type)) | |
5410 | && ! TYPE_BEING_DEFINED (TYPE_CONTEXT (type))) | |
5411 | /* We should never instantiate a nested class before its enclosing | |
5412 | class; we need to look up the nested class by name before we can | |
5413 | instantiate it, and that lookup should instantiate the enclosing | |
5414 | class. */ | |
5415 | abort (); | |
5416 | #endif | |
5417 | ||
dbbf88d1 | 5418 | if (BINFO_BASETYPES (pbinfo)) |
3fd71a52 MM |
5419 | { |
5420 | tree base_list = NULL_TREE; | |
dbbf88d1 NS |
5421 | tree pbases = BINFO_BASETYPES (pbinfo); |
5422 | tree paccesses = BINFO_BASEACCESSES (pbinfo); | |
a2507277 | 5423 | tree context = TYPE_CONTEXT (type); |
91b004e5 | 5424 | bool pop_p; |
3fd71a52 | 5425 | int i; |
5566b478 | 5426 | |
a2507277 NS |
5427 | /* We must enter the scope containing the type, as that is where |
5428 | the accessibility of types named in dependent bases are | |
5429 | looked up from. */ | |
91b004e5 | 5430 | pop_p = push_scope (context ? context : global_namespace); |
a2507277 | 5431 | |
3fd71a52 MM |
5432 | /* Substitute into each of the bases to determine the actual |
5433 | basetypes. */ | |
5434 | for (i = 0; i < TREE_VEC_LENGTH (pbases); ++i) | |
5435 | { | |
5436 | tree base; | |
5437 | tree access; | |
5438 | tree pbase; | |
5566b478 | 5439 | |
3fd71a52 | 5440 | pbase = TREE_VEC_ELT (pbases, i); |
dbbf88d1 | 5441 | access = TREE_VEC_ELT (paccesses, i); |
711734a9 | 5442 | |
dc957d14 | 5443 | /* Substitute to figure out the base class. */ |
c2ea3a40 | 5444 | base = tsubst (BINFO_TYPE (pbase), args, tf_error, NULL_TREE); |
3fd71a52 MM |
5445 | if (base == error_mark_node) |
5446 | continue; | |
dbbf88d1 | 5447 | |
3fd71a52 | 5448 | base_list = tree_cons (access, base, base_list); |
dbbf88d1 | 5449 | TREE_VIA_VIRTUAL (base_list) = TREE_VIA_VIRTUAL (pbase); |
3fd71a52 | 5450 | } |
dfbcd65a | 5451 | |
3fd71a52 MM |
5452 | /* The list is now in reverse order; correct that. */ |
5453 | base_list = nreverse (base_list); | |
5454 | ||
5455 | /* Now call xref_basetypes to set up all the base-class | |
5456 | information. */ | |
da15dae6 | 5457 | xref_basetypes (type, base_list); |
a2507277 | 5458 | |
91b004e5 MM |
5459 | if (pop_p) |
5460 | pop_scope (context ? context : global_namespace); | |
3fd71a52 | 5461 | } |
5566b478 | 5462 | |
b74a0560 MM |
5463 | /* Now that our base classes are set up, enter the scope of the |
5464 | class, so that name lookups into base classes, etc. will work | |
dc957d14 | 5465 | correctly. This is precisely analogous to what we do in |
b74a0560 MM |
5466 | begin_class_definition when defining an ordinary non-template |
5467 | class. */ | |
29370796 | 5468 | pushclass (type); |
b74a0560 | 5469 | |
7088fca9 | 5470 | /* Now members are processed in the order of declaration. */ |
8c6ab2db NS |
5471 | for (member = CLASSTYPE_DECL_LIST (pattern); |
5472 | member; member = TREE_CHAIN (member)) | |
8d08fdba | 5473 | { |
7088fca9 | 5474 | tree t = TREE_VALUE (member); |
5566b478 | 5475 | |
7088fca9 | 5476 | if (TREE_PURPOSE (member)) |
ed44da02 | 5477 | { |
7088fca9 KL |
5478 | if (TYPE_P (t)) |
5479 | { | |
5e0c54e5 | 5480 | /* Build new CLASSTYPE_NESTED_UTDS. */ |
8d08fdba | 5481 | |
7088fca9 KL |
5482 | tree tag = t; |
5483 | tree name = TYPE_IDENTIFIER (tag); | |
5484 | tree newtag; | |
ae58fa02 | 5485 | |
7088fca9 | 5486 | newtag = tsubst (tag, args, tf_error, NULL_TREE); |
2620d095 KL |
5487 | if (newtag == error_mark_node) |
5488 | continue; | |
5489 | ||
7088fca9 KL |
5490 | if (TREE_CODE (newtag) != ENUMERAL_TYPE) |
5491 | { | |
5492 | if (TYPE_LANG_SPECIFIC (tag) && CLASSTYPE_IS_TEMPLATE (tag)) | |
5493 | /* Unfortunately, lookup_template_class sets | |
5494 | CLASSTYPE_IMPLICIT_INSTANTIATION for a partial | |
3afd2e20 NS |
5495 | instantiation (i.e., for the type of a member |
5496 | template class nested within a template class.) | |
5497 | This behavior is required for | |
5498 | maybe_process_partial_specialization to work | |
5499 | correctly, but is not accurate in this case; | |
5500 | the TAG is not an instantiation of anything. | |
5501 | (The corresponding TEMPLATE_DECL is an | |
5502 | instantiation, but the TYPE is not.) */ | |
7088fca9 KL |
5503 | CLASSTYPE_USE_TEMPLATE (newtag) = 0; |
5504 | ||
5505 | /* Now, we call pushtag to put this NEWTAG into the scope of | |
5506 | TYPE. We first set up the IDENTIFIER_TYPE_VALUE to avoid | |
5507 | pushtag calling push_template_decl. We don't have to do | |
5508 | this for enums because it will already have been done in | |
5509 | tsubst_enum. */ | |
5510 | if (name) | |
5511 | SET_IDENTIFIER_TYPE_VALUE (name, newtag); | |
5512 | pushtag (name, newtag, /*globalize=*/0); | |
5513 | } | |
5514 | } | |
5515 | else if (TREE_CODE (t) == FUNCTION_DECL | |
5516 | || DECL_FUNCTION_TEMPLATE_P (t)) | |
5517 | { | |
5518 | /* Build new TYPE_METHODS. */ | |
fecafe5e NS |
5519 | tree r; |
5520 | ||
5521 | if (TREE_CODE (t) == TEMPLATE_DECL) | |
9579624e | 5522 | ++processing_template_decl; |
fecafe5e NS |
5523 | r = tsubst (t, args, tf_error, NULL_TREE); |
5524 | if (TREE_CODE (t) == TEMPLATE_DECL) | |
9579624e | 5525 | --processing_template_decl; |
7088fca9 KL |
5526 | set_current_access_from_decl (r); |
5527 | grok_special_member_properties (r); | |
5528 | finish_member_declaration (r); | |
5529 | } | |
5530 | else | |
5531 | { | |
5532 | /* Build new TYPE_FIELDS. */ | |
fa8d6e85 | 5533 | |
7088fca9 KL |
5534 | if (TREE_CODE (t) != CONST_DECL) |
5535 | { | |
5536 | tree r; | |
fa8d6e85 | 5537 | |
d479d37f NS |
5538 | /* The the file and line for this declaration, to |
5539 | assist in error message reporting. Since we | |
5540 | called push_tinst_level above, we don't need to | |
5541 | restore these. */ | |
f31686a3 | 5542 | input_location = DECL_SOURCE_LOCATION (t); |
fa8d6e85 | 5543 | |
fb5ce3c9 | 5544 | if (TREE_CODE (t) == TEMPLATE_DECL) |
9579624e | 5545 | ++processing_template_decl; |
7088fca9 | 5546 | r = tsubst (t, args, tf_error | tf_warning, NULL_TREE); |
fb5ce3c9 | 5547 | if (TREE_CODE (t) == TEMPLATE_DECL) |
9579624e | 5548 | --processing_template_decl; |
7088fca9 KL |
5549 | if (TREE_CODE (r) == VAR_DECL) |
5550 | { | |
5551 | tree init; | |
17f29637 | 5552 | |
7088fca9 KL |
5553 | if (DECL_INITIALIZED_IN_CLASS_P (r)) |
5554 | init = tsubst_expr (DECL_INITIAL (t), args, | |
5555 | tf_error | tf_warning, NULL_TREE); | |
5556 | else | |
5557 | init = NULL_TREE; | |
8d08fdba | 5558 | |
8c6ab2db NS |
5559 | finish_static_data_member_decl |
5560 | (r, init, /*asmspec_tree=*/NULL_TREE, /*flags=*/0); | |
8d08fdba | 5561 | |
7088fca9 KL |
5562 | if (DECL_INITIALIZED_IN_CLASS_P (r)) |
5563 | check_static_variable_definition (r, TREE_TYPE (r)); | |
5564 | } | |
5565 | else if (TREE_CODE (r) == FIELD_DECL) | |
5566 | { | |
5567 | /* Determine whether R has a valid type and can be | |
5568 | completed later. If R is invalid, then it is | |
5569 | replaced by error_mark_node so that it will not be | |
5570 | added to TYPE_FIELDS. */ | |
5571 | tree rtype = TREE_TYPE (r); | |
5572 | if (can_complete_type_without_circularity (rtype)) | |
5573 | complete_type (rtype); | |
5574 | ||
5575 | if (!COMPLETE_TYPE_P (rtype)) | |
5576 | { | |
5577 | cxx_incomplete_type_error (r, rtype); | |
5578 | r = error_mark_node; | |
5579 | } | |
5580 | } | |
5566b478 | 5581 | |
7088fca9 KL |
5582 | /* If it is a TYPE_DECL for a class-scoped ENUMERAL_TYPE, |
5583 | such a thing will already have been added to the field | |
5584 | list by tsubst_enum in finish_member_declaration in the | |
5e0c54e5 | 5585 | CLASSTYPE_NESTED_UTDS case above. */ |
7088fca9 KL |
5586 | if (!(TREE_CODE (r) == TYPE_DECL |
5587 | && TREE_CODE (TREE_TYPE (r)) == ENUMERAL_TYPE | |
43b26a01 | 5588 | && DECL_ARTIFICIAL (r))) |
7088fca9 KL |
5589 | { |
5590 | set_current_access_from_decl (r); | |
5591 | finish_member_declaration (r); | |
5592 | } | |
5593 | } | |
5594 | } | |
61fc8c9e | 5595 | } |
7088fca9 KL |
5596 | else |
5597 | { | |
5598 | if (TYPE_P (t) || DECL_CLASS_TEMPLATE_P (t)) | |
5599 | { | |
5600 | /* Build new CLASSTYPE_FRIEND_CLASSES. */ | |
5601 | ||
5602 | tree friend_type = t; | |
5603 | tree new_friend_type; | |
1aed5355 | 5604 | |
7088fca9 KL |
5605 | if (TREE_CODE (friend_type) == TEMPLATE_DECL) |
5606 | new_friend_type = tsubst_friend_class (friend_type, args); | |
5607 | else if (uses_template_parms (friend_type)) | |
5608 | new_friend_type = tsubst (friend_type, args, | |
5609 | tf_error | tf_warning, NULL_TREE); | |
c4d0910c KL |
5610 | else if (CLASSTYPE_USE_TEMPLATE (friend_type)) |
5611 | new_friend_type = friend_type; | |
7088fca9 KL |
5612 | else |
5613 | { | |
5614 | tree ns = decl_namespace_context (TYPE_MAIN_DECL (friend_type)); | |
5615 | ||
5616 | /* The call to xref_tag_from_type does injection for friend | |
5617 | classes. */ | |
5618 | push_nested_namespace (ns); | |
5619 | new_friend_type = | |
5620 | xref_tag_from_type (friend_type, NULL_TREE, 1); | |
5621 | pop_nested_namespace (ns); | |
5622 | } | |
1aed5355 | 5623 | |
7088fca9 KL |
5624 | if (TREE_CODE (friend_type) == TEMPLATE_DECL) |
5625 | /* Trick make_friend_class into realizing that the friend | |
5626 | we're adding is a template, not an ordinary class. It's | |
5627 | important that we use make_friend_class since it will | |
5628 | perform some error-checking and output cross-reference | |
5629 | information. */ | |
5630 | ++processing_template_decl; | |
fc378698 | 5631 | |
7088fca9 | 5632 | if (new_friend_type != error_mark_node) |
19db77ce KL |
5633 | make_friend_class (type, new_friend_type, |
5634 | /*complain=*/false); | |
fc378698 | 5635 | |
7088fca9 KL |
5636 | if (TREE_CODE (friend_type) == TEMPLATE_DECL) |
5637 | --processing_template_decl; | |
5638 | } | |
5639 | else | |
9579624e KL |
5640 | { |
5641 | /* Build new DECL_FRIENDLIST. */ | |
5642 | tree r; | |
5643 | ||
5644 | if (TREE_CODE (t) == TEMPLATE_DECL) | |
5645 | ++processing_template_decl; | |
5646 | r = tsubst_friend_function (t, args); | |
5647 | if (TREE_CODE (t) == TEMPLATE_DECL) | |
5648 | --processing_template_decl; | |
5649 | add_friend (type, r, /*complain=*/false); | |
5650 | } | |
7088fca9 KL |
5651 | } |
5652 | } | |
5566b478 | 5653 | |
61a127b3 MM |
5654 | /* Set the file and line number information to whatever is given for |
5655 | the class itself. This puts error messages involving generated | |
5656 | implicit functions at a predictable point, and the same point | |
5657 | that would be used for non-template classes. */ | |
7088fca9 | 5658 | typedecl = TYPE_MAIN_DECL (type); |
f31686a3 | 5659 | input_location = DECL_SOURCE_LOCATION (typedecl); |
6de9cd9a | 5660 | |
61a127b3 | 5661 | unreverse_member_declarations (type); |
9f33663b | 5662 | finish_struct_1 (type); |
e92cc029 | 5663 | |
5524676d JM |
5664 | /* Clear this now so repo_template_used is happy. */ |
5665 | TYPE_BEING_DEFINED (type) = 0; | |
2604412d | 5666 | repo_template_used (type); |
8d08fdba | 5667 | |
9188c363 MM |
5668 | /* Now that the class is complete, instantiate default arguments for |
5669 | any member functions. We don't do this earlier because the | |
5670 | default arguments may reference members of the class. */ | |
5671 | if (!PRIMARY_TEMPLATE_P (template)) | |
5672 | for (t = TYPE_METHODS (type); t; t = TREE_CHAIN (t)) | |
5673 | if (TREE_CODE (t) == FUNCTION_DECL | |
dc957d14 | 5674 | /* Implicitly generated member functions will not have template |
9188c363 MM |
5675 | information; they are not instantiations, but instead are |
5676 | created "fresh" for each instantiation. */ | |
5677 | && DECL_TEMPLATE_INFO (t)) | |
5678 | tsubst_default_arguments (t); | |
5679 | ||
b74a0560 | 5680 | popclass (); |
5566b478 | 5681 | pop_from_top_level (); |
78757caa | 5682 | pop_deferring_access_checks (); |
5566b478 MS |
5683 | pop_tinst_level (); |
5684 | ||
9aad8f83 MA |
5685 | if (TYPE_CONTAINS_VPTR_P (type)) |
5686 | keyed_classes = tree_cons (NULL_TREE, type, keyed_classes); | |
5687 | ||
5566b478 | 5688 | return type; |
8d08fdba MS |
5689 | } |
5690 | ||
00d3396f | 5691 | static tree |
a91db711 | 5692 | tsubst_template_arg (tree t, tree args, tsubst_flags_t complain, tree in_decl) |
00d3396f | 5693 | { |
a91db711 NS |
5694 | tree r; |
5695 | ||
5696 | if (!t) | |
5697 | r = t; | |
5698 | else if (TYPE_P (t)) | |
5699 | r = tsubst (t, args, complain, in_decl); | |
5700 | else | |
00d3396f | 5701 | { |
a91db711 NS |
5702 | r = tsubst_expr (t, args, complain, in_decl); |
5703 | ||
5704 | if (!uses_template_parms (r)) | |
4d5f3fbd | 5705 | { |
a91db711 NS |
5706 | /* Sometimes, one of the args was an expression involving a |
5707 | template constant parameter, like N - 1. Now that we've | |
5708 | tsubst'd, we might have something like 2 - 1. This will | |
5709 | confuse lookup_template_class, so we do constant folding | |
5710 | here. We have to unset processing_template_decl, to fool | |
5711 | tsubst_copy_and_build() into building an actual tree. */ | |
5712 | ||
5713 | /* If the TREE_TYPE of ARG is not NULL_TREE, ARG is already | |
5714 | as simple as it's going to get, and trying to reprocess | |
5715 | the trees will break. Once tsubst_expr et al DTRT for | |
5716 | non-dependent exprs, this code can go away, as the type | |
5717 | will always be set. */ | |
5718 | if (!TREE_TYPE (r)) | |
5719 | { | |
5720 | int saved_processing_template_decl = processing_template_decl; | |
5721 | processing_template_decl = 0; | |
5722 | r = tsubst_copy_and_build (r, /*args=*/NULL_TREE, | |
5723 | tf_error, /*in_decl=*/NULL_TREE, | |
5724 | /*function_p=*/false); | |
5725 | processing_template_decl = saved_processing_template_decl; | |
5726 | } | |
5727 | r = fold (r); | |
4d5f3fbd | 5728 | } |
bd83b409 | 5729 | } |
a91db711 | 5730 | return r; |
bd83b409 NS |
5731 | } |
5732 | ||
a91db711 | 5733 | /* Substitute ARGS into the vector or list of template arguments T. */ |
830bfa74 | 5734 | |
e9659ab0 | 5735 | static tree |
a91db711 | 5736 | tsubst_template_args (tree t, tree args, tsubst_flags_t complain, tree in_decl) |
830bfa74 | 5737 | { |
bf12d54d | 5738 | int len = TREE_VEC_LENGTH (t); |
a91db711 | 5739 | int need_new = 0, i; |
c68b0a84 | 5740 | tree *elts = alloca (len * sizeof (tree)); |
830bfa74 | 5741 | |
830bfa74 MM |
5742 | for (i = 0; i < len; i++) |
5743 | { | |
bf12d54d NS |
5744 | tree orig_arg = TREE_VEC_ELT (t, i); |
5745 | tree new_arg; | |
a91db711 | 5746 | |
bf12d54d NS |
5747 | if (TREE_CODE (orig_arg) == TREE_VEC) |
5748 | new_arg = tsubst_template_args (orig_arg, args, complain, in_decl); | |
830bfa74 | 5749 | else |
a91db711 | 5750 | new_arg = tsubst_template_arg (orig_arg, args, complain, in_decl); |
830bfa74 | 5751 | |
a91db711 | 5752 | if (new_arg == error_mark_node) |
08e72a19 JM |
5753 | return error_mark_node; |
5754 | ||
a91db711 NS |
5755 | elts[i] = new_arg; |
5756 | if (new_arg != orig_arg) | |
830bfa74 MM |
5757 | need_new = 1; |
5758 | } | |
5759 | ||
5760 | if (!need_new) | |
5761 | return t; | |
a91db711 | 5762 | |
bf12d54d NS |
5763 | t = make_tree_vec (len); |
5764 | for (i = 0; i < len; i++) | |
5765 | TREE_VEC_ELT (t, i) = elts[i]; | |
830bfa74 MM |
5766 | |
5767 | return t; | |
5768 | } | |
5769 | ||
36a117a5 MM |
5770 | /* Return the result of substituting ARGS into the template parameters |
5771 | given by PARMS. If there are m levels of ARGS and m + n levels of | |
5772 | PARMS, then the result will contain n levels of PARMS. For | |
5773 | example, if PARMS is `template <class T> template <class U> | |
5774 | template <T*, U, class V>' and ARGS is {{int}, {double}} then the | |
5775 | result will be `template <int*, double, class V>'. */ | |
5776 | ||
e9659ab0 | 5777 | static tree |
3a978d72 | 5778 | tsubst_template_parms (tree parms, tree args, tsubst_flags_t complain) |
36a117a5 | 5779 | { |
f71f87f9 MM |
5780 | tree r = NULL_TREE; |
5781 | tree* new_parms; | |
36a117a5 MM |
5782 | |
5783 | for (new_parms = &r; | |
5784 | TMPL_PARMS_DEPTH (parms) > TMPL_ARGS_DEPTH (args); | |
5785 | new_parms = &(TREE_CHAIN (*new_parms)), | |
5786 | parms = TREE_CHAIN (parms)) | |
5787 | { | |
5788 | tree new_vec = | |
5789 | make_tree_vec (TREE_VEC_LENGTH (TREE_VALUE (parms))); | |
5790 | int i; | |
5791 | ||
5792 | for (i = 0; i < TREE_VEC_LENGTH (new_vec); ++i) | |
5793 | { | |
833aa4c4 NS |
5794 | tree tuple = TREE_VEC_ELT (TREE_VALUE (parms), i); |
5795 | tree default_value = TREE_PURPOSE (tuple); | |
5796 | tree parm_decl = TREE_VALUE (tuple); | |
5797 | ||
5798 | parm_decl = tsubst (parm_decl, args, complain, NULL_TREE); | |
a91db711 NS |
5799 | default_value = tsubst_template_arg (default_value, args, |
5800 | complain, NULL_TREE); | |
5801 | ||
5802 | tuple = build_tree_list (default_value, parm_decl); | |
833aa4c4 | 5803 | TREE_VEC_ELT (new_vec, i) = tuple; |
36a117a5 MM |
5804 | } |
5805 | ||
5806 | *new_parms = | |
4890c2f4 MM |
5807 | tree_cons (size_int (TMPL_PARMS_DEPTH (parms) |
5808 | - TMPL_ARGS_DEPTH (args)), | |
36a117a5 MM |
5809 | new_vec, NULL_TREE); |
5810 | } | |
5811 | ||
5812 | return r; | |
5813 | } | |
5814 | ||
ed44da02 MM |
5815 | /* Substitute the ARGS into the indicated aggregate (or enumeration) |
5816 | type T. If T is not an aggregate or enumeration type, it is | |
5817 | handled as if by tsubst. IN_DECL is as for tsubst. If | |
838dfd8a | 5818 | ENTERING_SCOPE is nonzero, T is the context for a template which |
dc957d14 | 5819 | we are presently tsubst'ing. Return the substituted value. */ |
36a117a5 | 5820 | |
e9659ab0 | 5821 | static tree |
3a978d72 NN |
5822 | tsubst_aggr_type (tree t, |
5823 | tree args, | |
5824 | tsubst_flags_t complain, | |
5825 | tree in_decl, | |
5826 | int entering_scope) | |
36a117a5 MM |
5827 | { |
5828 | if (t == NULL_TREE) | |
5829 | return NULL_TREE; | |
5830 | ||
5831 | switch (TREE_CODE (t)) | |
5832 | { | |
5833 | case RECORD_TYPE: | |
5834 | if (TYPE_PTRMEMFUNC_P (t)) | |
46c895ac | 5835 | return tsubst (TYPE_PTRMEMFUNC_FN_TYPE (t), args, complain, in_decl); |
36a117a5 | 5836 | |
f4f206f4 | 5837 | /* Else fall through. */ |
ed44da02 | 5838 | case ENUMERAL_TYPE: |
36a117a5 | 5839 | case UNION_TYPE: |
5db698f6 | 5840 | if (TYPE_TEMPLATE_INFO (t)) |
36a117a5 MM |
5841 | { |
5842 | tree argvec; | |
5843 | tree context; | |
5844 | tree r; | |
5845 | ||
5846 | /* First, determine the context for the type we are looking | |
5847 | up. */ | |
4f7847ca NS |
5848 | context = TYPE_CONTEXT (t); |
5849 | if (context) | |
5850 | context = tsubst_aggr_type (context, args, complain, | |
36a117a5 | 5851 | in_decl, /*entering_scope=*/1); |
36a117a5 MM |
5852 | |
5853 | /* Then, figure out what arguments are appropriate for the | |
5854 | type we are trying to find. For example, given: | |
5855 | ||
5856 | template <class T> struct S; | |
5857 | template <class T, class U> void f(T, U) { S<U> su; } | |
5858 | ||
5859 | and supposing that we are instantiating f<int, double>, | |
5860 | then our ARGS will be {int, double}, but, when looking up | |
5861 | S we only want {double}. */ | |
a91db711 NS |
5862 | argvec = tsubst_template_args (TYPE_TI_ARGS (t), args, |
5863 | complain, in_decl); | |
08e72a19 JM |
5864 | if (argvec == error_mark_node) |
5865 | return error_mark_node; | |
36a117a5 MM |
5866 | |
5867 | r = lookup_template_class (t, argvec, in_decl, context, | |
f9c244b8 | 5868 | entering_scope, complain); |
36a117a5 | 5869 | |
c2ea3a40 | 5870 | return cp_build_qualified_type_real (r, TYPE_QUALS (t), complain); |
36a117a5 MM |
5871 | } |
5872 | else | |
5873 | /* This is not a template type, so there's nothing to do. */ | |
5874 | return t; | |
5875 | ||
5876 | default: | |
4393e105 | 5877 | return tsubst (t, args, complain, in_decl); |
36a117a5 MM |
5878 | } |
5879 | } | |
5880 | ||
9188c363 MM |
5881 | /* Substitute into the default argument ARG (a default argument for |
5882 | FN), which has the indicated TYPE. */ | |
5883 | ||
5884 | tree | |
3a978d72 | 5885 | tsubst_default_argument (tree fn, tree type, tree arg) |
9188c363 MM |
5886 | { |
5887 | /* This default argument came from a template. Instantiate the | |
5888 | default argument here, not in tsubst. In the case of | |
5889 | something like: | |
5890 | ||
5891 | template <class T> | |
5892 | struct S { | |
5893 | static T t(); | |
5894 | void f(T = t()); | |
5895 | }; | |
5896 | ||
5897 | we must be careful to do name lookup in the scope of S<T>, | |
a29e1034 JM |
5898 | rather than in the current class. |
5899 | ||
5900 | ??? current_class_type affects a lot more than name lookup. This is | |
5901 | very fragile. Fortunately, it will go away when we do 2-phase name | |
5902 | binding properly. */ | |
2b59fc25 KL |
5903 | |
5904 | /* FN is already the desired FUNCTION_DECL. */ | |
5905 | push_access_scope (fn); | |
c6671cbb MM |
5906 | /* The default argument expression should not be considered to be |
5907 | within the scope of FN. Since push_access_scope sets | |
5908 | current_function_decl, we must explicitly clear it here. */ | |
5909 | current_function_decl = NULL_TREE; | |
9188c363 | 5910 | |
c2ea3a40 NS |
5911 | arg = tsubst_expr (arg, DECL_TI_ARGS (fn), |
5912 | tf_error | tf_warning, NULL_TREE); | |
9188c363 | 5913 | |
2b59fc25 | 5914 | pop_access_scope (fn); |
9188c363 MM |
5915 | |
5916 | /* Make sure the default argument is reasonable. */ | |
5917 | arg = check_default_argument (type, arg); | |
5918 | ||
5919 | return arg; | |
5920 | } | |
5921 | ||
5922 | /* Substitute into all the default arguments for FN. */ | |
5923 | ||
5924 | static void | |
3a978d72 | 5925 | tsubst_default_arguments (tree fn) |
9188c363 MM |
5926 | { |
5927 | tree arg; | |
5928 | tree tmpl_args; | |
5929 | ||
5930 | tmpl_args = DECL_TI_ARGS (fn); | |
5931 | ||
5932 | /* If this function is not yet instantiated, we certainly don't need | |
5933 | its default arguments. */ | |
5934 | if (uses_template_parms (tmpl_args)) | |
5935 | return; | |
5936 | ||
5937 | for (arg = TYPE_ARG_TYPES (TREE_TYPE (fn)); | |
5938 | arg; | |
5939 | arg = TREE_CHAIN (arg)) | |
5940 | if (TREE_PURPOSE (arg)) | |
5941 | TREE_PURPOSE (arg) = tsubst_default_argument (fn, | |
5942 | TREE_VALUE (arg), | |
5943 | TREE_PURPOSE (arg)); | |
5944 | } | |
5945 | ||
ae58fa02 MM |
5946 | /* Substitute the ARGS into the T, which is a _DECL. TYPE is the |
5947 | (already computed) substitution of ARGS into TREE_TYPE (T), if | |
c2ea3a40 NS |
5948 | appropriate. Return the result of the substitution. Issue error |
5949 | and warning messages under control of COMPLAIN. */ | |
00d3396f | 5950 | |
e9659ab0 | 5951 | static tree |
3a978d72 | 5952 | tsubst_decl (tree t, tree args, tree type, tsubst_flags_t complain) |
8d08fdba | 5953 | { |
82a98427 | 5954 | location_t saved_loc; |
b370501f | 5955 | tree r = NULL_TREE; |
4b2811e9 | 5956 | tree in_decl = t; |
830bfa74 | 5957 | |
ae58fa02 | 5958 | /* Set the filename and linenumber to improve error-reporting. */ |
82a98427 | 5959 | saved_loc = input_location; |
f31686a3 | 5960 | input_location = DECL_SOURCE_LOCATION (t); |
b7484fbe | 5961 | |
8d08fdba MS |
5962 | switch (TREE_CODE (t)) |
5963 | { | |
98c1c668 JM |
5964 | case TEMPLATE_DECL: |
5965 | { | |
5966 | /* We can get here when processing a member template function | |
5967 | of a template class. */ | |
98c1c668 | 5968 | tree decl = DECL_TEMPLATE_RESULT (t); |
386b8a85 | 5969 | tree spec; |
db2767b6 | 5970 | int is_template_template_parm = DECL_TEMPLATE_TEMPLATE_PARM_P (t); |
98c1c668 | 5971 | |
db2767b6 MM |
5972 | if (!is_template_template_parm) |
5973 | { | |
36a117a5 MM |
5974 | /* We might already have an instance of this template. |
5975 | The ARGS are for the surrounding class type, so the | |
5976 | full args contain the tsubst'd args for the context, | |
5977 | plus the innermost args from the template decl. */ | |
5978 | tree tmpl_args = DECL_CLASS_TEMPLATE_P (t) | |
5979 | ? CLASSTYPE_TI_ARGS (TREE_TYPE (t)) | |
17aec3eb | 5980 | : DECL_TI_ARGS (DECL_TEMPLATE_RESULT (t)); |
7ddedda4 MM |
5981 | tree full_args; |
5982 | ||
a91db711 NS |
5983 | full_args = tsubst_template_args (tmpl_args, args, |
5984 | complain, in_decl); | |
36a117a5 | 5985 | |
a91db711 | 5986 | /* tsubst_template_args doesn't copy the vector if |
36a117a5 MM |
5987 | nothing changed. But, *something* should have |
5988 | changed. */ | |
5989 | my_friendly_assert (full_args != tmpl_args, 0); | |
5990 | ||
5991 | spec = retrieve_specialization (t, full_args); | |
db2767b6 | 5992 | if (spec != NULL_TREE) |
ae58fa02 MM |
5993 | { |
5994 | r = spec; | |
5995 | break; | |
5996 | } | |
db2767b6 | 5997 | } |
98c1c668 JM |
5998 | |
5999 | /* Make a new template decl. It will be similar to the | |
6000 | original, but will record the current template arguments. | |
6001 | We also create a new function declaration, which is just | |
6002 | like the old one, but points to this new template, rather | |
6003 | than the old one. */ | |
0acf7199 | 6004 | r = copy_decl (t); |
ae58fa02 MM |
6005 | my_friendly_assert (DECL_LANG_SPECIFIC (r) != 0, 0); |
6006 | TREE_CHAIN (r) = NULL_TREE; | |
db2767b6 MM |
6007 | |
6008 | if (is_template_template_parm) | |
6009 | { | |
c2ea3a40 | 6010 | tree new_decl = tsubst (decl, args, complain, in_decl); |
17aec3eb | 6011 | DECL_TEMPLATE_RESULT (r) = new_decl; |
ae58fa02 MM |
6012 | TREE_TYPE (r) = TREE_TYPE (new_decl); |
6013 | break; | |
db2767b6 MM |
6014 | } |
6015 | ||
ae58fa02 | 6016 | DECL_CONTEXT (r) |
4f1c5b7d | 6017 | = tsubst_aggr_type (DECL_CONTEXT (t), args, |
c2ea3a40 | 6018 | complain, in_decl, |
4393e105 | 6019 | /*entering_scope=*/1); |
ae58fa02 | 6020 | DECL_TEMPLATE_INFO (r) = build_tree_list (t, args); |
93cdc044 JM |
6021 | |
6022 | if (TREE_CODE (decl) == TYPE_DECL) | |
6023 | { | |
c2ea3a40 | 6024 | tree new_type = tsubst (TREE_TYPE (t), args, complain, in_decl); |
2620d095 KL |
6025 | if (new_type == error_mark_node) |
6026 | return error_mark_node; | |
6027 | ||
ae58fa02 MM |
6028 | TREE_TYPE (r) = new_type; |
6029 | CLASSTYPE_TI_TEMPLATE (new_type) = r; | |
17aec3eb | 6030 | DECL_TEMPLATE_RESULT (r) = TYPE_MAIN_DECL (new_type); |
ae58fa02 | 6031 | DECL_TI_ARGS (r) = CLASSTYPE_TI_ARGS (new_type); |
93cdc044 JM |
6032 | } |
6033 | else | |
6034 | { | |
c2ea3a40 | 6035 | tree new_decl = tsubst (decl, args, complain, in_decl); |
caec1dc0 KL |
6036 | if (new_decl == error_mark_node) |
6037 | return error_mark_node; | |
17aec3eb RK |
6038 | |
6039 | DECL_TEMPLATE_RESULT (r) = new_decl; | |
ae58fa02 MM |
6040 | DECL_TI_TEMPLATE (new_decl) = r; |
6041 | TREE_TYPE (r) = TREE_TYPE (new_decl); | |
6042 | DECL_TI_ARGS (r) = DECL_TI_ARGS (new_decl); | |
93cdc044 JM |
6043 | } |
6044 | ||
ae58fa02 MM |
6045 | SET_DECL_IMPLICIT_INSTANTIATION (r); |
6046 | DECL_TEMPLATE_INSTANTIATIONS (r) = NULL_TREE; | |
6047 | DECL_TEMPLATE_SPECIALIZATIONS (r) = NULL_TREE; | |
98c1c668 JM |
6048 | |
6049 | /* The template parameters for this new template are all the | |
6050 | template parameters for the old template, except the | |
c6002625 | 6051 | outermost level of parameters. */ |
ae58fa02 | 6052 | DECL_TEMPLATE_PARMS (r) |
4393e105 | 6053 | = tsubst_template_parms (DECL_TEMPLATE_PARMS (t), args, |
c2ea3a40 | 6054 | complain); |
98c1c668 | 6055 | |
93cdc044 | 6056 | if (PRIMARY_TEMPLATE_P (t)) |
ae58fa02 | 6057 | DECL_PRIMARY_TEMPLATE (r) = r; |
93cdc044 | 6058 | |
8c6ab2db NS |
6059 | if (TREE_CODE (decl) != TYPE_DECL) |
6060 | /* Record this non-type partial instantiation. */ | |
6061 | register_specialization (r, t, | |
6062 | DECL_TI_ARGS (DECL_TEMPLATE_RESULT (r))); | |
98c1c668 | 6063 | } |
ae58fa02 | 6064 | break; |
8d08fdba MS |
6065 | |
6066 | case FUNCTION_DECL: | |
6067 | { | |
386b8a85 | 6068 | tree ctx; |
87603ed0 | 6069 | tree argvec = NULL_TREE; |
cf38f48a | 6070 | tree *friends; |
36a117a5 | 6071 | tree gen_tmpl; |
5566b478 | 6072 | int member; |
d8c4447d MM |
6073 | int args_depth; |
6074 | int parms_depth; | |
5566b478 | 6075 | |
36a117a5 MM |
6076 | /* Nobody should be tsubst'ing into non-template functions. */ |
6077 | my_friendly_assert (DECL_TEMPLATE_INFO (t) != NULL_TREE, 0); | |
6078 | ||
6079 | if (TREE_CODE (DECL_TI_TEMPLATE (t)) == TEMPLATE_DECL) | |
6080 | { | |
6081 | tree spec; | |
00cf3e31 MM |
6082 | bool dependent_p; |
6083 | ||
6084 | /* If T is not dependent, just return it. We have to | |
6085 | increment PROCESSING_TEMPLATE_DECL because | |
6086 | value_dependent_expression_p assumes that nothing is | |
6087 | dependent when PROCESSING_TEMPLATE_DECL is zero. */ | |
6088 | ++processing_template_decl; | |
6089 | dependent_p = value_dependent_expression_p (t); | |
6090 | --processing_template_decl; | |
6091 | if (!dependent_p) | |
6092 | return t; | |
36a117a5 MM |
6093 | |
6094 | /* Calculate the most general template of which R is a | |
6095 | specialization, and the complete set of arguments used to | |
6096 | specialize R. */ | |
6097 | gen_tmpl = most_general_template (DECL_TI_TEMPLATE (t)); | |
a91db711 NS |
6098 | argvec = tsubst_template_args (DECL_TI_ARGS |
6099 | (DECL_TEMPLATE_RESULT (gen_tmpl)), | |
6100 | args, complain, in_decl); | |
36a117a5 MM |
6101 | |
6102 | /* Check to see if we already have this specialization. */ | |
6103 | spec = retrieve_specialization (gen_tmpl, argvec); | |
7ddedda4 | 6104 | |
36a117a5 | 6105 | if (spec) |
ae58fa02 MM |
6106 | { |
6107 | r = spec; | |
6108 | break; | |
6109 | } | |
d8c4447d | 6110 | |
f9a7ae04 MM |
6111 | /* We can see more levels of arguments than parameters if |
6112 | there was a specialization of a member template, like | |
6113 | this: | |
6114 | ||
6115 | template <class T> struct S { template <class U> void f(); } | |
6116 | template <> template <class U> void S<int>::f(U); | |
6117 | ||
dc957d14 | 6118 | Here, we'll be substituting into the specialization, |
f9a7ae04 MM |
6119 | because that's where we can find the code we actually |
6120 | want to generate, but we'll have enough arguments for | |
6121 | the most general template. | |
6122 | ||
6123 | We also deal with the peculiar case: | |
d8c4447d MM |
6124 | |
6125 | template <class T> struct S { | |
6126 | template <class U> friend void f(); | |
6127 | }; | |
74b846e0 | 6128 | template <class U> void f() {} |
d8c4447d MM |
6129 | template S<int>; |
6130 | template void f<double>(); | |
6131 | ||
6132 | Here, the ARGS for the instantiation of will be {int, | |
6133 | double}. But, we only need as many ARGS as there are | |
6134 | levels of template parameters in CODE_PATTERN. We are | |
6135 | careful not to get fooled into reducing the ARGS in | |
6136 | situations like: | |
6137 | ||
6138 | template <class T> struct S { template <class U> void f(U); } | |
6139 | template <class T> template <> void S<T>::f(int) {} | |
6140 | ||
6141 | which we can spot because the pattern will be a | |
6142 | specialization in this case. */ | |
6143 | args_depth = TMPL_ARGS_DEPTH (args); | |
6144 | parms_depth = | |
6145 | TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (DECL_TI_TEMPLATE (t))); | |
6146 | if (args_depth > parms_depth | |
6147 | && !DECL_TEMPLATE_SPECIALIZATION (t)) | |
f9a7ae04 | 6148 | args = get_innermost_template_args (args, parms_depth); |
36a117a5 MM |
6149 | } |
6150 | else | |
6151 | { | |
6152 | /* This special case arises when we have something like this: | |
6153 | ||
6154 | template <class T> struct S { | |
6155 | friend void f<int>(int, double); | |
6156 | }; | |
6157 | ||
6158 | Here, the DECL_TI_TEMPLATE for the friend declaration | |
10b1d5e7 MM |
6159 | will be an IDENTIFIER_NODE. We are being called from |
6160 | tsubst_friend_function, and we want only to create a | |
6161 | new decl (R) with appropriate types so that we can call | |
6162 | determine_specialization. */ | |
36a117a5 MM |
6163 | gen_tmpl = NULL_TREE; |
6164 | } | |
6165 | ||
6eb3bb27 | 6166 | if (DECL_CLASS_SCOPE_P (t)) |
8d08fdba | 6167 | { |
5566b478 MS |
6168 | if (DECL_NAME (t) == constructor_name (DECL_CONTEXT (t))) |
6169 | member = 2; | |
6170 | else | |
6171 | member = 1; | |
4f1c5b7d | 6172 | ctx = tsubst_aggr_type (DECL_CONTEXT (t), args, |
8c6ab2db | 6173 | complain, t, /*entering_scope=*/1); |
5566b478 MS |
6174 | } |
6175 | else | |
6176 | { | |
6177 | member = 0; | |
4f1c5b7d | 6178 | ctx = DECL_CONTEXT (t); |
5566b478 | 6179 | } |
c2ea3a40 | 6180 | type = tsubst (type, args, complain, in_decl); |
b3da7bb1 MM |
6181 | if (type == error_mark_node) |
6182 | return error_mark_node; | |
8d08fdba | 6183 | |
5566b478 MS |
6184 | /* We do NOT check for matching decls pushed separately at this |
6185 | point, as they may not represent instantiations of this | |
6186 | template, and in any case are considered separate under the | |
0a7394bc | 6187 | discrete model. */ |
0acf7199 | 6188 | r = copy_decl (t); |
e1467ff2 | 6189 | DECL_USE_TEMPLATE (r) = 0; |
5566b478 | 6190 | TREE_TYPE (r) = type; |
92643fea MM |
6191 | /* Clear out the mangled name and RTL for the instantiation. */ |
6192 | SET_DECL_ASSEMBLER_NAME (r, NULL_TREE); | |
6193 | SET_DECL_RTL (r, NULL_RTX); | |
5bd61841 | 6194 | DECL_INITIAL (r) = NULL_TREE; |
4f1c5b7d | 6195 | DECL_CONTEXT (r) = ctx; |
5566b478 | 6196 | |
1f6e1acc | 6197 | if (member && DECL_CONV_FN_P (r)) |
1f84ec23 MM |
6198 | /* Type-conversion operator. Reconstruct the name, in |
6199 | case it's the name of one of the template's parameters. */ | |
6200 | DECL_NAME (r) = mangle_conv_op_name_for_type (TREE_TYPE (type)); | |
5566b478 | 6201 | |
4393e105 | 6202 | DECL_ARGUMENTS (r) = tsubst (DECL_ARGUMENTS (t), args, |
c2ea3a40 | 6203 | complain, t); |
477f6664 | 6204 | DECL_RESULT (r) = NULL_TREE; |
711734a9 JM |
6205 | |
6206 | TREE_STATIC (r) = 0; | |
6207 | TREE_PUBLIC (r) = TREE_PUBLIC (t); | |
6208 | DECL_EXTERNAL (r) = 1; | |
6209 | DECL_INTERFACE_KNOWN (r) = 0; | |
6210 | DECL_DEFER_OUTPUT (r) = 0; | |
6211 | TREE_CHAIN (r) = NULL_TREE; | |
6212 | DECL_PENDING_INLINE_INFO (r) = 0; | |
59026e79 | 6213 | DECL_PENDING_INLINE_P (r) = 0; |
655dc6ee | 6214 | DECL_SAVED_TREE (r) = NULL_TREE; |
711734a9 | 6215 | TREE_USED (r) = 0; |
db9b2174 MM |
6216 | if (DECL_CLONED_FUNCTION (r)) |
6217 | { | |
6218 | DECL_CLONED_FUNCTION (r) = tsubst (DECL_CLONED_FUNCTION (t), | |
c2ea3a40 | 6219 | args, complain, t); |
db9b2174 MM |
6220 | TREE_CHAIN (r) = TREE_CHAIN (DECL_CLONED_FUNCTION (r)); |
6221 | TREE_CHAIN (DECL_CLONED_FUNCTION (r)) = r; | |
6222 | } | |
711734a9 | 6223 | |
92643fea MM |
6224 | /* Set up the DECL_TEMPLATE_INFO for R. There's no need to do |
6225 | this in the special friend case mentioned above where | |
6226 | GEN_TMPL is NULL. */ | |
36a117a5 | 6227 | if (gen_tmpl) |
386b8a85 | 6228 | { |
36a117a5 | 6229 | DECL_TEMPLATE_INFO (r) |
e1b3e07d | 6230 | = tree_cons (gen_tmpl, argvec, NULL_TREE); |
36a117a5 MM |
6231 | SET_DECL_IMPLICIT_INSTANTIATION (r); |
6232 | register_specialization (r, gen_tmpl, argvec); | |
6233 | ||
9188c363 MM |
6234 | /* We're not supposed to instantiate default arguments |
6235 | until they are called, for a template. But, for a | |
6236 | declaration like: | |
6237 | ||
6238 | template <class T> void f () | |
6239 | { extern void g(int i = T()); } | |
6240 | ||
6241 | we should do the substitution when the template is | |
6242 | instantiated. We handle the member function case in | |
6243 | instantiate_class_template since the default arguments | |
6244 | might refer to other members of the class. */ | |
6245 | if (!member | |
6246 | && !PRIMARY_TEMPLATE_P (gen_tmpl) | |
6247 | && !uses_template_parms (argvec)) | |
6248 | tsubst_default_arguments (r); | |
386b8a85 | 6249 | } |
f181d4ae | 6250 | |
cf38f48a MM |
6251 | /* Copy the list of befriending classes. */ |
6252 | for (friends = &DECL_BEFRIENDING_CLASSES (r); | |
6253 | *friends; | |
6254 | friends = &TREE_CHAIN (*friends)) | |
6255 | { | |
6256 | *friends = copy_node (*friends); | |
6257 | TREE_VALUE (*friends) = tsubst (TREE_VALUE (*friends), | |
c2ea3a40 | 6258 | args, complain, |
cf38f48a MM |
6259 | in_decl); |
6260 | } | |
6261 | ||
212e7048 | 6262 | if (DECL_CONSTRUCTOR_P (r) || DECL_DESTRUCTOR_P (r)) |
f181d4ae MM |
6263 | { |
6264 | maybe_retrofit_in_chrg (r); | |
212e7048 MM |
6265 | if (DECL_CONSTRUCTOR_P (r)) |
6266 | grok_ctor_properties (ctx, r); | |
2be678ff JM |
6267 | /* If this is an instantiation of a member template, clone it. |
6268 | If it isn't, that'll be handled by | |
6269 | clone_constructors_and_destructors. */ | |
5e818b93 | 6270 | if (PRIMARY_TEMPLATE_P (gen_tmpl)) |
271e6f02 | 6271 | clone_function_decl (r, /*update_method_vec_p=*/0); |
f181d4ae | 6272 | } |
596ea4e5 | 6273 | else if (IDENTIFIER_OPNAME_P (DECL_NAME (r))) |
4b0d3cbe MM |
6274 | grok_op_properties (r, DECL_FRIEND_P (r), |
6275 | (complain & tf_error) != 0); | |
c8b2e872 MM |
6276 | |
6277 | if (DECL_FRIEND_P (t) && DECL_FRIEND_CONTEXT (t)) | |
6278 | SET_DECL_FRIEND_CONTEXT (r, | |
6279 | tsubst (DECL_FRIEND_CONTEXT (t), | |
6280 | args, complain, in_decl)); | |
8d08fdba | 6281 | } |
ae58fa02 | 6282 | break; |
8d08fdba MS |
6283 | |
6284 | case PARM_DECL: | |
6285 | { | |
ae58fa02 | 6286 | r = copy_node (t); |
833aa4c4 NS |
6287 | if (DECL_TEMPLATE_PARM_P (t)) |
6288 | SET_DECL_TEMPLATE_PARM_P (r); | |
8e51619a | 6289 | |
5566b478 | 6290 | TREE_TYPE (r) = type; |
89d684bb | 6291 | c_apply_type_quals_to_decl (cp_type_quals (type), r); |
1b8899d1 | 6292 | |
560ad596 MM |
6293 | if (DECL_INITIAL (r)) |
6294 | { | |
6295 | if (TREE_CODE (DECL_INITIAL (r)) != TEMPLATE_PARM_INDEX) | |
6296 | DECL_INITIAL (r) = TREE_TYPE (r); | |
6297 | else | |
6298 | DECL_INITIAL (r) = tsubst (DECL_INITIAL (r), args, | |
6299 | complain, in_decl); | |
6300 | } | |
db2767b6 | 6301 | |
5566b478 | 6302 | DECL_CONTEXT (r) = NULL_TREE; |
8e51619a JM |
6303 | |
6304 | if (!DECL_TEMPLATE_PARM_P (r)) | |
6305 | DECL_ARG_TYPE (r) = type_passed_as (type); | |
8d08fdba | 6306 | if (TREE_CHAIN (t)) |
4393e105 | 6307 | TREE_CHAIN (r) = tsubst (TREE_CHAIN (t), args, |
c2ea3a40 | 6308 | complain, TREE_CHAIN (t)); |
8d08fdba | 6309 | } |
ae58fa02 | 6310 | break; |
8d08fdba | 6311 | |
5566b478 MS |
6312 | case FIELD_DECL: |
6313 | { | |
0acf7199 | 6314 | r = copy_decl (t); |
1b8899d1 | 6315 | TREE_TYPE (r) = type; |
89d684bb | 6316 | c_apply_type_quals_to_decl (cp_type_quals (type), r); |
1b8899d1 MM |
6317 | |
6318 | /* We don't have to set DECL_CONTEXT here; it is set by | |
6319 | finish_member_declaration. */ | |
4393e105 | 6320 | DECL_INITIAL (r) = tsubst_expr (DECL_INITIAL (t), args, |
c2ea3a40 | 6321 | complain, in_decl); |
5566b478 | 6322 | TREE_CHAIN (r) = NULL_TREE; |
dfbb4f34 NS |
6323 | if (VOID_TYPE_P (type)) |
6324 | cp_error_at ("instantiation of `%D' as type `%T'", r, type); | |
5566b478 | 6325 | } |
ae58fa02 | 6326 | break; |
5566b478 MS |
6327 | |
6328 | case USING_DECL: | |
6329 | { | |
ae58fa02 | 6330 | r = copy_node (t); |
fd9aef9d NS |
6331 | /* It is not a dependent using decl any more. */ |
6332 | TREE_TYPE (r) = void_type_node; | |
5566b478 | 6333 | DECL_INITIAL (r) |
c2ea3a40 | 6334 | = tsubst_copy (DECL_INITIAL (t), args, complain, in_decl); |
53400b9e GB |
6335 | DECL_NAME (r) |
6336 | = tsubst_copy (DECL_NAME (t), args, complain, in_decl); | |
5566b478 | 6337 | TREE_CHAIN (r) = NULL_TREE; |
5566b478 | 6338 | } |
ae58fa02 | 6339 | break; |
5566b478 | 6340 | |
9188c363 | 6341 | case TYPE_DECL: |
88e1b92a JM |
6342 | if (TREE_CODE (type) == TEMPLATE_TEMPLATE_PARM |
6343 | || t == TYPE_MAIN_DECL (TREE_TYPE (t))) | |
9188c363 | 6344 | { |
88e1b92a JM |
6345 | /* If this is the canonical decl, we don't have to mess with |
6346 | instantiations, and often we can't (for typename, template | |
6347 | type parms and such). Note that TYPE_NAME is not correct for | |
6348 | the above test if we've copied the type for a typedef. */ | |
b9f39201 | 6349 | r = TYPE_NAME (type); |
9188c363 MM |
6350 | break; |
6351 | } | |
6352 | ||
6353 | /* Fall through. */ | |
6354 | ||
5566b478 MS |
6355 | case VAR_DECL: |
6356 | { | |
1cea0434 KG |
6357 | tree argvec = NULL_TREE; |
6358 | tree gen_tmpl = NULL_TREE; | |
36a117a5 | 6359 | tree spec; |
1cea0434 | 6360 | tree tmpl = NULL_TREE; |
9188c363 | 6361 | tree ctx; |
6dfbb909 | 6362 | int local_p; |
9188c363 | 6363 | |
6dfbb909 MM |
6364 | /* Assume this is a non-local variable. */ |
6365 | local_p = 0; | |
5566b478 | 6366 | |
de96bf57 | 6367 | if (TYPE_P (CP_DECL_CONTEXT (t))) |
9188c363 | 6368 | ctx = tsubst_aggr_type (DECL_CONTEXT (t), args, |
c2ea3a40 | 6369 | complain, |
9188c363 | 6370 | in_decl, /*entering_scope=*/1); |
2ba9c47e MM |
6371 | else if (DECL_NAMESPACE_SCOPE_P (t)) |
6372 | ctx = DECL_CONTEXT (t); | |
9188c363 | 6373 | else |
6dfbb909 MM |
6374 | { |
6375 | /* Subsequent calls to pushdecl will fill this in. */ | |
6376 | ctx = NULL_TREE; | |
2ba9c47e | 6377 | local_p = 1; |
6dfbb909 | 6378 | } |
9188c363 | 6379 | |
36a117a5 | 6380 | /* Check to see if we already have this specialization. */ |
6dfbb909 MM |
6381 | if (!local_p) |
6382 | { | |
6383 | tmpl = DECL_TI_TEMPLATE (t); | |
6384 | gen_tmpl = most_general_template (tmpl); | |
c2ea3a40 | 6385 | argvec = tsubst (DECL_TI_ARGS (t), args, complain, in_decl); |
6dfbb909 MM |
6386 | spec = retrieve_specialization (gen_tmpl, argvec); |
6387 | } | |
9188c363 | 6388 | else |
6dfbb909 | 6389 | spec = retrieve_local_specialization (t); |
9188c363 | 6390 | |
36a117a5 | 6391 | if (spec) |
ae58fa02 MM |
6392 | { |
6393 | r = spec; | |
6394 | break; | |
6395 | } | |
5566b478 | 6396 | |
0acf7199 | 6397 | r = copy_decl (t); |
edebf865 | 6398 | if (TREE_CODE (r) == VAR_DECL) |
39703eb9 MM |
6399 | { |
6400 | type = complete_type (type); | |
6401 | DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (r) | |
6402 | = DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (t); | |
6403 | } | |
a3d87771 MM |
6404 | else if (DECL_SELF_REFERENCE_P (t)) |
6405 | SET_DECL_SELF_REFERENCE_P (r); | |
01f4137f | 6406 | TREE_TYPE (r) = type; |
89d684bb | 6407 | c_apply_type_quals_to_decl (cp_type_quals (type), r); |
5566b478 | 6408 | DECL_CONTEXT (r) = ctx; |
92643fea MM |
6409 | /* Clear out the mangled name and RTL for the instantiation. */ |
6410 | SET_DECL_ASSEMBLER_NAME (r, NULL_TREE); | |
6411 | SET_DECL_RTL (r, NULL_RTX); | |
d11ad92e MS |
6412 | |
6413 | /* Don't try to expand the initializer until someone tries to use | |
6414 | this variable; otherwise we run into circular dependencies. */ | |
6415 | DECL_INITIAL (r) = NULL_TREE; | |
19e7881c | 6416 | SET_DECL_RTL (r, NULL_RTX); |
06ceef4e | 6417 | DECL_SIZE (r) = DECL_SIZE_UNIT (r) = 0; |
5566b478 | 6418 | |
e0942dcd MM |
6419 | /* Even if the original location is out of scope, the newly |
6420 | substituted one is not. */ | |
6421 | if (TREE_CODE (r) == VAR_DECL) | |
17bbb839 MM |
6422 | { |
6423 | DECL_DEAD_FOR_LOCAL (r) = 0; | |
6424 | DECL_INITIALIZED_P (r) = 0; | |
6425 | } | |
e0942dcd | 6426 | |
6dfbb909 MM |
6427 | if (!local_p) |
6428 | { | |
6429 | /* A static data member declaration is always marked | |
6430 | external when it is declared in-class, even if an | |
6431 | initializer is present. We mimic the non-template | |
6432 | processing here. */ | |
6433 | DECL_EXTERNAL (r) = 1; | |
fa8d6e85 | 6434 | |
6dfbb909 MM |
6435 | register_specialization (r, gen_tmpl, argvec); |
6436 | DECL_TEMPLATE_INFO (r) = tree_cons (tmpl, argvec, NULL_TREE); | |
6437 | SET_DECL_IMPLICIT_INSTANTIATION (r); | |
6438 | } | |
9188c363 | 6439 | else |
6dfbb909 | 6440 | register_local_specialization (r, t); |
5566b478 | 6441 | |
5566b478 | 6442 | TREE_CHAIN (r) = NULL_TREE; |
dfbb4f34 NS |
6443 | if (TREE_CODE (r) == VAR_DECL && VOID_TYPE_P (type)) |
6444 | cp_error_at ("instantiation of `%D' as type `%T'", r, type); | |
edebf865 MM |
6445 | /* Compute the size, alignment, etc. of R. */ |
6446 | layout_decl (r, 0); | |
5566b478 | 6447 | } |
ae58fa02 | 6448 | break; |
5566b478 | 6449 | |
ae58fa02 | 6450 | default: |
a98facb0 | 6451 | abort (); |
ae58fa02 MM |
6452 | } |
6453 | ||
6454 | /* Restore the file and line information. */ | |
82a98427 | 6455 | input_location = saved_loc; |
ae58fa02 MM |
6456 | |
6457 | return r; | |
6458 | } | |
6459 | ||
34cd5ae7 | 6460 | /* Substitute into the ARG_TYPES of a function type. */ |
cabc336a | 6461 | |
e9659ab0 | 6462 | static tree |
3a978d72 NN |
6463 | tsubst_arg_types (tree arg_types, |
6464 | tree args, | |
6465 | tsubst_flags_t complain, | |
6466 | tree in_decl) | |
cabc336a MM |
6467 | { |
6468 | tree remaining_arg_types; | |
cabc336a MM |
6469 | tree type; |
6470 | ||
6471 | if (!arg_types || arg_types == void_list_node) | |
6472 | return arg_types; | |
6473 | ||
6474 | remaining_arg_types = tsubst_arg_types (TREE_CHAIN (arg_types), | |
4393e105 MM |
6475 | args, complain, in_decl); |
6476 | if (remaining_arg_types == error_mark_node) | |
6477 | return error_mark_node; | |
6478 | ||
6479 | type = tsubst (TREE_VALUE (arg_types), args, complain, in_decl); | |
6480 | if (type == error_mark_node) | |
6481 | return error_mark_node; | |
4b2811e9 NS |
6482 | if (VOID_TYPE_P (type)) |
6483 | { | |
c2ea3a40 | 6484 | if (complain & tf_error) |
4b2811e9 | 6485 | { |
33bd39a2 | 6486 | error ("invalid parameter type `%T'", type); |
4b2811e9 NS |
6487 | if (in_decl) |
6488 | cp_error_at ("in declaration `%D'", in_decl); | |
6489 | } | |
6490 | return error_mark_node; | |
6491 | } | |
cabc336a | 6492 | |
4393e105 MM |
6493 | /* Do array-to-pointer, function-to-pointer conversion, and ignore |
6494 | top-level qualifiers as required. */ | |
6495 | type = TYPE_MAIN_VARIANT (type_decays_to (type)); | |
cabc336a MM |
6496 | |
6497 | /* Note that we do not substitute into default arguments here. The | |
6498 | standard mandates that they be instantiated only when needed, | |
6499 | which is done in build_over_call. */ | |
51632249 JM |
6500 | return hash_tree_cons (TREE_PURPOSE (arg_types), type, |
6501 | remaining_arg_types); | |
cabc336a MM |
6502 | |
6503 | } | |
6504 | ||
4393e105 MM |
6505 | /* Substitute into a FUNCTION_TYPE or METHOD_TYPE. This routine does |
6506 | *not* handle the exception-specification for FNTYPE, because the | |
6507 | initial substitution of explicitly provided template parameters | |
6508 | during argument deduction forbids substitution into the | |
6509 | exception-specification: | |
6510 | ||
6511 | [temp.deduct] | |
6512 | ||
6513 | All references in the function type of the function template to the | |
6514 | corresponding template parameters are replaced by the specified tem- | |
6515 | plate argument values. If a substitution in a template parameter or | |
6516 | in the function type of the function template results in an invalid | |
6517 | type, type deduction fails. [Note: The equivalent substitution in | |
6518 | exception specifications is done only when the function is instanti- | |
6519 | ated, at which point a program is ill-formed if the substitution | |
6520 | results in an invalid type.] */ | |
6521 | ||
6522 | static tree | |
3a978d72 NN |
6523 | tsubst_function_type (tree t, |
6524 | tree args, | |
6525 | tsubst_flags_t complain, | |
6526 | tree in_decl) | |
4393e105 MM |
6527 | { |
6528 | tree return_type; | |
6529 | tree arg_types; | |
6530 | tree fntype; | |
6531 | ||
8dd3f57a | 6532 | /* The TYPE_CONTEXT is not used for function/method types. */ |
4393e105 MM |
6533 | my_friendly_assert (TYPE_CONTEXT (t) == NULL_TREE, 0); |
6534 | ||
46c895ac | 6535 | /* Substitute the return type. */ |
4393e105 MM |
6536 | return_type = tsubst (TREE_TYPE (t), args, complain, in_decl); |
6537 | if (return_type == error_mark_node) | |
6538 | return error_mark_node; | |
6539 | ||
34cd5ae7 | 6540 | /* Substitute the argument types. */ |
4393e105 MM |
6541 | arg_types = tsubst_arg_types (TYPE_ARG_TYPES (t), args, |
6542 | complain, in_decl); | |
6543 | if (arg_types == error_mark_node) | |
6544 | return error_mark_node; | |
6545 | ||
6546 | /* Construct a new type node and return it. */ | |
6547 | if (TREE_CODE (t) == FUNCTION_TYPE) | |
6548 | fntype = build_function_type (return_type, arg_types); | |
6549 | else | |
6550 | { | |
6551 | tree r = TREE_TYPE (TREE_VALUE (arg_types)); | |
6552 | if (! IS_AGGR_TYPE (r)) | |
6553 | { | |
6554 | /* [temp.deduct] | |
6555 | ||
6556 | Type deduction may fail for any of the following | |
6557 | reasons: | |
6558 | ||
6559 | -- Attempting to create "pointer to member of T" when T | |
6560 | is not a class type. */ | |
c2ea3a40 | 6561 | if (complain & tf_error) |
33bd39a2 | 6562 | error ("creating pointer to member function of non-class type `%T'", |
4393e105 MM |
6563 | r); |
6564 | return error_mark_node; | |
6565 | } | |
6566 | ||
43dc123f MM |
6567 | fntype = build_method_type_directly (r, return_type, |
6568 | TREE_CHAIN (arg_types)); | |
4393e105 | 6569 | } |
c2ea3a40 | 6570 | fntype = cp_build_qualified_type_real (fntype, TYPE_QUALS (t), complain); |
e9525111 | 6571 | fntype = cp_build_type_attribute_variant (fntype, TYPE_ATTRIBUTES (t)); |
4393e105 MM |
6572 | |
6573 | return fntype; | |
6574 | } | |
6575 | ||
297e73d8 MM |
6576 | /* Substitute into the PARMS of a call-declarator. */ |
6577 | ||
e9659ab0 | 6578 | static tree |
3a978d72 NN |
6579 | tsubst_call_declarator_parms (tree parms, |
6580 | tree args, | |
6581 | tsubst_flags_t complain, | |
6582 | tree in_decl) | |
297e73d8 MM |
6583 | { |
6584 | tree new_parms; | |
6585 | tree type; | |
6586 | tree defarg; | |
6587 | ||
6588 | if (!parms || parms == void_list_node) | |
6589 | return parms; | |
6590 | ||
6591 | new_parms = tsubst_call_declarator_parms (TREE_CHAIN (parms), | |
4393e105 | 6592 | args, complain, in_decl); |
297e73d8 MM |
6593 | |
6594 | /* Figure out the type of this parameter. */ | |
4393e105 | 6595 | type = tsubst (TREE_VALUE (parms), args, complain, in_decl); |
297e73d8 MM |
6596 | |
6597 | /* Figure out the default argument as well. Note that we use | |
4393e105 MM |
6598 | tsubst_expr since the default argument is really an expression. */ |
6599 | defarg = tsubst_expr (TREE_PURPOSE (parms), args, complain, in_decl); | |
297e73d8 MM |
6600 | |
6601 | /* Chain this parameter on to the front of those we have already | |
6602 | processed. We don't use hash_tree_cons because that function | |
6603 | doesn't check TREE_PARMLIST. */ | |
6604 | new_parms = tree_cons (defarg, type, new_parms); | |
6605 | ||
6606 | /* And note that these are parameters. */ | |
6607 | TREE_PARMLIST (new_parms) = 1; | |
6608 | ||
6609 | return new_parms; | |
6610 | } | |
6611 | ||
4393e105 MM |
6612 | /* Take the tree structure T and replace template parameters used |
6613 | therein with the argument vector ARGS. IN_DECL is an associated | |
6614 | decl for diagnostics. If an error occurs, returns ERROR_MARK_NODE. | |
c2ea3a40 NS |
6615 | Issue error and warning messages under control of COMPLAIN. Note |
6616 | that we must be relatively non-tolerant of extensions here, in | |
6617 | order to preserve conformance; if we allow substitutions that | |
6618 | should not be allowed, we may allow argument deductions that should | |
6619 | not succeed, and therefore report ambiguous overload situations | |
6620 | where there are none. In theory, we could allow the substitution, | |
6621 | but indicate that it should have failed, and allow our caller to | |
6622 | make sure that the right thing happens, but we don't try to do this | |
6623 | yet. | |
4393e105 MM |
6624 | |
6625 | This function is used for dealing with types, decls and the like; | |
6626 | for expressions, use tsubst_expr or tsubst_copy. */ | |
ae58fa02 | 6627 | |
14d22dd6 | 6628 | static tree |
3a978d72 | 6629 | tsubst (tree t, tree args, tsubst_flags_t complain, tree in_decl) |
ae58fa02 | 6630 | { |
0ecfe0b4 | 6631 | tree type, r; |
ae58fa02 MM |
6632 | |
6633 | if (t == NULL_TREE || t == error_mark_node | |
6634 | || t == integer_type_node | |
6635 | || t == void_type_node | |
6636 | || t == char_type_node | |
6637 | || TREE_CODE (t) == NAMESPACE_DECL) | |
6638 | return t; | |
6639 | ||
6640 | if (TREE_CODE (t) == IDENTIFIER_NODE) | |
6641 | type = IDENTIFIER_TYPE_VALUE (t); | |
6642 | else | |
6643 | type = TREE_TYPE (t); | |
399dedb9 | 6644 | |
fd9aef9d | 6645 | my_friendly_assert (type != unknown_type_node, 20030716); |
ae58fa02 MM |
6646 | |
6647 | if (type && TREE_CODE (t) != FUNCTION_DECL | |
6648 | && TREE_CODE (t) != TYPENAME_TYPE | |
6649 | && TREE_CODE (t) != TEMPLATE_DECL | |
4393e105 MM |
6650 | && TREE_CODE (t) != IDENTIFIER_NODE |
6651 | && TREE_CODE (t) != FUNCTION_TYPE | |
6652 | && TREE_CODE (t) != METHOD_TYPE) | |
6653 | type = tsubst (type, args, complain, in_decl); | |
6654 | if (type == error_mark_node) | |
6655 | return error_mark_node; | |
ae58fa02 | 6656 | |
2f939d94 | 6657 | if (DECL_P (t)) |
c2ea3a40 | 6658 | return tsubst_decl (t, args, type, complain); |
ae58fa02 MM |
6659 | |
6660 | switch (TREE_CODE (t)) | |
6661 | { | |
6662 | case RECORD_TYPE: | |
6663 | case UNION_TYPE: | |
6664 | case ENUMERAL_TYPE: | |
4393e105 MM |
6665 | return tsubst_aggr_type (t, args, complain, in_decl, |
6666 | /*entering_scope=*/0); | |
ae58fa02 MM |
6667 | |
6668 | case ERROR_MARK: | |
6669 | case IDENTIFIER_NODE: | |
ae58fa02 MM |
6670 | case VOID_TYPE: |
6671 | case REAL_TYPE: | |
6672 | case COMPLEX_TYPE: | |
c00996a3 | 6673 | case VECTOR_TYPE: |
ae58fa02 MM |
6674 | case BOOLEAN_TYPE: |
6675 | case INTEGER_CST: | |
6676 | case REAL_CST: | |
6677 | case STRING_CST: | |
6678 | return t; | |
6679 | ||
6680 | case INTEGER_TYPE: | |
6681 | if (t == integer_type_node) | |
6682 | return t; | |
6683 | ||
6684 | if (TREE_CODE (TYPE_MIN_VALUE (t)) == INTEGER_CST | |
6685 | && TREE_CODE (TYPE_MAX_VALUE (t)) == INTEGER_CST) | |
6686 | return t; | |
d2e5ee5c | 6687 | |
5566b478 | 6688 | { |
ddce3528 | 6689 | tree max, omax = TREE_OPERAND (TYPE_MAX_VALUE (t), 0); |
7ddedda4 | 6690 | |
a91db711 NS |
6691 | /* The array dimension behaves like a non-type template arg, |
6692 | in that we want to fold it as much as possible. */ | |
6693 | max = tsubst_template_arg (omax, args, complain, in_decl); | |
fc611ce0 | 6694 | if (!processing_template_decl) |
8dd3f57a MM |
6695 | max = decl_constant_value (max); |
6696 | ||
ddce3528 JM |
6697 | if (integer_zerop (omax)) |
6698 | { | |
6699 | /* Still allow an explicit array of size zero. */ | |
6700 | if (pedantic) | |
6701 | pedwarn ("creating array with size zero"); | |
6702 | } | |
07c88314 MM |
6703 | else if (integer_zerop (max) |
6704 | || (TREE_CODE (max) == INTEGER_CST | |
6705 | && INT_CST_LT (max, integer_zero_node))) | |
0ecfe0b4 | 6706 | { |
4393e105 MM |
6707 | /* [temp.deduct] |
6708 | ||
6709 | Type deduction may fail for any of the following | |
6710 | reasons: | |
6711 | ||
bf8f3f93 MM |
6712 | Attempting to create an array with a size that is |
6713 | zero or negative. */ | |
c2ea3a40 | 6714 | if (complain & tf_error) |
33bd39a2 | 6715 | error ("creating array with size zero (`%E')", max); |
4393e105 MM |
6716 | |
6717 | return error_mark_node; | |
0ecfe0b4 JM |
6718 | } |
6719 | ||
c95cd22e | 6720 | return compute_array_index_type (NULL_TREE, max); |
ae58fa02 MM |
6721 | } |
6722 | ||
6723 | case TEMPLATE_TYPE_PARM: | |
6724 | case TEMPLATE_TEMPLATE_PARM: | |
a1281f45 | 6725 | case BOUND_TEMPLATE_TEMPLATE_PARM: |
ae58fa02 MM |
6726 | case TEMPLATE_PARM_INDEX: |
6727 | { | |
6728 | int idx; | |
6729 | int level; | |
6730 | int levels; | |
0ecfe0b4 JM |
6731 | |
6732 | r = NULL_TREE; | |
ae58fa02 MM |
6733 | |
6734 | if (TREE_CODE (t) == TEMPLATE_TYPE_PARM | |
a1281f45 KL |
6735 | || TREE_CODE (t) == TEMPLATE_TEMPLATE_PARM |
6736 | || TREE_CODE (t) == BOUND_TEMPLATE_TEMPLATE_PARM) | |
ae58fa02 MM |
6737 | { |
6738 | idx = TEMPLATE_TYPE_IDX (t); | |
6739 | level = TEMPLATE_TYPE_LEVEL (t); | |
6740 | } | |
6741 | else | |
6742 | { | |
6743 | idx = TEMPLATE_PARM_IDX (t); | |
6744 | level = TEMPLATE_PARM_LEVEL (t); | |
6745 | } | |
6746 | ||
6747 | if (TREE_VEC_LENGTH (args) > 0) | |
6748 | { | |
6749 | tree arg = NULL_TREE; | |
6750 | ||
6751 | levels = TMPL_ARGS_DEPTH (args); | |
6752 | if (level <= levels) | |
6753 | arg = TMPL_ARG (args, level, idx); | |
6754 | ||
8b5b8b7c MM |
6755 | if (arg == error_mark_node) |
6756 | return error_mark_node; | |
6757 | else if (arg != NULL_TREE) | |
ae58fa02 MM |
6758 | { |
6759 | if (TREE_CODE (t) == TEMPLATE_TYPE_PARM) | |
6760 | { | |
2f939d94 | 6761 | my_friendly_assert (TYPE_P (arg), 0); |
adecb3f4 | 6762 | return cp_build_qualified_type_real |
89d684bb | 6763 | (arg, cp_type_quals (arg) | cp_type_quals (t), |
4f2b0fb2 | 6764 | complain | tf_ignore_bad_quals); |
ae58fa02 | 6765 | } |
a1281f45 | 6766 | else if (TREE_CODE (t) == BOUND_TEMPLATE_TEMPLATE_PARM) |
ae58fa02 | 6767 | { |
a1281f45 | 6768 | /* We are processing a type constructed from |
f4f206f4 | 6769 | a template template parameter. */ |
a1281f45 KL |
6770 | tree argvec = tsubst (TYPE_TI_ARGS (t), |
6771 | args, complain, in_decl); | |
6772 | if (argvec == error_mark_node) | |
6773 | return error_mark_node; | |
4393e105 | 6774 | |
a1281f45 KL |
6775 | /* We can get a TEMPLATE_TEMPLATE_PARM here when |
6776 | we are resolving nested-types in the signature of | |
6777 | a member function templates. | |
6778 | Otherwise ARG is a TEMPLATE_DECL and is the real | |
6779 | template to be instantiated. */ | |
6780 | if (TREE_CODE (arg) == TEMPLATE_TEMPLATE_PARM) | |
6781 | arg = TYPE_NAME (arg); | |
6782 | ||
6783 | r = lookup_template_class (arg, | |
6784 | argvec, in_decl, | |
6785 | DECL_CONTEXT (arg), | |
f9c244b8 NS |
6786 | /*entering_scope=*/0, |
6787 | complain); | |
c2ea3a40 NS |
6788 | return cp_build_qualified_type_real |
6789 | (r, TYPE_QUALS (t), complain); | |
ae58fa02 MM |
6790 | } |
6791 | else | |
a1281f45 | 6792 | /* TEMPLATE_TEMPLATE_PARM or TEMPLATE_PARM_INDEX. */ |
ae58fa02 MM |
6793 | return arg; |
6794 | } | |
6795 | } | |
51924768 | 6796 | else |
a98facb0 | 6797 | abort (); |
ae58fa02 MM |
6798 | |
6799 | if (level == 1) | |
6800 | /* This can happen during the attempted tsubst'ing in | |
6801 | unify. This means that we don't yet have any information | |
6802 | about the template parameter in question. */ | |
6803 | return t; | |
6804 | ||
6805 | /* If we get here, we must have been looking at a parm for a | |
6806 | more deeply nested template. Make a new version of this | |
6807 | template parameter, but with a lower level. */ | |
6808 | switch (TREE_CODE (t)) | |
6809 | { | |
6810 | case TEMPLATE_TYPE_PARM: | |
6811 | case TEMPLATE_TEMPLATE_PARM: | |
a1281f45 | 6812 | case BOUND_TEMPLATE_TEMPLATE_PARM: |
89d684bb | 6813 | if (cp_type_quals (t)) |
ae58fa02 | 6814 | { |
9ccf6541 | 6815 | r = tsubst (TYPE_MAIN_VARIANT (t), args, complain, in_decl); |
4f2b0fb2 NS |
6816 | r = cp_build_qualified_type_real |
6817 | (r, cp_type_quals (t), | |
6818 | complain | (TREE_CODE (t) == TEMPLATE_TYPE_PARM | |
6819 | ? tf_ignore_bad_quals : 0)); | |
9ccf6541 MM |
6820 | } |
6821 | else | |
6822 | { | |
11e74ea6 | 6823 | r = copy_type (t); |
9ccf6541 MM |
6824 | TEMPLATE_TYPE_PARM_INDEX (r) |
6825 | = reduce_template_parm_level (TEMPLATE_TYPE_PARM_INDEX (t), | |
6826 | r, levels); | |
6827 | TYPE_STUB_DECL (r) = TYPE_NAME (r) = TEMPLATE_TYPE_DECL (r); | |
6828 | TYPE_MAIN_VARIANT (r) = r; | |
6829 | TYPE_POINTER_TO (r) = NULL_TREE; | |
6830 | TYPE_REFERENCE_TO (r) = NULL_TREE; | |
6831 | ||
a1281f45 | 6832 | if (TREE_CODE (t) == BOUND_TEMPLATE_TEMPLATE_PARM) |
9ccf6541 MM |
6833 | { |
6834 | tree argvec = tsubst (TYPE_TI_ARGS (t), args, | |
6835 | complain, in_decl); | |
6836 | if (argvec == error_mark_node) | |
6837 | return error_mark_node; | |
4393e105 | 6838 | |
9ccf6541 MM |
6839 | TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (r) |
6840 | = tree_cons (TYPE_TI_TEMPLATE (t), argvec, NULL_TREE); | |
6841 | } | |
ae58fa02 MM |
6842 | } |
6843 | break; | |
6844 | ||
6845 | case TEMPLATE_PARM_INDEX: | |
6846 | r = reduce_template_parm_level (t, type, levels); | |
6847 | break; | |
6848 | ||
6849 | default: | |
a98facb0 | 6850 | abort (); |
ae58fa02 MM |
6851 | } |
6852 | ||
5566b478 | 6853 | return r; |
ae58fa02 | 6854 | } |
5566b478 | 6855 | |
8d08fdba MS |
6856 | case TREE_LIST: |
6857 | { | |
6858 | tree purpose, value, chain, result; | |
8d08fdba MS |
6859 | |
6860 | if (t == void_list_node) | |
6861 | return t; | |
6862 | ||
8d08fdba MS |
6863 | purpose = TREE_PURPOSE (t); |
6864 | if (purpose) | |
4393e105 MM |
6865 | { |
6866 | purpose = tsubst (purpose, args, complain, in_decl); | |
6867 | if (purpose == error_mark_node) | |
6868 | return error_mark_node; | |
6869 | } | |
8d08fdba MS |
6870 | value = TREE_VALUE (t); |
6871 | if (value) | |
4393e105 MM |
6872 | { |
6873 | value = tsubst (value, args, complain, in_decl); | |
6874 | if (value == error_mark_node) | |
6875 | return error_mark_node; | |
6876 | } | |
8d08fdba MS |
6877 | chain = TREE_CHAIN (t); |
6878 | if (chain && chain != void_type_node) | |
4393e105 MM |
6879 | { |
6880 | chain = tsubst (chain, args, complain, in_decl); | |
6881 | if (chain == error_mark_node) | |
6882 | return error_mark_node; | |
6883 | } | |
8d08fdba MS |
6884 | if (purpose == TREE_PURPOSE (t) |
6885 | && value == TREE_VALUE (t) | |
6886 | && chain == TREE_CHAIN (t)) | |
6887 | return t; | |
cbd5937a MM |
6888 | if (TREE_PARMLIST (t)) |
6889 | { | |
6890 | result = tree_cons (purpose, value, chain); | |
6891 | TREE_PARMLIST (result) = 1; | |
6892 | } | |
6893 | else | |
6894 | result = hash_tree_cons (purpose, value, chain); | |
8d08fdba MS |
6895 | return result; |
6896 | } | |
6897 | case TREE_VEC: | |
5566b478 MS |
6898 | if (type != NULL_TREE) |
6899 | { | |
1ceaad38 JM |
6900 | /* A binfo node. We always need to make a copy, of the node |
6901 | itself and of its BINFO_BASETYPES. */ | |
85b71cf2 | 6902 | |
5566b478 MS |
6903 | t = copy_node (t); |
6904 | ||
c7449f2b JM |
6905 | /* Make sure type isn't a typedef copy. */ |
6906 | type = BINFO_TYPE (TYPE_BINFO (type)); | |
6907 | ||
5566b478 | 6908 | TREE_TYPE (t) = complete_type (type); |
6633d636 MS |
6909 | if (IS_AGGR_TYPE (type)) |
6910 | { | |
6911 | BINFO_VTABLE (t) = TYPE_BINFO_VTABLE (type); | |
6912 | BINFO_VIRTUALS (t) = TYPE_BINFO_VIRTUALS (type); | |
6913 | if (TYPE_BINFO_BASETYPES (type) != NULL_TREE) | |
6914 | BINFO_BASETYPES (t) = copy_node (TYPE_BINFO_BASETYPES (type)); | |
6915 | } | |
5566b478 MS |
6916 | return t; |
6917 | } | |
85b71cf2 JM |
6918 | |
6919 | /* Otherwise, a vector of template arguments. */ | |
a91db711 | 6920 | return tsubst_template_args (t, args, complain, in_decl); |
8d08fdba | 6921 | |
8d08fdba MS |
6922 | case POINTER_TYPE: |
6923 | case REFERENCE_TYPE: | |
6924 | { | |
8d08fdba | 6925 | enum tree_code code; |
79a7c7fa | 6926 | |
46c895ac | 6927 | if (type == TREE_TYPE (t) && TREE_CODE (type) != METHOD_TYPE) |
8d08fdba MS |
6928 | return t; |
6929 | ||
6930 | code = TREE_CODE (t); | |
4393e105 MM |
6931 | |
6932 | ||
6933 | /* [temp.deduct] | |
6934 | ||
6935 | Type deduction may fail for any of the following | |
6936 | reasons: | |
6937 | ||
6938 | -- Attempting to create a pointer to reference type. | |
6939 | -- Attempting to create a reference to a reference type or | |
6940 | a reference to void. */ | |
0ecfe0b4 JM |
6941 | if (TREE_CODE (type) == REFERENCE_TYPE |
6942 | || (code == REFERENCE_TYPE && TREE_CODE (type) == VOID_TYPE)) | |
79a7c7fa | 6943 | { |
82a98427 | 6944 | static location_t last_loc; |
79a7c7fa JM |
6945 | |
6946 | /* We keep track of the last time we issued this error | |
6947 | message to avoid spewing a ton of messages during a | |
6948 | single bad template instantiation. */ | |
c2ea3a40 | 6949 | if (complain & tf_error |
82a98427 NS |
6950 | && (last_loc.line != input_line |
6951 | || last_loc.file != input_filename)) | |
79a7c7fa | 6952 | { |
0ecfe0b4 | 6953 | if (TREE_CODE (type) == VOID_TYPE) |
33bd39a2 | 6954 | error ("forming reference to void"); |
0ecfe0b4 | 6955 | else |
33bd39a2 | 6956 | error ("forming %s to reference type `%T'", |
0ecfe0b4 JM |
6957 | (code == POINTER_TYPE) ? "pointer" : "reference", |
6958 | type); | |
82a98427 | 6959 | last_loc = input_location; |
79a7c7fa JM |
6960 | } |
6961 | ||
4393e105 | 6962 | return error_mark_node; |
79a7c7fa JM |
6963 | } |
6964 | else if (code == POINTER_TYPE) | |
46c895ac NS |
6965 | { |
6966 | r = build_pointer_type (type); | |
6967 | if (TREE_CODE (type) == METHOD_TYPE) | |
6968 | r = build_ptrmemfunc_type (r); | |
6969 | } | |
8d08fdba MS |
6970 | else |
6971 | r = build_reference_type (type); | |
adecb3f4 | 6972 | r = cp_build_qualified_type_real (r, TYPE_QUALS (t), complain); |
79a7c7fa | 6973 | |
a5f1c5f8 NS |
6974 | if (r != error_mark_node) |
6975 | /* Will this ever be needed for TYPE_..._TO values? */ | |
6976 | layout_type (r); | |
6977 | ||
8d08fdba MS |
6978 | return r; |
6979 | } | |
a4443a08 | 6980 | case OFFSET_TYPE: |
0ecfe0b4 | 6981 | { |
4393e105 MM |
6982 | r = tsubst (TYPE_OFFSET_BASETYPE (t), args, complain, in_decl); |
6983 | if (r == error_mark_node || !IS_AGGR_TYPE (r)) | |
6984 | { | |
6985 | /* [temp.deduct] | |
6986 | ||
6987 | Type deduction may fail for any of the following | |
6988 | reasons: | |
6989 | ||
6990 | -- Attempting to create "pointer to member of T" when T | |
6991 | is not a class type. */ | |
c2ea3a40 NS |
6992 | if (complain & tf_error) |
6993 | error ("creating pointer to member of non-class type `%T'", r); | |
4393e105 MM |
6994 | return error_mark_node; |
6995 | } | |
46c895ac NS |
6996 | if (TREE_CODE (type) == REFERENCE_TYPE) |
6997 | { | |
4f09be91 | 6998 | if (complain & tf_error) |
46c895ac NS |
6999 | error ("creating pointer to member reference type `%T'", type); |
7000 | ||
7001 | return error_mark_node; | |
7002 | } | |
7003 | my_friendly_assert (TREE_CODE (type) != METHOD_TYPE, 20011231); | |
7004 | if (TREE_CODE (type) == FUNCTION_TYPE) | |
a5ac359a MM |
7005 | { |
7006 | /* This is really a method type. The cv qualifiers of the | |
7007 | this pointer should _not_ be determined by the cv | |
7008 | qualifiers of the class type. They should be held | |
7009 | somewhere in the FUNCTION_TYPE, but we don't do that at | |
7010 | the moment. Consider | |
7011 | typedef void (Func) () const; | |
7012 | ||
7013 | template <typename T1> void Foo (Func T1::*); | |
7014 | ||
7015 | */ | |
7016 | tree method_type; | |
7017 | ||
43dc123f MM |
7018 | method_type = build_method_type_directly (TYPE_MAIN_VARIANT (r), |
7019 | TREE_TYPE (type), | |
7020 | TYPE_ARG_TYPES (type)); | |
a5ac359a MM |
7021 | return build_ptrmemfunc_type (build_pointer_type (method_type)); |
7022 | } | |
46c895ac | 7023 | else |
b7a78333 MM |
7024 | return cp_build_qualified_type_real (build_ptrmem_type (r, type), |
7025 | TYPE_QUALS (t), | |
7026 | complain); | |
0ecfe0b4 | 7027 | } |
8d08fdba MS |
7028 | case FUNCTION_TYPE: |
7029 | case METHOD_TYPE: | |
7030 | { | |
c11b6f21 | 7031 | tree fntype; |
4393e105 | 7032 | tree raises; |
8d08fdba | 7033 | |
4393e105 MM |
7034 | fntype = tsubst_function_type (t, args, complain, in_decl); |
7035 | if (fntype == error_mark_node) | |
7036 | return error_mark_node; | |
cabc336a | 7037 | |
34cd5ae7 | 7038 | /* Substitute the exception specification. */ |
cabc336a | 7039 | raises = TYPE_RAISES_EXCEPTIONS (t); |
c11b6f21 MS |
7040 | if (raises) |
7041 | { | |
4cc1d462 NS |
7042 | tree list = NULL_TREE; |
7043 | ||
7044 | if (! TREE_VALUE (raises)) | |
7045 | list = raises; | |
7046 | else | |
7047 | for (; raises != NULL_TREE; raises = TREE_CHAIN (raises)) | |
7048 | { | |
7049 | tree spec = TREE_VALUE (raises); | |
7050 | ||
7051 | spec = tsubst (spec, args, complain, in_decl); | |
7052 | if (spec == error_mark_node) | |
7053 | return spec; | |
7054 | list = add_exception_specifier (list, spec, complain); | |
7055 | } | |
7056 | fntype = build_exception_variant (fntype, list); | |
c11b6f21 MS |
7057 | } |
7058 | return fntype; | |
8d08fdba MS |
7059 | } |
7060 | case ARRAY_TYPE: | |
7061 | { | |
4393e105 MM |
7062 | tree domain = tsubst (TYPE_DOMAIN (t), args, complain, in_decl); |
7063 | if (domain == error_mark_node) | |
7064 | return error_mark_node; | |
7065 | ||
7066 | /* As an optimization, we avoid regenerating the array type if | |
7067 | it will obviously be the same as T. */ | |
8d08fdba MS |
7068 | if (type == TREE_TYPE (t) && domain == TYPE_DOMAIN (t)) |
7069 | return t; | |
0ecfe0b4 | 7070 | |
4393e105 MM |
7071 | /* These checks should match the ones in grokdeclarator. |
7072 | ||
7073 | [temp.deduct] | |
7074 | ||
7075 | The deduction may fail for any of the following reasons: | |
7076 | ||
7077 | -- Attempting to create an array with an element type that | |
cfb91b67 GB |
7078 | is void, a function type, or a reference type, or [DR337] |
7079 | an abstract class type. */ | |
4393e105 MM |
7080 | if (TREE_CODE (type) == VOID_TYPE |
7081 | || TREE_CODE (type) == FUNCTION_TYPE | |
7082 | || TREE_CODE (type) == REFERENCE_TYPE) | |
0ecfe0b4 | 7083 | { |
c2ea3a40 | 7084 | if (complain & tf_error) |
33bd39a2 | 7085 | error ("creating array of `%T'", type); |
4393e105 | 7086 | return error_mark_node; |
0ecfe0b4 | 7087 | } |
cfb91b67 GB |
7088 | if (CLASS_TYPE_P (type) && CLASSTYPE_PURE_VIRTUALS (type)) |
7089 | { | |
7090 | if (complain & tf_error) | |
7091 | error ("creating array of `%T', which is an abstract class type", | |
7092 | type); | |
7093 | return error_mark_node; | |
7094 | } | |
0ecfe0b4 | 7095 | |
8d08fdba MS |
7096 | r = build_cplus_array_type (type, domain); |
7097 | return r; | |
7098 | } | |
7099 | ||
8d08fdba | 7100 | case PLUS_EXPR: |
5566b478 | 7101 | case MINUS_EXPR: |
4393e105 | 7102 | { |
c2ea3a40 NS |
7103 | tree e1 = tsubst (TREE_OPERAND (t, 0), args, complain, in_decl); |
7104 | tree e2 = tsubst (TREE_OPERAND (t, 1), args, complain, in_decl); | |
4393e105 MM |
7105 | |
7106 | if (e1 == error_mark_node || e2 == error_mark_node) | |
7107 | return error_mark_node; | |
7108 | ||
7109 | return fold (build (TREE_CODE (t), TREE_TYPE (t), e1, e2)); | |
7110 | } | |
8d08fdba MS |
7111 | |
7112 | case NEGATE_EXPR: | |
7113 | case NOP_EXPR: | |
4393e105 | 7114 | { |
c2ea3a40 | 7115 | tree e = tsubst (TREE_OPERAND (t, 0), args, complain, in_decl); |
4393e105 MM |
7116 | if (e == error_mark_node) |
7117 | return error_mark_node; | |
7118 | ||
7119 | return fold (build (TREE_CODE (t), TREE_TYPE (t), e)); | |
7120 | } | |
8d08fdba | 7121 | |
5566b478 MS |
7122 | case TYPENAME_TYPE: |
7123 | { | |
4393e105 MM |
7124 | tree ctx = tsubst_aggr_type (TYPE_CONTEXT (t), args, complain, |
7125 | in_decl, /*entering_scope=*/1); | |
7126 | tree f = tsubst_copy (TYPENAME_TYPE_FULLNAME (t), args, | |
7127 | complain, in_decl); | |
7128 | ||
7129 | if (ctx == error_mark_node || f == error_mark_node) | |
7130 | return error_mark_node; | |
ae58fa02 | 7131 | |
bf8f3f93 MM |
7132 | if (!IS_AGGR_TYPE (ctx)) |
7133 | { | |
c2ea3a40 | 7134 | if (complain & tf_error) |
33bd39a2 | 7135 | error ("`%T' is not a class, struct, or union type", |
bf8f3f93 MM |
7136 | ctx); |
7137 | return error_mark_node; | |
7138 | } | |
7139 | else if (!uses_template_parms (ctx) && !TYPE_BEING_DEFINED (ctx)) | |
7140 | { | |
7141 | /* Normally, make_typename_type does not require that the CTX | |
7142 | have complete type in order to allow things like: | |
ae58fa02 | 7143 | |
bf8f3f93 | 7144 | template <class T> struct S { typename S<T>::X Y; }; |
ae58fa02 | 7145 | |
bf8f3f93 MM |
7146 | But, such constructs have already been resolved by this |
7147 | point, so here CTX really should have complete type, unless | |
7148 | it's a partial instantiation. */ | |
4393e105 | 7149 | ctx = complete_type (ctx); |
d0f062fb | 7150 | if (!COMPLETE_TYPE_P (ctx)) |
4393e105 | 7151 | { |
c2ea3a40 | 7152 | if (complain & tf_error) |
7a228918 | 7153 | cxx_incomplete_type_error (NULL_TREE, ctx); |
4393e105 MM |
7154 | return error_mark_node; |
7155 | } | |
7156 | } | |
ae58fa02 | 7157 | |
4f2b0fb2 NS |
7158 | f = make_typename_type (ctx, f, |
7159 | (complain & tf_error) | tf_keep_type_decl); | |
f0bcd168 MM |
7160 | if (f == error_mark_node) |
7161 | return f; | |
4f2b0fb2 NS |
7162 | if (TREE_CODE (f) == TYPE_DECL) |
7163 | { | |
7164 | complain |= tf_ignore_bad_quals; | |
7165 | f = TREE_TYPE (f); | |
7166 | } | |
7167 | ||
7168 | return cp_build_qualified_type_real | |
7169 | (f, cp_type_quals (f) | cp_type_quals (t), complain); | |
5566b478 | 7170 | } |
c2ea3a40 | 7171 | |
b8c6534b KL |
7172 | case UNBOUND_CLASS_TEMPLATE: |
7173 | { | |
7174 | tree ctx = tsubst_aggr_type (TYPE_CONTEXT (t), args, complain, | |
7175 | in_decl, /*entering_scope=*/1); | |
7176 | tree name = TYPE_IDENTIFIER (t); | |
7177 | ||
7178 | if (ctx == error_mark_node || name == error_mark_node) | |
7179 | return error_mark_node; | |
7180 | ||
7181 | return make_unbound_class_template (ctx, name, complain); | |
7182 | } | |
7183 | ||
5566b478 | 7184 | case INDIRECT_REF: |
4393e105 | 7185 | { |
c2ea3a40 | 7186 | tree e = tsubst (TREE_OPERAND (t, 0), args, complain, in_decl); |
4393e105 MM |
7187 | if (e == error_mark_node) |
7188 | return error_mark_node; | |
7189 | return make_pointer_declarator (type, e); | |
7190 | } | |
7191 | ||
5566b478 | 7192 | case ADDR_EXPR: |
4393e105 | 7193 | { |
c2ea3a40 | 7194 | tree e = tsubst (TREE_OPERAND (t, 0), args, complain, in_decl); |
4393e105 MM |
7195 | if (e == error_mark_node) |
7196 | return error_mark_node; | |
7197 | return make_reference_declarator (type, e); | |
7198 | } | |
5566b478 MS |
7199 | |
7200 | case ARRAY_REF: | |
4393e105 | 7201 | { |
c2ea3a40 NS |
7202 | tree e1 = tsubst (TREE_OPERAND (t, 0), args, complain, in_decl); |
7203 | tree e2 = tsubst_expr (TREE_OPERAND (t, 1), args, complain, in_decl); | |
4393e105 MM |
7204 | if (e1 == error_mark_node || e2 == error_mark_node) |
7205 | return error_mark_node; | |
7206 | ||
13418b40 | 7207 | return build_nt (ARRAY_REF, e1, e2); |
4393e105 | 7208 | } |
5566b478 MS |
7209 | |
7210 | case CALL_EXPR: | |
4393e105 | 7211 | { |
c2ea3a40 | 7212 | tree e1 = tsubst (TREE_OPERAND (t, 0), args, complain, in_decl); |
43f887f9 MM |
7213 | tree e2 = (tsubst_call_declarator_parms |
7214 | (CALL_DECLARATOR_PARMS (t), args, complain, in_decl)); | |
7215 | tree e3 = tsubst (CALL_DECLARATOR_EXCEPTION_SPEC (t), args, | |
7216 | complain, in_decl); | |
4393e105 MM |
7217 | |
7218 | if (e1 == error_mark_node || e2 == error_mark_node | |
7219 | || e3 == error_mark_node) | |
7220 | return error_mark_node; | |
7221 | ||
43f887f9 | 7222 | return make_call_declarator (e1, e2, CALL_DECLARATOR_QUALS (t), e3); |
4393e105 | 7223 | } |
5566b478 | 7224 | |
fc378698 | 7225 | case SCOPE_REF: |
4393e105 | 7226 | { |
c2ea3a40 | 7227 | tree e1 = tsubst (TREE_OPERAND (t, 0), args, complain, in_decl); |
4393e105 MM |
7228 | tree e2 = tsubst (TREE_OPERAND (t, 1), args, complain, in_decl); |
7229 | if (e1 == error_mark_node || e2 == error_mark_node) | |
7230 | return error_mark_node; | |
7231 | ||
718b8ea5 | 7232 | return build_nt (TREE_CODE (t), e1, e2); |
4393e105 | 7233 | } |
fc378698 | 7234 | |
b894fc05 | 7235 | case TYPEOF_TYPE: |
4393e105 | 7236 | { |
b830b74c | 7237 | tree type; |
4393e105 | 7238 | |
eb34af89 RK |
7239 | type = finish_typeof (tsubst_expr (TYPEOF_TYPE_EXPR (t), args, |
7240 | complain, in_decl)); | |
b830b74c | 7241 | return cp_build_qualified_type_real (type, |
dce50630 | 7242 | cp_type_quals (t) |
b830b74c | 7243 | | cp_type_quals (type), |
dce50630 | 7244 | complain); |
4393e105 | 7245 | } |
b894fc05 | 7246 | |
8d08fdba | 7247 | default: |
5566b478 | 7248 | sorry ("use of `%s' in template", |
8d08fdba MS |
7249 | tree_code_name [(int) TREE_CODE (t)]); |
7250 | return error_mark_node; | |
7251 | } | |
7252 | } | |
7253 | ||
ee76b931 MM |
7254 | /* Like tsubst_expr for a BASELINK. OBJECT_TYPE, if non-NULL, is the |
7255 | type of the expression on the left-hand side of the "." or "->" | |
7256 | operator. */ | |
7257 | ||
7258 | static tree | |
7259 | tsubst_baselink (tree baselink, tree object_type, | |
7260 | tree args, tsubst_flags_t complain, tree in_decl) | |
7261 | { | |
7262 | tree name; | |
7263 | tree qualifying_scope; | |
7264 | tree fns; | |
7265 | tree template_args = 0; | |
7266 | bool template_id_p = false; | |
7267 | ||
7268 | /* A baselink indicates a function from a base class. The | |
7269 | BASELINK_ACCESS_BINFO and BASELINK_BINFO are going to have | |
7270 | non-dependent types; otherwise, the lookup could not have | |
7271 | succeeded. However, they may indicate bases of the template | |
7272 | class, rather than the instantiated class. | |
7273 | ||
7274 | In addition, lookups that were not ambiguous before may be | |
04c06002 | 7275 | ambiguous now. Therefore, we perform the lookup again. */ |
ee76b931 MM |
7276 | qualifying_scope = BINFO_TYPE (BASELINK_ACCESS_BINFO (baselink)); |
7277 | fns = BASELINK_FUNCTIONS (baselink); | |
7278 | if (TREE_CODE (fns) == TEMPLATE_ID_EXPR) | |
7279 | { | |
7280 | template_id_p = true; | |
7281 | template_args = TREE_OPERAND (fns, 1); | |
7282 | fns = TREE_OPERAND (fns, 0); | |
bf12d54d NS |
7283 | if (template_args) |
7284 | template_args = tsubst_template_args (template_args, args, | |
7285 | complain, in_decl); | |
ee76b931 MM |
7286 | } |
7287 | name = DECL_NAME (get_first_fn (fns)); | |
7288 | baselink = lookup_fnfields (qualifying_scope, name, /*protect=*/1); | |
7289 | if (BASELINK_P (baselink) && template_id_p) | |
7290 | BASELINK_FUNCTIONS (baselink) | |
7291 | = build_nt (TEMPLATE_ID_EXPR, | |
7292 | BASELINK_FUNCTIONS (baselink), | |
7293 | template_args); | |
7294 | if (!object_type) | |
7295 | object_type = current_class_type; | |
7296 | return adjust_result_of_qualified_name_lookup (baselink, | |
7297 | qualifying_scope, | |
7298 | object_type); | |
7299 | } | |
7300 | ||
7301 | /* Like tsubst_expr for a SCOPE_REF, given by QUALIFIED_ID. DONE is | |
7302 | true if the qualified-id will be a postfix-expression in-and-of | |
7303 | itself; false if more of the postfix-expression follows the | |
7304 | QUALIFIED_ID. ADDRESS_P is true if the qualified-id is the operand | |
7305 | of "&". */ | |
7306 | ||
7307 | static tree | |
7308 | tsubst_qualified_id (tree qualified_id, tree args, | |
7309 | tsubst_flags_t complain, tree in_decl, | |
7310 | bool done, bool address_p) | |
7311 | { | |
7312 | tree expr; | |
7313 | tree scope; | |
7314 | tree name; | |
7315 | bool is_template; | |
7316 | tree template_args; | |
7317 | ||
7318 | my_friendly_assert (TREE_CODE (qualified_id) == SCOPE_REF, 20030706); | |
7319 | ||
ee76b931 MM |
7320 | /* Figure out what name to look up. */ |
7321 | name = TREE_OPERAND (qualified_id, 1); | |
7322 | if (TREE_CODE (name) == TEMPLATE_ID_EXPR) | |
7323 | { | |
7324 | is_template = true; | |
bf12d54d NS |
7325 | template_args = TREE_OPERAND (name, 1); |
7326 | if (template_args) | |
7327 | template_args = tsubst_template_args (template_args, args, | |
7328 | complain, in_decl); | |
ee76b931 MM |
7329 | name = TREE_OPERAND (name, 0); |
7330 | } | |
7331 | else | |
7332 | { | |
7333 | is_template = false; | |
7334 | template_args = NULL_TREE; | |
7335 | } | |
7336 | ||
6eeba0cc MM |
7337 | /* Substitute into the qualifying scope. When there are no ARGS, we |
7338 | are just trying to simplify a non-dependent expression. In that | |
7339 | case the qualifying scope may be dependent, and, in any case, | |
7340 | substituting will not help. */ | |
7341 | scope = TREE_OPERAND (qualified_id, 0); | |
7342 | if (args) | |
7343 | { | |
7344 | scope = tsubst (scope, args, complain, in_decl); | |
7345 | expr = tsubst_copy (name, args, complain, in_decl); | |
7346 | } | |
7347 | else | |
7348 | expr = name; | |
10b1d5e7 | 7349 | |
ab73670a MM |
7350 | if (dependent_type_p (scope)) |
7351 | return build_nt (SCOPE_REF, scope, expr); | |
fb5ce3c9 | 7352 | |
5e08432e | 7353 | if (!BASELINK_P (name) && !DECL_P (expr)) |
12483c9f NS |
7354 | { |
7355 | expr = lookup_qualified_name (scope, expr, /*is_type_p=*/0, false); | |
7356 | if (TREE_CODE (TREE_CODE (expr) == TEMPLATE_DECL | |
7357 | ? DECL_TEMPLATE_RESULT (expr) : expr) == TYPE_DECL) | |
7358 | { | |
7359 | if (complain & tf_error) | |
b2693faf | 7360 | { |
a4e8e73a | 7361 | error ("dependent-name `%E' is parsed as a non-type, but " |
b2693faf GB |
7362 | "instantiation yields a type", qualified_id); |
7363 | inform ("say `typename %E' if a type is meant", qualified_id); | |
7364 | } | |
12483c9f NS |
7365 | return error_mark_node; |
7366 | } | |
7367 | } | |
fb5ce3c9 | 7368 | |
279b8466 | 7369 | if (DECL_P (expr)) |
fb5ce3c9 | 7370 | check_accessibility_of_qualified_id (expr, /*object_type=*/NULL_TREE, |
279b8466 | 7371 | scope); |
6eeba0cc | 7372 | |
ee76b931 MM |
7373 | /* Remember that there was a reference to this entity. */ |
7374 | if (DECL_P (expr)) | |
9baa27a9 | 7375 | mark_used (expr); |
ee76b931 MM |
7376 | |
7377 | if (is_template) | |
10b1d5e7 | 7378 | expr = lookup_template_function (expr, template_args); |
ee76b931 | 7379 | |
22038b2c NS |
7380 | if (expr == error_mark_node && complain & tf_error) |
7381 | qualified_name_lookup_error (scope, TREE_OPERAND (qualified_id, 1)); | |
7382 | else if (TYPE_P (scope)) | |
ee76b931 MM |
7383 | { |
7384 | expr = (adjust_result_of_qualified_name_lookup | |
7385 | (expr, scope, current_class_type)); | |
7386 | expr = finish_qualified_id_expr (scope, expr, done, address_p); | |
7387 | } | |
7388 | ||
7389 | return expr; | |
7390 | } | |
7391 | ||
00d3396f JM |
7392 | /* Like tsubst, but deals with expressions. This function just replaces |
7393 | template parms; to finish processing the resultant expression, use | |
7394 | tsubst_expr. */ | |
7395 | ||
14d22dd6 | 7396 | static tree |
3a978d72 | 7397 | tsubst_copy (tree t, tree args, tsubst_flags_t complain, tree in_decl) |
5566b478 MS |
7398 | { |
7399 | enum tree_code code; | |
8452b1d3 | 7400 | tree r; |
8d08fdba | 7401 | |
5566b478 MS |
7402 | if (t == NULL_TREE || t == error_mark_node) |
7403 | return t; | |
7404 | ||
7405 | code = TREE_CODE (t); | |
b7484fbe | 7406 | |
5566b478 MS |
7407 | switch (code) |
7408 | { | |
7409 | case PARM_DECL: | |
a723baf1 MM |
7410 | r = retrieve_local_specialization (t); |
7411 | my_friendly_assert (r != NULL, 20020903); | |
c0694c4b | 7412 | mark_used (r); |
a723baf1 | 7413 | return r; |
5566b478 MS |
7414 | |
7415 | case CONST_DECL: | |
ed44da02 MM |
7416 | { |
7417 | tree enum_type; | |
7418 | tree v; | |
7419 | ||
a723baf1 MM |
7420 | if (DECL_TEMPLATE_PARM_P (t)) |
7421 | return tsubst_copy (DECL_INITIAL (t), args, complain, in_decl); | |
7b6d72fc MM |
7422 | /* There is no need to substitute into namespace-scope |
7423 | enumerators. */ | |
7424 | if (DECL_NAMESPACE_SCOPE_P (t)) | |
ed44da02 MM |
7425 | return t; |
7426 | ||
7427 | /* Unfortunately, we cannot just call lookup_name here. | |
9188c363 MM |
7428 | Consider: |
7429 | ||
7430 | template <int I> int f() { | |
7431 | enum E { a = I }; | |
7432 | struct S { void g() { E e = a; } }; | |
7433 | }; | |
7434 | ||
7435 | When we instantiate f<7>::S::g(), say, lookup_name is not | |
7436 | clever enough to find f<7>::a. */ | |
ed44da02 | 7437 | enum_type |
4393e105 | 7438 | = tsubst_aggr_type (TREE_TYPE (t), args, complain, in_decl, |
ed44da02 MM |
7439 | /*entering_scope=*/0); |
7440 | ||
7441 | for (v = TYPE_VALUES (enum_type); | |
7442 | v != NULL_TREE; | |
7443 | v = TREE_CHAIN (v)) | |
7444 | if (TREE_PURPOSE (v) == DECL_NAME (t)) | |
7445 | return TREE_VALUE (v); | |
7446 | ||
7447 | /* We didn't find the name. That should never happen; if | |
7448 | name-lookup found it during preliminary parsing, we | |
7449 | should find it again here during instantiation. */ | |
a98facb0 | 7450 | abort (); |
ed44da02 | 7451 | } |
db04386f | 7452 | return t; |
ed44da02 | 7453 | |
5566b478 MS |
7454 | case FIELD_DECL: |
7455 | if (DECL_CONTEXT (t)) | |
7456 | { | |
0978790f | 7457 | tree ctx; |
0978790f | 7458 | |
4393e105 | 7459 | ctx = tsubst_aggr_type (DECL_CONTEXT (t), args, complain, in_decl, |
36a117a5 | 7460 | /*entering_scope=*/1); |
0978790f | 7461 | if (ctx != DECL_CONTEXT (t)) |
86ac0575 | 7462 | return lookup_field (ctx, DECL_NAME (t), 0, false); |
5566b478 MS |
7463 | } |
7464 | return t; | |
7465 | ||
7466 | case VAR_DECL: | |
7467 | case FUNCTION_DECL: | |
a723baf1 MM |
7468 | if ((DECL_LANG_SPECIFIC (t) && DECL_TEMPLATE_INFO (t)) |
7469 | || local_variable_p (t)) | |
4393e105 | 7470 | t = tsubst (t, args, complain, in_decl); |
5566b478 MS |
7471 | mark_used (t); |
7472 | return t; | |
7473 | ||
a723baf1 | 7474 | case BASELINK: |
ee76b931 | 7475 | return tsubst_baselink (t, current_class_type, args, complain, in_decl); |
a723baf1 | 7476 | |
98c1c668 | 7477 | case TEMPLATE_DECL: |
a723baf1 MM |
7478 | if (DECL_TEMPLATE_TEMPLATE_PARM_P (t)) |
7479 | return tsubst (TREE_TYPE (DECL_TEMPLATE_RESULT (t)), | |
7480 | args, complain, in_decl); | |
7481 | else if (is_member_template (t)) | |
4393e105 | 7482 | return tsubst (t, args, complain, in_decl); |
fcea7401 KL |
7483 | else if (DECL_CLASS_SCOPE_P (t) |
7484 | && uses_template_parms (DECL_CONTEXT (t))) | |
7485 | { | |
7486 | /* Template template argument like the following example need | |
7487 | special treatment: | |
7488 | ||
7489 | template <template <class> class TT> struct C {}; | |
7490 | template <class T> struct D { | |
7491 | template <class U> struct E {}; | |
7492 | C<E> c; // #1 | |
7493 | }; | |
7494 | D<int> d; // #2 | |
7495 | ||
7496 | We are processing the template argument `E' in #1 for | |
7497 | the template instantiation #2. Originally, `E' is a | |
7498 | TEMPLATE_DECL with `D<T>' as its DECL_CONTEXT. Now we | |
7499 | have to substitute this with one having context `D<int>'. */ | |
7500 | ||
7501 | tree context = tsubst (DECL_CONTEXT (t), args, complain, in_decl); | |
7502 | return lookup_field (context, DECL_NAME(t), 0, false); | |
7503 | } | |
98c1c668 | 7504 | else |
fcea7401 | 7505 | /* Ordinary template template argument. */ |
98c1c668 JM |
7506 | return t; |
7507 | ||
5566b478 MS |
7508 | case CAST_EXPR: |
7509 | case REINTERPRET_CAST_EXPR: | |
e92cc029 MS |
7510 | case CONST_CAST_EXPR: |
7511 | case STATIC_CAST_EXPR: | |
7512 | case DYNAMIC_CAST_EXPR: | |
51924768 | 7513 | case NOP_EXPR: |
5566b478 | 7514 | return build1 |
4393e105 MM |
7515 | (code, tsubst (TREE_TYPE (t), args, complain, in_decl), |
7516 | tsubst_copy (TREE_OPERAND (t, 0), args, complain, in_decl)); | |
5566b478 MS |
7517 | |
7518 | case INDIRECT_REF: | |
5566b478 MS |
7519 | case NEGATE_EXPR: |
7520 | case TRUTH_NOT_EXPR: | |
b87692e5 | 7521 | case BIT_NOT_EXPR: |
5566b478 MS |
7522 | case ADDR_EXPR: |
7523 | case CONVERT_EXPR: /* Unary + */ | |
7524 | case SIZEOF_EXPR: | |
abff8e06 | 7525 | case ALIGNOF_EXPR: |
5566b478 | 7526 | case ARROW_EXPR: |
fc378698 | 7527 | case THROW_EXPR: |
5156628f | 7528 | case TYPEID_EXPR: |
f5733617 SS |
7529 | case REALPART_EXPR: |
7530 | case IMAGPART_EXPR: | |
5566b478 | 7531 | return build1 |
6a629cac | 7532 | (code, tsubst (TREE_TYPE (t), args, complain, in_decl), |
4393e105 | 7533 | tsubst_copy (TREE_OPERAND (t, 0), args, complain, in_decl)); |
5566b478 | 7534 | |
a723baf1 MM |
7535 | case COMPONENT_REF: |
7536 | { | |
7537 | tree object; | |
7538 | tree name; | |
7539 | ||
7540 | object = tsubst_copy (TREE_OPERAND (t, 0), args, complain, in_decl); | |
7541 | name = TREE_OPERAND (t, 1); | |
7542 | if (TREE_CODE (name) == BIT_NOT_EXPR) | |
7543 | { | |
7544 | name = tsubst_copy (TREE_OPERAND (name, 0), args, | |
7545 | complain, in_decl); | |
7546 | name = build1 (BIT_NOT_EXPR, NULL_TREE, name); | |
7547 | } | |
7548 | else if (TREE_CODE (name) == SCOPE_REF | |
7549 | && TREE_CODE (TREE_OPERAND (name, 1)) == BIT_NOT_EXPR) | |
7550 | { | |
7551 | tree base = tsubst_copy (TREE_OPERAND (name, 0), args, | |
7552 | complain, in_decl); | |
7553 | name = TREE_OPERAND (name, 1); | |
7554 | name = tsubst_copy (TREE_OPERAND (name, 0), args, | |
7555 | complain, in_decl); | |
7556 | name = build1 (BIT_NOT_EXPR, NULL_TREE, name); | |
7557 | name = build_nt (SCOPE_REF, base, name); | |
7558 | } | |
ee76b931 MM |
7559 | else if (TREE_CODE (name) == BASELINK) |
7560 | name = tsubst_baselink (name, | |
7561 | non_reference (TREE_TYPE (object)), | |
7562 | args, complain, | |
7563 | in_decl); | |
a723baf1 | 7564 | else |
ee76b931 | 7565 | name = tsubst_copy (name, args, complain, in_decl); |
a723baf1 MM |
7566 | return build_nt (COMPONENT_REF, object, name); |
7567 | } | |
7568 | ||
5566b478 MS |
7569 | case PLUS_EXPR: |
7570 | case MINUS_EXPR: | |
7571 | case MULT_EXPR: | |
7572 | case TRUNC_DIV_EXPR: | |
7573 | case CEIL_DIV_EXPR: | |
7574 | case FLOOR_DIV_EXPR: | |
7575 | case ROUND_DIV_EXPR: | |
7576 | case EXACT_DIV_EXPR: | |
7577 | case BIT_AND_EXPR: | |
5566b478 MS |
7578 | case BIT_IOR_EXPR: |
7579 | case BIT_XOR_EXPR: | |
7580 | case TRUNC_MOD_EXPR: | |
7581 | case FLOOR_MOD_EXPR: | |
7582 | case TRUTH_ANDIF_EXPR: | |
7583 | case TRUTH_ORIF_EXPR: | |
7584 | case TRUTH_AND_EXPR: | |
7585 | case TRUTH_OR_EXPR: | |
7586 | case RSHIFT_EXPR: | |
7587 | case LSHIFT_EXPR: | |
7588 | case RROTATE_EXPR: | |
7589 | case LROTATE_EXPR: | |
7590 | case EQ_EXPR: | |
7591 | case NE_EXPR: | |
7592 | case MAX_EXPR: | |
7593 | case MIN_EXPR: | |
7594 | case LE_EXPR: | |
7595 | case GE_EXPR: | |
7596 | case LT_EXPR: | |
7597 | case GT_EXPR: | |
5566b478 MS |
7598 | case ARRAY_REF: |
7599 | case COMPOUND_EXPR: | |
7600 | case SCOPE_REF: | |
7601 | case DOTSTAR_EXPR: | |
7602 | case MEMBER_REF: | |
519c9806 MM |
7603 | case PREDECREMENT_EXPR: |
7604 | case PREINCREMENT_EXPR: | |
7605 | case POSTDECREMENT_EXPR: | |
7606 | case POSTINCREMENT_EXPR: | |
5566b478 | 7607 | return build_nt |
4393e105 MM |
7608 | (code, tsubst_copy (TREE_OPERAND (t, 0), args, complain, in_decl), |
7609 | tsubst_copy (TREE_OPERAND (t, 1), args, complain, in_decl)); | |
5566b478 MS |
7610 | |
7611 | case CALL_EXPR: | |
a723baf1 MM |
7612 | return build_nt (code, |
7613 | tsubst_copy (TREE_OPERAND (t, 0), args, | |
7614 | complain, in_decl), | |
7615 | tsubst_copy (TREE_OPERAND (t, 1), args, complain, | |
7616 | in_decl), | |
7617 | NULL_TREE); | |
5566b478 | 7618 | |
558475f0 | 7619 | case STMT_EXPR: |
cc23546e | 7620 | /* This processing should really occur in tsubst_expr. However, |
558475f0 | 7621 | tsubst_expr does not recurse into expressions, since it |
cc23546e JO |
7622 | assumes that there aren't any statements inside them. So, we |
7623 | need to expand the STMT_EXPR here. */ | |
558475f0 MM |
7624 | if (!processing_template_decl) |
7625 | { | |
b5ac18ea | 7626 | tree stmt_expr = begin_stmt_expr (); |
a5bcc582 NS |
7627 | |
7628 | tsubst_expr (STMT_EXPR_STMT (t), args, | |
7629 | complain | tf_stmt_expr_cmpd, in_decl); | |
303b7406 | 7630 | return finish_stmt_expr (stmt_expr, false); |
558475f0 | 7631 | } |
9d9169de MM |
7632 | |
7633 | return t; | |
558475f0 | 7634 | |
5566b478 MS |
7635 | case COND_EXPR: |
7636 | case MODOP_EXPR: | |
40242ccf | 7637 | case PSEUDO_DTOR_EXPR: |
67da3287 | 7638 | { |
8452b1d3 | 7639 | r = build_nt |
4393e105 MM |
7640 | (code, tsubst_copy (TREE_OPERAND (t, 0), args, complain, in_decl), |
7641 | tsubst_copy (TREE_OPERAND (t, 1), args, complain, in_decl), | |
7642 | tsubst_copy (TREE_OPERAND (t, 2), args, complain, in_decl)); | |
67da3287 MM |
7643 | return r; |
7644 | } | |
5566b478 MS |
7645 | |
7646 | case NEW_EXPR: | |
7647 | { | |
8452b1d3 | 7648 | r = build_nt |
4393e105 MM |
7649 | (code, tsubst_copy (TREE_OPERAND (t, 0), args, complain, in_decl), |
7650 | tsubst_copy (TREE_OPERAND (t, 1), args, complain, in_decl), | |
7651 | tsubst_copy (TREE_OPERAND (t, 2), args, complain, in_decl)); | |
5566b478 MS |
7652 | NEW_EXPR_USE_GLOBAL (r) = NEW_EXPR_USE_GLOBAL (t); |
7653 | return r; | |
7654 | } | |
7655 | ||
7656 | case DELETE_EXPR: | |
7657 | { | |
8452b1d3 | 7658 | r = build_nt |
4393e105 MM |
7659 | (code, tsubst_copy (TREE_OPERAND (t, 0), args, complain, in_decl), |
7660 | tsubst_copy (TREE_OPERAND (t, 1), args, complain, in_decl)); | |
5566b478 MS |
7661 | DELETE_EXPR_USE_GLOBAL (r) = DELETE_EXPR_USE_GLOBAL (t); |
7662 | DELETE_EXPR_USE_VEC (r) = DELETE_EXPR_USE_VEC (t); | |
7663 | return r; | |
7664 | } | |
7665 | ||
386b8a85 JM |
7666 | case TEMPLATE_ID_EXPR: |
7667 | { | |
00d3396f | 7668 | /* Substituted template arguments */ |
a91db711 NS |
7669 | tree fn = TREE_OPERAND (t, 0); |
7670 | tree targs = TREE_OPERAND (t, 1); | |
856216bb | 7671 | |
a91db711 | 7672 | fn = tsubst_copy (fn, args, complain, in_decl); |
bf12d54d NS |
7673 | if (targs) |
7674 | targs = tsubst_template_args (targs, args, complain, in_decl); | |
a91db711 NS |
7675 | |
7676 | return lookup_template_function (fn, targs); | |
386b8a85 JM |
7677 | } |
7678 | ||
5566b478 MS |
7679 | case TREE_LIST: |
7680 | { | |
7681 | tree purpose, value, chain; | |
7682 | ||
7683 | if (t == void_list_node) | |
7684 | return t; | |
7685 | ||
7686 | purpose = TREE_PURPOSE (t); | |
7687 | if (purpose) | |
4393e105 | 7688 | purpose = tsubst_copy (purpose, args, complain, in_decl); |
5566b478 MS |
7689 | value = TREE_VALUE (t); |
7690 | if (value) | |
4393e105 | 7691 | value = tsubst_copy (value, args, complain, in_decl); |
5566b478 MS |
7692 | chain = TREE_CHAIN (t); |
7693 | if (chain && chain != void_type_node) | |
4393e105 | 7694 | chain = tsubst_copy (chain, args, complain, in_decl); |
5566b478 MS |
7695 | if (purpose == TREE_PURPOSE (t) |
7696 | && value == TREE_VALUE (t) | |
7697 | && chain == TREE_CHAIN (t)) | |
7698 | return t; | |
7699 | return tree_cons (purpose, value, chain); | |
7700 | } | |
7701 | ||
7702 | case RECORD_TYPE: | |
7703 | case UNION_TYPE: | |
7704 | case ENUMERAL_TYPE: | |
7705 | case INTEGER_TYPE: | |
7706 | case TEMPLATE_TYPE_PARM: | |
73b0fce8 | 7707 | case TEMPLATE_TEMPLATE_PARM: |
a1281f45 | 7708 | case BOUND_TEMPLATE_TEMPLATE_PARM: |
f84b4be9 | 7709 | case TEMPLATE_PARM_INDEX: |
5566b478 MS |
7710 | case POINTER_TYPE: |
7711 | case REFERENCE_TYPE: | |
7712 | case OFFSET_TYPE: | |
7713 | case FUNCTION_TYPE: | |
7714 | case METHOD_TYPE: | |
7715 | case ARRAY_TYPE: | |
7716 | case TYPENAME_TYPE: | |
b8c6534b | 7717 | case UNBOUND_CLASS_TEMPLATE: |
2a2b1d56 | 7718 | case TYPEOF_TYPE: |
f84b4be9 | 7719 | case TYPE_DECL: |
4393e105 | 7720 | return tsubst (t, args, complain, in_decl); |
5566b478 | 7721 | |
e92cc029 | 7722 | case IDENTIFIER_NODE: |
421844e7 | 7723 | if (IDENTIFIER_TYPENAME_P (t)) |
1f6e1acc AS |
7724 | { |
7725 | tree new_type = tsubst (TREE_TYPE (t), args, complain, in_decl); | |
1f84ec23 | 7726 | return mangle_conv_op_name_for_type (new_type); |
1f6e1acc | 7727 | } |
e92cc029 MS |
7728 | else |
7729 | return t; | |
7730 | ||
5156628f | 7731 | case CONSTRUCTOR: |
8452b1d3 | 7732 | { |
dcf92453 ZW |
7733 | r = build_constructor |
7734 | (tsubst (TREE_TYPE (t), args, complain, in_decl), | |
7735 | tsubst_copy (CONSTRUCTOR_ELTS (t), args, complain, in_decl)); | |
8452b1d3 JM |
7736 | TREE_HAS_CONSTRUCTOR (r) = TREE_HAS_CONSTRUCTOR (t); |
7737 | return r; | |
7738 | } | |
5156628f | 7739 | |
371534a9 | 7740 | case VA_ARG_EXPR: |
ea333e1c | 7741 | return build_x_va_arg (tsubst_copy (TREE_OPERAND (t, 0), args, complain, |
c2ea3a40 NS |
7742 | in_decl), |
7743 | tsubst (TREE_TYPE (t), args, complain, in_decl)); | |
f9817201 | 7744 | |
5566b478 MS |
7745 | default: |
7746 | return t; | |
7747 | } | |
7748 | } | |
7749 | ||
cc23546e JO |
7750 | /* Like tsubst_copy for expressions, etc. but also does semantic |
7751 | processing. */ | |
00d3396f | 7752 | |
14d22dd6 | 7753 | static tree |
3a978d72 | 7754 | tsubst_expr (tree t, tree args, tsubst_flags_t complain, tree in_decl) |
5566b478 | 7755 | { |
fd10dd09 | 7756 | tree stmt, tmp; |
a5bcc582 NS |
7757 | tsubst_flags_t stmt_expr |
7758 | = complain & (tf_stmt_expr_cmpd | tf_stmt_expr_body); | |
558475f0 | 7759 | |
a5bcc582 | 7760 | complain ^= stmt_expr; |
5566b478 MS |
7761 | if (t == NULL_TREE || t == error_mark_node) |
7762 | return t; | |
7763 | ||
009ed910 | 7764 | if (!STATEMENT_CODE_P (TREE_CODE (t))) |
b3445994 MM |
7765 | return tsubst_copy_and_build (t, args, complain, in_decl, |
7766 | /*function_p=*/false); | |
fd10dd09 | 7767 | |
5566b478 | 7768 | switch (TREE_CODE (t)) |
8d08fdba | 7769 | { |
558475f0 | 7770 | case CTOR_INITIALIZER: |
2282d28d MM |
7771 | prep_stmt (t); |
7772 | finish_mem_initializers (tsubst_initializer_list | |
7773 | (TREE_OPERAND (t, 0), args)); | |
7774 | break; | |
558475f0 | 7775 | |
5566b478 | 7776 | case RETURN_STMT: |
a7e4cfa0 | 7777 | prep_stmt (t); |
d65b1d77 | 7778 | finish_return_stmt (tsubst_expr (RETURN_STMT_EXPR (t), |
4393e105 | 7779 | args, complain, in_decl)); |
5566b478 MS |
7780 | break; |
7781 | ||
7782 | case EXPR_STMT: | |
a5bcc582 NS |
7783 | { |
7784 | tree r; | |
7785 | ||
7786 | prep_stmt (t); | |
7787 | ||
7788 | r = tsubst_expr (EXPR_STMT_EXPR (t), args, complain, in_decl); | |
7789 | if (stmt_expr & tf_stmt_expr_body && !TREE_CHAIN (t)) | |
7790 | finish_stmt_expr_expr (r); | |
7791 | else | |
7792 | finish_expr_stmt (r); | |
7793 | break; | |
7794 | } | |
5566b478 | 7795 | |
9da99f7d NS |
7796 | case USING_STMT: |
7797 | prep_stmt (t); | |
7798 | do_using_directive (tsubst_expr (USING_STMT_NAMESPACE (t), | |
7799 | args, complain, in_decl)); | |
7800 | break; | |
7801 | ||
5566b478 MS |
7802 | case DECL_STMT: |
7803 | { | |
e0942dcd MM |
7804 | tree decl; |
7805 | tree init; | |
5566b478 | 7806 | |
a7e4cfa0 | 7807 | prep_stmt (t); |
e0942dcd | 7808 | decl = DECL_STMT_DECL (t); |
acef433b MM |
7809 | if (TREE_CODE (decl) == LABEL_DECL) |
7810 | finish_label_decl (DECL_NAME (decl)); | |
fbfe8c9e NS |
7811 | else if (TREE_CODE (decl) == USING_DECL) |
7812 | { | |
7813 | tree scope = DECL_INITIAL (decl); | |
7814 | tree name = DECL_NAME (decl); | |
22038b2c | 7815 | tree decl; |
fbfe8c9e NS |
7816 | |
7817 | scope = tsubst_expr (scope, args, complain, in_decl); | |
22038b2c | 7818 | decl = lookup_qualified_name (scope, name, |
12483c9f NS |
7819 | /*is_type_p=*/false, |
7820 | /*complain=*/false); | |
22038b2c NS |
7821 | if (decl == error_mark_node) |
7822 | qualified_name_lookup_error (scope, name); | |
7823 | else | |
ed5f054f | 7824 | do_local_using_decl (decl, scope, name); |
fbfe8c9e | 7825 | } |
acef433b MM |
7826 | else |
7827 | { | |
7828 | init = DECL_INITIAL (decl); | |
7829 | decl = tsubst (decl, args, complain, in_decl); | |
ce2e5191 NS |
7830 | if (decl != error_mark_node) |
7831 | { | |
7832 | if (init) | |
7833 | DECL_INITIAL (decl) = error_mark_node; | |
7834 | /* By marking the declaration as instantiated, we avoid | |
7835 | trying to instantiate it. Since instantiate_decl can't | |
7836 | handle local variables, and since we've already done | |
7837 | all that needs to be done, that's the right thing to | |
7838 | do. */ | |
7839 | if (TREE_CODE (decl) == VAR_DECL) | |
7840 | DECL_TEMPLATE_INSTANTIATED (decl) = 1; | |
edebf865 MM |
7841 | if (TREE_CODE (decl) == VAR_DECL |
7842 | && ANON_AGGR_TYPE_P (TREE_TYPE (decl))) | |
7843 | /* Anonymous aggregates are a special case. */ | |
7844 | finish_anon_union (decl); | |
7845 | else | |
ed2fa432 | 7846 | { |
edebf865 | 7847 | maybe_push_decl (decl); |
39703eb9 MM |
7848 | if (TREE_CODE (decl) == VAR_DECL |
7849 | && DECL_PRETTY_FUNCTION_P (decl)) | |
edebf865 MM |
7850 | { |
7851 | /* For __PRETTY_FUNCTION__ we have to adjust the | |
7852 | initializer. */ | |
7853 | const char *const name | |
7854 | = cxx_printable_name (current_function_decl, 2); | |
bb885938 | 7855 | init = cp_fname_init (name, &TREE_TYPE (decl)); |
edebf865 MM |
7856 | } |
7857 | else | |
7858 | init = tsubst_expr (init, args, complain, in_decl); | |
7859 | cp_finish_decl (decl, init, NULL_TREE, 0); | |
ed2fa432 | 7860 | } |
ce2e5191 | 7861 | } |
acef433b | 7862 | } |
fd10dd09 JM |
7863 | |
7864 | /* A DECL_STMT can also be used as an expression, in the condition | |
27631dae | 7865 | clause of an if/for/while construct. If we aren't followed by |
fd10dd09 JM |
7866 | another statement, return our decl. */ |
7867 | if (TREE_CHAIN (t) == NULL_TREE) | |
7868 | return decl; | |
5566b478 | 7869 | } |
fd10dd09 | 7870 | break; |
8d08fdba | 7871 | |
5566b478 MS |
7872 | case FOR_STMT: |
7873 | { | |
a7e4cfa0 | 7874 | prep_stmt (t); |
5566b478 | 7875 | |
558475f0 | 7876 | stmt = begin_for_stmt (); |
fd10dd09 | 7877 | tsubst_expr (FOR_INIT_STMT (t), args, complain, in_decl); |
558475f0 | 7878 | finish_for_init_stmt (stmt); |
c2ea3a40 NS |
7879 | finish_for_cond (tsubst_expr (FOR_COND (t), |
7880 | args, complain, in_decl), | |
558475f0 | 7881 | stmt); |
4393e105 | 7882 | tmp = tsubst_expr (FOR_EXPR (t), args, complain, in_decl); |
558475f0 | 7883 | finish_for_expr (tmp, stmt); |
4393e105 | 7884 | tsubst_expr (FOR_BODY (t), args, complain, in_decl); |
35b1567d | 7885 | finish_for_stmt (stmt); |
5566b478 MS |
7886 | } |
7887 | break; | |
8d08fdba | 7888 | |
5566b478 MS |
7889 | case WHILE_STMT: |
7890 | { | |
a7e4cfa0 | 7891 | prep_stmt (t); |
558475f0 | 7892 | stmt = begin_while_stmt (); |
ad321293 | 7893 | finish_while_stmt_cond (tsubst_expr (WHILE_COND (t), |
4393e105 | 7894 | args, complain, in_decl), |
558475f0 | 7895 | stmt); |
4393e105 | 7896 | tsubst_expr (WHILE_BODY (t), args, complain, in_decl); |
558475f0 | 7897 | finish_while_stmt (stmt); |
5566b478 MS |
7898 | } |
7899 | break; | |
8d08fdba | 7900 | |
5566b478 MS |
7901 | case DO_STMT: |
7902 | { | |
a7e4cfa0 | 7903 | prep_stmt (t); |
558475f0 | 7904 | stmt = begin_do_stmt (); |
4393e105 | 7905 | tsubst_expr (DO_BODY (t), args, complain, in_decl); |
558475f0 | 7906 | finish_do_body (stmt); |
c2ea3a40 NS |
7907 | finish_do_stmt (tsubst_expr (DO_COND (t), |
7908 | args, complain, in_decl), | |
558475f0 | 7909 | stmt); |
5566b478 MS |
7910 | } |
7911 | break; | |
a0a33927 | 7912 | |
5566b478 | 7913 | case IF_STMT: |
8d08fdba | 7914 | { |
a7e4cfa0 | 7915 | prep_stmt (t); |
558475f0 | 7916 | stmt = begin_if_stmt (); |
ad321293 | 7917 | finish_if_stmt_cond (tsubst_expr (IF_COND (t), |
4393e105 | 7918 | args, complain, in_decl), |
558475f0 | 7919 | stmt); |
db5ae43f | 7920 | |
ad321293 | 7921 | if (tmp = THEN_CLAUSE (t), tmp) |
db5ae43f | 7922 | { |
4393e105 | 7923 | tsubst_expr (tmp, args, complain, in_decl); |
558475f0 | 7924 | finish_then_clause (stmt); |
db5ae43f MS |
7925 | } |
7926 | ||
ad321293 MM |
7927 | if (tmp = ELSE_CLAUSE (t), tmp) |
7928 | { | |
7929 | begin_else_clause (); | |
4393e105 | 7930 | tsubst_expr (tmp, args, complain, in_decl); |
558475f0 | 7931 | finish_else_clause (stmt); |
ad321293 | 7932 | } |
8d08fdba | 7933 | |
ad321293 | 7934 | finish_if_stmt (); |
8d08fdba | 7935 | } |
5566b478 | 7936 | break; |
8d08fdba | 7937 | |
5566b478 MS |
7938 | case COMPOUND_STMT: |
7939 | { | |
a7e4cfa0 | 7940 | prep_stmt (t); |
ade3dc07 JM |
7941 | if (COMPOUND_STMT_BODY_BLOCK (t)) |
7942 | stmt = begin_function_body (); | |
7943 | else | |
7944 | stmt = begin_compound_stmt (COMPOUND_STMT_NO_SCOPE (t)); | |
7945 | ||
a5bcc582 NS |
7946 | tsubst_expr (COMPOUND_BODY (t), args, |
7947 | complain | ((stmt_expr & tf_stmt_expr_cmpd) << 1), | |
7948 | in_decl); | |
ade3dc07 JM |
7949 | |
7950 | if (COMPOUND_STMT_BODY_BLOCK (t)) | |
7951 | finish_function_body (stmt); | |
7952 | else | |
7a3397c7 | 7953 | finish_compound_stmt (stmt); |
5566b478 MS |
7954 | } |
7955 | break; | |
8d08fdba | 7956 | |
5566b478 | 7957 | case BREAK_STMT: |
a7e4cfa0 | 7958 | prep_stmt (t); |
ad321293 | 7959 | finish_break_stmt (); |
5566b478 | 7960 | break; |
8d08fdba | 7961 | |
6467930b | 7962 | case CONTINUE_STMT: |
a7e4cfa0 | 7963 | prep_stmt (t); |
ad321293 | 7964 | finish_continue_stmt (); |
6467930b MS |
7965 | break; |
7966 | ||
5566b478 MS |
7967 | case SWITCH_STMT: |
7968 | { | |
558475f0 | 7969 | tree val; |
5566b478 | 7970 | |
a7e4cfa0 | 7971 | prep_stmt (t); |
527f0080 | 7972 | stmt = begin_switch_stmt (); |
4393e105 | 7973 | val = tsubst_expr (SWITCH_COND (t), args, complain, in_decl); |
527f0080 | 7974 | finish_switch_cond (val, stmt); |
558475f0 | 7975 | tsubst_expr (SWITCH_BODY (t), args, complain, in_decl); |
35b1567d | 7976 | finish_switch_stmt (stmt); |
5566b478 MS |
7977 | } |
7978 | break; | |
7979 | ||
7980 | case CASE_LABEL: | |
a7e4cfa0 | 7981 | prep_stmt (t); |
4393e105 | 7982 | finish_case_label (tsubst_expr (CASE_LOW (t), args, complain, in_decl), |
56cb9733 MM |
7983 | tsubst_expr (CASE_HIGH (t), args, complain, |
7984 | in_decl)); | |
5566b478 MS |
7985 | break; |
7986 | ||
acef433b | 7987 | case LABEL_STMT: |
6de9cd9a | 7988 | prep_stmt (t); |
acef433b | 7989 | finish_label_stmt (DECL_NAME (LABEL_STMT_LABEL (t))); |
5566b478 MS |
7990 | break; |
7991 | ||
7992 | case GOTO_STMT: | |
a7e4cfa0 | 7993 | prep_stmt (t); |
fd10dd09 JM |
7994 | tmp = GOTO_DESTINATION (t); |
7995 | if (TREE_CODE (tmp) != LABEL_DECL) | |
aa09da44 MM |
7996 | /* Computed goto's must be tsubst'd into. On the other hand, |
7997 | non-computed gotos must not be; the identifier in question | |
7998 | will have no binding. */ | |
fd10dd09 | 7999 | tmp = tsubst_expr (tmp, args, complain, in_decl); |
3fa56191 | 8000 | else |
fd10dd09 JM |
8001 | tmp = DECL_NAME (tmp); |
8002 | finish_goto_stmt (tmp); | |
ad321293 MM |
8003 | break; |
8004 | ||
8005 | case ASM_STMT: | |
a7e4cfa0 | 8006 | prep_stmt (t); |
c87978aa | 8007 | tmp = finish_asm_stmt |
6de9cd9a | 8008 | (ASM_VOLATILE_P (t), |
c87978aa JM |
8009 | tsubst_expr (ASM_STRING (t), args, complain, in_decl), |
8010 | tsubst_expr (ASM_OUTPUTS (t), args, complain, in_decl), | |
8011 | tsubst_expr (ASM_INPUTS (t), args, complain, in_decl), | |
8012 | tsubst_expr (ASM_CLOBBERS (t), args, complain, in_decl)); | |
8013 | ASM_INPUT_P (tmp) = ASM_INPUT_P (t); | |
5566b478 | 8014 | break; |
faf5394a MS |
8015 | |
8016 | case TRY_BLOCK: | |
a7e4cfa0 | 8017 | prep_stmt (t); |
f1dedc31 | 8018 | if (CLEANUP_P (t)) |
62409b39 | 8019 | { |
57b52417 | 8020 | stmt = begin_try_block (); |
62409b39 MM |
8021 | tsubst_expr (TRY_STMTS (t), args, complain, in_decl); |
8022 | finish_cleanup_try_block (stmt); | |
8023 | finish_cleanup (tsubst_expr (TRY_HANDLERS (t), args, | |
8024 | complain, in_decl), | |
8025 | stmt); | |
8026 | } | |
f1dedc31 MM |
8027 | else |
8028 | { | |
62409b39 MM |
8029 | if (FN_TRY_BLOCK_P (t)) |
8030 | stmt = begin_function_try_block (); | |
8031 | else | |
8032 | stmt = begin_try_block (); | |
8033 | ||
8034 | tsubst_expr (TRY_STMTS (t), args, complain, in_decl); | |
8035 | ||
8036 | if (FN_TRY_BLOCK_P (t)) | |
8037 | finish_function_try_block (stmt); | |
8038 | else | |
8039 | finish_try_block (stmt); | |
8040 | ||
fd10dd09 | 8041 | tsubst_expr (TRY_HANDLERS (t), args, complain, in_decl); |
84df082b MM |
8042 | if (FN_TRY_BLOCK_P (t)) |
8043 | finish_function_handler_sequence (stmt); | |
8044 | else | |
8045 | finish_handler_sequence (stmt); | |
f1dedc31 | 8046 | } |
faf5394a | 8047 | break; |
b35d4555 | 8048 | |
faf5394a | 8049 | case HANDLER: |
b35d4555 MM |
8050 | { |
8051 | tree decl; | |
b35d4555 MM |
8052 | |
8053 | prep_stmt (t); | |
8054 | stmt = begin_handler (); | |
8055 | if (HANDLER_PARMS (t)) | |
8056 | { | |
8057 | decl = DECL_STMT_DECL (HANDLER_PARMS (t)); | |
8058 | decl = tsubst (decl, args, complain, in_decl); | |
f8191e64 MM |
8059 | /* Prevent instantiate_decl from trying to instantiate |
8060 | this variable. We've already done all that needs to be | |
8061 | done. */ | |
8062 | DECL_TEMPLATE_INSTANTIATED (decl) = 1; | |
b35d4555 MM |
8063 | } |
8064 | else | |
8065 | decl = NULL_TREE; | |
1a6025b4 | 8066 | finish_handler_parms (decl, stmt); |
b35d4555 | 8067 | tsubst_expr (HANDLER_BODY (t), args, complain, in_decl); |
1a6025b4 | 8068 | finish_handler (stmt); |
b35d4555 | 8069 | } |
faf5394a MS |
8070 | break; |
8071 | ||
b87692e5 | 8072 | case TAG_DEFN: |
a7e4cfa0 | 8073 | prep_stmt (t); |
fd10dd09 | 8074 | tsubst (TREE_TYPE (t), args, complain, NULL_TREE); |
b87692e5 MS |
8075 | break; |
8076 | ||
5566b478 | 8077 | default: |
fd10dd09 | 8078 | abort (); |
5566b478 | 8079 | } |
fd10dd09 | 8080 | |
a5bcc582 | 8081 | return tsubst_expr (TREE_CHAIN (t), args, complain | stmt_expr, in_decl); |
8d08fdba MS |
8082 | } |
8083 | ||
b3445994 MM |
8084 | /* T is a postfix-expression that is not being used in a function |
8085 | call. Return the substituted version of T. */ | |
8086 | ||
8087 | static tree | |
8088 | tsubst_non_call_postfix_expression (tree t, tree args, | |
8089 | tsubst_flags_t complain, | |
8090 | tree in_decl) | |
8091 | { | |
8092 | if (TREE_CODE (t) == SCOPE_REF) | |
8093 | t = tsubst_qualified_id (t, args, complain, in_decl, | |
8094 | /*done=*/false, /*address_p=*/false); | |
8095 | else | |
8096 | t = tsubst_copy_and_build (t, args, complain, in_decl, | |
8097 | /*function_p=*/false); | |
8098 | ||
8099 | return t; | |
8100 | } | |
8101 | ||
cc23546e | 8102 | /* Like tsubst but deals with expressions and performs semantic |
b3445994 | 8103 | analysis. FUNCTION_P is true if T is the "F" in "F (ARGS)". */ |
cc23546e | 8104 | |
ee76b931 | 8105 | tree |
3a978d72 NN |
8106 | tsubst_copy_and_build (tree t, |
8107 | tree args, | |
8108 | tsubst_flags_t complain, | |
b3445994 MM |
8109 | tree in_decl, |
8110 | bool function_p) | |
cc23546e | 8111 | { |
b3445994 MM |
8112 | #define RECUR(NODE) \ |
8113 | tsubst_copy_and_build (NODE, args, complain, in_decl, /*function_p=*/false) | |
8114 | ||
ee76b931 MM |
8115 | tree op1; |
8116 | ||
cc23546e JO |
8117 | if (t == NULL_TREE || t == error_mark_node) |
8118 | return t; | |
8119 | ||
8120 | switch (TREE_CODE (t)) | |
8121 | { | |
399dedb9 NS |
8122 | case USING_DECL: |
8123 | t = DECL_NAME (t); | |
852dcbdd | 8124 | /* Fall through. */ |
b3445994 | 8125 | case IDENTIFIER_NODE: |
cc23546e | 8126 | { |
b3445994 | 8127 | tree decl; |
b3445994 MM |
8128 | cp_id_kind idk; |
8129 | tree qualifying_class; | |
67c03833 | 8130 | bool non_integral_constant_expression_p; |
b3445994 MM |
8131 | const char *error_msg; |
8132 | ||
b3445994 | 8133 | if (IDENTIFIER_TYPENAME_P (t)) |
cc23546e | 8134 | { |
b3445994 MM |
8135 | tree new_type = tsubst (TREE_TYPE (t), args, complain, in_decl); |
8136 | t = mangle_conv_op_name_for_type (new_type); | |
cc23546e | 8137 | } |
b3445994 MM |
8138 | |
8139 | /* Look up the name. */ | |
10b1d5e7 | 8140 | decl = lookup_name (t, 0); |
b3445994 MM |
8141 | |
8142 | /* By convention, expressions use ERROR_MARK_NODE to indicate | |
8143 | failure, not NULL_TREE. */ | |
8144 | if (decl == NULL_TREE) | |
8145 | decl = error_mark_node; | |
8146 | ||
10b1d5e7 | 8147 | decl = finish_id_expression (t, decl, NULL_TREE, |
b3445994 MM |
8148 | &idk, |
8149 | &qualifying_class, | |
67c03833 JM |
8150 | /*integral_constant_expression_p=*/false, |
8151 | /*allow_non_integral_constant_expression_p=*/false, | |
8152 | &non_integral_constant_expression_p, | |
b3445994 MM |
8153 | &error_msg); |
8154 | if (error_msg) | |
8155 | error (error_msg); | |
8156 | if (!function_p && TREE_CODE (decl) == IDENTIFIER_NODE) | |
8157 | decl = unqualified_name_lookup_error (decl); | |
8158 | return decl; | |
cc23546e JO |
8159 | } |
8160 | ||
8161 | case TEMPLATE_ID_EXPR: | |
8162 | { | |
8163 | tree object; | |
b3445994 | 8164 | tree template = RECUR (TREE_OPERAND (t, 0)); |
bf12d54d NS |
8165 | tree targs = TREE_OPERAND (t, 1); |
8166 | ||
8167 | if (targs) | |
8168 | targs = tsubst_template_args (targs, args, complain, in_decl); | |
cc23546e JO |
8169 | |
8170 | if (TREE_CODE (template) == COMPONENT_REF) | |
8171 | { | |
8172 | object = TREE_OPERAND (template, 0); | |
8173 | template = TREE_OPERAND (template, 1); | |
8174 | } | |
8175 | else | |
8176 | object = NULL_TREE; | |
bd83b409 | 8177 | template = lookup_template_function (template, targs); |
cc23546e JO |
8178 | |
8179 | if (object) | |
8180 | return build (COMPONENT_REF, TREE_TYPE (template), | |
8181 | object, template); | |
8182 | else | |
8183 | return template; | |
8184 | } | |
8185 | ||
8186 | case INDIRECT_REF: | |
b3445994 | 8187 | return build_x_indirect_ref (RECUR (TREE_OPERAND (t, 0)), "unary *"); |
cc23546e | 8188 | |
0da99d4e GB |
8189 | case NOP_EXPR: |
8190 | return build_nop | |
8191 | (tsubst (TREE_TYPE (t), args, complain, in_decl), | |
8192 | RECUR (TREE_OPERAND (t, 0))); | |
8193 | ||
cc23546e JO |
8194 | case CAST_EXPR: |
8195 | return build_functional_cast | |
8196 | (tsubst (TREE_TYPE (t), args, complain, in_decl), | |
b3445994 | 8197 | RECUR (TREE_OPERAND (t, 0))); |
cc23546e JO |
8198 | |
8199 | case REINTERPRET_CAST_EXPR: | |
8200 | return build_reinterpret_cast | |
8201 | (tsubst (TREE_TYPE (t), args, complain, in_decl), | |
b3445994 | 8202 | RECUR (TREE_OPERAND (t, 0))); |
cc23546e JO |
8203 | |
8204 | case CONST_CAST_EXPR: | |
8205 | return build_const_cast | |
8206 | (tsubst (TREE_TYPE (t), args, complain, in_decl), | |
b3445994 | 8207 | RECUR (TREE_OPERAND (t, 0))); |
cc23546e JO |
8208 | |
8209 | case DYNAMIC_CAST_EXPR: | |
8210 | return build_dynamic_cast | |
8211 | (tsubst (TREE_TYPE (t), args, complain, in_decl), | |
b3445994 | 8212 | RECUR (TREE_OPERAND (t, 0))); |
cc23546e JO |
8213 | |
8214 | case STATIC_CAST_EXPR: | |
8215 | return build_static_cast | |
8216 | (tsubst (TREE_TYPE (t), args, complain, in_decl), | |
b3445994 | 8217 | RECUR (TREE_OPERAND (t, 0))); |
cc23546e | 8218 | |
cc23546e JO |
8219 | case POSTDECREMENT_EXPR: |
8220 | case POSTINCREMENT_EXPR: | |
b3445994 MM |
8221 | op1 = tsubst_non_call_postfix_expression (TREE_OPERAND (t, 0), |
8222 | args, complain, in_decl); | |
ee76b931 MM |
8223 | return build_x_unary_op (TREE_CODE (t), op1); |
8224 | ||
8225 | case PREDECREMENT_EXPR: | |
8226 | case PREINCREMENT_EXPR: | |
cc23546e JO |
8227 | case NEGATE_EXPR: |
8228 | case BIT_NOT_EXPR: | |
cc23546e | 8229 | case ABS_EXPR: |
d17811fd MM |
8230 | case TRUTH_NOT_EXPR: |
8231 | case CONVERT_EXPR: /* Unary + */ | |
8232 | case REALPART_EXPR: | |
8233 | case IMAGPART_EXPR: | |
b3445994 | 8234 | return build_x_unary_op (TREE_CODE (t), RECUR (TREE_OPERAND (t, 0))); |
cc23546e | 8235 | |
cc23546e | 8236 | case ADDR_EXPR: |
ee76b931 MM |
8237 | op1 = TREE_OPERAND (t, 0); |
8238 | if (TREE_CODE (op1) == SCOPE_REF) | |
8239 | op1 = tsubst_qualified_id (op1, args, complain, in_decl, | |
8240 | /*done=*/true, /*address_p=*/true); | |
8241 | else | |
b3445994 MM |
8242 | op1 = tsubst_non_call_postfix_expression (op1, args, complain, |
8243 | in_decl); | |
fc2b8477 MM |
8244 | if (TREE_CODE (op1) == LABEL_DECL) |
8245 | return finish_label_address_expr (DECL_NAME (op1)); | |
ee76b931 MM |
8246 | return build_x_unary_op (ADDR_EXPR, op1); |
8247 | ||
cc23546e JO |
8248 | case PLUS_EXPR: |
8249 | case MINUS_EXPR: | |
8250 | case MULT_EXPR: | |
8251 | case TRUNC_DIV_EXPR: | |
8252 | case CEIL_DIV_EXPR: | |
8253 | case FLOOR_DIV_EXPR: | |
8254 | case ROUND_DIV_EXPR: | |
8255 | case EXACT_DIV_EXPR: | |
8256 | case BIT_AND_EXPR: | |
cc23546e JO |
8257 | case BIT_IOR_EXPR: |
8258 | case BIT_XOR_EXPR: | |
8259 | case TRUNC_MOD_EXPR: | |
8260 | case FLOOR_MOD_EXPR: | |
8261 | case TRUTH_ANDIF_EXPR: | |
8262 | case TRUTH_ORIF_EXPR: | |
8263 | case TRUTH_AND_EXPR: | |
8264 | case TRUTH_OR_EXPR: | |
8265 | case RSHIFT_EXPR: | |
8266 | case LSHIFT_EXPR: | |
8267 | case RROTATE_EXPR: | |
8268 | case LROTATE_EXPR: | |
8269 | case EQ_EXPR: | |
8270 | case NE_EXPR: | |
8271 | case MAX_EXPR: | |
8272 | case MIN_EXPR: | |
8273 | case LE_EXPR: | |
8274 | case GE_EXPR: | |
8275 | case LT_EXPR: | |
8276 | case GT_EXPR: | |
8277 | case MEMBER_REF: | |
b3445994 | 8278 | case DOTSTAR_EXPR: |
cc23546e JO |
8279 | return build_x_binary_op |
8280 | (TREE_CODE (t), | |
b3445994 | 8281 | RECUR (TREE_OPERAND (t, 0)), |
ec835fb2 MM |
8282 | RECUR (TREE_OPERAND (t, 1)), |
8283 | /*overloaded_p=*/NULL); | |
cc23546e JO |
8284 | |
8285 | case SCOPE_REF: | |
ee76b931 MM |
8286 | return tsubst_qualified_id (t, args, complain, in_decl, /*done=*/true, |
8287 | /*address_p=*/false); | |
cc23546e JO |
8288 | |
8289 | case ARRAY_REF: | |
ee76b931 MM |
8290 | if (tsubst_copy (TREE_OPERAND (t, 0), args, complain, in_decl) |
8291 | == NULL_TREE) | |
8292 | /* new-type-id */ | |
b3445994 | 8293 | return build_nt (ARRAY_REF, NULL_TREE, RECUR (TREE_OPERAND (t, 1))); |
ee76b931 | 8294 | |
b3445994 MM |
8295 | op1 = tsubst_non_call_postfix_expression (TREE_OPERAND (t, 0), |
8296 | args, complain, in_decl); | |
ee76b931 MM |
8297 | /* Remember that there was a reference to this entity. */ |
8298 | if (DECL_P (op1)) | |
8299 | mark_used (op1); | |
b3445994 | 8300 | return grok_array_decl (op1, RECUR (TREE_OPERAND (t, 1))); |
cc23546e JO |
8301 | |
8302 | case SIZEOF_EXPR: | |
8303 | case ALIGNOF_EXPR: | |
d17811fd MM |
8304 | op1 = TREE_OPERAND (t, 0); |
8305 | if (!args) | |
8306 | { | |
8307 | /* When there are no ARGS, we are trying to evaluate a | |
8308 | non-dependent expression from the parser. Trying to do | |
8309 | the substitutions may not work. */ | |
8310 | if (!TYPE_P (op1)) | |
8311 | op1 = TREE_TYPE (op1); | |
8312 | } | |
8313 | else | |
8314 | { | |
8315 | ++skip_evaluation; | |
b3445994 | 8316 | op1 = RECUR (op1); |
d17811fd MM |
8317 | --skip_evaluation; |
8318 | } | |
7a18b933 NS |
8319 | if (TYPE_P (op1)) |
8320 | return cxx_sizeof_or_alignof_type (op1, TREE_CODE (t), true); | |
d17811fd | 8321 | else |
7a18b933 | 8322 | return cxx_sizeof_or_alignof_expr (op1, TREE_CODE (t)); |
cc23546e JO |
8323 | |
8324 | case MODOP_EXPR: | |
8325 | return build_x_modify_expr | |
b3445994 | 8326 | (RECUR (TREE_OPERAND (t, 0)), |
cc23546e | 8327 | TREE_CODE (TREE_OPERAND (t, 1)), |
b3445994 | 8328 | RECUR (TREE_OPERAND (t, 2))); |
cc23546e JO |
8329 | |
8330 | case ARROW_EXPR: | |
b3445994 MM |
8331 | op1 = tsubst_non_call_postfix_expression (TREE_OPERAND (t, 0), |
8332 | args, complain, in_decl); | |
ee76b931 MM |
8333 | /* Remember that there was a reference to this entity. */ |
8334 | if (DECL_P (op1)) | |
8335 | mark_used (op1); | |
8336 | return build_x_arrow (op1); | |
cc23546e JO |
8337 | |
8338 | case NEW_EXPR: | |
8339 | return build_new | |
b3445994 MM |
8340 | (RECUR (TREE_OPERAND (t, 0)), |
8341 | RECUR (TREE_OPERAND (t, 1)), | |
8342 | RECUR (TREE_OPERAND (t, 2)), | |
cc23546e JO |
8343 | NEW_EXPR_USE_GLOBAL (t)); |
8344 | ||
8345 | case DELETE_EXPR: | |
8346 | return delete_sanity | |
b3445994 MM |
8347 | (RECUR (TREE_OPERAND (t, 0)), |
8348 | RECUR (TREE_OPERAND (t, 1)), | |
cc23546e JO |
8349 | DELETE_EXPR_USE_VEC (t), |
8350 | DELETE_EXPR_USE_GLOBAL (t)); | |
8351 | ||
8352 | case COMPOUND_EXPR: | |
b3445994 MM |
8353 | return build_x_compound_expr (RECUR (TREE_OPERAND (t, 0)), |
8354 | RECUR (TREE_OPERAND (t, 1))); | |
cc23546e | 8355 | |
ee76b931 | 8356 | case CALL_EXPR: |
cc23546e | 8357 | { |
ee76b931 MM |
8358 | tree function; |
8359 | tree call_args; | |
ee76b931 | 8360 | bool qualified_p; |
ee935db4 | 8361 | bool koenig_p; |
ee76b931 MM |
8362 | |
8363 | function = TREE_OPERAND (t, 0); | |
6d80c4b9 MM |
8364 | /* When we parsed the expression, we determined whether or |
8365 | not Koenig lookup should be performed. */ | |
8366 | koenig_p = KOENIG_LOOKUP_P (t); | |
ee76b931 | 8367 | if (TREE_CODE (function) == SCOPE_REF) |
cc23546e | 8368 | { |
ee76b931 MM |
8369 | qualified_p = true; |
8370 | function = tsubst_qualified_id (function, args, complain, in_decl, | |
8371 | /*done=*/false, | |
8372 | /*address_p=*/false); | |
cc23546e | 8373 | } |
ee76b931 | 8374 | else |
cc23546e | 8375 | { |
ee76b931 MM |
8376 | qualified_p = (TREE_CODE (function) == COMPONENT_REF |
8377 | && (TREE_CODE (TREE_OPERAND (function, 1)) | |
8378 | == SCOPE_REF)); | |
8379 | function = tsubst_copy_and_build (function, args, complain, | |
b3445994 MM |
8380 | in_decl, |
8381 | !qualified_p); | |
6d80c4b9 MM |
8382 | if (BASELINK_P (function)) |
8383 | qualified_p = true; | |
cc23546e | 8384 | } |
cc23546e | 8385 | |
b3445994 | 8386 | call_args = RECUR (TREE_OPERAND (t, 1)); |
676e33ca MM |
8387 | |
8388 | /* We do not perform argument-dependent lookup if normal | |
8389 | lookup finds a non-function, in accordance with the | |
8390 | expected resolution of DR 218. */ | |
ee935db4 | 8391 | if (koenig_p |
b3445994 | 8392 | && (is_overloaded_fn (function) |
b3445994 | 8393 | || TREE_CODE (function) == IDENTIFIER_NODE)) |
6d80c4b9 MM |
8394 | function = perform_koenig_lookup (function, call_args); |
8395 | ||
8396 | if (TREE_CODE (function) == IDENTIFIER_NODE) | |
b3445994 | 8397 | { |
6d80c4b9 MM |
8398 | unqualified_name_lookup_error (function); |
8399 | return error_mark_node; | |
b3445994 MM |
8400 | } |
8401 | ||
8402 | /* Remember that there was a reference to this entity. */ | |
8403 | if (DECL_P (function)) | |
8404 | mark_used (function); | |
8405 | ||
8406 | function = convert_from_reference (function); | |
d17811fd MM |
8407 | |
8408 | if (TREE_CODE (function) == OFFSET_REF) | |
8409 | return build_offset_ref_call_from_tree (function, call_args); | |
8410 | if (TREE_CODE (function) == COMPONENT_REF) | |
9f880ef9 MM |
8411 | { |
8412 | if (!BASELINK_P (TREE_OPERAND (function, 1))) | |
8413 | return finish_call_expr (function, call_args, | |
8414 | /*disallow_virtual=*/false, | |
8415 | /*koenig_p=*/false); | |
8416 | else | |
8417 | return (build_new_method_call | |
8418 | (TREE_OPERAND (function, 0), | |
8419 | TREE_OPERAND (function, 1), | |
8420 | call_args, NULL_TREE, | |
8421 | qualified_p ? LOOKUP_NONVIRTUAL : LOOKUP_NORMAL)); | |
8422 | } | |
d17811fd | 8423 | return finish_call_expr (function, call_args, |
6d80c4b9 MM |
8424 | /*disallow_virtual=*/qualified_p, |
8425 | koenig_p); | |
cc23546e JO |
8426 | } |
8427 | ||
8428 | case COND_EXPR: | |
8429 | return build_x_conditional_expr | |
b3445994 MM |
8430 | (RECUR (TREE_OPERAND (t, 0)), |
8431 | RECUR (TREE_OPERAND (t, 1)), | |
8432 | RECUR (TREE_OPERAND (t, 2))); | |
cc23546e JO |
8433 | |
8434 | case PSEUDO_DTOR_EXPR: | |
8435 | return finish_pseudo_destructor_expr | |
b3445994 MM |
8436 | (RECUR (TREE_OPERAND (t, 0)), |
8437 | RECUR (TREE_OPERAND (t, 1)), | |
8438 | RECUR (TREE_OPERAND (t, 2))); | |
cc23546e JO |
8439 | |
8440 | case TREE_LIST: | |
8441 | { | |
8442 | tree purpose, value, chain; | |
8443 | ||
8444 | if (t == void_list_node) | |
8445 | return t; | |
8446 | ||
8447 | purpose = TREE_PURPOSE (t); | |
8448 | if (purpose) | |
b3445994 | 8449 | purpose = RECUR (purpose); |
cc23546e JO |
8450 | value = TREE_VALUE (t); |
8451 | if (value) | |
b3445994 | 8452 | value = RECUR (value); |
cc23546e JO |
8453 | chain = TREE_CHAIN (t); |
8454 | if (chain && chain != void_type_node) | |
b3445994 | 8455 | chain = RECUR (chain); |
cc23546e JO |
8456 | if (purpose == TREE_PURPOSE (t) |
8457 | && value == TREE_VALUE (t) | |
8458 | && chain == TREE_CHAIN (t)) | |
8459 | return t; | |
8460 | return tree_cons (purpose, value, chain); | |
8461 | } | |
8462 | ||
8463 | case COMPONENT_REF: | |
8464 | { | |
ee76b931 MM |
8465 | tree object; |
8466 | tree member; | |
8467 | ||
b3445994 MM |
8468 | object = tsubst_non_call_postfix_expression (TREE_OPERAND (t, 0), |
8469 | args, complain, in_decl); | |
ee76b931 MM |
8470 | /* Remember that there was a reference to this entity. */ |
8471 | if (DECL_P (object)) | |
8472 | mark_used (object); | |
8473 | ||
8474 | member = TREE_OPERAND (t, 1); | |
8475 | if (BASELINK_P (member)) | |
8476 | member = tsubst_baselink (member, | |
8477 | non_reference (TREE_TYPE (object)), | |
8478 | args, complain, in_decl); | |
8479 | else | |
8480 | member = tsubst_copy (member, args, complain, in_decl); | |
cc23546e JO |
8481 | |
8482 | if (!CLASS_TYPE_P (TREE_TYPE (object))) | |
8483 | { | |
8484 | if (TREE_CODE (member) == BIT_NOT_EXPR) | |
8485 | return finish_pseudo_destructor_expr (object, | |
8486 | NULL_TREE, | |
8487 | TREE_TYPE (object)); | |
8488 | else if (TREE_CODE (member) == SCOPE_REF | |
8489 | && (TREE_CODE (TREE_OPERAND (member, 1)) == BIT_NOT_EXPR)) | |
8490 | return finish_pseudo_destructor_expr (object, | |
8491 | object, | |
8492 | TREE_TYPE (object)); | |
8493 | } | |
8494 | else if (TREE_CODE (member) == SCOPE_REF | |
8495 | && TREE_CODE (TREE_OPERAND (member, 1)) == TEMPLATE_ID_EXPR) | |
8496 | { | |
8497 | tree tmpl; | |
8498 | tree args; | |
8499 | ||
8500 | /* Lookup the template functions now that we know what the | |
8501 | scope is. */ | |
8502 | tmpl = TREE_OPERAND (TREE_OPERAND (member, 1), 0); | |
8503 | args = TREE_OPERAND (TREE_OPERAND (member, 1), 1); | |
22038b2c | 8504 | member = lookup_qualified_name (TREE_OPERAND (member, 0), tmpl, |
12483c9f NS |
8505 | /*is_type_p=*/false, |
8506 | /*complain=*/false); | |
cc23546e JO |
8507 | if (BASELINK_P (member)) |
8508 | BASELINK_FUNCTIONS (member) | |
8509 | = build_nt (TEMPLATE_ID_EXPR, BASELINK_FUNCTIONS (member), | |
8510 | args); | |
8511 | else | |
8512 | { | |
22038b2c | 8513 | qualified_name_lookup_error (TREE_TYPE (object), tmpl); |
cc23546e JO |
8514 | return error_mark_node; |
8515 | } | |
8516 | } | |
a3f10e50 NS |
8517 | else if (TREE_CODE (member) == FIELD_DECL) |
8518 | return finish_non_static_data_member (member, object, NULL_TREE); | |
cc23546e JO |
8519 | |
8520 | return finish_class_member_access_expr (object, member); | |
8521 | } | |
8522 | ||
8523 | case THROW_EXPR: | |
8524 | return build_throw | |
b3445994 | 8525 | (RECUR (TREE_OPERAND (t, 0))); |
cc23546e JO |
8526 | |
8527 | case CONSTRUCTOR: | |
8528 | { | |
8529 | tree r; | |
8530 | tree elts; | |
8531 | tree type = tsubst (TREE_TYPE (t), args, complain, in_decl); | |
8532 | bool purpose_p; | |
8533 | ||
8534 | /* digest_init will do the wrong thing if we let it. */ | |
8535 | if (type && TYPE_PTRMEMFUNC_P (type)) | |
8536 | return t; | |
8537 | ||
8538 | r = NULL_TREE; | |
8539 | /* We do not want to process the purpose of aggregate | |
8540 | initializers as they are identifier nodes which will be | |
8541 | looked up by digest_init. */ | |
8542 | purpose_p = !(type && IS_AGGR_TYPE (type)); | |
db77ef4c | 8543 | for (elts = CONSTRUCTOR_ELTS (t); |
cc23546e JO |
8544 | elts; |
8545 | elts = TREE_CHAIN (elts)) | |
8546 | { | |
8547 | tree purpose = TREE_PURPOSE (elts); | |
8548 | tree value = TREE_VALUE (elts); | |
8549 | ||
8550 | if (purpose && purpose_p) | |
b3445994 MM |
8551 | purpose = RECUR (purpose); |
8552 | value = RECUR (value); | |
cc23546e JO |
8553 | r = tree_cons (purpose, value, r); |
8554 | } | |
8555 | ||
dcf92453 | 8556 | r = build_constructor (NULL_TREE, nreverse (r)); |
cc23546e JO |
8557 | TREE_HAS_CONSTRUCTOR (r) = TREE_HAS_CONSTRUCTOR (t); |
8558 | ||
8559 | if (type) | |
8560 | return digest_init (type, r, 0); | |
8561 | return r; | |
8562 | } | |
8563 | ||
8564 | case TYPEID_EXPR: | |
8565 | { | |
b3445994 | 8566 | tree operand_0 = RECUR (TREE_OPERAND (t, 0)); |
cc23546e JO |
8567 | if (TYPE_P (operand_0)) |
8568 | return get_typeid (operand_0); | |
8569 | return build_typeid (operand_0); | |
8570 | } | |
8571 | ||
8572 | case PARM_DECL: | |
8573 | return convert_from_reference (tsubst_copy (t, args, complain, in_decl)); | |
8574 | ||
8575 | case VAR_DECL: | |
ee76b931 MM |
8576 | if (args) |
8577 | t = tsubst_copy (t, args, complain, in_decl); | |
8578 | return convert_from_reference (t); | |
cc23546e JO |
8579 | |
8580 | case VA_ARG_EXPR: | |
b3445994 MM |
8581 | return build_x_va_arg (RECUR (TREE_OPERAND (t, 0)), |
8582 | tsubst_copy (TREE_TYPE (t), args, complain, | |
8583 | in_decl)); | |
cc23546e JO |
8584 | |
8585 | default: | |
8586 | return tsubst_copy (t, args, complain, in_decl); | |
8587 | } | |
b3445994 MM |
8588 | |
8589 | #undef RECUR | |
cc23546e JO |
8590 | } |
8591 | ||
3e4a3562 NS |
8592 | /* Verify that the instantiated ARGS are valid. For type arguments, |
8593 | make sure that the type's linkage is ok. For non-type arguments, | |
34cd5ae7 | 8594 | make sure they are constants if they are integral or enumerations. |
9bcb9aae | 8595 | Emit an error under control of COMPLAIN, and return TRUE on error. */ |
3e4a3562 NS |
8596 | |
8597 | static bool | |
3a978d72 | 8598 | check_instantiated_args (tree tmpl, tree args, tsubst_flags_t complain) |
3e4a3562 NS |
8599 | { |
8600 | int ix, len = DECL_NTPARMS (tmpl); | |
8601 | bool result = false; | |
8602 | ||
8603 | for (ix = 0; ix != len; ix++) | |
8604 | { | |
8605 | tree t = TREE_VEC_ELT (args, ix); | |
8606 | ||
8607 | if (TYPE_P (t)) | |
8608 | { | |
8609 | /* [basic.link]: A name with no linkage (notably, the name | |
8610 | of a class or enumeration declared in a local scope) | |
8611 | shall not be used to declare an entity with linkage. | |
8612 | This implies that names with no linkage cannot be used as | |
8613 | template arguments. */ | |
8614 | tree nt = no_linkage_check (t); | |
8615 | ||
8616 | if (nt) | |
8617 | { | |
8618 | if (!(complain & tf_error)) | |
8619 | /*OK*/; | |
8620 | else if (TYPE_ANONYMOUS_P (nt)) | |
8621 | error ("`%T' uses anonymous type", t); | |
8622 | else | |
8623 | error ("`%T' uses local type `%T'", t, nt); | |
8624 | result = true; | |
8625 | } | |
8626 | /* In order to avoid all sorts of complications, we do not | |
8627 | allow variably-modified types as template arguments. */ | |
8628 | else if (variably_modified_type_p (t)) | |
8629 | { | |
8630 | if (complain & tf_error) | |
8631 | error ("`%T' is a variably modified type", t); | |
8632 | result = true; | |
8633 | } | |
8634 | } | |
8635 | /* A non-type argument of integral or enumerated type must be a | |
8636 | constant. */ | |
8637 | else if (TREE_TYPE (t) | |
8638 | && INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (t)) | |
8639 | && !TREE_CONSTANT (t)) | |
8640 | { | |
8641 | if (complain & tf_error) | |
8642 | error ("integral expression `%E' is not constant", t); | |
8643 | result = true; | |
8644 | } | |
8645 | } | |
8646 | if (result && complain & tf_error) | |
8647 | error (" trying to instantiate `%D'", tmpl); | |
8648 | return result; | |
8649 | } | |
8650 | ||
6ba89f8e | 8651 | /* Instantiate the indicated variable or function template TMPL with |
36a117a5 MM |
8652 | the template arguments in TARG_PTR. */ |
8653 | ||
5566b478 | 8654 | tree |
3a978d72 | 8655 | instantiate_template (tree tmpl, tree targ_ptr, tsubst_flags_t complain) |
8d08fdba | 8656 | { |
5566b478 | 8657 | tree fndecl; |
36a117a5 MM |
8658 | tree gen_tmpl; |
8659 | tree spec; | |
5566b478 | 8660 | |
27fafc8d JM |
8661 | if (tmpl == error_mark_node) |
8662 | return error_mark_node; | |
8663 | ||
386b8a85 JM |
8664 | my_friendly_assert (TREE_CODE (tmpl) == TEMPLATE_DECL, 283); |
8665 | ||
db9b2174 MM |
8666 | /* If this function is a clone, handle it specially. */ |
8667 | if (DECL_CLONED_FUNCTION_P (tmpl)) | |
3ad97789 | 8668 | { |
a30f62e0 | 8669 | tree spec; |
3ad97789 NS |
8670 | tree clone; |
8671 | ||
a30f62e0 MM |
8672 | spec = instantiate_template (DECL_CLONED_FUNCTION (tmpl), targ_ptr, |
8673 | complain); | |
8674 | if (spec == error_mark_node) | |
8675 | return error_mark_node; | |
8676 | ||
c6002625 | 8677 | /* Look for the clone. */ |
3ad97789 NS |
8678 | for (clone = TREE_CHAIN (spec); |
8679 | clone && DECL_CLONED_FUNCTION_P (clone); | |
8680 | clone = TREE_CHAIN (clone)) | |
8681 | if (DECL_NAME (clone) == DECL_NAME (tmpl)) | |
8682 | return clone; | |
8683 | /* We should always have found the clone by now. */ | |
a98facb0 | 8684 | abort (); |
3ad97789 NS |
8685 | return NULL_TREE; |
8686 | } | |
8687 | ||
36a117a5 MM |
8688 | /* Check to see if we already have this specialization. */ |
8689 | spec = retrieve_specialization (tmpl, targ_ptr); | |
8690 | if (spec != NULL_TREE) | |
8691 | return spec; | |
8692 | ||
f9a7ae04 MM |
8693 | gen_tmpl = most_general_template (tmpl); |
8694 | if (tmpl != gen_tmpl) | |
386b8a85 | 8695 | { |
36a117a5 MM |
8696 | /* The TMPL is a partial instantiation. To get a full set of |
8697 | arguments we must add the arguments used to perform the | |
8698 | partial instantiation. */ | |
8699 | targ_ptr = add_outermost_template_args (DECL_TI_ARGS (tmpl), | |
8700 | targ_ptr); | |
36a117a5 MM |
8701 | |
8702 | /* Check to see if we already have this specialization. */ | |
8703 | spec = retrieve_specialization (gen_tmpl, targ_ptr); | |
75650646 MM |
8704 | if (spec != NULL_TREE) |
8705 | return spec; | |
386b8a85 JM |
8706 | } |
8707 | ||
3e4a3562 NS |
8708 | if (check_instantiated_args (gen_tmpl, INNERMOST_TEMPLATE_ARGS (targ_ptr), |
8709 | complain)) | |
8710 | return error_mark_node; | |
8711 | ||
2b907f5c KL |
8712 | /* We are building a FUNCTION_DECL, during which the access of its |
8713 | parameters and return types have to be checked. However this | |
8714 | FUNCTION_DECL which is the desired context for access checking | |
8715 | is not built yet. We solve this chicken-and-egg problem by | |
8716 | deferring all checks until we have the FUNCTION_DECL. */ | |
8717 | push_deferring_access_checks (dk_deferred); | |
5c74d5b0 | 8718 | |
f4f206f4 | 8719 | /* Substitute template parameters. */ |
17aec3eb | 8720 | fndecl = tsubst (DECL_TEMPLATE_RESULT (gen_tmpl), |
3e4a3562 | 8721 | targ_ptr, complain, gen_tmpl); |
5c74d5b0 | 8722 | |
2b907f5c KL |
8723 | /* Now we know the specialization, compute access previously |
8724 | deferred. */ | |
8725 | push_access_scope (fndecl); | |
8726 | perform_deferred_access_checks (); | |
8727 | pop_access_scope (fndecl); | |
8728 | pop_deferring_access_checks (); | |
5c74d5b0 | 8729 | |
36a117a5 MM |
8730 | /* The DECL_TI_TEMPLATE should always be the immediate parent |
8731 | template, not the most general template. */ | |
8732 | DECL_TI_TEMPLATE (fndecl) = tmpl; | |
8d08fdba | 8733 | |
94350948 | 8734 | /* If we've just instantiated the main entry point for a function, |
3ad97789 NS |
8735 | instantiate all the alternate entry points as well. We do this |
8736 | by cloning the instantiation of the main entry point, not by | |
8737 | instantiating the template clones. */ | |
8738 | if (TREE_CHAIN (gen_tmpl) && DECL_CLONED_FUNCTION_P (TREE_CHAIN (gen_tmpl))) | |
8739 | clone_function_decl (fndecl, /*update_method_vec_p=*/0); | |
94350948 | 8740 | |
5566b478 | 8741 | return fndecl; |
8d08fdba | 8742 | } |
5566b478 | 8743 | |
4393e105 MM |
8744 | /* The FN is a TEMPLATE_DECL for a function. The ARGS are the |
8745 | arguments that are being used when calling it. TARGS is a vector | |
8746 | into which the deduced template arguments are placed. | |
8d08fdba MS |
8747 | |
8748 | Return zero for success, 2 for an incomplete match that doesn't resolve | |
8749 | all the types, and 1 for complete failure. An error message will be | |
8750 | printed only for an incomplete match. | |
8751 | ||
e5214479 JM |
8752 | If FN is a conversion operator, or we are trying to produce a specific |
8753 | specialization, RETURN_TYPE is the return type desired. | |
9f54c803 MM |
8754 | |
8755 | The EXPLICIT_TARGS are explicit template arguments provided via a | |
8756 | template-id. | |
6467930b | 8757 | |
830bfa74 MM |
8758 | The parameter STRICT is one of: |
8759 | ||
8760 | DEDUCE_CALL: | |
8761 | We are deducing arguments for a function call, as in | |
8762 | [temp.deduct.call]. | |
8763 | ||
8764 | DEDUCE_CONV: | |
8765 | We are deducing arguments for a conversion function, as in | |
8766 | [temp.deduct.conv]. | |
8767 | ||
8768 | DEDUCE_EXACT: | |
62e4a758 NS |
8769 | We are deducing arguments when doing an explicit instantiation |
8770 | as in [temp.explicit], when determining an explicit specialization | |
8771 | as in [temp.expl.spec], or when taking the address of a function | |
8772 | template, as in [temp.deduct.funcaddr]. | |
8773 | ||
8774 | DEDUCE_ORDER: | |
830bfa74 MM |
8775 | We are deducing arguments when calculating the partial |
8776 | ordering between specializations of function or class | |
62e4a758 | 8777 | templates, as in [temp.func.order] and [temp.class.order]. |
4393e105 | 8778 | |
e5214479 JM |
8779 | LEN is the number of parms to consider before returning success, or -1 |
8780 | for all. This is used in partial ordering to avoid comparing parms for | |
8781 | which no actual argument was passed, since they are not considered in | |
8782 | overload resolution (and are explicitly excluded from consideration in | |
8783 | partial ordering in [temp.func.order]/6). */ | |
8d08fdba MS |
8784 | |
8785 | int | |
3a978d72 NN |
8786 | fn_type_unification (tree fn, |
8787 | tree explicit_targs, | |
8788 | tree targs, | |
8789 | tree args, | |
8790 | tree return_type, | |
8791 | unification_kind_t strict, | |
8792 | int len) | |
386b8a85 | 8793 | { |
4393e105 MM |
8794 | tree parms; |
8795 | tree fntype; | |
adecb3f4 | 8796 | int result; |
386b8a85 | 8797 | |
4393e105 | 8798 | my_friendly_assert (TREE_CODE (fn) == TEMPLATE_DECL, 0); |
2b59fc25 | 8799 | |
4393e105 MM |
8800 | fntype = TREE_TYPE (fn); |
8801 | if (explicit_targs) | |
75650646 | 8802 | { |
4393e105 MM |
8803 | /* [temp.deduct] |
8804 | ||
8805 | The specified template arguments must match the template | |
8806 | parameters in kind (i.e., type, nontype, template), and there | |
8807 | must not be more arguments than there are parameters; | |
8808 | otherwise type deduction fails. | |
8809 | ||
8810 | Nontype arguments must match the types of the corresponding | |
8811 | nontype template parameters, or must be convertible to the | |
8812 | types of the corresponding nontype parameters as specified in | |
8813 | _temp.arg.nontype_, otherwise type deduction fails. | |
8814 | ||
8815 | All references in the function type of the function template | |
8816 | to the corresponding template parameters are replaced by the | |
8817 | specified template argument values. If a substitution in a | |
8818 | template parameter or in the function type of the function | |
8819 | template results in an invalid type, type deduction fails. */ | |
8820 | int i; | |
8821 | tree converted_args; | |
ffd49b19 | 8822 | bool incomplete; |
75650646 | 8823 | |
4393e105 MM |
8824 | converted_args |
8825 | = (coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (fn), | |
c2ea3a40 | 8826 | explicit_targs, NULL_TREE, tf_none, |
4393e105 MM |
8827 | /*require_all_arguments=*/0)); |
8828 | if (converted_args == error_mark_node) | |
75650646 | 8829 | return 1; |
386b8a85 | 8830 | |
ffd49b19 NS |
8831 | /* Substitute the explicit args into the function type. This is |
8832 | necessary so that, for instance, explicitly declared function | |
8833 | arguments can match null pointed constants. If we were given | |
8834 | an incomplete set of explicit args, we must not do semantic | |
8835 | processing during substitution as we could create partial | |
8836 | instantiations. */ | |
8837 | incomplete = NUM_TMPL_ARGS (explicit_targs) != NUM_TMPL_ARGS (targs); | |
8838 | processing_template_decl += incomplete; | |
c2ea3a40 | 8839 | fntype = tsubst (fntype, converted_args, tf_none, NULL_TREE); |
ffd49b19 NS |
8840 | processing_template_decl -= incomplete; |
8841 | ||
4393e105 MM |
8842 | if (fntype == error_mark_node) |
8843 | return 1; | |
050367a3 | 8844 | |
4393e105 | 8845 | /* Place the explicitly specified arguments in TARGS. */ |
ffd49b19 | 8846 | for (i = NUM_TMPL_ARGS (converted_args); i--;) |
4393e105 | 8847 | TREE_VEC_ELT (targs, i) = TREE_VEC_ELT (converted_args, i); |
75650646 | 8848 | } |
4393e105 MM |
8849 | |
8850 | parms = TYPE_ARG_TYPES (fntype); | |
e5214479 JM |
8851 | /* Never do unification on the 'this' parameter. */ |
8852 | if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fn)) | |
8853 | parms = TREE_CHAIN (parms); | |
8d3631f8 NS |
8854 | |
8855 | if (return_type) | |
8856 | { | |
8857 | /* We've been given a return type to match, prepend it. */ | |
8858 | parms = tree_cons (NULL_TREE, TREE_TYPE (fntype), parms); | |
8859 | args = tree_cons (NULL_TREE, return_type, args); | |
16e42e7c JM |
8860 | if (len >= 0) |
8861 | ++len; | |
4393e105 MM |
8862 | } |
8863 | ||
4393e105 MM |
8864 | /* We allow incomplete unification without an error message here |
8865 | because the standard doesn't seem to explicitly prohibit it. Our | |
8866 | callers must be ready to deal with unification failures in any | |
8867 | event. */ | |
adecb3f4 MM |
8868 | result = type_unification_real (DECL_INNERMOST_TEMPLATE_PARMS (fn), |
8869 | targs, parms, args, /*subr=*/0, | |
e5214479 | 8870 | strict, /*allow_incomplete*/1, len); |
adecb3f4 MM |
8871 | |
8872 | if (result == 0) | |
8873 | /* All is well so far. Now, check: | |
8874 | ||
8875 | [temp.deduct] | |
8876 | ||
8877 | When all template arguments have been deduced, all uses of | |
8878 | template parameters in nondeduced contexts are replaced with | |
8879 | the corresponding deduced argument values. If the | |
8880 | substitution results in an invalid type, as described above, | |
8881 | type deduction fails. */ | |
c2ea3a40 | 8882 | if (tsubst (TREE_TYPE (fn), targs, tf_none, NULL_TREE) |
adecb3f4 MM |
8883 | == error_mark_node) |
8884 | return 1; | |
8885 | ||
8886 | return result; | |
830bfa74 MM |
8887 | } |
8888 | ||
8889 | /* Adjust types before performing type deduction, as described in | |
8890 | [temp.deduct.call] and [temp.deduct.conv]. The rules in these two | |
4c7d0dff MM |
8891 | sections are symmetric. PARM is the type of a function parameter |
8892 | or the return type of the conversion function. ARG is the type of | |
8893 | the argument passed to the call, or the type of the value | |
dc957d14 | 8894 | initialized with the result of the conversion function. */ |
386b8a85 | 8895 | |
62e4a758 | 8896 | static int |
3a978d72 NN |
8897 | maybe_adjust_types_for_deduction (unification_kind_t strict, |
8898 | tree* parm, | |
8899 | tree* arg) | |
830bfa74 | 8900 | { |
62e4a758 NS |
8901 | int result = 0; |
8902 | ||
830bfa74 MM |
8903 | switch (strict) |
8904 | { | |
8905 | case DEDUCE_CALL: | |
8906 | break; | |
8907 | ||
8908 | case DEDUCE_CONV: | |
8909 | { | |
4c7d0dff MM |
8910 | /* Swap PARM and ARG throughout the remainder of this |
8911 | function; the handling is precisely symmetric since PARM | |
8912 | will initialize ARG rather than vice versa. */ | |
830bfa74 MM |
8913 | tree* temp = parm; |
8914 | parm = arg; | |
8915 | arg = temp; | |
8916 | break; | |
8917 | } | |
8918 | ||
8919 | case DEDUCE_EXACT: | |
8920 | /* There is nothing to do in this case. */ | |
62e4a758 | 8921 | return 0; |
830bfa74 | 8922 | |
62e4a758 NS |
8923 | case DEDUCE_ORDER: |
8924 | /* DR 214. [temp.func.order] is underspecified, and leads to no | |
8925 | ordering between things like `T *' and `T const &' for `U *'. | |
8926 | The former has T=U and the latter T=U*. The former looks more | |
8927 | specialized and John Spicer considers it well-formed (the EDG | |
8928 | compiler accepts it). | |
8929 | ||
8930 | John also confirms that deduction should proceed as in a function | |
996065b4 | 8931 | call. Which implies the usual ARG and PARM conversions as DEDUCE_CALL. |
62e4a758 NS |
8932 | However, in ordering, ARG can have REFERENCE_TYPE, but no argument |
8933 | to an actual call can have such a type. | |
8934 | ||
996065b4 NS |
8935 | If both ARG and PARM are REFERENCE_TYPE, we change neither. |
8936 | If only ARG is a REFERENCE_TYPE, we look through that and then | |
8937 | proceed as with DEDUCE_CALL (which could further convert it). */ | |
62e4a758 NS |
8938 | if (TREE_CODE (*arg) == REFERENCE_TYPE) |
8939 | { | |
8940 | if (TREE_CODE (*parm) == REFERENCE_TYPE) | |
8941 | return 0; | |
8942 | *arg = TREE_TYPE (*arg); | |
62e4a758 NS |
8943 | } |
8944 | break; | |
830bfa74 | 8945 | default: |
a98facb0 | 8946 | abort (); |
830bfa74 MM |
8947 | } |
8948 | ||
8949 | if (TREE_CODE (*parm) != REFERENCE_TYPE) | |
8950 | { | |
8951 | /* [temp.deduct.call] | |
8952 | ||
8953 | If P is not a reference type: | |
8954 | ||
8955 | --If A is an array type, the pointer type produced by the | |
8956 | array-to-pointer standard conversion (_conv.array_) is | |
8957 | used in place of A for type deduction; otherwise, | |
8958 | ||
8959 | --If A is a function type, the pointer type produced by | |
8960 | the function-to-pointer standard conversion | |
8961 | (_conv.func_) is used in place of A for type deduction; | |
8962 | otherwise, | |
8963 | ||
8964 | --If A is a cv-qualified type, the top level | |
8965 | cv-qualifiers of A's type are ignored for type | |
8966 | deduction. */ | |
8967 | if (TREE_CODE (*arg) == ARRAY_TYPE) | |
8968 | *arg = build_pointer_type (TREE_TYPE (*arg)); | |
d8f8dca1 | 8969 | else if (TREE_CODE (*arg) == FUNCTION_TYPE) |
830bfa74 MM |
8970 | *arg = build_pointer_type (*arg); |
8971 | else | |
8972 | *arg = TYPE_MAIN_VARIANT (*arg); | |
8973 | } | |
8974 | ||
8975 | /* [temp.deduct.call] | |
8976 | ||
8977 | If P is a cv-qualified type, the top level cv-qualifiers | |
8978 | of P's type are ignored for type deduction. If P is a | |
8979 | reference type, the type referred to by P is used for | |
8980 | type deduction. */ | |
8981 | *parm = TYPE_MAIN_VARIANT (*parm); | |
8982 | if (TREE_CODE (*parm) == REFERENCE_TYPE) | |
62e4a758 NS |
8983 | { |
8984 | *parm = TREE_TYPE (*parm); | |
8985 | result |= UNIFY_ALLOW_OUTER_MORE_CV_QUAL; | |
8986 | } | |
1c82cc90 NS |
8987 | |
8988 | /* DR 322. For conversion deduction, remove a reference type on parm | |
8989 | too (which has been swapped into ARG). */ | |
8990 | if (strict == DEDUCE_CONV && TREE_CODE (*arg) == REFERENCE_TYPE) | |
8991 | *arg = TREE_TYPE (*arg); | |
8992 | ||
62e4a758 | 8993 | return result; |
386b8a85 JM |
8994 | } |
8995 | ||
e5214479 | 8996 | /* Most parms like fn_type_unification. |
9f54c803 MM |
8997 | |
8998 | If SUBR is 1, we're being called recursively (to unify the | |
8999 | arguments of a function or method parameter of a function | |
9000 | template). */ | |
386b8a85 | 9001 | |
4966381a | 9002 | static int |
3a978d72 NN |
9003 | type_unification_real (tree tparms, |
9004 | tree targs, | |
9005 | tree xparms, | |
9006 | tree xargs, | |
9007 | int subr, | |
9008 | unification_kind_t strict, | |
9009 | int allow_incomplete, | |
9010 | int xlen) | |
8d08fdba MS |
9011 | { |
9012 | tree parm, arg; | |
9013 | int i; | |
9014 | int ntparms = TREE_VEC_LENGTH (tparms); | |
830bfa74 | 9015 | int sub_strict; |
bd0d5d4a JM |
9016 | int saw_undeduced = 0; |
9017 | tree parms, args; | |
9018 | int len; | |
8d08fdba MS |
9019 | |
9020 | my_friendly_assert (TREE_CODE (tparms) == TREE_VEC, 289); | |
bd0d5d4a JM |
9021 | my_friendly_assert (xparms == NULL_TREE |
9022 | || TREE_CODE (xparms) == TREE_LIST, 290); | |
ee3071ef | 9023 | my_friendly_assert (!xargs || TREE_CODE (xargs) == TREE_LIST, 291); |
8d08fdba MS |
9024 | my_friendly_assert (ntparms > 0, 292); |
9025 | ||
830bfa74 MM |
9026 | switch (strict) |
9027 | { | |
9028 | case DEDUCE_CALL: | |
028d1f20 NS |
9029 | sub_strict = (UNIFY_ALLOW_OUTER_LEVEL | UNIFY_ALLOW_MORE_CV_QUAL |
9030 | | UNIFY_ALLOW_DERIVED); | |
830bfa74 MM |
9031 | break; |
9032 | ||
9033 | case DEDUCE_CONV: | |
9034 | sub_strict = UNIFY_ALLOW_LESS_CV_QUAL; | |
9035 | break; | |
9036 | ||
9037 | case DEDUCE_EXACT: | |
9038 | sub_strict = UNIFY_ALLOW_NONE; | |
9039 | break; | |
62e4a758 NS |
9040 | |
9041 | case DEDUCE_ORDER: | |
9042 | sub_strict = UNIFY_ALLOW_NONE; | |
9043 | break; | |
830bfa74 MM |
9044 | |
9045 | default: | |
a98facb0 | 9046 | abort (); |
830bfa74 MM |
9047 | } |
9048 | ||
bd0d5d4a | 9049 | if (xlen == 0) |
e5214479 JM |
9050 | return 0; |
9051 | ||
bd0d5d4a JM |
9052 | again: |
9053 | parms = xparms; | |
9054 | args = xargs; | |
9055 | len = xlen; | |
9056 | ||
8d08fdba MS |
9057 | while (parms |
9058 | && parms != void_list_node | |
9059 | && args | |
9060 | && args != void_list_node) | |
9061 | { | |
9062 | parm = TREE_VALUE (parms); | |
9063 | parms = TREE_CHAIN (parms); | |
9064 | arg = TREE_VALUE (args); | |
9065 | args = TREE_CHAIN (args); | |
9066 | ||
9067 | if (arg == error_mark_node) | |
9068 | return 1; | |
9069 | if (arg == unknown_type_node) | |
34016c81 JM |
9070 | /* We can't deduce anything from this, but we might get all the |
9071 | template args from other function args. */ | |
9072 | continue; | |
b7484fbe | 9073 | |
03e70705 JM |
9074 | /* Conversions will be performed on a function argument that |
9075 | corresponds with a function parameter that contains only | |
9076 | non-deducible template parameters and explicitly specified | |
9077 | template parameters. */ | |
c353b8e3 | 9078 | if (!uses_template_parms (parm)) |
b7484fbe | 9079 | { |
03e70705 JM |
9080 | tree type; |
9081 | ||
2f939d94 | 9082 | if (!TYPE_P (arg)) |
03e70705 JM |
9083 | type = TREE_TYPE (arg); |
9084 | else | |
c353b8e3 | 9085 | type = arg; |
03e70705 | 9086 | |
62e4a758 | 9087 | if (strict == DEDUCE_EXACT || strict == DEDUCE_ORDER) |
03e70705 | 9088 | { |
3bfdc719 | 9089 | if (same_type_p (parm, type)) |
03e70705 JM |
9090 | continue; |
9091 | } | |
03e70705 | 9092 | else |
343c89cd JM |
9093 | /* It might work; we shouldn't check now, because we might |
9094 | get into infinite recursion. Overload resolution will | |
9095 | handle it. */ | |
9096 | continue; | |
03e70705 | 9097 | |
b7484fbe MS |
9098 | return 1; |
9099 | } | |
9100 | ||
2f939d94 | 9101 | if (!TYPE_P (arg)) |
8d08fdba MS |
9102 | { |
9103 | my_friendly_assert (TREE_TYPE (arg) != NULL_TREE, 293); | |
34016c81 | 9104 | if (type_unknown_p (arg)) |
28cbf42c | 9105 | { |
34016c81 JM |
9106 | /* [temp.deduct.type] A template-argument can be deduced from |
9107 | a pointer to function or pointer to member function | |
9108 | argument if the set of overloaded functions does not | |
9109 | contain function templates and at most one of a set of | |
9110 | overloaded functions provides a unique match. */ | |
9111 | ||
9112 | if (resolve_overloaded_unification | |
4393e105 | 9113 | (tparms, targs, parm, arg, strict, sub_strict) |
34016c81 JM |
9114 | != 0) |
9115 | return 1; | |
9116 | continue; | |
28cbf42c | 9117 | } |
8d08fdba | 9118 | arg = TREE_TYPE (arg); |
08476342 NS |
9119 | if (arg == error_mark_node) |
9120 | return 1; | |
8d08fdba | 9121 | } |
62e4a758 NS |
9122 | |
9123 | { | |
9124 | int arg_strict = sub_strict; | |
9125 | ||
9126 | if (!subr) | |
9127 | arg_strict |= maybe_adjust_types_for_deduction (strict, &parm, &arg); | |
4393e105 | 9128 | |
62e4a758 NS |
9129 | if (unify (tparms, targs, parm, arg, arg_strict)) |
9130 | return 1; | |
9131 | } | |
e5214479 JM |
9132 | |
9133 | /* Are we done with the interesting parms? */ | |
9134 | if (--len == 0) | |
bd0d5d4a | 9135 | goto done; |
8d08fdba MS |
9136 | } |
9137 | /* Fail if we've reached the end of the parm list, and more args | |
9138 | are present, and the parm list isn't variadic. */ | |
9139 | if (args && args != void_list_node && parms == void_list_node) | |
9140 | return 1; | |
f4f206f4 | 9141 | /* Fail if parms are left and they don't have default values. */ |
8d08fdba MS |
9142 | if (parms |
9143 | && parms != void_list_node | |
9144 | && TREE_PURPOSE (parms) == NULL_TREE) | |
9145 | return 1; | |
bd0d5d4a JM |
9146 | |
9147 | done: | |
8d08fdba MS |
9148 | if (!subr) |
9149 | for (i = 0; i < ntparms; i++) | |
050367a3 | 9150 | if (TREE_VEC_ELT (targs, i) == NULL_TREE) |
8d08fdba | 9151 | { |
bd0d5d4a JM |
9152 | tree tparm = TREE_VALUE (TREE_VEC_ELT (tparms, i)); |
9153 | ||
9154 | /* If this is an undeduced nontype parameter that depends on | |
9155 | a type parameter, try another pass; its type may have been | |
9156 | deduced from a later argument than the one from which | |
9157 | this parameter can be deduced. */ | |
9158 | if (TREE_CODE (tparm) == PARM_DECL | |
9159 | && uses_template_parms (TREE_TYPE (tparm)) | |
9160 | && !saw_undeduced++) | |
9161 | goto again; | |
9162 | ||
386b8a85 | 9163 | if (!allow_incomplete) |
8251199e | 9164 | error ("incomplete type unification"); |
8d08fdba MS |
9165 | return 2; |
9166 | } | |
9167 | return 0; | |
9168 | } | |
9169 | ||
34016c81 JM |
9170 | /* Subroutine of type_unification_real. Args are like the variables at the |
9171 | call site. ARG is an overloaded function (or template-id); we try | |
9172 | deducing template args from each of the overloads, and if only one | |
9173 | succeeds, we go with that. Modifies TARGS and returns 0 on success. */ | |
9174 | ||
9175 | static int | |
3a978d72 NN |
9176 | resolve_overloaded_unification (tree tparms, |
9177 | tree targs, | |
9178 | tree parm, | |
9179 | tree arg, | |
9180 | unification_kind_t strict, | |
9181 | int sub_strict) | |
34016c81 JM |
9182 | { |
9183 | tree tempargs = copy_node (targs); | |
9184 | int good = 0; | |
f23fb7f5 | 9185 | bool addr_p; |
34016c81 JM |
9186 | |
9187 | if (TREE_CODE (arg) == ADDR_EXPR) | |
f23fb7f5 MM |
9188 | { |
9189 | arg = TREE_OPERAND (arg, 0); | |
9190 | addr_p = true; | |
9191 | } | |
9192 | else | |
9193 | addr_p = false; | |
9f3d9e46 | 9194 | |
d8f8dca1 MM |
9195 | if (TREE_CODE (arg) == COMPONENT_REF) |
9196 | /* Handle `&x' where `x' is some static or non-static member | |
9197 | function name. */ | |
9198 | arg = TREE_OPERAND (arg, 1); | |
9199 | ||
05e0b2f4 JM |
9200 | if (TREE_CODE (arg) == OFFSET_REF) |
9201 | arg = TREE_OPERAND (arg, 1); | |
9202 | ||
9f3d9e46 | 9203 | /* Strip baselink information. */ |
50ad9642 MM |
9204 | if (BASELINK_P (arg)) |
9205 | arg = BASELINK_FUNCTIONS (arg); | |
9f3d9e46 | 9206 | |
34016c81 JM |
9207 | if (TREE_CODE (arg) == TEMPLATE_ID_EXPR) |
9208 | { | |
9209 | /* If we got some explicit template args, we need to plug them into | |
9210 | the affected templates before we try to unify, in case the | |
9211 | explicit args will completely resolve the templates in question. */ | |
9212 | ||
9213 | tree expl_subargs = TREE_OPERAND (arg, 1); | |
9214 | arg = TREE_OPERAND (arg, 0); | |
9215 | ||
9216 | for (; arg; arg = OVL_NEXT (arg)) | |
9217 | { | |
9218 | tree fn = OVL_CURRENT (arg); | |
9219 | tree subargs, elem; | |
9220 | ||
9221 | if (TREE_CODE (fn) != TEMPLATE_DECL) | |
9222 | continue; | |
9223 | ||
17aec3eb RK |
9224 | subargs = get_bindings_overload (fn, DECL_TEMPLATE_RESULT (fn), |
9225 | expl_subargs); | |
34016c81 JM |
9226 | if (subargs) |
9227 | { | |
c2ea3a40 | 9228 | elem = tsubst (TREE_TYPE (fn), subargs, tf_none, NULL_TREE); |
f23fb7f5 MM |
9229 | good += try_one_overload (tparms, targs, tempargs, parm, |
9230 | elem, strict, sub_strict, addr_p); | |
34016c81 JM |
9231 | } |
9232 | } | |
9233 | } | |
db0f613d KL |
9234 | else if (TREE_CODE (arg) == OVERLOAD |
9235 | || TREE_CODE (arg) == FUNCTION_DECL) | |
34016c81 JM |
9236 | { |
9237 | for (; arg; arg = OVL_NEXT (arg)) | |
f23fb7f5 MM |
9238 | good += try_one_overload (tparms, targs, tempargs, parm, |
9239 | TREE_TYPE (OVL_CURRENT (arg)), | |
9240 | strict, sub_strict, addr_p); | |
34016c81 JM |
9241 | } |
9242 | else | |
a98facb0 | 9243 | abort (); |
34016c81 JM |
9244 | |
9245 | /* [temp.deduct.type] A template-argument can be deduced from a pointer | |
9246 | to function or pointer to member function argument if the set of | |
9247 | overloaded functions does not contain function templates and at most | |
9248 | one of a set of overloaded functions provides a unique match. | |
9249 | ||
9250 | So if we found multiple possibilities, we return success but don't | |
9251 | deduce anything. */ | |
9252 | ||
9253 | if (good == 1) | |
9254 | { | |
9255 | int i = TREE_VEC_LENGTH (targs); | |
9256 | for (; i--; ) | |
9257 | if (TREE_VEC_ELT (tempargs, i)) | |
9258 | TREE_VEC_ELT (targs, i) = TREE_VEC_ELT (tempargs, i); | |
9259 | } | |
9260 | if (good) | |
9261 | return 0; | |
9262 | ||
9263 | return 1; | |
9264 | } | |
9265 | ||
9266 | /* Subroutine of resolve_overloaded_unification; does deduction for a single | |
9267 | overload. Fills TARGS with any deduced arguments, or error_mark_node if | |
9268 | different overloads deduce different arguments for a given parm. | |
f23fb7f5 MM |
9269 | ADDR_P is true if the expression for which deduction is being |
9270 | performed was of the form "& fn" rather than simply "fn". | |
9271 | ||
34016c81 JM |
9272 | Returns 1 on success. */ |
9273 | ||
9274 | static int | |
3a978d72 NN |
9275 | try_one_overload (tree tparms, |
9276 | tree orig_targs, | |
9277 | tree targs, | |
9278 | tree parm, | |
9279 | tree arg, | |
9280 | unification_kind_t strict, | |
f23fb7f5 MM |
9281 | int sub_strict, |
9282 | bool addr_p) | |
34016c81 JM |
9283 | { |
9284 | int nargs; | |
9285 | tree tempargs; | |
9286 | int i; | |
9287 | ||
9288 | /* [temp.deduct.type] A template-argument can be deduced from a pointer | |
9289 | to function or pointer to member function argument if the set of | |
9290 | overloaded functions does not contain function templates and at most | |
9291 | one of a set of overloaded functions provides a unique match. | |
9292 | ||
9293 | So if this is a template, just return success. */ | |
9294 | ||
9295 | if (uses_template_parms (arg)) | |
9296 | return 1; | |
9297 | ||
f23fb7f5 MM |
9298 | if (TREE_CODE (arg) == METHOD_TYPE) |
9299 | arg = build_ptrmemfunc_type (build_pointer_type (arg)); | |
9300 | else if (addr_p) | |
9301 | arg = build_pointer_type (arg); | |
9302 | ||
62e4a758 | 9303 | sub_strict |= maybe_adjust_types_for_deduction (strict, &parm, &arg); |
34016c81 JM |
9304 | |
9305 | /* We don't copy orig_targs for this because if we have already deduced | |
9306 | some template args from previous args, unify would complain when we | |
9307 | try to deduce a template parameter for the same argument, even though | |
9308 | there isn't really a conflict. */ | |
9309 | nargs = TREE_VEC_LENGTH (targs); | |
f31c0a32 | 9310 | tempargs = make_tree_vec (nargs); |
34016c81 | 9311 | |
4393e105 | 9312 | if (unify (tparms, tempargs, parm, arg, sub_strict) != 0) |
34016c81 JM |
9313 | return 0; |
9314 | ||
9315 | /* First make sure we didn't deduce anything that conflicts with | |
e97e5263 | 9316 | explicitly specified args. */ |
34016c81 JM |
9317 | for (i = nargs; i--; ) |
9318 | { | |
9319 | tree elt = TREE_VEC_ELT (tempargs, i); | |
e97e5263 | 9320 | tree oldelt = TREE_VEC_ELT (orig_targs, i); |
34016c81 JM |
9321 | |
9322 | if (elt == NULL_TREE) | |
9323 | continue; | |
9324 | else if (uses_template_parms (elt)) | |
9325 | { | |
9326 | /* Since we're unifying against ourselves, we will fill in template | |
9327 | args used in the function parm list with our own template parms. | |
9328 | Discard them. */ | |
9329 | TREE_VEC_ELT (tempargs, i) = NULL_TREE; | |
9330 | continue; | |
9331 | } | |
9332 | else if (oldelt && ! template_args_equal (oldelt, elt)) | |
9333 | return 0; | |
9334 | } | |
9335 | ||
9336 | for (i = nargs; i--; ) | |
9337 | { | |
9338 | tree elt = TREE_VEC_ELT (tempargs, i); | |
9339 | ||
9340 | if (elt) | |
9341 | TREE_VEC_ELT (targs, i) = elt; | |
9342 | } | |
9343 | ||
9344 | return 1; | |
9345 | } | |
9346 | ||
74601d7c KL |
9347 | /* Verify that nondeduce template argument agrees with the type |
9348 | obtained from argument deduction. Return nonzero if the | |
9349 | verification fails. | |
9350 | ||
9351 | For example: | |
9352 | ||
9353 | struct A { typedef int X; }; | |
9354 | template <class T, class U> struct C {}; | |
9355 | template <class T> struct C<T, typename T::X> {}; | |
9356 | ||
9357 | Then with the instantiation `C<A, int>', we can deduce that | |
9358 | `T' is `A' but unify () does not check whether `typename T::X' | |
9359 | is `int'. This function ensure that they agree. | |
9360 | ||
9361 | TARGS, PARMS are the same as the arguments of unify. | |
9362 | ARGS contains template arguments from all levels. */ | |
9363 | ||
9364 | static int | |
3a978d72 | 9365 | verify_class_unification (tree targs, tree parms, tree args) |
74601d7c | 9366 | { |
e2005c8d KL |
9367 | parms = tsubst (parms, add_outermost_template_args (args, targs), |
9368 | tf_none, NULL_TREE); | |
9369 | if (parms == error_mark_node) | |
74601d7c KL |
9370 | return 1; |
9371 | ||
e2005c8d | 9372 | return !comp_template_args (parms, INNERMOST_TEMPLATE_ARGS (args)); |
74601d7c KL |
9373 | } |
9374 | ||
4393e105 MM |
9375 | /* PARM is a template class (perhaps with unbound template |
9376 | parameters). ARG is a fully instantiated type. If ARG can be | |
9377 | bound to PARM, return ARG, otherwise return NULL_TREE. TPARMS and | |
9378 | TARGS are as for unify. */ | |
fcfb9f96 MM |
9379 | |
9380 | static tree | |
3a978d72 | 9381 | try_class_unification (tree tparms, tree targs, tree parm, tree arg) |
4393e105 | 9382 | { |
4393e105 MM |
9383 | tree copy_of_targs; |
9384 | ||
9385 | if (!CLASSTYPE_TEMPLATE_INFO (arg) | |
68361a03 MM |
9386 | || (most_general_template (CLASSTYPE_TI_TEMPLATE (arg)) |
9387 | != most_general_template (CLASSTYPE_TI_TEMPLATE (parm)))) | |
4393e105 MM |
9388 | return NULL_TREE; |
9389 | ||
9390 | /* We need to make a new template argument vector for the call to | |
9391 | unify. If we used TARGS, we'd clutter it up with the result of | |
9392 | the attempted unification, even if this class didn't work out. | |
9393 | We also don't want to commit ourselves to all the unifications | |
9394 | we've already done, since unification is supposed to be done on | |
9395 | an argument-by-argument basis. In other words, consider the | |
9396 | following pathological case: | |
9397 | ||
9398 | template <int I, int J, int K> | |
9399 | struct S {}; | |
9400 | ||
9401 | template <int I, int J> | |
9402 | struct S<I, J, 2> : public S<I, I, I>, S<J, J, J> {}; | |
9403 | ||
9404 | template <int I, int J, int K> | |
9405 | void f(S<I, J, K>, S<I, I, I>); | |
9406 | ||
9407 | void g() { | |
9408 | S<0, 0, 0> s0; | |
9409 | S<0, 1, 2> s2; | |
9410 | ||
9411 | f(s0, s2); | |
9412 | } | |
9413 | ||
9414 | Now, by the time we consider the unification involving `s2', we | |
9415 | already know that we must have `f<0, 0, 0>'. But, even though | |
0e339752 | 9416 | `S<0, 1, 2>' is derived from `S<0, 0, 0>', the code is invalid |
4393e105 MM |
9417 | because there are two ways to unify base classes of S<0, 1, 2> |
9418 | with S<I, I, I>. If we kept the already deduced knowledge, we | |
9419 | would reject the possibility I=1. */ | |
f31c0a32 | 9420 | copy_of_targs = make_tree_vec (TREE_VEC_LENGTH (targs)); |
4393e105 MM |
9421 | |
9422 | /* If unification failed, we're done. */ | |
74601d7c KL |
9423 | if (unify (tparms, copy_of_targs, CLASSTYPE_TI_ARGS (parm), |
9424 | CLASSTYPE_TI_ARGS (arg), UNIFY_ALLOW_NONE)) | |
4393e105 | 9425 | return NULL_TREE; |
74601d7c KL |
9426 | |
9427 | return arg; | |
4393e105 MM |
9428 | } |
9429 | ||
9430 | /* Subroutine of get_template_base. RVAL, if non-NULL, is a base we | |
dc957d14 | 9431 | have already discovered to be satisfactory. ARG_BINFO is the binfo |
4393e105 MM |
9432 | for the base class of ARG that we are currently examining. */ |
9433 | ||
9434 | static tree | |
3a978d72 NN |
9435 | get_template_base_recursive (tree tparms, |
9436 | tree targs, | |
9437 | tree parm, | |
9438 | tree arg_binfo, | |
9439 | tree rval, | |
9440 | int flags) | |
fcfb9f96 MM |
9441 | { |
9442 | tree binfos; | |
9443 | int i, n_baselinks; | |
4393e105 | 9444 | tree arg = BINFO_TYPE (arg_binfo); |
fcfb9f96 | 9445 | |
4393e105 | 9446 | if (!(flags & GTB_IGNORE_TYPE)) |
fcfb9f96 | 9447 | { |
4393e105 MM |
9448 | tree r = try_class_unification (tparms, targs, |
9449 | parm, arg); | |
fcfb9f96 | 9450 | |
4393e105 | 9451 | /* If there is more than one satisfactory baseclass, then: |
fcfb9f96 | 9452 | |
4393e105 MM |
9453 | [temp.deduct.call] |
9454 | ||
9455 | If they yield more than one possible deduced A, the type | |
9456 | deduction fails. | |
9457 | ||
9458 | applies. */ | |
9459 | if (r && rval && !same_type_p (r, rval)) | |
9460 | return error_mark_node; | |
9461 | else if (r) | |
9462 | rval = r; | |
fcfb9f96 MM |
9463 | } |
9464 | ||
4393e105 | 9465 | binfos = BINFO_BASETYPES (arg_binfo); |
fcfb9f96 MM |
9466 | n_baselinks = binfos ? TREE_VEC_LENGTH (binfos) : 0; |
9467 | ||
9468 | /* Process base types. */ | |
9469 | for (i = 0; i < n_baselinks; i++) | |
9470 | { | |
9471 | tree base_binfo = TREE_VEC_ELT (binfos, i); | |
4393e105 | 9472 | int this_virtual; |
fcfb9f96 | 9473 | |
4393e105 MM |
9474 | /* Skip this base, if we've already seen it. */ |
9475 | if (BINFO_MARKED (base_binfo)) | |
9476 | continue; | |
9477 | ||
9478 | this_virtual = | |
9479 | (flags & GTB_VIA_VIRTUAL) || TREE_VIA_VIRTUAL (base_binfo); | |
9480 | ||
9481 | /* When searching for a non-virtual, we cannot mark virtually | |
9482 | found binfos. */ | |
9483 | if (! this_virtual) | |
dbbf88d1 | 9484 | BINFO_MARKED (base_binfo) = 1; |
4393e105 MM |
9485 | |
9486 | rval = get_template_base_recursive (tparms, targs, | |
9487 | parm, | |
9488 | base_binfo, | |
9489 | rval, | |
9490 | GTB_VIA_VIRTUAL * this_virtual); | |
9491 | ||
9492 | /* If we discovered more than one matching base class, we can | |
9493 | stop now. */ | |
9494 | if (rval == error_mark_node) | |
9495 | return error_mark_node; | |
fcfb9f96 MM |
9496 | } |
9497 | ||
9498 | return rval; | |
9499 | } | |
9500 | ||
4393e105 MM |
9501 | /* Given a template type PARM and a class type ARG, find the unique |
9502 | base type in ARG that is an instance of PARM. We do not examine | |
9503 | ARG itself; only its base-classes. If there is no appropriate base | |
9504 | class, return NULL_TREE. If there is more than one, return | |
9505 | error_mark_node. PARM may be the type of a partial specialization, | |
9506 | as well as a plain template type. Used by unify. */ | |
fcfb9f96 MM |
9507 | |
9508 | static tree | |
3a978d72 | 9509 | get_template_base (tree tparms, tree targs, tree parm, tree arg) |
fcfb9f96 | 9510 | { |
4393e105 MM |
9511 | tree rval; |
9512 | tree arg_binfo; | |
fcfb9f96 | 9513 | |
4393e105 MM |
9514 | my_friendly_assert (IS_AGGR_TYPE_CODE (TREE_CODE (arg)), 92); |
9515 | ||
9516 | arg_binfo = TYPE_BINFO (complete_type (arg)); | |
9517 | rval = get_template_base_recursive (tparms, targs, | |
9518 | parm, arg_binfo, | |
9519 | NULL_TREE, | |
9520 | GTB_IGNORE_TYPE); | |
fcfb9f96 | 9521 | |
4393e105 MM |
9522 | /* Since get_template_base_recursive marks the bases classes, we |
9523 | must unmark them here. */ | |
d6479fe7 | 9524 | dfs_walk (arg_binfo, dfs_unmark, markedp, 0); |
fcfb9f96 MM |
9525 | |
9526 | return rval; | |
9527 | } | |
9528 | ||
db2767b6 MM |
9529 | /* Returns the level of DECL, which declares a template parameter. */ |
9530 | ||
e9659ab0 | 9531 | static int |
3a978d72 | 9532 | template_decl_level (tree decl) |
db2767b6 MM |
9533 | { |
9534 | switch (TREE_CODE (decl)) | |
9535 | { | |
9536 | case TYPE_DECL: | |
9537 | case TEMPLATE_DECL: | |
9538 | return TEMPLATE_TYPE_LEVEL (TREE_TYPE (decl)); | |
9539 | ||
9540 | case PARM_DECL: | |
9541 | return TEMPLATE_PARM_LEVEL (DECL_INITIAL (decl)); | |
9542 | ||
9543 | default: | |
a98facb0 | 9544 | abort (); |
5ffe581d | 9545 | return 0; |
db2767b6 MM |
9546 | } |
9547 | } | |
9548 | ||
830bfa74 MM |
9549 | /* Decide whether ARG can be unified with PARM, considering only the |
9550 | cv-qualifiers of each type, given STRICT as documented for unify. | |
324f9dfb | 9551 | Returns nonzero iff the unification is OK on that basis. */ |
e92cc029 | 9552 | |
e9659ab0 | 9553 | static int |
3a978d72 | 9554 | check_cv_quals_for_unify (int strict, tree arg, tree parm) |
830bfa74 | 9555 | { |
4f2b0fb2 NS |
9556 | int arg_quals = cp_type_quals (arg); |
9557 | int parm_quals = cp_type_quals (parm); | |
9558 | ||
355f774d NS |
9559 | if (TREE_CODE (parm) == TEMPLATE_TYPE_PARM |
9560 | && !(strict & UNIFY_ALLOW_OUTER_MORE_CV_QUAL)) | |
4f2b0fb2 | 9561 | { |
2e9ceb77 NS |
9562 | /* Although a CVR qualifier is ignored when being applied to a |
9563 | substituted template parameter ([8.3.2]/1 for example), that | |
9564 | does not apply during deduction [14.8.2.4]/1, (even though | |
9565 | that is not explicitly mentioned, [14.8.2.4]/9 indicates | |
355f774d NS |
9566 | this). Except when we're allowing additional CV qualifiers |
9567 | at the outer level [14.8.2.1]/3,1st bullet. */ | |
2e9ceb77 NS |
9568 | if ((TREE_CODE (arg) == REFERENCE_TYPE |
9569 | || TREE_CODE (arg) == FUNCTION_TYPE | |
9570 | || TREE_CODE (arg) == METHOD_TYPE) | |
9571 | && (parm_quals & (TYPE_QUAL_CONST | TYPE_QUAL_VOLATILE))) | |
9572 | return 0; | |
9573 | ||
9574 | if ((!POINTER_TYPE_P (arg) && TREE_CODE (arg) != TEMPLATE_TYPE_PARM) | |
9575 | && (parm_quals & TYPE_QUAL_RESTRICT)) | |
9576 | return 0; | |
4f2b0fb2 | 9577 | } |
2e9ceb77 | 9578 | |
62e4a758 | 9579 | if (!(strict & (UNIFY_ALLOW_MORE_CV_QUAL | UNIFY_ALLOW_OUTER_MORE_CV_QUAL)) |
4f2b0fb2 | 9580 | && (arg_quals & parm_quals) != parm_quals) |
ef637255 MM |
9581 | return 0; |
9582 | ||
62e4a758 | 9583 | if (!(strict & (UNIFY_ALLOW_LESS_CV_QUAL | UNIFY_ALLOW_OUTER_LESS_CV_QUAL)) |
4f2b0fb2 | 9584 | && (parm_quals & arg_quals) != arg_quals) |
ef637255 MM |
9585 | return 0; |
9586 | ||
ef637255 | 9587 | return 1; |
830bfa74 MM |
9588 | } |
9589 | ||
9590 | /* Takes parameters as for type_unification. Returns 0 if the | |
dc957d14 | 9591 | type deduction succeeds, 1 otherwise. The parameter STRICT is a |
830bfa74 MM |
9592 | bitwise or of the following flags: |
9593 | ||
9594 | UNIFY_ALLOW_NONE: | |
9595 | Require an exact match between PARM and ARG. | |
9596 | UNIFY_ALLOW_MORE_CV_QUAL: | |
028d1f20 NS |
9597 | Allow the deduced ARG to be more cv-qualified (by qualification |
9598 | conversion) than ARG. | |
830bfa74 MM |
9599 | UNIFY_ALLOW_LESS_CV_QUAL: |
9600 | Allow the deduced ARG to be less cv-qualified than ARG. | |
9601 | UNIFY_ALLOW_DERIVED: | |
9602 | Allow the deduced ARG to be a template base class of ARG, | |
9603 | or a pointer to a template base class of the type pointed to by | |
161c12b0 JM |
9604 | ARG. |
9605 | UNIFY_ALLOW_INTEGER: | |
9606 | Allow any integral type to be deduced. See the TEMPLATE_PARM_INDEX | |
028d1f20 NS |
9607 | case for more information. |
9608 | UNIFY_ALLOW_OUTER_LEVEL: | |
9609 | This is the outermost level of a deduction. Used to determine validity | |
9610 | of qualification conversions. A valid qualification conversion must | |
9611 | have const qualified pointers leading up to the inner type which | |
9612 | requires additional CV quals, except at the outer level, where const | |
9613 | is not required [conv.qual]. It would be normal to set this flag in | |
62e4a758 NS |
9614 | addition to setting UNIFY_ALLOW_MORE_CV_QUAL. |
9615 | UNIFY_ALLOW_OUTER_MORE_CV_QUAL: | |
9616 | This is the outermost level of a deduction, and PARM can be more CV | |
9617 | qualified at this point. | |
9618 | UNIFY_ALLOW_OUTER_LESS_CV_QUAL: | |
9619 | This is the outermost level of a deduction, and PARM can be less CV | |
d9f818d9 RS |
9620 | qualified at this point. |
9621 | UNIFY_ALLOW_MAX_CORRECTION: | |
9622 | This is an INTEGER_TYPE's maximum value. Used if the range may | |
9623 | have been derived from a size specification, such as an array size. | |
9624 | If the size was given by a nontype template parameter N, the maximum | |
9625 | value will have the form N-1. The flag says that we can (and indeed | |
9626 | must) unify N with (ARG + 1), an exception to the normal rules on | |
9627 | folding PARM. */ | |
830bfa74 | 9628 | |
e9659ab0 | 9629 | static int |
3a978d72 | 9630 | unify (tree tparms, tree targs, tree parm, tree arg, int strict) |
8d08fdba MS |
9631 | { |
9632 | int idx; | |
050367a3 | 9633 | tree targ; |
db2767b6 | 9634 | tree tparm; |
028d1f20 | 9635 | int strict_in = strict; |
8d08fdba MS |
9636 | |
9637 | /* I don't think this will do the right thing with respect to types. | |
9638 | But the only case I've seen it in so far has been array bounds, where | |
9639 | signedness is the only information lost, and I think that will be | |
9640 | okay. */ | |
9641 | while (TREE_CODE (parm) == NOP_EXPR) | |
9642 | parm = TREE_OPERAND (parm, 0); | |
9643 | ||
9644 | if (arg == error_mark_node) | |
9645 | return 1; | |
9646 | if (arg == unknown_type_node) | |
34016c81 JM |
9647 | /* We can't deduce anything from this, but we might get all the |
9648 | template args from other function args. */ | |
9649 | return 0; | |
9650 | ||
db2767b6 | 9651 | /* If PARM uses template parameters, then we can't bail out here, |
6bdb985f | 9652 | even if ARG == PARM, since we won't record unifications for the |
db2767b6 MM |
9653 | template parameters. We might need them if we're trying to |
9654 | figure out which of two things is more specialized. */ | |
9655 | if (arg == parm && !uses_template_parms (parm)) | |
8d08fdba MS |
9656 | return 0; |
9657 | ||
830bfa74 MM |
9658 | /* Immediately reject some pairs that won't unify because of |
9659 | cv-qualification mismatches. */ | |
9660 | if (TREE_CODE (arg) == TREE_CODE (parm) | |
2f939d94 | 9661 | && TYPE_P (arg) |
d0ab7624 NS |
9662 | /* It is the elements of the array which hold the cv quals of an array |
9663 | type, and the elements might be template type parms. We'll check | |
9664 | when we recurse. */ | |
9665 | && TREE_CODE (arg) != ARRAY_TYPE | |
830bfa74 MM |
9666 | /* We check the cv-qualifiers when unifying with template type |
9667 | parameters below. We want to allow ARG `const T' to unify with | |
9668 | PARM `T' for example, when computing which of two templates | |
9669 | is more specialized, for example. */ | |
9670 | && TREE_CODE (arg) != TEMPLATE_TYPE_PARM | |
028d1f20 | 9671 | && !check_cv_quals_for_unify (strict_in, arg, parm)) |
49432171 JM |
9672 | return 1; |
9673 | ||
028d1f20 | 9674 | if (!(strict & UNIFY_ALLOW_OUTER_LEVEL) |
3ea099f1 | 9675 | && TYPE_P (parm) && !CP_TYPE_CONST_P (parm)) |
028d1f20 NS |
9676 | strict &= ~UNIFY_ALLOW_MORE_CV_QUAL; |
9677 | strict &= ~UNIFY_ALLOW_OUTER_LEVEL; | |
9678 | strict &= ~UNIFY_ALLOW_DERIVED; | |
62e4a758 NS |
9679 | strict &= ~UNIFY_ALLOW_OUTER_MORE_CV_QUAL; |
9680 | strict &= ~UNIFY_ALLOW_OUTER_LESS_CV_QUAL; | |
d9f818d9 | 9681 | strict &= ~UNIFY_ALLOW_MAX_CORRECTION; |
028d1f20 | 9682 | |
8d08fdba MS |
9683 | switch (TREE_CODE (parm)) |
9684 | { | |
2ca340ae | 9685 | case TYPENAME_TYPE: |
fccef71e | 9686 | case SCOPE_REF: |
b8c6534b | 9687 | case UNBOUND_CLASS_TEMPLATE: |
2ca340ae JM |
9688 | /* In a type which contains a nested-name-specifier, template |
9689 | argument values cannot be deduced for template parameters used | |
9690 | within the nested-name-specifier. */ | |
9691 | return 0; | |
9692 | ||
8d08fdba | 9693 | case TEMPLATE_TYPE_PARM: |
73b0fce8 | 9694 | case TEMPLATE_TEMPLATE_PARM: |
a1281f45 | 9695 | case BOUND_TEMPLATE_TEMPLATE_PARM: |
db2767b6 MM |
9696 | tparm = TREE_VALUE (TREE_VEC_ELT (tparms, 0)); |
9697 | ||
9698 | if (TEMPLATE_TYPE_LEVEL (parm) | |
9699 | != template_decl_level (tparm)) | |
9700 | /* The PARM is not one we're trying to unify. Just check | |
9701 | to see if it matches ARG. */ | |
9702 | return (TREE_CODE (arg) == TREE_CODE (parm) | |
3bfdc719 | 9703 | && same_type_p (parm, arg)) ? 0 : 1; |
73b0fce8 | 9704 | idx = TEMPLATE_TYPE_IDX (parm); |
050367a3 | 9705 | targ = TREE_VEC_ELT (targs, idx); |
db2767b6 | 9706 | tparm = TREE_VALUE (TREE_VEC_ELT (tparms, idx)); |
050367a3 | 9707 | |
73b0fce8 | 9708 | /* Check for mixed types and values. */ |
db2767b6 MM |
9709 | if ((TREE_CODE (parm) == TEMPLATE_TYPE_PARM |
9710 | && TREE_CODE (tparm) != TYPE_DECL) | |
9711 | || (TREE_CODE (parm) == TEMPLATE_TEMPLATE_PARM | |
9712 | && TREE_CODE (tparm) != TEMPLATE_DECL)) | |
73b0fce8 KL |
9713 | return 1; |
9714 | ||
a1281f45 | 9715 | if (TREE_CODE (parm) == BOUND_TEMPLATE_TEMPLATE_PARM) |
73b0fce8 | 9716 | { |
b429fdf0 KL |
9717 | /* ARG must be constructed from a template class or a template |
9718 | template parameter. */ | |
9719 | if (TREE_CODE (arg) != BOUND_TEMPLATE_TEMPLATE_PARM | |
9720 | && (TREE_CODE (arg) != RECORD_TYPE || !CLASSTYPE_TEMPLATE_INFO (arg))) | |
a1281f45 | 9721 | return 1; |
73b0fce8 | 9722 | |
a1281f45 KL |
9723 | { |
9724 | tree parmtmpl = TYPE_TI_TEMPLATE (parm); | |
9725 | tree parmvec = TYPE_TI_ARGS (parm); | |
b429fdf0 | 9726 | tree argvec = TYPE_TI_ARGS (arg); |
a1281f45 | 9727 | tree argtmplvec |
b429fdf0 | 9728 | = DECL_INNERMOST_TEMPLATE_PARMS (TYPE_TI_TEMPLATE (arg)); |
a1281f45 | 9729 | int i; |
73b0fce8 | 9730 | |
a1281f45 KL |
9731 | /* The parameter and argument roles have to be switched here |
9732 | in order to handle default arguments properly. For example, | |
9733 | template<template <class> class TT> void f(TT<int>) | |
9734 | should be able to accept vector<int> which comes from | |
9735 | template <class T, class Allocator = allocator> | |
9736 | class vector. */ | |
9737 | ||
ee3071ef NS |
9738 | if (coerce_template_parms (argtmplvec, parmvec, parmtmpl, 0, 1) |
9739 | == error_mark_node) | |
a1281f45 | 9740 | return 1; |
73b0fce8 | 9741 | |
a1281f45 KL |
9742 | /* Deduce arguments T, i from TT<T> or TT<i>. |
9743 | We check each element of PARMVEC and ARGVEC individually | |
9744 | rather than the whole TREE_VEC since they can have | |
9745 | different number of elements. */ | |
6b9b6b15 | 9746 | |
a1281f45 KL |
9747 | for (i = 0; i < TREE_VEC_LENGTH (parmvec); ++i) |
9748 | { | |
9749 | tree t = TREE_VEC_ELT (parmvec, i); | |
73b0fce8 | 9750 | |
a1281f45 KL |
9751 | if (unify (tparms, targs, t, |
9752 | TREE_VEC_ELT (argvec, i), | |
9753 | UNIFY_ALLOW_NONE)) | |
9754 | return 1; | |
73b0fce8 | 9755 | } |
a1281f45 | 9756 | } |
b429fdf0 | 9757 | arg = TYPE_TI_TEMPLATE (arg); |
a1281f45 KL |
9758 | |
9759 | /* Fall through to deduce template name. */ | |
9760 | } | |
9761 | ||
9762 | if (TREE_CODE (parm) == TEMPLATE_TEMPLATE_PARM | |
9763 | || TREE_CODE (parm) == BOUND_TEMPLATE_TEMPLATE_PARM) | |
9764 | { | |
9765 | /* Deduce template name TT from TT, TT<>, TT<T> and TT<i>. */ | |
9766 | ||
9767 | /* Simple cases: Value already set, does match or doesn't. */ | |
9768 | if (targ != NULL_TREE && template_args_equal (targ, arg)) | |
9769 | return 0; | |
9770 | else if (targ) | |
9771 | return 1; | |
db2767b6 MM |
9772 | } |
9773 | else | |
9774 | { | |
830bfa74 MM |
9775 | /* If PARM is `const T' and ARG is only `int', we don't have |
9776 | a match unless we are allowing additional qualification. | |
9777 | If ARG is `const int' and PARM is just `T' that's OK; | |
9778 | that binds `const int' to `T'. */ | |
028d1f20 | 9779 | if (!check_cv_quals_for_unify (strict_in | UNIFY_ALLOW_LESS_CV_QUAL, |
830bfa74 | 9780 | arg, parm)) |
db2767b6 MM |
9781 | return 1; |
9782 | ||
830bfa74 MM |
9783 | /* Consider the case where ARG is `const volatile int' and |
9784 | PARM is `const T'. Then, T should be `volatile int'. */ | |
c2ea3a40 NS |
9785 | arg = cp_build_qualified_type_real |
9786 | (arg, cp_type_quals (arg) & ~cp_type_quals (parm), tf_none); | |
adecb3f4 MM |
9787 | if (arg == error_mark_node) |
9788 | return 1; | |
73b0fce8 | 9789 | |
a1281f45 KL |
9790 | /* Simple cases: Value already set, does match or doesn't. */ |
9791 | if (targ != NULL_TREE && same_type_p (targ, arg)) | |
9792 | return 0; | |
9793 | else if (targ) | |
9794 | return 1; | |
61cd552e | 9795 | |
94fc547c MM |
9796 | /* Make sure that ARG is not a variable-sized array. (Note |
9797 | that were talking about variable-sized arrays (like | |
9798 | `int[n]'), rather than arrays of unknown size (like | |
9799 | `int[]').) We'll get very confused by such a type since | |
9800 | the bound of the array will not be computable in an | |
9801 | instantiation. Besides, such types are not allowed in | |
9802 | ISO C++, so we can do as we please here. */ | |
9803 | if (variably_modified_type_p (arg)) | |
9804 | return 1; | |
9805 | } | |
61cd552e | 9806 | |
050367a3 | 9807 | TREE_VEC_ELT (targs, idx) = arg; |
73b0fce8 KL |
9808 | return 0; |
9809 | ||
f84b4be9 | 9810 | case TEMPLATE_PARM_INDEX: |
db2767b6 MM |
9811 | tparm = TREE_VALUE (TREE_VEC_ELT (tparms, 0)); |
9812 | ||
9813 | if (TEMPLATE_PARM_LEVEL (parm) | |
9814 | != template_decl_level (tparm)) | |
9815 | /* The PARM is not one we're trying to unify. Just check | |
9816 | to see if it matches ARG. */ | |
c8a209ca NS |
9817 | return !(TREE_CODE (arg) == TREE_CODE (parm) |
9818 | && cp_tree_equal (parm, arg)); | |
db2767b6 | 9819 | |
f84b4be9 | 9820 | idx = TEMPLATE_PARM_IDX (parm); |
050367a3 | 9821 | targ = TREE_VEC_ELT (targs, idx); |
db2767b6 | 9822 | |
050367a3 | 9823 | if (targ) |
c8a209ca | 9824 | return !cp_tree_equal (targ, arg); |
8d08fdba | 9825 | |
161c12b0 JM |
9826 | /* [temp.deduct.type] If, in the declaration of a function template |
9827 | with a non-type template-parameter, the non-type | |
9828 | template-parameter is used in an expression in the function | |
9829 | parameter-list and, if the corresponding template-argument is | |
9830 | deduced, the template-argument type shall match the type of the | |
9831 | template-parameter exactly, except that a template-argument | |
d7c4edd0 NS |
9832 | deduced from an array bound may be of any integral type. |
9833 | The non-type parameter might use already deduced type parameters. */ | |
bd0d5d4a | 9834 | tparm = tsubst (TREE_TYPE (parm), targs, 0, NULL_TREE); |
e2005c8d KL |
9835 | if (!TREE_TYPE (arg)) |
9836 | /* Template-parameter dependent expression. Just accept it for now. | |
9837 | It will later be processed in convert_template_argument. */ | |
9838 | ; | |
9839 | else if (same_type_p (TREE_TYPE (arg), tparm)) | |
9840 | /* OK */; | |
161c12b0 | 9841 | else if ((strict & UNIFY_ALLOW_INTEGER) |
bd0d5d4a JM |
9842 | && (TREE_CODE (tparm) == INTEGER_TYPE |
9843 | || TREE_CODE (tparm) == BOOLEAN_TYPE)) | |
161c12b0 | 9844 | /* OK */; |
bd0d5d4a JM |
9845 | else if (uses_template_parms (tparm)) |
9846 | /* We haven't deduced the type of this parameter yet. Try again | |
9847 | later. */ | |
9848 | return 0; | |
161c12b0 JM |
9849 | else |
9850 | return 1; | |
9851 | ||
2a1e9fdd | 9852 | TREE_VEC_ELT (targs, idx) = arg; |
8d08fdba MS |
9853 | return 0; |
9854 | ||
28e8f3a0 GB |
9855 | case PTRMEM_CST: |
9856 | { | |
9857 | /* A pointer-to-member constant can be unified only with | |
9858 | another constant. */ | |
9859 | if (TREE_CODE (arg) != PTRMEM_CST) | |
9860 | return 1; | |
9861 | ||
9862 | /* Just unify the class member. It would be useless (and possibly | |
9863 | wrong, depending on the strict flags) to unify also | |
9864 | PTRMEM_CST_CLASS, because we want to be sure that both parm and | |
9865 | arg refer to the same variable, even if through different | |
9866 | classes. For instance: | |
9867 | ||
9868 | struct A { int x; }; | |
9869 | struct B : A { }; | |
9870 | ||
9871 | Unification of &A::x and &B::x must succeed. */ | |
9872 | return unify (tparms, targs, PTRMEM_CST_MEMBER (parm), | |
9873 | PTRMEM_CST_MEMBER (arg), strict); | |
9874 | } | |
9875 | ||
8d08fdba | 9876 | case POINTER_TYPE: |
830bfa74 | 9877 | { |
830bfa74 MM |
9878 | if (TREE_CODE (arg) != POINTER_TYPE) |
9879 | return 1; | |
9880 | ||
9881 | /* [temp.deduct.call] | |
9882 | ||
9883 | A can be another pointer or pointer to member type that can | |
9884 | be converted to the deduced A via a qualification | |
9885 | conversion (_conv.qual_). | |
9886 | ||
9887 | We pass down STRICT here rather than UNIFY_ALLOW_NONE. | |
9888 | This will allow for additional cv-qualification of the | |
028d1f20 | 9889 | pointed-to types if appropriate. */ |
830bfa74 | 9890 | |
028d1f20 | 9891 | if (TREE_CODE (TREE_TYPE (arg)) == RECORD_TYPE) |
830bfa74 MM |
9892 | /* The derived-to-base conversion only persists through one |
9893 | level of pointers. */ | |
028d1f20 | 9894 | strict |= (strict_in & UNIFY_ALLOW_DERIVED); |
830bfa74 | 9895 | |
a7a64a77 | 9896 | return unify (tparms, targs, TREE_TYPE (parm), |
028d1f20 | 9897 | TREE_TYPE (arg), strict); |
830bfa74 | 9898 | } |
8d08fdba MS |
9899 | |
9900 | case REFERENCE_TYPE: | |
830bfa74 MM |
9901 | if (TREE_CODE (arg) != REFERENCE_TYPE) |
9902 | return 1; | |
9903 | return unify (tparms, targs, TREE_TYPE (parm), TREE_TYPE (arg), | |
028d1f20 | 9904 | strict & UNIFY_ALLOW_MORE_CV_QUAL); |
8d08fdba MS |
9905 | |
9906 | case ARRAY_TYPE: | |
9907 | if (TREE_CODE (arg) != ARRAY_TYPE) | |
9908 | return 1; | |
3042d5be MM |
9909 | if ((TYPE_DOMAIN (parm) == NULL_TREE) |
9910 | != (TYPE_DOMAIN (arg) == NULL_TREE)) | |
9911 | return 1; | |
9912 | if (TYPE_DOMAIN (parm) != NULL_TREE | |
830bfa74 | 9913 | && unify (tparms, targs, TYPE_DOMAIN (parm), |
4393e105 | 9914 | TYPE_DOMAIN (arg), UNIFY_ALLOW_NONE) != 0) |
8d08fdba | 9915 | return 1; |
830bfa74 | 9916 | return unify (tparms, targs, TREE_TYPE (parm), TREE_TYPE (arg), |
712467a4 | 9917 | strict & UNIFY_ALLOW_MORE_CV_QUAL); |
8d08fdba MS |
9918 | |
9919 | case REAL_TYPE: | |
37c46b43 | 9920 | case COMPLEX_TYPE: |
c00996a3 | 9921 | case VECTOR_TYPE: |
8d08fdba | 9922 | case INTEGER_TYPE: |
42976354 | 9923 | case BOOLEAN_TYPE: |
5ad5a526 | 9924 | case VOID_TYPE: |
f376e137 MS |
9925 | if (TREE_CODE (arg) != TREE_CODE (parm)) |
9926 | return 1; | |
9927 | ||
514a1f18 JM |
9928 | if (TREE_CODE (parm) == INTEGER_TYPE |
9929 | && TREE_CODE (TYPE_MAX_VALUE (parm)) != INTEGER_CST) | |
8d08fdba MS |
9930 | { |
9931 | if (TYPE_MIN_VALUE (parm) && TYPE_MIN_VALUE (arg) | |
830bfa74 | 9932 | && unify (tparms, targs, TYPE_MIN_VALUE (parm), |
4393e105 | 9933 | TYPE_MIN_VALUE (arg), UNIFY_ALLOW_INTEGER)) |
8d08fdba MS |
9934 | return 1; |
9935 | if (TYPE_MAX_VALUE (parm) && TYPE_MAX_VALUE (arg) | |
830bfa74 | 9936 | && unify (tparms, targs, TYPE_MAX_VALUE (parm), |
d9f818d9 RS |
9937 | TYPE_MAX_VALUE (arg), |
9938 | UNIFY_ALLOW_INTEGER | UNIFY_ALLOW_MAX_CORRECTION)) | |
8d08fdba MS |
9939 | return 1; |
9940 | } | |
9edc3913 | 9941 | /* We have already checked cv-qualification at the top of the |
514a1f18 | 9942 | function. */ |
9edc3913 | 9943 | else if (!same_type_ignoring_top_level_qualifiers_p (arg, parm)) |
ca79f85d JM |
9944 | return 1; |
9945 | ||
8d08fdba MS |
9946 | /* As far as unification is concerned, this wins. Later checks |
9947 | will invalidate it if necessary. */ | |
9948 | return 0; | |
9949 | ||
9950 | /* Types INTEGER_CST and MINUS_EXPR can come from array bounds. */ | |
bd6dd845 | 9951 | /* Type INTEGER_CST can come from ordinary constant template args. */ |
8d08fdba | 9952 | case INTEGER_CST: |
bd6dd845 MS |
9953 | while (TREE_CODE (arg) == NOP_EXPR) |
9954 | arg = TREE_OPERAND (arg, 0); | |
9955 | ||
8d08fdba MS |
9956 | if (TREE_CODE (arg) != INTEGER_CST) |
9957 | return 1; | |
9958 | return !tree_int_cst_equal (parm, arg); | |
9959 | ||
8d08fdba MS |
9960 | case TREE_VEC: |
9961 | { | |
9962 | int i; | |
9963 | if (TREE_CODE (arg) != TREE_VEC) | |
9964 | return 1; | |
9965 | if (TREE_VEC_LENGTH (parm) != TREE_VEC_LENGTH (arg)) | |
9966 | return 1; | |
0dc09a61 | 9967 | for (i = 0; i < TREE_VEC_LENGTH (parm); ++i) |
830bfa74 | 9968 | if (unify (tparms, targs, |
8d08fdba | 9969 | TREE_VEC_ELT (parm, i), TREE_VEC_ELT (arg, i), |
4393e105 | 9970 | UNIFY_ALLOW_NONE)) |
8d08fdba MS |
9971 | return 1; |
9972 | return 0; | |
9973 | } | |
9974 | ||
8d08fdba | 9975 | case RECORD_TYPE: |
f181d4ae | 9976 | case UNION_TYPE: |
f181d4ae | 9977 | if (TREE_CODE (arg) != TREE_CODE (parm)) |
a4443a08 | 9978 | return 1; |
830bfa74 | 9979 | |
a7a64a77 MM |
9980 | if (TYPE_PTRMEMFUNC_P (parm)) |
9981 | { | |
9982 | if (!TYPE_PTRMEMFUNC_P (arg)) | |
9983 | return 1; | |
9984 | ||
9985 | return unify (tparms, targs, | |
9986 | TYPE_PTRMEMFUNC_FN_TYPE (parm), | |
9987 | TYPE_PTRMEMFUNC_FN_TYPE (arg), | |
9988 | strict); | |
9989 | } | |
9990 | ||
5db698f6 | 9991 | if (CLASSTYPE_TEMPLATE_INFO (parm)) |
5566b478 | 9992 | { |
6467930b | 9993 | tree t = NULL_TREE; |
4393e105 | 9994 | |
028d1f20 | 9995 | if (strict_in & UNIFY_ALLOW_DERIVED) |
4393e105 MM |
9996 | { |
9997 | /* First, we try to unify the PARM and ARG directly. */ | |
9998 | t = try_class_unification (tparms, targs, | |
9999 | parm, arg); | |
10000 | ||
10001 | if (!t) | |
10002 | { | |
10003 | /* Fallback to the special case allowed in | |
10004 | [temp.deduct.call]: | |
10005 | ||
10006 | If P is a class, and P has the form | |
10007 | template-id, then A can be a derived class of | |
10008 | the deduced A. Likewise, if P is a pointer to | |
10009 | a class of the form template-id, A can be a | |
10010 | pointer to a derived class pointed to by the | |
10011 | deduced A. */ | |
10012 | t = get_template_base (tparms, targs, | |
10013 | parm, arg); | |
10014 | ||
10015 | if (! t || t == error_mark_node) | |
10016 | return 1; | |
10017 | } | |
10018 | } | |
6df47b06 | 10019 | else if (CLASSTYPE_TEMPLATE_INFO (arg) |
9fbf56f7 MM |
10020 | && (CLASSTYPE_TI_TEMPLATE (parm) |
10021 | == CLASSTYPE_TI_TEMPLATE (arg))) | |
6df47b06 MM |
10022 | /* Perhaps PARM is something like S<U> and ARG is S<int>. |
10023 | Then, we should unify `int' and `U'. */ | |
6467930b | 10024 | t = arg; |
4393e105 | 10025 | else |
dc957d14 | 10026 | /* There's no chance of unification succeeding. */ |
5566b478 | 10027 | return 1; |
6467930b | 10028 | |
830bfa74 | 10029 | return unify (tparms, targs, CLASSTYPE_TI_ARGS (parm), |
4393e105 | 10030 | CLASSTYPE_TI_ARGS (t), UNIFY_ALLOW_NONE); |
5566b478 | 10031 | } |
9edc3913 | 10032 | else if (!same_type_ignoring_top_level_qualifiers_p (parm, arg)) |
5566b478 | 10033 | return 1; |
a4443a08 | 10034 | return 0; |
8d08fdba MS |
10035 | |
10036 | case METHOD_TYPE: | |
8d08fdba | 10037 | case FUNCTION_TYPE: |
830bfa74 | 10038 | if (TREE_CODE (arg) != TREE_CODE (parm)) |
8d08fdba | 10039 | return 1; |
830bfa74 MM |
10040 | |
10041 | if (unify (tparms, targs, TREE_TYPE (parm), | |
4393e105 | 10042 | TREE_TYPE (arg), UNIFY_ALLOW_NONE)) |
28cbf42c | 10043 | return 1; |
386b8a85 | 10044 | return type_unification_real (tparms, targs, TYPE_ARG_TYPES (parm), |
3b3ba9f0 | 10045 | TYPE_ARG_TYPES (arg), 1, |
e5214479 | 10046 | DEDUCE_EXACT, 0, -1); |
a4443a08 MS |
10047 | |
10048 | case OFFSET_TYPE: | |
10049 | if (TREE_CODE (arg) != OFFSET_TYPE) | |
10050 | return 1; | |
830bfa74 | 10051 | if (unify (tparms, targs, TYPE_OFFSET_BASETYPE (parm), |
4393e105 | 10052 | TYPE_OFFSET_BASETYPE (arg), UNIFY_ALLOW_NONE)) |
a4443a08 | 10053 | return 1; |
830bfa74 | 10054 | return unify (tparms, targs, TREE_TYPE (parm), TREE_TYPE (arg), |
4393e105 | 10055 | strict); |
a4443a08 | 10056 | |
f62dbf03 | 10057 | case CONST_DECL: |
a723baf1 MM |
10058 | if (DECL_TEMPLATE_PARM_P (parm)) |
10059 | return unify (tparms, targs, DECL_INITIAL (parm), arg, strict); | |
830bfa74 | 10060 | if (arg != decl_constant_value (parm)) |
f62dbf03 JM |
10061 | return 1; |
10062 | return 0; | |
10063 | ||
28e8f3a0 | 10064 | case FIELD_DECL: |
027905b4 KL |
10065 | case TEMPLATE_DECL: |
10066 | /* Matched cases are handled by the ARG == PARM test above. */ | |
10067 | return 1; | |
10068 | ||
53929c47 | 10069 | case MINUS_EXPR: |
d9f818d9 RS |
10070 | if (tree_int_cst_equal (TREE_OPERAND (parm, 1), integer_one_node) |
10071 | && (strict_in & UNIFY_ALLOW_MAX_CORRECTION)) | |
53929c47 JM |
10072 | { |
10073 | /* We handle this case specially, since it comes up with | |
10074 | arrays. In particular, something like: | |
10075 | ||
10076 | template <int N> void f(int (&x)[N]); | |
10077 | ||
10078 | Here, we are trying to unify the range type, which | |
10079 | looks like [0 ... (N - 1)]. */ | |
10080 | tree t, t1, t2; | |
10081 | t1 = TREE_OPERAND (parm, 0); | |
10082 | t2 = TREE_OPERAND (parm, 1); | |
10083 | ||
24e2e58e | 10084 | t = fold (build (PLUS_EXPR, integer_type_node, arg, t2)); |
53929c47 | 10085 | |
4393e105 | 10086 | return unify (tparms, targs, t1, t, strict); |
53929c47 | 10087 | } |
f4f206f4 | 10088 | /* Else fall through. */ |
53929c47 | 10089 | |
8d08fdba | 10090 | default: |
050367a3 | 10091 | if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (TREE_CODE (parm)))) |
74601d7c KL |
10092 | { |
10093 | ||
10094 | /* We're looking at an expression. This can happen with | |
10095 | something like: | |
4393e105 | 10096 | |
74601d7c KL |
10097 | template <int I> |
10098 | void foo(S<I>, S<I + 2>); | |
050367a3 | 10099 | |
74601d7c | 10100 | This is a "nondeduced context": |
050367a3 | 10101 | |
74601d7c | 10102 | [deduct.type] |
4393e105 | 10103 | |
74601d7c | 10104 | The nondeduced contexts are: |
050367a3 | 10105 | |
74601d7c KL |
10106 | --A type that is a template-id in which one or more of |
10107 | the template-arguments is an expression that references | |
10108 | a template-parameter. | |
050367a3 | 10109 | |
74601d7c KL |
10110 | In these cases, we assume deduction succeeded, but don't |
10111 | actually infer any unifications. */ | |
10112 | ||
10113 | if (!uses_template_parms (parm) | |
10114 | && !template_args_equal (parm, arg)) | |
10115 | return 1; | |
10116 | else | |
10117 | return 0; | |
10118 | } | |
050367a3 | 10119 | else |
b4c4a9ec MM |
10120 | sorry ("use of `%s' in template type unification", |
10121 | tree_code_name [(int) TREE_CODE (parm)]); | |
050367a3 | 10122 | |
8d08fdba MS |
10123 | return 1; |
10124 | } | |
10125 | } | |
8d08fdba | 10126 | \f |
03d0f4af MM |
10127 | /* Called if RESULT is explicitly instantiated, or is a member of an |
10128 | explicitly instantiated class, or if using -frepo and the | |
10129 | instantiation of RESULT has been assigned to this file. */ | |
10130 | ||
faae18ab | 10131 | void |
3a978d72 | 10132 | mark_decl_instantiated (tree result, int extern_p) |
faae18ab | 10133 | { |
415c974c | 10134 | SET_DECL_EXPLICIT_INSTANTIATION (result); |
3ae18eaf | 10135 | |
1f6f0cb6 MM |
10136 | /* If this entity has already been written out, it's too late to |
10137 | make any modifications. */ | |
10138 | if (TREE_ASM_WRITTEN (result)) | |
10139 | return; | |
10140 | ||
10141 | if (TREE_CODE (result) != FUNCTION_DECL) | |
10142 | /* The TREE_PUBLIC flag for function declarations will have been | |
10143 | set correctly by tsubst. */ | |
10144 | TREE_PUBLIC (result) = 1; | |
10145 | ||
346eeb15 JM |
10146 | /* This might have been set by an earlier implicit instantiation. */ |
10147 | DECL_COMDAT (result) = 0; | |
10148 | ||
faae18ab MS |
10149 | if (! extern_p) |
10150 | { | |
10151 | DECL_INTERFACE_KNOWN (result) = 1; | |
10152 | DECL_NOT_REALLY_EXTERN (result) = 1; | |
a7d87521 | 10153 | |
1a408d07 JM |
10154 | /* Always make artificials weak. */ |
10155 | if (DECL_ARTIFICIAL (result) && flag_weak) | |
10156 | comdat_linkage (result); | |
a7d87521 JM |
10157 | /* For WIN32 we also want to put explicit instantiations in |
10158 | linkonce sections. */ | |
1a408d07 | 10159 | else if (TREE_PUBLIC (result)) |
b385c841 | 10160 | maybe_make_one_only (result); |
faae18ab | 10161 | } |
1f6f0cb6 | 10162 | |
bf277438 GK |
10163 | if (TREE_CODE (result) == FUNCTION_DECL |
10164 | && (DECL_ARTIFICIAL (result) | |
10165 | || (DECL_DECLARED_INLINE_P (result) && TREE_USED (result)))) | |
56e770bf | 10166 | defer_fn (result); |
faae18ab MS |
10167 | } |
10168 | ||
e5214479 | 10169 | /* Given two function templates PAT1 and PAT2, return: |
6467930b | 10170 | |
62e4a758 NS |
10171 | DEDUCE should be DEDUCE_EXACT or DEDUCE_ORDER. |
10172 | ||
6467930b MS |
10173 | 1 if PAT1 is more specialized than PAT2 as described in [temp.func.order]. |
10174 | -1 if PAT2 is more specialized than PAT1. | |
e5214479 JM |
10175 | 0 if neither is more specialized. |
10176 | ||
10177 | LEN is passed through to fn_type_unification. */ | |
6467930b MS |
10178 | |
10179 | int | |
3a978d72 | 10180 | more_specialized (tree pat1, tree pat2, int deduce, int len) |
6467930b | 10181 | { |
98c1c668 | 10182 | tree targs; |
73aad9b9 | 10183 | int winner = 0; |
6467930b | 10184 | |
35c18a20 MM |
10185 | /* If template argument deduction succeeds, we substitute the |
10186 | resulting arguments into non-deduced contexts. While doing that, | |
10187 | we must be aware that we may encounter dependent types. */ | |
10188 | ++processing_template_decl; | |
62e4a758 NS |
10189 | targs = get_bindings_real (pat1, DECL_TEMPLATE_RESULT (pat2), |
10190 | NULL_TREE, 0, deduce, len); | |
73aad9b9 | 10191 | if (targs) |
36a117a5 | 10192 | --winner; |
6467930b | 10193 | |
62e4a758 NS |
10194 | targs = get_bindings_real (pat2, DECL_TEMPLATE_RESULT (pat1), |
10195 | NULL_TREE, 0, deduce, len); | |
73aad9b9 | 10196 | if (targs) |
36a117a5 | 10197 | ++winner; |
35c18a20 | 10198 | --processing_template_decl; |
6467930b | 10199 | |
73aad9b9 JM |
10200 | return winner; |
10201 | } | |
6467930b | 10202 | |
73aad9b9 | 10203 | /* Given two class template specialization list nodes PAT1 and PAT2, return: |
6467930b | 10204 | |
73aad9b9 JM |
10205 | 1 if PAT1 is more specialized than PAT2 as described in [temp.class.order]. |
10206 | -1 if PAT2 is more specialized than PAT1. | |
55ece1b3 KL |
10207 | 0 if neither is more specialized. |
10208 | ||
10209 | FULL_ARGS is the full set of template arguments that triggers this | |
10210 | partial ordering. */ | |
73aad9b9 JM |
10211 | |
10212 | int | |
55ece1b3 | 10213 | more_specialized_class (tree pat1, tree pat2, tree full_args) |
73aad9b9 JM |
10214 | { |
10215 | tree targs; | |
10216 | int winner = 0; | |
10217 | ||
baa49730 GB |
10218 | /* Just like what happens for functions, if we are ordering between |
10219 | different class template specializations, we may encounter dependent | |
10220 | types in the arguments, and we need our dependency check functions | |
10221 | to behave correctly. */ | |
10222 | ++processing_template_decl; | |
36a117a5 | 10223 | targs = get_class_bindings (TREE_VALUE (pat1), TREE_PURPOSE (pat1), |
55ece1b3 | 10224 | add_outermost_template_args (full_args, TREE_PURPOSE (pat2))); |
73aad9b9 JM |
10225 | if (targs) |
10226 | --winner; | |
10227 | ||
36a117a5 | 10228 | targs = get_class_bindings (TREE_VALUE (pat2), TREE_PURPOSE (pat2), |
55ece1b3 | 10229 | add_outermost_template_args (full_args, TREE_PURPOSE (pat1))); |
73aad9b9 | 10230 | if (targs) |
6467930b | 10231 | ++winner; |
baa49730 | 10232 | --processing_template_decl; |
6467930b MS |
10233 | |
10234 | return winner; | |
10235 | } | |
73aad9b9 JM |
10236 | |
10237 | /* Return the template arguments that will produce the function signature | |
e1467ff2 | 10238 | DECL from the function template FN, with the explicit template |
76b9a14d | 10239 | arguments EXPLICIT_ARGS. If CHECK_RETTYPE is 1, the return type must |
4393e105 | 10240 | also match. Return NULL_TREE if no satisfactory arguments could be |
62e4a758 | 10241 | found. DEDUCE and LEN are passed through to fn_type_unification. */ |
e5214479 | 10242 | |
76b9a14d | 10243 | static tree |
3a978d72 NN |
10244 | get_bindings_real (tree fn, |
10245 | tree decl, | |
10246 | tree explicit_args, | |
10247 | int check_rettype, | |
10248 | int deduce, | |
10249 | int len) | |
73aad9b9 | 10250 | { |
98c1c668 | 10251 | int ntparms = DECL_NTPARMS (fn); |
f31c0a32 | 10252 | tree targs = make_tree_vec (ntparms); |
4393e105 | 10253 | tree decl_type; |
03017874 | 10254 | tree decl_arg_types; |
98c1c668 JM |
10255 | int i; |
10256 | ||
4393e105 MM |
10257 | /* Substitute the explicit template arguments into the type of DECL. |
10258 | The call to fn_type_unification will handle substitution into the | |
10259 | FN. */ | |
10260 | decl_type = TREE_TYPE (decl); | |
10261 | if (explicit_args && uses_template_parms (decl_type)) | |
10262 | { | |
10263 | tree tmpl; | |
10264 | tree converted_args; | |
10265 | ||
10266 | if (DECL_TEMPLATE_INFO (decl)) | |
10267 | tmpl = DECL_TI_TEMPLATE (decl); | |
10268 | else | |
0e339752 | 10269 | /* We can get here for some invalid specializations. */ |
4393e105 MM |
10270 | return NULL_TREE; |
10271 | ||
10272 | converted_args | |
10273 | = (coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (tmpl), | |
10274 | explicit_args, NULL_TREE, | |
c2ea3a40 | 10275 | tf_none, /*require_all_arguments=*/0)); |
4393e105 MM |
10276 | if (converted_args == error_mark_node) |
10277 | return NULL_TREE; | |
10278 | ||
c2ea3a40 | 10279 | decl_type = tsubst (decl_type, converted_args, tf_none, NULL_TREE); |
4393e105 MM |
10280 | if (decl_type == error_mark_node) |
10281 | return NULL_TREE; | |
10282 | } | |
10283 | ||
10284 | decl_arg_types = TYPE_ARG_TYPES (decl_type); | |
e5214479 JM |
10285 | /* Never do unification on the 'this' parameter. */ |
10286 | if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl)) | |
03017874 | 10287 | decl_arg_types = TREE_CHAIN (decl_arg_types); |
d7684f2d | 10288 | |
e1467ff2 | 10289 | i = fn_type_unification (fn, explicit_args, targs, |
03017874 | 10290 | decl_arg_types, |
8d3631f8 NS |
10291 | (check_rettype || DECL_CONV_FN_P (fn) |
10292 | ? TREE_TYPE (decl_type) : NULL_TREE), | |
62e4a758 | 10293 | deduce, len); |
98c1c668 | 10294 | |
76b9a14d JM |
10295 | if (i != 0) |
10296 | return NULL_TREE; | |
10297 | ||
76b9a14d JM |
10298 | return targs; |
10299 | } | |
10300 | ||
10301 | /* For most uses, we want to check the return type. */ | |
10302 | ||
eb1dfbb2 | 10303 | static tree |
3a978d72 | 10304 | get_bindings (tree fn, tree decl, tree explicit_args) |
76b9a14d | 10305 | { |
62e4a758 | 10306 | return get_bindings_real (fn, decl, explicit_args, 1, DEDUCE_EXACT, -1); |
76b9a14d JM |
10307 | } |
10308 | ||
e5214479 JM |
10309 | /* But for resolve_overloaded_unification, we only care about the parameter |
10310 | types. */ | |
76b9a14d JM |
10311 | |
10312 | static tree | |
3a978d72 | 10313 | get_bindings_overload (tree fn, tree decl, tree explicit_args) |
76b9a14d | 10314 | { |
62e4a758 | 10315 | return get_bindings_real (fn, decl, explicit_args, 0, DEDUCE_EXACT, -1); |
73aad9b9 JM |
10316 | } |
10317 | ||
36a117a5 MM |
10318 | /* Return the innermost template arguments that, when applied to a |
10319 | template specialization whose innermost template parameters are | |
9471d3e2 | 10320 | TPARMS, and whose specialization arguments are PARMS, yield the |
36a117a5 MM |
10321 | ARGS. |
10322 | ||
10323 | For example, suppose we have: | |
10324 | ||
10325 | template <class T, class U> struct S {}; | |
10326 | template <class T> struct S<T*, int> {}; | |
10327 | ||
10328 | Then, suppose we want to get `S<double*, int>'. The TPARMS will be | |
10329 | {T}, the PARMS will be {T*, int} and the ARGS will be {double*, | |
10330 | int}. The resulting vector will be {double}, indicating that `T' | |
10331 | is bound to `double'. */ | |
10332 | ||
bd6dd845 | 10333 | static tree |
3a978d72 | 10334 | get_class_bindings (tree tparms, tree parms, tree args) |
73aad9b9 | 10335 | { |
3b3ba9f0 | 10336 | int i, ntparms = TREE_VEC_LENGTH (tparms); |
f31c0a32 | 10337 | tree vec = make_tree_vec (ntparms); |
73aad9b9 | 10338 | |
74601d7c KL |
10339 | if (unify (tparms, vec, parms, INNERMOST_TEMPLATE_ARGS (args), |
10340 | UNIFY_ALLOW_NONE)) | |
fcfb9f96 | 10341 | return NULL_TREE; |
73aad9b9 JM |
10342 | |
10343 | for (i = 0; i < ntparms; ++i) | |
10344 | if (! TREE_VEC_ELT (vec, i)) | |
10345 | return NULL_TREE; | |
10346 | ||
74601d7c KL |
10347 | if (verify_class_unification (vec, parms, args)) |
10348 | return NULL_TREE; | |
10349 | ||
73aad9b9 JM |
10350 | return vec; |
10351 | } | |
10352 | ||
104bf76a MM |
10353 | /* In INSTANTIATIONS is a list of <INSTANTIATION, TEMPLATE> pairs. |
10354 | Pick the most specialized template, and return the corresponding | |
10355 | instantiation, or if there is no corresponding instantiation, the | |
e5214479 JM |
10356 | template itself. If there is no most specialized template, |
10357 | error_mark_node is returned. If there are no templates at all, | |
10358 | NULL_TREE is returned. */ | |
73aad9b9 JM |
10359 | |
10360 | tree | |
3a978d72 | 10361 | most_specialized_instantiation (tree instantiations) |
73aad9b9 | 10362 | { |
104bf76a | 10363 | tree fn, champ; |
73aad9b9 JM |
10364 | int fate; |
10365 | ||
104bf76a | 10366 | if (!instantiations) |
73aad9b9 JM |
10367 | return NULL_TREE; |
10368 | ||
104bf76a MM |
10369 | champ = instantiations; |
10370 | for (fn = TREE_CHAIN (instantiations); fn; fn = TREE_CHAIN (fn)) | |
73aad9b9 | 10371 | { |
62e4a758 NS |
10372 | fate = more_specialized (TREE_VALUE (champ), TREE_VALUE (fn), |
10373 | DEDUCE_EXACT, -1); | |
73aad9b9 JM |
10374 | if (fate == 1) |
10375 | ; | |
10376 | else | |
10377 | { | |
10378 | if (fate == 0) | |
10379 | { | |
10380 | fn = TREE_CHAIN (fn); | |
10381 | if (! fn) | |
10382 | return error_mark_node; | |
10383 | } | |
104bf76a | 10384 | champ = fn; |
73aad9b9 JM |
10385 | } |
10386 | } | |
10387 | ||
104bf76a | 10388 | for (fn = instantiations; fn && fn != champ; fn = TREE_CHAIN (fn)) |
73aad9b9 | 10389 | { |
62e4a758 NS |
10390 | fate = more_specialized (TREE_VALUE (champ), TREE_VALUE (fn), |
10391 | DEDUCE_EXACT, -1); | |
73aad9b9 JM |
10392 | if (fate != 1) |
10393 | return error_mark_node; | |
10394 | } | |
10395 | ||
104bf76a MM |
10396 | return TREE_PURPOSE (champ) ? TREE_PURPOSE (champ) : TREE_VALUE (champ); |
10397 | } | |
10398 | ||
10399 | /* Return the most specialized of the list of templates in FNS that can | |
10400 | produce an instantiation matching DECL, given the explicit template | |
10401 | arguments EXPLICIT_ARGS. */ | |
10402 | ||
e9659ab0 | 10403 | static tree |
3a978d72 | 10404 | most_specialized (tree fns, tree decl, tree explicit_args) |
104bf76a MM |
10405 | { |
10406 | tree candidates = NULL_TREE; | |
10407 | tree fn, args; | |
10408 | ||
10409 | for (fn = fns; fn; fn = TREE_CHAIN (fn)) | |
10410 | { | |
10411 | tree candidate = TREE_VALUE (fn); | |
10412 | ||
10413 | args = get_bindings (candidate, decl, explicit_args); | |
10414 | if (args) | |
e1b3e07d | 10415 | candidates = tree_cons (NULL_TREE, candidate, candidates); |
104bf76a MM |
10416 | } |
10417 | ||
e5214479 | 10418 | return most_specialized_instantiation (candidates); |
73aad9b9 JM |
10419 | } |
10420 | ||
36a117a5 | 10421 | /* If DECL is a specialization of some template, return the most |
f9a7ae04 MM |
10422 | general such template. Otherwise, returns NULL_TREE. |
10423 | ||
10424 | For example, given: | |
36a117a5 MM |
10425 | |
10426 | template <class T> struct S { template <class U> void f(U); }; | |
10427 | ||
10428 | if TMPL is `template <class U> void S<int>::f(U)' this will return | |
10429 | the full template. This function will not trace past partial | |
10430 | specializations, however. For example, given in addition: | |
10431 | ||
10432 | template <class T> struct S<T*> { template <class U> void f(U); }; | |
10433 | ||
10434 | if TMPL is `template <class U> void S<int*>::f(U)' this will return | |
10435 | `template <class T> template <class U> S<T*>::f(U)'. */ | |
73aad9b9 | 10436 | |
612c671a | 10437 | tree |
3a978d72 | 10438 | most_general_template (tree decl) |
73aad9b9 | 10439 | { |
f9a7ae04 MM |
10440 | /* If DECL is a FUNCTION_DECL, find the TEMPLATE_DECL of which it is |
10441 | an immediate specialization. */ | |
10442 | if (TREE_CODE (decl) == FUNCTION_DECL) | |
10443 | { | |
10444 | if (DECL_TEMPLATE_INFO (decl)) { | |
10445 | decl = DECL_TI_TEMPLATE (decl); | |
10446 | ||
10447 | /* The DECL_TI_TEMPLATE can be an IDENTIFIER_NODE for a | |
10448 | template friend. */ | |
10449 | if (TREE_CODE (decl) != TEMPLATE_DECL) | |
10450 | return NULL_TREE; | |
10451 | } else | |
10452 | return NULL_TREE; | |
10453 | } | |
10454 | ||
10455 | /* Look for more and more general templates. */ | |
10456 | while (DECL_TEMPLATE_INFO (decl)) | |
10457 | { | |
10b1d5e7 MM |
10458 | /* The DECL_TI_TEMPLATE can be an IDENTIFIER_NODE in some cases. |
10459 | (See cp-tree.h for details.) */ | |
f9a7ae04 MM |
10460 | if (TREE_CODE (DECL_TI_TEMPLATE (decl)) != TEMPLATE_DECL) |
10461 | break; | |
10462 | ||
6e049fcd KL |
10463 | if (CLASS_TYPE_P (TREE_TYPE (decl)) |
10464 | && CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_TYPE (decl))) | |
10465 | break; | |
10466 | ||
f9a7ae04 MM |
10467 | /* Stop if we run into an explicitly specialized class template. */ |
10468 | if (!DECL_NAMESPACE_SCOPE_P (decl) | |
10469 | && DECL_CONTEXT (decl) | |
10470 | && CLASSTYPE_TEMPLATE_SPECIALIZATION (DECL_CONTEXT (decl))) | |
10471 | break; | |
10472 | ||
10473 | decl = DECL_TI_TEMPLATE (decl); | |
10474 | } | |
36a117a5 MM |
10475 | |
10476 | return decl; | |
10477 | } | |
10478 | ||
10479 | /* Return the most specialized of the class template specializations | |
10480 | of TMPL which can produce an instantiation matching ARGS, or | |
10481 | error_mark_node if the choice is ambiguous. */ | |
10482 | ||
e9659ab0 | 10483 | static tree |
3a978d72 | 10484 | most_specialized_class (tree tmpl, tree args) |
36a117a5 MM |
10485 | { |
10486 | tree list = NULL_TREE; | |
10487 | tree t; | |
10488 | tree champ; | |
73aad9b9 JM |
10489 | int fate; |
10490 | ||
36a117a5 MM |
10491 | tmpl = most_general_template (tmpl); |
10492 | for (t = DECL_TEMPLATE_SPECIALIZATIONS (tmpl); t; t = TREE_CHAIN (t)) | |
73aad9b9 | 10493 | { |
36a117a5 MM |
10494 | tree spec_args |
10495 | = get_class_bindings (TREE_VALUE (t), TREE_PURPOSE (t), args); | |
10496 | if (spec_args) | |
73aad9b9 | 10497 | { |
1f8f4a0b | 10498 | list = tree_cons (TREE_PURPOSE (t), TREE_VALUE (t), list); |
73aad9b9 JM |
10499 | TREE_TYPE (list) = TREE_TYPE (t); |
10500 | } | |
10501 | } | |
10502 | ||
10503 | if (! list) | |
10504 | return NULL_TREE; | |
10505 | ||
10506 | t = list; | |
10507 | champ = t; | |
10508 | t = TREE_CHAIN (t); | |
10509 | for (; t; t = TREE_CHAIN (t)) | |
10510 | { | |
55ece1b3 | 10511 | fate = more_specialized_class (champ, t, args); |
73aad9b9 JM |
10512 | if (fate == 1) |
10513 | ; | |
10514 | else | |
10515 | { | |
10516 | if (fate == 0) | |
10517 | { | |
10518 | t = TREE_CHAIN (t); | |
10519 | if (! t) | |
10520 | return error_mark_node; | |
10521 | } | |
10522 | champ = t; | |
10523 | } | |
10524 | } | |
10525 | ||
10526 | for (t = list; t && t != champ; t = TREE_CHAIN (t)) | |
10527 | { | |
55ece1b3 | 10528 | fate = more_specialized_class (champ, t, args); |
73aad9b9 JM |
10529 | if (fate != 1) |
10530 | return error_mark_node; | |
10531 | } | |
10532 | ||
10533 | return champ; | |
10534 | } | |
10535 | ||
eb8845be | 10536 | /* Explicitly instantiate DECL. */ |
e92cc029 | 10537 | |
8d08fdba | 10538 | void |
eb8845be | 10539 | do_decl_instantiation (tree decl, tree storage) |
8d08fdba | 10540 | { |
8d08fdba | 10541 | tree result = NULL_TREE; |
faae18ab | 10542 | int extern_p = 0; |
e8abc66f | 10543 | |
3fa56191 | 10544 | if (!decl) |
dc957d14 | 10545 | /* An error occurred, for which grokdeclarator has already issued |
3fa56191 MM |
10546 | an appropriate message. */ |
10547 | return; | |
10548 | else if (! DECL_LANG_SPECIFIC (decl)) | |
ec255269 | 10549 | { |
33bd39a2 | 10550 | error ("explicit instantiation of non-template `%#D'", decl); |
ec255269 MS |
10551 | return; |
10552 | } | |
03d0f4af | 10553 | else if (TREE_CODE (decl) == VAR_DECL) |
6633d636 | 10554 | { |
03d0f4af MM |
10555 | /* There is an asymmetry here in the way VAR_DECLs and |
10556 | FUNCTION_DECLs are handled by grokdeclarator. In the case of | |
10557 | the latter, the DECL we get back will be marked as a | |
10558 | template instantiation, and the appropriate | |
10559 | DECL_TEMPLATE_INFO will be set up. This does not happen for | |
10560 | VAR_DECLs so we do the lookup here. Probably, grokdeclarator | |
10561 | should handle VAR_DECLs as it currently handles | |
10562 | FUNCTION_DECLs. */ | |
86ac0575 | 10563 | result = lookup_field (DECL_CONTEXT (decl), DECL_NAME (decl), 0, false); |
e0860732 | 10564 | if (!result || TREE_CODE (result) != VAR_DECL) |
03d0f4af | 10565 | { |
e0860732 | 10566 | error ("no matching template for `%D' found", decl); |
03d0f4af MM |
10567 | return; |
10568 | } | |
6633d636 MS |
10569 | } |
10570 | else if (TREE_CODE (decl) != FUNCTION_DECL) | |
10571 | { | |
33bd39a2 | 10572 | error ("explicit instantiation of `%#D'", decl); |
6633d636 MS |
10573 | return; |
10574 | } | |
03d0f4af MM |
10575 | else |
10576 | result = decl; | |
672476cb | 10577 | |
03d0f4af | 10578 | /* Check for various error cases. Note that if the explicit |
0e339752 | 10579 | instantiation is valid the RESULT will currently be marked as an |
03d0f4af MM |
10580 | *implicit* instantiation; DECL_EXPLICIT_INSTANTIATION is not set |
10581 | until we get here. */ | |
10582 | ||
10583 | if (DECL_TEMPLATE_SPECIALIZATION (result)) | |
672476cb | 10584 | { |
07782718 KL |
10585 | /* DR 259 [temp.spec]. |
10586 | ||
10587 | Both an explicit instantiation and a declaration of an explicit | |
10588 | specialization shall not appear in a program unless the explicit | |
10589 | instantiation follows a declaration of the explicit specialization. | |
03d0f4af | 10590 | |
07782718 KL |
10591 | For a given set of template parameters, if an explicit |
10592 | instantiation of a template appears after a declaration of an | |
10593 | explicit specialization for that template, the explicit | |
10594 | instantiation has no effect. */ | |
672476cb MM |
10595 | return; |
10596 | } | |
03d0f4af MM |
10597 | else if (DECL_EXPLICIT_INSTANTIATION (result)) |
10598 | { | |
10599 | /* [temp.spec] | |
98c1c668 | 10600 | |
03d0f4af MM |
10601 | No program shall explicitly instantiate any template more |
10602 | than once. | |
10603 | ||
2aaf816d JM |
10604 | We check DECL_INTERFACE_KNOWN so as not to complain when the first |
10605 | instantiation was `extern' and the second is not, and EXTERN_P for | |
10606 | the opposite case. If -frepo, chances are we already got marked | |
dc957d14 | 10607 | as an explicit instantiation because of the repo file. */ |
2aaf816d | 10608 | if (DECL_INTERFACE_KNOWN (result) && !extern_p && !flag_use_repository) |
33bd39a2 | 10609 | pedwarn ("duplicate explicit instantiation of `%#D'", result); |
03d0f4af MM |
10610 | |
10611 | /* If we've already instantiated the template, just return now. */ | |
10612 | if (DECL_INTERFACE_KNOWN (result)) | |
10613 | return; | |
10614 | } | |
10615 | else if (!DECL_IMPLICIT_INSTANTIATION (result)) | |
faae18ab | 10616 | { |
33bd39a2 | 10617 | error ("no matching template for `%D' found", result); |
faae18ab MS |
10618 | return; |
10619 | } | |
03d0f4af | 10620 | else if (!DECL_TEMPLATE_INFO (result)) |
6633d636 | 10621 | { |
33bd39a2 | 10622 | pedwarn ("explicit instantiation of non-template `%#D'", result); |
6633d636 MS |
10623 | return; |
10624 | } | |
10625 | ||
f0e01782 | 10626 | if (storage == NULL_TREE) |
00595019 | 10627 | ; |
faae18ab | 10628 | else if (storage == ridpointers[(int) RID_EXTERN]) |
03d0f4af | 10629 | { |
c02f5e29 | 10630 | if (pedantic && !in_system_header) |
33bd39a2 | 10631 | pedwarn ("ISO C++ forbids the use of `extern' on explicit instantiations"); |
03d0f4af MM |
10632 | extern_p = 1; |
10633 | } | |
f0e01782 | 10634 | else |
33bd39a2 | 10635 | error ("storage class `%D' applied to template instantiation", |
f0e01782 | 10636 | storage); |
5566b478 | 10637 | |
5566b478 | 10638 | mark_decl_instantiated (result, extern_p); |
44a8d0b3 | 10639 | repo_template_instantiated (result, extern_p); |
c91a56d2 | 10640 | if (! extern_p) |
415c974c | 10641 | instantiate_decl (result, /*defer_ok=*/1, /*undefined_ok=*/0); |
7177d104 MS |
10642 | } |
10643 | ||
faae18ab | 10644 | void |
3a978d72 | 10645 | mark_class_instantiated (tree t, int extern_p) |
faae18ab MS |
10646 | { |
10647 | SET_CLASSTYPE_EXPLICIT_INSTANTIATION (t); | |
eb773359 JM |
10648 | SET_CLASSTYPE_INTERFACE_KNOWN (t); |
10649 | CLASSTYPE_INTERFACE_ONLY (t) = extern_p; | |
faae18ab MS |
10650 | TYPE_DECL_SUPPRESS_DEBUG (TYPE_NAME (t)) = extern_p; |
10651 | if (! extern_p) | |
10652 | { | |
10653 | CLASSTYPE_DEBUG_REQUESTED (t) = 1; | |
10654 | rest_of_type_compilation (t, 1); | |
10655 | } | |
10656 | } | |
e8abc66f | 10657 | |
5e0c54e5 | 10658 | /* Called from do_type_instantiation through binding_table_foreach to |
9bcb9aae | 10659 | do recursive instantiation for the type bound in ENTRY. */ |
5e0c54e5 GDR |
10660 | static void |
10661 | bt_instantiate_type_proc (binding_entry entry, void *data) | |
10662 | { | |
10663 | tree storage = *(tree *) data; | |
10664 | ||
10665 | if (IS_AGGR_TYPE (entry->type) | |
10666 | && !uses_template_parms (CLASSTYPE_TI_ARGS (entry->type))) | |
10667 | do_type_instantiation (TYPE_MAIN_DECL (entry->type), storage, 0); | |
10668 | } | |
10669 | ||
415c974c MA |
10670 | /* Called from do_type_instantiation to instantiate a member |
10671 | (a member function or a static member variable) of an | |
10672 | explicitly instantiated class template. */ | |
10673 | static void | |
10674 | instantiate_class_member (tree decl, int extern_p) | |
10675 | { | |
10676 | mark_decl_instantiated (decl, extern_p); | |
10677 | repo_template_instantiated (decl, extern_p); | |
10678 | if (! extern_p) | |
10679 | instantiate_decl (decl, /*defer_ok=*/1, /* undefined_ok=*/1); | |
10680 | } | |
10681 | ||
a1bcc528 JM |
10682 | /* Perform an explicit instantiation of template class T. STORAGE, if |
10683 | non-null, is the RID for extern, inline or static. COMPLAIN is | |
838dfd8a | 10684 | nonzero if this is called from the parser, zero if called recursively, |
a1bcc528 JM |
10685 | since the standard is unclear (as detailed below). */ |
10686 | ||
7177d104 | 10687 | void |
3a978d72 | 10688 | do_type_instantiation (tree t, tree storage, tsubst_flags_t complain) |
7177d104 | 10689 | { |
e8abc66f MS |
10690 | int extern_p = 0; |
10691 | int nomem_p = 0; | |
5566b478 | 10692 | int static_p = 0; |
4746cf84 | 10693 | int previous_instantiation_extern_p = 0; |
5566b478 | 10694 | |
ca79f85d JM |
10695 | if (TREE_CODE (t) == TYPE_DECL) |
10696 | t = TREE_TYPE (t); | |
10697 | ||
7ddedda4 | 10698 | if (! CLASS_TYPE_P (t) || ! CLASSTYPE_TEMPLATE_INFO (t)) |
ca79f85d | 10699 | { |
33bd39a2 | 10700 | error ("explicit instantiation of non-template type `%T'", t); |
ca79f85d JM |
10701 | return; |
10702 | } | |
10703 | ||
5566b478 | 10704 | complete_type (t); |
7177d104 | 10705 | |
d0f062fb | 10706 | if (!COMPLETE_TYPE_P (t)) |
f0e01782 | 10707 | { |
c2ea3a40 | 10708 | if (complain & tf_error) |
33bd39a2 | 10709 | error ("explicit instantiation of `%#T' before definition of template", |
a1bcc528 | 10710 | t); |
f0e01782 MS |
10711 | return; |
10712 | } | |
10713 | ||
03d0f4af | 10714 | if (storage != NULL_TREE) |
f0e01782 | 10715 | { |
c02f5e29 | 10716 | if (pedantic && !in_system_header) |
4460cef2 GDR |
10717 | pedwarn("ISO C++ forbids the use of `%E' on explicit instantiations", |
10718 | storage); | |
03d0f4af MM |
10719 | |
10720 | if (storage == ridpointers[(int) RID_INLINE]) | |
10721 | nomem_p = 1; | |
10722 | else if (storage == ridpointers[(int) RID_EXTERN]) | |
10723 | extern_p = 1; | |
10724 | else if (storage == ridpointers[(int) RID_STATIC]) | |
10725 | static_p = 1; | |
10726 | else | |
10727 | { | |
33bd39a2 | 10728 | error ("storage class `%D' applied to template instantiation", |
03d0f4af MM |
10729 | storage); |
10730 | extern_p = 0; | |
10731 | } | |
f0e01782 MS |
10732 | } |
10733 | ||
370af2d5 | 10734 | if (CLASSTYPE_TEMPLATE_SPECIALIZATION (t)) |
03d0f4af | 10735 | { |
07782718 | 10736 | /* DR 259 [temp.spec]. |
a292b002 | 10737 | |
07782718 KL |
10738 | Both an explicit instantiation and a declaration of an explicit |
10739 | specialization shall not appear in a program unless the explicit | |
10740 | instantiation follows a declaration of the explicit specialization. | |
10741 | ||
10742 | For a given set of template parameters, if an explicit | |
10743 | instantiation of a template appears after a declaration of an | |
10744 | explicit specialization for that template, the explicit | |
10745 | instantiation has no effect. */ | |
03d0f4af MM |
10746 | return; |
10747 | } | |
10748 | else if (CLASSTYPE_EXPLICIT_INSTANTIATION (t)) | |
44a8d0b3 | 10749 | { |
03d0f4af MM |
10750 | /* [temp.spec] |
10751 | ||
10752 | No program shall explicitly instantiate any template more | |
10753 | than once. | |
10754 | ||
4746cf84 MA |
10755 | If PREVIOUS_INSTANTIATION_EXTERN_P, then the first explicit |
10756 | instantiation was `extern'. If EXTERN_P then the second is. | |
10757 | If -frepo, chances are we already got marked as an explicit | |
10758 | instantiation because of the repo file. All these cases are | |
10759 | OK. */ | |
10760 | ||
10761 | previous_instantiation_extern_p = CLASSTYPE_INTERFACE_ONLY (t); | |
10762 | ||
10763 | if (!previous_instantiation_extern_p && !extern_p | |
10764 | && !flag_use_repository | |
c2ea3a40 | 10765 | && (complain & tf_error)) |
33bd39a2 | 10766 | pedwarn ("duplicate explicit instantiation of `%#T'", t); |
03d0f4af MM |
10767 | |
10768 | /* If we've already instantiated the template, just return now. */ | |
10769 | if (!CLASSTYPE_INTERFACE_ONLY (t)) | |
10770 | return; | |
44a8d0b3 | 10771 | } |
e8abc66f | 10772 | |
03d0f4af MM |
10773 | mark_class_instantiated (t, extern_p); |
10774 | repo_template_instantiated (t, extern_p); | |
10775 | ||
e8abc66f MS |
10776 | if (nomem_p) |
10777 | return; | |
10778 | ||
7177d104 | 10779 | { |
db5ae43f | 10780 | tree tmp; |
5566b478 | 10781 | |
03d0f4af MM |
10782 | /* In contrast to implicit instantiation, where only the |
10783 | declarations, and not the definitions, of members are | |
10784 | instantiated, we have here: | |
10785 | ||
10786 | [temp.explicit] | |
10787 | ||
10788 | The explicit instantiation of a class template specialization | |
10789 | implies the instantiation of all of its members not | |
10790 | previously explicitly specialized in the translation unit | |
10791 | containing the explicit instantiation. | |
10792 | ||
10793 | Of course, we can't instantiate member template classes, since | |
10794 | we don't have any arguments for them. Note that the standard | |
dc957d14 | 10795 | is unclear on whether the instantiation of the members are |
415c974c MA |
10796 | *explicit* instantiations or not. However, the most natural |
10797 | interpretation is that it should be an explicit instantiation. */ | |
03d0f4af | 10798 | |
5566b478 MS |
10799 | if (! static_p) |
10800 | for (tmp = TYPE_METHODS (t); tmp; tmp = TREE_CHAIN (tmp)) | |
a7d87521 | 10801 | if (TREE_CODE (tmp) == FUNCTION_DECL |
1f109f0f | 10802 | && DECL_TEMPLATE_INSTANTIATION (tmp)) |
415c974c | 10803 | instantiate_class_member (tmp, extern_p); |
5566b478 MS |
10804 | |
10805 | for (tmp = TYPE_FIELDS (t); tmp; tmp = TREE_CHAIN (tmp)) | |
10806 | if (TREE_CODE (tmp) == VAR_DECL && DECL_TEMPLATE_INSTANTIATION (tmp)) | |
415c974c | 10807 | instantiate_class_member (tmp, extern_p); |
7177d104 | 10808 | |
5e0c54e5 GDR |
10809 | if (CLASSTYPE_NESTED_UTDS (t)) |
10810 | binding_table_foreach (CLASSTYPE_NESTED_UTDS (t), | |
10811 | bt_instantiate_type_proc, &storage); | |
a292b002 | 10812 | } |
8d08fdba | 10813 | } |
a28e3c7f | 10814 | |
36a117a5 MM |
10815 | /* Given a function DECL, which is a specialization of TMPL, modify |
10816 | DECL to be a re-instantiation of TMPL with the same template | |
10817 | arguments. TMPL should be the template into which tsubst'ing | |
10818 | should occur for DECL, not the most general template. | |
830bfa74 MM |
10819 | |
10820 | One reason for doing this is a scenario like this: | |
10821 | ||
10822 | template <class T> | |
10823 | void f(const T&, int i); | |
10824 | ||
10825 | void g() { f(3, 7); } | |
10826 | ||
10827 | template <class T> | |
10828 | void f(const T& t, const int i) { } | |
10829 | ||
10830 | Note that when the template is first instantiated, with | |
10831 | instantiate_template, the resulting DECL will have no name for the | |
10832 | first parameter, and the wrong type for the second. So, when we go | |
10833 | to instantiate the DECL, we regenerate it. */ | |
10834 | ||
e9659ab0 | 10835 | static void |
3a978d72 | 10836 | regenerate_decl_from_template (tree decl, tree tmpl) |
830bfa74 | 10837 | { |
f9a7ae04 MM |
10838 | /* The most general version of TMPL. */ |
10839 | tree gen_tmpl; | |
10840 | /* The arguments used to instantiate DECL, from the most general | |
10841 | template. */ | |
830bfa74 | 10842 | tree args; |
830bfa74 MM |
10843 | tree code_pattern; |
10844 | tree new_decl; | |
b3445994 | 10845 | bool unregistered; |
830bfa74 MM |
10846 | |
10847 | args = DECL_TI_ARGS (decl); | |
10848 | code_pattern = DECL_TEMPLATE_RESULT (tmpl); | |
10849 | ||
8251199e JM |
10850 | /* Unregister the specialization so that when we tsubst we will not |
10851 | just return DECL. We don't have to unregister DECL from TMPL | |
10852 | because if would only be registered there if it were a partial | |
10853 | instantiation of a specialization, which it isn't: it's a full | |
10854 | instantiation. */ | |
36a117a5 | 10855 | gen_tmpl = most_general_template (tmpl); |
b3445994 MM |
10856 | unregistered = reregister_specialization (decl, gen_tmpl, |
10857 | /*new_spec=*/NULL_TREE); | |
36a117a5 MM |
10858 | |
10859 | /* If the DECL was not unregistered then something peculiar is | |
10860 | happening: we created a specialization but did not call | |
10861 | register_specialization for it. */ | |
10862 | my_friendly_assert (unregistered, 0); | |
10863 | ||
2b907f5c KL |
10864 | /* Make sure that we can see identifiers, and compute access |
10865 | correctly. */ | |
10866 | push_access_scope (decl); | |
10867 | ||
d8c4447d | 10868 | /* Do the substitution to get the new declaration. */ |
c2ea3a40 | 10869 | new_decl = tsubst (code_pattern, args, tf_error, NULL_TREE); |
830bfa74 MM |
10870 | |
10871 | if (TREE_CODE (decl) == VAR_DECL) | |
10872 | { | |
10873 | /* Set up DECL_INITIAL, since tsubst doesn't. */ | |
17bbb839 MM |
10874 | if (!DECL_INITIALIZED_IN_CLASS_P (decl)) |
10875 | DECL_INITIAL (new_decl) = | |
10876 | tsubst_expr (DECL_INITIAL (code_pattern), args, | |
10877 | tf_error, DECL_TI_TEMPLATE (decl)); | |
830bfa74 | 10878 | } |
2b0a63a3 | 10879 | else if (TREE_CODE (decl) == FUNCTION_DECL) |
fbf1c34b MM |
10880 | { |
10881 | /* Convince duplicate_decls to use the DECL_ARGUMENTS from the | |
10882 | new decl. */ | |
10883 | DECL_INITIAL (new_decl) = error_mark_node; | |
10884 | /* And don't complain about a duplicate definition. */ | |
10885 | DECL_INITIAL (decl) = NULL_TREE; | |
10886 | } | |
36a117a5 | 10887 | |
2b59fc25 | 10888 | pop_access_scope (decl); |
0e902d98 | 10889 | |
36a117a5 MM |
10890 | /* The immediate parent of the new template is still whatever it was |
10891 | before, even though tsubst sets DECL_TI_TEMPLATE up as the most | |
10892 | general template. We also reset the DECL_ASSEMBLER_NAME since | |
10893 | tsubst always calculates the name as if the function in question | |
10894 | were really a template instance, and sometimes, with friend | |
10895 | functions, this is not so. See tsubst_friend_function for | |
10896 | details. */ | |
10897 | DECL_TI_TEMPLATE (new_decl) = DECL_TI_TEMPLATE (decl); | |
92643fea | 10898 | COPY_DECL_ASSEMBLER_NAME (decl, new_decl); |
19e7881c | 10899 | COPY_DECL_RTL (decl, new_decl); |
459c43ad | 10900 | DECL_USE_TEMPLATE (new_decl) = DECL_USE_TEMPLATE (decl); |
36a117a5 MM |
10901 | |
10902 | /* Call duplicate decls to merge the old and new declarations. */ | |
830bfa74 MM |
10903 | duplicate_decls (new_decl, decl); |
10904 | ||
36a117a5 MM |
10905 | /* Now, re-register the specialization. */ |
10906 | register_specialization (decl, gen_tmpl, args); | |
830bfa74 MM |
10907 | } |
10908 | ||
a723baf1 MM |
10909 | /* Return the TEMPLATE_DECL into which DECL_TI_ARGS(DECL) should be |
10910 | substituted to get DECL. */ | |
10911 | ||
d58b7c2d | 10912 | tree |
a723baf1 MM |
10913 | template_for_substitution (tree decl) |
10914 | { | |
10915 | tree tmpl = DECL_TI_TEMPLATE (decl); | |
10916 | ||
10917 | /* Set TMPL to the template whose DECL_TEMPLATE_RESULT is the pattern | |
10918 | for the instantiation. This is not always the most general | |
10919 | template. Consider, for example: | |
10920 | ||
10921 | template <class T> | |
10922 | struct S { template <class U> void f(); | |
10923 | template <> void f<int>(); }; | |
10924 | ||
10925 | and an instantiation of S<double>::f<int>. We want TD to be the | |
10926 | specialization S<T>::f<int>, not the more general S<T>::f<U>. */ | |
10927 | while (/* An instantiation cannot have a definition, so we need a | |
10928 | more general template. */ | |
10929 | DECL_TEMPLATE_INSTANTIATION (tmpl) | |
10930 | /* We must also deal with friend templates. Given: | |
10931 | ||
10932 | template <class T> struct S { | |
10933 | template <class U> friend void f() {}; | |
10934 | }; | |
10935 | ||
10936 | S<int>::f<U> say, is not an instantiation of S<T>::f<U>, | |
10937 | so far as the language is concerned, but that's still | |
10938 | where we get the pattern for the instantiation from. On | |
10939 | other hand, if the definition comes outside the class, say: | |
10940 | ||
10941 | template <class T> struct S { | |
10942 | template <class U> friend void f(); | |
10943 | }; | |
10944 | template <class U> friend void f() {} | |
10945 | ||
10946 | we don't need to look any further. That's what the check for | |
10947 | DECL_INITIAL is for. */ | |
10948 | || (TREE_CODE (decl) == FUNCTION_DECL | |
10949 | && DECL_FRIEND_PSEUDO_TEMPLATE_INSTANTIATION (tmpl) | |
10950 | && !DECL_INITIAL (DECL_TEMPLATE_RESULT (tmpl)))) | |
10951 | { | |
10952 | /* The present template, TD, should not be a definition. If it | |
10953 | were a definition, we should be using it! Note that we | |
10954 | cannot restructure the loop to just keep going until we find | |
10955 | a template with a definition, since that might go too far if | |
10956 | a specialization was declared, but not defined. */ | |
10957 | my_friendly_assert (!(TREE_CODE (decl) == VAR_DECL | |
10958 | && !DECL_IN_AGGR_P (DECL_TEMPLATE_RESULT (tmpl))), | |
10959 | 0); | |
10960 | ||
10961 | /* Fetch the more general template. */ | |
10962 | tmpl = DECL_TI_TEMPLATE (tmpl); | |
10963 | } | |
10964 | ||
10965 | return tmpl; | |
10966 | } | |
10967 | ||
16d53b64 | 10968 | /* Produce the definition of D, a _DECL generated from a template. If |
838dfd8a | 10969 | DEFER_OK is nonzero, then we don't have to actually do the |
415c974c MA |
10970 | instantiation now; we just have to do it sometime. Normally it is |
10971 | an error if this is an explicit instantiation but D is undefined. | |
10972 | If UNDEFINED_OK is nonzero, then instead we treat it as an implicit | |
10973 | instantiation. UNDEFINED_OK is nonzero only if we are being used | |
10974 | to instantiate the members of an explicitly instantiated class | |
10975 | template. */ | |
10976 | ||
f84b4be9 | 10977 | |
a28e3c7f | 10978 | tree |
415c974c | 10979 | instantiate_decl (tree d, int defer_ok, int undefined_ok) |
a28e3c7f | 10980 | { |
36a117a5 | 10981 | tree tmpl = DECL_TI_TEMPLATE (d); |
65f8b0fb MM |
10982 | tree gen_args; |
10983 | tree args; | |
830bfa74 | 10984 | tree td; |
36a117a5 MM |
10985 | tree code_pattern; |
10986 | tree spec; | |
10987 | tree gen_tmpl; | |
5566b478 | 10988 | int pattern_defined; |
31a714f6 | 10989 | int need_push; |
82a98427 NS |
10990 | location_t saved_loc = input_location; |
10991 | ||
36a117a5 MM |
10992 | /* This function should only be used to instantiate templates for |
10993 | functions and static member variables. */ | |
10994 | my_friendly_assert (TREE_CODE (d) == FUNCTION_DECL | |
10995 | || TREE_CODE (d) == VAR_DECL, 0); | |
10996 | ||
cec24319 MM |
10997 | /* Variables are never deferred; if instantiation is required, they |
10998 | are instantiated right away. That allows for better code in the | |
10999 | case that an expression refers to the value of the variable -- | |
11000 | if the variable has a constant value the referring expression can | |
11001 | take advantage of that fact. */ | |
11002 | if (TREE_CODE (d) == VAR_DECL) | |
11003 | defer_ok = 0; | |
11004 | ||
db9b2174 MM |
11005 | /* Don't instantiate cloned functions. Instead, instantiate the |
11006 | functions they cloned. */ | |
11007 | if (TREE_CODE (d) == FUNCTION_DECL && DECL_CLONED_FUNCTION_P (d)) | |
11008 | d = DECL_CLONED_FUNCTION (d); | |
11009 | ||
fbf1c34b | 11010 | if (DECL_TEMPLATE_INSTANTIATED (d)) |
03d0f4af | 11011 | /* D has already been instantiated. It might seem reasonable to |
dc957d14 | 11012 | check whether or not D is an explicit instantiation, and, if so, |
03d0f4af MM |
11013 | stop here. But when an explicit instantiation is deferred |
11014 | until the end of the compilation, DECL_EXPLICIT_INSTANTIATION | |
11015 | is set, even though we still need to do the instantiation. */ | |
36a117a5 MM |
11016 | return d; |
11017 | ||
11018 | /* If we already have a specialization of this declaration, then | |
11019 | there's no reason to instantiate it. Note that | |
11020 | retrieve_specialization gives us both instantiations and | |
11021 | specializations, so we must explicitly check | |
11022 | DECL_TEMPLATE_SPECIALIZATION. */ | |
11023 | gen_tmpl = most_general_template (tmpl); | |
65f8b0fb MM |
11024 | gen_args = DECL_TI_ARGS (d); |
11025 | spec = retrieve_specialization (gen_tmpl, gen_args); | |
36a117a5 MM |
11026 | if (spec != NULL_TREE && DECL_TEMPLATE_SPECIALIZATION (spec)) |
11027 | return spec; | |
11028 | ||
11029 | /* This needs to happen before any tsubsting. */ | |
11030 | if (! push_tinst_level (d)) | |
11031 | return d; | |
11032 | ||
297a5329 JM |
11033 | timevar_push (TV_PARSE); |
11034 | ||
c1f927e8 | 11035 | /* We may be in the middle of deferred access check. Disable it now. */ |
7d021397 KL |
11036 | push_deferring_access_checks (dk_no_deferred); |
11037 | ||
4d85e00e | 11038 | /* Set TD to the template whose DECL_TEMPLATE_RESULT is the pattern |
a723baf1 MM |
11039 | for the instantiation. */ |
11040 | td = template_for_substitution (d); | |
fee23f54 | 11041 | code_pattern = DECL_TEMPLATE_RESULT (td); |
27bb8339 | 11042 | |
76d3baad KL |
11043 | if ((DECL_NAMESPACE_SCOPE_P (d) && !DECL_INITIALIZED_IN_CLASS_P (d)) |
11044 | || DECL_TEMPLATE_SPECIALIZATION (td)) | |
649fc72d NS |
11045 | /* In the case of a friend template whose definition is provided |
11046 | outside the class, we may have too many arguments. Drop the | |
76d3baad | 11047 | ones we don't need. The same is true for specializations. */ |
649fc72d NS |
11048 | args = get_innermost_template_args |
11049 | (gen_args, TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (td))); | |
11050 | else | |
11051 | args = gen_args; | |
65f8b0fb | 11052 | |
5566b478 | 11053 | if (TREE_CODE (d) == FUNCTION_DECL) |
39c76b4f | 11054 | pattern_defined = (DECL_SAVED_TREE (code_pattern) != NULL_TREE); |
5566b478 | 11055 | else |
36a117a5 | 11056 | pattern_defined = ! DECL_IN_AGGR_P (code_pattern); |
de22184b | 11057 | |
f31686a3 | 11058 | input_location = DECL_SOURCE_LOCATION (d); |
de22184b | 11059 | |
de22184b | 11060 | if (pattern_defined) |
5566b478 | 11061 | { |
7e9abee9 MM |
11062 | /* Let the repository code that this template definition is |
11063 | available. | |
11064 | ||
11065 | The repository doesn't need to know about cloned functions | |
11066 | because they never actually show up in the object file. It | |
11067 | does need to know about the clones; those are the symbols | |
11068 | that the linker will be emitting error messages about. */ | |
11069 | if (DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (d) | |
11070 | || DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (d)) | |
11071 | { | |
11072 | tree t; | |
11073 | ||
11074 | for (t = TREE_CHAIN (d); | |
11075 | t && DECL_CLONED_FUNCTION_P (t); | |
11076 | t = TREE_CHAIN (t)) | |
11077 | repo_template_used (t); | |
11078 | } | |
11079 | else | |
11080 | repo_template_used (d); | |
5566b478 | 11081 | |
e92cc029 | 11082 | if (at_eof) |
5566b478 MS |
11083 | import_export_decl (d); |
11084 | } | |
11085 | ||
415c974c MA |
11086 | if (! pattern_defined && DECL_EXPLICIT_INSTANTIATION (d) && undefined_ok) |
11087 | SET_DECL_IMPLICIT_INSTANTIATION (d); | |
11088 | ||
4f2b0fb2 NS |
11089 | if (!defer_ok) |
11090 | { | |
11091 | /* Recheck the substitutions to obtain any warning messages | |
11092 | about ignoring cv qualifiers. */ | |
11093 | tree gen = DECL_TEMPLATE_RESULT (gen_tmpl); | |
11094 | tree type = TREE_TYPE (gen); | |
11095 | ||
0e902d98 | 11096 | /* Make sure that we can see identifiers, and compute access |
2b59fc25 KL |
11097 | correctly. D is already the target FUNCTION_DECL with the |
11098 | right context. */ | |
11099 | push_access_scope (d); | |
0e902d98 | 11100 | |
4f2b0fb2 NS |
11101 | if (TREE_CODE (gen) == FUNCTION_DECL) |
11102 | { | |
65f8b0fb MM |
11103 | tsubst (DECL_ARGUMENTS (gen), gen_args, tf_error | tf_warning, d); |
11104 | tsubst (TYPE_RAISES_EXCEPTIONS (type), gen_args, | |
4f2b0fb2 NS |
11105 | tf_error | tf_warning, d); |
11106 | /* Don't simply tsubst the function type, as that will give | |
11107 | duplicate warnings about poor parameter qualifications. | |
11108 | The function arguments are the same as the decl_arguments | |
c6002625 | 11109 | without the top level cv qualifiers. */ |
4f2b0fb2 NS |
11110 | type = TREE_TYPE (type); |
11111 | } | |
65f8b0fb | 11112 | tsubst (type, gen_args, tf_error | tf_warning, d); |
0e902d98 | 11113 | |
2b59fc25 | 11114 | pop_access_scope (d); |
4f2b0fb2 NS |
11115 | } |
11116 | ||
46ccf50a JM |
11117 | if (TREE_CODE (d) == VAR_DECL && DECL_INITIALIZED_IN_CLASS_P (d) |
11118 | && DECL_INITIAL (d) == NULL_TREE) | |
11119 | /* We should have set up DECL_INITIAL in instantiate_class_template. */ | |
11120 | abort (); | |
930cd796 MM |
11121 | /* Reject all external templates except inline functions. */ |
11122 | else if (DECL_INTERFACE_KNOWN (d) | |
11123 | && ! DECL_NOT_REALLY_EXTERN (d) | |
4f8e1232 MM |
11124 | && ! (TREE_CODE (d) == FUNCTION_DECL |
11125 | && DECL_INLINE (d))) | |
930cd796 | 11126 | goto out; |
16d53b64 MM |
11127 | /* Defer all other templates, unless we have been explicitly |
11128 | forbidden from doing so. We restore the source position here | |
11129 | because it's used by add_pending_template. */ | |
11130 | else if (! pattern_defined || defer_ok) | |
11131 | { | |
82a98427 | 11132 | input_location = saved_loc; |
c27be9b9 | 11133 | |
03d0f4af MM |
11134 | if (at_eof && !pattern_defined |
11135 | && DECL_EXPLICIT_INSTANTIATION (d)) | |
11136 | /* [temp.explicit] | |
11137 | ||
11138 | The definition of a non-exported function template, a | |
11139 | non-exported member function template, or a non-exported | |
11140 | member function or static data member of a class template | |
11141 | shall be present in every translation unit in which it is | |
11142 | explicitly instantiated. */ | |
33bd39a2 | 11143 | pedwarn |
46ccf50a | 11144 | ("explicit instantiation of `%D' but no definition available", d); |
03d0f4af | 11145 | |
5566b478 | 11146 | add_pending_template (d); |
de22184b | 11147 | goto out; |
5566b478 MS |
11148 | } |
11149 | ||
6de9cd9a | 11150 | need_push = !cfun || !global_bindings_p (); |
31a714f6 MM |
11151 | if (need_push) |
11152 | push_to_top_level (); | |
414ea4aa | 11153 | |
66e0c440 KL |
11154 | /* Mark D as instantiated so that recursive calls to |
11155 | instantiate_decl do not try to instantiate it again. */ | |
11156 | DECL_TEMPLATE_INSTANTIATED (d) = 1; | |
11157 | ||
2b0a63a3 MM |
11158 | /* Regenerate the declaration in case the template has been modified |
11159 | by a subsequent redeclaration. */ | |
11160 | regenerate_decl_from_template (d, td); | |
1d62c33e | 11161 | |
120722ac | 11162 | /* We already set the file and line above. Reset them now in case |
6de9cd9a | 11163 | they changed as a result of calling regenerate_decl_from_template. */ |
f31686a3 | 11164 | input_location = DECL_SOURCE_LOCATION (d); |
5156628f | 11165 | |
5566b478 MS |
11166 | if (TREE_CODE (d) == VAR_DECL) |
11167 | { | |
1d62c33e MM |
11168 | /* Clear out DECL_RTL; whatever was there before may not be right |
11169 | since we've reset the type of the declaration. */ | |
11170 | SET_DECL_RTL (d, NULL_RTX); | |
11171 | ||
5566b478 | 11172 | DECL_IN_AGGR_P (d) = 0; |
b2dd096b MM |
11173 | import_export_decl (d); |
11174 | DECL_EXTERNAL (d) = ! DECL_NOT_REALLY_EXTERN (d); | |
ea56c40c MM |
11175 | |
11176 | if (DECL_EXTERNAL (d)) | |
11177 | { | |
11178 | /* The fact that this code is executing indicates that: | |
11179 | ||
11180 | (1) D is a template static data member, for which a | |
11181 | definition is available. | |
11182 | ||
34cd5ae7 | 11183 | (2) An implicit or explicit instantiation has occurred. |
ea56c40c MM |
11184 | |
11185 | (3) We are not going to emit a definition of the static | |
11186 | data member at this time. | |
11187 | ||
11188 | This situation is peculiar, but it occurs on platforms | |
11189 | without weak symbols when performing an implicit | |
11190 | instantiation. There, we cannot implicitly instantiate a | |
11191 | defined static data member in more than one translation | |
11192 | unit, so import_export_decl marks the declaration as | |
66e0c440 KL |
11193 | external; we must rely on explicit instantiation. |
11194 | ||
11195 | Reset instantiated marker to make sure that later | |
11196 | explicit instantiation will be processed. */ | |
11197 | DECL_TEMPLATE_INSTANTIATED (d) = 0; | |
ea56c40c MM |
11198 | } |
11199 | else | |
11200 | { | |
bc5ada84 KL |
11201 | /* This is done in analogous to `start_decl'. It is |
11202 | required for correct access checking. */ | |
11203 | push_nested_class (DECL_CONTEXT (d)); | |
ea56c40c MM |
11204 | cp_finish_decl (d, |
11205 | (!DECL_INITIALIZED_IN_CLASS_P (d) | |
11206 | ? DECL_INITIAL (d) : NULL_TREE), | |
11207 | NULL_TREE, 0); | |
bc5ada84 KL |
11208 | /* Normally, pop_nested_class is called by cp_finish_decl |
11209 | above. But when instantiate_decl is triggered during | |
11210 | instantiate_class_template processing, its DECL_CONTEXT | |
11211 | is still not completed yet, and pop_nested_class isn't | |
11212 | called. */ | |
11213 | if (!COMPLETE_TYPE_P (DECL_CONTEXT (d))) | |
11214 | pop_nested_class (); | |
ea56c40c | 11215 | } |
5566b478 MS |
11216 | } |
11217 | else if (TREE_CODE (d) == FUNCTION_DECL) | |
11218 | { | |
6bbf1598 | 11219 | htab_t saved_local_specializations; |
a723baf1 MM |
11220 | tree subst_decl; |
11221 | tree tmpl_parm; | |
11222 | tree spec_parm; | |
6bbf1598 | 11223 | |
ea56c40c MM |
11224 | /* Mark D as instantiated so that recursive calls to |
11225 | instantiate_decl do not try to instantiate it again. */ | |
11226 | DECL_TEMPLATE_INSTANTIATED (d) = 1; | |
11227 | ||
6bbf1598 MM |
11228 | /* Save away the current list, in case we are instantiating one |
11229 | template from within the body of another. */ | |
11230 | saved_local_specializations = local_specializations; | |
11231 | ||
6dfbb909 | 11232 | /* Set up the list of local specializations. */ |
6dfbb909 | 11233 | local_specializations = htab_create (37, |
69f794a7 | 11234 | hash_local_specialization, |
a723baf1 | 11235 | eq_local_specializations, |
6dfbb909 MM |
11236 | NULL); |
11237 | ||
558475f0 | 11238 | /* Set up context. */ |
0b50d7f1 | 11239 | import_export_decl (d); |
a8f73d4b | 11240 | start_function (NULL_TREE, d, NULL_TREE, SF_PRE_PARSED); |
5566b478 | 11241 | |
a723baf1 MM |
11242 | /* Create substitution entries for the parameters. */ |
11243 | subst_decl = DECL_TEMPLATE_RESULT (template_for_substitution (d)); | |
11244 | tmpl_parm = DECL_ARGUMENTS (subst_decl); | |
11245 | spec_parm = DECL_ARGUMENTS (d); | |
11246 | if (DECL_NONSTATIC_MEMBER_FUNCTION_P (d)) | |
11247 | { | |
11248 | register_local_specialization (spec_parm, tmpl_parm); | |
11249 | spec_parm = skip_artificial_parms_for (d, spec_parm); | |
11250 | tmpl_parm = skip_artificial_parms_for (subst_decl, tmpl_parm); | |
11251 | } | |
11252 | while (tmpl_parm) | |
11253 | { | |
11254 | register_local_specialization (spec_parm, tmpl_parm); | |
11255 | tmpl_parm = TREE_CHAIN (tmpl_parm); | |
11256 | spec_parm = TREE_CHAIN (spec_parm); | |
11257 | } | |
11258 | my_friendly_assert (!spec_parm, 20020813); | |
11259 | ||
558475f0 MM |
11260 | /* Substitute into the body of the function. */ |
11261 | tsubst_expr (DECL_SAVED_TREE (code_pattern), args, | |
c2ea3a40 | 11262 | tf_error | tf_warning, tmpl); |
558475f0 | 11263 | |
6dfbb909 MM |
11264 | /* We don't need the local specializations any more. */ |
11265 | htab_delete (local_specializations); | |
6bbf1598 | 11266 | local_specializations = saved_local_specializations; |
6dfbb909 | 11267 | |
4d6abc1c | 11268 | /* Finish the function. */ |
b2dd096b | 11269 | d = finish_function (0); |
8cd2462c | 11270 | expand_or_defer_fn (d); |
5566b478 MS |
11271 | } |
11272 | ||
971cbc14 MM |
11273 | /* We're not deferring instantiation any more. */ |
11274 | TI_PENDING_TEMPLATE_FLAG (DECL_TEMPLATE_INFO (d)) = 0; | |
11275 | ||
31a714f6 MM |
11276 | if (need_push) |
11277 | pop_from_top_level (); | |
414ea4aa | 11278 | |
de22184b | 11279 | out: |
82a98427 | 11280 | input_location = saved_loc; |
7d021397 | 11281 | pop_deferring_access_checks (); |
5566b478 | 11282 | pop_tinst_level (); |
a28e3c7f | 11283 | |
297a5329 JM |
11284 | timevar_pop (TV_PARSE); |
11285 | ||
a28e3c7f MS |
11286 | return d; |
11287 | } | |
5566b478 | 11288 | |
0aafb128 MM |
11289 | /* Run through the list of templates that we wish we could |
11290 | instantiate, and instantiate any we can. */ | |
11291 | ||
11292 | int | |
3a978d72 | 11293 | instantiate_pending_templates (void) |
0aafb128 MM |
11294 | { |
11295 | tree *t; | |
46ccf50a | 11296 | tree last = NULL_TREE; |
0aafb128 MM |
11297 | int instantiated_something = 0; |
11298 | int reconsider; | |
aad626f7 | 11299 | location_t saved_loc = input_location; |
0aafb128 MM |
11300 | |
11301 | do | |
11302 | { | |
11303 | reconsider = 0; | |
11304 | ||
11305 | t = &pending_templates; | |
11306 | while (*t) | |
11307 | { | |
0aafb128 MM |
11308 | tree instantiation = TREE_VALUE (*t); |
11309 | ||
3ae18eaf | 11310 | reopen_tinst_level (TREE_PURPOSE (*t)); |
0aafb128 | 11311 | |
2f939d94 | 11312 | if (TYPE_P (instantiation)) |
0aafb128 MM |
11313 | { |
11314 | tree fn; | |
11315 | ||
d0f062fb | 11316 | if (!COMPLETE_TYPE_P (instantiation)) |
0aafb128 MM |
11317 | { |
11318 | instantiate_class_template (instantiation); | |
11319 | if (CLASSTYPE_TEMPLATE_INSTANTIATION (instantiation)) | |
11320 | for (fn = TYPE_METHODS (instantiation); | |
11321 | fn; | |
11322 | fn = TREE_CHAIN (fn)) | |
11323 | if (! DECL_ARTIFICIAL (fn)) | |
415c974c | 11324 | instantiate_decl (fn, /*defer_ok=*/0, /*undefined_ok=*/0); |
d0f062fb | 11325 | if (COMPLETE_TYPE_P (instantiation)) |
0aafb128 MM |
11326 | { |
11327 | instantiated_something = 1; | |
11328 | reconsider = 1; | |
11329 | } | |
11330 | } | |
11331 | ||
d0f062fb | 11332 | if (COMPLETE_TYPE_P (instantiation)) |
0aafb128 MM |
11333 | /* If INSTANTIATION has been instantiated, then we don't |
11334 | need to consider it again in the future. */ | |
11335 | *t = TREE_CHAIN (*t); | |
46ccf50a JM |
11336 | else |
11337 | { | |
11338 | last = *t; | |
11339 | t = &TREE_CHAIN (*t); | |
11340 | } | |
0aafb128 MM |
11341 | } |
11342 | else | |
11343 | { | |
16d53b64 | 11344 | if (!DECL_TEMPLATE_SPECIALIZATION (instantiation) |
0aafb128 MM |
11345 | && !DECL_TEMPLATE_INSTANTIATED (instantiation)) |
11346 | { | |
16d53b64 | 11347 | instantiation = instantiate_decl (instantiation, |
415c974c MA |
11348 | /*defer_ok=*/0, |
11349 | /*undefined_ok=*/0); | |
0aafb128 MM |
11350 | if (DECL_TEMPLATE_INSTANTIATED (instantiation)) |
11351 | { | |
11352 | instantiated_something = 1; | |
11353 | reconsider = 1; | |
11354 | } | |
11355 | } | |
11356 | ||
16d53b64 | 11357 | if (DECL_TEMPLATE_SPECIALIZATION (instantiation) |
0aafb128 MM |
11358 | || DECL_TEMPLATE_INSTANTIATED (instantiation)) |
11359 | /* If INSTANTIATION has been instantiated, then we don't | |
11360 | need to consider it again in the future. */ | |
11361 | *t = TREE_CHAIN (*t); | |
46ccf50a JM |
11362 | else |
11363 | { | |
11364 | last = *t; | |
11365 | t = &TREE_CHAIN (*t); | |
11366 | } | |
0aafb128 | 11367 | } |
84e5ca0f NS |
11368 | tinst_depth = 0; |
11369 | current_tinst_level = NULL_TREE; | |
0aafb128 | 11370 | } |
46ccf50a | 11371 | last_pending_template = last; |
0aafb128 MM |
11372 | } |
11373 | while (reconsider); | |
11374 | ||
aad626f7 | 11375 | input_location = saved_loc; |
0aafb128 MM |
11376 | return instantiated_something; |
11377 | } | |
11378 | ||
fd74ca0b MM |
11379 | /* Substitute ARGVEC into T, which is a list of initializers for |
11380 | either base class or a non-static data member. The TREE_PURPOSEs | |
11381 | are DECLs, and the TREE_VALUEs are the initializer values. Used by | |
11382 | instantiate_decl. */ | |
4393e105 | 11383 | |
824b9a4c | 11384 | static tree |
3a978d72 | 11385 | tsubst_initializer_list (tree t, tree argvec) |
5566b478 | 11386 | { |
2282d28d | 11387 | tree inits = NULL_TREE; |
5566b478 MS |
11388 | |
11389 | for (; t; t = TREE_CHAIN (t)) | |
11390 | { | |
fd74ca0b MM |
11391 | tree decl; |
11392 | tree init; | |
11393 | tree val; | |
11394 | ||
c2ea3a40 | 11395 | decl = tsubst_copy (TREE_PURPOSE (t), argvec, tf_error | tf_warning, |
fd74ca0b | 11396 | NULL_TREE); |
1f5a253a NS |
11397 | decl = expand_member_init (decl); |
11398 | if (decl && !DECL_P (decl)) | |
11399 | in_base_initializer = 1; | |
11400 | ||
c2ea3a40 | 11401 | init = tsubst_expr (TREE_VALUE (t), argvec, tf_error | tf_warning, |
fd74ca0b | 11402 | NULL_TREE); |
fd74ca0b MM |
11403 | if (!init) |
11404 | ; | |
11405 | else if (TREE_CODE (init) == TREE_LIST) | |
11406 | for (val = init; val; val = TREE_CHAIN (val)) | |
11407 | TREE_VALUE (val) = convert_from_reference (TREE_VALUE (val)); | |
2282d28d | 11408 | else if (init != void_type_node) |
fd74ca0b MM |
11409 | init = convert_from_reference (init); |
11410 | ||
1f5a253a NS |
11411 | in_base_initializer = 0; |
11412 | ||
11413 | if (decl) | |
2282d28d | 11414 | { |
1f5a253a | 11415 | init = build_tree_list (decl, init); |
2282d28d MM |
11416 | TREE_CHAIN (init) = inits; |
11417 | inits = init; | |
11418 | } | |
5566b478 | 11419 | } |
2282d28d | 11420 | return inits; |
5566b478 MS |
11421 | } |
11422 | ||
61a127b3 MM |
11423 | /* Set CURRENT_ACCESS_SPECIFIER based on the protection of DECL. */ |
11424 | ||
11425 | static void | |
3a978d72 | 11426 | set_current_access_from_decl (tree decl) |
61a127b3 MM |
11427 | { |
11428 | if (TREE_PRIVATE (decl)) | |
11429 | current_access_specifier = access_private_node; | |
11430 | else if (TREE_PROTECTED (decl)) | |
11431 | current_access_specifier = access_protected_node; | |
11432 | else | |
11433 | current_access_specifier = access_public_node; | |
11434 | } | |
11435 | ||
dbfe2124 MM |
11436 | /* Instantiate an enumerated type. TAG is the template type, NEWTAG |
11437 | is the instantiation (which should have been created with | |
11438 | start_enum) and ARGS are the template arguments to use. */ | |
b87692e5 | 11439 | |
dbfe2124 | 11440 | static void |
3a978d72 | 11441 | tsubst_enum (tree tag, tree newtag, tree args) |
b87692e5 | 11442 | { |
dbfe2124 | 11443 | tree e; |
b87692e5 MS |
11444 | |
11445 | for (e = TYPE_VALUES (tag); e; e = TREE_CHAIN (e)) | |
11446 | { | |
61a127b3 | 11447 | tree value; |
7b6d72fc MM |
11448 | tree decl; |
11449 | ||
11450 | decl = TREE_VALUE (e); | |
61a127b3 MM |
11451 | /* Note that in a template enum, the TREE_VALUE is the |
11452 | CONST_DECL, not the corresponding INTEGER_CST. */ | |
7b6d72fc | 11453 | value = tsubst_expr (DECL_INITIAL (decl), |
c2ea3a40 | 11454 | args, tf_error | tf_warning, |
4393e105 | 11455 | NULL_TREE); |
61a127b3 MM |
11456 | |
11457 | /* Give this enumeration constant the correct access. */ | |
7b6d72fc | 11458 | set_current_access_from_decl (decl); |
61a127b3 MM |
11459 | |
11460 | /* Actually build the enumerator itself. */ | |
7b6d72fc | 11461 | build_enumerator (DECL_NAME (decl), value, newtag); |
dbfe2124 | 11462 | } |
b3d5a58b | 11463 | |
219670f1 | 11464 | finish_enum (newtag); |
f31686a3 RH |
11465 | DECL_SOURCE_LOCATION (TYPE_NAME (newtag)) |
11466 | = DECL_SOURCE_LOCATION (TYPE_NAME (tag)); | |
b87692e5 | 11467 | } |
36a117a5 | 11468 | |
1f6e1acc AS |
11469 | /* DECL is a FUNCTION_DECL that is a template specialization. Return |
11470 | its type -- but without substituting the innermost set of template | |
11471 | arguments. So, innermost set of template parameters will appear in | |
5c74d5b0 | 11472 | the type. */ |
1f6e1acc AS |
11473 | |
11474 | tree | |
3a978d72 | 11475 | get_mostly_instantiated_function_type (tree decl) |
1f6e1acc | 11476 | { |
1f6e1acc AS |
11477 | tree fn_type; |
11478 | tree tmpl; | |
11479 | tree targs; | |
11480 | tree tparms; | |
11481 | int parm_depth; | |
11482 | ||
11483 | tmpl = most_general_template (DECL_TI_TEMPLATE (decl)); | |
11484 | targs = DECL_TI_ARGS (decl); | |
11485 | tparms = DECL_TEMPLATE_PARMS (tmpl); | |
11486 | parm_depth = TMPL_PARMS_DEPTH (tparms); | |
11487 | ||
11488 | /* There should be as many levels of arguments as there are levels | |
11489 | of parameters. */ | |
11490 | my_friendly_assert (parm_depth == TMPL_ARGS_DEPTH (targs), 0); | |
11491 | ||
11492 | fn_type = TREE_TYPE (tmpl); | |
1f6e1acc AS |
11493 | |
11494 | if (parm_depth == 1) | |
11495 | /* No substitution is necessary. */ | |
11496 | ; | |
11497 | else | |
11498 | { | |
11499 | int i; | |
11500 | tree partial_args; | |
11501 | ||
11502 | /* Replace the innermost level of the TARGS with NULL_TREEs to | |
dc957d14 | 11503 | let tsubst know not to substitute for those parameters. */ |
1f6e1acc AS |
11504 | partial_args = make_tree_vec (TREE_VEC_LENGTH (targs)); |
11505 | for (i = 1; i < TMPL_ARGS_DEPTH (targs); ++i) | |
11506 | SET_TMPL_ARGS_LEVEL (partial_args, i, | |
11507 | TMPL_ARGS_LEVEL (targs, i)); | |
11508 | SET_TMPL_ARGS_LEVEL (partial_args, | |
11509 | TMPL_ARGS_DEPTH (targs), | |
11510 | make_tree_vec (DECL_NTPARMS (tmpl))); | |
11511 | ||
5c74d5b0 KL |
11512 | /* Make sure that we can see identifiers, and compute access |
11513 | correctly. We can just use the context of DECL for the | |
11514 | partial substitution here. It depends only on outer template | |
11515 | parameters, regardless of whether the innermost level is | |
11516 | specialized or not. */ | |
2b59fc25 | 11517 | push_access_scope (decl); |
5c74d5b0 | 11518 | |
9579624e | 11519 | ++processing_template_decl; |
1f6e1acc AS |
11520 | /* Now, do the (partial) substitution to figure out the |
11521 | appropriate function type. */ | |
c2ea3a40 | 11522 | fn_type = tsubst (fn_type, partial_args, tf_error, NULL_TREE); |
9579624e | 11523 | --processing_template_decl; |
1f6e1acc AS |
11524 | |
11525 | /* Substitute into the template parameters to obtain the real | |
11526 | innermost set of parameters. This step is important if the | |
11527 | innermost set of template parameters contains value | |
11528 | parameters whose types depend on outer template parameters. */ | |
11529 | TREE_VEC_LENGTH (partial_args)--; | |
c2ea3a40 | 11530 | tparms = tsubst_template_parms (tparms, partial_args, tf_error); |
1f6e1acc | 11531 | |
2b59fc25 | 11532 | pop_access_scope (decl); |
5c74d5b0 | 11533 | } |
1f6e1acc AS |
11534 | |
11535 | return fn_type; | |
11536 | } | |
669ec2b4 | 11537 | |
cb753e49 | 11538 | /* Return truthvalue if we're processing a template different from |
dc957d14 | 11539 | the last one involved in diagnostics. */ |
cb753e49 | 11540 | int |
3a978d72 | 11541 | problematic_instantiation_changed (void) |
cb753e49 GDR |
11542 | { |
11543 | return last_template_error_tick != tinst_level_tick; | |
11544 | } | |
11545 | ||
11546 | /* Remember current template involved in diagnostics. */ | |
11547 | void | |
3a978d72 | 11548 | record_last_problematic_instantiation (void) |
cb753e49 GDR |
11549 | { |
11550 | last_template_error_tick = tinst_level_tick; | |
11551 | } | |
11552 | ||
11553 | tree | |
3a978d72 | 11554 | current_instantiation (void) |
cb753e49 GDR |
11555 | { |
11556 | return current_tinst_level; | |
11557 | } | |
db3f4e4e NS |
11558 | |
11559 | /* [temp.param] Check that template non-type parm TYPE is of an allowable | |
838dfd8a | 11560 | type. Return zero for ok, nonzero for disallowed. Issue error and |
c2ea3a40 | 11561 | warning messages under control of COMPLAIN. */ |
db3f4e4e NS |
11562 | |
11563 | static int | |
3a978d72 | 11564 | invalid_nontype_parm_type_p (tree type, tsubst_flags_t complain) |
db3f4e4e NS |
11565 | { |
11566 | if (INTEGRAL_TYPE_P (type)) | |
11567 | return 0; | |
11568 | else if (POINTER_TYPE_P (type)) | |
11569 | return 0; | |
a5ac359a | 11570 | else if (TYPE_PTR_TO_MEMBER_P (type)) |
db3f4e4e | 11571 | return 0; |
db3f4e4e NS |
11572 | else if (TREE_CODE (type) == TEMPLATE_TYPE_PARM) |
11573 | return 0; | |
11574 | else if (TREE_CODE (type) == TYPENAME_TYPE) | |
11575 | return 0; | |
11576 | ||
c2ea3a40 | 11577 | if (complain & tf_error) |
33bd39a2 | 11578 | error ("`%#T' is not a valid type for a template constant parameter", |
db3f4e4e NS |
11579 | type); |
11580 | return 1; | |
11581 | } | |
e2500fed | 11582 | |
5552b43c MM |
11583 | /* Returns TRUE if TYPE is dependent, in the sense of [temp.dep.type]. |
11584 | Assumes that TYPE really is a type, and not the ERROR_MARK_NODE.*/ | |
1fb3244a | 11585 | |
5552b43c MM |
11586 | static bool |
11587 | dependent_type_p_r (tree type) | |
1fb3244a MM |
11588 | { |
11589 | tree scope; | |
11590 | ||
1fb3244a MM |
11591 | /* [temp.dep.type] |
11592 | ||
11593 | A type is dependent if it is: | |
11594 | ||
6bf92cb6 GB |
11595 | -- a template parameter. Template template parameters are |
11596 | types for us (since TYPE_P holds true for them) so we | |
11597 | handle them here. */ | |
11598 | if (TREE_CODE (type) == TEMPLATE_TYPE_PARM | |
11599 | || TREE_CODE (type) == TEMPLATE_TEMPLATE_PARM) | |
1fb3244a MM |
11600 | return true; |
11601 | /* -- a qualified-id with a nested-name-specifier which contains a | |
11602 | class-name that names a dependent type or whose unqualified-id | |
11603 | names a dependent type. */ | |
11604 | if (TREE_CODE (type) == TYPENAME_TYPE) | |
11605 | return true; | |
11606 | /* -- a cv-qualified type where the cv-unqualified type is | |
11607 | dependent. */ | |
11608 | type = TYPE_MAIN_VARIANT (type); | |
11609 | /* -- a compound type constructed from any dependent type. */ | |
a5ac359a | 11610 | if (TYPE_PTR_TO_MEMBER_P (type)) |
1fb3244a MM |
11611 | return (dependent_type_p (TYPE_PTRMEM_CLASS_TYPE (type)) |
11612 | || dependent_type_p (TYPE_PTRMEM_POINTED_TO_TYPE | |
11613 | (type))); | |
11614 | else if (TREE_CODE (type) == POINTER_TYPE | |
11615 | || TREE_CODE (type) == REFERENCE_TYPE) | |
11616 | return dependent_type_p (TREE_TYPE (type)); | |
11617 | else if (TREE_CODE (type) == FUNCTION_TYPE | |
11618 | || TREE_CODE (type) == METHOD_TYPE) | |
11619 | { | |
11620 | tree arg_type; | |
11621 | ||
11622 | if (dependent_type_p (TREE_TYPE (type))) | |
11623 | return true; | |
11624 | for (arg_type = TYPE_ARG_TYPES (type); | |
11625 | arg_type; | |
11626 | arg_type = TREE_CHAIN (arg_type)) | |
11627 | if (dependent_type_p (TREE_VALUE (arg_type))) | |
11628 | return true; | |
11629 | return false; | |
11630 | } | |
11631 | /* -- an array type constructed from any dependent type or whose | |
11632 | size is specified by a constant expression that is | |
11633 | value-dependent. */ | |
11634 | if (TREE_CODE (type) == ARRAY_TYPE) | |
11635 | { | |
11636 | if (TYPE_DOMAIN (type) | |
11637 | && ((value_dependent_expression_p | |
11638 | (TYPE_MAX_VALUE (TYPE_DOMAIN (type)))) | |
11639 | || (type_dependent_expression_p | |
11640 | (TYPE_MAX_VALUE (TYPE_DOMAIN (type)))))) | |
11641 | return true; | |
11642 | return dependent_type_p (TREE_TYPE (type)); | |
11643 | } | |
86306a6b | 11644 | |
1fb3244a | 11645 | /* -- a template-id in which either the template name is a template |
86306a6b NS |
11646 | parameter ... */ |
11647 | if (TREE_CODE (type) == BOUND_TEMPLATE_TEMPLATE_PARM) | |
1fb3244a | 11648 | return true; |
86306a6b | 11649 | /* ... or any of the template arguments is a dependent type or |
04c06002 | 11650 | an expression that is type-dependent or value-dependent. */ |
86306a6b | 11651 | else if (CLASS_TYPE_P (type) && CLASSTYPE_TEMPLATE_INFO (type) |
7e99327d MM |
11652 | && (any_dependent_template_arguments_p |
11653 | (INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (type))))) | |
1fb3244a | 11654 | return true; |
86306a6b | 11655 | |
1fb3244a MM |
11656 | /* All TYPEOF_TYPEs are dependent; if the argument of the `typeof' |
11657 | expression is not type-dependent, then it should already been | |
11658 | have resolved. */ | |
11659 | if (TREE_CODE (type) == TYPEOF_TYPE) | |
11660 | return true; | |
86306a6b | 11661 | |
1fb3244a MM |
11662 | /* The standard does not specifically mention types that are local |
11663 | to template functions or local classes, but they should be | |
11664 | considered dependent too. For example: | |
11665 | ||
11666 | template <int I> void f() { | |
11667 | enum E { a = I }; | |
11668 | S<sizeof (E)> s; | |
11669 | } | |
11670 | ||
11671 | The size of `E' cannot be known until the value of `I' has been | |
11672 | determined. Therefore, `E' must be considered dependent. */ | |
11673 | scope = TYPE_CONTEXT (type); | |
11674 | if (scope && TYPE_P (scope)) | |
11675 | return dependent_type_p (scope); | |
11676 | else if (scope && TREE_CODE (scope) == FUNCTION_DECL) | |
11677 | return type_dependent_expression_p (scope); | |
11678 | ||
11679 | /* Other types are non-dependent. */ | |
11680 | return false; | |
11681 | } | |
11682 | ||
5552b43c MM |
11683 | /* Returns TRUE if TYPE is dependent, in the sense of |
11684 | [temp.dep.type]. */ | |
11685 | ||
11686 | bool | |
11687 | dependent_type_p (tree type) | |
11688 | { | |
11689 | /* If there are no template parameters in scope, then there can't be | |
11690 | any dependent types. */ | |
11691 | if (!processing_template_decl) | |
11692 | return false; | |
11693 | ||
11694 | /* If the type is NULL, we have not computed a type for the entity | |
11695 | in question; in that case, the type is dependent. */ | |
11696 | if (!type) | |
11697 | return true; | |
11698 | ||
11699 | /* Erroneous types can be considered non-dependent. */ | |
11700 | if (type == error_mark_node) | |
11701 | return false; | |
11702 | ||
11703 | /* If we have not already computed the appropriate value for TYPE, | |
11704 | do so now. */ | |
11705 | if (!TYPE_DEPENDENT_P_VALID (type)) | |
11706 | { | |
11707 | TYPE_DEPENDENT_P (type) = dependent_type_p_r (type); | |
11708 | TYPE_DEPENDENT_P_VALID (type) = 1; | |
11709 | } | |
11710 | ||
11711 | return TYPE_DEPENDENT_P (type); | |
11712 | } | |
11713 | ||
8d83f792 MM |
11714 | /* Returns TRUE if EXPRESSION is dependent, according to CRITERION. */ |
11715 | ||
11716 | static bool | |
11717 | dependent_scope_ref_p (tree expression, bool criterion (tree)) | |
11718 | { | |
11719 | tree scope; | |
11720 | tree name; | |
11721 | ||
11722 | my_friendly_assert (TREE_CODE (expression) == SCOPE_REF, 20030714); | |
11723 | ||
11724 | if (!TYPE_P (TREE_OPERAND (expression, 0))) | |
11725 | return true; | |
11726 | ||
11727 | scope = TREE_OPERAND (expression, 0); | |
11728 | name = TREE_OPERAND (expression, 1); | |
11729 | ||
11730 | /* [temp.dep.expr] | |
11731 | ||
11732 | An id-expression is type-dependent if it contains a | |
11733 | nested-name-specifier that contains a class-name that names a | |
11734 | dependent type. */ | |
11735 | /* The suggested resolution to Core Issue 2 implies that if the | |
11736 | qualifying type is the current class, then we must peek | |
11737 | inside it. */ | |
11738 | if (DECL_P (name) | |
11739 | && currently_open_class (scope) | |
11740 | && !criterion (name)) | |
11741 | return false; | |
11742 | if (dependent_type_p (scope)) | |
11743 | return true; | |
11744 | ||
11745 | return false; | |
11746 | } | |
11747 | ||
20929c7f GB |
11748 | /* Returns TRUE if the EXPRESSION is value-dependent, in the sense of |
11749 | [temp.dep.constexpr] */ | |
1fb3244a | 11750 | |
14d22dd6 | 11751 | bool |
1fb3244a MM |
11752 | value_dependent_expression_p (tree expression) |
11753 | { | |
11754 | if (!processing_template_decl) | |
11755 | return false; | |
11756 | ||
11757 | /* A name declared with a dependent type. */ | |
10b1d5e7 | 11758 | if (TREE_CODE (expression) == IDENTIFIER_NODE |
00cf3e31 MM |
11759 | || (DECL_P (expression) |
11760 | && type_dependent_expression_p (expression))) | |
1fb3244a MM |
11761 | return true; |
11762 | /* A non-type template parameter. */ | |
11763 | if ((TREE_CODE (expression) == CONST_DECL | |
11764 | && DECL_TEMPLATE_PARM_P (expression)) | |
11765 | || TREE_CODE (expression) == TEMPLATE_PARM_INDEX) | |
11766 | return true; | |
11767 | /* A constant with integral or enumeration type and is initialized | |
11768 | with an expression that is value-dependent. */ | |
11769 | if (TREE_CODE (expression) == VAR_DECL | |
11770 | && DECL_INITIAL (expression) | |
d17811fd | 11771 | && INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (expression)) |
1fb3244a MM |
11772 | && value_dependent_expression_p (DECL_INITIAL (expression))) |
11773 | return true; | |
11774 | /* These expressions are value-dependent if the type to which the | |
20929c7f GB |
11775 | cast occurs is dependent or the expression being casted is |
11776 | value-dependent. */ | |
d17811fd MM |
11777 | if (TREE_CODE (expression) == DYNAMIC_CAST_EXPR |
11778 | || TREE_CODE (expression) == STATIC_CAST_EXPR | |
11779 | || TREE_CODE (expression) == CONST_CAST_EXPR | |
11780 | || TREE_CODE (expression) == REINTERPRET_CAST_EXPR | |
11781 | || TREE_CODE (expression) == CAST_EXPR) | |
11782 | { | |
d36d5600 GB |
11783 | tree type = TREE_TYPE (expression); |
11784 | if (dependent_type_p (type)) | |
d17811fd MM |
11785 | return true; |
11786 | /* A functional cast has a list of operands. */ | |
11787 | expression = TREE_OPERAND (expression, 0); | |
d36d5600 GB |
11788 | if (!expression) |
11789 | { | |
11790 | /* If there are no operands, it must be an expression such | |
11791 | as "int()". This should not happen for aggregate types | |
11792 | because it would form non-constant expressions. */ | |
11793 | my_friendly_assert (INTEGRAL_OR_ENUMERATION_TYPE_P (type), | |
11794 | 20040318); | |
11795 | ||
11796 | return false; | |
11797 | } | |
d17811fd MM |
11798 | if (TREE_CODE (expression) == TREE_LIST) |
11799 | { | |
11800 | do | |
11801 | { | |
11802 | if (value_dependent_expression_p (TREE_VALUE (expression))) | |
11803 | return true; | |
11804 | expression = TREE_CHAIN (expression); | |
11805 | } | |
11806 | while (expression); | |
11807 | return false; | |
11808 | } | |
11809 | else | |
11810 | return value_dependent_expression_p (expression); | |
11811 | } | |
11812 | /* A `sizeof' expression is value-dependent if the operand is | |
11813 | type-dependent. */ | |
11814 | if (TREE_CODE (expression) == SIZEOF_EXPR | |
11815 | || TREE_CODE (expression) == ALIGNOF_EXPR) | |
11816 | { | |
11817 | expression = TREE_OPERAND (expression, 0); | |
11818 | if (TYPE_P (expression)) | |
11819 | return dependent_type_p (expression); | |
11820 | return type_dependent_expression_p (expression); | |
11821 | } | |
8d83f792 MM |
11822 | if (TREE_CODE (expression) == SCOPE_REF) |
11823 | return dependent_scope_ref_p (expression, value_dependent_expression_p); | |
3d5ddced GB |
11824 | if (TREE_CODE (expression) == COMPONENT_REF) |
11825 | return (value_dependent_expression_p (TREE_OPERAND (expression, 0)) | |
11826 | || value_dependent_expression_p (TREE_OPERAND (expression, 1))); | |
1fb3244a MM |
11827 | /* A constant expression is value-dependent if any subexpression is |
11828 | value-dependent. */ | |
11829 | if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (TREE_CODE (expression)))) | |
11830 | { | |
11831 | switch (TREE_CODE_CLASS (TREE_CODE (expression))) | |
11832 | { | |
11833 | case '1': | |
11834 | return (value_dependent_expression_p | |
11835 | (TREE_OPERAND (expression, 0))); | |
11836 | case '<': | |
11837 | case '2': | |
11838 | return ((value_dependent_expression_p | |
11839 | (TREE_OPERAND (expression, 0))) | |
11840 | || (value_dependent_expression_p | |
11841 | (TREE_OPERAND (expression, 1)))); | |
11842 | case 'e': | |
11843 | { | |
11844 | int i; | |
14d22dd6 MM |
11845 | for (i = 0; i < first_rtl_op (TREE_CODE (expression)); ++i) |
11846 | /* In some cases, some of the operands may be missing. | |
11847 | (For example, in the case of PREDECREMENT_EXPR, the | |
11848 | amount to increment by may be missing.) That doesn't | |
11849 | make the expression dependent. */ | |
11850 | if (TREE_OPERAND (expression, i) | |
11851 | && (value_dependent_expression_p | |
11852 | (TREE_OPERAND (expression, i)))) | |
1fb3244a MM |
11853 | return true; |
11854 | return false; | |
11855 | } | |
11856 | } | |
11857 | } | |
11858 | ||
11859 | /* The expression is not value-dependent. */ | |
11860 | return false; | |
11861 | } | |
11862 | ||
11863 | /* Returns TRUE if the EXPRESSION is type-dependent, in the sense of | |
11864 | [temp.dep.expr]. */ | |
11865 | ||
11866 | bool | |
3a978d72 | 11867 | type_dependent_expression_p (tree expression) |
1fb3244a MM |
11868 | { |
11869 | if (!processing_template_decl) | |
11870 | return false; | |
11871 | ||
7efa3e22 NS |
11872 | if (expression == error_mark_node) |
11873 | return false; | |
10b1d5e7 MM |
11874 | |
11875 | /* An unresolved name is always dependent. */ | |
11876 | if (TREE_CODE (expression) == IDENTIFIER_NODE) | |
11877 | return true; | |
7efa3e22 | 11878 | |
1fb3244a MM |
11879 | /* Some expression forms are never type-dependent. */ |
11880 | if (TREE_CODE (expression) == PSEUDO_DTOR_EXPR | |
11881 | || TREE_CODE (expression) == SIZEOF_EXPR | |
11882 | || TREE_CODE (expression) == ALIGNOF_EXPR | |
11883 | || TREE_CODE (expression) == TYPEID_EXPR | |
11884 | || TREE_CODE (expression) == DELETE_EXPR | |
11885 | || TREE_CODE (expression) == VEC_DELETE_EXPR | |
11886 | || TREE_CODE (expression) == THROW_EXPR) | |
11887 | return false; | |
11888 | ||
11889 | /* The types of these expressions depends only on the type to which | |
11890 | the cast occurs. */ | |
11891 | if (TREE_CODE (expression) == DYNAMIC_CAST_EXPR | |
11892 | || TREE_CODE (expression) == STATIC_CAST_EXPR | |
11893 | || TREE_CODE (expression) == CONST_CAST_EXPR | |
11894 | || TREE_CODE (expression) == REINTERPRET_CAST_EXPR | |
11895 | || TREE_CODE (expression) == CAST_EXPR) | |
11896 | return dependent_type_p (TREE_TYPE (expression)); | |
d17811fd | 11897 | |
1fb3244a MM |
11898 | /* The types of these expressions depends only on the type created |
11899 | by the expression. */ | |
d17811fd MM |
11900 | if (TREE_CODE (expression) == NEW_EXPR |
11901 | || TREE_CODE (expression) == VEC_NEW_EXPR) | |
09d2f85f KL |
11902 | { |
11903 | /* For NEW_EXPR tree nodes created inside a template, either | |
11904 | the object type itself or a TREE_LIST may appear as the | |
11905 | operand 1. */ | |
11906 | tree type = TREE_OPERAND (expression, 1); | |
11907 | if (TREE_CODE (type) == TREE_LIST) | |
11908 | /* This is an array type. We need to check array dimensions | |
11909 | as well. */ | |
11910 | return dependent_type_p (TREE_VALUE (TREE_PURPOSE (type))) | |
11911 | || value_dependent_expression_p | |
11912 | (TREE_OPERAND (TREE_VALUE (type), 1)); | |
11913 | else | |
11914 | return dependent_type_p (type); | |
11915 | } | |
1fb3244a | 11916 | |
d17811fd MM |
11917 | if (TREE_TYPE (expression) == unknown_type_node) |
11918 | { | |
11919 | if (TREE_CODE (expression) == ADDR_EXPR) | |
11920 | return type_dependent_expression_p (TREE_OPERAND (expression, 0)); | |
c353b8e3 MM |
11921 | if (TREE_CODE (expression) == COMPONENT_REF |
11922 | || TREE_CODE (expression) == OFFSET_REF) | |
6cb89308 NS |
11923 | { |
11924 | if (type_dependent_expression_p (TREE_OPERAND (expression, 0))) | |
11925 | return true; | |
11926 | expression = TREE_OPERAND (expression, 1); | |
11927 | if (TREE_CODE (expression) == IDENTIFIER_NODE) | |
11928 | return false; | |
11929 | } | |
43daf8ff KL |
11930 | if (TREE_CODE (expression) == SCOPE_REF) |
11931 | return false; | |
11932 | ||
d17811fd MM |
11933 | if (TREE_CODE (expression) == BASELINK) |
11934 | expression = BASELINK_FUNCTIONS (expression); | |
11935 | if (TREE_CODE (expression) == TEMPLATE_ID_EXPR) | |
11936 | { | |
ee3071ef NS |
11937 | if (any_dependent_template_arguments_p |
11938 | (TREE_OPERAND (expression, 1))) | |
d17811fd MM |
11939 | return true; |
11940 | expression = TREE_OPERAND (expression, 0); | |
11941 | } | |
11942 | if (TREE_CODE (expression) == OVERLOAD) | |
11943 | { | |
11944 | while (expression) | |
11945 | { | |
11946 | if (type_dependent_expression_p (OVL_CURRENT (expression))) | |
11947 | return true; | |
11948 | expression = OVL_NEXT (expression); | |
11949 | } | |
11950 | return false; | |
11951 | } | |
11952 | abort (); | |
11953 | } | |
11954 | ||
43daf8ff KL |
11955 | if (TREE_CODE (expression) == SCOPE_REF |
11956 | && dependent_scope_ref_p (expression, | |
11957 | type_dependent_expression_p)) | |
11958 | return true; | |
11959 | ||
11960 | if (TREE_CODE (expression) == FUNCTION_DECL | |
11961 | && DECL_LANG_SPECIFIC (expression) | |
11962 | && DECL_TEMPLATE_INFO (expression) | |
11963 | && (any_dependent_template_arguments_p | |
11964 | (INNERMOST_TEMPLATE_ARGS (DECL_TI_ARGS (expression))))) | |
11965 | return true; | |
11966 | ||
11967 | if (TREE_CODE (expression) == TEMPLATE_DECL | |
11968 | && !DECL_TEMPLATE_TEMPLATE_PARM_P (expression)) | |
11969 | return false; | |
11970 | ||
1fb3244a MM |
11971 | return (dependent_type_p (TREE_TYPE (expression))); |
11972 | } | |
11973 | ||
d17811fd MM |
11974 | /* Returns TRUE if ARGS (a TREE_LIST of arguments to a function call) |
11975 | contains a type-dependent expression. */ | |
1fb3244a MM |
11976 | |
11977 | bool | |
d17811fd MM |
11978 | any_type_dependent_arguments_p (tree args) |
11979 | { | |
11980 | while (args) | |
11981 | { | |
7efa3e22 NS |
11982 | tree arg = TREE_VALUE (args); |
11983 | ||
11984 | if (type_dependent_expression_p (arg)) | |
d17811fd MM |
11985 | return true; |
11986 | args = TREE_CHAIN (args); | |
11987 | } | |
11988 | return false; | |
11989 | } | |
11990 | ||
11991 | /* Returns TRUE if the ARG (a template argument) is dependent. */ | |
11992 | ||
11993 | static bool | |
1fb3244a MM |
11994 | dependent_template_arg_p (tree arg) |
11995 | { | |
11996 | if (!processing_template_decl) | |
11997 | return false; | |
11998 | ||
11999 | if (TREE_CODE (arg) == TEMPLATE_DECL | |
12000 | || TREE_CODE (arg) == TEMPLATE_TEMPLATE_PARM) | |
12001 | return dependent_template_p (arg); | |
12002 | else if (TYPE_P (arg)) | |
12003 | return dependent_type_p (arg); | |
12004 | else | |
12005 | return (type_dependent_expression_p (arg) | |
12006 | || value_dependent_expression_p (arg)); | |
12007 | } | |
12008 | ||
d17811fd MM |
12009 | /* Returns true if ARGS (a collection of template arguments) contains |
12010 | any dependent arguments. */ | |
1fb3244a | 12011 | |
d17811fd MM |
12012 | bool |
12013 | any_dependent_template_arguments_p (tree args) | |
1fb3244a | 12014 | { |
bf12d54d | 12015 | int i; |
c353b8e3 MM |
12016 | int j; |
12017 | ||
d17811fd MM |
12018 | if (!args) |
12019 | return false; | |
12020 | ||
c353b8e3 MM |
12021 | for (i = 0; i < TMPL_ARGS_DEPTH (args); ++i) |
12022 | { | |
12023 | tree level = TMPL_ARGS_LEVEL (args, i + 1); | |
12024 | for (j = 0; j < TREE_VEC_LENGTH (level); ++j) | |
12025 | if (dependent_template_arg_p (TREE_VEC_ELT (level, j))) | |
12026 | return true; | |
12027 | } | |
1fb3244a | 12028 | |
1fb3244a MM |
12029 | return false; |
12030 | } | |
12031 | ||
12032 | /* Returns TRUE if the template TMPL is dependent. */ | |
12033 | ||
12034 | bool | |
12035 | dependent_template_p (tree tmpl) | |
12036 | { | |
b95cc51a MM |
12037 | if (TREE_CODE (tmpl) == OVERLOAD) |
12038 | { | |
12039 | while (tmpl) | |
12040 | { | |
12041 | if (dependent_template_p (OVL_FUNCTION (tmpl))) | |
12042 | return true; | |
12043 | tmpl = OVL_CHAIN (tmpl); | |
12044 | } | |
12045 | return false; | |
12046 | } | |
12047 | ||
1fb3244a MM |
12048 | /* Template template parameters are dependent. */ |
12049 | if (DECL_TEMPLATE_TEMPLATE_PARM_P (tmpl) | |
12050 | || TREE_CODE (tmpl) == TEMPLATE_TEMPLATE_PARM) | |
12051 | return true; | |
d17811fd MM |
12052 | /* So are qualified names that have not been looked up. */ |
12053 | if (TREE_CODE (tmpl) == SCOPE_REF) | |
12054 | return true; | |
1fb3244a MM |
12055 | /* So are member templates of dependent classes. */ |
12056 | if (TYPE_P (CP_DECL_CONTEXT (tmpl))) | |
12057 | return dependent_type_p (DECL_CONTEXT (tmpl)); | |
12058 | return false; | |
12059 | } | |
12060 | ||
d17811fd MM |
12061 | /* Returns TRUE if the specialization TMPL<ARGS> is dependent. */ |
12062 | ||
12063 | bool | |
12064 | dependent_template_id_p (tree tmpl, tree args) | |
12065 | { | |
12066 | return (dependent_template_p (tmpl) | |
12067 | || any_dependent_template_arguments_p (args)); | |
12068 | } | |
12069 | ||
14d22dd6 MM |
12070 | /* TYPE is a TYPENAME_TYPE. Returns the ordinary TYPE to which the |
12071 | TYPENAME_TYPE corresponds. Returns ERROR_MARK_NODE if no such TYPE | |
12072 | can be found. Note that this function peers inside uninstantiated | |
12073 | templates and therefore should be used only in extremely limited | |
12074 | situations. */ | |
12075 | ||
12076 | tree | |
12077 | resolve_typename_type (tree type, bool only_current_p) | |
12078 | { | |
12079 | tree scope; | |
12080 | tree name; | |
12081 | tree decl; | |
12082 | int quals; | |
91b004e5 | 12083 | bool pop_p; |
14d22dd6 MM |
12084 | |
12085 | my_friendly_assert (TREE_CODE (type) == TYPENAME_TYPE, | |
12086 | 20010702); | |
12087 | ||
12088 | scope = TYPE_CONTEXT (type); | |
12089 | name = TYPE_IDENTIFIER (type); | |
12090 | ||
12091 | /* If the SCOPE is itself a TYPENAME_TYPE, then we need to resolve | |
12092 | it first before we can figure out what NAME refers to. */ | |
12093 | if (TREE_CODE (scope) == TYPENAME_TYPE) | |
12094 | scope = resolve_typename_type (scope, only_current_p); | |
12095 | /* If we don't know what SCOPE refers to, then we cannot resolve the | |
12096 | TYPENAME_TYPE. */ | |
12097 | if (scope == error_mark_node || TREE_CODE (scope) == TYPENAME_TYPE) | |
12098 | return error_mark_node; | |
12099 | /* If the SCOPE is a template type parameter, we have no way of | |
12100 | resolving the name. */ | |
12101 | if (TREE_CODE (scope) == TEMPLATE_TYPE_PARM) | |
12102 | return type; | |
12103 | /* If the SCOPE is not the current instantiation, there's no reason | |
12104 | to look inside it. */ | |
12105 | if (only_current_p && !currently_open_class (scope)) | |
12106 | return error_mark_node; | |
ca099ac8 MM |
12107 | /* If SCOPE is a partial instantiation, it will not have a valid |
12108 | TYPE_FIELDS list, so use the original template. */ | |
353b4fc0 | 12109 | scope = CLASSTYPE_PRIMARY_TEMPLATE_TYPE (scope); |
14d22dd6 MM |
12110 | /* Enter the SCOPE so that name lookup will be resolved as if we |
12111 | were in the class definition. In particular, SCOPE will no | |
12112 | longer be considered a dependent type. */ | |
91b004e5 | 12113 | pop_p = push_scope (scope); |
14d22dd6 | 12114 | /* Look up the declaration. */ |
86ac0575 | 12115 | decl = lookup_member (scope, name, /*protect=*/0, /*want_type=*/true); |
14d22dd6 MM |
12116 | /* Obtain the set of qualifiers applied to the TYPE. */ |
12117 | quals = cp_type_quals (type); | |
12118 | /* For a TYPENAME_TYPE like "typename X::template Y<T>", we want to | |
12119 | find a TEMPLATE_DECL. Otherwise, we want to find a TYPE_DECL. */ | |
12120 | if (!decl) | |
12121 | type = error_mark_node; | |
12122 | else if (TREE_CODE (TYPENAME_TYPE_FULLNAME (type)) == IDENTIFIER_NODE | |
12123 | && TREE_CODE (decl) == TYPE_DECL) | |
12124 | type = TREE_TYPE (decl); | |
12125 | else if (TREE_CODE (TYPENAME_TYPE_FULLNAME (type)) == TEMPLATE_ID_EXPR | |
12126 | && DECL_CLASS_TEMPLATE_P (decl)) | |
12127 | { | |
12128 | tree tmpl; | |
12129 | tree args; | |
12130 | /* Obtain the template and the arguments. */ | |
12131 | tmpl = TREE_OPERAND (TYPENAME_TYPE_FULLNAME (type), 0); | |
12132 | args = TREE_OPERAND (TYPENAME_TYPE_FULLNAME (type), 1); | |
12133 | /* Instantiate the template. */ | |
12134 | type = lookup_template_class (tmpl, args, NULL_TREE, NULL_TREE, | |
42eaed49 | 12135 | /*entering_scope=*/0, tf_error | tf_user); |
14d22dd6 MM |
12136 | } |
12137 | else | |
12138 | type = error_mark_node; | |
12139 | /* Qualify the resulting type. */ | |
12140 | if (type != error_mark_node && quals) | |
12141 | type = cp_build_qualified_type (type, quals); | |
12142 | /* Leave the SCOPE. */ | |
91b004e5 MM |
12143 | if (pop_p) |
12144 | pop_scope (scope); | |
14d22dd6 MM |
12145 | |
12146 | return type; | |
12147 | } | |
12148 | ||
d17811fd MM |
12149 | /* EXPR is an expression which is not type-dependent. Return a proxy |
12150 | for EXPR that can be used to compute the types of larger | |
12151 | expressions containing EXPR. */ | |
12152 | ||
12153 | tree | |
12154 | build_non_dependent_expr (tree expr) | |
12155 | { | |
0deb916c MM |
12156 | tree inner_expr; |
12157 | ||
d17811fd MM |
12158 | /* Preserve null pointer constants so that the type of things like |
12159 | "p == 0" where "p" is a pointer can be determined. */ | |
12160 | if (null_ptr_cst_p (expr)) | |
12161 | return expr; | |
12162 | /* Preserve OVERLOADs; the functions must be available to resolve | |
12163 | types. */ | |
0deb916c MM |
12164 | inner_expr = (TREE_CODE (expr) == ADDR_EXPR ? |
12165 | TREE_OPERAND (expr, 0) : expr); | |
12166 | if (TREE_CODE (inner_expr) == OVERLOAD | |
12167 | || TREE_CODE (inner_expr) == FUNCTION_DECL | |
12168 | || TREE_CODE (inner_expr) == TEMPLATE_DECL | |
12169 | || TREE_CODE (inner_expr) == TEMPLATE_ID_EXPR) | |
d17811fd | 12170 | return expr; |
7433e6d4 MM |
12171 | /* Preserve string constants; conversions from string constants to |
12172 | "char *" are allowed, even though normally a "const char *" | |
12173 | cannot be used to initialize a "char *". */ | |
12174 | if (TREE_CODE (expr) == STRING_CST) | |
12175 | return expr; | |
b7c707d1 MM |
12176 | /* Preserve arithmetic constants, as an optimization -- there is no |
12177 | reason to create a new node. */ | |
12178 | if (TREE_CODE (expr) == INTEGER_CST || TREE_CODE (expr) == REAL_CST) | |
12179 | return expr; | |
9b7be7b5 MM |
12180 | /* Preserve THROW_EXPRs -- all throw-expressions have type "void". |
12181 | There is at least one place where we want to know that a | |
12182 | particular expression is a throw-expression: when checking a ?: | |
12183 | expression, there are special rules if the second or third | |
878cbb73 | 12184 | argument is a throw-expression. */ |
9b7be7b5 MM |
12185 | if (TREE_CODE (expr) == THROW_EXPR) |
12186 | return expr; | |
47d4c811 NS |
12187 | |
12188 | if (TREE_CODE (expr) == COND_EXPR) | |
12189 | return build (COND_EXPR, | |
12190 | TREE_TYPE (expr), | |
12191 | TREE_OPERAND (expr, 0), | |
40bec508 MM |
12192 | (TREE_OPERAND (expr, 1) |
12193 | ? build_non_dependent_expr (TREE_OPERAND (expr, 1)) | |
12194 | : build_non_dependent_expr (TREE_OPERAND (expr, 0))), | |
47d4c811 | 12195 | build_non_dependent_expr (TREE_OPERAND (expr, 2))); |
8e1daa34 NS |
12196 | if (TREE_CODE (expr) == COMPOUND_EXPR |
12197 | && !COMPOUND_EXPR_OVERLOADED (expr)) | |
47d4c811 NS |
12198 | return build (COMPOUND_EXPR, |
12199 | TREE_TYPE (expr), | |
12200 | TREE_OPERAND (expr, 0), | |
12201 | build_non_dependent_expr (TREE_OPERAND (expr, 1))); | |
12202 | ||
d17811fd MM |
12203 | /* Otherwise, build a NON_DEPENDENT_EXPR. |
12204 | ||
12205 | REFERENCE_TYPEs are not stripped for expressions in templates | |
12206 | because doing so would play havoc with mangling. Consider, for | |
12207 | example: | |
12208 | ||
12209 | template <typename T> void f<T& g>() { g(); } | |
12210 | ||
12211 | In the body of "f", the expression for "g" will have | |
12212 | REFERENCE_TYPE, even though the standard says that it should | |
12213 | not. The reason is that we must preserve the syntactic form of | |
12214 | the expression so that mangling (say) "f<g>" inside the body of | |
12215 | "f" works out correctly. Therefore, the REFERENCE_TYPE is | |
12216 | stripped here. */ | |
018a5803 | 12217 | return build1 (NON_DEPENDENT_EXPR, non_reference (TREE_TYPE (expr)), expr); |
d17811fd MM |
12218 | } |
12219 | ||
12220 | /* ARGS is a TREE_LIST of expressions as arguments to a function call. | |
12221 | Return a new TREE_LIST with the various arguments replaced with | |
12222 | equivalent non-dependent expressions. */ | |
12223 | ||
12224 | tree | |
12225 | build_non_dependent_args (tree args) | |
12226 | { | |
12227 | tree a; | |
12228 | tree new_args; | |
12229 | ||
12230 | new_args = NULL_TREE; | |
12231 | for (a = args; a; a = TREE_CHAIN (a)) | |
12232 | new_args = tree_cons (NULL_TREE, | |
12233 | build_non_dependent_expr (TREE_VALUE (a)), | |
12234 | new_args); | |
12235 | return nreverse (new_args); | |
12236 | } | |
12237 | ||
e2500fed | 12238 | #include "gt-cp-pt.h" |