]>
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" |
e8abc66f | 39 | #include "output.h" |
49c249e1 | 40 | #include "except.h" |
54f92bfb | 41 | #include "toplev.h" |
3dcaad8b | 42 | #include "rtl.h" |
297a5329 | 43 | #include "timevar.h" |
325c3691 | 44 | #include "tree-iterator.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); | |
5fe7b654 | 158 | static tree determine_specialization (tree, tree, tree *, int, int); |
3a978d72 NN |
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 | |
b1cc95ce MM |
711 | /* A explicit specialization or partial specialization TMPL is being |
712 | declared. Check that the namespace in which the specialization is | |
713 | occurring is permissible. Returns false iff it is invalid to | |
714 | specialize TMPL in the current namespace. */ | |
715 | ||
716 | static bool | |
717 | check_specialization_namespace (tree tmpl) | |
718 | { | |
719 | tree tpl_ns = decl_namespace_context (tmpl); | |
720 | ||
721 | /* [tmpl.expl.spec] | |
722 | ||
723 | An explicit specialization shall be declared in the namespace of | |
724 | which the template is a member, or, for member templates, in the | |
725 | namespace of which the enclosing class or enclosing class | |
726 | template is a member. An explicit specialization of a member | |
727 | function, member class or static data member of a class template | |
728 | shall be declared in the namespace of which the class template is | |
729 | a member. */ | |
730 | if (is_associated_namespace (current_namespace, tpl_ns)) | |
731 | /* Same or super-using namespace. */ | |
732 | return true; | |
733 | else | |
734 | { | |
735 | pedwarn ("specialization of `%D' in different namespace", tmpl); | |
736 | cp_pedwarn_at (" from definition of `%#D'", tmpl); | |
737 | return false; | |
738 | } | |
739 | } | |
740 | ||
36a117a5 MM |
741 | /* The TYPE is being declared. If it is a template type, that means it |
742 | is a partial specialization. Do appropriate error-checking. */ | |
743 | ||
744 | void | |
3a978d72 | 745 | maybe_process_partial_specialization (tree type) |
36a117a5 | 746 | { |
6e049fcd KL |
747 | /* TYPE maybe an ERROR_MARK_NODE. */ |
748 | tree context = TYPE_P (type) ? TYPE_CONTEXT (type) : NULL_TREE; | |
749 | ||
a723baf1 | 750 | if (CLASS_TYPE_P (type) && CLASSTYPE_USE_TEMPLATE (type)) |
36a117a5 | 751 | { |
6e049fcd KL |
752 | /* This is for ordinary explicit specialization and partial |
753 | specialization of a template class such as: | |
754 | ||
755 | template <> class C<int>; | |
756 | ||
757 | or: | |
758 | ||
759 | template <class T> class C<T*>; | |
760 | ||
761 | Make sure that `C<int>' and `C<T*>' are implicit instantiations. */ | |
762 | ||
36a117a5 | 763 | if (CLASSTYPE_IMPLICIT_INSTANTIATION (type) |
d0f062fb | 764 | && !COMPLETE_TYPE_P (type)) |
36a117a5 | 765 | { |
b1cc95ce | 766 | check_specialization_namespace (CLASSTYPE_TI_TEMPLATE (type)); |
370af2d5 | 767 | SET_CLASSTYPE_TEMPLATE_SPECIALIZATION (type); |
36a117a5 MM |
768 | if (processing_template_decl) |
769 | push_template_decl (TYPE_MAIN_DECL (type)); | |
770 | } | |
771 | else if (CLASSTYPE_TEMPLATE_INSTANTIATION (type)) | |
33bd39a2 | 772 | error ("specialization of `%T' after instantiation", type); |
36a117a5 | 773 | } |
6e049fcd KL |
774 | else if (CLASS_TYPE_P (type) |
775 | && !CLASSTYPE_USE_TEMPLATE (type) | |
776 | && CLASSTYPE_TEMPLATE_INFO (type) | |
777 | && context && CLASS_TYPE_P (context) | |
778 | && CLASSTYPE_TEMPLATE_INFO (context)) | |
779 | { | |
780 | /* This is for an explicit specialization of member class | |
781 | template according to [temp.expl.spec/18]: | |
782 | ||
783 | template <> template <class U> class C<int>::D; | |
784 | ||
785 | The context `C<int>' must be an implicit instantiation. | |
786 | Otherwise this is just a member class template declared | |
787 | earlier like: | |
788 | ||
789 | template <> class C<int> { template <class U> class D; }; | |
790 | template <> template <class U> class C<int>::D; | |
791 | ||
792 | In the first case, `C<int>::D' is a specialization of `C<T>::D' | |
793 | while in the second case, `C<int>::D' is a primary template | |
794 | and `C<T>::D' may not exist. */ | |
795 | ||
796 | if (CLASSTYPE_IMPLICIT_INSTANTIATION (context) | |
797 | && !COMPLETE_TYPE_P (type)) | |
798 | { | |
799 | tree t; | |
800 | ||
801 | if (current_namespace | |
802 | != decl_namespace_context (CLASSTYPE_TI_TEMPLATE (type))) | |
803 | { | |
804 | pedwarn ("specializing `%#T' in different namespace", type); | |
805 | cp_pedwarn_at (" from definition of `%#D'", | |
806 | CLASSTYPE_TI_TEMPLATE (type)); | |
807 | } | |
808 | ||
809 | /* Check for invalid specialization after instantiation: | |
810 | ||
811 | template <> template <> class C<int>::D<int>; | |
812 | template <> template <class U> class C<int>::D; */ | |
813 | ||
814 | for (t = DECL_TEMPLATE_INSTANTIATIONS | |
815 | (most_general_template (CLASSTYPE_TI_TEMPLATE (type))); | |
816 | t; t = TREE_CHAIN (t)) | |
817 | if (TREE_VALUE (t) != type | |
818 | && TYPE_CONTEXT (TREE_VALUE (t)) == context) | |
819 | error ("specialization `%T' after instantiation `%T'", | |
820 | type, TREE_VALUE (t)); | |
821 | ||
822 | /* Mark TYPE as a specialization. And as a result, we only | |
823 | have one level of template argument for the innermost | |
824 | class template. */ | |
825 | SET_CLASSTYPE_TEMPLATE_SPECIALIZATION (type); | |
826 | CLASSTYPE_TI_ARGS (type) | |
827 | = INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (type)); | |
828 | } | |
829 | } | |
20496fa2 | 830 | else if (processing_specialization) |
33bd39a2 | 831 | error ("explicit specialization of non-template `%T'", type); |
36a117a5 MM |
832 | } |
833 | ||
75650646 MM |
834 | /* Retrieve the specialization (in the sense of [temp.spec] - a |
835 | specialization is either an instantiation or an explicit | |
836 | specialization) of TMPL for the given template ARGS. If there is | |
837 | no such specialization, return NULL_TREE. The ARGS are a vector of | |
838 | arguments, or a vector of vectors of arguments, in the case of | |
839 | templates with more than one level of parameters. */ | |
840 | ||
841 | static tree | |
3a978d72 | 842 | retrieve_specialization (tree tmpl, tree args) |
75650646 MM |
843 | { |
844 | tree s; | |
845 | ||
846 | my_friendly_assert (TREE_CODE (tmpl) == TEMPLATE_DECL, 0); | |
847 | ||
36a117a5 MM |
848 | /* There should be as many levels of arguments as there are |
849 | levels of parameters. */ | |
850 | my_friendly_assert (TMPL_ARGS_DEPTH (args) | |
851 | == TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl)), | |
852 | 0); | |
853 | ||
75650646 MM |
854 | for (s = DECL_TEMPLATE_SPECIALIZATIONS (tmpl); |
855 | s != NULL_TREE; | |
856 | s = TREE_CHAIN (s)) | |
857 | if (comp_template_args (TREE_PURPOSE (s), args)) | |
858 | return TREE_VALUE (s); | |
859 | ||
860 | return NULL_TREE; | |
386b8a85 JM |
861 | } |
862 | ||
dc957d14 | 863 | /* Like retrieve_specialization, but for local declarations. */ |
9188c363 MM |
864 | |
865 | static tree | |
3a978d72 | 866 | retrieve_local_specialization (tree tmpl) |
9188c363 | 867 | { |
c68b0a84 KG |
868 | tree spec = htab_find_with_hash (local_specializations, tmpl, |
869 | htab_hash_pointer (tmpl)); | |
a723baf1 | 870 | return spec ? TREE_PURPOSE (spec) : NULL_TREE; |
9188c363 MM |
871 | } |
872 | ||
838dfd8a | 873 | /* Returns nonzero iff DECL is a specialization of TMPL. */ |
6757edfe MM |
874 | |
875 | int | |
3a978d72 | 876 | is_specialization_of (tree decl, tree tmpl) |
6757edfe MM |
877 | { |
878 | tree t; | |
879 | ||
880 | if (TREE_CODE (decl) == FUNCTION_DECL) | |
881 | { | |
882 | for (t = decl; | |
883 | t != NULL_TREE; | |
884 | t = DECL_TEMPLATE_INFO (t) ? DECL_TI_TEMPLATE (t) : NULL_TREE) | |
885 | if (t == tmpl) | |
886 | return 1; | |
887 | } | |
888 | else | |
889 | { | |
890 | my_friendly_assert (TREE_CODE (decl) == TYPE_DECL, 0); | |
891 | ||
892 | for (t = TREE_TYPE (decl); | |
893 | t != NULL_TREE; | |
894 | t = CLASSTYPE_USE_TEMPLATE (t) | |
895 | ? TREE_TYPE (CLASSTYPE_TI_TEMPLATE (t)) : NULL_TREE) | |
9edc3913 | 896 | if (same_type_ignoring_top_level_qualifiers_p (t, TREE_TYPE (tmpl))) |
6757edfe MM |
897 | return 1; |
898 | } | |
386b8a85 | 899 | |
6757edfe MM |
900 | return 0; |
901 | } | |
75650646 | 902 | |
d43f603d KL |
903 | /* Returns nonzero iff DECL is a specialization of friend declaration |
904 | FRIEND according to [temp.friend]. */ | |
905 | ||
906 | bool | |
907 | is_specialization_of_friend (tree decl, tree friend) | |
908 | { | |
909 | bool need_template = true; | |
910 | int template_depth; | |
911 | ||
912 | my_friendly_assert (TREE_CODE (decl) == FUNCTION_DECL, 0); | |
913 | ||
914 | /* For [temp.friend/6] when FRIEND is an ordinary member function | |
915 | of a template class, we want to check if DECL is a specialization | |
916 | if this. */ | |
917 | if (TREE_CODE (friend) == FUNCTION_DECL | |
918 | && DECL_TEMPLATE_INFO (friend) | |
919 | && !DECL_USE_TEMPLATE (friend)) | |
920 | { | |
921 | friend = DECL_TI_TEMPLATE (friend); | |
922 | need_template = false; | |
923 | } | |
924 | ||
925 | /* There is nothing to do if this is not a template friend. */ | |
926 | if (TREE_CODE (friend) != TEMPLATE_DECL) | |
927 | return 0; | |
928 | ||
929 | if (is_specialization_of (decl, friend)) | |
930 | return 1; | |
931 | ||
932 | /* [temp.friend/6] | |
933 | A member of a class template may be declared to be a friend of a | |
934 | non-template class. In this case, the corresponding member of | |
935 | every specialization of the class template is a friend of the | |
936 | class granting friendship. | |
937 | ||
938 | For example, given a template friend declaration | |
939 | ||
940 | template <class T> friend void A<T>::f(); | |
941 | ||
942 | the member function below is considered a friend | |
943 | ||
944 | template <> struct A<int> { | |
945 | void f(); | |
946 | }; | |
947 | ||
948 | For this type of template friend, TEMPLATE_DEPTH below will be | |
5c425df5 | 949 | nonzero. To determine if DECL is a friend of FRIEND, we first |
d43f603d KL |
950 | check if the enclosing class is a specialization of another. */ |
951 | ||
952 | template_depth = template_class_depth (DECL_CONTEXT (friend)); | |
953 | if (template_depth | |
954 | && DECL_CLASS_SCOPE_P (decl) | |
955 | && is_specialization_of (TYPE_NAME (DECL_CONTEXT (decl)), | |
956 | CLASSTYPE_TI_TEMPLATE (DECL_CONTEXT (friend)))) | |
957 | { | |
958 | /* Next, we check the members themselves. In order to handle | |
959 | a few tricky cases like | |
960 | ||
961 | template <class T> friend void A<T>::g(T t); | |
962 | template <class T> template <T t> friend void A<T>::h(); | |
963 | ||
964 | we need to figure out what ARGS is (corresponding to `T' in above | |
965 | examples) from DECL for later processing. */ | |
966 | ||
967 | tree context = DECL_CONTEXT (decl); | |
968 | tree args = NULL_TREE; | |
969 | int current_depth = 0; | |
970 | while (current_depth < template_depth) | |
971 | { | |
972 | if (CLASSTYPE_TEMPLATE_INFO (context)) | |
973 | { | |
974 | if (current_depth == 0) | |
975 | args = TYPE_TI_ARGS (context); | |
976 | else | |
977 | args = add_to_template_args (TYPE_TI_ARGS (context), args); | |
978 | current_depth++; | |
979 | } | |
980 | context = TYPE_CONTEXT (context); | |
981 | } | |
982 | ||
983 | if (TREE_CODE (decl) == FUNCTION_DECL) | |
984 | { | |
985 | bool is_template; | |
986 | tree friend_type; | |
987 | tree decl_type; | |
988 | tree friend_args_type; | |
989 | tree decl_args_type; | |
990 | ||
991 | /* Make sure that both DECL and FRIEND are templates or | |
992 | non-templates. */ | |
993 | is_template = DECL_TEMPLATE_INFO (decl) | |
994 | && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (decl)); | |
995 | if (need_template ^ is_template) | |
996 | return 0; | |
997 | else if (is_template) | |
998 | { | |
da1d7781 | 999 | /* If both are templates, check template parameter list. */ |
d43f603d KL |
1000 | tree friend_parms |
1001 | = tsubst_template_parms (DECL_TEMPLATE_PARMS (friend), | |
1002 | args, tf_none); | |
1003 | if (!comp_template_parms | |
1004 | (DECL_TEMPLATE_PARMS (DECL_TI_TEMPLATE (decl)), | |
1005 | friend_parms)) | |
1006 | return 0; | |
1007 | ||
1008 | decl_type = TREE_TYPE (DECL_TI_TEMPLATE (decl)); | |
1009 | } | |
1010 | else | |
1011 | decl_type = TREE_TYPE (decl); | |
1012 | ||
1013 | friend_type = tsubst_function_type (TREE_TYPE (friend), args, | |
1014 | tf_none, NULL_TREE); | |
1015 | if (friend_type == error_mark_node) | |
1016 | return 0; | |
1017 | ||
1018 | /* Check if return types match. */ | |
1019 | if (!same_type_p (TREE_TYPE (decl_type), TREE_TYPE (friend_type))) | |
1020 | return 0; | |
1021 | ||
1022 | /* Check if function parameter types match, ignoring the | |
1023 | `this' parameter. */ | |
1024 | friend_args_type = TYPE_ARG_TYPES (friend_type); | |
1025 | decl_args_type = TYPE_ARG_TYPES (decl_type); | |
1026 | if (DECL_NONSTATIC_MEMBER_FUNCTION_P (friend)) | |
1027 | friend_args_type = TREE_CHAIN (friend_args_type); | |
1028 | if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl)) | |
1029 | decl_args_type = TREE_CHAIN (decl_args_type); | |
1030 | if (compparms (decl_args_type, friend_args_type)) | |
1031 | return 1; | |
1032 | } | |
1033 | } | |
1034 | return 0; | |
1035 | } | |
1036 | ||
75650646 | 1037 | /* Register the specialization SPEC as a specialization of TMPL with |
36a117a5 MM |
1038 | the indicated ARGS. Returns SPEC, or an equivalent prior |
1039 | declaration, if available. */ | |
75650646 | 1040 | |
36a117a5 | 1041 | static tree |
3a978d72 | 1042 | register_specialization (tree spec, tree tmpl, tree args) |
75650646 MM |
1043 | { |
1044 | tree s; | |
1045 | ||
1046 | my_friendly_assert (TREE_CODE (tmpl) == TEMPLATE_DECL, 0); | |
1047 | ||
36a117a5 MM |
1048 | if (TREE_CODE (spec) == FUNCTION_DECL |
1049 | && uses_template_parms (DECL_TI_ARGS (spec))) | |
1050 | /* This is the FUNCTION_DECL for a partial instantiation. Don't | |
1051 | register it; we want the corresponding TEMPLATE_DECL instead. | |
1052 | We use `uses_template_parms (DECL_TI_ARGS (spec))' rather than | |
1053 | the more obvious `uses_template_parms (spec)' to avoid problems | |
1054 | with default function arguments. In particular, given | |
1055 | something like this: | |
1056 | ||
1057 | template <class T> void f(T t1, T t = T()) | |
1058 | ||
1059 | the default argument expression is not substituted for in an | |
1060 | instantiation unless and until it is actually needed. */ | |
1061 | return spec; | |
28ba38e3 | 1062 | |
36a117a5 MM |
1063 | /* There should be as many levels of arguments as there are |
1064 | levels of parameters. */ | |
1065 | my_friendly_assert (TMPL_ARGS_DEPTH (args) | |
1066 | == TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl)), | |
1067 | 0); | |
1068 | ||
75650646 MM |
1069 | for (s = DECL_TEMPLATE_SPECIALIZATIONS (tmpl); |
1070 | s != NULL_TREE; | |
1071 | s = TREE_CHAIN (s)) | |
22e9174f MM |
1072 | { |
1073 | tree fn = TREE_VALUE (s); | |
1074 | ||
1075 | /* We can sometimes try to re-register a specialization that we've | |
1076 | already got. In particular, regenerate_decl_from_template | |
1077 | calls duplicate_decls which will update the specialization | |
1078 | list. But, we'll still get called again here anyhow. It's | |
1079 | more convenient to simply allow this than to try to prevent it. */ | |
1080 | if (fn == spec) | |
1081 | return spec; | |
6f4234e9 KL |
1082 | else if (DECL_TEMPLATE_SPECIALIZATION (spec) |
1083 | && comp_template_args (TREE_PURPOSE (s), args)) | |
22e9174f | 1084 | { |
b1cc95ce | 1085 | if (DECL_TEMPLATE_INSTANTIATION (fn)) |
22e9174f | 1086 | { |
b1cc95ce MM |
1087 | if (TREE_USED (fn) |
1088 | || DECL_EXPLICIT_INSTANTIATION (fn)) | |
22e9174f | 1089 | { |
b1cc95ce MM |
1090 | error ("specialization of %D after instantiation", |
1091 | fn); | |
1092 | return spec; | |
22e9174f | 1093 | } |
b1cc95ce | 1094 | else |
22e9174f | 1095 | { |
b1cc95ce MM |
1096 | /* This situation should occur only if the first |
1097 | specialization is an implicit instantiation, the | |
1098 | second is an explicit specialization, and the | |
1099 | implicit instantiation has not yet been used. | |
1100 | That situation can occur if we have implicitly | |
1101 | instantiated a member function and then | |
1102 | specialized it later. | |
1103 | ||
1104 | We can also wind up here if a friend declaration | |
1105 | that looked like an instantiation turns out to be | |
1106 | a specialization: | |
1107 | ||
1108 | template <class T> void foo(T); | |
1109 | class S { friend void foo<>(int) }; | |
1110 | template <> void foo(int); | |
1111 | ||
1112 | We transform the existing DECL in place so that | |
1113 | any pointers to it become pointers to the updated | |
1114 | declaration. | |
1115 | ||
1116 | If there was a definition for the template, but | |
1117 | not for the specialization, we want this to look | |
1118 | as if there were no definition, and vice | |
1119 | versa. */ | |
1120 | DECL_INITIAL (fn) = NULL_TREE; | |
1121 | duplicate_decls (spec, fn); | |
b190f239 | 1122 | |
22e9174f MM |
1123 | return fn; |
1124 | } | |
1125 | } | |
b1cc95ce MM |
1126 | else if (DECL_TEMPLATE_SPECIALIZATION (fn)) |
1127 | { | |
1128 | if (!duplicate_decls (spec, fn) && DECL_INITIAL (spec)) | |
1129 | /* Dup decl failed, but this is a new definition. Set | |
1130 | the line number so any errors match this new | |
1131 | definition. */ | |
1132 | DECL_SOURCE_LOCATION (fn) = DECL_SOURCE_LOCATION (spec); | |
1133 | ||
1134 | return fn; | |
1135 | } | |
22e9174f | 1136 | } |
b1cc95ce MM |
1137 | } |
1138 | ||
1139 | /* A specialization must be declared in the same namespace as the | |
1140 | template it is specializing. */ | |
1141 | if (DECL_TEMPLATE_SPECIALIZATION (spec) | |
1142 | && !check_specialization_namespace (tmpl)) | |
1143 | DECL_CONTEXT (spec) = decl_namespace_context (tmpl); | |
75650646 MM |
1144 | |
1145 | DECL_TEMPLATE_SPECIALIZATIONS (tmpl) | |
e1b3e07d | 1146 | = tree_cons (args, spec, DECL_TEMPLATE_SPECIALIZATIONS (tmpl)); |
36a117a5 MM |
1147 | |
1148 | return spec; | |
1149 | } | |
1150 | ||
1151 | /* Unregister the specialization SPEC as a specialization of TMPL. | |
b3445994 MM |
1152 | Replace it with NEW_SPEC, if NEW_SPEC is non-NULL. Returns true |
1153 | if the SPEC was listed as a specialization of TMPL. */ | |
36a117a5 | 1154 | |
b3445994 MM |
1155 | bool |
1156 | reregister_specialization (tree spec, tree tmpl, tree new_spec) | |
36a117a5 MM |
1157 | { |
1158 | tree* s; | |
1159 | ||
1160 | for (s = &DECL_TEMPLATE_SPECIALIZATIONS (tmpl); | |
1161 | *s != NULL_TREE; | |
1162 | s = &TREE_CHAIN (*s)) | |
1163 | if (TREE_VALUE (*s) == spec) | |
1164 | { | |
b3445994 MM |
1165 | if (!new_spec) |
1166 | *s = TREE_CHAIN (*s); | |
1167 | else | |
a3d87771 | 1168 | TREE_VALUE (*s) = new_spec; |
36a117a5 MM |
1169 | return 1; |
1170 | } | |
1171 | ||
1172 | return 0; | |
75650646 MM |
1173 | } |
1174 | ||
a723baf1 MM |
1175 | /* Compare an entry in the local specializations hash table P1 (which |
1176 | is really a pointer to a TREE_LIST) with P2 (which is really a | |
1177 | DECL). */ | |
1178 | ||
1179 | static int | |
1180 | eq_local_specializations (const void *p1, const void *p2) | |
1181 | { | |
1182 | return TREE_VALUE ((tree) p1) == (tree) p2; | |
1183 | } | |
1184 | ||
69f794a7 MM |
1185 | /* Hash P1, an entry in the local specializations table. */ |
1186 | ||
1187 | static hashval_t | |
1188 | hash_local_specialization (const void* p1) | |
1189 | { | |
1190 | return htab_hash_pointer (TREE_VALUE ((tree) p1)); | |
1191 | } | |
1192 | ||
6dfbb909 MM |
1193 | /* Like register_specialization, but for local declarations. We are |
1194 | registering SPEC, an instantiation of TMPL. */ | |
9188c363 | 1195 | |
414ea4aa | 1196 | static void |
3a978d72 | 1197 | register_local_specialization (tree spec, tree tmpl) |
9188c363 | 1198 | { |
6dfbb909 MM |
1199 | void **slot; |
1200 | ||
69f794a7 MM |
1201 | slot = htab_find_slot_with_hash (local_specializations, tmpl, |
1202 | htab_hash_pointer (tmpl), INSERT); | |
a723baf1 | 1203 | *slot = build_tree_list (spec, tmpl); |
9188c363 MM |
1204 | } |
1205 | ||
e1467ff2 MM |
1206 | /* Print the list of candidate FNS in an error message. */ |
1207 | ||
104bf76a | 1208 | void |
3a978d72 | 1209 | print_candidates (tree fns) |
e1467ff2 MM |
1210 | { |
1211 | tree fn; | |
1212 | ||
d8e178a0 | 1213 | const char *str = "candidates are:"; |
e1467ff2 MM |
1214 | |
1215 | for (fn = fns; fn != NULL_TREE; fn = TREE_CHAIN (fn)) | |
1216 | { | |
d6479fe7 MM |
1217 | tree f; |
1218 | ||
1219 | for (f = TREE_VALUE (fn); f; f = OVL_NEXT (f)) | |
1220 | cp_error_at ("%s %+#D", str, OVL_CURRENT (f)); | |
e1467ff2 MM |
1221 | str = " "; |
1222 | } | |
1223 | } | |
1224 | ||
75650646 | 1225 | /* Returns the template (one of the functions given by TEMPLATE_ID) |
e1467ff2 | 1226 | which can be specialized to match the indicated DECL with the |
03017874 MM |
1227 | explicit template args given in TEMPLATE_ID. The DECL may be |
1228 | NULL_TREE if none is available. In that case, the functions in | |
1229 | TEMPLATE_ID are non-members. | |
1230 | ||
838dfd8a | 1231 | If NEED_MEMBER_TEMPLATE is nonzero the function is known to be a |
03017874 MM |
1232 | specialization of a member template. |
1233 | ||
5fe7b654 GB |
1234 | The TEMPLATE_COUNT is the number of references to qualifying |
1235 | template classes that appeared in the name of the function. See | |
1236 | check_explicit_specialization for a more accurate description. | |
1237 | ||
03017874 MM |
1238 | The template args (those explicitly specified and those deduced) |
1239 | are output in a newly created vector *TARGS_OUT. | |
1240 | ||
1241 | If it is impossible to determine the result, an error message is | |
bf8f3f93 | 1242 | issued. The error_mark_node is returned to indicate failure. */ |
75650646 | 1243 | |
e9659ab0 | 1244 | static tree |
3a978d72 NN |
1245 | determine_specialization (tree template_id, |
1246 | tree decl, | |
1247 | tree* targs_out, | |
5fe7b654 GB |
1248 | int need_member_template, |
1249 | int template_count) | |
386b8a85 | 1250 | { |
03017874 MM |
1251 | tree fns; |
1252 | tree targs; | |
1253 | tree explicit_targs; | |
1254 | tree candidates = NULL_TREE; | |
1255 | tree templates = NULL_TREE; | |
5fe7b654 GB |
1256 | int header_count; |
1257 | struct cp_binding_level *b; | |
386b8a85 | 1258 | |
e1467ff2 MM |
1259 | *targs_out = NULL_TREE; |
1260 | ||
f2e48b67 BK |
1261 | if (template_id == error_mark_node) |
1262 | return error_mark_node; | |
1263 | ||
1264 | fns = TREE_OPERAND (template_id, 0); | |
03017874 | 1265 | explicit_targs = TREE_OPERAND (template_id, 1); |
f2e48b67 | 1266 | |
27fafc8d JM |
1267 | if (fns == error_mark_node) |
1268 | return error_mark_node; | |
1269 | ||
c6002625 | 1270 | /* Check for baselinks. */ |
91e490ab | 1271 | if (BASELINK_P (fns)) |
da15dae6 | 1272 | fns = BASELINK_FUNCTIONS (fns); |
386b8a85 | 1273 | |
91e490ab MM |
1274 | if (!is_overloaded_fn (fns)) |
1275 | { | |
33bd39a2 | 1276 | error ("`%D' is not a function template", fns); |
91e490ab MM |
1277 | return error_mark_node; |
1278 | } | |
1279 | ||
5fe7b654 GB |
1280 | /* Count the number of template headers specified for this |
1281 | specialization. */ | |
1282 | header_count = 0; | |
1283 | for (b = current_binding_level; | |
1284 | b->kind == sk_template_parms || b->kind == sk_template_spec; | |
1285 | b = b->level_chain) | |
1286 | ++header_count; | |
1287 | ||
2c73f9f5 | 1288 | for (; fns; fns = OVL_NEXT (fns)) |
386b8a85 | 1289 | { |
9dfce8fd | 1290 | tree fn = OVL_CURRENT (fns); |
03017874 MM |
1291 | |
1292 | if (TREE_CODE (fn) == TEMPLATE_DECL) | |
d955f6ea KL |
1293 | { |
1294 | tree decl_arg_types; | |
0da99d4e | 1295 | tree fn_arg_types; |
d955f6ea KL |
1296 | |
1297 | /* DECL might be a specialization of FN. */ | |
1298 | ||
1299 | /* Adjust the type of DECL in case FN is a static member. */ | |
1300 | decl_arg_types = TYPE_ARG_TYPES (TREE_TYPE (decl)); | |
1301 | if (DECL_STATIC_FUNCTION_P (fn) | |
1302 | && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl)) | |
1303 | decl_arg_types = TREE_CHAIN (decl_arg_types); | |
1304 | ||
1305 | /* Check that the number of function parameters matches. | |
1306 | For example, | |
1307 | template <class T> void f(int i = 0); | |
1308 | template <> void f<int>(); | |
0e339752 | 1309 | The specialization f<int> is invalid but is not caught |
d955f6ea KL |
1310 | by get_bindings below. */ |
1311 | ||
0da99d4e GB |
1312 | fn_arg_types = TYPE_ARG_TYPES (TREE_TYPE (fn)); |
1313 | if (list_length (fn_arg_types) != list_length (decl_arg_types)) | |
1314 | continue; | |
1315 | ||
1316 | /* For a non-static member function, we need to make sure that | |
1317 | the const qualification is the same. This can be done by | |
1318 | checking the 'this' in the argument list. */ | |
1319 | if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fn) | |
1320 | && !same_type_p (TREE_VALUE (fn_arg_types), | |
1321 | TREE_VALUE (decl_arg_types))) | |
d955f6ea KL |
1322 | continue; |
1323 | ||
5fe7b654 GB |
1324 | /* In case of explicit specialization, we need to check if |
1325 | the number of template headers appearing in the specialization | |
1326 | is correct. This is usually done in check_explicit_specialization, | |
1327 | but the check done there cannot be exhaustive when specializing | |
1328 | member functions. Consider the following code: | |
1329 | ||
1330 | template <> void A<int>::f(int); | |
1331 | template <> template <> void A<int>::f(int); | |
1332 | ||
1333 | Assuming that A<int> is not itself an explicit specialization | |
1334 | already, the first line specializes "f" which is a non-template | |
1335 | member function, whilst the second line specializes "f" which | |
1336 | is a template member function. So both lines are syntactically | |
1337 | correct, and check_explicit_specialization does not reject | |
1338 | them. | |
1339 | ||
1340 | Here, we can do better, as we are matching the specialization | |
1341 | against the declarations. We count the number of template | |
1342 | headers, and we check if they match TEMPLATE_COUNT + 1 | |
1343 | (TEMPLATE_COUNT is the number of qualifying template classes, | |
1344 | plus there must be another header for the member template | |
1345 | itself). | |
1346 | ||
1347 | Notice that if header_count is zero, this is not a | |
1348 | specialization but rather a template instantiation, so there | |
1349 | is no check we can perform here. */ | |
1350 | if (header_count && header_count != template_count + 1) | |
1351 | continue; | |
1352 | ||
d955f6ea KL |
1353 | /* See whether this function might be a specialization of this |
1354 | template. */ | |
1355 | targs = get_bindings (fn, decl, explicit_targs); | |
1356 | ||
1357 | if (!targs) | |
1358 | /* We cannot deduce template arguments that when used to | |
1359 | specialize TMPL will produce DECL. */ | |
1360 | continue; | |
1361 | ||
1362 | /* Save this template, and the arguments deduced. */ | |
1363 | templates = tree_cons (targs, fn, templates); | |
1364 | } | |
03017874 MM |
1365 | else if (need_member_template) |
1366 | /* FN is an ordinary member function, and we need a | |
1367 | specialization of a member template. */ | |
d955f6ea | 1368 | ; |
03017874 MM |
1369 | else if (TREE_CODE (fn) != FUNCTION_DECL) |
1370 | /* We can get IDENTIFIER_NODEs here in certain erroneous | |
1371 | cases. */ | |
d955f6ea | 1372 | ; |
03017874 MM |
1373 | else if (!DECL_FUNCTION_MEMBER_P (fn)) |
1374 | /* This is just an ordinary non-member function. Nothing can | |
1375 | be a specialization of that. */ | |
d955f6ea | 1376 | ; |
3b82c249 KL |
1377 | else if (DECL_ARTIFICIAL (fn)) |
1378 | /* Cannot specialize functions that are created implicitly. */ | |
d955f6ea | 1379 | ; |
75650646 | 1380 | else |
03017874 MM |
1381 | { |
1382 | tree decl_arg_types; | |
386b8a85 | 1383 | |
03017874 MM |
1384 | /* This is an ordinary member function. However, since |
1385 | we're here, we can assume it's enclosing class is a | |
1386 | template class. For example, | |
1387 | ||
1388 | template <typename T> struct S { void f(); }; | |
1389 | template <> void S<int>::f() {} | |
1390 | ||
1391 | Here, S<int>::f is a non-template, but S<int> is a | |
1392 | template class. If FN has the same type as DECL, we | |
1393 | might be in business. */ | |
f5d47abd KL |
1394 | |
1395 | if (!DECL_TEMPLATE_INFO (fn)) | |
1396 | /* Its enclosing class is an explicit specialization | |
1397 | of a template class. This is not a candidate. */ | |
1398 | continue; | |
1399 | ||
03017874 MM |
1400 | if (!same_type_p (TREE_TYPE (TREE_TYPE (decl)), |
1401 | TREE_TYPE (TREE_TYPE (fn)))) | |
1402 | /* The return types differ. */ | |
1403 | continue; | |
1404 | ||
1405 | /* Adjust the type of DECL in case FN is a static member. */ | |
1406 | decl_arg_types = TYPE_ARG_TYPES (TREE_TYPE (decl)); | |
1407 | if (DECL_STATIC_FUNCTION_P (fn) | |
1408 | && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl)) | |
1409 | decl_arg_types = TREE_CHAIN (decl_arg_types); | |
1410 | ||
1411 | if (compparms (TYPE_ARG_TYPES (TREE_TYPE (fn)), | |
1412 | decl_arg_types)) | |
1413 | /* They match! */ | |
1414 | candidates = tree_cons (NULL_TREE, fn, candidates); | |
03017874 | 1415 | } |
386b8a85 | 1416 | } |
03017874 | 1417 | |
bf8f3f93 | 1418 | if (templates && TREE_CHAIN (templates)) |
386b8a85 | 1419 | { |
03017874 MM |
1420 | /* We have: |
1421 | ||
1422 | [temp.expl.spec] | |
1423 | ||
1424 | It is possible for a specialization with a given function | |
1425 | signature to be instantiated from more than one function | |
1426 | template. In such cases, explicit specification of the | |
1427 | template arguments must be used to uniquely identify the | |
1428 | function template specialization being specialized. | |
1429 | ||
1430 | Note that here, there's no suggestion that we're supposed to | |
1431 | determine which of the candidate templates is most | |
1432 | specialized. However, we, also have: | |
1433 | ||
1434 | [temp.func.order] | |
1435 | ||
1436 | Partial ordering of overloaded function template | |
1437 | declarations is used in the following contexts to select | |
1438 | the function template to which a function template | |
1439 | specialization refers: | |
1440 | ||
1441 | -- when an explicit specialization refers to a function | |
1442 | template. | |
1443 | ||
1444 | So, we do use the partial ordering rules, at least for now. | |
0e339752 | 1445 | This extension can only serve to make invalid programs valid, |
03017874 MM |
1446 | so it's safe. And, there is strong anecdotal evidence that |
1447 | the committee intended the partial ordering rules to apply; | |
1448 | the EDG front-end has that behavior, and John Spicer claims | |
1449 | that the committee simply forgot to delete the wording in | |
1450 | [temp.expl.spec]. */ | |
1451 | tree tmpl = most_specialized (templates, decl, explicit_targs); | |
1452 | if (tmpl && tmpl != error_mark_node) | |
1453 | { | |
1454 | targs = get_bindings (tmpl, decl, explicit_targs); | |
e1b3e07d | 1455 | templates = tree_cons (targs, tmpl, NULL_TREE); |
03017874 | 1456 | } |
e1467ff2 MM |
1457 | } |
1458 | ||
03017874 | 1459 | if (templates == NULL_TREE && candidates == NULL_TREE) |
e1467ff2 | 1460 | { |
bf8f3f93 MM |
1461 | cp_error_at ("template-id `%D' for `%+D' does not match any template declaration", |
1462 | template_id, decl); | |
03017874 | 1463 | return error_mark_node; |
386b8a85 | 1464 | } |
03017874 | 1465 | else if ((templates && TREE_CHAIN (templates)) |
bf8f3f93 MM |
1466 | || (candidates && TREE_CHAIN (candidates)) |
1467 | || (templates && candidates)) | |
386b8a85 | 1468 | { |
bf8f3f93 MM |
1469 | cp_error_at ("ambiguous template specialization `%D' for `%+D'", |
1470 | template_id, decl); | |
1471 | chainon (candidates, templates); | |
1472 | print_candidates (candidates); | |
03017874 | 1473 | return error_mark_node; |
386b8a85 JM |
1474 | } |
1475 | ||
c6002625 | 1476 | /* We have one, and exactly one, match. */ |
03017874 MM |
1477 | if (candidates) |
1478 | { | |
1479 | /* It was a specialization of an ordinary member function in a | |
1480 | template class. */ | |
1481 | *targs_out = copy_node (DECL_TI_ARGS (TREE_VALUE (candidates))); | |
1482 | return DECL_TI_TEMPLATE (TREE_VALUE (candidates)); | |
1483 | } | |
1484 | ||
1485 | /* It was a specialization of a template. */ | |
17aec3eb | 1486 | targs = DECL_TI_ARGS (DECL_TEMPLATE_RESULT (TREE_VALUE (templates))); |
03017874 MM |
1487 | if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (targs)) |
1488 | { | |
1489 | *targs_out = copy_node (targs); | |
1490 | SET_TMPL_ARGS_LEVEL (*targs_out, | |
1491 | TMPL_ARGS_DEPTH (*targs_out), | |
1492 | TREE_PURPOSE (templates)); | |
1493 | } | |
1494 | else | |
1495 | *targs_out = TREE_PURPOSE (templates); | |
e1467ff2 | 1496 | return TREE_VALUE (templates); |
8d08fdba | 1497 | } |
8afa707f MM |
1498 | |
1499 | /* Returns a chain of parameter types, exactly like the SPEC_TYPES, | |
1500 | but with the default argument values filled in from those in the | |
1501 | TMPL_TYPES. */ | |
6757edfe | 1502 | |
8afa707f | 1503 | static tree |
3a978d72 NN |
1504 | copy_default_args_to_explicit_spec_1 (tree spec_types, |
1505 | tree tmpl_types) | |
8afa707f MM |
1506 | { |
1507 | tree new_spec_types; | |
1508 | ||
1509 | if (!spec_types) | |
1510 | return NULL_TREE; | |
1511 | ||
1512 | if (spec_types == void_list_node) | |
1513 | return void_list_node; | |
1514 | ||
1515 | /* Substitute into the rest of the list. */ | |
1516 | new_spec_types = | |
1517 | copy_default_args_to_explicit_spec_1 (TREE_CHAIN (spec_types), | |
1518 | TREE_CHAIN (tmpl_types)); | |
1519 | ||
1520 | /* Add the default argument for this parameter. */ | |
1521 | return hash_tree_cons (TREE_PURPOSE (tmpl_types), | |
1522 | TREE_VALUE (spec_types), | |
1523 | new_spec_types); | |
1524 | } | |
1525 | ||
1526 | /* DECL is an explicit specialization. Replicate default arguments | |
1527 | from the template it specializes. (That way, code like: | |
1528 | ||
1529 | template <class T> void f(T = 3); | |
1530 | template <> void f(double); | |
1531 | void g () { f (); } | |
1532 | ||
1533 | works, as required.) An alternative approach would be to look up | |
1534 | the correct default arguments at the call-site, but this approach | |
1535 | is consistent with how implicit instantiations are handled. */ | |
1536 | ||
1537 | static void | |
3a978d72 | 1538 | copy_default_args_to_explicit_spec (tree decl) |
8afa707f MM |
1539 | { |
1540 | tree tmpl; | |
1541 | tree spec_types; | |
1542 | tree tmpl_types; | |
1543 | tree new_spec_types; | |
1544 | tree old_type; | |
1545 | tree new_type; | |
1546 | tree t; | |
08c2df0f NS |
1547 | tree object_type = NULL_TREE; |
1548 | tree in_charge = NULL_TREE; | |
e0fff4b3 | 1549 | tree vtt = NULL_TREE; |
8afa707f MM |
1550 | |
1551 | /* See if there's anything we need to do. */ | |
1552 | tmpl = DECL_TI_TEMPLATE (decl); | |
1553 | tmpl_types = TYPE_ARG_TYPES (TREE_TYPE (DECL_TEMPLATE_RESULT (tmpl))); | |
1554 | for (t = tmpl_types; t; t = TREE_CHAIN (t)) | |
1555 | if (TREE_PURPOSE (t)) | |
1556 | break; | |
1557 | if (!t) | |
1558 | return; | |
1559 | ||
1560 | old_type = TREE_TYPE (decl); | |
1561 | spec_types = TYPE_ARG_TYPES (old_type); | |
1562 | ||
8afa707f MM |
1563 | if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl)) |
1564 | { | |
08c2df0f NS |
1565 | /* Remove the this pointer, but remember the object's type for |
1566 | CV quals. */ | |
1567 | object_type = TREE_TYPE (TREE_VALUE (spec_types)); | |
8afa707f MM |
1568 | spec_types = TREE_CHAIN (spec_types); |
1569 | tmpl_types = TREE_CHAIN (tmpl_types); | |
08c2df0f | 1570 | |
8afa707f | 1571 | if (DECL_HAS_IN_CHARGE_PARM_P (decl)) |
08c2df0f NS |
1572 | { |
1573 | /* DECL may contain more parameters than TMPL due to the extra | |
1574 | in-charge parameter in constructors and destructors. */ | |
1575 | in_charge = spec_types; | |
1576 | spec_types = TREE_CHAIN (spec_types); | |
1577 | } | |
e0fff4b3 JM |
1578 | if (DECL_HAS_VTT_PARM_P (decl)) |
1579 | { | |
1580 | vtt = spec_types; | |
1581 | spec_types = TREE_CHAIN (spec_types); | |
1582 | } | |
8afa707f MM |
1583 | } |
1584 | ||
1585 | /* Compute the merged default arguments. */ | |
1586 | new_spec_types = | |
1587 | copy_default_args_to_explicit_spec_1 (spec_types, tmpl_types); | |
1588 | ||
08c2df0f NS |
1589 | /* Compute the new FUNCTION_TYPE. */ |
1590 | if (object_type) | |
8afa707f | 1591 | { |
e0fff4b3 JM |
1592 | if (vtt) |
1593 | new_spec_types = hash_tree_cons (TREE_PURPOSE (vtt), | |
1594 | TREE_VALUE (vtt), | |
1595 | new_spec_types); | |
1596 | ||
08c2df0f NS |
1597 | if (in_charge) |
1598 | /* Put the in-charge parameter back. */ | |
1599 | new_spec_types = hash_tree_cons (TREE_PURPOSE (in_charge), | |
1600 | TREE_VALUE (in_charge), | |
1601 | new_spec_types); | |
1602 | ||
43dc123f MM |
1603 | new_type = build_method_type_directly (object_type, |
1604 | TREE_TYPE (old_type), | |
1605 | new_spec_types); | |
8afa707f | 1606 | } |
8afa707f MM |
1607 | else |
1608 | new_type = build_function_type (TREE_TYPE (old_type), | |
08c2df0f | 1609 | new_spec_types); |
e9525111 MM |
1610 | new_type = cp_build_type_attribute_variant (new_type, |
1611 | TYPE_ATTRIBUTES (old_type)); | |
8afa707f MM |
1612 | new_type = build_exception_variant (new_type, |
1613 | TYPE_RAISES_EXCEPTIONS (old_type)); | |
1614 | TREE_TYPE (decl) = new_type; | |
1615 | } | |
1616 | ||
386b8a85 | 1617 | /* Check to see if the function just declared, as indicated in |
75650646 MM |
1618 | DECLARATOR, and in DECL, is a specialization of a function |
1619 | template. We may also discover that the declaration is an explicit | |
1620 | instantiation at this point. | |
1621 | ||
e1467ff2 | 1622 | Returns DECL, or an equivalent declaration that should be used |
03017874 MM |
1623 | instead if all goes well. Issues an error message if something is |
1624 | amiss. Returns error_mark_node if the error is not easily | |
1625 | recoverable. | |
75650646 | 1626 | |
75650646 MM |
1627 | FLAGS is a bitmask consisting of the following flags: |
1628 | ||
75650646 MM |
1629 | 2: The function has a definition. |
1630 | 4: The function is a friend. | |
75650646 MM |
1631 | |
1632 | The TEMPLATE_COUNT is the number of references to qualifying | |
1633 | template classes that appeared in the name of the function. For | |
1634 | example, in | |
1635 | ||
1636 | template <class T> struct S { void f(); }; | |
1637 | void S<int>::f(); | |
1638 | ||
1639 | the TEMPLATE_COUNT would be 1. However, explicitly specialized | |
1640 | classes are not counted in the TEMPLATE_COUNT, so that in | |
1641 | ||
1642 | template <class T> struct S {}; | |
1643 | template <> struct S<int> { void f(); } | |
36a117a5 | 1644 | template <> void S<int>::f(); |
75650646 MM |
1645 | |
1646 | the TEMPLATE_COUNT would be 0. (Note that this declaration is | |
0e339752 | 1647 | invalid; there should be no template <>.) |
75650646 MM |
1648 | |
1649 | If the function is a specialization, it is marked as such via | |
1650 | DECL_TEMPLATE_SPECIALIZATION. Furthermore, its DECL_TEMPLATE_INFO | |
1651 | is set up correctly, and it is added to the list of specializations | |
1652 | for that template. */ | |
386b8a85 | 1653 | |
e1467ff2 | 1654 | tree |
3a978d72 NN |
1655 | check_explicit_specialization (tree declarator, |
1656 | tree decl, | |
1657 | int template_count, | |
1658 | int flags) | |
386b8a85 | 1659 | { |
75650646 MM |
1660 | int have_def = flags & 2; |
1661 | int is_friend = flags & 4; | |
1662 | int specialization = 0; | |
e1467ff2 | 1663 | int explicit_instantiation = 0; |
fd4de5ff | 1664 | int member_specialization = 0; |
75650646 MM |
1665 | tree ctype = DECL_CLASS_CONTEXT (decl); |
1666 | tree dname = DECL_NAME (decl); | |
74b846e0 | 1667 | tmpl_spec_kind tsk; |
386b8a85 | 1668 | |
74b846e0 | 1669 | tsk = current_tmpl_spec_kind (template_count); |
75650646 | 1670 | |
74b846e0 MM |
1671 | switch (tsk) |
1672 | { | |
1673 | case tsk_none: | |
1674 | if (processing_specialization) | |
75650646 | 1675 | { |
fd4de5ff MM |
1676 | specialization = 1; |
1677 | SET_DECL_TEMPLATE_SPECIALIZATION (decl); | |
75650646 | 1678 | } |
74b846e0 | 1679 | else if (TREE_CODE (declarator) == TEMPLATE_ID_EXPR) |
386b8a85 | 1680 | { |
74b846e0 MM |
1681 | if (is_friend) |
1682 | /* This could be something like: | |
75650646 | 1683 | |
74b846e0 MM |
1684 | template <class T> void f(T); |
1685 | class S { friend void f<>(int); } */ | |
1686 | specialization = 1; | |
1687 | else | |
1688 | { | |
1689 | /* This case handles bogus declarations like template <> | |
1690 | template <class T> void f<int>(); */ | |
1691 | ||
33bd39a2 | 1692 | error ("template-id `%D' in declaration of primary template", |
74b846e0 MM |
1693 | declarator); |
1694 | return decl; | |
1695 | } | |
1696 | } | |
1697 | break; | |
1698 | ||
1699 | case tsk_invalid_member_spec: | |
1700 | /* The error has already been reported in | |
1701 | check_specialization_scope. */ | |
1702 | return error_mark_node; | |
1703 | ||
1704 | case tsk_invalid_expl_inst: | |
33bd39a2 | 1705 | error ("template parameter list used in explicit instantiation"); |
74b846e0 MM |
1706 | |
1707 | /* Fall through. */ | |
1708 | ||
1709 | case tsk_expl_inst: | |
fd4de5ff | 1710 | if (have_def) |
33bd39a2 | 1711 | error ("definition provided for explicit instantiation"); |
74b846e0 | 1712 | |
fd4de5ff | 1713 | explicit_instantiation = 1; |
74b846e0 | 1714 | break; |
fd4de5ff | 1715 | |
74b846e0 | 1716 | case tsk_excessive_parms: |
f03adc6b GB |
1717 | case tsk_insufficient_parms: |
1718 | if (tsk == tsk_excessive_parms) | |
1719 | error ("too many template parameter lists in declaration of `%D'", | |
1720 | decl); | |
1721 | else if (template_header_count) | |
1722 | error("too few template parameter lists in declaration of `%D'", | |
1723 | decl); | |
1724 | else | |
616adc47 KC |
1725 | error("explicit specialization of `%D' must be introduced by " |
1726 | "`template <>'", decl); | |
75650646 | 1727 | |
74b846e0 MM |
1728 | /* Fall through. */ |
1729 | case tsk_expl_spec: | |
1730 | SET_DECL_TEMPLATE_SPECIALIZATION (decl); | |
1731 | if (ctype) | |
1732 | member_specialization = 1; | |
1733 | else | |
1734 | specialization = 1; | |
1735 | break; | |
74b846e0 MM |
1736 | |
1737 | case tsk_template: | |
1738 | if (TREE_CODE (declarator) == TEMPLATE_ID_EXPR) | |
c6f2ed0d | 1739 | { |
fd4de5ff MM |
1740 | /* This case handles bogus declarations like template <> |
1741 | template <class T> void f<int>(); */ | |
75650646 | 1742 | |
655dc6ee | 1743 | if (uses_template_parms (declarator)) |
e1e93ad8 GB |
1744 | error ("function template partial specialization `%D' " |
1745 | "is not allowed", declarator); | |
655dc6ee | 1746 | else |
33bd39a2 | 1747 | error ("template-id `%D' in declaration of primary template", |
655dc6ee | 1748 | declarator); |
fd4de5ff | 1749 | return decl; |
386b8a85 | 1750 | } |
74b846e0 MM |
1751 | |
1752 | if (ctype && CLASSTYPE_TEMPLATE_INSTANTIATION (ctype)) | |
1753 | /* This is a specialization of a member template, without | |
1754 | specialization the containing class. Something like: | |
1755 | ||
1756 | template <class T> struct S { | |
1757 | template <class U> void f (U); | |
1758 | }; | |
1759 | template <> template <class U> void S<int>::f(U) {} | |
1760 | ||
1761 | That's a specialization -- but of the entire template. */ | |
1762 | specialization = 1; | |
1763 | break; | |
1764 | ||
1765 | default: | |
a98facb0 | 1766 | abort (); |
75650646 | 1767 | } |
386b8a85 | 1768 | |
670960ac JM |
1769 | if (specialization || member_specialization) |
1770 | { | |
1771 | tree t = TYPE_ARG_TYPES (TREE_TYPE (decl)); | |
1772 | for (; t; t = TREE_CHAIN (t)) | |
1773 | if (TREE_PURPOSE (t)) | |
1774 | { | |
33bd39a2 | 1775 | pedwarn |
8251199e | 1776 | ("default argument specified in explicit specialization"); |
670960ac JM |
1777 | break; |
1778 | } | |
f3400fe2 | 1779 | if (current_lang_name == lang_name_c) |
33bd39a2 | 1780 | error ("template specialization with C linkage"); |
670960ac JM |
1781 | } |
1782 | ||
e1467ff2 | 1783 | if (specialization || member_specialization || explicit_instantiation) |
75650646 MM |
1784 | { |
1785 | tree tmpl = NULL_TREE; | |
1786 | tree targs = NULL_TREE; | |
75650646 MM |
1787 | |
1788 | /* Make sure that the declarator is a TEMPLATE_ID_EXPR. */ | |
386b8a85 JM |
1789 | if (TREE_CODE (declarator) != TEMPLATE_ID_EXPR) |
1790 | { | |
1791 | tree fns; | |
1792 | ||
2f54a1db GB |
1793 | my_friendly_assert (TREE_CODE (declarator) == IDENTIFIER_NODE, 0); |
1794 | if (ctype) | |
386b8a85 | 1795 | fns = dname; |
2f54a1db GB |
1796 | else |
1797 | { | |
1798 | /* If there is no class context, the explicit instantiation | |
1799 | must be at namespace scope. */ | |
1800 | my_friendly_assert (DECL_NAMESPACE_SCOPE_P (decl), 20030625); | |
1801 | ||
1802 | /* Find the namespace binding, using the declaration | |
1803 | context. */ | |
1804 | fns = namespace_binding (dname, CP_DECL_CONTEXT (decl)); | |
1805 | } | |
386b8a85 | 1806 | |
2f54a1db | 1807 | declarator = lookup_template_function (fns, NULL_TREE); |
386b8a85 JM |
1808 | } |
1809 | ||
f2e48b67 BK |
1810 | if (declarator == error_mark_node) |
1811 | return error_mark_node; | |
1812 | ||
75650646 MM |
1813 | if (ctype != NULL_TREE && TYPE_BEING_DEFINED (ctype)) |
1814 | { | |
8ec2ac34 | 1815 | if (!explicit_instantiation) |
0e339752 | 1816 | /* A specialization in class scope. This is invalid, |
6c30752f MM |
1817 | but the error will already have been flagged by |
1818 | check_specialization_scope. */ | |
1819 | return error_mark_node; | |
8ec2ac34 | 1820 | else |
b370501f | 1821 | { |
0e339752 | 1822 | /* It's not valid to write an explicit instantiation in |
b370501f | 1823 | class scope, e.g.: |
8ec2ac34 | 1824 | |
b370501f | 1825 | class C { template void f(); } |
8ec2ac34 | 1826 | |
b370501f KG |
1827 | This case is caught by the parser. However, on |
1828 | something like: | |
8ec2ac34 | 1829 | |
b370501f | 1830 | template class C { void f(); }; |
8ec2ac34 | 1831 | |
0e339752 | 1832 | (which is invalid) we can get here. The error will be |
b370501f KG |
1833 | issued later. */ |
1834 | ; | |
1835 | } | |
8ec2ac34 | 1836 | |
e1467ff2 | 1837 | return decl; |
75650646 MM |
1838 | } |
1839 | else if (ctype != NULL_TREE | |
1840 | && (TREE_CODE (TREE_OPERAND (declarator, 0)) == | |
1841 | IDENTIFIER_NODE)) | |
386b8a85 | 1842 | { |
75650646 MM |
1843 | /* Find the list of functions in ctype that have the same |
1844 | name as the declared function. */ | |
1845 | tree name = TREE_OPERAND (declarator, 0); | |
03017874 MM |
1846 | tree fns = NULL_TREE; |
1847 | int idx; | |
1848 | ||
8ba658ee | 1849 | if (constructor_name_p (name, ctype)) |
386b8a85 | 1850 | { |
75650646 MM |
1851 | int is_constructor = DECL_CONSTRUCTOR_P (decl); |
1852 | ||
1853 | if (is_constructor ? !TYPE_HAS_CONSTRUCTOR (ctype) | |
1854 | : !TYPE_HAS_DESTRUCTOR (ctype)) | |
1855 | { | |
1856 | /* From [temp.expl.spec]: | |
e1467ff2 | 1857 | |
75650646 MM |
1858 | If such an explicit specialization for the member |
1859 | of a class template names an implicitly-declared | |
1860 | special member function (clause _special_), the | |
e1467ff2 MM |
1861 | program is ill-formed. |
1862 | ||
1863 | Similar language is found in [temp.explicit]. */ | |
33bd39a2 | 1864 | error ("specialization of implicitly-declared special member function"); |
03017874 | 1865 | return error_mark_node; |
75650646 | 1866 | } |
386b8a85 | 1867 | |
42da2fd8 | 1868 | name = is_constructor ? ctor_identifier : dtor_identifier; |
75650646 | 1869 | } |
42da2fd8 | 1870 | |
421844e7 | 1871 | if (!DECL_CONV_FN_P (decl)) |
03017874 MM |
1872 | { |
1873 | idx = lookup_fnfields_1 (ctype, name); | |
1874 | if (idx >= 0) | |
aaaa46d2 | 1875 | fns = VEC_index (tree, CLASSTYPE_METHOD_VEC (ctype), idx); |
03017874 MM |
1876 | } |
1877 | else | |
1878 | { | |
aaaa46d2 MM |
1879 | VEC(tree) *methods; |
1880 | tree ovl; | |
03017874 MM |
1881 | |
1882 | /* For a type-conversion operator, we cannot do a | |
1883 | name-based lookup. We might be looking for `operator | |
1884 | int' which will be a specialization of `operator T'. | |
1885 | So, we find *all* the conversion operators, and then | |
1886 | select from them. */ | |
1887 | fns = NULL_TREE; | |
1888 | ||
1889 | methods = CLASSTYPE_METHOD_VEC (ctype); | |
1890 | if (methods) | |
5dd236e2 | 1891 | for (idx = CLASSTYPE_FIRST_CONVERSION_SLOT; |
9ba5ff0f | 1892 | VEC_iterate (tree, methods, idx, ovl); |
aaaa46d2 | 1893 | ++idx) |
03017874 | 1894 | { |
aaaa46d2 | 1895 | if (!DECL_CONV_FN_P (OVL_CURRENT (ovl))) |
03017874 MM |
1896 | /* There are no more conversion functions. */ |
1897 | break; | |
1898 | ||
1899 | /* Glue all these conversion functions together | |
1900 | with those we already have. */ | |
1901 | for (; ovl; ovl = OVL_NEXT (ovl)) | |
1902 | fns = ovl_cons (OVL_CURRENT (ovl), fns); | |
1903 | } | |
1904 | } | |
1905 | ||
386b8a85 JM |
1906 | if (fns == NULL_TREE) |
1907 | { | |
33bd39a2 | 1908 | error ("no member function `%D' declared in `%T'", |
b3f738da | 1909 | name, ctype); |
03017874 | 1910 | return error_mark_node; |
386b8a85 JM |
1911 | } |
1912 | else | |
1913 | TREE_OPERAND (declarator, 0) = fns; | |
1914 | } | |
75650646 | 1915 | |
e1467ff2 MM |
1916 | /* Figure out what exactly is being specialized at this point. |
1917 | Note that for an explicit instantiation, even one for a | |
38e01259 | 1918 | member function, we cannot tell apriori whether the |
e1467ff2 | 1919 | instantiation is for a member template, or just a member |
36a117a5 MM |
1920 | function of a template class. Even if a member template is |
1921 | being instantiated, the member template arguments may be | |
1922 | elided if they can be deduced from the rest of the | |
1923 | declaration. */ | |
e1467ff2 MM |
1924 | tmpl = determine_specialization (declarator, decl, |
1925 | &targs, | |
5fe7b654 GB |
1926 | member_specialization, |
1927 | template_count); | |
386b8a85 | 1928 | |
03017874 MM |
1929 | if (!tmpl || tmpl == error_mark_node) |
1930 | /* We couldn't figure out what this declaration was | |
1931 | specializing. */ | |
1932 | return error_mark_node; | |
1933 | else | |
386b8a85 | 1934 | { |
25aab5d0 | 1935 | tree gen_tmpl = most_general_template (tmpl); |
36a117a5 | 1936 | |
e1467ff2 MM |
1937 | if (explicit_instantiation) |
1938 | { | |
03d0f4af | 1939 | /* We don't set DECL_EXPLICIT_INSTANTIATION here; that |
25aab5d0 MM |
1940 | is done by do_decl_instantiation later. */ |
1941 | ||
1942 | int arg_depth = TMPL_ARGS_DEPTH (targs); | |
1943 | int parm_depth = TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl)); | |
1944 | ||
1945 | if (arg_depth > parm_depth) | |
1946 | { | |
1947 | /* If TMPL is not the most general template (for | |
1948 | example, if TMPL is a friend template that is | |
1949 | injected into namespace scope), then there will | |
dc957d14 | 1950 | be too many levels of TARGS. Remove some of them |
25aab5d0 MM |
1951 | here. */ |
1952 | int i; | |
1953 | tree new_targs; | |
1954 | ||
f31c0a32 | 1955 | new_targs = make_tree_vec (parm_depth); |
25aab5d0 MM |
1956 | for (i = arg_depth - parm_depth; i < arg_depth; ++i) |
1957 | TREE_VEC_ELT (new_targs, i - (arg_depth - parm_depth)) | |
1958 | = TREE_VEC_ELT (targs, i); | |
1959 | targs = new_targs; | |
1960 | } | |
1961 | ||
3e4a3562 | 1962 | return instantiate_template (tmpl, targs, tf_error); |
e1467ff2 | 1963 | } |
74b846e0 | 1964 | |
6c07f448 KL |
1965 | /* If we thought that the DECL was a member function, but it |
1966 | turns out to be specializing a static member function, | |
4546865e | 1967 | make DECL a static member function as well. */ |
6c07f448 KL |
1968 | if (DECL_STATIC_FUNCTION_P (tmpl) |
1969 | && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl)) | |
4546865e | 1970 | revert_static_member_fn (decl); |
6c07f448 | 1971 | |
f9a7ae04 MM |
1972 | /* If this is a specialization of a member template of a |
1973 | template class. In we want to return the TEMPLATE_DECL, | |
1974 | not the specialization of it. */ | |
74b846e0 MM |
1975 | if (tsk == tsk_template) |
1976 | { | |
1977 | SET_DECL_TEMPLATE_SPECIALIZATION (tmpl); | |
f9a7ae04 | 1978 | DECL_INITIAL (DECL_TEMPLATE_RESULT (tmpl)) = NULL_TREE; |
b190f239 NS |
1979 | if (have_def) |
1980 | { | |
f31686a3 RH |
1981 | DECL_SOURCE_LOCATION (tmpl) = DECL_SOURCE_LOCATION (decl); |
1982 | DECL_SOURCE_LOCATION (DECL_TEMPLATE_RESULT (tmpl)) | |
1983 | = DECL_SOURCE_LOCATION (decl); | |
b190f239 | 1984 | } |
74b846e0 MM |
1985 | return tmpl; |
1986 | } | |
1987 | ||
36a117a5 | 1988 | /* Set up the DECL_TEMPLATE_INFO for DECL. */ |
e1b3e07d | 1989 | DECL_TEMPLATE_INFO (decl) = tree_cons (tmpl, targs, NULL_TREE); |
36a117a5 | 1990 | |
8afa707f MM |
1991 | /* Inherit default function arguments from the template |
1992 | DECL is specializing. */ | |
1993 | copy_default_args_to_explicit_spec (decl); | |
1994 | ||
c750255c MM |
1995 | /* This specialization has the same protection as the |
1996 | template it specializes. */ | |
1997 | TREE_PRIVATE (decl) = TREE_PRIVATE (gen_tmpl); | |
1998 | TREE_PROTECTED (decl) = TREE_PROTECTED (gen_tmpl); | |
1999 | ||
386b8a85 | 2000 | if (is_friend && !have_def) |
36a117a5 MM |
2001 | /* This is not really a declaration of a specialization. |
2002 | It's just the name of an instantiation. But, it's not | |
2003 | a request for an instantiation, either. */ | |
fbf1c34b | 2004 | SET_DECL_IMPLICIT_INSTANTIATION (decl); |
08511114 KL |
2005 | else if (DECL_CONSTRUCTOR_P (decl) || DECL_DESTRUCTOR_P (decl)) |
2006 | /* This is indeed a specialization. In case of constructors | |
2007 | and destructors, we need in-charge and not-in-charge | |
2008 | versions in V3 ABI. */ | |
2009 | clone_function_decl (decl, /*update_method_vec_p=*/0); | |
75650646 | 2010 | |
36a117a5 MM |
2011 | /* Register this specialization so that we can find it |
2012 | again. */ | |
2013 | decl = register_specialization (decl, gen_tmpl, targs); | |
386b8a85 JM |
2014 | } |
2015 | } | |
75650646 | 2016 | |
e1467ff2 | 2017 | return decl; |
386b8a85 | 2018 | } |
75650646 | 2019 | |
39c01e4c MM |
2020 | /* TYPE is being declared. Verify that the use of template headers |
2021 | and such is reasonable. Issue error messages if not. */ | |
2022 | ||
2023 | void | |
3a978d72 | 2024 | maybe_check_template_type (tree type) |
39c01e4c MM |
2025 | { |
2026 | if (template_header_count) | |
2027 | { | |
2028 | /* We are in the scope of some `template <...>' header. */ | |
2029 | ||
2030 | int context_depth | |
2031 | = template_class_depth_real (TYPE_CONTEXT (type), | |
2032 | /*count_specializations=*/1); | |
2033 | ||
2034 | if (template_header_count <= context_depth) | |
2035 | /* This is OK; the template headers are for the context. We | |
2036 | are actually too lenient here; like | |
2037 | check_explicit_specialization we should consider the number | |
2038 | of template types included in the actual declaration. For | |
2039 | example, | |
2040 | ||
2041 | template <class T> struct S { | |
2042 | template <class U> template <class V> | |
2043 | struct I {}; | |
2044 | }; | |
2045 | ||
0e339752 | 2046 | is invalid, but: |
39c01e4c MM |
2047 | |
2048 | template <class T> struct S { | |
2049 | template <class U> struct I; | |
2050 | }; | |
2051 | ||
2052 | template <class T> template <class U. | |
2053 | struct S<T>::I {}; | |
2054 | ||
2055 | is not. */ | |
2056 | ; | |
2057 | else if (template_header_count > context_depth + 1) | |
2058 | /* There are two many template parameter lists. */ | |
33bd39a2 | 2059 | error ("too many template parameter lists in declaration of `%T'", type); |
39c01e4c MM |
2060 | } |
2061 | } | |
2062 | ||
75650646 MM |
2063 | /* Returns 1 iff PARMS1 and PARMS2 are identical sets of template |
2064 | parameters. These are represented in the same format used for | |
2065 | DECL_TEMPLATE_PARMS. */ | |
2066 | ||
3a978d72 | 2067 | int comp_template_parms (tree parms1, tree parms2) |
75650646 MM |
2068 | { |
2069 | tree p1; | |
2070 | tree p2; | |
2071 | ||
2072 | if (parms1 == parms2) | |
2073 | return 1; | |
2074 | ||
2075 | for (p1 = parms1, p2 = parms2; | |
2076 | p1 != NULL_TREE && p2 != NULL_TREE; | |
2077 | p1 = TREE_CHAIN (p1), p2 = TREE_CHAIN (p2)) | |
2078 | { | |
2079 | tree t1 = TREE_VALUE (p1); | |
2080 | tree t2 = TREE_VALUE (p2); | |
2081 | int i; | |
2082 | ||
2083 | my_friendly_assert (TREE_CODE (t1) == TREE_VEC, 0); | |
2084 | my_friendly_assert (TREE_CODE (t2) == TREE_VEC, 0); | |
2085 | ||
2086 | if (TREE_VEC_LENGTH (t1) != TREE_VEC_LENGTH (t2)) | |
2087 | return 0; | |
2088 | ||
2089 | for (i = 0; i < TREE_VEC_LENGTH (t2); ++i) | |
2090 | { | |
2091 | tree parm1 = TREE_VALUE (TREE_VEC_ELT (t1, i)); | |
2092 | tree parm2 = TREE_VALUE (TREE_VEC_ELT (t2, i)); | |
2093 | ||
2094 | if (TREE_CODE (parm1) != TREE_CODE (parm2)) | |
2095 | return 0; | |
2096 | ||
2097 | if (TREE_CODE (parm1) == TEMPLATE_TYPE_PARM) | |
2098 | continue; | |
3bfdc719 | 2099 | else if (!same_type_p (TREE_TYPE (parm1), TREE_TYPE (parm2))) |
75650646 MM |
2100 | return 0; |
2101 | } | |
2102 | } | |
2103 | ||
2104 | if ((p1 != NULL_TREE) != (p2 != NULL_TREE)) | |
2105 | /* One set of parameters has more parameters lists than the | |
2106 | other. */ | |
2107 | return 0; | |
2108 | ||
2109 | return 1; | |
2110 | } | |
2111 | ||
f3400fe2 JM |
2112 | /* Complain if DECL shadows a template parameter. |
2113 | ||
2114 | [temp.local]: A template-parameter shall not be redeclared within its | |
2115 | scope (including nested scopes). */ | |
2116 | ||
2117 | void | |
3a978d72 | 2118 | check_template_shadow (tree decl) |
f3400fe2 | 2119 | { |
8f032717 MM |
2120 | tree olddecl; |
2121 | ||
b5d9b9ab MM |
2122 | /* If we're not in a template, we can't possibly shadow a template |
2123 | parameter. */ | |
2124 | if (!current_template_parms) | |
2125 | return; | |
2126 | ||
2127 | /* Figure out what we're shadowing. */ | |
8f032717 MM |
2128 | if (TREE_CODE (decl) == OVERLOAD) |
2129 | decl = OVL_CURRENT (decl); | |
90ea9897 | 2130 | olddecl = innermost_non_namespace_value (DECL_NAME (decl)); |
f3400fe2 | 2131 | |
b5d9b9ab MM |
2132 | /* If there's no previous binding for this name, we're not shadowing |
2133 | anything, let alone a template parameter. */ | |
2134 | if (!olddecl) | |
2135 | return; | |
2136 | ||
2137 | /* If we're not shadowing a template parameter, we're done. Note | |
2138 | that OLDDECL might be an OVERLOAD (or perhaps even an | |
2139 | ERROR_MARK), so we can't just blithely assume it to be a _DECL | |
2140 | node. */ | |
2f939d94 | 2141 | if (!DECL_P (olddecl) || !DECL_TEMPLATE_PARM_P (olddecl)) |
b5d9b9ab MM |
2142 | return; |
2143 | ||
2144 | /* We check for decl != olddecl to avoid bogus errors for using a | |
2145 | name inside a class. We check TPFI to avoid duplicate errors for | |
2146 | inline member templates. */ | |
2147 | if (decl == olddecl | |
2148 | || TEMPLATE_PARMS_FOR_INLINE (current_template_parms)) | |
2149 | return; | |
2150 | ||
2151 | cp_error_at ("declaration of `%#D'", decl); | |
2152 | cp_error_at (" shadows template parm `%#D'", olddecl); | |
f3400fe2 | 2153 | } |
22a7be53 | 2154 | |
f3400fe2 | 2155 | /* Return a new TEMPLATE_PARM_INDEX with the indicated INDEX, LEVEL, |
f84b4be9 JM |
2156 | ORIG_LEVEL, DECL, and TYPE. */ |
2157 | ||
2158 | static tree | |
3a978d72 NN |
2159 | build_template_parm_index (int index, |
2160 | int level, | |
2161 | int orig_level, | |
2162 | tree decl, | |
2163 | tree type) | |
f84b4be9 JM |
2164 | { |
2165 | tree t = make_node (TEMPLATE_PARM_INDEX); | |
2166 | TEMPLATE_PARM_IDX (t) = index; | |
2167 | TEMPLATE_PARM_LEVEL (t) = level; | |
2168 | TEMPLATE_PARM_ORIG_LEVEL (t) = orig_level; | |
2169 | TEMPLATE_PARM_DECL (t) = decl; | |
2170 | TREE_TYPE (t) = type; | |
3e4a3562 | 2171 | TREE_CONSTANT (t) = TREE_CONSTANT (decl); |
6de9cd9a | 2172 | TREE_INVARIANT (t) = TREE_INVARIANT (decl); |
3e4a3562 | 2173 | TREE_READONLY (t) = TREE_READONLY (decl); |
f84b4be9 JM |
2174 | |
2175 | return t; | |
2176 | } | |
2177 | ||
f84b4be9 | 2178 | /* Return a TEMPLATE_PARM_INDEX, similar to INDEX, but whose |
93cdc044 | 2179 | TEMPLATE_PARM_LEVEL has been decreased by LEVELS. If such a |
f84b4be9 JM |
2180 | TEMPLATE_PARM_INDEX already exists, it is returned; otherwise, a |
2181 | new one is created. */ | |
2182 | ||
2183 | static tree | |
3a978d72 | 2184 | reduce_template_parm_level (tree index, tree type, int levels) |
f84b4be9 JM |
2185 | { |
2186 | if (TEMPLATE_PARM_DESCENDANTS (index) == NULL_TREE | |
2187 | || (TEMPLATE_PARM_LEVEL (TEMPLATE_PARM_DESCENDANTS (index)) | |
93cdc044 | 2188 | != TEMPLATE_PARM_LEVEL (index) - levels)) |
f84b4be9 | 2189 | { |
3e4a3562 NS |
2190 | tree orig_decl = TEMPLATE_PARM_DECL (index); |
2191 | tree decl, t; | |
2192 | ||
2193 | decl = build_decl (TREE_CODE (orig_decl), DECL_NAME (orig_decl), type); | |
2194 | TREE_CONSTANT (decl) = TREE_CONSTANT (orig_decl); | |
6de9cd9a | 2195 | TREE_INVARIANT (decl) = TREE_INVARIANT (orig_decl); |
3e4a3562 NS |
2196 | TREE_READONLY (decl) = TREE_READONLY (orig_decl); |
2197 | DECL_ARTIFICIAL (decl) = 1; | |
2198 | SET_DECL_TEMPLATE_PARM_P (decl); | |
2199 | ||
2200 | t = build_template_parm_index (TEMPLATE_PARM_IDX (index), | |
93cdc044 | 2201 | TEMPLATE_PARM_LEVEL (index) - levels, |
f84b4be9 JM |
2202 | TEMPLATE_PARM_ORIG_LEVEL (index), |
2203 | decl, type); | |
2204 | TEMPLATE_PARM_DESCENDANTS (index) = t; | |
cae40af6 JM |
2205 | |
2206 | /* Template template parameters need this. */ | |
2207 | DECL_TEMPLATE_PARMS (decl) | |
2208 | = DECL_TEMPLATE_PARMS (TEMPLATE_PARM_DECL (index)); | |
f84b4be9 JM |
2209 | } |
2210 | ||
2211 | return TEMPLATE_PARM_DESCENDANTS (index); | |
2212 | } | |
2213 | ||
8d08fdba | 2214 | /* Process information from new template parameter NEXT and append it to the |
058b15c1 MM |
2215 | LIST being built. This new parameter is a non-type parameter iff |
2216 | IS_NON_TYPE is true. */ | |
e92cc029 | 2217 | |
8d08fdba | 2218 | tree |
058b15c1 | 2219 | process_template_parm (tree list, tree next, bool is_non_type) |
8d08fdba MS |
2220 | { |
2221 | tree parm; | |
2222 | tree decl = 0; | |
a292b002 | 2223 | tree defval; |
058b15c1 | 2224 | int idx; |
f84b4be9 | 2225 | |
8d08fdba MS |
2226 | parm = next; |
2227 | my_friendly_assert (TREE_CODE (parm) == TREE_LIST, 259); | |
a292b002 | 2228 | defval = TREE_PURPOSE (parm); |
5566b478 MS |
2229 | |
2230 | if (list) | |
2231 | { | |
2232 | tree p = TREE_VALUE (tree_last (list)); | |
2233 | ||
1899c3a4 | 2234 | if (TREE_CODE (p) == TYPE_DECL || TREE_CODE (p) == TEMPLATE_DECL) |
5566b478 MS |
2235 | idx = TEMPLATE_TYPE_IDX (TREE_TYPE (p)); |
2236 | else | |
f84b4be9 | 2237 | idx = TEMPLATE_PARM_IDX (DECL_INITIAL (p)); |
5566b478 MS |
2238 | ++idx; |
2239 | } | |
2240 | else | |
2241 | idx = 0; | |
2242 | ||
058b15c1 | 2243 | if (is_non_type) |
8d08fdba | 2244 | { |
058b15c1 MM |
2245 | parm = TREE_VALUE (parm); |
2246 | ||
833aa4c4 | 2247 | SET_DECL_TEMPLATE_PARM_P (parm); |
d490621d MM |
2248 | |
2249 | /* [temp.param] | |
2250 | ||
2251 | The top-level cv-qualifiers on the template-parameter are | |
2252 | ignored when determining its type. */ | |
2253 | TREE_TYPE (parm) = TYPE_MAIN_VARIANT (TREE_TYPE (parm)); | |
2254 | ||
8d08fdba | 2255 | /* A template parameter is not modifiable. */ |
6de9cd9a DN |
2256 | TREE_CONSTANT (parm) = 1; |
2257 | TREE_INVARIANT (parm) = 1; | |
2258 | TREE_READONLY (parm) = 1; | |
11b810f1 | 2259 | if (invalid_nontype_parm_type_p (TREE_TYPE (parm), 1)) |
db3f4e4e | 2260 | TREE_TYPE (parm) = void_type_node; |
8d08fdba | 2261 | decl = build_decl (CONST_DECL, DECL_NAME (parm), TREE_TYPE (parm)); |
6de9cd9a DN |
2262 | TREE_CONSTANT (decl) = 1; |
2263 | TREE_INVARIANT (decl) = 1; | |
2264 | TREE_READONLY (decl) = 1; | |
f84b4be9 JM |
2265 | DECL_INITIAL (parm) = DECL_INITIAL (decl) |
2266 | = build_template_parm_index (idx, processing_template_decl, | |
2267 | processing_template_decl, | |
2268 | decl, TREE_TYPE (parm)); | |
8d08fdba MS |
2269 | } |
2270 | else | |
2271 | { | |
73b0fce8 | 2272 | tree t; |
058b15c1 | 2273 | parm = TREE_VALUE (TREE_VALUE (parm)); |
73b0fce8 KL |
2274 | |
2275 | if (parm && TREE_CODE (parm) == TEMPLATE_DECL) | |
2276 | { | |
33848bb0 | 2277 | t = make_aggr_type (TEMPLATE_TEMPLATE_PARM); |
73b0fce8 KL |
2278 | /* This is for distinguishing between real templates and template |
2279 | template parameters */ | |
2280 | TREE_TYPE (parm) = t; | |
2281 | TREE_TYPE (DECL_TEMPLATE_RESULT (parm)) = t; | |
2282 | decl = parm; | |
2283 | } | |
2284 | else | |
2285 | { | |
33848bb0 | 2286 | t = make_aggr_type (TEMPLATE_TYPE_PARM); |
f4f206f4 | 2287 | /* parm is either IDENTIFIER_NODE or NULL_TREE. */ |
73b0fce8 KL |
2288 | decl = build_decl (TYPE_DECL, parm, t); |
2289 | } | |
2290 | ||
d2e5ee5c MS |
2291 | TYPE_NAME (t) = decl; |
2292 | TYPE_STUB_DECL (t) = decl; | |
a292b002 | 2293 | parm = decl; |
f84b4be9 JM |
2294 | TEMPLATE_TYPE_PARM_INDEX (t) |
2295 | = build_template_parm_index (idx, processing_template_decl, | |
2296 | processing_template_decl, | |
2297 | decl, TREE_TYPE (parm)); | |
8d08fdba | 2298 | } |
c727aa5e | 2299 | DECL_ARTIFICIAL (decl) = 1; |
cd9f6678 | 2300 | SET_DECL_TEMPLATE_PARM_P (decl); |
8d08fdba | 2301 | pushdecl (decl); |
a292b002 | 2302 | parm = build_tree_list (defval, parm); |
8d08fdba MS |
2303 | return chainon (list, parm); |
2304 | } | |
2305 | ||
2306 | /* The end of a template parameter list has been reached. Process the | |
2307 | tree list into a parameter vector, converting each parameter into a more | |
2308 | useful form. Type parameters are saved as IDENTIFIER_NODEs, and others | |
2309 | as PARM_DECLs. */ | |
2310 | ||
2311 | tree | |
3a978d72 | 2312 | end_template_parm_list (tree parms) |
8d08fdba | 2313 | { |
5566b478 | 2314 | int nparms; |
9471d3e2 | 2315 | tree parm, next; |
5566b478 MS |
2316 | tree saved_parmlist = make_tree_vec (list_length (parms)); |
2317 | ||
5566b478 | 2318 | current_template_parms |
4890c2f4 | 2319 | = tree_cons (size_int (processing_template_decl), |
5566b478 | 2320 | saved_parmlist, current_template_parms); |
8d08fdba | 2321 | |
9471d3e2 NS |
2322 | for (parm = parms, nparms = 0; parm; parm = next, nparms++) |
2323 | { | |
2324 | next = TREE_CHAIN (parm); | |
2325 | TREE_VEC_ELT (saved_parmlist, nparms) = parm; | |
2326 | TREE_CHAIN (parm) = NULL_TREE; | |
2327 | } | |
a292b002 | 2328 | |
67ffc812 MM |
2329 | --processing_template_parmlist; |
2330 | ||
8d08fdba MS |
2331 | return saved_parmlist; |
2332 | } | |
2333 | ||
5566b478 MS |
2334 | /* end_template_decl is called after a template declaration is seen. */ |
2335 | ||
8d08fdba | 2336 | void |
3a978d72 | 2337 | end_template_decl (void) |
8d08fdba | 2338 | { |
386b8a85 JM |
2339 | reset_specialization (); |
2340 | ||
5156628f | 2341 | if (! processing_template_decl) |
73aad9b9 JM |
2342 | return; |
2343 | ||
5566b478 | 2344 | /* This matches the pushlevel in begin_template_parm_list. */ |
74b846e0 | 2345 | finish_scope (); |
8d08fdba | 2346 | |
5566b478 MS |
2347 | --processing_template_decl; |
2348 | current_template_parms = TREE_CHAIN (current_template_parms); | |
5566b478 | 2349 | } |
8d08fdba | 2350 | |
36a117a5 MM |
2351 | /* Given a template argument vector containing the template PARMS. |
2352 | The innermost PARMS are given first. */ | |
9a3b49ac MS |
2353 | |
2354 | tree | |
3a978d72 | 2355 | current_template_args (void) |
5566b478 | 2356 | { |
36a117a5 | 2357 | tree header; |
b370501f | 2358 | tree args = NULL_TREE; |
36a117a5 | 2359 | int length = TMPL_PARMS_DEPTH (current_template_parms); |
98c1c668 JM |
2360 | int l = length; |
2361 | ||
36a117a5 MM |
2362 | /* If there is only one level of template parameters, we do not |
2363 | create a TREE_VEC of TREE_VECs. Instead, we return a single | |
2364 | TREE_VEC containing the arguments. */ | |
2365 | if (length > 1) | |
2366 | args = make_tree_vec (length); | |
2367 | ||
2368 | for (header = current_template_parms; header; header = TREE_CHAIN (header)) | |
8d08fdba | 2369 | { |
5566b478 | 2370 | tree a = copy_node (TREE_VALUE (header)); |
36a117a5 MM |
2371 | int i; |
2372 | ||
5566b478 | 2373 | TREE_TYPE (a) = NULL_TREE; |
36a117a5 | 2374 | for (i = TREE_VEC_LENGTH (a) - 1; i >= 0; --i) |
5566b478 | 2375 | { |
98c1c668 JM |
2376 | tree t = TREE_VEC_ELT (a, i); |
2377 | ||
36a117a5 | 2378 | /* T will be a list if we are called from within a |
98c1c668 JM |
2379 | begin/end_template_parm_list pair, but a vector directly |
2380 | if within a begin/end_member_template_processing pair. */ | |
2381 | if (TREE_CODE (t) == TREE_LIST) | |
2382 | { | |
2383 | t = TREE_VALUE (t); | |
2384 | ||
73b0fce8 KL |
2385 | if (TREE_CODE (t) == TYPE_DECL |
2386 | || TREE_CODE (t) == TEMPLATE_DECL) | |
98c1c668 JM |
2387 | t = TREE_TYPE (t); |
2388 | else | |
2389 | t = DECL_INITIAL (t); | |
36a117a5 | 2390 | TREE_VEC_ELT (a, i) = t; |
98c1c668 | 2391 | } |
5566b478 | 2392 | } |
36a117a5 MM |
2393 | |
2394 | if (length > 1) | |
2395 | TREE_VEC_ELT (args, --l) = a; | |
2396 | else | |
2397 | args = a; | |
8d08fdba MS |
2398 | } |
2399 | ||
9a3b49ac MS |
2400 | return args; |
2401 | } | |
75650646 | 2402 | |
e1467ff2 MM |
2403 | /* Return a TEMPLATE_DECL corresponding to DECL, using the indicated |
2404 | template PARMS. Used by push_template_decl below. */ | |
2405 | ||
75650646 | 2406 | static tree |
3a978d72 | 2407 | build_template_decl (tree decl, tree parms) |
75650646 MM |
2408 | { |
2409 | tree tmpl = build_lang_decl (TEMPLATE_DECL, DECL_NAME (decl), NULL_TREE); | |
2410 | DECL_TEMPLATE_PARMS (tmpl) = parms; | |
2411 | DECL_CONTEXT (tmpl) = DECL_CONTEXT (decl); | |
2412 | if (DECL_LANG_SPECIFIC (decl)) | |
2413 | { | |
8f032717 MM |
2414 | DECL_STATIC_FUNCTION_P (tmpl) = DECL_STATIC_FUNCTION_P (decl); |
2415 | DECL_CONSTRUCTOR_P (tmpl) = DECL_CONSTRUCTOR_P (decl); | |
c8460010 | 2416 | DECL_DESTRUCTOR_P (tmpl) = DECL_DESTRUCTOR_P (decl); |
11f98788 | 2417 | DECL_NONCONVERTING_P (tmpl) = DECL_NONCONVERTING_P (decl); |
1f6e1acc AS |
2418 | DECL_ASSIGNMENT_OPERATOR_P (tmpl) = DECL_ASSIGNMENT_OPERATOR_P (decl); |
2419 | if (DECL_OVERLOADED_OPERATOR_P (decl)) | |
2420 | SET_OVERLOADED_OPERATOR_CODE (tmpl, | |
2421 | DECL_OVERLOADED_OPERATOR_P (decl)); | |
75650646 MM |
2422 | } |
2423 | ||
2424 | return tmpl; | |
2425 | } | |
2426 | ||
050367a3 MM |
2427 | struct template_parm_data |
2428 | { | |
6c30752f MM |
2429 | /* The level of the template parameters we are currently |
2430 | processing. */ | |
050367a3 | 2431 | int level; |
6c30752f MM |
2432 | |
2433 | /* The index of the specialization argument we are currently | |
2434 | processing. */ | |
2435 | int current_arg; | |
2436 | ||
2437 | /* An array whose size is the number of template parameters. The | |
838dfd8a | 2438 | elements are nonzero if the parameter has been used in any one |
6c30752f | 2439 | of the arguments processed so far. */ |
050367a3 | 2440 | int* parms; |
6c30752f MM |
2441 | |
2442 | /* An array whose size is the number of template arguments. The | |
838dfd8a | 2443 | elements are nonzero if the argument makes use of template |
6c30752f MM |
2444 | parameters of this level. */ |
2445 | int* arg_uses_template_parms; | |
050367a3 MM |
2446 | }; |
2447 | ||
2448 | /* Subroutine of push_template_decl used to see if each template | |
2449 | parameter in a partial specialization is used in the explicit | |
2450 | argument list. If T is of the LEVEL given in DATA (which is | |
2451 | treated as a template_parm_data*), then DATA->PARMS is marked | |
2452 | appropriately. */ | |
2453 | ||
2454 | static int | |
3a978d72 | 2455 | mark_template_parm (tree t, void* data) |
050367a3 MM |
2456 | { |
2457 | int level; | |
2458 | int idx; | |
2459 | struct template_parm_data* tpd = (struct template_parm_data*) data; | |
2460 | ||
2461 | if (TREE_CODE (t) == TEMPLATE_PARM_INDEX) | |
2462 | { | |
2463 | level = TEMPLATE_PARM_LEVEL (t); | |
2464 | idx = TEMPLATE_PARM_IDX (t); | |
2465 | } | |
2466 | else | |
2467 | { | |
2468 | level = TEMPLATE_TYPE_LEVEL (t); | |
2469 | idx = TEMPLATE_TYPE_IDX (t); | |
2470 | } | |
2471 | ||
2472 | if (level == tpd->level) | |
6c30752f MM |
2473 | { |
2474 | tpd->parms[idx] = 1; | |
2475 | tpd->arg_uses_template_parms[tpd->current_arg] = 1; | |
2476 | } | |
050367a3 MM |
2477 | |
2478 | /* Return zero so that for_each_template_parm will continue the | |
2479 | traversal of the tree; we want to mark *every* template parm. */ | |
2480 | return 0; | |
2481 | } | |
2482 | ||
6c30752f MM |
2483 | /* Process the partial specialization DECL. */ |
2484 | ||
e9659ab0 | 2485 | static tree |
3a978d72 | 2486 | process_partial_specialization (tree decl) |
6c30752f MM |
2487 | { |
2488 | tree type = TREE_TYPE (decl); | |
2489 | tree maintmpl = CLASSTYPE_TI_TEMPLATE (type); | |
2490 | tree specargs = CLASSTYPE_TI_ARGS (type); | |
f9a7ae04 | 2491 | tree inner_args = INNERMOST_TEMPLATE_ARGS (specargs); |
6c30752f MM |
2492 | tree inner_parms = INNERMOST_TEMPLATE_PARMS (current_template_parms); |
2493 | tree main_inner_parms = DECL_INNERMOST_TEMPLATE_PARMS (maintmpl); | |
2494 | int nargs = TREE_VEC_LENGTH (inner_args); | |
2495 | int ntparms = TREE_VEC_LENGTH (inner_parms); | |
2496 | int i; | |
2497 | int did_error_intro = 0; | |
6c30752f MM |
2498 | struct template_parm_data tpd; |
2499 | struct template_parm_data tpd2; | |
2500 | ||
6c30752f MM |
2501 | /* We check that each of the template parameters given in the |
2502 | partial specialization is used in the argument list to the | |
2503 | specialization. For example: | |
2504 | ||
2505 | template <class T> struct S; | |
2506 | template <class T> struct S<T*>; | |
2507 | ||
2508 | The second declaration is OK because `T*' uses the template | |
2509 | parameter T, whereas | |
2510 | ||
2511 | template <class T> struct S<int>; | |
2512 | ||
2513 | is no good. Even trickier is: | |
2514 | ||
2515 | template <class T> | |
2516 | struct S1 | |
2517 | { | |
2518 | template <class U> | |
2519 | struct S2; | |
2520 | template <class U> | |
2521 | struct S2<T>; | |
2522 | }; | |
2523 | ||
0e339752 | 2524 | The S2<T> declaration is actually invalid; it is a |
6c30752f MM |
2525 | full-specialization. Of course, |
2526 | ||
2527 | template <class U> | |
2528 | struct S2<T (*)(U)>; | |
2529 | ||
2530 | or some such would have been OK. */ | |
2531 | tpd.level = TMPL_PARMS_DEPTH (current_template_parms); | |
2532 | tpd.parms = alloca (sizeof (int) * ntparms); | |
fad205ff | 2533 | memset (tpd.parms, 0, sizeof (int) * ntparms); |
6c30752f MM |
2534 | |
2535 | tpd.arg_uses_template_parms = alloca (sizeof (int) * nargs); | |
fad205ff | 2536 | memset (tpd.arg_uses_template_parms, 0, sizeof (int) * nargs); |
6c30752f MM |
2537 | for (i = 0; i < nargs; ++i) |
2538 | { | |
2539 | tpd.current_arg = i; | |
2540 | for_each_template_parm (TREE_VEC_ELT (inner_args, i), | |
2541 | &mark_template_parm, | |
4f2c9d7e MM |
2542 | &tpd, |
2543 | NULL); | |
6c30752f MM |
2544 | } |
2545 | for (i = 0; i < ntparms; ++i) | |
2546 | if (tpd.parms[i] == 0) | |
2547 | { | |
2548 | /* One of the template parms was not used in the | |
f9a7ae04 | 2549 | specialization. */ |
6c30752f MM |
2550 | if (!did_error_intro) |
2551 | { | |
33bd39a2 | 2552 | error ("template parameters not used in partial specialization:"); |
6c30752f MM |
2553 | did_error_intro = 1; |
2554 | } | |
2555 | ||
33bd39a2 | 2556 | error (" `%D'", |
6c30752f MM |
2557 | TREE_VALUE (TREE_VEC_ELT (inner_parms, i))); |
2558 | } | |
2559 | ||
2560 | /* [temp.class.spec] | |
2561 | ||
2562 | The argument list of the specialization shall not be identical to | |
2563 | the implicit argument list of the primary template. */ | |
f9a7ae04 MM |
2564 | if (comp_template_args |
2565 | (inner_args, | |
2566 | INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (TREE_TYPE | |
2567 | (maintmpl))))) | |
33bd39a2 | 2568 | error ("partial specialization `%T' does not specialize any template arguments", type); |
6c30752f MM |
2569 | |
2570 | /* [temp.class.spec] | |
2571 | ||
2572 | A partially specialized non-type argument expression shall not | |
2573 | involve template parameters of the partial specialization except | |
2574 | when the argument expression is a simple identifier. | |
2575 | ||
2576 | The type of a template parameter corresponding to a specialized | |
2577 | non-type argument shall not be dependent on a parameter of the | |
2578 | specialization. */ | |
2579 | my_friendly_assert (nargs == DECL_NTPARMS (maintmpl), 0); | |
2580 | tpd2.parms = 0; | |
2581 | for (i = 0; i < nargs; ++i) | |
2582 | { | |
2583 | tree arg = TREE_VEC_ELT (inner_args, i); | |
2584 | if (/* These first two lines are the `non-type' bit. */ | |
2f939d94 | 2585 | !TYPE_P (arg) |
6c30752f MM |
2586 | && TREE_CODE (arg) != TEMPLATE_DECL |
2587 | /* This next line is the `argument expression is not just a | |
2588 | simple identifier' condition and also the `specialized | |
2589 | non-type argument' bit. */ | |
2590 | && TREE_CODE (arg) != TEMPLATE_PARM_INDEX) | |
2591 | { | |
2592 | if (tpd.arg_uses_template_parms[i]) | |
33bd39a2 | 2593 | error ("template argument `%E' involves template parameter(s)", arg); |
6c30752f MM |
2594 | else |
2595 | { | |
2596 | /* Look at the corresponding template parameter, | |
2597 | marking which template parameters its type depends | |
2598 | upon. */ | |
2599 | tree type = | |
2600 | TREE_TYPE (TREE_VALUE (TREE_VEC_ELT (main_inner_parms, | |
2601 | i))); | |
2602 | ||
2603 | if (!tpd2.parms) | |
2604 | { | |
2605 | /* We haven't yet initialized TPD2. Do so now. */ | |
2606 | tpd2.arg_uses_template_parms | |
c68b0a84 | 2607 | = alloca (sizeof (int) * nargs); |
104bf76a | 2608 | /* The number of parameters here is the number in the |
76a83782 RH |
2609 | main template, which, as checked in the assertion |
2610 | above, is NARGS. */ | |
c68b0a84 | 2611 | tpd2.parms = alloca (sizeof (int) * nargs); |
6c30752f MM |
2612 | tpd2.level = |
2613 | TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (maintmpl)); | |
2614 | } | |
2615 | ||
104bf76a | 2616 | /* Mark the template parameters. But this time, we're |
6c30752f MM |
2617 | looking for the template parameters of the main |
2618 | template, not in the specialization. */ | |
2619 | tpd2.current_arg = i; | |
2620 | tpd2.arg_uses_template_parms[i] = 0; | |
fad205ff | 2621 | memset (tpd2.parms, 0, sizeof (int) * nargs); |
6c30752f MM |
2622 | for_each_template_parm (type, |
2623 | &mark_template_parm, | |
4f2c9d7e MM |
2624 | &tpd2, |
2625 | NULL); | |
6c30752f MM |
2626 | |
2627 | if (tpd2.arg_uses_template_parms [i]) | |
2628 | { | |
2629 | /* The type depended on some template parameters. | |
2630 | If they are fully specialized in the | |
2631 | specialization, that's OK. */ | |
2632 | int j; | |
2633 | for (j = 0; j < nargs; ++j) | |
2634 | if (tpd2.parms[j] != 0 | |
2635 | && tpd.arg_uses_template_parms [j]) | |
2636 | { | |
33bd39a2 | 2637 | error ("type `%T' of template argument `%E' depends on template parameter(s)", |
6c30752f MM |
2638 | type, |
2639 | arg); | |
2640 | break; | |
2641 | } | |
2642 | } | |
2643 | } | |
2644 | } | |
2645 | } | |
2646 | ||
2647 | if (retrieve_specialization (maintmpl, specargs)) | |
2648 | /* We've already got this specialization. */ | |
2649 | return decl; | |
2650 | ||
d8b64f80 | 2651 | DECL_TEMPLATE_SPECIALIZATIONS (maintmpl) |
e1b3e07d MM |
2652 | = tree_cons (inner_args, inner_parms, |
2653 | DECL_TEMPLATE_SPECIALIZATIONS (maintmpl)); | |
6c30752f MM |
2654 | TREE_TYPE (DECL_TEMPLATE_SPECIALIZATIONS (maintmpl)) = type; |
2655 | return decl; | |
2656 | } | |
2657 | ||
6ba89f8e MM |
2658 | /* Check that a template declaration's use of default arguments is not |
2659 | invalid. Here, PARMS are the template parameters. IS_PRIMARY is | |
838dfd8a KH |
2660 | nonzero if DECL is the thing declared by a primary template. |
2661 | IS_PARTIAL is nonzero if DECL is a partial specialization. */ | |
6ba89f8e MM |
2662 | |
2663 | static void | |
3a978d72 | 2664 | check_default_tmpl_args (tree decl, tree parms, int is_primary, int is_partial) |
6ba89f8e | 2665 | { |
d8e178a0 | 2666 | const char *msg; |
66191c20 MM |
2667 | int last_level_to_check; |
2668 | tree parm_level; | |
6ba89f8e MM |
2669 | |
2670 | /* [temp.param] | |
2671 | ||
2672 | A default template-argument shall not be specified in a | |
2673 | function template declaration or a function template definition, nor | |
2674 | in the template-parameter-list of the definition of a member of a | |
2675 | class template. */ | |
2676 | ||
4f1c5b7d | 2677 | if (TREE_CODE (CP_DECL_CONTEXT (decl)) == FUNCTION_DECL) |
e0942dcd MM |
2678 | /* You can't have a function template declaration in a local |
2679 | scope, nor you can you define a member of a class template in a | |
2680 | local scope. */ | |
2681 | return; | |
2682 | ||
6ba89f8e MM |
2683 | if (current_class_type |
2684 | && !TYPE_BEING_DEFINED (current_class_type) | |
3d7de1fa | 2685 | && DECL_LANG_SPECIFIC (decl) |
5937a6f9 MM |
2686 | /* If this is either a friend defined in the scope of the class |
2687 | or a member function. */ | |
6df5158a NS |
2688 | && (DECL_FUNCTION_MEMBER_P (decl) |
2689 | ? same_type_p (DECL_CONTEXT (decl), current_class_type) | |
2690 | : DECL_FRIEND_CONTEXT (decl) | |
2691 | ? same_type_p (DECL_FRIEND_CONTEXT (decl), current_class_type) | |
2692 | : false) | |
5937a6f9 MM |
2693 | /* And, if it was a member function, it really was defined in |
2694 | the scope of the class. */ | |
6df5158a NS |
2695 | && (!DECL_FUNCTION_MEMBER_P (decl) |
2696 | || DECL_INITIALIZED_IN_CLASS_P (decl))) | |
6ba89f8e | 2697 | /* We already checked these parameters when the template was |
5937a6f9 MM |
2698 | declared, so there's no need to do it again now. This function |
2699 | was defined in class scope, but we're processing it's body now | |
2700 | that the class is complete. */ | |
6ba89f8e MM |
2701 | return; |
2702 | ||
66191c20 MM |
2703 | /* [temp.param] |
2704 | ||
2705 | If a template-parameter has a default template-argument, all | |
2706 | subsequent template-parameters shall have a default | |
2707 | template-argument supplied. */ | |
2708 | for (parm_level = parms; parm_level; parm_level = TREE_CHAIN (parm_level)) | |
2709 | { | |
2710 | tree inner_parms = TREE_VALUE (parm_level); | |
2711 | int ntparms = TREE_VEC_LENGTH (inner_parms); | |
2712 | int seen_def_arg_p = 0; | |
2713 | int i; | |
2714 | ||
2715 | for (i = 0; i < ntparms; ++i) | |
2716 | { | |
2717 | tree parm = TREE_VEC_ELT (inner_parms, i); | |
2718 | if (TREE_PURPOSE (parm)) | |
2719 | seen_def_arg_p = 1; | |
2720 | else if (seen_def_arg_p) | |
2721 | { | |
33bd39a2 | 2722 | error ("no default argument for `%D'", TREE_VALUE (parm)); |
66191c20 MM |
2723 | /* For better subsequent error-recovery, we indicate that |
2724 | there should have been a default argument. */ | |
2725 | TREE_PURPOSE (parm) = error_mark_node; | |
2726 | } | |
2727 | } | |
2728 | } | |
2729 | ||
6ba89f8e MM |
2730 | if (TREE_CODE (decl) != TYPE_DECL || is_partial || !is_primary) |
2731 | /* For an ordinary class template, default template arguments are | |
2732 | allowed at the innermost level, e.g.: | |
2733 | template <class T = int> | |
2734 | struct S {}; | |
2735 | but, in a partial specialization, they're not allowed even | |
2736 | there, as we have in [temp.class.spec]: | |
2737 | ||
2738 | The template parameter list of a specialization shall not | |
2739 | contain default template argument values. | |
2740 | ||
2741 | So, for a partial specialization, or for a function template, | |
2742 | we look at all of them. */ | |
2743 | ; | |
2744 | else | |
2745 | /* But, for a primary class template that is not a partial | |
2746 | specialization we look at all template parameters except the | |
2747 | innermost ones. */ | |
2748 | parms = TREE_CHAIN (parms); | |
2749 | ||
2750 | /* Figure out what error message to issue. */ | |
2751 | if (TREE_CODE (decl) == FUNCTION_DECL) | |
8653a2c3 | 2752 | msg = "default template arguments may not be used in function templates"; |
6ba89f8e | 2753 | else if (is_partial) |
8653a2c3 | 2754 | msg = "default template arguments may not be used in partial specializations"; |
6ba89f8e MM |
2755 | else |
2756 | msg = "default argument for template parameter for class enclosing `%D'"; | |
2757 | ||
2758 | if (current_class_type && TYPE_BEING_DEFINED (current_class_type)) | |
2759 | /* If we're inside a class definition, there's no need to | |
104bf76a | 2760 | examine the parameters to the class itself. On the one |
6ba89f8e | 2761 | hand, they will be checked when the class is defined, and, |
0e339752 | 2762 | on the other, default arguments are valid in things like: |
6ba89f8e MM |
2763 | template <class T = double> |
2764 | struct S { template <class U> void f(U); }; | |
2765 | Here the default argument for `S' has no bearing on the | |
2766 | declaration of `f'. */ | |
2767 | last_level_to_check = template_class_depth (current_class_type) + 1; | |
2768 | else | |
2769 | /* Check everything. */ | |
2770 | last_level_to_check = 0; | |
2771 | ||
66191c20 MM |
2772 | for (parm_level = parms; |
2773 | parm_level && TMPL_PARMS_DEPTH (parm_level) >= last_level_to_check; | |
2774 | parm_level = TREE_CHAIN (parm_level)) | |
6ba89f8e | 2775 | { |
66191c20 MM |
2776 | tree inner_parms = TREE_VALUE (parm_level); |
2777 | int i; | |
2778 | int ntparms; | |
6ba89f8e MM |
2779 | |
2780 | ntparms = TREE_VEC_LENGTH (inner_parms); | |
2781 | for (i = 0; i < ntparms; ++i) | |
2782 | if (TREE_PURPOSE (TREE_VEC_ELT (inner_parms, i))) | |
2783 | { | |
2784 | if (msg) | |
2785 | { | |
33bd39a2 | 2786 | error (msg, decl); |
6ba89f8e MM |
2787 | msg = 0; |
2788 | } | |
2789 | ||
2790 | /* Clear out the default argument so that we are not | |
2791 | confused later. */ | |
2792 | TREE_PURPOSE (TREE_VEC_ELT (inner_parms, i)) = NULL_TREE; | |
2793 | } | |
2794 | ||
2795 | /* At this point, if we're still interested in issuing messages, | |
2796 | they must apply to classes surrounding the object declared. */ | |
2797 | if (msg) | |
2798 | msg = "default argument for template parameter for class enclosing `%D'"; | |
2799 | } | |
2800 | } | |
2801 | ||
5dd236e2 NS |
2802 | /* Worker for push_template_decl_real, called via |
2803 | for_each_template_parm. DATA is really an int, indicating the | |
2804 | level of the parameters we are interested in. If T is a template | |
838dfd8a | 2805 | parameter of that level, return nonzero. */ |
5dd236e2 NS |
2806 | |
2807 | static int | |
3a978d72 | 2808 | template_parm_this_level_p (tree t, void* data) |
5dd236e2 | 2809 | { |
6e04241f | 2810 | int this_level = *(int *)data; |
5dd236e2 NS |
2811 | int level; |
2812 | ||
2813 | if (TREE_CODE (t) == TEMPLATE_PARM_INDEX) | |
2814 | level = TEMPLATE_PARM_LEVEL (t); | |
2815 | else | |
2816 | level = TEMPLATE_TYPE_LEVEL (t); | |
2817 | return level == this_level; | |
2818 | } | |
2819 | ||
3ac3d9ea | 2820 | /* Creates a TEMPLATE_DECL for the indicated DECL using the template |
f84b4be9 JM |
2821 | parameters given by current_template_args, or reuses a |
2822 | previously existing one, if appropriate. Returns the DECL, or an | |
6757edfe MM |
2823 | equivalent one, if it is replaced via a call to duplicate_decls. |
2824 | ||
838dfd8a | 2825 | If IS_FRIEND is nonzero, DECL is a friend declaration. */ |
3ac3d9ea MM |
2826 | |
2827 | tree | |
3a978d72 | 2828 | push_template_decl_real (tree decl, int is_friend) |
9a3b49ac MS |
2829 | { |
2830 | tree tmpl; | |
f84b4be9 | 2831 | tree args; |
9a3b49ac | 2832 | tree info; |
f84b4be9 JM |
2833 | tree ctx; |
2834 | int primary; | |
6ba89f8e | 2835 | int is_partial; |
cfe507be | 2836 | int new_template_p = 0; |
6ba89f8e | 2837 | |
c0694c4b MM |
2838 | if (decl == error_mark_node) |
2839 | return decl; | |
2840 | ||
6ba89f8e | 2841 | /* See if this is a partial specialization. */ |
9188c363 | 2842 | is_partial = (DECL_IMPLICIT_TYPEDEF_P (decl) |
6ba89f8e | 2843 | && TREE_CODE (TREE_TYPE (decl)) != ENUMERAL_TYPE |
370af2d5 | 2844 | && CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_TYPE (decl))); |
6757edfe MM |
2845 | |
2846 | is_friend |= (TREE_CODE (decl) == FUNCTION_DECL && DECL_FRIEND_P (decl)); | |
f84b4be9 JM |
2847 | |
2848 | if (is_friend) | |
2849 | /* For a friend, we want the context of the friend function, not | |
2850 | the type of which it is a friend. */ | |
2851 | ctx = DECL_CONTEXT (decl); | |
4f1c5b7d MM |
2852 | else if (CP_DECL_CONTEXT (decl) |
2853 | && TREE_CODE (CP_DECL_CONTEXT (decl)) != NAMESPACE_DECL) | |
f84b4be9 JM |
2854 | /* In the case of a virtual function, we want the class in which |
2855 | it is defined. */ | |
4f1c5b7d | 2856 | ctx = CP_DECL_CONTEXT (decl); |
f84b4be9 | 2857 | else |
dc957d14 | 2858 | /* Otherwise, if we're currently defining some class, the DECL |
f84b4be9 | 2859 | is assumed to be a member of the class. */ |
9188c363 | 2860 | ctx = current_scope (); |
f84b4be9 | 2861 | |
2c73f9f5 ML |
2862 | if (ctx && TREE_CODE (ctx) == NAMESPACE_DECL) |
2863 | ctx = NULL_TREE; | |
2864 | ||
2865 | if (!DECL_CONTEXT (decl)) | |
cb0dbb9a | 2866 | DECL_CONTEXT (decl) = FROB_CONTEXT (current_namespace); |
2c73f9f5 | 2867 | |
6ba89f8e | 2868 | /* See if this is a primary template. */ |
74b846e0 | 2869 | primary = template_parm_scope_p (); |
9a3b49ac | 2870 | |
83566abf JM |
2871 | if (primary) |
2872 | { | |
2873 | if (current_lang_name == lang_name_c) | |
33bd39a2 | 2874 | error ("template with C linkage"); |
4ce3d537 MM |
2875 | else if (TREE_CODE (decl) == TYPE_DECL |
2876 | && ANON_AGGRNAME_P (DECL_NAME (decl))) | |
33bd39a2 | 2877 | error ("template class without a name"); |
717a7d5d | 2878 | else if (TREE_CODE (decl) == FUNCTION_DECL) |
4b0d3cbe | 2879 | { |
717a7d5d MM |
2880 | if (DECL_DESTRUCTOR_P (decl)) |
2881 | { | |
2882 | /* [temp.mem] | |
2883 | ||
2884 | A destructor shall not be a member template. */ | |
2885 | error ("destructor `%D' declared as member template", decl); | |
2886 | return error_mark_node; | |
2887 | } | |
2888 | if (NEW_DELETE_OPNAME_P (DECL_NAME (decl)) | |
2889 | && (!TYPE_ARG_TYPES (TREE_TYPE (decl)) | |
2890 | || TYPE_ARG_TYPES (TREE_TYPE (decl)) == void_list_node | |
2891 | || !TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (decl))) | |
2892 | || (TREE_CHAIN (TYPE_ARG_TYPES ((TREE_TYPE (decl)))) | |
2893 | == void_list_node))) | |
2894 | { | |
2895 | /* [basic.stc.dynamic.allocation] | |
2896 | ||
2897 | An allocation function can be a function | |
2898 | template. ... Template allocation functions shall | |
2899 | have two or more parameters. */ | |
2900 | error ("invalid template declaration of `%D'", decl); | |
2901 | return decl; | |
2902 | } | |
4b0d3cbe | 2903 | } |
2aaf816d JM |
2904 | else if ((DECL_IMPLICIT_TYPEDEF_P (decl) |
2905 | && CLASS_TYPE_P (TREE_TYPE (decl))) | |
717a7d5d | 2906 | || (TREE_CODE (decl) == VAR_DECL && ctx && CLASS_TYPE_P (ctx))) |
2aaf816d JM |
2907 | /* OK */; |
2908 | else | |
11325dcd KL |
2909 | { |
2910 | error ("template declaration of `%#D'", decl); | |
2911 | return error_mark_node; | |
2912 | } | |
83566abf JM |
2913 | } |
2914 | ||
6ba89f8e MM |
2915 | /* Check to see that the rules regarding the use of default |
2916 | arguments are not being violated. */ | |
2917 | check_default_tmpl_args (decl, current_template_parms, | |
2918 | primary, is_partial); | |
73aad9b9 | 2919 | |
6ba89f8e MM |
2920 | if (is_partial) |
2921 | return process_partial_specialization (decl); | |
d32789d8 | 2922 | |
9a3b49ac MS |
2923 | args = current_template_args (); |
2924 | ||
f84b4be9 JM |
2925 | if (!ctx |
2926 | || TREE_CODE (ctx) == FUNCTION_DECL | |
a723baf1 | 2927 | || (CLASS_TYPE_P (ctx) && TYPE_BEING_DEFINED (ctx)) |
f84b4be9 | 2928 | || (is_friend && !DECL_TEMPLATE_INFO (decl))) |
8d08fdba | 2929 | { |
75650646 | 2930 | if (DECL_LANG_SPECIFIC (decl) |
f84b4be9 JM |
2931 | && DECL_TEMPLATE_INFO (decl) |
2932 | && DECL_TI_TEMPLATE (decl)) | |
2933 | tmpl = DECL_TI_TEMPLATE (decl); | |
1c10870d AS |
2934 | /* If DECL is a TYPE_DECL for a class-template, then there won't |
2935 | be DECL_LANG_SPECIFIC. The information equivalent to | |
2936 | DECL_TEMPLATE_INFO is found in TYPE_TEMPLATE_INFO instead. */ | |
2937 | else if (DECL_IMPLICIT_TYPEDEF_P (decl) | |
2938 | && TYPE_TEMPLATE_INFO (TREE_TYPE (decl)) | |
2939 | && TYPE_TI_TEMPLATE (TREE_TYPE (decl))) | |
2940 | { | |
2941 | /* Since a template declaration already existed for this | |
2942 | class-type, we must be redeclaring it here. Make sure | |
0e339752 | 2943 | that the redeclaration is valid. */ |
1c10870d AS |
2944 | redeclare_class_template (TREE_TYPE (decl), |
2945 | current_template_parms); | |
2946 | /* We don't need to create a new TEMPLATE_DECL; just use the | |
2947 | one we already had. */ | |
2948 | tmpl = TYPE_TI_TEMPLATE (TREE_TYPE (decl)); | |
2949 | } | |
f84b4be9 | 2950 | else |
786b5245 | 2951 | { |
f84b4be9 | 2952 | tmpl = build_template_decl (decl, current_template_parms); |
cfe507be MM |
2953 | new_template_p = 1; |
2954 | ||
f84b4be9 JM |
2955 | if (DECL_LANG_SPECIFIC (decl) |
2956 | && DECL_TEMPLATE_SPECIALIZATION (decl)) | |
2957 | { | |
2958 | /* A specialization of a member template of a template | |
c6002625 | 2959 | class. */ |
f84b4be9 JM |
2960 | SET_DECL_TEMPLATE_SPECIALIZATION (tmpl); |
2961 | DECL_TEMPLATE_INFO (tmpl) = DECL_TEMPLATE_INFO (decl); | |
2962 | DECL_TEMPLATE_INFO (decl) = NULL_TREE; | |
2963 | } | |
786b5245 | 2964 | } |
8d08fdba MS |
2965 | } |
2966 | else | |
2967 | { | |
e1a5ccf7 | 2968 | tree a, t, current, parms; |
ba4f4e5d | 2969 | int i; |
6633d636 | 2970 | |
6b9ab5cc MM |
2971 | if (TREE_CODE (decl) == TYPE_DECL) |
2972 | { | |
ed44da02 MM |
2973 | if ((IS_AGGR_TYPE_CODE (TREE_CODE (TREE_TYPE (decl))) |
2974 | || TREE_CODE (TREE_TYPE (decl)) == ENUMERAL_TYPE) | |
2975 | && TYPE_TEMPLATE_INFO (TREE_TYPE (decl)) | |
2976 | && TYPE_TI_TEMPLATE (TREE_TYPE (decl))) | |
2977 | tmpl = TYPE_TI_TEMPLATE (TREE_TYPE (decl)); | |
6b9ab5cc MM |
2978 | else |
2979 | { | |
33bd39a2 | 2980 | error ("`%D' does not declare a template type", decl); |
6b9ab5cc MM |
2981 | return decl; |
2982 | } | |
2983 | } | |
f3368a90 | 2984 | else if (!DECL_LANG_SPECIFIC (decl) || !DECL_TEMPLATE_INFO (decl)) |
c91a56d2 | 2985 | { |
33bd39a2 | 2986 | error ("template definition of non-template `%#D'", decl); |
3ac3d9ea | 2987 | return decl; |
c91a56d2 | 2988 | } |
8d08fdba | 2989 | else |
5566b478 | 2990 | tmpl = DECL_TI_TEMPLATE (decl); |
98c1c668 | 2991 | |
c353b8e3 | 2992 | if (DECL_FUNCTION_TEMPLATE_P (tmpl) |
e1a5ccf7 | 2993 | && DECL_TEMPLATE_INFO (decl) && DECL_TI_ARGS (decl) |
c353b8e3 MM |
2994 | && DECL_TEMPLATE_SPECIALIZATION (decl) |
2995 | && is_member_template (tmpl)) | |
98c1c668 | 2996 | { |
e1a5ccf7 JM |
2997 | tree new_tmpl; |
2998 | ||
2999 | /* The declaration is a specialization of a member | |
3000 | template, declared outside the class. Therefore, the | |
3001 | innermost template arguments will be NULL, so we | |
3002 | replace them with the arguments determined by the | |
3003 | earlier call to check_explicit_specialization. */ | |
3004 | args = DECL_TI_ARGS (decl); | |
3005 | ||
3006 | new_tmpl | |
3007 | = build_template_decl (decl, current_template_parms); | |
3008 | DECL_TEMPLATE_RESULT (new_tmpl) = decl; | |
3009 | TREE_TYPE (new_tmpl) = TREE_TYPE (decl); | |
3010 | DECL_TI_TEMPLATE (decl) = new_tmpl; | |
3011 | SET_DECL_TEMPLATE_SPECIALIZATION (new_tmpl); | |
e1b3e07d MM |
3012 | DECL_TEMPLATE_INFO (new_tmpl) |
3013 | = tree_cons (tmpl, args, NULL_TREE); | |
e1a5ccf7 | 3014 | |
f9a7ae04 MM |
3015 | register_specialization (new_tmpl, |
3016 | most_general_template (tmpl), | |
3017 | args); | |
e1a5ccf7 | 3018 | return decl; |
98c1c668 | 3019 | } |
98c1c668 | 3020 | |
e1a5ccf7 | 3021 | /* Make sure the template headers we got make sense. */ |
6633d636 | 3022 | |
e1a5ccf7 JM |
3023 | parms = DECL_TEMPLATE_PARMS (tmpl); |
3024 | i = TMPL_PARMS_DEPTH (parms); | |
3025 | if (TMPL_ARGS_DEPTH (args) != i) | |
98c1c668 | 3026 | { |
33bd39a2 | 3027 | error ("expected %d levels of template parms for `%#D', got %d", |
e1a5ccf7 | 3028 | i, decl, TMPL_ARGS_DEPTH (args)); |
98c1c668 | 3029 | } |
e1a5ccf7 JM |
3030 | else |
3031 | for (current = decl; i > 0; --i, parms = TREE_CHAIN (parms)) | |
3032 | { | |
3033 | a = TMPL_ARGS_LEVEL (args, i); | |
3034 | t = INNERMOST_TEMPLATE_PARMS (parms); | |
3035 | ||
3036 | if (TREE_VEC_LENGTH (t) != TREE_VEC_LENGTH (a)) | |
3037 | { | |
3038 | if (current == decl) | |
33bd39a2 | 3039 | error ("got %d template parameters for `%#D'", |
e1a5ccf7 JM |
3040 | TREE_VEC_LENGTH (a), decl); |
3041 | else | |
33bd39a2 | 3042 | error ("got %d template parameters for `%#T'", |
e1a5ccf7 | 3043 | TREE_VEC_LENGTH (a), current); |
33bd39a2 | 3044 | error (" but %d required", TREE_VEC_LENGTH (t)); |
e1a5ccf7 | 3045 | } |
98c1c668 | 3046 | |
e1a5ccf7 JM |
3047 | /* Perhaps we should also check that the parms are used in the |
3048 | appropriate qualifying scopes in the declarator? */ | |
6633d636 | 3049 | |
e1a5ccf7 JM |
3050 | if (current == decl) |
3051 | current = ctx; | |
3052 | else | |
3053 | current = TYPE_CONTEXT (current); | |
3054 | } | |
5566b478 | 3055 | } |
8d08fdba | 3056 | |
5566b478 MS |
3057 | DECL_TEMPLATE_RESULT (tmpl) = decl; |
3058 | TREE_TYPE (tmpl) = TREE_TYPE (decl); | |
8d08fdba | 3059 | |
36a117a5 MM |
3060 | /* Push template declarations for global functions and types. Note |
3061 | that we do not try to push a global template friend declared in a | |
3062 | template class; such a thing may well depend on the template | |
39c01e4c | 3063 | parameters of the class. */ |
cfe507be | 3064 | if (new_template_p && !ctx |
36a117a5 | 3065 | && !(is_friend && template_class_depth (current_class_type) > 0)) |
2c73f9f5 | 3066 | tmpl = pushdecl_namespace_level (tmpl); |
8d08fdba | 3067 | |
5566b478 | 3068 | if (primary) |
5dd236e2 NS |
3069 | { |
3070 | DECL_PRIMARY_TEMPLATE (tmpl) = tmpl; | |
3071 | if (DECL_CONV_FN_P (tmpl)) | |
3072 | { | |
6e04241f GS |
3073 | int depth = TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl)); |
3074 | ||
5dd236e2 NS |
3075 | /* It is a conversion operator. See if the type converted to |
3076 | depends on innermost template operands. */ | |
3077 | ||
d43f603d KL |
3078 | if (uses_template_parms_level (TREE_TYPE (TREE_TYPE (tmpl)), |
3079 | depth)) | |
5dd236e2 NS |
3080 | DECL_TEMPLATE_CONV_FN_P (tmpl) = 1; |
3081 | } | |
3082 | } | |
5566b478 | 3083 | |
a692ad2e | 3084 | /* The DECL_TI_ARGS of DECL contains full set of arguments referring |
28ba38e3 KL |
3085 | back to its most general template. If TMPL is a specialization, |
3086 | ARGS may only have the innermost set of arguments. Add the missing | |
3087 | argument levels if necessary. */ | |
3088 | if (DECL_TEMPLATE_INFO (tmpl)) | |
3089 | args = add_outermost_template_args (DECL_TI_ARGS (tmpl), args); | |
3090 | ||
e1b3e07d | 3091 | info = tree_cons (tmpl, args, NULL_TREE); |
5566b478 | 3092 | |
9188c363 | 3093 | if (DECL_IMPLICIT_TYPEDEF_P (decl)) |
8d08fdba | 3094 | { |
ed44da02 MM |
3095 | SET_TYPE_TEMPLATE_INFO (TREE_TYPE (tmpl), info); |
3096 | if ((!ctx || TREE_CODE (ctx) != FUNCTION_DECL) | |
b60ecc04 MM |
3097 | && TREE_CODE (TREE_TYPE (decl)) != ENUMERAL_TYPE |
3098 | /* Don't change the name if we've already set it up. */ | |
3099 | && !IDENTIFIER_TEMPLATE (DECL_NAME (decl))) | |
75650646 | 3100 | DECL_NAME (decl) = classtype_mangled_name (TREE_TYPE (decl)); |
51c184be | 3101 | } |
2aaf816d | 3102 | else if (DECL_LANG_SPECIFIC (decl)) |
5566b478 | 3103 | DECL_TEMPLATE_INFO (decl) = info; |
3ac3d9ea MM |
3104 | |
3105 | return DECL_TEMPLATE_RESULT (tmpl); | |
8d08fdba MS |
3106 | } |
3107 | ||
6757edfe | 3108 | tree |
3a978d72 | 3109 | push_template_decl (tree decl) |
6757edfe MM |
3110 | { |
3111 | return push_template_decl_real (decl, 0); | |
3112 | } | |
3113 | ||
3114 | /* Called when a class template TYPE is redeclared with the indicated | |
3115 | template PARMS, e.g.: | |
7fe6899f MM |
3116 | |
3117 | template <class T> struct S; | |
3118 | template <class T> struct S {}; */ | |
3119 | ||
3120 | void | |
3a978d72 | 3121 | redeclare_class_template (tree type, tree parms) |
7fe6899f | 3122 | { |
3d7de1fa | 3123 | tree tmpl; |
6757edfe | 3124 | tree tmpl_parms; |
7fe6899f MM |
3125 | int i; |
3126 | ||
3d7de1fa MM |
3127 | if (!TYPE_TEMPLATE_INFO (type)) |
3128 | { | |
33bd39a2 | 3129 | error ("`%T' is not a template type", type); |
3d7de1fa MM |
3130 | return; |
3131 | } | |
3132 | ||
3133 | tmpl = TYPE_TI_TEMPLATE (type); | |
7fe6899f MM |
3134 | if (!PRIMARY_TEMPLATE_P (tmpl)) |
3135 | /* The type is nested in some template class. Nothing to worry | |
3136 | about here; there are no new template parameters for the nested | |
3137 | type. */ | |
3138 | return; | |
3139 | ||
6757edfe MM |
3140 | parms = INNERMOST_TEMPLATE_PARMS (parms); |
3141 | tmpl_parms = DECL_INNERMOST_TEMPLATE_PARMS (tmpl); | |
3142 | ||
7fe6899f MM |
3143 | if (TREE_VEC_LENGTH (parms) != TREE_VEC_LENGTH (tmpl_parms)) |
3144 | { | |
8251199e | 3145 | cp_error_at ("previous declaration `%D'", tmpl); |
33bd39a2 | 3146 | error ("used %d template parameter%s instead of %d", |
7fe6899f MM |
3147 | TREE_VEC_LENGTH (tmpl_parms), |
3148 | TREE_VEC_LENGTH (tmpl_parms) == 1 ? "" : "s", | |
3149 | TREE_VEC_LENGTH (parms)); | |
3150 | return; | |
3151 | } | |
3152 | ||
3153 | for (i = 0; i < TREE_VEC_LENGTH (tmpl_parms); ++i) | |
3154 | { | |
3155 | tree tmpl_parm = TREE_VALUE (TREE_VEC_ELT (tmpl_parms, i)); | |
3156 | tree parm = TREE_VALUE (TREE_VEC_ELT (parms, i)); | |
3157 | tree tmpl_default = TREE_PURPOSE (TREE_VEC_ELT (tmpl_parms, i)); | |
3158 | tree parm_default = TREE_PURPOSE (TREE_VEC_ELT (parms, i)); | |
3159 | ||
3160 | if (TREE_CODE (tmpl_parm) != TREE_CODE (parm)) | |
3161 | { | |
8251199e | 3162 | cp_error_at ("template parameter `%#D'", tmpl_parm); |
33bd39a2 | 3163 | error ("redeclared here as `%#D'", parm); |
7fe6899f MM |
3164 | return; |
3165 | } | |
3166 | ||
3167 | if (tmpl_default != NULL_TREE && parm_default != NULL_TREE) | |
3168 | { | |
3169 | /* We have in [temp.param]: | |
3170 | ||
3171 | A template-parameter may not be given default arguments | |
3172 | by two different declarations in the same scope. */ | |
33bd39a2 | 3173 | error ("redefinition of default argument for `%#D'", parm); |
ddd2d57e | 3174 | error ("%J original definition appeared here", tmpl_parm); |
7fe6899f MM |
3175 | return; |
3176 | } | |
3177 | ||
3178 | if (parm_default != NULL_TREE) | |
3179 | /* Update the previous template parameters (which are the ones | |
3180 | that will really count) with the new default value. */ | |
3181 | TREE_PURPOSE (TREE_VEC_ELT (tmpl_parms, i)) = parm_default; | |
7ce74c5e MM |
3182 | else if (tmpl_default != NULL_TREE) |
3183 | /* Update the new parameters, too; they'll be used as the | |
3184 | parameters for any members. */ | |
3185 | TREE_PURPOSE (TREE_VEC_ELT (parms, i)) = tmpl_default; | |
7fe6899f MM |
3186 | } |
3187 | } | |
75650646 | 3188 | |
9baa27a9 MM |
3189 | /* Simplify EXPR if it is a non-dependent expression. Returns the |
3190 | (possibly simplified) expression. */ | |
3191 | ||
3192 | tree | |
3193 | fold_non_dependent_expr (tree expr) | |
3194 | { | |
3195 | /* If we're in a template, but EXPR isn't value dependent, simplify | |
3196 | it. We're supposed to treat: | |
3197 | ||
3198 | template <typename T> void f(T[1 + 1]); | |
3199 | template <typename T> void f(T[2]); | |
3200 | ||
3201 | as two declarations of the same function, for example. */ | |
3202 | if (processing_template_decl | |
3203 | && !type_dependent_expression_p (expr) | |
3204 | && !value_dependent_expression_p (expr)) | |
3205 | { | |
3206 | HOST_WIDE_INT saved_processing_template_decl; | |
3207 | ||
3208 | saved_processing_template_decl = processing_template_decl; | |
3209 | processing_template_decl = 0; | |
3210 | expr = tsubst_copy_and_build (expr, | |
3211 | /*args=*/NULL_TREE, | |
3212 | tf_error, | |
3213 | /*in_decl=*/NULL_TREE, | |
3214 | /*function_p=*/false); | |
3215 | processing_template_decl = saved_processing_template_decl; | |
3216 | } | |
3217 | return expr; | |
3218 | } | |
3219 | ||
75650646 MM |
3220 | /* Attempt to convert the non-type template parameter EXPR to the |
3221 | indicated TYPE. If the conversion is successful, return the | |
dc957d14 | 3222 | converted value. If the conversion is unsuccessful, return |
75650646 MM |
3223 | NULL_TREE if we issued an error message, or error_mark_node if we |
3224 | did not. We issue error messages for out-and-out bad template | |
3225 | parameters, but not simply because the conversion failed, since we | |
9baa27a9 MM |
3226 | might be just trying to do argument deduction. Both TYPE and EXPR |
3227 | must be non-dependent. */ | |
75650646 MM |
3228 | |
3229 | static tree | |
3a978d72 | 3230 | convert_nontype_argument (tree type, tree expr) |
75650646 | 3231 | { |
9baa27a9 MM |
3232 | tree expr_type; |
3233 | ||
3234 | /* If we are in a template, EXPR may be non-dependent, but still | |
3235 | have a syntactic, rather than semantic, form. For example, EXPR | |
3236 | might be a SCOPE_REF, rather than the VAR_DECL to which the | |
3237 | SCOPE_REF refers. Preserving the qualifying scope is necessary | |
3238 | so that access checking can be performed when the template is | |
3239 | instantiated -- but here we need the resolved form so that we can | |
3240 | convert the argument. */ | |
3241 | expr = fold_non_dependent_expr (expr); | |
3242 | expr_type = TREE_TYPE (expr); | |
75650646 MM |
3243 | |
3244 | /* A template-argument for a non-type, non-template | |
3245 | template-parameter shall be one of: | |
3246 | ||
3247 | --an integral constant-expression of integral or enumeration | |
3248 | type; or | |
3249 | ||
3250 | --the name of a non-type template-parameter; or | |
3251 | ||
3252 | --the name of an object or function with external linkage, | |
3253 | including function templates and function template-ids but | |
86052cc3 | 3254 | excluding non-static class members, expressed as id-expression; |
75650646 MM |
3255 | or |
3256 | ||
3257 | --the address of an object or function with external linkage, | |
3258 | including function templates and function template-ids but | |
3259 | excluding non-static class members, expressed as & id-expression | |
3260 | where the & is optional if the name refers to a function or | |
3261 | array; or | |
3262 | ||
3263 | --a pointer to member expressed as described in _expr.unary.op_. */ | |
3264 | ||
638dd8fc | 3265 | /* An integral constant-expression can include const variables or |
9baa27a9 | 3266 | . enumerators. Simplify things by folding them to their values, |
638dd8fc MM |
3267 | unless we're about to bind the declaration to a reference |
3268 | parameter. */ | |
9baa27a9 MM |
3269 | if (INTEGRAL_TYPE_P (expr_type) && TREE_CODE (type) != REFERENCE_TYPE) |
3270 | while (true) | |
3271 | { | |
3272 | tree const_expr = decl_constant_value (expr); | |
3273 | /* In a template, the initializer for a VAR_DECL may not be | |
3274 | marked as TREE_CONSTANT, in which case decl_constant_value | |
3275 | will not return the initializer. Handle that special case | |
3276 | here. */ | |
3277 | if (expr == const_expr | |
c30b4add | 3278 | && DECL_INTEGRAL_CONSTANT_VAR_P (expr) |
9baa27a9 MM |
3279 | /* DECL_INITIAL can be NULL if we are processing a |
3280 | variable initialized to an expression involving itself. | |
3281 | We know it is initialized to a constant -- but not what | |
3282 | constant, yet. */ | |
3283 | && DECL_INITIAL (expr)) | |
3284 | const_expr = DECL_INITIAL (expr); | |
3285 | if (expr == const_expr) | |
3286 | break; | |
3287 | expr = fold_non_dependent_expr (const_expr); | |
3288 | } | |
86052cc3 | 3289 | |
7bf2682f MM |
3290 | if (is_overloaded_fn (expr)) |
3291 | /* OK for now. We'll check that it has external linkage later. | |
3292 | Check this first since if expr_type is the unknown_type_node | |
3293 | we would otherwise complain below. */ | |
3294 | ; | |
a5ac359a | 3295 | else if (TYPE_PTR_TO_MEMBER_P (expr_type)) |
e08a8f45 MM |
3296 | { |
3297 | if (TREE_CODE (expr) != PTRMEM_CST) | |
3298 | goto bad_argument; | |
3299 | } | |
f3400fe2 JM |
3300 | else if (TYPE_PTR_P (expr_type) |
3301 | || TREE_CODE (expr_type) == ARRAY_TYPE | |
3302 | || TREE_CODE (type) == REFERENCE_TYPE | |
75650646 MM |
3303 | /* If expr is the address of an overloaded function, we |
3304 | will get the unknown_type_node at this point. */ | |
3305 | || expr_type == unknown_type_node) | |
3306 | { | |
3307 | tree referent; | |
49bf0d6f MM |
3308 | tree e = expr; |
3309 | STRIP_NOPS (e); | |
75650646 | 3310 | |
0dc09a61 MM |
3311 | if (TREE_CODE (expr_type) == ARRAY_TYPE |
3312 | || (TREE_CODE (type) == REFERENCE_TYPE | |
3313 | && TREE_CODE (e) != ADDR_EXPR)) | |
f3400fe2 JM |
3314 | referent = e; |
3315 | else | |
75650646 | 3316 | { |
f3400fe2 JM |
3317 | if (TREE_CODE (e) != ADDR_EXPR) |
3318 | { | |
3319 | bad_argument: | |
33bd39a2 | 3320 | error ("`%E' is not a valid template argument", expr); |
e08a8f45 MM |
3321 | if (TYPE_PTR_P (expr_type)) |
3322 | { | |
3323 | if (TREE_CODE (TREE_TYPE (expr_type)) == FUNCTION_TYPE) | |
33bd39a2 | 3324 | error ("it must be the address of a function with external linkage"); |
e08a8f45 | 3325 | else |
33bd39a2 | 3326 | error ("it must be the address of an object with external linkage"); |
e08a8f45 | 3327 | } |
a5ac359a | 3328 | else if (TYPE_PTR_TO_MEMBER_P (expr_type)) |
33bd39a2 | 3329 | error ("it must be a pointer-to-member of the form `&X::Y'"); |
e08a8f45 | 3330 | |
f3400fe2 JM |
3331 | return NULL_TREE; |
3332 | } | |
3333 | ||
3334 | referent = TREE_OPERAND (e, 0); | |
3335 | STRIP_NOPS (referent); | |
75650646 MM |
3336 | } |
3337 | ||
75650646 MM |
3338 | if (TREE_CODE (referent) == STRING_CST) |
3339 | { | |
33bd39a2 | 3340 | error ("string literal %E is not a valid template argument because it is the address of an object with static linkage", |
75650646 | 3341 | referent); |
75650646 MM |
3342 | return NULL_TREE; |
3343 | } | |
3344 | ||
279b8466 MM |
3345 | if (TREE_CODE (referent) == SCOPE_REF) |
3346 | referent = TREE_OPERAND (referent, 1); | |
3347 | ||
75650646 MM |
3348 | if (is_overloaded_fn (referent)) |
3349 | /* We'll check that it has external linkage later. */ | |
3350 | ; | |
3351 | else if (TREE_CODE (referent) != VAR_DECL) | |
3352 | goto bad_argument; | |
ad50e811 | 3353 | else if (!DECL_EXTERNAL_LINKAGE_P (referent)) |
75650646 | 3354 | { |
33bd39a2 | 3355 | error ("address of non-extern `%E' cannot be used as template argument", referent); |
75650646 MM |
3356 | return error_mark_node; |
3357 | } | |
3358 | } | |
a5ac359a | 3359 | else if (INTEGRAL_TYPE_P (expr_type) || TYPE_PTR_TO_MEMBER_P (expr_type)) |
75650646 | 3360 | { |
f3400fe2 JM |
3361 | if (! TREE_CONSTANT (expr)) |
3362 | { | |
3363 | non_constant: | |
33bd39a2 | 3364 | error ("non-constant `%E' cannot be used as template argument", |
f3400fe2 JM |
3365 | expr); |
3366 | return NULL_TREE; | |
3367 | } | |
75650646 | 3368 | } |
75650646 MM |
3369 | else |
3370 | { | |
c61dce3a GDR |
3371 | if (TYPE_P (expr)) |
3372 | error ("type '%T' cannot be used as a value for a non-type " | |
3373 | "template-parameter", expr); | |
3374 | else if (DECL_P (expr)) | |
3375 | error ("invalid use of '%D' as a non-type template-argument", expr); | |
3376 | else | |
3377 | error ("invalid use of '%E' as a non-type template-argument", expr); | |
3378 | ||
75650646 MM |
3379 | return NULL_TREE; |
3380 | } | |
3381 | ||
3382 | switch (TREE_CODE (type)) | |
3383 | { | |
3384 | case INTEGER_TYPE: | |
3385 | case BOOLEAN_TYPE: | |
3386 | case ENUMERAL_TYPE: | |
3387 | /* For a non-type template-parameter of integral or enumeration | |
3388 | type, integral promotions (_conv.prom_) and integral | |
c6002625 | 3389 | conversions (_conv.integral_) are applied. */ |
75650646 MM |
3390 | if (!INTEGRAL_TYPE_P (expr_type)) |
3391 | return error_mark_node; | |
fddabb2c GB |
3392 | |
3393 | /* [conv.integral] does not allow conversions between two different | |
3394 | enumeration types. */ | |
3395 | if (TREE_CODE (type) == ENUMERAL_TYPE | |
3396 | && TREE_CODE (expr_type) == ENUMERAL_TYPE | |
3397 | && !same_type_ignoring_top_level_qualifiers_p (type, expr_type)) | |
3398 | return error_mark_node; | |
3399 | ||
75650646 MM |
3400 | /* It's safe to call digest_init in this case; we know we're |
3401 | just converting one integral constant expression to another. */ | |
db02b6b9 | 3402 | expr = digest_init (type, expr, (tree*) 0); |
75650646 | 3403 | |
db02b6b9 | 3404 | if (TREE_CODE (expr) != INTEGER_CST) |
f3400fe2 | 3405 | /* Curiously, some TREE_CONSTANT integral expressions do not |
db02b6b9 MM |
3406 | simplify to integer constants. For example, `3 % 0', |
3407 | remains a TRUNC_MOD_EXPR. */ | |
3408 | goto non_constant; | |
3409 | ||
3410 | return expr; | |
a5ac359a MM |
3411 | |
3412 | case OFFSET_TYPE: | |
3413 | { | |
3414 | tree e; | |
3415 | ||
3416 | /* For a non-type template-parameter of type pointer to data | |
3417 | member, qualification conversions (_conv.qual_) are | |
3418 | applied. */ | |
3419 | e = perform_qualification_conversions (type, expr); | |
3420 | if (TREE_CODE (e) == NOP_EXPR) | |
3421 | /* The call to perform_qualification_conversions will | |
3422 | insert a NOP_EXPR over EXPR to do express conversion, | |
3423 | if necessary. But, that will confuse us if we use | |
3424 | this (converted) template parameter to instantiate | |
3425 | another template; then the thing will not look like a | |
3426 | valid template argument. So, just make a new | |
3427 | constant, of the appropriate type. */ | |
3428 | e = make_ptrmem_cst (type, PTRMEM_CST_MEMBER (expr)); | |
3429 | return e; | |
3430 | } | |
3431 | ||
75650646 MM |
3432 | case POINTER_TYPE: |
3433 | { | |
3434 | tree type_pointed_to = TREE_TYPE (type); | |
3435 | ||
a5ac359a | 3436 | if (TREE_CODE (type_pointed_to) == FUNCTION_TYPE) |
75650646 MM |
3437 | { |
3438 | /* For a non-type template-parameter of type pointer to | |
3439 | function, only the function-to-pointer conversion | |
3440 | (_conv.func_) is applied. If the template-argument | |
3441 | represents a set of overloaded functions (or a pointer to | |
3442 | such), the matching function is selected from the set | |
3443 | (_over.over_). */ | |
3444 | tree fns; | |
3445 | tree fn; | |
3446 | ||
7bf2682f | 3447 | if (TREE_CODE (expr) == ADDR_EXPR) |
75650646 MM |
3448 | fns = TREE_OPERAND (expr, 0); |
3449 | else | |
3450 | fns = expr; | |
3451 | ||
c2ea3a40 | 3452 | fn = instantiate_type (type_pointed_to, fns, tf_none); |
75650646 MM |
3453 | |
3454 | if (fn == error_mark_node) | |
3455 | return error_mark_node; | |
3456 | ||
ad50e811 | 3457 | if (!DECL_EXTERNAL_LINKAGE_P (fn)) |
75650646 MM |
3458 | { |
3459 | if (really_overloaded_fn (fns)) | |
3460 | return error_mark_node; | |
3461 | else | |
3462 | goto bad_argument; | |
3463 | } | |
3464 | ||
3465 | expr = build_unary_op (ADDR_EXPR, fn, 0); | |
3466 | ||
3bfdc719 | 3467 | my_friendly_assert (same_type_p (type, TREE_TYPE (expr)), |
75650646 MM |
3468 | 0); |
3469 | return expr; | |
3470 | } | |
3471 | else | |
3472 | { | |
3473 | /* For a non-type template-parameter of type pointer to | |
3474 | object, qualification conversions (_conv.qual_) and the | |
3475 | array-to-pointer conversion (_conv.array_) are applied. | |
3476 | [Note: In particular, neither the null pointer conversion | |
3477 | (_conv.ptr_) nor the derived-to-base conversion | |
3478 | (_conv.ptr_) are applied. Although 0 is a valid | |
3479 | template-argument for a non-type template-parameter of | |
3480 | integral type, it is not a valid template-argument for a | |
e1467ff2 MM |
3481 | non-type template-parameter of pointer type.] |
3482 | ||
3483 | The call to decay_conversion performs the | |
3484 | array-to-pointer conversion, if appropriate. */ | |
3485 | expr = decay_conversion (expr); | |
75650646 MM |
3486 | |
3487 | if (expr == error_mark_node) | |
3488 | return error_mark_node; | |
3489 | else | |
3490 | return perform_qualification_conversions (type, expr); | |
3491 | } | |
3492 | } | |
3493 | break; | |
3494 | ||
3495 | case REFERENCE_TYPE: | |
3496 | { | |
3497 | tree type_referred_to = TREE_TYPE (type); | |
3498 | ||
0dc09a61 | 3499 | /* If this expression already has reference type, get the |
3281be05 | 3500 | underlying object. */ |
0dc09a61 MM |
3501 | if (TREE_CODE (expr_type) == REFERENCE_TYPE) |
3502 | { | |
3281be05 MM |
3503 | if (TREE_CODE (expr) == NOP_EXPR |
3504 | && TREE_CODE (TREE_OPERAND (expr, 0)) == ADDR_EXPR) | |
3505 | STRIP_NOPS (expr); | |
0dc09a61 MM |
3506 | my_friendly_assert (TREE_CODE (expr) == ADDR_EXPR, 20000604); |
3507 | expr = TREE_OPERAND (expr, 0); | |
3508 | expr_type = TREE_TYPE (expr); | |
3509 | } | |
3510 | ||
75650646 MM |
3511 | if (TREE_CODE (type_referred_to) == FUNCTION_TYPE) |
3512 | { | |
3513 | /* For a non-type template-parameter of type reference to | |
39c01e4c MM |
3514 | function, no conversions apply. If the |
3515 | template-argument represents a set of overloaded | |
3516 | functions, the matching function is selected from the | |
3517 | set (_over.over_). */ | |
75650646 MM |
3518 | tree fn; |
3519 | ||
c2ea3a40 | 3520 | fn = instantiate_type (type_referred_to, expr, tf_none); |
e6e174e5 JM |
3521 | |
3522 | if (fn == error_mark_node) | |
3523 | return error_mark_node; | |
75650646 | 3524 | |
ad50e811 | 3525 | if (!DECL_EXTERNAL_LINKAGE_P (fn)) |
75650646 | 3526 | { |
0dc09a61 | 3527 | if (really_overloaded_fn (expr)) |
75650646 MM |
3528 | /* Don't issue an error here; we might get a different |
3529 | function if the overloading had worked out | |
3530 | differently. */ | |
3531 | return error_mark_node; | |
3532 | else | |
3533 | goto bad_argument; | |
3534 | } | |
3535 | ||
3bfdc719 MM |
3536 | my_friendly_assert (same_type_p (type_referred_to, |
3537 | TREE_TYPE (fn)), | |
75650646 MM |
3538 | 0); |
3539 | ||
0dc09a61 | 3540 | expr = fn; |
75650646 MM |
3541 | } |
3542 | else | |
3543 | { | |
3544 | /* For a non-type template-parameter of type reference to | |
3545 | object, no conversions apply. The type referred to by the | |
3546 | reference may be more cv-qualified than the (otherwise | |
3547 | identical) type of the template-argument. The | |
3548 | template-parameter is bound directly to the | |
3549 | template-argument, which must be an lvalue. */ | |
0dc09a61 MM |
3550 | if (!same_type_p (TYPE_MAIN_VARIANT (expr_type), |
3551 | TYPE_MAIN_VARIANT (type_referred_to)) | |
91063b51 MM |
3552 | || !at_least_as_qualified_p (type_referred_to, |
3553 | expr_type) | |
75650646 | 3554 | || !real_lvalue_p (expr)) |
fd74ca0b | 3555 | return error_mark_node; |
75650646 | 3556 | } |
0dc09a61 | 3557 | |
dffd7eb6 | 3558 | cxx_mark_addressable (expr); |
3281be05 | 3559 | return build_nop (type, build_address (expr)); |
75650646 MM |
3560 | } |
3561 | break; | |
3562 | ||
3563 | case RECORD_TYPE: | |
3564 | { | |
db3f4e4e | 3565 | my_friendly_assert (TYPE_PTRMEMFUNC_P (type), 20010112); |
75650646 MM |
3566 | |
3567 | /* For a non-type template-parameter of type pointer to member | |
3568 | function, no conversions apply. If the template-argument | |
3569 | represents a set of overloaded member functions, the | |
3570 | matching member function is selected from the set | |
3571 | (_over.over_). */ | |
3572 | ||
3573 | if (!TYPE_PTRMEMFUNC_P (expr_type) && | |
3574 | expr_type != unknown_type_node) | |
3575 | return error_mark_node; | |
3576 | ||
e08a8f45 | 3577 | if (TREE_CODE (expr) == PTRMEM_CST) |
75650646 MM |
3578 | { |
3579 | /* A ptr-to-member constant. */ | |
3bfdc719 | 3580 | if (!same_type_p (type, expr_type)) |
75650646 MM |
3581 | return error_mark_node; |
3582 | else | |
3583 | return expr; | |
3584 | } | |
3585 | ||
3586 | if (TREE_CODE (expr) != ADDR_EXPR) | |
3587 | return error_mark_node; | |
3588 | ||
c2ea3a40 | 3589 | expr = instantiate_type (type, expr, tf_none); |
75650646 | 3590 | |
d8f8dca1 | 3591 | if (expr == error_mark_node) |
75650646 MM |
3592 | return error_mark_node; |
3593 | ||
59e7a901 GB |
3594 | if (!same_type_p (type, TREE_TYPE (expr))) |
3595 | return error_mark_node; | |
3596 | ||
75650646 MM |
3597 | return expr; |
3598 | } | |
3599 | break; | |
3600 | ||
3601 | default: | |
3602 | /* All non-type parameters must have one of these types. */ | |
a98facb0 | 3603 | abort (); |
75650646 MM |
3604 | break; |
3605 | } | |
3606 | ||
3607 | return error_mark_node; | |
3608 | } | |
3609 | ||
744fac59 KL |
3610 | /* Return 1 if PARM_PARMS and ARG_PARMS matches using rule for |
3611 | template template parameters. Both PARM_PARMS and ARG_PARMS are | |
3612 | vectors of TREE_LIST nodes containing TYPE_DECL, TEMPLATE_DECL | |
3613 | or PARM_DECL. | |
3614 | ||
3615 | ARG_PARMS may contain more parameters than PARM_PARMS. If this is | |
3616 | the case, then extra parameters must have default arguments. | |
3617 | ||
3618 | Consider the example: | |
3619 | template <class T, class Allocator = allocator> class vector; | |
3620 | template<template <class U> class TT> class C; | |
3621 | ||
3622 | C<vector> is a valid instantiation. PARM_PARMS for the above code | |
3623 | contains a TYPE_DECL (for U), ARG_PARMS contains two TYPE_DECLs (for | |
3624 | T and Allocator) and OUTER_ARGS contains the argument that is used to | |
3625 | substitute the TT parameter. */ | |
3626 | ||
3627 | static int | |
3a978d72 NN |
3628 | coerce_template_template_parms (tree parm_parms, |
3629 | tree arg_parms, | |
3630 | tsubst_flags_t complain, | |
3631 | tree in_decl, | |
3632 | tree outer_args) | |
744fac59 KL |
3633 | { |
3634 | int nparms, nargs, i; | |
3635 | tree parm, arg; | |
3636 | ||
3637 | my_friendly_assert (TREE_CODE (parm_parms) == TREE_VEC, 0); | |
3638 | my_friendly_assert (TREE_CODE (arg_parms) == TREE_VEC, 0); | |
3639 | ||
3640 | nparms = TREE_VEC_LENGTH (parm_parms); | |
3641 | nargs = TREE_VEC_LENGTH (arg_parms); | |
3642 | ||
3643 | /* The rule here is opposite of coerce_template_parms. */ | |
3644 | if (nargs < nparms | |
3645 | || (nargs > nparms | |
3646 | && TREE_PURPOSE (TREE_VEC_ELT (arg_parms, nparms)) == NULL_TREE)) | |
3647 | return 0; | |
3648 | ||
3649 | for (i = 0; i < nparms; ++i) | |
3650 | { | |
3651 | parm = TREE_VALUE (TREE_VEC_ELT (parm_parms, i)); | |
3652 | arg = TREE_VALUE (TREE_VEC_ELT (arg_parms, i)); | |
3653 | ||
3654 | if (arg == NULL_TREE || arg == error_mark_node | |
3655 | || parm == NULL_TREE || parm == error_mark_node) | |
3656 | return 0; | |
3657 | ||
3658 | if (TREE_CODE (arg) != TREE_CODE (parm)) | |
3659 | return 0; | |
3660 | ||
3661 | switch (TREE_CODE (parm)) | |
3662 | { | |
3663 | case TYPE_DECL: | |
3664 | break; | |
3665 | ||
3666 | case TEMPLATE_DECL: | |
3667 | /* We encounter instantiations of templates like | |
3668 | template <template <template <class> class> class TT> | |
3669 | class C; */ | |
700466c2 JM |
3670 | { |
3671 | tree parmparm = DECL_INNERMOST_TEMPLATE_PARMS (parm); | |
3672 | tree argparm = DECL_INNERMOST_TEMPLATE_PARMS (arg); | |
3673 | ||
8c6ab2db NS |
3674 | if (!coerce_template_template_parms |
3675 | (parmparm, argparm, complain, in_decl, outer_args)) | |
700466c2 JM |
3676 | return 0; |
3677 | } | |
3678 | break; | |
744fac59 KL |
3679 | |
3680 | case PARM_DECL: | |
3681 | /* The tsubst call is used to handle cases such as | |
00bdb87f KL |
3682 | |
3683 | template <int> class C {}; | |
3684 | template <class T, template <T> class TT> class D {}; | |
3685 | D<int, C> d; | |
3686 | ||
744fac59 | 3687 | i.e. the parameter list of TT depends on earlier parameters. */ |
00bdb87f KL |
3688 | if (!dependent_type_p (TREE_TYPE (arg)) |
3689 | && !same_type_p | |
3690 | (tsubst (TREE_TYPE (parm), outer_args, complain, in_decl), | |
3691 | TREE_TYPE (arg))) | |
744fac59 KL |
3692 | return 0; |
3693 | break; | |
3694 | ||
3695 | default: | |
a98facb0 | 3696 | abort (); |
744fac59 KL |
3697 | } |
3698 | } | |
3699 | return 1; | |
3700 | } | |
3701 | ||
8b5b8b7c MM |
3702 | /* Convert the indicated template ARG as necessary to match the |
3703 | indicated template PARM. Returns the converted ARG, or | |
c2ea3a40 NS |
3704 | error_mark_node if the conversion was unsuccessful. Error and |
3705 | warning messages are issued under control of COMPLAIN. This | |
3706 | conversion is for the Ith parameter in the parameter list. ARGS is | |
3707 | the full set of template arguments deduced so far. */ | |
8b5b8b7c MM |
3708 | |
3709 | static tree | |
3a978d72 NN |
3710 | convert_template_argument (tree parm, |
3711 | tree arg, | |
3712 | tree args, | |
3713 | tsubst_flags_t complain, | |
3714 | int i, | |
3715 | tree in_decl) | |
8b5b8b7c MM |
3716 | { |
3717 | tree val; | |
3718 | tree inner_args; | |
3719 | int is_type, requires_type, is_tmpl_type, requires_tmpl_type; | |
3720 | ||
f9a7ae04 | 3721 | inner_args = INNERMOST_TEMPLATE_ARGS (args); |
8b5b8b7c MM |
3722 | |
3723 | if (TREE_CODE (arg) == TREE_LIST | |
a5ac359a | 3724 | && TREE_CODE (TREE_VALUE (arg)) == OFFSET_REF) |
8b5b8b7c MM |
3725 | { |
3726 | /* The template argument was the name of some | |
3727 | member function. That's usually | |
0e339752 | 3728 | invalid, but static members are OK. In any |
8b5b8b7c MM |
3729 | case, grab the underlying fields/functions |
3730 | and issue an error later if required. */ | |
3731 | arg = TREE_VALUE (arg); | |
3732 | TREE_TYPE (arg) = unknown_type_node; | |
3733 | } | |
3734 | ||
3735 | requires_tmpl_type = TREE_CODE (parm) == TEMPLATE_DECL; | |
3736 | requires_type = (TREE_CODE (parm) == TYPE_DECL | |
3737 | || requires_tmpl_type); | |
3738 | ||
cbd63935 KL |
3739 | is_tmpl_type = ((TREE_CODE (arg) == TEMPLATE_DECL |
3740 | && TREE_CODE (DECL_TEMPLATE_RESULT (arg)) == TYPE_DECL) | |
3741 | || TREE_CODE (arg) == TEMPLATE_TEMPLATE_PARM | |
3742 | || TREE_CODE (arg) == UNBOUND_CLASS_TEMPLATE); | |
303d1c55 | 3743 | |
b8c6534b KL |
3744 | if (is_tmpl_type |
3745 | && (TREE_CODE (arg) == TEMPLATE_TEMPLATE_PARM | |
3746 | || TREE_CODE (arg) == UNBOUND_CLASS_TEMPLATE)) | |
8b5b8b7c | 3747 | arg = TYPE_STUB_DECL (arg); |
8b5b8b7c | 3748 | |
2f939d94 | 3749 | is_type = TYPE_P (arg) || is_tmpl_type; |
8b5b8b7c MM |
3750 | |
3751 | if (requires_type && ! is_type && TREE_CODE (arg) == SCOPE_REF | |
3752 | && TREE_CODE (TREE_OPERAND (arg, 0)) == TEMPLATE_TYPE_PARM) | |
3753 | { | |
33bd39a2 | 3754 | pedwarn ("to refer to a type member of a template parameter, use `typename %E'", arg); |
8b5b8b7c MM |
3755 | |
3756 | arg = make_typename_type (TREE_OPERAND (arg, 0), | |
3baa501d | 3757 | TREE_OPERAND (arg, 1), |
c2ea3a40 | 3758 | complain & tf_error); |
8b5b8b7c MM |
3759 | is_type = 1; |
3760 | } | |
3761 | if (is_type != requires_type) | |
3762 | { | |
3763 | if (in_decl) | |
3764 | { | |
c2ea3a40 | 3765 | if (complain & tf_error) |
8b5b8b7c | 3766 | { |
33bd39a2 | 3767 | error ("type/value mismatch at argument %d in template parameter list for `%D'", |
8b5b8b7c MM |
3768 | i + 1, in_decl); |
3769 | if (is_type) | |
33bd39a2 | 3770 | error (" expected a constant of type `%T', got `%T'", |
8b5b8b7c MM |
3771 | TREE_TYPE (parm), |
3772 | (is_tmpl_type ? DECL_NAME (arg) : arg)); | |
d12a7283 KL |
3773 | else if (requires_tmpl_type) |
3774 | error (" expected a class template, got `%E'", arg); | |
8b5b8b7c | 3775 | else |
33bd39a2 | 3776 | error (" expected a type, got `%E'", arg); |
8b5b8b7c MM |
3777 | } |
3778 | } | |
3779 | return error_mark_node; | |
3780 | } | |
3781 | if (is_tmpl_type ^ requires_tmpl_type) | |
3782 | { | |
c2ea3a40 | 3783 | if (in_decl && (complain & tf_error)) |
8b5b8b7c | 3784 | { |
33bd39a2 | 3785 | error ("type/value mismatch at argument %d in template parameter list for `%D'", |
8b5b8b7c MM |
3786 | i + 1, in_decl); |
3787 | if (is_tmpl_type) | |
33bd39a2 | 3788 | error (" expected a type, got `%T'", DECL_NAME (arg)); |
8b5b8b7c | 3789 | else |
33bd39a2 | 3790 | error (" expected a class template, got `%T'", arg); |
8b5b8b7c MM |
3791 | } |
3792 | return error_mark_node; | |
3793 | } | |
3794 | ||
3795 | if (is_type) | |
3796 | { | |
3797 | if (requires_tmpl_type) | |
3798 | { | |
b8c6534b KL |
3799 | if (TREE_CODE (TREE_TYPE (arg)) == UNBOUND_CLASS_TEMPLATE) |
3800 | /* The number of argument required is not known yet. | |
3801 | Just accept it for now. */ | |
3802 | val = TREE_TYPE (arg); | |
8b5b8b7c MM |
3803 | else |
3804 | { | |
b8c6534b KL |
3805 | tree parmparm = DECL_INNERMOST_TEMPLATE_PARMS (parm); |
3806 | tree argparm = DECL_INNERMOST_TEMPLATE_PARMS (arg); | |
3807 | ||
3808 | if (coerce_template_template_parms (parmparm, argparm, | |
3809 | complain, in_decl, | |
3810 | inner_args)) | |
8b5b8b7c | 3811 | { |
b8c6534b KL |
3812 | val = arg; |
3813 | ||
3814 | /* TEMPLATE_TEMPLATE_PARM node is preferred over | |
3815 | TEMPLATE_DECL. */ | |
3816 | if (val != error_mark_node | |
3817 | && DECL_TEMPLATE_TEMPLATE_PARM_P (val)) | |
3818 | val = TREE_TYPE (val); | |
8b5b8b7c | 3819 | } |
b8c6534b KL |
3820 | else |
3821 | { | |
c2ea3a40 | 3822 | if (in_decl && (complain & tf_error)) |
b8c6534b | 3823 | { |
33bd39a2 | 3824 | error ("type/value mismatch at argument %d in template parameter list for `%D'", |
b8c6534b | 3825 | i + 1, in_decl); |
33bd39a2 | 3826 | error (" expected a template of type `%D', got `%D'", parm, arg); |
b8c6534b | 3827 | } |
8b5b8b7c | 3828 | |
b8c6534b KL |
3829 | val = error_mark_node; |
3830 | } | |
8b5b8b7c MM |
3831 | } |
3832 | } | |
3833 | else | |
058b15c1 | 3834 | val = arg; |
8b5b8b7c MM |
3835 | } |
3836 | else | |
3837 | { | |
4393e105 | 3838 | tree t = tsubst (TREE_TYPE (parm), args, complain, in_decl); |
8b5b8b7c | 3839 | |
11b810f1 | 3840 | if (invalid_nontype_parm_type_p (t, complain)) |
db3f4e4e NS |
3841 | return error_mark_node; |
3842 | ||
d768a589 | 3843 | if (!uses_template_parms (arg) && !uses_template_parms (t)) |
8b5b8b7c MM |
3844 | /* We used to call digest_init here. However, digest_init |
3845 | will report errors, which we don't want when complain | |
3846 | is zero. More importantly, digest_init will try too | |
3847 | hard to convert things: for example, `0' should not be | |
3848 | converted to pointer type at this point according to | |
3849 | the standard. Accepting this is not merely an | |
3850 | extension, since deciding whether or not these | |
3851 | conversions can occur is part of determining which | |
dc957d14 | 3852 | function template to call, or whether a given explicit |
0e339752 | 3853 | argument specification is valid. */ |
8b5b8b7c MM |
3854 | val = convert_nontype_argument (t, arg); |
3855 | else | |
3856 | val = arg; | |
3857 | ||
3858 | if (val == NULL_TREE) | |
3859 | val = error_mark_node; | |
c2ea3a40 | 3860 | else if (val == error_mark_node && (complain & tf_error)) |
33bd39a2 | 3861 | error ("could not convert template argument `%E' to `%T'", |
8b5b8b7c MM |
3862 | arg, t); |
3863 | } | |
3864 | ||
3865 | return val; | |
3866 | } | |
3867 | ||
3868 | /* Convert all template arguments to their appropriate types, and | |
3869 | return a vector containing the innermost resulting template | |
c2ea3a40 | 3870 | arguments. If any error occurs, return error_mark_node. Error and |
3e4a3562 | 3871 | warning messages are issued under control of COMPLAIN. |
75650646 | 3872 | |
838dfd8a | 3873 | If REQUIRE_ALL_ARGUMENTS is nonzero, all arguments must be |
75650646 MM |
3874 | provided in ARGLIST, or else trailing parameters must have default |
3875 | values. If REQUIRE_ALL_ARGUMENTS is zero, we will attempt argument | |
6dfbb909 | 3876 | deduction for any unspecified trailing arguments. */ |
de575009 | 3877 | |
8d08fdba | 3878 | static tree |
3a978d72 NN |
3879 | coerce_template_parms (tree parms, |
3880 | tree args, | |
3881 | tree in_decl, | |
3882 | tsubst_flags_t complain, | |
3883 | int require_all_arguments) | |
8d08fdba | 3884 | { |
a292b002 | 3885 | int nparms, nargs, i, lost = 0; |
e4a84209 | 3886 | tree inner_args; |
8b5b8b7c MM |
3887 | tree new_args; |
3888 | tree new_inner_args; | |
a292b002 | 3889 | |
f9a7ae04 | 3890 | inner_args = INNERMOST_TEMPLATE_ARGS (args); |
bf12d54d | 3891 | nargs = inner_args ? NUM_TMPL_ARGS (inner_args) : 0; |
a292b002 MS |
3892 | nparms = TREE_VEC_LENGTH (parms); |
3893 | ||
3894 | if (nargs > nparms | |
3895 | || (nargs < nparms | |
75650646 | 3896 | && require_all_arguments |
a292b002 | 3897 | && TREE_PURPOSE (TREE_VEC_ELT (parms, nargs)) == NULL_TREE)) |
8d08fdba | 3898 | { |
c2ea3a40 | 3899 | if (complain & tf_error) |
75650646 | 3900 | { |
33bd39a2 | 3901 | error ("wrong number of template arguments (%d, should be %d)", |
e4a84209 | 3902 | nargs, nparms); |
75650646 MM |
3903 | |
3904 | if (in_decl) | |
8251199e | 3905 | cp_error_at ("provided for `%D'", in_decl); |
75650646 MM |
3906 | } |
3907 | ||
8d08fdba MS |
3908 | return error_mark_node; |
3909 | } | |
3910 | ||
f31c0a32 | 3911 | new_inner_args = make_tree_vec (nparms); |
8b5b8b7c MM |
3912 | new_args = add_outermost_template_args (args, new_inner_args); |
3913 | for (i = 0; i < nparms; i++) | |
8d08fdba | 3914 | { |
8b5b8b7c MM |
3915 | tree arg; |
3916 | tree parm; | |
e4a84209 | 3917 | |
8b5b8b7c MM |
3918 | /* Get the Ith template parameter. */ |
3919 | parm = TREE_VEC_ELT (parms, i); | |
75650646 | 3920 | |
8b5b8b7c | 3921 | /* Calculate the Ith argument. */ |
bf12d54d | 3922 | if (i < nargs) |
8b5b8b7c | 3923 | arg = TREE_VEC_ELT (inner_args, i); |
ffd49b19 | 3924 | else if (require_all_arguments) |
04c06002 | 3925 | /* There must be a default arg in this case. */ |
a91db711 NS |
3926 | arg = tsubst_template_arg (TREE_PURPOSE (parm), new_args, |
3927 | complain, in_decl); | |
ffd49b19 NS |
3928 | else |
3929 | break; | |
3930 | ||
3931 | my_friendly_assert (arg, 20030727); | |
3932 | if (arg == error_mark_node) | |
3933 | error ("template argument %d is invalid", i + 1); | |
8b5b8b7c MM |
3934 | else |
3935 | arg = convert_template_argument (TREE_VALUE (parm), | |
3936 | arg, new_args, complain, i, | |
3937 | in_decl); | |
3938 | ||
3939 | if (arg == error_mark_node) | |
8d08fdba | 3940 | lost++; |
8b5b8b7c | 3941 | TREE_VEC_ELT (new_inner_args, i) = arg; |
8d08fdba | 3942 | } |
8b5b8b7c | 3943 | |
8d08fdba MS |
3944 | if (lost) |
3945 | return error_mark_node; | |
8b5b8b7c MM |
3946 | |
3947 | return new_inner_args; | |
8d08fdba MS |
3948 | } |
3949 | ||
34016c81 JM |
3950 | /* Returns 1 if template args OT and NT are equivalent. */ |
3951 | ||
d8e178a0 | 3952 | static int |
3a978d72 | 3953 | template_args_equal (tree ot, tree nt) |
34016c81 JM |
3954 | { |
3955 | if (nt == ot) | |
3956 | return 1; | |
74601d7c | 3957 | |
34016c81 JM |
3958 | if (TREE_CODE (nt) == TREE_VEC) |
3959 | /* For member templates */ | |
74601d7c KL |
3960 | return TREE_CODE (ot) == TREE_VEC && comp_template_args (ot, nt); |
3961 | else if (TYPE_P (nt)) | |
3962 | return TYPE_P (ot) && same_type_p (ot, nt); | |
3963 | else if (TREE_CODE (ot) == TREE_VEC || TYPE_P (ot)) | |
3964 | return 0; | |
34016c81 | 3965 | else |
c8a209ca | 3966 | return cp_tree_equal (ot, nt); |
34016c81 JM |
3967 | } |
3968 | ||
3969 | /* Returns 1 iff the OLDARGS and NEWARGS are in fact identical sets | |
f84b4be9 JM |
3970 | of template arguments. Returns 0 otherwise. */ |
3971 | ||
6757edfe | 3972 | int |
3a978d72 | 3973 | comp_template_args (tree oldargs, tree newargs) |
5566b478 MS |
3974 | { |
3975 | int i; | |
3976 | ||
386b8a85 JM |
3977 | if (TREE_VEC_LENGTH (oldargs) != TREE_VEC_LENGTH (newargs)) |
3978 | return 0; | |
3979 | ||
5566b478 MS |
3980 | for (i = 0; i < TREE_VEC_LENGTH (oldargs); ++i) |
3981 | { | |
3982 | tree nt = TREE_VEC_ELT (newargs, i); | |
3983 | tree ot = TREE_VEC_ELT (oldargs, i); | |
3984 | ||
34016c81 | 3985 | if (! template_args_equal (ot, nt)) |
61a127b3 | 3986 | return 0; |
5566b478 MS |
3987 | } |
3988 | return 1; | |
3989 | } | |
3990 | ||
8d08fdba MS |
3991 | /* Given class template name and parameter list, produce a user-friendly name |
3992 | for the instantiation. */ | |
e92cc029 | 3993 | |
8d08fdba | 3994 | static char * |
3a978d72 | 3995 | mangle_class_name_for_template (const char* name, tree parms, tree arglist) |
8d08fdba MS |
3996 | { |
3997 | static struct obstack scratch_obstack; | |
3998 | static char *scratch_firstobj; | |
3999 | int i, nparms; | |
8d08fdba MS |
4000 | |
4001 | if (!scratch_firstobj) | |
fc378698 | 4002 | gcc_obstack_init (&scratch_obstack); |
8d08fdba MS |
4003 | else |
4004 | obstack_free (&scratch_obstack, scratch_firstobj); | |
fc378698 | 4005 | scratch_firstobj = obstack_alloc (&scratch_obstack, 1); |
8d08fdba | 4006 | |
18e314ad GS |
4007 | #define ccat(C) obstack_1grow (&scratch_obstack, (C)); |
4008 | #define cat(S) obstack_grow (&scratch_obstack, (S), strlen (S)) | |
8d08fdba MS |
4009 | |
4010 | cat (name); | |
4011 | ccat ('<'); | |
4012 | nparms = TREE_VEC_LENGTH (parms); | |
f9a7ae04 | 4013 | arglist = INNERMOST_TEMPLATE_ARGS (arglist); |
8d08fdba MS |
4014 | my_friendly_assert (nparms == TREE_VEC_LENGTH (arglist), 268); |
4015 | for (i = 0; i < nparms; i++) | |
4016 | { | |
a292b002 MS |
4017 | tree parm = TREE_VALUE (TREE_VEC_ELT (parms, i)); |
4018 | tree arg = TREE_VEC_ELT (arglist, i); | |
8d08fdba MS |
4019 | |
4020 | if (i) | |
4021 | ccat (','); | |
4022 | ||
a292b002 | 4023 | if (TREE_CODE (parm) == TYPE_DECL) |
8d08fdba | 4024 | { |
761f0855 | 4025 | cat (type_as_string (arg, TFF_CHASE_TYPEDEF)); |
8d08fdba MS |
4026 | continue; |
4027 | } | |
73b0fce8 KL |
4028 | else if (TREE_CODE (parm) == TEMPLATE_DECL) |
4029 | { | |
4030 | if (TREE_CODE (arg) == TEMPLATE_DECL) | |
2c73f9f5 ML |
4031 | { |
4032 | /* Already substituted with real template. Just output | |
4033 | the template name here */ | |
cb0dbb9a | 4034 | tree context = DECL_CONTEXT (arg); |
ec4f972f AS |
4035 | if (context) |
4036 | { | |
4037 | /* The template may be defined in a namespace, or | |
4038 | may be a member template. */ | |
4039 | my_friendly_assert (TREE_CODE (context) == NAMESPACE_DECL | |
4040 | || CLASS_TYPE_P (context), | |
4041 | 980422); | |
761f0855 | 4042 | cat(decl_as_string (DECL_CONTEXT (arg), TFF_PLAIN_IDENTIFIER)); |
2c73f9f5 ML |
4043 | cat("::"); |
4044 | } | |
4045 | cat (IDENTIFIER_POINTER (DECL_NAME (arg))); | |
4046 | } | |
73b0fce8 | 4047 | else |
f4f206f4 | 4048 | /* Output the parameter declaration. */ |
761f0855 | 4049 | cat (type_as_string (arg, TFF_CHASE_TYPEDEF)); |
73b0fce8 KL |
4050 | continue; |
4051 | } | |
8d08fdba MS |
4052 | else |
4053 | my_friendly_assert (TREE_CODE (parm) == PARM_DECL, 269); | |
4054 | ||
8d08fdba MS |
4055 | /* No need to check arglist against parmlist here; we did that |
4056 | in coerce_template_parms, called from lookup_template_class. */ | |
761f0855 | 4057 | cat (expr_as_string (arg, TFF_PLAIN_IDENTIFIER)); |
8d08fdba MS |
4058 | } |
4059 | { | |
4060 | char *bufp = obstack_next_free (&scratch_obstack); | |
4061 | int offset = 0; | |
4062 | while (bufp[offset - 1] == ' ') | |
4063 | offset--; | |
4064 | obstack_blank_fast (&scratch_obstack, offset); | |
4065 | ||
4066 | /* B<C<char> >, not B<C<char>> */ | |
4067 | if (bufp[offset - 1] == '>') | |
4068 | ccat (' '); | |
4069 | } | |
4070 | ccat ('>'); | |
4071 | ccat ('\0'); | |
4072 | return (char *) obstack_base (&scratch_obstack); | |
8d08fdba MS |
4073 | } |
4074 | ||
bd6dd845 | 4075 | static tree |
3a978d72 | 4076 | classtype_mangled_name (tree t) |
5566b478 MS |
4077 | { |
4078 | if (CLASSTYPE_TEMPLATE_INFO (t) | |
36a117a5 MM |
4079 | /* Specializations have already had their names set up in |
4080 | lookup_template_class. */ | |
370af2d5 | 4081 | && !CLASSTYPE_TEMPLATE_SPECIALIZATION (t)) |
9fbf56f7 MM |
4082 | { |
4083 | tree tmpl = most_general_template (CLASSTYPE_TI_TEMPLATE (t)); | |
4084 | ||
36a117a5 MM |
4085 | /* For non-primary templates, the template parameters are |
4086 | implicit from their surrounding context. */ | |
9fbf56f7 MM |
4087 | if (PRIMARY_TEMPLATE_P (tmpl)) |
4088 | { | |
4089 | tree name = DECL_NAME (tmpl); | |
4090 | char *mangled_name = mangle_class_name_for_template | |
4091 | (IDENTIFIER_POINTER (name), | |
4092 | DECL_INNERMOST_TEMPLATE_PARMS (tmpl), | |
4093 | CLASSTYPE_TI_ARGS (t)); | |
4094 | tree id = get_identifier (mangled_name); | |
4095 | IDENTIFIER_TEMPLATE (id) = name; | |
4096 | return id; | |
4097 | } | |
5566b478 | 4098 | } |
9fbf56f7 MM |
4099 | |
4100 | return TYPE_IDENTIFIER (t); | |
5566b478 MS |
4101 | } |
4102 | ||
4103 | static void | |
3a978d72 | 4104 | add_pending_template (tree d) |
5566b478 | 4105 | { |
3ae18eaf JM |
4106 | tree ti = (TYPE_P (d) |
4107 | ? CLASSTYPE_TEMPLATE_INFO (d) | |
4108 | : DECL_TEMPLATE_INFO (d)); | |
46ccf50a | 4109 | tree pt; |
3ae18eaf | 4110 | int level; |
e92cc029 | 4111 | |
824b9a4c | 4112 | if (TI_PENDING_TEMPLATE_FLAG (ti)) |
5566b478 MS |
4113 | return; |
4114 | ||
3ae18eaf JM |
4115 | /* We are called both from instantiate_decl, where we've already had a |
4116 | tinst_level pushed, and instantiate_template, where we haven't. | |
4117 | Compensate. */ | |
4118 | level = !(current_tinst_level && TINST_DECL (current_tinst_level) == d); | |
4119 | ||
4120 | if (level) | |
4121 | push_tinst_level (d); | |
4122 | ||
46ccf50a JM |
4123 | pt = tree_cons (current_tinst_level, d, NULL_TREE); |
4124 | if (last_pending_template) | |
4125 | TREE_CHAIN (last_pending_template) = pt; | |
4126 | else | |
4127 | pending_templates = pt; | |
4128 | ||
4129 | last_pending_template = pt; | |
4130 | ||
824b9a4c | 4131 | TI_PENDING_TEMPLATE_FLAG (ti) = 1; |
3ae18eaf JM |
4132 | |
4133 | if (level) | |
4134 | pop_tinst_level (); | |
5566b478 MS |
4135 | } |
4136 | ||
386b8a85 | 4137 | |
4ba126e4 MM |
4138 | /* Return a TEMPLATE_ID_EXPR corresponding to the indicated FNS and |
4139 | ARGLIST. Valid choices for FNS are given in the cp-tree.def | |
4140 | documentation for TEMPLATE_ID_EXPR. */ | |
386b8a85 JM |
4141 | |
4142 | tree | |
3a978d72 | 4143 | lookup_template_function (tree fns, tree arglist) |
386b8a85 | 4144 | { |
2c73f9f5 | 4145 | tree type; |
050367a3 | 4146 | |
4ba126e4 MM |
4147 | if (fns == error_mark_node || arglist == error_mark_node) |
4148 | return error_mark_node; | |
4149 | ||
bf12d54d | 4150 | my_friendly_assert (!arglist || TREE_CODE (arglist) == TREE_VEC, 20030726); |
ceeae2d1 MM |
4151 | if (fns == NULL_TREE |
4152 | || TREE_CODE (fns) == FUNCTION_DECL) | |
386b8a85 | 4153 | { |
33bd39a2 | 4154 | error ("non-template used as template"); |
386b8a85 JM |
4155 | return error_mark_node; |
4156 | } | |
4157 | ||
4ba126e4 MM |
4158 | my_friendly_assert (TREE_CODE (fns) == TEMPLATE_DECL |
4159 | || TREE_CODE (fns) == OVERLOAD | |
50ad9642 | 4160 | || BASELINK_P (fns) |
10b1d5e7 | 4161 | || TREE_CODE (fns) == IDENTIFIER_NODE, |
4ba126e4 MM |
4162 | 20020730); |
4163 | ||
50ad9642 MM |
4164 | if (BASELINK_P (fns)) |
4165 | { | |
f293ce4b RS |
4166 | BASELINK_FUNCTIONS (fns) = build2 (TEMPLATE_ID_EXPR, |
4167 | unknown_type_node, | |
4168 | BASELINK_FUNCTIONS (fns), | |
4169 | arglist); | |
50ad9642 MM |
4170 | return fns; |
4171 | } | |
4172 | ||
2c73f9f5 ML |
4173 | type = TREE_TYPE (fns); |
4174 | if (TREE_CODE (fns) == OVERLOAD || !type) | |
4175 | type = unknown_type_node; | |
4ba126e4 | 4176 | |
f293ce4b | 4177 | return build2 (TEMPLATE_ID_EXPR, type, fns, arglist); |
386b8a85 JM |
4178 | } |
4179 | ||
a2b60a0e MM |
4180 | /* Within the scope of a template class S<T>, the name S gets bound |
4181 | (in build_self_reference) to a TYPE_DECL for the class, not a | |
4182 | TEMPLATE_DECL. If DECL is a TYPE_DECL for current_class_type, | |
4183 | or one of its enclosing classes, and that type is a template, | |
4184 | return the associated TEMPLATE_DECL. Otherwise, the original | |
4185 | DECL is returned. */ | |
4186 | ||
a723baf1 | 4187 | tree |
3a978d72 | 4188 | maybe_get_template_decl_from_type_decl (tree decl) |
a2b60a0e MM |
4189 | { |
4190 | return (decl != NULL_TREE | |
4191 | && TREE_CODE (decl) == TYPE_DECL | |
4192 | && DECL_ARTIFICIAL (decl) | |
511b60ff | 4193 | && CLASS_TYPE_P (TREE_TYPE (decl)) |
a2b60a0e MM |
4194 | && CLASSTYPE_TEMPLATE_INFO (TREE_TYPE (decl))) |
4195 | ? CLASSTYPE_TI_TEMPLATE (TREE_TYPE (decl)) : decl; | |
4196 | } | |
386b8a85 | 4197 | |
8d08fdba MS |
4198 | /* Given an IDENTIFIER_NODE (type TEMPLATE_DECL) and a chain of |
4199 | parameters, find the desired type. | |
4200 | ||
4201 | D1 is the PTYPENAME terminal, and ARGLIST is the list of arguments. | |
8d08fdba MS |
4202 | |
4203 | IN_DECL, if non-NULL, is the template declaration we are trying to | |
75650646 MM |
4204 | instantiate. |
4205 | ||
838dfd8a | 4206 | If ENTERING_SCOPE is nonzero, we are about to enter the scope of |
36a117a5 | 4207 | the class we are looking up. |
f9c244b8 | 4208 | |
c2ea3a40 | 4209 | Issue error and warning messages under control of COMPLAIN. |
36a117a5 | 4210 | |
75650646 MM |
4211 | If the template class is really a local class in a template |
4212 | function, then the FUNCTION_CONTEXT is the function in which it is | |
4213 | being instantiated. */ | |
e92cc029 | 4214 | |
8d08fdba | 4215 | tree |
3a978d72 NN |
4216 | lookup_template_class (tree d1, |
4217 | tree arglist, | |
4218 | tree in_decl, | |
4219 | tree context, | |
4220 | int entering_scope, | |
4221 | tsubst_flags_t complain) | |
8d08fdba | 4222 | { |
a703fb38 | 4223 | tree template = NULL_TREE, parmlist; |
dbfe2124 | 4224 | tree t; |
42eaed49 | 4225 | |
fd295cb2 | 4226 | timevar_push (TV_NAME_LOOKUP); |
42eaed49 | 4227 | |
5566b478 MS |
4228 | if (TREE_CODE (d1) == IDENTIFIER_NODE) |
4229 | { | |
90ea9897 MM |
4230 | tree value = innermost_non_namespace_value (d1); |
4231 | if (value && DECL_TEMPLATE_TEMPLATE_PARM_P (value)) | |
4232 | template = value; | |
73b0fce8 KL |
4233 | else |
4234 | { | |
2c73f9f5 ML |
4235 | if (context) |
4236 | push_decl_namespace (context); | |
3ebc5c52 MM |
4237 | template = lookup_name (d1, /*prefer_type=*/0); |
4238 | template = maybe_get_template_decl_from_type_decl (template); | |
2c73f9f5 ML |
4239 | if (context) |
4240 | pop_decl_namespace (); | |
73b0fce8 | 4241 | } |
8d019cef JM |
4242 | if (template) |
4243 | context = DECL_CONTEXT (template); | |
5566b478 | 4244 | } |
c91a56d2 MS |
4245 | else if (TREE_CODE (d1) == TYPE_DECL && IS_AGGR_TYPE (TREE_TYPE (d1))) |
4246 | { | |
802dbc34 JM |
4247 | tree type = TREE_TYPE (d1); |
4248 | ||
4249 | /* If we are declaring a constructor, say A<T>::A<T>, we will get | |
4250 | an implicit typename for the second A. Deal with it. */ | |
4251 | if (TREE_CODE (type) == TYPENAME_TYPE && TREE_TYPE (type)) | |
4252 | type = TREE_TYPE (type); | |
4253 | ||
4254 | if (CLASSTYPE_TEMPLATE_INFO (type)) | |
f3400fe2 | 4255 | { |
802dbc34 | 4256 | template = CLASSTYPE_TI_TEMPLATE (type); |
f3400fe2 JM |
4257 | d1 = DECL_NAME (template); |
4258 | } | |
c91a56d2 | 4259 | } |
ed44da02 | 4260 | else if (TREE_CODE (d1) == ENUMERAL_TYPE |
2f939d94 | 4261 | || (TYPE_P (d1) && IS_AGGR_TYPE (d1))) |
5566b478 | 4262 | { |
ed44da02 | 4263 | template = TYPE_TI_TEMPLATE (d1); |
5566b478 MS |
4264 | d1 = DECL_NAME (template); |
4265 | } | |
93cdc044 | 4266 | else if (TREE_CODE (d1) == TEMPLATE_DECL |
17aec3eb | 4267 | && TREE_CODE (DECL_TEMPLATE_RESULT (d1)) == TYPE_DECL) |
93cdc044 JM |
4268 | { |
4269 | template = d1; | |
4270 | d1 = DECL_NAME (template); | |
4271 | context = DECL_CONTEXT (template); | |
4272 | } | |
8d08fdba | 4273 | |
90ea9897 | 4274 | /* Issue an error message if we didn't find a template. */ |
8d08fdba | 4275 | if (! template) |
f3400fe2 | 4276 | { |
c2ea3a40 | 4277 | if (complain & tf_error) |
33bd39a2 | 4278 | error ("`%T' is not a template", d1); |
fd295cb2 | 4279 | POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, error_mark_node); |
f3400fe2 | 4280 | } |
2c73f9f5 | 4281 | |
a87b4257 | 4282 | if (TREE_CODE (template) != TEMPLATE_DECL |
42eaed49 NS |
4283 | /* Make sure it's a user visible template, if it was named by |
4284 | the user. */ | |
4285 | || ((complain & tf_user) && !DECL_TEMPLATE_PARM_P (template) | |
4286 | && !PRIMARY_TEMPLATE_P (template))) | |
8d08fdba | 4287 | { |
c2ea3a40 | 4288 | if (complain & tf_error) |
f9c244b8 | 4289 | { |
33bd39a2 | 4290 | error ("non-template type `%T' used as a template", d1); |
f9c244b8 NS |
4291 | if (in_decl) |
4292 | cp_error_at ("for template declaration `%D'", in_decl); | |
4293 | } | |
fd295cb2 | 4294 | POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, error_mark_node); |
8d08fdba | 4295 | } |
8d08fdba | 4296 | |
42eaed49 NS |
4297 | complain &= ~tf_user; |
4298 | ||
73b0fce8 KL |
4299 | if (DECL_TEMPLATE_TEMPLATE_PARM_P (template)) |
4300 | { | |
4301 | /* Create a new TEMPLATE_DECL and TEMPLATE_TEMPLATE_PARM node to store | |
4302 | template arguments */ | |
4303 | ||
1899c3a4 | 4304 | tree parm; |
73b0fce8 KL |
4305 | tree arglist2; |
4306 | ||
73b0fce8 KL |
4307 | parmlist = DECL_INNERMOST_TEMPLATE_PARMS (template); |
4308 | ||
4f96ff63 KL |
4309 | /* Consider an example where a template template parameter declared as |
4310 | ||
4311 | template <class T, class U = std::allocator<T> > class TT | |
4312 | ||
4313 | The template parameter level of T and U are one level larger than | |
4314 | of TT. To proper process the default argument of U, say when an | |
4315 | instantiation `TT<int>' is seen, we need to build the full | |
342cea95 KL |
4316 | arguments containing {int} as the innermost level. Outer levels, |
4317 | available when not appearing as default template argument, can be | |
4318 | obtained from `current_template_args ()'. | |
4f96ff63 | 4319 | |
342cea95 KL |
4320 | Suppose that TT is later substituted with std::vector. The above |
4321 | instantiation is `TT<int, std::allocator<T> >' with TT at | |
4322 | level 1, and T at level 2, while the template arguments at level 1 | |
4323 | becomes {std::vector} and the inner level 2 is {int}. */ | |
4324 | ||
4325 | if (current_template_parms) | |
4f96ff63 KL |
4326 | arglist = add_to_template_args (current_template_args (), arglist); |
4327 | ||
f9c244b8 NS |
4328 | arglist2 = coerce_template_parms (parmlist, arglist, template, |
4329 | complain, /*require_all_args=*/1); | |
3e4a3562 | 4330 | if (arglist2 == error_mark_node |
544aef8c | 4331 | || (!uses_template_parms (arglist2) |
3e4a3562 | 4332 | && check_instantiated_args (template, arglist2, complain))) |
fd295cb2 | 4333 | POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, error_mark_node); |
73b0fce8 | 4334 | |
dac65501 | 4335 | parm = bind_template_template_parm (TREE_TYPE (template), arglist2); |
fd295cb2 | 4336 | POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, parm); |
73b0fce8 | 4337 | } |
36a117a5 | 4338 | else |
8d08fdba | 4339 | { |
36a117a5 | 4340 | tree template_type = TREE_TYPE (template); |
7ac7b28f | 4341 | tree gen_tmpl; |
36a117a5 MM |
4342 | tree type_decl; |
4343 | tree found = NULL_TREE; | |
414ea4aa | 4344 | tree *tp; |
36a117a5 MM |
4345 | int arg_depth; |
4346 | int parm_depth; | |
dbfe2124 | 4347 | int is_partial_instantiation; |
830bfa74 | 4348 | |
7ac7b28f MM |
4349 | gen_tmpl = most_general_template (template); |
4350 | parmlist = DECL_TEMPLATE_PARMS (gen_tmpl); | |
36a117a5 MM |
4351 | parm_depth = TMPL_PARMS_DEPTH (parmlist); |
4352 | arg_depth = TMPL_ARGS_DEPTH (arglist); | |
4353 | ||
4354 | if (arg_depth == 1 && parm_depth > 1) | |
4355 | { | |
39c01e4c | 4356 | /* We've been given an incomplete set of template arguments. |
36a117a5 MM |
4357 | For example, given: |
4358 | ||
4359 | template <class T> struct S1 { | |
4360 | template <class U> struct S2 {}; | |
4361 | template <class U> struct S2<U*> {}; | |
4362 | }; | |
4363 | ||
4364 | we will be called with an ARGLIST of `U*', but the | |
4365 | TEMPLATE will be `template <class T> template | |
4366 | <class U> struct S1<T>::S2'. We must fill in the missing | |
4367 | arguments. */ | |
7ac7b28f MM |
4368 | arglist |
4369 | = add_outermost_template_args (TYPE_TI_ARGS (TREE_TYPE (template)), | |
4370 | arglist); | |
36a117a5 MM |
4371 | arg_depth = TMPL_ARGS_DEPTH (arglist); |
4372 | } | |
5566b478 | 4373 | |
41f5d4b1 | 4374 | /* Now we should have enough arguments. */ |
36a117a5 MM |
4375 | my_friendly_assert (parm_depth == arg_depth, 0); |
4376 | ||
7ac7b28f MM |
4377 | /* From here on, we're only interested in the most general |
4378 | template. */ | |
4379 | template = gen_tmpl; | |
4380 | ||
36a117a5 MM |
4381 | /* Calculate the BOUND_ARGS. These will be the args that are |
4382 | actually tsubst'd into the definition to create the | |
4383 | instantiation. */ | |
4384 | if (parm_depth > 1) | |
830bfa74 MM |
4385 | { |
4386 | /* We have multiple levels of arguments to coerce, at once. */ | |
830bfa74 | 4387 | int i; |
e4a84209 | 4388 | int saved_depth = TMPL_ARGS_DEPTH (arglist); |
36a117a5 | 4389 | |
f31c0a32 | 4390 | tree bound_args = make_tree_vec (parm_depth); |
830bfa74 | 4391 | |
e4a84209 | 4392 | for (i = saved_depth, |
830bfa74 | 4393 | t = DECL_TEMPLATE_PARMS (template); |
e4a84209 | 4394 | i > 0 && t != NULL_TREE; |
830bfa74 | 4395 | --i, t = TREE_CHAIN (t)) |
e4a84209 | 4396 | { |
ee3071ef NS |
4397 | tree a = coerce_template_parms (TREE_VALUE (t), |
4398 | arglist, template, | |
4399 | complain, /*require_all_args=*/1); | |
88e98cfe KL |
4400 | |
4401 | /* Don't process further if one of the levels fails. */ | |
4402 | if (a == error_mark_node) | |
4403 | { | |
4404 | /* Restore the ARGLIST to its full size. */ | |
4405 | TREE_VEC_LENGTH (arglist) = saved_depth; | |
4406 | POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, error_mark_node); | |
4407 | } | |
4408 | ||
e4a84209 MM |
4409 | SET_TMPL_ARGS_LEVEL (bound_args, i, a); |
4410 | ||
4411 | /* We temporarily reduce the length of the ARGLIST so | |
4412 | that coerce_template_parms will see only the arguments | |
4413 | corresponding to the template parameters it is | |
4414 | examining. */ | |
4415 | TREE_VEC_LENGTH (arglist)--; | |
4416 | } | |
4417 | ||
4418 | /* Restore the ARGLIST to its full size. */ | |
4419 | TREE_VEC_LENGTH (arglist) = saved_depth; | |
4420 | ||
36a117a5 | 4421 | arglist = bound_args; |
830bfa74 MM |
4422 | } |
4423 | else | |
36a117a5 MM |
4424 | arglist |
4425 | = coerce_template_parms (INNERMOST_TEMPLATE_PARMS (parmlist), | |
f9a7ae04 | 4426 | INNERMOST_TEMPLATE_ARGS (arglist), |
f9c244b8 NS |
4427 | template, |
4428 | complain, /*require_all_args=*/1); | |
36a117a5 | 4429 | |
c353b8e3 | 4430 | if (arglist == error_mark_node) |
36a117a5 | 4431 | /* We were unable to bind the arguments. */ |
fd295cb2 | 4432 | POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, error_mark_node); |
5566b478 | 4433 | |
36a117a5 MM |
4434 | /* In the scope of a template class, explicit references to the |
4435 | template class refer to the type of the template, not any | |
4436 | instantiation of it. For example, in: | |
4437 | ||
4438 | template <class T> class C { void f(C<T>); } | |
4439 | ||
4440 | the `C<T>' is just the same as `C'. Outside of the | |
4441 | class, however, such a reference is an instantiation. */ | |
ed44da02 | 4442 | if (comp_template_args (TYPE_TI_ARGS (template_type), |
36a117a5 MM |
4443 | arglist)) |
4444 | { | |
4445 | found = template_type; | |
4446 | ||
4447 | if (!entering_scope && PRIMARY_TEMPLATE_P (template)) | |
5566b478 | 4448 | { |
36a117a5 MM |
4449 | tree ctx; |
4450 | ||
36a117a5 | 4451 | for (ctx = current_class_type; |
5f04800c KL |
4452 | ctx && TREE_CODE (ctx) != NAMESPACE_DECL; |
4453 | ctx = (TYPE_P (ctx) | |
4454 | ? TYPE_CONTEXT (ctx) | |
4455 | : DECL_CONTEXT (ctx))) | |
4456 | if (TYPE_P (ctx) && same_type_p (ctx, template_type)) | |
4457 | goto found_ctx; | |
36a117a5 | 4458 | |
6df5158a NS |
4459 | /* We're not in the scope of the class, so the |
4460 | TEMPLATE_TYPE is not the type we want after all. */ | |
4461 | found = NULL_TREE; | |
4462 | found_ctx:; | |
5566b478 MS |
4463 | } |
4464 | } | |
36a117a5 | 4465 | if (found) |
fd295cb2 | 4466 | POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, found); |
414ea4aa MM |
4467 | |
4468 | for (tp = &DECL_TEMPLATE_INSTANTIATIONS (template); | |
4469 | *tp; | |
4470 | tp = &TREE_CHAIN (*tp)) | |
4471 | if (comp_template_args (TREE_PURPOSE (*tp), arglist)) | |
4472 | { | |
4473 | found = *tp; | |
7e7d9517 MM |
4474 | |
4475 | /* Use the move-to-front heuristic to speed up future | |
4476 | searches. */ | |
414ea4aa MM |
4477 | *tp = TREE_CHAIN (*tp); |
4478 | TREE_CHAIN (found) | |
4479 | = DECL_TEMPLATE_INSTANTIATIONS (template); | |
4480 | DECL_TEMPLATE_INSTANTIATIONS (template) = found; | |
7e7d9517 | 4481 | |
fd295cb2 | 4482 | POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, TREE_VALUE (found)); |
414ea4aa | 4483 | } |
5566b478 | 4484 | |
dbfe2124 | 4485 | /* This type is a "partial instantiation" if any of the template |
ab097535 | 4486 | arguments still involve template parameters. Note that we set |
486e4077 MM |
4487 | IS_PARTIAL_INSTANTIATION for partial specializations as |
4488 | well. */ | |
dbfe2124 MM |
4489 | is_partial_instantiation = uses_template_parms (arglist); |
4490 | ||
c353b8e3 MM |
4491 | /* If the deduced arguments are invalid, then the binding |
4492 | failed. */ | |
4493 | if (!is_partial_instantiation | |
4494 | && check_instantiated_args (template, | |
4495 | INNERMOST_TEMPLATE_ARGS (arglist), | |
4496 | complain)) | |
4497 | POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, error_mark_node); | |
4498 | ||
3ebc5c52 MM |
4499 | if (!is_partial_instantiation |
4500 | && !PRIMARY_TEMPLATE_P (template) | |
4501 | && TREE_CODE (CP_DECL_CONTEXT (template)) == NAMESPACE_DECL) | |
4502 | { | |
3ebc5c52 MM |
4503 | found = xref_tag_from_type (TREE_TYPE (template), |
4504 | DECL_NAME (template), | |
4505 | /*globalize=*/1); | |
fd295cb2 | 4506 | POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, found); |
3ebc5c52 | 4507 | } |
3ebc5c52 | 4508 | |
95ee998c | 4509 | context = tsubst (DECL_CONTEXT (template), arglist, |
c2ea3a40 | 4510 | complain, in_decl); |
95ee998c MM |
4511 | if (!context) |
4512 | context = global_namespace; | |
4513 | ||
36a117a5 | 4514 | /* Create the type. */ |
ed44da02 MM |
4515 | if (TREE_CODE (template_type) == ENUMERAL_TYPE) |
4516 | { | |
dbfe2124 | 4517 | if (!is_partial_instantiation) |
92777ce4 NS |
4518 | { |
4519 | set_current_access_from_decl (TYPE_NAME (template_type)); | |
4520 | t = start_enum (TYPE_IDENTIFIER (template_type)); | |
4521 | } | |
ed44da02 | 4522 | else |
dbfe2124 | 4523 | /* We don't want to call start_enum for this type, since |
ed44da02 MM |
4524 | the values for the enumeration constants may involve |
4525 | template parameters. And, no one should be interested | |
4526 | in the enumeration constants for such a type. */ | |
4527 | t = make_node (ENUMERAL_TYPE); | |
4528 | } | |
4529 | else | |
4530 | { | |
33848bb0 | 4531 | t = make_aggr_type (TREE_CODE (template_type)); |
ed44da02 MM |
4532 | CLASSTYPE_DECLARED_CLASS (t) |
4533 | = CLASSTYPE_DECLARED_CLASS (template_type); | |
ed44da02 | 4534 | SET_CLASSTYPE_IMPLICIT_INSTANTIATION (t); |
f668f160 | 4535 | TYPE_FOR_JAVA (t) = TYPE_FOR_JAVA (template_type); |
ae673f14 JM |
4536 | |
4537 | /* A local class. Make sure the decl gets registered properly. */ | |
4538 | if (context == current_function_decl) | |
4539 | pushtag (DECL_NAME (template), t, 0); | |
ed44da02 MM |
4540 | } |
4541 | ||
ae673f14 JM |
4542 | /* If we called start_enum or pushtag above, this information |
4543 | will already be set up. */ | |
ed44da02 MM |
4544 | if (!TYPE_NAME (t)) |
4545 | { | |
4546 | TYPE_CONTEXT (t) = FROB_CONTEXT (context); | |
36a117a5 | 4547 | |
9188c363 | 4548 | type_decl = create_implicit_typedef (DECL_NAME (template), t); |
ed44da02 | 4549 | DECL_CONTEXT (type_decl) = TYPE_CONTEXT (t); |
9188c363 | 4550 | TYPE_STUB_DECL (t) = type_decl; |
f31686a3 RH |
4551 | DECL_SOURCE_LOCATION (type_decl) |
4552 | = DECL_SOURCE_LOCATION (TYPE_STUB_DECL (template_type)); | |
ed44da02 MM |
4553 | } |
4554 | else | |
4555 | type_decl = TYPE_NAME (t); | |
36a117a5 | 4556 | |
cab7a9a3 KL |
4557 | TREE_PRIVATE (type_decl) |
4558 | = TREE_PRIVATE (TYPE_STUB_DECL (template_type)); | |
4559 | TREE_PROTECTED (type_decl) | |
4560 | = TREE_PROTECTED (TYPE_STUB_DECL (template_type)); | |
4561 | ||
9fbf56f7 MM |
4562 | /* Set up the template information. We have to figure out which |
4563 | template is the immediate parent if this is a full | |
4564 | instantiation. */ | |
4565 | if (parm_depth == 1 || is_partial_instantiation | |
4566 | || !PRIMARY_TEMPLATE_P (template)) | |
4567 | /* This case is easy; there are no member templates involved. */ | |
4568 | found = template; | |
4569 | else | |
4570 | { | |
ab097535 NS |
4571 | /* This is a full instantiation of a member template. Look |
4572 | for a partial instantiation of which this is an instance. */ | |
9fbf56f7 MM |
4573 | |
4574 | for (found = DECL_TEMPLATE_INSTANTIATIONS (template); | |
4575 | found; found = TREE_CHAIN (found)) | |
4576 | { | |
4577 | int success; | |
4578 | tree tmpl = CLASSTYPE_TI_TEMPLATE (TREE_VALUE (found)); | |
4579 | ||
4580 | /* We only want partial instantiations, here, not | |
4581 | specializations or full instantiations. */ | |
370af2d5 | 4582 | if (CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_VALUE (found)) |
9fbf56f7 MM |
4583 | || !uses_template_parms (TREE_VALUE (found))) |
4584 | continue; | |
4585 | ||
4586 | /* Temporarily reduce by one the number of levels in the | |
4587 | ARGLIST and in FOUND so as to avoid comparing the | |
4588 | last set of arguments. */ | |
4589 | TREE_VEC_LENGTH (arglist)--; | |
4590 | TREE_VEC_LENGTH (TREE_PURPOSE (found)) --; | |
4591 | ||
4592 | /* See if the arguments match. If they do, then TMPL is | |
4593 | the partial instantiation we want. */ | |
4594 | success = comp_template_args (TREE_PURPOSE (found), arglist); | |
4595 | ||
4596 | /* Restore the argument vectors to their full size. */ | |
4597 | TREE_VEC_LENGTH (arglist)++; | |
4598 | TREE_VEC_LENGTH (TREE_PURPOSE (found))++; | |
4599 | ||
4600 | if (success) | |
4601 | { | |
4602 | found = tmpl; | |
4603 | break; | |
4604 | } | |
4605 | } | |
4606 | ||
4607 | if (!found) | |
ab097535 NS |
4608 | { |
4609 | /* There was no partial instantiation. This happens | |
4610 | where C<T> is a member template of A<T> and it's used | |
4611 | in something like | |
4612 | ||
4613 | template <typename T> struct B { A<T>::C<int> m; }; | |
4614 | B<float>; | |
4615 | ||
4616 | Create the partial instantiation. | |
4617 | */ | |
4618 | TREE_VEC_LENGTH (arglist)--; | |
c2ea3a40 | 4619 | found = tsubst (template, arglist, complain, NULL_TREE); |
ab097535 | 4620 | TREE_VEC_LENGTH (arglist)++; |
ab097535 | 4621 | } |
9fbf56f7 MM |
4622 | } |
4623 | ||
ab097535 | 4624 | SET_TYPE_TEMPLATE_INFO (t, tree_cons (found, arglist, NULL_TREE)); |
dbfe2124 MM |
4625 | DECL_TEMPLATE_INSTANTIATIONS (template) |
4626 | = tree_cons (arglist, t, | |
4627 | DECL_TEMPLATE_INSTANTIATIONS (template)); | |
4628 | ||
4629 | if (TREE_CODE (t) == ENUMERAL_TYPE | |
4630 | && !is_partial_instantiation) | |
61a127b3 MM |
4631 | /* Now that the type has been registered on the instantiations |
4632 | list, we set up the enumerators. Because the enumeration | |
4633 | constants may involve the enumeration type itself, we make | |
4634 | sure to register the type first, and then create the | |
4635 | constants. That way, doing tsubst_expr for the enumeration | |
4636 | constants won't result in recursive calls here; we'll find | |
4637 | the instantiation and exit above. */ | |
4638 | tsubst_enum (template_type, t, arglist); | |
dbfe2124 | 4639 | |
36a117a5 MM |
4640 | /* Reset the name of the type, now that CLASSTYPE_TEMPLATE_INFO |
4641 | is set up. */ | |
ed44da02 MM |
4642 | if (TREE_CODE (t) != ENUMERAL_TYPE) |
4643 | DECL_NAME (type_decl) = classtype_mangled_name (t); | |
7813d14c | 4644 | if (is_partial_instantiation) |
077e7015 MM |
4645 | /* If the type makes use of template parameters, the |
4646 | code that generates debugging information will crash. */ | |
4647 | DECL_IGNORED_P (TYPE_STUB_DECL (t)) = 1; | |
8d08fdba | 4648 | |
fd295cb2 | 4649 | POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, t); |
36a117a5 | 4650 | } |
fd295cb2 | 4651 | timevar_pop (TV_NAME_LOOKUP); |
8d08fdba MS |
4652 | } |
4653 | \f | |
8dfaeb63 | 4654 | struct pair_fn_data |
8d08fdba | 4655 | { |
8dfaeb63 MM |
4656 | tree_fn_t fn; |
4657 | void *data; | |
4f2c9d7e | 4658 | htab_t visited; |
8dfaeb63 MM |
4659 | }; |
4660 | ||
4661 | /* Called from for_each_template_parm via walk_tree. */ | |
581d38d0 | 4662 | |
8dfaeb63 | 4663 | static tree |
350fae66 | 4664 | for_each_template_parm_r (tree *tp, int *walk_subtrees, void *d) |
8dfaeb63 MM |
4665 | { |
4666 | tree t = *tp; | |
4667 | struct pair_fn_data *pfd = (struct pair_fn_data *) d; | |
4668 | tree_fn_t fn = pfd->fn; | |
4669 | void *data = pfd->data; | |
4f2c9d7e | 4670 | |
2f939d94 | 4671 | if (TYPE_P (t) |
4f2c9d7e | 4672 | && for_each_template_parm (TYPE_CONTEXT (t), fn, data, pfd->visited)) |
8dfaeb63 | 4673 | return error_mark_node; |
581d38d0 | 4674 | |
8d08fdba MS |
4675 | switch (TREE_CODE (t)) |
4676 | { | |
8d08fdba | 4677 | case RECORD_TYPE: |
9076e292 | 4678 | if (TYPE_PTRMEMFUNC_P (t)) |
8dfaeb63 | 4679 | break; |
ed44da02 MM |
4680 | /* Fall through. */ |
4681 | ||
8d08fdba | 4682 | case UNION_TYPE: |
ed44da02 | 4683 | case ENUMERAL_TYPE: |
8dfaeb63 MM |
4684 | if (!TYPE_TEMPLATE_INFO (t)) |
4685 | *walk_subtrees = 0; | |
4686 | else if (for_each_template_parm (TREE_VALUE (TYPE_TEMPLATE_INFO (t)), | |
4f2c9d7e | 4687 | fn, data, pfd->visited)) |
8dfaeb63 MM |
4688 | return error_mark_node; |
4689 | break; | |
4690 | ||
588c2d1c | 4691 | case METHOD_TYPE: |
8dfaeb63 MM |
4692 | /* Since we're not going to walk subtrees, we have to do this |
4693 | explicitly here. */ | |
4f2c9d7e MM |
4694 | if (for_each_template_parm (TYPE_METHOD_BASETYPE (t), fn, data, |
4695 | pfd->visited)) | |
8dfaeb63 | 4696 | return error_mark_node; |
4890c2f4 | 4697 | /* Fall through. */ |
588c2d1c MM |
4698 | |
4699 | case FUNCTION_TYPE: | |
8dfaeb63 | 4700 | /* Check the return type. */ |
4f2c9d7e | 4701 | if (for_each_template_parm (TREE_TYPE (t), fn, data, pfd->visited)) |
8dfaeb63 MM |
4702 | return error_mark_node; |
4703 | ||
588c2d1c MM |
4704 | /* Check the parameter types. Since default arguments are not |
4705 | instantiated until they are needed, the TYPE_ARG_TYPES may | |
4706 | contain expressions that involve template parameters. But, | |
4707 | no-one should be looking at them yet. And, once they're | |
4708 | instantiated, they don't contain template parameters, so | |
4709 | there's no point in looking at them then, either. */ | |
4710 | { | |
4711 | tree parm; | |
4712 | ||
4713 | for (parm = TYPE_ARG_TYPES (t); parm; parm = TREE_CHAIN (parm)) | |
4f2c9d7e MM |
4714 | if (for_each_template_parm (TREE_VALUE (parm), fn, data, |
4715 | pfd->visited)) | |
8dfaeb63 | 4716 | return error_mark_node; |
5566b478 | 4717 | |
8dfaeb63 MM |
4718 | /* Since we've already handled the TYPE_ARG_TYPES, we don't |
4719 | want walk_tree walking into them itself. */ | |
4720 | *walk_subtrees = 0; | |
4721 | } | |
4722 | break; | |
3ac3d9ea | 4723 | |
a723baf1 MM |
4724 | case TYPEOF_TYPE: |
4725 | if (for_each_template_parm (TYPE_FIELDS (t), fn, data, | |
4726 | pfd->visited)) | |
4727 | return error_mark_node; | |
4728 | break; | |
4729 | ||
8d08fdba | 4730 | case FUNCTION_DECL: |
5566b478 | 4731 | case VAR_DECL: |
5566b478 | 4732 | if (DECL_LANG_SPECIFIC (t) && DECL_TEMPLATE_INFO (t) |
4f2c9d7e MM |
4733 | && for_each_template_parm (DECL_TI_ARGS (t), fn, data, |
4734 | pfd->visited)) | |
8dfaeb63 MM |
4735 | return error_mark_node; |
4736 | /* Fall through. */ | |
4737 | ||
8d08fdba | 4738 | case PARM_DECL: |
a723baf1 MM |
4739 | case CONST_DECL: |
4740 | if (TREE_CODE (t) == CONST_DECL && DECL_TEMPLATE_PARM_P (t) | |
4741 | && for_each_template_parm (DECL_INITIAL (t), fn, data, | |
4742 | pfd->visited)) | |
4743 | return error_mark_node; | |
050367a3 | 4744 | if (DECL_CONTEXT (t) |
4f2c9d7e MM |
4745 | && for_each_template_parm (DECL_CONTEXT (t), fn, data, |
4746 | pfd->visited)) | |
8dfaeb63 MM |
4747 | return error_mark_node; |
4748 | break; | |
8d08fdba | 4749 | |
a1281f45 | 4750 | case BOUND_TEMPLATE_TEMPLATE_PARM: |
744fac59 | 4751 | /* Record template parameters such as `T' inside `TT<T>'. */ |
4f2c9d7e | 4752 | if (for_each_template_parm (TYPE_TI_ARGS (t), fn, data, pfd->visited)) |
8dfaeb63 MM |
4753 | return error_mark_node; |
4754 | /* Fall through. */ | |
4755 | ||
a1281f45 | 4756 | case TEMPLATE_TEMPLATE_PARM: |
744fac59 | 4757 | case TEMPLATE_TYPE_PARM: |
f84b4be9 | 4758 | case TEMPLATE_PARM_INDEX: |
8dfaeb63 MM |
4759 | if (fn && (*fn)(t, data)) |
4760 | return error_mark_node; | |
4761 | else if (!fn) | |
4762 | return error_mark_node; | |
4763 | break; | |
5156628f | 4764 | |
8dfaeb63 | 4765 | case TEMPLATE_DECL: |
f4f206f4 | 4766 | /* A template template parameter is encountered. */ |
8dfaeb63 | 4767 | if (DECL_TEMPLATE_TEMPLATE_PARM_P (t) |
4f2c9d7e | 4768 | && for_each_template_parm (TREE_TYPE (t), fn, data, pfd->visited)) |
8dfaeb63 | 4769 | return error_mark_node; |
db5ae43f | 4770 | |
8dfaeb63 MM |
4771 | /* Already substituted template template parameter */ |
4772 | *walk_subtrees = 0; | |
4773 | break; | |
b8865407 | 4774 | |
4699c561 | 4775 | case TYPENAME_TYPE: |
4f2c9d7e MM |
4776 | if (!fn |
4777 | || for_each_template_parm (TYPENAME_TYPE_FULLNAME (t), fn, | |
4778 | data, pfd->visited)) | |
8dfaeb63 MM |
4779 | return error_mark_node; |
4780 | break; | |
4699c561 | 4781 | |
8dfaeb63 MM |
4782 | case CONSTRUCTOR: |
4783 | if (TREE_TYPE (t) && TYPE_PTRMEMFUNC_P (TREE_TYPE (t)) | |
4784 | && for_each_template_parm (TYPE_PTRMEMFUNC_FN_TYPE | |
4f2c9d7e MM |
4785 | (TREE_TYPE (t)), fn, data, |
4786 | pfd->visited)) | |
8dfaeb63 MM |
4787 | return error_mark_node; |
4788 | break; | |
4789 | ||
b8865407 MM |
4790 | case INDIRECT_REF: |
4791 | case COMPONENT_REF: | |
4699c561 | 4792 | /* If there's no type, then this thing must be some expression |
b8865407 | 4793 | involving template parameters. */ |
4699c561 | 4794 | if (!fn && !TREE_TYPE (t)) |
8dfaeb63 MM |
4795 | return error_mark_node; |
4796 | break; | |
b8865407 | 4797 | |
42976354 BK |
4798 | case MODOP_EXPR: |
4799 | case CAST_EXPR: | |
4800 | case REINTERPRET_CAST_EXPR: | |
4801 | case CONST_CAST_EXPR: | |
4802 | case STATIC_CAST_EXPR: | |
4803 | case DYNAMIC_CAST_EXPR: | |
42976354 BK |
4804 | case ARROW_EXPR: |
4805 | case DOTSTAR_EXPR: | |
4806 | case TYPEID_EXPR: | |
40242ccf | 4807 | case PSEUDO_DTOR_EXPR: |
b8865407 | 4808 | if (!fn) |
8dfaeb63 MM |
4809 | return error_mark_node; |
4810 | break; | |
abff8e06 | 4811 | |
bd9bb3d2 MM |
4812 | case BASELINK: |
4813 | /* If we do not handle this case specially, we end up walking | |
4814 | the BINFO hierarchy, which is circular, and therefore | |
4815 | confuses walk_tree. */ | |
4816 | *walk_subtrees = 0; | |
4f2c9d7e MM |
4817 | if (for_each_template_parm (BASELINK_FUNCTIONS (*tp), fn, data, |
4818 | pfd->visited)) | |
bd9bb3d2 MM |
4819 | return error_mark_node; |
4820 | break; | |
4821 | ||
8d08fdba | 4822 | default: |
8dfaeb63 | 4823 | break; |
8d08fdba | 4824 | } |
8dfaeb63 MM |
4825 | |
4826 | /* We didn't find any template parameters we liked. */ | |
4827 | return NULL_TREE; | |
4828 | } | |
4829 | ||
a1281f45 KL |
4830 | /* For each TEMPLATE_TYPE_PARM, TEMPLATE_TEMPLATE_PARM, |
4831 | BOUND_TEMPLATE_TEMPLATE_PARM or TEMPLATE_PARM_INDEX in T, | |
4832 | call FN with the parameter and the DATA. | |
838dfd8a | 4833 | If FN returns nonzero, the iteration is terminated, and |
8dfaeb63 | 4834 | for_each_template_parm returns 1. Otherwise, the iteration |
838dfd8a | 4835 | continues. If FN never returns a nonzero value, the value |
8dfaeb63 MM |
4836 | returned by for_each_template_parm is 0. If FN is NULL, it is |
4837 | considered to be the function which always returns 1. */ | |
4838 | ||
4839 | static int | |
3a978d72 | 4840 | for_each_template_parm (tree t, tree_fn_t fn, void* data, htab_t visited) |
8dfaeb63 MM |
4841 | { |
4842 | struct pair_fn_data pfd; | |
ad2ae3b2 | 4843 | int result; |
8dfaeb63 MM |
4844 | |
4845 | /* Set up. */ | |
4846 | pfd.fn = fn; | |
4847 | pfd.data = data; | |
4848 | ||
4890c2f4 MM |
4849 | /* Walk the tree. (Conceptually, we would like to walk without |
4850 | duplicates, but for_each_template_parm_r recursively calls | |
4851 | for_each_template_parm, so we would need to reorganize a fair | |
4f2c9d7e MM |
4852 | bit to use walk_tree_without_duplicates, so we keep our own |
4853 | visited list.) */ | |
4854 | if (visited) | |
4855 | pfd.visited = visited; | |
4856 | else | |
4857 | pfd.visited = htab_create (37, htab_hash_pointer, htab_eq_pointer, | |
4858 | NULL); | |
ad2ae3b2 MM |
4859 | result = walk_tree (&t, |
4860 | for_each_template_parm_r, | |
4861 | &pfd, | |
c1e39976 | 4862 | pfd.visited) != NULL_TREE; |
ad2ae3b2 MM |
4863 | |
4864 | /* Clean up. */ | |
4865 | if (!visited) | |
4866 | htab_delete (pfd.visited); | |
4867 | ||
4868 | return result; | |
8d08fdba MS |
4869 | } |
4870 | ||
d43f603d KL |
4871 | /* Returns true if T depends on any template parameter. */ |
4872 | ||
050367a3 | 4873 | int |
3a978d72 | 4874 | uses_template_parms (tree t) |
050367a3 | 4875 | { |
c353b8e3 MM |
4876 | bool dependent_p; |
4877 | int saved_processing_template_decl; | |
4878 | ||
4879 | saved_processing_template_decl = processing_template_decl; | |
4880 | if (!saved_processing_template_decl) | |
4881 | processing_template_decl = 1; | |
4882 | if (TYPE_P (t)) | |
4883 | dependent_p = dependent_type_p (t); | |
4884 | else if (TREE_CODE (t) == TREE_VEC) | |
4885 | dependent_p = any_dependent_template_arguments_p (t); | |
4886 | else if (TREE_CODE (t) == TREE_LIST) | |
4887 | dependent_p = (uses_template_parms (TREE_VALUE (t)) | |
4888 | || uses_template_parms (TREE_CHAIN (t))); | |
4889 | else if (DECL_P (t) | |
4890 | || EXPR_P (t) | |
4891 | || TREE_CODE (t) == TEMPLATE_PARM_INDEX | |
4892 | || TREE_CODE (t) == OVERLOAD | |
4893 | || TREE_CODE (t) == BASELINK | |
4894 | || TREE_CODE_CLASS (TREE_CODE (t)) == 'c') | |
4895 | dependent_p = (type_dependent_expression_p (t) | |
4896 | || value_dependent_expression_p (t)); | |
4897 | else if (t == error_mark_node) | |
4898 | dependent_p = false; | |
4899 | else | |
4900 | abort (); | |
4901 | processing_template_decl = saved_processing_template_decl; | |
4902 | ||
4903 | return dependent_p; | |
050367a3 MM |
4904 | } |
4905 | ||
d43f603d KL |
4906 | /* Returns true if T depends on any template parameter with level LEVEL. */ |
4907 | ||
4908 | int | |
4909 | uses_template_parms_level (tree t, int level) | |
4910 | { | |
4911 | return for_each_template_parm (t, template_parm_this_level_p, &level, NULL); | |
4912 | } | |
4913 | ||
27fafc8d | 4914 | static int tinst_depth; |
e9f32eb5 | 4915 | extern int max_tinst_depth; |
5566b478 | 4916 | #ifdef GATHER_STATISTICS |
27fafc8d | 4917 | int depth_reached; |
5566b478 | 4918 | #endif |
8dfaeb63 MM |
4919 | static int tinst_level_tick; |
4920 | static int last_template_error_tick; | |
8d08fdba | 4921 | |
3ae18eaf JM |
4922 | /* We're starting to instantiate D; record the template instantiation context |
4923 | for diagnostics and to restore it later. */ | |
4924 | ||
742a37d5 | 4925 | int |
3a978d72 | 4926 | push_tinst_level (tree d) |
8d08fdba | 4927 | { |
3ae18eaf | 4928 | tree new; |
8d08fdba | 4929 | |
7215f9a0 MS |
4930 | if (tinst_depth >= max_tinst_depth) |
4931 | { | |
8adf5b5e JM |
4932 | /* If the instantiation in question still has unbound template parms, |
4933 | we don't really care if we can't instantiate it, so just return. | |
4934 | This happens with base instantiation for implicit `typename'. */ | |
4935 | if (uses_template_parms (d)) | |
4936 | return 0; | |
4937 | ||
1139b3d8 | 4938 | last_template_error_tick = tinst_level_tick; |
33bd39a2 | 4939 | error ("template instantiation depth exceeds maximum of %d (use -ftemplate-depth-NN to increase the maximum) instantiating `%D'", |
b4f4233d | 4940 | max_tinst_depth, d); |
5566b478 | 4941 | |
cb753e49 | 4942 | print_instantiation_context (); |
5566b478 | 4943 | |
7215f9a0 MS |
4944 | return 0; |
4945 | } | |
4946 | ||
406d77a4 | 4947 | new = make_tinst_level (d, input_location); |
3ae18eaf | 4948 | TREE_CHAIN (new) = current_tinst_level; |
8d08fdba | 4949 | current_tinst_level = new; |
5566b478 | 4950 | |
7215f9a0 | 4951 | ++tinst_depth; |
5566b478 MS |
4952 | #ifdef GATHER_STATISTICS |
4953 | if (tinst_depth > depth_reached) | |
4954 | depth_reached = tinst_depth; | |
4955 | #endif | |
4956 | ||
27fafc8d | 4957 | ++tinst_level_tick; |
7215f9a0 | 4958 | return 1; |
8d08fdba MS |
4959 | } |
4960 | ||
3ae18eaf JM |
4961 | /* We're done instantiating this template; return to the instantiation |
4962 | context. */ | |
4963 | ||
8d08fdba | 4964 | void |
3a978d72 | 4965 | pop_tinst_level (void) |
8d08fdba | 4966 | { |
3ae18eaf | 4967 | tree old = current_tinst_level; |
8d08fdba | 4968 | |
ae58fa02 MM |
4969 | /* Restore the filename and line number stashed away when we started |
4970 | this instantiation. */ | |
406d77a4 | 4971 | input_location = TINST_LOCATION (old); |
5f2c99c4 | 4972 | extract_interface_info (); |
ae58fa02 | 4973 | |
3ae18eaf | 4974 | current_tinst_level = TREE_CHAIN (old); |
7215f9a0 | 4975 | --tinst_depth; |
27fafc8d | 4976 | ++tinst_level_tick; |
8d08fdba MS |
4977 | } |
4978 | ||
3ae18eaf JM |
4979 | /* We're instantiating a deferred template; restore the template |
4980 | instantiation context in which the instantiation was requested, which | |
4981 | is one step out from LEVEL. */ | |
4982 | ||
4983 | static void | |
3a978d72 | 4984 | reopen_tinst_level (tree level) |
3ae18eaf JM |
4985 | { |
4986 | tree t; | |
4987 | ||
4988 | tinst_depth = 0; | |
4989 | for (t = level; t; t = TREE_CHAIN (t)) | |
4990 | ++tinst_depth; | |
4991 | ||
4992 | current_tinst_level = level; | |
4993 | pop_tinst_level (); | |
4994 | } | |
4995 | ||
4996 | /* Return the outermost template instantiation context, for use with | |
4997 | -falt-external-templates. */ | |
4998 | ||
4999 | tree | |
3a978d72 | 5000 | tinst_for_decl (void) |
8d08fdba | 5001 | { |
3ae18eaf | 5002 | tree p = current_tinst_level; |
8d08fdba MS |
5003 | |
5004 | if (p) | |
3ae18eaf | 5005 | for (; TREE_CHAIN (p) ; p = TREE_CHAIN (p)) |
8d08fdba MS |
5006 | ; |
5007 | return p; | |
5008 | } | |
5009 | ||
f84b4be9 JM |
5010 | /* DECL is a friend FUNCTION_DECL or TEMPLATE_DECL. ARGS is the |
5011 | vector of template arguments, as for tsubst. | |
5012 | ||
dc957d14 | 5013 | Returns an appropriate tsubst'd friend declaration. */ |
f84b4be9 JM |
5014 | |
5015 | static tree | |
3a978d72 | 5016 | tsubst_friend_function (tree decl, tree args) |
f84b4be9 JM |
5017 | { |
5018 | tree new_friend; | |
82a98427 | 5019 | location_t saved_loc = input_location; |
27fafc8d | 5020 | |
f31686a3 | 5021 | input_location = DECL_SOURCE_LOCATION (decl); |
27fafc8d | 5022 | |
f84b4be9 JM |
5023 | if (TREE_CODE (decl) == FUNCTION_DECL |
5024 | && DECL_TEMPLATE_INSTANTIATION (decl) | |
5025 | && TREE_CODE (DECL_TI_TEMPLATE (decl)) != TEMPLATE_DECL) | |
5026 | /* This was a friend declared with an explicit template | |
5027 | argument list, e.g.: | |
5028 | ||
5029 | friend void f<>(T); | |
5030 | ||
5031 | to indicate that f was a template instantiation, not a new | |
5032 | function declaration. Now, we have to figure out what | |
5033 | instantiation of what template. */ | |
5034 | { | |
76e57b45 | 5035 | tree template_id, arglist, fns; |
f84b4be9 JM |
5036 | tree new_args; |
5037 | tree tmpl; | |
ed2fa432 | 5038 | tree ns = decl_namespace_context (TYPE_MAIN_DECL (current_class_type)); |
76e57b45 NS |
5039 | |
5040 | /* Friend functions are looked up in the containing namespace scope. | |
5041 | We must enter that scope, to avoid finding member functions of the | |
5042 | current cless with same name. */ | |
5043 | push_nested_namespace (ns); | |
5044 | fns = tsubst_expr (DECL_TI_TEMPLATE (decl), args, | |
c2ea3a40 | 5045 | tf_error | tf_warning, NULL_TREE); |
76e57b45 NS |
5046 | pop_nested_namespace (ns); |
5047 | arglist = tsubst (DECL_TI_ARGS (decl), args, | |
c2ea3a40 | 5048 | tf_error | tf_warning, NULL_TREE); |
76e57b45 NS |
5049 | template_id = lookup_template_function (fns, arglist); |
5050 | ||
c2ea3a40 | 5051 | new_friend = tsubst (decl, args, tf_error | tf_warning, NULL_TREE); |
36a117a5 MM |
5052 | tmpl = determine_specialization (template_id, new_friend, |
5053 | &new_args, | |
5fe7b654 GB |
5054 | /*need_member_template=*/0, |
5055 | TREE_VEC_LENGTH (args)); | |
3e4a3562 | 5056 | new_friend = instantiate_template (tmpl, new_args, tf_error); |
27fafc8d | 5057 | goto done; |
f84b4be9 | 5058 | } |
36a117a5 | 5059 | |
c2ea3a40 | 5060 | new_friend = tsubst (decl, args, tf_error | tf_warning, NULL_TREE); |
f84b4be9 | 5061 | |
36a117a5 | 5062 | /* The NEW_FRIEND will look like an instantiation, to the |
f84b4be9 JM |
5063 | compiler, but is not an instantiation from the point of view of |
5064 | the language. For example, we might have had: | |
5065 | ||
5066 | template <class T> struct S { | |
5067 | template <class U> friend void f(T, U); | |
5068 | }; | |
5069 | ||
5070 | Then, in S<int>, template <class U> void f(int, U) is not an | |
5071 | instantiation of anything. */ | |
ac2b3222 AP |
5072 | if (new_friend == error_mark_node) |
5073 | return error_mark_node; | |
5074 | ||
f84b4be9 JM |
5075 | DECL_USE_TEMPLATE (new_friend) = 0; |
5076 | if (TREE_CODE (decl) == TEMPLATE_DECL) | |
655dc6ee JM |
5077 | { |
5078 | DECL_USE_TEMPLATE (DECL_TEMPLATE_RESULT (new_friend)) = 0; | |
5079 | DECL_SAVED_TREE (DECL_TEMPLATE_RESULT (new_friend)) | |
5080 | = DECL_SAVED_TREE (DECL_TEMPLATE_RESULT (decl)); | |
5081 | } | |
36a117a5 | 5082 | |
92643fea MM |
5083 | /* The mangled name for the NEW_FRIEND is incorrect. The function |
5084 | is not a template instantiation and should not be mangled like | |
5085 | one. Therefore, we forget the mangling here; we'll recompute it | |
5086 | later if we need it. */ | |
36a117a5 MM |
5087 | if (TREE_CODE (new_friend) != TEMPLATE_DECL) |
5088 | { | |
19e7881c | 5089 | SET_DECL_RTL (new_friend, NULL_RTX); |
92643fea | 5090 | SET_DECL_ASSEMBLER_NAME (new_friend, NULL_TREE); |
36a117a5 MM |
5091 | } |
5092 | ||
6eb3bb27 | 5093 | if (DECL_NAMESPACE_SCOPE_P (new_friend)) |
f84b4be9 | 5094 | { |
36a117a5 | 5095 | tree old_decl; |
fbf1c34b MM |
5096 | tree new_friend_template_info; |
5097 | tree new_friend_result_template_info; | |
92da7074 | 5098 | tree ns; |
fbf1c34b MM |
5099 | int new_friend_is_defn; |
5100 | ||
5101 | /* We must save some information from NEW_FRIEND before calling | |
5102 | duplicate decls since that function will free NEW_FRIEND if | |
5103 | possible. */ | |
5104 | new_friend_template_info = DECL_TEMPLATE_INFO (new_friend); | |
5bd61841 MM |
5105 | new_friend_is_defn = |
5106 | (DECL_INITIAL (DECL_TEMPLATE_RESULT | |
5107 | (template_for_substitution (new_friend))) | |
5108 | != NULL_TREE); | |
f84b4be9 | 5109 | if (TREE_CODE (new_friend) == TEMPLATE_DECL) |
fbf1c34b MM |
5110 | { |
5111 | /* This declaration is a `primary' template. */ | |
5112 | DECL_PRIMARY_TEMPLATE (new_friend) = new_friend; | |
5113 | ||
fbf1c34b | 5114 | new_friend_result_template_info |
17aec3eb | 5115 | = DECL_TEMPLATE_INFO (DECL_TEMPLATE_RESULT (new_friend)); |
fbf1c34b MM |
5116 | } |
5117 | else | |
5bd61841 | 5118 | new_friend_result_template_info = NULL_TREE; |
36a117a5 | 5119 | |
1c227897 MM |
5120 | /* Inside pushdecl_namespace_level, we will push into the |
5121 | current namespace. However, the friend function should go | |
c6002625 | 5122 | into the namespace of the template. */ |
92da7074 ML |
5123 | ns = decl_namespace_context (new_friend); |
5124 | push_nested_namespace (ns); | |
36a117a5 | 5125 | old_decl = pushdecl_namespace_level (new_friend); |
92da7074 | 5126 | pop_nested_namespace (ns); |
36a117a5 MM |
5127 | |
5128 | if (old_decl != new_friend) | |
5129 | { | |
5130 | /* This new friend declaration matched an existing | |
5131 | declaration. For example, given: | |
5132 | ||
5133 | template <class T> void f(T); | |
5134 | template <class U> class C { | |
5135 | template <class T> friend void f(T) {} | |
5136 | }; | |
5137 | ||
5138 | the friend declaration actually provides the definition | |
5139 | of `f', once C has been instantiated for some type. So, | |
5140 | old_decl will be the out-of-class template declaration, | |
5141 | while new_friend is the in-class definition. | |
5142 | ||
5143 | But, if `f' was called before this point, the | |
5144 | instantiation of `f' will have DECL_TI_ARGS corresponding | |
5145 | to `T' but not to `U', references to which might appear | |
5146 | in the definition of `f'. Previously, the most general | |
5147 | template for an instantiation of `f' was the out-of-class | |
5148 | version; now it is the in-class version. Therefore, we | |
5149 | run through all specialization of `f', adding to their | |
5150 | DECL_TI_ARGS appropriately. In particular, they need a | |
5151 | new set of outer arguments, corresponding to the | |
5152 | arguments for this class instantiation. | |
5153 | ||
5154 | The same situation can arise with something like this: | |
5155 | ||
5156 | friend void f(int); | |
5157 | template <class T> class C { | |
5158 | friend void f(T) {} | |
5159 | }; | |
5160 | ||
5161 | when `C<int>' is instantiated. Now, `f(int)' is defined | |
5162 | in the class. */ | |
5163 | ||
fbf1c34b MM |
5164 | if (!new_friend_is_defn) |
5165 | /* On the other hand, if the in-class declaration does | |
5166 | *not* provide a definition, then we don't want to alter | |
5167 | existing definitions. We can just leave everything | |
5168 | alone. */ | |
36a117a5 | 5169 | ; |
fbf1c34b | 5170 | else |
36a117a5 | 5171 | { |
fbf1c34b MM |
5172 | /* Overwrite whatever template info was there before, if |
5173 | any, with the new template information pertaining to | |
5174 | the declaration. */ | |
5175 | DECL_TEMPLATE_INFO (old_decl) = new_friend_template_info; | |
5176 | ||
5177 | if (TREE_CODE (old_decl) != TEMPLATE_DECL) | |
8d83f792 MM |
5178 | reregister_specialization (new_friend, |
5179 | most_general_template (old_decl), | |
5180 | old_decl); | |
fbf1c34b | 5181 | else |
36a117a5 | 5182 | { |
fbf1c34b MM |
5183 | tree t; |
5184 | tree new_friend_args; | |
5185 | ||
17aec3eb | 5186 | DECL_TEMPLATE_INFO (DECL_TEMPLATE_RESULT (old_decl)) |
fbf1c34b MM |
5187 | = new_friend_result_template_info; |
5188 | ||
5189 | new_friend_args = TI_ARGS (new_friend_template_info); | |
5190 | for (t = DECL_TEMPLATE_SPECIALIZATIONS (old_decl); | |
5191 | t != NULL_TREE; | |
5192 | t = TREE_CHAIN (t)) | |
5193 | { | |
5194 | tree spec = TREE_VALUE (t); | |
36a117a5 | 5195 | |
fbf1c34b MM |
5196 | DECL_TI_ARGS (spec) |
5197 | = add_outermost_template_args (new_friend_args, | |
5198 | DECL_TI_ARGS (spec)); | |
fbf1c34b MM |
5199 | } |
5200 | ||
5201 | /* Now, since specializations are always supposed to | |
5202 | hang off of the most general template, we must move | |
5203 | them. */ | |
5204 | t = most_general_template (old_decl); | |
5205 | if (t != old_decl) | |
5206 | { | |
5207 | DECL_TEMPLATE_SPECIALIZATIONS (t) | |
5208 | = chainon (DECL_TEMPLATE_SPECIALIZATIONS (t), | |
5209 | DECL_TEMPLATE_SPECIALIZATIONS (old_decl)); | |
5210 | DECL_TEMPLATE_SPECIALIZATIONS (old_decl) = NULL_TREE; | |
5211 | } | |
36a117a5 MM |
5212 | } |
5213 | } | |
5214 | ||
5215 | /* The information from NEW_FRIEND has been merged into OLD_DECL | |
5216 | by duplicate_decls. */ | |
5217 | new_friend = old_decl; | |
5218 | } | |
f84b4be9 | 5219 | } |
d0f062fb | 5220 | else if (COMPLETE_TYPE_P (DECL_CONTEXT (new_friend))) |
f84b4be9 JM |
5221 | { |
5222 | /* Check to see that the declaration is really present, and, | |
5223 | possibly obtain an improved declaration. */ | |
44021471 GB |
5224 | tree fn = check_classfn (DECL_CONTEXT (new_friend), |
5225 | new_friend, NULL_TREE); | |
f84b4be9 JM |
5226 | |
5227 | if (fn) | |
5228 | new_friend = fn; | |
5229 | } | |
5230 | ||
27fafc8d | 5231 | done: |
82a98427 | 5232 | input_location = saved_loc; |
f84b4be9 JM |
5233 | return new_friend; |
5234 | } | |
5235 | ||
1aed5355 MM |
5236 | /* FRIEND_TMPL is a friend TEMPLATE_DECL. ARGS is the vector of |
5237 | template arguments, as for tsubst. | |
6757edfe | 5238 | |
dc957d14 | 5239 | Returns an appropriate tsubst'd friend type or error_mark_node on |
4b054b80 | 5240 | failure. */ |
6757edfe MM |
5241 | |
5242 | static tree | |
3a978d72 | 5243 | tsubst_friend_class (tree friend_tmpl, tree args) |
6757edfe | 5244 | { |
1aed5355 | 5245 | tree friend_type; |
25aab5d0 | 5246 | tree tmpl; |
3e0ec82f | 5247 | tree context; |
6757edfe | 5248 | |
3e0ec82f MM |
5249 | context = DECL_CONTEXT (friend_tmpl); |
5250 | ||
5251 | if (context) | |
77adef84 | 5252 | { |
3e0ec82f MM |
5253 | if (TREE_CODE (context) == NAMESPACE_DECL) |
5254 | push_nested_namespace (context); | |
5255 | else | |
14d22dd6 | 5256 | push_nested_class (tsubst (context, args, tf_none, NULL_TREE)); |
3e0ec82f | 5257 | } |
25aab5d0 | 5258 | |
3e0ec82f MM |
5259 | /* First, we look for a class template. */ |
5260 | tmpl = lookup_name (DECL_NAME (friend_tmpl), /*prefer_type=*/0); | |
25aab5d0 | 5261 | |
3e0ec82f MM |
5262 | /* But, if we don't find one, it might be because we're in a |
5263 | situation like this: | |
77adef84 | 5264 | |
3e0ec82f MM |
5265 | template <class T> |
5266 | struct S { | |
5267 | template <class U> | |
5268 | friend struct S; | |
5269 | }; | |
5270 | ||
5271 | Here, in the scope of (say) S<int>, `S' is bound to a TYPE_DECL | |
5272 | for `S<int>', not the TEMPLATE_DECL. */ | |
5273 | if (!tmpl || !DECL_CLASS_TEMPLATE_P (tmpl)) | |
5274 | { | |
5275 | tmpl = lookup_name (DECL_NAME (friend_tmpl), /*prefer_type=*/1); | |
5276 | tmpl = maybe_get_template_decl_from_type_decl (tmpl); | |
25aab5d0 | 5277 | } |
6757edfe | 5278 | |
25aab5d0 | 5279 | if (tmpl && DECL_CLASS_TEMPLATE_P (tmpl)) |
6757edfe MM |
5280 | { |
5281 | /* The friend template has already been declared. Just | |
36a117a5 MM |
5282 | check to see that the declarations match, and install any new |
5283 | default parameters. We must tsubst the default parameters, | |
5284 | of course. We only need the innermost template parameters | |
5285 | because that is all that redeclare_class_template will look | |
5286 | at. */ | |
3e0ec82f MM |
5287 | if (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (friend_tmpl)) |
5288 | > TMPL_ARGS_DEPTH (args)) | |
5289 | { | |
5290 | tree parms; | |
5291 | parms = tsubst_template_parms (DECL_TEMPLATE_PARMS (friend_tmpl), | |
5292 | args, tf_error | tf_warning); | |
5293 | redeclare_class_template (TREE_TYPE (tmpl), parms); | |
5294 | } | |
5295 | ||
6757edfe MM |
5296 | friend_type = TREE_TYPE (tmpl); |
5297 | } | |
5298 | else | |
5299 | { | |
5300 | /* The friend template has not already been declared. In this | |
5301 | case, the instantiation of the template class will cause the | |
5302 | injection of this template into the global scope. */ | |
c2ea3a40 | 5303 | tmpl = tsubst (friend_tmpl, args, tf_error | tf_warning, NULL_TREE); |
6757edfe MM |
5304 | |
5305 | /* The new TMPL is not an instantiation of anything, so we | |
5306 | forget its origins. We don't reset CLASSTYPE_TI_TEMPLATE for | |
5307 | the new type because that is supposed to be the corresponding | |
5308 | template decl, i.e., TMPL. */ | |
5309 | DECL_USE_TEMPLATE (tmpl) = 0; | |
5310 | DECL_TEMPLATE_INFO (tmpl) = NULL_TREE; | |
5311 | CLASSTYPE_USE_TEMPLATE (TREE_TYPE (tmpl)) = 0; | |
68c78847 KL |
5312 | CLASSTYPE_TI_ARGS (TREE_TYPE (tmpl)) |
5313 | = INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (TREE_TYPE (tmpl))); | |
6757edfe MM |
5314 | |
5315 | /* Inject this template into the global scope. */ | |
5316 | friend_type = TREE_TYPE (pushdecl_top_level (tmpl)); | |
5317 | } | |
5318 | ||
3e0ec82f MM |
5319 | if (context) |
5320 | { | |
5321 | if (TREE_CODE (context) == NAMESPACE_DECL) | |
5322 | pop_nested_namespace (context); | |
5323 | else | |
5324 | pop_nested_class (); | |
5325 | } | |
5326 | ||
6757edfe MM |
5327 | return friend_type; |
5328 | } | |
f84b4be9 | 5329 | |
17f29637 KL |
5330 | /* Returns zero if TYPE cannot be completed later due to circularity. |
5331 | Otherwise returns one. */ | |
5332 | ||
d5372501 | 5333 | static int |
3a978d72 | 5334 | can_complete_type_without_circularity (tree type) |
17f29637 KL |
5335 | { |
5336 | if (type == NULL_TREE || type == error_mark_node) | |
5337 | return 0; | |
5338 | else if (COMPLETE_TYPE_P (type)) | |
5339 | return 1; | |
5340 | else if (TREE_CODE (type) == ARRAY_TYPE && TYPE_DOMAIN (type)) | |
5341 | return can_complete_type_without_circularity (TREE_TYPE (type)); | |
8c6ab2db NS |
5342 | else if (CLASS_TYPE_P (type) |
5343 | && TYPE_BEING_DEFINED (TYPE_MAIN_VARIANT (type))) | |
17f29637 KL |
5344 | return 0; |
5345 | else | |
5346 | return 1; | |
5347 | } | |
5348 | ||
8d08fdba | 5349 | tree |
3a978d72 | 5350 | instantiate_class_template (tree type) |
8d08fdba | 5351 | { |
7088fca9 | 5352 | tree template, args, pattern, t, member; |
36a117a5 | 5353 | tree typedecl; |
dbbf88d1 | 5354 | tree pbinfo; |
cad7e87b | 5355 | tree base_list; |
dbbf88d1 | 5356 | |
5566b478 | 5357 | if (type == error_mark_node) |
8d08fdba MS |
5358 | return error_mark_node; |
5359 | ||
ca099ac8 MM |
5360 | if (TYPE_BEING_DEFINED (type) |
5361 | || COMPLETE_TYPE_P (type) | |
5362 | || dependent_type_p (type)) | |
5566b478 MS |
5363 | return type; |
5364 | ||
6bdb985f | 5365 | /* Figure out which template is being instantiated. */ |
36a117a5 | 5366 | template = most_general_template (CLASSTYPE_TI_TEMPLATE (type)); |
5566b478 | 5367 | my_friendly_assert (TREE_CODE (template) == TEMPLATE_DECL, 279); |
73aad9b9 | 5368 | |
6bdb985f MM |
5369 | /* Figure out which arguments are being used to do the |
5370 | instantiation. */ | |
5371 | args = CLASSTYPE_TI_ARGS (type); | |
4c571114 MM |
5372 | |
5373 | /* Determine what specialization of the original template to | |
5374 | instantiate. */ | |
8fbc5ae7 MM |
5375 | t = most_specialized_class (template, args); |
5376 | if (t == error_mark_node) | |
73aad9b9 | 5377 | { |
8fbc5ae7 MM |
5378 | const char *str = "candidates are:"; |
5379 | error ("ambiguous class template instantiation for `%#T'", type); | |
5380 | for (t = DECL_TEMPLATE_SPECIALIZATIONS (template); t; | |
5381 | t = TREE_CHAIN (t)) | |
73aad9b9 | 5382 | { |
8c6ab2db | 5383 | if (get_class_bindings (TREE_VALUE (t), TREE_PURPOSE (t), args)) |
73aad9b9 | 5384 | { |
8fbc5ae7 MM |
5385 | cp_error_at ("%s %+#T", str, TREE_TYPE (t)); |
5386 | str = " "; | |
73aad9b9 JM |
5387 | } |
5388 | } | |
8fbc5ae7 MM |
5389 | TYPE_BEING_DEFINED (type) = 1; |
5390 | return error_mark_node; | |
73aad9b9 | 5391 | } |
6bdb985f MM |
5392 | |
5393 | if (t) | |
73aad9b9 JM |
5394 | pattern = TREE_TYPE (t); |
5395 | else | |
5396 | pattern = TREE_TYPE (template); | |
5566b478 | 5397 | |
4c571114 MM |
5398 | /* If the template we're instantiating is incomplete, then clearly |
5399 | there's nothing we can do. */ | |
d0f062fb | 5400 | if (!COMPLETE_TYPE_P (pattern)) |
f31c0a32 | 5401 | return type; |
5566b478 | 5402 | |
4c571114 MM |
5403 | /* If we've recursively instantiated too many templates, stop. */ |
5404 | if (! push_tinst_level (type)) | |
f31c0a32 | 5405 | return type; |
4c571114 MM |
5406 | |
5407 | /* Now we're really doing the instantiation. Mark the type as in | |
5408 | the process of being defined. */ | |
5409 | TYPE_BEING_DEFINED (type) = 1; | |
5410 | ||
78757caa KL |
5411 | /* We may be in the middle of deferred access check. Disable |
5412 | it now. */ | |
5413 | push_deferring_access_checks (dk_no_deferred); | |
5414 | ||
c353b8e3 | 5415 | push_to_top_level (); |
4c571114 | 5416 | |
73aad9b9 | 5417 | if (t) |
36a117a5 | 5418 | { |
27631dae | 5419 | /* This TYPE is actually an instantiation of a partial |
36a117a5 MM |
5420 | specialization. We replace the innermost set of ARGS with |
5421 | the arguments appropriate for substitution. For example, | |
5422 | given: | |
5423 | ||
5424 | template <class T> struct S {}; | |
5425 | template <class T> struct S<T*> {}; | |
5426 | ||
5427 | and supposing that we are instantiating S<int*>, ARGS will | |
5428 | present be {int*} but we need {int}. */ | |
5429 | tree inner_args | |
5430 | = get_class_bindings (TREE_VALUE (t), TREE_PURPOSE (t), | |
5431 | args); | |
5432 | ||
5433 | /* If there were multiple levels in ARGS, replacing the | |
5434 | innermost level would alter CLASSTYPE_TI_ARGS, which we don't | |
5435 | want, so we make a copy first. */ | |
5436 | if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (args)) | |
5437 | { | |
5438 | args = copy_node (args); | |
5439 | SET_TMPL_ARGS_LEVEL (args, TMPL_ARGS_DEPTH (args), inner_args); | |
5440 | } | |
5441 | else | |
5442 | args = inner_args; | |
5443 | } | |
8d019cef | 5444 | |
7813d14c | 5445 | SET_CLASSTYPE_INTERFACE_UNKNOWN (type); |
8d08fdba | 5446 | |
68ea098a NS |
5447 | /* Set the input location to the template definition. This is needed |
5448 | if tsubsting causes an error. */ | |
f31686a3 | 5449 | input_location = DECL_SOURCE_LOCATION (TYPE_NAME (pattern)); |
68ea098a | 5450 | |
f7da6097 MS |
5451 | TYPE_HAS_CONSTRUCTOR (type) = TYPE_HAS_CONSTRUCTOR (pattern); |
5452 | TYPE_HAS_DESTRUCTOR (type) = TYPE_HAS_DESTRUCTOR (pattern); | |
834c6dff MM |
5453 | TYPE_HAS_NEW_OPERATOR (type) = TYPE_HAS_NEW_OPERATOR (pattern); |
5454 | TYPE_HAS_ARRAY_NEW_OPERATOR (type) = TYPE_HAS_ARRAY_NEW_OPERATOR (pattern); | |
f7da6097 | 5455 | TYPE_GETS_DELETE (type) = TYPE_GETS_DELETE (pattern); |
f7da6097 MS |
5456 | TYPE_HAS_ASSIGN_REF (type) = TYPE_HAS_ASSIGN_REF (pattern); |
5457 | TYPE_HAS_CONST_ASSIGN_REF (type) = TYPE_HAS_CONST_ASSIGN_REF (pattern); | |
f7da6097 MS |
5458 | TYPE_HAS_INIT_REF (type) = TYPE_HAS_INIT_REF (pattern); |
5459 | TYPE_HAS_CONST_INIT_REF (type) = TYPE_HAS_CONST_INIT_REF (pattern); | |
f7da6097 MS |
5460 | TYPE_HAS_DEFAULT_CONSTRUCTOR (type) = TYPE_HAS_DEFAULT_CONSTRUCTOR (pattern); |
5461 | TYPE_HAS_CONVERSION (type) = TYPE_HAS_CONVERSION (pattern); | |
4c6b7393 MM |
5462 | TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (type) |
5463 | = TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (pattern); | |
f7da6097 MS |
5464 | TYPE_USES_MULTIPLE_INHERITANCE (type) |
5465 | = TYPE_USES_MULTIPLE_INHERITANCE (pattern); | |
5466 | TYPE_USES_VIRTUAL_BASECLASSES (type) | |
5467 | = TYPE_USES_VIRTUAL_BASECLASSES (pattern); | |
5468 | TYPE_PACKED (type) = TYPE_PACKED (pattern); | |
5469 | TYPE_ALIGN (type) = TYPE_ALIGN (pattern); | |
11cf4d18 | 5470 | TYPE_USER_ALIGN (type) = TYPE_USER_ALIGN (pattern); |
eff71ab0 | 5471 | TYPE_FOR_JAVA (type) = TYPE_FOR_JAVA (pattern); /* For libjava's JArray<T> */ |
6bdb8141 JM |
5472 | if (ANON_AGGR_TYPE_P (pattern)) |
5473 | SET_ANON_AGGR_TYPE_P (type); | |
f7da6097 | 5474 | |
dbbf88d1 | 5475 | pbinfo = TYPE_BINFO (pattern); |
1456deaf JM |
5476 | |
5477 | #ifdef ENABLE_CHECKING | |
5478 | if (DECL_CLASS_SCOPE_P (TYPE_MAIN_DECL (pattern)) | |
5479 | && ! COMPLETE_TYPE_P (TYPE_CONTEXT (type)) | |
5480 | && ! TYPE_BEING_DEFINED (TYPE_CONTEXT (type))) | |
5481 | /* We should never instantiate a nested class before its enclosing | |
5482 | class; we need to look up the nested class by name before we can | |
5483 | instantiate it, and that lookup should instantiate the enclosing | |
5484 | class. */ | |
5485 | abort (); | |
5486 | #endif | |
5487 | ||
cad7e87b | 5488 | base_list = NULL_TREE; |
fa743e8c | 5489 | if (BINFO_N_BASE_BINFOS (pbinfo)) |
3fd71a52 | 5490 | { |
fa743e8c | 5491 | tree pbase_binfo; |
a2507277 | 5492 | tree context = TYPE_CONTEXT (type); |
91b004e5 | 5493 | bool pop_p; |
3fd71a52 | 5494 | int i; |
5566b478 | 5495 | |
a2507277 NS |
5496 | /* We must enter the scope containing the type, as that is where |
5497 | the accessibility of types named in dependent bases are | |
5498 | looked up from. */ | |
91b004e5 | 5499 | pop_p = push_scope (context ? context : global_namespace); |
a2507277 | 5500 | |
3fd71a52 MM |
5501 | /* Substitute into each of the bases to determine the actual |
5502 | basetypes. */ | |
fa743e8c | 5503 | for (i = 0; BINFO_BASE_ITERATE (pbinfo, i, pbase_binfo); i++) |
3fd71a52 MM |
5504 | { |
5505 | tree base; | |
fa743e8c | 5506 | tree access = BINFO_BASE_ACCESS (pbinfo, i); |
711734a9 | 5507 | |
dc957d14 | 5508 | /* Substitute to figure out the base class. */ |
fa743e8c | 5509 | base = tsubst (BINFO_TYPE (pbase_binfo), args, tf_error, NULL_TREE); |
3fd71a52 MM |
5510 | if (base == error_mark_node) |
5511 | continue; | |
dbbf88d1 | 5512 | |
3fd71a52 | 5513 | base_list = tree_cons (access, base, base_list); |
fa743e8c | 5514 | if (BINFO_VIRTUAL_P (pbase_binfo)) |
809e3e7f | 5515 | TREE_TYPE (base_list) = integer_type_node; |
3fd71a52 | 5516 | } |
dfbcd65a | 5517 | |
3fd71a52 MM |
5518 | /* The list is now in reverse order; correct that. */ |
5519 | base_list = nreverse (base_list); | |
5520 | ||
91b004e5 MM |
5521 | if (pop_p) |
5522 | pop_scope (context ? context : global_namespace); | |
3fd71a52 | 5523 | } |
cad7e87b NS |
5524 | /* Now call xref_basetypes to set up all the base-class |
5525 | information. */ | |
5526 | xref_basetypes (type, base_list); | |
5527 | ||
5566b478 | 5528 | |
b74a0560 MM |
5529 | /* Now that our base classes are set up, enter the scope of the |
5530 | class, so that name lookups into base classes, etc. will work | |
dc957d14 | 5531 | correctly. This is precisely analogous to what we do in |
b74a0560 MM |
5532 | begin_class_definition when defining an ordinary non-template |
5533 | class. */ | |
29370796 | 5534 | pushclass (type); |
b74a0560 | 5535 | |
7088fca9 | 5536 | /* Now members are processed in the order of declaration. */ |
8c6ab2db NS |
5537 | for (member = CLASSTYPE_DECL_LIST (pattern); |
5538 | member; member = TREE_CHAIN (member)) | |
8d08fdba | 5539 | { |
7088fca9 | 5540 | tree t = TREE_VALUE (member); |
5566b478 | 5541 | |
7088fca9 | 5542 | if (TREE_PURPOSE (member)) |
ed44da02 | 5543 | { |
7088fca9 KL |
5544 | if (TYPE_P (t)) |
5545 | { | |
5e0c54e5 | 5546 | /* Build new CLASSTYPE_NESTED_UTDS. */ |
8d08fdba | 5547 | |
7088fca9 KL |
5548 | tree tag = t; |
5549 | tree name = TYPE_IDENTIFIER (tag); | |
5550 | tree newtag; | |
ae58fa02 | 5551 | |
7088fca9 | 5552 | newtag = tsubst (tag, args, tf_error, NULL_TREE); |
2620d095 KL |
5553 | if (newtag == error_mark_node) |
5554 | continue; | |
5555 | ||
7088fca9 KL |
5556 | if (TREE_CODE (newtag) != ENUMERAL_TYPE) |
5557 | { | |
5558 | if (TYPE_LANG_SPECIFIC (tag) && CLASSTYPE_IS_TEMPLATE (tag)) | |
5559 | /* Unfortunately, lookup_template_class sets | |
5560 | CLASSTYPE_IMPLICIT_INSTANTIATION for a partial | |
3afd2e20 NS |
5561 | instantiation (i.e., for the type of a member |
5562 | template class nested within a template class.) | |
5563 | This behavior is required for | |
5564 | maybe_process_partial_specialization to work | |
5565 | correctly, but is not accurate in this case; | |
5566 | the TAG is not an instantiation of anything. | |
5567 | (The corresponding TEMPLATE_DECL is an | |
5568 | instantiation, but the TYPE is not.) */ | |
7088fca9 KL |
5569 | CLASSTYPE_USE_TEMPLATE (newtag) = 0; |
5570 | ||
5571 | /* Now, we call pushtag to put this NEWTAG into the scope of | |
5572 | TYPE. We first set up the IDENTIFIER_TYPE_VALUE to avoid | |
5573 | pushtag calling push_template_decl. We don't have to do | |
5574 | this for enums because it will already have been done in | |
5575 | tsubst_enum. */ | |
5576 | if (name) | |
5577 | SET_IDENTIFIER_TYPE_VALUE (name, newtag); | |
5578 | pushtag (name, newtag, /*globalize=*/0); | |
5579 | } | |
5580 | } | |
5581 | else if (TREE_CODE (t) == FUNCTION_DECL | |
5582 | || DECL_FUNCTION_TEMPLATE_P (t)) | |
5583 | { | |
5584 | /* Build new TYPE_METHODS. */ | |
fecafe5e NS |
5585 | tree r; |
5586 | ||
5587 | if (TREE_CODE (t) == TEMPLATE_DECL) | |
9579624e | 5588 | ++processing_template_decl; |
fecafe5e NS |
5589 | r = tsubst (t, args, tf_error, NULL_TREE); |
5590 | if (TREE_CODE (t) == TEMPLATE_DECL) | |
9579624e | 5591 | --processing_template_decl; |
7088fca9 KL |
5592 | set_current_access_from_decl (r); |
5593 | grok_special_member_properties (r); | |
5594 | finish_member_declaration (r); | |
5595 | } | |
5596 | else | |
5597 | { | |
5598 | /* Build new TYPE_FIELDS. */ | |
fa8d6e85 | 5599 | |
7088fca9 KL |
5600 | if (TREE_CODE (t) != CONST_DECL) |
5601 | { | |
5602 | tree r; | |
fa8d6e85 | 5603 | |
d479d37f NS |
5604 | /* The the file and line for this declaration, to |
5605 | assist in error message reporting. Since we | |
5606 | called push_tinst_level above, we don't need to | |
5607 | restore these. */ | |
f31686a3 | 5608 | input_location = DECL_SOURCE_LOCATION (t); |
fa8d6e85 | 5609 | |
fb5ce3c9 | 5610 | if (TREE_CODE (t) == TEMPLATE_DECL) |
9579624e | 5611 | ++processing_template_decl; |
7088fca9 | 5612 | r = tsubst (t, args, tf_error | tf_warning, NULL_TREE); |
fb5ce3c9 | 5613 | if (TREE_CODE (t) == TEMPLATE_DECL) |
9579624e | 5614 | --processing_template_decl; |
7088fca9 KL |
5615 | if (TREE_CODE (r) == VAR_DECL) |
5616 | { | |
5617 | tree init; | |
17f29637 | 5618 | |
7088fca9 KL |
5619 | if (DECL_INITIALIZED_IN_CLASS_P (r)) |
5620 | init = tsubst_expr (DECL_INITIAL (t), args, | |
5621 | tf_error | tf_warning, NULL_TREE); | |
5622 | else | |
5623 | init = NULL_TREE; | |
8d08fdba | 5624 | |
8c6ab2db NS |
5625 | finish_static_data_member_decl |
5626 | (r, init, /*asmspec_tree=*/NULL_TREE, /*flags=*/0); | |
8d08fdba | 5627 | |
7088fca9 KL |
5628 | if (DECL_INITIALIZED_IN_CLASS_P (r)) |
5629 | check_static_variable_definition (r, TREE_TYPE (r)); | |
5630 | } | |
5631 | else if (TREE_CODE (r) == FIELD_DECL) | |
5632 | { | |
5633 | /* Determine whether R has a valid type and can be | |
5634 | completed later. If R is invalid, then it is | |
5635 | replaced by error_mark_node so that it will not be | |
5636 | added to TYPE_FIELDS. */ | |
5637 | tree rtype = TREE_TYPE (r); | |
5638 | if (can_complete_type_without_circularity (rtype)) | |
5639 | complete_type (rtype); | |
5640 | ||
5641 | if (!COMPLETE_TYPE_P (rtype)) | |
5642 | { | |
5643 | cxx_incomplete_type_error (r, rtype); | |
5644 | r = error_mark_node; | |
5645 | } | |
5646 | } | |
5566b478 | 5647 | |
7088fca9 KL |
5648 | /* If it is a TYPE_DECL for a class-scoped ENUMERAL_TYPE, |
5649 | such a thing will already have been added to the field | |
5650 | list by tsubst_enum in finish_member_declaration in the | |
5e0c54e5 | 5651 | CLASSTYPE_NESTED_UTDS case above. */ |
7088fca9 KL |
5652 | if (!(TREE_CODE (r) == TYPE_DECL |
5653 | && TREE_CODE (TREE_TYPE (r)) == ENUMERAL_TYPE | |
43b26a01 | 5654 | && DECL_ARTIFICIAL (r))) |
7088fca9 KL |
5655 | { |
5656 | set_current_access_from_decl (r); | |
5657 | finish_member_declaration (r); | |
5658 | } | |
5659 | } | |
5660 | } | |
61fc8c9e | 5661 | } |
7088fca9 KL |
5662 | else |
5663 | { | |
5664 | if (TYPE_P (t) || DECL_CLASS_TEMPLATE_P (t)) | |
5665 | { | |
5666 | /* Build new CLASSTYPE_FRIEND_CLASSES. */ | |
5667 | ||
5668 | tree friend_type = t; | |
5669 | tree new_friend_type; | |
1aed5355 | 5670 | |
7088fca9 KL |
5671 | if (TREE_CODE (friend_type) == TEMPLATE_DECL) |
5672 | new_friend_type = tsubst_friend_class (friend_type, args); | |
5673 | else if (uses_template_parms (friend_type)) | |
5674 | new_friend_type = tsubst (friend_type, args, | |
5675 | tf_error | tf_warning, NULL_TREE); | |
c4d0910c KL |
5676 | else if (CLASSTYPE_USE_TEMPLATE (friend_type)) |
5677 | new_friend_type = friend_type; | |
7088fca9 KL |
5678 | else |
5679 | { | |
5680 | tree ns = decl_namespace_context (TYPE_MAIN_DECL (friend_type)); | |
5681 | ||
5682 | /* The call to xref_tag_from_type does injection for friend | |
5683 | classes. */ | |
5684 | push_nested_namespace (ns); | |
5685 | new_friend_type = | |
5686 | xref_tag_from_type (friend_type, NULL_TREE, 1); | |
5687 | pop_nested_namespace (ns); | |
5688 | } | |
1aed5355 | 5689 | |
7088fca9 KL |
5690 | if (TREE_CODE (friend_type) == TEMPLATE_DECL) |
5691 | /* Trick make_friend_class into realizing that the friend | |
5692 | we're adding is a template, not an ordinary class. It's | |
5693 | important that we use make_friend_class since it will | |
5694 | perform some error-checking and output cross-reference | |
5695 | information. */ | |
5696 | ++processing_template_decl; | |
fc378698 | 5697 | |
7088fca9 | 5698 | if (new_friend_type != error_mark_node) |
19db77ce KL |
5699 | make_friend_class (type, new_friend_type, |
5700 | /*complain=*/false); | |
fc378698 | 5701 | |
7088fca9 KL |
5702 | if (TREE_CODE (friend_type) == TEMPLATE_DECL) |
5703 | --processing_template_decl; | |
5704 | } | |
5705 | else | |
9579624e KL |
5706 | { |
5707 | /* Build new DECL_FRIENDLIST. */ | |
5708 | tree r; | |
5709 | ||
5710 | if (TREE_CODE (t) == TEMPLATE_DECL) | |
cad7e87b NS |
5711 | { |
5712 | ++processing_template_decl; | |
5713 | push_deferring_access_checks (dk_no_check); | |
5714 | } | |
5715 | ||
9579624e | 5716 | r = tsubst_friend_function (t, args); |
9579624e | 5717 | add_friend (type, r, /*complain=*/false); |
cad7e87b NS |
5718 | if (TREE_CODE (t) == TEMPLATE_DECL) |
5719 | { | |
5720 | pop_deferring_access_checks (); | |
5721 | --processing_template_decl; | |
5722 | } | |
9579624e | 5723 | } |
7088fca9 KL |
5724 | } |
5725 | } | |
5566b478 | 5726 | |
61a127b3 MM |
5727 | /* Set the file and line number information to whatever is given for |
5728 | the class itself. This puts error messages involving generated | |
5729 | implicit functions at a predictable point, and the same point | |
5730 | that would be used for non-template classes. */ | |
7088fca9 | 5731 | typedecl = TYPE_MAIN_DECL (type); |
f31686a3 | 5732 | input_location = DECL_SOURCE_LOCATION (typedecl); |
6de9cd9a | 5733 | |
61a127b3 | 5734 | unreverse_member_declarations (type); |
9f33663b | 5735 | finish_struct_1 (type); |
5524676d | 5736 | TYPE_BEING_DEFINED (type) = 0; |
8d08fdba | 5737 | |
9188c363 MM |
5738 | /* Now that the class is complete, instantiate default arguments for |
5739 | any member functions. We don't do this earlier because the | |
5740 | default arguments may reference members of the class. */ | |
5741 | if (!PRIMARY_TEMPLATE_P (template)) | |
5742 | for (t = TYPE_METHODS (type); t; t = TREE_CHAIN (t)) | |
5743 | if (TREE_CODE (t) == FUNCTION_DECL | |
dc957d14 | 5744 | /* Implicitly generated member functions will not have template |
9188c363 MM |
5745 | information; they are not instantiations, but instead are |
5746 | created "fresh" for each instantiation. */ | |
5747 | && DECL_TEMPLATE_INFO (t)) | |
5748 | tsubst_default_arguments (t); | |
5749 | ||
b74a0560 | 5750 | popclass (); |
5566b478 | 5751 | pop_from_top_level (); |
78757caa | 5752 | pop_deferring_access_checks (); |
5566b478 MS |
5753 | pop_tinst_level (); |
5754 | ||
4684cd27 MM |
5755 | /* The vtable for a template class can be emitted in any translation |
5756 | unit in which the class is instantiated. When there is no key | |
5757 | method, however, finish_struct_1 will already have added TYPE to | |
5758 | the keyed_classes list. */ | |
5759 | if (TYPE_CONTAINS_VPTR_P (type) && CLASSTYPE_KEY_METHOD (type)) | |
9aad8f83 MA |
5760 | keyed_classes = tree_cons (NULL_TREE, type, keyed_classes); |
5761 | ||
5566b478 | 5762 | return type; |
8d08fdba MS |
5763 | } |
5764 | ||
00d3396f | 5765 | static tree |
a91db711 | 5766 | tsubst_template_arg (tree t, tree args, tsubst_flags_t complain, tree in_decl) |
00d3396f | 5767 | { |
a91db711 NS |
5768 | tree r; |
5769 | ||
5770 | if (!t) | |
5771 | r = t; | |
5772 | else if (TYPE_P (t)) | |
5773 | r = tsubst (t, args, complain, in_decl); | |
5774 | else | |
00d3396f | 5775 | { |
a91db711 NS |
5776 | r = tsubst_expr (t, args, complain, in_decl); |
5777 | ||
5778 | if (!uses_template_parms (r)) | |
4d5f3fbd | 5779 | { |
a91db711 NS |
5780 | /* Sometimes, one of the args was an expression involving a |
5781 | template constant parameter, like N - 1. Now that we've | |
5782 | tsubst'd, we might have something like 2 - 1. This will | |
5783 | confuse lookup_template_class, so we do constant folding | |
5784 | here. We have to unset processing_template_decl, to fool | |
5785 | tsubst_copy_and_build() into building an actual tree. */ | |
5786 | ||
5787 | /* If the TREE_TYPE of ARG is not NULL_TREE, ARG is already | |
5788 | as simple as it's going to get, and trying to reprocess | |
5789 | the trees will break. Once tsubst_expr et al DTRT for | |
5790 | non-dependent exprs, this code can go away, as the type | |
5791 | will always be set. */ | |
5792 | if (!TREE_TYPE (r)) | |
5793 | { | |
5794 | int saved_processing_template_decl = processing_template_decl; | |
5795 | processing_template_decl = 0; | |
5796 | r = tsubst_copy_and_build (r, /*args=*/NULL_TREE, | |
5797 | tf_error, /*in_decl=*/NULL_TREE, | |
5798 | /*function_p=*/false); | |
5799 | processing_template_decl = saved_processing_template_decl; | |
5800 | } | |
5801 | r = fold (r); | |
4d5f3fbd | 5802 | } |
bd83b409 | 5803 | } |
a91db711 | 5804 | return r; |
bd83b409 NS |
5805 | } |
5806 | ||
a91db711 | 5807 | /* Substitute ARGS into the vector or list of template arguments T. */ |
830bfa74 | 5808 | |
e9659ab0 | 5809 | static tree |
a91db711 | 5810 | tsubst_template_args (tree t, tree args, tsubst_flags_t complain, tree in_decl) |
830bfa74 | 5811 | { |
bf12d54d | 5812 | int len = TREE_VEC_LENGTH (t); |
a91db711 | 5813 | int need_new = 0, i; |
c68b0a84 | 5814 | tree *elts = alloca (len * sizeof (tree)); |
830bfa74 | 5815 | |
830bfa74 MM |
5816 | for (i = 0; i < len; i++) |
5817 | { | |
bf12d54d NS |
5818 | tree orig_arg = TREE_VEC_ELT (t, i); |
5819 | tree new_arg; | |
a91db711 | 5820 | |
bf12d54d NS |
5821 | if (TREE_CODE (orig_arg) == TREE_VEC) |
5822 | new_arg = tsubst_template_args (orig_arg, args, complain, in_decl); | |
830bfa74 | 5823 | else |
a91db711 | 5824 | new_arg = tsubst_template_arg (orig_arg, args, complain, in_decl); |
830bfa74 | 5825 | |
a91db711 | 5826 | if (new_arg == error_mark_node) |
08e72a19 JM |
5827 | return error_mark_node; |
5828 | ||
a91db711 NS |
5829 | elts[i] = new_arg; |
5830 | if (new_arg != orig_arg) | |
830bfa74 MM |
5831 | need_new = 1; |
5832 | } | |
5833 | ||
5834 | if (!need_new) | |
5835 | return t; | |
a91db711 | 5836 | |
bf12d54d NS |
5837 | t = make_tree_vec (len); |
5838 | for (i = 0; i < len; i++) | |
5839 | TREE_VEC_ELT (t, i) = elts[i]; | |
830bfa74 MM |
5840 | |
5841 | return t; | |
5842 | } | |
5843 | ||
36a117a5 MM |
5844 | /* Return the result of substituting ARGS into the template parameters |
5845 | given by PARMS. If there are m levels of ARGS and m + n levels of | |
5846 | PARMS, then the result will contain n levels of PARMS. For | |
5847 | example, if PARMS is `template <class T> template <class U> | |
5848 | template <T*, U, class V>' and ARGS is {{int}, {double}} then the | |
5849 | result will be `template <int*, double, class V>'. */ | |
5850 | ||
e9659ab0 | 5851 | static tree |
3a978d72 | 5852 | tsubst_template_parms (tree parms, tree args, tsubst_flags_t complain) |
36a117a5 | 5853 | { |
f71f87f9 MM |
5854 | tree r = NULL_TREE; |
5855 | tree* new_parms; | |
36a117a5 MM |
5856 | |
5857 | for (new_parms = &r; | |
5858 | TMPL_PARMS_DEPTH (parms) > TMPL_ARGS_DEPTH (args); | |
5859 | new_parms = &(TREE_CHAIN (*new_parms)), | |
5860 | parms = TREE_CHAIN (parms)) | |
5861 | { | |
5862 | tree new_vec = | |
5863 | make_tree_vec (TREE_VEC_LENGTH (TREE_VALUE (parms))); | |
5864 | int i; | |
5865 | ||
5866 | for (i = 0; i < TREE_VEC_LENGTH (new_vec); ++i) | |
5867 | { | |
833aa4c4 NS |
5868 | tree tuple = TREE_VEC_ELT (TREE_VALUE (parms), i); |
5869 | tree default_value = TREE_PURPOSE (tuple); | |
5870 | tree parm_decl = TREE_VALUE (tuple); | |
5871 | ||
5872 | parm_decl = tsubst (parm_decl, args, complain, NULL_TREE); | |
a91db711 NS |
5873 | default_value = tsubst_template_arg (default_value, args, |
5874 | complain, NULL_TREE); | |
5875 | ||
5876 | tuple = build_tree_list (default_value, parm_decl); | |
833aa4c4 | 5877 | TREE_VEC_ELT (new_vec, i) = tuple; |
36a117a5 MM |
5878 | } |
5879 | ||
5880 | *new_parms = | |
4890c2f4 MM |
5881 | tree_cons (size_int (TMPL_PARMS_DEPTH (parms) |
5882 | - TMPL_ARGS_DEPTH (args)), | |
36a117a5 MM |
5883 | new_vec, NULL_TREE); |
5884 | } | |
5885 | ||
5886 | return r; | |
5887 | } | |
5888 | ||
ed44da02 MM |
5889 | /* Substitute the ARGS into the indicated aggregate (or enumeration) |
5890 | type T. If T is not an aggregate or enumeration type, it is | |
5891 | handled as if by tsubst. IN_DECL is as for tsubst. If | |
838dfd8a | 5892 | ENTERING_SCOPE is nonzero, T is the context for a template which |
dc957d14 | 5893 | we are presently tsubst'ing. Return the substituted value. */ |
36a117a5 | 5894 | |
e9659ab0 | 5895 | static tree |
3a978d72 NN |
5896 | tsubst_aggr_type (tree t, |
5897 | tree args, | |
5898 | tsubst_flags_t complain, | |
5899 | tree in_decl, | |
5900 | int entering_scope) | |
36a117a5 MM |
5901 | { |
5902 | if (t == NULL_TREE) | |
5903 | return NULL_TREE; | |
5904 | ||
5905 | switch (TREE_CODE (t)) | |
5906 | { | |
5907 | case RECORD_TYPE: | |
5908 | if (TYPE_PTRMEMFUNC_P (t)) | |
46c895ac | 5909 | return tsubst (TYPE_PTRMEMFUNC_FN_TYPE (t), args, complain, in_decl); |
36a117a5 | 5910 | |
f4f206f4 | 5911 | /* Else fall through. */ |
ed44da02 | 5912 | case ENUMERAL_TYPE: |
36a117a5 | 5913 | case UNION_TYPE: |
5db698f6 | 5914 | if (TYPE_TEMPLATE_INFO (t)) |
36a117a5 MM |
5915 | { |
5916 | tree argvec; | |
5917 | tree context; | |
5918 | tree r; | |
5919 | ||
5920 | /* First, determine the context for the type we are looking | |
5921 | up. */ | |
4f7847ca NS |
5922 | context = TYPE_CONTEXT (t); |
5923 | if (context) | |
5924 | context = tsubst_aggr_type (context, args, complain, | |
36a117a5 | 5925 | in_decl, /*entering_scope=*/1); |
36a117a5 MM |
5926 | |
5927 | /* Then, figure out what arguments are appropriate for the | |
5928 | type we are trying to find. For example, given: | |
5929 | ||
5930 | template <class T> struct S; | |
5931 | template <class T, class U> void f(T, U) { S<U> su; } | |
5932 | ||
5933 | and supposing that we are instantiating f<int, double>, | |
5934 | then our ARGS will be {int, double}, but, when looking up | |
5935 | S we only want {double}. */ | |
a91db711 NS |
5936 | argvec = tsubst_template_args (TYPE_TI_ARGS (t), args, |
5937 | complain, in_decl); | |
08e72a19 JM |
5938 | if (argvec == error_mark_node) |
5939 | return error_mark_node; | |
36a117a5 MM |
5940 | |
5941 | r = lookup_template_class (t, argvec, in_decl, context, | |
f9c244b8 | 5942 | entering_scope, complain); |
36a117a5 | 5943 | |
c2ea3a40 | 5944 | return cp_build_qualified_type_real (r, TYPE_QUALS (t), complain); |
36a117a5 MM |
5945 | } |
5946 | else | |
5947 | /* This is not a template type, so there's nothing to do. */ | |
5948 | return t; | |
5949 | ||
5950 | default: | |
4393e105 | 5951 | return tsubst (t, args, complain, in_decl); |
36a117a5 MM |
5952 | } |
5953 | } | |
5954 | ||
9188c363 MM |
5955 | /* Substitute into the default argument ARG (a default argument for |
5956 | FN), which has the indicated TYPE. */ | |
5957 | ||
5958 | tree | |
3a978d72 | 5959 | tsubst_default_argument (tree fn, tree type, tree arg) |
9188c363 | 5960 | { |
2436b51f MM |
5961 | tree saved_class_ptr = NULL_TREE; |
5962 | tree saved_class_ref = NULL_TREE; | |
5963 | ||
9188c363 MM |
5964 | /* This default argument came from a template. Instantiate the |
5965 | default argument here, not in tsubst. In the case of | |
5966 | something like: | |
5967 | ||
5968 | template <class T> | |
5969 | struct S { | |
5970 | static T t(); | |
5971 | void f(T = t()); | |
5972 | }; | |
5973 | ||
5974 | we must be careful to do name lookup in the scope of S<T>, | |
d5a10cf0 | 5975 | rather than in the current class. */ |
2b59fc25 | 5976 | push_access_scope (fn); |
c6671cbb MM |
5977 | /* The default argument expression should not be considered to be |
5978 | within the scope of FN. Since push_access_scope sets | |
5979 | current_function_decl, we must explicitly clear it here. */ | |
5980 | current_function_decl = NULL_TREE; | |
2436b51f MM |
5981 | /* The "this" pointer is not valid in a default argument. */ |
5982 | if (cfun) | |
5983 | { | |
5984 | saved_class_ptr = current_class_ptr; | |
5985 | cp_function_chain->x_current_class_ptr = NULL_TREE; | |
5986 | saved_class_ref = current_class_ref; | |
5987 | cp_function_chain->x_current_class_ref = NULL_TREE; | |
5988 | } | |
9188c363 | 5989 | |
d5a10cf0 | 5990 | push_deferring_access_checks(dk_no_deferred); |
c2ea3a40 NS |
5991 | arg = tsubst_expr (arg, DECL_TI_ARGS (fn), |
5992 | tf_error | tf_warning, NULL_TREE); | |
d5a10cf0 MM |
5993 | pop_deferring_access_checks(); |
5994 | ||
2436b51f MM |
5995 | /* Restore the "this" pointer. */ |
5996 | if (cfun) | |
5997 | { | |
5998 | cp_function_chain->x_current_class_ptr = saved_class_ptr; | |
5999 | cp_function_chain->x_current_class_ref = saved_class_ref; | |
6000 | } | |
6001 | ||
2b59fc25 | 6002 | pop_access_scope (fn); |
9188c363 MM |
6003 | |
6004 | /* Make sure the default argument is reasonable. */ | |
6005 | arg = check_default_argument (type, arg); | |
6006 | ||
6007 | return arg; | |
6008 | } | |
6009 | ||
6010 | /* Substitute into all the default arguments for FN. */ | |
6011 | ||
6012 | static void | |
3a978d72 | 6013 | tsubst_default_arguments (tree fn) |
9188c363 MM |
6014 | { |
6015 | tree arg; | |
6016 | tree tmpl_args; | |
6017 | ||
6018 | tmpl_args = DECL_TI_ARGS (fn); | |
6019 | ||
6020 | /* If this function is not yet instantiated, we certainly don't need | |
6021 | its default arguments. */ | |
6022 | if (uses_template_parms (tmpl_args)) | |
6023 | return; | |
6024 | ||
6025 | for (arg = TYPE_ARG_TYPES (TREE_TYPE (fn)); | |
6026 | arg; | |
6027 | arg = TREE_CHAIN (arg)) | |
6028 | if (TREE_PURPOSE (arg)) | |
6029 | TREE_PURPOSE (arg) = tsubst_default_argument (fn, | |
6030 | TREE_VALUE (arg), | |
6031 | TREE_PURPOSE (arg)); | |
6032 | } | |
6033 | ||
ae58fa02 MM |
6034 | /* Substitute the ARGS into the T, which is a _DECL. TYPE is the |
6035 | (already computed) substitution of ARGS into TREE_TYPE (T), if | |
c2ea3a40 NS |
6036 | appropriate. Return the result of the substitution. Issue error |
6037 | and warning messages under control of COMPLAIN. */ | |
00d3396f | 6038 | |
e9659ab0 | 6039 | static tree |
3a978d72 | 6040 | tsubst_decl (tree t, tree args, tree type, tsubst_flags_t complain) |
8d08fdba | 6041 | { |
82a98427 | 6042 | location_t saved_loc; |
b370501f | 6043 | tree r = NULL_TREE; |
4b2811e9 | 6044 | tree in_decl = t; |
830bfa74 | 6045 | |
ae58fa02 | 6046 | /* Set the filename and linenumber to improve error-reporting. */ |
82a98427 | 6047 | saved_loc = input_location; |
f31686a3 | 6048 | input_location = DECL_SOURCE_LOCATION (t); |
b7484fbe | 6049 | |
8d08fdba MS |
6050 | switch (TREE_CODE (t)) |
6051 | { | |
98c1c668 JM |
6052 | case TEMPLATE_DECL: |
6053 | { | |
6054 | /* We can get here when processing a member template function | |
6055 | of a template class. */ | |
98c1c668 | 6056 | tree decl = DECL_TEMPLATE_RESULT (t); |
386b8a85 | 6057 | tree spec; |
db2767b6 | 6058 | int is_template_template_parm = DECL_TEMPLATE_TEMPLATE_PARM_P (t); |
98c1c668 | 6059 | |
db2767b6 MM |
6060 | if (!is_template_template_parm) |
6061 | { | |
36a117a5 MM |
6062 | /* We might already have an instance of this template. |
6063 | The ARGS are for the surrounding class type, so the | |
6064 | full args contain the tsubst'd args for the context, | |
6065 | plus the innermost args from the template decl. */ | |
6066 | tree tmpl_args = DECL_CLASS_TEMPLATE_P (t) | |
6067 | ? CLASSTYPE_TI_ARGS (TREE_TYPE (t)) | |
17aec3eb | 6068 | : DECL_TI_ARGS (DECL_TEMPLATE_RESULT (t)); |
7ddedda4 MM |
6069 | tree full_args; |
6070 | ||
a91db711 NS |
6071 | full_args = tsubst_template_args (tmpl_args, args, |
6072 | complain, in_decl); | |
36a117a5 | 6073 | |
a91db711 | 6074 | /* tsubst_template_args doesn't copy the vector if |
36a117a5 MM |
6075 | nothing changed. But, *something* should have |
6076 | changed. */ | |
6077 | my_friendly_assert (full_args != tmpl_args, 0); | |
6078 | ||
6079 | spec = retrieve_specialization (t, full_args); | |
db2767b6 | 6080 | if (spec != NULL_TREE) |
ae58fa02 MM |
6081 | { |
6082 | r = spec; | |
6083 | break; | |
6084 | } | |
db2767b6 | 6085 | } |
98c1c668 JM |
6086 | |
6087 | /* Make a new template decl. It will be similar to the | |
6088 | original, but will record the current template arguments. | |
6089 | We also create a new function declaration, which is just | |
6090 | like the old one, but points to this new template, rather | |
6091 | than the old one. */ | |
0acf7199 | 6092 | r = copy_decl (t); |
ae58fa02 MM |
6093 | my_friendly_assert (DECL_LANG_SPECIFIC (r) != 0, 0); |
6094 | TREE_CHAIN (r) = NULL_TREE; | |
db2767b6 MM |
6095 | |
6096 | if (is_template_template_parm) | |
6097 | { | |
c2ea3a40 | 6098 | tree new_decl = tsubst (decl, args, complain, in_decl); |
17aec3eb | 6099 | DECL_TEMPLATE_RESULT (r) = new_decl; |
ae58fa02 MM |
6100 | TREE_TYPE (r) = TREE_TYPE (new_decl); |
6101 | break; | |
db2767b6 MM |
6102 | } |
6103 | ||
ae58fa02 | 6104 | DECL_CONTEXT (r) |
4f1c5b7d | 6105 | = tsubst_aggr_type (DECL_CONTEXT (t), args, |
c2ea3a40 | 6106 | complain, in_decl, |
4393e105 | 6107 | /*entering_scope=*/1); |
ae58fa02 | 6108 | DECL_TEMPLATE_INFO (r) = build_tree_list (t, args); |
93cdc044 JM |
6109 | |
6110 | if (TREE_CODE (decl) == TYPE_DECL) | |
6111 | { | |
c2ea3a40 | 6112 | tree new_type = tsubst (TREE_TYPE (t), args, complain, in_decl); |
2620d095 KL |
6113 | if (new_type == error_mark_node) |
6114 | return error_mark_node; | |
6115 | ||
ae58fa02 MM |
6116 | TREE_TYPE (r) = new_type; |
6117 | CLASSTYPE_TI_TEMPLATE (new_type) = r; | |
17aec3eb | 6118 | DECL_TEMPLATE_RESULT (r) = TYPE_MAIN_DECL (new_type); |
ae58fa02 | 6119 | DECL_TI_ARGS (r) = CLASSTYPE_TI_ARGS (new_type); |
93cdc044 JM |
6120 | } |
6121 | else | |
6122 | { | |
c2ea3a40 | 6123 | tree new_decl = tsubst (decl, args, complain, in_decl); |
caec1dc0 KL |
6124 | if (new_decl == error_mark_node) |
6125 | return error_mark_node; | |
17aec3eb RK |
6126 | |
6127 | DECL_TEMPLATE_RESULT (r) = new_decl; | |
ae58fa02 MM |
6128 | DECL_TI_TEMPLATE (new_decl) = r; |
6129 | TREE_TYPE (r) = TREE_TYPE (new_decl); | |
6130 | DECL_TI_ARGS (r) = DECL_TI_ARGS (new_decl); | |
93cdc044 JM |
6131 | } |
6132 | ||
ae58fa02 MM |
6133 | SET_DECL_IMPLICIT_INSTANTIATION (r); |
6134 | DECL_TEMPLATE_INSTANTIATIONS (r) = NULL_TREE; | |
6135 | DECL_TEMPLATE_SPECIALIZATIONS (r) = NULL_TREE; | |
98c1c668 JM |
6136 | |
6137 | /* The template parameters for this new template are all the | |
6138 | template parameters for the old template, except the | |
c6002625 | 6139 | outermost level of parameters. */ |
ae58fa02 | 6140 | DECL_TEMPLATE_PARMS (r) |
4393e105 | 6141 | = tsubst_template_parms (DECL_TEMPLATE_PARMS (t), args, |
c2ea3a40 | 6142 | complain); |
98c1c668 | 6143 | |
93cdc044 | 6144 | if (PRIMARY_TEMPLATE_P (t)) |
ae58fa02 | 6145 | DECL_PRIMARY_TEMPLATE (r) = r; |
93cdc044 | 6146 | |
8c6ab2db NS |
6147 | if (TREE_CODE (decl) != TYPE_DECL) |
6148 | /* Record this non-type partial instantiation. */ | |
6149 | register_specialization (r, t, | |
6150 | DECL_TI_ARGS (DECL_TEMPLATE_RESULT (r))); | |
98c1c668 | 6151 | } |
ae58fa02 | 6152 | break; |
8d08fdba MS |
6153 | |
6154 | case FUNCTION_DECL: | |
6155 | { | |
386b8a85 | 6156 | tree ctx; |
87603ed0 | 6157 | tree argvec = NULL_TREE; |
cf38f48a | 6158 | tree *friends; |
36a117a5 | 6159 | tree gen_tmpl; |
5566b478 | 6160 | int member; |
d8c4447d MM |
6161 | int args_depth; |
6162 | int parms_depth; | |
5566b478 | 6163 | |
36a117a5 MM |
6164 | /* Nobody should be tsubst'ing into non-template functions. */ |
6165 | my_friendly_assert (DECL_TEMPLATE_INFO (t) != NULL_TREE, 0); | |
6166 | ||
6167 | if (TREE_CODE (DECL_TI_TEMPLATE (t)) == TEMPLATE_DECL) | |
6168 | { | |
6169 | tree spec; | |
00cf3e31 MM |
6170 | bool dependent_p; |
6171 | ||
6172 | /* If T is not dependent, just return it. We have to | |
6173 | increment PROCESSING_TEMPLATE_DECL because | |
6174 | value_dependent_expression_p assumes that nothing is | |
6175 | dependent when PROCESSING_TEMPLATE_DECL is zero. */ | |
6176 | ++processing_template_decl; | |
6177 | dependent_p = value_dependent_expression_p (t); | |
6178 | --processing_template_decl; | |
6179 | if (!dependent_p) | |
6180 | return t; | |
36a117a5 MM |
6181 | |
6182 | /* Calculate the most general template of which R is a | |
6183 | specialization, and the complete set of arguments used to | |
6184 | specialize R. */ | |
6185 | gen_tmpl = most_general_template (DECL_TI_TEMPLATE (t)); | |
a91db711 NS |
6186 | argvec = tsubst_template_args (DECL_TI_ARGS |
6187 | (DECL_TEMPLATE_RESULT (gen_tmpl)), | |
6188 | args, complain, in_decl); | |
36a117a5 MM |
6189 | |
6190 | /* Check to see if we already have this specialization. */ | |
6191 | spec = retrieve_specialization (gen_tmpl, argvec); | |
7ddedda4 | 6192 | |
36a117a5 | 6193 | if (spec) |
ae58fa02 MM |
6194 | { |
6195 | r = spec; | |
6196 | break; | |
6197 | } | |
d8c4447d | 6198 | |
f9a7ae04 MM |
6199 | /* We can see more levels of arguments than parameters if |
6200 | there was a specialization of a member template, like | |
6201 | this: | |
6202 | ||
6203 | template <class T> struct S { template <class U> void f(); } | |
6204 | template <> template <class U> void S<int>::f(U); | |
6205 | ||
dc957d14 | 6206 | Here, we'll be substituting into the specialization, |
f9a7ae04 MM |
6207 | because that's where we can find the code we actually |
6208 | want to generate, but we'll have enough arguments for | |
6209 | the most general template. | |
6210 | ||
6211 | We also deal with the peculiar case: | |
d8c4447d MM |
6212 | |
6213 | template <class T> struct S { | |
6214 | template <class U> friend void f(); | |
6215 | }; | |
74b846e0 | 6216 | template <class U> void f() {} |
d8c4447d MM |
6217 | template S<int>; |
6218 | template void f<double>(); | |
6219 | ||
6220 | Here, the ARGS for the instantiation of will be {int, | |
6221 | double}. But, we only need as many ARGS as there are | |
6222 | levels of template parameters in CODE_PATTERN. We are | |
6223 | careful not to get fooled into reducing the ARGS in | |
6224 | situations like: | |
6225 | ||
6226 | template <class T> struct S { template <class U> void f(U); } | |
6227 | template <class T> template <> void S<T>::f(int) {} | |
6228 | ||
6229 | which we can spot because the pattern will be a | |
6230 | specialization in this case. */ | |
6231 | args_depth = TMPL_ARGS_DEPTH (args); | |
6232 | parms_depth = | |
6233 | TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (DECL_TI_TEMPLATE (t))); | |
6234 | if (args_depth > parms_depth | |
6235 | && !DECL_TEMPLATE_SPECIALIZATION (t)) | |
f9a7ae04 | 6236 | args = get_innermost_template_args (args, parms_depth); |
36a117a5 MM |
6237 | } |
6238 | else | |
6239 | { | |
6240 | /* This special case arises when we have something like this: | |
6241 | ||
6242 | template <class T> struct S { | |
6243 | friend void f<int>(int, double); | |
6244 | }; | |
6245 | ||
6246 | Here, the DECL_TI_TEMPLATE for the friend declaration | |
10b1d5e7 MM |
6247 | will be an IDENTIFIER_NODE. We are being called from |
6248 | tsubst_friend_function, and we want only to create a | |
6249 | new decl (R) with appropriate types so that we can call | |
6250 | determine_specialization. */ | |
36a117a5 MM |
6251 | gen_tmpl = NULL_TREE; |
6252 | } | |
6253 | ||
6eb3bb27 | 6254 | if (DECL_CLASS_SCOPE_P (t)) |
8d08fdba | 6255 | { |
5566b478 MS |
6256 | if (DECL_NAME (t) == constructor_name (DECL_CONTEXT (t))) |
6257 | member = 2; | |
6258 | else | |
6259 | member = 1; | |
4f1c5b7d | 6260 | ctx = tsubst_aggr_type (DECL_CONTEXT (t), args, |
8c6ab2db | 6261 | complain, t, /*entering_scope=*/1); |
5566b478 MS |
6262 | } |
6263 | else | |
6264 | { | |
6265 | member = 0; | |
4f1c5b7d | 6266 | ctx = DECL_CONTEXT (t); |
5566b478 | 6267 | } |
c2ea3a40 | 6268 | type = tsubst (type, args, complain, in_decl); |
b3da7bb1 MM |
6269 | if (type == error_mark_node) |
6270 | return error_mark_node; | |
8d08fdba | 6271 | |
5566b478 MS |
6272 | /* We do NOT check for matching decls pushed separately at this |
6273 | point, as they may not represent instantiations of this | |
6274 | template, and in any case are considered separate under the | |
0a7394bc | 6275 | discrete model. */ |
0acf7199 | 6276 | r = copy_decl (t); |
e1467ff2 | 6277 | DECL_USE_TEMPLATE (r) = 0; |
5566b478 | 6278 | TREE_TYPE (r) = type; |
92643fea MM |
6279 | /* Clear out the mangled name and RTL for the instantiation. */ |
6280 | SET_DECL_ASSEMBLER_NAME (r, NULL_TREE); | |
6281 | SET_DECL_RTL (r, NULL_RTX); | |
5bd61841 | 6282 | DECL_INITIAL (r) = NULL_TREE; |
4f1c5b7d | 6283 | DECL_CONTEXT (r) = ctx; |
5566b478 | 6284 | |
1f6e1acc | 6285 | if (member && DECL_CONV_FN_P (r)) |
1f84ec23 MM |
6286 | /* Type-conversion operator. Reconstruct the name, in |
6287 | case it's the name of one of the template's parameters. */ | |
6288 | DECL_NAME (r) = mangle_conv_op_name_for_type (TREE_TYPE (type)); | |
5566b478 | 6289 | |
4393e105 | 6290 | DECL_ARGUMENTS (r) = tsubst (DECL_ARGUMENTS (t), args, |
c2ea3a40 | 6291 | complain, t); |
477f6664 | 6292 | DECL_RESULT (r) = NULL_TREE; |
711734a9 JM |
6293 | |
6294 | TREE_STATIC (r) = 0; | |
6295 | TREE_PUBLIC (r) = TREE_PUBLIC (t); | |
6296 | DECL_EXTERNAL (r) = 1; | |
4684cd27 MM |
6297 | /* If this is an instantiation of a function with internal |
6298 | linkage, we already know what object file linkage will be | |
6299 | assigned to the instantiation. */ | |
6300 | DECL_INTERFACE_KNOWN (r) = !TREE_PUBLIC (r); | |
711734a9 JM |
6301 | DECL_DEFER_OUTPUT (r) = 0; |
6302 | TREE_CHAIN (r) = NULL_TREE; | |
6303 | DECL_PENDING_INLINE_INFO (r) = 0; | |
59026e79 | 6304 | DECL_PENDING_INLINE_P (r) = 0; |
655dc6ee | 6305 | DECL_SAVED_TREE (r) = NULL_TREE; |
711734a9 | 6306 | TREE_USED (r) = 0; |
db9b2174 MM |
6307 | if (DECL_CLONED_FUNCTION (r)) |
6308 | { | |
6309 | DECL_CLONED_FUNCTION (r) = tsubst (DECL_CLONED_FUNCTION (t), | |
c2ea3a40 | 6310 | args, complain, t); |
db9b2174 MM |
6311 | TREE_CHAIN (r) = TREE_CHAIN (DECL_CLONED_FUNCTION (r)); |
6312 | TREE_CHAIN (DECL_CLONED_FUNCTION (r)) = r; | |
6313 | } | |
711734a9 | 6314 | |
92643fea MM |
6315 | /* Set up the DECL_TEMPLATE_INFO for R. There's no need to do |
6316 | this in the special friend case mentioned above where | |
6317 | GEN_TMPL is NULL. */ | |
36a117a5 | 6318 | if (gen_tmpl) |
386b8a85 | 6319 | { |
36a117a5 | 6320 | DECL_TEMPLATE_INFO (r) |
e1b3e07d | 6321 | = tree_cons (gen_tmpl, argvec, NULL_TREE); |
36a117a5 MM |
6322 | SET_DECL_IMPLICIT_INSTANTIATION (r); |
6323 | register_specialization (r, gen_tmpl, argvec); | |
6324 | ||
9188c363 MM |
6325 | /* We're not supposed to instantiate default arguments |
6326 | until they are called, for a template. But, for a | |
6327 | declaration like: | |
6328 | ||
6329 | template <class T> void f () | |
6330 | { extern void g(int i = T()); } | |
6331 | ||
6332 | we should do the substitution when the template is | |
6333 | instantiated. We handle the member function case in | |
6334 | instantiate_class_template since the default arguments | |
6335 | might refer to other members of the class. */ | |
6336 | if (!member | |
6337 | && !PRIMARY_TEMPLATE_P (gen_tmpl) | |
6338 | && !uses_template_parms (argvec)) | |
6339 | tsubst_default_arguments (r); | |
386b8a85 | 6340 | } |
f181d4ae | 6341 | |
cf38f48a MM |
6342 | /* Copy the list of befriending classes. */ |
6343 | for (friends = &DECL_BEFRIENDING_CLASSES (r); | |
6344 | *friends; | |
6345 | friends = &TREE_CHAIN (*friends)) | |
6346 | { | |
6347 | *friends = copy_node (*friends); | |
6348 | TREE_VALUE (*friends) = tsubst (TREE_VALUE (*friends), | |
c2ea3a40 | 6349 | args, complain, |
cf38f48a MM |
6350 | in_decl); |
6351 | } | |
6352 | ||
212e7048 | 6353 | if (DECL_CONSTRUCTOR_P (r) || DECL_DESTRUCTOR_P (r)) |
f181d4ae MM |
6354 | { |
6355 | maybe_retrofit_in_chrg (r); | |
212e7048 MM |
6356 | if (DECL_CONSTRUCTOR_P (r)) |
6357 | grok_ctor_properties (ctx, r); | |
2be678ff JM |
6358 | /* If this is an instantiation of a member template, clone it. |
6359 | If it isn't, that'll be handled by | |
6360 | clone_constructors_and_destructors. */ | |
5e818b93 | 6361 | if (PRIMARY_TEMPLATE_P (gen_tmpl)) |
271e6f02 | 6362 | clone_function_decl (r, /*update_method_vec_p=*/0); |
f181d4ae | 6363 | } |
596ea4e5 | 6364 | else if (IDENTIFIER_OPNAME_P (DECL_NAME (r))) |
4b0d3cbe MM |
6365 | grok_op_properties (r, DECL_FRIEND_P (r), |
6366 | (complain & tf_error) != 0); | |
c8b2e872 MM |
6367 | |
6368 | if (DECL_FRIEND_P (t) && DECL_FRIEND_CONTEXT (t)) | |
6369 | SET_DECL_FRIEND_CONTEXT (r, | |
6370 | tsubst (DECL_FRIEND_CONTEXT (t), | |
6371 | args, complain, in_decl)); | |
8d08fdba | 6372 | } |
ae58fa02 | 6373 | break; |
8d08fdba MS |
6374 | |
6375 | case PARM_DECL: | |
6376 | { | |
ae58fa02 | 6377 | r = copy_node (t); |
833aa4c4 NS |
6378 | if (DECL_TEMPLATE_PARM_P (t)) |
6379 | SET_DECL_TEMPLATE_PARM_P (r); | |
8e51619a | 6380 | |
5566b478 | 6381 | TREE_TYPE (r) = type; |
89d684bb | 6382 | c_apply_type_quals_to_decl (cp_type_quals (type), r); |
1b8899d1 | 6383 | |
560ad596 MM |
6384 | if (DECL_INITIAL (r)) |
6385 | { | |
6386 | if (TREE_CODE (DECL_INITIAL (r)) != TEMPLATE_PARM_INDEX) | |
6387 | DECL_INITIAL (r) = TREE_TYPE (r); | |
6388 | else | |
6389 | DECL_INITIAL (r) = tsubst (DECL_INITIAL (r), args, | |
6390 | complain, in_decl); | |
6391 | } | |
db2767b6 | 6392 | |
5566b478 | 6393 | DECL_CONTEXT (r) = NULL_TREE; |
8e51619a JM |
6394 | |
6395 | if (!DECL_TEMPLATE_PARM_P (r)) | |
6396 | DECL_ARG_TYPE (r) = type_passed_as (type); | |
8d08fdba | 6397 | if (TREE_CHAIN (t)) |
4393e105 | 6398 | TREE_CHAIN (r) = tsubst (TREE_CHAIN (t), args, |
c2ea3a40 | 6399 | complain, TREE_CHAIN (t)); |
8d08fdba | 6400 | } |
ae58fa02 | 6401 | break; |
8d08fdba | 6402 | |
5566b478 MS |
6403 | case FIELD_DECL: |
6404 | { | |
0acf7199 | 6405 | r = copy_decl (t); |
1b8899d1 | 6406 | TREE_TYPE (r) = type; |
89d684bb | 6407 | c_apply_type_quals_to_decl (cp_type_quals (type), r); |
1b8899d1 MM |
6408 | |
6409 | /* We don't have to set DECL_CONTEXT here; it is set by | |
6410 | finish_member_declaration. */ | |
4393e105 | 6411 | DECL_INITIAL (r) = tsubst_expr (DECL_INITIAL (t), args, |
c2ea3a40 | 6412 | complain, in_decl); |
5566b478 | 6413 | TREE_CHAIN (r) = NULL_TREE; |
dfbb4f34 NS |
6414 | if (VOID_TYPE_P (type)) |
6415 | cp_error_at ("instantiation of `%D' as type `%T'", r, type); | |
5566b478 | 6416 | } |
ae58fa02 | 6417 | break; |
5566b478 MS |
6418 | |
6419 | case USING_DECL: | |
6420 | { | |
ae58fa02 | 6421 | r = copy_node (t); |
fd9aef9d NS |
6422 | /* It is not a dependent using decl any more. */ |
6423 | TREE_TYPE (r) = void_type_node; | |
5566b478 | 6424 | DECL_INITIAL (r) |
c2ea3a40 | 6425 | = tsubst_copy (DECL_INITIAL (t), args, complain, in_decl); |
53400b9e GB |
6426 | DECL_NAME (r) |
6427 | = tsubst_copy (DECL_NAME (t), args, complain, in_decl); | |
5566b478 | 6428 | TREE_CHAIN (r) = NULL_TREE; |
5566b478 | 6429 | } |
ae58fa02 | 6430 | break; |
5566b478 | 6431 | |
9188c363 | 6432 | case TYPE_DECL: |
88e1b92a JM |
6433 | if (TREE_CODE (type) == TEMPLATE_TEMPLATE_PARM |
6434 | || t == TYPE_MAIN_DECL (TREE_TYPE (t))) | |
9188c363 | 6435 | { |
88e1b92a JM |
6436 | /* If this is the canonical decl, we don't have to mess with |
6437 | instantiations, and often we can't (for typename, template | |
6438 | type parms and such). Note that TYPE_NAME is not correct for | |
6439 | the above test if we've copied the type for a typedef. */ | |
b9f39201 | 6440 | r = TYPE_NAME (type); |
9188c363 MM |
6441 | break; |
6442 | } | |
6443 | ||
6444 | /* Fall through. */ | |
6445 | ||
5566b478 MS |
6446 | case VAR_DECL: |
6447 | { | |
1cea0434 KG |
6448 | tree argvec = NULL_TREE; |
6449 | tree gen_tmpl = NULL_TREE; | |
36a117a5 | 6450 | tree spec; |
1cea0434 | 6451 | tree tmpl = NULL_TREE; |
9188c363 | 6452 | tree ctx; |
6dfbb909 | 6453 | int local_p; |
9188c363 | 6454 | |
6dfbb909 MM |
6455 | /* Assume this is a non-local variable. */ |
6456 | local_p = 0; | |
5566b478 | 6457 | |
de96bf57 | 6458 | if (TYPE_P (CP_DECL_CONTEXT (t))) |
9188c363 | 6459 | ctx = tsubst_aggr_type (DECL_CONTEXT (t), args, |
c2ea3a40 | 6460 | complain, |
9188c363 | 6461 | in_decl, /*entering_scope=*/1); |
2ba9c47e MM |
6462 | else if (DECL_NAMESPACE_SCOPE_P (t)) |
6463 | ctx = DECL_CONTEXT (t); | |
9188c363 | 6464 | else |
6dfbb909 MM |
6465 | { |
6466 | /* Subsequent calls to pushdecl will fill this in. */ | |
6467 | ctx = NULL_TREE; | |
2ba9c47e | 6468 | local_p = 1; |
6dfbb909 | 6469 | } |
9188c363 | 6470 | |
36a117a5 | 6471 | /* Check to see if we already have this specialization. */ |
6dfbb909 MM |
6472 | if (!local_p) |
6473 | { | |
6474 | tmpl = DECL_TI_TEMPLATE (t); | |
6475 | gen_tmpl = most_general_template (tmpl); | |
c2ea3a40 | 6476 | argvec = tsubst (DECL_TI_ARGS (t), args, complain, in_decl); |
6dfbb909 MM |
6477 | spec = retrieve_specialization (gen_tmpl, argvec); |
6478 | } | |
9188c363 | 6479 | else |
6dfbb909 | 6480 | spec = retrieve_local_specialization (t); |
9188c363 | 6481 | |
36a117a5 | 6482 | if (spec) |
ae58fa02 MM |
6483 | { |
6484 | r = spec; | |
6485 | break; | |
6486 | } | |
5566b478 | 6487 | |
0acf7199 | 6488 | r = copy_decl (t); |
edebf865 | 6489 | if (TREE_CODE (r) == VAR_DECL) |
39703eb9 MM |
6490 | { |
6491 | type = complete_type (type); | |
6492 | DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (r) | |
6493 | = DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (t); | |
6494 | } | |
a3d87771 MM |
6495 | else if (DECL_SELF_REFERENCE_P (t)) |
6496 | SET_DECL_SELF_REFERENCE_P (r); | |
01f4137f | 6497 | TREE_TYPE (r) = type; |
89d684bb | 6498 | c_apply_type_quals_to_decl (cp_type_quals (type), r); |
5566b478 | 6499 | DECL_CONTEXT (r) = ctx; |
92643fea MM |
6500 | /* Clear out the mangled name and RTL for the instantiation. */ |
6501 | SET_DECL_ASSEMBLER_NAME (r, NULL_TREE); | |
6502 | SET_DECL_RTL (r, NULL_RTX); | |
d11ad92e MS |
6503 | |
6504 | /* Don't try to expand the initializer until someone tries to use | |
6505 | this variable; otherwise we run into circular dependencies. */ | |
6506 | DECL_INITIAL (r) = NULL_TREE; | |
19e7881c | 6507 | SET_DECL_RTL (r, NULL_RTX); |
06ceef4e | 6508 | DECL_SIZE (r) = DECL_SIZE_UNIT (r) = 0; |
5566b478 | 6509 | |
e0942dcd MM |
6510 | /* Even if the original location is out of scope, the newly |
6511 | substituted one is not. */ | |
6512 | if (TREE_CODE (r) == VAR_DECL) | |
17bbb839 MM |
6513 | { |
6514 | DECL_DEAD_FOR_LOCAL (r) = 0; | |
6515 | DECL_INITIALIZED_P (r) = 0; | |
6516 | } | |
e0942dcd | 6517 | |
6dfbb909 MM |
6518 | if (!local_p) |
6519 | { | |
6520 | /* A static data member declaration is always marked | |
6521 | external when it is declared in-class, even if an | |
6522 | initializer is present. We mimic the non-template | |
6523 | processing here. */ | |
6524 | DECL_EXTERNAL (r) = 1; | |
fa8d6e85 | 6525 | |
6dfbb909 MM |
6526 | register_specialization (r, gen_tmpl, argvec); |
6527 | DECL_TEMPLATE_INFO (r) = tree_cons (tmpl, argvec, NULL_TREE); | |
6528 | SET_DECL_IMPLICIT_INSTANTIATION (r); | |
6529 | } | |
9188c363 | 6530 | else |
6dfbb909 | 6531 | register_local_specialization (r, t); |
5566b478 | 6532 | |
5566b478 | 6533 | TREE_CHAIN (r) = NULL_TREE; |
dfbb4f34 NS |
6534 | if (TREE_CODE (r) == VAR_DECL && VOID_TYPE_P (type)) |
6535 | cp_error_at ("instantiation of `%D' as type `%T'", r, type); | |
edebf865 MM |
6536 | /* Compute the size, alignment, etc. of R. */ |
6537 | layout_decl (r, 0); | |
5566b478 | 6538 | } |
ae58fa02 | 6539 | break; |
5566b478 | 6540 | |
ae58fa02 | 6541 | default: |
a98facb0 | 6542 | abort (); |
ae58fa02 MM |
6543 | } |
6544 | ||
6545 | /* Restore the file and line information. */ | |
82a98427 | 6546 | input_location = saved_loc; |
ae58fa02 MM |
6547 | |
6548 | return r; | |
6549 | } | |
6550 | ||
34cd5ae7 | 6551 | /* Substitute into the ARG_TYPES of a function type. */ |
cabc336a | 6552 | |
e9659ab0 | 6553 | static tree |
3a978d72 NN |
6554 | tsubst_arg_types (tree arg_types, |
6555 | tree args, | |
6556 | tsubst_flags_t complain, | |
6557 | tree in_decl) | |
cabc336a MM |
6558 | { |
6559 | tree remaining_arg_types; | |
cabc336a MM |
6560 | tree type; |
6561 | ||
6562 | if (!arg_types || arg_types == void_list_node) | |
6563 | return arg_types; | |
6564 | ||
6565 | remaining_arg_types = tsubst_arg_types (TREE_CHAIN (arg_types), | |
4393e105 MM |
6566 | args, complain, in_decl); |
6567 | if (remaining_arg_types == error_mark_node) | |
6568 | return error_mark_node; | |
6569 | ||
6570 | type = tsubst (TREE_VALUE (arg_types), args, complain, in_decl); | |
6571 | if (type == error_mark_node) | |
6572 | return error_mark_node; | |
4b2811e9 NS |
6573 | if (VOID_TYPE_P (type)) |
6574 | { | |
c2ea3a40 | 6575 | if (complain & tf_error) |
4b2811e9 | 6576 | { |
33bd39a2 | 6577 | error ("invalid parameter type `%T'", type); |
4b2811e9 NS |
6578 | if (in_decl) |
6579 | cp_error_at ("in declaration `%D'", in_decl); | |
6580 | } | |
6581 | return error_mark_node; | |
6582 | } | |
cabc336a | 6583 | |
4393e105 MM |
6584 | /* Do array-to-pointer, function-to-pointer conversion, and ignore |
6585 | top-level qualifiers as required. */ | |
6586 | type = TYPE_MAIN_VARIANT (type_decays_to (type)); | |
cabc336a MM |
6587 | |
6588 | /* Note that we do not substitute into default arguments here. The | |
6589 | standard mandates that they be instantiated only when needed, | |
6590 | which is done in build_over_call. */ | |
51632249 JM |
6591 | return hash_tree_cons (TREE_PURPOSE (arg_types), type, |
6592 | remaining_arg_types); | |
cabc336a MM |
6593 | |
6594 | } | |
6595 | ||
4393e105 MM |
6596 | /* Substitute into a FUNCTION_TYPE or METHOD_TYPE. This routine does |
6597 | *not* handle the exception-specification for FNTYPE, because the | |
6598 | initial substitution of explicitly provided template parameters | |
6599 | during argument deduction forbids substitution into the | |
6600 | exception-specification: | |
6601 | ||
6602 | [temp.deduct] | |
6603 | ||
6604 | All references in the function type of the function template to the | |
6605 | corresponding template parameters are replaced by the specified tem- | |
6606 | plate argument values. If a substitution in a template parameter or | |
6607 | in the function type of the function template results in an invalid | |
6608 | type, type deduction fails. [Note: The equivalent substitution in | |
6609 | exception specifications is done only when the function is instanti- | |
6610 | ated, at which point a program is ill-formed if the substitution | |
6611 | results in an invalid type.] */ | |
6612 | ||
6613 | static tree | |
3a978d72 NN |
6614 | tsubst_function_type (tree t, |
6615 | tree args, | |
6616 | tsubst_flags_t complain, | |
6617 | tree in_decl) | |
4393e105 MM |
6618 | { |
6619 | tree return_type; | |
6620 | tree arg_types; | |
6621 | tree fntype; | |
6622 | ||
8dd3f57a | 6623 | /* The TYPE_CONTEXT is not used for function/method types. */ |
4393e105 MM |
6624 | my_friendly_assert (TYPE_CONTEXT (t) == NULL_TREE, 0); |
6625 | ||
46c895ac | 6626 | /* Substitute the return type. */ |
4393e105 MM |
6627 | return_type = tsubst (TREE_TYPE (t), args, complain, in_decl); |
6628 | if (return_type == error_mark_node) | |
6629 | return error_mark_node; | |
6630 | ||
34cd5ae7 | 6631 | /* Substitute the argument types. */ |
4393e105 MM |
6632 | arg_types = tsubst_arg_types (TYPE_ARG_TYPES (t), args, |
6633 | complain, in_decl); | |
6634 | if (arg_types == error_mark_node) | |
6635 | return error_mark_node; | |
6636 | ||
6637 | /* Construct a new type node and return it. */ | |
6638 | if (TREE_CODE (t) == FUNCTION_TYPE) | |
6639 | fntype = build_function_type (return_type, arg_types); | |
6640 | else | |
6641 | { | |
6642 | tree r = TREE_TYPE (TREE_VALUE (arg_types)); | |
6643 | if (! IS_AGGR_TYPE (r)) | |
6644 | { | |
6645 | /* [temp.deduct] | |
6646 | ||
6647 | Type deduction may fail for any of the following | |
6648 | reasons: | |
6649 | ||
6650 | -- Attempting to create "pointer to member of T" when T | |
6651 | is not a class type. */ | |
c2ea3a40 | 6652 | if (complain & tf_error) |
33bd39a2 | 6653 | error ("creating pointer to member function of non-class type `%T'", |
4393e105 MM |
6654 | r); |
6655 | return error_mark_node; | |
6656 | } | |
6657 | ||
43dc123f MM |
6658 | fntype = build_method_type_directly (r, return_type, |
6659 | TREE_CHAIN (arg_types)); | |
4393e105 | 6660 | } |
c2ea3a40 | 6661 | fntype = cp_build_qualified_type_real (fntype, TYPE_QUALS (t), complain); |
e9525111 | 6662 | fntype = cp_build_type_attribute_variant (fntype, TYPE_ATTRIBUTES (t)); |
4393e105 MM |
6663 | |
6664 | return fntype; | |
6665 | } | |
6666 | ||
297e73d8 MM |
6667 | /* Substitute into the PARMS of a call-declarator. */ |
6668 | ||
e9659ab0 | 6669 | static tree |
3a978d72 NN |
6670 | tsubst_call_declarator_parms (tree parms, |
6671 | tree args, | |
6672 | tsubst_flags_t complain, | |
6673 | tree in_decl) | |
297e73d8 MM |
6674 | { |
6675 | tree new_parms; | |
6676 | tree type; | |
6677 | tree defarg; | |
6678 | ||
6679 | if (!parms || parms == void_list_node) | |
6680 | return parms; | |
6681 | ||
6682 | new_parms = tsubst_call_declarator_parms (TREE_CHAIN (parms), | |
4393e105 | 6683 | args, complain, in_decl); |
297e73d8 MM |
6684 | |
6685 | /* Figure out the type of this parameter. */ | |
4393e105 | 6686 | type = tsubst (TREE_VALUE (parms), args, complain, in_decl); |
297e73d8 MM |
6687 | |
6688 | /* Figure out the default argument as well. Note that we use | |
4393e105 MM |
6689 | tsubst_expr since the default argument is really an expression. */ |
6690 | defarg = tsubst_expr (TREE_PURPOSE (parms), args, complain, in_decl); | |
297e73d8 MM |
6691 | |
6692 | /* Chain this parameter on to the front of those we have already | |
6693 | processed. We don't use hash_tree_cons because that function | |
6694 | doesn't check TREE_PARMLIST. */ | |
6695 | new_parms = tree_cons (defarg, type, new_parms); | |
6696 | ||
297e73d8 MM |
6697 | return new_parms; |
6698 | } | |
6699 | ||
4393e105 MM |
6700 | /* Take the tree structure T and replace template parameters used |
6701 | therein with the argument vector ARGS. IN_DECL is an associated | |
6702 | decl for diagnostics. If an error occurs, returns ERROR_MARK_NODE. | |
c2ea3a40 NS |
6703 | Issue error and warning messages under control of COMPLAIN. Note |
6704 | that we must be relatively non-tolerant of extensions here, in | |
6705 | order to preserve conformance; if we allow substitutions that | |
6706 | should not be allowed, we may allow argument deductions that should | |
6707 | not succeed, and therefore report ambiguous overload situations | |
6708 | where there are none. In theory, we could allow the substitution, | |
6709 | but indicate that it should have failed, and allow our caller to | |
6710 | make sure that the right thing happens, but we don't try to do this | |
6711 | yet. | |
4393e105 MM |
6712 | |
6713 | This function is used for dealing with types, decls and the like; | |
6714 | for expressions, use tsubst_expr or tsubst_copy. */ | |
ae58fa02 | 6715 | |
14d22dd6 | 6716 | static tree |
3a978d72 | 6717 | tsubst (tree t, tree args, tsubst_flags_t complain, tree in_decl) |
ae58fa02 | 6718 | { |
0ecfe0b4 | 6719 | tree type, r; |
ae58fa02 MM |
6720 | |
6721 | if (t == NULL_TREE || t == error_mark_node | |
6722 | || t == integer_type_node | |
6723 | || t == void_type_node | |
6724 | || t == char_type_node | |
539599c1 | 6725 | || t == unknown_type_node |
ae58fa02 MM |
6726 | || TREE_CODE (t) == NAMESPACE_DECL) |
6727 | return t; | |
6728 | ||
6729 | if (TREE_CODE (t) == IDENTIFIER_NODE) | |
6730 | type = IDENTIFIER_TYPE_VALUE (t); | |
6731 | else | |
6732 | type = TREE_TYPE (t); | |
399dedb9 | 6733 | |
fd9aef9d | 6734 | my_friendly_assert (type != unknown_type_node, 20030716); |
ae58fa02 MM |
6735 | |
6736 | if (type && TREE_CODE (t) != FUNCTION_DECL | |
6737 | && TREE_CODE (t) != TYPENAME_TYPE | |
6738 | && TREE_CODE (t) != TEMPLATE_DECL | |
4393e105 MM |
6739 | && TREE_CODE (t) != IDENTIFIER_NODE |
6740 | && TREE_CODE (t) != FUNCTION_TYPE | |
6741 | && TREE_CODE (t) != METHOD_TYPE) | |
6742 | type = tsubst (type, args, complain, in_decl); | |
6743 | if (type == error_mark_node) | |
6744 | return error_mark_node; | |
ae58fa02 | 6745 | |
2f939d94 | 6746 | if (DECL_P (t)) |
c2ea3a40 | 6747 | return tsubst_decl (t, args, type, complain); |
ae58fa02 MM |
6748 | |
6749 | switch (TREE_CODE (t)) | |
6750 | { | |
6751 | case RECORD_TYPE: | |
6752 | case UNION_TYPE: | |
6753 | case ENUMERAL_TYPE: | |
4393e105 MM |
6754 | return tsubst_aggr_type (t, args, complain, in_decl, |
6755 | /*entering_scope=*/0); | |
ae58fa02 MM |
6756 | |
6757 | case ERROR_MARK: | |
6758 | case IDENTIFIER_NODE: | |
ae58fa02 MM |
6759 | case VOID_TYPE: |
6760 | case REAL_TYPE: | |
6761 | case COMPLEX_TYPE: | |
c00996a3 | 6762 | case VECTOR_TYPE: |
ae58fa02 MM |
6763 | case BOOLEAN_TYPE: |
6764 | case INTEGER_CST: | |
6765 | case REAL_CST: | |
6766 | case STRING_CST: | |
6767 | return t; | |
6768 | ||
6769 | case INTEGER_TYPE: | |
6770 | if (t == integer_type_node) | |
6771 | return t; | |
6772 | ||
6773 | if (TREE_CODE (TYPE_MIN_VALUE (t)) == INTEGER_CST | |
6774 | && TREE_CODE (TYPE_MAX_VALUE (t)) == INTEGER_CST) | |
6775 | return t; | |
d2e5ee5c | 6776 | |
5566b478 | 6777 | { |
ddce3528 | 6778 | tree max, omax = TREE_OPERAND (TYPE_MAX_VALUE (t), 0); |
7ddedda4 | 6779 | |
a91db711 NS |
6780 | /* The array dimension behaves like a non-type template arg, |
6781 | in that we want to fold it as much as possible. */ | |
6782 | max = tsubst_template_arg (omax, args, complain, in_decl); | |
fc611ce0 | 6783 | if (!processing_template_decl) |
8dd3f57a MM |
6784 | max = decl_constant_value (max); |
6785 | ||
ddce3528 JM |
6786 | if (integer_zerop (omax)) |
6787 | { | |
6788 | /* Still allow an explicit array of size zero. */ | |
6789 | if (pedantic) | |
6790 | pedwarn ("creating array with size zero"); | |
6791 | } | |
07c88314 MM |
6792 | else if (integer_zerop (max) |
6793 | || (TREE_CODE (max) == INTEGER_CST | |
6794 | && INT_CST_LT (max, integer_zero_node))) | |
0ecfe0b4 | 6795 | { |
4393e105 MM |
6796 | /* [temp.deduct] |
6797 | ||
6798 | Type deduction may fail for any of the following | |
6799 | reasons: | |
6800 | ||
bf8f3f93 MM |
6801 | Attempting to create an array with a size that is |
6802 | zero or negative. */ | |
c2ea3a40 | 6803 | if (complain & tf_error) |
33bd39a2 | 6804 | error ("creating array with size zero (`%E')", max); |
4393e105 MM |
6805 | |
6806 | return error_mark_node; | |
0ecfe0b4 JM |
6807 | } |
6808 | ||
c95cd22e | 6809 | return compute_array_index_type (NULL_TREE, max); |
ae58fa02 MM |
6810 | } |
6811 | ||
6812 | case TEMPLATE_TYPE_PARM: | |
6813 | case TEMPLATE_TEMPLATE_PARM: | |
a1281f45 | 6814 | case BOUND_TEMPLATE_TEMPLATE_PARM: |
ae58fa02 MM |
6815 | case TEMPLATE_PARM_INDEX: |
6816 | { | |
6817 | int idx; | |
6818 | int level; | |
6819 | int levels; | |
0ecfe0b4 JM |
6820 | |
6821 | r = NULL_TREE; | |
ae58fa02 MM |
6822 | |
6823 | if (TREE_CODE (t) == TEMPLATE_TYPE_PARM | |
a1281f45 KL |
6824 | || TREE_CODE (t) == TEMPLATE_TEMPLATE_PARM |
6825 | || TREE_CODE (t) == BOUND_TEMPLATE_TEMPLATE_PARM) | |
ae58fa02 MM |
6826 | { |
6827 | idx = TEMPLATE_TYPE_IDX (t); | |
6828 | level = TEMPLATE_TYPE_LEVEL (t); | |
6829 | } | |
6830 | else | |
6831 | { | |
6832 | idx = TEMPLATE_PARM_IDX (t); | |
6833 | level = TEMPLATE_PARM_LEVEL (t); | |
6834 | } | |
6835 | ||
6836 | if (TREE_VEC_LENGTH (args) > 0) | |
6837 | { | |
6838 | tree arg = NULL_TREE; | |
6839 | ||
6840 | levels = TMPL_ARGS_DEPTH (args); | |
6841 | if (level <= levels) | |
6842 | arg = TMPL_ARG (args, level, idx); | |
6843 | ||
8b5b8b7c MM |
6844 | if (arg == error_mark_node) |
6845 | return error_mark_node; | |
6846 | else if (arg != NULL_TREE) | |
ae58fa02 MM |
6847 | { |
6848 | if (TREE_CODE (t) == TEMPLATE_TYPE_PARM) | |
6849 | { | |
2f939d94 | 6850 | my_friendly_assert (TYPE_P (arg), 0); |
adecb3f4 | 6851 | return cp_build_qualified_type_real |
89d684bb | 6852 | (arg, cp_type_quals (arg) | cp_type_quals (t), |
4f2b0fb2 | 6853 | complain | tf_ignore_bad_quals); |
ae58fa02 | 6854 | } |
a1281f45 | 6855 | else if (TREE_CODE (t) == BOUND_TEMPLATE_TEMPLATE_PARM) |
ae58fa02 | 6856 | { |
a1281f45 | 6857 | /* We are processing a type constructed from |
f4f206f4 | 6858 | a template template parameter. */ |
a1281f45 KL |
6859 | tree argvec = tsubst (TYPE_TI_ARGS (t), |
6860 | args, complain, in_decl); | |
6861 | if (argvec == error_mark_node) | |
6862 | return error_mark_node; | |
4393e105 | 6863 | |
a1281f45 KL |
6864 | /* We can get a TEMPLATE_TEMPLATE_PARM here when |
6865 | we are resolving nested-types in the signature of | |
6866 | a member function templates. | |
6867 | Otherwise ARG is a TEMPLATE_DECL and is the real | |
6868 | template to be instantiated. */ | |
6869 | if (TREE_CODE (arg) == TEMPLATE_TEMPLATE_PARM) | |
6870 | arg = TYPE_NAME (arg); | |
6871 | ||
6872 | r = lookup_template_class (arg, | |
6873 | argvec, in_decl, | |
6874 | DECL_CONTEXT (arg), | |
f9c244b8 NS |
6875 | /*entering_scope=*/0, |
6876 | complain); | |
c2ea3a40 NS |
6877 | return cp_build_qualified_type_real |
6878 | (r, TYPE_QUALS (t), complain); | |
ae58fa02 MM |
6879 | } |
6880 | else | |
a1281f45 | 6881 | /* TEMPLATE_TEMPLATE_PARM or TEMPLATE_PARM_INDEX. */ |
ae58fa02 MM |
6882 | return arg; |
6883 | } | |
6884 | } | |
51924768 | 6885 | else |
a98facb0 | 6886 | abort (); |
ae58fa02 MM |
6887 | |
6888 | if (level == 1) | |
6889 | /* This can happen during the attempted tsubst'ing in | |
6890 | unify. This means that we don't yet have any information | |
6891 | about the template parameter in question. */ | |
6892 | return t; | |
6893 | ||
6894 | /* If we get here, we must have been looking at a parm for a | |
6895 | more deeply nested template. Make a new version of this | |
6896 | template parameter, but with a lower level. */ | |
6897 | switch (TREE_CODE (t)) | |
6898 | { | |
6899 | case TEMPLATE_TYPE_PARM: | |
6900 | case TEMPLATE_TEMPLATE_PARM: | |
a1281f45 | 6901 | case BOUND_TEMPLATE_TEMPLATE_PARM: |
89d684bb | 6902 | if (cp_type_quals (t)) |
ae58fa02 | 6903 | { |
9ccf6541 | 6904 | r = tsubst (TYPE_MAIN_VARIANT (t), args, complain, in_decl); |
4f2b0fb2 NS |
6905 | r = cp_build_qualified_type_real |
6906 | (r, cp_type_quals (t), | |
6907 | complain | (TREE_CODE (t) == TEMPLATE_TYPE_PARM | |
6908 | ? tf_ignore_bad_quals : 0)); | |
9ccf6541 MM |
6909 | } |
6910 | else | |
6911 | { | |
11e74ea6 | 6912 | r = copy_type (t); |
9ccf6541 MM |
6913 | TEMPLATE_TYPE_PARM_INDEX (r) |
6914 | = reduce_template_parm_level (TEMPLATE_TYPE_PARM_INDEX (t), | |
6915 | r, levels); | |
6916 | TYPE_STUB_DECL (r) = TYPE_NAME (r) = TEMPLATE_TYPE_DECL (r); | |
6917 | TYPE_MAIN_VARIANT (r) = r; | |
6918 | TYPE_POINTER_TO (r) = NULL_TREE; | |
6919 | TYPE_REFERENCE_TO (r) = NULL_TREE; | |
6920 | ||
a1281f45 | 6921 | if (TREE_CODE (t) == BOUND_TEMPLATE_TEMPLATE_PARM) |
9ccf6541 MM |
6922 | { |
6923 | tree argvec = tsubst (TYPE_TI_ARGS (t), args, | |
6924 | complain, in_decl); | |
6925 | if (argvec == error_mark_node) | |
6926 | return error_mark_node; | |
4393e105 | 6927 | |
9ccf6541 MM |
6928 | TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (r) |
6929 | = tree_cons (TYPE_TI_TEMPLATE (t), argvec, NULL_TREE); | |
6930 | } | |
ae58fa02 MM |
6931 | } |
6932 | break; | |
6933 | ||
6934 | case TEMPLATE_PARM_INDEX: | |
6935 | r = reduce_template_parm_level (t, type, levels); | |
6936 | break; | |
6937 | ||
6938 | default: | |
a98facb0 | 6939 | abort (); |
ae58fa02 MM |
6940 | } |
6941 | ||
5566b478 | 6942 | return r; |
ae58fa02 | 6943 | } |
5566b478 | 6944 | |
8d08fdba MS |
6945 | case TREE_LIST: |
6946 | { | |
058b15c1 | 6947 | tree purpose, value, chain; |
8d08fdba MS |
6948 | |
6949 | if (t == void_list_node) | |
6950 | return t; | |
6951 | ||
8d08fdba MS |
6952 | purpose = TREE_PURPOSE (t); |
6953 | if (purpose) | |
4393e105 MM |
6954 | { |
6955 | purpose = tsubst (purpose, args, complain, in_decl); | |
6956 | if (purpose == error_mark_node) | |
6957 | return error_mark_node; | |
6958 | } | |
8d08fdba MS |
6959 | value = TREE_VALUE (t); |
6960 | if (value) | |
4393e105 MM |
6961 | { |
6962 | value = tsubst (value, args, complain, in_decl); | |
6963 | if (value == error_mark_node) | |
6964 | return error_mark_node; | |
6965 | } | |
8d08fdba MS |
6966 | chain = TREE_CHAIN (t); |
6967 | if (chain && chain != void_type_node) | |
4393e105 MM |
6968 | { |
6969 | chain = tsubst (chain, args, complain, in_decl); | |
6970 | if (chain == error_mark_node) | |
6971 | return error_mark_node; | |
6972 | } | |
8d08fdba MS |
6973 | if (purpose == TREE_PURPOSE (t) |
6974 | && value == TREE_VALUE (t) | |
6975 | && chain == TREE_CHAIN (t)) | |
6976 | return t; | |
058b15c1 | 6977 | return hash_tree_cons (purpose, value, chain); |
8d08fdba | 6978 | } |
95b4aca6 NS |
6979 | |
6980 | case TREE_BINFO: | |
bd7eccc4 NS |
6981 | /* We should never be tsubsting a binfo. */ |
6982 | abort (); | |
85b71cf2 | 6983 | |
95b4aca6 NS |
6984 | case TREE_VEC: |
6985 | /* A vector of template arguments. */ | |
6986 | my_friendly_assert (!type, 20040628); | |
a91db711 | 6987 | return tsubst_template_args (t, args, complain, in_decl); |
8d08fdba | 6988 | |
8d08fdba MS |
6989 | case POINTER_TYPE: |
6990 | case REFERENCE_TYPE: | |
6991 | { | |
8d08fdba | 6992 | enum tree_code code; |
79a7c7fa | 6993 | |
46c895ac | 6994 | if (type == TREE_TYPE (t) && TREE_CODE (type) != METHOD_TYPE) |
8d08fdba MS |
6995 | return t; |
6996 | ||
6997 | code = TREE_CODE (t); | |
4393e105 MM |
6998 | |
6999 | ||
7000 | /* [temp.deduct] | |
7001 | ||
7002 | Type deduction may fail for any of the following | |
7003 | reasons: | |
7004 | ||
7005 | -- Attempting to create a pointer to reference type. | |
7006 | -- Attempting to create a reference to a reference type or | |
7007 | a reference to void. */ | |
0ecfe0b4 JM |
7008 | if (TREE_CODE (type) == REFERENCE_TYPE |
7009 | || (code == REFERENCE_TYPE && TREE_CODE (type) == VOID_TYPE)) | |
79a7c7fa | 7010 | { |
82a98427 | 7011 | static location_t last_loc; |
79a7c7fa JM |
7012 | |
7013 | /* We keep track of the last time we issued this error | |
7014 | message to avoid spewing a ton of messages during a | |
7015 | single bad template instantiation. */ | |
c2ea3a40 | 7016 | if (complain & tf_error |
93409b8c PB |
7017 | #ifdef USE_MAPPED_LOCATION |
7018 | && last_loc != input_location) | |
7019 | #else | |
82a98427 NS |
7020 | && (last_loc.line != input_line |
7021 | || last_loc.file != input_filename)) | |
93409b8c | 7022 | #endif |
79a7c7fa | 7023 | { |
0ecfe0b4 | 7024 | if (TREE_CODE (type) == VOID_TYPE) |
33bd39a2 | 7025 | error ("forming reference to void"); |
0ecfe0b4 | 7026 | else |
33bd39a2 | 7027 | error ("forming %s to reference type `%T'", |
0ecfe0b4 JM |
7028 | (code == POINTER_TYPE) ? "pointer" : "reference", |
7029 | type); | |
82a98427 | 7030 | last_loc = input_location; |
79a7c7fa JM |
7031 | } |
7032 | ||
4393e105 | 7033 | return error_mark_node; |
79a7c7fa JM |
7034 | } |
7035 | else if (code == POINTER_TYPE) | |
46c895ac NS |
7036 | { |
7037 | r = build_pointer_type (type); | |
7038 | if (TREE_CODE (type) == METHOD_TYPE) | |
7039 | r = build_ptrmemfunc_type (r); | |
7040 | } | |
8d08fdba MS |
7041 | else |
7042 | r = build_reference_type (type); | |
adecb3f4 | 7043 | r = cp_build_qualified_type_real (r, TYPE_QUALS (t), complain); |
79a7c7fa | 7044 | |
a5f1c5f8 NS |
7045 | if (r != error_mark_node) |
7046 | /* Will this ever be needed for TYPE_..._TO values? */ | |
7047 | layout_type (r); | |
7048 | ||
8d08fdba MS |
7049 | return r; |
7050 | } | |
a4443a08 | 7051 | case OFFSET_TYPE: |
0ecfe0b4 | 7052 | { |
4393e105 MM |
7053 | r = tsubst (TYPE_OFFSET_BASETYPE (t), args, complain, in_decl); |
7054 | if (r == error_mark_node || !IS_AGGR_TYPE (r)) | |
7055 | { | |
7056 | /* [temp.deduct] | |
7057 | ||
7058 | Type deduction may fail for any of the following | |
7059 | reasons: | |
7060 | ||
7061 | -- Attempting to create "pointer to member of T" when T | |
7062 | is not a class type. */ | |
c2ea3a40 NS |
7063 | if (complain & tf_error) |
7064 | error ("creating pointer to member of non-class type `%T'", r); | |
4393e105 MM |
7065 | return error_mark_node; |
7066 | } | |
46c895ac NS |
7067 | if (TREE_CODE (type) == REFERENCE_TYPE) |
7068 | { | |
4f09be91 | 7069 | if (complain & tf_error) |
46c895ac NS |
7070 | error ("creating pointer to member reference type `%T'", type); |
7071 | ||
7072 | return error_mark_node; | |
7073 | } | |
7074 | my_friendly_assert (TREE_CODE (type) != METHOD_TYPE, 20011231); | |
7075 | if (TREE_CODE (type) == FUNCTION_TYPE) | |
a5ac359a MM |
7076 | { |
7077 | /* This is really a method type. The cv qualifiers of the | |
7078 | this pointer should _not_ be determined by the cv | |
7079 | qualifiers of the class type. They should be held | |
7080 | somewhere in the FUNCTION_TYPE, but we don't do that at | |
7081 | the moment. Consider | |
7082 | typedef void (Func) () const; | |
7083 | ||
7084 | template <typename T1> void Foo (Func T1::*); | |
7085 | ||
7086 | */ | |
7087 | tree method_type; | |
7088 | ||
43dc123f MM |
7089 | method_type = build_method_type_directly (TYPE_MAIN_VARIANT (r), |
7090 | TREE_TYPE (type), | |
7091 | TYPE_ARG_TYPES (type)); | |
a5ac359a MM |
7092 | return build_ptrmemfunc_type (build_pointer_type (method_type)); |
7093 | } | |
46c895ac | 7094 | else |
b7a78333 MM |
7095 | return cp_build_qualified_type_real (build_ptrmem_type (r, type), |
7096 | TYPE_QUALS (t), | |
7097 | complain); | |
0ecfe0b4 | 7098 | } |
8d08fdba MS |
7099 | case FUNCTION_TYPE: |
7100 | case METHOD_TYPE: | |
7101 | { | |
c11b6f21 | 7102 | tree fntype; |
4393e105 | 7103 | tree raises; |
8d08fdba | 7104 | |
4393e105 MM |
7105 | fntype = tsubst_function_type (t, args, complain, in_decl); |
7106 | if (fntype == error_mark_node) | |
7107 | return error_mark_node; | |
cabc336a | 7108 | |
34cd5ae7 | 7109 | /* Substitute the exception specification. */ |
cabc336a | 7110 | raises = TYPE_RAISES_EXCEPTIONS (t); |
c11b6f21 MS |
7111 | if (raises) |
7112 | { | |
4cc1d462 NS |
7113 | tree list = NULL_TREE; |
7114 | ||
7115 | if (! TREE_VALUE (raises)) | |
7116 | list = raises; | |
7117 | else | |
7118 | for (; raises != NULL_TREE; raises = TREE_CHAIN (raises)) | |
7119 | { | |
7120 | tree spec = TREE_VALUE (raises); | |
7121 | ||
7122 | spec = tsubst (spec, args, complain, in_decl); | |
7123 | if (spec == error_mark_node) | |
7124 | return spec; | |
7125 | list = add_exception_specifier (list, spec, complain); | |
7126 | } | |
7127 | fntype = build_exception_variant (fntype, list); | |
c11b6f21 MS |
7128 | } |
7129 | return fntype; | |
8d08fdba MS |
7130 | } |
7131 | case ARRAY_TYPE: | |
7132 | { | |
4393e105 MM |
7133 | tree domain = tsubst (TYPE_DOMAIN (t), args, complain, in_decl); |
7134 | if (domain == error_mark_node) | |
7135 | return error_mark_node; | |
7136 | ||
7137 | /* As an optimization, we avoid regenerating the array type if | |
7138 | it will obviously be the same as T. */ | |
8d08fdba MS |
7139 | if (type == TREE_TYPE (t) && domain == TYPE_DOMAIN (t)) |
7140 | return t; | |
0ecfe0b4 | 7141 | |
4393e105 MM |
7142 | /* These checks should match the ones in grokdeclarator. |
7143 | ||
7144 | [temp.deduct] | |
7145 | ||
7146 | The deduction may fail for any of the following reasons: | |
7147 | ||
7148 | -- Attempting to create an array with an element type that | |
cfb91b67 GB |
7149 | is void, a function type, or a reference type, or [DR337] |
7150 | an abstract class type. */ | |
4393e105 MM |
7151 | if (TREE_CODE (type) == VOID_TYPE |
7152 | || TREE_CODE (type) == FUNCTION_TYPE | |
7153 | || TREE_CODE (type) == REFERENCE_TYPE) | |
0ecfe0b4 | 7154 | { |
c2ea3a40 | 7155 | if (complain & tf_error) |
33bd39a2 | 7156 | error ("creating array of `%T'", type); |
4393e105 | 7157 | return error_mark_node; |
0ecfe0b4 | 7158 | } |
cfb91b67 GB |
7159 | if (CLASS_TYPE_P (type) && CLASSTYPE_PURE_VIRTUALS (type)) |
7160 | { | |
7161 | if (complain & tf_error) | |
7162 | error ("creating array of `%T', which is an abstract class type", | |
7163 | type); | |
7164 | return error_mark_node; | |
7165 | } | |
0ecfe0b4 | 7166 | |
8d08fdba MS |
7167 | r = build_cplus_array_type (type, domain); |
7168 | return r; | |
7169 | } | |
7170 | ||
8d08fdba | 7171 | case PLUS_EXPR: |
5566b478 | 7172 | case MINUS_EXPR: |
4393e105 | 7173 | { |
c2ea3a40 NS |
7174 | tree e1 = tsubst (TREE_OPERAND (t, 0), args, complain, in_decl); |
7175 | tree e2 = tsubst (TREE_OPERAND (t, 1), args, complain, in_decl); | |
4393e105 MM |
7176 | |
7177 | if (e1 == error_mark_node || e2 == error_mark_node) | |
7178 | return error_mark_node; | |
7179 | ||
f293ce4b | 7180 | return fold (build2 (TREE_CODE (t), TREE_TYPE (t), e1, e2)); |
4393e105 | 7181 | } |
8d08fdba MS |
7182 | |
7183 | case NEGATE_EXPR: | |
7184 | case NOP_EXPR: | |
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 | ||
f293ce4b | 7190 | return fold (build1 (TREE_CODE (t), TREE_TYPE (t), e)); |
4393e105 | 7191 | } |
8d08fdba | 7192 | |
5566b478 MS |
7193 | case TYPENAME_TYPE: |
7194 | { | |
4393e105 MM |
7195 | tree ctx = tsubst_aggr_type (TYPE_CONTEXT (t), args, complain, |
7196 | in_decl, /*entering_scope=*/1); | |
7197 | tree f = tsubst_copy (TYPENAME_TYPE_FULLNAME (t), args, | |
7198 | complain, in_decl); | |
7199 | ||
7200 | if (ctx == error_mark_node || f == error_mark_node) | |
7201 | return error_mark_node; | |
ae58fa02 | 7202 | |
bf8f3f93 MM |
7203 | if (!IS_AGGR_TYPE (ctx)) |
7204 | { | |
c2ea3a40 | 7205 | if (complain & tf_error) |
33bd39a2 | 7206 | error ("`%T' is not a class, struct, or union type", |
bf8f3f93 MM |
7207 | ctx); |
7208 | return error_mark_node; | |
7209 | } | |
7210 | else if (!uses_template_parms (ctx) && !TYPE_BEING_DEFINED (ctx)) | |
7211 | { | |
7212 | /* Normally, make_typename_type does not require that the CTX | |
7213 | have complete type in order to allow things like: | |
ae58fa02 | 7214 | |
bf8f3f93 | 7215 | template <class T> struct S { typename S<T>::X Y; }; |
ae58fa02 | 7216 | |
bf8f3f93 MM |
7217 | But, such constructs have already been resolved by this |
7218 | point, so here CTX really should have complete type, unless | |
7219 | it's a partial instantiation. */ | |
4393e105 | 7220 | ctx = complete_type (ctx); |
d0f062fb | 7221 | if (!COMPLETE_TYPE_P (ctx)) |
4393e105 | 7222 | { |
c2ea3a40 | 7223 | if (complain & tf_error) |
7a228918 | 7224 | cxx_incomplete_type_error (NULL_TREE, ctx); |
4393e105 MM |
7225 | return error_mark_node; |
7226 | } | |
7227 | } | |
ae58fa02 | 7228 | |
4f2b0fb2 NS |
7229 | f = make_typename_type (ctx, f, |
7230 | (complain & tf_error) | tf_keep_type_decl); | |
f0bcd168 MM |
7231 | if (f == error_mark_node) |
7232 | return f; | |
4f2b0fb2 NS |
7233 | if (TREE_CODE (f) == TYPE_DECL) |
7234 | { | |
7235 | complain |= tf_ignore_bad_quals; | |
7236 | f = TREE_TYPE (f); | |
7237 | } | |
7238 | ||
7239 | return cp_build_qualified_type_real | |
7240 | (f, cp_type_quals (f) | cp_type_quals (t), complain); | |
5566b478 | 7241 | } |
c2ea3a40 | 7242 | |
b8c6534b KL |
7243 | case UNBOUND_CLASS_TEMPLATE: |
7244 | { | |
7245 | tree ctx = tsubst_aggr_type (TYPE_CONTEXT (t), args, complain, | |
7246 | in_decl, /*entering_scope=*/1); | |
7247 | tree name = TYPE_IDENTIFIER (t); | |
7248 | ||
7249 | if (ctx == error_mark_node || name == error_mark_node) | |
7250 | return error_mark_node; | |
7251 | ||
7252 | return make_unbound_class_template (ctx, name, complain); | |
7253 | } | |
7254 | ||
5566b478 | 7255 | case INDIRECT_REF: |
5566b478 | 7256 | case ADDR_EXPR: |
058b15c1 MM |
7257 | case CALL_EXPR: |
7258 | abort (); | |
5566b478 MS |
7259 | |
7260 | case ARRAY_REF: | |
4393e105 | 7261 | { |
c2ea3a40 NS |
7262 | tree e1 = tsubst (TREE_OPERAND (t, 0), args, complain, in_decl); |
7263 | tree e2 = tsubst_expr (TREE_OPERAND (t, 1), args, complain, in_decl); | |
4393e105 MM |
7264 | if (e1 == error_mark_node || e2 == error_mark_node) |
7265 | return error_mark_node; | |
7266 | ||
44de5aeb | 7267 | return build_nt (ARRAY_REF, e1, e2, NULL_TREE, NULL_TREE); |
4393e105 | 7268 | } |
5566b478 | 7269 | |
fc378698 | 7270 | case SCOPE_REF: |
4393e105 | 7271 | { |
c2ea3a40 | 7272 | tree e1 = tsubst (TREE_OPERAND (t, 0), args, complain, in_decl); |
4393e105 MM |
7273 | tree e2 = tsubst (TREE_OPERAND (t, 1), args, complain, in_decl); |
7274 | if (e1 == error_mark_node || e2 == error_mark_node) | |
7275 | return error_mark_node; | |
7276 | ||
718b8ea5 | 7277 | return build_nt (TREE_CODE (t), e1, e2); |
4393e105 | 7278 | } |
fc378698 | 7279 | |
b894fc05 | 7280 | case TYPEOF_TYPE: |
4393e105 | 7281 | { |
b830b74c | 7282 | tree type; |
4393e105 | 7283 | |
eb34af89 RK |
7284 | type = finish_typeof (tsubst_expr (TYPEOF_TYPE_EXPR (t), args, |
7285 | complain, in_decl)); | |
b830b74c | 7286 | return cp_build_qualified_type_real (type, |
dce50630 | 7287 | cp_type_quals (t) |
b830b74c | 7288 | | cp_type_quals (type), |
dce50630 | 7289 | complain); |
4393e105 | 7290 | } |
b894fc05 | 7291 | |
8d08fdba | 7292 | default: |
5566b478 | 7293 | sorry ("use of `%s' in template", |
8d08fdba MS |
7294 | tree_code_name [(int) TREE_CODE (t)]); |
7295 | return error_mark_node; | |
7296 | } | |
7297 | } | |
7298 | ||
ee76b931 MM |
7299 | /* Like tsubst_expr for a BASELINK. OBJECT_TYPE, if non-NULL, is the |
7300 | type of the expression on the left-hand side of the "." or "->" | |
7301 | operator. */ | |
7302 | ||
7303 | static tree | |
7304 | tsubst_baselink (tree baselink, tree object_type, | |
7305 | tree args, tsubst_flags_t complain, tree in_decl) | |
7306 | { | |
7307 | tree name; | |
7308 | tree qualifying_scope; | |
7309 | tree fns; | |
7310 | tree template_args = 0; | |
7311 | bool template_id_p = false; | |
7312 | ||
7313 | /* A baselink indicates a function from a base class. The | |
7314 | BASELINK_ACCESS_BINFO and BASELINK_BINFO are going to have | |
7315 | non-dependent types; otherwise, the lookup could not have | |
7316 | succeeded. However, they may indicate bases of the template | |
7317 | class, rather than the instantiated class. | |
7318 | ||
7319 | In addition, lookups that were not ambiguous before may be | |
04c06002 | 7320 | ambiguous now. Therefore, we perform the lookup again. */ |
ee76b931 MM |
7321 | qualifying_scope = BINFO_TYPE (BASELINK_ACCESS_BINFO (baselink)); |
7322 | fns = BASELINK_FUNCTIONS (baselink); | |
7323 | if (TREE_CODE (fns) == TEMPLATE_ID_EXPR) | |
7324 | { | |
7325 | template_id_p = true; | |
7326 | template_args = TREE_OPERAND (fns, 1); | |
7327 | fns = TREE_OPERAND (fns, 0); | |
bf12d54d NS |
7328 | if (template_args) |
7329 | template_args = tsubst_template_args (template_args, args, | |
7330 | complain, in_decl); | |
ee76b931 MM |
7331 | } |
7332 | name = DECL_NAME (get_first_fn (fns)); | |
7333 | baselink = lookup_fnfields (qualifying_scope, name, /*protect=*/1); | |
7334 | if (BASELINK_P (baselink) && template_id_p) | |
7335 | BASELINK_FUNCTIONS (baselink) | |
7336 | = build_nt (TEMPLATE_ID_EXPR, | |
7337 | BASELINK_FUNCTIONS (baselink), | |
7338 | template_args); | |
7339 | if (!object_type) | |
7340 | object_type = current_class_type; | |
7341 | return adjust_result_of_qualified_name_lookup (baselink, | |
7342 | qualifying_scope, | |
7343 | object_type); | |
7344 | } | |
7345 | ||
7346 | /* Like tsubst_expr for a SCOPE_REF, given by QUALIFIED_ID. DONE is | |
7347 | true if the qualified-id will be a postfix-expression in-and-of | |
7348 | itself; false if more of the postfix-expression follows the | |
7349 | QUALIFIED_ID. ADDRESS_P is true if the qualified-id is the operand | |
7350 | of "&". */ | |
7351 | ||
7352 | static tree | |
7353 | tsubst_qualified_id (tree qualified_id, tree args, | |
7354 | tsubst_flags_t complain, tree in_decl, | |
7355 | bool done, bool address_p) | |
7356 | { | |
7357 | tree expr; | |
7358 | tree scope; | |
7359 | tree name; | |
7360 | bool is_template; | |
7361 | tree template_args; | |
7362 | ||
7363 | my_friendly_assert (TREE_CODE (qualified_id) == SCOPE_REF, 20030706); | |
7364 | ||
ee76b931 MM |
7365 | /* Figure out what name to look up. */ |
7366 | name = TREE_OPERAND (qualified_id, 1); | |
7367 | if (TREE_CODE (name) == TEMPLATE_ID_EXPR) | |
7368 | { | |
7369 | is_template = true; | |
bf12d54d NS |
7370 | template_args = TREE_OPERAND (name, 1); |
7371 | if (template_args) | |
7372 | template_args = tsubst_template_args (template_args, args, | |
7373 | complain, in_decl); | |
ee76b931 MM |
7374 | name = TREE_OPERAND (name, 0); |
7375 | } | |
7376 | else | |
7377 | { | |
7378 | is_template = false; | |
7379 | template_args = NULL_TREE; | |
7380 | } | |
7381 | ||
6eeba0cc MM |
7382 | /* Substitute into the qualifying scope. When there are no ARGS, we |
7383 | are just trying to simplify a non-dependent expression. In that | |
7384 | case the qualifying scope may be dependent, and, in any case, | |
7385 | substituting will not help. */ | |
7386 | scope = TREE_OPERAND (qualified_id, 0); | |
7387 | if (args) | |
7388 | { | |
7389 | scope = tsubst (scope, args, complain, in_decl); | |
7390 | expr = tsubst_copy (name, args, complain, in_decl); | |
7391 | } | |
7392 | else | |
7393 | expr = name; | |
10b1d5e7 | 7394 | |
ab73670a MM |
7395 | if (dependent_type_p (scope)) |
7396 | return build_nt (SCOPE_REF, scope, expr); | |
fb5ce3c9 | 7397 | |
5e08432e | 7398 | if (!BASELINK_P (name) && !DECL_P (expr)) |
12483c9f NS |
7399 | { |
7400 | expr = lookup_qualified_name (scope, expr, /*is_type_p=*/0, false); | |
7401 | if (TREE_CODE (TREE_CODE (expr) == TEMPLATE_DECL | |
7402 | ? DECL_TEMPLATE_RESULT (expr) : expr) == TYPE_DECL) | |
7403 | { | |
7404 | if (complain & tf_error) | |
b2693faf | 7405 | { |
a4e8e73a | 7406 | error ("dependent-name `%E' is parsed as a non-type, but " |
b2693faf GB |
7407 | "instantiation yields a type", qualified_id); |
7408 | inform ("say `typename %E' if a type is meant", qualified_id); | |
7409 | } | |
12483c9f NS |
7410 | return error_mark_node; |
7411 | } | |
7412 | } | |
fb5ce3c9 | 7413 | |
279b8466 | 7414 | if (DECL_P (expr)) |
8f78f01f MM |
7415 | { |
7416 | check_accessibility_of_qualified_id (expr, /*object_type=*/NULL_TREE, | |
7417 | scope); | |
7418 | /* Remember that there was a reference to this entity. */ | |
7419 | mark_used (expr); | |
7420 | } | |
7421 | ||
7422 | if (expr == error_mark_node || TREE_CODE (expr) == TREE_LIST) | |
7423 | { | |
7424 | if (complain & tf_error) | |
7425 | qualified_name_lookup_error (scope, | |
7426 | TREE_OPERAND (qualified_id, 1), | |
7427 | expr); | |
7428 | return error_mark_node; | |
7429 | } | |
ee76b931 MM |
7430 | |
7431 | if (is_template) | |
10b1d5e7 | 7432 | expr = lookup_template_function (expr, template_args); |
ee76b931 | 7433 | |
22038b2c | 7434 | if (expr == error_mark_node && complain & tf_error) |
8f78f01f MM |
7435 | qualified_name_lookup_error (scope, TREE_OPERAND (qualified_id, 1), |
7436 | expr); | |
22038b2c | 7437 | else if (TYPE_P (scope)) |
ee76b931 MM |
7438 | { |
7439 | expr = (adjust_result_of_qualified_name_lookup | |
7440 | (expr, scope, current_class_type)); | |
7441 | expr = finish_qualified_id_expr (scope, expr, done, address_p); | |
7442 | } | |
7443 | ||
7444 | return expr; | |
7445 | } | |
7446 | ||
00d3396f JM |
7447 | /* Like tsubst, but deals with expressions. This function just replaces |
7448 | template parms; to finish processing the resultant expression, use | |
7449 | tsubst_expr. */ | |
7450 | ||
14d22dd6 | 7451 | static tree |
3a978d72 | 7452 | tsubst_copy (tree t, tree args, tsubst_flags_t complain, tree in_decl) |
5566b478 MS |
7453 | { |
7454 | enum tree_code code; | |
8452b1d3 | 7455 | tree r; |
8d08fdba | 7456 | |
5566b478 MS |
7457 | if (t == NULL_TREE || t == error_mark_node) |
7458 | return t; | |
7459 | ||
7460 | code = TREE_CODE (t); | |
b7484fbe | 7461 | |
5566b478 MS |
7462 | switch (code) |
7463 | { | |
7464 | case PARM_DECL: | |
a723baf1 MM |
7465 | r = retrieve_local_specialization (t); |
7466 | my_friendly_assert (r != NULL, 20020903); | |
c0694c4b | 7467 | mark_used (r); |
a723baf1 | 7468 | return r; |
5566b478 MS |
7469 | |
7470 | case CONST_DECL: | |
ed44da02 MM |
7471 | { |
7472 | tree enum_type; | |
7473 | tree v; | |
7474 | ||
a723baf1 MM |
7475 | if (DECL_TEMPLATE_PARM_P (t)) |
7476 | return tsubst_copy (DECL_INITIAL (t), args, complain, in_decl); | |
7b6d72fc MM |
7477 | /* There is no need to substitute into namespace-scope |
7478 | enumerators. */ | |
7479 | if (DECL_NAMESPACE_SCOPE_P (t)) | |
ed44da02 | 7480 | return t; |
d5a10cf0 MM |
7481 | /* If ARGS is NULL, then T is known to be non-dependent. */ |
7482 | if (args == NULL_TREE) | |
109e0040 | 7483 | return decl_constant_value (t); |
ed44da02 MM |
7484 | |
7485 | /* Unfortunately, we cannot just call lookup_name here. | |
9188c363 MM |
7486 | Consider: |
7487 | ||
7488 | template <int I> int f() { | |
7489 | enum E { a = I }; | |
7490 | struct S { void g() { E e = a; } }; | |
7491 | }; | |
7492 | ||
7493 | When we instantiate f<7>::S::g(), say, lookup_name is not | |
7494 | clever enough to find f<7>::a. */ | |
ed44da02 | 7495 | enum_type |
4393e105 | 7496 | = tsubst_aggr_type (TREE_TYPE (t), args, complain, in_decl, |
ed44da02 MM |
7497 | /*entering_scope=*/0); |
7498 | ||
7499 | for (v = TYPE_VALUES (enum_type); | |
7500 | v != NULL_TREE; | |
7501 | v = TREE_CHAIN (v)) | |
7502 | if (TREE_PURPOSE (v) == DECL_NAME (t)) | |
7503 | return TREE_VALUE (v); | |
7504 | ||
7505 | /* We didn't find the name. That should never happen; if | |
7506 | name-lookup found it during preliminary parsing, we | |
7507 | should find it again here during instantiation. */ | |
a98facb0 | 7508 | abort (); |
ed44da02 | 7509 | } |
db04386f | 7510 | return t; |
ed44da02 | 7511 | |
5566b478 MS |
7512 | case FIELD_DECL: |
7513 | if (DECL_CONTEXT (t)) | |
7514 | { | |
0978790f | 7515 | tree ctx; |
0978790f | 7516 | |
4393e105 | 7517 | ctx = tsubst_aggr_type (DECL_CONTEXT (t), args, complain, in_decl, |
36a117a5 | 7518 | /*entering_scope=*/1); |
0978790f | 7519 | if (ctx != DECL_CONTEXT (t)) |
86ac0575 | 7520 | return lookup_field (ctx, DECL_NAME (t), 0, false); |
5566b478 | 7521 | } |
fa743e8c | 7522 | |
5566b478 MS |
7523 | return t; |
7524 | ||
7525 | case VAR_DECL: | |
7526 | case FUNCTION_DECL: | |
a723baf1 MM |
7527 | if ((DECL_LANG_SPECIFIC (t) && DECL_TEMPLATE_INFO (t)) |
7528 | || local_variable_p (t)) | |
4393e105 | 7529 | t = tsubst (t, args, complain, in_decl); |
5566b478 MS |
7530 | mark_used (t); |
7531 | return t; | |
7532 | ||
a723baf1 | 7533 | case BASELINK: |
ee76b931 | 7534 | return tsubst_baselink (t, current_class_type, args, complain, in_decl); |
a723baf1 | 7535 | |
98c1c668 | 7536 | case TEMPLATE_DECL: |
a723baf1 MM |
7537 | if (DECL_TEMPLATE_TEMPLATE_PARM_P (t)) |
7538 | return tsubst (TREE_TYPE (DECL_TEMPLATE_RESULT (t)), | |
7539 | args, complain, in_decl); | |
7540 | else if (is_member_template (t)) | |
4393e105 | 7541 | return tsubst (t, args, complain, in_decl); |
fcea7401 KL |
7542 | else if (DECL_CLASS_SCOPE_P (t) |
7543 | && uses_template_parms (DECL_CONTEXT (t))) | |
7544 | { | |
7545 | /* Template template argument like the following example need | |
7546 | special treatment: | |
7547 | ||
7548 | template <template <class> class TT> struct C {}; | |
7549 | template <class T> struct D { | |
7550 | template <class U> struct E {}; | |
7551 | C<E> c; // #1 | |
7552 | }; | |
7553 | D<int> d; // #2 | |
7554 | ||
7555 | We are processing the template argument `E' in #1 for | |
7556 | the template instantiation #2. Originally, `E' is a | |
7557 | TEMPLATE_DECL with `D<T>' as its DECL_CONTEXT. Now we | |
7558 | have to substitute this with one having context `D<int>'. */ | |
7559 | ||
7560 | tree context = tsubst (DECL_CONTEXT (t), args, complain, in_decl); | |
7561 | return lookup_field (context, DECL_NAME(t), 0, false); | |
7562 | } | |
98c1c668 | 7563 | else |
fcea7401 | 7564 | /* Ordinary template template argument. */ |
98c1c668 JM |
7565 | return t; |
7566 | ||
5566b478 MS |
7567 | case CAST_EXPR: |
7568 | case REINTERPRET_CAST_EXPR: | |
e92cc029 MS |
7569 | case CONST_CAST_EXPR: |
7570 | case STATIC_CAST_EXPR: | |
7571 | case DYNAMIC_CAST_EXPR: | |
51924768 | 7572 | case NOP_EXPR: |
5566b478 | 7573 | return build1 |
4393e105 MM |
7574 | (code, tsubst (TREE_TYPE (t), args, complain, in_decl), |
7575 | tsubst_copy (TREE_OPERAND (t, 0), args, complain, in_decl)); | |
5566b478 MS |
7576 | |
7577 | case INDIRECT_REF: | |
5566b478 MS |
7578 | case NEGATE_EXPR: |
7579 | case TRUTH_NOT_EXPR: | |
b87692e5 | 7580 | case BIT_NOT_EXPR: |
5566b478 MS |
7581 | case ADDR_EXPR: |
7582 | case CONVERT_EXPR: /* Unary + */ | |
7583 | case SIZEOF_EXPR: | |
abff8e06 | 7584 | case ALIGNOF_EXPR: |
5566b478 | 7585 | case ARROW_EXPR: |
fc378698 | 7586 | case THROW_EXPR: |
5156628f | 7587 | case TYPEID_EXPR: |
f5733617 SS |
7588 | case REALPART_EXPR: |
7589 | case IMAGPART_EXPR: | |
5566b478 | 7590 | return build1 |
6a629cac | 7591 | (code, tsubst (TREE_TYPE (t), args, complain, in_decl), |
4393e105 | 7592 | tsubst_copy (TREE_OPERAND (t, 0), args, complain, in_decl)); |
5566b478 | 7593 | |
a723baf1 MM |
7594 | case COMPONENT_REF: |
7595 | { | |
7596 | tree object; | |
7597 | tree name; | |
7598 | ||
7599 | object = tsubst_copy (TREE_OPERAND (t, 0), args, complain, in_decl); | |
7600 | name = TREE_OPERAND (t, 1); | |
7601 | if (TREE_CODE (name) == BIT_NOT_EXPR) | |
7602 | { | |
7603 | name = tsubst_copy (TREE_OPERAND (name, 0), args, | |
7604 | complain, in_decl); | |
7605 | name = build1 (BIT_NOT_EXPR, NULL_TREE, name); | |
7606 | } | |
7607 | else if (TREE_CODE (name) == SCOPE_REF | |
7608 | && TREE_CODE (TREE_OPERAND (name, 1)) == BIT_NOT_EXPR) | |
7609 | { | |
7610 | tree base = tsubst_copy (TREE_OPERAND (name, 0), args, | |
7611 | complain, in_decl); | |
7612 | name = TREE_OPERAND (name, 1); | |
7613 | name = tsubst_copy (TREE_OPERAND (name, 0), args, | |
7614 | complain, in_decl); | |
7615 | name = build1 (BIT_NOT_EXPR, NULL_TREE, name); | |
7616 | name = build_nt (SCOPE_REF, base, name); | |
7617 | } | |
ee76b931 MM |
7618 | else if (TREE_CODE (name) == BASELINK) |
7619 | name = tsubst_baselink (name, | |
7620 | non_reference (TREE_TYPE (object)), | |
7621 | args, complain, | |
7622 | in_decl); | |
a723baf1 | 7623 | else |
ee76b931 | 7624 | name = tsubst_copy (name, args, complain, in_decl); |
44de5aeb | 7625 | return build_nt (COMPONENT_REF, object, name, NULL_TREE); |
a723baf1 MM |
7626 | } |
7627 | ||
5566b478 MS |
7628 | case PLUS_EXPR: |
7629 | case MINUS_EXPR: | |
7630 | case MULT_EXPR: | |
7631 | case TRUNC_DIV_EXPR: | |
7632 | case CEIL_DIV_EXPR: | |
7633 | case FLOOR_DIV_EXPR: | |
7634 | case ROUND_DIV_EXPR: | |
7635 | case EXACT_DIV_EXPR: | |
7636 | case BIT_AND_EXPR: | |
5566b478 MS |
7637 | case BIT_IOR_EXPR: |
7638 | case BIT_XOR_EXPR: | |
7639 | case TRUNC_MOD_EXPR: | |
7640 | case FLOOR_MOD_EXPR: | |
7641 | case TRUTH_ANDIF_EXPR: | |
7642 | case TRUTH_ORIF_EXPR: | |
7643 | case TRUTH_AND_EXPR: | |
7644 | case TRUTH_OR_EXPR: | |
7645 | case RSHIFT_EXPR: | |
7646 | case LSHIFT_EXPR: | |
7647 | case RROTATE_EXPR: | |
7648 | case LROTATE_EXPR: | |
7649 | case EQ_EXPR: | |
7650 | case NE_EXPR: | |
7651 | case MAX_EXPR: | |
7652 | case MIN_EXPR: | |
7653 | case LE_EXPR: | |
7654 | case GE_EXPR: | |
7655 | case LT_EXPR: | |
7656 | case GT_EXPR: | |
5566b478 MS |
7657 | case ARRAY_REF: |
7658 | case COMPOUND_EXPR: | |
7659 | case SCOPE_REF: | |
7660 | case DOTSTAR_EXPR: | |
7661 | case MEMBER_REF: | |
519c9806 MM |
7662 | case PREDECREMENT_EXPR: |
7663 | case PREINCREMENT_EXPR: | |
7664 | case POSTDECREMENT_EXPR: | |
7665 | case POSTINCREMENT_EXPR: | |
5566b478 | 7666 | return build_nt |
4393e105 MM |
7667 | (code, tsubst_copy (TREE_OPERAND (t, 0), args, complain, in_decl), |
7668 | tsubst_copy (TREE_OPERAND (t, 1), args, complain, in_decl)); | |
5566b478 MS |
7669 | |
7670 | case CALL_EXPR: | |
a723baf1 MM |
7671 | return build_nt (code, |
7672 | tsubst_copy (TREE_OPERAND (t, 0), args, | |
7673 | complain, in_decl), | |
7674 | tsubst_copy (TREE_OPERAND (t, 1), args, complain, | |
7675 | in_decl), | |
7676 | NULL_TREE); | |
5566b478 | 7677 | |
5566b478 MS |
7678 | case COND_EXPR: |
7679 | case MODOP_EXPR: | |
40242ccf | 7680 | case PSEUDO_DTOR_EXPR: |
67da3287 | 7681 | { |
8452b1d3 | 7682 | r = build_nt |
4393e105 MM |
7683 | (code, tsubst_copy (TREE_OPERAND (t, 0), args, complain, in_decl), |
7684 | tsubst_copy (TREE_OPERAND (t, 1), args, complain, in_decl), | |
7685 | tsubst_copy (TREE_OPERAND (t, 2), args, complain, in_decl)); | |
e4c2c34b | 7686 | TREE_NO_WARNING (r) = TREE_NO_WARNING (t); |
67da3287 MM |
7687 | return r; |
7688 | } | |
5566b478 MS |
7689 | |
7690 | case NEW_EXPR: | |
7691 | { | |
8452b1d3 | 7692 | r = build_nt |
4393e105 MM |
7693 | (code, tsubst_copy (TREE_OPERAND (t, 0), args, complain, in_decl), |
7694 | tsubst_copy (TREE_OPERAND (t, 1), args, complain, in_decl), | |
7695 | tsubst_copy (TREE_OPERAND (t, 2), args, complain, in_decl)); | |
5566b478 MS |
7696 | NEW_EXPR_USE_GLOBAL (r) = NEW_EXPR_USE_GLOBAL (t); |
7697 | return r; | |
7698 | } | |
7699 | ||
7700 | case DELETE_EXPR: | |
7701 | { | |
8452b1d3 | 7702 | r = build_nt |
4393e105 MM |
7703 | (code, tsubst_copy (TREE_OPERAND (t, 0), args, complain, in_decl), |
7704 | tsubst_copy (TREE_OPERAND (t, 1), args, complain, in_decl)); | |
5566b478 MS |
7705 | DELETE_EXPR_USE_GLOBAL (r) = DELETE_EXPR_USE_GLOBAL (t); |
7706 | DELETE_EXPR_USE_VEC (r) = DELETE_EXPR_USE_VEC (t); | |
7707 | return r; | |
7708 | } | |
7709 | ||
386b8a85 JM |
7710 | case TEMPLATE_ID_EXPR: |
7711 | { | |
00d3396f | 7712 | /* Substituted template arguments */ |
a91db711 NS |
7713 | tree fn = TREE_OPERAND (t, 0); |
7714 | tree targs = TREE_OPERAND (t, 1); | |
856216bb | 7715 | |
a91db711 | 7716 | fn = tsubst_copy (fn, args, complain, in_decl); |
bf12d54d NS |
7717 | if (targs) |
7718 | targs = tsubst_template_args (targs, args, complain, in_decl); | |
a91db711 NS |
7719 | |
7720 | return lookup_template_function (fn, targs); | |
386b8a85 JM |
7721 | } |
7722 | ||
5566b478 MS |
7723 | case TREE_LIST: |
7724 | { | |
7725 | tree purpose, value, chain; | |
7726 | ||
7727 | if (t == void_list_node) | |
7728 | return t; | |
7729 | ||
7730 | purpose = TREE_PURPOSE (t); | |
7731 | if (purpose) | |
4393e105 | 7732 | purpose = tsubst_copy (purpose, args, complain, in_decl); |
5566b478 MS |
7733 | value = TREE_VALUE (t); |
7734 | if (value) | |
4393e105 | 7735 | value = tsubst_copy (value, args, complain, in_decl); |
5566b478 MS |
7736 | chain = TREE_CHAIN (t); |
7737 | if (chain && chain != void_type_node) | |
4393e105 | 7738 | chain = tsubst_copy (chain, args, complain, in_decl); |
5566b478 MS |
7739 | if (purpose == TREE_PURPOSE (t) |
7740 | && value == TREE_VALUE (t) | |
7741 | && chain == TREE_CHAIN (t)) | |
7742 | return t; | |
7743 | return tree_cons (purpose, value, chain); | |
7744 | } | |
7745 | ||
7746 | case RECORD_TYPE: | |
7747 | case UNION_TYPE: | |
7748 | case ENUMERAL_TYPE: | |
7749 | case INTEGER_TYPE: | |
7750 | case TEMPLATE_TYPE_PARM: | |
73b0fce8 | 7751 | case TEMPLATE_TEMPLATE_PARM: |
a1281f45 | 7752 | case BOUND_TEMPLATE_TEMPLATE_PARM: |
f84b4be9 | 7753 | case TEMPLATE_PARM_INDEX: |
5566b478 MS |
7754 | case POINTER_TYPE: |
7755 | case REFERENCE_TYPE: | |
7756 | case OFFSET_TYPE: | |
7757 | case FUNCTION_TYPE: | |
7758 | case METHOD_TYPE: | |
7759 | case ARRAY_TYPE: | |
7760 | case TYPENAME_TYPE: | |
b8c6534b | 7761 | case UNBOUND_CLASS_TEMPLATE: |
2a2b1d56 | 7762 | case TYPEOF_TYPE: |
f84b4be9 | 7763 | case TYPE_DECL: |
4393e105 | 7764 | return tsubst (t, args, complain, in_decl); |
5566b478 | 7765 | |
e92cc029 | 7766 | case IDENTIFIER_NODE: |
421844e7 | 7767 | if (IDENTIFIER_TYPENAME_P (t)) |
1f6e1acc AS |
7768 | { |
7769 | tree new_type = tsubst (TREE_TYPE (t), args, complain, in_decl); | |
1f84ec23 | 7770 | return mangle_conv_op_name_for_type (new_type); |
1f6e1acc | 7771 | } |
e92cc029 MS |
7772 | else |
7773 | return t; | |
7774 | ||
5156628f | 7775 | case CONSTRUCTOR: |
8452b1d3 | 7776 | { |
dcf92453 ZW |
7777 | r = build_constructor |
7778 | (tsubst (TREE_TYPE (t), args, complain, in_decl), | |
7779 | tsubst_copy (CONSTRUCTOR_ELTS (t), args, complain, in_decl)); | |
8452b1d3 JM |
7780 | TREE_HAS_CONSTRUCTOR (r) = TREE_HAS_CONSTRUCTOR (t); |
7781 | return r; | |
7782 | } | |
5156628f | 7783 | |
371534a9 | 7784 | case VA_ARG_EXPR: |
ea333e1c | 7785 | return build_x_va_arg (tsubst_copy (TREE_OPERAND (t, 0), args, complain, |
c2ea3a40 NS |
7786 | in_decl), |
7787 | tsubst (TREE_TYPE (t), args, complain, in_decl)); | |
f9817201 | 7788 | |
543a0daa RH |
7789 | case CLEANUP_POINT_EXPR: |
7790 | /* We shouldn't have built any of these during initial template | |
7791 | generation. Instead, they should be built during instantiation | |
7792 | in response to the saved STMT_IS_FULL_EXPR_P setting. */ | |
7793 | abort (); | |
7794 | ||
5566b478 MS |
7795 | default: |
7796 | return t; | |
7797 | } | |
7798 | } | |
7799 | ||
cc23546e JO |
7800 | /* Like tsubst_copy for expressions, etc. but also does semantic |
7801 | processing. */ | |
00d3396f | 7802 | |
14d22dd6 | 7803 | static tree |
3a978d72 | 7804 | tsubst_expr (tree t, tree args, tsubst_flags_t complain, tree in_decl) |
5566b478 | 7805 | { |
325c3691 RH |
7806 | /* Live only within one (recursive) call to tsubst_expr. We use |
7807 | this to pass the statement expression node from the STMT_EXPR | |
7808 | to the EXPR_STMT that is its result. */ | |
7809 | static tree cur_stmt_expr; | |
7810 | ||
fd10dd09 | 7811 | tree stmt, tmp; |
558475f0 | 7812 | |
5566b478 MS |
7813 | if (t == NULL_TREE || t == error_mark_node) |
7814 | return t; | |
7815 | ||
93409b8c PB |
7816 | if (EXPR_HAS_LOCATION (t)) |
7817 | input_location = EXPR_LOCATION (t); | |
7c34ced1 RH |
7818 | if (STATEMENT_CODE_P (TREE_CODE (t))) |
7819 | current_stmt_tree ()->stmts_are_full_exprs_p = STMT_IS_FULL_EXPR_P (t); | |
7820 | ||
5566b478 | 7821 | switch (TREE_CODE (t)) |
8d08fdba | 7822 | { |
325c3691 RH |
7823 | case STATEMENT_LIST: |
7824 | { | |
7825 | tree_stmt_iterator i; | |
7826 | for (i = tsi_start (t); !tsi_end_p (i); tsi_next (&i)) | |
7827 | tsubst_expr (tsi_stmt (i), args, complain, in_decl); | |
7828 | break; | |
7829 | } | |
7830 | ||
558475f0 | 7831 | case CTOR_INITIALIZER: |
2282d28d MM |
7832 | finish_mem_initializers (tsubst_initializer_list |
7833 | (TREE_OPERAND (t, 0), args)); | |
7834 | break; | |
558475f0 | 7835 | |
5088b058 RH |
7836 | case RETURN_EXPR: |
7837 | finish_return_stmt (tsubst_expr (TREE_OPERAND (t, 0), | |
4393e105 | 7838 | args, complain, in_decl)); |
5566b478 MS |
7839 | break; |
7840 | ||
325c3691 RH |
7841 | case STMT_EXPR: |
7842 | { | |
7843 | tree old_stmt_expr = cur_stmt_expr; | |
7844 | tree stmt_expr = begin_stmt_expr (); | |
7845 | ||
7846 | cur_stmt_expr = stmt_expr; | |
7847 | tsubst_expr (STMT_EXPR_STMT (t), args, complain, in_decl); | |
7848 | stmt_expr = finish_stmt_expr (stmt_expr, false); | |
7849 | cur_stmt_expr = old_stmt_expr; | |
7850 | ||
7851 | return stmt_expr; | |
7852 | } | |
7853 | ||
5566b478 | 7854 | case EXPR_STMT: |
7c34ced1 RH |
7855 | tmp = tsubst_expr (EXPR_STMT_EXPR (t), args, complain, in_decl); |
7856 | if (EXPR_STMT_STMT_EXPR_RESULT (t)) | |
7857 | finish_stmt_expr_expr (tmp, cur_stmt_expr); | |
7858 | else | |
7859 | finish_expr_stmt (tmp); | |
7860 | break; | |
5566b478 | 7861 | |
9da99f7d | 7862 | case USING_STMT: |
9da99f7d NS |
7863 | do_using_directive (tsubst_expr (USING_STMT_NAMESPACE (t), |
7864 | args, complain, in_decl)); | |
7865 | break; | |
7866 | ||
350fae66 | 7867 | case DECL_EXPR: |
5566b478 | 7868 | { |
e0942dcd MM |
7869 | tree decl; |
7870 | tree init; | |
5566b478 | 7871 | |
350fae66 | 7872 | decl = DECL_EXPR_DECL (t); |
acef433b MM |
7873 | if (TREE_CODE (decl) == LABEL_DECL) |
7874 | finish_label_decl (DECL_NAME (decl)); | |
fbfe8c9e NS |
7875 | else if (TREE_CODE (decl) == USING_DECL) |
7876 | { | |
7877 | tree scope = DECL_INITIAL (decl); | |
7878 | tree name = DECL_NAME (decl); | |
22038b2c | 7879 | tree decl; |
fbfe8c9e NS |
7880 | |
7881 | scope = tsubst_expr (scope, args, complain, in_decl); | |
22038b2c | 7882 | decl = lookup_qualified_name (scope, name, |
12483c9f NS |
7883 | /*is_type_p=*/false, |
7884 | /*complain=*/false); | |
8f78f01f MM |
7885 | if (decl == error_mark_node || TREE_CODE (decl) == TREE_LIST) |
7886 | qualified_name_lookup_error (scope, name, decl); | |
22038b2c | 7887 | else |
ed5f054f | 7888 | do_local_using_decl (decl, scope, name); |
fbfe8c9e | 7889 | } |
acef433b MM |
7890 | else |
7891 | { | |
7892 | init = DECL_INITIAL (decl); | |
7893 | decl = tsubst (decl, args, complain, in_decl); | |
ce2e5191 NS |
7894 | if (decl != error_mark_node) |
7895 | { | |
7896 | if (init) | |
7897 | DECL_INITIAL (decl) = error_mark_node; | |
7898 | /* By marking the declaration as instantiated, we avoid | |
7899 | trying to instantiate it. Since instantiate_decl can't | |
7900 | handle local variables, and since we've already done | |
7901 | all that needs to be done, that's the right thing to | |
7902 | do. */ | |
7903 | if (TREE_CODE (decl) == VAR_DECL) | |
7904 | DECL_TEMPLATE_INSTANTIATED (decl) = 1; | |
edebf865 MM |
7905 | if (TREE_CODE (decl) == VAR_DECL |
7906 | && ANON_AGGR_TYPE_P (TREE_TYPE (decl))) | |
7907 | /* Anonymous aggregates are a special case. */ | |
7908 | finish_anon_union (decl); | |
7909 | else | |
ed2fa432 | 7910 | { |
edebf865 | 7911 | maybe_push_decl (decl); |
39703eb9 MM |
7912 | if (TREE_CODE (decl) == VAR_DECL |
7913 | && DECL_PRETTY_FUNCTION_P (decl)) | |
edebf865 MM |
7914 | { |
7915 | /* For __PRETTY_FUNCTION__ we have to adjust the | |
7916 | initializer. */ | |
7917 | const char *const name | |
7918 | = cxx_printable_name (current_function_decl, 2); | |
bb885938 | 7919 | init = cp_fname_init (name, &TREE_TYPE (decl)); |
edebf865 MM |
7920 | } |
7921 | else | |
7922 | init = tsubst_expr (init, args, complain, in_decl); | |
7923 | cp_finish_decl (decl, init, NULL_TREE, 0); | |
ed2fa432 | 7924 | } |
ce2e5191 | 7925 | } |
acef433b | 7926 | } |
fd10dd09 | 7927 | |
350fae66 | 7928 | /* A DECL_EXPR can also be used as an expression, in the condition |
325c3691 RH |
7929 | clause of an if/for/while construct. */ |
7930 | return decl; | |
5566b478 | 7931 | } |
8d08fdba | 7932 | |
5566b478 | 7933 | case FOR_STMT: |
7c34ced1 RH |
7934 | stmt = begin_for_stmt (); |
7935 | tsubst_expr (FOR_INIT_STMT (t), args, complain, in_decl); | |
7936 | finish_for_init_stmt (stmt); | |
7937 | tmp = tsubst_expr (FOR_COND (t), args, complain, in_decl); | |
7938 | finish_for_cond (tmp, stmt); | |
7939 | tmp = tsubst_expr (FOR_EXPR (t), args, complain, in_decl); | |
7940 | finish_for_expr (tmp, stmt); | |
7941 | tsubst_expr (FOR_BODY (t), args, complain, in_decl); | |
7942 | finish_for_stmt (stmt); | |
5566b478 | 7943 | break; |
8d08fdba | 7944 | |
5566b478 | 7945 | case WHILE_STMT: |
7c34ced1 RH |
7946 | stmt = begin_while_stmt (); |
7947 | tmp = tsubst_expr (WHILE_COND (t), args, complain, in_decl); | |
7948 | finish_while_stmt_cond (tmp, stmt); | |
7949 | tsubst_expr (WHILE_BODY (t), args, complain, in_decl); | |
7950 | finish_while_stmt (stmt); | |
5566b478 | 7951 | break; |
8d08fdba | 7952 | |
5566b478 | 7953 | case DO_STMT: |
7c34ced1 RH |
7954 | stmt = begin_do_stmt (); |
7955 | tsubst_expr (DO_BODY (t), args, complain, in_decl); | |
7956 | finish_do_body (stmt); | |
7957 | tmp = tsubst_expr (DO_COND (t), args, complain, in_decl); | |
7958 | finish_do_stmt (tmp, stmt); | |
5566b478 | 7959 | break; |
a0a33927 | 7960 | |
5566b478 | 7961 | case IF_STMT: |
7c34ced1 RH |
7962 | stmt = begin_if_stmt (); |
7963 | tmp = tsubst_expr (IF_COND (t), args, complain, in_decl); | |
7964 | finish_if_stmt_cond (tmp, stmt); | |
7965 | tsubst_expr (THEN_CLAUSE (t), args, complain, in_decl); | |
7966 | finish_then_clause (stmt); | |
8d08fdba | 7967 | |
7c34ced1 RH |
7968 | if (ELSE_CLAUSE (t)) |
7969 | { | |
7970 | begin_else_clause (stmt); | |
7971 | tsubst_expr (ELSE_CLAUSE (t), args, complain, in_decl); | |
7972 | finish_else_clause (stmt); | |
7973 | } | |
7974 | ||
7975 | finish_if_stmt (stmt); | |
5566b478 | 7976 | break; |
8d08fdba | 7977 | |
5882f0f3 | 7978 | case BIND_EXPR: |
7c34ced1 RH |
7979 | if (BIND_EXPR_BODY_BLOCK (t)) |
7980 | stmt = begin_function_body (); | |
7981 | else | |
7982 | stmt = begin_compound_stmt (BIND_EXPR_TRY_BLOCK (t) | |
7983 | ? BCS_TRY_BLOCK : 0); | |
ade3dc07 | 7984 | |
7c34ced1 | 7985 | tsubst_expr (BIND_EXPR_BODY (t), args, complain, in_decl); |
ade3dc07 | 7986 | |
7c34ced1 RH |
7987 | if (BIND_EXPR_BODY_BLOCK (t)) |
7988 | finish_function_body (stmt); | |
7989 | else | |
7990 | finish_compound_stmt (stmt); | |
5566b478 | 7991 | break; |
8d08fdba | 7992 | |
5566b478 | 7993 | case BREAK_STMT: |
ad321293 | 7994 | finish_break_stmt (); |
5566b478 | 7995 | break; |
8d08fdba | 7996 | |
6467930b | 7997 | case CONTINUE_STMT: |
ad321293 | 7998 | finish_continue_stmt (); |
6467930b MS |
7999 | break; |
8000 | ||
5566b478 | 8001 | case SWITCH_STMT: |
7c34ced1 RH |
8002 | stmt = begin_switch_stmt (); |
8003 | tmp = tsubst_expr (SWITCH_COND (t), args, complain, in_decl); | |
8004 | finish_switch_cond (tmp, stmt); | |
8005 | tsubst_expr (SWITCH_BODY (t), args, complain, in_decl); | |
8006 | finish_switch_stmt (stmt); | |
5566b478 MS |
8007 | break; |
8008 | ||
8c161995 | 8009 | case CASE_LABEL_EXPR: |
4393e105 | 8010 | finish_case_label (tsubst_expr (CASE_LOW (t), args, complain, in_decl), |
56cb9733 MM |
8011 | tsubst_expr (CASE_HIGH (t), args, complain, |
8012 | in_decl)); | |
5566b478 MS |
8013 | break; |
8014 | ||
9e14e18f | 8015 | case LABEL_EXPR: |
9e14e18f | 8016 | finish_label_stmt (DECL_NAME (LABEL_EXPR_LABEL (t))); |
5566b478 MS |
8017 | break; |
8018 | ||
9e14e18f | 8019 | case GOTO_EXPR: |
fd10dd09 JM |
8020 | tmp = GOTO_DESTINATION (t); |
8021 | if (TREE_CODE (tmp) != LABEL_DECL) | |
aa09da44 MM |
8022 | /* Computed goto's must be tsubst'd into. On the other hand, |
8023 | non-computed gotos must not be; the identifier in question | |
8024 | will have no binding. */ | |
fd10dd09 | 8025 | tmp = tsubst_expr (tmp, args, complain, in_decl); |
3fa56191 | 8026 | else |
fd10dd09 JM |
8027 | tmp = DECL_NAME (tmp); |
8028 | finish_goto_stmt (tmp); | |
ad321293 MM |
8029 | break; |
8030 | ||
e130a54b | 8031 | case ASM_EXPR: |
c87978aa | 8032 | tmp = finish_asm_stmt |
6de9cd9a | 8033 | (ASM_VOLATILE_P (t), |
c87978aa JM |
8034 | tsubst_expr (ASM_STRING (t), args, complain, in_decl), |
8035 | tsubst_expr (ASM_OUTPUTS (t), args, complain, in_decl), | |
8036 | tsubst_expr (ASM_INPUTS (t), args, complain, in_decl), | |
8037 | tsubst_expr (ASM_CLOBBERS (t), args, complain, in_decl)); | |
8038 | ASM_INPUT_P (tmp) = ASM_INPUT_P (t); | |
5566b478 | 8039 | break; |
faf5394a MS |
8040 | |
8041 | case TRY_BLOCK: | |
f1dedc31 | 8042 | if (CLEANUP_P (t)) |
62409b39 | 8043 | { |
57b52417 | 8044 | stmt = begin_try_block (); |
62409b39 MM |
8045 | tsubst_expr (TRY_STMTS (t), args, complain, in_decl); |
8046 | finish_cleanup_try_block (stmt); | |
8047 | finish_cleanup (tsubst_expr (TRY_HANDLERS (t), args, | |
8048 | complain, in_decl), | |
8049 | stmt); | |
8050 | } | |
f1dedc31 MM |
8051 | else |
8052 | { | |
62409b39 MM |
8053 | if (FN_TRY_BLOCK_P (t)) |
8054 | stmt = begin_function_try_block (); | |
8055 | else | |
8056 | stmt = begin_try_block (); | |
8057 | ||
8058 | tsubst_expr (TRY_STMTS (t), args, complain, in_decl); | |
8059 | ||
8060 | if (FN_TRY_BLOCK_P (t)) | |
8061 | finish_function_try_block (stmt); | |
8062 | else | |
8063 | finish_try_block (stmt); | |
8064 | ||
fd10dd09 | 8065 | tsubst_expr (TRY_HANDLERS (t), args, complain, in_decl); |
84df082b MM |
8066 | if (FN_TRY_BLOCK_P (t)) |
8067 | finish_function_handler_sequence (stmt); | |
8068 | else | |
8069 | finish_handler_sequence (stmt); | |
f1dedc31 | 8070 | } |
faf5394a | 8071 | break; |
b35d4555 | 8072 | |
faf5394a | 8073 | case HANDLER: |
b35d4555 MM |
8074 | { |
8075 | tree decl; | |
b35d4555 | 8076 | |
b35d4555 MM |
8077 | stmt = begin_handler (); |
8078 | if (HANDLER_PARMS (t)) | |
8079 | { | |
325c3691 | 8080 | decl = HANDLER_PARMS (t); |
b35d4555 | 8081 | decl = tsubst (decl, args, complain, in_decl); |
f8191e64 MM |
8082 | /* Prevent instantiate_decl from trying to instantiate |
8083 | this variable. We've already done all that needs to be | |
8084 | done. */ | |
8085 | DECL_TEMPLATE_INSTANTIATED (decl) = 1; | |
b35d4555 MM |
8086 | } |
8087 | else | |
8088 | decl = NULL_TREE; | |
1a6025b4 | 8089 | finish_handler_parms (decl, stmt); |
b35d4555 | 8090 | tsubst_expr (HANDLER_BODY (t), args, complain, in_decl); |
1a6025b4 | 8091 | finish_handler (stmt); |
b35d4555 | 8092 | } |
faf5394a MS |
8093 | break; |
8094 | ||
b87692e5 | 8095 | case TAG_DEFN: |
fd10dd09 | 8096 | tsubst (TREE_TYPE (t), args, complain, NULL_TREE); |
b87692e5 MS |
8097 | break; |
8098 | ||
5566b478 | 8099 | default: |
325c3691 RH |
8100 | if (!STATEMENT_CODE_P (TREE_CODE (t))) |
8101 | return tsubst_copy_and_build (t, args, complain, in_decl, | |
8102 | /*function_p=*/false); | |
fd10dd09 | 8103 | abort (); |
5566b478 | 8104 | } |
fd10dd09 | 8105 | |
325c3691 | 8106 | return NULL_TREE; |
8d08fdba MS |
8107 | } |
8108 | ||
b3445994 MM |
8109 | /* T is a postfix-expression that is not being used in a function |
8110 | call. Return the substituted version of T. */ | |
8111 | ||
8112 | static tree | |
8113 | tsubst_non_call_postfix_expression (tree t, tree args, | |
8114 | tsubst_flags_t complain, | |
8115 | tree in_decl) | |
8116 | { | |
8117 | if (TREE_CODE (t) == SCOPE_REF) | |
8118 | t = tsubst_qualified_id (t, args, complain, in_decl, | |
8119 | /*done=*/false, /*address_p=*/false); | |
8120 | else | |
8121 | t = tsubst_copy_and_build (t, args, complain, in_decl, | |
8122 | /*function_p=*/false); | |
8123 | ||
8124 | return t; | |
8125 | } | |
8126 | ||
cc23546e | 8127 | /* Like tsubst but deals with expressions and performs semantic |
b3445994 | 8128 | analysis. FUNCTION_P is true if T is the "F" in "F (ARGS)". */ |
cc23546e | 8129 | |
ee76b931 | 8130 | tree |
3a978d72 NN |
8131 | tsubst_copy_and_build (tree t, |
8132 | tree args, | |
8133 | tsubst_flags_t complain, | |
b3445994 MM |
8134 | tree in_decl, |
8135 | bool function_p) | |
cc23546e | 8136 | { |
b3445994 MM |
8137 | #define RECUR(NODE) \ |
8138 | tsubst_copy_and_build (NODE, args, complain, in_decl, /*function_p=*/false) | |
8139 | ||
ee76b931 MM |
8140 | tree op1; |
8141 | ||
cc23546e JO |
8142 | if (t == NULL_TREE || t == error_mark_node) |
8143 | return t; | |
8144 | ||
8145 | switch (TREE_CODE (t)) | |
8146 | { | |
399dedb9 NS |
8147 | case USING_DECL: |
8148 | t = DECL_NAME (t); | |
852dcbdd | 8149 | /* Fall through. */ |
b3445994 | 8150 | case IDENTIFIER_NODE: |
cc23546e | 8151 | { |
b3445994 | 8152 | tree decl; |
b3445994 MM |
8153 | cp_id_kind idk; |
8154 | tree qualifying_class; | |
67c03833 | 8155 | bool non_integral_constant_expression_p; |
b3445994 MM |
8156 | const char *error_msg; |
8157 | ||
b3445994 | 8158 | if (IDENTIFIER_TYPENAME_P (t)) |
cc23546e | 8159 | { |
b3445994 MM |
8160 | tree new_type = tsubst (TREE_TYPE (t), args, complain, in_decl); |
8161 | t = mangle_conv_op_name_for_type (new_type); | |
cc23546e | 8162 | } |
b3445994 MM |
8163 | |
8164 | /* Look up the name. */ | |
10b1d5e7 | 8165 | decl = lookup_name (t, 0); |
b3445994 MM |
8166 | |
8167 | /* By convention, expressions use ERROR_MARK_NODE to indicate | |
8168 | failure, not NULL_TREE. */ | |
8169 | if (decl == NULL_TREE) | |
8170 | decl = error_mark_node; | |
8171 | ||
10b1d5e7 | 8172 | decl = finish_id_expression (t, decl, NULL_TREE, |
b3445994 MM |
8173 | &idk, |
8174 | &qualifying_class, | |
67c03833 JM |
8175 | /*integral_constant_expression_p=*/false, |
8176 | /*allow_non_integral_constant_expression_p=*/false, | |
8177 | &non_integral_constant_expression_p, | |
b3445994 MM |
8178 | &error_msg); |
8179 | if (error_msg) | |
8180 | error (error_msg); | |
8181 | if (!function_p && TREE_CODE (decl) == IDENTIFIER_NODE) | |
8182 | decl = unqualified_name_lookup_error (decl); | |
8183 | return decl; | |
cc23546e JO |
8184 | } |
8185 | ||
8186 | case TEMPLATE_ID_EXPR: | |
8187 | { | |
8188 | tree object; | |
b3445994 | 8189 | tree template = RECUR (TREE_OPERAND (t, 0)); |
bf12d54d NS |
8190 | tree targs = TREE_OPERAND (t, 1); |
8191 | ||
8192 | if (targs) | |
8193 | targs = tsubst_template_args (targs, args, complain, in_decl); | |
cc23546e JO |
8194 | |
8195 | if (TREE_CODE (template) == COMPONENT_REF) | |
8196 | { | |
8197 | object = TREE_OPERAND (template, 0); | |
8198 | template = TREE_OPERAND (template, 1); | |
8199 | } | |
8200 | else | |
8201 | object = NULL_TREE; | |
bd83b409 | 8202 | template = lookup_template_function (template, targs); |
cc23546e JO |
8203 | |
8204 | if (object) | |
f293ce4b RS |
8205 | return build3 (COMPONENT_REF, TREE_TYPE (template), |
8206 | object, template, NULL_TREE); | |
cc23546e JO |
8207 | else |
8208 | return template; | |
8209 | } | |
8210 | ||
8211 | case INDIRECT_REF: | |
b3445994 | 8212 | return build_x_indirect_ref (RECUR (TREE_OPERAND (t, 0)), "unary *"); |
cc23546e | 8213 | |
0da99d4e GB |
8214 | case NOP_EXPR: |
8215 | return build_nop | |
8216 | (tsubst (TREE_TYPE (t), args, complain, in_decl), | |
8217 | RECUR (TREE_OPERAND (t, 0))); | |
8218 | ||
cc23546e JO |
8219 | case CAST_EXPR: |
8220 | return build_functional_cast | |
8221 | (tsubst (TREE_TYPE (t), args, complain, in_decl), | |
b3445994 | 8222 | RECUR (TREE_OPERAND (t, 0))); |
cc23546e JO |
8223 | |
8224 | case REINTERPRET_CAST_EXPR: | |
8225 | return build_reinterpret_cast | |
8226 | (tsubst (TREE_TYPE (t), args, complain, in_decl), | |
b3445994 | 8227 | RECUR (TREE_OPERAND (t, 0))); |
cc23546e JO |
8228 | |
8229 | case CONST_CAST_EXPR: | |
8230 | return build_const_cast | |
8231 | (tsubst (TREE_TYPE (t), args, complain, in_decl), | |
b3445994 | 8232 | RECUR (TREE_OPERAND (t, 0))); |
cc23546e JO |
8233 | |
8234 | case DYNAMIC_CAST_EXPR: | |
8235 | return build_dynamic_cast | |
8236 | (tsubst (TREE_TYPE (t), args, complain, in_decl), | |
b3445994 | 8237 | RECUR (TREE_OPERAND (t, 0))); |
cc23546e JO |
8238 | |
8239 | case STATIC_CAST_EXPR: | |
8240 | return build_static_cast | |
8241 | (tsubst (TREE_TYPE (t), args, complain, in_decl), | |
b3445994 | 8242 | RECUR (TREE_OPERAND (t, 0))); |
cc23546e | 8243 | |
cc23546e JO |
8244 | case POSTDECREMENT_EXPR: |
8245 | case POSTINCREMENT_EXPR: | |
b3445994 MM |
8246 | op1 = tsubst_non_call_postfix_expression (TREE_OPERAND (t, 0), |
8247 | args, complain, in_decl); | |
ee76b931 MM |
8248 | return build_x_unary_op (TREE_CODE (t), op1); |
8249 | ||
8250 | case PREDECREMENT_EXPR: | |
8251 | case PREINCREMENT_EXPR: | |
cc23546e JO |
8252 | case NEGATE_EXPR: |
8253 | case BIT_NOT_EXPR: | |
cc23546e | 8254 | case ABS_EXPR: |
d17811fd MM |
8255 | case TRUTH_NOT_EXPR: |
8256 | case CONVERT_EXPR: /* Unary + */ | |
8257 | case REALPART_EXPR: | |
8258 | case IMAGPART_EXPR: | |
b3445994 | 8259 | return build_x_unary_op (TREE_CODE (t), RECUR (TREE_OPERAND (t, 0))); |
cc23546e | 8260 | |
cc23546e | 8261 | case ADDR_EXPR: |
ee76b931 MM |
8262 | op1 = TREE_OPERAND (t, 0); |
8263 | if (TREE_CODE (op1) == SCOPE_REF) | |
8264 | op1 = tsubst_qualified_id (op1, args, complain, in_decl, | |
8265 | /*done=*/true, /*address_p=*/true); | |
8266 | else | |
b3445994 MM |
8267 | op1 = tsubst_non_call_postfix_expression (op1, args, complain, |
8268 | in_decl); | |
fc2b8477 MM |
8269 | if (TREE_CODE (op1) == LABEL_DECL) |
8270 | return finish_label_address_expr (DECL_NAME (op1)); | |
ee76b931 MM |
8271 | return build_x_unary_op (ADDR_EXPR, op1); |
8272 | ||
cc23546e JO |
8273 | case PLUS_EXPR: |
8274 | case MINUS_EXPR: | |
8275 | case MULT_EXPR: | |
8276 | case TRUNC_DIV_EXPR: | |
8277 | case CEIL_DIV_EXPR: | |
8278 | case FLOOR_DIV_EXPR: | |
8279 | case ROUND_DIV_EXPR: | |
8280 | case EXACT_DIV_EXPR: | |
8281 | case BIT_AND_EXPR: | |
cc23546e JO |
8282 | case BIT_IOR_EXPR: |
8283 | case BIT_XOR_EXPR: | |
8284 | case TRUNC_MOD_EXPR: | |
8285 | case FLOOR_MOD_EXPR: | |
8286 | case TRUTH_ANDIF_EXPR: | |
8287 | case TRUTH_ORIF_EXPR: | |
8288 | case TRUTH_AND_EXPR: | |
8289 | case TRUTH_OR_EXPR: | |
8290 | case RSHIFT_EXPR: | |
8291 | case LSHIFT_EXPR: | |
8292 | case RROTATE_EXPR: | |
8293 | case LROTATE_EXPR: | |
8294 | case EQ_EXPR: | |
8295 | case NE_EXPR: | |
8296 | case MAX_EXPR: | |
8297 | case MIN_EXPR: | |
8298 | case LE_EXPR: | |
8299 | case GE_EXPR: | |
8300 | case LT_EXPR: | |
8301 | case GT_EXPR: | |
8302 | case MEMBER_REF: | |
b3445994 | 8303 | case DOTSTAR_EXPR: |
cc23546e JO |
8304 | return build_x_binary_op |
8305 | (TREE_CODE (t), | |
b3445994 | 8306 | RECUR (TREE_OPERAND (t, 0)), |
ec835fb2 MM |
8307 | RECUR (TREE_OPERAND (t, 1)), |
8308 | /*overloaded_p=*/NULL); | |
cc23546e JO |
8309 | |
8310 | case SCOPE_REF: | |
ee76b931 MM |
8311 | return tsubst_qualified_id (t, args, complain, in_decl, /*done=*/true, |
8312 | /*address_p=*/false); | |
cc23546e JO |
8313 | |
8314 | case ARRAY_REF: | |
ee76b931 MM |
8315 | if (tsubst_copy (TREE_OPERAND (t, 0), args, complain, in_decl) |
8316 | == NULL_TREE) | |
8317 | /* new-type-id */ | |
44de5aeb RK |
8318 | return build_nt (ARRAY_REF, NULL_TREE, RECUR (TREE_OPERAND (t, 1)), |
8319 | NULL_TREE, NULL_TREE); | |
ee76b931 | 8320 | |
b3445994 MM |
8321 | op1 = tsubst_non_call_postfix_expression (TREE_OPERAND (t, 0), |
8322 | args, complain, in_decl); | |
ee76b931 MM |
8323 | /* Remember that there was a reference to this entity. */ |
8324 | if (DECL_P (op1)) | |
8325 | mark_used (op1); | |
b3445994 | 8326 | return grok_array_decl (op1, RECUR (TREE_OPERAND (t, 1))); |
cc23546e JO |
8327 | |
8328 | case SIZEOF_EXPR: | |
8329 | case ALIGNOF_EXPR: | |
d17811fd MM |
8330 | op1 = TREE_OPERAND (t, 0); |
8331 | if (!args) | |
8332 | { | |
8333 | /* When there are no ARGS, we are trying to evaluate a | |
8334 | non-dependent expression from the parser. Trying to do | |
8335 | the substitutions may not work. */ | |
8336 | if (!TYPE_P (op1)) | |
8337 | op1 = TREE_TYPE (op1); | |
8338 | } | |
8339 | else | |
8340 | { | |
8341 | ++skip_evaluation; | |
b3445994 | 8342 | op1 = RECUR (op1); |
d17811fd MM |
8343 | --skip_evaluation; |
8344 | } | |
7a18b933 NS |
8345 | if (TYPE_P (op1)) |
8346 | return cxx_sizeof_or_alignof_type (op1, TREE_CODE (t), true); | |
d17811fd | 8347 | else |
7a18b933 | 8348 | return cxx_sizeof_or_alignof_expr (op1, TREE_CODE (t)); |
cc23546e JO |
8349 | |
8350 | case MODOP_EXPR: | |
e4c2c34b JM |
8351 | { |
8352 | tree r = build_x_modify_expr | |
8353 | (RECUR (TREE_OPERAND (t, 0)), | |
8354 | TREE_CODE (TREE_OPERAND (t, 1)), | |
8355 | RECUR (TREE_OPERAND (t, 2))); | |
bcf9a914 JM |
8356 | /* TREE_NO_WARNING must be set if either the expression was |
8357 | parenthesized or it uses an operator such as >>= rather | |
8358 | than plain assignment. In the former case, it was already | |
8359 | set and must be copied. In the latter case, | |
8360 | build_x_modify_expr sets it and it must not be reset | |
8361 | here. */ | |
8362 | if (TREE_NO_WARNING (t)) | |
8363 | TREE_NO_WARNING (r) = TREE_NO_WARNING (t); | |
e4c2c34b JM |
8364 | return r; |
8365 | } | |
cc23546e JO |
8366 | |
8367 | case ARROW_EXPR: | |
b3445994 MM |
8368 | op1 = tsubst_non_call_postfix_expression (TREE_OPERAND (t, 0), |
8369 | args, complain, in_decl); | |
ee76b931 MM |
8370 | /* Remember that there was a reference to this entity. */ |
8371 | if (DECL_P (op1)) | |
8372 | mark_used (op1); | |
8373 | return build_x_arrow (op1); | |
cc23546e JO |
8374 | |
8375 | case NEW_EXPR: | |
8376 | return build_new | |
b3445994 MM |
8377 | (RECUR (TREE_OPERAND (t, 0)), |
8378 | RECUR (TREE_OPERAND (t, 1)), | |
8379 | RECUR (TREE_OPERAND (t, 2)), | |
058b15c1 | 8380 | RECUR (TREE_OPERAND (t, 3)), |
cc23546e JO |
8381 | NEW_EXPR_USE_GLOBAL (t)); |
8382 | ||
8383 | case DELETE_EXPR: | |
8384 | return delete_sanity | |
b3445994 MM |
8385 | (RECUR (TREE_OPERAND (t, 0)), |
8386 | RECUR (TREE_OPERAND (t, 1)), | |
cc23546e JO |
8387 | DELETE_EXPR_USE_VEC (t), |
8388 | DELETE_EXPR_USE_GLOBAL (t)); | |
8389 | ||
8390 | case COMPOUND_EXPR: | |
b3445994 MM |
8391 | return build_x_compound_expr (RECUR (TREE_OPERAND (t, 0)), |
8392 | RECUR (TREE_OPERAND (t, 1))); | |
cc23546e | 8393 | |
ee76b931 | 8394 | case CALL_EXPR: |
cc23546e | 8395 | { |
ee76b931 MM |
8396 | tree function; |
8397 | tree call_args; | |
ee76b931 | 8398 | bool qualified_p; |
ee935db4 | 8399 | bool koenig_p; |
ee76b931 MM |
8400 | |
8401 | function = TREE_OPERAND (t, 0); | |
6d80c4b9 MM |
8402 | /* When we parsed the expression, we determined whether or |
8403 | not Koenig lookup should be performed. */ | |
8404 | koenig_p = KOENIG_LOOKUP_P (t); | |
ee76b931 | 8405 | if (TREE_CODE (function) == SCOPE_REF) |
cc23546e | 8406 | { |
ee76b931 MM |
8407 | qualified_p = true; |
8408 | function = tsubst_qualified_id (function, args, complain, in_decl, | |
8409 | /*done=*/false, | |
8410 | /*address_p=*/false); | |
cc23546e | 8411 | } |
ee76b931 | 8412 | else |
cc23546e | 8413 | { |
ee76b931 MM |
8414 | qualified_p = (TREE_CODE (function) == COMPONENT_REF |
8415 | && (TREE_CODE (TREE_OPERAND (function, 1)) | |
8416 | == SCOPE_REF)); | |
8417 | function = tsubst_copy_and_build (function, args, complain, | |
b3445994 MM |
8418 | in_decl, |
8419 | !qualified_p); | |
6d80c4b9 MM |
8420 | if (BASELINK_P (function)) |
8421 | qualified_p = true; | |
cc23546e | 8422 | } |
cc23546e | 8423 | |
b3445994 | 8424 | call_args = RECUR (TREE_OPERAND (t, 1)); |
676e33ca MM |
8425 | |
8426 | /* We do not perform argument-dependent lookup if normal | |
8427 | lookup finds a non-function, in accordance with the | |
8428 | expected resolution of DR 218. */ | |
ee935db4 | 8429 | if (koenig_p |
b3445994 | 8430 | && (is_overloaded_fn (function) |
b3445994 | 8431 | || TREE_CODE (function) == IDENTIFIER_NODE)) |
6d80c4b9 MM |
8432 | function = perform_koenig_lookup (function, call_args); |
8433 | ||
8434 | if (TREE_CODE (function) == IDENTIFIER_NODE) | |
b3445994 | 8435 | { |
6d80c4b9 MM |
8436 | unqualified_name_lookup_error (function); |
8437 | return error_mark_node; | |
b3445994 MM |
8438 | } |
8439 | ||
8440 | /* Remember that there was a reference to this entity. */ | |
8441 | if (DECL_P (function)) | |
8442 | mark_used (function); | |
8443 | ||
8444 | function = convert_from_reference (function); | |
d17811fd MM |
8445 | |
8446 | if (TREE_CODE (function) == OFFSET_REF) | |
8447 | return build_offset_ref_call_from_tree (function, call_args); | |
8448 | if (TREE_CODE (function) == COMPONENT_REF) | |
9f880ef9 MM |
8449 | { |
8450 | if (!BASELINK_P (TREE_OPERAND (function, 1))) | |
8451 | return finish_call_expr (function, call_args, | |
8452 | /*disallow_virtual=*/false, | |
8453 | /*koenig_p=*/false); | |
8454 | else | |
8455 | return (build_new_method_call | |
8456 | (TREE_OPERAND (function, 0), | |
8457 | TREE_OPERAND (function, 1), | |
8458 | call_args, NULL_TREE, | |
8459 | qualified_p ? LOOKUP_NONVIRTUAL : LOOKUP_NORMAL)); | |
8460 | } | |
d17811fd | 8461 | return finish_call_expr (function, call_args, |
6d80c4b9 MM |
8462 | /*disallow_virtual=*/qualified_p, |
8463 | koenig_p); | |
cc23546e JO |
8464 | } |
8465 | ||
8466 | case COND_EXPR: | |
8467 | return build_x_conditional_expr | |
b3445994 MM |
8468 | (RECUR (TREE_OPERAND (t, 0)), |
8469 | RECUR (TREE_OPERAND (t, 1)), | |
8470 | RECUR (TREE_OPERAND (t, 2))); | |
cc23546e JO |
8471 | |
8472 | case PSEUDO_DTOR_EXPR: | |
8473 | return finish_pseudo_destructor_expr | |
b3445994 MM |
8474 | (RECUR (TREE_OPERAND (t, 0)), |
8475 | RECUR (TREE_OPERAND (t, 1)), | |
8476 | RECUR (TREE_OPERAND (t, 2))); | |
cc23546e JO |
8477 | |
8478 | case TREE_LIST: | |
8479 | { | |
8480 | tree purpose, value, chain; | |
8481 | ||
8482 | if (t == void_list_node) | |
8483 | return t; | |
8484 | ||
8485 | purpose = TREE_PURPOSE (t); | |
8486 | if (purpose) | |
b3445994 | 8487 | purpose = RECUR (purpose); |
cc23546e JO |
8488 | value = TREE_VALUE (t); |
8489 | if (value) | |
b3445994 | 8490 | value = RECUR (value); |
cc23546e JO |
8491 | chain = TREE_CHAIN (t); |
8492 | if (chain && chain != void_type_node) | |
b3445994 | 8493 | chain = RECUR (chain); |
cc23546e JO |
8494 | if (purpose == TREE_PURPOSE (t) |
8495 | && value == TREE_VALUE (t) | |
8496 | && chain == TREE_CHAIN (t)) | |
8497 | return t; | |
8498 | return tree_cons (purpose, value, chain); | |
8499 | } | |
8500 | ||
8501 | case COMPONENT_REF: | |
8502 | { | |
ee76b931 MM |
8503 | tree object; |
8504 | tree member; | |
8505 | ||
b3445994 MM |
8506 | object = tsubst_non_call_postfix_expression (TREE_OPERAND (t, 0), |
8507 | args, complain, in_decl); | |
ee76b931 MM |
8508 | /* Remember that there was a reference to this entity. */ |
8509 | if (DECL_P (object)) | |
8510 | mark_used (object); | |
8511 | ||
8512 | member = TREE_OPERAND (t, 1); | |
8513 | if (BASELINK_P (member)) | |
8514 | member = tsubst_baselink (member, | |
8515 | non_reference (TREE_TYPE (object)), | |
8516 | args, complain, in_decl); | |
8517 | else | |
8518 | member = tsubst_copy (member, args, complain, in_decl); | |
cc23546e JO |
8519 | |
8520 | if (!CLASS_TYPE_P (TREE_TYPE (object))) | |
8521 | { | |
8522 | if (TREE_CODE (member) == BIT_NOT_EXPR) | |
8523 | return finish_pseudo_destructor_expr (object, | |
8524 | NULL_TREE, | |
8525 | TREE_TYPE (object)); | |
8526 | else if (TREE_CODE (member) == SCOPE_REF | |
8527 | && (TREE_CODE (TREE_OPERAND (member, 1)) == BIT_NOT_EXPR)) | |
8528 | return finish_pseudo_destructor_expr (object, | |
8529 | object, | |
8530 | TREE_TYPE (object)); | |
8531 | } | |
8532 | else if (TREE_CODE (member) == SCOPE_REF | |
8533 | && TREE_CODE (TREE_OPERAND (member, 1)) == TEMPLATE_ID_EXPR) | |
8534 | { | |
8535 | tree tmpl; | |
8536 | tree args; | |
8537 | ||
8538 | /* Lookup the template functions now that we know what the | |
8539 | scope is. */ | |
8540 | tmpl = TREE_OPERAND (TREE_OPERAND (member, 1), 0); | |
8541 | args = TREE_OPERAND (TREE_OPERAND (member, 1), 1); | |
22038b2c | 8542 | member = lookup_qualified_name (TREE_OPERAND (member, 0), tmpl, |
12483c9f NS |
8543 | /*is_type_p=*/false, |
8544 | /*complain=*/false); | |
cc23546e JO |
8545 | if (BASELINK_P (member)) |
8546 | BASELINK_FUNCTIONS (member) | |
8547 | = build_nt (TEMPLATE_ID_EXPR, BASELINK_FUNCTIONS (member), | |
8548 | args); | |
8549 | else | |
8550 | { | |
8f78f01f MM |
8551 | qualified_name_lookup_error (TREE_TYPE (object), tmpl, |
8552 | member); | |
cc23546e JO |
8553 | return error_mark_node; |
8554 | } | |
8555 | } | |
2436b51f MM |
8556 | else if (TREE_CODE (member) == SCOPE_REF |
8557 | && !CLASS_TYPE_P (TREE_OPERAND (member, 0)) | |
8558 | && TREE_CODE (TREE_OPERAND (member, 0)) != NAMESPACE_DECL) | |
8559 | { | |
8560 | if (complain & tf_error) | |
8561 | { | |
8562 | if (TYPE_P (TREE_OPERAND (member, 0))) | |
8563 | error ("`%T' is not a class or namespace", | |
8564 | TREE_OPERAND (member, 0)); | |
8565 | else | |
8566 | error ("`%D' is not a class or namespace", | |
8567 | TREE_OPERAND (member, 0)); | |
8568 | } | |
8569 | return error_mark_node; | |
8570 | } | |
a3f10e50 NS |
8571 | else if (TREE_CODE (member) == FIELD_DECL) |
8572 | return finish_non_static_data_member (member, object, NULL_TREE); | |
cc23546e JO |
8573 | |
8574 | return finish_class_member_access_expr (object, member); | |
8575 | } | |
8576 | ||
8577 | case THROW_EXPR: | |
8578 | return build_throw | |
b3445994 | 8579 | (RECUR (TREE_OPERAND (t, 0))); |
cc23546e JO |
8580 | |
8581 | case CONSTRUCTOR: | |
8582 | { | |
8583 | tree r; | |
8584 | tree elts; | |
8585 | tree type = tsubst (TREE_TYPE (t), args, complain, in_decl); | |
8586 | bool purpose_p; | |
8587 | ||
8588 | /* digest_init will do the wrong thing if we let it. */ | |
8589 | if (type && TYPE_PTRMEMFUNC_P (type)) | |
8590 | return t; | |
8591 | ||
8592 | r = NULL_TREE; | |
8593 | /* We do not want to process the purpose of aggregate | |
8594 | initializers as they are identifier nodes which will be | |
8595 | looked up by digest_init. */ | |
8596 | purpose_p = !(type && IS_AGGR_TYPE (type)); | |
db77ef4c | 8597 | for (elts = CONSTRUCTOR_ELTS (t); |
cc23546e JO |
8598 | elts; |
8599 | elts = TREE_CHAIN (elts)) | |
8600 | { | |
8601 | tree purpose = TREE_PURPOSE (elts); | |
8602 | tree value = TREE_VALUE (elts); | |
8603 | ||
8604 | if (purpose && purpose_p) | |
b3445994 MM |
8605 | purpose = RECUR (purpose); |
8606 | value = RECUR (value); | |
cc23546e JO |
8607 | r = tree_cons (purpose, value, r); |
8608 | } | |
8609 | ||
dcf92453 | 8610 | r = build_constructor (NULL_TREE, nreverse (r)); |
cc23546e JO |
8611 | TREE_HAS_CONSTRUCTOR (r) = TREE_HAS_CONSTRUCTOR (t); |
8612 | ||
8613 | if (type) | |
8614 | return digest_init (type, r, 0); | |
8615 | return r; | |
8616 | } | |
8617 | ||
8618 | case TYPEID_EXPR: | |
8619 | { | |
b3445994 | 8620 | tree operand_0 = RECUR (TREE_OPERAND (t, 0)); |
cc23546e JO |
8621 | if (TYPE_P (operand_0)) |
8622 | return get_typeid (operand_0); | |
8623 | return build_typeid (operand_0); | |
8624 | } | |
8625 | ||
8626 | case PARM_DECL: | |
8627 | return convert_from_reference (tsubst_copy (t, args, complain, in_decl)); | |
8628 | ||
8629 | case VAR_DECL: | |
ee76b931 MM |
8630 | if (args) |
8631 | t = tsubst_copy (t, args, complain, in_decl); | |
8632 | return convert_from_reference (t); | |
cc23546e JO |
8633 | |
8634 | case VA_ARG_EXPR: | |
b3445994 MM |
8635 | return build_x_va_arg (RECUR (TREE_OPERAND (t, 0)), |
8636 | tsubst_copy (TREE_TYPE (t), args, complain, | |
8637 | in_decl)); | |
cc23546e JO |
8638 | |
8639 | default: | |
8640 | return tsubst_copy (t, args, complain, in_decl); | |
8641 | } | |
b3445994 MM |
8642 | |
8643 | #undef RECUR | |
cc23546e JO |
8644 | } |
8645 | ||
3e4a3562 NS |
8646 | /* Verify that the instantiated ARGS are valid. For type arguments, |
8647 | make sure that the type's linkage is ok. For non-type arguments, | |
34cd5ae7 | 8648 | make sure they are constants if they are integral or enumerations. |
9bcb9aae | 8649 | Emit an error under control of COMPLAIN, and return TRUE on error. */ |
3e4a3562 NS |
8650 | |
8651 | static bool | |
3a978d72 | 8652 | check_instantiated_args (tree tmpl, tree args, tsubst_flags_t complain) |
3e4a3562 NS |
8653 | { |
8654 | int ix, len = DECL_NTPARMS (tmpl); | |
8655 | bool result = false; | |
8656 | ||
8657 | for (ix = 0; ix != len; ix++) | |
8658 | { | |
8659 | tree t = TREE_VEC_ELT (args, ix); | |
8660 | ||
8661 | if (TYPE_P (t)) | |
8662 | { | |
8663 | /* [basic.link]: A name with no linkage (notably, the name | |
8664 | of a class or enumeration declared in a local scope) | |
8665 | shall not be used to declare an entity with linkage. | |
8666 | This implies that names with no linkage cannot be used as | |
8667 | template arguments. */ | |
4684cd27 | 8668 | tree nt = no_linkage_check (t, /*relaxed_p=*/false); |
3e4a3562 NS |
8669 | |
8670 | if (nt) | |
8671 | { | |
8672 | if (!(complain & tf_error)) | |
8673 | /*OK*/; | |
8674 | else if (TYPE_ANONYMOUS_P (nt)) | |
8675 | error ("`%T' uses anonymous type", t); | |
8676 | else | |
8677 | error ("`%T' uses local type `%T'", t, nt); | |
8678 | result = true; | |
8679 | } | |
8680 | /* In order to avoid all sorts of complications, we do not | |
8681 | allow variably-modified types as template arguments. */ | |
5377d5ba | 8682 | else if (variably_modified_type_p (t, NULL_TREE)) |
3e4a3562 NS |
8683 | { |
8684 | if (complain & tf_error) | |
8685 | error ("`%T' is a variably modified type", t); | |
8686 | result = true; | |
8687 | } | |
8688 | } | |
8689 | /* A non-type argument of integral or enumerated type must be a | |
8690 | constant. */ | |
8691 | else if (TREE_TYPE (t) | |
8692 | && INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (t)) | |
8693 | && !TREE_CONSTANT (t)) | |
8694 | { | |
8695 | if (complain & tf_error) | |
8696 | error ("integral expression `%E' is not constant", t); | |
8697 | result = true; | |
8698 | } | |
8699 | } | |
8700 | if (result && complain & tf_error) | |
8701 | error (" trying to instantiate `%D'", tmpl); | |
8702 | return result; | |
8703 | } | |
8704 | ||
6ba89f8e | 8705 | /* Instantiate the indicated variable or function template TMPL with |
36a117a5 MM |
8706 | the template arguments in TARG_PTR. */ |
8707 | ||
5566b478 | 8708 | tree |
3a978d72 | 8709 | instantiate_template (tree tmpl, tree targ_ptr, tsubst_flags_t complain) |
8d08fdba | 8710 | { |
5566b478 | 8711 | tree fndecl; |
36a117a5 MM |
8712 | tree gen_tmpl; |
8713 | tree spec; | |
5566b478 | 8714 | |
27fafc8d JM |
8715 | if (tmpl == error_mark_node) |
8716 | return error_mark_node; | |
8717 | ||
386b8a85 JM |
8718 | my_friendly_assert (TREE_CODE (tmpl) == TEMPLATE_DECL, 283); |
8719 | ||
db9b2174 MM |
8720 | /* If this function is a clone, handle it specially. */ |
8721 | if (DECL_CLONED_FUNCTION_P (tmpl)) | |
3ad97789 | 8722 | { |
a30f62e0 | 8723 | tree spec; |
3ad97789 NS |
8724 | tree clone; |
8725 | ||
a30f62e0 MM |
8726 | spec = instantiate_template (DECL_CLONED_FUNCTION (tmpl), targ_ptr, |
8727 | complain); | |
8728 | if (spec == error_mark_node) | |
8729 | return error_mark_node; | |
8730 | ||
c6002625 | 8731 | /* Look for the clone. */ |
4684cd27 | 8732 | FOR_EACH_CLONE (clone, spec) |
3ad97789 NS |
8733 | if (DECL_NAME (clone) == DECL_NAME (tmpl)) |
8734 | return clone; | |
8735 | /* We should always have found the clone by now. */ | |
a98facb0 | 8736 | abort (); |
3ad97789 NS |
8737 | return NULL_TREE; |
8738 | } | |
8739 | ||
36a117a5 MM |
8740 | /* Check to see if we already have this specialization. */ |
8741 | spec = retrieve_specialization (tmpl, targ_ptr); | |
8742 | if (spec != NULL_TREE) | |
8743 | return spec; | |
8744 | ||
f9a7ae04 MM |
8745 | gen_tmpl = most_general_template (tmpl); |
8746 | if (tmpl != gen_tmpl) | |
386b8a85 | 8747 | { |
36a117a5 MM |
8748 | /* The TMPL is a partial instantiation. To get a full set of |
8749 | arguments we must add the arguments used to perform the | |
8750 | partial instantiation. */ | |
8751 | targ_ptr = add_outermost_template_args (DECL_TI_ARGS (tmpl), | |
8752 | targ_ptr); | |
36a117a5 MM |
8753 | |
8754 | /* Check to see if we already have this specialization. */ | |
8755 | spec = retrieve_specialization (gen_tmpl, targ_ptr); | |
75650646 MM |
8756 | if (spec != NULL_TREE) |
8757 | return spec; | |
386b8a85 JM |
8758 | } |
8759 | ||
3e4a3562 NS |
8760 | if (check_instantiated_args (gen_tmpl, INNERMOST_TEMPLATE_ARGS (targ_ptr), |
8761 | complain)) | |
8762 | return error_mark_node; | |
8763 | ||
2b907f5c KL |
8764 | /* We are building a FUNCTION_DECL, during which the access of its |
8765 | parameters and return types have to be checked. However this | |
8766 | FUNCTION_DECL which is the desired context for access checking | |
8767 | is not built yet. We solve this chicken-and-egg problem by | |
8768 | deferring all checks until we have the FUNCTION_DECL. */ | |
8769 | push_deferring_access_checks (dk_deferred); | |
5c74d5b0 | 8770 | |
f4f206f4 | 8771 | /* Substitute template parameters. */ |
17aec3eb | 8772 | fndecl = tsubst (DECL_TEMPLATE_RESULT (gen_tmpl), |
3e4a3562 | 8773 | targ_ptr, complain, gen_tmpl); |
5c74d5b0 | 8774 | |
2b907f5c KL |
8775 | /* Now we know the specialization, compute access previously |
8776 | deferred. */ | |
8777 | push_access_scope (fndecl); | |
8778 | perform_deferred_access_checks (); | |
8779 | pop_access_scope (fndecl); | |
8780 | pop_deferring_access_checks (); | |
5c74d5b0 | 8781 | |
36a117a5 MM |
8782 | /* The DECL_TI_TEMPLATE should always be the immediate parent |
8783 | template, not the most general template. */ | |
8784 | DECL_TI_TEMPLATE (fndecl) = tmpl; | |
8d08fdba | 8785 | |
94350948 | 8786 | /* If we've just instantiated the main entry point for a function, |
3ad97789 NS |
8787 | instantiate all the alternate entry points as well. We do this |
8788 | by cloning the instantiation of the main entry point, not by | |
8789 | instantiating the template clones. */ | |
8790 | if (TREE_CHAIN (gen_tmpl) && DECL_CLONED_FUNCTION_P (TREE_CHAIN (gen_tmpl))) | |
8791 | clone_function_decl (fndecl, /*update_method_vec_p=*/0); | |
94350948 | 8792 | |
5566b478 | 8793 | return fndecl; |
8d08fdba | 8794 | } |
5566b478 | 8795 | |
4393e105 MM |
8796 | /* The FN is a TEMPLATE_DECL for a function. The ARGS are the |
8797 | arguments that are being used when calling it. TARGS is a vector | |
8798 | into which the deduced template arguments are placed. | |
8d08fdba MS |
8799 | |
8800 | Return zero for success, 2 for an incomplete match that doesn't resolve | |
8801 | all the types, and 1 for complete failure. An error message will be | |
8802 | printed only for an incomplete match. | |
8803 | ||
e5214479 JM |
8804 | If FN is a conversion operator, or we are trying to produce a specific |
8805 | specialization, RETURN_TYPE is the return type desired. | |
9f54c803 MM |
8806 | |
8807 | The EXPLICIT_TARGS are explicit template arguments provided via a | |
8808 | template-id. | |
6467930b | 8809 | |
830bfa74 MM |
8810 | The parameter STRICT is one of: |
8811 | ||
8812 | DEDUCE_CALL: | |
8813 | We are deducing arguments for a function call, as in | |
8814 | [temp.deduct.call]. | |
8815 | ||
8816 | DEDUCE_CONV: | |
8817 | We are deducing arguments for a conversion function, as in | |
8818 | [temp.deduct.conv]. | |
8819 | ||
8820 | DEDUCE_EXACT: | |
62e4a758 NS |
8821 | We are deducing arguments when doing an explicit instantiation |
8822 | as in [temp.explicit], when determining an explicit specialization | |
8823 | as in [temp.expl.spec], or when taking the address of a function | |
8824 | template, as in [temp.deduct.funcaddr]. | |
8825 | ||
8826 | DEDUCE_ORDER: | |
830bfa74 MM |
8827 | We are deducing arguments when calculating the partial |
8828 | ordering between specializations of function or class | |
62e4a758 | 8829 | templates, as in [temp.func.order] and [temp.class.order]. |
4393e105 | 8830 | |
e5214479 JM |
8831 | LEN is the number of parms to consider before returning success, or -1 |
8832 | for all. This is used in partial ordering to avoid comparing parms for | |
8833 | which no actual argument was passed, since they are not considered in | |
8834 | overload resolution (and are explicitly excluded from consideration in | |
8835 | partial ordering in [temp.func.order]/6). */ | |
8d08fdba MS |
8836 | |
8837 | int | |
3a978d72 NN |
8838 | fn_type_unification (tree fn, |
8839 | tree explicit_targs, | |
8840 | tree targs, | |
8841 | tree args, | |
8842 | tree return_type, | |
8843 | unification_kind_t strict, | |
8844 | int len) | |
386b8a85 | 8845 | { |
4393e105 MM |
8846 | tree parms; |
8847 | tree fntype; | |
adecb3f4 | 8848 | int result; |
386b8a85 | 8849 | |
4393e105 | 8850 | my_friendly_assert (TREE_CODE (fn) == TEMPLATE_DECL, 0); |
2b59fc25 | 8851 | |
4393e105 MM |
8852 | fntype = TREE_TYPE (fn); |
8853 | if (explicit_targs) | |
75650646 | 8854 | { |
4393e105 MM |
8855 | /* [temp.deduct] |
8856 | ||
8857 | The specified template arguments must match the template | |
8858 | parameters in kind (i.e., type, nontype, template), and there | |
8859 | must not be more arguments than there are parameters; | |
8860 | otherwise type deduction fails. | |
8861 | ||
8862 | Nontype arguments must match the types of the corresponding | |
8863 | nontype template parameters, or must be convertible to the | |
8864 | types of the corresponding nontype parameters as specified in | |
8865 | _temp.arg.nontype_, otherwise type deduction fails. | |
8866 | ||
8867 | All references in the function type of the function template | |
8868 | to the corresponding template parameters are replaced by the | |
8869 | specified template argument values. If a substitution in a | |
8870 | template parameter or in the function type of the function | |
8871 | template results in an invalid type, type deduction fails. */ | |
8872 | int i; | |
8873 | tree converted_args; | |
ffd49b19 | 8874 | bool incomplete; |
75650646 | 8875 | |
4393e105 MM |
8876 | converted_args |
8877 | = (coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (fn), | |
c2ea3a40 | 8878 | explicit_targs, NULL_TREE, tf_none, |
4393e105 MM |
8879 | /*require_all_arguments=*/0)); |
8880 | if (converted_args == error_mark_node) | |
75650646 | 8881 | return 1; |
386b8a85 | 8882 | |
ffd49b19 NS |
8883 | /* Substitute the explicit args into the function type. This is |
8884 | necessary so that, for instance, explicitly declared function | |
8885 | arguments can match null pointed constants. If we were given | |
8886 | an incomplete set of explicit args, we must not do semantic | |
8887 | processing during substitution as we could create partial | |
8888 | instantiations. */ | |
8889 | incomplete = NUM_TMPL_ARGS (explicit_targs) != NUM_TMPL_ARGS (targs); | |
8890 | processing_template_decl += incomplete; | |
c2ea3a40 | 8891 | fntype = tsubst (fntype, converted_args, tf_none, NULL_TREE); |
ffd49b19 NS |
8892 | processing_template_decl -= incomplete; |
8893 | ||
4393e105 MM |
8894 | if (fntype == error_mark_node) |
8895 | return 1; | |
050367a3 | 8896 | |
4393e105 | 8897 | /* Place the explicitly specified arguments in TARGS. */ |
ffd49b19 | 8898 | for (i = NUM_TMPL_ARGS (converted_args); i--;) |
4393e105 | 8899 | TREE_VEC_ELT (targs, i) = TREE_VEC_ELT (converted_args, i); |
75650646 | 8900 | } |
4393e105 MM |
8901 | |
8902 | parms = TYPE_ARG_TYPES (fntype); | |
e5214479 JM |
8903 | /* Never do unification on the 'this' parameter. */ |
8904 | if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fn)) | |
8905 | parms = TREE_CHAIN (parms); | |
8d3631f8 NS |
8906 | |
8907 | if (return_type) | |
8908 | { | |
8909 | /* We've been given a return type to match, prepend it. */ | |
8910 | parms = tree_cons (NULL_TREE, TREE_TYPE (fntype), parms); | |
8911 | args = tree_cons (NULL_TREE, return_type, args); | |
16e42e7c JM |
8912 | if (len >= 0) |
8913 | ++len; | |
4393e105 MM |
8914 | } |
8915 | ||
4393e105 MM |
8916 | /* We allow incomplete unification without an error message here |
8917 | because the standard doesn't seem to explicitly prohibit it. Our | |
8918 | callers must be ready to deal with unification failures in any | |
8919 | event. */ | |
adecb3f4 MM |
8920 | result = type_unification_real (DECL_INNERMOST_TEMPLATE_PARMS (fn), |
8921 | targs, parms, args, /*subr=*/0, | |
e5214479 | 8922 | strict, /*allow_incomplete*/1, len); |
adecb3f4 MM |
8923 | |
8924 | if (result == 0) | |
8925 | /* All is well so far. Now, check: | |
8926 | ||
8927 | [temp.deduct] | |
8928 | ||
8929 | When all template arguments have been deduced, all uses of | |
8930 | template parameters in nondeduced contexts are replaced with | |
8931 | the corresponding deduced argument values. If the | |
8932 | substitution results in an invalid type, as described above, | |
8933 | type deduction fails. */ | |
c2ea3a40 | 8934 | if (tsubst (TREE_TYPE (fn), targs, tf_none, NULL_TREE) |
adecb3f4 MM |
8935 | == error_mark_node) |
8936 | return 1; | |
8937 | ||
8938 | return result; | |
830bfa74 MM |
8939 | } |
8940 | ||
8941 | /* Adjust types before performing type deduction, as described in | |
8942 | [temp.deduct.call] and [temp.deduct.conv]. The rules in these two | |
4c7d0dff MM |
8943 | sections are symmetric. PARM is the type of a function parameter |
8944 | or the return type of the conversion function. ARG is the type of | |
8945 | the argument passed to the call, or the type of the value | |
dc957d14 | 8946 | initialized with the result of the conversion function. */ |
386b8a85 | 8947 | |
62e4a758 | 8948 | static int |
3a978d72 NN |
8949 | maybe_adjust_types_for_deduction (unification_kind_t strict, |
8950 | tree* parm, | |
8951 | tree* arg) | |
830bfa74 | 8952 | { |
62e4a758 NS |
8953 | int result = 0; |
8954 | ||
830bfa74 MM |
8955 | switch (strict) |
8956 | { | |
8957 | case DEDUCE_CALL: | |
8958 | break; | |
8959 | ||
8960 | case DEDUCE_CONV: | |
8961 | { | |
4c7d0dff MM |
8962 | /* Swap PARM and ARG throughout the remainder of this |
8963 | function; the handling is precisely symmetric since PARM | |
8964 | will initialize ARG rather than vice versa. */ | |
830bfa74 MM |
8965 | tree* temp = parm; |
8966 | parm = arg; | |
8967 | arg = temp; | |
8968 | break; | |
8969 | } | |
8970 | ||
8971 | case DEDUCE_EXACT: | |
8972 | /* There is nothing to do in this case. */ | |
62e4a758 | 8973 | return 0; |
830bfa74 | 8974 | |
62e4a758 NS |
8975 | case DEDUCE_ORDER: |
8976 | /* DR 214. [temp.func.order] is underspecified, and leads to no | |
8977 | ordering between things like `T *' and `T const &' for `U *'. | |
8978 | The former has T=U and the latter T=U*. The former looks more | |
8979 | specialized and John Spicer considers it well-formed (the EDG | |
8980 | compiler accepts it). | |
8981 | ||
8982 | John also confirms that deduction should proceed as in a function | |
996065b4 | 8983 | call. Which implies the usual ARG and PARM conversions as DEDUCE_CALL. |
62e4a758 NS |
8984 | However, in ordering, ARG can have REFERENCE_TYPE, but no argument |
8985 | to an actual call can have such a type. | |
8986 | ||
996065b4 NS |
8987 | If both ARG and PARM are REFERENCE_TYPE, we change neither. |
8988 | If only ARG is a REFERENCE_TYPE, we look through that and then | |
8989 | proceed as with DEDUCE_CALL (which could further convert it). */ | |
62e4a758 NS |
8990 | if (TREE_CODE (*arg) == REFERENCE_TYPE) |
8991 | { | |
8992 | if (TREE_CODE (*parm) == REFERENCE_TYPE) | |
8993 | return 0; | |
8994 | *arg = TREE_TYPE (*arg); | |
62e4a758 NS |
8995 | } |
8996 | break; | |
830bfa74 | 8997 | default: |
a98facb0 | 8998 | abort (); |
830bfa74 MM |
8999 | } |
9000 | ||
9001 | if (TREE_CODE (*parm) != REFERENCE_TYPE) | |
9002 | { | |
9003 | /* [temp.deduct.call] | |
9004 | ||
9005 | If P is not a reference type: | |
9006 | ||
9007 | --If A is an array type, the pointer type produced by the | |
9008 | array-to-pointer standard conversion (_conv.array_) is | |
9009 | used in place of A for type deduction; otherwise, | |
9010 | ||
9011 | --If A is a function type, the pointer type produced by | |
9012 | the function-to-pointer standard conversion | |
9013 | (_conv.func_) is used in place of A for type deduction; | |
9014 | otherwise, | |
9015 | ||
9016 | --If A is a cv-qualified type, the top level | |
9017 | cv-qualifiers of A's type are ignored for type | |
9018 | deduction. */ | |
9019 | if (TREE_CODE (*arg) == ARRAY_TYPE) | |
9020 | *arg = build_pointer_type (TREE_TYPE (*arg)); | |
d8f8dca1 | 9021 | else if (TREE_CODE (*arg) == FUNCTION_TYPE) |
830bfa74 MM |
9022 | *arg = build_pointer_type (*arg); |
9023 | else | |
9024 | *arg = TYPE_MAIN_VARIANT (*arg); | |
9025 | } | |
9026 | ||
9027 | /* [temp.deduct.call] | |
9028 | ||
9029 | If P is a cv-qualified type, the top level cv-qualifiers | |
9030 | of P's type are ignored for type deduction. If P is a | |
9031 | reference type, the type referred to by P is used for | |
9032 | type deduction. */ | |
9033 | *parm = TYPE_MAIN_VARIANT (*parm); | |
9034 | if (TREE_CODE (*parm) == REFERENCE_TYPE) | |
62e4a758 NS |
9035 | { |
9036 | *parm = TREE_TYPE (*parm); | |
9037 | result |= UNIFY_ALLOW_OUTER_MORE_CV_QUAL; | |
9038 | } | |
1c82cc90 NS |
9039 | |
9040 | /* DR 322. For conversion deduction, remove a reference type on parm | |
9041 | too (which has been swapped into ARG). */ | |
9042 | if (strict == DEDUCE_CONV && TREE_CODE (*arg) == REFERENCE_TYPE) | |
9043 | *arg = TREE_TYPE (*arg); | |
9044 | ||
62e4a758 | 9045 | return result; |
386b8a85 JM |
9046 | } |
9047 | ||
e5214479 | 9048 | /* Most parms like fn_type_unification. |
9f54c803 MM |
9049 | |
9050 | If SUBR is 1, we're being called recursively (to unify the | |
9051 | arguments of a function or method parameter of a function | |
9052 | template). */ | |
386b8a85 | 9053 | |
4966381a | 9054 | static int |
3a978d72 NN |
9055 | type_unification_real (tree tparms, |
9056 | tree targs, | |
9057 | tree xparms, | |
9058 | tree xargs, | |
9059 | int subr, | |
9060 | unification_kind_t strict, | |
9061 | int allow_incomplete, | |
9062 | int xlen) | |
8d08fdba MS |
9063 | { |
9064 | tree parm, arg; | |
9065 | int i; | |
9066 | int ntparms = TREE_VEC_LENGTH (tparms); | |
830bfa74 | 9067 | int sub_strict; |
bd0d5d4a JM |
9068 | int saw_undeduced = 0; |
9069 | tree parms, args; | |
9070 | int len; | |
8d08fdba MS |
9071 | |
9072 | my_friendly_assert (TREE_CODE (tparms) == TREE_VEC, 289); | |
bd0d5d4a JM |
9073 | my_friendly_assert (xparms == NULL_TREE |
9074 | || TREE_CODE (xparms) == TREE_LIST, 290); | |
ee3071ef | 9075 | my_friendly_assert (!xargs || TREE_CODE (xargs) == TREE_LIST, 291); |
8d08fdba MS |
9076 | my_friendly_assert (ntparms > 0, 292); |
9077 | ||
830bfa74 MM |
9078 | switch (strict) |
9079 | { | |
9080 | case DEDUCE_CALL: | |
028d1f20 NS |
9081 | sub_strict = (UNIFY_ALLOW_OUTER_LEVEL | UNIFY_ALLOW_MORE_CV_QUAL |
9082 | | UNIFY_ALLOW_DERIVED); | |
830bfa74 MM |
9083 | break; |
9084 | ||
9085 | case DEDUCE_CONV: | |
9086 | sub_strict = UNIFY_ALLOW_LESS_CV_QUAL; | |
9087 | break; | |
9088 | ||
9089 | case DEDUCE_EXACT: | |
9090 | sub_strict = UNIFY_ALLOW_NONE; | |
9091 | break; | |
62e4a758 NS |
9092 | |
9093 | case DEDUCE_ORDER: | |
9094 | sub_strict = UNIFY_ALLOW_NONE; | |
9095 | break; | |
830bfa74 MM |
9096 | |
9097 | default: | |
a98facb0 | 9098 | abort (); |
830bfa74 MM |
9099 | } |
9100 | ||
bd0d5d4a | 9101 | if (xlen == 0) |
e5214479 JM |
9102 | return 0; |
9103 | ||
bd0d5d4a JM |
9104 | again: |
9105 | parms = xparms; | |
9106 | args = xargs; | |
9107 | len = xlen; | |
9108 | ||
8d08fdba MS |
9109 | while (parms |
9110 | && parms != void_list_node | |
9111 | && args | |
9112 | && args != void_list_node) | |
9113 | { | |
9114 | parm = TREE_VALUE (parms); | |
9115 | parms = TREE_CHAIN (parms); | |
9116 | arg = TREE_VALUE (args); | |
9117 | args = TREE_CHAIN (args); | |
9118 | ||
9119 | if (arg == error_mark_node) | |
9120 | return 1; | |
9121 | if (arg == unknown_type_node) | |
34016c81 JM |
9122 | /* We can't deduce anything from this, but we might get all the |
9123 | template args from other function args. */ | |
9124 | continue; | |
b7484fbe | 9125 | |
03e70705 JM |
9126 | /* Conversions will be performed on a function argument that |
9127 | corresponds with a function parameter that contains only | |
9128 | non-deducible template parameters and explicitly specified | |
9129 | template parameters. */ | |
c353b8e3 | 9130 | if (!uses_template_parms (parm)) |
b7484fbe | 9131 | { |
03e70705 JM |
9132 | tree type; |
9133 | ||
2f939d94 | 9134 | if (!TYPE_P (arg)) |
03e70705 JM |
9135 | type = TREE_TYPE (arg); |
9136 | else | |
c353b8e3 | 9137 | type = arg; |
03e70705 | 9138 | |
62e4a758 | 9139 | if (strict == DEDUCE_EXACT || strict == DEDUCE_ORDER) |
03e70705 | 9140 | { |
3bfdc719 | 9141 | if (same_type_p (parm, type)) |
03e70705 JM |
9142 | continue; |
9143 | } | |
03e70705 | 9144 | else |
343c89cd JM |
9145 | /* It might work; we shouldn't check now, because we might |
9146 | get into infinite recursion. Overload resolution will | |
9147 | handle it. */ | |
9148 | continue; | |
03e70705 | 9149 | |
b7484fbe MS |
9150 | return 1; |
9151 | } | |
9152 | ||
2f939d94 | 9153 | if (!TYPE_P (arg)) |
8d08fdba MS |
9154 | { |
9155 | my_friendly_assert (TREE_TYPE (arg) != NULL_TREE, 293); | |
34016c81 | 9156 | if (type_unknown_p (arg)) |
28cbf42c | 9157 | { |
34016c81 JM |
9158 | /* [temp.deduct.type] A template-argument can be deduced from |
9159 | a pointer to function or pointer to member function | |
9160 | argument if the set of overloaded functions does not | |
9161 | contain function templates and at most one of a set of | |
9162 | overloaded functions provides a unique match. */ | |
9163 | ||
9164 | if (resolve_overloaded_unification | |
4393e105 | 9165 | (tparms, targs, parm, arg, strict, sub_strict) |
34016c81 JM |
9166 | != 0) |
9167 | return 1; | |
9168 | continue; | |
28cbf42c | 9169 | } |
8d08fdba | 9170 | arg = TREE_TYPE (arg); |
08476342 NS |
9171 | if (arg == error_mark_node) |
9172 | return 1; | |
8d08fdba | 9173 | } |
62e4a758 NS |
9174 | |
9175 | { | |
9176 | int arg_strict = sub_strict; | |
9177 | ||
9178 | if (!subr) | |
9179 | arg_strict |= maybe_adjust_types_for_deduction (strict, &parm, &arg); | |
4393e105 | 9180 | |
62e4a758 NS |
9181 | if (unify (tparms, targs, parm, arg, arg_strict)) |
9182 | return 1; | |
9183 | } | |
e5214479 JM |
9184 | |
9185 | /* Are we done with the interesting parms? */ | |
9186 | if (--len == 0) | |
bd0d5d4a | 9187 | goto done; |
8d08fdba MS |
9188 | } |
9189 | /* Fail if we've reached the end of the parm list, and more args | |
9190 | are present, and the parm list isn't variadic. */ | |
9191 | if (args && args != void_list_node && parms == void_list_node) | |
9192 | return 1; | |
f4f206f4 | 9193 | /* Fail if parms are left and they don't have default values. */ |
8d08fdba MS |
9194 | if (parms |
9195 | && parms != void_list_node | |
9196 | && TREE_PURPOSE (parms) == NULL_TREE) | |
9197 | return 1; | |
bd0d5d4a JM |
9198 | |
9199 | done: | |
8d08fdba MS |
9200 | if (!subr) |
9201 | for (i = 0; i < ntparms; i++) | |
050367a3 | 9202 | if (TREE_VEC_ELT (targs, i) == NULL_TREE) |
8d08fdba | 9203 | { |
bd0d5d4a JM |
9204 | tree tparm = TREE_VALUE (TREE_VEC_ELT (tparms, i)); |
9205 | ||
9206 | /* If this is an undeduced nontype parameter that depends on | |
9207 | a type parameter, try another pass; its type may have been | |
9208 | deduced from a later argument than the one from which | |
9209 | this parameter can be deduced. */ | |
9210 | if (TREE_CODE (tparm) == PARM_DECL | |
9211 | && uses_template_parms (TREE_TYPE (tparm)) | |
9212 | && !saw_undeduced++) | |
9213 | goto again; | |
9214 | ||
386b8a85 | 9215 | if (!allow_incomplete) |
8251199e | 9216 | error ("incomplete type unification"); |
8d08fdba MS |
9217 | return 2; |
9218 | } | |
9219 | return 0; | |
9220 | } | |
9221 | ||
34016c81 JM |
9222 | /* Subroutine of type_unification_real. Args are like the variables at the |
9223 | call site. ARG is an overloaded function (or template-id); we try | |
9224 | deducing template args from each of the overloads, and if only one | |
9225 | succeeds, we go with that. Modifies TARGS and returns 0 on success. */ | |
9226 | ||
9227 | static int | |
3a978d72 NN |
9228 | resolve_overloaded_unification (tree tparms, |
9229 | tree targs, | |
9230 | tree parm, | |
9231 | tree arg, | |
9232 | unification_kind_t strict, | |
9233 | int sub_strict) | |
34016c81 JM |
9234 | { |
9235 | tree tempargs = copy_node (targs); | |
9236 | int good = 0; | |
f23fb7f5 | 9237 | bool addr_p; |
34016c81 JM |
9238 | |
9239 | if (TREE_CODE (arg) == ADDR_EXPR) | |
f23fb7f5 MM |
9240 | { |
9241 | arg = TREE_OPERAND (arg, 0); | |
9242 | addr_p = true; | |
9243 | } | |
9244 | else | |
9245 | addr_p = false; | |
9f3d9e46 | 9246 | |
d8f8dca1 MM |
9247 | if (TREE_CODE (arg) == COMPONENT_REF) |
9248 | /* Handle `&x' where `x' is some static or non-static member | |
9249 | function name. */ | |
9250 | arg = TREE_OPERAND (arg, 1); | |
9251 | ||
05e0b2f4 JM |
9252 | if (TREE_CODE (arg) == OFFSET_REF) |
9253 | arg = TREE_OPERAND (arg, 1); | |
9254 | ||
9f3d9e46 | 9255 | /* Strip baselink information. */ |
50ad9642 MM |
9256 | if (BASELINK_P (arg)) |
9257 | arg = BASELINK_FUNCTIONS (arg); | |
9f3d9e46 | 9258 | |
34016c81 JM |
9259 | if (TREE_CODE (arg) == TEMPLATE_ID_EXPR) |
9260 | { | |
9261 | /* If we got some explicit template args, we need to plug them into | |
9262 | the affected templates before we try to unify, in case the | |
9263 | explicit args will completely resolve the templates in question. */ | |
9264 | ||
9265 | tree expl_subargs = TREE_OPERAND (arg, 1); | |
9266 | arg = TREE_OPERAND (arg, 0); | |
9267 | ||
9268 | for (; arg; arg = OVL_NEXT (arg)) | |
9269 | { | |
9270 | tree fn = OVL_CURRENT (arg); | |
9271 | tree subargs, elem; | |
9272 | ||
9273 | if (TREE_CODE (fn) != TEMPLATE_DECL) | |
9274 | continue; | |
9275 | ||
17aec3eb RK |
9276 | subargs = get_bindings_overload (fn, DECL_TEMPLATE_RESULT (fn), |
9277 | expl_subargs); | |
34016c81 JM |
9278 | if (subargs) |
9279 | { | |
c2ea3a40 | 9280 | elem = tsubst (TREE_TYPE (fn), subargs, tf_none, NULL_TREE); |
f23fb7f5 MM |
9281 | good += try_one_overload (tparms, targs, tempargs, parm, |
9282 | elem, strict, sub_strict, addr_p); | |
34016c81 JM |
9283 | } |
9284 | } | |
9285 | } | |
db0f613d KL |
9286 | else if (TREE_CODE (arg) == OVERLOAD |
9287 | || TREE_CODE (arg) == FUNCTION_DECL) | |
34016c81 JM |
9288 | { |
9289 | for (; arg; arg = OVL_NEXT (arg)) | |
f23fb7f5 MM |
9290 | good += try_one_overload (tparms, targs, tempargs, parm, |
9291 | TREE_TYPE (OVL_CURRENT (arg)), | |
9292 | strict, sub_strict, addr_p); | |
34016c81 JM |
9293 | } |
9294 | else | |
a98facb0 | 9295 | abort (); |
34016c81 JM |
9296 | |
9297 | /* [temp.deduct.type] A template-argument can be deduced from a pointer | |
9298 | to function or pointer to member function argument if the set of | |
9299 | overloaded functions does not contain function templates and at most | |
9300 | one of a set of overloaded functions provides a unique match. | |
9301 | ||
9302 | So if we found multiple possibilities, we return success but don't | |
9303 | deduce anything. */ | |
9304 | ||
9305 | if (good == 1) | |
9306 | { | |
9307 | int i = TREE_VEC_LENGTH (targs); | |
9308 | for (; i--; ) | |
9309 | if (TREE_VEC_ELT (tempargs, i)) | |
9310 | TREE_VEC_ELT (targs, i) = TREE_VEC_ELT (tempargs, i); | |
9311 | } | |
9312 | if (good) | |
9313 | return 0; | |
9314 | ||
9315 | return 1; | |
9316 | } | |
9317 | ||
9318 | /* Subroutine of resolve_overloaded_unification; does deduction for a single | |
9319 | overload. Fills TARGS with any deduced arguments, or error_mark_node if | |
9320 | different overloads deduce different arguments for a given parm. | |
f23fb7f5 MM |
9321 | ADDR_P is true if the expression for which deduction is being |
9322 | performed was of the form "& fn" rather than simply "fn". | |
9323 | ||
34016c81 JM |
9324 | Returns 1 on success. */ |
9325 | ||
9326 | static int | |
3a978d72 NN |
9327 | try_one_overload (tree tparms, |
9328 | tree orig_targs, | |
9329 | tree targs, | |
9330 | tree parm, | |
9331 | tree arg, | |
9332 | unification_kind_t strict, | |
f23fb7f5 MM |
9333 | int sub_strict, |
9334 | bool addr_p) | |
34016c81 JM |
9335 | { |
9336 | int nargs; | |
9337 | tree tempargs; | |
9338 | int i; | |
9339 | ||
9340 | /* [temp.deduct.type] A template-argument can be deduced from a pointer | |
9341 | to function or pointer to member function argument if the set of | |
9342 | overloaded functions does not contain function templates and at most | |
9343 | one of a set of overloaded functions provides a unique match. | |
9344 | ||
9345 | So if this is a template, just return success. */ | |
9346 | ||
9347 | if (uses_template_parms (arg)) | |
9348 | return 1; | |
9349 | ||
f23fb7f5 MM |
9350 | if (TREE_CODE (arg) == METHOD_TYPE) |
9351 | arg = build_ptrmemfunc_type (build_pointer_type (arg)); | |
9352 | else if (addr_p) | |
9353 | arg = build_pointer_type (arg); | |
9354 | ||
62e4a758 | 9355 | sub_strict |= maybe_adjust_types_for_deduction (strict, &parm, &arg); |
34016c81 JM |
9356 | |
9357 | /* We don't copy orig_targs for this because if we have already deduced | |
9358 | some template args from previous args, unify would complain when we | |
9359 | try to deduce a template parameter for the same argument, even though | |
9360 | there isn't really a conflict. */ | |
9361 | nargs = TREE_VEC_LENGTH (targs); | |
f31c0a32 | 9362 | tempargs = make_tree_vec (nargs); |
34016c81 | 9363 | |
4393e105 | 9364 | if (unify (tparms, tempargs, parm, arg, sub_strict) != 0) |
34016c81 JM |
9365 | return 0; |
9366 | ||
9367 | /* First make sure we didn't deduce anything that conflicts with | |
e97e5263 | 9368 | explicitly specified args. */ |
34016c81 JM |
9369 | for (i = nargs; i--; ) |
9370 | { | |
9371 | tree elt = TREE_VEC_ELT (tempargs, i); | |
e97e5263 | 9372 | tree oldelt = TREE_VEC_ELT (orig_targs, i); |
34016c81 JM |
9373 | |
9374 | if (elt == NULL_TREE) | |
9375 | continue; | |
9376 | else if (uses_template_parms (elt)) | |
9377 | { | |
9378 | /* Since we're unifying against ourselves, we will fill in template | |
9379 | args used in the function parm list with our own template parms. | |
9380 | Discard them. */ | |
9381 | TREE_VEC_ELT (tempargs, i) = NULL_TREE; | |
9382 | continue; | |
9383 | } | |
9384 | else if (oldelt && ! template_args_equal (oldelt, elt)) | |
9385 | return 0; | |
9386 | } | |
9387 | ||
9388 | for (i = nargs; i--; ) | |
9389 | { | |
9390 | tree elt = TREE_VEC_ELT (tempargs, i); | |
9391 | ||
9392 | if (elt) | |
9393 | TREE_VEC_ELT (targs, i) = elt; | |
9394 | } | |
9395 | ||
9396 | return 1; | |
9397 | } | |
9398 | ||
74601d7c KL |
9399 | /* Verify that nondeduce template argument agrees with the type |
9400 | obtained from argument deduction. Return nonzero if the | |
9401 | verification fails. | |
9402 | ||
9403 | For example: | |
9404 | ||
9405 | struct A { typedef int X; }; | |
9406 | template <class T, class U> struct C {}; | |
9407 | template <class T> struct C<T, typename T::X> {}; | |
9408 | ||
9409 | Then with the instantiation `C<A, int>', we can deduce that | |
9410 | `T' is `A' but unify () does not check whether `typename T::X' | |
9411 | is `int'. This function ensure that they agree. | |
9412 | ||
9413 | TARGS, PARMS are the same as the arguments of unify. | |
9414 | ARGS contains template arguments from all levels. */ | |
9415 | ||
9416 | static int | |
3a978d72 | 9417 | verify_class_unification (tree targs, tree parms, tree args) |
74601d7c | 9418 | { |
e2005c8d KL |
9419 | parms = tsubst (parms, add_outermost_template_args (args, targs), |
9420 | tf_none, NULL_TREE); | |
9421 | if (parms == error_mark_node) | |
74601d7c KL |
9422 | return 1; |
9423 | ||
e2005c8d | 9424 | return !comp_template_args (parms, INNERMOST_TEMPLATE_ARGS (args)); |
74601d7c KL |
9425 | } |
9426 | ||
4393e105 MM |
9427 | /* PARM is a template class (perhaps with unbound template |
9428 | parameters). ARG is a fully instantiated type. If ARG can be | |
9429 | bound to PARM, return ARG, otherwise return NULL_TREE. TPARMS and | |
9430 | TARGS are as for unify. */ | |
fcfb9f96 MM |
9431 | |
9432 | static tree | |
3a978d72 | 9433 | try_class_unification (tree tparms, tree targs, tree parm, tree arg) |
4393e105 | 9434 | { |
4393e105 MM |
9435 | tree copy_of_targs; |
9436 | ||
9437 | if (!CLASSTYPE_TEMPLATE_INFO (arg) | |
68361a03 MM |
9438 | || (most_general_template (CLASSTYPE_TI_TEMPLATE (arg)) |
9439 | != most_general_template (CLASSTYPE_TI_TEMPLATE (parm)))) | |
4393e105 MM |
9440 | return NULL_TREE; |
9441 | ||
9442 | /* We need to make a new template argument vector for the call to | |
9443 | unify. If we used TARGS, we'd clutter it up with the result of | |
9444 | the attempted unification, even if this class didn't work out. | |
9445 | We also don't want to commit ourselves to all the unifications | |
9446 | we've already done, since unification is supposed to be done on | |
9447 | an argument-by-argument basis. In other words, consider the | |
9448 | following pathological case: | |
9449 | ||
9450 | template <int I, int J, int K> | |
9451 | struct S {}; | |
9452 | ||
9453 | template <int I, int J> | |
9454 | struct S<I, J, 2> : public S<I, I, I>, S<J, J, J> {}; | |
9455 | ||
9456 | template <int I, int J, int K> | |
9457 | void f(S<I, J, K>, S<I, I, I>); | |
9458 | ||
9459 | void g() { | |
9460 | S<0, 0, 0> s0; | |
9461 | S<0, 1, 2> s2; | |
9462 | ||
9463 | f(s0, s2); | |
9464 | } | |
9465 | ||
9466 | Now, by the time we consider the unification involving `s2', we | |
9467 | already know that we must have `f<0, 0, 0>'. But, even though | |
0e339752 | 9468 | `S<0, 1, 2>' is derived from `S<0, 0, 0>', the code is invalid |
4393e105 MM |
9469 | because there are two ways to unify base classes of S<0, 1, 2> |
9470 | with S<I, I, I>. If we kept the already deduced knowledge, we | |
9471 | would reject the possibility I=1. */ | |
f31c0a32 | 9472 | copy_of_targs = make_tree_vec (TREE_VEC_LENGTH (targs)); |
4393e105 MM |
9473 | |
9474 | /* If unification failed, we're done. */ | |
74601d7c KL |
9475 | if (unify (tparms, copy_of_targs, CLASSTYPE_TI_ARGS (parm), |
9476 | CLASSTYPE_TI_ARGS (arg), UNIFY_ALLOW_NONE)) | |
4393e105 | 9477 | return NULL_TREE; |
74601d7c KL |
9478 | |
9479 | return arg; | |
4393e105 MM |
9480 | } |
9481 | ||
9482 | /* Subroutine of get_template_base. RVAL, if non-NULL, is a base we | |
dc957d14 | 9483 | have already discovered to be satisfactory. ARG_BINFO is the binfo |
4393e105 MM |
9484 | for the base class of ARG that we are currently examining. */ |
9485 | ||
9486 | static tree | |
3a978d72 NN |
9487 | get_template_base_recursive (tree tparms, |
9488 | tree targs, | |
9489 | tree parm, | |
9490 | tree arg_binfo, | |
9491 | tree rval, | |
9492 | int flags) | |
fcfb9f96 | 9493 | { |
fa743e8c NS |
9494 | tree base_binfo; |
9495 | int i; | |
4393e105 | 9496 | tree arg = BINFO_TYPE (arg_binfo); |
fcfb9f96 | 9497 | |
4393e105 | 9498 | if (!(flags & GTB_IGNORE_TYPE)) |
fcfb9f96 | 9499 | { |
4393e105 MM |
9500 | tree r = try_class_unification (tparms, targs, |
9501 | parm, arg); | |
fcfb9f96 | 9502 | |
4393e105 | 9503 | /* If there is more than one satisfactory baseclass, then: |
fcfb9f96 | 9504 | |
4393e105 MM |
9505 | [temp.deduct.call] |
9506 | ||
9507 | If they yield more than one possible deduced A, the type | |
9508 | deduction fails. | |
9509 | ||
9510 | applies. */ | |
9511 | if (r && rval && !same_type_p (r, rval)) | |
9512 | return error_mark_node; | |
9513 | else if (r) | |
9514 | rval = r; | |
fcfb9f96 MM |
9515 | } |
9516 | ||
fcfb9f96 | 9517 | /* Process base types. */ |
fa743e8c | 9518 | for (i = 0; BINFO_BASE_ITERATE (arg_binfo, i, base_binfo); i++) |
fcfb9f96 | 9519 | { |
4393e105 | 9520 | int this_virtual; |
fcfb9f96 | 9521 | |
4393e105 MM |
9522 | /* Skip this base, if we've already seen it. */ |
9523 | if (BINFO_MARKED (base_binfo)) | |
9524 | continue; | |
9525 | ||
9526 | this_virtual = | |
809e3e7f | 9527 | (flags & GTB_VIA_VIRTUAL) || BINFO_VIRTUAL_P (base_binfo); |
4393e105 MM |
9528 | |
9529 | /* When searching for a non-virtual, we cannot mark virtually | |
9530 | found binfos. */ | |
9531 | if (! this_virtual) | |
dbbf88d1 | 9532 | BINFO_MARKED (base_binfo) = 1; |
4393e105 MM |
9533 | |
9534 | rval = get_template_base_recursive (tparms, targs, | |
9535 | parm, | |
9536 | base_binfo, | |
9537 | rval, | |
9538 | GTB_VIA_VIRTUAL * this_virtual); | |
9539 | ||
9540 | /* If we discovered more than one matching base class, we can | |
9541 | stop now. */ | |
9542 | if (rval == error_mark_node) | |
9543 | return error_mark_node; | |
fcfb9f96 MM |
9544 | } |
9545 | ||
9546 | return rval; | |
9547 | } | |
9548 | ||
4393e105 MM |
9549 | /* Given a template type PARM and a class type ARG, find the unique |
9550 | base type in ARG that is an instance of PARM. We do not examine | |
9551 | ARG itself; only its base-classes. If there is no appropriate base | |
9552 | class, return NULL_TREE. If there is more than one, return | |
9553 | error_mark_node. PARM may be the type of a partial specialization, | |
9554 | as well as a plain template type. Used by unify. */ | |
fcfb9f96 MM |
9555 | |
9556 | static tree | |
3a978d72 | 9557 | get_template_base (tree tparms, tree targs, tree parm, tree arg) |
fcfb9f96 | 9558 | { |
4393e105 MM |
9559 | tree rval; |
9560 | tree arg_binfo; | |
fcfb9f96 | 9561 | |
4393e105 MM |
9562 | my_friendly_assert (IS_AGGR_TYPE_CODE (TREE_CODE (arg)), 92); |
9563 | ||
9564 | arg_binfo = TYPE_BINFO (complete_type (arg)); | |
42611590 NS |
9565 | if (!arg_binfo) |
9566 | /* The type could not be completed. */ | |
9567 | return NULL_TREE; | |
9568 | ||
4393e105 MM |
9569 | rval = get_template_base_recursive (tparms, targs, |
9570 | parm, arg_binfo, | |
9571 | NULL_TREE, | |
9572 | GTB_IGNORE_TYPE); | |
fcfb9f96 | 9573 | |
4393e105 MM |
9574 | /* Since get_template_base_recursive marks the bases classes, we |
9575 | must unmark them here. */ | |
d6479fe7 | 9576 | dfs_walk (arg_binfo, dfs_unmark, markedp, 0); |
fcfb9f96 MM |
9577 | |
9578 | return rval; | |
9579 | } | |
9580 | ||
db2767b6 MM |
9581 | /* Returns the level of DECL, which declares a template parameter. */ |
9582 | ||
e9659ab0 | 9583 | static int |
3a978d72 | 9584 | template_decl_level (tree decl) |
db2767b6 MM |
9585 | { |
9586 | switch (TREE_CODE (decl)) | |
9587 | { | |
9588 | case TYPE_DECL: | |
9589 | case TEMPLATE_DECL: | |
9590 | return TEMPLATE_TYPE_LEVEL (TREE_TYPE (decl)); | |
9591 | ||
9592 | case PARM_DECL: | |
9593 | return TEMPLATE_PARM_LEVEL (DECL_INITIAL (decl)); | |
9594 | ||
9595 | default: | |
a98facb0 | 9596 | abort (); |
5ffe581d | 9597 | return 0; |
db2767b6 MM |
9598 | } |
9599 | } | |
9600 | ||
830bfa74 MM |
9601 | /* Decide whether ARG can be unified with PARM, considering only the |
9602 | cv-qualifiers of each type, given STRICT as documented for unify. | |
324f9dfb | 9603 | Returns nonzero iff the unification is OK on that basis. */ |
e92cc029 | 9604 | |
e9659ab0 | 9605 | static int |
3a978d72 | 9606 | check_cv_quals_for_unify (int strict, tree arg, tree parm) |
830bfa74 | 9607 | { |
4f2b0fb2 NS |
9608 | int arg_quals = cp_type_quals (arg); |
9609 | int parm_quals = cp_type_quals (parm); | |
9610 | ||
355f774d NS |
9611 | if (TREE_CODE (parm) == TEMPLATE_TYPE_PARM |
9612 | && !(strict & UNIFY_ALLOW_OUTER_MORE_CV_QUAL)) | |
4f2b0fb2 | 9613 | { |
2e9ceb77 NS |
9614 | /* Although a CVR qualifier is ignored when being applied to a |
9615 | substituted template parameter ([8.3.2]/1 for example), that | |
9616 | does not apply during deduction [14.8.2.4]/1, (even though | |
9617 | that is not explicitly mentioned, [14.8.2.4]/9 indicates | |
355f774d NS |
9618 | this). Except when we're allowing additional CV qualifiers |
9619 | at the outer level [14.8.2.1]/3,1st bullet. */ | |
2e9ceb77 NS |
9620 | if ((TREE_CODE (arg) == REFERENCE_TYPE |
9621 | || TREE_CODE (arg) == FUNCTION_TYPE | |
9622 | || TREE_CODE (arg) == METHOD_TYPE) | |
9623 | && (parm_quals & (TYPE_QUAL_CONST | TYPE_QUAL_VOLATILE))) | |
9624 | return 0; | |
9625 | ||
9626 | if ((!POINTER_TYPE_P (arg) && TREE_CODE (arg) != TEMPLATE_TYPE_PARM) | |
9627 | && (parm_quals & TYPE_QUAL_RESTRICT)) | |
9628 | return 0; | |
4f2b0fb2 | 9629 | } |
2e9ceb77 | 9630 | |
62e4a758 | 9631 | if (!(strict & (UNIFY_ALLOW_MORE_CV_QUAL | UNIFY_ALLOW_OUTER_MORE_CV_QUAL)) |
4f2b0fb2 | 9632 | && (arg_quals & parm_quals) != parm_quals) |
ef637255 MM |
9633 | return 0; |
9634 | ||
62e4a758 | 9635 | if (!(strict & (UNIFY_ALLOW_LESS_CV_QUAL | UNIFY_ALLOW_OUTER_LESS_CV_QUAL)) |
4f2b0fb2 | 9636 | && (parm_quals & arg_quals) != arg_quals) |
ef637255 MM |
9637 | return 0; |
9638 | ||
ef637255 | 9639 | return 1; |
830bfa74 MM |
9640 | } |
9641 | ||
9642 | /* Takes parameters as for type_unification. Returns 0 if the | |
dc957d14 | 9643 | type deduction succeeds, 1 otherwise. The parameter STRICT is a |
830bfa74 MM |
9644 | bitwise or of the following flags: |
9645 | ||
9646 | UNIFY_ALLOW_NONE: | |
9647 | Require an exact match between PARM and ARG. | |
9648 | UNIFY_ALLOW_MORE_CV_QUAL: | |
028d1f20 NS |
9649 | Allow the deduced ARG to be more cv-qualified (by qualification |
9650 | conversion) than ARG. | |
830bfa74 MM |
9651 | UNIFY_ALLOW_LESS_CV_QUAL: |
9652 | Allow the deduced ARG to be less cv-qualified than ARG. | |
9653 | UNIFY_ALLOW_DERIVED: | |
9654 | Allow the deduced ARG to be a template base class of ARG, | |
9655 | or a pointer to a template base class of the type pointed to by | |
161c12b0 JM |
9656 | ARG. |
9657 | UNIFY_ALLOW_INTEGER: | |
9658 | Allow any integral type to be deduced. See the TEMPLATE_PARM_INDEX | |
028d1f20 NS |
9659 | case for more information. |
9660 | UNIFY_ALLOW_OUTER_LEVEL: | |
9661 | This is the outermost level of a deduction. Used to determine validity | |
9662 | of qualification conversions. A valid qualification conversion must | |
9663 | have const qualified pointers leading up to the inner type which | |
9664 | requires additional CV quals, except at the outer level, where const | |
9665 | is not required [conv.qual]. It would be normal to set this flag in | |
62e4a758 NS |
9666 | addition to setting UNIFY_ALLOW_MORE_CV_QUAL. |
9667 | UNIFY_ALLOW_OUTER_MORE_CV_QUAL: | |
9668 | This is the outermost level of a deduction, and PARM can be more CV | |
9669 | qualified at this point. | |
9670 | UNIFY_ALLOW_OUTER_LESS_CV_QUAL: | |
9671 | This is the outermost level of a deduction, and PARM can be less CV | |
8baddbf1 | 9672 | qualified at this point. */ |
830bfa74 | 9673 | |
e9659ab0 | 9674 | static int |
3a978d72 | 9675 | unify (tree tparms, tree targs, tree parm, tree arg, int strict) |
8d08fdba MS |
9676 | { |
9677 | int idx; | |
050367a3 | 9678 | tree targ; |
db2767b6 | 9679 | tree tparm; |
028d1f20 | 9680 | int strict_in = strict; |
8d08fdba MS |
9681 | |
9682 | /* I don't think this will do the right thing with respect to types. | |
9683 | But the only case I've seen it in so far has been array bounds, where | |
9684 | signedness is the only information lost, and I think that will be | |
9685 | okay. */ | |
9686 | while (TREE_CODE (parm) == NOP_EXPR) | |
9687 | parm = TREE_OPERAND (parm, 0); | |
9688 | ||
9689 | if (arg == error_mark_node) | |
9690 | return 1; | |
9691 | if (arg == unknown_type_node) | |
34016c81 JM |
9692 | /* We can't deduce anything from this, but we might get all the |
9693 | template args from other function args. */ | |
9694 | return 0; | |
9695 | ||
db2767b6 | 9696 | /* If PARM uses template parameters, then we can't bail out here, |
6bdb985f | 9697 | even if ARG == PARM, since we won't record unifications for the |
db2767b6 MM |
9698 | template parameters. We might need them if we're trying to |
9699 | figure out which of two things is more specialized. */ | |
9700 | if (arg == parm && !uses_template_parms (parm)) | |
8d08fdba MS |
9701 | return 0; |
9702 | ||
830bfa74 MM |
9703 | /* Immediately reject some pairs that won't unify because of |
9704 | cv-qualification mismatches. */ | |
9705 | if (TREE_CODE (arg) == TREE_CODE (parm) | |
2f939d94 | 9706 | && TYPE_P (arg) |
d0ab7624 NS |
9707 | /* It is the elements of the array which hold the cv quals of an array |
9708 | type, and the elements might be template type parms. We'll check | |
9709 | when we recurse. */ | |
9710 | && TREE_CODE (arg) != ARRAY_TYPE | |
830bfa74 MM |
9711 | /* We check the cv-qualifiers when unifying with template type |
9712 | parameters below. We want to allow ARG `const T' to unify with | |
9713 | PARM `T' for example, when computing which of two templates | |
9714 | is more specialized, for example. */ | |
9715 | && TREE_CODE (arg) != TEMPLATE_TYPE_PARM | |
028d1f20 | 9716 | && !check_cv_quals_for_unify (strict_in, arg, parm)) |
49432171 JM |
9717 | return 1; |
9718 | ||
028d1f20 | 9719 | if (!(strict & UNIFY_ALLOW_OUTER_LEVEL) |
3ea099f1 | 9720 | && TYPE_P (parm) && !CP_TYPE_CONST_P (parm)) |
028d1f20 NS |
9721 | strict &= ~UNIFY_ALLOW_MORE_CV_QUAL; |
9722 | strict &= ~UNIFY_ALLOW_OUTER_LEVEL; | |
9723 | strict &= ~UNIFY_ALLOW_DERIVED; | |
62e4a758 NS |
9724 | strict &= ~UNIFY_ALLOW_OUTER_MORE_CV_QUAL; |
9725 | strict &= ~UNIFY_ALLOW_OUTER_LESS_CV_QUAL; | |
028d1f20 | 9726 | |
8d08fdba MS |
9727 | switch (TREE_CODE (parm)) |
9728 | { | |
2ca340ae | 9729 | case TYPENAME_TYPE: |
fccef71e | 9730 | case SCOPE_REF: |
b8c6534b | 9731 | case UNBOUND_CLASS_TEMPLATE: |
2ca340ae JM |
9732 | /* In a type which contains a nested-name-specifier, template |
9733 | argument values cannot be deduced for template parameters used | |
9734 | within the nested-name-specifier. */ | |
9735 | return 0; | |
9736 | ||
8d08fdba | 9737 | case TEMPLATE_TYPE_PARM: |
73b0fce8 | 9738 | case TEMPLATE_TEMPLATE_PARM: |
a1281f45 | 9739 | case BOUND_TEMPLATE_TEMPLATE_PARM: |
db2767b6 MM |
9740 | tparm = TREE_VALUE (TREE_VEC_ELT (tparms, 0)); |
9741 | ||
9742 | if (TEMPLATE_TYPE_LEVEL (parm) | |
9743 | != template_decl_level (tparm)) | |
9744 | /* The PARM is not one we're trying to unify. Just check | |
9745 | to see if it matches ARG. */ | |
9746 | return (TREE_CODE (arg) == TREE_CODE (parm) | |
3bfdc719 | 9747 | && same_type_p (parm, arg)) ? 0 : 1; |
73b0fce8 | 9748 | idx = TEMPLATE_TYPE_IDX (parm); |
050367a3 | 9749 | targ = TREE_VEC_ELT (targs, idx); |
db2767b6 | 9750 | tparm = TREE_VALUE (TREE_VEC_ELT (tparms, idx)); |
050367a3 | 9751 | |
73b0fce8 | 9752 | /* Check for mixed types and values. */ |
db2767b6 MM |
9753 | if ((TREE_CODE (parm) == TEMPLATE_TYPE_PARM |
9754 | && TREE_CODE (tparm) != TYPE_DECL) | |
9755 | || (TREE_CODE (parm) == TEMPLATE_TEMPLATE_PARM | |
9756 | && TREE_CODE (tparm) != TEMPLATE_DECL)) | |
73b0fce8 KL |
9757 | return 1; |
9758 | ||
a1281f45 | 9759 | if (TREE_CODE (parm) == BOUND_TEMPLATE_TEMPLATE_PARM) |
73b0fce8 | 9760 | { |
b429fdf0 KL |
9761 | /* ARG must be constructed from a template class or a template |
9762 | template parameter. */ | |
9763 | if (TREE_CODE (arg) != BOUND_TEMPLATE_TEMPLATE_PARM | |
9764 | && (TREE_CODE (arg) != RECORD_TYPE || !CLASSTYPE_TEMPLATE_INFO (arg))) | |
a1281f45 | 9765 | return 1; |
73b0fce8 | 9766 | |
a1281f45 KL |
9767 | { |
9768 | tree parmtmpl = TYPE_TI_TEMPLATE (parm); | |
9769 | tree parmvec = TYPE_TI_ARGS (parm); | |
6df91b00 | 9770 | tree argvec = INNERMOST_TEMPLATE_ARGS (TYPE_TI_ARGS (arg)); |
a1281f45 | 9771 | tree argtmplvec |
b429fdf0 | 9772 | = DECL_INNERMOST_TEMPLATE_PARMS (TYPE_TI_TEMPLATE (arg)); |
a1281f45 | 9773 | int i; |
73b0fce8 | 9774 | |
a1281f45 KL |
9775 | /* The parameter and argument roles have to be switched here |
9776 | in order to handle default arguments properly. For example, | |
9777 | template<template <class> class TT> void f(TT<int>) | |
9778 | should be able to accept vector<int> which comes from | |
9779 | template <class T, class Allocator = allocator> | |
9780 | class vector. */ | |
9781 | ||
ee3071ef NS |
9782 | if (coerce_template_parms (argtmplvec, parmvec, parmtmpl, 0, 1) |
9783 | == error_mark_node) | |
a1281f45 | 9784 | return 1; |
73b0fce8 | 9785 | |
a1281f45 KL |
9786 | /* Deduce arguments T, i from TT<T> or TT<i>. |
9787 | We check each element of PARMVEC and ARGVEC individually | |
9788 | rather than the whole TREE_VEC since they can have | |
9789 | different number of elements. */ | |
6b9b6b15 | 9790 | |
a1281f45 KL |
9791 | for (i = 0; i < TREE_VEC_LENGTH (parmvec); ++i) |
9792 | { | |
6df91b00 KL |
9793 | if (unify (tparms, targs, |
9794 | TREE_VEC_ELT (parmvec, i), | |
a1281f45 KL |
9795 | TREE_VEC_ELT (argvec, i), |
9796 | UNIFY_ALLOW_NONE)) | |
9797 | return 1; | |
73b0fce8 | 9798 | } |
a1281f45 | 9799 | } |
b429fdf0 | 9800 | arg = TYPE_TI_TEMPLATE (arg); |
a1281f45 KL |
9801 | |
9802 | /* Fall through to deduce template name. */ | |
9803 | } | |
9804 | ||
9805 | if (TREE_CODE (parm) == TEMPLATE_TEMPLATE_PARM | |
9806 | || TREE_CODE (parm) == BOUND_TEMPLATE_TEMPLATE_PARM) | |
9807 | { | |
9808 | /* Deduce template name TT from TT, TT<>, TT<T> and TT<i>. */ | |
9809 | ||
9810 | /* Simple cases: Value already set, does match or doesn't. */ | |
9811 | if (targ != NULL_TREE && template_args_equal (targ, arg)) | |
9812 | return 0; | |
9813 | else if (targ) | |
9814 | return 1; | |
db2767b6 MM |
9815 | } |
9816 | else | |
9817 | { | |
830bfa74 MM |
9818 | /* If PARM is `const T' and ARG is only `int', we don't have |
9819 | a match unless we are allowing additional qualification. | |
9820 | If ARG is `const int' and PARM is just `T' that's OK; | |
9821 | that binds `const int' to `T'. */ | |
028d1f20 | 9822 | if (!check_cv_quals_for_unify (strict_in | UNIFY_ALLOW_LESS_CV_QUAL, |
830bfa74 | 9823 | arg, parm)) |
db2767b6 MM |
9824 | return 1; |
9825 | ||
830bfa74 MM |
9826 | /* Consider the case where ARG is `const volatile int' and |
9827 | PARM is `const T'. Then, T should be `volatile int'. */ | |
c2ea3a40 NS |
9828 | arg = cp_build_qualified_type_real |
9829 | (arg, cp_type_quals (arg) & ~cp_type_quals (parm), tf_none); | |
adecb3f4 MM |
9830 | if (arg == error_mark_node) |
9831 | return 1; | |
73b0fce8 | 9832 | |
a1281f45 KL |
9833 | /* Simple cases: Value already set, does match or doesn't. */ |
9834 | if (targ != NULL_TREE && same_type_p (targ, arg)) | |
9835 | return 0; | |
9836 | else if (targ) | |
9837 | return 1; | |
61cd552e | 9838 | |
94fc547c MM |
9839 | /* Make sure that ARG is not a variable-sized array. (Note |
9840 | that were talking about variable-sized arrays (like | |
9841 | `int[n]'), rather than arrays of unknown size (like | |
9842 | `int[]').) We'll get very confused by such a type since | |
9843 | the bound of the array will not be computable in an | |
9844 | instantiation. Besides, such types are not allowed in | |
9845 | ISO C++, so we can do as we please here. */ | |
5377d5ba | 9846 | if (variably_modified_type_p (arg, NULL_TREE)) |
94fc547c MM |
9847 | return 1; |
9848 | } | |
61cd552e | 9849 | |
050367a3 | 9850 | TREE_VEC_ELT (targs, idx) = arg; |
73b0fce8 KL |
9851 | return 0; |
9852 | ||
f84b4be9 | 9853 | case TEMPLATE_PARM_INDEX: |
db2767b6 MM |
9854 | tparm = TREE_VALUE (TREE_VEC_ELT (tparms, 0)); |
9855 | ||
9856 | if (TEMPLATE_PARM_LEVEL (parm) | |
9857 | != template_decl_level (tparm)) | |
9858 | /* The PARM is not one we're trying to unify. Just check | |
9859 | to see if it matches ARG. */ | |
c8a209ca NS |
9860 | return !(TREE_CODE (arg) == TREE_CODE (parm) |
9861 | && cp_tree_equal (parm, arg)); | |
db2767b6 | 9862 | |
f84b4be9 | 9863 | idx = TEMPLATE_PARM_IDX (parm); |
050367a3 | 9864 | targ = TREE_VEC_ELT (targs, idx); |
db2767b6 | 9865 | |
050367a3 | 9866 | if (targ) |
c8a209ca | 9867 | return !cp_tree_equal (targ, arg); |
8d08fdba | 9868 | |
161c12b0 JM |
9869 | /* [temp.deduct.type] If, in the declaration of a function template |
9870 | with a non-type template-parameter, the non-type | |
9871 | template-parameter is used in an expression in the function | |
9872 | parameter-list and, if the corresponding template-argument is | |
9873 | deduced, the template-argument type shall match the type of the | |
9874 | template-parameter exactly, except that a template-argument | |
d7c4edd0 NS |
9875 | deduced from an array bound may be of any integral type. |
9876 | The non-type parameter might use already deduced type parameters. */ | |
bd0d5d4a | 9877 | tparm = tsubst (TREE_TYPE (parm), targs, 0, NULL_TREE); |
e2005c8d KL |
9878 | if (!TREE_TYPE (arg)) |
9879 | /* Template-parameter dependent expression. Just accept it for now. | |
9880 | It will later be processed in convert_template_argument. */ | |
9881 | ; | |
9882 | else if (same_type_p (TREE_TYPE (arg), tparm)) | |
9883 | /* OK */; | |
161c12b0 | 9884 | else if ((strict & UNIFY_ALLOW_INTEGER) |
bd0d5d4a JM |
9885 | && (TREE_CODE (tparm) == INTEGER_TYPE |
9886 | || TREE_CODE (tparm) == BOOLEAN_TYPE)) | |
8baddbf1 MM |
9887 | /* Convert the ARG to the type of PARM; the deduced non-type |
9888 | template argument must exactly match the types of the | |
9889 | corresponding parameter. */ | |
9890 | arg = fold (build_nop (TREE_TYPE (parm), arg)); | |
bd0d5d4a JM |
9891 | else if (uses_template_parms (tparm)) |
9892 | /* We haven't deduced the type of this parameter yet. Try again | |
9893 | later. */ | |
9894 | return 0; | |
161c12b0 JM |
9895 | else |
9896 | return 1; | |
9897 | ||
2a1e9fdd | 9898 | TREE_VEC_ELT (targs, idx) = arg; |
8d08fdba MS |
9899 | return 0; |
9900 | ||
28e8f3a0 GB |
9901 | case PTRMEM_CST: |
9902 | { | |
9903 | /* A pointer-to-member constant can be unified only with | |
9904 | another constant. */ | |
9905 | if (TREE_CODE (arg) != PTRMEM_CST) | |
9906 | return 1; | |
9907 | ||
9908 | /* Just unify the class member. It would be useless (and possibly | |
9909 | wrong, depending on the strict flags) to unify also | |
9910 | PTRMEM_CST_CLASS, because we want to be sure that both parm and | |
9911 | arg refer to the same variable, even if through different | |
9912 | classes. For instance: | |
9913 | ||
9914 | struct A { int x; }; | |
9915 | struct B : A { }; | |
9916 | ||
9917 | Unification of &A::x and &B::x must succeed. */ | |
9918 | return unify (tparms, targs, PTRMEM_CST_MEMBER (parm), | |
9919 | PTRMEM_CST_MEMBER (arg), strict); | |
9920 | } | |
9921 | ||
8d08fdba | 9922 | case POINTER_TYPE: |
830bfa74 | 9923 | { |
830bfa74 MM |
9924 | if (TREE_CODE (arg) != POINTER_TYPE) |
9925 | return 1; | |
9926 | ||
9927 | /* [temp.deduct.call] | |
9928 | ||
9929 | A can be another pointer or pointer to member type that can | |
9930 | be converted to the deduced A via a qualification | |
9931 | conversion (_conv.qual_). | |
9932 | ||
9933 | We pass down STRICT here rather than UNIFY_ALLOW_NONE. | |
9934 | This will allow for additional cv-qualification of the | |
028d1f20 | 9935 | pointed-to types if appropriate. */ |
830bfa74 | 9936 | |
028d1f20 | 9937 | if (TREE_CODE (TREE_TYPE (arg)) == RECORD_TYPE) |
830bfa74 MM |
9938 | /* The derived-to-base conversion only persists through one |
9939 | level of pointers. */ | |
028d1f20 | 9940 | strict |= (strict_in & UNIFY_ALLOW_DERIVED); |
830bfa74 | 9941 | |
a7a64a77 | 9942 | return unify (tparms, targs, TREE_TYPE (parm), |
028d1f20 | 9943 | TREE_TYPE (arg), strict); |
830bfa74 | 9944 | } |
8d08fdba MS |
9945 | |
9946 | case REFERENCE_TYPE: | |
830bfa74 MM |
9947 | if (TREE_CODE (arg) != REFERENCE_TYPE) |
9948 | return 1; | |
9949 | return unify (tparms, targs, TREE_TYPE (parm), TREE_TYPE (arg), | |
028d1f20 | 9950 | strict & UNIFY_ALLOW_MORE_CV_QUAL); |
8d08fdba MS |
9951 | |
9952 | case ARRAY_TYPE: | |
9953 | if (TREE_CODE (arg) != ARRAY_TYPE) | |
9954 | return 1; | |
3042d5be MM |
9955 | if ((TYPE_DOMAIN (parm) == NULL_TREE) |
9956 | != (TYPE_DOMAIN (arg) == NULL_TREE)) | |
9957 | return 1; | |
8baddbf1 MM |
9958 | if (TYPE_DOMAIN (parm) != NULL_TREE) |
9959 | { | |
9960 | tree parm_max; | |
9961 | tree arg_max; | |
9962 | ||
9963 | parm_max = TYPE_MAX_VALUE (TYPE_DOMAIN (parm)); | |
9964 | arg_max = TYPE_MAX_VALUE (TYPE_DOMAIN (arg)); | |
9965 | ||
9966 | /* Our representation of array types uses "N - 1" as the | |
9967 | TYPE_MAX_VALUE for an array with "N" elements, if "N" is | |
9968 | not an integer constant. */ | |
9969 | if (TREE_CODE (parm_max) == MINUS_EXPR) | |
9970 | { | |
9971 | arg_max = fold (build2 (PLUS_EXPR, | |
9972 | integer_type_node, | |
9973 | arg_max, | |
9974 | TREE_OPERAND (parm_max, 1))); | |
9975 | parm_max = TREE_OPERAND (parm_max, 0); | |
9976 | } | |
9977 | ||
9978 | if (unify (tparms, targs, parm_max, arg_max, UNIFY_ALLOW_INTEGER)) | |
9979 | return 1; | |
9980 | } | |
830bfa74 | 9981 | return unify (tparms, targs, TREE_TYPE (parm), TREE_TYPE (arg), |
712467a4 | 9982 | strict & UNIFY_ALLOW_MORE_CV_QUAL); |
8d08fdba MS |
9983 | |
9984 | case REAL_TYPE: | |
37c46b43 | 9985 | case COMPLEX_TYPE: |
c00996a3 | 9986 | case VECTOR_TYPE: |
8d08fdba | 9987 | case INTEGER_TYPE: |
42976354 | 9988 | case BOOLEAN_TYPE: |
5ad5a526 | 9989 | case VOID_TYPE: |
f376e137 MS |
9990 | if (TREE_CODE (arg) != TREE_CODE (parm)) |
9991 | return 1; | |
8baddbf1 | 9992 | |
9edc3913 | 9993 | /* We have already checked cv-qualification at the top of the |
514a1f18 | 9994 | function. */ |
8baddbf1 | 9995 | if (!same_type_ignoring_top_level_qualifiers_p (arg, parm)) |
ca79f85d JM |
9996 | return 1; |
9997 | ||
8d08fdba MS |
9998 | /* As far as unification is concerned, this wins. Later checks |
9999 | will invalidate it if necessary. */ | |
10000 | return 0; | |
10001 | ||
10002 | /* Types INTEGER_CST and MINUS_EXPR can come from array bounds. */ | |
bd6dd845 | 10003 | /* Type INTEGER_CST can come from ordinary constant template args. */ |
8d08fdba | 10004 | case INTEGER_CST: |
bd6dd845 MS |
10005 | while (TREE_CODE (arg) == NOP_EXPR) |
10006 | arg = TREE_OPERAND (arg, 0); | |
10007 | ||
8d08fdba MS |
10008 | if (TREE_CODE (arg) != INTEGER_CST) |
10009 | return 1; | |
10010 | return !tree_int_cst_equal (parm, arg); | |
10011 | ||
8d08fdba MS |
10012 | case TREE_VEC: |
10013 | { | |
10014 | int i; | |
10015 | if (TREE_CODE (arg) != TREE_VEC) | |
10016 | return 1; | |
10017 | if (TREE_VEC_LENGTH (parm) != TREE_VEC_LENGTH (arg)) | |
10018 | return 1; | |
0dc09a61 | 10019 | for (i = 0; i < TREE_VEC_LENGTH (parm); ++i) |
830bfa74 | 10020 | if (unify (tparms, targs, |
8d08fdba | 10021 | TREE_VEC_ELT (parm, i), TREE_VEC_ELT (arg, i), |
4393e105 | 10022 | UNIFY_ALLOW_NONE)) |
8d08fdba MS |
10023 | return 1; |
10024 | return 0; | |
10025 | } | |
10026 | ||
8d08fdba | 10027 | case RECORD_TYPE: |
f181d4ae | 10028 | case UNION_TYPE: |
f181d4ae | 10029 | if (TREE_CODE (arg) != TREE_CODE (parm)) |
a4443a08 | 10030 | return 1; |
830bfa74 | 10031 | |
a7a64a77 MM |
10032 | if (TYPE_PTRMEMFUNC_P (parm)) |
10033 | { | |
10034 | if (!TYPE_PTRMEMFUNC_P (arg)) | |
10035 | return 1; | |
10036 | ||
10037 | return unify (tparms, targs, | |
10038 | TYPE_PTRMEMFUNC_FN_TYPE (parm), | |
10039 | TYPE_PTRMEMFUNC_FN_TYPE (arg), | |
10040 | strict); | |
10041 | } | |
10042 | ||
5db698f6 | 10043 | if (CLASSTYPE_TEMPLATE_INFO (parm)) |
5566b478 | 10044 | { |
6467930b | 10045 | tree t = NULL_TREE; |
4393e105 | 10046 | |
028d1f20 | 10047 | if (strict_in & UNIFY_ALLOW_DERIVED) |
4393e105 MM |
10048 | { |
10049 | /* First, we try to unify the PARM and ARG directly. */ | |
10050 | t = try_class_unification (tparms, targs, | |
10051 | parm, arg); | |
10052 | ||
10053 | if (!t) | |
10054 | { | |
10055 | /* Fallback to the special case allowed in | |
10056 | [temp.deduct.call]: | |
10057 | ||
10058 | If P is a class, and P has the form | |
10059 | template-id, then A can be a derived class of | |
10060 | the deduced A. Likewise, if P is a pointer to | |
10061 | a class of the form template-id, A can be a | |
10062 | pointer to a derived class pointed to by the | |
10063 | deduced A. */ | |
10064 | t = get_template_base (tparms, targs, | |
10065 | parm, arg); | |
10066 | ||
10067 | if (! t || t == error_mark_node) | |
10068 | return 1; | |
10069 | } | |
10070 | } | |
6df47b06 | 10071 | else if (CLASSTYPE_TEMPLATE_INFO (arg) |
9fbf56f7 MM |
10072 | && (CLASSTYPE_TI_TEMPLATE (parm) |
10073 | == CLASSTYPE_TI_TEMPLATE (arg))) | |
6df47b06 MM |
10074 | /* Perhaps PARM is something like S<U> and ARG is S<int>. |
10075 | Then, we should unify `int' and `U'. */ | |
6467930b | 10076 | t = arg; |
4393e105 | 10077 | else |
dc957d14 | 10078 | /* There's no chance of unification succeeding. */ |
5566b478 | 10079 | return 1; |
6467930b | 10080 | |
830bfa74 | 10081 | return unify (tparms, targs, CLASSTYPE_TI_ARGS (parm), |
4393e105 | 10082 | CLASSTYPE_TI_ARGS (t), UNIFY_ALLOW_NONE); |
5566b478 | 10083 | } |
9edc3913 | 10084 | else if (!same_type_ignoring_top_level_qualifiers_p (parm, arg)) |
5566b478 | 10085 | return 1; |
a4443a08 | 10086 | return 0; |
8d08fdba MS |
10087 | |
10088 | case METHOD_TYPE: | |
8d08fdba | 10089 | case FUNCTION_TYPE: |
830bfa74 | 10090 | if (TREE_CODE (arg) != TREE_CODE (parm)) |
8d08fdba | 10091 | return 1; |
830bfa74 MM |
10092 | |
10093 | if (unify (tparms, targs, TREE_TYPE (parm), | |
4393e105 | 10094 | TREE_TYPE (arg), UNIFY_ALLOW_NONE)) |
28cbf42c | 10095 | return 1; |
386b8a85 | 10096 | return type_unification_real (tparms, targs, TYPE_ARG_TYPES (parm), |
3b3ba9f0 | 10097 | TYPE_ARG_TYPES (arg), 1, |
e5214479 | 10098 | DEDUCE_EXACT, 0, -1); |
a4443a08 MS |
10099 | |
10100 | case OFFSET_TYPE: | |
10101 | if (TREE_CODE (arg) != OFFSET_TYPE) | |
10102 | return 1; | |
830bfa74 | 10103 | if (unify (tparms, targs, TYPE_OFFSET_BASETYPE (parm), |
4393e105 | 10104 | TYPE_OFFSET_BASETYPE (arg), UNIFY_ALLOW_NONE)) |
a4443a08 | 10105 | return 1; |
830bfa74 | 10106 | return unify (tparms, targs, TREE_TYPE (parm), TREE_TYPE (arg), |
4393e105 | 10107 | strict); |
a4443a08 | 10108 | |
f62dbf03 | 10109 | case CONST_DECL: |
a723baf1 MM |
10110 | if (DECL_TEMPLATE_PARM_P (parm)) |
10111 | return unify (tparms, targs, DECL_INITIAL (parm), arg, strict); | |
830bfa74 | 10112 | if (arg != decl_constant_value (parm)) |
f62dbf03 JM |
10113 | return 1; |
10114 | return 0; | |
10115 | ||
28e8f3a0 | 10116 | case FIELD_DECL: |
027905b4 KL |
10117 | case TEMPLATE_DECL: |
10118 | /* Matched cases are handled by the ARG == PARM test above. */ | |
10119 | return 1; | |
10120 | ||
8d08fdba | 10121 | default: |
050367a3 | 10122 | if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (TREE_CODE (parm)))) |
74601d7c KL |
10123 | { |
10124 | ||
10125 | /* We're looking at an expression. This can happen with | |
10126 | something like: | |
4393e105 | 10127 | |
74601d7c KL |
10128 | template <int I> |
10129 | void foo(S<I>, S<I + 2>); | |
050367a3 | 10130 | |
74601d7c | 10131 | This is a "nondeduced context": |
050367a3 | 10132 | |
74601d7c | 10133 | [deduct.type] |
4393e105 | 10134 | |
74601d7c | 10135 | The nondeduced contexts are: |
050367a3 | 10136 | |
74601d7c KL |
10137 | --A type that is a template-id in which one or more of |
10138 | the template-arguments is an expression that references | |
10139 | a template-parameter. | |
050367a3 | 10140 | |
74601d7c KL |
10141 | In these cases, we assume deduction succeeded, but don't |
10142 | actually infer any unifications. */ | |
10143 | ||
10144 | if (!uses_template_parms (parm) | |
10145 | && !template_args_equal (parm, arg)) | |
10146 | return 1; | |
10147 | else | |
10148 | return 0; | |
10149 | } | |
050367a3 | 10150 | else |
b4c4a9ec MM |
10151 | sorry ("use of `%s' in template type unification", |
10152 | tree_code_name [(int) TREE_CODE (parm)]); | |
050367a3 | 10153 | |
8d08fdba MS |
10154 | return 1; |
10155 | } | |
10156 | } | |
8d08fdba | 10157 | \f |
4684cd27 MM |
10158 | /* Note that DECL can be defined in this translation unit, if |
10159 | required. */ | |
10160 | ||
10161 | static void | |
10162 | mark_definable (tree decl) | |
10163 | { | |
10164 | tree clone; | |
10165 | DECL_NOT_REALLY_EXTERN (decl) = 1; | |
10166 | FOR_EACH_CLONE (clone, decl) | |
10167 | DECL_NOT_REALLY_EXTERN (clone) = 1; | |
10168 | } | |
10169 | ||
03d0f4af | 10170 | /* Called if RESULT is explicitly instantiated, or is a member of an |
4684cd27 | 10171 | explicitly instantiated class. */ |
03d0f4af | 10172 | |
faae18ab | 10173 | void |
3a978d72 | 10174 | mark_decl_instantiated (tree result, int extern_p) |
faae18ab | 10175 | { |
415c974c | 10176 | SET_DECL_EXPLICIT_INSTANTIATION (result); |
3ae18eaf | 10177 | |
1f6f0cb6 MM |
10178 | /* If this entity has already been written out, it's too late to |
10179 | make any modifications. */ | |
10180 | if (TREE_ASM_WRITTEN (result)) | |
10181 | return; | |
10182 | ||
10183 | if (TREE_CODE (result) != FUNCTION_DECL) | |
10184 | /* The TREE_PUBLIC flag for function declarations will have been | |
10185 | set correctly by tsubst. */ | |
10186 | TREE_PUBLIC (result) = 1; | |
10187 | ||
346eeb15 JM |
10188 | /* This might have been set by an earlier implicit instantiation. */ |
10189 | DECL_COMDAT (result) = 0; | |
10190 | ||
4684cd27 MM |
10191 | if (extern_p) |
10192 | DECL_NOT_REALLY_EXTERN (result) = 0; | |
10193 | else | |
faae18ab | 10194 | { |
4684cd27 | 10195 | mark_definable (result); |
1a408d07 JM |
10196 | /* Always make artificials weak. */ |
10197 | if (DECL_ARTIFICIAL (result) && flag_weak) | |
10198 | comdat_linkage (result); | |
a7d87521 JM |
10199 | /* For WIN32 we also want to put explicit instantiations in |
10200 | linkonce sections. */ | |
1a408d07 | 10201 | else if (TREE_PUBLIC (result)) |
b385c841 | 10202 | maybe_make_one_only (result); |
faae18ab | 10203 | } |
4684cd27 MM |
10204 | |
10205 | /* If EXTERN_P, then this function will not be emitted -- unless | |
10206 | followed by an explicit instantiation, at which point its linkage | |
10207 | will be adjusted. If !EXTERN_P, then this function will be | |
10208 | emitted here. In neither circumstance do we want | |
10209 | import_export_decl to adjust the linkage. */ | |
10210 | DECL_INTERFACE_KNOWN (result) = 1; | |
faae18ab MS |
10211 | } |
10212 | ||
e5214479 | 10213 | /* Given two function templates PAT1 and PAT2, return: |
6467930b | 10214 | |
62e4a758 NS |
10215 | DEDUCE should be DEDUCE_EXACT or DEDUCE_ORDER. |
10216 | ||
6467930b MS |
10217 | 1 if PAT1 is more specialized than PAT2 as described in [temp.func.order]. |
10218 | -1 if PAT2 is more specialized than PAT1. | |
e5214479 JM |
10219 | 0 if neither is more specialized. |
10220 | ||
10221 | LEN is passed through to fn_type_unification. */ | |
6467930b MS |
10222 | |
10223 | int | |
3a978d72 | 10224 | more_specialized (tree pat1, tree pat2, int deduce, int len) |
6467930b | 10225 | { |
98c1c668 | 10226 | tree targs; |
73aad9b9 | 10227 | int winner = 0; |
6467930b | 10228 | |
35c18a20 MM |
10229 | /* If template argument deduction succeeds, we substitute the |
10230 | resulting arguments into non-deduced contexts. While doing that, | |
10231 | we must be aware that we may encounter dependent types. */ | |
10232 | ++processing_template_decl; | |
62e4a758 NS |
10233 | targs = get_bindings_real (pat1, DECL_TEMPLATE_RESULT (pat2), |
10234 | NULL_TREE, 0, deduce, len); | |
73aad9b9 | 10235 | if (targs) |
36a117a5 | 10236 | --winner; |
6467930b | 10237 | |
62e4a758 NS |
10238 | targs = get_bindings_real (pat2, DECL_TEMPLATE_RESULT (pat1), |
10239 | NULL_TREE, 0, deduce, len); | |
73aad9b9 | 10240 | if (targs) |
36a117a5 | 10241 | ++winner; |
35c18a20 | 10242 | --processing_template_decl; |
6467930b | 10243 | |
73aad9b9 JM |
10244 | return winner; |
10245 | } | |
6467930b | 10246 | |
73aad9b9 | 10247 | /* Given two class template specialization list nodes PAT1 and PAT2, return: |
6467930b | 10248 | |
73aad9b9 JM |
10249 | 1 if PAT1 is more specialized than PAT2 as described in [temp.class.order]. |
10250 | -1 if PAT2 is more specialized than PAT1. | |
55ece1b3 KL |
10251 | 0 if neither is more specialized. |
10252 | ||
10253 | FULL_ARGS is the full set of template arguments that triggers this | |
10254 | partial ordering. */ | |
73aad9b9 JM |
10255 | |
10256 | int | |
55ece1b3 | 10257 | more_specialized_class (tree pat1, tree pat2, tree full_args) |
73aad9b9 JM |
10258 | { |
10259 | tree targs; | |
10260 | int winner = 0; | |
10261 | ||
baa49730 GB |
10262 | /* Just like what happens for functions, if we are ordering between |
10263 | different class template specializations, we may encounter dependent | |
10264 | types in the arguments, and we need our dependency check functions | |
10265 | to behave correctly. */ | |
10266 | ++processing_template_decl; | |
36a117a5 | 10267 | targs = get_class_bindings (TREE_VALUE (pat1), TREE_PURPOSE (pat1), |
55ece1b3 | 10268 | add_outermost_template_args (full_args, TREE_PURPOSE (pat2))); |
73aad9b9 JM |
10269 | if (targs) |
10270 | --winner; | |
10271 | ||
36a117a5 | 10272 | targs = get_class_bindings (TREE_VALUE (pat2), TREE_PURPOSE (pat2), |
55ece1b3 | 10273 | add_outermost_template_args (full_args, TREE_PURPOSE (pat1))); |
73aad9b9 | 10274 | if (targs) |
6467930b | 10275 | ++winner; |
baa49730 | 10276 | --processing_template_decl; |
6467930b MS |
10277 | |
10278 | return winner; | |
10279 | } | |
73aad9b9 JM |
10280 | |
10281 | /* Return the template arguments that will produce the function signature | |
e1467ff2 | 10282 | DECL from the function template FN, with the explicit template |
76b9a14d | 10283 | arguments EXPLICIT_ARGS. If CHECK_RETTYPE is 1, the return type must |
4393e105 | 10284 | also match. Return NULL_TREE if no satisfactory arguments could be |
62e4a758 | 10285 | found. DEDUCE and LEN are passed through to fn_type_unification. */ |
e5214479 | 10286 | |
76b9a14d | 10287 | static tree |
3a978d72 NN |
10288 | get_bindings_real (tree fn, |
10289 | tree decl, | |
10290 | tree explicit_args, | |
10291 | int check_rettype, | |
10292 | int deduce, | |
10293 | int len) | |
73aad9b9 | 10294 | { |
98c1c668 | 10295 | int ntparms = DECL_NTPARMS (fn); |
f31c0a32 | 10296 | tree targs = make_tree_vec (ntparms); |
4393e105 | 10297 | tree decl_type; |
03017874 | 10298 | tree decl_arg_types; |
98c1c668 JM |
10299 | int i; |
10300 | ||
4393e105 MM |
10301 | /* Substitute the explicit template arguments into the type of DECL. |
10302 | The call to fn_type_unification will handle substitution into the | |
10303 | FN. */ | |
10304 | decl_type = TREE_TYPE (decl); | |
10305 | if (explicit_args && uses_template_parms (decl_type)) | |
10306 | { | |
10307 | tree tmpl; | |
10308 | tree converted_args; | |
10309 | ||
10310 | if (DECL_TEMPLATE_INFO (decl)) | |
10311 | tmpl = DECL_TI_TEMPLATE (decl); | |
10312 | else | |
0e339752 | 10313 | /* We can get here for some invalid specializations. */ |
4393e105 MM |
10314 | return NULL_TREE; |
10315 | ||
10316 | converted_args | |
10317 | = (coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (tmpl), | |
10318 | explicit_args, NULL_TREE, | |
c2ea3a40 | 10319 | tf_none, /*require_all_arguments=*/0)); |
4393e105 MM |
10320 | if (converted_args == error_mark_node) |
10321 | return NULL_TREE; | |
10322 | ||
c2ea3a40 | 10323 | decl_type = tsubst (decl_type, converted_args, tf_none, NULL_TREE); |
4393e105 MM |
10324 | if (decl_type == error_mark_node) |
10325 | return NULL_TREE; | |
10326 | } | |
10327 | ||
10328 | decl_arg_types = TYPE_ARG_TYPES (decl_type); | |
e5214479 JM |
10329 | /* Never do unification on the 'this' parameter. */ |
10330 | if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl)) | |
03017874 | 10331 | decl_arg_types = TREE_CHAIN (decl_arg_types); |
d7684f2d | 10332 | |
e1467ff2 | 10333 | i = fn_type_unification (fn, explicit_args, targs, |
03017874 | 10334 | decl_arg_types, |
8d3631f8 NS |
10335 | (check_rettype || DECL_CONV_FN_P (fn) |
10336 | ? TREE_TYPE (decl_type) : NULL_TREE), | |
62e4a758 | 10337 | deduce, len); |
98c1c668 | 10338 | |
76b9a14d JM |
10339 | if (i != 0) |
10340 | return NULL_TREE; | |
10341 | ||
76b9a14d JM |
10342 | return targs; |
10343 | } | |
10344 | ||
10345 | /* For most uses, we want to check the return type. */ | |
10346 | ||
eb1dfbb2 | 10347 | static tree |
3a978d72 | 10348 | get_bindings (tree fn, tree decl, tree explicit_args) |
76b9a14d | 10349 | { |
62e4a758 | 10350 | return get_bindings_real (fn, decl, explicit_args, 1, DEDUCE_EXACT, -1); |
76b9a14d JM |
10351 | } |
10352 | ||
e5214479 JM |
10353 | /* But for resolve_overloaded_unification, we only care about the parameter |
10354 | types. */ | |
76b9a14d JM |
10355 | |
10356 | static tree | |
3a978d72 | 10357 | get_bindings_overload (tree fn, tree decl, tree explicit_args) |
76b9a14d | 10358 | { |
62e4a758 | 10359 | return get_bindings_real (fn, decl, explicit_args, 0, DEDUCE_EXACT, -1); |
73aad9b9 JM |
10360 | } |
10361 | ||
36a117a5 MM |
10362 | /* Return the innermost template arguments that, when applied to a |
10363 | template specialization whose innermost template parameters are | |
9471d3e2 | 10364 | TPARMS, and whose specialization arguments are PARMS, yield the |
36a117a5 MM |
10365 | ARGS. |
10366 | ||
10367 | For example, suppose we have: | |
10368 | ||
10369 | template <class T, class U> struct S {}; | |
10370 | template <class T> struct S<T*, int> {}; | |
10371 | ||
10372 | Then, suppose we want to get `S<double*, int>'. The TPARMS will be | |
10373 | {T}, the PARMS will be {T*, int} and the ARGS will be {double*, | |
10374 | int}. The resulting vector will be {double}, indicating that `T' | |
10375 | is bound to `double'. */ | |
10376 | ||
bd6dd845 | 10377 | static tree |
3a978d72 | 10378 | get_class_bindings (tree tparms, tree parms, tree args) |
73aad9b9 | 10379 | { |
3b3ba9f0 | 10380 | int i, ntparms = TREE_VEC_LENGTH (tparms); |
f31c0a32 | 10381 | tree vec = make_tree_vec (ntparms); |
73aad9b9 | 10382 | |
74601d7c KL |
10383 | if (unify (tparms, vec, parms, INNERMOST_TEMPLATE_ARGS (args), |
10384 | UNIFY_ALLOW_NONE)) | |
fcfb9f96 | 10385 | return NULL_TREE; |
73aad9b9 JM |
10386 | |
10387 | for (i = 0; i < ntparms; ++i) | |
10388 | if (! TREE_VEC_ELT (vec, i)) | |
10389 | return NULL_TREE; | |
10390 | ||
74601d7c KL |
10391 | if (verify_class_unification (vec, parms, args)) |
10392 | return NULL_TREE; | |
10393 | ||
73aad9b9 JM |
10394 | return vec; |
10395 | } | |
10396 | ||
104bf76a MM |
10397 | /* In INSTANTIATIONS is a list of <INSTANTIATION, TEMPLATE> pairs. |
10398 | Pick the most specialized template, and return the corresponding | |
10399 | instantiation, or if there is no corresponding instantiation, the | |
e5214479 JM |
10400 | template itself. If there is no most specialized template, |
10401 | error_mark_node is returned. If there are no templates at all, | |
10402 | NULL_TREE is returned. */ | |
73aad9b9 JM |
10403 | |
10404 | tree | |
3a978d72 | 10405 | most_specialized_instantiation (tree instantiations) |
73aad9b9 | 10406 | { |
104bf76a | 10407 | tree fn, champ; |
73aad9b9 JM |
10408 | int fate; |
10409 | ||
104bf76a | 10410 | if (!instantiations) |
73aad9b9 JM |
10411 | return NULL_TREE; |
10412 | ||
104bf76a MM |
10413 | champ = instantiations; |
10414 | for (fn = TREE_CHAIN (instantiations); fn; fn = TREE_CHAIN (fn)) | |
73aad9b9 | 10415 | { |
62e4a758 NS |
10416 | fate = more_specialized (TREE_VALUE (champ), TREE_VALUE (fn), |
10417 | DEDUCE_EXACT, -1); | |
73aad9b9 JM |
10418 | if (fate == 1) |
10419 | ; | |
10420 | else | |
10421 | { | |
10422 | if (fate == 0) | |
10423 | { | |
10424 | fn = TREE_CHAIN (fn); | |
10425 | if (! fn) | |
10426 | return error_mark_node; | |
10427 | } | |
104bf76a | 10428 | champ = fn; |
73aad9b9 JM |
10429 | } |
10430 | } | |
10431 | ||
104bf76a | 10432 | for (fn = instantiations; fn && fn != champ; fn = TREE_CHAIN (fn)) |
73aad9b9 | 10433 | { |
62e4a758 NS |
10434 | fate = more_specialized (TREE_VALUE (champ), TREE_VALUE (fn), |
10435 | DEDUCE_EXACT, -1); | |
73aad9b9 JM |
10436 | if (fate != 1) |
10437 | return error_mark_node; | |
10438 | } | |
10439 | ||
104bf76a MM |
10440 | return TREE_PURPOSE (champ) ? TREE_PURPOSE (champ) : TREE_VALUE (champ); |
10441 | } | |
10442 | ||
10443 | /* Return the most specialized of the list of templates in FNS that can | |
10444 | produce an instantiation matching DECL, given the explicit template | |
10445 | arguments EXPLICIT_ARGS. */ | |
10446 | ||
e9659ab0 | 10447 | static tree |
3a978d72 | 10448 | most_specialized (tree fns, tree decl, tree explicit_args) |
104bf76a MM |
10449 | { |
10450 | tree candidates = NULL_TREE; | |
10451 | tree fn, args; | |
10452 | ||
10453 | for (fn = fns; fn; fn = TREE_CHAIN (fn)) | |
10454 | { | |
10455 | tree candidate = TREE_VALUE (fn); | |
10456 | ||
10457 | args = get_bindings (candidate, decl, explicit_args); | |
10458 | if (args) | |
e1b3e07d | 10459 | candidates = tree_cons (NULL_TREE, candidate, candidates); |
104bf76a MM |
10460 | } |
10461 | ||
e5214479 | 10462 | return most_specialized_instantiation (candidates); |
73aad9b9 JM |
10463 | } |
10464 | ||
36a117a5 | 10465 | /* If DECL is a specialization of some template, return the most |
f9a7ae04 MM |
10466 | general such template. Otherwise, returns NULL_TREE. |
10467 | ||
10468 | For example, given: | |
36a117a5 MM |
10469 | |
10470 | template <class T> struct S { template <class U> void f(U); }; | |
10471 | ||
10472 | if TMPL is `template <class U> void S<int>::f(U)' this will return | |
10473 | the full template. This function will not trace past partial | |
10474 | specializations, however. For example, given in addition: | |
10475 | ||
10476 | template <class T> struct S<T*> { template <class U> void f(U); }; | |
10477 | ||
10478 | if TMPL is `template <class U> void S<int*>::f(U)' this will return | |
10479 | `template <class T> template <class U> S<T*>::f(U)'. */ | |
73aad9b9 | 10480 | |
612c671a | 10481 | tree |
3a978d72 | 10482 | most_general_template (tree decl) |
73aad9b9 | 10483 | { |
f9a7ae04 MM |
10484 | /* If DECL is a FUNCTION_DECL, find the TEMPLATE_DECL of which it is |
10485 | an immediate specialization. */ | |
10486 | if (TREE_CODE (decl) == FUNCTION_DECL) | |
10487 | { | |
10488 | if (DECL_TEMPLATE_INFO (decl)) { | |
10489 | decl = DECL_TI_TEMPLATE (decl); | |
10490 | ||
10491 | /* The DECL_TI_TEMPLATE can be an IDENTIFIER_NODE for a | |
10492 | template friend. */ | |
10493 | if (TREE_CODE (decl) != TEMPLATE_DECL) | |
10494 | return NULL_TREE; | |
10495 | } else | |
10496 | return NULL_TREE; | |
10497 | } | |
10498 | ||
10499 | /* Look for more and more general templates. */ | |
10500 | while (DECL_TEMPLATE_INFO (decl)) | |
10501 | { | |
10b1d5e7 MM |
10502 | /* The DECL_TI_TEMPLATE can be an IDENTIFIER_NODE in some cases. |
10503 | (See cp-tree.h for details.) */ | |
f9a7ae04 MM |
10504 | if (TREE_CODE (DECL_TI_TEMPLATE (decl)) != TEMPLATE_DECL) |
10505 | break; | |
10506 | ||
6e049fcd KL |
10507 | if (CLASS_TYPE_P (TREE_TYPE (decl)) |
10508 | && CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_TYPE (decl))) | |
10509 | break; | |
10510 | ||
f9a7ae04 MM |
10511 | /* Stop if we run into an explicitly specialized class template. */ |
10512 | if (!DECL_NAMESPACE_SCOPE_P (decl) | |
10513 | && DECL_CONTEXT (decl) | |
10514 | && CLASSTYPE_TEMPLATE_SPECIALIZATION (DECL_CONTEXT (decl))) | |
10515 | break; | |
10516 | ||
10517 | decl = DECL_TI_TEMPLATE (decl); | |
10518 | } | |
36a117a5 MM |
10519 | |
10520 | return decl; | |
10521 | } | |
10522 | ||
10523 | /* Return the most specialized of the class template specializations | |
10524 | of TMPL which can produce an instantiation matching ARGS, or | |
10525 | error_mark_node if the choice is ambiguous. */ | |
10526 | ||
e9659ab0 | 10527 | static tree |
3a978d72 | 10528 | most_specialized_class (tree tmpl, tree args) |
36a117a5 MM |
10529 | { |
10530 | tree list = NULL_TREE; | |
10531 | tree t; | |
10532 | tree champ; | |
73aad9b9 JM |
10533 | int fate; |
10534 | ||
36a117a5 MM |
10535 | tmpl = most_general_template (tmpl); |
10536 | for (t = DECL_TEMPLATE_SPECIALIZATIONS (tmpl); t; t = TREE_CHAIN (t)) | |
73aad9b9 | 10537 | { |
36a117a5 MM |
10538 | tree spec_args |
10539 | = get_class_bindings (TREE_VALUE (t), TREE_PURPOSE (t), args); | |
10540 | if (spec_args) | |
73aad9b9 | 10541 | { |
1f8f4a0b | 10542 | list = tree_cons (TREE_PURPOSE (t), TREE_VALUE (t), list); |
73aad9b9 JM |
10543 | TREE_TYPE (list) = TREE_TYPE (t); |
10544 | } | |
10545 | } | |
10546 | ||
10547 | if (! list) | |
10548 | return NULL_TREE; | |
10549 | ||
10550 | t = list; | |
10551 | champ = t; | |
10552 | t = TREE_CHAIN (t); | |
10553 | for (; t; t = TREE_CHAIN (t)) | |
10554 | { | |
55ece1b3 | 10555 | fate = more_specialized_class (champ, t, args); |
73aad9b9 JM |
10556 | if (fate == 1) |
10557 | ; | |
10558 | else | |
10559 | { | |
10560 | if (fate == 0) | |
10561 | { | |
10562 | t = TREE_CHAIN (t); | |
10563 | if (! t) | |
10564 | return error_mark_node; | |
10565 | } | |
10566 | champ = t; | |
10567 | } | |
10568 | } | |
10569 | ||
10570 | for (t = list; t && t != champ; t = TREE_CHAIN (t)) | |
10571 | { | |
55ece1b3 | 10572 | fate = more_specialized_class (champ, t, args); |
73aad9b9 JM |
10573 | if (fate != 1) |
10574 | return error_mark_node; | |
10575 | } | |
10576 | ||
10577 | return champ; | |
10578 | } | |
10579 | ||
eb8845be | 10580 | /* Explicitly instantiate DECL. */ |
e92cc029 | 10581 | |
8d08fdba | 10582 | void |
eb8845be | 10583 | do_decl_instantiation (tree decl, tree storage) |
8d08fdba | 10584 | { |
8d08fdba | 10585 | tree result = NULL_TREE; |
faae18ab | 10586 | int extern_p = 0; |
e8abc66f | 10587 | |
3fa56191 | 10588 | if (!decl) |
dc957d14 | 10589 | /* An error occurred, for which grokdeclarator has already issued |
3fa56191 MM |
10590 | an appropriate message. */ |
10591 | return; | |
10592 | else if (! DECL_LANG_SPECIFIC (decl)) | |
ec255269 | 10593 | { |
33bd39a2 | 10594 | error ("explicit instantiation of non-template `%#D'", decl); |
ec255269 MS |
10595 | return; |
10596 | } | |
03d0f4af | 10597 | else if (TREE_CODE (decl) == VAR_DECL) |
6633d636 | 10598 | { |
03d0f4af MM |
10599 | /* There is an asymmetry here in the way VAR_DECLs and |
10600 | FUNCTION_DECLs are handled by grokdeclarator. In the case of | |
10601 | the latter, the DECL we get back will be marked as a | |
10602 | template instantiation, and the appropriate | |
10603 | DECL_TEMPLATE_INFO will be set up. This does not happen for | |
10604 | VAR_DECLs so we do the lookup here. Probably, grokdeclarator | |
10605 | should handle VAR_DECLs as it currently handles | |
10606 | FUNCTION_DECLs. */ | |
86ac0575 | 10607 | result = lookup_field (DECL_CONTEXT (decl), DECL_NAME (decl), 0, false); |
e0860732 | 10608 | if (!result || TREE_CODE (result) != VAR_DECL) |
03d0f4af | 10609 | { |
e0860732 | 10610 | error ("no matching template for `%D' found", decl); |
03d0f4af MM |
10611 | return; |
10612 | } | |
6633d636 MS |
10613 | } |
10614 | else if (TREE_CODE (decl) != FUNCTION_DECL) | |
10615 | { | |
33bd39a2 | 10616 | error ("explicit instantiation of `%#D'", decl); |
6633d636 MS |
10617 | return; |
10618 | } | |
03d0f4af MM |
10619 | else |
10620 | result = decl; | |
672476cb | 10621 | |
03d0f4af | 10622 | /* Check for various error cases. Note that if the explicit |
0e339752 | 10623 | instantiation is valid the RESULT will currently be marked as an |
03d0f4af MM |
10624 | *implicit* instantiation; DECL_EXPLICIT_INSTANTIATION is not set |
10625 | until we get here. */ | |
10626 | ||
10627 | if (DECL_TEMPLATE_SPECIALIZATION (result)) | |
672476cb | 10628 | { |
07782718 KL |
10629 | /* DR 259 [temp.spec]. |
10630 | ||
10631 | Both an explicit instantiation and a declaration of an explicit | |
10632 | specialization shall not appear in a program unless the explicit | |
10633 | instantiation follows a declaration of the explicit specialization. | |
03d0f4af | 10634 | |
07782718 KL |
10635 | For a given set of template parameters, if an explicit |
10636 | instantiation of a template appears after a declaration of an | |
10637 | explicit specialization for that template, the explicit | |
10638 | instantiation has no effect. */ | |
672476cb MM |
10639 | return; |
10640 | } | |
03d0f4af MM |
10641 | else if (DECL_EXPLICIT_INSTANTIATION (result)) |
10642 | { | |
10643 | /* [temp.spec] | |
98c1c668 | 10644 | |
03d0f4af MM |
10645 | No program shall explicitly instantiate any template more |
10646 | than once. | |
10647 | ||
4684cd27 MM |
10648 | We check DECL_NOT_REALLY_EXTERN so as not to complain when |
10649 | the first instantiation was `extern' and the second is not, | |
10650 | and EXTERN_P for the opposite case. */ | |
10651 | if (DECL_NOT_REALLY_EXTERN (result) && !extern_p) | |
33bd39a2 | 10652 | pedwarn ("duplicate explicit instantiation of `%#D'", result); |
4684cd27 MM |
10653 | /* If an "extern" explicit instantiation follows an ordinary |
10654 | explicit instantiation, the template is instantiated. */ | |
10655 | if (extern_p) | |
03d0f4af MM |
10656 | return; |
10657 | } | |
10658 | else if (!DECL_IMPLICIT_INSTANTIATION (result)) | |
faae18ab | 10659 | { |
33bd39a2 | 10660 | error ("no matching template for `%D' found", result); |
faae18ab MS |
10661 | return; |
10662 | } | |
03d0f4af | 10663 | else if (!DECL_TEMPLATE_INFO (result)) |
6633d636 | 10664 | { |
33bd39a2 | 10665 | pedwarn ("explicit instantiation of non-template `%#D'", result); |
6633d636 MS |
10666 | return; |
10667 | } | |
10668 | ||
f0e01782 | 10669 | if (storage == NULL_TREE) |
00595019 | 10670 | ; |
faae18ab | 10671 | else if (storage == ridpointers[(int) RID_EXTERN]) |
03d0f4af | 10672 | { |
c02f5e29 | 10673 | if (pedantic && !in_system_header) |
33bd39a2 | 10674 | pedwarn ("ISO C++ forbids the use of `extern' on explicit instantiations"); |
03d0f4af MM |
10675 | extern_p = 1; |
10676 | } | |
f0e01782 | 10677 | else |
33bd39a2 | 10678 | error ("storage class `%D' applied to template instantiation", |
f0e01782 | 10679 | storage); |
5566b478 | 10680 | |
5566b478 | 10681 | mark_decl_instantiated (result, extern_p); |
c91a56d2 | 10682 | if (! extern_p) |
415c974c | 10683 | instantiate_decl (result, /*defer_ok=*/1, /*undefined_ok=*/0); |
7177d104 MS |
10684 | } |
10685 | ||
faae18ab | 10686 | void |
3a978d72 | 10687 | mark_class_instantiated (tree t, int extern_p) |
faae18ab MS |
10688 | { |
10689 | SET_CLASSTYPE_EXPLICIT_INSTANTIATION (t); | |
eb773359 JM |
10690 | SET_CLASSTYPE_INTERFACE_KNOWN (t); |
10691 | CLASSTYPE_INTERFACE_ONLY (t) = extern_p; | |
faae18ab MS |
10692 | TYPE_DECL_SUPPRESS_DEBUG (TYPE_NAME (t)) = extern_p; |
10693 | if (! extern_p) | |
10694 | { | |
10695 | CLASSTYPE_DEBUG_REQUESTED (t) = 1; | |
10696 | rest_of_type_compilation (t, 1); | |
10697 | } | |
10698 | } | |
e8abc66f | 10699 | |
5e0c54e5 | 10700 | /* Called from do_type_instantiation through binding_table_foreach to |
9bcb9aae | 10701 | do recursive instantiation for the type bound in ENTRY. */ |
5e0c54e5 GDR |
10702 | static void |
10703 | bt_instantiate_type_proc (binding_entry entry, void *data) | |
10704 | { | |
10705 | tree storage = *(tree *) data; | |
10706 | ||
10707 | if (IS_AGGR_TYPE (entry->type) | |
10708 | && !uses_template_parms (CLASSTYPE_TI_ARGS (entry->type))) | |
10709 | do_type_instantiation (TYPE_MAIN_DECL (entry->type), storage, 0); | |
10710 | } | |
10711 | ||
415c974c MA |
10712 | /* Called from do_type_instantiation to instantiate a member |
10713 | (a member function or a static member variable) of an | |
10714 | explicitly instantiated class template. */ | |
10715 | static void | |
10716 | instantiate_class_member (tree decl, int extern_p) | |
10717 | { | |
10718 | mark_decl_instantiated (decl, extern_p); | |
415c974c MA |
10719 | if (! extern_p) |
10720 | instantiate_decl (decl, /*defer_ok=*/1, /* undefined_ok=*/1); | |
10721 | } | |
10722 | ||
a1bcc528 JM |
10723 | /* Perform an explicit instantiation of template class T. STORAGE, if |
10724 | non-null, is the RID for extern, inline or static. COMPLAIN is | |
838dfd8a | 10725 | nonzero if this is called from the parser, zero if called recursively, |
a1bcc528 JM |
10726 | since the standard is unclear (as detailed below). */ |
10727 | ||
7177d104 | 10728 | void |
3a978d72 | 10729 | do_type_instantiation (tree t, tree storage, tsubst_flags_t complain) |
7177d104 | 10730 | { |
e8abc66f MS |
10731 | int extern_p = 0; |
10732 | int nomem_p = 0; | |
5566b478 | 10733 | int static_p = 0; |
4746cf84 | 10734 | int previous_instantiation_extern_p = 0; |
5566b478 | 10735 | |
ca79f85d JM |
10736 | if (TREE_CODE (t) == TYPE_DECL) |
10737 | t = TREE_TYPE (t); | |
10738 | ||
7ddedda4 | 10739 | if (! CLASS_TYPE_P (t) || ! CLASSTYPE_TEMPLATE_INFO (t)) |
ca79f85d | 10740 | { |
33bd39a2 | 10741 | error ("explicit instantiation of non-template type `%T'", t); |
ca79f85d JM |
10742 | return; |
10743 | } | |
10744 | ||
5566b478 | 10745 | complete_type (t); |
7177d104 | 10746 | |
d0f062fb | 10747 | if (!COMPLETE_TYPE_P (t)) |
f0e01782 | 10748 | { |
c2ea3a40 | 10749 | if (complain & tf_error) |
33bd39a2 | 10750 | error ("explicit instantiation of `%#T' before definition of template", |
a1bcc528 | 10751 | t); |
f0e01782 MS |
10752 | return; |
10753 | } | |
10754 | ||
03d0f4af | 10755 | if (storage != NULL_TREE) |
f0e01782 | 10756 | { |
c02f5e29 | 10757 | if (pedantic && !in_system_header) |
4460cef2 GDR |
10758 | pedwarn("ISO C++ forbids the use of `%E' on explicit instantiations", |
10759 | storage); | |
03d0f4af MM |
10760 | |
10761 | if (storage == ridpointers[(int) RID_INLINE]) | |
10762 | nomem_p = 1; | |
10763 | else if (storage == ridpointers[(int) RID_EXTERN]) | |
10764 | extern_p = 1; | |
10765 | else if (storage == ridpointers[(int) RID_STATIC]) | |
10766 | static_p = 1; | |
10767 | else | |
10768 | { | |
33bd39a2 | 10769 | error ("storage class `%D' applied to template instantiation", |
03d0f4af MM |
10770 | storage); |
10771 | extern_p = 0; | |
10772 | } | |
f0e01782 MS |
10773 | } |
10774 | ||
370af2d5 | 10775 | if (CLASSTYPE_TEMPLATE_SPECIALIZATION (t)) |
03d0f4af | 10776 | { |
07782718 | 10777 | /* DR 259 [temp.spec]. |
a292b002 | 10778 | |
07782718 KL |
10779 | Both an explicit instantiation and a declaration of an explicit |
10780 | specialization shall not appear in a program unless the explicit | |
10781 | instantiation follows a declaration of the explicit specialization. | |
10782 | ||
10783 | For a given set of template parameters, if an explicit | |
10784 | instantiation of a template appears after a declaration of an | |
10785 | explicit specialization for that template, the explicit | |
10786 | instantiation has no effect. */ | |
03d0f4af MM |
10787 | return; |
10788 | } | |
10789 | else if (CLASSTYPE_EXPLICIT_INSTANTIATION (t)) | |
44a8d0b3 | 10790 | { |
03d0f4af MM |
10791 | /* [temp.spec] |
10792 | ||
10793 | No program shall explicitly instantiate any template more | |
10794 | than once. | |
10795 | ||
4746cf84 MA |
10796 | If PREVIOUS_INSTANTIATION_EXTERN_P, then the first explicit |
10797 | instantiation was `extern'. If EXTERN_P then the second is. | |
4684cd27 | 10798 | These cases are OK. */ |
4746cf84 MA |
10799 | previous_instantiation_extern_p = CLASSTYPE_INTERFACE_ONLY (t); |
10800 | ||
10801 | if (!previous_instantiation_extern_p && !extern_p | |
c2ea3a40 | 10802 | && (complain & tf_error)) |
33bd39a2 | 10803 | pedwarn ("duplicate explicit instantiation of `%#T'", t); |
03d0f4af MM |
10804 | |
10805 | /* If we've already instantiated the template, just return now. */ | |
10806 | if (!CLASSTYPE_INTERFACE_ONLY (t)) | |
10807 | return; | |
44a8d0b3 | 10808 | } |
e8abc66f | 10809 | |
03d0f4af | 10810 | mark_class_instantiated (t, extern_p); |
03d0f4af | 10811 | |
e8abc66f MS |
10812 | if (nomem_p) |
10813 | return; | |
10814 | ||
7177d104 | 10815 | { |
db5ae43f | 10816 | tree tmp; |
5566b478 | 10817 | |
03d0f4af MM |
10818 | /* In contrast to implicit instantiation, where only the |
10819 | declarations, and not the definitions, of members are | |
10820 | instantiated, we have here: | |
10821 | ||
10822 | [temp.explicit] | |
10823 | ||
10824 | The explicit instantiation of a class template specialization | |
10825 | implies the instantiation of all of its members not | |
10826 | previously explicitly specialized in the translation unit | |
10827 | containing the explicit instantiation. | |
10828 | ||
10829 | Of course, we can't instantiate member template classes, since | |
10830 | we don't have any arguments for them. Note that the standard | |
dc957d14 | 10831 | is unclear on whether the instantiation of the members are |
415c974c MA |
10832 | *explicit* instantiations or not. However, the most natural |
10833 | interpretation is that it should be an explicit instantiation. */ | |
03d0f4af | 10834 | |
5566b478 MS |
10835 | if (! static_p) |
10836 | for (tmp = TYPE_METHODS (t); tmp; tmp = TREE_CHAIN (tmp)) | |
a7d87521 | 10837 | if (TREE_CODE (tmp) == FUNCTION_DECL |
1f109f0f | 10838 | && DECL_TEMPLATE_INSTANTIATION (tmp)) |
415c974c | 10839 | instantiate_class_member (tmp, extern_p); |
5566b478 MS |
10840 | |
10841 | for (tmp = TYPE_FIELDS (t); tmp; tmp = TREE_CHAIN (tmp)) | |
10842 | if (TREE_CODE (tmp) == VAR_DECL && DECL_TEMPLATE_INSTANTIATION (tmp)) | |
415c974c | 10843 | instantiate_class_member (tmp, extern_p); |
7177d104 | 10844 | |
5e0c54e5 GDR |
10845 | if (CLASSTYPE_NESTED_UTDS (t)) |
10846 | binding_table_foreach (CLASSTYPE_NESTED_UTDS (t), | |
10847 | bt_instantiate_type_proc, &storage); | |
a292b002 | 10848 | } |
8d08fdba | 10849 | } |
a28e3c7f | 10850 | |
36a117a5 MM |
10851 | /* Given a function DECL, which is a specialization of TMPL, modify |
10852 | DECL to be a re-instantiation of TMPL with the same template | |
10853 | arguments. TMPL should be the template into which tsubst'ing | |
10854 | should occur for DECL, not the most general template. | |
830bfa74 MM |
10855 | |
10856 | One reason for doing this is a scenario like this: | |
10857 | ||
10858 | template <class T> | |
10859 | void f(const T&, int i); | |
10860 | ||
10861 | void g() { f(3, 7); } | |
10862 | ||
10863 | template <class T> | |
10864 | void f(const T& t, const int i) { } | |
10865 | ||
10866 | Note that when the template is first instantiated, with | |
10867 | instantiate_template, the resulting DECL will have no name for the | |
10868 | first parameter, and the wrong type for the second. So, when we go | |
10869 | to instantiate the DECL, we regenerate it. */ | |
10870 | ||
e9659ab0 | 10871 | static void |
3a978d72 | 10872 | regenerate_decl_from_template (tree decl, tree tmpl) |
830bfa74 | 10873 | { |
f9a7ae04 MM |
10874 | /* The most general version of TMPL. */ |
10875 | tree gen_tmpl; | |
10876 | /* The arguments used to instantiate DECL, from the most general | |
10877 | template. */ | |
830bfa74 | 10878 | tree args; |
830bfa74 MM |
10879 | tree code_pattern; |
10880 | tree new_decl; | |
b3445994 | 10881 | bool unregistered; |
830bfa74 MM |
10882 | |
10883 | args = DECL_TI_ARGS (decl); | |
10884 | code_pattern = DECL_TEMPLATE_RESULT (tmpl); | |
10885 | ||
8251199e JM |
10886 | /* Unregister the specialization so that when we tsubst we will not |
10887 | just return DECL. We don't have to unregister DECL from TMPL | |
10888 | because if would only be registered there if it were a partial | |
10889 | instantiation of a specialization, which it isn't: it's a full | |
10890 | instantiation. */ | |
36a117a5 | 10891 | gen_tmpl = most_general_template (tmpl); |
b3445994 MM |
10892 | unregistered = reregister_specialization (decl, gen_tmpl, |
10893 | /*new_spec=*/NULL_TREE); | |
36a117a5 MM |
10894 | |
10895 | /* If the DECL was not unregistered then something peculiar is | |
10896 | happening: we created a specialization but did not call | |
10897 | register_specialization for it. */ | |
10898 | my_friendly_assert (unregistered, 0); | |
10899 | ||
2b907f5c KL |
10900 | /* Make sure that we can see identifiers, and compute access |
10901 | correctly. */ | |
10902 | push_access_scope (decl); | |
10903 | ||
d8c4447d | 10904 | /* Do the substitution to get the new declaration. */ |
c2ea3a40 | 10905 | new_decl = tsubst (code_pattern, args, tf_error, NULL_TREE); |
830bfa74 MM |
10906 | |
10907 | if (TREE_CODE (decl) == VAR_DECL) | |
10908 | { | |
10909 | /* Set up DECL_INITIAL, since tsubst doesn't. */ | |
17bbb839 MM |
10910 | if (!DECL_INITIALIZED_IN_CLASS_P (decl)) |
10911 | DECL_INITIAL (new_decl) = | |
10912 | tsubst_expr (DECL_INITIAL (code_pattern), args, | |
10913 | tf_error, DECL_TI_TEMPLATE (decl)); | |
830bfa74 | 10914 | } |
2b0a63a3 | 10915 | else if (TREE_CODE (decl) == FUNCTION_DECL) |
fbf1c34b MM |
10916 | { |
10917 | /* Convince duplicate_decls to use the DECL_ARGUMENTS from the | |
10918 | new decl. */ | |
10919 | DECL_INITIAL (new_decl) = error_mark_node; | |
10920 | /* And don't complain about a duplicate definition. */ | |
10921 | DECL_INITIAL (decl) = NULL_TREE; | |
10922 | } | |
36a117a5 | 10923 | |
2b59fc25 | 10924 | pop_access_scope (decl); |
0e902d98 | 10925 | |
36a117a5 MM |
10926 | /* The immediate parent of the new template is still whatever it was |
10927 | before, even though tsubst sets DECL_TI_TEMPLATE up as the most | |
10928 | general template. We also reset the DECL_ASSEMBLER_NAME since | |
10929 | tsubst always calculates the name as if the function in question | |
10930 | were really a template instance, and sometimes, with friend | |
10931 | functions, this is not so. See tsubst_friend_function for | |
10932 | details. */ | |
10933 | DECL_TI_TEMPLATE (new_decl) = DECL_TI_TEMPLATE (decl); | |
92643fea | 10934 | COPY_DECL_ASSEMBLER_NAME (decl, new_decl); |
19e7881c | 10935 | COPY_DECL_RTL (decl, new_decl); |
459c43ad | 10936 | DECL_USE_TEMPLATE (new_decl) = DECL_USE_TEMPLATE (decl); |
36a117a5 MM |
10937 | |
10938 | /* Call duplicate decls to merge the old and new declarations. */ | |
830bfa74 MM |
10939 | duplicate_decls (new_decl, decl); |
10940 | ||
36a117a5 MM |
10941 | /* Now, re-register the specialization. */ |
10942 | register_specialization (decl, gen_tmpl, args); | |
830bfa74 MM |
10943 | } |
10944 | ||
a723baf1 MM |
10945 | /* Return the TEMPLATE_DECL into which DECL_TI_ARGS(DECL) should be |
10946 | substituted to get DECL. */ | |
10947 | ||
d58b7c2d | 10948 | tree |
a723baf1 MM |
10949 | template_for_substitution (tree decl) |
10950 | { | |
10951 | tree tmpl = DECL_TI_TEMPLATE (decl); | |
10952 | ||
10953 | /* Set TMPL to the template whose DECL_TEMPLATE_RESULT is the pattern | |
10954 | for the instantiation. This is not always the most general | |
10955 | template. Consider, for example: | |
10956 | ||
10957 | template <class T> | |
10958 | struct S { template <class U> void f(); | |
10959 | template <> void f<int>(); }; | |
10960 | ||
10961 | and an instantiation of S<double>::f<int>. We want TD to be the | |
10962 | specialization S<T>::f<int>, not the more general S<T>::f<U>. */ | |
10963 | while (/* An instantiation cannot have a definition, so we need a | |
10964 | more general template. */ | |
10965 | DECL_TEMPLATE_INSTANTIATION (tmpl) | |
10966 | /* We must also deal with friend templates. Given: | |
10967 | ||
10968 | template <class T> struct S { | |
10969 | template <class U> friend void f() {}; | |
10970 | }; | |
10971 | ||
10972 | S<int>::f<U> say, is not an instantiation of S<T>::f<U>, | |
10973 | so far as the language is concerned, but that's still | |
10974 | where we get the pattern for the instantiation from. On | |
10975 | other hand, if the definition comes outside the class, say: | |
10976 | ||
10977 | template <class T> struct S { | |
10978 | template <class U> friend void f(); | |
10979 | }; | |
10980 | template <class U> friend void f() {} | |
10981 | ||
10982 | we don't need to look any further. That's what the check for | |
10983 | DECL_INITIAL is for. */ | |
10984 | || (TREE_CODE (decl) == FUNCTION_DECL | |
10985 | && DECL_FRIEND_PSEUDO_TEMPLATE_INSTANTIATION (tmpl) | |
10986 | && !DECL_INITIAL (DECL_TEMPLATE_RESULT (tmpl)))) | |
10987 | { | |
10988 | /* The present template, TD, should not be a definition. If it | |
10989 | were a definition, we should be using it! Note that we | |
10990 | cannot restructure the loop to just keep going until we find | |
10991 | a template with a definition, since that might go too far if | |
10992 | a specialization was declared, but not defined. */ | |
10993 | my_friendly_assert (!(TREE_CODE (decl) == VAR_DECL | |
10994 | && !DECL_IN_AGGR_P (DECL_TEMPLATE_RESULT (tmpl))), | |
10995 | 0); | |
10996 | ||
10997 | /* Fetch the more general template. */ | |
10998 | tmpl = DECL_TI_TEMPLATE (tmpl); | |
10999 | } | |
11000 | ||
11001 | return tmpl; | |
11002 | } | |
11003 | ||
16d53b64 | 11004 | /* Produce the definition of D, a _DECL generated from a template. If |
838dfd8a | 11005 | DEFER_OK is nonzero, then we don't have to actually do the |
415c974c MA |
11006 | instantiation now; we just have to do it sometime. Normally it is |
11007 | an error if this is an explicit instantiation but D is undefined. | |
11008 | If UNDEFINED_OK is nonzero, then instead we treat it as an implicit | |
11009 | instantiation. UNDEFINED_OK is nonzero only if we are being used | |
11010 | to instantiate the members of an explicitly instantiated class | |
11011 | template. */ | |
11012 | ||
f84b4be9 | 11013 | |
a28e3c7f | 11014 | tree |
415c974c | 11015 | instantiate_decl (tree d, int defer_ok, int undefined_ok) |
a28e3c7f | 11016 | { |
36a117a5 | 11017 | tree tmpl = DECL_TI_TEMPLATE (d); |
65f8b0fb MM |
11018 | tree gen_args; |
11019 | tree args; | |
830bfa74 | 11020 | tree td; |
36a117a5 MM |
11021 | tree code_pattern; |
11022 | tree spec; | |
11023 | tree gen_tmpl; | |
5566b478 | 11024 | int pattern_defined; |
31a714f6 | 11025 | int need_push; |
82a98427 NS |
11026 | location_t saved_loc = input_location; |
11027 | ||
36a117a5 MM |
11028 | /* This function should only be used to instantiate templates for |
11029 | functions and static member variables. */ | |
11030 | my_friendly_assert (TREE_CODE (d) == FUNCTION_DECL | |
11031 | || TREE_CODE (d) == VAR_DECL, 0); | |
11032 | ||
cec24319 MM |
11033 | /* Variables are never deferred; if instantiation is required, they |
11034 | are instantiated right away. That allows for better code in the | |
11035 | case that an expression refers to the value of the variable -- | |
11036 | if the variable has a constant value the referring expression can | |
11037 | take advantage of that fact. */ | |
11038 | if (TREE_CODE (d) == VAR_DECL) | |
11039 | defer_ok = 0; | |
11040 | ||
db9b2174 MM |
11041 | /* Don't instantiate cloned functions. Instead, instantiate the |
11042 | functions they cloned. */ | |
11043 | if (TREE_CODE (d) == FUNCTION_DECL && DECL_CLONED_FUNCTION_P (d)) | |
11044 | d = DECL_CLONED_FUNCTION (d); | |
11045 | ||
fbf1c34b | 11046 | if (DECL_TEMPLATE_INSTANTIATED (d)) |
03d0f4af | 11047 | /* D has already been instantiated. It might seem reasonable to |
dc957d14 | 11048 | check whether or not D is an explicit instantiation, and, if so, |
03d0f4af MM |
11049 | stop here. But when an explicit instantiation is deferred |
11050 | until the end of the compilation, DECL_EXPLICIT_INSTANTIATION | |
11051 | is set, even though we still need to do the instantiation. */ | |
36a117a5 MM |
11052 | return d; |
11053 | ||
11054 | /* If we already have a specialization of this declaration, then | |
11055 | there's no reason to instantiate it. Note that | |
11056 | retrieve_specialization gives us both instantiations and | |
11057 | specializations, so we must explicitly check | |
11058 | DECL_TEMPLATE_SPECIALIZATION. */ | |
11059 | gen_tmpl = most_general_template (tmpl); | |
65f8b0fb MM |
11060 | gen_args = DECL_TI_ARGS (d); |
11061 | spec = retrieve_specialization (gen_tmpl, gen_args); | |
36a117a5 MM |
11062 | if (spec != NULL_TREE && DECL_TEMPLATE_SPECIALIZATION (spec)) |
11063 | return spec; | |
11064 | ||
11065 | /* This needs to happen before any tsubsting. */ | |
11066 | if (! push_tinst_level (d)) | |
11067 | return d; | |
11068 | ||
297a5329 JM |
11069 | timevar_push (TV_PARSE); |
11070 | ||
c1f927e8 | 11071 | /* We may be in the middle of deferred access check. Disable it now. */ |
7d021397 KL |
11072 | push_deferring_access_checks (dk_no_deferred); |
11073 | ||
4d85e00e | 11074 | /* Set TD to the template whose DECL_TEMPLATE_RESULT is the pattern |
a723baf1 MM |
11075 | for the instantiation. */ |
11076 | td = template_for_substitution (d); | |
fee23f54 | 11077 | code_pattern = DECL_TEMPLATE_RESULT (td); |
27bb8339 | 11078 | |
76d3baad KL |
11079 | if ((DECL_NAMESPACE_SCOPE_P (d) && !DECL_INITIALIZED_IN_CLASS_P (d)) |
11080 | || DECL_TEMPLATE_SPECIALIZATION (td)) | |
649fc72d NS |
11081 | /* In the case of a friend template whose definition is provided |
11082 | outside the class, we may have too many arguments. Drop the | |
76d3baad | 11083 | ones we don't need. The same is true for specializations. */ |
649fc72d NS |
11084 | args = get_innermost_template_args |
11085 | (gen_args, TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (td))); | |
11086 | else | |
11087 | args = gen_args; | |
65f8b0fb | 11088 | |
5566b478 | 11089 | if (TREE_CODE (d) == FUNCTION_DECL) |
39c76b4f | 11090 | pattern_defined = (DECL_SAVED_TREE (code_pattern) != NULL_TREE); |
5566b478 | 11091 | else |
36a117a5 | 11092 | pattern_defined = ! DECL_IN_AGGR_P (code_pattern); |
4684cd27 MM |
11093 | /* Unless an explicit instantiation directive has already determined |
11094 | the linkage of D, remember that a definition is available for | |
11095 | this entity. */ | |
11096 | if (pattern_defined | |
11097 | && !DECL_INTERFACE_KNOWN (d) | |
11098 | && !DECL_NOT_REALLY_EXTERN (d)) | |
11099 | mark_definable (d); | |
de22184b | 11100 | |
f31686a3 | 11101 | input_location = DECL_SOURCE_LOCATION (d); |
de22184b | 11102 | |
4684cd27 | 11103 | if (! pattern_defined && DECL_EXPLICIT_INSTANTIATION (d) && undefined_ok) |
5566b478 | 11104 | { |
4684cd27 MM |
11105 | DECL_NOT_REALLY_EXTERN (d) = 0; |
11106 | SET_DECL_IMPLICIT_INSTANTIATION (d); | |
5566b478 MS |
11107 | } |
11108 | ||
4f2b0fb2 NS |
11109 | if (!defer_ok) |
11110 | { | |
11111 | /* Recheck the substitutions to obtain any warning messages | |
11112 | about ignoring cv qualifiers. */ | |
11113 | tree gen = DECL_TEMPLATE_RESULT (gen_tmpl); | |
11114 | tree type = TREE_TYPE (gen); | |
11115 | ||
0e902d98 | 11116 | /* Make sure that we can see identifiers, and compute access |
2b59fc25 KL |
11117 | correctly. D is already the target FUNCTION_DECL with the |
11118 | right context. */ | |
11119 | push_access_scope (d); | |
0e902d98 | 11120 | |
4f2b0fb2 NS |
11121 | if (TREE_CODE (gen) == FUNCTION_DECL) |
11122 | { | |
65f8b0fb MM |
11123 | tsubst (DECL_ARGUMENTS (gen), gen_args, tf_error | tf_warning, d); |
11124 | tsubst (TYPE_RAISES_EXCEPTIONS (type), gen_args, | |
4f2b0fb2 NS |
11125 | tf_error | tf_warning, d); |
11126 | /* Don't simply tsubst the function type, as that will give | |
11127 | duplicate warnings about poor parameter qualifications. | |
11128 | The function arguments are the same as the decl_arguments | |
c6002625 | 11129 | without the top level cv qualifiers. */ |
4f2b0fb2 NS |
11130 | type = TREE_TYPE (type); |
11131 | } | |
65f8b0fb | 11132 | tsubst (type, gen_args, tf_error | tf_warning, d); |
0e902d98 | 11133 | |
2b59fc25 | 11134 | pop_access_scope (d); |
4f2b0fb2 NS |
11135 | } |
11136 | ||
4684cd27 MM |
11137 | /* We should have set up DECL_INITIAL in instantiate_class_template |
11138 | for in-class definitions of static data members. */ | |
11139 | my_friendly_assert (!(TREE_CODE (d) == VAR_DECL | |
11140 | && DECL_INITIALIZED_IN_CLASS_P (d) | |
11141 | && DECL_INITIAL (d) == NULL_TREE), | |
11142 | 20040726); | |
11143 | ||
11144 | /* Do not instantiate templates that we know will be defined | |
11145 | elsewhere. */ | |
11146 | if (DECL_INTERFACE_KNOWN (d) | |
11147 | && DECL_REALLY_EXTERN (d) | |
11148 | && ! (TREE_CODE (d) == FUNCTION_DECL | |
11149 | && DECL_INLINE (d))) | |
930cd796 | 11150 | goto out; |
16d53b64 MM |
11151 | /* Defer all other templates, unless we have been explicitly |
11152 | forbidden from doing so. We restore the source position here | |
11153 | because it's used by add_pending_template. */ | |
11154 | else if (! pattern_defined || defer_ok) | |
11155 | { | |
82a98427 | 11156 | input_location = saved_loc; |
c27be9b9 | 11157 | |
03d0f4af MM |
11158 | if (at_eof && !pattern_defined |
11159 | && DECL_EXPLICIT_INSTANTIATION (d)) | |
11160 | /* [temp.explicit] | |
11161 | ||
11162 | The definition of a non-exported function template, a | |
11163 | non-exported member function template, or a non-exported | |
11164 | member function or static data member of a class template | |
11165 | shall be present in every translation unit in which it is | |
11166 | explicitly instantiated. */ | |
33bd39a2 | 11167 | pedwarn |
46ccf50a | 11168 | ("explicit instantiation of `%D' but no definition available", d); |
03d0f4af | 11169 | |
5566b478 | 11170 | add_pending_template (d); |
de22184b | 11171 | goto out; |
5566b478 | 11172 | } |
4684cd27 MM |
11173 | /* Tell the repository that D is available in this translation unit |
11174 | -- and see if it is supposed to be instantiated here. */ | |
11175 | if (TREE_PUBLIC (d) && !DECL_REALLY_EXTERN (d) && !repo_emit_p (d)) | |
11176 | { | |
11177 | /* In a PCH file, despite the fact that the repository hasn't | |
11178 | requested instantiation in the PCH it is still possible that | |
11179 | an instantiation will be required in a file that includes the | |
11180 | PCH. */ | |
11181 | if (pch_file) | |
11182 | add_pending_template (d); | |
11183 | /* Instantiate inline functions so that the inliner can do its | |
11184 | job, even though we'll not be emitting a copy of this | |
11185 | function. */ | |
c2a124b2 MM |
11186 | if (!(TREE_CODE (d) == FUNCTION_DECL |
11187 | && flag_inline_trees | |
11188 | && DECL_DECLARED_INLINE_P (d))) | |
4684cd27 MM |
11189 | goto out; |
11190 | } | |
5566b478 | 11191 | |
6de9cd9a | 11192 | need_push = !cfun || !global_bindings_p (); |
31a714f6 MM |
11193 | if (need_push) |
11194 | push_to_top_level (); | |
414ea4aa | 11195 | |
66e0c440 KL |
11196 | /* Mark D as instantiated so that recursive calls to |
11197 | instantiate_decl do not try to instantiate it again. */ | |
11198 | DECL_TEMPLATE_INSTANTIATED (d) = 1; | |
11199 | ||
2b0a63a3 MM |
11200 | /* Regenerate the declaration in case the template has been modified |
11201 | by a subsequent redeclaration. */ | |
11202 | regenerate_decl_from_template (d, td); | |
4684cd27 | 11203 | |
120722ac | 11204 | /* We already set the file and line above. Reset them now in case |
6de9cd9a | 11205 | they changed as a result of calling regenerate_decl_from_template. */ |
f31686a3 | 11206 | input_location = DECL_SOURCE_LOCATION (d); |
5156628f | 11207 | |
5566b478 MS |
11208 | if (TREE_CODE (d) == VAR_DECL) |
11209 | { | |
1d62c33e MM |
11210 | /* Clear out DECL_RTL; whatever was there before may not be right |
11211 | since we've reset the type of the declaration. */ | |
11212 | SET_DECL_RTL (d, NULL_RTX); | |
5566b478 | 11213 | DECL_IN_AGGR_P (d) = 0; |
ea56c40c | 11214 | |
4684cd27 MM |
11215 | /* Clear DECL_EXTERNAL so that cp_finish_decl will process the |
11216 | initializer. That function will defer actual emission until | |
11217 | we have a chance to determine linkage. */ | |
11218 | DECL_EXTERNAL (d) = 0; | |
11219 | ||
73a8adb6 | 11220 | /* Enter the scope of D so that access-checking works correctly. */ |
4684cd27 MM |
11221 | push_nested_class (DECL_CONTEXT (d)); |
11222 | cp_finish_decl (d, | |
11223 | (!DECL_INITIALIZED_IN_CLASS_P (d) | |
11224 | ? DECL_INITIAL (d) : NULL_TREE), | |
11225 | NULL_TREE, 0); | |
73a8adb6 | 11226 | pop_nested_class (); |
5566b478 MS |
11227 | } |
11228 | else if (TREE_CODE (d) == FUNCTION_DECL) | |
11229 | { | |
6bbf1598 | 11230 | htab_t saved_local_specializations; |
a723baf1 MM |
11231 | tree subst_decl; |
11232 | tree tmpl_parm; | |
11233 | tree spec_parm; | |
6bbf1598 MM |
11234 | |
11235 | /* Save away the current list, in case we are instantiating one | |
11236 | template from within the body of another. */ | |
11237 | saved_local_specializations = local_specializations; | |
11238 | ||
6dfbb909 | 11239 | /* Set up the list of local specializations. */ |
6dfbb909 | 11240 | local_specializations = htab_create (37, |
69f794a7 | 11241 | hash_local_specialization, |
a723baf1 | 11242 | eq_local_specializations, |
6dfbb909 MM |
11243 | NULL); |
11244 | ||
558475f0 | 11245 | /* Set up context. */ |
058b15c1 | 11246 | start_preparsed_function (d, NULL_TREE, SF_PRE_PARSED); |
5566b478 | 11247 | |
a723baf1 MM |
11248 | /* Create substitution entries for the parameters. */ |
11249 | subst_decl = DECL_TEMPLATE_RESULT (template_for_substitution (d)); | |
11250 | tmpl_parm = DECL_ARGUMENTS (subst_decl); | |
11251 | spec_parm = DECL_ARGUMENTS (d); | |
11252 | if (DECL_NONSTATIC_MEMBER_FUNCTION_P (d)) | |
11253 | { | |
11254 | register_local_specialization (spec_parm, tmpl_parm); | |
11255 | spec_parm = skip_artificial_parms_for (d, spec_parm); | |
11256 | tmpl_parm = skip_artificial_parms_for (subst_decl, tmpl_parm); | |
11257 | } | |
11258 | while (tmpl_parm) | |
11259 | { | |
11260 | register_local_specialization (spec_parm, tmpl_parm); | |
11261 | tmpl_parm = TREE_CHAIN (tmpl_parm); | |
11262 | spec_parm = TREE_CHAIN (spec_parm); | |
11263 | } | |
11264 | my_friendly_assert (!spec_parm, 20020813); | |
11265 | ||
558475f0 MM |
11266 | /* Substitute into the body of the function. */ |
11267 | tsubst_expr (DECL_SAVED_TREE (code_pattern), args, | |
c2ea3a40 | 11268 | tf_error | tf_warning, tmpl); |
558475f0 | 11269 | |
6dfbb909 MM |
11270 | /* We don't need the local specializations any more. */ |
11271 | htab_delete (local_specializations); | |
6bbf1598 | 11272 | local_specializations = saved_local_specializations; |
6dfbb909 | 11273 | |
4d6abc1c | 11274 | /* Finish the function. */ |
b2dd096b | 11275 | d = finish_function (0); |
8cd2462c | 11276 | expand_or_defer_fn (d); |
5566b478 MS |
11277 | } |
11278 | ||
971cbc14 MM |
11279 | /* We're not deferring instantiation any more. */ |
11280 | TI_PENDING_TEMPLATE_FLAG (DECL_TEMPLATE_INFO (d)) = 0; | |
11281 | ||
31a714f6 MM |
11282 | if (need_push) |
11283 | pop_from_top_level (); | |
414ea4aa | 11284 | |
de22184b | 11285 | out: |
82a98427 | 11286 | input_location = saved_loc; |
7d021397 | 11287 | pop_deferring_access_checks (); |
5566b478 | 11288 | pop_tinst_level (); |
a28e3c7f | 11289 | |
297a5329 JM |
11290 | timevar_pop (TV_PARSE); |
11291 | ||
a28e3c7f MS |
11292 | return d; |
11293 | } | |
5566b478 | 11294 | |
0aafb128 | 11295 | /* Run through the list of templates that we wish we could |
35046a54 KL |
11296 | instantiate, and instantiate any we can. RETRIES is the |
11297 | number of times we retry pending template instantiation. */ | |
0aafb128 | 11298 | |
35046a54 KL |
11299 | void |
11300 | instantiate_pending_templates (int retries) | |
0aafb128 MM |
11301 | { |
11302 | tree *t; | |
46ccf50a | 11303 | tree last = NULL_TREE; |
0aafb128 | 11304 | int reconsider; |
aad626f7 | 11305 | location_t saved_loc = input_location; |
35046a54 KL |
11306 | |
11307 | /* Instantiating templates may trigger vtable generation. This in turn | |
11308 | may require further template instantiations. We place a limit here | |
11309 | to avoid infinite loop. */ | |
11310 | if (pending_templates && retries >= max_tinst_depth) | |
11311 | { | |
11312 | cp_error_at ("template instantiation depth exceeds maximum of %d" | |
11313 | " (use -ftemplate-depth-NN to increase the maximum)" | |
11314 | " instantiating `%+D', possibly from virtual table" | |
11315 | " generation", | |
11316 | max_tinst_depth, TREE_VALUE (pending_templates)); | |
11317 | return; | |
11318 | } | |
11319 | ||
0aafb128 MM |
11320 | do |
11321 | { | |
11322 | reconsider = 0; | |
11323 | ||
11324 | t = &pending_templates; | |
11325 | while (*t) | |
11326 | { | |
0aafb128 MM |
11327 | tree instantiation = TREE_VALUE (*t); |
11328 | ||
3ae18eaf | 11329 | reopen_tinst_level (TREE_PURPOSE (*t)); |
0aafb128 | 11330 | |
2f939d94 | 11331 | if (TYPE_P (instantiation)) |
0aafb128 MM |
11332 | { |
11333 | tree fn; | |
11334 | ||
d0f062fb | 11335 | if (!COMPLETE_TYPE_P (instantiation)) |
0aafb128 MM |
11336 | { |
11337 | instantiate_class_template (instantiation); | |
11338 | if (CLASSTYPE_TEMPLATE_INSTANTIATION (instantiation)) | |
11339 | for (fn = TYPE_METHODS (instantiation); | |
11340 | fn; | |
11341 | fn = TREE_CHAIN (fn)) | |
11342 | if (! DECL_ARTIFICIAL (fn)) | |
061cae1f NS |
11343 | instantiate_decl (fn, /*defer_ok=*/0, |
11344 | /*undefined_ok=*/0); | |
d0f062fb | 11345 | if (COMPLETE_TYPE_P (instantiation)) |
35046a54 | 11346 | reconsider = 1; |
0aafb128 MM |
11347 | } |
11348 | ||
d0f062fb | 11349 | if (COMPLETE_TYPE_P (instantiation)) |
0aafb128 MM |
11350 | /* If INSTANTIATION has been instantiated, then we don't |
11351 | need to consider it again in the future. */ | |
11352 | *t = TREE_CHAIN (*t); | |
46ccf50a JM |
11353 | else |
11354 | { | |
11355 | last = *t; | |
11356 | t = &TREE_CHAIN (*t); | |
11357 | } | |
0aafb128 MM |
11358 | } |
11359 | else | |
11360 | { | |
16d53b64 | 11361 | if (!DECL_TEMPLATE_SPECIALIZATION (instantiation) |
0aafb128 MM |
11362 | && !DECL_TEMPLATE_INSTANTIATED (instantiation)) |
11363 | { | |
16d53b64 | 11364 | instantiation = instantiate_decl (instantiation, |
415c974c MA |
11365 | /*defer_ok=*/0, |
11366 | /*undefined_ok=*/0); | |
0aafb128 | 11367 | if (DECL_TEMPLATE_INSTANTIATED (instantiation)) |
35046a54 | 11368 | reconsider = 1; |
0aafb128 MM |
11369 | } |
11370 | ||
16d53b64 | 11371 | if (DECL_TEMPLATE_SPECIALIZATION (instantiation) |
0aafb128 MM |
11372 | || DECL_TEMPLATE_INSTANTIATED (instantiation)) |
11373 | /* If INSTANTIATION has been instantiated, then we don't | |
11374 | need to consider it again in the future. */ | |
11375 | *t = TREE_CHAIN (*t); | |
46ccf50a JM |
11376 | else |
11377 | { | |
11378 | last = *t; | |
11379 | t = &TREE_CHAIN (*t); | |
11380 | } | |
0aafb128 | 11381 | } |
84e5ca0f NS |
11382 | tinst_depth = 0; |
11383 | current_tinst_level = NULL_TREE; | |
0aafb128 | 11384 | } |
46ccf50a | 11385 | last_pending_template = last; |
0aafb128 MM |
11386 | } |
11387 | while (reconsider); | |
11388 | ||
aad626f7 | 11389 | input_location = saved_loc; |
0aafb128 MM |
11390 | } |
11391 | ||
fd74ca0b MM |
11392 | /* Substitute ARGVEC into T, which is a list of initializers for |
11393 | either base class or a non-static data member. The TREE_PURPOSEs | |
11394 | are DECLs, and the TREE_VALUEs are the initializer values. Used by | |
11395 | instantiate_decl. */ | |
4393e105 | 11396 | |
824b9a4c | 11397 | static tree |
3a978d72 | 11398 | tsubst_initializer_list (tree t, tree argvec) |
5566b478 | 11399 | { |
2282d28d | 11400 | tree inits = NULL_TREE; |
5566b478 MS |
11401 | |
11402 | for (; t; t = TREE_CHAIN (t)) | |
11403 | { | |
fd74ca0b MM |
11404 | tree decl; |
11405 | tree init; | |
11406 | tree val; | |
11407 | ||
c2ea3a40 | 11408 | decl = tsubst_copy (TREE_PURPOSE (t), argvec, tf_error | tf_warning, |
fd74ca0b | 11409 | NULL_TREE); |
1f5a253a NS |
11410 | decl = expand_member_init (decl); |
11411 | if (decl && !DECL_P (decl)) | |
11412 | in_base_initializer = 1; | |
11413 | ||
c2ea3a40 | 11414 | init = tsubst_expr (TREE_VALUE (t), argvec, tf_error | tf_warning, |
fd74ca0b | 11415 | NULL_TREE); |
fd74ca0b MM |
11416 | if (!init) |
11417 | ; | |
11418 | else if (TREE_CODE (init) == TREE_LIST) | |
11419 | for (val = init; val; val = TREE_CHAIN (val)) | |
11420 | TREE_VALUE (val) = convert_from_reference (TREE_VALUE (val)); | |
2282d28d | 11421 | else if (init != void_type_node) |
fd74ca0b MM |
11422 | init = convert_from_reference (init); |
11423 | ||
1f5a253a NS |
11424 | in_base_initializer = 0; |
11425 | ||
11426 | if (decl) | |
2282d28d | 11427 | { |
1f5a253a | 11428 | init = build_tree_list (decl, init); |
2282d28d MM |
11429 | TREE_CHAIN (init) = inits; |
11430 | inits = init; | |
11431 | } | |
5566b478 | 11432 | } |
2282d28d | 11433 | return inits; |
5566b478 MS |
11434 | } |
11435 | ||
61a127b3 MM |
11436 | /* Set CURRENT_ACCESS_SPECIFIER based on the protection of DECL. */ |
11437 | ||
11438 | static void | |
3a978d72 | 11439 | set_current_access_from_decl (tree decl) |
61a127b3 MM |
11440 | { |
11441 | if (TREE_PRIVATE (decl)) | |
11442 | current_access_specifier = access_private_node; | |
11443 | else if (TREE_PROTECTED (decl)) | |
11444 | current_access_specifier = access_protected_node; | |
11445 | else | |
11446 | current_access_specifier = access_public_node; | |
11447 | } | |
11448 | ||
dbfe2124 MM |
11449 | /* Instantiate an enumerated type. TAG is the template type, NEWTAG |
11450 | is the instantiation (which should have been created with | |
11451 | start_enum) and ARGS are the template arguments to use. */ | |
b87692e5 | 11452 | |
dbfe2124 | 11453 | static void |
3a978d72 | 11454 | tsubst_enum (tree tag, tree newtag, tree args) |
b87692e5 | 11455 | { |
dbfe2124 | 11456 | tree e; |
b87692e5 MS |
11457 | |
11458 | for (e = TYPE_VALUES (tag); e; e = TREE_CHAIN (e)) | |
11459 | { | |
61a127b3 | 11460 | tree value; |
7b6d72fc MM |
11461 | tree decl; |
11462 | ||
11463 | decl = TREE_VALUE (e); | |
61a127b3 MM |
11464 | /* Note that in a template enum, the TREE_VALUE is the |
11465 | CONST_DECL, not the corresponding INTEGER_CST. */ | |
7b6d72fc | 11466 | value = tsubst_expr (DECL_INITIAL (decl), |
c2ea3a40 | 11467 | args, tf_error | tf_warning, |
4393e105 | 11468 | NULL_TREE); |
61a127b3 MM |
11469 | |
11470 | /* Give this enumeration constant the correct access. */ | |
7b6d72fc | 11471 | set_current_access_from_decl (decl); |
61a127b3 MM |
11472 | |
11473 | /* Actually build the enumerator itself. */ | |
7b6d72fc | 11474 | build_enumerator (DECL_NAME (decl), value, newtag); |
dbfe2124 | 11475 | } |
b3d5a58b | 11476 | |
219670f1 | 11477 | finish_enum (newtag); |
f31686a3 RH |
11478 | DECL_SOURCE_LOCATION (TYPE_NAME (newtag)) |
11479 | = DECL_SOURCE_LOCATION (TYPE_NAME (tag)); | |
b87692e5 | 11480 | } |
36a117a5 | 11481 | |
1f6e1acc AS |
11482 | /* DECL is a FUNCTION_DECL that is a template specialization. Return |
11483 | its type -- but without substituting the innermost set of template | |
11484 | arguments. So, innermost set of template parameters will appear in | |
5c74d5b0 | 11485 | the type. */ |
1f6e1acc AS |
11486 | |
11487 | tree | |
3a978d72 | 11488 | get_mostly_instantiated_function_type (tree decl) |
1f6e1acc | 11489 | { |
1f6e1acc AS |
11490 | tree fn_type; |
11491 | tree tmpl; | |
11492 | tree targs; | |
11493 | tree tparms; | |
11494 | int parm_depth; | |
11495 | ||
11496 | tmpl = most_general_template (DECL_TI_TEMPLATE (decl)); | |
11497 | targs = DECL_TI_ARGS (decl); | |
11498 | tparms = DECL_TEMPLATE_PARMS (tmpl); | |
11499 | parm_depth = TMPL_PARMS_DEPTH (tparms); | |
11500 | ||
11501 | /* There should be as many levels of arguments as there are levels | |
11502 | of parameters. */ | |
11503 | my_friendly_assert (parm_depth == TMPL_ARGS_DEPTH (targs), 0); | |
11504 | ||
11505 | fn_type = TREE_TYPE (tmpl); | |
1f6e1acc AS |
11506 | |
11507 | if (parm_depth == 1) | |
11508 | /* No substitution is necessary. */ | |
11509 | ; | |
11510 | else | |
11511 | { | |
11512 | int i; | |
11513 | tree partial_args; | |
11514 | ||
11515 | /* Replace the innermost level of the TARGS with NULL_TREEs to | |
dc957d14 | 11516 | let tsubst know not to substitute for those parameters. */ |
1f6e1acc AS |
11517 | partial_args = make_tree_vec (TREE_VEC_LENGTH (targs)); |
11518 | for (i = 1; i < TMPL_ARGS_DEPTH (targs); ++i) | |
11519 | SET_TMPL_ARGS_LEVEL (partial_args, i, | |
11520 | TMPL_ARGS_LEVEL (targs, i)); | |
11521 | SET_TMPL_ARGS_LEVEL (partial_args, | |
11522 | TMPL_ARGS_DEPTH (targs), | |
11523 | make_tree_vec (DECL_NTPARMS (tmpl))); | |
11524 | ||
5c74d5b0 KL |
11525 | /* Make sure that we can see identifiers, and compute access |
11526 | correctly. We can just use the context of DECL for the | |
11527 | partial substitution here. It depends only on outer template | |
11528 | parameters, regardless of whether the innermost level is | |
11529 | specialized or not. */ | |
2b59fc25 | 11530 | push_access_scope (decl); |
5c74d5b0 | 11531 | |
9579624e | 11532 | ++processing_template_decl; |
1f6e1acc AS |
11533 | /* Now, do the (partial) substitution to figure out the |
11534 | appropriate function type. */ | |
c2ea3a40 | 11535 | fn_type = tsubst (fn_type, partial_args, tf_error, NULL_TREE); |
9579624e | 11536 | --processing_template_decl; |
1f6e1acc AS |
11537 | |
11538 | /* Substitute into the template parameters to obtain the real | |
11539 | innermost set of parameters. This step is important if the | |
11540 | innermost set of template parameters contains value | |
11541 | parameters whose types depend on outer template parameters. */ | |
11542 | TREE_VEC_LENGTH (partial_args)--; | |
c2ea3a40 | 11543 | tparms = tsubst_template_parms (tparms, partial_args, tf_error); |
1f6e1acc | 11544 | |
2b59fc25 | 11545 | pop_access_scope (decl); |
5c74d5b0 | 11546 | } |
1f6e1acc AS |
11547 | |
11548 | return fn_type; | |
11549 | } | |
669ec2b4 | 11550 | |
cb753e49 | 11551 | /* Return truthvalue if we're processing a template different from |
dc957d14 | 11552 | the last one involved in diagnostics. */ |
cb753e49 | 11553 | int |
3a978d72 | 11554 | problematic_instantiation_changed (void) |
cb753e49 GDR |
11555 | { |
11556 | return last_template_error_tick != tinst_level_tick; | |
11557 | } | |
11558 | ||
11559 | /* Remember current template involved in diagnostics. */ | |
11560 | void | |
3a978d72 | 11561 | record_last_problematic_instantiation (void) |
cb753e49 GDR |
11562 | { |
11563 | last_template_error_tick = tinst_level_tick; | |
11564 | } | |
11565 | ||
11566 | tree | |
3a978d72 | 11567 | current_instantiation (void) |
cb753e49 GDR |
11568 | { |
11569 | return current_tinst_level; | |
11570 | } | |
db3f4e4e NS |
11571 | |
11572 | /* [temp.param] Check that template non-type parm TYPE is of an allowable | |
838dfd8a | 11573 | type. Return zero for ok, nonzero for disallowed. Issue error and |
c2ea3a40 | 11574 | warning messages under control of COMPLAIN. */ |
db3f4e4e NS |
11575 | |
11576 | static int | |
3a978d72 | 11577 | invalid_nontype_parm_type_p (tree type, tsubst_flags_t complain) |
db3f4e4e NS |
11578 | { |
11579 | if (INTEGRAL_TYPE_P (type)) | |
11580 | return 0; | |
11581 | else if (POINTER_TYPE_P (type)) | |
11582 | return 0; | |
a5ac359a | 11583 | else if (TYPE_PTR_TO_MEMBER_P (type)) |
db3f4e4e | 11584 | return 0; |
db3f4e4e NS |
11585 | else if (TREE_CODE (type) == TEMPLATE_TYPE_PARM) |
11586 | return 0; | |
11587 | else if (TREE_CODE (type) == TYPENAME_TYPE) | |
11588 | return 0; | |
11589 | ||
c2ea3a40 | 11590 | if (complain & tf_error) |
33bd39a2 | 11591 | error ("`%#T' is not a valid type for a template constant parameter", |
db3f4e4e NS |
11592 | type); |
11593 | return 1; | |
11594 | } | |
e2500fed | 11595 | |
5552b43c MM |
11596 | /* Returns TRUE if TYPE is dependent, in the sense of [temp.dep.type]. |
11597 | Assumes that TYPE really is a type, and not the ERROR_MARK_NODE.*/ | |
1fb3244a | 11598 | |
5552b43c MM |
11599 | static bool |
11600 | dependent_type_p_r (tree type) | |
1fb3244a MM |
11601 | { |
11602 | tree scope; | |
11603 | ||
1fb3244a MM |
11604 | /* [temp.dep.type] |
11605 | ||
11606 | A type is dependent if it is: | |
11607 | ||
6bf92cb6 GB |
11608 | -- a template parameter. Template template parameters are |
11609 | types for us (since TYPE_P holds true for them) so we | |
11610 | handle them here. */ | |
11611 | if (TREE_CODE (type) == TEMPLATE_TYPE_PARM | |
11612 | || TREE_CODE (type) == TEMPLATE_TEMPLATE_PARM) | |
1fb3244a MM |
11613 | return true; |
11614 | /* -- a qualified-id with a nested-name-specifier which contains a | |
11615 | class-name that names a dependent type or whose unqualified-id | |
11616 | names a dependent type. */ | |
11617 | if (TREE_CODE (type) == TYPENAME_TYPE) | |
11618 | return true; | |
11619 | /* -- a cv-qualified type where the cv-unqualified type is | |
11620 | dependent. */ | |
11621 | type = TYPE_MAIN_VARIANT (type); | |
11622 | /* -- a compound type constructed from any dependent type. */ | |
a5ac359a | 11623 | if (TYPE_PTR_TO_MEMBER_P (type)) |
1fb3244a MM |
11624 | return (dependent_type_p (TYPE_PTRMEM_CLASS_TYPE (type)) |
11625 | || dependent_type_p (TYPE_PTRMEM_POINTED_TO_TYPE | |
11626 | (type))); | |
11627 | else if (TREE_CODE (type) == POINTER_TYPE | |
11628 | || TREE_CODE (type) == REFERENCE_TYPE) | |
11629 | return dependent_type_p (TREE_TYPE (type)); | |
11630 | else if (TREE_CODE (type) == FUNCTION_TYPE | |
11631 | || TREE_CODE (type) == METHOD_TYPE) | |
11632 | { | |
11633 | tree arg_type; | |
11634 | ||
11635 | if (dependent_type_p (TREE_TYPE (type))) | |
11636 | return true; | |
11637 | for (arg_type = TYPE_ARG_TYPES (type); | |
11638 | arg_type; | |
11639 | arg_type = TREE_CHAIN (arg_type)) | |
11640 | if (dependent_type_p (TREE_VALUE (arg_type))) | |
11641 | return true; | |
11642 | return false; | |
11643 | } | |
11644 | /* -- an array type constructed from any dependent type or whose | |
11645 | size is specified by a constant expression that is | |
11646 | value-dependent. */ | |
11647 | if (TREE_CODE (type) == ARRAY_TYPE) | |
11648 | { | |
11649 | if (TYPE_DOMAIN (type) | |
11650 | && ((value_dependent_expression_p | |
11651 | (TYPE_MAX_VALUE (TYPE_DOMAIN (type)))) | |
11652 | || (type_dependent_expression_p | |
11653 | (TYPE_MAX_VALUE (TYPE_DOMAIN (type)))))) | |
11654 | return true; | |
11655 | return dependent_type_p (TREE_TYPE (type)); | |
11656 | } | |
86306a6b | 11657 | |
1fb3244a | 11658 | /* -- a template-id in which either the template name is a template |
86306a6b NS |
11659 | parameter ... */ |
11660 | if (TREE_CODE (type) == BOUND_TEMPLATE_TEMPLATE_PARM) | |
1fb3244a | 11661 | return true; |
86306a6b | 11662 | /* ... or any of the template arguments is a dependent type or |
04c06002 | 11663 | an expression that is type-dependent or value-dependent. */ |
86306a6b | 11664 | else if (CLASS_TYPE_P (type) && CLASSTYPE_TEMPLATE_INFO (type) |
7e99327d MM |
11665 | && (any_dependent_template_arguments_p |
11666 | (INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (type))))) | |
1fb3244a | 11667 | return true; |
86306a6b | 11668 | |
1fb3244a MM |
11669 | /* All TYPEOF_TYPEs are dependent; if the argument of the `typeof' |
11670 | expression is not type-dependent, then it should already been | |
11671 | have resolved. */ | |
11672 | if (TREE_CODE (type) == TYPEOF_TYPE) | |
11673 | return true; | |
86306a6b | 11674 | |
1fb3244a MM |
11675 | /* The standard does not specifically mention types that are local |
11676 | to template functions or local classes, but they should be | |
11677 | considered dependent too. For example: | |
11678 | ||
11679 | template <int I> void f() { | |
11680 | enum E { a = I }; | |
11681 | S<sizeof (E)> s; | |
11682 | } | |
11683 | ||
11684 | The size of `E' cannot be known until the value of `I' has been | |
11685 | determined. Therefore, `E' must be considered dependent. */ | |
11686 | scope = TYPE_CONTEXT (type); | |
11687 | if (scope && TYPE_P (scope)) | |
11688 | return dependent_type_p (scope); | |
11689 | else if (scope && TREE_CODE (scope) == FUNCTION_DECL) | |
11690 | return type_dependent_expression_p (scope); | |
11691 | ||
11692 | /* Other types are non-dependent. */ | |
11693 | return false; | |
11694 | } | |
11695 | ||
5552b43c MM |
11696 | /* Returns TRUE if TYPE is dependent, in the sense of |
11697 | [temp.dep.type]. */ | |
11698 | ||
11699 | bool | |
11700 | dependent_type_p (tree type) | |
11701 | { | |
11702 | /* If there are no template parameters in scope, then there can't be | |
11703 | any dependent types. */ | |
11704 | if (!processing_template_decl) | |
11705 | return false; | |
11706 | ||
11707 | /* If the type is NULL, we have not computed a type for the entity | |
11708 | in question; in that case, the type is dependent. */ | |
11709 | if (!type) | |
11710 | return true; | |
11711 | ||
11712 | /* Erroneous types can be considered non-dependent. */ | |
11713 | if (type == error_mark_node) | |
11714 | return false; | |
11715 | ||
11716 | /* If we have not already computed the appropriate value for TYPE, | |
11717 | do so now. */ | |
11718 | if (!TYPE_DEPENDENT_P_VALID (type)) | |
11719 | { | |
11720 | TYPE_DEPENDENT_P (type) = dependent_type_p_r (type); | |
11721 | TYPE_DEPENDENT_P_VALID (type) = 1; | |
11722 | } | |
11723 | ||
11724 | return TYPE_DEPENDENT_P (type); | |
11725 | } | |
11726 | ||
8d83f792 MM |
11727 | /* Returns TRUE if EXPRESSION is dependent, according to CRITERION. */ |
11728 | ||
11729 | static bool | |
11730 | dependent_scope_ref_p (tree expression, bool criterion (tree)) | |
11731 | { | |
11732 | tree scope; | |
11733 | tree name; | |
11734 | ||
11735 | my_friendly_assert (TREE_CODE (expression) == SCOPE_REF, 20030714); | |
11736 | ||
11737 | if (!TYPE_P (TREE_OPERAND (expression, 0))) | |
11738 | return true; | |
11739 | ||
11740 | scope = TREE_OPERAND (expression, 0); | |
11741 | name = TREE_OPERAND (expression, 1); | |
11742 | ||
11743 | /* [temp.dep.expr] | |
11744 | ||
11745 | An id-expression is type-dependent if it contains a | |
11746 | nested-name-specifier that contains a class-name that names a | |
11747 | dependent type. */ | |
11748 | /* The suggested resolution to Core Issue 2 implies that if the | |
11749 | qualifying type is the current class, then we must peek | |
11750 | inside it. */ | |
11751 | if (DECL_P (name) | |
11752 | && currently_open_class (scope) | |
11753 | && !criterion (name)) | |
11754 | return false; | |
11755 | if (dependent_type_p (scope)) | |
11756 | return true; | |
11757 | ||
11758 | return false; | |
11759 | } | |
11760 | ||
20929c7f GB |
11761 | /* Returns TRUE if the EXPRESSION is value-dependent, in the sense of |
11762 | [temp.dep.constexpr] */ | |
1fb3244a | 11763 | |
14d22dd6 | 11764 | bool |
1fb3244a MM |
11765 | value_dependent_expression_p (tree expression) |
11766 | { | |
11767 | if (!processing_template_decl) | |
11768 | return false; | |
11769 | ||
11770 | /* A name declared with a dependent type. */ | |
10b1d5e7 | 11771 | if (TREE_CODE (expression) == IDENTIFIER_NODE |
00cf3e31 MM |
11772 | || (DECL_P (expression) |
11773 | && type_dependent_expression_p (expression))) | |
1fb3244a MM |
11774 | return true; |
11775 | /* A non-type template parameter. */ | |
11776 | if ((TREE_CODE (expression) == CONST_DECL | |
11777 | && DECL_TEMPLATE_PARM_P (expression)) | |
11778 | || TREE_CODE (expression) == TEMPLATE_PARM_INDEX) | |
11779 | return true; | |
11780 | /* A constant with integral or enumeration type and is initialized | |
11781 | with an expression that is value-dependent. */ | |
11782 | if (TREE_CODE (expression) == VAR_DECL | |
11783 | && DECL_INITIAL (expression) | |
d17811fd | 11784 | && INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (expression)) |
1fb3244a MM |
11785 | && value_dependent_expression_p (DECL_INITIAL (expression))) |
11786 | return true; | |
11787 | /* These expressions are value-dependent if the type to which the | |
20929c7f GB |
11788 | cast occurs is dependent or the expression being casted is |
11789 | value-dependent. */ | |
d17811fd MM |
11790 | if (TREE_CODE (expression) == DYNAMIC_CAST_EXPR |
11791 | || TREE_CODE (expression) == STATIC_CAST_EXPR | |
11792 | || TREE_CODE (expression) == CONST_CAST_EXPR | |
11793 | || TREE_CODE (expression) == REINTERPRET_CAST_EXPR | |
11794 | || TREE_CODE (expression) == CAST_EXPR) | |
11795 | { | |
d36d5600 GB |
11796 | tree type = TREE_TYPE (expression); |
11797 | if (dependent_type_p (type)) | |
d17811fd MM |
11798 | return true; |
11799 | /* A functional cast has a list of operands. */ | |
11800 | expression = TREE_OPERAND (expression, 0); | |
d36d5600 GB |
11801 | if (!expression) |
11802 | { | |
11803 | /* If there are no operands, it must be an expression such | |
11804 | as "int()". This should not happen for aggregate types | |
11805 | because it would form non-constant expressions. */ | |
11806 | my_friendly_assert (INTEGRAL_OR_ENUMERATION_TYPE_P (type), | |
11807 | 20040318); | |
11808 | ||
11809 | return false; | |
11810 | } | |
d17811fd MM |
11811 | if (TREE_CODE (expression) == TREE_LIST) |
11812 | { | |
11813 | do | |
11814 | { | |
11815 | if (value_dependent_expression_p (TREE_VALUE (expression))) | |
11816 | return true; | |
11817 | expression = TREE_CHAIN (expression); | |
11818 | } | |
11819 | while (expression); | |
11820 | return false; | |
11821 | } | |
11822 | else | |
11823 | return value_dependent_expression_p (expression); | |
11824 | } | |
11825 | /* A `sizeof' expression is value-dependent if the operand is | |
11826 | type-dependent. */ | |
11827 | if (TREE_CODE (expression) == SIZEOF_EXPR | |
11828 | || TREE_CODE (expression) == ALIGNOF_EXPR) | |
11829 | { | |
11830 | expression = TREE_OPERAND (expression, 0); | |
11831 | if (TYPE_P (expression)) | |
11832 | return dependent_type_p (expression); | |
11833 | return type_dependent_expression_p (expression); | |
11834 | } | |
8d83f792 MM |
11835 | if (TREE_CODE (expression) == SCOPE_REF) |
11836 | return dependent_scope_ref_p (expression, value_dependent_expression_p); | |
3d5ddced GB |
11837 | if (TREE_CODE (expression) == COMPONENT_REF) |
11838 | return (value_dependent_expression_p (TREE_OPERAND (expression, 0)) | |
11839 | || value_dependent_expression_p (TREE_OPERAND (expression, 1))); | |
1fb3244a MM |
11840 | /* A constant expression is value-dependent if any subexpression is |
11841 | value-dependent. */ | |
11842 | if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (TREE_CODE (expression)))) | |
11843 | { | |
11844 | switch (TREE_CODE_CLASS (TREE_CODE (expression))) | |
11845 | { | |
11846 | case '1': | |
11847 | return (value_dependent_expression_p | |
11848 | (TREE_OPERAND (expression, 0))); | |
11849 | case '<': | |
11850 | case '2': | |
11851 | return ((value_dependent_expression_p | |
11852 | (TREE_OPERAND (expression, 0))) | |
11853 | || (value_dependent_expression_p | |
11854 | (TREE_OPERAND (expression, 1)))); | |
11855 | case 'e': | |
11856 | { | |
11857 | int i; | |
14d22dd6 MM |
11858 | for (i = 0; i < first_rtl_op (TREE_CODE (expression)); ++i) |
11859 | /* In some cases, some of the operands may be missing. | |
11860 | (For example, in the case of PREDECREMENT_EXPR, the | |
11861 | amount to increment by may be missing.) That doesn't | |
11862 | make the expression dependent. */ | |
11863 | if (TREE_OPERAND (expression, i) | |
11864 | && (value_dependent_expression_p | |
11865 | (TREE_OPERAND (expression, i)))) | |
1fb3244a MM |
11866 | return true; |
11867 | return false; | |
11868 | } | |
11869 | } | |
11870 | } | |
11871 | ||
11872 | /* The expression is not value-dependent. */ | |
11873 | return false; | |
11874 | } | |
11875 | ||
11876 | /* Returns TRUE if the EXPRESSION is type-dependent, in the sense of | |
11877 | [temp.dep.expr]. */ | |
11878 | ||
11879 | bool | |
3a978d72 | 11880 | type_dependent_expression_p (tree expression) |
1fb3244a MM |
11881 | { |
11882 | if (!processing_template_decl) | |
11883 | return false; | |
11884 | ||
7efa3e22 NS |
11885 | if (expression == error_mark_node) |
11886 | return false; | |
10b1d5e7 MM |
11887 | |
11888 | /* An unresolved name is always dependent. */ | |
11889 | if (TREE_CODE (expression) == IDENTIFIER_NODE) | |
11890 | return true; | |
7efa3e22 | 11891 | |
1fb3244a MM |
11892 | /* Some expression forms are never type-dependent. */ |
11893 | if (TREE_CODE (expression) == PSEUDO_DTOR_EXPR | |
11894 | || TREE_CODE (expression) == SIZEOF_EXPR | |
11895 | || TREE_CODE (expression) == ALIGNOF_EXPR | |
11896 | || TREE_CODE (expression) == TYPEID_EXPR | |
11897 | || TREE_CODE (expression) == DELETE_EXPR | |
11898 | || TREE_CODE (expression) == VEC_DELETE_EXPR | |
11899 | || TREE_CODE (expression) == THROW_EXPR) | |
11900 | return false; | |
11901 | ||
11902 | /* The types of these expressions depends only on the type to which | |
11903 | the cast occurs. */ | |
11904 | if (TREE_CODE (expression) == DYNAMIC_CAST_EXPR | |
11905 | || TREE_CODE (expression) == STATIC_CAST_EXPR | |
11906 | || TREE_CODE (expression) == CONST_CAST_EXPR | |
11907 | || TREE_CODE (expression) == REINTERPRET_CAST_EXPR | |
11908 | || TREE_CODE (expression) == CAST_EXPR) | |
11909 | return dependent_type_p (TREE_TYPE (expression)); | |
d17811fd | 11910 | |
1fb3244a MM |
11911 | /* The types of these expressions depends only on the type created |
11912 | by the expression. */ | |
d17811fd MM |
11913 | if (TREE_CODE (expression) == NEW_EXPR |
11914 | || TREE_CODE (expression) == VEC_NEW_EXPR) | |
09d2f85f KL |
11915 | { |
11916 | /* For NEW_EXPR tree nodes created inside a template, either | |
11917 | the object type itself or a TREE_LIST may appear as the | |
11918 | operand 1. */ | |
11919 | tree type = TREE_OPERAND (expression, 1); | |
11920 | if (TREE_CODE (type) == TREE_LIST) | |
11921 | /* This is an array type. We need to check array dimensions | |
11922 | as well. */ | |
11923 | return dependent_type_p (TREE_VALUE (TREE_PURPOSE (type))) | |
11924 | || value_dependent_expression_p | |
11925 | (TREE_OPERAND (TREE_VALUE (type), 1)); | |
11926 | else | |
11927 | return dependent_type_p (type); | |
11928 | } | |
1fb3244a | 11929 | |
5a57f1b2 JM |
11930 | if (TREE_CODE (expression) == SCOPE_REF |
11931 | && dependent_scope_ref_p (expression, | |
11932 | type_dependent_expression_p)) | |
11933 | return true; | |
11934 | ||
11935 | if (TREE_CODE (expression) == FUNCTION_DECL | |
11936 | && DECL_LANG_SPECIFIC (expression) | |
11937 | && DECL_TEMPLATE_INFO (expression) | |
11938 | && (any_dependent_template_arguments_p | |
11939 | (INNERMOST_TEMPLATE_ARGS (DECL_TI_ARGS (expression))))) | |
11940 | return true; | |
11941 | ||
11942 | if (TREE_CODE (expression) == TEMPLATE_DECL | |
11943 | && !DECL_TEMPLATE_TEMPLATE_PARM_P (expression)) | |
11944 | return false; | |
11945 | ||
d17811fd MM |
11946 | if (TREE_TYPE (expression) == unknown_type_node) |
11947 | { | |
11948 | if (TREE_CODE (expression) == ADDR_EXPR) | |
11949 | return type_dependent_expression_p (TREE_OPERAND (expression, 0)); | |
c353b8e3 MM |
11950 | if (TREE_CODE (expression) == COMPONENT_REF |
11951 | || TREE_CODE (expression) == OFFSET_REF) | |
6cb89308 NS |
11952 | { |
11953 | if (type_dependent_expression_p (TREE_OPERAND (expression, 0))) | |
11954 | return true; | |
11955 | expression = TREE_OPERAND (expression, 1); | |
11956 | if (TREE_CODE (expression) == IDENTIFIER_NODE) | |
11957 | return false; | |
11958 | } | |
3601f003 KL |
11959 | /* SCOPE_REF with non-null TREE_TYPE is always non-dependent. */ |
11960 | if (TREE_CODE (expression) == SCOPE_REF) | |
11961 | return false; | |
5a57f1b2 | 11962 | |
d17811fd MM |
11963 | if (TREE_CODE (expression) == BASELINK) |
11964 | expression = BASELINK_FUNCTIONS (expression); | |
11965 | if (TREE_CODE (expression) == TEMPLATE_ID_EXPR) | |
11966 | { | |
ee3071ef NS |
11967 | if (any_dependent_template_arguments_p |
11968 | (TREE_OPERAND (expression, 1))) | |
d17811fd MM |
11969 | return true; |
11970 | expression = TREE_OPERAND (expression, 0); | |
11971 | } | |
11972 | if (TREE_CODE (expression) == OVERLOAD) | |
11973 | { | |
11974 | while (expression) | |
11975 | { | |
11976 | if (type_dependent_expression_p (OVL_CURRENT (expression))) | |
11977 | return true; | |
11978 | expression = OVL_NEXT (expression); | |
11979 | } | |
11980 | return false; | |
11981 | } | |
11982 | abort (); | |
11983 | } | |
11984 | ||
1fb3244a MM |
11985 | return (dependent_type_p (TREE_TYPE (expression))); |
11986 | } | |
11987 | ||
d17811fd MM |
11988 | /* Returns TRUE if ARGS (a TREE_LIST of arguments to a function call) |
11989 | contains a type-dependent expression. */ | |
1fb3244a MM |
11990 | |
11991 | bool | |
d17811fd MM |
11992 | any_type_dependent_arguments_p (tree args) |
11993 | { | |
11994 | while (args) | |
11995 | { | |
7efa3e22 NS |
11996 | tree arg = TREE_VALUE (args); |
11997 | ||
11998 | if (type_dependent_expression_p (arg)) | |
d17811fd MM |
11999 | return true; |
12000 | args = TREE_CHAIN (args); | |
12001 | } | |
12002 | return false; | |
12003 | } | |
12004 | ||
12005 | /* Returns TRUE if the ARG (a template argument) is dependent. */ | |
12006 | ||
12007 | static bool | |
1fb3244a MM |
12008 | dependent_template_arg_p (tree arg) |
12009 | { | |
12010 | if (!processing_template_decl) | |
12011 | return false; | |
12012 | ||
12013 | if (TREE_CODE (arg) == TEMPLATE_DECL | |
12014 | || TREE_CODE (arg) == TEMPLATE_TEMPLATE_PARM) | |
12015 | return dependent_template_p (arg); | |
12016 | else if (TYPE_P (arg)) | |
12017 | return dependent_type_p (arg); | |
12018 | else | |
12019 | return (type_dependent_expression_p (arg) | |
12020 | || value_dependent_expression_p (arg)); | |
12021 | } | |
12022 | ||
d17811fd MM |
12023 | /* Returns true if ARGS (a collection of template arguments) contains |
12024 | any dependent arguments. */ | |
1fb3244a | 12025 | |
d17811fd MM |
12026 | bool |
12027 | any_dependent_template_arguments_p (tree args) | |
1fb3244a | 12028 | { |
bf12d54d | 12029 | int i; |
c353b8e3 MM |
12030 | int j; |
12031 | ||
d17811fd MM |
12032 | if (!args) |
12033 | return false; | |
12034 | ||
c353b8e3 MM |
12035 | for (i = 0; i < TMPL_ARGS_DEPTH (args); ++i) |
12036 | { | |
12037 | tree level = TMPL_ARGS_LEVEL (args, i + 1); | |
12038 | for (j = 0; j < TREE_VEC_LENGTH (level); ++j) | |
12039 | if (dependent_template_arg_p (TREE_VEC_ELT (level, j))) | |
12040 | return true; | |
12041 | } | |
1fb3244a | 12042 | |
1fb3244a MM |
12043 | return false; |
12044 | } | |
12045 | ||
12046 | /* Returns TRUE if the template TMPL is dependent. */ | |
12047 | ||
12048 | bool | |
12049 | dependent_template_p (tree tmpl) | |
12050 | { | |
b95cc51a MM |
12051 | if (TREE_CODE (tmpl) == OVERLOAD) |
12052 | { | |
12053 | while (tmpl) | |
12054 | { | |
12055 | if (dependent_template_p (OVL_FUNCTION (tmpl))) | |
12056 | return true; | |
12057 | tmpl = OVL_CHAIN (tmpl); | |
12058 | } | |
12059 | return false; | |
12060 | } | |
12061 | ||
1fb3244a MM |
12062 | /* Template template parameters are dependent. */ |
12063 | if (DECL_TEMPLATE_TEMPLATE_PARM_P (tmpl) | |
12064 | || TREE_CODE (tmpl) == TEMPLATE_TEMPLATE_PARM) | |
12065 | return true; | |
27ab0504 | 12066 | /* So are names that have not been looked up. */ |
acccf788 MM |
12067 | if (TREE_CODE (tmpl) == SCOPE_REF |
12068 | || TREE_CODE (tmpl) == IDENTIFIER_NODE) | |
d17811fd | 12069 | return true; |
1fb3244a MM |
12070 | /* So are member templates of dependent classes. */ |
12071 | if (TYPE_P (CP_DECL_CONTEXT (tmpl))) | |
12072 | return dependent_type_p (DECL_CONTEXT (tmpl)); | |
12073 | return false; | |
12074 | } | |
12075 | ||
d17811fd MM |
12076 | /* Returns TRUE if the specialization TMPL<ARGS> is dependent. */ |
12077 | ||
12078 | bool | |
12079 | dependent_template_id_p (tree tmpl, tree args) | |
12080 | { | |
12081 | return (dependent_template_p (tmpl) | |
12082 | || any_dependent_template_arguments_p (args)); | |
12083 | } | |
12084 | ||
14d22dd6 MM |
12085 | /* TYPE is a TYPENAME_TYPE. Returns the ordinary TYPE to which the |
12086 | TYPENAME_TYPE corresponds. Returns ERROR_MARK_NODE if no such TYPE | |
12087 | can be found. Note that this function peers inside uninstantiated | |
12088 | templates and therefore should be used only in extremely limited | |
12089 | situations. */ | |
12090 | ||
12091 | tree | |
12092 | resolve_typename_type (tree type, bool only_current_p) | |
12093 | { | |
12094 | tree scope; | |
12095 | tree name; | |
12096 | tree decl; | |
12097 | int quals; | |
91b004e5 | 12098 | bool pop_p; |
14d22dd6 MM |
12099 | |
12100 | my_friendly_assert (TREE_CODE (type) == TYPENAME_TYPE, | |
12101 | 20010702); | |
12102 | ||
12103 | scope = TYPE_CONTEXT (type); | |
12104 | name = TYPE_IDENTIFIER (type); | |
12105 | ||
12106 | /* If the SCOPE is itself a TYPENAME_TYPE, then we need to resolve | |
12107 | it first before we can figure out what NAME refers to. */ | |
12108 | if (TREE_CODE (scope) == TYPENAME_TYPE) | |
12109 | scope = resolve_typename_type (scope, only_current_p); | |
12110 | /* If we don't know what SCOPE refers to, then we cannot resolve the | |
12111 | TYPENAME_TYPE. */ | |
12112 | if (scope == error_mark_node || TREE_CODE (scope) == TYPENAME_TYPE) | |
12113 | return error_mark_node; | |
12114 | /* If the SCOPE is a template type parameter, we have no way of | |
12115 | resolving the name. */ | |
12116 | if (TREE_CODE (scope) == TEMPLATE_TYPE_PARM) | |
12117 | return type; | |
12118 | /* If the SCOPE is not the current instantiation, there's no reason | |
12119 | to look inside it. */ | |
12120 | if (only_current_p && !currently_open_class (scope)) | |
12121 | return error_mark_node; | |
ca099ac8 MM |
12122 | /* If SCOPE is a partial instantiation, it will not have a valid |
12123 | TYPE_FIELDS list, so use the original template. */ | |
353b4fc0 | 12124 | scope = CLASSTYPE_PRIMARY_TEMPLATE_TYPE (scope); |
14d22dd6 MM |
12125 | /* Enter the SCOPE so that name lookup will be resolved as if we |
12126 | were in the class definition. In particular, SCOPE will no | |
12127 | longer be considered a dependent type. */ | |
91b004e5 | 12128 | pop_p = push_scope (scope); |
14d22dd6 | 12129 | /* Look up the declaration. */ |
86ac0575 | 12130 | decl = lookup_member (scope, name, /*protect=*/0, /*want_type=*/true); |
14d22dd6 MM |
12131 | /* Obtain the set of qualifiers applied to the TYPE. */ |
12132 | quals = cp_type_quals (type); | |
12133 | /* For a TYPENAME_TYPE like "typename X::template Y<T>", we want to | |
12134 | find a TEMPLATE_DECL. Otherwise, we want to find a TYPE_DECL. */ | |
12135 | if (!decl) | |
12136 | type = error_mark_node; | |
12137 | else if (TREE_CODE (TYPENAME_TYPE_FULLNAME (type)) == IDENTIFIER_NODE | |
12138 | && TREE_CODE (decl) == TYPE_DECL) | |
12139 | type = TREE_TYPE (decl); | |
12140 | else if (TREE_CODE (TYPENAME_TYPE_FULLNAME (type)) == TEMPLATE_ID_EXPR | |
12141 | && DECL_CLASS_TEMPLATE_P (decl)) | |
12142 | { | |
12143 | tree tmpl; | |
12144 | tree args; | |
12145 | /* Obtain the template and the arguments. */ | |
12146 | tmpl = TREE_OPERAND (TYPENAME_TYPE_FULLNAME (type), 0); | |
12147 | args = TREE_OPERAND (TYPENAME_TYPE_FULLNAME (type), 1); | |
12148 | /* Instantiate the template. */ | |
12149 | type = lookup_template_class (tmpl, args, NULL_TREE, NULL_TREE, | |
42eaed49 | 12150 | /*entering_scope=*/0, tf_error | tf_user); |
14d22dd6 MM |
12151 | } |
12152 | else | |
12153 | type = error_mark_node; | |
12154 | /* Qualify the resulting type. */ | |
12155 | if (type != error_mark_node && quals) | |
12156 | type = cp_build_qualified_type (type, quals); | |
12157 | /* Leave the SCOPE. */ | |
91b004e5 MM |
12158 | if (pop_p) |
12159 | pop_scope (scope); | |
14d22dd6 MM |
12160 | |
12161 | return type; | |
12162 | } | |
12163 | ||
d17811fd MM |
12164 | /* EXPR is an expression which is not type-dependent. Return a proxy |
12165 | for EXPR that can be used to compute the types of larger | |
12166 | expressions containing EXPR. */ | |
12167 | ||
12168 | tree | |
12169 | build_non_dependent_expr (tree expr) | |
12170 | { | |
0deb916c MM |
12171 | tree inner_expr; |
12172 | ||
d17811fd MM |
12173 | /* Preserve null pointer constants so that the type of things like |
12174 | "p == 0" where "p" is a pointer can be determined. */ | |
12175 | if (null_ptr_cst_p (expr)) | |
12176 | return expr; | |
12177 | /* Preserve OVERLOADs; the functions must be available to resolve | |
12178 | types. */ | |
0deb916c MM |
12179 | inner_expr = (TREE_CODE (expr) == ADDR_EXPR ? |
12180 | TREE_OPERAND (expr, 0) : expr); | |
12181 | if (TREE_CODE (inner_expr) == OVERLOAD | |
12182 | || TREE_CODE (inner_expr) == FUNCTION_DECL | |
12183 | || TREE_CODE (inner_expr) == TEMPLATE_DECL | |
12184 | || TREE_CODE (inner_expr) == TEMPLATE_ID_EXPR) | |
d17811fd | 12185 | return expr; |
7433e6d4 MM |
12186 | /* Preserve string constants; conversions from string constants to |
12187 | "char *" are allowed, even though normally a "const char *" | |
12188 | cannot be used to initialize a "char *". */ | |
12189 | if (TREE_CODE (expr) == STRING_CST) | |
12190 | return expr; | |
b7c707d1 MM |
12191 | /* Preserve arithmetic constants, as an optimization -- there is no |
12192 | reason to create a new node. */ | |
12193 | if (TREE_CODE (expr) == INTEGER_CST || TREE_CODE (expr) == REAL_CST) | |
12194 | return expr; | |
9b7be7b5 MM |
12195 | /* Preserve THROW_EXPRs -- all throw-expressions have type "void". |
12196 | There is at least one place where we want to know that a | |
12197 | particular expression is a throw-expression: when checking a ?: | |
12198 | expression, there are special rules if the second or third | |
878cbb73 | 12199 | argument is a throw-expression. */ |
9b7be7b5 MM |
12200 | if (TREE_CODE (expr) == THROW_EXPR) |
12201 | return expr; | |
47d4c811 NS |
12202 | |
12203 | if (TREE_CODE (expr) == COND_EXPR) | |
f293ce4b RS |
12204 | return build3 (COND_EXPR, |
12205 | TREE_TYPE (expr), | |
12206 | TREE_OPERAND (expr, 0), | |
12207 | (TREE_OPERAND (expr, 1) | |
12208 | ? build_non_dependent_expr (TREE_OPERAND (expr, 1)) | |
12209 | : build_non_dependent_expr (TREE_OPERAND (expr, 0))), | |
12210 | build_non_dependent_expr (TREE_OPERAND (expr, 2))); | |
8e1daa34 NS |
12211 | if (TREE_CODE (expr) == COMPOUND_EXPR |
12212 | && !COMPOUND_EXPR_OVERLOADED (expr)) | |
f293ce4b RS |
12213 | return build2 (COMPOUND_EXPR, |
12214 | TREE_TYPE (expr), | |
12215 | TREE_OPERAND (expr, 0), | |
12216 | build_non_dependent_expr (TREE_OPERAND (expr, 1))); | |
47d4c811 | 12217 | |
d17811fd MM |
12218 | /* Otherwise, build a NON_DEPENDENT_EXPR. |
12219 | ||
12220 | REFERENCE_TYPEs are not stripped for expressions in templates | |
12221 | because doing so would play havoc with mangling. Consider, for | |
12222 | example: | |
12223 | ||
12224 | template <typename T> void f<T& g>() { g(); } | |
12225 | ||
12226 | In the body of "f", the expression for "g" will have | |
12227 | REFERENCE_TYPE, even though the standard says that it should | |
12228 | not. The reason is that we must preserve the syntactic form of | |
12229 | the expression so that mangling (say) "f<g>" inside the body of | |
12230 | "f" works out correctly. Therefore, the REFERENCE_TYPE is | |
12231 | stripped here. */ | |
018a5803 | 12232 | return build1 (NON_DEPENDENT_EXPR, non_reference (TREE_TYPE (expr)), expr); |
d17811fd MM |
12233 | } |
12234 | ||
12235 | /* ARGS is a TREE_LIST of expressions as arguments to a function call. | |
12236 | Return a new TREE_LIST with the various arguments replaced with | |
12237 | equivalent non-dependent expressions. */ | |
12238 | ||
12239 | tree | |
12240 | build_non_dependent_args (tree args) | |
12241 | { | |
12242 | tree a; | |
12243 | tree new_args; | |
12244 | ||
12245 | new_args = NULL_TREE; | |
12246 | for (a = args; a; a = TREE_CHAIN (a)) | |
12247 | new_args = tree_cons (NULL_TREE, | |
12248 | build_non_dependent_expr (TREE_VALUE (a)), | |
12249 | new_args); | |
12250 | return nreverse (new_args); | |
12251 | } | |
12252 | ||
e2500fed | 12253 | #include "gt-cp-pt.h" |