]>
Commit | Line | Data |
---|---|---|
3fd5abcf | 1 | /* Process declarations and variables for C++ compiler. |
d363e7bf | 2 | Copyright (C) 1988, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000, |
6ad86a5b | 3 | 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010 |
1ea193c2 | 4 | Free Software Foundation, Inc. |
e5e809f4 | 5 | Contributed by Michael Tiemann (tiemann@cygnus.com) |
8d08fdba | 6 | |
1c313945 | 7 | This file is part of GCC. |
8d08fdba | 8 | |
1c313945 | 9 | GCC is free software; you can redistribute it and/or modify |
8d08fdba | 10 | it under the terms of the GNU General Public License as published by |
e77f031d | 11 | the Free Software Foundation; either version 3, or (at your option) |
8d08fdba MS |
12 | any later version. |
13 | ||
1c313945 | 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 | |
e77f031d NC |
20 | along with GCC; see the file COPYING3. If not see |
21 | <http://www.gnu.org/licenses/>. */ | |
8d08fdba MS |
22 | |
23 | ||
1c313945 | 24 | /* Process declarations and symbol lookup for C++ front end. |
8d08fdba MS |
25 | Also constructs types; the standard scalar types at initialization, |
26 | and structure, union, array and enum types when they are declared. */ | |
27 | ||
28 | /* ??? not all decl nodes are given the most useful possible | |
29 | line numbers. For example, the CONST_DECLs for enum values. */ | |
30 | ||
8d08fdba | 31 | #include "config.h" |
8d052bc7 | 32 | #include "system.h" |
4977bab6 ZW |
33 | #include "coretypes.h" |
34 | #include "tm.h" | |
8d08fdba | 35 | #include "tree.h" |
8d08fdba MS |
36 | #include "flags.h" |
37 | #include "cp-tree.h" | |
f4ce02c5 | 38 | #include "tree-iterator.h" |
25af8512 | 39 | #include "tree-inline.h" |
8d08fdba | 40 | #include "decl.h" |
4cd5a50a | 41 | #include "intl.h" |
49c249e1 JM |
42 | #include "output.h" |
43 | #include "except.h" | |
54f92bfb | 44 | #include "toplev.h" |
e2500fed | 45 | #include "hashtab.h" |
0e9295cf | 46 | #include "tm_p.h" |
672a6f42 | 47 | #include "target.h" |
39dabefd SB |
48 | #include "c-family/c-common.h" |
49 | #include "c-family/c-pragma.h" | |
7437519c | 50 | #include "diagnostic.h" |
e7c41c99 | 51 | #include "intl.h" |
e2500fed | 52 | #include "debug.h" |
22ffcc6f | 53 | #include "timevar.h" |
6de9cd9a | 54 | #include "tree-flow.h" |
0d83bf5a | 55 | #include "pointer-set.h" |
245763e3 | 56 | #include "splay-tree.h" |
68a607d8 | 57 | #include "plugin.h" |
8d08fdba | 58 | |
b344d949 | 59 | static tree grokparms (tree parmlist, tree *); |
11f6b451 NN |
60 | static const char *redeclaration_error_message (tree, tree); |
61 | ||
11f6b451 | 62 | static int decl_jump_unsafe (tree); |
11f6b451 NN |
63 | static void require_complete_types_for_parms (tree); |
64 | static int ambi_op_p (enum tree_code); | |
65 | static int unary_op_p (enum tree_code); | |
11f6b451 | 66 | static void push_local_name (tree); |
7e99327d | 67 | static tree grok_reference_init (tree, tree, tree, tree *); |
caf93cb0 | 68 | static tree grokvardecl (tree, tree, const cp_decl_specifier_seq *, |
1ff3c076 | 69 | int, int, tree); |
11f6b451 | 70 | static void record_unknown_type (tree, const char *); |
5779e713 | 71 | static tree builtin_function_1 (tree, tree, bool); |
11f6b451 NN |
72 | static tree build_library_fn_1 (tree, enum tree_code, tree); |
73 | static int member_function_or_else (tree, tree, enum overload_flags); | |
74 | static void bad_specifiers (tree, const char *, int, int, int, int, | |
75 | int); | |
11f6b451 NN |
76 | static void check_for_uninitialized_const_var (tree); |
77 | static hashval_t typename_hash (const void *); | |
78 | static int typename_compare (const void *, const void *); | |
11f6b451 | 79 | static tree local_variable_p_walkfn (tree *, int *, void *); |
11f6b451 | 80 | static tree record_builtin_java_type (const char *, int); |
461c6fce | 81 | static const char *tag_name (enum tag_types); |
29ef83de | 82 | static tree lookup_and_check_tag (enum tag_types, tree, tag_scope, bool); |
11f6b451 | 83 | static int walk_namespaces_r (tree, walk_namespaces_fn, void *); |
11f6b451 NN |
84 | static void maybe_deduce_size_from_array_init (tree, tree); |
85 | static void layout_var_decl (tree); | |
7e99327d | 86 | static tree check_initializer (tree, tree, int, tree *); |
11f6b451 NN |
87 | static void make_rtl_for_nonlocal_decl (tree, tree, const char *); |
88 | static void save_function_data (tree); | |
89 | static void check_function_type (tree, tree); | |
11f6b451 NN |
90 | static void finish_constructor_body (void); |
91 | static void begin_destructor_body (void); | |
92 | static void finish_destructor_body (void); | |
93 | static tree create_array_type_for_decl (tree, tree, tree); | |
94 | static tree get_atexit_node (void); | |
95 | static tree get_dso_handle_node (void); | |
96 | static tree start_cleanup_fn (void); | |
97 | static void end_cleanup_fn (void); | |
c2255bc4 | 98 | static tree cp_make_fname_decl (location_t, tree, int); |
11f6b451 | 99 | static void initialize_predefined_identifiers (void); |
caf93cb0 | 100 | static tree check_special_function_return_type |
11f6b451 NN |
101 | (special_function_kind, tree, tree); |
102 | static tree push_cp_library_fn (enum tree_code, tree); | |
103 | static tree build_cp_library_fn (tree, enum tree_code, tree); | |
104 | static void store_parm_decls (tree); | |
8e3df2de MM |
105 | static void initialize_local_var (tree, tree); |
106 | static void expand_static_init (tree, tree); | |
8d08fdba | 107 | |
7f4edbcb | 108 | /* The following symbols are subsumed in the cp_global_trees array, and |
68642fb6 | 109 | listed here individually for documentation purposes. |
8d08fdba | 110 | |
7f4edbcb BS |
111 | C++ extensions |
112 | tree wchar_decl_node; | |
37c46b43 | 113 | |
7f4edbcb BS |
114 | tree vtable_entry_type; |
115 | tree delta_type_node; | |
7f4edbcb | 116 | tree __t_desc_type_node; |
8d08fdba | 117 | |
9e62871e | 118 | tree class_type_node; |
7f4edbcb | 119 | tree unknown_type_node; |
8d08fdba | 120 | |
7f4edbcb | 121 | Array type `vtable_entry_type[]' |
8d08fdba | 122 | |
7f4edbcb BS |
123 | tree vtbl_type_node; |
124 | tree vtbl_ptr_type_node; | |
8d08fdba | 125 | |
2854d3c6 | 126 | Namespaces, |
8d08fdba | 127 | |
7f4edbcb | 128 | tree std_node; |
2854d3c6 | 129 | tree abi_node; |
8d08fdba | 130 | |
7f4edbcb BS |
131 | A FUNCTION_DECL which can call `abort'. Not necessarily the |
132 | one that the user will declare, but sufficient to be called | |
133 | by routines that want to abort the program. | |
8d08fdba | 134 | |
7f4edbcb | 135 | tree abort_fndecl; |
8d08fdba | 136 | |
7f4edbcb | 137 | The FUNCTION_DECL for the default `::operator delete'. |
2986ae00 | 138 | |
7f4edbcb | 139 | tree global_delete_fndecl; |
8d08fdba | 140 | |
7f4edbcb | 141 | Used by RTTI |
669ec2b4 | 142 | tree type_info_type_node, tinfo_decl_id, tinfo_decl_type; |
3db45ab5 | 143 | tree tinfo_var_id; */ |
8d08fdba | 144 | |
7f4edbcb | 145 | tree cp_global_trees[CPTI_MAX]; |
8d08fdba | 146 | |
2c73f9f5 | 147 | /* Indicates that there is a type value in some namespace, although |
7f4edbcb | 148 | that is not necessarily in scope at the moment. */ |
2c73f9f5 | 149 | |
00e8de68 | 150 | tree global_type_node; |
2c73f9f5 | 151 | |
82a2669e | 152 | /* The node that holds the "name" of the global scope. */ |
00e8de68 | 153 | tree global_scope_name; |
82a2669e | 154 | |
8e4ce833 JJ |
155 | #define local_names cp_function_chain->x_local_names |
156 | ||
8d08fdba MS |
157 | /* A list of objects which have constructors or destructors |
158 | which reside in the global scope. The decl is stored in | |
159 | the TREE_VALUE slot and the initializer is stored | |
160 | in the TREE_PURPOSE slot. */ | |
161 | tree static_aggregates; | |
162 | ||
8d08fdba MS |
163 | /* -- end of C++ */ |
164 | ||
81b3411c | 165 | /* A node for the integer constants 2, and 3. */ |
d11ad92e | 166 | |
81b3411c | 167 | tree integer_two_node, integer_three_node; |
8d08fdba | 168 | |
1799e5d5 RH |
169 | /* Used only for jumps to as-yet undefined labels, since jumps to |
170 | defined labels can have their validity checked immediately. */ | |
171 | ||
d1b38208 | 172 | struct GTY(()) named_label_use_entry { |
1799e5d5 RH |
173 | struct named_label_use_entry *next; |
174 | /* The binding level to which this entry is *currently* attached. | |
175 | This is initially the binding level in which the goto appeared, | |
176 | but is modified as scopes are closed. */ | |
177 | struct cp_binding_level *binding_level; | |
178 | /* The head of the names list that was current when the goto appeared, | |
179 | or the inner scope popped. These are the decls that will *not* be | |
180 | skipped when jumping to the label. */ | |
181 | tree names_in_scope; | |
182 | /* The location of the goto, for error reporting. */ | |
183 | location_t o_goto_locus; | |
184 | /* True if an OpenMP structured block scope has been closed since | |
185 | the goto appeared. This means that the branch from the label will | |
186 | illegally exit an OpenMP scope. */ | |
187 | bool in_omp_scope; | |
188 | }; | |
189 | ||
6625cdb5 JM |
190 | /* A list of all LABEL_DECLs in the function that have names. Here so |
191 | we can clear out their names' definitions at the end of the | |
192 | function, and so we can check the validity of jumps to these labels. */ | |
193 | ||
d1b38208 | 194 | struct GTY(()) named_label_entry { |
1799e5d5 RH |
195 | /* The decl itself. */ |
196 | tree label_decl; | |
197 | ||
198 | /* The binding level to which the label is *currently* attached. | |
199 | This is initially set to the binding level in which the label | |
200 | is defined, but is modified as scopes are closed. */ | |
e2500fed | 201 | struct cp_binding_level *binding_level; |
3db45ab5 | 202 | /* The head of the names list that was current when the label was |
1799e5d5 RH |
203 | defined, or the inner scope popped. These are the decls that will |
204 | be skipped when jumping to the label. */ | |
6625cdb5 | 205 | tree names_in_scope; |
1799e5d5 RH |
206 | /* A tree list of all decls from all binding levels that would be |
207 | crossed by a backward branch to the label. */ | |
6625cdb5 | 208 | tree bad_decls; |
1799e5d5 RH |
209 | |
210 | /* A list of uses of the label, before the label is defined. */ | |
211 | struct named_label_use_entry *uses; | |
212 | ||
213 | /* The following bits are set after the label is defined, and are | |
214 | updated as scopes are popped. They indicate that a backward jump | |
ddd0b831 | 215 | to the label will illegally enter a scope of the given flavor. */ |
1799e5d5 RH |
216 | bool in_try_scope; |
217 | bool in_catch_scope; | |
218 | bool in_omp_scope; | |
6625cdb5 | 219 | }; |
8d08fdba | 220 | |
4519c0a8 | 221 | #define named_labels cp_function_chain->x_named_labels |
8d08fdba | 222 | \f |
b2244c65 MM |
223 | /* The number of function bodies which we are currently processing. |
224 | (Zero if we are at namespace scope, one inside the body of a | |
225 | function, two inside the body of a function in a local class, etc.) */ | |
226 | int function_depth; | |
e23bd218 | 227 | |
3368cdd3 JJ |
228 | /* To avoid unwanted recursion, finish_function defers all mark_used calls |
229 | encountered during its execution until it finishes. */ | |
230 | bool defer_mark_used_calls; | |
231 | VEC(tree, gc) *deferred_mark_used_calls; | |
232 | ||
e23bd218 IR |
233 | /* States indicating how grokdeclarator() should handle declspecs marked |
234 | with __attribute__((deprecated)). An object declared as | |
235 | __attribute__((deprecated)) suppresses warnings of uses of other | |
236 | deprecated items. */ | |
b344d949 | 237 | enum deprecated_states deprecated_state = DEPRECATED_NORMAL; |
e23bd218 | 238 | |
8d08fdba | 239 | \f |
0154eaa8 MM |
240 | /* A TREE_LIST of VAR_DECLs. The TREE_PURPOSE is a RECORD_TYPE or |
241 | UNION_TYPE; the TREE_VALUE is a VAR_DECL with that type. At the | |
242 | time the VAR_DECL was declared, the type was incomplete. */ | |
243 | ||
e2500fed | 244 | static GTY(()) tree incomplete_vars; |
8d08fdba | 245 | \f |
74b846e0 MM |
246 | /* Returns the kind of template specialization we are currently |
247 | processing, given that it's declaration contained N_CLASS_SCOPES | |
248 | explicit scope qualifications. */ | |
249 | ||
250 | tmpl_spec_kind | |
11f6b451 | 251 | current_tmpl_spec_kind (int n_class_scopes) |
74b846e0 MM |
252 | { |
253 | int n_template_parm_scopes = 0; | |
254 | int seen_specialization_p = 0; | |
255 | int innermost_specialization_p = 0; | |
e2500fed | 256 | struct cp_binding_level *b; |
74b846e0 MM |
257 | |
258 | /* Scan through the template parameter scopes. */ | |
caf93cb0 EC |
259 | for (b = current_binding_level; |
260 | b->kind == sk_template_parms; | |
a7e8c268 | 261 | b = b->level_chain) |
74b846e0 MM |
262 | { |
263 | /* If we see a specialization scope inside a parameter scope, | |
264 | then something is wrong. That corresponds to a declaration | |
265 | like: | |
266 | ||
267 | template <class T> template <> ... | |
268 | ||
0e339752 | 269 | which is always invalid since [temp.expl.spec] forbids the |
74b846e0 MM |
270 | specialization of a class member template if the enclosing |
271 | class templates are not explicitly specialized as well. */ | |
a7e8c268 | 272 | if (b->explicit_spec_p) |
74b846e0 MM |
273 | { |
274 | if (n_template_parm_scopes == 0) | |
275 | innermost_specialization_p = 1; | |
276 | else | |
277 | seen_specialization_p = 1; | |
278 | } | |
279 | else if (seen_specialization_p == 1) | |
280 | return tsk_invalid_member_spec; | |
281 | ||
282 | ++n_template_parm_scopes; | |
283 | } | |
284 | ||
285 | /* Handle explicit instantiations. */ | |
286 | if (processing_explicit_instantiation) | |
287 | { | |
288 | if (n_template_parm_scopes != 0) | |
289 | /* We've seen a template parameter list during an explicit | |
290 | instantiation. For example: | |
291 | ||
292 | template <class T> template void f(int); | |
293 | ||
294 | This is erroneous. */ | |
295 | return tsk_invalid_expl_inst; | |
296 | else | |
297 | return tsk_expl_inst; | |
298 | } | |
299 | ||
300 | if (n_template_parm_scopes < n_class_scopes) | |
301 | /* We've not seen enough template headers to match all the | |
302 | specialized classes present. For example: | |
303 | ||
0cbd7506 | 304 | template <class T> void R<T>::S<T>::f(int); |
74b846e0 | 305 | |
0e339752 | 306 | This is invalid; there needs to be one set of template |
74b846e0 MM |
307 | parameters for each class. */ |
308 | return tsk_insufficient_parms; | |
309 | else if (n_template_parm_scopes == n_class_scopes) | |
310 | /* We're processing a non-template declaration (even though it may | |
311 | be a member of a template class.) For example: | |
312 | ||
0cbd7506 | 313 | template <class T> void S<T>::f(int); |
74b846e0 | 314 | |
39a13be5 | 315 | The `class T' matches the `S<T>', leaving no template headers |
74b846e0 MM |
316 | corresponding to the `f'. */ |
317 | return tsk_none; | |
318 | else if (n_template_parm_scopes > n_class_scopes + 1) | |
319 | /* We've got too many template headers. For example: | |
320 | ||
0cbd7506 | 321 | template <> template <class T> void f (T); |
74b846e0 MM |
322 | |
323 | There need to be more enclosing classes. */ | |
324 | return tsk_excessive_parms; | |
325 | else | |
326 | /* This must be a template. It's of the form: | |
327 | ||
0cbd7506 | 328 | template <class T> template <class U> void S<T>::f(U); |
74b846e0 MM |
329 | |
330 | This is a specialization if the innermost level was a | |
331 | specialization; otherwise it's just a definition of the | |
332 | template. */ | |
333 | return innermost_specialization_p ? tsk_expl_spec : tsk_template; | |
8d08fdba MS |
334 | } |
335 | ||
74b846e0 MM |
336 | /* Exit the current scope. */ |
337 | ||
338 | void | |
11f6b451 | 339 | finish_scope (void) |
74b846e0 MM |
340 | { |
341 | poplevel (0, 0, 0); | |
342 | } | |
343 | ||
acef433b MM |
344 | /* When a label goes out of scope, check to see if that label was used |
345 | in a valid manner, and issue any appropriate warnings or errors. */ | |
346 | ||
347 | static void | |
11f6b451 | 348 | pop_label (tree label, tree old_value) |
acef433b | 349 | { |
a7e8c268 | 350 | if (!processing_template_decl) |
acef433b | 351 | { |
88848bde MM |
352 | if (DECL_INITIAL (label) == NULL_TREE) |
353 | { | |
5b030314 NS |
354 | location_t location; |
355 | ||
dee15844 | 356 | error ("label %q+D used but not defined", label); |
93409b8c | 357 | location = input_location; /* FIXME want (input_filename, (line)0) */ |
88848bde | 358 | /* Avoid crashing later. */ |
5b030314 | 359 | define_label (location, DECL_NAME (label)); |
88848bde | 360 | } |
c616e51b MLI |
361 | else |
362 | warn_for_unused_label (label); | |
acef433b | 363 | } |
acef433b | 364 | |
6625cdb5 | 365 | SET_IDENTIFIER_LABEL_VALUE (DECL_NAME (label), old_value); |
acef433b MM |
366 | } |
367 | ||
0811ea8f | 368 | /* At the end of a function, all labels declared within the function |
68642fb6 | 369 | go out of scope. BLOCK is the top-level block for the |
acef433b MM |
370 | function. */ |
371 | ||
1799e5d5 RH |
372 | static int |
373 | pop_labels_1 (void **slot, void *data) | |
374 | { | |
375 | struct named_label_entry *ent = (struct named_label_entry *) *slot; | |
376 | tree block = (tree) data; | |
377 | ||
378 | pop_label (ent->label_decl, NULL_TREE); | |
379 | ||
380 | /* Put the labels into the "variables" of the top-level block, | |
381 | so debugger can see them. */ | |
382 | TREE_CHAIN (ent->label_decl) = BLOCK_VARS (block); | |
383 | BLOCK_VARS (block) = ent->label_decl; | |
384 | ||
385 | htab_clear_slot (named_labels, slot); | |
386 | ||
387 | return 1; | |
388 | } | |
389 | ||
acef433b | 390 | static void |
11f6b451 | 391 | pop_labels (tree block) |
acef433b | 392 | { |
1799e5d5 | 393 | if (named_labels) |
acef433b | 394 | { |
1799e5d5 RH |
395 | htab_traverse (named_labels, pop_labels_1, block); |
396 | named_labels = NULL; | |
acef433b | 397 | } |
1799e5d5 RH |
398 | } |
399 | ||
400 | /* At the end of a block with local labels, restore the outer definition. */ | |
acef433b | 401 | |
1799e5d5 RH |
402 | static void |
403 | pop_local_label (tree label, tree old_value) | |
404 | { | |
405 | struct named_label_entry dummy; | |
406 | void **slot; | |
407 | ||
408 | pop_label (label, old_value); | |
409 | ||
410 | dummy.label_decl = label; | |
411 | slot = htab_find_slot (named_labels, &dummy, NO_INSERT); | |
412 | htab_clear_slot (named_labels, slot); | |
acef433b MM |
413 | } |
414 | ||
80aa8340 ZL |
415 | /* The following two routines are used to interface to Objective-C++. |
416 | The binding level is purposely treated as an opaque type. */ | |
417 | ||
418 | void * | |
419 | objc_get_current_scope (void) | |
420 | { | |
421 | return current_binding_level; | |
422 | } | |
423 | ||
424 | /* The following routine is used by the NeXT-style SJLJ exceptions; | |
425 | variables get marked 'volatile' so as to not be clobbered by | |
f749f3c2 ZL |
426 | _setjmp()/_longjmp() calls. All variables in the current scope, |
427 | as well as parent scopes up to (but not including) ENCLOSING_BLK | |
428 | shall be thusly marked. */ | |
80aa8340 ZL |
429 | |
430 | void | |
431 | objc_mark_locals_volatile (void *enclosing_blk) | |
432 | { | |
433 | struct cp_binding_level *scope; | |
434 | ||
435 | for (scope = current_binding_level; | |
e58a9aa1 | 436 | scope && scope != enclosing_blk; |
80aa8340 ZL |
437 | scope = scope->level_chain) |
438 | { | |
439 | tree decl; | |
440 | ||
441 | for (decl = scope->names; decl; decl = TREE_CHAIN (decl)) | |
660845bf | 442 | objc_volatilize_decl (decl); |
e58a9aa1 ZL |
443 | |
444 | /* Do not climb up past the current function. */ | |
445 | if (scope->kind == sk_function_parms) | |
446 | break; | |
80aa8340 ZL |
447 | } |
448 | } | |
449 | ||
1799e5d5 RH |
450 | /* Update data for defined and undefined labels when leaving a scope. */ |
451 | ||
452 | static int | |
453 | poplevel_named_label_1 (void **slot, void *data) | |
454 | { | |
455 | struct named_label_entry *ent = (struct named_label_entry *) *slot; | |
456 | struct cp_binding_level *bl = (struct cp_binding_level *) data; | |
457 | struct cp_binding_level *obl = bl->level_chain; | |
458 | ||
459 | if (ent->binding_level == bl) | |
460 | { | |
461 | tree decl; | |
462 | ||
463 | for (decl = ent->names_in_scope; decl; decl = TREE_CHAIN (decl)) | |
464 | if (decl_jump_unsafe (decl)) | |
465 | ent->bad_decls = tree_cons (NULL, decl, ent->bad_decls); | |
466 | ||
467 | ent->binding_level = obl; | |
468 | ent->names_in_scope = obl->names; | |
469 | switch (bl->kind) | |
470 | { | |
471 | case sk_try: | |
472 | ent->in_try_scope = true; | |
473 | break; | |
474 | case sk_catch: | |
475 | ent->in_catch_scope = true; | |
476 | break; | |
477 | case sk_omp: | |
478 | ent->in_omp_scope = true; | |
479 | break; | |
480 | default: | |
481 | break; | |
482 | } | |
483 | } | |
484 | else if (ent->uses) | |
485 | { | |
486 | struct named_label_use_entry *use; | |
487 | ||
488 | for (use = ent->uses; use ; use = use->next) | |
489 | if (use->binding_level == bl) | |
490 | { | |
491 | use->binding_level = obl; | |
492 | use->names_in_scope = obl->names; | |
493 | if (bl->kind == sk_omp) | |
494 | use->in_omp_scope = true; | |
495 | } | |
496 | } | |
497 | ||
498 | return 1; | |
499 | } | |
500 | ||
03a904b5 JJ |
501 | /* Saved errorcount to avoid -Wunused-but-set-{parameter,variable} warnings |
502 | when errors were reported, except for -Werror-unused-but-set-*. */ | |
503 | static int unused_but_set_errorcount; | |
504 | ||
8d08fdba MS |
505 | /* Exit a binding level. |
506 | Pop the level off, and restore the state of the identifier-decl mappings | |
507 | that were in effect when this level was entered. | |
508 | ||
509 | If KEEP == 1, this level had explicit declarations, so | |
510 | and create a "block" (a BLOCK node) for the level | |
511 | to record its declarations and subblocks for symbol table output. | |
512 | ||
8d08fdba MS |
513 | If FUNCTIONBODY is nonzero, this level is the body of a function, |
514 | so create a block as if KEEP were set and also clear out all | |
515 | label names. | |
516 | ||
517 | If REVERSE is nonzero, reverse the order of decls before putting | |
518 | them into the BLOCK. */ | |
519 | ||
520 | tree | |
11f6b451 | 521 | poplevel (int keep, int reverse, int functionbody) |
8d08fdba | 522 | { |
926ce8bd | 523 | tree link; |
8d08fdba MS |
524 | /* The chain of decls was accumulated in reverse order. |
525 | Put it into forward order, just for cleanliness. */ | |
526 | tree decls; | |
b35d4555 | 527 | tree subblocks; |
325c3691 | 528 | tree block; |
8d08fdba | 529 | tree decl; |
f181d4ae | 530 | int leaving_for_scope; |
ac20c67a | 531 | scope_kind kind; |
f181d4ae | 532 | |
22ffcc6f | 533 | timevar_push (TV_NAME_LOOKUP); |
325c3691 RH |
534 | restart: |
535 | ||
536 | block = NULL_TREE; | |
b35d4555 | 537 | |
50bc768d | 538 | gcc_assert (current_binding_level->kind != sk_class); |
b74a0560 | 539 | |
db80e34e JJ |
540 | if (current_binding_level->kind == sk_cleanup) |
541 | functionbody = 0; | |
b35d4555 MM |
542 | subblocks = functionbody >= 0 ? current_binding_level->blocks : 0; |
543 | ||
50bc768d NS |
544 | gcc_assert (!VEC_length(cp_class_binding, |
545 | current_binding_level->class_shadowed)); | |
8d08fdba | 546 | |
536333d4 MM |
547 | /* We used to use KEEP == 2 to indicate that the new block should go |
548 | at the beginning of the list of blocks at this binding level, | |
549 | rather than the end. This hack is no longer used. */ | |
50bc768d | 550 | gcc_assert (keep == 0 || keep == 1); |
536333d4 | 551 | |
ac20c67a | 552 | if (current_binding_level->keep) |
8d08fdba MS |
553 | keep = 1; |
554 | ||
6625cdb5 JM |
555 | /* Any uses of undefined labels, and any defined labels, now operate |
556 | under constraints of next binding contour. */ | |
1799e5d5 RH |
557 | if (cfun && !functionbody && named_labels) |
558 | htab_traverse (named_labels, poplevel_named_label_1, | |
559 | current_binding_level); | |
6625cdb5 | 560 | |
8d08fdba MS |
561 | /* Get the decls in the order they were written. |
562 | Usually current_binding_level->names is in reverse order. | |
563 | But parameter decls were previously put in forward order. */ | |
564 | ||
565 | if (reverse) | |
566 | current_binding_level->names | |
567 | = decls = nreverse (current_binding_level->names); | |
568 | else | |
569 | decls = current_binding_level->names; | |
570 | ||
8d08fdba MS |
571 | /* If there were any declarations or structure tags in that level, |
572 | or if this level is a function body, | |
573 | create a BLOCK to record them for the life of this function. */ | |
8d08fdba | 574 | block = NULL_TREE; |
f444e36b | 575 | if (keep == 1 || functionbody) |
8d08fdba MS |
576 | block = make_node (BLOCK); |
577 | if (block != NULL_TREE) | |
578 | { | |
f444e36b MM |
579 | BLOCK_VARS (block) = decls; |
580 | BLOCK_SUBBLOCKS (block) = subblocks; | |
8d08fdba MS |
581 | } |
582 | ||
583 | /* In each subblock, record that this is its superior. */ | |
8d08fdba | 584 | if (keep >= 0) |
87caf699 | 585 | for (link = subblocks; link; link = BLOCK_CHAIN (link)) |
8d08fdba MS |
586 | BLOCK_SUPERCONTEXT (link) = block; |
587 | ||
f181d4ae MM |
588 | /* We still support the old for-scope rules, whereby the variables |
589 | in a for-init statement were in scope after the for-statement | |
92bc1323 | 590 | ended. We only use the new rules if flag_new_for_scope is |
f181d4ae | 591 | nonzero. */ |
68642fb6 | 592 | leaving_for_scope |
a7e8c268 | 593 | = current_binding_level->kind == sk_for && flag_new_for_scope == 1; |
f181d4ae | 594 | |
caf93cb0 | 595 | /* Before we remove the declarations first check for unused variables. */ |
03a904b5 | 596 | if ((warn_unused_variable || warn_unused_but_set_variable) |
caf93cb0 EC |
597 | && !processing_template_decl) |
598 | for (decl = getdecls (); decl; decl = TREE_CHAIN (decl)) | |
599 | if (TREE_CODE (decl) == VAR_DECL | |
03a904b5 | 600 | && (! TREE_USED (decl) || !DECL_READ_P (decl)) |
caf93cb0 EC |
601 | && ! DECL_IN_SYSTEM_HEADER (decl) |
602 | && DECL_NAME (decl) && ! DECL_ARTIFICIAL (decl)) | |
03a904b5 JJ |
603 | { |
604 | if (! TREE_USED (decl)) | |
605 | warning (OPT_Wunused_variable, "unused variable %q+D", decl); | |
606 | else if (DECL_CONTEXT (decl) == current_function_decl | |
607 | && TREE_TYPE (decl) != error_mark_node | |
608 | && TREE_CODE (TREE_TYPE (decl)) != REFERENCE_TYPE | |
609 | && errorcount == unused_but_set_errorcount | |
610 | && (!CLASS_TYPE_P (TREE_TYPE (decl)) | |
611 | || !TYPE_HAS_NONTRIVIAL_DESTRUCTOR (TREE_TYPE (decl)))) | |
612 | { | |
613 | warning (OPT_Wunused_but_set_variable, | |
614 | "variable %q+D set but not used", decl); | |
615 | unused_but_set_errorcount = errorcount; | |
616 | } | |
617 | } | |
caf93cb0 | 618 | |
f181d4ae MM |
619 | /* Remove declarations for all the DECLs in this level. */ |
620 | for (link = decls; link; link = TREE_CHAIN (link)) | |
621 | { | |
c3783399 | 622 | if (leaving_for_scope && TREE_CODE (link) == VAR_DECL |
0cbd7506 | 623 | && DECL_NAME (link)) |
f181d4ae | 624 | { |
90ea9897 MM |
625 | tree name = DECL_NAME (link); |
626 | cxx_binding *ob; | |
f181d4ae MM |
627 | tree ns_binding; |
628 | ||
90ea9897 MM |
629 | ob = outer_binding (name, |
630 | IDENTIFIER_BINDING (name), | |
631 | /*class_p=*/true); | |
632 | if (!ob) | |
633 | ns_binding = IDENTIFIER_NAMESPACE_VALUE (name); | |
c7dda1e3 MM |
634 | else |
635 | ns_binding = NULL_TREE; | |
636 | ||
90ea9897 | 637 | if (ob && ob->scope == current_binding_level->level_chain) |
f181d4ae | 638 | /* We have something like: |
68642fb6 | 639 | |
0cbd7506 MS |
640 | int i; |
641 | for (int i; ;); | |
68642fb6 | 642 | |
f181d4ae MM |
643 | and we are leaving the `for' scope. There's no reason to |
644 | keep the binding of the inner `i' in this case. */ | |
90ea9897 MM |
645 | pop_binding (name, link); |
646 | else if ((ob && (TREE_CODE (ob->value) == TYPE_DECL)) | |
147135cc | 647 | || (ns_binding && TREE_CODE (ns_binding) == TYPE_DECL)) |
f181d4ae MM |
648 | /* Here, we have something like: |
649 | ||
650 | typedef int I; | |
651 | ||
652 | void f () { | |
653 | for (int I; ;); | |
654 | } | |
655 | ||
656 | We must pop the for-scope binding so we know what's a | |
657 | type and what isn't. */ | |
90ea9897 | 658 | pop_binding (name, link); |
e76a2646 | 659 | else |
e76a2646 | 660 | { |
f181d4ae MM |
661 | /* Mark this VAR_DECL as dead so that we can tell we left it |
662 | there only for backward compatibility. */ | |
663 | DECL_DEAD_FOR_LOCAL (link) = 1; | |
68642fb6 | 664 | |
517f3315 | 665 | /* Keep track of what should have happened when we |
f181d4ae | 666 | popped the binding. */ |
90ea9897 | 667 | if (ob && ob->value) |
820cc88f DB |
668 | { |
669 | SET_DECL_SHADOWED_FOR_VAR (link, ob->value); | |
670 | DECL_HAS_SHADOWED_FOR_VAR_P (link) = 1; | |
671 | } | |
f181d4ae MM |
672 | |
673 | /* Add it to the list of dead variables in the next | |
674 | outermost binding to that we can remove these when we | |
675 | leave that binding. */ | |
676 | current_binding_level->level_chain->dead_vars_from_for | |
677 | = tree_cons (NULL_TREE, link, | |
678 | current_binding_level->level_chain-> | |
679 | dead_vars_from_for); | |
680 | ||
af6fd53f | 681 | /* Although we don't pop the cxx_binding, we do clear |
147135cc | 682 | its SCOPE since the scope is going away now. */ |
caf93cb0 | 683 | IDENTIFIER_BINDING (name)->scope |
90ea9897 | 684 | = current_binding_level->level_chain; |
e76a2646 | 685 | } |
2ee887f2 | 686 | } |
68642fb6 | 687 | else |
8d6e462b | 688 | { |
8dc2b103 | 689 | tree name; |
c8094d83 | 690 | |
f181d4ae | 691 | /* Remove the binding. */ |
0034cf72 | 692 | decl = link; |
caf93cb0 | 693 | |
0034cf72 JM |
694 | if (TREE_CODE (decl) == TREE_LIST) |
695 | decl = TREE_VALUE (decl); | |
8dc2b103 | 696 | name = decl; |
c8094d83 | 697 | |
8dc2b103 NS |
698 | if (TREE_CODE (name) == OVERLOAD) |
699 | name = OVL_FUNCTION (name); | |
caf93cb0 | 700 | |
8dc2b103 NS |
701 | gcc_assert (DECL_P (name)); |
702 | pop_binding (DECL_NAME (name), decl); | |
8d08fdba | 703 | } |
f181d4ae | 704 | } |
8d08fdba | 705 | |
f181d4ae MM |
706 | /* Remove declarations for any `for' variables from inner scopes |
707 | that we kept around. */ | |
708 | for (link = current_binding_level->dead_vars_from_for; | |
709 | link; link = TREE_CHAIN (link)) | |
d8f8dca1 | 710 | pop_binding (DECL_NAME (TREE_VALUE (link)), TREE_VALUE (link)); |
2ee887f2 | 711 | |
f181d4ae MM |
712 | /* Restore the IDENTIFIER_TYPE_VALUEs. */ |
713 | for (link = current_binding_level->type_shadowed; | |
714 | link; link = TREE_CHAIN (link)) | |
715 | SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (link), TREE_VALUE (link)); | |
acef433b MM |
716 | |
717 | /* Restore the IDENTIFIER_LABEL_VALUEs for local labels. */ | |
718 | for (link = current_binding_level->shadowed_labels; | |
68642fb6 | 719 | link; |
acef433b | 720 | link = TREE_CHAIN (link)) |
1799e5d5 | 721 | pop_local_label (TREE_VALUE (link), TREE_PURPOSE (link)); |
acef433b | 722 | |
f181d4ae MM |
723 | /* There may be OVERLOADs (wrapped in TREE_LISTs) on the BLOCK_VARs |
724 | list if a `using' declaration put them there. The debugging | |
3b426391 | 725 | back ends won't understand OVERLOAD, so we remove them here. |
f181d4ae MM |
726 | Because the BLOCK_VARS are (temporarily) shared with |
727 | CURRENT_BINDING_LEVEL->NAMES we must do this fixup after we have | |
728 | popped all the bindings. */ | |
729 | if (block) | |
730 | { | |
731 | tree* d; | |
8d6e462b | 732 | |
a06d48ef JM |
733 | for (d = &BLOCK_VARS (block); *d; ) |
734 | { | |
735 | if (TREE_CODE (*d) == TREE_LIST) | |
736 | *d = TREE_CHAIN (*d); | |
737 | else | |
738 | d = &TREE_CHAIN (*d); | |
739 | } | |
8d6e462b | 740 | } |
8d08fdba MS |
741 | |
742 | /* If the level being exited is the top level of a function, | |
743 | check over all the labels. */ | |
8d08fdba MS |
744 | if (functionbody) |
745 | { | |
acef433b MM |
746 | /* Since this is the top level block of a function, the vars are |
747 | the function's parameters. Don't leave them in the BLOCK | |
748 | because they are found in the FUNCTION_DECL instead. */ | |
8d08fdba | 749 | BLOCK_VARS (block) = 0; |
acef433b | 750 | pop_labels (block); |
8d08fdba MS |
751 | } |
752 | ||
ac20c67a | 753 | kind = current_binding_level->kind; |
325c3691 RH |
754 | if (kind == sk_cleanup) |
755 | { | |
756 | tree stmt; | |
757 | ||
758 | /* If this is a temporary binding created for a cleanup, then we'll | |
759 | have pushed a statement list level. Pop that, create a new | |
760 | BIND_EXPR for the block, and insert it into the stream. */ | |
761 | stmt = pop_stmt_list (current_binding_level->statement_list); | |
c2255bc4 | 762 | stmt = c_build_bind_expr (input_location, block, stmt); |
325c3691 RH |
763 | add_stmt (stmt); |
764 | } | |
8d08fdba | 765 | |
1a6daf15 | 766 | leave_scope (); |
8d08fdba | 767 | if (functionbody) |
72c4a4ca GK |
768 | { |
769 | /* The current function is being defined, so its DECL_INITIAL | |
770 | should be error_mark_node. */ | |
771 | gcc_assert (DECL_INITIAL (current_function_decl) == error_mark_node); | |
772 | DECL_INITIAL (current_function_decl) = block; | |
773 | } | |
8d08fdba | 774 | else if (block) |
f444e36b MM |
775 | current_binding_level->blocks |
776 | = chainon (current_binding_level->blocks, block); | |
777 | ||
8d08fdba MS |
778 | /* If we did not make a block for the level just exited, |
779 | any blocks made for inner levels | |
780 | (since they cannot be recorded as subblocks in that level) | |
781 | must be carried forward so they will later become subblocks | |
782 | of something else. */ | |
783 | else if (subblocks) | |
536333d4 MM |
784 | current_binding_level->blocks |
785 | = chainon (current_binding_level->blocks, subblocks); | |
8d08fdba | 786 | |
d9b2d9da MM |
787 | /* Each and every BLOCK node created here in `poplevel' is important |
788 | (e.g. for proper debugging information) so if we created one | |
789 | earlier, mark it as "used". */ | |
790 | if (block) | |
791 | TREE_USED (block) = 1; | |
792 | ||
325c3691 | 793 | /* All temporary bindings created for cleanups are popped silently. */ |
ac20c67a | 794 | if (kind == sk_cleanup) |
325c3691 | 795 | goto restart; |
8d08fdba | 796 | |
22ffcc6f | 797 | POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, block); |
8d08fdba MS |
798 | } |
799 | ||
0aafb128 MM |
800 | /* Walk all the namespaces contained NAMESPACE, including NAMESPACE |
801 | itself, calling F for each. The DATA is passed to F as well. */ | |
802 | ||
00e8de68 | 803 | static int |
be93747e | 804 | walk_namespaces_r (tree name_space, walk_namespaces_fn f, void* data) |
00e8de68 GDR |
805 | { |
806 | int result = 0; | |
be93747e | 807 | tree current = NAMESPACE_LEVEL (name_space)->namespaces; |
8d08fdba | 808 | |
be93747e | 809 | result |= (*f) (name_space, data); |
8d08fdba | 810 | |
00e8de68 GDR |
811 | for (; current; current = TREE_CHAIN (current)) |
812 | result |= walk_namespaces_r (current, f, data); | |
fc0e7bf5 | 813 | |
00e8de68 | 814 | return result; |
5566b478 MS |
815 | } |
816 | ||
00e8de68 GDR |
817 | /* Walk all the namespaces, calling F for each. The DATA is passed to |
818 | F as well. */ | |
819 | ||
820 | int | |
821 | walk_namespaces (walk_namespaces_fn f, void* data) | |
5566b478 | 822 | { |
00e8de68 | 823 | return walk_namespaces_r (global_namespace, f, data); |
8d08fdba MS |
824 | } |
825 | ||
00e8de68 GDR |
826 | /* Call wrapup_globals_declarations for the globals in NAMESPACE. If |
827 | DATA is non-NULL, this is the last time we will call | |
828 | wrapup_global_declarations for this NAMESPACE. */ | |
39c01e4c | 829 | |
00e8de68 | 830 | int |
be93747e | 831 | wrapup_globals_for_namespace (tree name_space, void* data) |
39c01e4c | 832 | { |
be93747e | 833 | struct cp_binding_level *level = NAMESPACE_LEVEL (name_space); |
9857866d KH |
834 | VEC(tree,gc) *statics = level->static_decls; |
835 | tree *vec = VEC_address (tree, statics); | |
836 | int len = VEC_length (tree, statics); | |
00e8de68 | 837 | int last_time = (data != 0); |
68642fb6 | 838 | |
00e8de68 | 839 | if (last_time) |
39c01e4c | 840 | { |
00e8de68 | 841 | check_global_declarations (vec, len); |
db5f8b93 | 842 | emit_debug_global_declarations (vec, len); |
00e8de68 | 843 | return 0; |
39c01e4c MM |
844 | } |
845 | ||
00e8de68 GDR |
846 | /* Write out any globals that need to be output. */ |
847 | return wrapup_global_declarations (vec, len); | |
39c01e4c MM |
848 | } |
849 | ||
00e8de68 | 850 | \f |
9188c363 MM |
851 | /* In C++, you don't have to write `struct S' to refer to `S'; you |
852 | can just use `S'. We accomplish this by creating a TYPE_DECL as | |
853 | if the user had written `typedef struct S S'. Create and return | |
854 | the TYPE_DECL for TYPE. */ | |
855 | ||
856 | tree | |
11f6b451 | 857 | create_implicit_typedef (tree name, tree type) |
9188c363 MM |
858 | { |
859 | tree decl; | |
860 | ||
c2255bc4 | 861 | decl = build_decl (input_location, TYPE_DECL, name, type); |
c727aa5e | 862 | DECL_ARTIFICIAL (decl) = 1; |
9188c363 MM |
863 | /* There are other implicit type declarations, like the one *within* |
864 | a class that allows you to write `S::S'. We must distinguish | |
865 | amongst these. */ | |
866 | SET_DECL_IMPLICIT_TYPEDEF_P (decl); | |
867 | TYPE_NAME (type) = decl; | |
9dd90d8e | 868 | TYPE_STUB_DECL (type) = decl; |
9188c363 MM |
869 | |
870 | return decl; | |
871 | } | |
872 | ||
8e4ce833 JJ |
873 | /* Remember a local name for name-mangling purposes. */ |
874 | ||
875 | static void | |
11f6b451 | 876 | push_local_name (tree decl) |
8e4ce833 JJ |
877 | { |
878 | size_t i, nelts; | |
879 | tree t, name; | |
880 | ||
22ffcc6f | 881 | timevar_push (TV_NAME_LOOKUP); |
8e4ce833 JJ |
882 | |
883 | name = DECL_NAME (decl); | |
884 | ||
9acaf84a | 885 | nelts = VEC_length (tree, local_names); |
8e4ce833 JJ |
886 | for (i = 0; i < nelts; i++) |
887 | { | |
9acaf84a | 888 | t = VEC_index (tree, local_names, i); |
8e4ce833 JJ |
889 | if (DECL_NAME (t) == name) |
890 | { | |
891 | if (!DECL_LANG_SPECIFIC (decl)) | |
892 | retrofit_lang_decl (decl); | |
b97e8a14 | 893 | DECL_LANG_SPECIFIC (decl)->u.base.u2sel = 1; |
8e4ce833 JJ |
894 | if (DECL_LANG_SPECIFIC (t)) |
895 | DECL_DISCRIMINATOR (decl) = DECL_DISCRIMINATOR (t) + 1; | |
896 | else | |
897 | DECL_DISCRIMINATOR (decl) = 1; | |
898 | ||
9acaf84a | 899 | VEC_replace (tree, local_names, i, decl); |
de94b46c KG |
900 | timevar_pop (TV_NAME_LOOKUP); |
901 | return; | |
8e4ce833 JJ |
902 | } |
903 | } | |
904 | ||
9acaf84a | 905 | VEC_safe_push (tree, gc, local_names, decl); |
22ffcc6f | 906 | timevar_pop (TV_NAME_LOOKUP); |
8e4ce833 | 907 | } |
8d08fdba MS |
908 | \f |
909 | /* Subroutine of duplicate_decls: return truthvalue of whether | |
910 | or not types of these decls match. | |
911 | ||
912 | For C++, we must compare the parameter list so that `int' can match | |
913 | `int&' in a parameter position, but `int&' is not confused with | |
914 | `const int&'. */ | |
e92cc029 | 915 | |
6060a796 | 916 | int |
11f6b451 | 917 | decls_match (tree newdecl, tree olddecl) |
8d08fdba MS |
918 | { |
919 | int types_match; | |
920 | ||
347d73d7 ML |
921 | if (newdecl == olddecl) |
922 | return 1; | |
923 | ||
6b4b3deb MM |
924 | if (TREE_CODE (newdecl) != TREE_CODE (olddecl)) |
925 | /* If the two DECLs are not even the same kind of thing, we're not | |
926 | interested in their types. */ | |
927 | return 0; | |
928 | ||
929 | if (TREE_CODE (newdecl) == FUNCTION_DECL) | |
8d08fdba MS |
930 | { |
931 | tree f1 = TREE_TYPE (newdecl); | |
932 | tree f2 = TREE_TYPE (olddecl); | |
933 | tree p1 = TYPE_ARG_TYPES (f1); | |
934 | tree p2 = TYPE_ARG_TYPES (f2); | |
935 | ||
c4bcc71f JM |
936 | /* Specializations of different templates are different functions |
937 | even if they have the same type. */ | |
938 | tree t1 = (DECL_USE_TEMPLATE (newdecl) | |
939 | ? DECL_TI_TEMPLATE (newdecl) | |
940 | : NULL_TREE); | |
941 | tree t2 = (DECL_USE_TEMPLATE (olddecl) | |
942 | ? DECL_TI_TEMPLATE (olddecl) | |
943 | : NULL_TREE); | |
944 | if (t1 != t2) | |
945 | return 0; | |
946 | ||
4f1c5b7d | 947 | if (CP_DECL_CONTEXT (newdecl) != CP_DECL_CONTEXT (olddecl) |
eb68cb58 MM |
948 | && ! (DECL_EXTERN_C_P (newdecl) |
949 | && DECL_EXTERN_C_P (olddecl))) | |
c5a6fc45 JM |
950 | return 0; |
951 | ||
8353dd9a JM |
952 | #ifdef NO_IMPLICIT_EXTERN_C |
953 | /* A new declaration doesn't match a built-in one unless it | |
954 | is also extern "C". */ | |
a0ff8620 | 955 | if (DECL_IS_BUILTIN (olddecl) |
8353dd9a JM |
956 | && DECL_EXTERN_C_P (olddecl) && !DECL_EXTERN_C_P (newdecl)) |
957 | return 0; | |
958 | #endif | |
959 | ||
8d08fdba | 960 | if (TREE_CODE (f1) != TREE_CODE (f2)) |
0cbd7506 | 961 | return 0; |
8d08fdba | 962 | |
3bfdc719 | 963 | if (same_type_p (TREE_TYPE (f1), TREE_TYPE (f2))) |
8926095f | 964 | { |
8b27e9ef NS |
965 | if (p2 == NULL_TREE && DECL_EXTERN_C_P (olddecl) |
966 | && (DECL_BUILT_IN (olddecl) | |
967 | #ifndef NO_IMPLICIT_EXTERN_C | |
0cbd7506 MS |
968 | || (DECL_IN_SYSTEM_HEADER (newdecl) && !DECL_CLASS_SCOPE_P (newdecl)) |
969 | || (DECL_IN_SYSTEM_HEADER (olddecl) && !DECL_CLASS_SCOPE_P (olddecl)) | |
8b27e9ef NS |
970 | #endif |
971 | )) | |
a28e3c7f MS |
972 | { |
973 | types_match = self_promoting_args_p (p1); | |
974 | if (p1 == void_list_node) | |
975 | TREE_TYPE (newdecl) = TREE_TYPE (olddecl); | |
976 | } | |
8b27e9ef NS |
977 | #ifndef NO_IMPLICIT_EXTERN_C |
978 | else if (p1 == NULL_TREE | |
979 | && (DECL_EXTERN_C_P (olddecl) | |
0cbd7506 MS |
980 | && DECL_IN_SYSTEM_HEADER (olddecl) |
981 | && !DECL_CLASS_SCOPE_P (olddecl)) | |
8b27e9ef | 982 | && (DECL_EXTERN_C_P (newdecl) |
0cbd7506 MS |
983 | && DECL_IN_SYSTEM_HEADER (newdecl) |
984 | && !DECL_CLASS_SCOPE_P (newdecl))) | |
a28e3c7f MS |
985 | { |
986 | types_match = self_promoting_args_p (p2); | |
987 | TREE_TYPE (newdecl) = TREE_TYPE (olddecl); | |
988 | } | |
8b27e9ef | 989 | #endif |
8926095f | 990 | else |
91063b51 | 991 | types_match = compparms (p1, p2); |
8926095f | 992 | } |
8d08fdba MS |
993 | else |
994 | types_match = 0; | |
995 | } | |
6b4b3deb | 996 | else if (TREE_CODE (newdecl) == TEMPLATE_DECL) |
51c184be | 997 | { |
2bb5d995 JM |
998 | if (TREE_CODE (DECL_TEMPLATE_RESULT (newdecl)) |
999 | != TREE_CODE (DECL_TEMPLATE_RESULT (olddecl))) | |
1000 | return 0; | |
1001 | ||
ee935db4 MM |
1002 | if (!comp_template_parms (DECL_TEMPLATE_PARMS (newdecl), |
1003 | DECL_TEMPLATE_PARMS (olddecl))) | |
1004 | return 0; | |
1005 | ||
f84b4be9 | 1006 | if (TREE_CODE (DECL_TEMPLATE_RESULT (newdecl)) == TYPE_DECL) |
ee935db4 MM |
1007 | types_match = same_type_p (TREE_TYPE (DECL_TEMPLATE_RESULT (olddecl)), |
1008 | TREE_TYPE (DECL_TEMPLATE_RESULT (newdecl))); | |
f84b4be9 JM |
1009 | else |
1010 | types_match = decls_match (DECL_TEMPLATE_RESULT (olddecl), | |
1011 | DECL_TEMPLATE_RESULT (newdecl)); | |
51c184be | 1012 | } |
8d08fdba MS |
1013 | else |
1014 | { | |
91a5bc9f KL |
1015 | /* Need to check scope for variable declaration (VAR_DECL). |
1016 | For typedef (TYPE_DECL), scope is ignored. */ | |
1017 | if (TREE_CODE (newdecl) == VAR_DECL | |
ace4831d MM |
1018 | && CP_DECL_CONTEXT (newdecl) != CP_DECL_CONTEXT (olddecl) |
1019 | /* [dcl.link] | |
1020 | Two declarations for an object with C language linkage | |
1021 | with the same name (ignoring the namespace that qualify | |
1022 | it) that appear in different namespace scopes refer to | |
1023 | the same object. */ | |
1024 | && !(DECL_EXTERN_C_P (olddecl) && DECL_EXTERN_C_P (newdecl))) | |
91a5bc9f KL |
1025 | return 0; |
1026 | ||
8d08fdba MS |
1027 | if (TREE_TYPE (newdecl) == error_mark_node) |
1028 | types_match = TREE_TYPE (olddecl) == error_mark_node; | |
1029 | else if (TREE_TYPE (olddecl) == NULL_TREE) | |
1030 | types_match = TREE_TYPE (newdecl) == NULL_TREE; | |
a0a33927 MS |
1031 | else if (TREE_TYPE (newdecl) == NULL_TREE) |
1032 | types_match = 0; | |
8d08fdba | 1033 | else |
96d84882 PB |
1034 | types_match = comptypes (TREE_TYPE (newdecl), |
1035 | TREE_TYPE (olddecl), | |
1036 | COMPARE_REDECLARATION); | |
8d08fdba MS |
1037 | } |
1038 | ||
1039 | return types_match; | |
1040 | } | |
1041 | ||
1042 | /* If NEWDECL is `static' and an `extern' was seen previously, | |
24f30ed4 | 1043 | warn about it. OLDDECL is the previous declaration. |
8d08fdba MS |
1044 | |
1045 | Note that this does not apply to the C++ case of declaring | |
1046 | a variable `extern const' and then later `const'. | |
1047 | ||
8d08fdba MS |
1048 | Don't complain about built-in functions, since they are beyond |
1049 | the user's control. */ | |
1050 | ||
a5e6b29b | 1051 | void |
11f6b451 | 1052 | warn_extern_redeclared_static (tree newdecl, tree olddecl) |
8d08fdba | 1053 | { |
68642fb6 | 1054 | if (TREE_CODE (newdecl) == TYPE_DECL |
655dc6ee | 1055 | || TREE_CODE (newdecl) == TEMPLATE_DECL |
a2a9e21c GDR |
1056 | || TREE_CODE (newdecl) == CONST_DECL |
1057 | || TREE_CODE (newdecl) == NAMESPACE_DECL) | |
8d08fdba | 1058 | return; |
68642fb6 | 1059 | |
963d5758 MM |
1060 | /* Don't get confused by static member functions; that's a different |
1061 | use of `static'. */ | |
1062 | if (TREE_CODE (newdecl) == FUNCTION_DECL | |
1063 | && DECL_STATIC_FUNCTION_P (newdecl)) | |
1064 | return; | |
8d08fdba | 1065 | |
24f30ed4 MM |
1066 | /* If the old declaration was `static', or the new one isn't, then |
1067 | then everything is OK. */ | |
1068 | if (DECL_THIS_STATIC (olddecl) || !DECL_THIS_STATIC (newdecl)) | |
1069 | return; | |
1070 | ||
1071 | /* It's OK to declare a builtin function as `static'. */ | |
1072 | if (TREE_CODE (olddecl) == FUNCTION_DECL | |
1073 | && DECL_ARTIFICIAL (olddecl)) | |
1074 | return; | |
1075 | ||
cbe5f3b3 MLI |
1076 | permerror (input_location, "%qD was declared %<extern%> and later %<static%>", newdecl); |
1077 | permerror (input_location, "previous declaration of %q+D", olddecl); | |
8d08fdba MS |
1078 | } |
1079 | ||
e1f0e7a6 MM |
1080 | /* NEW_DECL is a redeclaration of OLD_DECL; both are functions or |
1081 | function templates. If their exception specifications do not | |
b9704fc5 | 1082 | match, issue a diagnostic. */ |
e1f0e7a6 MM |
1083 | |
1084 | static void | |
1085 | check_redeclaration_exception_specification (tree new_decl, | |
1086 | tree old_decl) | |
1087 | { | |
1088 | tree new_type; | |
1089 | tree old_type; | |
1090 | tree new_exceptions; | |
1091 | tree old_exceptions; | |
1092 | ||
1093 | new_type = TREE_TYPE (new_decl); | |
1094 | new_exceptions = TYPE_RAISES_EXCEPTIONS (new_type); | |
1095 | old_type = TREE_TYPE (old_decl); | |
1096 | old_exceptions = TYPE_RAISES_EXCEPTIONS (old_type); | |
1097 | ||
1098 | /* [except.spec] | |
1099 | ||
1100 | If any declaration of a function has an exception-specification, | |
1101 | all declarations, including the definition and an explicit | |
1102 | specialization, of that function shall have an | |
1103 | exception-specification with the same set of type-ids. */ | |
1104 | if ((pedantic || ! DECL_IN_SYSTEM_HEADER (old_decl)) | |
1105 | && ! DECL_IS_BUILTIN (old_decl) | |
1106 | && flag_exceptions | |
3a55fb4c | 1107 | && !comp_except_specs (new_exceptions, old_exceptions, ce_normal)) |
e1f0e7a6 | 1108 | { |
3a55fb4c JM |
1109 | error ("declaration of %qF has a different exception specifier", |
1110 | new_decl); | |
e1f0e7a6 MM |
1111 | error ("from previous declaration %q+F", old_decl); |
1112 | } | |
1113 | } | |
1114 | ||
3a47c4e4 AO |
1115 | #define GNU_INLINE_P(fn) (DECL_DECLARED_INLINE_P (fn) \ |
1116 | && lookup_attribute ("gnu_inline", \ | |
1117 | DECL_ATTRIBUTES (fn))) | |
1118 | ||
b1a19c7c MM |
1119 | /* If NEWDECL is a redeclaration of OLDDECL, merge the declarations. |
1120 | If the redeclaration is invalid, a diagnostic is issued, and the | |
1121 | error_mark_node is returned. Otherwise, OLDDECL is returned. | |
8d08fdba | 1122 | |
b1a19c7c | 1123 | If NEWDECL is not a redeclaration of OLDDECL, NULL_TREE is |
d63d5d0c ILT |
1124 | returned. |
1125 | ||
1126 | NEWDECL_IS_FRIEND is true if NEWDECL was declared as a friend. */ | |
8d08fdba | 1127 | |
b1a19c7c | 1128 | tree |
d63d5d0c | 1129 | duplicate_decls (tree newdecl, tree olddecl, bool newdecl_is_friend) |
8d08fdba | 1130 | { |
8d08fdba | 1131 | unsigned olddecl_uid = DECL_UID (olddecl); |
d63d5d0c | 1132 | int olddecl_friend = 0, types_match = 0, hidden_friend = 0; |
0b60dfe3 | 1133 | int new_defines_function = 0; |
2b110bfc | 1134 | tree new_template_info; |
5566b478 MS |
1135 | |
1136 | if (newdecl == olddecl) | |
b1a19c7c | 1137 | return olddecl; |
8d08fdba | 1138 | |
8926095f | 1139 | types_match = decls_match (newdecl, olddecl); |
8d08fdba | 1140 | |
8d08fdba MS |
1141 | /* If either the type of the new decl or the type of the old decl is an |
1142 | error_mark_node, then that implies that we have already issued an | |
1143 | error (earlier) for some bogus type specification, and in that case, | |
1144 | it is rather pointless to harass the user with yet more error message | |
0b60dfe3 | 1145 | about the same declaration, so just pretend the types match here. */ |
bd6dd845 MS |
1146 | if (TREE_TYPE (newdecl) == error_mark_node |
1147 | || TREE_TYPE (olddecl) == error_mark_node) | |
dc5395cc | 1148 | return error_mark_node; |
68642fb6 | 1149 | |
97055d5c AO |
1150 | if (DECL_P (olddecl) |
1151 | && TREE_CODE (newdecl) == FUNCTION_DECL | |
1152 | && TREE_CODE (olddecl) == FUNCTION_DECL | |
1153 | && (DECL_UNINLINABLE (newdecl) || DECL_UNINLINABLE (olddecl))) | |
1154 | { | |
1155 | if (DECL_DECLARED_INLINE_P (newdecl) | |
1156 | && DECL_UNINLINABLE (newdecl) | |
1157 | && lookup_attribute ("noinline", DECL_ATTRIBUTES (newdecl))) | |
1158 | /* Already warned elsewhere. */; | |
1159 | else if (DECL_DECLARED_INLINE_P (olddecl) | |
1160 | && DECL_UNINLINABLE (olddecl) | |
1161 | && lookup_attribute ("noinline", DECL_ATTRIBUTES (olddecl))) | |
1162 | /* Already warned. */; | |
1163 | else if (DECL_DECLARED_INLINE_P (newdecl) | |
1164 | && DECL_UNINLINABLE (olddecl) | |
1165 | && lookup_attribute ("noinline", DECL_ATTRIBUTES (olddecl))) | |
1166 | { | |
dee15844 JM |
1167 | warning (OPT_Wattributes, "function %q+D redeclared as inline", |
1168 | newdecl); | |
1169 | warning (OPT_Wattributes, "previous declaration of %q+D " | |
1170 | "with attribute noinline", olddecl); | |
97055d5c AO |
1171 | } |
1172 | else if (DECL_DECLARED_INLINE_P (olddecl) | |
1173 | && DECL_UNINLINABLE (newdecl) | |
1174 | && lookup_attribute ("noinline", DECL_ATTRIBUTES (newdecl))) | |
1175 | { | |
dee15844 JM |
1176 | warning (OPT_Wattributes, "function %q+D redeclared with " |
1177 | "attribute noinline", newdecl); | |
1178 | warning (OPT_Wattributes, "previous declaration of %q+D was inline", | |
1179 | olddecl); | |
97055d5c AO |
1180 | } |
1181 | } | |
1182 | ||
a1c65f9f | 1183 | /* Check for redeclaration and other discrepancies. */ |
d22c8596 | 1184 | if (TREE_CODE (olddecl) == FUNCTION_DECL |
9f33663b JM |
1185 | && DECL_ARTIFICIAL (olddecl)) |
1186 | { | |
d63d5d0c | 1187 | gcc_assert (!DECL_HIDDEN_FRIEND_P (olddecl)); |
9f33663b JM |
1188 | if (TREE_CODE (newdecl) != FUNCTION_DECL) |
1189 | { | |
d63d5d0c ILT |
1190 | /* Avoid warnings redeclaring built-ins which have not been |
1191 | explicitly declared. */ | |
0cbd7506 MS |
1192 | if (DECL_ANTICIPATED (olddecl)) |
1193 | return NULL_TREE; | |
d52e4867 | 1194 | |
9f33663b JM |
1195 | /* If you declare a built-in or predefined function name as static, |
1196 | the old definition is overridden, but optionally warn this was a | |
1197 | bad choice of name. */ | |
1198 | if (! TREE_PUBLIC (newdecl)) | |
1199 | { | |
24ea727a SZ |
1200 | warning (OPT_Wshadow, |
1201 | DECL_BUILT_IN (olddecl) | |
1202 | ? G_("shadowing built-in function %q#D") | |
1203 | : G_("shadowing library function %q#D"), olddecl); | |
9f33663b | 1204 | /* Discard the old built-in function. */ |
b1a19c7c | 1205 | return NULL_TREE; |
9f33663b JM |
1206 | } |
1207 | /* If the built-in is not ansi, then programs can override | |
1208 | it even globally without an error. */ | |
1209 | else if (! DECL_BUILT_IN (olddecl)) | |
d4ee4d25 | 1210 | warning (0, "library function %q#D redeclared as non-function %q#D", |
0cbd7506 | 1211 | olddecl, newdecl); |
9f33663b JM |
1212 | else |
1213 | { | |
2d01edd7 GDR |
1214 | error ("declaration of %q#D", newdecl); |
1215 | error ("conflicts with built-in declaration %q#D", | |
0cbd7506 | 1216 | olddecl); |
9f33663b | 1217 | } |
b1a19c7c | 1218 | return NULL_TREE; |
a4443a08 | 1219 | } |
9f33663b | 1220 | else if (!types_match) |
8d08fdba | 1221 | { |
d63d5d0c ILT |
1222 | /* Avoid warnings redeclaring built-ins which have not been |
1223 | explicitly declared. */ | |
0cbd7506 | 1224 | if (DECL_ANTICIPATED (olddecl)) |
498c0f27 JJ |
1225 | { |
1226 | /* Deal with fileptr_type_node. FILE type is not known | |
1227 | at the time we create the builtins. */ | |
1228 | tree t1, t2; | |
1229 | ||
1230 | for (t1 = TYPE_ARG_TYPES (TREE_TYPE (newdecl)), | |
1231 | t2 = TYPE_ARG_TYPES (TREE_TYPE (olddecl)); | |
1232 | t1 || t2; | |
1233 | t1 = TREE_CHAIN (t1), t2 = TREE_CHAIN (t2)) | |
1234 | if (!t1 || !t2) | |
1235 | break; | |
1236 | else if (TREE_VALUE (t2) == fileptr_type_node) | |
1237 | { | |
1238 | tree t = TREE_VALUE (t1); | |
1239 | ||
1240 | if (TREE_CODE (t) == POINTER_TYPE | |
1241 | && TYPE_NAME (TREE_TYPE (t)) | |
1242 | && DECL_NAME (TYPE_NAME (TREE_TYPE (t))) | |
1243 | == get_identifier ("FILE") | |
1244 | && compparms (TREE_CHAIN (t1), TREE_CHAIN (t2))) | |
1245 | { | |
1246 | tree oldargs = TYPE_ARG_TYPES (TREE_TYPE (olddecl)); | |
1247 | ||
1248 | TYPE_ARG_TYPES (TREE_TYPE (olddecl)) | |
1249 | = TYPE_ARG_TYPES (TREE_TYPE (newdecl)); | |
1250 | types_match = decls_match (newdecl, olddecl); | |
1251 | if (types_match) | |
d63d5d0c ILT |
1252 | return duplicate_decls (newdecl, olddecl, |
1253 | newdecl_is_friend); | |
498c0f27 JJ |
1254 | TYPE_ARG_TYPES (TREE_TYPE (olddecl)) = oldargs; |
1255 | } | |
1256 | } | |
1257 | else if (! same_type_p (TREE_VALUE (t1), TREE_VALUE (t2))) | |
1258 | break; | |
1259 | } | |
d52e4867 | 1260 | else if ((DECL_EXTERN_C_P (newdecl) |
7e99327d MM |
1261 | && DECL_EXTERN_C_P (olddecl)) |
1262 | || compparms (TYPE_ARG_TYPES (TREE_TYPE (newdecl)), | |
1263 | TYPE_ARG_TYPES (TREE_TYPE (olddecl)))) | |
a4443a08 | 1264 | { |
9f33663b JM |
1265 | /* A near match; override the builtin. */ |
1266 | ||
1267 | if (TREE_PUBLIC (newdecl)) | |
a4443a08 | 1268 | { |
d4ee4d25 DD |
1269 | warning (0, "new declaration %q#D", newdecl); |
1270 | warning (0, "ambiguates built-in declaration %q#D", | |
0cbd7506 | 1271 | olddecl); |
a4443a08 | 1272 | } |
b323323f | 1273 | else |
24ea727a SZ |
1274 | warning (OPT_Wshadow, |
1275 | DECL_BUILT_IN (olddecl) | |
1276 | ? G_("shadowing built-in function %q#D") | |
1277 | : G_("shadowing library function %q#D"), olddecl); | |
a4443a08 | 1278 | } |
9f33663b JM |
1279 | else |
1280 | /* Discard the old built-in function. */ | |
b1a19c7c | 1281 | return NULL_TREE; |
04a9d080 RS |
1282 | |
1283 | /* Replace the old RTL to avoid problems with inlining. */ | |
84b8b0e0 | 1284 | COPY_DECL_RTL (newdecl, olddecl); |
8d08fdba | 1285 | } |
d63d5d0c ILT |
1286 | /* Even if the types match, prefer the new declarations type for |
1287 | built-ins which have not been explicitly declared, for | |
1288 | exception lists, etc... */ | |
d8a0d13e | 1289 | else if (DECL_SOURCE_LOCATION (olddecl) == BUILTINS_LOCATION) |
7072018e | 1290 | { |
74869a85 NS |
1291 | tree type = TREE_TYPE (newdecl); |
1292 | tree attribs = (*targetm.merge_type_attributes) | |
1293 | (TREE_TYPE (olddecl), type); | |
1294 | ||
e9525111 | 1295 | type = cp_build_type_attribute_variant (type, attribs); |
74869a85 | 1296 | TREE_TYPE (newdecl) = TREE_TYPE (olddecl) = type; |
7072018e | 1297 | } |
68642fb6 | 1298 | |
62bedd31 JJ |
1299 | /* If a function is explicitly declared "throw ()", propagate that to |
1300 | the corresponding builtin. */ | |
1301 | if (DECL_BUILT_IN_CLASS (olddecl) == BUILT_IN_NORMAL | |
1302 | && DECL_ANTICIPATED (olddecl) | |
1303 | && TREE_NOTHROW (newdecl) | |
1304 | && !TREE_NOTHROW (olddecl) | |
1305 | && built_in_decls [DECL_FUNCTION_CODE (olddecl)] != NULL_TREE | |
1306 | && built_in_decls [DECL_FUNCTION_CODE (olddecl)] != olddecl | |
1307 | && types_match) | |
1308 | TREE_NOTHROW (built_in_decls [DECL_FUNCTION_CODE (olddecl)]) = 1; | |
1309 | ||
7e99327d MM |
1310 | /* Whether or not the builtin can throw exceptions has no |
1311 | bearing on this declarator. */ | |
1312 | TREE_NOTHROW (olddecl) = 0; | |
1313 | ||
24f30ed4 MM |
1314 | if (DECL_THIS_STATIC (newdecl) && !DECL_THIS_STATIC (olddecl)) |
1315 | { | |
1316 | /* If a builtin function is redeclared as `static', merge | |
1317 | the declarations, but make the original one static. */ | |
1318 | DECL_THIS_STATIC (olddecl) = 1; | |
1319 | TREE_PUBLIC (olddecl) = 0; | |
9bfadf57 | 1320 | |
421844e7 MM |
1321 | /* Make the old declaration consistent with the new one so |
1322 | that all remnants of the builtin-ness of this function | |
1323 | will be banished. */ | |
5d2ed28c | 1324 | SET_DECL_LANGUAGE (olddecl, DECL_LANGUAGE (newdecl)); |
84b8b0e0 | 1325 | COPY_DECL_RTL (newdecl, olddecl); |
24f30ed4 | 1326 | } |
39211cd5 MS |
1327 | } |
1328 | else if (TREE_CODE (olddecl) != TREE_CODE (newdecl)) | |
1329 | { | |
6936461f OW |
1330 | /* C++ Standard, 3.3, clause 4: |
1331 | "[Note: a namespace name or a class template name must be unique | |
1332 | in its declarative region (7.3.2, clause 14). ]" */ | |
1333 | if (TREE_CODE (olddecl) != NAMESPACE_DECL | |
1334 | && TREE_CODE (newdecl) != NAMESPACE_DECL | |
1335 | && (TREE_CODE (olddecl) != TEMPLATE_DECL | |
1336 | || TREE_CODE (DECL_TEMPLATE_RESULT (olddecl)) != TYPE_DECL) | |
1337 | && (TREE_CODE (newdecl) != TEMPLATE_DECL | |
1338 | || TREE_CODE (DECL_TEMPLATE_RESULT (newdecl)) != TYPE_DECL)) | |
9ed182dc | 1339 | { |
6936461f OW |
1340 | if ((TREE_CODE (olddecl) == TYPE_DECL && DECL_ARTIFICIAL (olddecl) |
1341 | && TREE_CODE (newdecl) != TYPE_DECL) | |
1342 | || (TREE_CODE (newdecl) == TYPE_DECL && DECL_ARTIFICIAL (newdecl) | |
1343 | && TREE_CODE (olddecl) != TYPE_DECL)) | |
1344 | { | |
1345 | /* We do nothing special here, because C++ does such nasty | |
1346 | things with TYPE_DECLs. Instead, just let the TYPE_DECL | |
1347 | get shadowed, and know that if we need to find a TYPE_DECL | |
1348 | for a given name, we can look in the IDENTIFIER_TYPE_VALUE | |
1349 | slot of the identifier. */ | |
1350 | return NULL_TREE; | |
1351 | } | |
1352 | ||
1353 | if ((TREE_CODE (newdecl) == FUNCTION_DECL | |
1354 | && DECL_FUNCTION_TEMPLATE_P (olddecl)) | |
1355 | || (TREE_CODE (olddecl) == FUNCTION_DECL | |
1356 | && DECL_FUNCTION_TEMPLATE_P (newdecl))) | |
1357 | return NULL_TREE; | |
9ed182dc JM |
1358 | } |
1359 | ||
2d01edd7 | 1360 | error ("%q#D redeclared as different kind of symbol", newdecl); |
39211cd5 MS |
1361 | if (TREE_CODE (olddecl) == TREE_LIST) |
1362 | olddecl = TREE_VALUE (olddecl); | |
dee15844 | 1363 | error ("previous declaration of %q+#D", olddecl); |
39211cd5 | 1364 | |
c0694c4b | 1365 | return error_mark_node; |
8d08fdba | 1366 | } |
8d08fdba MS |
1367 | else if (!types_match) |
1368 | { | |
4f1c5b7d | 1369 | if (CP_DECL_CONTEXT (newdecl) != CP_DECL_CONTEXT (olddecl)) |
7bdbfa05 MM |
1370 | /* These are certainly not duplicate declarations; they're |
1371 | from different scopes. */ | |
b1a19c7c | 1372 | return NULL_TREE; |
7bdbfa05 | 1373 | |
8926095f | 1374 | if (TREE_CODE (newdecl) == TEMPLATE_DECL) |
f0e01782 MS |
1375 | { |
1376 | /* The name of a class template may not be declared to refer to | |
1377 | any other template, class, function, object, namespace, value, | |
e92cc029 | 1378 | or type in the same scope. */ |
5566b478 MS |
1379 | if (TREE_CODE (DECL_TEMPLATE_RESULT (olddecl)) == TYPE_DECL |
1380 | || TREE_CODE (DECL_TEMPLATE_RESULT (newdecl)) == TYPE_DECL) | |
f0e01782 | 1381 | { |
2d01edd7 | 1382 | error ("declaration of template %q#D", newdecl); |
dee15844 | 1383 | error ("conflicts with previous declaration %q+#D", olddecl); |
f0e01782 | 1384 | } |
ec255269 MS |
1385 | else if (TREE_CODE (DECL_TEMPLATE_RESULT (olddecl)) == FUNCTION_DECL |
1386 | && TREE_CODE (DECL_TEMPLATE_RESULT (newdecl)) == FUNCTION_DECL | |
1387 | && compparms (TYPE_ARG_TYPES (TREE_TYPE (DECL_TEMPLATE_RESULT (olddecl))), | |
91063b51 | 1388 | TYPE_ARG_TYPES (TREE_TYPE (DECL_TEMPLATE_RESULT (newdecl)))) |
75650646 | 1389 | && comp_template_parms (DECL_TEMPLATE_PARMS (newdecl), |
b9201622 NS |
1390 | DECL_TEMPLATE_PARMS (olddecl)) |
1391 | /* Template functions can be disambiguated by | |
1392 | return type. */ | |
1393 | && same_type_p (TREE_TYPE (TREE_TYPE (newdecl)), | |
1394 | TREE_TYPE (TREE_TYPE (olddecl)))) | |
ec255269 | 1395 | { |
2d01edd7 | 1396 | error ("new declaration %q#D", newdecl); |
dee15844 | 1397 | error ("ambiguates old declaration %q+#D", olddecl); |
ec255269 | 1398 | } |
b1a19c7c | 1399 | return NULL_TREE; |
f0e01782 | 1400 | } |
8926095f MS |
1401 | if (TREE_CODE (newdecl) == FUNCTION_DECL) |
1402 | { | |
eb68cb58 | 1403 | if (DECL_EXTERN_C_P (newdecl) && DECL_EXTERN_C_P (olddecl)) |
8926095f | 1404 | { |
2d01edd7 | 1405 | error ("declaration of C function %q#D conflicts with", |
0cbd7506 | 1406 | newdecl); |
dee15844 | 1407 | error ("previous declaration %q+#D here", olddecl); |
8926095f | 1408 | } |
00595019 | 1409 | else if (compparms (TYPE_ARG_TYPES (TREE_TYPE (newdecl)), |
91063b51 | 1410 | TYPE_ARG_TYPES (TREE_TYPE (olddecl)))) |
700f8a87 | 1411 | { |
2d01edd7 | 1412 | error ("new declaration %q#D", newdecl); |
dee15844 | 1413 | error ("ambiguates old declaration %q+#D", olddecl); |
492b73bd | 1414 | return error_mark_node; |
700f8a87 MS |
1415 | } |
1416 | else | |
b1a19c7c | 1417 | return NULL_TREE; |
8926095f | 1418 | } |
58ec3cc5 | 1419 | else |
8d08fdba | 1420 | { |
2d01edd7 | 1421 | error ("conflicting declaration %q#D", newdecl); |
dee15844 | 1422 | error ("%q+D has a previous declaration as %q#D", olddecl, olddecl); |
0cbd7506 | 1423 | return error_mark_node; |
8d08fdba MS |
1424 | } |
1425 | } | |
68642fb6 | 1426 | else if (TREE_CODE (newdecl) == FUNCTION_DECL |
75650646 MM |
1427 | && ((DECL_TEMPLATE_SPECIALIZATION (olddecl) |
1428 | && (!DECL_TEMPLATE_INFO (newdecl) | |
68642fb6 | 1429 | || (DECL_TI_TEMPLATE (newdecl) |
75650646 MM |
1430 | != DECL_TI_TEMPLATE (olddecl)))) |
1431 | || (DECL_TEMPLATE_SPECIALIZATION (newdecl) | |
1432 | && (!DECL_TEMPLATE_INFO (olddecl) | |
68642fb6 | 1433 | || (DECL_TI_TEMPLATE (olddecl) |
75650646 | 1434 | != DECL_TI_TEMPLATE (newdecl)))))) |
386b8a85 JM |
1435 | /* It's OK to have a template specialization and a non-template |
1436 | with the same type, or to have specializations of two | |
75650646 MM |
1437 | different templates with the same type. Note that if one is a |
1438 | specialization, and the other is an instantiation of the same | |
1439 | template, that we do not exit at this point. That situation | |
1440 | can occur if we instantiate a template class, and then | |
0e339752 | 1441 | specialize one of its methods. This situation is valid, but |
75650646 | 1442 | the declarations must be merged in the usual way. */ |
b1a19c7c | 1443 | return NULL_TREE; |
68642fb6 UD |
1444 | else if (TREE_CODE (newdecl) == FUNCTION_DECL |
1445 | && ((DECL_TEMPLATE_INSTANTIATION (olddecl) | |
75650646 MM |
1446 | && !DECL_USE_TEMPLATE (newdecl)) |
1447 | || (DECL_TEMPLATE_INSTANTIATION (newdecl) | |
1448 | && !DECL_USE_TEMPLATE (olddecl)))) | |
1449 | /* One of the declarations is a template instantiation, and the | |
1450 | other is not a template at all. That's OK. */ | |
b1a19c7c | 1451 | return NULL_TREE; |
c30b4add MM |
1452 | else if (TREE_CODE (newdecl) == NAMESPACE_DECL) |
1453 | { | |
1454 | /* In [namespace.alias] we have: | |
c8094d83 | 1455 | |
0cbd7506 | 1456 | In a declarative region, a namespace-alias-definition can be |
c30b4add MM |
1457 | used to redefine a namespace-alias declared in that declarative |
1458 | region to refer only to the namespace to which it already | |
1459 | refers. | |
c8094d83 | 1460 | |
c30b4add MM |
1461 | Therefore, if we encounter a second alias directive for the same |
1462 | alias, we can just ignore the second directive. */ | |
1463 | if (DECL_NAMESPACE_ALIAS (newdecl) | |
c8094d83 | 1464 | && (DECL_NAMESPACE_ALIAS (newdecl) |
c30b4add MM |
1465 | == DECL_NAMESPACE_ALIAS (olddecl))) |
1466 | return olddecl; | |
1467 | /* [namespace.alias] | |
1468 | ||
0cbd7506 | 1469 | A namespace-name or namespace-alias shall not be declared as |
c30b4add MM |
1470 | the name of any other entity in the same declarative region. |
1471 | A namespace-name defined at global scope shall not be | |
77880ae4 | 1472 | declared as the name of any other entity in any global scope |
c30b4add | 1473 | of the program. */ |
2d01edd7 | 1474 | error ("declaration of namespace %qD conflicts with", newdecl); |
dee15844 | 1475 | error ("previous declaration of namespace %q+D here", olddecl); |
c30b4add MM |
1476 | return error_mark_node; |
1477 | } | |
8d08fdba MS |
1478 | else |
1479 | { | |
d8e178a0 | 1480 | const char *errmsg = redeclaration_error_message (newdecl, olddecl); |
8251199e | 1481 | if (errmsg) |
8d08fdba | 1482 | { |
402b8cf6 | 1483 | error_at (DECL_SOURCE_LOCATION (newdecl), errmsg, newdecl); |
8d08fdba | 1484 | if (DECL_NAME (olddecl) != NULL_TREE) |
dee15844 JM |
1485 | error ((DECL_INITIAL (olddecl) && namespace_bindings_p ()) |
1486 | ? "%q+#D previously defined here" | |
1487 | : "%q+#D previously declared here", olddecl); | |
b1a19c7c | 1488 | return error_mark_node; |
8d08fdba MS |
1489 | } |
1490 | else if (TREE_CODE (olddecl) == FUNCTION_DECL | |
1491 | && DECL_INITIAL (olddecl) != NULL_TREE | |
1492 | && TYPE_ARG_TYPES (TREE_TYPE (olddecl)) == NULL_TREE | |
1493 | && TYPE_ARG_TYPES (TREE_TYPE (newdecl)) != NULL_TREE) | |
1494 | { | |
1495 | /* Prototype decl follows defn w/o prototype. */ | |
c5d75364 MLI |
1496 | warning_at (input_location, 0, "prototype for %q+#D", newdecl); |
1497 | warning_at (DECL_SOURCE_LOCATION (olddecl), 0, | |
1498 | "follows non-prototype definition here"); | |
8d08fdba | 1499 | } |
ace4831d MM |
1500 | else if ((TREE_CODE (olddecl) == FUNCTION_DECL |
1501 | || TREE_CODE (olddecl) == VAR_DECL) | |
8d08fdba | 1502 | && DECL_LANGUAGE (newdecl) != DECL_LANGUAGE (olddecl)) |
8926095f | 1503 | { |
ace4831d MM |
1504 | /* [dcl.link] |
1505 | If two declarations of the same function or object | |
1506 | specify different linkage-specifications ..., the program | |
1507 | is ill-formed.... Except for functions with C++ linkage, | |
1508 | a function declaration without a linkage specification | |
1509 | shall not precede the first linkage specification for | |
1510 | that function. A function can be declared without a | |
1511 | linkage specification after an explicit linkage | |
1512 | specification has been seen; the linkage explicitly | |
1513 | specified in the earlier declaration is not affected by | |
1514 | such a function declaration. | |
1515 | ||
1516 | DR 563 raises the question why the restrictions on | |
1517 | functions should not also apply to objects. Older | |
1518 | versions of G++ silently ignore the linkage-specification | |
1519 | for this example: | |
1520 | ||
1521 | namespace N { | |
1522 | extern int i; | |
1523 | extern "C" int i; | |
1524 | } | |
1525 | ||
1526 | which is clearly wrong. Therefore, we now treat objects | |
1527 | like functions. */ | |
46ccf50a | 1528 | if (current_lang_depth () == 0) |
ace4831d MM |
1529 | { |
1530 | /* There is no explicit linkage-specification, so we use | |
1531 | the linkage from the previous declaration. */ | |
1532 | if (!DECL_LANG_SPECIFIC (newdecl)) | |
1533 | retrofit_lang_decl (newdecl); | |
1534 | SET_DECL_LANGUAGE (newdecl, DECL_LANGUAGE (olddecl)); | |
1535 | } | |
8926095f MS |
1536 | else |
1537 | { | |
dee15844 JM |
1538 | error ("previous declaration of %q+#D with %qL linkage", |
1539 | olddecl, DECL_LANGUAGE (olddecl)); | |
2d01edd7 | 1540 | error ("conflicts with new declaration with %qL linkage", |
0cbd7506 | 1541 | DECL_LANGUAGE (newdecl)); |
8926095f MS |
1542 | } |
1543 | } | |
e1cd6e56 | 1544 | |
a6f02587 | 1545 | if (DECL_LANG_SPECIFIC (olddecl) && DECL_USE_TEMPLATE (olddecl)) |
c32381b1 JM |
1546 | ; |
1547 | else if (TREE_CODE (olddecl) == FUNCTION_DECL) | |
e1cd6e56 MS |
1548 | { |
1549 | tree t1 = TYPE_ARG_TYPES (TREE_TYPE (olddecl)); | |
1550 | tree t2 = TYPE_ARG_TYPES (TREE_TYPE (newdecl)); | |
1551 | int i = 1; | |
1552 | ||
1553 | if (TREE_CODE (TREE_TYPE (newdecl)) == METHOD_TYPE) | |
1554 | t1 = TREE_CHAIN (t1), t2 = TREE_CHAIN (t2); | |
68642fb6 | 1555 | |
e1cd6e56 MS |
1556 | for (; t1 && t1 != void_list_node; |
1557 | t1 = TREE_CHAIN (t1), t2 = TREE_CHAIN (t2), i++) | |
1558 | if (TREE_PURPOSE (t1) && TREE_PURPOSE (t2)) | |
1559 | { | |
2507f3b5 RK |
1560 | if (1 == simple_cst_equal (TREE_PURPOSE (t1), |
1561 | TREE_PURPOSE (t2))) | |
e1cd6e56 | 1562 | { |
cbe5f3b3 | 1563 | permerror (input_location, "default argument given for parameter %d of %q#D", |
37ec60ed | 1564 | i, newdecl); |
cbe5f3b3 | 1565 | permerror (input_location, "after previous specification in %q+#D", olddecl); |
e1cd6e56 MS |
1566 | } |
1567 | else | |
1568 | { | |
2d01edd7 | 1569 | error ("default argument given for parameter %d of %q#D", |
0cbd7506 | 1570 | i, newdecl); |
dee15844 | 1571 | error ("after previous specification in %q+#D", |
e1cd6e56 MS |
1572 | olddecl); |
1573 | } | |
1574 | } | |
1575 | } | |
8d08fdba MS |
1576 | } |
1577 | ||
4782bd5b RS |
1578 | /* Do not merge an implicit typedef with an explicit one. In: |
1579 | ||
1580 | class A; | |
1581 | ... | |
1582 | typedef class A A __attribute__ ((foo)); | |
1583 | ||
1584 | the attribute should apply only to the typedef. */ | |
1585 | if (TREE_CODE (olddecl) == TYPE_DECL | |
1586 | && (DECL_IMPLICIT_TYPEDEF_P (olddecl) | |
1587 | || DECL_IMPLICIT_TYPEDEF_P (newdecl))) | |
b1a19c7c | 1588 | return NULL_TREE; |
4782bd5b | 1589 | |
8d08fdba MS |
1590 | /* If new decl is `static' and an `extern' was seen previously, |
1591 | warn about it. */ | |
1592 | warn_extern_redeclared_static (newdecl, olddecl); | |
1593 | ||
e92cc029 | 1594 | /* We have committed to returning 1 at this point. */ |
8d08fdba MS |
1595 | if (TREE_CODE (newdecl) == FUNCTION_DECL) |
1596 | { | |
1597 | /* Now that functions must hold information normally held | |
1598 | by field decls, there is extra work to do so that | |
1599 | declaration information does not get destroyed during | |
1600 | definition. */ | |
1601 | if (DECL_VINDEX (olddecl)) | |
1602 | DECL_VINDEX (newdecl) = DECL_VINDEX (olddecl); | |
1603 | if (DECL_CONTEXT (olddecl)) | |
1604 | DECL_CONTEXT (newdecl) = DECL_CONTEXT (olddecl); | |
e1cd6e56 MS |
1605 | DECL_STATIC_CONSTRUCTOR (newdecl) |= DECL_STATIC_CONSTRUCTOR (olddecl); |
1606 | DECL_STATIC_DESTRUCTOR (newdecl) |= DECL_STATIC_DESTRUCTOR (olddecl); | |
fee7654e | 1607 | DECL_PURE_VIRTUAL_P (newdecl) |= DECL_PURE_VIRTUAL_P (olddecl); |
864b83b9 | 1608 | DECL_VIRTUAL_P (newdecl) |= DECL_VIRTUAL_P (olddecl); |
815951d8 | 1609 | DECL_INVALID_OVERRIDER_P (newdecl) |= DECL_INVALID_OVERRIDER_P (olddecl); |
963d5758 | 1610 | DECL_THIS_STATIC (newdecl) |= DECL_THIS_STATIC (olddecl); |
e0fff4b3 JM |
1611 | if (DECL_OVERLOADED_OPERATOR_P (olddecl) != ERROR_MARK) |
1612 | SET_OVERLOADED_OPERATOR_CODE | |
1613 | (newdecl, DECL_OVERLOADED_OPERATOR_P (olddecl)); | |
0b60dfe3 | 1614 | new_defines_function = DECL_INITIAL (newdecl) != NULL_TREE; |
68642fb6 | 1615 | |
0b60dfe3 | 1616 | /* Optionally warn about more than one declaration for the same |
0cbd7506 MS |
1617 | name, but don't warn about a function declaration followed by a |
1618 | definition. */ | |
0b60dfe3 BK |
1619 | if (warn_redundant_decls && ! DECL_ARTIFICIAL (olddecl) |
1620 | && !(new_defines_function && DECL_INITIAL (olddecl) == NULL_TREE) | |
a1c65f9f | 1621 | /* Don't warn about extern decl followed by definition. */ |
0b60dfe3 | 1622 | && !(DECL_EXTERNAL (olddecl) && ! DECL_EXTERNAL (newdecl)) |
a1c65f9f | 1623 | /* Don't warn about friends, let add_friend take care of it. */ |
d63d5d0c | 1624 | && ! (newdecl_is_friend || DECL_FRIEND_P (olddecl))) |
0b60dfe3 | 1625 | { |
b323323f LM |
1626 | warning (OPT_Wredundant_decls, "redundant redeclaration of %qD in same scope", newdecl); |
1627 | warning (OPT_Wredundant_decls, "previous declaration of %q+D", olddecl); | |
0b60dfe3 | 1628 | } |
b87d79e6 JM |
1629 | |
1630 | if (DECL_DELETED_FN (newdecl)) | |
1631 | { | |
1632 | error ("deleted definition of %qD", newdecl); | |
1633 | error ("after previous declaration %q+D", olddecl); | |
1634 | } | |
8d08fdba MS |
1635 | } |
1636 | ||
1637 | /* Deal with C++: must preserve virtual function table size. */ | |
1638 | if (TREE_CODE (olddecl) == TYPE_DECL) | |
1639 | { | |
926ce8bd KH |
1640 | tree newtype = TREE_TYPE (newdecl); |
1641 | tree oldtype = TREE_TYPE (olddecl); | |
8d08fdba MS |
1642 | |
1643 | if (newtype != error_mark_node && oldtype != error_mark_node | |
1644 | && TYPE_LANG_SPECIFIC (newtype) && TYPE_LANG_SPECIFIC (oldtype)) | |
e93ee644 MM |
1645 | CLASSTYPE_FRIEND_CLASSES (newtype) |
1646 | = CLASSTYPE_FRIEND_CLASSES (oldtype); | |
7df87825 | 1647 | |
970d6386 | 1648 | DECL_ORIGINAL_TYPE (newdecl) = DECL_ORIGINAL_TYPE (olddecl); |
8d08fdba MS |
1649 | } |
1650 | ||
8d08fdba MS |
1651 | /* Copy all the DECL_... slots specified in the new decl |
1652 | except for any that we copy here from the old type. */ | |
91d231cb | 1653 | DECL_ATTRIBUTES (newdecl) |
f6897b10 | 1654 | = (*targetm.merge_decl_attributes) (olddecl, newdecl); |
8d08fdba | 1655 | |
5566b478 MS |
1656 | if (TREE_CODE (newdecl) == TEMPLATE_DECL) |
1657 | { | |
e1f0e7a6 MM |
1658 | tree old_result; |
1659 | tree new_result; | |
1660 | old_result = DECL_TEMPLATE_RESULT (olddecl); | |
1661 | new_result = DECL_TEMPLATE_RESULT (newdecl); | |
1662 | TREE_TYPE (olddecl) = TREE_TYPE (old_result); | |
68642fb6 | 1663 | DECL_TEMPLATE_SPECIALIZATIONS (olddecl) |
4d85e00e MM |
1664 | = chainon (DECL_TEMPLATE_SPECIALIZATIONS (olddecl), |
1665 | DECL_TEMPLATE_SPECIALIZATIONS (newdecl)); | |
68642fb6 | 1666 | |
3a47c4e4 AO |
1667 | DECL_ATTRIBUTES (old_result) |
1668 | = (*targetm.merge_decl_attributes) (old_result, new_result); | |
1669 | ||
e1f0e7a6 MM |
1670 | if (DECL_FUNCTION_TEMPLATE_P (newdecl)) |
1671 | { | |
3a47c4e4 AO |
1672 | if (GNU_INLINE_P (old_result) != GNU_INLINE_P (new_result) |
1673 | && DECL_INITIAL (new_result)) | |
1674 | { | |
1675 | if (DECL_INITIAL (old_result)) | |
99355518 | 1676 | DECL_UNINLINABLE (old_result) = 1; |
3a47c4e4 | 1677 | else |
99355518 | 1678 | DECL_UNINLINABLE (old_result) = DECL_UNINLINABLE (new_result); |
3a47c4e4 AO |
1679 | DECL_EXTERNAL (old_result) = DECL_EXTERNAL (new_result); |
1680 | DECL_NOT_REALLY_EXTERN (old_result) | |
1681 | = DECL_NOT_REALLY_EXTERN (new_result); | |
1682 | DECL_INTERFACE_KNOWN (old_result) | |
1683 | = DECL_INTERFACE_KNOWN (new_result); | |
1684 | DECL_DECLARED_INLINE_P (old_result) | |
1685 | = DECL_DECLARED_INLINE_P (new_result); | |
1eea53df AP |
1686 | DECL_DISREGARD_INLINE_LIMITS (old_result) |
1687 | |= DECL_DISREGARD_INLINE_LIMITS (new_result); | |
1688 | ||
3a47c4e4 AO |
1689 | } |
1690 | else | |
1691 | { | |
3a47c4e4 AO |
1692 | DECL_DECLARED_INLINE_P (old_result) |
1693 | |= DECL_DECLARED_INLINE_P (new_result); | |
1eea53df AP |
1694 | DECL_DISREGARD_INLINE_LIMITS (old_result) |
1695 | |= DECL_DISREGARD_INLINE_LIMITS (new_result); | |
3a47c4e4 AO |
1696 | check_redeclaration_exception_specification (newdecl, olddecl); |
1697 | } | |
e1f0e7a6 MM |
1698 | } |
1699 | ||
daa8df65 | 1700 | /* If the new declaration is a definition, update the file and |
72c4a4ca GK |
1701 | line information on the declaration, and also make |
1702 | the old declaration the same definition. */ | |
3a47c4e4 | 1703 | if (DECL_INITIAL (new_result) != NULL_TREE) |
daa8df65 | 1704 | { |
caf93cb0 | 1705 | DECL_SOURCE_LOCATION (olddecl) |
e1f0e7a6 | 1706 | = DECL_SOURCE_LOCATION (old_result) |
f31686a3 | 1707 | = DECL_SOURCE_LOCATION (newdecl); |
72c4a4ca | 1708 | DECL_INITIAL (old_result) = DECL_INITIAL (new_result); |
26bcf8fc | 1709 | if (DECL_FUNCTION_TEMPLATE_P (newdecl)) |
448545cb JM |
1710 | { |
1711 | tree parm; | |
1712 | DECL_ARGUMENTS (old_result) | |
1713 | = DECL_ARGUMENTS (new_result); | |
1714 | for (parm = DECL_ARGUMENTS (old_result); parm; | |
1715 | parm = TREE_CHAIN (parm)) | |
1716 | DECL_CONTEXT (parm) = old_result; | |
1717 | } | |
c11889ce MM |
1718 | } |
1719 | ||
b1a19c7c | 1720 | return olddecl; |
5566b478 | 1721 | } |
68642fb6 | 1722 | |
8d08fdba MS |
1723 | if (types_match) |
1724 | { | |
1725 | /* Automatically handles default parameters. */ | |
1726 | tree oldtype = TREE_TYPE (olddecl); | |
e1cd6e56 | 1727 | tree newtype; |
8d08fdba | 1728 | |
e1cd6e56 | 1729 | /* Merge the data types specified in the two decls. */ |
6da794e8 | 1730 | newtype = merge_types (TREE_TYPE (newdecl), TREE_TYPE (olddecl)); |
e1cd6e56 | 1731 | |
6da794e8 | 1732 | /* If merge_types produces a non-typedef type, just use the old type. */ |
9076e292 JM |
1733 | if (TREE_CODE (newdecl) == TYPE_DECL |
1734 | && newtype == DECL_ORIGINAL_TYPE (newdecl)) | |
1735 | newtype = oldtype; | |
1736 | ||
8d08fdba | 1737 | if (TREE_CODE (newdecl) == VAR_DECL) |
17bbb839 MM |
1738 | { |
1739 | DECL_THIS_EXTERN (newdecl) |= DECL_THIS_EXTERN (olddecl); | |
1740 | DECL_INITIALIZED_P (newdecl) |= DECL_INITIALIZED_P (olddecl); | |
3db45ab5 | 1741 | DECL_NONTRIVIALLY_INITIALIZED_P (newdecl) |
6c06fbce | 1742 | |= DECL_NONTRIVIALLY_INITIALIZED_P (olddecl); |
39703eb9 MM |
1743 | DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (newdecl) |
1744 | |= DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (olddecl); | |
1799e5d5 RH |
1745 | |
1746 | /* Merge the threadprivate attribute from OLDDECL into NEWDECL. */ | |
1747 | if (DECL_LANG_SPECIFIC (olddecl) | |
1748 | && CP_DECL_THREADPRIVATE_P (olddecl)) | |
1749 | { | |
1750 | /* Allocate a LANG_SPECIFIC structure for NEWDECL, if needed. */ | |
1751 | if (!DECL_LANG_SPECIFIC (newdecl)) | |
1752 | retrofit_lang_decl (newdecl); | |
1753 | ||
1754 | DECL_TLS_MODEL (newdecl) = DECL_TLS_MODEL (olddecl); | |
1755 | CP_DECL_THREADPRIVATE_P (newdecl) = 1; | |
1756 | } | |
17bbb839 MM |
1757 | } |
1758 | ||
6da794e8 | 1759 | /* Do this after calling `merge_types' so that default |
8d08fdba | 1760 | parameters don't confuse us. */ |
e1f0e7a6 MM |
1761 | else if (TREE_CODE (newdecl) == FUNCTION_DECL) |
1762 | check_redeclaration_exception_specification (newdecl, olddecl); | |
8d08fdba MS |
1763 | TREE_TYPE (newdecl) = TREE_TYPE (olddecl) = newtype; |
1764 | ||
4a2f6dc0 VR |
1765 | if (TREE_CODE (newdecl) == FUNCTION_DECL) |
1766 | check_default_args (newdecl); | |
1767 | ||
8d08fdba | 1768 | /* Lay the type out, unless already done. */ |
407f03b8 | 1769 | if (! same_type_p (newtype, oldtype) |
5566b478 | 1770 | && TREE_TYPE (newdecl) != error_mark_node |
5156628f | 1771 | && !(processing_template_decl && uses_template_parms (newdecl))) |
b7484fbe MS |
1772 | layout_type (TREE_TYPE (newdecl)); |
1773 | ||
5566b478 MS |
1774 | if ((TREE_CODE (newdecl) == VAR_DECL |
1775 | || TREE_CODE (newdecl) == PARM_DECL | |
1776 | || TREE_CODE (newdecl) == RESULT_DECL | |
1777 | || TREE_CODE (newdecl) == FIELD_DECL | |
1778 | || TREE_CODE (newdecl) == TYPE_DECL) | |
5156628f | 1779 | && !(processing_template_decl && uses_template_parms (newdecl))) |
b7484fbe | 1780 | layout_decl (newdecl, 0); |
8d08fdba MS |
1781 | |
1782 | /* Merge the type qualifiers. */ | |
1783 | if (TREE_READONLY (newdecl)) | |
1784 | TREE_READONLY (olddecl) = 1; | |
1785 | if (TREE_THIS_VOLATILE (newdecl)) | |
1786 | TREE_THIS_VOLATILE (olddecl) = 1; | |
5cefa0d9 JM |
1787 | if (TREE_NOTHROW (newdecl)) |
1788 | TREE_NOTHROW (olddecl) = 1; | |
8d08fdba | 1789 | |
302a2cc5 JM |
1790 | /* Merge deprecatedness. */ |
1791 | if (TREE_DEPRECATED (newdecl)) | |
1792 | TREE_DEPRECATED (olddecl) = 1; | |
1793 | ||
5779e713 MM |
1794 | /* Preserve function specific target and optimization options */ |
1795 | if (TREE_CODE (newdecl) == FUNCTION_DECL) | |
1796 | { | |
1797 | if (DECL_FUNCTION_SPECIFIC_TARGET (olddecl) | |
1798 | && !DECL_FUNCTION_SPECIFIC_TARGET (newdecl)) | |
1799 | DECL_FUNCTION_SPECIFIC_TARGET (newdecl) | |
1800 | = DECL_FUNCTION_SPECIFIC_TARGET (olddecl); | |
1801 | ||
1802 | if (DECL_FUNCTION_SPECIFIC_OPTIMIZATION (olddecl) | |
1803 | && !DECL_FUNCTION_SPECIFIC_OPTIMIZATION (newdecl)) | |
1804 | DECL_FUNCTION_SPECIFIC_OPTIMIZATION (newdecl) | |
1805 | = DECL_FUNCTION_SPECIFIC_OPTIMIZATION (olddecl); | |
1806 | } | |
1807 | ||
8d08fdba | 1808 | /* Merge the initialization information. */ |
8926095f MS |
1809 | if (DECL_INITIAL (newdecl) == NULL_TREE |
1810 | && DECL_INITIAL (olddecl) != NULL_TREE) | |
1811 | { | |
1812 | DECL_INITIAL (newdecl) = DECL_INITIAL (olddecl); | |
f31686a3 | 1813 | DECL_SOURCE_LOCATION (newdecl) = DECL_SOURCE_LOCATION (olddecl); |
b97e8a14 | 1814 | if (TREE_CODE (newdecl) == FUNCTION_DECL) |
69ee8086 RH |
1815 | { |
1816 | DECL_SAVED_TREE (newdecl) = DECL_SAVED_TREE (olddecl); | |
1da326c3 | 1817 | DECL_STRUCT_FUNCTION (newdecl) = DECL_STRUCT_FUNCTION (olddecl); |
69ee8086 | 1818 | } |
8926095f | 1819 | } |
39211cd5 MS |
1820 | |
1821 | /* Merge the section attribute. | |
0cbd7506 | 1822 | We want to issue an error if the sections conflict but that must be |
39211cd5 MS |
1823 | done later in decl_attributes since we are called before attributes |
1824 | are assigned. */ | |
1825 | if (DECL_SECTION_NAME (newdecl) == NULL_TREE) | |
1826 | DECL_SECTION_NAME (newdecl) = DECL_SECTION_NAME (olddecl); | |
1827 | ||
a157febd GK |
1828 | if (TREE_CODE (newdecl) == FUNCTION_DECL) |
1829 | { | |
1830 | DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (newdecl) | |
1831 | |= DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (olddecl); | |
1331d16f | 1832 | DECL_NO_LIMIT_STACK (newdecl) |= DECL_NO_LIMIT_STACK (olddecl); |
220a35cc | 1833 | TREE_THIS_VOLATILE (newdecl) |= TREE_THIS_VOLATILE (olddecl); |
220a35cc | 1834 | TREE_NOTHROW (newdecl) |= TREE_NOTHROW (olddecl); |
1331d16f | 1835 | DECL_IS_MALLOC (newdecl) |= DECL_IS_MALLOC (olddecl); |
1ea193c2 | 1836 | DECL_IS_OPERATOR_NEW (newdecl) |= DECL_IS_OPERATOR_NEW (olddecl); |
becfd6e5 KZ |
1837 | DECL_PURE_P (newdecl) |= DECL_PURE_P (olddecl); |
1838 | TREE_READONLY (newdecl) |= TREE_READONLY (olddecl); | |
1839 | DECL_LOOPING_CONST_OR_PURE_P (newdecl) | |
1840 | |= DECL_LOOPING_CONST_OR_PURE_P (olddecl); | |
c740732f MM |
1841 | /* Keep the old RTL. */ |
1842 | COPY_DECL_RTL (olddecl, newdecl); | |
1843 | } | |
caf93cb0 | 1844 | else if (TREE_CODE (newdecl) == VAR_DECL |
c740732f MM |
1845 | && (DECL_SIZE (olddecl) || !DECL_SIZE (newdecl))) |
1846 | { | |
1847 | /* Keep the old RTL. We cannot keep the old RTL if the old | |
1848 | declaration was for an incomplete object and the new | |
1849 | declaration is not since many attributes of the RTL will | |
1850 | change. */ | |
1851 | COPY_DECL_RTL (olddecl, newdecl); | |
a157febd | 1852 | } |
8d08fdba MS |
1853 | } |
1854 | /* If cannot merge, then use the new type and qualifiers, | |
1855 | and don't preserve the old rtl. */ | |
1856 | else | |
1857 | { | |
1858 | /* Clean out any memory we had of the old declaration. */ | |
1859 | tree oldstatic = value_member (olddecl, static_aggregates); | |
1860 | if (oldstatic) | |
1861 | TREE_VALUE (oldstatic) = error_mark_node; | |
1862 | ||
1863 | TREE_TYPE (olddecl) = TREE_TYPE (newdecl); | |
1864 | TREE_READONLY (olddecl) = TREE_READONLY (newdecl); | |
1865 | TREE_THIS_VOLATILE (olddecl) = TREE_THIS_VOLATILE (newdecl); | |
1866 | TREE_SIDE_EFFECTS (olddecl) = TREE_SIDE_EFFECTS (newdecl); | |
1867 | } | |
1868 | ||
1869 | /* Merge the storage class information. */ | |
45806a3f FS |
1870 | merge_weak (newdecl, olddecl); |
1871 | ||
fc26fae3 RAE |
1872 | if (DECL_ONE_ONLY (olddecl)) |
1873 | DECL_COMDAT_GROUP (newdecl) = DECL_COMDAT_GROUP (olddecl); | |
1874 | ||
794d4a61 | 1875 | DECL_DEFER_OUTPUT (newdecl) |= DECL_DEFER_OUTPUT (olddecl); |
a9aedbc2 MS |
1876 | TREE_PUBLIC (newdecl) = TREE_PUBLIC (olddecl); |
1877 | TREE_STATIC (olddecl) = TREE_STATIC (newdecl) |= TREE_STATIC (olddecl); | |
1878 | if (! DECL_EXTERNAL (olddecl)) | |
1879 | DECL_EXTERNAL (newdecl) = 0; | |
68642fb6 | 1880 | |
2b110bfc | 1881 | new_template_info = NULL_TREE; |
0b60dfe3 | 1882 | if (DECL_LANG_SPECIFIC (newdecl) && DECL_LANG_SPECIFIC (olddecl)) |
8d08fdba | 1883 | { |
fea10e36 AO |
1884 | bool new_redefines_gnu_inline = false; |
1885 | ||
1886 | if (new_defines_function | |
1887 | && ((DECL_INTERFACE_KNOWN (olddecl) | |
1888 | && TREE_CODE (olddecl) == FUNCTION_DECL) | |
1889 | || (TREE_CODE (olddecl) == TEMPLATE_DECL | |
1890 | && (TREE_CODE (DECL_TEMPLATE_RESULT (olddecl)) | |
1891 | == FUNCTION_DECL)))) | |
3a47c4e4 AO |
1892 | { |
1893 | tree fn = olddecl; | |
1894 | ||
1895 | if (TREE_CODE (fn) == TEMPLATE_DECL) | |
1896 | fn = DECL_TEMPLATE_RESULT (olddecl); | |
1897 | ||
fea10e36 | 1898 | new_redefines_gnu_inline = GNU_INLINE_P (fn) && DECL_INITIAL (fn); |
3a47c4e4 | 1899 | } |
3a47c4e4 | 1900 | |
fea10e36 | 1901 | if (!new_redefines_gnu_inline) |
3a47c4e4 | 1902 | { |
3a47c4e4 AO |
1903 | DECL_INTERFACE_KNOWN (newdecl) |= DECL_INTERFACE_KNOWN (olddecl); |
1904 | DECL_NOT_REALLY_EXTERN (newdecl) |= DECL_NOT_REALLY_EXTERN (olddecl); | |
1905 | DECL_COMDAT (newdecl) |= DECL_COMDAT (olddecl); | |
1906 | } | |
68642fb6 | 1907 | DECL_TEMPLATE_INSTANTIATED (newdecl) |
2b0a63a3 | 1908 | |= DECL_TEMPLATE_INSTANTIATED (olddecl); |
3146f36f | 1909 | DECL_ODR_USED (newdecl) |= DECL_ODR_USED (olddecl); |
c8094d83 | 1910 | |
58fb06b4 NS |
1911 | /* If the OLDDECL is an instantiation and/or specialization, |
1912 | then the NEWDECL must be too. But, it may not yet be marked | |
1913 | as such if the caller has created NEWDECL, but has not yet | |
1914 | figured out that it is a redeclaration. */ | |
1915 | if (!DECL_USE_TEMPLATE (newdecl)) | |
1916 | DECL_USE_TEMPLATE (newdecl) = DECL_USE_TEMPLATE (olddecl); | |
c8094d83 | 1917 | |
0b60dfe3 BK |
1918 | /* Don't really know how much of the language-specific |
1919 | values we should copy from old to new. */ | |
1920 | DECL_IN_AGGR_P (newdecl) = DECL_IN_AGGR_P (olddecl); | |
4684cd27 | 1921 | DECL_REPO_AVAILABLE_P (newdecl) = DECL_REPO_AVAILABLE_P (olddecl); |
3febd123 | 1922 | DECL_INITIALIZED_IN_CLASS_P (newdecl) |
0cbd7506 | 1923 | |= DECL_INITIALIZED_IN_CLASS_P (olddecl); |
6a629cac | 1924 | |
b97e8a14 JM |
1925 | if (LANG_DECL_HAS_MIN (newdecl)) |
1926 | { | |
1927 | DECL_LANG_SPECIFIC (newdecl)->u.min.u2 = | |
1928 | DECL_LANG_SPECIFIC (olddecl)->u.min.u2; | |
1929 | if (DECL_TEMPLATE_INFO (newdecl)) | |
1930 | new_template_info = DECL_TEMPLATE_INFO (newdecl); | |
1931 | DECL_TEMPLATE_INFO (newdecl) = DECL_TEMPLATE_INFO (olddecl); | |
1932 | } | |
1933 | /* Only functions have these fields. */ | |
6a629cac MM |
1934 | if (TREE_CODE (newdecl) == FUNCTION_DECL |
1935 | || DECL_FUNCTION_TEMPLATE_P (newdecl)) | |
bb5e8a7f | 1936 | { |
b97e8a14 JM |
1937 | DECL_NONCONVERTING_P (newdecl) = DECL_NONCONVERTING_P (olddecl); |
1938 | olddecl_friend = DECL_FRIEND_P (olddecl); | |
1939 | hidden_friend = (DECL_ANTICIPATED (olddecl) | |
1940 | && DECL_HIDDEN_FRIEND_P (olddecl) | |
1941 | && newdecl_is_friend); | |
bb5e8a7f MM |
1942 | DECL_BEFRIENDING_CLASSES (newdecl) |
1943 | = chainon (DECL_BEFRIENDING_CLASSES (newdecl), | |
1944 | DECL_BEFRIENDING_CLASSES (olddecl)); | |
ca9e1382 KL |
1945 | /* DECL_THUNKS is only valid for virtual functions, |
1946 | otherwise it is a DECL_FRIEND_CONTEXT. */ | |
1947 | if (DECL_VIRTUAL_P (newdecl)) | |
1948 | DECL_THUNKS (newdecl) = DECL_THUNKS (olddecl); | |
bb5e8a7f | 1949 | } |
48326487 JM |
1950 | /* Only variables have this field. */ |
1951 | else if (TREE_CODE (newdecl) == VAR_DECL | |
1952 | && VAR_HAD_UNKNOWN_BOUND (olddecl)) | |
1953 | SET_VAR_HAD_UNKNOWN_BOUND (newdecl); | |
8d08fdba MS |
1954 | } |
1955 | ||
8d08fdba MS |
1956 | if (TREE_CODE (newdecl) == FUNCTION_DECL) |
1957 | { | |
448545cb JM |
1958 | tree parm; |
1959 | ||
bb36cc75 DM |
1960 | /* Merge parameter attributes. */ |
1961 | tree oldarg, newarg; | |
1962 | for (oldarg = DECL_ARGUMENTS(olddecl), | |
1963 | newarg = DECL_ARGUMENTS(newdecl); | |
1964 | oldarg && newarg; | |
1965 | oldarg = TREE_CHAIN(oldarg), newarg = TREE_CHAIN(newarg)) { | |
1966 | DECL_ATTRIBUTES (newarg) | |
1967 | = (*targetm.merge_decl_attributes) (oldarg, newarg); | |
1968 | DECL_ATTRIBUTES (oldarg) = DECL_ATTRIBUTES (newarg); | |
1969 | } | |
1970 | ||
68642fb6 UD |
1971 | if (DECL_TEMPLATE_INSTANTIATION (olddecl) |
1972 | && !DECL_TEMPLATE_INSTANTIATION (newdecl)) | |
75650646 MM |
1973 | { |
1974 | /* If newdecl is not a specialization, then it is not a | |
1975 | template-related function at all. And that means that we | |
bf7c02dd | 1976 | should have exited above, returning 0. */ |
50bc768d | 1977 | gcc_assert (DECL_TEMPLATE_SPECIALIZATION (newdecl)); |
75650646 | 1978 | |
3146f36f | 1979 | if (DECL_ODR_USED (olddecl)) |
75650646 | 1980 | /* From [temp.expl.spec]: |
68642fb6 | 1981 | |
75650646 MM |
1982 | If a template, a member template or the member of a class |
1983 | template is explicitly specialized then that | |
1984 | specialization shall be declared before the first use of | |
1985 | that specialization that would cause an implicit | |
1986 | instantiation to take place, in every translation unit in | |
1987 | which such a use occurs. */ | |
9e637a26 | 1988 | error ("explicit specialization of %qD after first use", |
75650646 MM |
1989 | olddecl); |
1990 | ||
1991 | SET_DECL_TEMPLATE_SPECIALIZATION (olddecl); | |
d03d18e8 | 1992 | |
b9e75696 JM |
1993 | /* Don't propagate visibility from the template to the |
1994 | specialization here. We'll do that in determine_visibility if | |
1995 | appropriate. */ | |
1996 | DECL_VISIBILITY_SPECIFIED (olddecl) = 0; | |
1997 | ||
d03d18e8 KL |
1998 | /* [temp.expl.spec/14] We don't inline explicit specialization |
1999 | just because the primary template says so. */ | |
75650646 | 2000 | } |
3a47c4e4 AO |
2001 | else if (new_defines_function && DECL_INITIAL (olddecl)) |
2002 | { | |
7e8b322a JH |
2003 | /* Never inline re-defined extern inline functions. |
2004 | FIXME: this could be better handled by keeping both | |
2005 | function as separate declarations. */ | |
3a47c4e4 AO |
2006 | DECL_UNINLINABLE (newdecl) = 1; |
2007 | } | |
d03d18e8 KL |
2008 | else |
2009 | { | |
2010 | if (DECL_PENDING_INLINE_INFO (newdecl) == 0) | |
2011 | DECL_PENDING_INLINE_INFO (newdecl) = DECL_PENDING_INLINE_INFO (olddecl); | |
faae18ab | 2012 | |
d03d18e8 | 2013 | DECL_DECLARED_INLINE_P (newdecl) |= DECL_DECLARED_INLINE_P (olddecl); |
faae18ab | 2014 | |
d03d18e8 KL |
2015 | DECL_UNINLINABLE (newdecl) = DECL_UNINLINABLE (olddecl) |
2016 | = (DECL_UNINLINABLE (newdecl) || DECL_UNINLINABLE (olddecl)); | |
c536a6a7 RG |
2017 | |
2018 | DECL_DISREGARD_INLINE_LIMITS (newdecl) | |
2019 | = DECL_DISREGARD_INLINE_LIMITS (olddecl) | |
2020 | = (DECL_DISREGARD_INLINE_LIMITS (newdecl) | |
2021 | || DECL_DISREGARD_INLINE_LIMITS (olddecl)); | |
d03d18e8 | 2022 | } |
97055d5c | 2023 | |
5daf7c0a JM |
2024 | /* Preserve abstractness on cloned [cd]tors. */ |
2025 | DECL_ABSTRACT (newdecl) = DECL_ABSTRACT (olddecl); | |
2026 | ||
448545cb JM |
2027 | /* Update newdecl's parms to point at olddecl. */ |
2028 | for (parm = DECL_ARGUMENTS (newdecl); parm; | |
2029 | parm = TREE_CHAIN (parm)) | |
2030 | DECL_CONTEXT (parm) = olddecl; | |
2031 | ||
700f8a87 MS |
2032 | if (! types_match) |
2033 | { | |
5d2ed28c | 2034 | SET_DECL_LANGUAGE (olddecl, DECL_LANGUAGE (newdecl)); |
92643fea | 2035 | COPY_DECL_ASSEMBLER_NAME (newdecl, olddecl); |
84b8b0e0 | 2036 | COPY_DECL_RTL (newdecl, olddecl); |
5566b478 MS |
2037 | } |
2038 | if (! types_match || new_defines_function) | |
2039 | { | |
6f1b4c42 JM |
2040 | /* These need to be copied so that the names are available. |
2041 | Note that if the types do match, we'll preserve inline | |
2042 | info and other bits, but if not, we won't. */ | |
700f8a87 MS |
2043 | DECL_ARGUMENTS (olddecl) = DECL_ARGUMENTS (newdecl); |
2044 | DECL_RESULT (olddecl) = DECL_RESULT (newdecl); | |
700f8a87 | 2045 | } |
8d08fdba MS |
2046 | if (new_defines_function) |
2047 | /* If defining a function declared with other language | |
2048 | linkage, use the previously declared language linkage. */ | |
5d2ed28c | 2049 | SET_DECL_LANGUAGE (newdecl, DECL_LANGUAGE (olddecl)); |
6f1b4c42 | 2050 | else if (types_match) |
8d08fdba MS |
2051 | { |
2052 | /* If redeclaring a builtin function, and not a definition, | |
2053 | it stays built in. */ | |
2054 | if (DECL_BUILT_IN (olddecl)) | |
2055 | { | |
26db82d8 | 2056 | DECL_BUILT_IN_CLASS (newdecl) = DECL_BUILT_IN_CLASS (olddecl); |
39211cd5 | 2057 | DECL_FUNCTION_CODE (newdecl) = DECL_FUNCTION_CODE (olddecl); |
8d08fdba MS |
2058 | /* If we're keeping the built-in definition, keep the rtl, |
2059 | regardless of declaration matches. */ | |
84b8b0e0 | 2060 | COPY_DECL_RTL (olddecl, newdecl); |
8d08fdba | 2061 | } |
8d08fdba MS |
2062 | |
2063 | DECL_RESULT (newdecl) = DECL_RESULT (olddecl); | |
448545cb JM |
2064 | /* Don't clear out the arguments if we're just redeclaring a |
2065 | function. */ | |
8d08fdba MS |
2066 | if (DECL_ARGUMENTS (olddecl)) |
2067 | DECL_ARGUMENTS (newdecl) = DECL_ARGUMENTS (olddecl); | |
2068 | } | |
2069 | } | |
0b1161fc MM |
2070 | else if (TREE_CODE (newdecl) == NAMESPACE_DECL) |
2071 | NAMESPACE_LEVEL (newdecl) = NAMESPACE_LEVEL (olddecl); | |
a9aedbc2 | 2072 | |
8d08fdba MS |
2073 | /* Now preserve various other info from the definition. */ |
2074 | TREE_ADDRESSABLE (newdecl) = TREE_ADDRESSABLE (olddecl); | |
2075 | TREE_ASM_WRITTEN (newdecl) = TREE_ASM_WRITTEN (olddecl); | |
2076 | DECL_COMMON (newdecl) = DECL_COMMON (olddecl); | |
92643fea | 2077 | COPY_DECL_ASSEMBLER_NAME (olddecl, newdecl); |
8d08fdba | 2078 | |
d7afec4b | 2079 | /* Warn about conflicting visibility specifications. */ |
c8094d83 | 2080 | if (DECL_VISIBILITY_SPECIFIED (olddecl) |
73a8adb6 | 2081 | && DECL_VISIBILITY_SPECIFIED (newdecl) |
d7afec4b ND |
2082 | && DECL_VISIBILITY (newdecl) != DECL_VISIBILITY (olddecl)) |
2083 | { | |
c5d75364 MLI |
2084 | warning_at (input_location, OPT_Wattributes, |
2085 | "%q+D: visibility attribute ignored because it", newdecl); | |
2086 | warning_at (DECL_SOURCE_LOCATION (olddecl), OPT_Wattributes, | |
2087 | "conflicts with previous declaration here"); | |
d7afec4b ND |
2088 | } |
2089 | /* Choose the declaration which specified visibility. */ | |
2090 | if (DECL_VISIBILITY_SPECIFIED (olddecl)) | |
facef326 | 2091 | { |
facef326 | 2092 | DECL_VISIBILITY (newdecl) = DECL_VISIBILITY (olddecl); |
d7afec4b ND |
2093 | DECL_VISIBILITY_SPECIFIED (newdecl) = 1; |
2094 | } | |
3db45ab5 | 2095 | /* Init priority used to be merged from newdecl to olddecl by the memcpy, |
820cc88f DB |
2096 | so keep this behavior. */ |
2097 | if (TREE_CODE (newdecl) == VAR_DECL && DECL_HAS_INIT_PRIORITY_P (newdecl)) | |
2098 | { | |
2099 | SET_DECL_INIT_PRIORITY (olddecl, DECL_INIT_PRIORITY (newdecl)); | |
2100 | DECL_HAS_INIT_PRIORITY_P (olddecl) = 1; | |
2101 | } | |
facef326 | 2102 | |
1d786913 MM |
2103 | /* The DECL_LANG_SPECIFIC information in OLDDECL will be replaced |
2104 | with that from NEWDECL below. */ | |
2105 | if (DECL_LANG_SPECIFIC (olddecl)) | |
2106 | { | |
c8094d83 | 2107 | gcc_assert (DECL_LANG_SPECIFIC (olddecl) |
1d786913 MM |
2108 | != DECL_LANG_SPECIFIC (newdecl)); |
2109 | ggc_free (DECL_LANG_SPECIFIC (olddecl)); | |
2110 | } | |
2111 | ||
39ac02d7 L |
2112 | /* Merge the USED information. */ |
2113 | if (TREE_USED (olddecl)) | |
2114 | TREE_USED (newdecl) = 1; | |
2115 | else if (TREE_USED (newdecl)) | |
2116 | TREE_USED (olddecl) = 1; | |
03a904b5 JJ |
2117 | if (TREE_CODE (newdecl) == VAR_DECL) |
2118 | { | |
2119 | if (DECL_READ_P (olddecl)) | |
2120 | DECL_READ_P (newdecl) = 1; | |
2121 | else if (DECL_READ_P (newdecl)) | |
2122 | DECL_READ_P (olddecl) = 1; | |
2123 | } | |
3a7ba040 MS |
2124 | if (DECL_PRESERVE_P (olddecl)) |
2125 | DECL_PRESERVE_P (newdecl) = 1; | |
2126 | else if (DECL_PRESERVE_P (newdecl)) | |
2127 | DECL_PRESERVE_P (olddecl) = 1; | |
e27fb29c | 2128 | |
8d08fdba MS |
2129 | if (TREE_CODE (newdecl) == FUNCTION_DECL) |
2130 | { | |
2131 | int function_size; | |
8d08fdba | 2132 | |
820cc88f | 2133 | function_size = sizeof (struct tree_decl_common); |
8d08fdba | 2134 | |
730e1556 KG |
2135 | memcpy ((char *) olddecl + sizeof (struct tree_common), |
2136 | (char *) newdecl + sizeof (struct tree_common), | |
2137 | function_size - sizeof (struct tree_common)); | |
8d08fdba | 2138 | |
820cc88f DB |
2139 | memcpy ((char *) olddecl + sizeof (struct tree_decl_common), |
2140 | (char *) newdecl + sizeof (struct tree_decl_common), | |
2141 | sizeof (struct tree_function_decl) - sizeof (struct tree_decl_common)); | |
2b110bfc | 2142 | if (new_template_info) |
b3445994 MM |
2143 | /* If newdecl is a template instantiation, it is possible that |
2144 | the following sequence of events has occurred: | |
2145 | ||
2146 | o A friend function was declared in a class template. The | |
2147 | class template was instantiated. | |
2148 | ||
2149 | o The instantiation of the friend declaration was | |
2150 | recorded on the instantiation list, and is newdecl. | |
2151 | ||
2152 | o Later, however, instantiate_class_template called pushdecl | |
2153 | on the newdecl to perform name injection. But, pushdecl in | |
2154 | turn called duplicate_decls when it discovered that another | |
2155 | declaration of a global function with the same name already | |
2156 | existed. | |
2157 | ||
2158 | o Here, in duplicate_decls, we decided to clobber newdecl. | |
2159 | ||
2160 | If we're going to do that, we'd better make sure that | |
2161 | olddecl, and not newdecl, is on the list of | |
2162 | instantiations so that if we try to do the instantiation | |
2163 | again we won't get the clobbered declaration. */ | |
caf93cb0 | 2164 | reregister_specialization (newdecl, |
2b110bfc | 2165 | new_template_info, |
b3445994 | 2166 | olddecl); |
8d08fdba MS |
2167 | } |
2168 | else | |
2169 | { | |
820cc88f | 2170 | size_t size = tree_code_size (TREE_CODE (olddecl)); |
730e1556 KG |
2171 | memcpy ((char *) olddecl + sizeof (struct tree_common), |
2172 | (char *) newdecl + sizeof (struct tree_common), | |
820cc88f | 2173 | sizeof (struct tree_decl_common) - sizeof (struct tree_common)); |
3db45ab5 | 2174 | switch (TREE_CODE (olddecl)) |
820cc88f DB |
2175 | { |
2176 | case LABEL_DECL: | |
2177 | case VAR_DECL: | |
2178 | case RESULT_DECL: | |
2179 | case PARM_DECL: | |
2180 | case FIELD_DECL: | |
2181 | case TYPE_DECL: | |
2182 | case CONST_DECL: | |
2183 | { | |
2184 | memcpy ((char *) olddecl + sizeof (struct tree_decl_common), | |
2185 | (char *) newdecl + sizeof (struct tree_decl_common), | |
2186 | size - sizeof (struct tree_decl_common) | |
2187 | + TREE_CODE_LENGTH (TREE_CODE (newdecl)) * sizeof (char *)); | |
2188 | } | |
2189 | break; | |
2190 | default: | |
2191 | memcpy ((char *) olddecl + sizeof (struct tree_decl_common), | |
2192 | (char *) newdecl + sizeof (struct tree_decl_common), | |
2193 | sizeof (struct tree_decl_non_common) - sizeof (struct tree_decl_common) | |
2194 | + TREE_CODE_LENGTH (TREE_CODE (newdecl)) * sizeof (char *)); | |
2195 | break; | |
2196 | } | |
8d08fdba | 2197 | } |
8d08fdba MS |
2198 | DECL_UID (olddecl) = olddecl_uid; |
2199 | if (olddecl_friend) | |
2200 | DECL_FRIEND_P (olddecl) = 1; | |
d63d5d0c ILT |
2201 | if (hidden_friend) |
2202 | { | |
2203 | DECL_ANTICIPATED (olddecl) = 1; | |
2204 | DECL_HIDDEN_FRIEND_P (olddecl) = 1; | |
2205 | } | |
8d08fdba | 2206 | |
d9525bec BK |
2207 | /* NEWDECL contains the merged attribute lists. |
2208 | Update OLDDECL to be the same. */ | |
91d231cb | 2209 | DECL_ATTRIBUTES (olddecl) = DECL_ATTRIBUTES (newdecl); |
d9525bec | 2210 | |
16e31964 DS |
2211 | /* If OLDDECL had its DECL_RTL instantiated, re-invoke make_decl_rtl |
2212 | so that encode_section_info has a chance to look at the new decl | |
2213 | flags and attributes. */ | |
caf93cb0 | 2214 | if (DECL_RTL_SET_P (olddecl) |
16e31964 DS |
2215 | && (TREE_CODE (olddecl) == FUNCTION_DECL |
2216 | || (TREE_CODE (olddecl) == VAR_DECL | |
2217 | && TREE_STATIC (olddecl)))) | |
0e6df31e | 2218 | make_decl_rtl (olddecl); |
16e31964 | 2219 | |
1d786913 MM |
2220 | /* The NEWDECL will no longer be needed. Because every out-of-class |
2221 | declaration of a member results in a call to duplicate_decls, | |
2222 | freeing these nodes represents in a significant savings. */ | |
2223 | ggc_free (newdecl); | |
2224 | ||
b1a19c7c | 2225 | return olddecl; |
8d08fdba | 2226 | } |
8d08fdba | 2227 | \f |
8251199e | 2228 | /* Return zero if the declaration NEWDECL is valid |
8d08fdba MS |
2229 | when the declaration OLDDECL (assumed to be for the same name) |
2230 | has already been seen. | |
2231 | Otherwise return an error message format string with a %s | |
2232 | where the identifier should go. */ | |
2233 | ||
d8e178a0 | 2234 | static const char * |
11f6b451 | 2235 | redeclaration_error_message (tree newdecl, tree olddecl) |
8d08fdba MS |
2236 | { |
2237 | if (TREE_CODE (newdecl) == TYPE_DECL) | |
2238 | { | |
2239 | /* Because C++ can put things into name space for free, | |
2240 | constructs like "typedef struct foo { ... } foo" | |
2241 | would look like an erroneous redeclaration. */ | |
3bfdc719 | 2242 | if (same_type_p (TREE_TYPE (newdecl), TREE_TYPE (olddecl))) |
6aed477a | 2243 | return NULL; |
8d08fdba | 2244 | else |
9ee5ebeb | 2245 | return G_("redefinition of %q#D"); |
8d08fdba MS |
2246 | } |
2247 | else if (TREE_CODE (newdecl) == FUNCTION_DECL) | |
2248 | { | |
2249 | /* If this is a pure function, its olddecl will actually be | |
2250 | the original initialization to `0' (which we force to call | |
2251 | abort()). Don't complain about redefinition in this case. */ | |
d1fc3bbd AO |
2252 | if (DECL_LANG_SPECIFIC (olddecl) && DECL_PURE_VIRTUAL_P (olddecl) |
2253 | && DECL_INITIAL (olddecl) == NULL_TREE) | |
6aed477a | 2254 | return NULL; |
8d08fdba | 2255 | |
2c73f9f5 | 2256 | /* If both functions come from different namespaces, this is not |
a1c65f9f | 2257 | a redeclaration - this is a conflict with a used function. */ |
6eb3bb27 | 2258 | if (DECL_NAMESPACE_SCOPE_P (olddecl) |
713101a6 AO |
2259 | && DECL_CONTEXT (olddecl) != DECL_CONTEXT (newdecl) |
2260 | && ! decls_match (olddecl, newdecl)) | |
9ee5ebeb | 2261 | return G_("%qD conflicts with used function"); |
2c73f9f5 | 2262 | |
db5ae43f | 2263 | /* We'll complain about linkage mismatches in |
0cbd7506 | 2264 | warn_extern_redeclared_static. */ |
db5ae43f | 2265 | |
2c73f9f5 | 2266 | /* Defining the same name twice is no good. */ |
8d08fdba | 2267 | if (DECL_INITIAL (olddecl) != NULL_TREE |
faae18ab | 2268 | && DECL_INITIAL (newdecl) != NULL_TREE) |
8d08fdba MS |
2269 | { |
2270 | if (DECL_NAME (olddecl) == NULL_TREE) | |
9ee5ebeb | 2271 | return G_("%q#D not declared in class"); |
3a47c4e4 AO |
2272 | else if (!GNU_INLINE_P (olddecl) |
2273 | || GNU_INLINE_P (newdecl)) | |
9ee5ebeb | 2274 | return G_("redefinition of %q#D"); |
8d08fdba | 2275 | } |
3a47c4e4 AO |
2276 | |
2277 | if (DECL_DECLARED_INLINE_P (olddecl) && DECL_DECLARED_INLINE_P (newdecl)) | |
2278 | { | |
2279 | bool olda = GNU_INLINE_P (olddecl); | |
2280 | bool newa = GNU_INLINE_P (newdecl); | |
2281 | ||
2282 | if (olda != newa) | |
2283 | { | |
2284 | if (newa) | |
9ee5ebeb SZ |
2285 | return G_("%q+D redeclared inline with " |
2286 | "%<gnu_inline%> attribute"); | |
3a47c4e4 | 2287 | else |
9ee5ebeb SZ |
2288 | return G_("%q+D redeclared inline without " |
2289 | "%<gnu_inline%> attribute"); | |
3a47c4e4 AO |
2290 | } |
2291 | } | |
2292 | ||
6aed477a | 2293 | return NULL; |
8d08fdba | 2294 | } |
51c184be MS |
2295 | else if (TREE_CODE (newdecl) == TEMPLATE_DECL) |
2296 | { | |
5bd61841 MM |
2297 | tree nt, ot; |
2298 | ||
2299 | if (TREE_CODE (DECL_TEMPLATE_RESULT (newdecl)) == TYPE_DECL) | |
2300 | { | |
2301 | if (COMPLETE_TYPE_P (TREE_TYPE (newdecl)) | |
2302 | && COMPLETE_TYPE_P (TREE_TYPE (olddecl))) | |
9ee5ebeb | 2303 | return G_("redefinition of %q#D"); |
5bd61841 MM |
2304 | return NULL; |
2305 | } | |
2306 | ||
2307 | if (TREE_CODE (DECL_TEMPLATE_RESULT (newdecl)) != FUNCTION_DECL | |
caf93cb0 | 2308 | || (DECL_TEMPLATE_RESULT (newdecl) |
5bd61841 MM |
2309 | == DECL_TEMPLATE_RESULT (olddecl))) |
2310 | return NULL; | |
2311 | ||
2312 | nt = DECL_TEMPLATE_RESULT (newdecl); | |
2313 | if (DECL_TEMPLATE_INFO (nt)) | |
2314 | nt = DECL_TEMPLATE_RESULT (template_for_substitution (nt)); | |
2315 | ot = DECL_TEMPLATE_RESULT (olddecl); | |
2316 | if (DECL_TEMPLATE_INFO (ot)) | |
2317 | ot = DECL_TEMPLATE_RESULT (template_for_substitution (ot)); | |
3a47c4e4 AO |
2318 | if (DECL_INITIAL (nt) && DECL_INITIAL (ot) |
2319 | && (!GNU_INLINE_P (ot) || GNU_INLINE_P (nt))) | |
9ee5ebeb | 2320 | return G_("redefinition of %q#D"); |
5bd61841 | 2321 | |
3a47c4e4 AO |
2322 | if (DECL_DECLARED_INLINE_P (ot) && DECL_DECLARED_INLINE_P (nt)) |
2323 | { | |
2324 | bool olda = GNU_INLINE_P (ot); | |
2325 | bool newa = GNU_INLINE_P (nt); | |
2326 | ||
2327 | if (olda != newa) | |
2328 | { | |
2329 | if (newa) | |
9ee5ebeb SZ |
2330 | return G_("%q+D redeclared inline with " |
2331 | "%<gnu_inline%> attribute"); | |
3a47c4e4 | 2332 | else |
9ee5ebeb SZ |
2333 | return G_("%q+D redeclared inline without " |
2334 | "%<gnu_inline%> attribute"); | |
3a47c4e4 AO |
2335 | } |
2336 | } | |
2337 | ||
9b7dd5e8 DG |
2338 | /* Core issue #226 (C++0x): |
2339 | ||
2340 | If a friend function template declaration specifies a | |
2341 | default template-argument, that declaration shall be a | |
2342 | definition and shall be the only declaration of the | |
2343 | function template in the translation unit. */ | |
c1ae8be5 | 2344 | if ((cxx_dialect != cxx98) |
9b7dd5e8 DG |
2345 | && TREE_CODE (ot) == FUNCTION_DECL && DECL_FRIEND_P (ot) |
2346 | && !check_default_tmpl_args (nt, DECL_TEMPLATE_PARMS (newdecl), | |
2347 | /*is_primary=*/1, /*is_partial=*/0, | |
2348 | /*is_friend_decl=*/2)) | |
9ee5ebeb SZ |
2349 | return G_("redeclaration of friend %q#D " |
2350 | "may not have default template arguments"); | |
9b7dd5e8 | 2351 | |
5bd61841 | 2352 | return NULL; |
51c184be | 2353 | } |
31a79236 | 2354 | else if (TREE_CODE (newdecl) == VAR_DECL |
1799e5d5 RH |
2355 | && DECL_THREAD_LOCAL_P (newdecl) != DECL_THREAD_LOCAL_P (olddecl) |
2356 | && (! DECL_LANG_SPECIFIC (olddecl) | |
2357 | || ! CP_DECL_THREADPRIVATE_P (olddecl) | |
2358 | || DECL_THREAD_LOCAL_P (newdecl))) | |
31a79236 JJ |
2359 | { |
2360 | /* Only variables can be thread-local, and all declarations must | |
2361 | agree on this property. */ | |
2362 | if (DECL_THREAD_LOCAL_P (newdecl)) | |
9ee5ebeb SZ |
2363 | return G_("thread-local declaration of %q#D follows " |
2364 | "non-thread-local declaration"); | |
31a79236 | 2365 | else |
9ee5ebeb SZ |
2366 | return G_("non-thread-local declaration of %q#D follows " |
2367 | "thread-local declaration"); | |
31a79236 | 2368 | } |
1f51a992 | 2369 | else if (toplevel_bindings_p () || DECL_NAMESPACE_SCOPE_P (newdecl)) |
8d08fdba | 2370 | { |
555551c2 MM |
2371 | /* The objects have been declared at namespace scope. If either |
2372 | is a member of an anonymous union, then this is an invalid | |
2373 | redeclaration. For example: | |
2374 | ||
2375 | int i; | |
2376 | union { int i; }; | |
2377 | ||
2378 | is invalid. */ | |
aedfac0e PC |
2379 | if ((TREE_CODE (newdecl) == VAR_DECL && DECL_ANON_UNION_VAR_P (newdecl)) |
2380 | || (TREE_CODE (olddecl) == VAR_DECL && DECL_ANON_UNION_VAR_P (olddecl))) | |
9ee5ebeb | 2381 | return G_("redeclaration of %q#D"); |
555551c2 MM |
2382 | /* If at least one declaration is a reference, there is no |
2383 | conflict. For example: | |
2384 | ||
2385 | int i = 3; | |
2386 | extern int i; | |
2387 | ||
2388 | is valid. */ | |
8d08fdba | 2389 | if (DECL_EXTERNAL (newdecl) || DECL_EXTERNAL (olddecl)) |
6aed477a | 2390 | return NULL; |
8926095f | 2391 | /* Reject two definitions. */ |
9ee5ebeb | 2392 | return G_("redefinition of %q#D"); |
8d08fdba MS |
2393 | } |
2394 | else | |
2395 | { | |
2396 | /* Objects declared with block scope: */ | |
2397 | /* Reject two definitions, and reject a definition | |
2398 | together with an external reference. */ | |
2399 | if (!(DECL_EXTERNAL (newdecl) && DECL_EXTERNAL (olddecl))) | |
9ee5ebeb | 2400 | return G_("redeclaration of %q#D"); |
6aed477a | 2401 | return NULL; |
8d08fdba MS |
2402 | } |
2403 | } | |
2404 | \f | |
1799e5d5 RH |
2405 | /* Hash and equality functions for the named_label table. */ |
2406 | ||
2407 | static hashval_t | |
2408 | named_label_entry_hash (const void *data) | |
2409 | { | |
2410 | const struct named_label_entry *ent = (const struct named_label_entry *) data; | |
2411 | return DECL_UID (ent->label_decl); | |
2412 | } | |
2413 | ||
2414 | static int | |
2415 | named_label_entry_eq (const void *a, const void *b) | |
2416 | { | |
2417 | const struct named_label_entry *ent_a = (const struct named_label_entry *) a; | |
2418 | const struct named_label_entry *ent_b = (const struct named_label_entry *) b; | |
2419 | return ent_a->label_decl == ent_b->label_decl; | |
2420 | } | |
2421 | ||
acef433b | 2422 | /* Create a new label, named ID. */ |
8d08fdba | 2423 | |
acef433b | 2424 | static tree |
11f6b451 | 2425 | make_label_decl (tree id, int local_p) |
8d08fdba | 2426 | { |
1799e5d5 RH |
2427 | struct named_label_entry *ent; |
2428 | void **slot; | |
acef433b | 2429 | tree decl; |
8d08fdba | 2430 | |
c2255bc4 | 2431 | decl = build_decl (input_location, LABEL_DECL, id, void_type_node); |
acef433b MM |
2432 | |
2433 | DECL_CONTEXT (decl) = current_function_decl; | |
2434 | DECL_MODE (decl) = VOIDmode; | |
2435 | C_DECLARED_LABEL_FLAG (decl) = local_p; | |
8d08fdba | 2436 | |
acef433b MM |
2437 | /* Say where one reference is to the label, for the sake of the |
2438 | error if it is not defined. */ | |
f31686a3 | 2439 | DECL_SOURCE_LOCATION (decl) = input_location; |
acef433b MM |
2440 | |
2441 | /* Record the fact that this identifier is bound to this label. */ | |
2442 | SET_IDENTIFIER_LABEL_VALUE (id, decl); | |
2443 | ||
1799e5d5 RH |
2444 | /* Create the label htab for the function on demand. */ |
2445 | if (!named_labels) | |
2446 | named_labels = htab_create_ggc (13, named_label_entry_hash, | |
2447 | named_label_entry_eq, NULL); | |
6625cdb5 | 2448 | |
1799e5d5 RH |
2449 | /* Record this label on the list of labels used in this function. |
2450 | We do this before calling make_label_decl so that we get the | |
2451 | IDENTIFIER_LABEL_VALUE before the new label is declared. */ | |
a9429e29 | 2452 | ent = ggc_alloc_cleared_named_label_entry (); |
1799e5d5 | 2453 | ent->label_decl = decl; |
6625cdb5 | 2454 | |
1799e5d5 RH |
2455 | slot = htab_find_slot (named_labels, ent, INSERT); |
2456 | gcc_assert (*slot == NULL); | |
2457 | *slot = ent; | |
2458 | ||
2459 | return decl; | |
acef433b | 2460 | } |
8d08fdba | 2461 | |
acef433b MM |
2462 | /* Look for a label named ID in the current function. If one cannot |
2463 | be found, create one. (We keep track of used, but undefined, | |
2464 | labels, and complain about them at the end of a function.) */ | |
8d08fdba | 2465 | |
68642fb6 | 2466 | tree |
11f6b451 | 2467 | lookup_label (tree id) |
acef433b MM |
2468 | { |
2469 | tree decl; | |
8d08fdba | 2470 | |
22ffcc6f | 2471 | timevar_push (TV_NAME_LOOKUP); |
acef433b MM |
2472 | /* You can't use labels at global scope. */ |
2473 | if (current_function_decl == NULL_TREE) | |
2474 | { | |
2d01edd7 | 2475 | error ("label %qE referenced outside of any function", id); |
22ffcc6f | 2476 | POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, NULL_TREE); |
acef433b | 2477 | } |
68642fb6 | 2478 | |
acef433b MM |
2479 | /* See if we've already got this label. */ |
2480 | decl = IDENTIFIER_LABEL_VALUE (id); | |
2481 | if (decl != NULL_TREE && DECL_CONTEXT (decl) == current_function_decl) | |
22ffcc6f | 2482 | POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, decl); |
8d08fdba | 2483 | |
acef433b | 2484 | decl = make_label_decl (id, /*local_p=*/0); |
22ffcc6f | 2485 | POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, decl); |
8d08fdba MS |
2486 | } |
2487 | ||
acef433b | 2488 | /* Declare a local label named ID. */ |
8d08fdba MS |
2489 | |
2490 | tree | |
11f6b451 | 2491 | declare_local_label (tree id) |
8d08fdba | 2492 | { |
1799e5d5 | 2493 | tree decl, shadow; |
8d08fdba | 2494 | |
acef433b | 2495 | /* Add a new entry to the SHADOWED_LABELS list so that when we leave |
1799e5d5 RH |
2496 | this scope we can restore the old value of IDENTIFIER_TYPE_VALUE. */ |
2497 | shadow = tree_cons (IDENTIFIER_LABEL_VALUE (id), NULL_TREE, | |
2498 | current_binding_level->shadowed_labels); | |
2499 | current_binding_level->shadowed_labels = shadow; | |
2500 | ||
acef433b | 2501 | decl = make_label_decl (id, /*local_p=*/1); |
1799e5d5 | 2502 | TREE_VALUE (shadow) = decl; |
68642fb6 | 2503 | |
acef433b | 2504 | return decl; |
8d08fdba MS |
2505 | } |
2506 | ||
6625cdb5 JM |
2507 | /* Returns nonzero if it is ill-formed to jump past the declaration of |
2508 | DECL. Returns 2 if it's also a real problem. */ | |
2509 | ||
2510 | static int | |
11f6b451 | 2511 | decl_jump_unsafe (tree decl) |
6625cdb5 | 2512 | { |
c32097d8 JM |
2513 | /* [stmt.dcl]/3: A program that jumps from a point where a local variable |
2514 | with automatic storage duration is not in scope to a point where it is | |
2515 | in scope is ill-formed unless the variable has scalar type, class type | |
2516 | with a trivial default constructor and a trivial destructor, a | |
2517 | cv-qualified version of one of these types, or an array of one of the | |
2518 | preceding types and is declared without an initializer (8.5). */ | |
2519 | tree type = TREE_TYPE (decl); | |
2520 | ||
b88b7ced | 2521 | if (TREE_CODE (decl) != VAR_DECL || TREE_STATIC (decl) |
c32097d8 | 2522 | || type == error_mark_node) |
6625cdb5 JM |
2523 | return 0; |
2524 | ||
c32097d8 JM |
2525 | type = strip_array_types (type); |
2526 | ||
2527 | if (type_has_nontrivial_default_init (TREE_TYPE (decl)) | |
6c06fbce MM |
2528 | || DECL_NONTRIVIALLY_INITIALIZED_P (decl)) |
2529 | return 2; | |
2530 | ||
c32097d8 JM |
2531 | if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (TREE_TYPE (decl))) |
2532 | return 1; | |
6625cdb5 | 2533 | |
c32097d8 | 2534 | return 0; |
6625cdb5 JM |
2535 | } |
2536 | ||
1799e5d5 RH |
2537 | /* A subroutine of check_previous_goto_1 to identify a branch to the user. */ |
2538 | ||
2539 | static void | |
2540 | identify_goto (tree decl, const location_t *locus) | |
2541 | { | |
2542 | if (decl) | |
cbe5f3b3 | 2543 | permerror (input_location, "jump to label %qD", decl); |
1799e5d5 | 2544 | else |
cbe5f3b3 | 2545 | permerror (input_location, "jump to case label"); |
1799e5d5 | 2546 | if (locus) |
69bc6bff | 2547 | permerror (*locus, " from here"); |
1799e5d5 RH |
2548 | } |
2549 | ||
6625cdb5 JM |
2550 | /* Check that a single previously seen jump to a newly defined label |
2551 | is OK. DECL is the LABEL_DECL or 0; LEVEL is the binding_level for | |
2552 | the jump context; NAMES are the names in scope in LEVEL at the jump | |
3db45ab5 | 2553 | context; LOCUS is the source position of the jump or 0. Returns |
1799e5d5 | 2554 | true if all is well. */ |
6625cdb5 | 2555 | |
1799e5d5 RH |
2556 | static bool |
2557 | check_previous_goto_1 (tree decl, struct cp_binding_level* level, tree names, | |
2558 | bool exited_omp, const location_t *locus) | |
2559 | { | |
2560 | struct cp_binding_level *b; | |
2561 | bool identified = false, saw_eh = false, saw_omp = false; | |
2562 | ||
2563 | if (exited_omp) | |
2564 | { | |
2565 | identify_goto (decl, locus); | |
2566 | error (" exits OpenMP structured block"); | |
2567 | identified = saw_omp = true; | |
2568 | } | |
2569 | ||
2570 | for (b = current_binding_level; b ; b = b->level_chain) | |
2571 | { | |
2572 | tree new_decls, old_decls = (b == level ? names : NULL_TREE); | |
2573 | ||
2574 | for (new_decls = b->names; new_decls != old_decls; | |
6625cdb5 JM |
2575 | new_decls = TREE_CHAIN (new_decls)) |
2576 | { | |
2577 | int problem = decl_jump_unsafe (new_decls); | |
2578 | if (! problem) | |
2579 | continue; | |
2580 | ||
1799e5d5 | 2581 | if (!identified) |
6625cdb5 | 2582 | { |
1799e5d5 RH |
2583 | identify_goto (decl, locus); |
2584 | identified = true; | |
6625cdb5 | 2585 | } |
826840d9 | 2586 | if (problem > 1) |
dee15844 | 2587 | error (" crosses initialization of %q+#D", new_decls); |
6625cdb5 | 2588 | else |
c32097d8 JM |
2589 | permerror (input_location, " enters scope of %q+#D which has " |
2590 | "non-trivial destructor", new_decls); | |
6625cdb5 JM |
2591 | } |
2592 | ||
2593 | if (b == level) | |
2594 | break; | |
1799e5d5 | 2595 | if ((b->kind == sk_try || b->kind == sk_catch) && !saw_eh) |
6625cdb5 | 2596 | { |
1799e5d5 | 2597 | if (!identified) |
6625cdb5 | 2598 | { |
1799e5d5 RH |
2599 | identify_goto (decl, locus); |
2600 | identified = true; | |
6625cdb5 | 2601 | } |
a7e8c268 | 2602 | if (b->kind == sk_try) |
826840d9 RH |
2603 | error (" enters try block"); |
2604 | else | |
2605 | error (" enters catch block"); | |
1799e5d5 RH |
2606 | saw_eh = true; |
2607 | } | |
2608 | if (b->kind == sk_omp && !saw_omp) | |
2609 | { | |
2610 | if (!identified) | |
2611 | { | |
2612 | identify_goto (decl, locus); | |
2613 | identified = true; | |
2614 | } | |
2615 | error (" enters OpenMP structured block"); | |
2616 | saw_omp = true; | |
6625cdb5 JM |
2617 | } |
2618 | } | |
6625cdb5 | 2619 | |
1799e5d5 | 2620 | return !identified; |
6625cdb5 JM |
2621 | } |
2622 | ||
2623 | static void | |
1799e5d5 | 2624 | check_previous_goto (tree decl, struct named_label_use_entry *use) |
6625cdb5 | 2625 | { |
1799e5d5 RH |
2626 | check_previous_goto_1 (decl, use->binding_level, |
2627 | use->names_in_scope, use->in_omp_scope, | |
2628 | &use->o_goto_locus); | |
6625cdb5 JM |
2629 | } |
2630 | ||
1799e5d5 RH |
2631 | static bool |
2632 | check_switch_goto (struct cp_binding_level* level) | |
6625cdb5 | 2633 | { |
1799e5d5 | 2634 | return check_previous_goto_1 (NULL_TREE, level, level->names, false, NULL); |
6625cdb5 JM |
2635 | } |
2636 | ||
2637 | /* Check that a new jump to a label DECL is OK. Called by | |
2638 | finish_goto_stmt. */ | |
2639 | ||
2640 | void | |
11f6b451 | 2641 | check_goto (tree decl) |
6625cdb5 | 2642 | { |
1799e5d5 RH |
2643 | struct named_label_entry *ent, dummy; |
2644 | bool saw_catch = false, identified = false; | |
6625cdb5 | 2645 | tree bad; |
6625cdb5 | 2646 | |
1799e5d5 RH |
2647 | /* We can't know where a computed goto is jumping. |
2648 | So we assume that it's OK. */ | |
2649 | if (TREE_CODE (decl) != LABEL_DECL) | |
2650 | return; | |
2651 | ||
2652 | /* We didn't record any information about this label when we created it, | |
2653 | and there's not much point since it's trivial to analyze as a return. */ | |
2654 | if (decl == cdtor_label) | |
e3cd9945 APB |
2655 | return; |
2656 | ||
1799e5d5 RH |
2657 | dummy.label_decl = decl; |
2658 | ent = (struct named_label_entry *) htab_find (named_labels, &dummy); | |
2659 | gcc_assert (ent != NULL); | |
2660 | ||
6625cdb5 JM |
2661 | /* If the label hasn't been defined yet, defer checking. */ |
2662 | if (! DECL_INITIAL (decl)) | |
2663 | { | |
1799e5d5 | 2664 | struct named_label_use_entry *new_use; |
6625cdb5 | 2665 | |
1799e5d5 RH |
2666 | /* Don't bother creating another use if the last goto had the |
2667 | same data, and will therefore create the same set of errors. */ | |
2668 | if (ent->uses | |
2669 | && ent->uses->names_in_scope == current_binding_level->names) | |
2670 | return; | |
6625cdb5 | 2671 | |
a9429e29 | 2672 | new_use = ggc_alloc_named_label_use_entry (); |
1799e5d5 RH |
2673 | new_use->binding_level = current_binding_level; |
2674 | new_use->names_in_scope = current_binding_level->names; | |
2675 | new_use->o_goto_locus = input_location; | |
2676 | new_use->in_omp_scope = false; | |
2677 | ||
2678 | new_use->next = ent->uses; | |
2679 | ent->uses = new_use; | |
2680 | return; | |
2681 | } | |
6625cdb5 | 2682 | |
1799e5d5 RH |
2683 | if (ent->in_try_scope || ent->in_catch_scope |
2684 | || ent->in_omp_scope || ent->bad_decls) | |
6625cdb5 | 2685 | { |
cbe5f3b3 MLI |
2686 | permerror (input_location, "jump to label %q+D", decl); |
2687 | permerror (input_location, " from here"); | |
1799e5d5 | 2688 | identified = true; |
6625cdb5 JM |
2689 | } |
2690 | ||
1799e5d5 | 2691 | for (bad = ent->bad_decls; bad; bad = TREE_CHAIN (bad)) |
6625cdb5 JM |
2692 | { |
2693 | tree b = TREE_VALUE (bad); | |
2694 | int u = decl_jump_unsafe (b); | |
2695 | ||
2696 | if (u > 1 && DECL_ARTIFICIAL (b)) | |
1799e5d5 RH |
2697 | { |
2698 | /* Can't skip init of __exception_info. */ | |
c5d75364 | 2699 | error_at (DECL_SOURCE_LOCATION (b), " enters catch block"); |
1799e5d5 RH |
2700 | saw_catch = true; |
2701 | } | |
6625cdb5 | 2702 | else if (u > 1) |
dee15844 | 2703 | error (" skips initialization of %q+#D", b); |
6625cdb5 | 2704 | else |
c32097d8 JM |
2705 | permerror (input_location, " enters scope of %q+#D which has " |
2706 | "non-trivial destructor", b); | |
6625cdb5 JM |
2707 | } |
2708 | ||
1799e5d5 | 2709 | if (ent->in_try_scope) |
6625cdb5 | 2710 | error (" enters try block"); |
1799e5d5 | 2711 | else if (ent->in_catch_scope && !saw_catch) |
826840d9 | 2712 | error (" enters catch block"); |
1799e5d5 RH |
2713 | |
2714 | if (ent->in_omp_scope) | |
2715 | error (" enters OpenMP structured block"); | |
2716 | else if (flag_openmp) | |
2717 | { | |
2718 | struct cp_binding_level *b; | |
2719 | for (b = current_binding_level; b ; b = b->level_chain) | |
2720 | { | |
2721 | if (b == ent->binding_level) | |
2722 | break; | |
2723 | if (b->kind == sk_omp) | |
2724 | { | |
2725 | if (!identified) | |
2726 | { | |
cbe5f3b3 MLI |
2727 | permerror (input_location, "jump to label %q+D", decl); |
2728 | permerror (input_location, " from here"); | |
1799e5d5 RH |
2729 | identified = true; |
2730 | } | |
2731 | error (" exits OpenMP structured block"); | |
2732 | break; | |
2733 | } | |
2734 | } | |
2735 | } | |
2736 | } | |
2737 | ||
2738 | /* Check that a return is ok wrt OpenMP structured blocks. | |
2739 | Called by finish_return_stmt. Returns true if all is well. */ | |
2740 | ||
2741 | bool | |
2742 | check_omp_return (void) | |
2743 | { | |
2744 | struct cp_binding_level *b; | |
2745 | for (b = current_binding_level; b ; b = b->level_chain) | |
2746 | if (b->kind == sk_omp) | |
2747 | { | |
2748 | error ("invalid exit from OpenMP structured block"); | |
2749 | return false; | |
2750 | } | |
2751 | return true; | |
6625cdb5 JM |
2752 | } |
2753 | ||
8d08fdba | 2754 | /* Define a label, specifying the location in the source file. |
b9c87401 | 2755 | Return the LABEL_DECL node for the label. */ |
8d08fdba MS |
2756 | |
2757 | tree | |
5b030314 | 2758 | define_label (location_t location, tree name) |
8d08fdba | 2759 | { |
1799e5d5 | 2760 | struct named_label_entry *ent, dummy; |
926ce8bd | 2761 | struct cp_binding_level *p; |
1799e5d5 | 2762 | tree decl; |
6625cdb5 | 2763 | |
22ffcc6f | 2764 | timevar_push (TV_NAME_LOOKUP); |
1799e5d5 RH |
2765 | |
2766 | decl = lookup_label (name); | |
2767 | ||
2768 | dummy.label_decl = decl; | |
2769 | ent = (struct named_label_entry *) htab_find (named_labels, &dummy); | |
2770 | gcc_assert (ent != NULL); | |
8d08fdba | 2771 | |
3dc9aec6 | 2772 | /* After labels, make any new cleanups in the function go into their |
8d08fdba | 2773 | own new (temporary) binding contour. */ |
caf93cb0 EC |
2774 | for (p = current_binding_level; |
2775 | p->kind != sk_function_parms; | |
a7e8c268 | 2776 | p = p->level_chain) |
3dc9aec6 | 2777 | p->more_cleanups_ok = 0; |
8d08fdba | 2778 | |
e1cd6e56 | 2779 | if (name == get_identifier ("wchar_t")) |
cbe5f3b3 | 2780 | permerror (input_location, "label named wchar_t"); |
e1cd6e56 | 2781 | |
8d08fdba | 2782 | if (DECL_INITIAL (decl) != NULL_TREE) |
417fa55b LM |
2783 | { |
2784 | error ("duplicate label %qD", decl); | |
2785 | POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, error_mark_node); | |
2786 | } | |
8d08fdba MS |
2787 | else |
2788 | { | |
1799e5d5 RH |
2789 | struct named_label_use_entry *use; |
2790 | ||
8d08fdba MS |
2791 | /* Mark label as having been defined. */ |
2792 | DECL_INITIAL (decl) = error_mark_node; | |
2793 | /* Say where in the source. */ | |
f31686a3 | 2794 | DECL_SOURCE_LOCATION (decl) = location; |
1799e5d5 RH |
2795 | |
2796 | ent->binding_level = current_binding_level; | |
2797 | ent->names_in_scope = current_binding_level->names; | |
2798 | ||
2799 | for (use = ent->uses; use ; use = use->next) | |
2800 | check_previous_goto (decl, use); | |
2801 | ent->uses = NULL; | |
8d08fdba | 2802 | } |
b9c87401 | 2803 | |
be99edf8 | 2804 | POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, decl); |
8d08fdba MS |
2805 | } |
2806 | ||
a5894242 MS |
2807 | struct cp_switch |
2808 | { | |
e2500fed | 2809 | struct cp_binding_level *level; |
a5894242 | 2810 | struct cp_switch *next; |
56cb9733 MM |
2811 | /* The SWITCH_STMT being built. */ |
2812 | tree switch_stmt; | |
2813 | /* A splay-tree mapping the low element of a case range to the high | |
2814 | element, or NULL_TREE if there is no high element. Used to | |
2815 | determine whether or not a new case label duplicates an old case | |
2816 | label. We need a tree, rather than simply a hash table, because | |
2817 | of the GNU case range extension. */ | |
2818 | splay_tree cases; | |
a5894242 MS |
2819 | }; |
2820 | ||
56cb9733 MM |
2821 | /* A stack of the currently active switch statements. The innermost |
2822 | switch statement is on the top of the stack. There is no need to | |
2823 | mark the stack for garbage collection because it is only active | |
2824 | during the processing of the body of a function, and we never | |
2825 | collect at that point. */ | |
5362b086 | 2826 | |
a5894242 MS |
2827 | static struct cp_switch *switch_stack; |
2828 | ||
56cb9733 MM |
2829 | /* Called right after a switch-statement condition is parsed. |
2830 | SWITCH_STMT is the switch statement being parsed. */ | |
2831 | ||
a5894242 | 2832 | void |
11f6b451 | 2833 | push_switch (tree switch_stmt) |
a5894242 | 2834 | { |
0ac1b889 | 2835 | struct cp_switch *p = XNEW (struct cp_switch); |
a5894242 MS |
2836 | p->level = current_binding_level; |
2837 | p->next = switch_stack; | |
56cb9733 MM |
2838 | p->switch_stmt = switch_stmt; |
2839 | p->cases = splay_tree_new (case_compare, NULL, NULL); | |
a5894242 MS |
2840 | switch_stack = p; |
2841 | } | |
2842 | ||
2843 | void | |
11f6b451 | 2844 | pop_switch (void) |
a5894242 | 2845 | { |
6de9cd9a | 2846 | struct cp_switch *cs = switch_stack; |
fbc315db | 2847 | location_t switch_location; |
6de9cd9a DN |
2848 | |
2849 | /* Emit warnings as needed. */ | |
fbc315db ILT |
2850 | if (EXPR_HAS_LOCATION (cs->switch_stmt)) |
2851 | switch_location = EXPR_LOCATION (cs->switch_stmt); | |
2852 | else | |
2853 | switch_location = input_location; | |
dddf9a0a AP |
2854 | if (!processing_template_decl) |
2855 | c_do_switch_warnings (cs->cases, switch_location, | |
2856 | SWITCH_STMT_TYPE (cs->switch_stmt), | |
2857 | SWITCH_STMT_COND (cs->switch_stmt)); | |
5362b086 | 2858 | |
56cb9733 | 2859 | splay_tree_delete (cs->cases); |
a5894242 | 2860 | switch_stack = switch_stack->next; |
bedda2da | 2861 | free (cs); |
a5894242 MS |
2862 | } |
2863 | ||
b0a1da19 JM |
2864 | /* Note that we've seen a definition of a case label, and complain if this |
2865 | is a bad place for one. */ | |
e92cc029 | 2866 | |
3e4d04a1 | 2867 | tree |
c2255bc4 | 2868 | finish_case_label (location_t loc, tree low_value, tree high_value) |
8d08fdba | 2869 | { |
3e4d04a1 | 2870 | tree cond, r; |
926ce8bd | 2871 | struct cp_binding_level *p; |
a5894242 | 2872 | |
56cb9733 MM |
2873 | if (processing_template_decl) |
2874 | { | |
8f17b5c5 MM |
2875 | tree label; |
2876 | ||
56cb9733 MM |
2877 | /* For templates, just add the case label; we'll do semantic |
2878 | analysis at instantiation-time. */ | |
c2255bc4 AH |
2879 | label = build_decl (loc, LABEL_DECL, NULL_TREE, NULL_TREE); |
2880 | return add_stmt (build_case_label (loc, low_value, high_value, label)); | |
56cb9733 MM |
2881 | } |
2882 | ||
2883 | /* Find the condition on which this switch statement depends. */ | |
ebaae582 | 2884 | cond = SWITCH_STMT_COND (switch_stack->switch_stmt); |
56cb9733 MM |
2885 | if (cond && TREE_CODE (cond) == TREE_LIST) |
2886 | cond = TREE_VALUE (cond); | |
56cb9733 | 2887 | |
1799e5d5 RH |
2888 | if (!check_switch_goto (switch_stack->level)) |
2889 | return error_mark_node; | |
2890 | ||
c2255bc4 | 2891 | r = c_add_case_label (loc, switch_stack->cases, cond, |
8c30a510 | 2892 | SWITCH_STMT_TYPE (switch_stack->switch_stmt), |
a6c0a76c | 2893 | low_value, high_value); |
8d08fdba | 2894 | |
3dc9aec6 | 2895 | /* After labels, make any new cleanups in the function go into their |
8d08fdba | 2896 | own new (temporary) binding contour. */ |
caf93cb0 EC |
2897 | for (p = current_binding_level; |
2898 | p->kind != sk_function_parms; | |
a7e8c268 | 2899 | p = p->level_chain) |
3dc9aec6 | 2900 | p->more_cleanups_ok = 0; |
3e4d04a1 RH |
2901 | |
2902 | return r; | |
8d08fdba MS |
2903 | } |
2904 | \f | |
7ddedda4 MM |
2905 | /* Hash a TYPENAME_TYPE. K is really of type `tree'. */ |
2906 | ||
e2500fed | 2907 | static hashval_t |
11f6b451 | 2908 | typename_hash (const void* k) |
7ddedda4 | 2909 | { |
e2500fed | 2910 | hashval_t hash; |
741ac903 | 2911 | const_tree const t = (const_tree) k; |
7ddedda4 | 2912 | |
7bdfd72e KG |
2913 | hash = (htab_hash_pointer (TYPE_CONTEXT (t)) |
2914 | ^ htab_hash_pointer (DECL_NAME (TYPE_NAME (t)))); | |
7ddedda4 MM |
2915 | |
2916 | return hash; | |
2917 | } | |
2918 | ||
fc6a28d7 MM |
2919 | typedef struct typename_info { |
2920 | tree scope; | |
2921 | tree name; | |
2922 | tree template_id; | |
2923 | bool enum_p; | |
2924 | bool class_p; | |
2925 | } typename_info; | |
2926 | ||
06d40de8 DG |
2927 | /* Compare two TYPENAME_TYPEs. K1 is really of type `tree', K2 is |
2928 | really of type `typename_info*' */ | |
7ddedda4 | 2929 | |
e2500fed | 2930 | static int |
11f6b451 | 2931 | typename_compare (const void * k1, const void * k2) |
7ddedda4 | 2932 | { |
741ac903 KG |
2933 | const_tree const t1 = (const_tree) k1; |
2934 | const typename_info *const t2 = (const typename_info *) k2; | |
fc6a28d7 MM |
2935 | |
2936 | return (DECL_NAME (TYPE_NAME (t1)) == t2->name | |
2937 | && TYPE_CONTEXT (t1) == t2->scope | |
2938 | && TYPENAME_TYPE_FULLNAME (t1) == t2->template_id | |
2939 | && TYPENAME_IS_ENUM_P (t1) == t2->enum_p | |
2940 | && TYPENAME_IS_CLASS_P (t1) == t2->class_p); | |
7ddedda4 MM |
2941 | } |
2942 | ||
45869a6c | 2943 | /* Build a TYPENAME_TYPE. If the type is `typename T::t', CONTEXT is |
fc6a28d7 | 2944 | the type of `T', NAME is the IDENTIFIER_NODE for `t'. |
c8094d83 | 2945 | |
45869a6c MM |
2946 | Returns the new TYPENAME_TYPE. */ |
2947 | ||
e2500fed GK |
2948 | static GTY ((param_is (union tree_node))) htab_t typename_htab; |
2949 | ||
8ce33230 | 2950 | static tree |
fc6a28d7 MM |
2951 | build_typename_type (tree context, tree name, tree fullname, |
2952 | enum tag_types tag_type) | |
45869a6c MM |
2953 | { |
2954 | tree t; | |
2955 | tree d; | |
fc6a28d7 | 2956 | typename_info ti; |
fad205ff | 2957 | void **e; |
fc6a28d7 | 2958 | hashval_t hash; |
45869a6c | 2959 | |
e2500fed | 2960 | if (typename_htab == NULL) |
fc6a28d7 MM |
2961 | typename_htab = htab_create_ggc (61, &typename_hash, |
2962 | &typename_compare, NULL); | |
2963 | ||
c8094d83 | 2964 | ti.scope = FROB_CONTEXT (context); |
fc6a28d7 MM |
2965 | ti.name = name; |
2966 | ti.template_id = fullname; | |
2967 | ti.enum_p = tag_type == enum_type; | |
2968 | ti.class_p = (tag_type == class_type | |
2969 | || tag_type == record_type | |
2970 | || tag_type == union_type); | |
2971 | hash = (htab_hash_pointer (ti.scope) | |
2972 | ^ htab_hash_pointer (ti.name)); | |
45869a6c | 2973 | |
7ddedda4 | 2974 | /* See if we already have this type. */ |
fc6a28d7 | 2975 | e = htab_find_slot_with_hash (typename_htab, &ti, hash, INSERT); |
e2500fed GK |
2976 | if (*e) |
2977 | t = (tree) *e; | |
7ddedda4 | 2978 | else |
fc6a28d7 MM |
2979 | { |
2980 | /* Build the TYPENAME_TYPE. */ | |
9e1e64ec | 2981 | t = cxx_make_type (TYPENAME_TYPE); |
fc6a28d7 MM |
2982 | TYPE_CONTEXT (t) = ti.scope; |
2983 | TYPENAME_TYPE_FULLNAME (t) = ti.template_id; | |
2984 | TYPENAME_IS_ENUM_P (t) = ti.enum_p; | |
2985 | TYPENAME_IS_CLASS_P (t) = ti.class_p; | |
c8094d83 | 2986 | |
fc6a28d7 | 2987 | /* Build the corresponding TYPE_DECL. */ |
c2255bc4 | 2988 | d = build_decl (input_location, TYPE_DECL, name, t); |
fc6a28d7 MM |
2989 | TYPE_NAME (TREE_TYPE (d)) = d; |
2990 | TYPE_STUB_DECL (TREE_TYPE (d)) = d; | |
2991 | DECL_CONTEXT (d) = FROB_CONTEXT (context); | |
2992 | DECL_ARTIFICIAL (d) = 1; | |
2993 | ||
2994 | /* Store it in the hash table. */ | |
2995 | *e = t; | |
06d40de8 DG |
2996 | |
2997 | /* TYPENAME_TYPEs must always be compared structurally, because | |
2998 | they may or may not resolve down to another type depending on | |
2999 | the currently open classes. */ | |
3000 | SET_TYPE_STRUCTURAL_EQUALITY (t); | |
fc6a28d7 | 3001 | } |
c8094d83 | 3002 | |
45869a6c MM |
3003 | return t; |
3004 | } | |
3005 | ||
fc6a28d7 MM |
3006 | /* Resolve `typename CONTEXT::NAME'. TAG_TYPE indicates the tag |
3007 | provided to name the type. Returns an appropriate type, unless an | |
3008 | error occurs, in which case error_mark_node is returned. If we | |
3009 | locate a non-artificial TYPE_DECL and TF_KEEP_TYPE_DECL is set, we | |
3010 | return that, rather than the _TYPE it corresponds to, in other | |
3011 | cases we look through the type decl. If TF_ERROR is set, complain | |
3012 | about errors, otherwise be quiet. */ | |
3baa501d | 3013 | |
5566b478 | 3014 | tree |
fc6a28d7 MM |
3015 | make_typename_type (tree context, tree name, enum tag_types tag_type, |
3016 | tsubst_flags_t complain) | |
5566b478 | 3017 | { |
b2b7d40a | 3018 | tree fullname; |
7d3bec9d NS |
3019 | tree t; |
3020 | bool want_template; | |
a80e4195 | 3021 | |
5dc5d13c KL |
3022 | if (name == error_mark_node |
3023 | || context == NULL_TREE | |
3024 | || context == error_mark_node) | |
3025 | return error_mark_node; | |
3026 | ||
2f939d94 | 3027 | if (TYPE_P (name)) |
78638e24 | 3028 | { |
68642fb6 UD |
3029 | if (!(TYPE_LANG_SPECIFIC (name) |
3030 | && (CLASSTYPE_IS_TEMPLATE (name) | |
78638e24 MM |
3031 | || CLASSTYPE_USE_TEMPLATE (name)))) |
3032 | name = TYPE_IDENTIFIER (name); | |
3033 | else | |
3034 | /* Create a TEMPLATE_ID_EXPR for the type. */ | |
3035 | name = build_nt (TEMPLATE_ID_EXPR, | |
3036 | CLASSTYPE_TI_TEMPLATE (name), | |
3037 | CLASSTYPE_TI_ARGS (name)); | |
3038 | } | |
653cc74a | 3039 | else if (TREE_CODE (name) == TYPE_DECL) |
a80e4195 | 3040 | name = DECL_NAME (name); |
b2b7d40a JM |
3041 | |
3042 | fullname = name; | |
3043 | ||
3044 | if (TREE_CODE (name) == TEMPLATE_ID_EXPR) | |
11686454 JM |
3045 | { |
3046 | name = TREE_OPERAND (name, 0); | |
3047 | if (TREE_CODE (name) == TEMPLATE_DECL) | |
3048 | name = TREE_OPERAND (fullname, 0) = DECL_NAME (name); | |
50ef2c18 MM |
3049 | else if (TREE_CODE (name) == OVERLOAD) |
3050 | { | |
3051 | error ("%qD is not a type", name); | |
3052 | return error_mark_node; | |
3053 | } | |
11686454 | 3054 | } |
8a2b77e7 JM |
3055 | if (TREE_CODE (name) == TEMPLATE_DECL) |
3056 | { | |
2d01edd7 | 3057 | error ("%qD used without template parameters", name); |
8a2b77e7 JM |
3058 | return error_mark_node; |
3059 | } | |
50bc768d | 3060 | gcc_assert (TREE_CODE (name) == IDENTIFIER_NODE); |
0c88d886 | 3061 | gcc_assert (TYPE_P (context)); |
04ddee1b | 3062 | |
9e1e64ec | 3063 | if (!MAYBE_CLASS_TYPE_P (context)) |
7d3bec9d NS |
3064 | { |
3065 | if (complain & tf_error) | |
3066 | error ("%q#T is not a class", context); | |
3067 | return error_mark_node; | |
5566b478 | 3068 | } |
7d3bec9d | 3069 | |
1cb801bc JM |
3070 | /* When the CONTEXT is a dependent type, NAME could refer to a |
3071 | dependent base class of CONTEXT. But look inside it anyway | |
3072 | if CONTEXT is a currently open scope, in case it refers to a | |
3073 | member of the current instantiation or a non-dependent base; | |
3074 | lookup will stop when we hit a dependent base. */ | |
3075 | if (!dependent_scope_p (context)) | |
3076 | /* We should only set WANT_TYPE when we're a nested typename type. | |
3077 | Then we can give better diagnostics if we find a non-type. */ | |
5a080ad7 | 3078 | t = lookup_field (context, name, 2, /*want_type=*/true); |
1cb801bc JM |
3079 | else |
3080 | t = NULL_TREE; | |
3081 | ||
5a080ad7 | 3082 | if ((!t || TREE_CODE (t) == TREE_LIST) && dependent_type_p (context)) |
1cb801bc JM |
3083 | return build_typename_type (context, name, fullname, tag_type); |
3084 | ||
7d3bec9d NS |
3085 | want_template = TREE_CODE (fullname) == TEMPLATE_ID_EXPR; |
3086 | ||
7d3bec9d | 3087 | if (!t) |
11249cf0 | 3088 | { |
4f2b0fb2 | 3089 | if (complain & tf_error) |
7d3bec9d NS |
3090 | error (want_template ? "no class template named %q#T in %q#T" |
3091 | : "no type named %q#T in %q#T", name, context); | |
11249cf0 MM |
3092 | return error_mark_node; |
3093 | } | |
7d3bec9d | 3094 | |
5a080ad7 JM |
3095 | /* Pull out the template from an injected-class-name (or multiple). */ |
3096 | if (want_template) | |
3097 | t = maybe_get_template_decl_from_type_decl (t); | |
3098 | ||
3099 | if (TREE_CODE (t) == TREE_LIST) | |
3100 | { | |
3101 | if (complain & tf_error) | |
3102 | { | |
3103 | error ("lookup of %qT in %qT is ambiguous", name, context); | |
3104 | print_candidates (t); | |
3105 | } | |
3106 | return error_mark_node; | |
3107 | } | |
3108 | ||
7d3bec9d NS |
3109 | if (want_template && !DECL_CLASS_TEMPLATE_P (t)) |
3110 | { | |
3111 | if (complain & tf_error) | |
3112 | error ("%<typename %T::%D%> names %q#T, which is not a class template", | |
3113 | context, name, t); | |
3114 | return error_mark_node; | |
3115 | } | |
3116 | if (!want_template && TREE_CODE (t) != TYPE_DECL) | |
3117 | { | |
3118 | if (complain & tf_error) | |
3119 | error ("%<typename %T::%D%> names %q#T, which is not a type", | |
3120 | context, name, t); | |
3121 | return error_mark_node; | |
3122 | } | |
3123 | ||
3124 | if (complain & tf_error) | |
02022f3a | 3125 | perform_or_defer_access_check (TYPE_BINFO (context), t, t); |
7d3bec9d | 3126 | |
aa373032 DS |
3127 | /* If we are currently parsing a template and if T is a typedef accessed |
3128 | through CONTEXT then we need to remember and check access of T at | |
3129 | template instantiation time. */ | |
3130 | add_typedef_to_current_template_for_access_check (t, context, input_location); | |
3131 | ||
7d3bec9d NS |
3132 | if (want_template) |
3133 | return lookup_template_class (t, TREE_OPERAND (fullname, 1), | |
3134 | NULL_TREE, context, | |
3135 | /*entering_scope=*/0, | |
3136 | tf_warning_or_error | tf_user); | |
3137 | ||
3138 | if (DECL_ARTIFICIAL (t) || !(complain & tf_keep_type_decl)) | |
3139 | t = TREE_TYPE (t); | |
3140 | ||
3141 | return t; | |
5566b478 MS |
3142 | } |
3143 | ||
b939a023 | 3144 | /* Resolve `CONTEXT::template NAME'. Returns a TEMPLATE_DECL if the name |
c8094d83 | 3145 | can be resolved or an UNBOUND_CLASS_TEMPLATE, unless an error occurs, |
b939a023 KL |
3146 | in which case error_mark_node is returned. |
3147 | ||
3148 | If PARM_LIST is non-NULL, also make sure that the template parameter | |
3149 | list of TEMPLATE_DECL matches. | |
3150 | ||
3151 | If COMPLAIN zero, don't complain about any errors that occur. */ | |
b8c6534b KL |
3152 | |
3153 | tree | |
b939a023 KL |
3154 | make_unbound_class_template (tree context, tree name, tree parm_list, |
3155 | tsubst_flags_t complain) | |
b8c6534b KL |
3156 | { |
3157 | tree t; | |
3158 | tree d; | |
3159 | ||
3160 | if (TYPE_P (name)) | |
3161 | name = TYPE_IDENTIFIER (name); | |
3162 | else if (DECL_P (name)) | |
3163 | name = DECL_NAME (name); | |
8dc2b103 | 3164 | gcc_assert (TREE_CODE (name) == IDENTIFIER_NODE); |
b8c6534b | 3165 | |
9579624e | 3166 | if (!dependent_type_p (context) |
b8c6534b KL |
3167 | || currently_open_class (context)) |
3168 | { | |
3169 | tree tmpl = NULL_TREE; | |
3170 | ||
9e1e64ec | 3171 | if (MAYBE_CLASS_TYPE_P (context)) |
86ac0575 | 3172 | tmpl = lookup_field (context, name, 0, false); |
b8c6534b KL |
3173 | |
3174 | if (!tmpl || !DECL_CLASS_TEMPLATE_P (tmpl)) | |
3175 | { | |
4f09be91 | 3176 | if (complain & tf_error) |
2d01edd7 | 3177 | error ("no class template named %q#T in %q#T", name, context); |
b8c6534b KL |
3178 | return error_mark_node; |
3179 | } | |
caf93cb0 | 3180 | |
b939a023 KL |
3181 | if (parm_list |
3182 | && !comp_template_parms (DECL_TEMPLATE_PARMS (tmpl), parm_list)) | |
3183 | { | |
3184 | if (complain & tf_error) | |
3185 | { | |
3186 | error ("template parameters do not match template"); | |
dee15844 | 3187 | error ("%q+D declared here", tmpl); |
b939a023 KL |
3188 | } |
3189 | return error_mark_node; | |
3190 | } | |
3191 | ||
2b59fc25 | 3192 | if (complain & tf_error) |
02022f3a | 3193 | perform_or_defer_access_check (TYPE_BINFO (context), tmpl, tmpl); |
b8c6534b KL |
3194 | |
3195 | return tmpl; | |
3196 | } | |
3197 | ||
3198 | /* Build the UNBOUND_CLASS_TEMPLATE. */ | |
9e1e64ec | 3199 | t = cxx_make_type (UNBOUND_CLASS_TEMPLATE); |
b8c6534b KL |
3200 | TYPE_CONTEXT (t) = FROB_CONTEXT (context); |
3201 | TREE_TYPE (t) = NULL_TREE; | |
06d40de8 | 3202 | SET_TYPE_STRUCTURAL_EQUALITY (t); |
b8c6534b KL |
3203 | |
3204 | /* Build the corresponding TEMPLATE_DECL. */ | |
c2255bc4 | 3205 | d = build_decl (input_location, TEMPLATE_DECL, name, t); |
b8c6534b KL |
3206 | TYPE_NAME (TREE_TYPE (d)) = d; |
3207 | TYPE_STUB_DECL (TREE_TYPE (d)) = d; | |
3208 | DECL_CONTEXT (d) = FROB_CONTEXT (context); | |
3209 | DECL_ARTIFICIAL (d) = 1; | |
b939a023 | 3210 | DECL_TEMPLATE_PARMS (d) = parm_list; |
b8c6534b KL |
3211 | |
3212 | return t; | |
3213 | } | |
3214 | ||
8d08fdba | 3215 | \f |
47aa0df4 | 3216 | |
8d08fdba | 3217 | /* Push the declarations of builtin types into the namespace. |
4b0d3cbe MM |
3218 | RID_INDEX is the index of the builtin type in the array |
3219 | RID_POINTERS. NAME is the name used when looking up the builtin | |
3220 | type. TYPE is the _TYPE node for the builtin type. */ | |
8d08fdba | 3221 | |
eaa7c03f | 3222 | void |
caf93cb0 | 3223 | record_builtin_type (enum rid rid_index, |
0cbd7506 MS |
3224 | const char* name, |
3225 | tree type) | |
8d08fdba MS |
3226 | { |
3227 | tree rname = NULL_TREE, tname = NULL_TREE; | |
a703fb38 | 3228 | tree tdecl = NULL_TREE; |
8d08fdba | 3229 | |
0e5921e8 | 3230 | if ((int) rid_index < (int) RID_MAX) |
8d08fdba MS |
3231 | rname = ridpointers[(int) rid_index]; |
3232 | if (name) | |
3233 | tname = get_identifier (name); | |
3234 | ||
4b0d3cbe MM |
3235 | /* The calls to SET_IDENTIFIER_GLOBAL_VALUE below should be |
3236 | eliminated. Built-in types should not be looked up name; their | |
3237 | names are keywords that the parser can recognize. However, there | |
3238 | is code in c-common.c that uses identifier_global_value to look | |
3239 | up built-in types by name. */ | |
8d08fdba MS |
3240 | if (tname) |
3241 | { | |
c2255bc4 | 3242 | tdecl = build_decl (BUILTINS_LOCATION, TYPE_DECL, tname, type); |
4b0d3cbe | 3243 | DECL_ARTIFICIAL (tdecl) = 1; |
a7e8c268 | 3244 | SET_IDENTIFIER_GLOBAL_VALUE (tname, tdecl); |
8d08fdba | 3245 | } |
4b0d3cbe | 3246 | if (rname) |
8d08fdba | 3247 | { |
4b0d3cbe | 3248 | if (!tdecl) |
8d08fdba | 3249 | { |
c2255bc4 | 3250 | tdecl = build_decl (BUILTINS_LOCATION, TYPE_DECL, rname, type); |
4b0d3cbe | 3251 | DECL_ARTIFICIAL (tdecl) = 1; |
8d08fdba | 3252 | } |
4b0d3cbe | 3253 | SET_IDENTIFIER_GLOBAL_VALUE (rname, tdecl); |
8d08fdba | 3254 | } |
4b0d3cbe MM |
3255 | |
3256 | if (!TYPE_NAME (type)) | |
3257 | TYPE_NAME (type) = tdecl; | |
47aa0df4 MM |
3258 | |
3259 | if (tdecl) | |
21d13d83 | 3260 | debug_hooks->type_decl (tdecl, 0); |
8d08fdba MS |
3261 | } |
3262 | ||
eff71ab0 | 3263 | /* Record one of the standard Java types. |
4d8a1dd6 MM |
3264 | * Declare it as having the given NAME. |
3265 | * If SIZE > 0, it is the size of one of the integral types; | |
3266 | * otherwise it is the negative of the size of one of the other types. */ | |
eff71ab0 PB |
3267 | |
3268 | static tree | |
11f6b451 | 3269 | record_builtin_java_type (const char* name, int size) |
eff71ab0 PB |
3270 | { |
3271 | tree type, decl; | |
3272 | if (size > 0) | |
2dc6d666 | 3273 | type = build_nonstandard_integer_type (size, 0); |
eff71ab0 | 3274 | else if (size > -32) |
2dc6d666 AO |
3275 | { |
3276 | tree stype; | |
3277 | /* "__java_char" or ""__java_boolean". */ | |
3278 | type = build_nonstandard_integer_type (-size, 1); | |
3279 | /* Get the signed type cached and attached to the unsigned type, | |
3280 | so it doesn't get garbage-collected at "random" times, | |
3281 | causing potential codegen differences out of different UIDs | |
3282 | and different alias set numbers. */ | |
3283 | stype = build_nonstandard_integer_type (-size, 0); | |
3284 | TREE_CHAIN (type) = stype; | |
70fef63a | 3285 | /*if (size == -1) TREE_SET_CODE (type, BOOLEAN_TYPE);*/ |
eff71ab0 PB |
3286 | } |
3287 | else | |
a1c65f9f | 3288 | { /* "__java_float" or ""__java_double". */ |
ec6a6eb7 | 3289 | type = make_node (REAL_TYPE); |
eff71ab0 PB |
3290 | TYPE_PRECISION (type) = - size; |
3291 | layout_type (type); | |
3292 | } | |
0e5921e8 | 3293 | record_builtin_type (RID_MAX, name, type); |
eff71ab0 | 3294 | decl = TYPE_NAME (type); |
e229f2cd PB |
3295 | |
3296 | /* Suppress generate debug symbol entries for these types, | |
3297 | since for normal C++ they are just clutter. | |
a1c65f9f | 3298 | However, push_lang_context undoes this if extern "Java" is seen. */ |
eff71ab0 | 3299 | DECL_IGNORED_P (decl) = 1; |
e229f2cd | 3300 | |
eff71ab0 PB |
3301 | TYPE_FOR_JAVA (type) = 1; |
3302 | return type; | |
3303 | } | |
3304 | ||
3b426391 | 3305 | /* Push a type into the namespace so that the back ends ignore it. */ |
036407f7 ML |
3306 | |
3307 | static void | |
11f6b451 | 3308 | record_unknown_type (tree type, const char* name) |
036407f7 | 3309 | { |
c2255bc4 AH |
3310 | tree decl = pushdecl (build_decl (UNKNOWN_LOCATION, |
3311 | TYPE_DECL, get_identifier (name), type)); | |
036407f7 ML |
3312 | /* Make sure the "unknown type" typedecl gets ignored for debug info. */ |
3313 | DECL_IGNORED_P (decl) = 1; | |
3314 | TYPE_DECL_SUPPRESS_DEBUG (decl) = 1; | |
3315 | TYPE_SIZE (type) = TYPE_SIZE (void_type_node); | |
3316 | TYPE_ALIGN (type) = 1; | |
11cf4d18 | 3317 | TYPE_USER_ALIGN (type) = 0; |
179d2f74 | 3318 | SET_TYPE_MODE (type, TYPE_MODE (void_type_node)); |
68642fb6 | 3319 | } |
036407f7 | 3320 | |
13a44ee0 | 3321 | /* A string for which we should create an IDENTIFIER_NODE at |
d43829f9 MM |
3322 | startup. */ |
3323 | ||
3324 | typedef struct predefined_identifier | |
3325 | { | |
3326 | /* The name of the identifier. */ | |
8b60264b | 3327 | const char *const name; |
d43829f9 | 3328 | /* The place where the IDENTIFIER_NODE should be stored. */ |
8b60264b | 3329 | tree *const node; |
838dfd8a | 3330 | /* Nonzero if this is the name of a constructor or destructor. */ |
8b60264b | 3331 | const int ctor_or_dtor_p; |
d43829f9 MM |
3332 | } predefined_identifier; |
3333 | ||
3334 | /* Create all the predefined identifiers. */ | |
3335 | ||
3336 | static void | |
11f6b451 | 3337 | initialize_predefined_identifiers (void) |
d43829f9 | 3338 | { |
8b60264b | 3339 | const predefined_identifier *pid; |
d43829f9 MM |
3340 | |
3341 | /* A table of identifiers to create at startup. */ | |
8b60264b | 3342 | static const predefined_identifier predefined_identifiers[] = { |
298d6f60 MM |
3343 | { "C++", &lang_name_cplusplus, 0 }, |
3344 | { "C", &lang_name_c, 0 }, | |
3345 | { "Java", &lang_name_java, 0 }, | |
d6eec208 MM |
3346 | /* Some of these names have a trailing space so that it is |
3347 | impossible for them to conflict with names written by users. */ | |
3348 | { "__ct ", &ctor_identifier, 1 }, | |
3349 | { "__base_ctor ", &base_ctor_identifier, 1 }, | |
3350 | { "__comp_ctor ", &complete_ctor_identifier, 1 }, | |
3351 | { "__dt ", &dtor_identifier, 1 }, | |
3352 | { "__comp_dtor ", &complete_dtor_identifier, 1 }, | |
3353 | { "__base_dtor ", &base_dtor_identifier, 1 }, | |
3354 | { "__deleting_dtor ", &deleting_dtor_identifier, 1 }, | |
298d6f60 | 3355 | { IN_CHARGE_NAME, &in_charge_identifier, 0 }, |
298d6f60 MM |
3356 | { "nelts", &nelts_identifier, 0 }, |
3357 | { THIS_NAME, &this_identifier, 0 }, | |
c4372ef4 | 3358 | { VTABLE_DELTA_NAME, &delta_identifier, 0 }, |
298d6f60 | 3359 | { VTABLE_PFN_NAME, &pfn_identifier, 0 }, |
298d6f60 | 3360 | { "_vptr", &vptr_identifier, 0 }, |
3ec6bad3 | 3361 | { "__vtt_parm", &vtt_parm_identifier, 0 }, |
82a2669e | 3362 | { "::", &global_scope_name, 0 }, |
1f6e1acc | 3363 | { "std", &std_identifier, 0 }, |
298d6f60 | 3364 | { NULL, NULL, 0 } |
d43829f9 MM |
3365 | }; |
3366 | ||
3367 | for (pid = predefined_identifiers; pid->name; ++pid) | |
298d6f60 MM |
3368 | { |
3369 | *pid->node = get_identifier (pid->name); | |
3370 | if (pid->ctor_or_dtor_p) | |
3371 | IDENTIFIER_CTOR_OR_DTOR_P (*pid->node) = 1; | |
3372 | } | |
d43829f9 MM |
3373 | } |
3374 | ||
8d08fdba MS |
3375 | /* Create the predefined scalar types of C, |
3376 | and some nodes representing standard constants (0, 1, (void *)0). | |
3377 | Initialize the global binding level. | |
3378 | Make definitions for built-in primitive functions. */ | |
3379 | ||
3380 | void | |
11f6b451 | 3381 | cxx_init_decl_processing (void) |
8d08fdba | 3382 | { |
10841285 MM |
3383 | tree void_ftype; |
3384 | tree void_ftype_ptr; | |
8d08fdba | 3385 | |
3b9e5d95 | 3386 | build_common_tree_nodes (flag_signed_char); |
6de66680 | 3387 | |
d43829f9 MM |
3388 | /* Create all the identifiers we need. */ |
3389 | initialize_predefined_identifiers (); | |
8d08fdba | 3390 | |
9cd64686 MM |
3391 | /* Create the global variables. */ |
3392 | push_to_top_level (); | |
8012c983 | 3393 | |
82a2669e | 3394 | current_function_decl = NULL_TREE; |
1ec57cf0 | 3395 | current_binding_level = NULL; |
a1c65f9f | 3396 | /* Enter the global namespace. */ |
50bc768d | 3397 | gcc_assert (global_namespace == NULL_TREE); |
82a2669e | 3398 | global_namespace = build_lang_decl (NAMESPACE_DECL, global_scope_name, |
0cbd7506 | 3399 | void_type_node); |
b9e75696 | 3400 | TREE_PUBLIC (global_namespace) = 1; |
ac20c67a | 3401 | begin_scope (sk_namespace, global_namespace); |
82a2669e | 3402 | |
30394414 JM |
3403 | current_lang_name = NULL_TREE; |
3404 | ||
ddbfd28d GK |
3405 | if (flag_visibility_ms_compat) |
3406 | default_visibility = VISIBILITY_HIDDEN; | |
3407 | ||
8d08fdba MS |
3408 | /* Initially, C. */ |
3409 | current_lang_name = lang_name_c; | |
3410 | ||
6bcedb4e | 3411 | /* Create the `std' namespace. */ |
1dbb6023 NS |
3412 | push_namespace (std_identifier); |
3413 | std_node = current_namespace; | |
3414 | pop_namespace (); | |
5362b086 | 3415 | |
eaa7c03f | 3416 | c_common_nodes_and_builtins (); |
37c46b43 | 3417 | |
4d8a1dd6 MM |
3418 | java_byte_type_node = record_builtin_java_type ("__java_byte", 8); |
3419 | java_short_type_node = record_builtin_java_type ("__java_short", 16); | |
3420 | java_int_type_node = record_builtin_java_type ("__java_int", 32); | |
3421 | java_long_type_node = record_builtin_java_type ("__java_long", 64); | |
3422 | java_float_type_node = record_builtin_java_type ("__java_float", -32); | |
3423 | java_double_type_node = record_builtin_java_type ("__java_double", -64); | |
3424 | java_char_type_node = record_builtin_java_type ("__java_char", -16); | |
3425 | java_boolean_type_node = record_builtin_java_type ("__java_boolean", -1); | |
eff71ab0 | 3426 | |
7d60be94 NS |
3427 | integer_two_node = build_int_cst (NULL_TREE, 2); |
3428 | integer_three_node = build_int_cst (NULL_TREE, 3); | |
8d08fdba | 3429 | |
255512c1 | 3430 | record_builtin_type (RID_BOOL, "bool", boolean_type_node); |
de7df9eb JM |
3431 | truthvalue_type_node = boolean_type_node; |
3432 | truthvalue_false_node = boolean_false_node; | |
3433 | truthvalue_true_node = boolean_true_node; | |
2986ae00 | 3434 | |
4cc1d462 | 3435 | empty_except_spec = build_tree_list (NULL_TREE, NULL_TREE); |
3a55fb4c JM |
3436 | noexcept_true_spec = build_tree_list (boolean_true_node, NULL_TREE); |
3437 | noexcept_false_spec = build_tree_list (boolean_false_node, NULL_TREE); | |
5fd8e536 JM |
3438 | |
3439 | #if 0 | |
3e411c3f | 3440 | record_builtin_type (RID_MAX, NULL, string_type_node); |
5fd8e536 JM |
3441 | #endif |
3442 | ||
1f84ec23 MM |
3443 | delta_type_node = ptrdiff_type_node; |
3444 | vtable_index_type = ptrdiff_type_node; | |
c7e266a6 | 3445 | |
3ec6bad3 | 3446 | vtt_parm_type = build_pointer_type (const_ptr_type_node); |
10841285 MM |
3447 | void_ftype = build_function_type (void_type_node, void_list_node); |
3448 | void_ftype_ptr = build_function_type (void_type_node, | |
3449 | tree_cons (NULL_TREE, | |
caf93cb0 | 3450 | ptr_type_node, |
10841285 | 3451 | void_list_node)); |
824b9a4c | 3452 | void_ftype_ptr |
4cc1d462 | 3453 | = build_exception_variant (void_ftype_ptr, empty_except_spec); |
8d08fdba | 3454 | |
8d08fdba MS |
3455 | /* C++ extensions */ |
3456 | ||
fbfc8363 | 3457 | unknown_type_node = make_node (LANG_TYPE); |
036407f7 ML |
3458 | record_unknown_type (unknown_type_node, "unknown type"); |
3459 | ||
8d08fdba MS |
3460 | /* Indirecting an UNKNOWN_TYPE node yields an UNKNOWN_TYPE node. */ |
3461 | TREE_TYPE (unknown_type_node) = unknown_type_node; | |
a6967cc0 | 3462 | |
a6967cc0 JM |
3463 | /* Looking up TYPE_POINTER_TO and TYPE_REFERENCE_TO yield the same |
3464 | result. */ | |
8d08fdba MS |
3465 | TYPE_POINTER_TO (unknown_type_node) = unknown_type_node; |
3466 | TYPE_REFERENCE_TO (unknown_type_node) = unknown_type_node; | |
3467 | ||
fbfc8363 | 3468 | init_list_type_node = make_node (LANG_TYPE); |
09357846 JM |
3469 | record_unknown_type (init_list_type_node, "init list"); |
3470 | ||
c4372ef4 NS |
3471 | { |
3472 | /* Make sure we get a unique function type, so we can give | |
3473 | its pointer type a name. (This wins for gdb.) */ | |
ec6a6eb7 | 3474 | tree vfunc_type = make_node (FUNCTION_TYPE); |
c4372ef4 NS |
3475 | TREE_TYPE (vfunc_type) = integer_type_node; |
3476 | TYPE_ARG_TYPES (vfunc_type) = NULL_TREE; | |
3477 | layout_type (vfunc_type); | |
3478 | ||
3479 | vtable_entry_type = build_pointer_type (vfunc_type); | |
3480 | } | |
0e5921e8 | 3481 | record_builtin_type (RID_MAX, VTBL_PTR_TYPE, vtable_entry_type); |
8d08fdba | 3482 | |
8d08fdba | 3483 | vtbl_type_node |
52bf7d5d | 3484 | = build_cplus_array_type (vtable_entry_type, NULL_TREE); |
8d08fdba | 3485 | layout_type (vtbl_type_node); |
a3360e77 | 3486 | vtbl_type_node = cp_build_qualified_type (vtbl_type_node, TYPE_QUAL_CONST); |
3e411c3f | 3487 | record_builtin_type (RID_MAX, NULL, vtbl_type_node); |
849da744 MM |
3488 | vtbl_ptr_type_node = build_pointer_type (vtable_entry_type); |
3489 | layout_type (vtbl_ptr_type_node); | |
3e411c3f | 3490 | record_builtin_type (RID_MAX, NULL, vtbl_ptr_type_node); |
8d08fdba | 3491 | |
1f84ec23 MM |
3492 | push_namespace (get_identifier ("__cxxabiv1")); |
3493 | abi_node = current_namespace; | |
3494 | pop_namespace (); | |
6633d636 | 3495 | |
ec6a6eb7 | 3496 | global_type_node = make_node (LANG_TYPE); |
036407f7 | 3497 | record_unknown_type (global_type_node, "global type"); |
2c73f9f5 | 3498 | |
db5ae43f MS |
3499 | /* Now, C++. */ |
3500 | current_lang_name = lang_name_cplusplus; | |
8d08fdba | 3501 | |
ced78d8b | 3502 | { |
4b0d3cbe | 3503 | tree newtype, deltype; |
10841285 | 3504 | tree ptr_ftype_sizetype; |
3a55fb4c | 3505 | tree new_eh_spec; |
caf93cb0 EC |
3506 | |
3507 | ptr_ftype_sizetype | |
10841285 MM |
3508 | = build_function_type (ptr_type_node, |
3509 | tree_cons (NULL_TREE, | |
c9f8536c | 3510 | size_type_node, |
10841285 | 3511 | void_list_node)); |
3a55fb4c JM |
3512 | if (cxx_dialect == cxx98) |
3513 | { | |
3514 | tree bad_alloc_id; | |
3515 | tree bad_alloc_type_node; | |
3516 | tree bad_alloc_decl; | |
3517 | ||
3518 | push_namespace (std_identifier); | |
3519 | bad_alloc_id = get_identifier ("bad_alloc"); | |
3520 | bad_alloc_type_node = make_class_type (RECORD_TYPE); | |
3521 | TYPE_CONTEXT (bad_alloc_type_node) = current_namespace; | |
3522 | bad_alloc_decl | |
3523 | = create_implicit_typedef (bad_alloc_id, bad_alloc_type_node); | |
3524 | DECL_CONTEXT (bad_alloc_decl) = current_namespace; | |
3525 | pop_namespace (); | |
3526 | ||
3527 | new_eh_spec | |
3528 | = add_exception_specifier (NULL_TREE, bad_alloc_type_node, -1); | |
3529 | } | |
3530 | else | |
3531 | new_eh_spec = noexcept_false_spec; | |
3532 | ||
3533 | newtype = build_exception_variant (ptr_ftype_sizetype, new_eh_spec); | |
4cc1d462 | 3534 | deltype = build_exception_variant (void_ftype_ptr, empty_except_spec); |
596ea4e5 AS |
3535 | push_cp_library_fn (NEW_EXPR, newtype); |
3536 | push_cp_library_fn (VEC_NEW_EXPR, newtype); | |
3537 | global_delete_fndecl = push_cp_library_fn (DELETE_EXPR, deltype); | |
3538 | push_cp_library_fn (VEC_DELETE_EXPR, deltype); | |
14c2101d | 3539 | |
5116acc6 JM |
3540 | nullptr_type_node = make_node (LANG_TYPE); |
3541 | TYPE_SIZE (nullptr_type_node) = bitsize_int (GET_MODE_BITSIZE (ptr_mode)); | |
3542 | TYPE_SIZE_UNIT (nullptr_type_node) = size_int (GET_MODE_SIZE (ptr_mode)); | |
3543 | TYPE_UNSIGNED (nullptr_type_node) = 1; | |
3544 | TYPE_PRECISION (nullptr_type_node) = GET_MODE_BITSIZE (ptr_mode); | |
3545 | SET_TYPE_MODE (nullptr_type_node, Pmode); | |
3546 | record_builtin_type (RID_MAX, "decltype(nullptr)", nullptr_type_node); | |
3547 | nullptr_node = make_node (INTEGER_CST); | |
3548 | TREE_TYPE (nullptr_node) = nullptr_type_node; | |
ced78d8b | 3549 | } |
8d08fdba MS |
3550 | |
3551 | abort_fndecl | |
1f84ec23 | 3552 | = build_library_fn_ptr ("__cxa_pure_virtual", void_ftype); |
8d08fdba | 3553 | |
8d08fdba MS |
3554 | /* Perform other language dependent initializations. */ |
3555 | init_class_processing (); | |
db48b831 | 3556 | init_rtti_processing (); |
2b110bfc | 3557 | init_template_processing (); |
8d08fdba | 3558 | |
6467930b | 3559 | if (flag_exceptions) |
8d2733ca | 3560 | init_exception_processing (); |
9e9ff709 | 3561 | |
7fcdf4c2 | 3562 | if (! supports_one_only ()) |
72b7eeff | 3563 | flag_weak = 0; |
8d08fdba | 3564 | |
2ce07e2d | 3565 | make_fname_decl = cp_make_fname_decl; |
0ba8a114 | 3566 | start_fname_decls (); |
8d08fdba | 3567 | |
e9a25f70 | 3568 | /* Show we use EH for cleanups. */ |
6de9cd9a DN |
3569 | if (flag_exceptions) |
3570 | using_eh_for_cleanups (); | |
62c154ed JM |
3571 | } |
3572 | ||
0ba8a114 | 3573 | /* Generate an initializer for a function naming variable from |
bb885938 | 3574 | NAME. NAME may be NULL, to indicate a dependent name. TYPE_P is |
f4f206f4 | 3575 | filled in with the type of the init. */ |
0ba8a114 NS |
3576 | |
3577 | tree | |
bb885938 | 3578 | cp_fname_init (const char* name, tree *type_p) |
0ba8a114 NS |
3579 | { |
3580 | tree domain = NULL_TREE; | |
3581 | tree type; | |
3582 | tree init = NULL_TREE; | |
3583 | size_t length = 0; | |
3584 | ||
3585 | if (name) | |
3586 | { | |
3587 | length = strlen (name); | |
3588 | domain = build_index_type (size_int (length)); | |
f0b150ba | 3589 | init = build_string (length + 1, name); |
0ba8a114 | 3590 | } |
caf93cb0 | 3591 | |
a3360e77 | 3592 | type = cp_build_qualified_type (char_type_node, TYPE_QUAL_CONST); |
0ba8a114 NS |
3593 | type = build_cplus_array_type (type, domain); |
3594 | ||
bb885938 | 3595 | *type_p = type; |
caf93cb0 | 3596 | |
0ba8a114 NS |
3597 | if (init) |
3598 | TREE_TYPE (init) = type; | |
3599 | else | |
bb885938 | 3600 | init = error_mark_node; |
caf93cb0 | 3601 | |
0ba8a114 NS |
3602 | return init; |
3603 | } | |
3604 | ||
c2255bc4 AH |
3605 | /* Create the VAR_DECL for __FUNCTION__ etc. ID is the name to give |
3606 | the decl, LOC is the location to give the decl, NAME is the | |
3607 | initialization string and TYPE_DEP indicates whether NAME depended | |
3608 | on the type of the function. We make use of that to detect | |
3609 | __PRETTY_FUNCTION__ inside a template fn. This is being done lazily | |
3610 | at the point of first use, so we mustn't push the decl now. */ | |
2ce07e2d NS |
3611 | |
3612 | static tree | |
c2255bc4 | 3613 | cp_make_fname_decl (location_t loc, tree id, int type_dep) |
2ce07e2d | 3614 | { |
83182544 | 3615 | const char *const name = (type_dep && processing_template_decl |
e913996d | 3616 | ? NULL : fname_as_string (type_dep)); |
bb885938 NS |
3617 | tree type; |
3618 | tree init = cp_fname_init (name, &type); | |
c2255bc4 | 3619 | tree decl = build_decl (loc, VAR_DECL, id, type); |
2ce07e2d | 3620 | |
9e6f2e7d | 3621 | if (name) |
b1d5455a | 3622 | free (CONST_CAST (char *, name)); |
9e6f2e7d | 3623 | |
6cce57b0 | 3624 | /* As we're using pushdecl_with_scope, we must set the context. */ |
0ba8a114 NS |
3625 | DECL_CONTEXT (decl) = current_function_decl; |
3626 | DECL_PRETTY_FUNCTION_P (decl) = type_dep; | |
caf93cb0 | 3627 | |
2ce07e2d NS |
3628 | TREE_STATIC (decl) = 1; |
3629 | TREE_READONLY (decl) = 1; | |
2ce07e2d | 3630 | DECL_ARTIFICIAL (decl) = 1; |
caf93cb0 | 3631 | |
0ba8a114 | 3632 | TREE_USED (decl) = 1; |
5362b086 | 3633 | |
6cce57b0 JM |
3634 | if (current_function_decl) |
3635 | { | |
3636 | struct cp_binding_level *b = current_binding_level; | |
a7e8c268 | 3637 | while (b->level_chain->kind != sk_function_parms) |
6cce57b0 | 3638 | b = b->level_chain; |
d63d5d0c | 3639 | pushdecl_with_scope (decl, b, /*is_friend=*/false); |
3db45ab5 | 3640 | cp_finish_decl (decl, init, /*init_const_expr_p=*/false, NULL_TREE, |
d174af6c | 3641 | LOOKUP_ONLYCONVERTING); |
e913996d | 3642 | } |
ad16ae7f MM |
3643 | else |
3644 | pushdecl_top_level_and_finish (decl, init); | |
caf93cb0 | 3645 | |
2ce07e2d NS |
3646 | return decl; |
3647 | } | |
3648 | ||
c79efc4d | 3649 | static tree |
5779e713 | 3650 | builtin_function_1 (tree decl, tree context, bool is_global) |
c79efc4d RÁE |
3651 | { |
3652 | tree id = DECL_NAME (decl); | |
3653 | const char *name = IDENTIFIER_POINTER (id); | |
8d08fdba | 3654 | |
c79efc4d | 3655 | retrofit_lang_decl (decl); |
0c11ada6 | 3656 | |
c79efc4d RÁE |
3657 | DECL_ARTIFICIAL (decl) = 1; |
3658 | SET_OVERLOADED_OPERATOR_CODE (decl, ERROR_MARK); | |
3659 | SET_DECL_LANGUAGE (decl, lang_c); | |
3660 | /* Runtime library routines are, by definition, available in an | |
3661 | external shared object. */ | |
3662 | DECL_VISIBILITY (decl) = VISIBILITY_DEFAULT; | |
3663 | DECL_VISIBILITY_SPECIFIED (decl) = 1; | |
8d08fdba | 3664 | |
d52e4867 | 3665 | DECL_CONTEXT (decl) = context; |
12a22e76 | 3666 | |
5779e713 MM |
3667 | if (is_global) |
3668 | pushdecl_top_level (decl); | |
3669 | else | |
3670 | pushdecl (decl); | |
6bcedb4e | 3671 | |
d63d5d0c ILT |
3672 | /* A function in the user's namespace should have an explicit |
3673 | declaration before it is used. Mark the built-in function as | |
3674 | anticipated but not actually declared. */ | |
935d1834 ZW |
3675 | if (name[0] != '_' || name[1] != '_') |
3676 | DECL_ANTICIPATED (decl) = 1; | |
012c4da9 JJ |
3677 | else if (strncmp (name + 2, "builtin_", strlen ("builtin_")) != 0) |
3678 | { | |
3679 | size_t len = strlen (name); | |
3680 | ||
3681 | /* Treat __*_chk fortification functions as anticipated as well, | |
3682 | unless they are __builtin_*. */ | |
3683 | if (len > strlen ("___chk") | |
3684 | && memcmp (name + len - strlen ("_chk"), | |
3685 | "_chk", strlen ("_chk") + 1) == 0) | |
3686 | DECL_ANTICIPATED (decl) = 1; | |
3687 | } | |
935d1834 | 3688 | |
8d08fdba MS |
3689 | return decl; |
3690 | } | |
7f4edbcb | 3691 | |
d52e4867 | 3692 | tree |
c79efc4d | 3693 | cxx_builtin_function (tree decl) |
d52e4867 | 3694 | { |
c79efc4d RÁE |
3695 | tree id = DECL_NAME (decl); |
3696 | const char *name = IDENTIFIER_POINTER (id); | |
d52e4867 RS |
3697 | /* All builtins that don't begin with an '_' should additionally |
3698 | go in the 'std' namespace. */ | |
3699 | if (name[0] != '_') | |
3700 | { | |
e5b44dfb | 3701 | tree decl2 = copy_node(decl); |
d52e4867 | 3702 | push_namespace (std_identifier); |
5779e713 MM |
3703 | builtin_function_1 (decl2, std_node, false); |
3704 | pop_namespace (); | |
3705 | } | |
3706 | ||
3707 | return builtin_function_1 (decl, NULL_TREE, false); | |
3708 | } | |
3709 | ||
3710 | /* Like cxx_builtin_function, but guarantee the function is added to the global | |
3711 | scope. This is to allow function specific options to add new machine | |
3712 | dependent builtins when the target ISA changes via attribute((target(...))) | |
3713 | which saves space on program startup if the program does not use non-generic | |
3714 | ISAs. */ | |
3715 | ||
3716 | tree | |
3717 | cxx_builtin_function_ext_scope (tree decl) | |
3718 | { | |
3719 | ||
3720 | tree id = DECL_NAME (decl); | |
3721 | const char *name = IDENTIFIER_POINTER (id); | |
3722 | /* All builtins that don't begin with an '_' should additionally | |
3723 | go in the 'std' namespace. */ | |
3724 | if (name[0] != '_') | |
3725 | { | |
3726 | tree decl2 = copy_node(decl); | |
3727 | push_namespace (std_identifier); | |
3728 | builtin_function_1 (decl2, std_node, true); | |
d52e4867 RS |
3729 | pop_namespace (); |
3730 | } | |
3731 | ||
5779e713 | 3732 | return builtin_function_1 (decl, NULL_TREE, true); |
d52e4867 RS |
3733 | } |
3734 | ||
0c11ada6 JM |
3735 | /* Generate a FUNCTION_DECL with the typical flags for a runtime library |
3736 | function. Not called directly. */ | |
3737 | ||
3738 | static tree | |
11f6b451 | 3739 | build_library_fn_1 (tree name, enum tree_code operator_code, tree type) |
0c11ada6 JM |
3740 | { |
3741 | tree fn = build_lang_decl (FUNCTION_DECL, name, type); | |
3742 | DECL_EXTERNAL (fn) = 1; | |
3743 | TREE_PUBLIC (fn) = 1; | |
3744 | DECL_ARTIFICIAL (fn) = 1; | |
596ea4e5 | 3745 | SET_OVERLOADED_OPERATOR_CODE (fn, operator_code); |
5d2ed28c | 3746 | SET_DECL_LANGUAGE (fn, lang_c); |
73a8adb6 MM |
3747 | /* Runtime library routines are, by definition, available in an |
3748 | external shared object. */ | |
3749 | DECL_VISIBILITY (fn) = VISIBILITY_DEFAULT; | |
3750 | DECL_VISIBILITY_SPECIFIED (fn) = 1; | |
0c11ada6 JM |
3751 | return fn; |
3752 | } | |
c2a37c55 | 3753 | |
0c11ada6 JM |
3754 | /* Returns the _DECL for a library function with C linkage. |
3755 | We assume that such functions never throw; if this is incorrect, | |
3756 | callers should unset TREE_NOTHROW. */ | |
c2a37c55 | 3757 | |
448083e5 | 3758 | static tree |
11f6b451 | 3759 | build_library_fn (tree name, tree type) |
0c11ada6 | 3760 | { |
f59d2aad RH |
3761 | tree fn = build_library_fn_1 (name, ERROR_MARK, type); |
3762 | TREE_NOTHROW (fn) = 1; | |
3763 | return fn; | |
0c11ada6 JM |
3764 | } |
3765 | ||
3766 | /* Returns the _DECL for a library function with C++ linkage. */ | |
3767 | ||
596ea4e5 | 3768 | static tree |
11f6b451 | 3769 | build_cp_library_fn (tree name, enum tree_code operator_code, tree type) |
0c11ada6 | 3770 | { |
596ea4e5 | 3771 | tree fn = build_library_fn_1 (name, operator_code, type); |
0c11ada6 | 3772 | TREE_NOTHROW (fn) = TYPE_NOTHROW_P (type); |
6bbf1598 | 3773 | DECL_CONTEXT (fn) = FROB_CONTEXT (current_namespace); |
5d2ed28c | 3774 | SET_DECL_LANGUAGE (fn, lang_cplusplus); |
0c11ada6 JM |
3775 | return fn; |
3776 | } | |
3777 | ||
3778 | /* Like build_library_fn, but takes a C string instead of an | |
3779 | IDENTIFIER_NODE. */ | |
3780 | ||
3781 | tree | |
11f6b451 | 3782 | build_library_fn_ptr (const char* name, tree type) |
7f4edbcb | 3783 | { |
0c11ada6 JM |
3784 | return build_library_fn (get_identifier (name), type); |
3785 | } | |
3786 | ||
3787 | /* Like build_cp_library_fn, but takes a C string instead of an | |
3788 | IDENTIFIER_NODE. */ | |
3789 | ||
3790 | tree | |
11f6b451 | 3791 | build_cp_library_fn_ptr (const char* name, tree type) |
0c11ada6 | 3792 | { |
596ea4e5 | 3793 | return build_cp_library_fn (get_identifier (name), ERROR_MARK, type); |
0c11ada6 JM |
3794 | } |
3795 | ||
3796 | /* Like build_library_fn, but also pushes the function so that we will | |
448083e5 PC |
3797 | be able to find it via IDENTIFIER_GLOBAL_VALUE. Also, the function |
3798 | may throw exceptions listed in RAISES. */ | |
0c11ada6 JM |
3799 | |
3800 | tree | |
448083e5 | 3801 | push_library_fn (tree name, tree type, tree raises) |
0c11ada6 | 3802 | { |
448083e5 PC |
3803 | tree fn; |
3804 | ||
3805 | if (raises) | |
3806 | type = build_exception_variant (type, raises); | |
3807 | ||
3808 | fn = build_library_fn (name, type); | |
0c11ada6 JM |
3809 | pushdecl_top_level (fn); |
3810 | return fn; | |
3811 | } | |
3812 | ||
3813 | /* Like build_cp_library_fn, but also pushes the function so that it | |
3814 | will be found by normal lookup. */ | |
3815 | ||
596ea4e5 | 3816 | static tree |
11f6b451 | 3817 | push_cp_library_fn (enum tree_code operator_code, tree type) |
0c11ada6 | 3818 | { |
5362b086 | 3819 | tree fn = build_cp_library_fn (ansi_opname (operator_code), |
596ea4e5 AS |
3820 | operator_code, |
3821 | type); | |
0c11ada6 JM |
3822 | pushdecl (fn); |
3823 | return fn; | |
3824 | } | |
3825 | ||
3826 | /* Like push_library_fn, but takes a TREE_LIST of parm types rather than | |
3827 | a FUNCTION_TYPE. */ | |
3828 | ||
3829 | tree | |
11f6b451 | 3830 | push_void_library_fn (tree name, tree parmtypes) |
0c11ada6 JM |
3831 | { |
3832 | tree type = build_function_type (void_type_node, parmtypes); | |
448083e5 | 3833 | return push_library_fn (name, type, NULL_TREE); |
0c11ada6 JM |
3834 | } |
3835 | ||
cf74fb86 | 3836 | /* Like push_library_fn, but also note that this function throws |
0c11ada6 JM |
3837 | and does not return. Used for __throw_foo and the like. */ |
3838 | ||
3839 | tree | |
11f6b451 | 3840 | push_throw_library_fn (tree name, tree type) |
0c11ada6 | 3841 | { |
448083e5 | 3842 | tree fn = push_library_fn (name, type, NULL_TREE); |
0c11ada6 JM |
3843 | TREE_THIS_VOLATILE (fn) = 1; |
3844 | TREE_NOTHROW (fn) = 0; | |
3845 | return fn; | |
7f4edbcb | 3846 | } |
8d08fdba | 3847 | \f |
61a127b3 MM |
3848 | /* When we call finish_struct for an anonymous union, we create |
3849 | default copy constructors and such. But, an anonymous union | |
3850 | shouldn't have such things; this function undoes the damage to the | |
3851 | anonymous union type T. | |
3852 | ||
3853 | (The reason that we create the synthesized methods is that we don't | |
3854 | distinguish `union { int i; }' from `typedef union { int i; } U'. | |
3855 | The first is an anonymous union; the second is just an ordinary | |
3856 | union type.) */ | |
3857 | ||
3858 | void | |
11f6b451 | 3859 | fixup_anonymous_aggr (tree t) |
61a127b3 MM |
3860 | { |
3861 | tree *q; | |
3862 | ||
f4f206f4 | 3863 | /* Wipe out memory of synthesized methods. */ |
0fcedd9c | 3864 | TYPE_HAS_USER_CONSTRUCTOR (t) = 0; |
61a127b3 MM |
3865 | TYPE_HAS_DEFAULT_CONSTRUCTOR (t) = 0; |
3866 | TYPE_HAS_INIT_REF (t) = 0; | |
3867 | TYPE_HAS_CONST_INIT_REF (t) = 0; | |
3868 | TYPE_HAS_ASSIGN_REF (t) = 0; | |
61a127b3 MM |
3869 | TYPE_HAS_CONST_ASSIGN_REF (t) = 0; |
3870 | ||
3871 | /* Splice the implicitly generated functions out of the TYPE_METHODS | |
3872 | list. */ | |
3873 | q = &TYPE_METHODS (t); | |
3874 | while (*q) | |
3875 | { | |
3876 | if (DECL_ARTIFICIAL (*q)) | |
3877 | *q = TREE_CHAIN (*q); | |
3878 | else | |
3879 | q = &TREE_CHAIN (*q); | |
3880 | } | |
3881 | ||
cab1f180 | 3882 | /* ISO C++ 9.5.3. Anonymous unions may not have function members. */ |
61a127b3 | 3883 | if (TYPE_METHODS (t)) |
24f58e74 PC |
3884 | { |
3885 | tree decl = TYPE_MAIN_DECL (t); | |
3886 | ||
3887 | if (TREE_CODE (t) != UNION_TYPE) | |
c5d75364 MLI |
3888 | error_at (DECL_SOURCE_LOCATION (decl), |
3889 | "an anonymous struct cannot have function members"); | |
24f58e74 | 3890 | else |
c5d75364 MLI |
3891 | error_at (DECL_SOURCE_LOCATION (decl), |
3892 | "an anonymous union cannot have function members"); | |
24f58e74 | 3893 | } |
a1c2b86d JJ |
3894 | |
3895 | /* Anonymous aggregates cannot have fields with ctors, dtors or complex | |
3896 | assignment operators (because they cannot have these methods themselves). | |
3897 | For anonymous unions this is already checked because they are not allowed | |
3898 | in any union, otherwise we have to check it. */ | |
3899 | if (TREE_CODE (t) != UNION_TYPE) | |
3900 | { | |
3901 | tree field, type; | |
3902 | ||
3903 | for (field = TYPE_FIELDS (t); field; field = TREE_CHAIN (field)) | |
3904 | if (TREE_CODE (field) == FIELD_DECL) | |
3905 | { | |
3906 | type = TREE_TYPE (field); | |
3907 | if (CLASS_TYPE_P (type)) | |
3908 | { | |
0cbd7506 | 3909 | if (TYPE_NEEDS_CONSTRUCTING (type)) |
dee15844 JM |
3910 | error ("member %q+#D with constructor not allowed " |
3911 | "in anonymous aggregate", field); | |
a1c2b86d | 3912 | if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type)) |
dee15844 JM |
3913 | error ("member %q+#D with destructor not allowed " |
3914 | "in anonymous aggregate", field); | |
a1c2b86d | 3915 | if (TYPE_HAS_COMPLEX_ASSIGN_REF (type)) |
dee15844 JM |
3916 | error ("member %q+#D with copy assignment operator " |
3917 | "not allowed in anonymous aggregate", field); | |
a1c2b86d JJ |
3918 | } |
3919 | } | |
3920 | } | |
61a127b3 MM |
3921 | } |
3922 | ||
72a93143 | 3923 | /* Make sure that a declaration with no declarator is well-formed, i.e. |
a723baf1 | 3924 | just declares a tagged type or anonymous union. |
8d08fdba | 3925 | |
a723baf1 | 3926 | Returns the type declared; or NULL_TREE if none. */ |
8d08fdba | 3927 | |
72a93143 | 3928 | tree |
62d1db17 | 3929 | check_tag_decl (cp_decl_specifier_seq *declspecs) |
8d08fdba | 3930 | { |
62d1db17 MM |
3931 | int saw_friend = declspecs->specs[(int)ds_friend] != 0; |
3932 | int saw_typedef = declspecs->specs[(int)ds_typedef] != 0; | |
a723baf1 MM |
3933 | /* If a class, struct, or enum type is declared by the DECLSPECS |
3934 | (i.e, if a class-specifier, enum-specifier, or non-typename | |
3935 | elaborated-type-specifier appears in the DECLSPECS), | |
3936 | DECLARED_TYPE is set to the corresponding type. */ | |
3937 | tree declared_type = NULL_TREE; | |
3938 | bool error_p = false; | |
8d08fdba | 3939 | |
62d1db17 | 3940 | if (declspecs->multiple_types_p) |
72a93143 | 3941 | error ("multiple types in one declaration"); |
62d1db17 MM |
3942 | else if (declspecs->redefined_builtin_type) |
3943 | { | |
3944 | if (!in_system_header) | |
cbe5f3b3 | 3945 | permerror (input_location, "redeclaration of C++ built-in type %qT", |
37ec60ed | 3946 | declspecs->redefined_builtin_type); |
62d1db17 MM |
3947 | return NULL_TREE; |
3948 | } | |
7e2067ca | 3949 | |
c827f22f MM |
3950 | if (declspecs->type |
3951 | && TYPE_P (declspecs->type) | |
caf93cb0 | 3952 | && ((TREE_CODE (declspecs->type) != TYPENAME_TYPE |
9e1e64ec | 3953 | && MAYBE_CLASS_TYPE_P (declspecs->type)) |
62d1db17 MM |
3954 | || TREE_CODE (declspecs->type) == ENUMERAL_TYPE)) |
3955 | declared_type = declspecs->type; | |
3956 | else if (declspecs->type == error_mark_node) | |
3957 | error_p = true; | |
a723baf1 | 3958 | if (declared_type == NULL_TREE && ! saw_friend && !error_p) |
cbe5f3b3 | 3959 | permerror (input_location, "declaration does not declare anything"); |
1951a1b6 | 3960 | /* Check for an anonymous union. */ |
9e1e64ec | 3961 | else if (declared_type && RECORD_OR_UNION_CODE_P (TREE_CODE (declared_type)) |
a723baf1 | 3962 | && TYPE_ANONYMOUS_P (declared_type)) |
0dd3962d | 3963 | { |
e8186ecf | 3964 | /* 7/3 In a simple-declaration, the optional init-declarator-list |
0cbd7506 MS |
3965 | can be omitted only when declaring a class (clause 9) or |
3966 | enumeration (7.2), that is, when the decl-specifier-seq contains | |
3967 | either a class-specifier, an elaborated-type-specifier with | |
3968 | a class-key (9.1), or an enum-specifier. In these cases and | |
3969 | whenever a class-specifier or enum-specifier is present in the | |
3970 | decl-specifier-seq, the identifiers in these specifiers are among | |
3971 | the names being declared by the declaration (as class-name, | |
3972 | enum-names, or enumerators, depending on the syntax). In such | |
3973 | cases, and except for the declaration of an unnamed bit-field (9.6), | |
3974 | the decl-specifier-seq shall introduce one or more names into the | |
3975 | program, or shall redeclare a name introduced by a previous | |
3976 | declaration. [Example: | |
3977 | enum { }; // ill-formed | |
3978 | typedef class { }; // ill-formed | |
3979 | --end example] */ | |
e8186ecf | 3980 | if (saw_typedef) |
0cbd7506 MS |
3981 | { |
3982 | error ("missing type-name in typedef-declaration"); | |
3983 | return NULL_TREE; | |
3984 | } | |
0dd3962d | 3985 | /* Anonymous unions are objects, so they can have specifiers. */; |
a723baf1 | 3986 | SET_ANON_AGGR_TYPE_P (declared_type); |
6bdb8141 | 3987 | |
fcf73884 | 3988 | if (TREE_CODE (declared_type) != UNION_TYPE && !in_system_header) |
509c9d60 | 3989 | pedwarn (input_location, OPT_pedantic, "ISO C++ prohibits anonymous structs"); |
0dd3962d JM |
3990 | } |
3991 | ||
62d1db17 | 3992 | else |
8d08fdba | 3993 | { |
62d1db17 MM |
3994 | if (declspecs->specs[(int)ds_inline] |
3995 | || declspecs->specs[(int)ds_virtual]) | |
2d01edd7 | 3996 | error ("%qs can only be specified for functions", |
caf93cb0 | 3997 | declspecs->specs[(int)ds_inline] |
62d1db17 MM |
3998 | ? "inline" : "virtual"); |
3999 | else if (saw_friend | |
caf93cb0 | 4000 | && (!current_class_type |
62d1db17 | 4001 | || current_scope () != current_class_type)) |
2d01edd7 | 4002 | error ("%<friend%> can only be specified inside a class"); |
62d1db17 | 4003 | else if (declspecs->specs[(int)ds_explicit]) |
2d01edd7 | 4004 | error ("%<explicit%> can only be specified for constructors"); |
62d1db17 MM |
4005 | else if (declspecs->storage_class) |
4006 | error ("a storage class can only be specified for objects " | |
4007 | "and functions"); | |
4008 | else if (declspecs->specs[(int)ds_const] | |
4009 | || declspecs->specs[(int)ds_volatile] | |
4010 | || declspecs->specs[(int)ds_restrict] | |
4011 | || declspecs->specs[(int)ds_thread]) | |
4012 | error ("qualifiers can only be specified for objects " | |
4013 | "and functions"); | |
41dc91a8 SB |
4014 | else if (saw_typedef) |
4015 | warning (0, "%<typedef%> was ignored in this declaration"); | |
7ecbca9d GDR |
4016 | else if (declspecs->specs[(int) ds_constexpr]) |
4017 | error ("%<constexpr> cannot be used for type declarations"); | |
72a93143 | 4018 | } |
8d08fdba | 4019 | |
a723baf1 | 4020 | return declared_type; |
72a93143 JM |
4021 | } |
4022 | ||
4023 | /* Called when a declaration is seen that contains no names to declare. | |
4024 | If its type is a reference to a structure, union or enum inherited | |
4025 | from a containing scope, shadow that tag name for the current scope | |
4026 | with a forward reference. | |
4027 | If its type defines a new named structure or union | |
4028 | or defines an enum, it is valid but we need not do anything here. | |
4029 | Otherwise, it is an error. | |
4030 | ||
4031 | C++: may have to grok the declspecs to learn about static, | |
caf93cb0 | 4032 | complain for anonymous unions. |
72a93143 | 4033 | |
a723baf1 MM |
4034 | Returns the TYPE declared -- or NULL_TREE if none. */ |
4035 | ||
4036 | tree | |
62d1db17 | 4037 | shadow_tag (cp_decl_specifier_seq *declspecs) |
72a93143 JM |
4038 | { |
4039 | tree t = check_tag_decl (declspecs); | |
4040 | ||
a723baf1 MM |
4041 | if (!t) |
4042 | return NULL_TREE; | |
4043 | ||
3cabd8f9 MA |
4044 | if (declspecs->attributes) |
4045 | { | |
dee15844 JM |
4046 | warning (0, "attribute ignored in declaration of %q+#T", t); |
4047 | warning (0, "attribute for %q+#T must follow the %qs keyword", | |
4048 | t, class_key_or_enum_as_string (t)); | |
3cabd8f9 MA |
4049 | |
4050 | } | |
4051 | ||
d2a8ac2c LM |
4052 | if (maybe_process_partial_specialization (t) == error_mark_node) |
4053 | return NULL_TREE; | |
72a93143 JM |
4054 | |
4055 | /* This is where the variables in an anonymous union are | |
4056 | declared. An anonymous union declaration looks like: | |
4057 | union { ... } ; | |
4058 | because there is no declarator after the union, the parser | |
4059 | sends that declaration here. */ | |
a723baf1 | 4060 | if (ANON_AGGR_TYPE_P (t)) |
72a93143 | 4061 | { |
6bdb8141 | 4062 | fixup_anonymous_aggr (t); |
72a93143 JM |
4063 | |
4064 | if (TYPE_FIELDS (t)) | |
4065 | { | |
caf93cb0 | 4066 | tree decl = grokdeclarator (/*declarator=*/NULL, |
058b15c1 | 4067 | declspecs, NORMAL, 0, NULL); |
72a93143 JM |
4068 | finish_anon_union (decl); |
4069 | } | |
8d08fdba | 4070 | } |
a723baf1 MM |
4071 | |
4072 | return t; | |
8d08fdba MS |
4073 | } |
4074 | \f | |
4075 | /* Decode a "typename", such as "int **", returning a ..._TYPE node. */ | |
4076 | ||
4077 | tree | |
caf93cb0 | 4078 | groktypename (cp_decl_specifier_seq *type_specifiers, |
0d9c0892 JM |
4079 | const cp_declarator *declarator, |
4080 | bool is_template_arg) | |
8d08fdba | 4081 | { |
62d1db17 | 4082 | tree attrs; |
98884b26 | 4083 | tree type; |
0d9c0892 JM |
4084 | enum decl_context context |
4085 | = is_template_arg ? TEMPLATE_TYPE_ARG : TYPENAME; | |
62d1db17 MM |
4086 | attrs = type_specifiers->attributes; |
4087 | type_specifiers->attributes = NULL_TREE; | |
0d9c0892 | 4088 | type = grokdeclarator (declarator, type_specifiers, context, 0, &attrs); |
ba19e12f | 4089 | if (attrs && type != error_mark_node) |
c206a697 JM |
4090 | { |
4091 | if (CLASS_TYPE_P (type)) | |
b2a7def5 JM |
4092 | warning (OPT_Wattributes, "ignoring attributes applied to class type %qT " |
4093 | "outside of definition", type); | |
9e1e64ec | 4094 | else if (MAYBE_CLASS_TYPE_P (type)) |
b2a7def5 JM |
4095 | /* A template type parameter or other dependent type. */ |
4096 | warning (OPT_Wattributes, "ignoring attributes applied to dependent " | |
4097 | "type %qT without an associated declaration", type); | |
c206a697 JM |
4098 | else |
4099 | cplus_decl_attributes (&type, attrs, 0); | |
4100 | } | |
98884b26 | 4101 | return type; |
8d08fdba MS |
4102 | } |
4103 | ||
15896502 MM |
4104 | /* Process a DECLARATOR for a function-scope variable declaration, |
4105 | namespace-scope variable declaration, or function declaration. | |
4106 | (Function definitions go through start_function; class member | |
4107 | declarations appearing in the body of the class go through | |
4108 | grokfield.) The DECL corresponding to the DECLARATOR is returned. | |
4109 | If an error occurs, the error_mark_node is returned instead. | |
4110 | ||
4ad610c9 JM |
4111 | DECLSPECS are the decl-specifiers for the declaration. INITIALIZED is |
4112 | SD_INITIALIZED if an explicit initializer is present, or SD_DEFAULTED | |
4113 | for an explicitly defaulted function, or SD_DELETED for an explicitly | |
4114 | deleted function, but 0 (SD_UNINITIALIZED) if this is a variable | |
4115 | implicitly initialized via a default constructor. ATTRIBUTES and | |
4116 | PREFIX_ATTRIBUTES are GNU attributes associated with this declaration. | |
4117 | *PUSHED_SCOPE_P is set to the scope entered in this function, if any; if | |
4118 | set, the caller is responsible for calling pop_scope. */ | |
8d08fdba | 4119 | |
8d08fdba | 4120 | tree |
caf93cb0 | 4121 | start_decl (const cp_declarator *declarator, |
62d1db17 | 4122 | cp_decl_specifier_seq *declspecs, |
0cbd7506 MS |
4123 | int initialized, |
4124 | tree attributes, | |
4125 | tree prefix_attributes, | |
4514aa8c | 4126 | tree *pushed_scope_p) |
8d08fdba | 4127 | { |
59387d2e | 4128 | tree decl; |
8d08fdba | 4129 | tree context; |
c3b7031d | 4130 | bool was_public; |
317c435f | 4131 | int flags; |
8d08fdba | 4132 | |
4514aa8c | 4133 | *pushed_scope_p = NULL_TREE; |
c8094d83 | 4134 | |
e23bd218 IR |
4135 | /* An object declared as __attribute__((deprecated)) suppresses |
4136 | warnings of uses of other deprecated items. */ | |
4137 | if (lookup_attribute ("deprecated", attributes)) | |
4138 | deprecated_state = DEPRECATED_SUPPRESS; | |
4139 | ||
91d231cb | 4140 | attributes = chainon (attributes, prefix_attributes); |
b17e2870 | 4141 | |
c11b6f21 | 4142 | decl = grokdeclarator (declarator, declspecs, NORMAL, initialized, |
91d231cb | 4143 | &attributes); |
68642fb6 | 4144 | |
e23bd218 IR |
4145 | deprecated_state = DEPRECATED_NORMAL; |
4146 | ||
2d00b4f2 AP |
4147 | if (decl == NULL_TREE || TREE_CODE (decl) == VOID_TYPE |
4148 | || decl == error_mark_node) | |
44370687 | 4149 | return error_mark_node; |
8d08fdba | 4150 | |
4f1c5b7d | 4151 | context = DECL_CONTEXT (decl); |
8d08fdba | 4152 | |
73a8adb6 | 4153 | if (context) |
4514aa8c NS |
4154 | { |
4155 | *pushed_scope_p = push_scope (context); | |
c8094d83 | 4156 | |
4514aa8c NS |
4157 | /* We are only interested in class contexts, later. */ |
4158 | if (TREE_CODE (context) == NAMESPACE_DECL) | |
4159 | context = NULL_TREE; | |
4160 | } | |
2c73f9f5 | 4161 | |
8d08fdba MS |
4162 | if (initialized) |
4163 | /* Is it valid for this decl to have an initializer at all? | |
4164 | If not, set INITIALIZED to zero, which will indirectly | |
82580166 | 4165 | tell `cp_finish_decl' to ignore the initializer once it is parsed. */ |
8d08fdba MS |
4166 | switch (TREE_CODE (decl)) |
4167 | { | |
4168 | case TYPE_DECL: | |
b87d79e6 | 4169 | error ("typedef %qD is initialized (use decltype instead)", decl); |
cc011e7f | 4170 | return error_mark_node; |
8d08fdba MS |
4171 | |
4172 | case FUNCTION_DECL: | |
4ad610c9 | 4173 | if (initialized == SD_DELETED) |
b87d79e6 JM |
4174 | /* We'll handle the rest of the semantics later, but we need to |
4175 | set this now so it's visible to duplicate_decls. */ | |
4176 | DECL_DELETED_FN (decl) = 1; | |
4177 | break; | |
8d08fdba MS |
4178 | |
4179 | default: | |
3e41d13b | 4180 | break; |
8d08fdba MS |
4181 | } |
4182 | ||
8d08fdba MS |
4183 | if (initialized) |
4184 | { | |
a9aedbc2 | 4185 | if (! toplevel_bindings_p () |
8d08fdba | 4186 | && DECL_EXTERNAL (decl)) |
d4ee4d25 | 4187 | warning (0, "declaration of %q#D has %<extern%> and is initialized", |
0cbd7506 | 4188 | decl); |
8d08fdba | 4189 | DECL_EXTERNAL (decl) = 0; |
5566b478 | 4190 | if (toplevel_bindings_p ()) |
8d08fdba | 4191 | TREE_STATIC (decl) = 1; |
8d08fdba MS |
4192 | } |
4193 | ||
317c435f JM |
4194 | /* If this is a typedef that names the class for linkage purposes |
4195 | (7.1.3p8), apply any attributes directly to the type. */ | |
4196 | if (TREE_CODE (decl) == TYPE_DECL | |
4197 | && TAGGED_TYPE_P (TREE_TYPE (decl)) | |
4198 | && decl == TYPE_NAME (TYPE_MAIN_VARIANT (TREE_TYPE (decl)))) | |
4199 | flags = ATTR_FLAG_TYPE_IN_PLACE; | |
4200 | else | |
4201 | flags = 0; | |
4202 | ||
fa20888b | 4203 | /* Set attributes here so if duplicate decl, will have proper attributes. */ |
317c435f | 4204 | cplus_decl_attributes (&decl, attributes, flags); |
fa20888b | 4205 | |
4e2bb0a4 DS |
4206 | /* Dllimported symbols cannot be defined. Static data members (which |
4207 | can be initialized in-class and dllimported) go through grokfield, | |
4208 | not here, so we don't need to exclude those decls when checking for | |
4209 | a definition. */ | |
4210 | if (initialized && DECL_DLLIMPORT_P (decl)) | |
4211 | { | |
4212 | error ("definition of %q#D is marked %<dllimport%>", decl); | |
4213 | DECL_DLLIMPORT_P (decl) = 0; | |
4214 | } | |
4215 | ||
ecb0eece | 4216 | /* If #pragma weak was used, mark the decl weak now. */ |
3693d46c | 4217 | maybe_apply_pragma_weak (decl); |
ecb0eece | 4218 | |
97055d5c AO |
4219 | if (TREE_CODE (decl) == FUNCTION_DECL |
4220 | && DECL_DECLARED_INLINE_P (decl) | |
4221 | && DECL_UNINLINABLE (decl) | |
4222 | && lookup_attribute ("noinline", DECL_ATTRIBUTES (decl))) | |
dee15844 | 4223 | warning (0, "inline function %q+D given attribute noinline", decl); |
97055d5c | 4224 | |
d0f062fb | 4225 | if (context && COMPLETE_TYPE_P (complete_type (context))) |
5b605f68 MS |
4226 | { |
4227 | if (TREE_CODE (decl) == VAR_DECL) | |
4228 | { | |
86ac0575 | 4229 | tree field = lookup_field (context, DECL_NAME (decl), 0, false); |
5b605f68 | 4230 | if (field == NULL_TREE || TREE_CODE (field) != VAR_DECL) |
2d01edd7 | 4231 | error ("%q#D is not a static member of %q#T", decl, context); |
e349ee73 MS |
4232 | else |
4233 | { | |
4234 | if (DECL_CONTEXT (field) != context) | |
f2d773a2 | 4235 | { |
a723baf1 | 4236 | if (!same_type_p (DECL_CONTEXT (field), context)) |
cbe5f3b3 | 4237 | permerror (input_location, "ISO C++ does not permit %<%T::%D%> " |
37ec60ed JW |
4238 | "to be defined as %<%T::%D%>", |
4239 | DECL_CONTEXT (field), DECL_NAME (decl), | |
4240 | context, DECL_NAME (decl)); | |
f2d773a2 JM |
4241 | DECL_CONTEXT (decl) = DECL_CONTEXT (field); |
4242 | } | |
91146169 GB |
4243 | if (processing_specialization |
4244 | && template_class_depth (context) == 0 | |
4245 | && CLASSTYPE_TEMPLATE_SPECIALIZATION (context)) | |
4246 | error ("template header not allowed in member definition " | |
4247 | "of explicitly specialized class"); | |
75650646 MM |
4248 | /* Static data member are tricky; an in-class initialization |
4249 | still doesn't provide a definition, so the in-class | |
4250 | declaration will have DECL_EXTERNAL set, but will have an | |
4251 | initialization. Thus, duplicate_decls won't warn | |
4252 | about this situation, and so we check here. */ | |
e92fb501 | 4253 | if (initialized && DECL_INITIALIZED_IN_CLASS_P (field)) |
9e637a26 | 4254 | error ("duplicate initialization of %qD", decl); |
d63d5d0c | 4255 | if (duplicate_decls (decl, field, /*newdecl_is_friend=*/false)) |
e349ee73 | 4256 | decl = field; |
7ecbca9d GDR |
4257 | if (declspecs->specs[(int) ds_constexpr] |
4258 | && !DECL_DECLARED_CONSTEXPR_P (field)) | |
4259 | error ("%qD declared %<constexpr%> outside its class", field); | |
e349ee73 | 4260 | } |
5b605f68 | 4261 | } |
f30432d7 MS |
4262 | else |
4263 | { | |
d43f603d | 4264 | tree field = check_classfn (context, decl, |
44021471 GB |
4265 | (processing_template_decl |
4266 | > template_class_depth (context)) | |
4267 | ? current_template_parms | |
4268 | : NULL_TREE); | |
f8c3b097 PC |
4269 | if (field && field != error_mark_node |
4270 | && duplicate_decls (decl, field, | |
4271 | /*newdecl_is_friend=*/false)) | |
f30432d7 MS |
4272 | decl = field; |
4273 | } | |
4274 | ||
4275 | /* cp_finish_decl sets DECL_EXTERNAL if DECL_IN_AGGR_P is set. */ | |
dff3e828 | 4276 | DECL_IN_AGGR_P (decl) = 0; |
9267ee62 NS |
4277 | /* Do not mark DECL as an explicit specialization if it was not |
4278 | already marked as an instantiation; a declaration should | |
4279 | never be marked as a specialization unless we know what | |
c8094d83 | 4280 | template is being specialized. */ |
9267ee62 | 4281 | if (DECL_LANG_SPECIFIC (decl) && DECL_USE_TEMPLATE (decl)) |
84e6233f | 4282 | { |
9267ee62 | 4283 | SET_DECL_TEMPLATE_SPECIALIZATION (decl); |
c8094d83 | 4284 | |
84e6233f JM |
4285 | /* [temp.expl.spec] An explicit specialization of a static data |
4286 | member of a template is a definition if the declaration | |
4287 | includes an initializer; otherwise, it is a declaration. | |
c8094d83 | 4288 | |
84e6233f JM |
4289 | We check for processing_specialization so this only applies |
4290 | to the new specialization syntax. */ | |
e92fb501 | 4291 | if (!initialized && processing_specialization) |
84e6233f JM |
4292 | DECL_EXTERNAL (decl) = 1; |
4293 | } | |
f30432d7 | 4294 | |
b7698cf0 | 4295 | if (DECL_EXTERNAL (decl) && ! DECL_TEMPLATE_SPECIALIZATION (decl)) |
cbe5f3b3 | 4296 | permerror (input_location, "declaration of %q#D outside of class is not definition", |
37ec60ed | 4297 | decl); |
7ecbca9d GDR |
4298 | |
4299 | if (!ensure_literal_type_for_constexpr_object (decl)) | |
4300 | return error_mark_node; | |
5b605f68 MS |
4301 | } |
4302 | ||
c3b7031d JM |
4303 | was_public = TREE_PUBLIC (decl); |
4304 | ||
9188c363 | 4305 | /* Enter this declaration into the symbol table. */ |
15896502 | 4306 | decl = maybe_push_decl (decl); |
2ee887f2 | 4307 | |
5156628f | 4308 | if (processing_template_decl) |
15896502 MM |
4309 | decl = push_template_decl (decl); |
4310 | if (decl == error_mark_node) | |
156fc2bb | 4311 | return error_mark_node; |
5566b478 | 4312 | |
3b426391 | 4313 | /* Tell the back end to use or not use .common as appropriate. If we say |
a50f0918 MS |
4314 | -fconserve-space, we want this to save .data space, at the expense of |
4315 | wrong semantics. If we say -fno-conserve-space, we want this to | |
4316 | produce errors about redefs; to do this we force variables into the | |
4317 | data segment. */ | |
434aeebb | 4318 | if (flag_conserve_space |
15896502 MM |
4319 | && TREE_CODE (decl) == VAR_DECL |
4320 | && TREE_PUBLIC (decl) | |
4321 | && !DECL_THREAD_LOCAL_P (decl) | |
434aeebb | 4322 | && !have_global_bss_p ()) |
15896502 | 4323 | DECL_COMMON (decl) = 1; |
68642fb6 | 4324 | |
15896502 MM |
4325 | if (TREE_CODE (decl) == VAR_DECL |
4326 | && DECL_NAMESPACE_SCOPE_P (decl) && !TREE_PUBLIC (decl) && !was_public | |
4327 | && !DECL_THIS_STATIC (decl) && !DECL_ARTIFICIAL (decl)) | |
c3b7031d JM |
4328 | { |
4329 | /* This is a const variable with implicit 'static'. Set | |
4330 | DECL_THIS_STATIC so we can tell it from variables that are | |
4331 | !TREE_PUBLIC because of the anonymous namespace. */ | |
a3360e77 | 4332 | gcc_assert (CP_TYPE_CONST_P (TREE_TYPE (decl))); |
15896502 | 4333 | DECL_THIS_STATIC (decl) = 1; |
c3b7031d JM |
4334 | } |
4335 | ||
15896502 MM |
4336 | if (!processing_template_decl && TREE_CODE (decl) == VAR_DECL) |
4337 | start_decl_1 (decl, initialized); | |
8d08fdba | 4338 | |
15896502 | 4339 | return decl; |
8d08fdba MS |
4340 | } |
4341 | ||
15896502 MM |
4342 | /* Process the declaration of a variable DECL. INITIALIZED is true |
4343 | iff DECL is explicitly initialized. (INITIALIZED is false if the | |
4344 | variable is initialized via an implicitly-called constructor.) | |
4345 | This function must be called for ordinary variables (including, for | |
4346 | example, implicit instantiations of templates), but must not be | |
4347 | called for template declarations. */ | |
4348 | ||
5566b478 | 4349 | void |
e92fb501 | 4350 | start_decl_1 (tree decl, bool initialized) |
8d08fdba | 4351 | { |
e92fb501 | 4352 | tree type; |
15896502 MM |
4353 | bool complete_p; |
4354 | bool aggregate_definition_p; | |
8d08fdba | 4355 | |
e92fb501 MM |
4356 | gcc_assert (!processing_template_decl); |
4357 | ||
4358 | if (error_operand_p (decl)) | |
44689c12 ML |
4359 | return; |
4360 | ||
e92fb501 | 4361 | gcc_assert (TREE_CODE (decl) == VAR_DECL); |
15896502 | 4362 | |
e92fb501 | 4363 | type = TREE_TYPE (decl); |
15896502 | 4364 | complete_p = COMPLETE_TYPE_P (type); |
9e1e64ec | 4365 | aggregate_definition_p = MAYBE_CLASS_TYPE_P (type) && !DECL_EXTERNAL (decl); |
15896502 MM |
4366 | |
4367 | /* If an explicit initializer is present, or if this is a definition | |
4368 | of an aggregate, then we need a complete type at this point. | |
4369 | (Scalars are always complete types, so there is nothing to | |
4370 | check.) This code just sets COMPLETE_P; errors (if necessary) | |
4371 | are issued below. */ | |
4372 | if ((initialized || aggregate_definition_p) | |
4373 | && !complete_p | |
4374 | && COMPLETE_TYPE_P (complete_type (type))) | |
4375 | { | |
4376 | complete_p = true; | |
4377 | /* We will not yet have set TREE_READONLY on DECL if the type | |
4378 | was "const", but incomplete, before this point. But, now, we | |
4379 | have a complete type, so we can try again. */ | |
4380 | cp_apply_type_quals_to_decl (cp_type_quals (type), decl); | |
4381 | } | |
e92fb501 | 4382 | |
5566b478 | 4383 | if (initialized) |
15896502 | 4384 | /* Is it valid for this decl to have an initializer at all? */ |
8d08fdba | 4385 | { |
5566b478 MS |
4386 | /* Don't allow initializations for incomplete types except for |
4387 | arrays which might be completed by the initialization. */ | |
15896502 | 4388 | if (complete_p) |
5566b478 | 4389 | ; /* A complete type is ok. */ |
86a09a9e JM |
4390 | else if (type_uses_auto (type)) |
4391 | ; /* An auto type is ok. */ | |
5566b478 | 4392 | else if (TREE_CODE (type) != ARRAY_TYPE) |
8d08fdba | 4393 | { |
2d01edd7 | 4394 | error ("variable %q#D has initializer but incomplete type", decl); |
25eb19ff | 4395 | type = TREE_TYPE (decl) = error_mark_node; |
5566b478 | 4396 | } |
d0f062fb | 4397 | else if (!COMPLETE_TYPE_P (complete_type (TREE_TYPE (type)))) |
5566b478 MS |
4398 | { |
4399 | if (DECL_LANG_SPECIFIC (decl) && DECL_TEMPLATE_INFO (decl)) | |
2d01edd7 | 4400 | error ("elements of array %q#D have incomplete type", decl); |
5566b478 | 4401 | /* else we already gave an error in start_decl. */ |
8d08fdba | 4402 | } |
8d08fdba | 4403 | } |
15896502 | 4404 | else if (aggregate_definition_p && !complete_p) |
8d08fdba | 4405 | { |
86a09a9e JM |
4406 | if (type_uses_auto (type)) |
4407 | error ("declaration of %q#D has no initializer", decl); | |
4408 | else | |
4409 | error ("aggregate %q#D has incomplete type and cannot be defined", | |
4410 | decl); | |
15896502 MM |
4411 | /* Change the type so that assemble_variable will give |
4412 | DECL an rtl we can live with: (mem (const_int 0)). */ | |
4413 | type = TREE_TYPE (decl) = error_mark_node; | |
5566b478 MS |
4414 | } |
4415 | ||
c6671cbb MM |
4416 | /* Create a new scope to hold this declaration if necessary. |
4417 | Whether or not a new scope is necessary cannot be determined | |
4418 | until after the type has been completed; if the type is a | |
4419 | specialization of a class template it is not until after | |
4420 | instantiation has occurred that TYPE_HAS_NONTRIVIAL_DESTRUCTOR | |
4421 | will be set correctly. */ | |
4422 | maybe_push_cleanup_level (type); | |
5566b478 MS |
4423 | } |
4424 | ||
7e99327d MM |
4425 | /* Handle initialization of references. DECL, TYPE, and INIT have the |
4426 | same meaning as in cp_finish_decl. *CLEANUP must be NULL on entry, | |
4427 | but will be set to a new CLEANUP_STMT if a temporary is created | |
cd0be382 | 4428 | that must be destroyed subsequently. |
7e99327d MM |
4429 | |
4430 | Returns an initializer expression to use to initialize DECL, or | |
4431 | NULL if the initialization can be performed statically. | |
e92cc029 MS |
4432 | |
4433 | Quotes on semantics can be found in ARM 8.4.3. */ | |
4434 | ||
8e4ce833 | 4435 | static tree |
7e99327d | 4436 | grok_reference_init (tree decl, tree type, tree init, tree *cleanup) |
5566b478 MS |
4437 | { |
4438 | tree tmp; | |
4439 | ||
4440 | if (init == NULL_TREE) | |
4441 | { | |
4442 | if ((DECL_LANG_SPECIFIC (decl) == 0 | |
4443 | || DECL_IN_AGGR_P (decl) == 0) | |
4444 | && ! DECL_THIS_EXTERN (decl)) | |
c4f73174 | 4445 | error ("%qD declared as reference but not initialized", decl); |
8e4ce833 | 4446 | return NULL_TREE; |
5566b478 MS |
4447 | } |
4448 | ||
8d08fdba | 4449 | if (TREE_CODE (init) == TREE_LIST) |
c7b62f14 | 4450 | init = build_x_compound_expr_from_list (init, "initializer"); |
8d08fdba MS |
4451 | |
4452 | if (TREE_CODE (TREE_TYPE (type)) != ARRAY_TYPE | |
4453 | && TREE_CODE (TREE_TYPE (init)) == ARRAY_TYPE) | |
0a72704b MM |
4454 | /* Note: default conversion is only called in very special cases. */ |
4455 | init = decay_conversion (init); | |
68642fb6 | 4456 | |
24bef158 MM |
4457 | /* Convert INIT to the reference type TYPE. This may involve the |
4458 | creation of a temporary, whose lifetime must be the same as that | |
350fae66 RK |
4459 | of the reference. If so, a DECL_EXPR for the temporary will be |
4460 | added just after the DECL_EXPR for DECL. That's why we don't set | |
24bef158 MM |
4461 | DECL_INITIAL for local references (instead assigning to them |
4462 | explicitly); we need to allow the temporary to be initialized | |
4463 | first. */ | |
60d21717 | 4464 | tmp = initialize_reference (type, init, decl, cleanup, tf_warning_or_error); |
8d08fdba | 4465 | |
a3203465 | 4466 | if (tmp == error_mark_node) |
8e4ce833 JJ |
4467 | return NULL_TREE; |
4468 | else if (tmp == NULL_TREE) | |
8d08fdba | 4469 | { |
2d01edd7 | 4470 | error ("cannot initialize %qT from %qT", type, TREE_TYPE (init)); |
8e4ce833 | 4471 | return NULL_TREE; |
8d08fdba | 4472 | } |
8d08fdba | 4473 | |
8e4ce833 JJ |
4474 | if (TREE_STATIC (decl) && !TREE_CONSTANT (tmp)) |
4475 | return tmp; | |
4476 | ||
08ac397c | 4477 | DECL_INITIAL (decl) = tmp; |
8e4ce833 JJ |
4478 | |
4479 | return NULL_TREE; | |
8d08fdba MS |
4480 | } |
4481 | ||
09357846 JM |
4482 | /* Subroutine of check_initializer. We're initializing a DECL of |
4483 | std::initializer_list<T> TYPE from a braced-init-list INIT, and need to | |
4484 | extend the lifetime of the underlying array to match that of the decl, | |
4485 | just like for reference initialization. CLEANUP is as for | |
4486 | grok_reference_init. */ | |
4487 | ||
4488 | static tree | |
4489 | build_init_list_var_init (tree decl, tree type, tree init, tree *cleanup) | |
4490 | { | |
4491 | tree aggr_init, array, arrtype; | |
4492 | init = perform_implicit_conversion (type, init, tf_warning_or_error); | |
f8c6dba2 PC |
4493 | if (error_operand_p (init)) |
4494 | return error_mark_node; | |
4495 | ||
09357846 JM |
4496 | aggr_init = TARGET_EXPR_INITIAL (init); |
4497 | init = build2 (INIT_EXPR, type, decl, init); | |
4498 | ||
4499 | array = AGGR_INIT_EXPR_ARG (aggr_init, 1); | |
4500 | arrtype = TREE_TYPE (array); | |
4501 | STRIP_NOPS (array); | |
4502 | gcc_assert (TREE_CODE (array) == ADDR_EXPR); | |
4503 | array = TREE_OPERAND (array, 0); | |
4504 | /* If the array is constant, finish_compound_literal already made it a | |
4505 | static variable and we don't need to do anything here. */ | |
4506 | if (decl && TREE_CODE (array) == TARGET_EXPR) | |
4507 | { | |
4508 | tree subinit; | |
4509 | tree var = set_up_extended_ref_temp (decl, array, cleanup, &subinit); | |
4510 | var = build_address (var); | |
4511 | var = convert (arrtype, var); | |
4512 | AGGR_INIT_EXPR_ARG (aggr_init, 1) = var; | |
4513 | init = build2 (COMPOUND_EXPR, TREE_TYPE (init), subinit, init); | |
4514 | } | |
4515 | return init; | |
4516 | } | |
4517 | ||
76239779 MM |
4518 | /* Designated initializers in arrays are not supported in GNU C++. |
4519 | The parser cannot detect this error since it does not know whether | |
4520 | a given brace-enclosed initializer is for a class type or for an | |
4521 | array. This function checks that CE does not use a designated | |
4522 | initializer. If it does, an error is issued. Returns true if CE | |
4523 | is valid, i.e., does not have a designated initializer. */ | |
4524 | ||
4525 | static bool | |
4526 | check_array_designated_initializer (const constructor_elt *ce) | |
4527 | { | |
48c9a7f0 | 4528 | /* Designated initializers for array elements are not supported. */ |
76239779 MM |
4529 | if (ce->index) |
4530 | { | |
4531 | /* The parser only allows identifiers as designated | |
39a13be5 | 4532 | initializers. */ |
6a837908 SM |
4533 | if (ce->index == error_mark_node) |
4534 | error ("name used in a GNU-style designated " | |
4535 | "initializer for an array"); | |
4536 | else | |
4537 | { | |
4538 | gcc_assert (TREE_CODE (ce->index) == IDENTIFIER_NODE); | |
4539 | error ("name %qD used in a GNU-style designated " | |
4540 | "initializer for an array", ce->index); | |
4541 | } | |
76239779 MM |
4542 | return false; |
4543 | } | |
4544 | ||
4545 | return true; | |
4546 | } | |
4547 | ||
27778b73 MM |
4548 | /* When parsing `int a[] = {1, 2};' we don't know the size of the |
4549 | array until we finish parsing the initializer. If that's the | |
4550 | situation we're in, update DECL accordingly. */ | |
4551 | ||
4552 | static void | |
11f6b451 | 4553 | maybe_deduce_size_from_array_init (tree decl, tree init) |
27778b73 MM |
4554 | { |
4555 | tree type = TREE_TYPE (decl); | |
4556 | ||
4557 | if (TREE_CODE (type) == ARRAY_TYPE | |
4558 | && TYPE_DOMAIN (type) == NULL_TREE | |
4559 | && TREE_CODE (decl) != TYPE_DECL) | |
4560 | { | |
f2ae0c45 JM |
4561 | /* do_default is really a C-ism to deal with tentative definitions. |
4562 | But let's leave it here to ease the eventual merge. */ | |
4563 | int do_default = !DECL_EXTERNAL (decl); | |
27778b73 | 4564 | tree initializer = init ? init : DECL_INITIAL (decl); |
76239779 | 4565 | int failure = 0; |
27778b73 | 4566 | |
76239779 MM |
4567 | /* Check that there are no designated initializers in INIT, as |
4568 | those are not supported in GNU C++, and as the middle-end | |
4569 | will crash if presented with a non-numeric designated | |
4570 | initializer. */ | |
4571 | if (initializer && TREE_CODE (initializer) == CONSTRUCTOR) | |
2b643eda | 4572 | { |
76239779 MM |
4573 | VEC(constructor_elt,gc) *v = CONSTRUCTOR_ELTS (initializer); |
4574 | constructor_elt *ce; | |
4575 | HOST_WIDE_INT i; | |
4576 | for (i = 0; | |
4577 | VEC_iterate (constructor_elt, v, i, ce); | |
49b5e2f6 | 4578 | ++i) |
76239779 MM |
4579 | if (!check_array_designated_initializer (ce)) |
4580 | failure = 1; | |
2b643eda | 4581 | } |
76239779 MM |
4582 | |
4583 | if (!failure) | |
27778b73 | 4584 | { |
76239779 MM |
4585 | failure = cp_complete_array_type (&TREE_TYPE (decl), initializer, |
4586 | do_default); | |
4587 | if (failure == 1) | |
2b643eda | 4588 | { |
76239779 MM |
4589 | error ("initializer fails to determine size of %qD", decl); |
4590 | TREE_TYPE (decl) = error_mark_node; | |
4591 | } | |
4592 | else if (failure == 2) | |
4593 | { | |
4594 | if (do_default) | |
4595 | { | |
4596 | error ("array size missing in %qD", decl); | |
4597 | TREE_TYPE (decl) = error_mark_node; | |
4598 | } | |
4599 | /* If a `static' var's size isn't known, make it extern as | |
4600 | well as static, so it does not get allocated. If it's not | |
4601 | `static', then don't mark it extern; finish_incomplete_decl | |
4602 | will give it a default size and it will get allocated. */ | |
4603 | else if (!pedantic && TREE_STATIC (decl) && !TREE_PUBLIC (decl)) | |
4604 | DECL_EXTERNAL (decl) = 1; | |
4605 | } | |
4606 | else if (failure == 3) | |
4607 | { | |
4608 | error ("zero-size array %qD", decl); | |
2b643eda MM |
4609 | TREE_TYPE (decl) = error_mark_node; |
4610 | } | |
2b643eda | 4611 | } |
27778b73 | 4612 | |
f23b8501 JJ |
4613 | cp_apply_type_quals_to_decl (cp_type_quals (TREE_TYPE (decl)), decl); |
4614 | ||
a3a7bf5f | 4615 | relayout_decl (decl); |
27778b73 MM |
4616 | } |
4617 | } | |
4618 | ||
4619 | /* Set DECL_SIZE, DECL_ALIGN, etc. for DECL (a VAR_DECL), and issue | |
57b52417 | 4620 | any appropriate error messages regarding the layout. */ |
27778b73 | 4621 | |
57b52417 | 4622 | static void |
11f6b451 | 4623 | layout_var_decl (tree decl) |
27778b73 | 4624 | { |
2b643eda MM |
4625 | tree type; |
4626 | ||
2b643eda MM |
4627 | type = TREE_TYPE (decl); |
4628 | if (type == error_mark_node) | |
4629 | return; | |
57b52417 MM |
4630 | |
4631 | /* If we haven't already layed out this declaration, do so now. | |
4632 | Note that we must not call complete type for an external object | |
4633 | because it's type might involve templates that we are not | |
34cd5ae7 | 4634 | supposed to instantiate yet. (And it's perfectly valid to say |
57b52417 MM |
4635 | `extern X x' for some incomplete type `X'.) */ |
4636 | if (!DECL_EXTERNAL (decl)) | |
4637 | complete_type (type); | |
caf93cb0 | 4638 | if (!DECL_SIZE (decl) |
328de7c2 | 4639 | && TREE_TYPE (decl) != error_mark_node |
7de85f7e | 4640 | && (COMPLETE_TYPE_P (type) |
caf93cb0 | 4641 | || (TREE_CODE (type) == ARRAY_TYPE |
7de85f7e MM |
4642 | && !TYPE_DOMAIN (type) |
4643 | && COMPLETE_TYPE_P (TREE_TYPE (type))))) | |
27778b73 MM |
4644 | layout_decl (decl, 0); |
4645 | ||
c82dbd95 | 4646 | if (!DECL_EXTERNAL (decl) && DECL_SIZE (decl) == NULL_TREE) |
27778b73 MM |
4647 | { |
4648 | /* An automatic variable with an incomplete type: that is an error. | |
4649 | Don't talk about array types here, since we took care of that | |
4650 | message in grokdeclarator. */ | |
2d01edd7 | 4651 | error ("storage size of %qD isn't known", decl); |
27778b73 MM |
4652 | TREE_TYPE (decl) = error_mark_node; |
4653 | } | |
ae673f14 JM |
4654 | #if 0 |
4655 | /* Keep this code around in case we later want to control debug info | |
4656 | based on whether a type is "used". (jason 1999-11-11) */ | |
4657 | ||
9e1e64ec | 4658 | else if (!DECL_EXTERNAL (decl) && MAYBE_CLASS_TYPE_P (ttype)) |
27778b73 MM |
4659 | /* Let debugger know it should output info for this type. */ |
4660 | note_debug_info_needed (ttype); | |
4661 | ||
4662 | if (TREE_STATIC (decl) && DECL_CLASS_SCOPE_P (decl)) | |
4663 | note_debug_info_needed (DECL_CONTEXT (decl)); | |
ae673f14 | 4664 | #endif |
27778b73 MM |
4665 | |
4666 | if ((DECL_EXTERNAL (decl) || TREE_STATIC (decl)) | |
4667 | && DECL_SIZE (decl) != NULL_TREE | |
4668 | && ! TREE_CONSTANT (DECL_SIZE (decl))) | |
4669 | { | |
4670 | if (TREE_CODE (DECL_SIZE (decl)) == INTEGER_CST) | |
4671 | constant_expression_warning (DECL_SIZE (decl)); | |
4672 | else | |
b97d8153 JJ |
4673 | { |
4674 | error ("storage size of %qD isn't constant", decl); | |
4675 | TREE_TYPE (decl) = error_mark_node; | |
4676 | } | |
27778b73 MM |
4677 | } |
4678 | } | |
4679 | ||
27778b73 MM |
4680 | /* If a local static variable is declared in an inline function, or if |
4681 | we have a weak definition, we must endeavor to create only one | |
4682 | instance of the variable at link-time. */ | |
4683 | ||
68017cb4 | 4684 | void |
11f6b451 | 4685 | maybe_commonize_var (tree decl) |
27778b73 MM |
4686 | { |
4687 | /* Static data in a function with comdat linkage also has comdat | |
4688 | linkage. */ | |
4689 | if (TREE_STATIC (decl) | |
4690 | /* Don't mess with __FUNCTION__. */ | |
cf74fb86 | 4691 | && ! DECL_ARTIFICIAL (decl) |
0b50d7f1 | 4692 | && DECL_FUNCTION_SCOPE_P (decl) |
d6dcdbd5 | 4693 | && vague_linkage_p (DECL_CONTEXT (decl))) |
27778b73 | 4694 | { |
0dbc5cd3 | 4695 | if (flag_weak) |
27778b73 | 4696 | { |
0dbc5cd3 MM |
4697 | /* With weak symbols, we simply make the variable COMDAT; |
4698 | that will cause copies in multiple translations units to | |
4699 | be merged. */ | |
4700 | comdat_linkage (decl); | |
4701 | } | |
4702 | else | |
4703 | { | |
4704 | if (DECL_INITIAL (decl) == NULL_TREE | |
4705 | || DECL_INITIAL (decl) == error_mark_node) | |
27778b73 | 4706 | { |
0dbc5cd3 MM |
4707 | /* Without weak symbols, we can use COMMON to merge |
4708 | uninitialized variables. */ | |
27778b73 MM |
4709 | TREE_PUBLIC (decl) = 1; |
4710 | DECL_COMMON (decl) = 1; | |
4711 | } | |
0dbc5cd3 | 4712 | else |
27778b73 | 4713 | { |
0dbc5cd3 MM |
4714 | /* While for initialized variables, we must use internal |
4715 | linkage -- which means that multiple copies will not | |
4716 | be merged. */ | |
4717 | TREE_PUBLIC (decl) = 0; | |
4718 | DECL_COMMON (decl) = 0; | |
c5d75364 MLI |
4719 | warning_at (input_location, 0, |
4720 | "sorry: semantics of inline function static " | |
4721 | "data %q+#D are wrong (you'll wind up " | |
4722 | "with multiple copies)", decl); | |
4723 | warning_at (DECL_SOURCE_LOCATION (decl), 0, | |
4724 | " you can work around this by removing " | |
4725 | "the initializer"); | |
27778b73 MM |
4726 | } |
4727 | } | |
4728 | } | |
4729 | else if (DECL_LANG_SPECIFIC (decl) && DECL_COMDAT (decl)) | |
4730 | /* Set it up again; we might have set DECL_INITIAL since the last | |
4731 | time. */ | |
4732 | comdat_linkage (decl); | |
4733 | } | |
4734 | ||
91063b51 MM |
4735 | /* Issue an error message if DECL is an uninitialized const variable. */ |
4736 | ||
4737 | static void | |
11f6b451 | 4738 | check_for_uninitialized_const_var (tree decl) |
91063b51 | 4739 | { |
6ad86a5b | 4740 | tree type = strip_array_types (TREE_TYPE (decl)); |
91063b51 | 4741 | |
7ecbca9d GDR |
4742 | if (TREE_CODE (decl) == VAR_DECL && DECL_DECLARED_CONSTEXPR_P (decl) |
4743 | && DECL_INITIAL (decl) == NULL) | |
4744 | error ("missing initializer for constexpr %qD", decl); | |
4745 | ||
91063b51 MM |
4746 | /* ``Unless explicitly declared extern, a const object does not have |
4747 | external linkage and must be initialized. ($8.4; $12.1)'' ARM | |
4748 | 7.1.6 */ | |
7ecbca9d | 4749 | else if (TREE_CODE (decl) == VAR_DECL |
91063b51 MM |
4750 | && TREE_CODE (type) != REFERENCE_TYPE |
4751 | && CP_TYPE_CONST_P (type) | |
6ad86a5b FC |
4752 | && (!TYPE_NEEDS_CONSTRUCTING (type) |
4753 | || !type_has_user_provided_default_constructor (type)) | |
91063b51 | 4754 | && !DECL_INITIAL (decl)) |
6ad86a5b FC |
4755 | { |
4756 | permerror (DECL_SOURCE_LOCATION (decl), | |
4757 | "uninitialized const %qD", decl); | |
91063b51 | 4758 | |
6ad86a5b FC |
4759 | if (CLASS_TYPE_P (type) |
4760 | && !type_has_user_provided_default_constructor (type)) | |
4761 | { | |
4762 | tree defaulted_ctor; | |
4763 | ||
4764 | inform (DECL_SOURCE_LOCATION (TYPE_MAIN_DECL (type)), | |
4765 | "%q#T has no user-provided default constructor", type); | |
4766 | defaulted_ctor = in_class_defaulted_default_constructor (type); | |
4767 | if (defaulted_ctor) | |
4768 | inform (DECL_SOURCE_LOCATION (defaulted_ctor), | |
4769 | "constructor is not user-provided because it is " | |
4770 | "explicitly defaulted in the class body"); | |
4771 | } | |
4772 | } | |
4773 | } | |
4038c495 GB |
4774 | \f |
4775 | /* Structure holding the current initializer being processed by reshape_init. | |
4776 | CUR is a pointer to the current element being processed, END is a pointer | |
4777 | after the last element present in the initializer. */ | |
4778 | typedef struct reshape_iterator_t | |
4779 | { | |
4780 | constructor_elt *cur; | |
4781 | constructor_elt *end; | |
4782 | } reshape_iter; | |
4783 | ||
4784 | static tree reshape_init_r (tree, reshape_iter *, bool); | |
4785 | ||
8e3df2de MM |
4786 | /* FIELD is a FIELD_DECL or NULL. In the former case, the value |
4787 | returned is the next FIELD_DECL (possibly FIELD itself) that can be | |
4788 | initialized. If there are no more such fields, the return value | |
4789 | will be NULL. */ | |
4790 | ||
d4b5fb22 | 4791 | tree |
8e3df2de MM |
4792 | next_initializable_field (tree field) |
4793 | { | |
4794 | while (field | |
4795 | && (TREE_CODE (field) != FIELD_DECL | |
4796 | || (DECL_C_BIT_FIELD (field) && !DECL_NAME (field)) | |
4797 | || DECL_ARTIFICIAL (field))) | |
4798 | field = TREE_CHAIN (field); | |
4799 | ||
4800 | return field; | |
4801 | } | |
4802 | ||
4038c495 GB |
4803 | /* Subroutine of reshape_init_array and reshape_init_vector, which does |
4804 | the actual work. ELT_TYPE is the element type of the array. MAX_INDEX is an | |
4805 | INTEGER_CST representing the size of the array minus one (the maximum index), | |
4806 | or NULL_TREE if the array was declared without specifying the size. D is | |
4807 | the iterator within the constructor. */ | |
4808 | ||
4809 | static tree | |
4810 | reshape_init_array_1 (tree elt_type, tree max_index, reshape_iter *d) | |
3d142be2 | 4811 | { |
4038c495 | 4812 | tree new_init; |
3d142be2 | 4813 | bool sized_array_p = (max_index != NULL_TREE); |
004c400a JJ |
4814 | unsigned HOST_WIDE_INT max_index_cst = 0; |
4815 | unsigned HOST_WIDE_INT index; | |
3d142be2 | 4816 | |
4038c495 | 4817 | /* The initializer for an array is always a CONSTRUCTOR. */ |
09357846 | 4818 | new_init = build_constructor (init_list_type_node, NULL); |
4038c495 | 4819 | |
3d142be2 | 4820 | if (sized_array_p) |
004c400a | 4821 | { |
d7d93837 AH |
4822 | /* Minus 1 is used for zero sized arrays. */ |
4823 | if (integer_all_onesp (max_index)) | |
4824 | return new_init; | |
4825 | ||
004c400a JJ |
4826 | if (host_integerp (max_index, 1)) |
4827 | max_index_cst = tree_low_cst (max_index, 1); | |
4828 | /* sizetype is sign extended, not zero extended. */ | |
4829 | else | |
4830 | max_index_cst = tree_low_cst (fold_convert (size_type_node, max_index), | |
4831 | 1); | |
4832 | } | |
3d142be2 GB |
4833 | |
4834 | /* Loop until there are no more initializers. */ | |
4835 | for (index = 0; | |
4038c495 | 4836 | d->cur != d->end && (!sized_array_p || index <= max_index_cst); |
3d142be2 GB |
4837 | ++index) |
4838 | { | |
4038c495 GB |
4839 | tree elt_init; |
4840 | ||
76239779 | 4841 | check_array_designated_initializer (d->cur); |
4038c495 | 4842 | elt_init = reshape_init_r (elt_type, d, /*first_initializer_p=*/false); |
07471dfb MM |
4843 | if (elt_init == error_mark_node) |
4844 | return error_mark_node; | |
4038c495 | 4845 | CONSTRUCTOR_APPEND_ELT (CONSTRUCTOR_ELTS (new_init), NULL_TREE, elt_init); |
3d142be2 GB |
4846 | } |
4847 | ||
4038c495 | 4848 | return new_init; |
3d142be2 GB |
4849 | } |
4850 | ||
4038c495 GB |
4851 | /* Subroutine of reshape_init_r, processes the initializers for arrays. |
4852 | Parameters are the same of reshape_init_r. */ | |
8e3df2de | 4853 | |
4038c495 GB |
4854 | static tree |
4855 | reshape_init_array (tree type, reshape_iter *d) | |
4856 | { | |
4857 | tree max_index = NULL_TREE; | |
caf93cb0 | 4858 | |
4038c495 | 4859 | gcc_assert (TREE_CODE (type) == ARRAY_TYPE); |
8e3df2de | 4860 | |
4038c495 GB |
4861 | if (TYPE_DOMAIN (type)) |
4862 | max_index = array_type_nelts (type); | |
4863 | ||
4864 | return reshape_init_array_1 (TREE_TYPE (type), max_index, d); | |
4865 | } | |
4866 | ||
4867 | /* Subroutine of reshape_init_r, processes the initializers for vectors. | |
4868 | Parameters are the same of reshape_init_r. */ | |
8e3df2de MM |
4869 | |
4870 | static tree | |
4038c495 | 4871 | reshape_init_vector (tree type, reshape_iter *d) |
8e3df2de | 4872 | { |
4038c495 GB |
4873 | tree max_index = NULL_TREE; |
4874 | tree rtype; | |
4875 | ||
4876 | gcc_assert (TREE_CODE (type) == VECTOR_TYPE); | |
4877 | ||
3b2db49f | 4878 | if (COMPOUND_LITERAL_P (d->cur->value)) |
4038c495 GB |
4879 | { |
4880 | tree value = d->cur->value; | |
4881 | if (!same_type_p (TREE_TYPE (value), type)) | |
4882 | { | |
4883 | error ("invalid type %qT as initializer for a vector of type %qT", | |
4884 | TREE_TYPE (d->cur->value), type); | |
3db45ab5 | 4885 | value = error_mark_node; |
4038c495 GB |
4886 | } |
4887 | ++d->cur; | |
4888 | return value; | |
4889 | } | |
4890 | ||
4891 | /* For a vector, the representation type is a struct | |
4892 | containing a single member which is an array of the | |
4893 | appropriate size. */ | |
4894 | rtype = TYPE_DEBUG_REPRESENTATION_TYPE (type); | |
4895 | if (rtype && TYPE_DOMAIN (TREE_TYPE (TYPE_FIELDS (rtype)))) | |
4896 | max_index = array_type_nelts (TREE_TYPE (TYPE_FIELDS (rtype))); | |
4897 | ||
4898 | return reshape_init_array_1 (TREE_TYPE (type), max_index, d); | |
4899 | } | |
4900 | ||
4901 | /* Subroutine of reshape_init_r, processes the initializers for classes | |
4902 | or union. Parameters are the same of reshape_init_r. */ | |
4903 | ||
4904 | static tree | |
4905 | reshape_init_class (tree type, reshape_iter *d, bool first_initializer_p) | |
4906 | { | |
4907 | tree field; | |
8e3df2de | 4908 | tree new_init; |
8e3df2de | 4909 | |
4038c495 | 4910 | gcc_assert (CLASS_TYPE_P (type)); |
8e3df2de | 4911 | |
4038c495 | 4912 | /* The initializer for a class is always a CONSTRUCTOR. */ |
09357846 | 4913 | new_init = build_constructor (init_list_type_node, NULL); |
4038c495 | 4914 | field = next_initializable_field (TYPE_FIELDS (type)); |
ee7ecb29 | 4915 | |
4038c495 | 4916 | if (!field) |
8e3df2de | 4917 | { |
4038c495 GB |
4918 | /* [dcl.init.aggr] |
4919 | ||
4920 | An initializer for an aggregate member that is an | |
4921 | empty class shall have the form of an empty | |
4922 | initializer-list {}. */ | |
4923 | if (!first_initializer_p) | |
4924 | { | |
4925 | error ("initializer for %qT must be brace-enclosed", type); | |
4926 | return error_mark_node; | |
4927 | } | |
4928 | return new_init; | |
8e3df2de | 4929 | } |
4038c495 GB |
4930 | |
4931 | /* Loop through the initializable fields, gathering initializers. */ | |
4932 | while (d->cur != d->end) | |
8e3df2de | 4933 | { |
4038c495 GB |
4934 | tree field_init; |
4935 | ||
4936 | /* Handle designated initializers, as an extension. */ | |
4937 | if (d->cur->index) | |
4938 | { | |
4038c495 GB |
4939 | field = lookup_field_1 (type, d->cur->index, /*want_type=*/false); |
4940 | ||
4941 | if (!field || TREE_CODE (field) != FIELD_DECL) | |
77bffd4c SE |
4942 | { |
4943 | error ("%qT has no non-static data member named %qD", type, | |
4944 | d->cur->index); | |
4945 | return error_mark_node; | |
4946 | } | |
4038c495 GB |
4947 | } |
4948 | ||
4949 | /* If we processed all the member of the class, we are done. */ | |
4950 | if (!field) | |
4951 | break; | |
4952 | ||
4953 | field_init = reshape_init_r (TREE_TYPE (field), d, | |
4954 | /*first_initializer_p=*/false); | |
97471c71 PC |
4955 | if (field_init == error_mark_node) |
4956 | return error_mark_node; | |
4957 | ||
4038c495 GB |
4958 | CONSTRUCTOR_APPEND_ELT (CONSTRUCTOR_ELTS (new_init), field, field_init); |
4959 | ||
4960 | /* [dcl.init.aggr] | |
4961 | ||
4962 | When a union is initialized with a brace-enclosed | |
4963 | initializer, the braces shall only contain an | |
4964 | initializer for the first member of the union. */ | |
4965 | if (TREE_CODE (type) == UNION_TYPE) | |
4966 | break; | |
4967 | ||
4968 | field = next_initializable_field (TREE_CHAIN (field)); | |
8e3df2de MM |
4969 | } |
4970 | ||
4038c495 GB |
4971 | return new_init; |
4972 | } | |
4973 | ||
4974 | /* Subroutine of reshape_init, which processes a single initializer (part of | |
4975 | a CONSTRUCTOR). TYPE is the type of the variable being initialized, D is the | |
4976 | iterator within the CONSTRUCTOR which points to the initializer to process. | |
4977 | FIRST_INITIALIZER_P is true if this is the first initializer of the | |
40b125d7 | 4978 | outermost CONSTRUCTOR node. */ |
4038c495 GB |
4979 | |
4980 | static tree | |
4981 | reshape_init_r (tree type, reshape_iter *d, bool first_initializer_p) | |
4982 | { | |
4983 | tree init = d->cur->value; | |
4984 | ||
ffe79825 PC |
4985 | if (error_operand_p (init)) |
4986 | return error_mark_node; | |
4987 | ||
8e3df2de MM |
4988 | /* A non-aggregate type is always initialized with a single |
4989 | initializer. */ | |
4990 | if (!CP_AGGREGATE_TYPE_P (type)) | |
4038c495 GB |
4991 | { |
4992 | /* It is invalid to initialize a non-aggregate type with a | |
b71836b0 | 4993 | brace-enclosed initializer before C++0x. |
4038c495 GB |
4994 | We need to check for BRACE_ENCLOSED_INITIALIZER_P here because |
4995 | of g++.old-deja/g++.mike/p7626.C: a pointer-to-member constant is | |
4996 | a CONSTRUCTOR (with a record type). */ | |
4997 | if (TREE_CODE (init) == CONSTRUCTOR | |
4998 | && BRACE_ENCLOSED_INITIALIZER_P (init)) /* p7626.C */ | |
4999 | { | |
b71836b0 JM |
5000 | if (SCALAR_TYPE_P (type)) |
5001 | { | |
5002 | error ("braces around scalar initializer for type %qT", type); | |
5003 | init = error_mark_node; | |
5004 | } | |
5005 | else | |
848f237b | 5006 | maybe_warn_cpp0x (CPP0X_INITIALIZER_LISTS); |
4038c495 | 5007 | } |
3db45ab5 | 5008 | |
4038c495 GB |
5009 | d->cur++; |
5010 | return init; | |
5011 | } | |
8e3df2de MM |
5012 | |
5013 | /* [dcl.init.aggr] | |
5014 | ||
5015 | All implicit type conversions (clause _conv_) are considered when | |
5016 | initializing the aggregate member with an initializer from an | |
5017 | initializer-list. If the initializer can initialize a member, | |
5018 | the member is initialized. Otherwise, if the member is itself a | |
5019 | non-empty subaggregate, brace elision is assumed and the | |
5020 | initializer is considered for the initialization of the first | |
5021 | member of the subaggregate. */ | |
4038c495 | 5022 | if (TREE_CODE (init) != CONSTRUCTOR |
40b125d7 JM |
5023 | /* But don't try this for the first initializer, since that would be |
5024 | looking through the outermost braces; A a2 = { a1 }; is not a | |
5025 | valid aggregate initialization. */ | |
5026 | && !first_initializer_p | |
d5f4eddd JM |
5027 | && (same_type_ignoring_top_level_qualifiers_p (type, TREE_TYPE (init)) |
5028 | || can_convert_arg (type, TREE_TYPE (init), init, LOOKUP_NORMAL))) | |
8e3df2de | 5029 | { |
4038c495 GB |
5030 | d->cur++; |
5031 | return init; | |
8e3df2de MM |
5032 | } |
5033 | ||
4038c495 GB |
5034 | /* [dcl.init.string] |
5035 | ||
5036 | A char array (whether plain char, signed char, or unsigned char) | |
5037 | can be initialized by a string-literal (optionally enclosed in | |
5038 | braces); a wchar_t array can be initialized by a wide | |
5039 | string-literal (optionally enclosed in braces). */ | |
5040 | if (TREE_CODE (type) == ARRAY_TYPE | |
42328048 | 5041 | && char_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (type)))) |
8e3df2de | 5042 | { |
4038c495 | 5043 | tree str_init = init; |
8e3df2de | 5044 | |
4038c495 | 5045 | /* Strip one level of braces if and only if they enclose a single |
3db45ab5 | 5046 | element (as allowed by [dcl.init.string]). */ |
4038c495 GB |
5047 | if (!first_initializer_p |
5048 | && TREE_CODE (str_init) == CONSTRUCTOR | |
5049 | && VEC_length (constructor_elt, CONSTRUCTOR_ELTS (str_init)) == 1) | |
8e3df2de | 5050 | { |
4038c495 GB |
5051 | str_init = VEC_index (constructor_elt, |
5052 | CONSTRUCTOR_ELTS (str_init), 0)->value; | |
5053 | } | |
3db45ab5 | 5054 | |
4038c495 | 5055 | /* If it's a string literal, then it's the initializer for the array |
3db45ab5 | 5056 | as a whole. Otherwise, continue with normal initialization for |
4038c495 GB |
5057 | array types (one value per array element). */ |
5058 | if (TREE_CODE (str_init) == STRING_CST) | |
5059 | { | |
5060 | d->cur++; | |
5061 | return str_init; | |
5062 | } | |
5063 | } | |
8e3df2de | 5064 | |
4038c495 GB |
5065 | /* The following cases are about aggregates. If we are not within a full |
5066 | initializer already, and there is not a CONSTRUCTOR, it means that there | |
5067 | is a missing set of braces (that is, we are processing the case for | |
5068 | which reshape_init exists). */ | |
5069 | if (!first_initializer_p) | |
5070 | { | |
5071 | if (TREE_CODE (init) == CONSTRUCTOR) | |
5072 | { | |
70ec16f7 AP |
5073 | if (TREE_TYPE (init) && TYPE_PTRMEMFUNC_P (TREE_TYPE (init))) |
5074 | /* There is no need to reshape pointer-to-member function | |
5075 | initializers, as they are always constructed correctly | |
5076 | by the front end. */ | |
5077 | ; | |
5078 | else if (COMPOUND_LITERAL_P (init)) | |
4038c495 GB |
5079 | /* For a nested compound literal, there is no need to reshape since |
5080 | brace elision is not allowed. Even if we decided to allow it, | |
5081 | we should add a call to reshape_init in finish_compound_literal, | |
5082 | before calling digest_init, so changing this code would still | |
5083 | not be necessary. */ | |
70ec16f7 AP |
5084 | gcc_assert (!BRACE_ENCLOSED_INITIALIZER_P (init)); |
5085 | else | |
8e3df2de | 5086 | { |
4038c495 GB |
5087 | ++d->cur; |
5088 | gcc_assert (BRACE_ENCLOSED_INITIALIZER_P (init)); | |
5089 | return reshape_init (type, init); | |
8e3df2de | 5090 | } |
8e3df2de | 5091 | } |
f8e7a389 | 5092 | |
4038c495 GB |
5093 | warning (OPT_Wmissing_braces, "missing braces around initializer for %qT", |
5094 | type); | |
5095 | } | |
8e3df2de | 5096 | |
4038c495 GB |
5097 | /* Dispatch to specialized routines. */ |
5098 | if (CLASS_TYPE_P (type)) | |
5099 | return reshape_init_class (type, d, first_initializer_p); | |
5100 | else if (TREE_CODE (type) == ARRAY_TYPE) | |
5101 | return reshape_init_array (type, d); | |
5102 | else if (TREE_CODE (type) == VECTOR_TYPE) | |
5103 | return reshape_init_vector (type, d); | |
5104 | else | |
5105 | gcc_unreachable(); | |
5106 | } | |
8e3df2de | 5107 | |
4038c495 GB |
5108 | /* Undo the brace-elision allowed by [dcl.init.aggr] in a |
5109 | brace-enclosed aggregate initializer. | |
8e3df2de | 5110 | |
4038c495 GB |
5111 | INIT is the CONSTRUCTOR containing the list of initializers describing |
5112 | a brace-enclosed initializer for an entity of the indicated aggregate TYPE. | |
5113 | It may not presently match the shape of the TYPE; for example: | |
5114 | ||
5115 | struct S { int a; int b; }; | |
5116 | struct S a[] = { 1, 2, 3, 4 }; | |
5117 | ||
5118 | Here INIT will hold a VEC of four elements, rather than a | |
5119 | VEC of two elements, each itself a VEC of two elements. This | |
5120 | routine transforms INIT from the former form into the latter. The | |
5121 | revised CONSTRUCTOR node is returned. */ | |
5122 | ||
3b2db49f | 5123 | tree |
4038c495 GB |
5124 | reshape_init (tree type, tree init) |
5125 | { | |
5126 | VEC(constructor_elt, gc) *v; | |
5127 | reshape_iter d; | |
5128 | tree new_init; | |
5129 | ||
4038c495 GB |
5130 | gcc_assert (BRACE_ENCLOSED_INITIALIZER_P (init)); |
5131 | ||
5132 | v = CONSTRUCTOR_ELTS (init); | |
5133 | ||
5134 | /* An empty constructor does not need reshaping, and it is always a valid | |
5135 | initializer. */ | |
5136 | if (VEC_empty (constructor_elt, v)) | |
5137 | return init; | |
5138 | ||
5139 | /* Recurse on this CONSTRUCTOR. */ | |
5140 | d.cur = VEC_index (constructor_elt, v, 0); | |
5141 | d.end = d.cur + VEC_length (constructor_elt, v); | |
5142 | ||
5143 | new_init = reshape_init_r (type, &d, true); | |
07471dfb MM |
5144 | if (new_init == error_mark_node) |
5145 | return error_mark_node; | |
4038c495 GB |
5146 | |
5147 | /* Make sure all the element of the constructor were used. Otherwise, | |
5148 | issue an error about exceeding initializers. */ | |
5149 | if (d.cur != d.end) | |
5150 | error ("too many initializers for %qT", type); | |
8e3df2de MM |
5151 | |
5152 | return new_init; | |
5153 | } | |
5154 | ||
23bee8f4 JJ |
5155 | /* Verify array initializer. Returns true if errors have been reported. */ |
5156 | ||
5157 | bool | |
5158 | check_array_initializer (tree decl, tree type, tree init) | |
5159 | { | |
5160 | tree element_type = TREE_TYPE (type); | |
5161 | ||
5162 | /* The array type itself need not be complete, because the | |
5163 | initializer may tell us how many elements are in the array. | |
5164 | But, the elements of the array must be complete. */ | |
5165 | if (!COMPLETE_TYPE_P (complete_type (element_type))) | |
5166 | { | |
5167 | if (decl) | |
5168 | error ("elements of array %q#D have incomplete type", decl); | |
5169 | else | |
5170 | error ("elements of array %q#T have incomplete type", type); | |
5171 | return true; | |
5172 | } | |
5173 | /* It is not valid to initialize a VLA. */ | |
5174 | if (init | |
5175 | && ((COMPLETE_TYPE_P (type) && !TREE_CONSTANT (TYPE_SIZE (type))) | |
5176 | || !TREE_CONSTANT (TYPE_SIZE (element_type)))) | |
5177 | { | |
5178 | if (decl) | |
5179 | error ("variable-sized object %qD may not be initialized", decl); | |
5180 | else | |
5181 | error ("variable-sized compound literal"); | |
5182 | return true; | |
5183 | } | |
5184 | return false; | |
5185 | } | |
5186 | ||
09357846 JM |
5187 | /* Subroutine of check_initializer; args are passed down from that function. |
5188 | Set stmts_are_full_exprs_p to 1 across a call to build_aggr_init. */ | |
5189 | ||
5190 | static tree | |
5191 | build_aggr_init_full_exprs (tree decl, tree init, int flags) | |
5192 | ||
5193 | { | |
5194 | int saved_stmts_are_full_exprs_p = 0; | |
5195 | if (building_stmt_tree ()) | |
5196 | { | |
5197 | saved_stmts_are_full_exprs_p = stmts_are_full_exprs_p (); | |
5198 | current_stmt_tree ()->stmts_are_full_exprs_p = 1; | |
5199 | } | |
5200 | init = build_aggr_init (decl, init, flags, tf_warning_or_error); | |
5201 | if (building_stmt_tree ()) | |
5202 | current_stmt_tree ()->stmts_are_full_exprs_p = | |
5203 | saved_stmts_are_full_exprs_p; | |
5204 | return init; | |
5205 | } | |
5206 | ||
c82dbd95 | 5207 | /* Verify INIT (the initializer for DECL), and record the |
7e99327d MM |
5208 | initialization in DECL_INITIAL, if appropriate. CLEANUP is as for |
5209 | grok_reference_init. | |
8e3df2de MM |
5210 | |
5211 | If the return value is non-NULL, it is an expression that must be | |
5212 | evaluated dynamically to initialize DECL. */ | |
27778b73 | 5213 | |
c82dbd95 | 5214 | static tree |
7e99327d | 5215 | check_initializer (tree decl, tree init, int flags, tree *cleanup) |
27778b73 | 5216 | { |
17bbb839 | 5217 | tree type = TREE_TYPE (decl); |
25ebb82a | 5218 | tree init_code = NULL; |
34655c9e | 5219 | tree core_type; |
fc0e7bf5 | 5220 | |
328de7c2 MM |
5221 | /* Things that are going to be initialized need to have complete |
5222 | type. */ | |
5223 | TREE_TYPE (decl) = type = complete_type (TREE_TYPE (decl)); | |
c82dbd95 | 5224 | |
328de7c2 MM |
5225 | if (type == error_mark_node) |
5226 | /* We will have already complained. */ | |
f724eac4 MM |
5227 | return NULL_TREE; |
5228 | ||
5229 | if (TREE_CODE (type) == ARRAY_TYPE) | |
328de7c2 | 5230 | { |
23bee8f4 JJ |
5231 | if (check_array_initializer (decl, type, init)) |
5232 | return NULL_TREE; | |
328de7c2 | 5233 | } |
f724eac4 | 5234 | else if (!COMPLETE_TYPE_P (type)) |
328de7c2 | 5235 | { |
2d01edd7 | 5236 | error ("%qD has incomplete type", decl); |
328de7c2 | 5237 | TREE_TYPE (decl) = error_mark_node; |
f724eac4 | 5238 | return NULL_TREE; |
27778b73 | 5239 | } |
f724eac4 MM |
5240 | else |
5241 | /* There is no way to make a variable-sized class type in GNU C++. */ | |
5242 | gcc_assert (TREE_CONSTANT (TYPE_SIZE (type))); | |
c1ae8be5 SM |
5243 | |
5244 | if (init && BRACE_ENCLOSED_INITIALIZER_P (init)) | |
f47165c9 | 5245 | { |
c1ae8be5 SM |
5246 | int init_len = VEC_length (constructor_elt, CONSTRUCTOR_ELTS (init)); |
5247 | if (SCALAR_TYPE_P (type)) | |
5248 | { | |
09357846 JM |
5249 | if (init_len == 0) |
5250 | { | |
848f237b | 5251 | maybe_warn_cpp0x (CPP0X_INITIALIZER_LISTS); |
09357846 JM |
5252 | init = build_zero_init (type, NULL_TREE, false); |
5253 | } | |
5254 | else if (init_len != 1) | |
c1ae8be5 SM |
5255 | { |
5256 | error ("scalar object %qD requires one element in initializer", | |
5257 | decl); | |
5258 | TREE_TYPE (decl) = error_mark_node; | |
5259 | return NULL_TREE; | |
5260 | } | |
5261 | } | |
f47165c9 | 5262 | } |
27778b73 MM |
5263 | |
5264 | if (TREE_CODE (decl) == CONST_DECL) | |
5265 | { | |
7525db03 | 5266 | gcc_assert (TREE_CODE (type) != REFERENCE_TYPE); |
27778b73 MM |
5267 | |
5268 | DECL_INITIAL (decl) = init; | |
5269 | ||
50bc768d | 5270 | gcc_assert (init != NULL_TREE); |
27778b73 MM |
5271 | init = NULL_TREE; |
5272 | } | |
c82dbd95 | 5273 | else if (!DECL_EXTERNAL (decl) && TREE_CODE (type) == REFERENCE_TYPE) |
7e99327d | 5274 | init = grok_reference_init (decl, type, init, cleanup); |
27778b73 MM |
5275 | else if (init) |
5276 | { | |
4038c495 | 5277 | /* Do not reshape constructors of vectors (they don't need to be |
3db45ab5 | 5278 | reshaped. */ |
09357846 | 5279 | if (BRACE_ENCLOSED_INITIALIZER_P (init)) |
a16f2357 | 5280 | { |
09357846 JM |
5281 | if (is_std_init_list (type)) |
5282 | return build_init_list_var_init (decl, type, init, cleanup); | |
5283 | else if (TYPE_NON_AGGREGATE_CLASS (type)) | |
5284 | { | |
5285 | /* Don't reshape if the class has constructors. */ | |
5286 | if (cxx_dialect == cxx98) | |
5287 | error ("in C++98 %qD must be initialized by constructor, " | |
5288 | "not by %<{...}%>", | |
5289 | decl); | |
09357846 | 5290 | } |
b6fc2cdb | 5291 | else if (TREE_CODE (type) == VECTOR_TYPE && TYPE_VECTOR_OPAQUE (type)) |
6e1b3a7c AH |
5292 | { |
5293 | error ("opaque vector types cannot be initialized"); | |
5294 | init = error_mark_node; | |
5295 | } | |
09357846 JM |
5296 | else |
5297 | init = reshape_init (type, init); | |
a16f2357 | 5298 | } |
8e3df2de MM |
5299 | |
5300 | /* If DECL has an array type without a specific bound, deduce the | |
5301 | array size from the initializer. */ | |
5302 | maybe_deduce_size_from_array_init (decl, init); | |
5303 | type = TREE_TYPE (decl); | |
2b643eda MM |
5304 | if (type == error_mark_node) |
5305 | return NULL_TREE; | |
8e3df2de | 5306 | |
09357846 JM |
5307 | if (TYPE_NEEDS_CONSTRUCTING (type) |
5308 | || (CLASS_TYPE_P (type) | |
5309 | && !BRACE_ENCLOSED_INITIALIZER_P (init))) | |
5310 | return build_aggr_init_full_exprs (decl, init, flags); | |
5311 | else if (TREE_CODE (init) != TREE_VEC) | |
27778b73 | 5312 | { |
e57d93c6 | 5313 | init_code = store_init_value (decl, init, flags); |
09357846 JM |
5314 | if (pedantic && TREE_CODE (type) == ARRAY_TYPE |
5315 | && DECL_INITIAL (decl) | |
5316 | && TREE_CODE (DECL_INITIAL (decl)) == STRING_CST | |
5317 | && PAREN_STRING_LITERAL_P (DECL_INITIAL (decl))) | |
5318 | warning (0, "array %qD initialized by parenthesized string literal %qE", | |
5319 | decl, DECL_INITIAL (decl)); | |
5320 | init = NULL; | |
27778b73 | 5321 | } |
27778b73 MM |
5322 | } |
5323 | else if (DECL_EXTERNAL (decl)) | |
5324 | ; | |
8e3df2de | 5325 | else if (TYPE_P (type) && TYPE_NEEDS_CONSTRUCTING (type)) |
6ad86a5b FC |
5326 | { |
5327 | check_for_uninitialized_const_var (decl); | |
5328 | return build_aggr_init_full_exprs (decl, init, flags); | |
5329 | } | |
34655c9e | 5330 | else if (MAYBE_CLASS_TYPE_P (core_type = strip_array_types (type))) |
27778b73 | 5331 | { |
34655c9e FC |
5332 | if (CLASSTYPE_READONLY_FIELDS_NEED_INIT (core_type) |
5333 | || CLASSTYPE_REF_FIELDS_NEED_INIT (core_type)) | |
5334 | diagnose_uninitialized_cst_or_ref_member (core_type, /*using_new=*/false, | |
5335 | /*complain=*/true); | |
27778b73 MM |
5336 | |
5337 | check_for_uninitialized_const_var (decl); | |
27778b73 MM |
5338 | } |
5339 | else | |
5340 | check_for_uninitialized_const_var (decl); | |
68642fb6 | 5341 | |
8e3df2de | 5342 | if (init && init != error_mark_node) |
f293ce4b | 5343 | init_code = build2 (INIT_EXPR, type, decl, init); |
8e3df2de | 5344 | |
25ebb82a | 5345 | return init_code; |
27778b73 MM |
5346 | } |
5347 | ||
5348 | /* If DECL is not a local variable, give it RTL. */ | |
5349 | ||
5350 | static void | |
11f6b451 | 5351 | make_rtl_for_nonlocal_decl (tree decl, tree init, const char* asmspec) |
27778b73 | 5352 | { |
95ee998c MM |
5353 | int toplev = toplevel_bindings_p (); |
5354 | int defer_p; | |
9f12b095 | 5355 | const char *filename; |
27778b73 | 5356 | |
0e6df31e GK |
5357 | /* Set the DECL_ASSEMBLER_NAME for the object. */ |
5358 | if (asmspec) | |
5359 | { | |
5360 | /* The `register' keyword, when used together with an | |
5361 | asm-specification, indicates that the variable should be | |
5362 | placed in a particular register. */ | |
5363 | if (TREE_CODE (decl) == VAR_DECL && DECL_REGISTER (decl)) | |
5364 | { | |
11e3f4b6 | 5365 | set_user_assembler_name (decl, asmspec); |
0e6df31e GK |
5366 | DECL_HARD_REGISTER (decl) = 1; |
5367 | } | |
5368 | else | |
b482789c MA |
5369 | { |
5370 | if (TREE_CODE (decl) == FUNCTION_DECL | |
5371 | && DECL_BUILT_IN_CLASS (decl) == BUILT_IN_NORMAL) | |
5372 | set_builtin_user_assembler_name (decl, asmspec); | |
5373 | set_user_assembler_name (decl, asmspec); | |
5374 | } | |
0e6df31e GK |
5375 | } |
5376 | ||
f39ee884 MM |
5377 | /* Handle non-variables up front. */ |
5378 | if (TREE_CODE (decl) != VAR_DECL) | |
5379 | { | |
0e6df31e | 5380 | rest_of_decl_compilation (decl, toplev, at_eof); |
f39ee884 MM |
5381 | return; |
5382 | } | |
5383 | ||
95ee998c MM |
5384 | /* If we see a class member here, it should be a static data |
5385 | member. */ | |
5386 | if (DECL_LANG_SPECIFIC (decl) && DECL_IN_AGGR_P (decl)) | |
5387 | { | |
50bc768d | 5388 | gcc_assert (TREE_STATIC (decl)); |
95ee998c MM |
5389 | /* An in-class declaration of a static data member should be |
5390 | external; it is only a declaration, and not a definition. */ | |
5391 | if (init == NULL_TREE) | |
dc472c59 | 5392 | gcc_assert (DECL_EXTERNAL (decl) || !TREE_PUBLIC (decl)); |
95ee998c MM |
5393 | } |
5394 | ||
95ee998c MM |
5395 | /* We don't create any RTL for local variables. */ |
5396 | if (DECL_FUNCTION_SCOPE_P (decl) && !TREE_STATIC (decl)) | |
5397 | return; | |
27778b73 | 5398 | |
95ee998c | 5399 | /* We defer emission of local statics until the corresponding |
350fae66 | 5400 | DECL_EXPR is expanded. */ |
95ee998c MM |
5401 | defer_p = DECL_FUNCTION_SCOPE_P (decl) || DECL_VIRTUAL_P (decl); |
5402 | ||
b602511f JM |
5403 | /* We try to defer namespace-scope static constants so that they are |
5404 | not emitted into the object file unnecessarily. */ | |
9f12b095 | 5405 | filename = input_filename; |
b602511f JM |
5406 | if (!DECL_VIRTUAL_P (decl) |
5407 | && TREE_READONLY (decl) | |
5408 | && DECL_INITIAL (decl) != NULL_TREE | |
5409 | && DECL_INITIAL (decl) != error_mark_node | |
9f12b095 | 5410 | && filename != NULL |
b602511f JM |
5411 | && ! EMPTY_CONSTRUCTOR_P (DECL_INITIAL (decl)) |
5412 | && toplev | |
5413 | && !TREE_PUBLIC (decl)) | |
5cc90635 JM |
5414 | { |
5415 | /* Fool with the linkage of static consts according to #pragma | |
5416 | interface. */ | |
c533e34d | 5417 | struct c_fileinfo *finfo = get_fileinfo (filename); |
5d709b00 | 5418 | if (!finfo->interface_unknown && !TREE_PUBLIC (decl)) |
27778b73 | 5419 | { |
95ee998c | 5420 | TREE_PUBLIC (decl) = 1; |
5d709b00 | 5421 | DECL_EXTERNAL (decl) = finfo->interface_only; |
27778b73 | 5422 | } |
27778b73 | 5423 | |
95ee998c | 5424 | defer_p = 1; |
27778b73 | 5425 | } |
b602511f | 5426 | /* Likewise for template instantiations. */ |
4684cd27 MM |
5427 | else if (DECL_LANG_SPECIFIC (decl) |
5428 | && DECL_IMPLICIT_INSTANTIATION (decl)) | |
b602511f | 5429 | defer_p = 1; |
95ee998c | 5430 | |
95ee998c | 5431 | /* If we're not deferring, go ahead and assemble the variable. */ |
0e6df31e GK |
5432 | if (!defer_p) |
5433 | rest_of_decl_compilation (decl, toplev, at_eof); | |
27778b73 MM |
5434 | } |
5435 | ||
a24549d4 JM |
5436 | /* walk_tree helper for wrap_temporary_cleanups, below. */ |
5437 | ||
5438 | static tree | |
5439 | wrap_cleanups_r (tree *stmt_p, int *walk_subtrees, void *data) | |
5440 | { | |
5441 | if (TYPE_P (*stmt_p)) | |
5442 | { | |
5443 | *walk_subtrees = 0; | |
5444 | return NULL_TREE; | |
5445 | } | |
5446 | ||
5447 | if (TREE_CODE (*stmt_p) == TARGET_EXPR) | |
5448 | { | |
5449 | tree guard = (tree)data; | |
5450 | tree tcleanup = TARGET_EXPR_CLEANUP (*stmt_p); | |
5451 | ||
5452 | tcleanup = build2 (TRY_CATCH_EXPR, void_type_node, tcleanup, guard); | |
33b45227 JM |
5453 | /* Tell honor_protect_cleanup_actions to handle this as a separate |
5454 | cleanup. */ | |
5455 | TRY_CATCH_IS_CLEANUP (tcleanup) = 1; | |
5456 | ||
a24549d4 JM |
5457 | TARGET_EXPR_CLEANUP (*stmt_p) = tcleanup; |
5458 | } | |
5459 | ||
5460 | return NULL_TREE; | |
5461 | } | |
5462 | ||
5463 | /* We're initializing a local variable which has a cleanup GUARD. If there | |
5464 | are any temporaries used in the initializer INIT of this variable, we | |
5465 | need to wrap their cleanups with TRY_CATCH_EXPR (, GUARD) so that the | |
33b45227 JM |
5466 | variable will be cleaned up properly if one of them throws. |
5467 | ||
5468 | Unfortunately, there's no way to express this properly in terms of | |
5469 | nesting, as the regions for the temporaries overlap the region for the | |
5470 | variable itself; if there are two temporaries, the variable needs to be | |
5471 | the first thing destroyed if either of them throws. However, we only | |
5472 | want to run the variable's cleanup if it actually got constructed. So | |
5473 | we need to guard the temporary cleanups with the variable's cleanup if | |
5474 | they are run on the normal path, but not if they are run on the | |
5475 | exceptional path. We implement this by telling | |
5476 | honor_protect_cleanup_actions to strip the variable cleanup from the | |
5477 | exceptional path. */ | |
a24549d4 JM |
5478 | |
5479 | static void | |
5480 | wrap_temporary_cleanups (tree init, tree guard) | |
5481 | { | |
5482 | cp_walk_tree_without_duplicates (&init, wrap_cleanups_r, (void *)guard); | |
5483 | } | |
5484 | ||
ed5511d9 | 5485 | /* Generate code to initialize DECL (a local variable). */ |
27778b73 | 5486 | |
8e3df2de | 5487 | static void |
11f6b451 | 5488 | initialize_local_var (tree decl, tree init) |
27778b73 | 5489 | { |
9ed9e79a | 5490 | tree type = TREE_TYPE (decl); |
170b020f | 5491 | tree cleanup; |
a24549d4 | 5492 | int already_used; |
27778b73 | 5493 | |
50bc768d NS |
5494 | gcc_assert (TREE_CODE (decl) == VAR_DECL |
5495 | || TREE_CODE (decl) == RESULT_DECL); | |
5496 | gcc_assert (!TREE_STATIC (decl)); | |
b7b8bcd2 | 5497 | |
8e3df2de | 5498 | if (DECL_SIZE (decl) == NULL_TREE) |
b7b8bcd2 MM |
5499 | { |
5500 | /* If we used it already as memory, it must stay in memory. */ | |
5501 | DECL_INITIAL (decl) = NULL_TREE; | |
5502 | TREE_ADDRESSABLE (decl) = TREE_USED (decl); | |
a24549d4 | 5503 | return; |
b7b8bcd2 MM |
5504 | } |
5505 | ||
a24549d4 JM |
5506 | if (type == error_mark_node) |
5507 | return; | |
68642fb6 | 5508 | |
a24549d4 JM |
5509 | /* Compute and store the initial value. */ |
5510 | already_used = TREE_USED (decl) || TREE_USED (type); | |
026698d2 JJ |
5511 | if (TREE_USED (type)) |
5512 | DECL_READ_P (decl) = 1; | |
27778b73 | 5513 | |
a24549d4 JM |
5514 | /* Generate a cleanup, if necessary. */ |
5515 | cleanup = cxx_maybe_build_cleanup (decl); | |
27778b73 | 5516 | |
a24549d4 JM |
5517 | /* Perform the initialization. */ |
5518 | if (init) | |
5519 | { | |
5520 | int saved_stmts_are_full_exprs_p; | |
5521 | ||
5522 | /* If we're only initializing a single object, guard the destructors | |
5523 | of any temporaries used in its initializer with its destructor. | |
5524 | This isn't right for arrays because each element initialization is | |
5525 | a full-expression. */ | |
5526 | if (cleanup && TREE_CODE (type) != ARRAY_TYPE) | |
5527 | wrap_temporary_cleanups (init, cleanup); | |
5528 | ||
5529 | gcc_assert (building_stmt_tree ()); | |
5530 | saved_stmts_are_full_exprs_p = stmts_are_full_exprs_p (); | |
5531 | current_stmt_tree ()->stmts_are_full_exprs_p = 1; | |
5532 | finish_expr_stmt (init); | |
5533 | current_stmt_tree ()->stmts_are_full_exprs_p = | |
5534 | saved_stmts_are_full_exprs_p; | |
27778b73 | 5535 | } |
24bef158 | 5536 | |
a24549d4 JM |
5537 | /* Set this to 0 so we can tell whether an aggregate which was |
5538 | initialized was ever used. Don't do this if it has a | |
5539 | destructor, so we don't complain about the 'resource | |
5540 | allocation is initialization' idiom. Now set | |
5541 | attribute((unused)) on types so decls of that type will be | |
5542 | marked used. (see TREE_USED, above.) */ | |
5543 | if (TYPE_NEEDS_CONSTRUCTING (type) | |
5544 | && ! already_used | |
5545 | && TYPE_HAS_TRIVIAL_DESTRUCTOR (type) | |
5546 | && DECL_NAME (decl)) | |
5547 | TREE_USED (decl) = 0; | |
5548 | else if (already_used) | |
5549 | TREE_USED (decl) = 1; | |
5550 | ||
5551 | if (cleanup) | |
170b020f | 5552 | finish_decl_cleanup (decl, cleanup); |
24bef158 MM |
5553 | } |
5554 | ||
19c29b2f MM |
5555 | /* DECL is a VAR_DECL for a compiler-generated variable with static |
5556 | storage duration (like a virtual table) whose initializer is a | |
9d6a019c | 5557 | compile-time constant. Initialize the variable and provide it to the |
3b2db49f | 5558 | back end. */ |
19c29b2f MM |
5559 | |
5560 | void | |
9d6a019c | 5561 | initialize_artificial_var (tree decl, VEC(constructor_elt,gc) *v) |
19c29b2f | 5562 | { |
9d6a019c | 5563 | tree init; |
d23f3d60 | 5564 | gcc_assert (DECL_ARTIFICIAL (decl)); |
9d6a019c | 5565 | init = build_constructor (TREE_TYPE (decl), v); |
3b2db49f MM |
5566 | gcc_assert (TREE_CODE (init) == CONSTRUCTOR); |
5567 | DECL_INITIAL (decl) = init; | |
19c29b2f MM |
5568 | DECL_INITIALIZED_P (decl) = 1; |
5569 | determine_visibility (decl); | |
5570 | layout_var_decl (decl); | |
5571 | maybe_commonize_var (decl); | |
5572 | make_rtl_for_nonlocal_decl (decl, init, /*asmspec=*/NULL); | |
5573 | } | |
5574 | ||
32a11c08 MM |
5575 | /* INIT is the initializer for a variable, as represented by the |
5576 | parser. Returns true iff INIT is value-dependent. */ | |
5577 | ||
5578 | static bool | |
5579 | value_dependent_init_p (tree init) | |
5580 | { | |
5581 | if (TREE_CODE (init) == TREE_LIST) | |
5582 | /* A parenthesized initializer, e.g.: int i (3, 2); ? */ | |
5583 | return any_value_dependent_elements_p (init); | |
5584 | else if (TREE_CODE (init) == CONSTRUCTOR) | |
5585 | /* A brace-enclosed initializer, e.g.: int i = { 3 }; ? */ | |
5586 | { | |
5587 | VEC(constructor_elt, gc) *elts; | |
5588 | size_t nelts; | |
5589 | size_t i; | |
5590 | ||
5591 | elts = CONSTRUCTOR_ELTS (init); | |
5592 | nelts = VEC_length (constructor_elt, elts); | |
5593 | for (i = 0; i < nelts; ++i) | |
5594 | if (value_dependent_init_p (VEC_index (constructor_elt, | |
5595 | elts, i)->value)) | |
5596 | return true; | |
5597 | } | |
5598 | else | |
5599 | /* It must be a simple expression, e.g., int i = 3; */ | |
5600 | return value_dependent_expression_p (init); | |
5601 | ||
5602 | return false; | |
5603 | } | |
5604 | ||
8d08fdba MS |
5605 | /* Finish processing of a declaration; |
5606 | install its line number and initial value. | |
5607 | If the length of an array type is not known before, | |
5608 | it must be determined now, from the initial value, or it is an error. | |
5609 | ||
d174af6c MM |
5610 | INIT is the initializer (if any) for DECL. If INIT_CONST_EXPR_P is |
5611 | true, then INIT is an integral constant expression. | |
8d08fdba | 5612 | |
920f9474 | 5613 | FLAGS is LOOKUP_ONLYCONVERTING if the = init syntax was used, else 0 |
f78c7bc6 | 5614 | if the (init) syntax was used. */ |
8d08fdba MS |
5615 | |
5616 | void | |
3db45ab5 | 5617 | cp_finish_decl (tree decl, tree init, bool init_const_expr_p, |
d174af6c | 5618 | tree asmspec_tree, int flags) |
8d08fdba | 5619 | { |
7e99327d | 5620 | tree type; |
7e99327d | 5621 | tree cleanup; |
9c0758dd | 5622 | const char *asmspec = NULL; |
8d08fdba | 5623 | int was_readonly = 0; |
745d26d9 | 5624 | bool var_definition_p = false; |
2b643eda | 5625 | int saved_processing_template_decl; |
86a09a9e | 5626 | tree auto_node; |
8d08fdba | 5627 | |
11325dcd KL |
5628 | if (decl == error_mark_node) |
5629 | return; | |
5630 | else if (! decl) | |
8d08fdba MS |
5631 | { |
5632 | if (init) | |
8251199e | 5633 | error ("assignment (not initialization) in declaration"); |
8d08fdba MS |
5634 | return; |
5635 | } | |
5636 | ||
50bc768d | 5637 | gcc_assert (TREE_CODE (decl) != RESULT_DECL); |
2b643eda MM |
5638 | /* Parameters are handled by store_parm_decls, not cp_finish_decl. */ |
5639 | gcc_assert (TREE_CODE (decl) != PARM_DECL); | |
5640 | ||
5641 | type = TREE_TYPE (decl); | |
5642 | if (type == error_mark_node) | |
5643 | return; | |
170b020f | 5644 | |
7e99327d MM |
5645 | /* Assume no cleanup is required. */ |
5646 | cleanup = NULL_TREE; | |
2b643eda | 5647 | saved_processing_template_decl = processing_template_decl; |
7e99327d | 5648 | |
a4443a08 | 5649 | /* If a name was specified, get the string. */ |
5f52c0e0 | 5650 | if (global_scope_p (current_binding_level)) |
41c64394 | 5651 | asmspec_tree = maybe_apply_renaming_pragma (decl, asmspec_tree); |
4f543d15 | 5652 | if (asmspec_tree && asmspec_tree != error_mark_node) |
5cc90635 | 5653 | asmspec = TREE_STRING_POINTER (asmspec_tree); |
8d08fdba | 5654 | |
6ba89f8e | 5655 | if (current_class_type |
4f1c5b7d | 5656 | && CP_DECL_CONTEXT (decl) == current_class_type |
6ba89f8e MM |
5657 | && TYPE_BEING_DEFINED (current_class_type) |
5658 | && (DECL_INITIAL (decl) || init)) | |
3febd123 | 5659 | DECL_INITIALIZED_IN_CLASS_P (decl) = 1; |
6ba89f8e | 5660 | |
86a09a9e | 5661 | auto_node = type_uses_auto (type); |
0a3098bb | 5662 | if (auto_node) |
86a09a9e | 5663 | { |
0a3098bb JJ |
5664 | if (init == NULL_TREE) |
5665 | { | |
5666 | error ("declaration of %q#D has no initializer", decl); | |
5667 | TREE_TYPE (decl) = error_mark_node; | |
5668 | return; | |
5669 | } | |
ccafc19b JM |
5670 | if (TREE_CODE (init) == TREE_LIST) |
5671 | init = build_x_compound_expr_from_list (init, "initializer"); | |
5672 | if (describable_type (init)) | |
0a3098bb JJ |
5673 | { |
5674 | type = TREE_TYPE (decl) = do_auto_deduction (type, init, auto_node); | |
5675 | if (type == error_mark_node) | |
5676 | return; | |
5677 | } | |
86a09a9e JM |
5678 | } |
5679 | ||
3f6079dd JM |
5680 | if (init && TREE_CODE (decl) == FUNCTION_DECL) |
5681 | { | |
2968d410 | 5682 | tree clone; |
3f6079dd JM |
5683 | if (init == ridpointers[(int)RID_DELETE]) |
5684 | { | |
5685 | /* FIXME check this is 1st decl. */ | |
5686 | DECL_DELETED_FN (decl) = 1; | |
5687 | DECL_DECLARED_INLINE_P (decl) = 1; | |
5688 | DECL_INITIAL (decl) = error_mark_node; | |
2968d410 JM |
5689 | FOR_EACH_CLONE (clone, decl) |
5690 | { | |
5691 | DECL_DELETED_FN (clone) = 1; | |
5692 | DECL_DECLARED_INLINE_P (clone) = 1; | |
5693 | DECL_INITIAL (clone) = error_mark_node; | |
5694 | } | |
3f6079dd JM |
5695 | init = NULL_TREE; |
5696 | } | |
5697 | else if (init == ridpointers[(int)RID_DEFAULT]) | |
5698 | { | |
20f2653e JM |
5699 | if (defaultable_fn_check (decl)) |
5700 | DECL_DEFAULTED_FN (decl) = 1; | |
3f6079dd | 5701 | else |
20f2653e | 5702 | DECL_INITIAL (decl) = NULL_TREE; |
3f6079dd JM |
5703 | } |
5704 | } | |
5705 | ||
5156628f | 5706 | if (processing_template_decl) |
5566b478 | 5707 | { |
2b643eda MM |
5708 | bool type_dependent_p; |
5709 | ||
08ac397c | 5710 | /* Add this declaration to the statement-tree. */ |
170b020f | 5711 | if (at_function_scope_p ()) |
350fae66 | 5712 | add_decl_expr (decl); |
08ac397c | 5713 | |
2b643eda MM |
5714 | type_dependent_p = dependent_type_p (type); |
5715 | ||
7b3e2d46 DG |
5716 | if (check_for_bare_parameter_packs (init)) |
5717 | { | |
5718 | init = NULL_TREE; | |
5719 | DECL_INITIAL (decl) = NULL_TREE; | |
5720 | } | |
5721 | ||
3e03c959 | 5722 | if (init && init_const_expr_p && TREE_CODE (decl) == VAR_DECL) |
d174af6c | 5723 | { |
2b643eda MM |
5724 | DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (decl) = 1; |
5725 | if (DECL_INTEGRAL_CONSTANT_VAR_P (decl)) | |
5726 | TREE_CONSTANT (decl) = 1; | |
d174af6c MM |
5727 | } |
5728 | ||
32a11c08 MM |
5729 | /* Generally, initializers in templates are expanded when the |
5730 | template is instantiated. But, if DECL is an integral | |
5731 | constant static data member, then it can be used in future | |
5732 | integral constant expressions, and its value must be | |
5733 | available. */ | |
5734 | if (!(init | |
5735 | && DECL_CLASS_SCOPE_P (decl) | |
5736 | && DECL_INTEGRAL_CONSTANT_VAR_P (decl) | |
5737 | && !type_dependent_p | |
5738 | && !value_dependent_init_p (init))) | |
2b643eda MM |
5739 | { |
5740 | if (init) | |
5741 | DECL_INITIAL (decl) = init; | |
5742 | if (TREE_CODE (decl) == VAR_DECL | |
5743 | && !DECL_PRETTY_FUNCTION_P (decl) | |
5744 | && !type_dependent_p) | |
5745 | maybe_deduce_size_from_array_init (decl, init); | |
5746 | goto finish_end; | |
5747 | } | |
c8094d83 | 5748 | |
a125de0c PC |
5749 | if (TREE_CODE (init) == TREE_LIST) |
5750 | { | |
5751 | /* If the parenthesized-initializer form was used (e.g., | |
5752 | "int A<N>::i(X)"), then INIT will be a TREE_LIST of initializer | |
5753 | arguments. (There is generally only one.) We convert them | |
5754 | individually. */ | |
5755 | tree list = init; | |
5756 | for (; list; list = TREE_CHAIN (list)) | |
5757 | { | |
5758 | tree elt = TREE_VALUE (list); | |
5759 | TREE_VALUE (list) = fold_non_dependent_expr (elt); | |
5760 | } | |
5761 | } | |
5762 | else | |
5763 | init = fold_non_dependent_expr (init); | |
2b643eda | 5764 | processing_template_decl = 0; |
5566b478 | 5765 | } |
3e41d13b | 5766 | |
8d08fdba MS |
5767 | /* Take care of TYPE_DECLs up front. */ |
5768 | if (TREE_CODE (decl) == TYPE_DECL) | |
5769 | { | |
a0a33927 | 5770 | if (type != error_mark_node |
9e1e64ec | 5771 | && MAYBE_CLASS_TYPE_P (type) && DECL_NAME (decl)) |
8d08fdba MS |
5772 | { |
5773 | if (TREE_TYPE (DECL_NAME (decl)) && TREE_TYPE (decl) != type) | |
d4ee4d25 | 5774 | warning (0, "shadowing previous type declaration of %q#D", decl); |
4b0d3cbe | 5775 | set_identifier_type_value (DECL_NAME (decl), decl); |
8d08fdba | 5776 | } |
cffa8729 MS |
5777 | |
5778 | /* If we have installed this as the canonical typedef for this | |
5779 | type, and that type has not been defined yet, delay emitting | |
956d6950 | 5780 | the debug information for it, as we will emit it later. */ |
d2e5ee5c | 5781 | if (TYPE_MAIN_DECL (TREE_TYPE (decl)) == decl |
d0f062fb | 5782 | && !COMPLETE_TYPE_P (TREE_TYPE (decl))) |
cffa8729 MS |
5783 | TYPE_DECL_SUPPRESS_DEBUG (decl) = 1; |
5784 | ||
0e6df31e GK |
5785 | rest_of_decl_compilation (decl, DECL_CONTEXT (decl) == NULL_TREE, |
5786 | at_eof); | |
8d08fdba MS |
5787 | goto finish_end; |
5788 | } | |
3e41d13b | 5789 | |
67935995 | 5790 | /* A reference will be modified here, as it is initialized. */ |
c8094d83 | 5791 | if (! DECL_EXTERNAL (decl) |
67935995 MM |
5792 | && TREE_READONLY (decl) |
5793 | && TREE_CODE (type) == REFERENCE_TYPE) | |
8d08fdba | 5794 | { |
8d08fdba | 5795 | was_readonly = 1; |
67935995 | 5796 | TREE_READONLY (decl) = 0; |
8d08fdba MS |
5797 | } |
5798 | ||
437081d7 | 5799 | if (TREE_CODE (decl) == VAR_DECL) |
17bbb839 | 5800 | { |
c32097d8 JM |
5801 | /* Only variables with trivial initialization and destruction can |
5802 | have thread-local storage. */ | |
5803 | if (DECL_THREAD_LOCAL_P (decl) | |
5804 | && (type_has_nontrivial_default_init (TREE_TYPE (decl)) | |
5805 | || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (TREE_TYPE (decl)))) | |
5806 | error ("%qD cannot be thread-local because it has non-trivial " | |
5807 | "type %qT", decl, TREE_TYPE (decl)); | |
d23f3d60 MM |
5808 | /* If this is a local variable that will need a mangled name, |
5809 | register it now. We must do this before processing the | |
5810 | initializer for the variable, since the initialization might | |
5811 | require a guard variable, and since the mangled name of the | |
5812 | guard variable will depend on the mangled name of this | |
5813 | variable. */ | |
b0eb6a8f | 5814 | if (DECL_FUNCTION_SCOPE_P (decl) |
d23f3d60 MM |
5815 | && TREE_STATIC (decl) |
5816 | && !DECL_ARTIFICIAL (decl)) | |
e6ca6e2a JM |
5817 | { |
5818 | push_local_name (decl); | |
5819 | if (DECL_CONSTRUCTOR_P (current_function_decl) | |
5820 | || DECL_DESTRUCTOR_P (current_function_decl)) | |
5821 | /* Normally local_decls is populated during GIMPLE lowering, | |
5822 | but [cd]tors are never actually compiled directly. We need | |
5823 | to put statics on the list so we can deal with the label | |
5824 | address extension. */ | |
5825 | cfun->local_decls = tree_cons (NULL_TREE, decl, | |
5826 | cfun->local_decls); | |
5827 | } | |
5828 | ||
17bbb839 MM |
5829 | /* Convert the initializer to the type of DECL, if we have not |
5830 | already initialized DECL. */ | |
5831 | if (!DECL_INITIALIZED_P (decl) | |
5832 | /* If !DECL_EXTERNAL then DECL is being defined. In the | |
8e3df2de | 5833 | case of a static data member initialized inside the |
17bbb839 MM |
5834 | class-specifier, there can be an initializer even if DECL |
5835 | is *not* defined. */ | |
5836 | && (!DECL_EXTERNAL (decl) || init)) | |
5837 | { | |
9e1e64ec | 5838 | if (TYPE_FOR_JAVA (type) && MAYBE_CLASS_TYPE_P (type)) |
360f866c JJ |
5839 | { |
5840 | tree jclass | |
5841 | = IDENTIFIER_GLOBAL_VALUE (get_identifier ("jclass")); | |
5842 | /* Allow libjava/prims.cc define primitive classes. */ | |
5843 | if (init != NULL_TREE | |
5844 | || jclass == NULL_TREE | |
5845 | || TREE_CODE (jclass) != TYPE_DECL | |
5846 | || !POINTER_TYPE_P (TREE_TYPE (jclass)) | |
5847 | || !same_type_ignoring_top_level_qualifiers_p | |
5848 | (type, TREE_TYPE (TREE_TYPE (jclass)))) | |
5849 | error ("Java object %qD not allocated with %<new%>", decl); | |
5850 | init = NULL_TREE; | |
5851 | } | |
6c06fbce | 5852 | if (init) |
d174af6c MM |
5853 | { |
5854 | DECL_NONTRIVIALLY_INITIALIZED_P (decl) = 1; | |
5855 | if (init_const_expr_p) | |
5856 | { | |
5857 | DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (decl) = 1; | |
5858 | if (DECL_INTEGRAL_CONSTANT_VAR_P (decl)) | |
5859 | TREE_CONSTANT (decl) = 1; | |
5860 | } | |
5861 | } | |
7e99327d | 5862 | init = check_initializer (decl, init, flags, &cleanup); |
b4c20e52 | 5863 | /* Thread-local storage cannot be dynamically initialized. */ |
c2f7fa15 | 5864 | if (DECL_THREAD_LOCAL_P (decl) && init) |
b4c20e52 | 5865 | { |
2d01edd7 | 5866 | error ("%qD is thread-local and so cannot be dynamically " |
b4c20e52 MM |
5867 | "initialized", decl); |
5868 | init = NULL_TREE; | |
5869 | } | |
b794e321 MM |
5870 | |
5871 | /* Check that the initializer for a static data member was a | |
1634705d | 5872 | constant. Although we check in the parser that the |
b794e321 MM |
5873 | initializer is an integral constant expression, we do not |
5874 | simplify division-by-zero at the point at which it | |
5875 | occurs. Therefore, in: | |
5876 | ||
5877 | struct S { static const int i = 7 / 0; }; | |
3db45ab5 | 5878 | |
b794e321 MM |
5879 | we issue an error at this point. It would |
5880 | probably be better to forbid division by zero in | |
5881 | integral constant expressions. */ | |
8fe4d24b NS |
5882 | if (DECL_EXTERNAL (decl) && init) |
5883 | { | |
8fe4d24b NS |
5884 | error ("%qD cannot be initialized by a non-constant expression" |
5885 | " when being declared", decl); | |
5886 | DECL_INITIALIZED_IN_CLASS_P (decl) = 0; | |
5887 | init = NULL_TREE; | |
5888 | } | |
c8094d83 | 5889 | |
17bbb839 | 5890 | /* Handle: |
caf93cb0 | 5891 | |
17bbb839 | 5892 | [dcl.init] |
caf93cb0 | 5893 | |
17bbb839 MM |
5894 | The memory occupied by any object of static storage |
5895 | duration is zero-initialized at program startup before | |
5896 | any other initialization takes place. | |
caf93cb0 | 5897 | |
17bbb839 MM |
5898 | We cannot create an appropriate initializer until after |
5899 | the type of DECL is finalized. If DECL_INITIAL is set, | |
5900 | then the DECL is statically initialized, and any | |
5901 | necessary zero-initialization has already been performed. */ | |
5902 | if (TREE_STATIC (decl) && !DECL_INITIAL (decl)) | |
5903 | DECL_INITIAL (decl) = build_zero_init (TREE_TYPE (decl), | |
1cb8292f | 5904 | /*nelts=*/NULL_TREE, |
17bbb839 MM |
5905 | /*static_storage_p=*/true); |
5906 | /* Remember that the initialization for this variable has | |
5907 | taken place. */ | |
5908 | DECL_INITIALIZED_P (decl) = 1; | |
745d26d9 MM |
5909 | /* This declaration is the definition of this variable, |
5910 | unless we are initializing a static data member within | |
5911 | the class specifier. */ | |
5912 | if (!DECL_EXTERNAL (decl)) | |
5913 | var_definition_p = true; | |
17bbb839 | 5914 | } |
d881ff25 MM |
5915 | /* If the variable has an array type, lay out the type, even if |
5916 | there is no initializer. It is valid to index through the | |
5917 | array, and we must get TYPE_ALIGN set correctly on the array | |
5918 | type. */ | |
5919 | else if (TREE_CODE (type) == ARRAY_TYPE) | |
5920 | layout_type (type); | |
b646ba3f DS |
5921 | |
5922 | if (!processing_template_decl | |
5923 | && TREE_STATIC (decl) | |
5924 | && !at_function_scope_p () | |
5925 | && current_function_decl == NULL) | |
5926 | /* So decl is a global variable or a static member of a | |
5927 | non local class. Record the types it uses | |
5928 | so that we can decide later to emit debug info for them. */ | |
5929 | record_types_used_by_current_var_decl (decl); | |
17bbb839 | 5930 | } |
360f866c | 5931 | else if (TREE_CODE (decl) == FIELD_DECL |
9e1e64ec | 5932 | && TYPE_FOR_JAVA (type) && MAYBE_CLASS_TYPE_P (type)) |
360f866c | 5933 | error ("non-static data member %qD has Java class type", decl); |
3e41d13b | 5934 | |
57cf57fb | 5935 | /* Add this declaration to the statement-tree. This needs to happen |
350fae66 RK |
5936 | after the call to check_initializer so that the DECL_EXPR for a |
5937 | reference temp is added before the DECL_EXPR for the reference itself. */ | |
170b020f | 5938 | if (at_function_scope_p ()) |
350fae66 | 5939 | add_decl_expr (decl); |
08ac397c | 5940 | |
da71e18c MM |
5941 | /* Let the middle end know about variables and functions -- but not |
5942 | static data members in uninstantiated class templates. */ | |
5943 | if (!saved_processing_template_decl | |
5944 | && (TREE_CODE (decl) == VAR_DECL | |
5945 | || TREE_CODE (decl) == FUNCTION_DECL)) | |
8d08fdba | 5946 | { |
27778b73 | 5947 | if (TREE_CODE (decl) == VAR_DECL) |
da71e18c MM |
5948 | { |
5949 | layout_var_decl (decl); | |
5950 | maybe_commonize_var (decl); | |
5951 | } | |
8d08fdba | 5952 | |
4c5bae34 RS |
5953 | /* This needs to happen after the linkage is set. */ |
5954 | determine_visibility (decl); | |
5955 | ||
b0eb6a8f JJ |
5956 | if (var_definition_p && TREE_STATIC (decl)) |
5957 | { | |
5958 | /* If a TREE_READONLY variable needs initialization | |
5959 | at runtime, it is no longer readonly and we need to | |
5960 | avoid MEM_READONLY_P being set on RTL created for it. */ | |
5961 | if (init) | |
5962 | { | |
5963 | if (TREE_READONLY (decl)) | |
5964 | TREE_READONLY (decl) = 0; | |
5965 | was_readonly = 0; | |
5966 | } | |
5967 | else if (was_readonly) | |
5968 | TREE_READONLY (decl) = 1; | |
5969 | } | |
5970 | ||
27778b73 | 5971 | make_rtl_for_nonlocal_decl (decl, init, asmspec); |
8d08fdba | 5972 | |
7fb213d8 GB |
5973 | /* Check for abstractness of the type. Notice that there is no |
5974 | need to strip array types here since the check for those types | |
5975 | is already done within create_array_type_for_decl. */ | |
68642fb6 | 5976 | if (TREE_CODE (type) == FUNCTION_TYPE |
27778b73 | 5977 | || TREE_CODE (type) == METHOD_TYPE) |
7fb213d8 | 5978 | abstract_virtuals_error (decl, TREE_TYPE (type)); |
68642fb6 | 5979 | else |
cfb91b67 | 5980 | abstract_virtuals_error (decl, type); |
8d08fdba | 5981 | |
b87d79e6 | 5982 | if (TREE_TYPE (decl) == error_mark_node) |
8e3df2de | 5983 | /* No initialization required. */ |
faae18ab | 5984 | ; |
b87d79e6 JM |
5985 | else if (TREE_CODE (decl) == FUNCTION_DECL) |
5986 | { | |
5987 | if (init) | |
5988 | { | |
3f6079dd | 5989 | if (init == ridpointers[(int)RID_DEFAULT]) |
b87d79e6 | 5990 | { |
3f6079dd JM |
5991 | /* An out-of-class default definition is defined at |
5992 | the point where it is explicitly defaulted. */ | |
5993 | if (DECL_INITIAL (decl) == error_mark_node) | |
5994 | synthesize_method (decl); | |
b87d79e6 JM |
5995 | } |
5996 | else | |
5997 | error ("function %q#D is initialized like a variable", decl); | |
5998 | } | |
5999 | /* else no initialization required. */ | |
6000 | } | |
67d743fe MS |
6001 | else if (DECL_EXTERNAL (decl) |
6002 | && ! (DECL_LANG_SPECIFIC (decl) | |
6003 | && DECL_NOT_REALLY_EXTERN (decl))) | |
5566b478 MS |
6004 | { |
6005 | if (init) | |
6006 | DECL_INITIAL (decl) = init; | |
6007 | } | |
b0eb6a8f JJ |
6008 | /* A variable definition. */ |
6009 | else if (DECL_FUNCTION_SCOPE_P (decl) && !TREE_STATIC (decl)) | |
6010 | /* Initialize the local variable. */ | |
6011 | initialize_local_var (decl, init); | |
6012 | ||
6013 | /* If a variable is defined, and then a subsequent | |
6014 | definition with external linkage is encountered, we will | |
6015 | get here twice for the same variable. We want to avoid | |
6016 | calling expand_static_init more than once. For variables | |
6017 | that are not static data members, we can call | |
6018 | expand_static_init only when we actually process the | |
6019 | initializer. It is not legal to redeclare a static data | |
6020 | member, so this issue does not arise in that case. */ | |
6021 | else if (var_definition_p && TREE_STATIC (decl)) | |
6022 | expand_static_init (decl, init); | |
8d08fdba MS |
6023 | } |
6024 | ||
7e99327d MM |
6025 | /* If a CLEANUP_STMT was created to destroy a temporary bound to a |
6026 | reference, insert it in the statement-tree now. */ | |
6027 | if (cleanup) | |
325c3691 | 6028 | push_cleanup (decl, cleanup, false); |
7e99327d | 6029 | |
8d08fdba | 6030 | finish_end: |
2b643eda | 6031 | processing_template_decl = saved_processing_template_decl; |
8d08fdba | 6032 | |
8d08fdba MS |
6033 | if (was_readonly) |
6034 | TREE_READONLY (decl) = 1; | |
8d08fdba MS |
6035 | } |
6036 | ||
db4283a0 MM |
6037 | /* Returns a declaration for a VAR_DECL as if: |
6038 | ||
6039 | extern "C" TYPE NAME; | |
6040 | ||
6041 | had been seen. Used to create compiler-generated global | |
6042 | variables. */ | |
6043 | ||
993acaec | 6044 | static tree |
11f6b451 | 6045 | declare_global_var (tree name, tree type) |
db4283a0 MM |
6046 | { |
6047 | tree decl; | |
6048 | ||
6049 | push_to_top_level (); | |
c2255bc4 | 6050 | decl = build_decl (input_location, VAR_DECL, name, type); |
db4283a0 MM |
6051 | TREE_PUBLIC (decl) = 1; |
6052 | DECL_EXTERNAL (decl) = 1; | |
6053 | DECL_ARTIFICIAL (decl) = 1; | |
de3fe73c MM |
6054 | /* If the user has explicitly declared this variable (perhaps |
6055 | because the code we are compiling is part of a low-level runtime | |
6056 | library), then it is possible that our declaration will be merged | |
6057 | with theirs by pushdecl. */ | |
6058 | decl = pushdecl (decl); | |
3600f678 | 6059 | cp_finish_decl (decl, NULL_TREE, false, NULL_TREE, 0); |
db4283a0 MM |
6060 | pop_from_top_level (); |
6061 | ||
6062 | return decl; | |
6063 | } | |
6064 | ||
46a9e521 MM |
6065 | /* Returns the type for the argument to "__cxa_atexit" (or "atexit", |
6066 | if "__cxa_atexit" is not being used) corresponding to the function | |
6067 | to be called when the program exits. */ | |
6068 | ||
6069 | static tree | |
6070 | get_atexit_fn_ptr_type (void) | |
6071 | { | |
6072 | tree arg_types; | |
6073 | tree fn_type; | |
6074 | ||
6075 | if (!atexit_fn_ptr_type_node) | |
6076 | { | |
6077 | if (flag_use_cxa_atexit | |
6078 | && !targetm.cxx.use_atexit_for_cxa_atexit ()) | |
6079 | /* The parameter to "__cxa_atexit" is "void (*)(void *)". */ | |
6080 | arg_types = tree_cons (NULL_TREE, ptr_type_node, void_list_node); | |
6081 | else | |
6082 | /* The parameter to "atexit" is "void (*)(void)". */ | |
6083 | arg_types = void_list_node; | |
6084 | ||
6085 | fn_type = build_function_type (void_type_node, arg_types); | |
6086 | atexit_fn_ptr_type_node = build_pointer_type (fn_type); | |
6087 | } | |
6088 | ||
6089 | return atexit_fn_ptr_type_node; | |
6090 | } | |
6091 | ||
db4283a0 | 6092 | /* Returns a pointer to the `atexit' function. Note that if |
838dfd8a | 6093 | FLAG_USE_CXA_ATEXIT is nonzero, then this will actually be the new |
db4283a0 MM |
6094 | `__cxa_atexit' function specified in the IA64 C++ ABI. */ |
6095 | ||
6096 | static tree | |
11f6b451 | 6097 | get_atexit_node (void) |
db4283a0 MM |
6098 | { |
6099 | tree atexit_fndecl; | |
6100 | tree arg_types; | |
6101 | tree fn_type; | |
6102 | tree fn_ptr_type; | |
6103 | const char *name; | |
9f62c3e3 | 6104 | bool use_aeabi_atexit; |
db4283a0 MM |
6105 | |
6106 | if (atexit_node) | |
6107 | return atexit_node; | |
6108 | ||
97388150 | 6109 | if (flag_use_cxa_atexit && !targetm.cxx.use_atexit_for_cxa_atexit ()) |
db4283a0 MM |
6110 | { |
6111 | /* The declaration for `__cxa_atexit' is: | |
6112 | ||
6113 | int __cxa_atexit (void (*)(void *), void *, void *) | |
6114 | ||
6115 | We build up the argument types and then then function type | |
6116 | itself. */ | |
68642fb6 | 6117 | |
9f62c3e3 | 6118 | use_aeabi_atexit = targetm.cxx.use_aeabi_atexit (); |
db4283a0 MM |
6119 | /* First, build the pointer-to-function type for the first |
6120 | argument. */ | |
46a9e521 | 6121 | fn_ptr_type = get_atexit_fn_ptr_type (); |
db4283a0 MM |
6122 | /* Then, build the rest of the argument types. */ |
6123 | arg_types = tree_cons (NULL_TREE, ptr_type_node, void_list_node); | |
9f62c3e3 PB |
6124 | if (use_aeabi_atexit) |
6125 | { | |
6126 | arg_types = tree_cons (NULL_TREE, fn_ptr_type, arg_types); | |
6127 | arg_types = tree_cons (NULL_TREE, ptr_type_node, arg_types); | |
6128 | } | |
6129 | else | |
6130 | { | |
6131 | arg_types = tree_cons (NULL_TREE, ptr_type_node, arg_types); | |
6132 | arg_types = tree_cons (NULL_TREE, fn_ptr_type, arg_types); | |
6133 | } | |
db4283a0 MM |
6134 | /* And the final __cxa_atexit type. */ |
6135 | fn_type = build_function_type (integer_type_node, arg_types); | |
6136 | fn_ptr_type = build_pointer_type (fn_type); | |
9f62c3e3 PB |
6137 | if (use_aeabi_atexit) |
6138 | name = "__aeabi_atexit"; | |
6139 | else | |
6140 | name = "__cxa_atexit"; | |
db4283a0 MM |
6141 | } |
6142 | else | |
6143 | { | |
6144 | /* The declaration for `atexit' is: | |
68642fb6 | 6145 | |
0cbd7506 | 6146 | int atexit (void (*)()); |
db4283a0 MM |
6147 | |
6148 | We build up the argument types and then then function type | |
6149 | itself. */ | |
46a9e521 | 6150 | fn_ptr_type = get_atexit_fn_ptr_type (); |
db4283a0 MM |
6151 | arg_types = tree_cons (NULL_TREE, fn_ptr_type, void_list_node); |
6152 | /* Build the final atexit type. */ | |
6153 | fn_type = build_function_type (integer_type_node, arg_types); | |
6154 | name = "atexit"; | |
6155 | } | |
6156 | ||
6157 | /* Now, build the function declaration. */ | |
6158 | push_lang_context (lang_name_c); | |
0c11ada6 | 6159 | atexit_fndecl = build_library_fn_ptr (name, fn_type); |
db4283a0 MM |
6160 | mark_used (atexit_fndecl); |
6161 | pop_lang_context (); | |
0a72704b | 6162 | atexit_node = decay_conversion (atexit_fndecl); |
db4283a0 MM |
6163 | |
6164 | return atexit_node; | |
6165 | } | |
6166 | ||
6167 | /* Returns the __dso_handle VAR_DECL. */ | |
6168 | ||
6169 | static tree | |
11f6b451 | 6170 | get_dso_handle_node (void) |
db4283a0 MM |
6171 | { |
6172 | if (dso_handle_node) | |
6173 | return dso_handle_node; | |
6174 | ||
6175 | /* Declare the variable. */ | |
6176 | dso_handle_node = declare_global_var (get_identifier ("__dso_handle"), | |
6177 | ptr_type_node); | |
6178 | ||
6179 | return dso_handle_node; | |
6180 | } | |
6181 | ||
6182 | /* Begin a new function with internal linkage whose job will be simply | |
6183 | to destroy some particular variable. */ | |
6184 | ||
d192828a GK |
6185 | static GTY(()) int start_cleanup_cnt; |
6186 | ||
db4283a0 | 6187 | static tree |
11f6b451 | 6188 | start_cleanup_fn (void) |
db4283a0 | 6189 | { |
db4283a0 | 6190 | char name[32]; |
db4283a0 MM |
6191 | tree fntype; |
6192 | tree fndecl; | |
97388150 DS |
6193 | bool use_cxa_atexit = flag_use_cxa_atexit |
6194 | && !targetm.cxx.use_atexit_for_cxa_atexit (); | |
db4283a0 MM |
6195 | |
6196 | push_to_top_level (); | |
6197 | ||
6198 | /* No need to mangle this. */ | |
6199 | push_lang_context (lang_name_c); | |
6200 | ||
db4283a0 | 6201 | /* Build the name of the function. */ |
d192828a | 6202 | sprintf (name, "__tcf_%d", start_cleanup_cnt++); |
db4283a0 | 6203 | /* Build the function declaration. */ |
46a9e521 | 6204 | fntype = TREE_TYPE (get_atexit_fn_ptr_type ()); |
db4283a0 MM |
6205 | fndecl = build_lang_decl (FUNCTION_DECL, get_identifier (name), fntype); |
6206 | /* It's a function with internal linkage, generated by the | |
6207 | compiler. */ | |
6208 | TREE_PUBLIC (fndecl) = 0; | |
6209 | DECL_ARTIFICIAL (fndecl) = 1; | |
5a728aca MM |
6210 | /* Make the function `inline' so that it is only emitted if it is |
6211 | actually needed. It is unlikely that it will be inlined, since | |
aba649ba | 6212 | it is only called via a function pointer, but we avoid unnecessary |
5a728aca | 6213 | emissions this way. */ |
3b14bb39 | 6214 | DECL_DECLARED_INLINE_P (fndecl) = 1; |
d4d1ebc1 | 6215 | DECL_INTERFACE_KNOWN (fndecl) = 1; |
db4283a0 | 6216 | /* Build the parameter. */ |
97388150 | 6217 | if (use_cxa_atexit) |
db4283a0 MM |
6218 | { |
6219 | tree parmdecl; | |
6220 | ||
8e51619a | 6221 | parmdecl = cp_build_parm_decl (NULL_TREE, ptr_type_node); |
db4283a0 | 6222 | DECL_CONTEXT (parmdecl) = fndecl; |
db4283a0 | 6223 | TREE_USED (parmdecl) = 1; |
03a904b5 | 6224 | DECL_READ_P (parmdecl) = 1; |
db4283a0 MM |
6225 | DECL_ARGUMENTS (fndecl) = parmdecl; |
6226 | } | |
6227 | ||
09ed39ad | 6228 | pushdecl (fndecl); |
058b15c1 | 6229 | start_preparsed_function (fndecl, NULL_TREE, SF_PRE_PARSED); |
db4283a0 | 6230 | |
db4283a0 MM |
6231 | pop_lang_context (); |
6232 | ||
6233 | return current_function_decl; | |
6234 | } | |
6235 | ||
6236 | /* Finish the cleanup function begun by start_cleanup_fn. */ | |
6237 | ||
6238 | static void | |
11f6b451 | 6239 | end_cleanup_fn (void) |
db4283a0 | 6240 | { |
8cd2462c | 6241 | expand_or_defer_fn (finish_function (0)); |
db4283a0 MM |
6242 | |
6243 | pop_from_top_level (); | |
6244 | } | |
6245 | ||
bf419747 MM |
6246 | /* Generate code to handle the destruction of DECL, an object with |
6247 | static storage duration. */ | |
f0105ed3 | 6248 | |
40aac948 | 6249 | tree |
11f6b451 | 6250 | register_dtor_fn (tree decl) |
f0105ed3 | 6251 | { |
db4283a0 | 6252 | tree cleanup; |
f0105ed3 | 6253 | tree compound_stmt; |
db4283a0 | 6254 | tree fcall; |
46a9e521 MM |
6255 | tree type; |
6256 | bool use_dtor; | |
450f4293 | 6257 | tree arg0, arg1 = NULL_TREE, arg2 = NULL_TREE; |
f0105ed3 | 6258 | |
46a9e521 MM |
6259 | type = TREE_TYPE (decl); |
6260 | if (TYPE_HAS_TRIVIAL_DESTRUCTOR (type)) | |
40aac948 | 6261 | return void_zero_node; |
bf419747 | 6262 | |
46a9e521 MM |
6263 | /* If we're using "__cxa_atexit" (or "__aeabi_atexit"), and DECL is |
6264 | a class object, we can just pass the destructor to | |
6265 | "__cxa_atexit"; we don't have to build a temporary function to do | |
6266 | the cleanup. */ | |
6267 | use_dtor = (flag_use_cxa_atexit | |
6268 | && !targetm.cxx.use_atexit_for_cxa_atexit () | |
6269 | && CLASS_TYPE_P (type)); | |
6270 | if (use_dtor) | |
6271 | { | |
6272 | int idx; | |
6273 | ||
6274 | /* Find the destructor. */ | |
6275 | idx = lookup_fnfields_1 (type, complete_dtor_identifier); | |
6276 | gcc_assert (idx >= 0); | |
6277 | cleanup = VEC_index (tree, CLASSTYPE_METHOD_VEC (type), idx); | |
6278 | /* Make sure it is accessible. */ | |
6279 | perform_or_defer_access_check (TYPE_BINFO (type), cleanup, cleanup); | |
6280 | } | |
6281 | else | |
6282 | { | |
6283 | /* Call build_cleanup before we enter the anonymous function so | |
6284 | that any access checks will be done relative to the current | |
6285 | scope, rather than the scope of the anonymous function. */ | |
6286 | build_cleanup (decl); | |
6287 | ||
6288 | /* Now start the function. */ | |
6289 | cleanup = start_cleanup_fn (); | |
6290 | ||
6291 | /* Now, recompute the cleanup. It may contain SAVE_EXPRs that refer | |
6292 | to the original function, rather than the anonymous one. That | |
6293 | will make the back end think that nested functions are in use, | |
6294 | which causes confusion. */ | |
6295 | push_deferring_access_checks (dk_no_check); | |
6296 | fcall = build_cleanup (decl); | |
6297 | pop_deferring_access_checks (); | |
6298 | ||
6299 | /* Create the body of the anonymous function. */ | |
6300 | compound_stmt = begin_compound_stmt (BCS_FN_BODY); | |
6301 | finish_expr_stmt (fcall); | |
6302 | finish_compound_stmt (compound_stmt); | |
6303 | end_cleanup_fn (); | |
6304 | } | |
f0105ed3 MM |
6305 | |
6306 | /* Call atexit with the cleanup function. */ | |
bb4f6e6b | 6307 | mark_used (cleanup); |
46a9e521 | 6308 | cleanup = build_address (cleanup); |
97388150 | 6309 | if (flag_use_cxa_atexit && !targetm.cxx.use_atexit_for_cxa_atexit ()) |
db4283a0 | 6310 | { |
46a9e521 MM |
6311 | tree addr; |
6312 | ||
6313 | if (use_dtor) | |
6314 | { | |
6315 | /* We must convert CLEANUP to the type that "__cxa_atexit" | |
6316 | expects. */ | |
6317 | cleanup = build_nop (get_atexit_fn_ptr_type (), cleanup); | |
6318 | /* "__cxa_atexit" will pass the address of DECL to the | |
6319 | cleanup function. */ | |
6320 | mark_used (decl); | |
6321 | addr = build_address (decl); | |
6322 | /* The declared type of the parameter to "__cxa_atexit" is | |
6323 | "void *". For plain "T*", we could just let the | |
5ade1ed2 | 6324 | machinery in cp_build_function_call convert it -- but if the |
46a9e521 MM |
6325 | type is "cv-qualified T *", then we need to convert it |
6326 | before passing it in, to avoid spurious errors. */ | |
6327 | addr = build_nop (ptr_type_node, addr); | |
6328 | } | |
6329 | else | |
6330 | /* Since the cleanup functions we build ignore the address | |
6331 | they're given, there's no reason to pass the actual address | |
6332 | in, and, in general, it's cheaper to pass NULL than any | |
6333 | other value. */ | |
6334 | addr = null_pointer_node; | |
450f4293 NF |
6335 | arg2 = cp_build_unary_op (ADDR_EXPR, get_dso_handle_node (), 0, |
6336 | tf_warning_or_error); | |
9f62c3e3 PB |
6337 | if (targetm.cxx.use_aeabi_atexit ()) |
6338 | { | |
450f4293 NF |
6339 | arg1 = cleanup; |
6340 | arg0 = addr; | |
9f62c3e3 PB |
6341 | } |
6342 | else | |
6343 | { | |
450f4293 NF |
6344 | arg1 = addr; |
6345 | arg0 = cleanup; | |
9f62c3e3 | 6346 | } |
db4283a0 MM |
6347 | } |
6348 | else | |
450f4293 NF |
6349 | arg0 = cleanup; |
6350 | return cp_build_function_call_nary (get_atexit_node (), tf_warning_or_error, | |
6351 | arg0, arg1, arg2, NULL_TREE); | |
f0105ed3 MM |
6352 | } |
6353 | ||
8e3df2de MM |
6354 | /* DECL is a VAR_DECL with static storage duration. INIT, if present, |
6355 | is its initializer. Generate code to handle the construction | |
6356 | and destruction of DECL. */ | |
6357 | ||
6358 | static void | |
11f6b451 | 6359 | expand_static_init (tree decl, tree init) |
8d08fdba | 6360 | { |
50bc768d NS |
6361 | gcc_assert (TREE_CODE (decl) == VAR_DECL); |
6362 | gcc_assert (TREE_STATIC (decl)); | |
8e3df2de MM |
6363 | |
6364 | /* Some variables require no initialization. */ | |
caf93cb0 | 6365 | if (!init |
8e3df2de MM |
6366 | && !TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (decl)) |
6367 | && TYPE_HAS_TRIVIAL_DESTRUCTOR (TREE_TYPE (decl))) | |
6368 | return; | |
6369 | ||
eba6cfb6 | 6370 | if (DECL_FUNCTION_SCOPE_P (decl)) |
8d08fdba MS |
6371 | { |
6372 | /* Emit code to perform this initialization but once. */ | |
445cf5eb JM |
6373 | tree if_stmt = NULL_TREE, inner_if_stmt = NULL_TREE; |
6374 | tree then_clause = NULL_TREE, inner_then_clause = NULL_TREE; | |
94a0dd7b | 6375 | tree guard, guard_addr; |
40aac948 JM |
6376 | tree acquire_fn, release_fn, abort_fn; |
6377 | tree flag, begin; | |
8d08fdba | 6378 | |
2036a15c MM |
6379 | /* Emit code to perform this initialization but once. This code |
6380 | looks like: | |
6381 | ||
0cbd7506 MS |
6382 | static <type> guard; |
6383 | if (!guard.first_byte) { | |
40aac948 JM |
6384 | if (__cxa_guard_acquire (&guard)) { |
6385 | bool flag = false; | |
6386 | try { | |
0cbd7506 MS |
6387 | // Do initialization. |
6388 | flag = true; __cxa_guard_release (&guard); | |
6389 | // Register variable for destruction at end of program. | |
40aac948 | 6390 | } catch { |
0cbd7506 | 6391 | if (!flag) __cxa_guard_abort (&guard); |
40aac948 | 6392 | } |
2036a15c MM |
6393 | } |
6394 | ||
40aac948 | 6395 | Note that the `flag' variable is only set to 1 *after* the |
2036a15c MM |
6396 | initialization is complete. This ensures that an exception, |
6397 | thrown during the construction, will cause the variable to | |
6398 | reinitialized when we pass through this code again, as per: | |
68642fb6 | 6399 | |
2036a15c MM |
6400 | [stmt.dcl] |
6401 | ||
c8094d83 | 6402 | If the initialization exits by throwing an exception, the |
2036a15c MM |
6403 | initialization is not complete, so it will be tried again |
6404 | the next time control enters the declaration. | |
6405 | ||
0cbd7506 | 6406 | This process should be thread-safe, too; multiple threads |
40aac948 JM |
6407 | should not be able to initialize the variable more than |
6408 | once. */ | |
c395453c MM |
6409 | |
6410 | /* Create the guard variable. */ | |
6411 | guard = get_guard (decl); | |
2036a15c | 6412 | |
445cf5eb JM |
6413 | /* This optimization isn't safe on targets with relaxed memory |
6414 | consistency. On such targets we force synchronization in | |
6415 | __cxa_guard_acquire. */ | |
6416 | if (!targetm.relaxed_ordering || !flag_threadsafe_statics) | |
6417 | { | |
6418 | /* Begin the conditional initialization. */ | |
6419 | if_stmt = begin_if_stmt (); | |
6420 | finish_if_stmt_cond (get_guard_cond (guard), if_stmt); | |
6421 | then_clause = begin_compound_stmt (BCS_NO_SCOPE); | |
6422 | } | |
40aac948 JM |
6423 | |
6424 | if (flag_threadsafe_statics) | |
6425 | { | |
6426 | guard_addr = build_address (guard); | |
40aac948 JM |
6427 | |
6428 | acquire_fn = get_identifier ("__cxa_guard_acquire"); | |
6429 | release_fn = get_identifier ("__cxa_guard_release"); | |
6430 | abort_fn = get_identifier ("__cxa_guard_abort"); | |
6431 | if (!get_global_value_if_present (acquire_fn, &acquire_fn)) | |
6432 | { | |
6433 | tree argtypes = tree_cons (NULL_TREE, TREE_TYPE (guard_addr), | |
6434 | void_list_node); | |
6435 | tree vfntype = build_function_type (void_type_node, argtypes); | |
6436 | acquire_fn = push_library_fn | |
448083e5 PC |
6437 | (acquire_fn, build_function_type (integer_type_node, argtypes), |
6438 | NULL_TREE); | |
6439 | release_fn = push_library_fn (release_fn, vfntype, NULL_TREE); | |
6440 | abort_fn = push_library_fn (abort_fn, vfntype, NULL_TREE); | |
40aac948 JM |
6441 | } |
6442 | else | |
6443 | { | |
6444 | release_fn = identifier_global_value (release_fn); | |
6445 | abort_fn = identifier_global_value (abort_fn); | |
6446 | } | |
6447 | ||
6448 | inner_if_stmt = begin_if_stmt (); | |
94a0dd7b | 6449 | finish_if_stmt_cond (build_call_n (acquire_fn, 1, guard_addr), |
40aac948 JM |
6450 | inner_if_stmt); |
6451 | ||
6452 | inner_then_clause = begin_compound_stmt (BCS_NO_SCOPE); | |
6453 | begin = get_target_expr (boolean_false_node); | |
6454 | flag = TARGET_EXPR_SLOT (begin); | |
6455 | ||
6456 | TARGET_EXPR_CLEANUP (begin) | |
81eba3a8 KH |
6457 | = build3 (COND_EXPR, void_type_node, flag, |
6458 | void_zero_node, | |
94a0dd7b | 6459 | build_call_n (abort_fn, 1, guard_addr)); |
40aac948 JM |
6460 | CLEANUP_EH_ONLY (begin) = 1; |
6461 | ||
6462 | /* Do the initialization itself. */ | |
6463 | init = add_stmt_to_compound (begin, init); | |
6464 | init = add_stmt_to_compound | |
81eba3a8 | 6465 | (init, build2 (MODIFY_EXPR, void_type_node, flag, boolean_true_node)); |
40aac948 | 6466 | init = add_stmt_to_compound |
94a0dd7b | 6467 | (init, build_call_n (release_fn, 1, guard_addr)); |
40aac948 | 6468 | } |
f1dedc31 | 6469 | else |
40aac948 | 6470 | init = add_stmt_to_compound (init, set_guard (guard)); |
72b7eeff | 6471 | |
2036a15c MM |
6472 | /* Use atexit to register a function for destroying this static |
6473 | variable. */ | |
40aac948 JM |
6474 | init = add_stmt_to_compound (init, register_dtor_fn (decl)); |
6475 | ||
6476 | finish_expr_stmt (init); | |
6477 | ||
6478 | if (flag_threadsafe_statics) | |
6479 | { | |
6480 | finish_compound_stmt (inner_then_clause); | |
6481 | finish_then_clause (inner_if_stmt); | |
6482 | finish_if_stmt (inner_if_stmt); | |
6483 | } | |
72b7eeff | 6484 | |
445cf5eb JM |
6485 | if (!targetm.relaxed_ordering || !flag_threadsafe_statics) |
6486 | { | |
6487 | finish_compound_stmt (then_clause); | |
6488 | finish_then_clause (if_stmt); | |
6489 | finish_if_stmt (if_stmt); | |
6490 | } | |
8d08fdba MS |
6491 | } |
6492 | else | |
bbd15aac | 6493 | static_aggregates = tree_cons (init, decl, static_aggregates); |
8d08fdba | 6494 | } |
3c5c0849 | 6495 | |
8d08fdba MS |
6496 | \f |
6497 | /* Make TYPE a complete type based on INITIAL_VALUE. | |
6498 | Return 0 if successful, 1 if INITIAL_VALUE can't be deciphered, | |
07900878 PC |
6499 | 2 if there was no information (in which case assume 0 if DO_DEFAULT), |
6500 | 3 if the initializer list is empty (in pedantic mode). */ | |
8d08fdba MS |
6501 | |
6502 | int | |
aab038d5 | 6503 | cp_complete_array_type (tree *ptype, tree initial_value, bool do_default) |
8d08fdba | 6504 | { |
aab038d5 RH |
6505 | int failure; |
6506 | tree type, elt_type; | |
68642fb6 | 6507 | |
8d08fdba MS |
6508 | if (initial_value) |
6509 | { | |
49b5e2f6 DG |
6510 | unsigned HOST_WIDE_INT i; |
6511 | tree value; | |
6512 | ||
7b019c19 | 6513 | /* An array of character type can be initialized from a |
4038c495 GB |
6514 | brace-enclosed string constant. |
6515 | ||
6516 | FIXME: this code is duplicated from reshape_init. Probably | |
6517 | we should just call reshape_init here? */ | |
aab038d5 | 6518 | if (char_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (*ptype))) |
7b019c19 | 6519 | && TREE_CODE (initial_value) == CONSTRUCTOR |
4038c495 GB |
6520 | && !VEC_empty (constructor_elt, CONSTRUCTOR_ELTS (initial_value))) |
6521 | { | |
6522 | VEC(constructor_elt,gc) *v = CONSTRUCTOR_ELTS (initial_value); | |
6523 | tree value = VEC_index (constructor_elt, v, 0)->value; | |
6524 | ||
6525 | if (TREE_CODE (value) == STRING_CST | |
6526 | && VEC_length (constructor_elt, v) == 1) | |
6527 | initial_value = value; | |
6528 | } | |
49b5e2f6 DG |
6529 | |
6530 | /* If any of the elements are parameter packs, we can't actually | |
6531 | complete this type now because the array size is dependent. */ | |
6532 | if (TREE_CODE (initial_value) == CONSTRUCTOR) | |
6533 | { | |
6534 | FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (initial_value), | |
6535 | i, value) | |
6536 | { | |
6537 | if (PACK_EXPANSION_P (value)) | |
6538 | return 0; | |
6539 | } | |
6540 | } | |
8d08fdba MS |
6541 | } |
6542 | ||
aab038d5 | 6543 | failure = complete_array_type (ptype, initial_value, do_default); |
8d08fdba | 6544 | |
aab038d5 RH |
6545 | /* We can create the array before the element type is complete, which |
6546 | means that we didn't have these two bits set in the original type | |
6547 | either. In completing the type, we are expected to propagate these | |
6548 | bits. See also complete_type which does the same thing for arrays | |
6549 | of fixed size. */ | |
6550 | type = *ptype; | |
6551 | if (TYPE_DOMAIN (type)) | |
8d08fdba | 6552 | { |
81b4398d | 6553 | elt_type = TREE_TYPE (type); |
aab038d5 | 6554 | TYPE_NEEDS_CONSTRUCTING (type) = TYPE_NEEDS_CONSTRUCTING (elt_type); |
81b4398d | 6555 | TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type) |
aab038d5 | 6556 | = TYPE_HAS_NONTRIVIAL_DESTRUCTOR (elt_type); |
8d08fdba MS |
6557 | } |
6558 | ||
aab038d5 | 6559 | return failure; |
8d08fdba MS |
6560 | } |
6561 | \f | |
6562 | /* Return zero if something is declared to be a member of type | |
6563 | CTYPE when in the context of CUR_TYPE. STRING is the error | |
6564 | message to print in that case. Otherwise, quietly return 1. */ | |
e92cc029 | 6565 | |
8d08fdba | 6566 | static int |
11f6b451 | 6567 | member_function_or_else (tree ctype, tree cur_type, enum overload_flags flags) |
8d08fdba MS |
6568 | { |
6569 | if (ctype && ctype != cur_type) | |
6570 | { | |
4dacf5bd | 6571 | if (flags == DTOR_FLAG) |
2d01edd7 | 6572 | error ("destructor for alien class %qT cannot be a member", ctype); |
4dacf5bd | 6573 | else |
2d01edd7 | 6574 | error ("constructor for alien class %qT cannot be a member", ctype); |
8d08fdba MS |
6575 | return 0; |
6576 | } | |
6577 | return 1; | |
6578 | } | |
6579 | \f | |
6580 | /* Subroutine of `grokdeclarator'. */ | |
6581 | ||
6582 | /* Generate errors possibly applicable for a given set of specifiers. | |
6583 | This is for ARM $7.1.2. */ | |
e92cc029 | 6584 | |
8d08fdba | 6585 | static void |
11f6b451 | 6586 | bad_specifiers (tree object, |
0cbd7506 MS |
6587 | const char* type, |
6588 | int virtualp, | |
6589 | int quals, | |
6590 | int inlinep, | |
6591 | int friendp, | |
6592 | int raises) | |
8d08fdba MS |
6593 | { |
6594 | if (virtualp) | |
2d01edd7 | 6595 | error ("%qD declared as a %<virtual%> %s", object, type); |
8d08fdba | 6596 | if (inlinep) |
2d01edd7 | 6597 | error ("%qD declared as an %<inline%> %s", object, type); |
8d08fdba | 6598 | if (quals) |
2d01edd7 | 6599 | error ("%<const%> and %<volatile%> function specifiers on " |
0cbd7506 MS |
6600 | "%qD invalid in %s declaration", |
6601 | object, type); | |
8d08fdba | 6602 | if (friendp) |
dee15844 | 6603 | error ("%q+D declared as a friend", object); |
e1be26f4 RS |
6604 | if (raises |
6605 | && (TREE_CODE (object) == TYPE_DECL | |
6606 | || (!TYPE_PTRFN_P (TREE_TYPE (object)) | |
742a37d5 | 6607 | && !TYPE_REFFN_P (TREE_TYPE (object)) |
e1be26f4 | 6608 | && !TYPE_PTRMEMFUNC_P (TREE_TYPE (object))))) |
dee15844 | 6609 | error ("%q+D declared with an exception specification", object); |
8d08fdba MS |
6610 | } |
6611 | ||
9c12301f MM |
6612 | /* DECL is a member function or static data member and is presently |
6613 | being defined. Check that the definition is taking place in a | |
6614 | valid namespace. */ | |
6615 | ||
6616 | static void | |
6617 | check_class_member_definition_namespace (tree decl) | |
6618 | { | |
6619 | /* These checks only apply to member functions and static data | |
6620 | members. */ | |
6621 | gcc_assert (TREE_CODE (decl) == FUNCTION_DECL | |
6622 | || TREE_CODE (decl) == VAR_DECL); | |
6623 | /* We check for problems with specializations in pt.c in | |
6624 | check_specialization_namespace, where we can issue better | |
6625 | diagnostics. */ | |
6626 | if (processing_specialization) | |
6627 | return; | |
6628 | /* There are no restrictions on the placement of | |
6629 | explicit instantiations. */ | |
6630 | if (processing_explicit_instantiation) | |
6631 | return; | |
6632 | /* [class.mfct] | |
6633 | ||
6634 | A member function definition that appears outside of the | |
6635 | class definition shall appear in a namespace scope enclosing | |
6636 | the class definition. | |
6637 | ||
6638 | [class.static.data] | |
6639 | ||
6640 | The definition for a static data member shall appear in a | |
6641 | namespace scope enclosing the member's class definition. */ | |
6642 | if (!is_ancestor (current_namespace, DECL_CONTEXT (decl))) | |
cbe5f3b3 | 6643 | permerror (input_location, "definition of %qD is not in namespace enclosing %qT", |
37ec60ed | 6644 | decl, DECL_CONTEXT (decl)); |
9c12301f MM |
6645 | } |
6646 | ||
e2537f2c MM |
6647 | /* Build a PARM_DECL for the "this" parameter. TYPE is the |
6648 | METHOD_TYPE for a non-static member function; QUALS are the | |
6649 | cv-qualifiers that apply to the function. */ | |
3db45ab5 | 6650 | |
e2537f2c MM |
6651 | tree |
6652 | build_this_parm (tree type, cp_cv_quals quals) | |
6653 | { | |
6654 | tree this_type; | |
6655 | tree qual_type; | |
6656 | tree parm; | |
6657 | cp_cv_quals this_quals; | |
6658 | ||
6659 | this_type = TREE_VALUE (TYPE_ARG_TYPES (type)); | |
6660 | /* The `this' parameter is implicitly `const'; it cannot be | |
6661 | assigned to. */ | |
6662 | this_quals = (quals & TYPE_QUAL_RESTRICT) | TYPE_QUAL_CONST; | |
6663 | qual_type = cp_build_qualified_type (this_type, this_quals); | |
6664 | parm = build_artificial_parm (this_identifier, qual_type); | |
6665 | cp_apply_type_quals_to_decl (this_quals, parm); | |
6666 | return parm; | |
3db45ab5 | 6667 | } |
e2537f2c | 6668 | |
8d08fdba MS |
6669 | /* CTYPE is class type, or null if non-class. |
6670 | TYPE is type this FUNCTION_DECL should have, either FUNCTION_TYPE | |
6671 | or METHOD_TYPE. | |
6672 | DECLARATOR is the function's name. | |
4546865e | 6673 | PARMS is a chain of PARM_DECLs for the function. |
8d08fdba MS |
6674 | VIRTUALP is truthvalue of whether the function is virtual or not. |
6675 | FLAGS are to be passed through to `grokclassfn'. | |
6676 | QUALS are qualifiers indicating whether the function is `const' | |
6677 | or `volatile'. | |
6678 | RAISES is a list of exceptions that this function can raise. | |
6679 | CHECK is 1 if we must find this method in CTYPE, 0 if we should | |
68642fb6 | 6680 | not look, and -1 if we should not call `grokclassfn' at all. |
3ddfb0e6 | 6681 | |
27d6592c MM |
6682 | SFK is the kind of special function (if any) for the new function. |
6683 | ||
20496fa2 | 6684 | Returns `NULL_TREE' if something goes wrong, after issuing |
3ddfb0e6 | 6685 | applicable error messages. */ |
e92cc029 | 6686 | |
8d08fdba | 6687 | static tree |
caf93cb0 | 6688 | grokfndecl (tree ctype, |
0cbd7506 MS |
6689 | tree type, |
6690 | tree declarator, | |
4546865e | 6691 | tree parms, |
0cbd7506 MS |
6692 | tree orig_declarator, |
6693 | int virtualp, | |
6694 | enum overload_flags flags, | |
3c01e5df | 6695 | cp_cv_quals quals, |
0cbd7506 MS |
6696 | tree raises, |
6697 | int check, | |
6698 | int friendp, | |
6699 | int publicp, | |
6700 | int inlinep, | |
27d6592c | 6701 | special_function_kind sfk, |
357d956e | 6702 | bool funcdef_flag, |
0cbd7506 MS |
6703 | int template_count, |
6704 | tree in_namespace, | |
402b8cf6 AH |
6705 | tree* attrlist, |
6706 | location_t location) | |
8d08fdba | 6707 | { |
1951a1b6 | 6708 | tree decl; |
8d08fdba | 6709 | int staticp = ctype && TREE_CODE (type) == FUNCTION_TYPE; |
42976354 | 6710 | tree t; |
8d08fdba | 6711 | |
8d08fdba | 6712 | if (raises) |
271e6f02 | 6713 | type = build_exception_variant (type, raises); |
c11b6f21 | 6714 | |
8d08fdba | 6715 | decl = build_lang_decl (FUNCTION_DECL, declarator, type); |
402b8cf6 AH |
6716 | |
6717 | /* If we have an explicit location, use it, otherwise use whatever | |
6718 | build_lang_decl used (probably input_location). */ | |
6719 | if (location != UNKNOWN_LOCATION) | |
6720 | DECL_SOURCE_LOCATION (decl) = location; | |
6721 | ||
e2537f2c MM |
6722 | if (TREE_CODE (type) == METHOD_TYPE) |
6723 | { | |
6724 | tree parm; | |
6725 | parm = build_this_parm (type, quals); | |
6726 | TREE_CHAIN (parm) = parms; | |
6727 | parms = parm; | |
6728 | } | |
4546865e | 6729 | DECL_ARGUMENTS (decl) = parms; |
448545cb JM |
6730 | for (t = parms; t; t = TREE_CHAIN (t)) |
6731 | DECL_CONTEXT (t) = decl; | |
a1c65f9f | 6732 | /* Propagate volatile out from type to decl. */ |
8d08fdba | 6733 | if (TYPE_VOLATILE (type)) |
893de33c | 6734 | TREE_THIS_VOLATILE (decl) = 1; |
8d08fdba | 6735 | |
71aea5f2 SM |
6736 | /* Setup decl according to sfk. */ |
6737 | switch (sfk) | |
6738 | { | |
6739 | case sfk_constructor: | |
6740 | case sfk_copy_constructor: | |
d5f4eddd | 6741 | case sfk_move_constructor: |
71aea5f2 SM |
6742 | DECL_CONSTRUCTOR_P (decl) = 1; |
6743 | break; | |
6744 | case sfk_destructor: | |
6745 | DECL_DESTRUCTOR_P (decl) = 1; | |
6746 | break; | |
6747 | default: | |
6748 | break; | |
6749 | } | |
6750 | ||
837edd5f GK |
6751 | /* If pointers to member functions use the least significant bit to |
6752 | indicate whether a function is virtual, ensure a pointer | |
6753 | to this function will have that bit clear. */ | |
6754 | if (TARGET_PTRMEMFUNC_VBIT_LOCATION == ptrmemfunc_vbit_in_pfn | |
6755 | && TREE_CODE (type) == METHOD_TYPE | |
6756 | && DECL_ALIGN (decl) < 2 * BITS_PER_UNIT) | |
6757 | DECL_ALIGN (decl) = 2 * BITS_PER_UNIT; | |
6758 | ||
abc088aa MM |
6759 | if (friendp |
6760 | && TREE_CODE (orig_declarator) == TEMPLATE_ID_EXPR) | |
6761 | { | |
6762 | if (funcdef_flag) | |
6763 | error | |
6764 | ("defining explicit specialization %qD in friend declaration", | |
6765 | orig_declarator); | |
6766 | else | |
6767 | { | |
6768 | tree fns = TREE_OPERAND (orig_declarator, 0); | |
6769 | tree args = TREE_OPERAND (orig_declarator, 1); | |
6770 | ||
6771 | if (PROCESSING_REAL_TEMPLATE_DECL_P ()) | |
6772 | { | |
6773 | /* Something like `template <class T> friend void f<T>()'. */ | |
6774 | error ("invalid use of template-id %qD in declaration " | |
6775 | "of primary template", | |
6776 | orig_declarator); | |
6777 | return NULL_TREE; | |
6778 | } | |
6779 | ||
6780 | ||
6781 | /* A friend declaration of the form friend void f<>(). Record | |
6782 | the information in the TEMPLATE_ID_EXPR. */ | |
6783 | SET_DECL_IMPLICIT_INSTANTIATION (decl); | |
6784 | ||
6785 | if (TREE_CODE (fns) == COMPONENT_REF) | |
6786 | { | |
6787 | /* Due to bison parser ickiness, we will have already looked | |
6788 | up an operator_name or PFUNCNAME within the current class | |
6789 | (see template_id in parse.y). If the current class contains | |
6790 | such a name, we'll get a COMPONENT_REF here. Undo that. */ | |
6791 | ||
6792 | gcc_assert (TREE_TYPE (TREE_OPERAND (fns, 0)) | |
6793 | == current_class_type); | |
6794 | fns = TREE_OPERAND (fns, 1); | |
6795 | } | |
6796 | gcc_assert (TREE_CODE (fns) == IDENTIFIER_NODE | |
6797 | || TREE_CODE (fns) == OVERLOAD); | |
aa373032 | 6798 | DECL_TEMPLATE_INFO (decl) = build_template_info (fns, args); |
abc088aa MM |
6799 | |
6800 | for (t = TYPE_ARG_TYPES (TREE_TYPE (decl)); t; t = TREE_CHAIN (t)) | |
6801 | if (TREE_PURPOSE (t) | |
6802 | && TREE_CODE (TREE_PURPOSE (t)) == DEFAULT_ARG) | |
6803 | { | |
6804 | error ("default arguments are not allowed in declaration " | |
6805 | "of friend template specialization %qD", | |
6806 | decl); | |
6807 | return NULL_TREE; | |
6808 | } | |
6809 | ||
6810 | if (inlinep) | |
6811 | { | |
6812 | error ("%<inline%> is not allowed in declaration of friend " | |
6813 | "template specialization %qD", | |
6814 | decl); | |
6815 | return NULL_TREE; | |
6816 | } | |
6817 | } | |
6818 | } | |
6819 | ||
79c4d4b7 | 6820 | /* If this decl has namespace scope, set that up. */ |
2c73f9f5 | 6821 | if (in_namespace) |
b262d64c | 6822 | set_decl_namespace (decl, in_namespace, friendp); |
adae082f | 6823 | else if (!ctype) |
ae099258 | 6824 | DECL_CONTEXT (decl) = FROB_CONTEXT (current_decl_namespace ()); |
2c73f9f5 | 6825 | |
0f8766b8 JM |
6826 | /* `main' and builtins have implicit 'C' linkage. */ |
6827 | if ((MAIN_NAME_P (declarator) | |
6828 | || (IDENTIFIER_LENGTH (declarator) > 10 | |
6829 | && IDENTIFIER_POINTER (declarator)[0] == '_' | |
6830 | && IDENTIFIER_POINTER (declarator)[1] == '_' | |
6831 | && strncmp (IDENTIFIER_POINTER (declarator)+2, "builtin_", 8) == 0)) | |
6832 | && current_lang_name == lang_name_cplusplus | |
94706a5c | 6833 | && ctype == NULL_TREE |
79c4d4b7 JM |
6834 | /* NULL_TREE means global namespace. */ |
6835 | && DECL_CONTEXT (decl) == NULL_TREE) | |
5d2ed28c | 6836 | SET_DECL_LANGUAGE (decl, lang_c); |
0f8766b8 | 6837 | |
8d08fdba MS |
6838 | /* Should probably propagate const out from type to decl I bet (mrs). */ |
6839 | if (staticp) | |
6840 | { | |
6841 | DECL_STATIC_FUNCTION_P (decl) = 1; | |
6842 | DECL_CONTEXT (decl) = ctype; | |
8d08fdba MS |
6843 | } |
6844 | ||
e76a2646 | 6845 | if (ctype) |
9c12301f MM |
6846 | { |
6847 | DECL_CONTEXT (decl) = ctype; | |
6848 | if (funcdef_flag) | |
6849 | check_class_member_definition_namespace (decl); | |
6850 | } | |
e76a2646 | 6851 | |
0f8766b8 | 6852 | if (ctype == NULL_TREE && DECL_MAIN_P (decl)) |
faae18ab | 6853 | { |
848b92e1 | 6854 | if (processing_template_decl) |
2d01edd7 | 6855 | error ("cannot declare %<::main%> to be a template"); |
faae18ab | 6856 | if (inlinep) |
2d01edd7 | 6857 | error ("cannot declare %<::main%> to be inline"); |
f22967f3 | 6858 | if (!publicp) |
2d01edd7 | 6859 | error ("cannot declare %<::main%> to be static"); |
faae18ab MS |
6860 | inlinep = 0; |
6861 | publicp = 1; | |
6862 | } | |
50a6dbd7 | 6863 | |
59e76fc6 | 6864 | /* Members of anonymous types and local classes have no linkage; make |
9fc444cc | 6865 | them internal. If a typedef is made later, this will be changed. */ |
1951a1b6 | 6866 | if (ctype && (TYPE_ANONYMOUS_P (ctype) |
4f1c5b7d | 6867 | || decl_function_context (TYPE_MAIN_DECL (ctype)))) |
50a6dbd7 JM |
6868 | publicp = 0; |
6869 | ||
1eee69dd JM |
6870 | if (publicp && cxx_dialect == cxx98) |
6871 | { | |
6872 | /* [basic.link]: A name with no linkage (notably, the name of a class | |
6873 | or enumeration declared in a local scope) shall not be used to | |
6874 | declare an entity with linkage. | |
6875 | ||
6876 | DR 757 relaxes this restriction for C++0x. */ | |
6877 | t = no_linkage_check (TREE_TYPE (decl), | |
6878 | /*relaxed_p=*/false); | |
6879 | if (t) | |
6880 | { | |
6881 | if (TYPE_ANONYMOUS_P (t)) | |
6882 | { | |
6883 | if (DECL_EXTERN_C_P (decl)) | |
6884 | /* Allow this; it's pretty common in C. */; | |
6885 | else | |
6886 | { | |
2401726e JM |
6887 | permerror (input_location, "anonymous type with no linkage " |
6888 | "used to declare function %q#D with linkage", | |
6889 | decl); | |
1eee69dd JM |
6890 | if (DECL_ORIGINAL_TYPE (TYPE_NAME (t))) |
6891 | permerror (input_location, "%q+#D does not refer to the unqualified " | |
6892 | "type, so it is not used for linkage", | |
6893 | TYPE_NAME (t)); | |
6894 | } | |
6895 | } | |
6896 | else | |
2401726e JM |
6897 | permerror (input_location, "type %qT with no linkage used to " |
6898 | "declare function %q#D with linkage", t, decl); | |
1eee69dd JM |
6899 | } |
6900 | } | |
6901 | ||
893de33c | 6902 | TREE_PUBLIC (decl) = publicp; |
faae18ab | 6903 | if (! publicp) |
893de33c JM |
6904 | { |
6905 | DECL_INTERFACE_KNOWN (decl) = 1; | |
6906 | DECL_NOT_REALLY_EXTERN (decl) = 1; | |
6907 | } | |
faae18ab | 6908 | |
acc72c37 | 6909 | /* If the declaration was declared inline, mark it as such. */ |
faae18ab | 6910 | if (inlinep) |
acc72c37 | 6911 | DECL_DECLARED_INLINE_P (decl) = 1; |
8d08fdba MS |
6912 | |
6913 | DECL_EXTERNAL (decl) = 1; | |
3c01e5df | 6914 | if (quals && TREE_CODE (type) == FUNCTION_TYPE) |
8d08fdba | 6915 | { |
e7c41c99 DM |
6916 | error (ctype |
6917 | ? G_("static member function %qD cannot have cv-qualifier") | |
32b1d579 | 6918 | : G_("non-member function %qD cannot have cv-qualifier"), |
e7c41c99 | 6919 | decl); |
3c01e5df | 6920 | quals = TYPE_UNQUALIFIED; |
8d08fdba MS |
6921 | } |
6922 | ||
398cd199 VR |
6923 | if (IDENTIFIER_OPNAME_P (DECL_NAME (decl)) |
6924 | && !grok_op_properties (decl, /*complain=*/true)) | |
6925 | return NULL_TREE; | |
8d08fdba | 6926 | |
1eb0072d JM |
6927 | if (funcdef_flag) |
6928 | /* Make the init_value nonzero so pushdecl knows this is not | |
6929 | tentative. error_mark_node is replaced later with the BLOCK. */ | |
6930 | DECL_INITIAL (decl) = error_mark_node; | |
6931 | ||
93ca4ba7 | 6932 | if (TYPE_NOTHROW_P (type) || nothrow_libfn_p (decl)) |
1660cb3a JM |
6933 | TREE_NOTHROW (decl) = 1; |
6934 | ||
75650646 | 6935 | /* Caller will do the rest of this. */ |
8d08fdba MS |
6936 | if (check < 0) |
6937 | return decl; | |
6938 | ||
74b846e0 | 6939 | if (ctype != NULL_TREE) |
71aea5f2 | 6940 | grokclassfn (ctype, decl, flags); |
74b846e0 MM |
6941 | |
6942 | decl = check_explicit_specialization (orig_declarator, decl, | |
6943 | template_count, | |
357d956e | 6944 | 2 * funcdef_flag + |
74b846e0 MM |
6945 | 4 * (friendp != 0)); |
6946 | if (decl == error_mark_node) | |
6947 | return NULL_TREE; | |
98c1c668 | 6948 | |
037cc9c5 FJ |
6949 | if (attrlist) |
6950 | { | |
6951 | cplus_decl_attributes (&decl, *attrlist, 0); | |
6952 | *attrlist = NULL_TREE; | |
6953 | } | |
6954 | ||
da337784 JJ |
6955 | /* Check main's type after attributes have been applied. */ |
6956 | if (ctype == NULL_TREE && DECL_MAIN_P (decl)) | |
6957 | { | |
6958 | if (!same_type_p (TREE_TYPE (TREE_TYPE (decl)), | |
6959 | integer_type_node)) | |
6960 | { | |
6961 | tree oldtypeargs = TYPE_ARG_TYPES (TREE_TYPE (decl)); | |
6962 | tree newtype; | |
6963 | error ("%<::main%> must return %<int%>"); | |
6964 | newtype = build_function_type (integer_type_node, oldtypeargs); | |
6965 | TREE_TYPE (decl) = newtype; | |
6966 | } | |
4003301d MLI |
6967 | if (warn_main) |
6968 | check_main_parameter_types (decl); | |
da337784 JJ |
6969 | } |
6970 | ||
74b846e0 MM |
6971 | if (ctype != NULL_TREE |
6972 | && (! TYPE_FOR_JAVA (ctype) || check_java_method (decl)) | |
6973 | && check) | |
8d08fdba | 6974 | { |
f8c3b097 PC |
6975 | tree old_decl = check_classfn (ctype, decl, |
6976 | (processing_template_decl | |
6977 | > template_class_depth (ctype)) | |
6978 | ? current_template_parms | |
6979 | : NULL_TREE); | |
6980 | ||
6981 | if (old_decl == error_mark_node) | |
6982 | return NULL_TREE; | |
8d08fdba | 6983 | |
74b846e0 | 6984 | if (old_decl) |
8d08fdba | 6985 | { |
79ae853c | 6986 | tree ok; |
4514aa8c | 6987 | tree pushed_scope; |
316a2456 | 6988 | |
357d956e MM |
6989 | if (TREE_CODE (old_decl) == TEMPLATE_DECL) |
6990 | /* Because grokfndecl is always supposed to return a | |
6991 | FUNCTION_DECL, we pull out the DECL_TEMPLATE_RESULT | |
6992 | here. We depend on our callers to figure out that its | |
6993 | really a template that's being returned. */ | |
6994 | old_decl = DECL_TEMPLATE_RESULT (old_decl); | |
6995 | ||
6996 | if (DECL_STATIC_FUNCTION_P (old_decl) | |
6997 | && TREE_CODE (TREE_TYPE (decl)) == METHOD_TYPE) | |
6998 | /* Remove the `this' parm added by grokclassfn. | |
6999 | XXX Isn't this done in start_function, too? */ | |
7000 | revert_static_member_fn (decl); | |
7001 | if (DECL_ARTIFICIAL (old_decl)) | |
db160137 AP |
7002 | { |
7003 | error ("definition of implicitly-declared %qD", old_decl); | |
7004 | return NULL_TREE; | |
7005 | } | |
357d956e | 7006 | |
74b846e0 MM |
7007 | /* Since we've smashed OLD_DECL to its |
7008 | DECL_TEMPLATE_RESULT, we must do the same to DECL. */ | |
7009 | if (TREE_CODE (decl) == TEMPLATE_DECL) | |
7010 | decl = DECL_TEMPLATE_RESULT (decl); | |
7011 | ||
7012 | /* Attempt to merge the declarations. This can fail, in | |
0e339752 | 7013 | the case of some invalid specialization declarations. */ |
4514aa8c | 7014 | pushed_scope = push_scope (ctype); |
d63d5d0c | 7015 | ok = duplicate_decls (decl, old_decl, friendp); |
4514aa8c NS |
7016 | if (pushed_scope) |
7017 | pop_scope (pushed_scope); | |
316a2456 MM |
7018 | if (!ok) |
7019 | { | |
2d01edd7 | 7020 | error ("no %q#D member function declared in class %qT", |
316a2456 MM |
7021 | decl, ctype); |
7022 | return NULL_TREE; | |
7023 | } | |
74b846e0 | 7024 | return old_decl; |
8d08fdba MS |
7025 | } |
7026 | } | |
74b846e0 MM |
7027 | |
7028 | if (DECL_CONSTRUCTOR_P (decl) && !grok_ctor_properties (ctype, decl)) | |
7029 | return NULL_TREE; | |
7030 | ||
7031 | if (ctype == NULL_TREE || check) | |
7032 | return decl; | |
7033 | ||
7034 | if (virtualp) | |
cbb40945 | 7035 | DECL_VIRTUAL_P (decl) = 1; |
74b846e0 | 7036 | |
8d08fdba MS |
7037 | return decl; |
7038 | } | |
7039 | ||
4684cd27 MM |
7040 | /* DECL is a VAR_DECL for a static data member. Set flags to reflect |
7041 | the linkage that DECL will receive in the object file. */ | |
7042 | ||
7043 | static void | |
7044 | set_linkage_for_static_data_member (tree decl) | |
7045 | { | |
7046 | /* A static data member always has static storage duration and | |
7047 | external linkage. Note that static data members are forbidden in | |
7048 | local classes -- the only situation in which a class has | |
7049 | non-external linkage. */ | |
7050 | TREE_PUBLIC (decl) = 1; | |
7051 | TREE_STATIC (decl) = 1; | |
7052 | /* For non-template classes, static data members are always put | |
7053 | out in exactly those files where they are defined, just as | |
77880ae4 | 7054 | with ordinary namespace-scope variables. */ |
4684cd27 MM |
7055 | if (!processing_template_decl) |
7056 | DECL_INTERFACE_KNOWN (decl) = 1; | |
7057 | } | |
7058 | ||
caf93cb0 | 7059 | /* Create a VAR_DECL named NAME with the indicated TYPE. |
9e259dd1 MM |
7060 | |
7061 | If SCOPE is non-NULL, it is the class type or namespace containing | |
7062 | the variable. If SCOPE is NULL, the variable should is created in | |
7063 | the innermost enclosings scope. */ | |
7064 | ||
8d08fdba | 7065 | static tree |
11f6b451 | 7066 | grokvardecl (tree type, |
0cbd7506 | 7067 | tree name, |
1ff3c076 | 7068 | const cp_decl_specifier_seq *declspecs, |
0cbd7506 MS |
7069 | int initialized, |
7070 | int constp, | |
7071 | tree scope) | |
8d08fdba MS |
7072 | { |
7073 | tree decl; | |
5ae9ba3e | 7074 | tree explicit_scope; |
f7da6097 | 7075 | |
50bc768d | 7076 | gcc_assert (!name || TREE_CODE (name) == IDENTIFIER_NODE); |
9e259dd1 | 7077 | |
5ae9ba3e MM |
7078 | /* Compute the scope in which to place the variable, but remember |
7079 | whether or not that scope was explicitly specified by the user. */ | |
7080 | explicit_scope = scope; | |
9e259dd1 | 7081 | if (!scope) |
8d08fdba | 7082 | { |
9e259dd1 MM |
7083 | /* An explicit "extern" specifier indicates a namespace-scope |
7084 | variable. */ | |
62d1db17 | 7085 | if (declspecs->storage_class == sc_extern) |
ae099258 | 7086 | scope = current_decl_namespace (); |
9e259dd1 | 7087 | else if (!at_function_scope_p ()) |
a5201a91 | 7088 | scope = current_scope (); |
9e259dd1 MM |
7089 | } |
7090 | ||
7091 | if (scope | |
7092 | && (/* If the variable is a namespace-scope variable declared in a | |
7093 | template, we need DECL_LANG_SPECIFIC. */ | |
7094 | (TREE_CODE (scope) == NAMESPACE_DECL && processing_template_decl) | |
7095 | /* Similarly for namespace-scope variables with language linkage | |
7096 | other than C++. */ | |
caf93cb0 | 7097 | || (TREE_CODE (scope) == NAMESPACE_DECL |
9e259dd1 MM |
7098 | && current_lang_name != lang_name_cplusplus) |
7099 | /* Similarly for static data members. */ | |
7100 | || TYPE_P (scope))) | |
7101 | decl = build_lang_decl (VAR_DECL, name, type); | |
8d08fdba | 7102 | else |
c2255bc4 | 7103 | decl = build_decl (input_location, VAR_DECL, name, type); |
79c4d4b7 | 7104 | |
5ae9ba3e MM |
7105 | if (explicit_scope && TREE_CODE (explicit_scope) == NAMESPACE_DECL) |
7106 | set_decl_namespace (decl, explicit_scope, 0); | |
9e259dd1 | 7107 | else |
74b0d490 | 7108 | DECL_CONTEXT (decl) = FROB_CONTEXT (scope); |
6060a796 | 7109 | |
62d1db17 | 7110 | if (declspecs->storage_class == sc_extern) |
8d08fdba MS |
7111 | { |
7112 | DECL_THIS_EXTERN (decl) = 1; | |
7113 | DECL_EXTERNAL (decl) = !initialized; | |
7114 | } | |
7115 | ||
2b9dc906 | 7116 | if (DECL_CLASS_SCOPE_P (decl)) |
8d08fdba | 7117 | { |
4684cd27 MM |
7118 | set_linkage_for_static_data_member (decl); |
7119 | /* This function is only called with out-of-class definitions. */ | |
5b605f68 | 7120 | DECL_EXTERNAL (decl) = 0; |
9c12301f | 7121 | check_class_member_definition_namespace (decl); |
8d08fdba MS |
7122 | } |
7123 | /* At top level, either `static' or no s.c. makes a definition | |
7124 | (perhaps tentative), and absence of `static' makes it public. */ | |
a9aedbc2 | 7125 | else if (toplevel_bindings_p ()) |
8d08fdba | 7126 | { |
62d1db17 | 7127 | TREE_PUBLIC (decl) = (declspecs->storage_class != sc_static |
9fffd093 | 7128 | && (DECL_THIS_EXTERN (decl) || ! constp)); |
8d08fdba MS |
7129 | TREE_STATIC (decl) = ! DECL_EXTERNAL (decl); |
7130 | } | |
7131 | /* Not at top level, only `static' makes a static definition. */ | |
7132 | else | |
7133 | { | |
62d1db17 | 7134 | TREE_STATIC (decl) = declspecs->storage_class == sc_static; |
8d08fdba MS |
7135 | TREE_PUBLIC (decl) = DECL_EXTERNAL (decl); |
7136 | } | |
50a6dbd7 | 7137 | |
62d1db17 | 7138 | if (declspecs->specs[(int)ds_thread]) |
8893239d | 7139 | DECL_TLS_MODEL (decl) = decl_default_tls_model (decl); |
7a1f3f5f | 7140 | |
1eee69dd JM |
7141 | /* If the type of the decl has no linkage, make sure that we'll |
7142 | notice that in mark_used. */ | |
7143 | if (cxx_dialect > cxx98 | |
7144 | && decl_linkage (decl) != lk_none | |
7145 | && DECL_LANG_SPECIFIC (decl) == NULL | |
7146 | && !DECL_EXTERN_C_P (decl) | |
7147 | && no_linkage_check (TREE_TYPE (decl), /*relaxed_p=*/false)) | |
7148 | retrofit_lang_decl (decl); | |
7149 | ||
50a6dbd7 JM |
7150 | if (TREE_PUBLIC (decl)) |
7151 | { | |
1eee69dd JM |
7152 | /* [basic.link]: A name with no linkage (notably, the name of a class |
7153 | or enumeration declared in a local scope) shall not be used to | |
7154 | declare an entity with linkage. | |
7155 | ||
7156 | DR 757 relaxes this restriction for C++0x. */ | |
7157 | tree t = (cxx_dialect > cxx98 ? NULL_TREE | |
7158 | : no_linkage_check (TREE_TYPE (decl), /*relaxed_p=*/false)); | |
7159 | if (t) | |
7160 | { | |
7161 | if (TYPE_ANONYMOUS_P (t)) | |
7162 | { | |
7163 | if (DECL_EXTERN_C_P (decl)) | |
7164 | /* Allow this; it's pretty common in C. */ | |
7165 | ; | |
7166 | else | |
7167 | { | |
7168 | /* DRs 132, 319 and 389 seem to indicate types with | |
7169 | no linkage can only be used to declare extern "C" | |
7170 | entities. Since it's not always an error in the | |
7171 | ISO C++ 90 Standard, we only issue a warning. */ | |
2401726e JM |
7172 | warning (0, "anonymous type with no linkage used to declare " |
7173 | "variable %q#D with linkage", decl); | |
1eee69dd JM |
7174 | if (DECL_ORIGINAL_TYPE (TYPE_NAME (t))) |
7175 | warning (0, "%q+#D does not refer to the unqualified " | |
7176 | "type, so it is not used for linkage", | |
7177 | TYPE_NAME (t)); | |
7178 | } | |
7179 | } | |
7180 | else | |
2401726e JM |
7181 | warning (0, "type %qT with no linkage used to declare variable " |
7182 | "%q#D with linkage", t, decl); | |
1eee69dd | 7183 | } |
50a6dbd7 | 7184 | } |
1ceb02be MM |
7185 | else |
7186 | DECL_INTERFACE_KNOWN (decl) = 1; | |
50a6dbd7 | 7187 | |
8d08fdba MS |
7188 | return decl; |
7189 | } | |
7190 | ||
d8f8dca1 MM |
7191 | /* Create and return a canonical pointer to member function type, for |
7192 | TYPE, which is a POINTER_TYPE to a METHOD_TYPE. */ | |
8d08fdba MS |
7193 | |
7194 | tree | |
11f6b451 | 7195 | build_ptrmemfunc_type (tree type) |
8d08fdba | 7196 | { |
4977bab6 | 7197 | tree field, fields; |
8d08fdba | 7198 | tree t; |
46cbda4a | 7199 | tree unqualified_variant = NULL_TREE; |
8d08fdba | 7200 | |
d48ebde1 NS |
7201 | if (type == error_mark_node) |
7202 | return type; | |
d363e7bf | 7203 | |
8d08fdba MS |
7204 | /* If a canonical type already exists for this type, use it. We use |
7205 | this method instead of type_hash_canon, because it only does a | |
7206 | simple equality check on the list of field members. */ | |
7207 | ||
7208 | if ((t = TYPE_GET_PTRMEMFUNC_TYPE (type))) | |
7209 | return t; | |
7210 | ||
46cbda4a MM |
7211 | /* Make sure that we always have the unqualified pointer-to-member |
7212 | type first. */ | |
89d684bb | 7213 | if (cp_type_quals (type) != TYPE_UNQUALIFIED) |
68642fb6 | 7214 | unqualified_variant |
46cbda4a MM |
7215 | = build_ptrmemfunc_type (TYPE_MAIN_VARIANT (type)); |
7216 | ||
9e1e64ec | 7217 | t = make_class_type (RECORD_TYPE); |
cad7e87b | 7218 | xref_basetypes (t, NULL_TREE); |
caf93cb0 | 7219 | |
3b426391 | 7220 | /* Let the front end know this is a pointer to member function... */ |
db5ae43f | 7221 | TYPE_PTRMEMFUNC_FLAG (t) = 1; |
9e1e64ec PC |
7222 | /* ... and not really a class type. */ |
7223 | SET_CLASS_TYPE_P (t, 0); | |
8d08fdba | 7224 | |
c2255bc4 | 7225 | field = build_decl (input_location, FIELD_DECL, pfn_identifier, type); |
4977bab6 | 7226 | fields = field; |
caf93cb0 | 7227 | |
c2255bc4 AH |
7228 | field = build_decl (input_location, FIELD_DECL, delta_identifier, |
7229 | delta_type_node); | |
4977bab6 ZW |
7230 | TREE_CHAIN (field) = fields; |
7231 | fields = field; | |
caf93cb0 | 7232 | |
4977bab6 | 7233 | finish_builtin_struct (t, "__ptrmemfunc_type", fields, ptr_type_node); |
8d08fdba | 7234 | |
3b426391 | 7235 | /* Zap out the name so that the back end will give us the debugging |
8d08fdba MS |
7236 | information for this anonymous RECORD_TYPE. */ |
7237 | TYPE_NAME (t) = NULL_TREE; | |
7238 | ||
46cbda4a MM |
7239 | /* If this is not the unqualified form of this pointer-to-member |
7240 | type, set the TYPE_MAIN_VARIANT for this type to be the | |
7241 | unqualified type. Since they are actually RECORD_TYPEs that are | |
22521c89 RG |
7242 | not variants of each other, we must do this manually. |
7243 | As we just built a new type there is no need to do yet another copy. */ | |
89d684bb | 7244 | if (cp_type_quals (type) != TYPE_UNQUALIFIED) |
46cbda4a | 7245 | { |
22521c89 RG |
7246 | int type_quals = cp_type_quals (type); |
7247 | TYPE_READONLY (t) = (type_quals & TYPE_QUAL_CONST) != 0; | |
7248 | TYPE_VOLATILE (t) = (type_quals & TYPE_QUAL_VOLATILE) != 0; | |
7249 | TYPE_RESTRICT (t) = (type_quals & TYPE_QUAL_RESTRICT) != 0; | |
46cbda4a MM |
7250 | TYPE_MAIN_VARIANT (t) = unqualified_variant; |
7251 | TYPE_NEXT_VARIANT (t) = TYPE_NEXT_VARIANT (unqualified_variant); | |
7252 | TYPE_NEXT_VARIANT (unqualified_variant) = t; | |
0f67bdf1 | 7253 | TREE_TYPE (TYPE_BINFO (t)) = t; |
46cbda4a MM |
7254 | } |
7255 | ||
7256 | /* Cache this pointer-to-member type so that we can find it again | |
7257 | later. */ | |
8d08fdba MS |
7258 | TYPE_SET_PTRMEMFUNC_TYPE (type, t); |
7259 | ||
0f67bdf1 JM |
7260 | if (TYPE_STRUCTURAL_EQUALITY_P (type)) |
7261 | SET_TYPE_STRUCTURAL_EQUALITY (t); | |
7262 | else if (TYPE_CANONICAL (type) != type) | |
7263 | TYPE_CANONICAL (t) = build_ptrmemfunc_type (TYPE_CANONICAL (type)); | |
06d40de8 | 7264 | |
8d08fdba MS |
7265 | return t; |
7266 | } | |
7267 | ||
9e259dd1 MM |
7268 | /* Create and return a pointer to data member type. */ |
7269 | ||
7270 | tree | |
7271 | build_ptrmem_type (tree class_type, tree member_type) | |
7272 | { | |
a5ac359a MM |
7273 | if (TREE_CODE (member_type) == METHOD_TYPE) |
7274 | { | |
2872152c | 7275 | cp_cv_quals quals = type_memfn_quals (member_type); |
3c3905fc | 7276 | member_type = build_memfn_type (member_type, class_type, quals); |
a5ac359a MM |
7277 | return build_ptrmemfunc_type (build_pointer_type (member_type)); |
7278 | } | |
7279 | else | |
7280 | { | |
50bc768d | 7281 | gcc_assert (TREE_CODE (member_type) != FUNCTION_TYPE); |
a5ac359a MM |
7282 | return build_offset_type (class_type, member_type); |
7283 | } | |
9e259dd1 MM |
7284 | } |
7285 | ||
b17e2870 JM |
7286 | /* DECL is a VAR_DECL defined in-class, whose TYPE is also given. |
7287 | Check to see that the definition is valid. Issue appropriate error | |
7288 | messages. Return 1 if the definition is particularly bad, or 0 | |
7289 | otherwise. */ | |
7290 | ||
7291 | int | |
11f6b451 | 7292 | check_static_variable_definition (tree decl, tree type) |
b17e2870 JM |
7293 | { |
7294 | /* Motion 10 at San Diego: If a static const integral data member is | |
7295 | initialized with an integral constant expression, the initializer | |
7296 | may appear either in the declaration (within the class), or in | |
7297 | the definition, but not both. If it appears in the class, the | |
7298 | member is a member constant. The file-scope definition is always | |
7299 | required. */ | |
dcba9b0f | 7300 | if (!ARITHMETIC_TYPE_P (type) && TREE_CODE (type) != ENUMERAL_TYPE) |
b17e2870 | 7301 | { |
2d01edd7 | 7302 | error ("invalid in-class initialization of static data member " |
0cbd7506 | 7303 | "of non-integral type %qT", |
dcba9b0f | 7304 | type); |
b17e2870 | 7305 | /* If we just return the declaration, crashes will sometimes |
852dcbdd | 7306 | occur. We therefore return void_type_node, as if this were a |
b17e2870 JM |
7307 | friend declaration, to cause callers to completely ignore |
7308 | this declaration. */ | |
7309 | return 1; | |
7310 | } | |
7311 | else if (!CP_TYPE_CONST_P (type)) | |
2d01edd7 | 7312 | error ("ISO C++ forbids in-class initialization of non-const " |
0cbd7506 MS |
7313 | "static member %qD", |
7314 | decl); | |
550a799d | 7315 | else if (!INTEGRAL_OR_ENUMERATION_TYPE_P (type)) |
509c9d60 | 7316 | pedwarn (input_location, OPT_pedantic, "ISO C++ forbids initialization of member constant " |
0cbd7506 | 7317 | "%qD of non-integral type %qT", decl, type); |
b17e2870 JM |
7318 | |
7319 | return 0; | |
7320 | } | |
7321 | ||
2848ad0f MM |
7322 | /* Given the SIZE (i.e., number of elements) in an array, compute an |
7323 | appropriate index type for the array. If non-NULL, NAME is the | |
7324 | name of the thing being declared. */ | |
7325 | ||
c95cd22e | 7326 | tree |
11f6b451 | 7327 | compute_array_index_type (tree name, tree size) |
2848ad0f | 7328 | { |
d174af6c | 7329 | tree type; |
2848ad0f | 7330 | tree itype; |
06d40de8 | 7331 | tree abi_1_itype = NULL_TREE; |
2848ad0f | 7332 | |
d174af6c MM |
7333 | if (error_operand_p (size)) |
7334 | return error_mark_node; | |
7335 | ||
7336 | type = TREE_TYPE (size); | |
d63b5e9f | 7337 | /* The array bound must be an integer type. */ |
550a799d | 7338 | if (!dependent_type_p (type) && !INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type)) |
2848ad0f | 7339 | { |
d63b5e9f | 7340 | if (name) |
2d01edd7 | 7341 | error ("size of array %qD has non-integral type %qT", name, type); |
d63b5e9f | 7342 | else |
2d01edd7 | 7343 | error ("size of array has non-integral type %qT", type); |
d63b5e9f NS |
7344 | size = integer_one_node; |
7345 | type = TREE_TYPE (size); | |
2848ad0f MM |
7346 | } |
7347 | ||
c1165535 JM |
7348 | /* We can only call value_dependent_expression_p on integral constant |
7349 | expressions; the parser adds a dummy NOP_EXPR with TREE_SIDE_EFFECTS | |
7350 | set if this isn't one. */ | |
7351 | if (processing_template_decl | |
7352 | && (TREE_SIDE_EFFECTS (size) || value_dependent_expression_p (size))) | |
7353 | { | |
7354 | /* We cannot do any checking for a SIZE that isn't known to be | |
7355 | constant. Just build the index type and mark that it requires | |
7356 | structural equality checks. */ | |
06d40de8 DG |
7357 | itype = build_index_type (build_min (MINUS_EXPR, sizetype, |
7358 | size, integer_one_node)); | |
483a1dce JM |
7359 | TYPE_DEPENDENT_P (itype) = 1; |
7360 | TYPE_DEPENDENT_P_VALID (itype) = 1; | |
06d40de8 DG |
7361 | SET_TYPE_STRUCTURAL_EQUALITY (itype); |
7362 | return itype; | |
7363 | } | |
7364 | ||
7365 | if (!abi_version_at_least (2) && processing_template_decl) | |
7366 | /* For abi-1, we handled all instances in templates the same way, | |
39a13be5 | 7367 | even when they were non-dependent. This affects the manglings |
06d40de8 DG |
7368 | produced. So, we do the normal checking for non-dependent |
7369 | sizes, but at the end we'll return the same type that abi-1 | |
7370 | would have, but with TYPE_CANONICAL set to the "right" | |
7371 | value that the current ABI would provide. */ | |
7372 | abi_1_itype = build_index_type (build_min (MINUS_EXPR, sizetype, | |
7373 | size, integer_one_node)); | |
d63b5e9f | 7374 | |
a1c65f9f | 7375 | /* The size might be the result of a cast. */ |
80f5bb34 MM |
7376 | STRIP_TYPE_NOPS (size); |
7377 | ||
ad13f229 DS |
7378 | size = mark_rvalue_use (size); |
7379 | ||
80f5bb34 | 7380 | /* It might be a const variable or enumeration constant. */ |
8a784e4a | 7381 | size = integral_constant_value (size); |
88274c4d JM |
7382 | if (error_operand_p (size)) |
7383 | return error_mark_node; | |
80f5bb34 | 7384 | |
2848ad0f | 7385 | /* Normally, the array-bound will be a constant. */ |
2bb5d995 | 7386 | if (TREE_CODE (size) == INTEGER_CST) |
2848ad0f MM |
7387 | { |
7388 | /* Check to see if the array bound overflowed. Make that an | |
7389 | error, no matter how generous we're being. */ | |
393eda6a | 7390 | constant_expression_error (size); |
2848ad0f MM |
7391 | |
7392 | /* An array must have a positive number of elements. */ | |
7393 | if (INT_CST_LT (size, integer_zero_node)) | |
7394 | { | |
d67cdbc3 | 7395 | if (name) |
2d01edd7 | 7396 | error ("size of array %qD is negative", name); |
d67cdbc3 | 7397 | else |
33bd39a2 | 7398 | error ("size of array is negative"); |
2848ad0f MM |
7399 | size = integer_one_node; |
7400 | } | |
a8e6c82a MM |
7401 | /* As an extension we allow zero-sized arrays. We always allow |
7402 | them in system headers because glibc uses them. */ | |
fcf73884 | 7403 | else if (integer_zerop (size) && !in_system_header) |
d67cdbc3 JM |
7404 | { |
7405 | if (name) | |
509c9d60 | 7406 | pedwarn (input_location, OPT_pedantic, "ISO C++ forbids zero-size array %qD", name); |
d67cdbc3 | 7407 | else |
509c9d60 | 7408 | pedwarn (input_location, OPT_pedantic, "ISO C++ forbids zero-size array"); |
d67cdbc3 | 7409 | } |
2848ad0f | 7410 | } |
2bb5d995 JM |
7411 | else if (TREE_CONSTANT (size)) |
7412 | { | |
7413 | /* `(int) &fn' is not a valid array bound. */ | |
7414 | if (name) | |
2d01edd7 | 7415 | error ("size of array %qD is not an integral constant-expression", |
0cbd7506 | 7416 | name); |
2bb5d995 | 7417 | else |
33bd39a2 | 7418 | error ("size of array is not an integral constant-expression"); |
3aa2ddb8 | 7419 | size = integer_one_node; |
2bb5d995 | 7420 | } |
50d50fc7 | 7421 | else if (pedantic && warn_vla != 0) |
d63b5e9f NS |
7422 | { |
7423 | if (name) | |
509c9d60 | 7424 | pedwarn (input_location, OPT_Wvla, "ISO C++ forbids variable length array %qD", name); |
d63b5e9f | 7425 | else |
509c9d60 | 7426 | pedwarn (input_location, OPT_Wvla, "ISO C++ forbids variable length array"); |
50d50fc7 SP |
7427 | } |
7428 | else if (warn_vla > 0) | |
7429 | { | |
7430 | if (name) | |
7431 | warning (OPT_Wvla, | |
7432 | "variable length array %qD is used", name); | |
7433 | else | |
7434 | warning (OPT_Wvla, | |
7435 | "variable length array is used"); | |
d63b5e9f | 7436 | } |
2848ad0f | 7437 | |
d63b5e9f NS |
7438 | if (processing_template_decl && !TREE_CONSTANT (size)) |
7439 | /* A variable sized array. */ | |
7440 | itype = build_min (MINUS_EXPR, sizetype, size, integer_one_node); | |
7441 | else | |
2848ad0f | 7442 | { |
455f19cb MM |
7443 | HOST_WIDE_INT saved_processing_template_decl; |
7444 | ||
d63b5e9f | 7445 | /* Compute the index of the largest element in the array. It is |
0cbd7506 MS |
7446 | one less than the number of elements in the array. We save |
7447 | and restore PROCESSING_TEMPLATE_DECL so that computations in | |
7448 | cp_build_binary_op will be appropriately folded. */ | |
455f19cb MM |
7449 | saved_processing_template_decl = processing_template_decl; |
7450 | processing_template_decl = 0; | |
ba47d38d AH |
7451 | itype = cp_build_binary_op (input_location, |
7452 | MINUS_EXPR, | |
455f19cb | 7453 | cp_convert (ssizetype, size), |
5ade1ed2 DG |
7454 | cp_convert (ssizetype, integer_one_node), |
7455 | tf_warning_or_error); | |
455f19cb MM |
7456 | itype = fold (itype); |
7457 | processing_template_decl = saved_processing_template_decl; | |
7458 | ||
d63b5e9f | 7459 | if (!TREE_CONSTANT (itype)) |
f4f206f4 | 7460 | /* A variable sized array. */ |
d63b5e9f NS |
7461 | itype = variable_size (itype); |
7462 | /* Make sure that there was no overflow when creating to a signed | |
0cbd7506 MS |
7463 | index type. (For example, on a 32-bit machine, an array with |
7464 | size 2^32 - 1 is too big.) */ | |
9116d529 RS |
7465 | else if (TREE_CODE (itype) == INTEGER_CST |
7466 | && TREE_OVERFLOW (itype)) | |
2848ad0f | 7467 | { |
d63b5e9f NS |
7468 | error ("overflow in array dimension"); |
7469 | TREE_OVERFLOW (itype) = 0; | |
2848ad0f | 7470 | } |
2848ad0f | 7471 | } |
68642fb6 | 7472 | |
2848ad0f | 7473 | /* Create and return the appropriate index type. */ |
06d40de8 DG |
7474 | if (abi_1_itype) |
7475 | { | |
7476 | tree t = build_index_type (itype); | |
7477 | TYPE_CANONICAL (abi_1_itype) = TYPE_CANONICAL (t); | |
7478 | return abi_1_itype; | |
7479 | } | |
7480 | else | |
7481 | return build_index_type (itype); | |
2848ad0f MM |
7482 | } |
7483 | ||
a723baf1 MM |
7484 | /* Returns the scope (if any) in which the entity declared by |
7485 | DECLARATOR will be located. If the entity was declared with an | |
7486 | unqualified name, NULL_TREE is returned. */ | |
7487 | ||
7488 | tree | |
058b15c1 | 7489 | get_scope_of_declarator (const cp_declarator *declarator) |
a723baf1 | 7490 | { |
058b15c1 MM |
7491 | while (declarator && declarator->kind != cdk_id) |
7492 | declarator = declarator->declarator; | |
7493 | ||
7494 | /* If the declarator-id is a SCOPE_REF, the scope in which the | |
7495 | declaration occurs is the first operand. */ | |
7496 | if (declarator | |
1d786913 MM |
7497 | && declarator->u.id.qualifying_scope) |
7498 | return declarator->u.id.qualifying_scope; | |
058b15c1 | 7499 | |
77880ae4 | 7500 | /* Otherwise, the declarator is not a qualified name; the entity will |
058b15c1 MM |
7501 | be declared in the current scope. */ |
7502 | return NULL_TREE; | |
a723baf1 MM |
7503 | } |
7504 | ||
2848ad0f MM |
7505 | /* Returns an ARRAY_TYPE for an array with SIZE elements of the |
7506 | indicated TYPE. If non-NULL, NAME is the NAME of the declaration | |
7507 | with this type. */ | |
7508 | ||
7509 | static tree | |
11f6b451 | 7510 | create_array_type_for_decl (tree name, tree type, tree size) |
2848ad0f MM |
7511 | { |
7512 | tree itype = NULL_TREE; | |
2848ad0f MM |
7513 | |
7514 | /* If things have already gone awry, bail now. */ | |
7515 | if (type == error_mark_node || size == error_mark_node) | |
7516 | return error_mark_node; | |
7517 | ||
4cd5a50a PB |
7518 | /* If there are some types which cannot be array elements, |
7519 | issue an error-message and return. */ | |
2848ad0f MM |
7520 | switch (TREE_CODE (type)) |
7521 | { | |
7522 | case VOID_TYPE: | |
4cd5a50a PB |
7523 | if (name) |
7524 | error ("declaration of %qD as array of void", name); | |
7525 | else | |
7526 | error ("creating array of void"); | |
7527 | return error_mark_node; | |
2848ad0f MM |
7528 | |
7529 | case FUNCTION_TYPE: | |
4cd5a50a PB |
7530 | if (name) |
7531 | error ("declaration of %qD as array of functions", name); | |
7532 | else | |
7533 | error ("creating array of functions"); | |
7534 | return error_mark_node; | |
2848ad0f MM |
7535 | |
7536 | case REFERENCE_TYPE: | |
4cd5a50a PB |
7537 | if (name) |
7538 | error ("declaration of %qD as array of references", name); | |
7539 | else | |
7540 | error ("creating array of references"); | |
7541 | return error_mark_node; | |
2848ad0f | 7542 | |
2848ad0f | 7543 | case METHOD_TYPE: |
4cd5a50a PB |
7544 | if (name) |
7545 | error ("declaration of %qD as array of function members", name); | |
7546 | else | |
7547 | error ("creating array of function members"); | |
7548 | return error_mark_node; | |
2848ad0f MM |
7549 | |
7550 | default: | |
7551 | break; | |
7552 | } | |
7553 | ||
2848ad0f | 7554 | /* [dcl.array] |
68642fb6 | 7555 | |
2848ad0f MM |
7556 | The constant expressions that specify the bounds of the arrays |
7557 | can be omitted only for the first member of the sequence. */ | |
7558 | if (TREE_CODE (type) == ARRAY_TYPE && !TYPE_DOMAIN (type)) | |
7559 | { | |
b3faacfd | 7560 | if (name) |
2d01edd7 | 7561 | error ("declaration of %qD as multidimensional array must " |
0cbd7506 MS |
7562 | "have bounds for all dimensions except the first", |
7563 | name); | |
b3faacfd | 7564 | else |
2d01edd7 | 7565 | error ("multidimensional array must have bounds for all " |
0cbd7506 | 7566 | "dimensions except the first"); |
2848ad0f MM |
7567 | |
7568 | return error_mark_node; | |
7569 | } | |
7570 | ||
7571 | /* Figure out the index type for the array. */ | |
7572 | if (size) | |
7573 | itype = compute_array_index_type (name, size); | |
7574 | ||
7fb213d8 GB |
7575 | /* [dcl.array] |
7576 | T is called the array element type; this type shall not be [...] an | |
7577 | abstract class type. */ | |
7578 | abstract_virtuals_error (name, type); | |
7579 | ||
2848ad0f MM |
7580 | return build_cplus_array_type (type, itype); |
7581 | } | |
7582 | ||
3dbc07b6 MM |
7583 | /* Check that it's OK to declare a function with the indicated TYPE. |
7584 | SFK indicates the kind of special function (if any) that this | |
1f84ec23 | 7585 | function is. OPTYPE is the type given in a conversion operator |
44d10c10 PB |
7586 | declaration, or the class type for a constructor/destructor. |
7587 | Returns the actual return type of the function; that | |
3dbc07b6 MM |
7588 | may be different than TYPE if an error occurs, or for certain |
7589 | special functions. */ | |
7590 | ||
7591 | static tree | |
11f6b451 | 7592 | check_special_function_return_type (special_function_kind sfk, |
0cbd7506 MS |
7593 | tree type, |
7594 | tree optype) | |
3dbc07b6 MM |
7595 | { |
7596 | switch (sfk) | |
7597 | { | |
7598 | case sfk_constructor: | |
7599 | if (type) | |
33bd39a2 | 7600 | error ("return type specification for constructor invalid"); |
5362b086 | 7601 | |
44d10c10 PB |
7602 | if (targetm.cxx.cdtor_returns_this () && !TYPE_FOR_JAVA (optype)) |
7603 | type = build_pointer_type (optype); | |
7604 | else | |
7605 | type = void_type_node; | |
3dbc07b6 MM |
7606 | break; |
7607 | ||
7608 | case sfk_destructor: | |
7609 | if (type) | |
33bd39a2 | 7610 | error ("return type specification for destructor invalid"); |
44d10c10 | 7611 | /* We can't use the proper return type here because we run into |
77880ae4 | 7612 | problems with ambiguous bases and covariant returns. |
44d10c10 PB |
7613 | Java classes are left unchanged because (void *) isn't a valid |
7614 | Java type, and we don't want to change the Java ABI. */ | |
7615 | if (targetm.cxx.cdtor_returns_this () && !TYPE_FOR_JAVA (optype)) | |
7616 | type = build_pointer_type (void_type_node); | |
7617 | else | |
7618 | type = void_type_node; | |
3dbc07b6 MM |
7619 | break; |
7620 | ||
7621 | case sfk_conversion: | |
caba2081 PC |
7622 | if (type) |
7623 | error ("return type specified for %<operator %T%>", optype); | |
3dbc07b6 MM |
7624 | type = optype; |
7625 | break; | |
7626 | ||
7627 | default: | |
8dc2b103 | 7628 | gcc_unreachable (); |
3dbc07b6 MM |
7629 | } |
7630 | ||
7631 | return type; | |
7632 | } | |
7633 | ||
62e19030 MM |
7634 | /* A variable or data member (whose unqualified name is IDENTIFIER) |
7635 | has been declared with the indicated TYPE. If the TYPE is not | |
7636 | acceptable, issue an error message and return a type to use for | |
03fd3f84 | 7637 | error-recovery purposes. */ |
62e19030 MM |
7638 | |
7639 | tree | |
7640 | check_var_type (tree identifier, tree type) | |
7641 | { | |
7642 | if (VOID_TYPE_P (type)) | |
7643 | { | |
7644 | if (!identifier) | |
7645 | error ("unnamed variable or field declared void"); | |
7646 | else if (TREE_CODE (identifier) == IDENTIFIER_NODE) | |
7647 | { | |
7648 | gcc_assert (!IDENTIFIER_OPNAME_P (identifier)); | |
7649 | error ("variable or field %qE declared void", identifier); | |
7650 | } | |
7651 | else | |
7652 | error ("variable or field declared void"); | |
650fcd07 | 7653 | type = error_mark_node; |
62e19030 | 7654 | } |
c8094d83 | 7655 | |
62e19030 MM |
7656 | return type; |
7657 | } | |
7658 | ||
a723baf1 MM |
7659 | /* Given declspecs and a declarator (abstract or otherwise), determine |
7660 | the name and type of the object declared and construct a DECL node | |
7661 | for it. | |
8d08fdba | 7662 | |
5e32a5cf GDR |
7663 | DECLSPECS points to the representation of declaration-specifier |
7664 | sequence that precedes declarator. | |
8d08fdba MS |
7665 | |
7666 | DECL_CONTEXT says which syntactic context this declaration is in: | |
7667 | NORMAL for most contexts. Make a VAR_DECL or FUNCTION_DECL or TYPE_DECL. | |
7668 | FUNCDEF for a function definition. Like NORMAL but a few different | |
7669 | error messages in each case. Return value may be zero meaning | |
7670 | this definition is too screwy to try to parse. | |
7671 | MEMFUNCDEF for a function definition. Like FUNCDEF but prepares to | |
7672 | handle member functions (which have FIELD context). | |
7673 | Return value may be zero meaning this definition is too screwy to | |
7674 | try to parse. | |
7675 | PARM for a parameter declaration (either within a function prototype | |
7676 | or before a function body). Make a PARM_DECL, or return void_type_node. | |
0229b692 | 7677 | TPARM for a template parameter declaration. |
db5ae43f | 7678 | CATCHPARM for a parameter declaration before a catch clause. |
8d08fdba MS |
7679 | TYPENAME if for a typename (in a cast or sizeof). |
7680 | Don't make a DECL node; just return the ..._TYPE node. | |
7681 | FIELD for a struct or union field; make a FIELD_DECL. | |
7682 | BITFIELD for a field with specified width. | |
0229b692 | 7683 | |
b87d79e6 | 7684 | INITIALIZED is as for start_decl. |
8d08fdba | 7685 | |
91d231cb JM |
7686 | ATTRLIST is a pointer to the list of attributes, which may be NULL |
7687 | if there are none; *ATTRLIST may be modified if attributes from inside | |
7688 | the declarator should be applied to the declaration. | |
b17e2870 | 7689 | |
a723baf1 MM |
7690 | When this function is called, scoping variables (such as |
7691 | CURRENT_CLASS_TYPE) should reflect the scope in which the | |
7692 | declaration occurs, not the scope in which the new declaration will | |
7693 | be placed. For example, on: | |
8d08fdba | 7694 | |
a723baf1 | 7695 | void S::f() { ... } |
8d08fdba | 7696 | |
a723baf1 | 7697 | when grokdeclarator is called for `S::f', the CURRENT_CLASS_TYPE |
344f237b LM |
7698 | should not be `S'. |
7699 | ||
7700 | Returns a DECL (if a declarator is present), a TYPE (if there is no | |
7701 | declarator, in cases like "struct S;"), or the ERROR_MARK_NODE if an | |
7702 | error occurs. */ | |
8d08fdba | 7703 | |
8d08fdba | 7704 | tree |
058b15c1 | 7705 | grokdeclarator (const cp_declarator *declarator, |
1ff3c076 | 7706 | const cp_decl_specifier_seq *declspecs, |
0cbd7506 MS |
7707 | enum decl_context decl_context, |
7708 | int initialized, | |
7709 | tree* attrlist) | |
8d08fdba | 7710 | { |
8d08fdba MS |
7711 | tree type = NULL_TREE; |
7712 | int longlong = 0; | |
a6766312 | 7713 | int explicit_int128 = 0; |
db5ae43f | 7714 | int virtualp, explicitp, friendp, inlinep, staticp; |
8d08fdba MS |
7715 | int explicit_int = 0; |
7716 | int explicit_char = 0; | |
37c46b43 | 7717 | int defaulted_int = 0; |
d1c78882 | 7718 | tree dependent_name = NULL_TREE; |
caf93cb0 | 7719 | |
8d08fdba | 7720 | tree typedef_decl = NULL_TREE; |
058b15c1 | 7721 | const char *name = NULL; |
8d08fdba | 7722 | tree typedef_type = NULL_TREE; |
357d956e MM |
7723 | /* True if this declarator is a function definition. */ |
7724 | bool funcdef_flag = false; | |
058b15c1 | 7725 | cp_declarator_kind innermost_code = cdk_error; |
8d08fdba | 7726 | int bitfield = 0; |
6125f3be DE |
7727 | #if 0 |
7728 | /* See the code below that used this. */ | |
91d231cb | 7729 | tree decl_attr = NULL_TREE; |
6125f3be | 7730 | #endif |
8d08fdba MS |
7731 | |
7732 | /* Keep track of what sort of function is being processed | |
7733 | so that we can warn about default return values, or explicit | |
7734 | return values which do not match prescribed defaults. */ | |
3dbc07b6 | 7735 | special_function_kind sfk = sfk_none; |
8d08fdba MS |
7736 | |
7737 | tree dname = NULL_TREE; | |
8d08fdba MS |
7738 | tree ctor_return_type = NULL_TREE; |
7739 | enum overload_flags flags = NO_SPECIAL; | |
e2537f2c MM |
7740 | /* cv-qualifiers that apply to the declarator, for a declaration of |
7741 | a member function. */ | |
7742 | cp_cv_quals memfn_quals = TYPE_UNQUALIFIED; | |
7743 | /* cv-qualifiers that apply to the type specified by the DECLSPECS. */ | |
7744 | int type_quals; | |
c11b6f21 | 7745 | tree raises = NULL_TREE; |
386b8a85 | 7746 | int template_count = 0; |
91d231cb | 7747 | tree returned_attrs = NULL_TREE; |
4546865e | 7748 | tree parms = NULL_TREE; |
058b15c1 MM |
7749 | const cp_declarator *id_declarator; |
7750 | /* The unqualified name of the declarator; either an | |
7751 | IDENTIFIER_NODE, BIT_NOT_EXPR, or TEMPLATE_ID_EXPR. */ | |
7752 | tree unqualified_id; | |
7753 | /* The class type, if any, in which this entity is located, | |
7754 | or NULL_TREE if none. Note that this value may be different from | |
7755 | the current class type; for example if an attempt is made to declare | |
7756 | "A::f" inside "B", this value will be "A". */ | |
7757 | tree ctype = current_class_type; | |
7758 | /* The NAMESPACE_DECL for the namespace in which this entity is | |
7759 | located. If an unqualified name is used to declare the entity, | |
7760 | this value will be NULL_TREE, even if the entity is located at | |
caf93cb0 | 7761 | namespace scope. */ |
058b15c1 | 7762 | tree in_namespace = NULL_TREE; |
1ff3c076 MM |
7763 | cp_storage_class storage_class; |
7764 | bool unsigned_p, signed_p, short_p, long_p, thread_p; | |
2cfe82fe | 7765 | bool type_was_error_mark_node = false; |
5d80a306 | 7766 | bool parameter_pack_p = declarator? declarator->parameter_pack_p : false; |
0d9c0892 | 7767 | bool template_type_arg = false; |
0229b692 | 7768 | bool template_parm_flag = false; |
7ecbca9d | 7769 | bool constexpr_p = declspecs->specs[(int) ds_constexpr]; |
40449a90 | 7770 | const char *errmsg; |
1ff3c076 MM |
7771 | |
7772 | signed_p = declspecs->specs[(int)ds_signed]; | |
7773 | unsigned_p = declspecs->specs[(int)ds_unsigned]; | |
7774 | short_p = declspecs->specs[(int)ds_short]; | |
7775 | long_p = declspecs->specs[(int)ds_long]; | |
28c84d63 | 7776 | longlong = declspecs->specs[(int)ds_long] >= 2; |
a6766312 | 7777 | explicit_int128 = declspecs->explicit_int128_p; |
1ff3c076 | 7778 | thread_p = declspecs->specs[(int)ds_thread]; |
8d08fdba | 7779 | |
8d08fdba | 7780 | if (decl_context == FUNCDEF) |
357d956e | 7781 | funcdef_flag = true, decl_context = NORMAL; |
8d08fdba | 7782 | else if (decl_context == MEMFUNCDEF) |
357d956e | 7783 | funcdef_flag = true, decl_context = FIELD; |
8d08fdba MS |
7784 | else if (decl_context == BITFIELD) |
7785 | bitfield = 1, decl_context = FIELD; | |
0d9c0892 JM |
7786 | else if (decl_context == TEMPLATE_TYPE_ARG) |
7787 | template_type_arg = true, decl_context = TYPENAME; | |
0229b692 PC |
7788 | else if (decl_context == TPARM) |
7789 | template_parm_flag = true, decl_context = PARM; | |
8d08fdba | 7790 | |
b87d79e6 JM |
7791 | if (initialized > 1) |
7792 | funcdef_flag = true; | |
7793 | ||
8d08fdba MS |
7794 | /* Look inside a declarator for the name being declared |
7795 | and get it as a string, for an error message. */ | |
caf93cb0 EC |
7796 | for (id_declarator = declarator; |
7797 | id_declarator; | |
058b15c1 MM |
7798 | id_declarator = id_declarator->declarator) |
7799 | { | |
7800 | if (id_declarator->kind != cdk_id) | |
7801 | innermost_code = id_declarator->kind; | |
8d08fdba | 7802 | |
058b15c1 MM |
7803 | switch (id_declarator->kind) |
7804 | { | |
7805 | case cdk_function: | |
7806 | if (id_declarator->declarator | |
7807 | && id_declarator->declarator->kind == cdk_id) | |
8d08fdba | 7808 | { |
058b15c1 MM |
7809 | sfk = id_declarator->declarator->u.id.sfk; |
7810 | if (sfk == sfk_destructor) | |
7811 | flags = DTOR_FLAG; | |
51c184be | 7812 | } |
058b15c1 | 7813 | break; |
be99da77 | 7814 | |
058b15c1 MM |
7815 | case cdk_id: |
7816 | { | |
1d786913 MM |
7817 | tree qualifying_scope = id_declarator->u.id.qualifying_scope; |
7818 | tree decl = id_declarator->u.id.unqualified_name; | |
058b15c1 MM |
7819 | if (!decl) |
7820 | break; | |
1d786913 | 7821 | if (qualifying_scope) |
8d08fdba | 7822 | { |
2884e22c MM |
7823 | if (at_function_scope_p ()) |
7824 | { | |
7825 | /* [dcl.meaning] | |
7826 | ||
7827 | A declarator-id shall not be qualified except | |
7828 | for ... | |
7829 | ||
7830 | None of the cases are permitted in block | |
7831 | scope. */ | |
7832 | if (qualifying_scope == global_namespace) | |
7833 | error ("invalid use of qualified-name %<::%D%>", | |
7834 | decl); | |
7835 | else if (TYPE_P (qualifying_scope)) | |
7836 | error ("invalid use of qualified-name %<%T::%D%>", | |
7837 | qualifying_scope, decl); | |
7838 | else | |
7839 | error ("invalid use of qualified-name %<%D::%D%>", | |
7840 | qualifying_scope, decl); | |
7841 | return error_mark_node; | |
7842 | } | |
7843 | else if (TYPE_P (qualifying_scope)) | |
058b15c1 | 7844 | { |
1d786913 | 7845 | ctype = qualifying_scope; |
058b15c1 MM |
7846 | if (innermost_code != cdk_function |
7847 | && current_class_type | |
caf93cb0 | 7848 | && !UNIQUELY_DERIVED_FROM_P (ctype, |
058b15c1 MM |
7849 | current_class_type)) |
7850 | { | |
2d01edd7 | 7851 | error ("type %qT is not derived from type %qT", |
058b15c1 | 7852 | ctype, current_class_type); |
1d786913 | 7853 | return error_mark_node; |
058b15c1 | 7854 | } |
058b15c1 MM |
7855 | } |
7856 | else if (TREE_CODE (qualifying_scope) == NAMESPACE_DECL) | |
7857 | in_namespace = qualifying_scope; | |
058b15c1 | 7858 | } |
058b15c1 MM |
7859 | switch (TREE_CODE (decl)) |
7860 | { | |
7861 | case BIT_NOT_EXPR: | |
be99da77 | 7862 | { |
88e95ee3 MM |
7863 | tree type; |
7864 | ||
7865 | if (innermost_code != cdk_function) | |
7866 | { | |
7867 | error ("declaration of %qD as non-function", decl); | |
7868 | return error_mark_node; | |
7869 | } | |
c8094d83 | 7870 | else if (!qualifying_scope |
88e95ee3 MM |
7871 | && !(current_class_type && at_class_scope_p ())) |
7872 | { | |
7873 | error ("declaration of %qD as non-member", decl); | |
7874 | return error_mark_node; | |
7875 | } | |
c8094d83 | 7876 | |
88e95ee3 | 7877 | type = TREE_OPERAND (decl, 0); |
bd967b22 JM |
7878 | if (TYPE_P (type)) |
7879 | type = constructor_name (type); | |
f41c4af3 | 7880 | name = identifier_to_locale (IDENTIFIER_POINTER (type)); |
af02935e | 7881 | dname = decl; |
058b15c1 MM |
7882 | } |
7883 | break; | |
633221db | 7884 | |
058b15c1 MM |
7885 | case TEMPLATE_ID_EXPR: |
7886 | { | |
7887 | tree fns = TREE_OPERAND (decl, 0); | |
633221db | 7888 | |
058b15c1 | 7889 | dname = fns; |
058b15c1 | 7890 | if (TREE_CODE (dname) != IDENTIFIER_NODE) |
be99da77 | 7891 | { |
50bc768d | 7892 | gcc_assert (is_overloaded_fn (dname)); |
058b15c1 | 7893 | dname = DECL_NAME (get_first_fn (dname)); |
be99da77 MS |
7894 | } |
7895 | } | |
058b15c1 | 7896 | /* Fall through. */ |
be99da77 | 7897 | |
058b15c1 MM |
7898 | case IDENTIFIER_NODE: |
7899 | if (TREE_CODE (decl) == IDENTIFIER_NODE) | |
7900 | dname = decl; | |
be99da77 | 7901 | |
058b15c1 MM |
7902 | if (C_IS_RESERVED_WORD (dname)) |
7903 | { | |
2d01edd7 | 7904 | error ("declarator-id missing; using reserved word %qD", |
058b15c1 | 7905 | dname); |
f41c4af3 | 7906 | name = identifier_to_locale (IDENTIFIER_POINTER (dname)); |
058b15c1 MM |
7907 | } |
7908 | else if (!IDENTIFIER_TYPENAME_P (dname)) | |
f41c4af3 | 7909 | name = identifier_to_locale (IDENTIFIER_POINTER (dname)); |
058b15c1 MM |
7910 | else |
7911 | { | |
50bc768d | 7912 | gcc_assert (flags == NO_SPECIAL); |
058b15c1 MM |
7913 | flags = TYPENAME_FLAG; |
7914 | ctor_return_type = TREE_TYPE (dname); | |
7915 | sfk = sfk_conversion; | |
7916 | if (is_typename_at_global_scope (dname)) | |
f41c4af3 | 7917 | name = identifier_to_locale (IDENTIFIER_POINTER (dname)); |
058b15c1 MM |
7918 | else |
7919 | name = "<invalid operator>"; | |
7920 | } | |
7921 | break; | |
7922 | ||
058b15c1 | 7923 | default: |
8dc2b103 | 7924 | gcc_unreachable (); |
058b15c1 | 7925 | } |
45537677 | 7926 | break; |
b08f991d | 7927 | } |
45537677 | 7928 | |
b08f991d SB |
7929 | case cdk_array: |
7930 | case cdk_pointer: | |
7931 | case cdk_reference: | |
7932 | case cdk_ptrmem: | |
7933 | break; | |
2ee366b5 | 7934 | |
b08f991d SB |
7935 | case cdk_error: |
7936 | return error_mark_node; | |
058b15c1 | 7937 | |
b08f991d SB |
7938 | default: |
7939 | gcc_unreachable (); | |
058b15c1 MM |
7940 | } |
7941 | if (id_declarator->kind == cdk_id) | |
7942 | break; | |
7943 | } | |
8d08fdba | 7944 | |
fa6098f8 | 7945 | /* [dcl.fct.edf] |
3db45ab5 | 7946 | |
fa6098f8 MM |
7947 | The declarator in a function-definition shall have the form |
7948 | D1 ( parameter-declaration-clause) ... */ | |
058b15c1 | 7949 | if (funcdef_flag && innermost_code != cdk_function) |
fa6098f8 MM |
7950 | { |
7951 | error ("function definition does not declare parameters"); | |
7952 | return error_mark_node; | |
7953 | } | |
8d08fdba | 7954 | |
e1cd6e56 | 7955 | if (((dname && IDENTIFIER_OPNAME_P (dname)) || flags == TYPENAME_FLAG) |
058b15c1 | 7956 | && innermost_code != cdk_function |
62d1db17 | 7957 | && ! (ctype && !declspecs->any_specifiers_p)) |
e1cd6e56 | 7958 | { |
2d01edd7 | 7959 | error ("declaration of %qD as non-function", dname); |
943e3ede | 7960 | return error_mark_node; |
e1cd6e56 MS |
7961 | } |
7962 | ||
8d08fdba MS |
7963 | /* Anything declared one level down from the top level |
7964 | must be one of the parameters of a function | |
7965 | (because the body is at least two levels down). */ | |
7966 | ||
7967 | /* This heuristic cannot be applied to C++ nodes! Fixed, however, | |
7968 | by not allowing C++ class definitions to specify their parameters | |
7969 | with xdecls (must be spec.d in the parmlist). | |
7970 | ||
7971 | Since we now wait to push a class scope until we are sure that | |
7972 | we are in a legitimate method context, we must set oldcname | |
a9aedbc2 MS |
7973 | explicitly (since current_class_name is not yet alive). |
7974 | ||
7975 | We also want to avoid calling this a PARM if it is in a namespace. */ | |
8d08fdba | 7976 | |
9188c363 | 7977 | if (decl_context == NORMAL && !toplevel_bindings_p ()) |
a9aedbc2 | 7978 | { |
e2500fed | 7979 | struct cp_binding_level *b = current_binding_level; |
ff955512 | 7980 | current_binding_level = b->level_chain; |
a9aedbc2 MS |
7981 | if (current_binding_level != 0 && toplevel_bindings_p ()) |
7982 | decl_context = PARM; | |
ff955512 | 7983 | current_binding_level = b; |
a9aedbc2 | 7984 | } |
8d08fdba | 7985 | |
34fc957d NS |
7986 | if (name == NULL) |
7987 | name = decl_context == PARM ? "parameter" : "type name"; | |
68642fb6 | 7988 | |
62d1db17 MM |
7989 | /* If there were multiple types specified in the decl-specifier-seq, |
7990 | issue an error message. */ | |
7991 | if (declspecs->multiple_types_p) | |
32273f9f LM |
7992 | { |
7993 | error ("two or more data types in declaration of %qs", name); | |
7994 | return error_mark_node; | |
7995 | } | |
7996 | ||
9b70c6b0 PC |
7997 | if (declspecs->conflicting_specifiers_p) |
7998 | { | |
7999 | error ("conflicting specifiers in declaration of %qs", name); | |
8000 | return error_mark_node; | |
8001 | } | |
8002 | ||
62d1db17 MM |
8003 | /* Extract the basic type from the decl-specifier-seq. */ |
8004 | type = declspecs->type; | |
8005 | if (type == error_mark_node) | |
2cfe82fe ZW |
8006 | { |
8007 | type = NULL_TREE; | |
8008 | type_was_error_mark_node = true; | |
8009 | } | |
62d1db17 MM |
8010 | /* If the entire declaration is itself tagged as deprecated then |
8011 | suppress reports of deprecated items. */ | |
8012 | if (type && TREE_DEPRECATED (type) | |
8013 | && deprecated_state != DEPRECATED_SUPPRESS) | |
9b86d6bb | 8014 | warn_deprecated_use (type, NULL_TREE); |
62d1db17 | 8015 | if (type && TREE_CODE (type) == TYPE_DECL) |
8d08fdba | 8016 | { |
62d1db17 MM |
8017 | typedef_decl = type; |
8018 | type = TREE_TYPE (typedef_decl); | |
823dd937 JM |
8019 | if (TREE_DEPRECATED (type) |
8020 | && DECL_ARTIFICIAL (typedef_decl) | |
8021 | && deprecated_state != DEPRECATED_SUPPRESS) | |
9b86d6bb | 8022 | warn_deprecated_use (type, NULL_TREE); |
62d1db17 MM |
8023 | } |
8024 | /* No type at all: default to `int', and set DEFAULTED_INT | |
8025 | because it was not a user-defined typedef. */ | |
1ff3c076 | 8026 | if (type == NULL_TREE && (signed_p || unsigned_p || long_p || short_p)) |
62d1db17 MM |
8027 | { |
8028 | /* These imply 'int'. */ | |
8029 | type = integer_type_node; | |
8030 | defaulted_int = 1; | |
8031 | } | |
8032 | /* Gather flags. */ | |
8033 | explicit_int = declspecs->explicit_int_p; | |
8034 | explicit_char = declspecs->explicit_char_p; | |
7a1f3f5f | 8035 | |
8d6e459d NS |
8036 | #if 0 |
8037 | /* See the code below that used this. */ | |
8038 | if (typedef_decl) | |
8039 | decl_attr = DECL_ATTRIBUTES (typedef_decl); | |
8040 | #endif | |
8d08fdba MS |
8041 | typedef_type = type; |
8042 | ||
a3203465 | 8043 | |
44d10c10 PB |
8044 | if (sfk != sfk_conversion) |
8045 | ctor_return_type = ctype; | |
8046 | ||
3dbc07b6 MM |
8047 | if (sfk != sfk_none) |
8048 | type = check_special_function_return_type (sfk, type, | |
3dbc07b6 MM |
8049 | ctor_return_type); |
8050 | else if (type == NULL_TREE) | |
8d08fdba | 8051 | { |
3dbc07b6 MM |
8052 | int is_main; |
8053 | ||
8d08fdba | 8054 | explicit_int = -1; |
3dbc07b6 | 8055 | |
0fd0b7ee JM |
8056 | /* We handle `main' specially here, because 'main () { }' is so |
8057 | common. With no options, it is allowed. With -Wreturn-type, | |
8058 | it is a warning. It is only an error with -pedantic-errors. */ | |
3dbc07b6 | 8059 | is_main = (funcdef_flag |
7437519c | 8060 | && dname && MAIN_NAME_P (dname) |
3dbc07b6 MM |
8061 | && ctype == NULL_TREE |
8062 | && in_namespace == NULL_TREE | |
8063 | && current_namespace == global_namespace); | |
8064 | ||
2cfe82fe ZW |
8065 | if (type_was_error_mark_node) |
8066 | /* We've already issued an error, don't complain more. */; | |
8067 | else if (in_system_header || flag_ms_extensions) | |
3dbc07b6 | 8068 | /* Allow it, sigh. */; |
37ec60ed | 8069 | else if (! is_main) |
cbe5f3b3 | 8070 | permerror (input_location, "ISO C++ forbids declaration of %qs with no type", name); |
37ec60ed | 8071 | else if (pedantic) |
509c9d60 | 8072 | pedwarn (input_location, OPT_pedantic, |
fcf73884 | 8073 | "ISO C++ forbids declaration of %qs with no type", name); |
b10fc6f5 GDR |
8074 | else |
8075 | warning (OPT_Wreturn_type, | |
8076 | "ISO C++ forbids declaration of %qs with no type", name); | |
41eff652 | 8077 | |
3dbc07b6 | 8078 | type = integer_type_node; |
51c184be | 8079 | } |
caf93cb0 | 8080 | |
8d08fdba MS |
8081 | ctype = NULL_TREE; |
8082 | ||
8083 | /* Now process the modifiers that were specified | |
8084 | and check for invalid combinations. */ | |
8085 | ||
8086 | /* Long double is a special combination. */ | |
3cc189f5 | 8087 | if (long_p && !longlong && TYPE_MAIN_VARIANT (type) == double_type_node) |
8d08fdba | 8088 | { |
1ff3c076 | 8089 | long_p = false; |
a3360e77 JM |
8090 | type = cp_build_qualified_type (long_double_type_node, |
8091 | cp_type_quals (type)); | |
8d08fdba MS |
8092 | } |
8093 | ||
8094 | /* Check all other uses of type modifiers. */ | |
8095 | ||
1ff3c076 | 8096 | if (unsigned_p || signed_p || long_p || short_p) |
8d08fdba MS |
8097 | { |
8098 | int ok = 0; | |
8099 | ||
3cc189f5 VR |
8100 | if ((signed_p || unsigned_p) && TREE_CODE (type) != INTEGER_TYPE) |
8101 | error ("%<signed%> or %<unsigned%> invalid for %qs", name); | |
1ff3c076 | 8102 | else if (signed_p && unsigned_p) |
3cc189f5 VR |
8103 | error ("%<signed%> and %<unsigned%> specified together for %qs", name); |
8104 | else if (longlong && TREE_CODE (type) != INTEGER_TYPE) | |
8105 | error ("%<long long%> invalid for %qs", name); | |
a6766312 KT |
8106 | else if (explicit_int128 && TREE_CODE (type) != INTEGER_TYPE) |
8107 | error ("%<__int128%> invalid for %qs", name); | |
3cc189f5 VR |
8108 | else if (long_p && TREE_CODE (type) == REAL_TYPE) |
8109 | error ("%<long%> invalid for %qs", name); | |
8110 | else if (short_p && TREE_CODE (type) == REAL_TYPE) | |
8111 | error ("%<short%> invalid for %qs", name); | |
5d48268f VR |
8112 | else if ((long_p || short_p) && TREE_CODE (type) != INTEGER_TYPE) |
8113 | error ("%<long%> or %<short%> invalid for %qs", name); | |
a6766312 KT |
8114 | else if ((long_p || short_p || explicit_char || explicit_int) && explicit_int128) |
8115 | error ("%<long%>, %<int%>, %<short%>, or %<char%> invalid for %qs", name); | |
3cc189f5 VR |
8116 | else if ((long_p || short_p) && explicit_char) |
8117 | error ("%<long%> or %<short%> specified with char for %qs", name); | |
8118 | else if (long_p && short_p) | |
8119 | error ("%<long%> and %<short%> specified together for %qs", name); | |
b6baa67d KVH |
8120 | else if (type == char16_type_node || type == char32_type_node) |
8121 | { | |
8122 | if (signed_p || unsigned_p) | |
8123 | error ("%<signed%> or %<unsigned%> invalid for %qs", name); | |
8124 | else if (short_p || long_p) | |
8125 | error ("%<short%> or %<long%> invalid for %qs", name); | |
8126 | } | |
8d08fdba MS |
8127 | else |
8128 | { | |
8129 | ok = 1; | |
a6766312 | 8130 | if (!explicit_int && !defaulted_int && !explicit_char && !explicit_int128 && pedantic) |
8d08fdba | 8131 | { |
509c9d60 | 8132 | pedwarn (input_location, OPT_pedantic, |
fcf73884 | 8133 | "long, short, signed or unsigned used invalidly for %qs", |
8d08fdba MS |
8134 | name); |
8135 | if (flag_pedantic_errors) | |
8136 | ok = 0; | |
8137 | } | |
a6766312 KT |
8138 | if (explicit_int128) |
8139 | { | |
8140 | if (int128_integer_type_node == NULL_TREE) | |
8141 | { | |
8142 | error ("%<__int128%> is not supported by this target"); | |
8143 | ok = 0; | |
8144 | } | |
8145 | else if (pedantic) | |
8146 | { | |
8147 | pedwarn (input_location, OPT_pedantic, | |
8148 | "ISO C++ does not support %<__int128%> for %qs", | |
8149 | name); | |
8150 | if (flag_pedantic_errors) | |
8151 | ok = 0; | |
8152 | } | |
8153 | } | |
8d08fdba MS |
8154 | } |
8155 | ||
8156 | /* Discard the type modifiers if they are invalid. */ | |
8157 | if (! ok) | |
8158 | { | |
1ff3c076 MM |
8159 | unsigned_p = false; |
8160 | signed_p = false; | |
8161 | long_p = false; | |
8162 | short_p = false; | |
8d08fdba | 8163 | longlong = 0; |
a6766312 | 8164 | explicit_int128 = false; |
8d08fdba MS |
8165 | } |
8166 | } | |
8167 | ||
8168 | /* Decide whether an integer type is signed or not. | |
8169 | Optionally treat bitfields as signed by default. */ | |
1ff3c076 | 8170 | if (unsigned_p |
b89c5a7b MM |
8171 | /* [class.bit] |
8172 | ||
8173 | It is implementation-defined whether a plain (neither | |
8174 | explicitly signed or unsigned) char, short, int, or long | |
8175 | bit-field is signed or unsigned. | |
68642fb6 | 8176 | |
b89c5a7b MM |
8177 | Naturally, we extend this to long long as well. Note that |
8178 | this does not include wchar_t. */ | |
8179 | || (bitfield && !flag_signed_bitfields | |
1ff3c076 | 8180 | && !signed_p |
b89c5a7b MM |
8181 | /* A typedef for plain `int' without `signed' can be |
8182 | controlled just like plain `int', but a typedef for | |
8183 | `signed int' cannot be so controlled. */ | |
68642fb6 | 8184 | && !(typedef_decl |
29bbeb1c | 8185 | && C_TYPEDEF_EXPLICITLY_SIGNED (typedef_decl)) |
b38a05d0 | 8186 | && TREE_CODE (type) == INTEGER_TYPE |
29bbeb1c | 8187 | && !same_type_p (TYPE_MAIN_VARIANT (type), wchar_type_node))) |
8d08fdba | 8188 | { |
a6766312 KT |
8189 | if (explicit_int128) |
8190 | type = int128_unsigned_type_node; | |
8191 | else if (longlong) | |
8d08fdba | 8192 | type = long_long_unsigned_type_node; |
1ff3c076 | 8193 | else if (long_p) |
8d08fdba | 8194 | type = long_unsigned_type_node; |
1ff3c076 | 8195 | else if (short_p) |
8d08fdba MS |
8196 | type = short_unsigned_type_node; |
8197 | else if (type == char_type_node) | |
8198 | type = unsigned_char_type_node; | |
8199 | else if (typedef_decl) | |
ca5ba2a3 | 8200 | type = unsigned_type_for (type); |
8d08fdba MS |
8201 | else |
8202 | type = unsigned_type_node; | |
8203 | } | |
1ff3c076 | 8204 | else if (signed_p && type == char_type_node) |
8d08fdba | 8205 | type = signed_char_type_node; |
a6766312 KT |
8206 | else if (explicit_int128) |
8207 | type = int128_integer_type_node; | |
8d08fdba MS |
8208 | else if (longlong) |
8209 | type = long_long_integer_type_node; | |
1ff3c076 | 8210 | else if (long_p) |
8d08fdba | 8211 | type = long_integer_type_node; |
1ff3c076 | 8212 | else if (short_p) |
8d08fdba MS |
8213 | type = short_integer_type_node; |
8214 | ||
62d1db17 | 8215 | if (declspecs->specs[(int)ds_complex]) |
37c46b43 | 8216 | { |
1ff3c076 | 8217 | if (TREE_CODE (type) != INTEGER_TYPE && TREE_CODE (type) != REAL_TYPE) |
2d01edd7 | 8218 | error ("complex invalid for %qs", name); |
37c46b43 MS |
8219 | /* If we just have "complex", it is equivalent to |
8220 | "complex double", but if any modifiers at all are specified it is | |
8221 | the complex form of TYPE. E.g, "complex short" is | |
8222 | "complex short int". */ | |
a6766312 | 8223 | else if (defaulted_int && ! longlong && ! explicit_int128 |
1ff3c076 | 8224 | && ! (long_p || short_p || signed_p || unsigned_p)) |
37c46b43 MS |
8225 | type = complex_double_type_node; |
8226 | else if (type == integer_type_node) | |
8227 | type = complex_integer_type_node; | |
8228 | else if (type == float_type_node) | |
8229 | type = complex_float_type_node; | |
8230 | else if (type == double_type_node) | |
8231 | type = complex_double_type_node; | |
8232 | else if (type == long_double_type_node) | |
8233 | type = complex_long_double_type_node; | |
8234 | else | |
8235 | type = build_complex_type (type); | |
8236 | } | |
8237 | ||
4f2b0fb2 | 8238 | type_quals = TYPE_UNQUALIFIED; |
62d1db17 | 8239 | if (declspecs->specs[(int)ds_const]) |
4f2b0fb2 | 8240 | type_quals |= TYPE_QUAL_CONST; |
7ecbca9d GDR |
8241 | /* A `constexpr' specifier used in an object declaration declares |
8242 | the object as `const'. */ | |
8243 | if (constexpr_p) | |
8244 | { | |
8245 | if (innermost_code == cdk_function) | |
8246 | ; | |
8247 | else if (declspecs->specs[(int)ds_const] != 0) | |
8248 | error ("both %<const%> and %<constexpr%> cannot be used here"); | |
8249 | else | |
8250 | type_quals |= TYPE_QUAL_CONST; | |
8251 | } | |
62d1db17 | 8252 | if (declspecs->specs[(int)ds_volatile]) |
4f2b0fb2 | 8253 | type_quals |= TYPE_QUAL_VOLATILE; |
62d1db17 | 8254 | if (declspecs->specs[(int)ds_restrict]) |
4f2b0fb2 NS |
8255 | type_quals |= TYPE_QUAL_RESTRICT; |
8256 | if (sfk == sfk_conversion && type_quals != TYPE_UNQUALIFIED) | |
2d01edd7 | 8257 | error ("qualifiers are not allowed on declaration of %<operator %T%>", |
0cbd7506 | 8258 | ctor_return_type); |
3ac3d9ea | 8259 | |
4f2b0fb2 NS |
8260 | type_quals |= cp_type_quals (type); |
8261 | type = cp_build_qualified_type_real | |
8262 | (type, type_quals, ((typedef_decl && !DECL_ARTIFICIAL (typedef_decl) | |
23fca1f5 | 8263 | ? tf_ignore_bad_quals : 0) | tf_warning_or_error)); |
4f2b0fb2 NS |
8264 | /* We might have ignored or rejected some of the qualifiers. */ |
8265 | type_quals = cp_type_quals (type); | |
caf93cb0 | 8266 | |
8d08fdba | 8267 | staticp = 0; |
62d1db17 MM |
8268 | inlinep = !! declspecs->specs[(int)ds_inline]; |
8269 | virtualp = !! declspecs->specs[(int)ds_virtual]; | |
8270 | explicitp = !! declspecs->specs[(int)ds_explicit]; | |
8d08fdba | 8271 | |
1ff3c076 MM |
8272 | storage_class = declspecs->storage_class; |
8273 | if (storage_class == sc_static) | |
8d08fdba MS |
8274 | staticp = 1 + (decl_context == FIELD); |
8275 | ||
8276 | if (virtualp && staticp == 2) | |
8277 | { | |
2d01edd7 | 8278 | error ("member %qD cannot be declared both virtual and static", dname); |
7e1e0765 | 8279 | storage_class = sc_none; |
8d08fdba MS |
8280 | staticp = 0; |
8281 | } | |
62d1db17 | 8282 | friendp = !! declspecs->specs[(int)ds_friend]; |
8d08fdba | 8283 | |
d1c78882 | 8284 | if (dependent_name && !friendp) |
d5614afb | 8285 | { |
d1c78882 | 8286 | error ("%<%T::%D%> is not a valid declarator", ctype, dependent_name); |
13dbe691 | 8287 | return error_mark_node; |
d5614afb | 8288 | } |
8d08fdba | 8289 | |
62d1db17 MM |
8290 | /* Issue errors about use of storage classes for parameters. */ |
8291 | if (decl_context == PARM) | |
8d08fdba | 8292 | { |
62d1db17 | 8293 | if (declspecs->specs[(int)ds_typedef]) |
709f9dcf VR |
8294 | { |
8295 | error ("typedef declaration invalid in parameter declaration"); | |
8296 | return error_mark_node; | |
8297 | } | |
0229b692 PC |
8298 | else if (template_parm_flag && storage_class != sc_none) |
8299 | { | |
8300 | error ("storage class specified for template parameter %qs", name); | |
8301 | return error_mark_node; | |
8302 | } | |
1ff3c076 MM |
8303 | else if (storage_class == sc_static |
8304 | || storage_class == sc_extern | |
8305 | || thread_p) | |
8251199e | 8306 | error ("storage class specifiers invalid in parameter declarations"); |
3f50c846 JM |
8307 | |
8308 | if (type_uses_auto (type)) | |
8309 | { | |
8310 | error ("parameter declared %<auto%>"); | |
8311 | type = error_mark_node; | |
8312 | } | |
7ecbca9d GDR |
8313 | |
8314 | /* Function parameters cannot be constexpr. If we saw one, moan | |
8315 | and pretend it wasn't there. */ | |
8316 | if (constexpr_p) | |
8317 | { | |
8318 | error ("a parameter cannot be declared %<constexpr%>"); | |
8319 | constexpr_p = 0; | |
8320 | } | |
8d08fdba MS |
8321 | } |
8322 | ||
8323 | /* Give error if `virtual' is used outside of class declaration. */ | |
b7484fbe MS |
8324 | if (virtualp |
8325 | && (current_class_name == NULL_TREE || decl_context != FIELD)) | |
8d08fdba | 8326 | { |
bcac2b89 | 8327 | error ("%<virtual%> outside class declaration"); |
8d08fdba MS |
8328 | virtualp = 0; |
8329 | } | |
8d08fdba MS |
8330 | |
8331 | /* Static anonymous unions are dealt with here. */ | |
8332 | if (staticp && decl_context == TYPENAME | |
62d1db17 MM |
8333 | && declspecs->type |
8334 | && ANON_AGGR_TYPE_P (declspecs->type)) | |
8d08fdba MS |
8335 | decl_context = FIELD; |
8336 | ||
8d08fdba MS |
8337 | /* Warn about storage classes that are invalid for certain |
8338 | kinds of declarations (parameters, typenames, etc.). */ | |
3e66d096 JJ |
8339 | if (thread_p |
8340 | && ((storage_class | |
8341 | && storage_class != sc_extern | |
8342 | && storage_class != sc_static) | |
8343 | || declspecs->specs[(int)ds_typedef])) | |
8344 | { | |
8345 | error ("multiple storage classes in declaration of %qs", name); | |
8346 | thread_p = false; | |
8347 | } | |
9b70c6b0 PC |
8348 | if (decl_context != NORMAL |
8349 | && ((storage_class != sc_none | |
8350 | && storage_class != sc_mutable) | |
8351 | || thread_p)) | |
8d08fdba | 8352 | { |
db5ae43f | 8353 | if ((decl_context == PARM || decl_context == CATCHPARM) |
1ff3c076 MM |
8354 | && (storage_class == sc_register |
8355 | || storage_class == sc_auto)) | |
8d08fdba | 8356 | ; |
62d1db17 | 8357 | else if (declspecs->specs[(int)ds_typedef]) |
fc378698 | 8358 | ; |
8d08fdba | 8359 | else if (decl_context == FIELD |
f4f206f4 | 8360 | /* C++ allows static class elements. */ |
1ff3c076 | 8361 | && storage_class == sc_static) |
d363e7bf AJ |
8362 | /* C++ also allows inlines and signed and unsigned elements, |
8363 | but in those cases we don't come in here. */ | |
8d08fdba MS |
8364 | ; |
8365 | else | |
8366 | { | |
8367 | if (decl_context == FIELD) | |
389c6c8b | 8368 | error ("storage class specified for %qs", name); |
8d08fdba | 8369 | else |
b9d12519 KG |
8370 | { |
8371 | if (decl_context == PARM || decl_context == CATCHPARM) | |
2d01edd7 | 8372 | error ("storage class specified for parameter %qs", name); |
b9d12519 KG |
8373 | else |
8374 | error ("storage class specified for typename"); | |
8375 | } | |
1ff3c076 MM |
8376 | if (storage_class == sc_register |
8377 | || storage_class == sc_auto | |
8378 | || storage_class == sc_extern | |
8379 | || thread_p) | |
8380 | storage_class = sc_none; | |
8d08fdba MS |
8381 | } |
8382 | } | |
1ff3c076 | 8383 | else if (storage_class == sc_extern && funcdef_flag |
a9aedbc2 | 8384 | && ! toplevel_bindings_p ()) |
2d01edd7 | 8385 | error ("nested function %qs declared %<extern%>", name); |
a9aedbc2 | 8386 | else if (toplevel_bindings_p ()) |
8d08fdba | 8387 | { |
1ff3c076 | 8388 | if (storage_class == sc_auto) |
2d01edd7 | 8389 | error ("top-level declaration of %qs specifies %<auto%>", name); |
8d08fdba | 8390 | } |
1ff3c076 MM |
8391 | else if (thread_p |
8392 | && storage_class != sc_extern | |
8393 | && storage_class != sc_static) | |
7a1f3f5f | 8394 | { |
2d01edd7 | 8395 | error ("function-scope %qs implicitly auto and declared %<__thread%>", |
7a1f3f5f | 8396 | name); |
1ff3c076 | 8397 | thread_p = false; |
7a1f3f5f | 8398 | } |
8d08fdba | 8399 | |
1ff3c076 | 8400 | if (storage_class && friendp) |
ff7437d0 SM |
8401 | { |
8402 | error ("storage class specifiers invalid in friend function declarations"); | |
8403 | storage_class = sc_none; | |
8404 | staticp = 0; | |
8405 | } | |
909e536a | 8406 | |
058b15c1 MM |
8407 | if (!id_declarator) |
8408 | unqualified_id = NULL_TREE; | |
8409 | else | |
8d08fdba | 8410 | { |
1d786913 | 8411 | unqualified_id = id_declarator->u.id.unqualified_name; |
058b15c1 | 8412 | switch (TREE_CODE (unqualified_id)) |
8d08fdba | 8413 | { |
058b15c1 | 8414 | case BIT_NOT_EXPR: |
bd967b22 JM |
8415 | unqualified_id = TREE_OPERAND (unqualified_id, 0); |
8416 | if (TYPE_P (unqualified_id)) | |
8417 | unqualified_id = constructor_name (unqualified_id); | |
058b15c1 | 8418 | break; |
caf93cb0 | 8419 | |
058b15c1 MM |
8420 | case IDENTIFIER_NODE: |
8421 | case TEMPLATE_ID_EXPR: | |
52fbc847 | 8422 | break; |
caf93cb0 | 8423 | |
058b15c1 | 8424 | default: |
8dc2b103 | 8425 | gcc_unreachable (); |
058b15c1 MM |
8426 | } |
8427 | } | |
52fbc847 | 8428 | |
058b15c1 MM |
8429 | /* Determine the type of the entity declared by recurring on the |
8430 | declarator. */ | |
f4f18103 | 8431 | for (; declarator; declarator = declarator->declarator) |
058b15c1 MM |
8432 | { |
8433 | const cp_declarator *inner_declarator; | |
8434 | tree attrs; | |
8d08fdba | 8435 | |
058b15c1 MM |
8436 | if (type == error_mark_node) |
8437 | return error_mark_node; | |
c1b177ec | 8438 | |
058b15c1 MM |
8439 | attrs = declarator->attributes; |
8440 | if (attrs) | |
8441 | { | |
8442 | int attr_flags; | |
caf93cb0 | 8443 | |
058b15c1 MM |
8444 | attr_flags = 0; |
8445 | if (declarator == NULL || declarator->kind == cdk_id) | |
8446 | attr_flags |= (int) ATTR_FLAG_DECL_NEXT; | |
8447 | if (declarator->kind == cdk_function) | |
8448 | attr_flags |= (int) ATTR_FLAG_FUNCTION_NEXT; | |
8449 | if (declarator->kind == cdk_array) | |
8450 | attr_flags |= (int) ATTR_FLAG_ARRAY_NEXT; | |
8451 | returned_attrs = decl_attributes (&type, | |
8452 | chainon (returned_attrs, attrs), | |
8453 | attr_flags); | |
8454 | } | |
8455 | ||
f4f18103 MM |
8456 | if (declarator->kind == cdk_id) |
8457 | break; | |
8458 | ||
8459 | inner_declarator = declarator->declarator; | |
8460 | ||
058b15c1 MM |
8461 | switch (declarator->kind) |
8462 | { | |
8463 | case cdk_array: | |
caf93cb0 | 8464 | type = create_array_type_for_decl (dname, type, |
058b15c1 | 8465 | declarator->u.array.bounds); |
8d08fdba MS |
8466 | break; |
8467 | ||
058b15c1 | 8468 | case cdk_function: |
8d08fdba MS |
8469 | { |
8470 | tree arg_types; | |
f376e137 | 8471 | int funcdecl_p; |
8d08fdba MS |
8472 | |
8473 | /* Declaring a function type. | |
8474 | Make sure we have a valid type for the function to return. */ | |
8d08fdba | 8475 | |
1891dec4 DM |
8476 | if (type_quals != TYPE_UNQUALIFIED) |
8477 | { | |
8478 | if (SCALAR_TYPE_P (type) || VOID_TYPE_P (type)) | |
5db2e9ca | 8479 | warning (OPT_Wignored_qualifiers, |
1891dec4 DM |
8480 | "type qualifiers ignored on function return type"); |
8481 | /* We now know that the TYPE_QUALS don't apply to the | |
8482 | decl, but to its return type. */ | |
8483 | type_quals = TYPE_UNQUALIFIED; | |
1891dec4 | 8484 | } |
40449a90 SL |
8485 | errmsg = targetm.invalid_return_type (type); |
8486 | if (errmsg) | |
8487 | { | |
8488 | error (errmsg); | |
8489 | type = integer_type_node; | |
8490 | } | |
8d08fdba | 8491 | |
e3276457 | 8492 | /* Error about some types functions can't return. */ |
8d08fdba MS |
8493 | |
8494 | if (TREE_CODE (type) == FUNCTION_TYPE) | |
8495 | { | |
2d01edd7 | 8496 | error ("%qs declared as function returning a function", name); |
e3276457 | 8497 | return error_mark_node; |
8d08fdba MS |
8498 | } |
8499 | if (TREE_CODE (type) == ARRAY_TYPE) | |
8500 | { | |
2d01edd7 | 8501 | error ("%qs declared as function returning an array", name); |
e3276457 | 8502 | return error_mark_node; |
8d08fdba MS |
8503 | } |
8504 | ||
b7484fbe | 8505 | /* Pick up type qualifiers which should be applied to `this'. */ |
e2537f2c | 8506 | memfn_quals = declarator->u.function.qualifiers; |
b7484fbe | 8507 | |
c11b6f21 | 8508 | /* Pick up the exception specifications. */ |
058b15c1 | 8509 | raises = declarator->u.function.exception_specification; |
c11b6f21 | 8510 | |
4f48b9c1 JJ |
8511 | /* Say it's a definition only for the CALL_EXPR |
8512 | closest to the identifier. */ | |
8513 | funcdecl_p = inner_declarator && inner_declarator->kind == cdk_id; | |
8514 | ||
f57ca1ea | 8515 | /* Handle a late-specified return type. */ |
4f48b9c1 JJ |
8516 | if (funcdecl_p) |
8517 | { | |
8518 | if (type_uses_auto (type)) | |
8519 | { | |
64e12c68 | 8520 | if (!declarator->u.function.late_return_type) |
4f48b9c1 | 8521 | { |
3f50c846 | 8522 | error ("%qs function uses %<auto%> type specifier without" |
4f48b9c1 JJ |
8523 | " late return type", name); |
8524 | return error_mark_node; | |
8525 | } | |
8526 | else if (!is_auto (type)) | |
8527 | { | |
3f50c846 JM |
8528 | error ("%qs function with late return type has" |
8529 | " %qT as its type rather than plain %<auto%>", | |
8530 | name, type); | |
4f48b9c1 JJ |
8531 | return error_mark_node; |
8532 | } | |
8533 | } | |
8534 | else if (declarator->u.function.late_return_type) | |
8535 | { | |
8536 | error ("%qs function with late return type not declared" | |
3f50c846 | 8537 | " with %<auto%> type specifier", name); |
4f48b9c1 JJ |
8538 | return error_mark_node; |
8539 | } | |
8540 | } | |
f57ca1ea JM |
8541 | type = splice_late_return_type |
8542 | (type, declarator->u.function.late_return_type); | |
8543 | if (type == error_mark_node) | |
8544 | return error_mark_node; | |
8545 | ||
8d08fdba MS |
8546 | if (ctype == NULL_TREE |
8547 | && decl_context == FIELD | |
f376e137 | 8548 | && funcdecl_p |
8d08fdba MS |
8549 | && (friendp == 0 || dname == current_class_name)) |
8550 | ctype = current_class_type; | |
8551 | ||
058b15c1 MM |
8552 | if (ctype && (sfk == sfk_constructor |
8553 | || sfk == sfk_destructor)) | |
8d08fdba MS |
8554 | { |
8555 | /* We are within a class's scope. If our declarator name | |
8556 | is the same as the class name, and we are defining | |
8557 | a function, then it is a constructor/destructor, and | |
8558 | therefore returns a void type. */ | |
3db45ab5 | 8559 | |
e2537f2c MM |
8560 | /* ISO C++ 12.4/2. A destructor may not be declared |
8561 | const or volatile. A destructor may not be | |
8562 | static. | |
3db45ab5 | 8563 | |
e2537f2c MM |
8564 | ISO C++ 12.1. A constructor may not be declared |
8565 | const or volatile. A constructor may not be | |
8566 | virtual. A constructor may not be static. */ | |
3db45ab5 | 8567 | if (staticp == 2) |
e2537f2c MM |
8568 | error ((flags == DTOR_FLAG) |
8569 | ? "destructor cannot be static member function" | |
8570 | : "constructor cannot be static member function"); | |
8571 | if (memfn_quals) | |
8d08fdba | 8572 | { |
e2537f2c MM |
8573 | error ((flags == DTOR_FLAG) |
8574 | ? "destructors may not be cv-qualified" | |
8575 | : "constructors may not be cv-qualified"); | |
8576 | memfn_quals = TYPE_UNQUALIFIED; | |
8d08fdba | 8577 | } |
e2537f2c MM |
8578 | |
8579 | if (decl_context == FIELD | |
8580 | && !member_function_or_else (ctype, | |
8581 | current_class_type, | |
8582 | flags)) | |
13dbe691 | 8583 | return error_mark_node; |
e2537f2c MM |
8584 | |
8585 | if (flags != DTOR_FLAG) | |
8d08fdba | 8586 | { |
e2537f2c | 8587 | /* It's a constructor. */ |
db5ae43f MS |
8588 | if (explicitp == 1) |
8589 | explicitp = 2; | |
8d08fdba MS |
8590 | if (virtualp) |
8591 | { | |
cbe5f3b3 | 8592 | permerror (input_location, "constructors cannot be declared virtual"); |
8d08fdba MS |
8593 | virtualp = 0; |
8594 | } | |
7137605e MM |
8595 | if (decl_context == FIELD |
8596 | && sfk != sfk_constructor) | |
13dbe691 | 8597 | return error_mark_node; |
8d08fdba MS |
8598 | } |
8599 | if (decl_context == FIELD) | |
8600 | staticp = 0; | |
8601 | } | |
b7484fbe | 8602 | else if (friendp) |
8d08fdba | 8603 | { |
b7484fbe | 8604 | if (initialized) |
2d01edd7 | 8605 | error ("can't initialize friend function %qs", name); |
b7484fbe MS |
8606 | if (virtualp) |
8607 | { | |
8608 | /* Cannot be both friend and virtual. */ | |
8251199e | 8609 | error ("virtual functions cannot be friends"); |
b7484fbe MS |
8610 | friendp = 0; |
8611 | } | |
28cbf42c | 8612 | if (decl_context == NORMAL) |
8251199e | 8613 | error ("friend declaration not in class definition"); |
28cbf42c | 8614 | if (current_function_decl && funcdef_flag) |
2d01edd7 | 8615 | error ("can't define friend function %qs in a local " |
0cbd7506 MS |
8616 | "class definition", |
8617 | name); | |
8d08fdba | 8618 | } |
e57d93c6 JM |
8619 | else if (ctype && sfk == sfk_conversion) |
8620 | { | |
8621 | if (explicitp == 1) | |
8622 | { | |
848f237b | 8623 | maybe_warn_cpp0x (CPP0X_EXPLICIT_CONVERSION); |
e57d93c6 JM |
8624 | explicitp = 2; |
8625 | } | |
8626 | } | |
8d08fdba | 8627 | |
7ecbca9d GDR |
8628 | /* It is not allowed to use `constexpr' in a function |
8629 | declaration that is not a definition. | |
8630 | That is too strict, though. */ | |
8631 | if (constexpr_p && !funcdef_flag) | |
8632 | { | |
8633 | error ("the %<constexpr%> specifier cannot be used in " | |
8634 | "a function declaration that is not a definition"); | |
8635 | constexpr_p = false; | |
8636 | } | |
8637 | ||
8638 | /* A constexpr non-static member function is implicitly const. */ | |
8639 | if (constexpr_p && decl_context == FIELD && staticp == 0 | |
8640 | && sfk != sfk_constructor && sfk != sfk_destructor) | |
8641 | memfn_quals |= TYPE_QUAL_CONST; | |
8642 | ||
caf93cb0 | 8643 | arg_types = grokparms (declarator->u.function.parameters, |
058b15c1 | 8644 | &parms); |
8d08fdba | 8645 | |
058b15c1 MM |
8646 | if (inner_declarator |
8647 | && inner_declarator->kind == cdk_id | |
8648 | && inner_declarator->u.id.sfk == sfk_destructor | |
8649 | && arg_types != void_list_node) | |
8d08fdba | 8650 | { |
058b15c1 MM |
8651 | error ("destructors may not have parameters"); |
8652 | arg_types = void_list_node; | |
8653 | parms = NULL_TREE; | |
8d08fdba | 8654 | } |
caf93cb0 | 8655 | |
d22c8596 | 8656 | type = build_function_type (type, arg_types); |
8d08fdba MS |
8657 | } |
8658 | break; | |
8659 | ||
058b15c1 MM |
8660 | case cdk_pointer: |
8661 | case cdk_reference: | |
8662 | case cdk_ptrmem: | |
8d08fdba MS |
8663 | /* Filter out pointers-to-references and references-to-references. |
8664 | We can get these if a TYPE_DECL is used. */ | |
8665 | ||
8666 | if (TREE_CODE (type) == REFERENCE_TYPE) | |
8667 | { | |
8af2fec4 RY |
8668 | if (declarator->kind != cdk_reference) |
8669 | { | |
8670 | error ("cannot declare pointer to %q#T", type); | |
8671 | type = TREE_TYPE (type); | |
8672 | } | |
8673 | ||
8674 | /* In C++0x, we allow reference to reference declarations | |
8675 | that occur indirectly through typedefs [7.1.3/8 dcl.typedef] | |
8676 | and template type arguments [14.3.1/4 temp.arg.type]. The | |
8677 | check for direct reference to reference declarations, which | |
8678 | are still forbidden, occurs below. Reasoning behind the change | |
8679 | can be found in DR106, DR540, and the rvalue reference | |
8680 | proposals. */ | |
c1ae8be5 | 8681 | else if (cxx_dialect == cxx98) |
8af2fec4 RY |
8682 | { |
8683 | error ("cannot declare reference to %q#T", type); | |
8684 | type = TREE_TYPE (type); | |
8685 | } | |
a5894242 | 8686 | } |
058b15c1 MM |
8687 | else if (VOID_TYPE_P (type)) |
8688 | { | |
8689 | if (declarator->kind == cdk_reference) | |
2d01edd7 | 8690 | error ("cannot declare reference to %q#T", type); |
058b15c1 | 8691 | else if (declarator->kind == cdk_ptrmem) |
2d01edd7 | 8692 | error ("cannot declare pointer to %q#T member", type); |
058b15c1 | 8693 | } |
61a127b3 | 8694 | |
91063b51 MM |
8695 | /* We now know that the TYPE_QUALS don't apply to the decl, |
8696 | but to the target of the pointer. */ | |
8697 | type_quals = TYPE_UNQUALIFIED; | |
8d08fdba | 8698 | |
058b15c1 | 8699 | if (declarator->kind == cdk_ptrmem |
1b021ff4 JJ |
8700 | && (TREE_CODE (type) == FUNCTION_TYPE |
8701 | || (memfn_quals && TREE_CODE (type) == METHOD_TYPE))) | |
058b15c1 | 8702 | { |
2872152c | 8703 | memfn_quals |= type_memfn_quals (type); |
3db45ab5 | 8704 | type = build_memfn_type (type, |
e2537f2c MM |
8705 | declarator->u.pointer.class_type, |
8706 | memfn_quals); | |
8707 | memfn_quals = TYPE_UNQUALIFIED; | |
058b15c1 MM |
8708 | } |
8709 | ||
0d9c0892 | 8710 | if (TREE_CODE (type) == FUNCTION_TYPE |
2872152c | 8711 | && type_memfn_quals (type) != TYPE_UNQUALIFIED) |
24ea727a SZ |
8712 | error (declarator->kind == cdk_reference |
8713 | ? G_("cannot declare reference to qualified function type %qT") | |
8714 | : G_("cannot declare pointer to qualified function type %qT"), | |
0d9c0892 JM |
8715 | type); |
8716 | ||
6ab4e49c JM |
8717 | /* When the pointed-to type involves components of variable size, |
8718 | care must be taken to ensure that the size evaluation code is | |
8719 | emitted early enough to dominate all the possible later uses | |
8720 | and late enough for the variables on which it depends to have | |
8721 | been assigned. | |
8722 | ||
8723 | This is expected to happen automatically when the pointed-to | |
8724 | type has a name/declaration of it's own, but special attention | |
8725 | is required if the type is anonymous. | |
8726 | ||
8727 | We handle the NORMAL and FIELD contexts here by inserting a | |
8728 | dummy statement that just evaluates the size at a safe point | |
8729 | and ensures it is not deferred until e.g. within a deeper | |
8730 | conditional context (c++/43555). | |
8731 | ||
8732 | We expect nothing to be needed here for PARM or TYPENAME. | |
8733 | Evaluating the size at this point for TYPENAME would | |
8734 | actually be incorrect, as we might be in the middle of an | |
8735 | expression with side effects on the pointed-to type size | |
8736 | "arguments" prior to the pointer declaration point and the | |
8737 | size evaluation could end up prior to the side effects. */ | |
8738 | ||
8739 | if (!TYPE_NAME (type) | |
8740 | && (decl_context == NORMAL || decl_context == FIELD) | |
8741 | && at_function_scope_p () | |
8742 | && variably_modified_type_p (type, NULL_TREE)) | |
8743 | finish_expr_stmt (TYPE_SIZE (type)); | |
8744 | ||
058b15c1 | 8745 | if (declarator->kind == cdk_reference) |
8d08fdba | 8746 | { |
8af2fec4 RY |
8747 | /* In C++0x, the type we are creating a reference to might be |
8748 | a typedef which is itself a reference type. In that case, | |
8749 | we follow the reference collapsing rules in | |
8750 | [7.1.3/8 dcl.typedef] to create the final reference type: | |
8751 | ||
8752 | "If a typedef TD names a type that is a reference to a type | |
8753 | T, an attempt to create the type 'lvalue reference to cv TD' | |
8754 | creates the type 'lvalue reference to T,' while an attempt | |
8755 | to create the type "rvalue reference to cv TD' creates the | |
8756 | type TD." | |
8757 | */ | |
dd29188b | 8758 | if (!VOID_TYPE_P (type)) |
8af2fec4 RY |
8759 | type = cp_build_reference_type |
8760 | ((TREE_CODE (type) == REFERENCE_TYPE | |
8761 | ? TREE_TYPE (type) : type), | |
8762 | (declarator->u.reference.rvalue_ref | |
8763 | && (TREE_CODE(type) != REFERENCE_TYPE | |
8764 | || TYPE_REF_IS_RVALUE (type)))); | |
8765 | ||
8766 | /* In C++0x, we need this check for direct reference to | |
8767 | reference declarations, which are forbidden by | |
8768 | [8.3.2/5 dcl.ref]. Reference to reference declarations | |
8769 | are only allowed indirectly through typedefs and template | |
8770 | type arguments. Example: | |
8771 | ||
8772 | void foo(int & &); // invalid ref-to-ref decl | |
8773 | ||
8774 | typedef int & int_ref; | |
8775 | void foo(int_ref &); // valid ref-to-ref decl | |
8776 | */ | |
8777 | if (inner_declarator && inner_declarator->kind == cdk_reference) | |
8778 | error ("cannot declare reference to %q#T, which is not " | |
8779 | "a typedef or a template type argument", type); | |
8d08fdba MS |
8780 | } |
8781 | else if (TREE_CODE (type) == METHOD_TYPE) | |
d8f8dca1 | 8782 | type = build_ptrmemfunc_type (build_pointer_type (type)); |
058b15c1 | 8783 | else if (declarator->kind == cdk_ptrmem) |
f4ed7d21 | 8784 | { |
63c9a190 MM |
8785 | gcc_assert (TREE_CODE (declarator->u.pointer.class_type) |
8786 | != NAMESPACE_DECL); | |
8787 | if (declarator->u.pointer.class_type == error_mark_node) | |
4230cec2 NS |
8788 | /* We will already have complained. */ |
8789 | type = error_mark_node; | |
f4ed7d21 NS |
8790 | else |
8791 | type = build_ptrmem_type (declarator->u.pointer.class_type, | |
8792 | type); | |
8793 | } | |
8d08fdba MS |
8794 | else |
8795 | type = build_pointer_type (type); | |
8796 | ||
8797 | /* Process a list of type modifier keywords (such as | |
8798 | const or volatile) that were given inside the `*' or `&'. */ | |
8799 | ||
058b15c1 | 8800 | if (declarator->u.pointer.qualifiers) |
8d08fdba | 8801 | { |
caf93cb0 EC |
8802 | type |
8803 | = cp_build_qualified_type (type, | |
3c01e5df | 8804 | declarator->u.pointer.qualifiers); |
4f2b0fb2 | 8805 | type_quals = cp_type_quals (type); |
8d08fdba | 8806 | } |
8d08fdba MS |
8807 | ctype = NULL_TREE; |
8808 | break; | |
8809 | ||
058b15c1 MM |
8810 | case cdk_error: |
8811 | break; | |
8d08fdba | 8812 | |
058b15c1 | 8813 | default: |
8dc2b103 | 8814 | gcc_unreachable (); |
058b15c1 MM |
8815 | } |
8816 | } | |
caf93cb0 | 8817 | |
058b15c1 MM |
8818 | if (unqualified_id && TREE_CODE (unqualified_id) == TEMPLATE_ID_EXPR |
8819 | && TREE_CODE (type) != FUNCTION_TYPE | |
8820 | && TREE_CODE (type) != METHOD_TYPE) | |
8821 | { | |
2d01edd7 | 8822 | error ("template-id %qD used as a declarator", |
058b15c1 MM |
8823 | unqualified_id); |
8824 | unqualified_id = dname; | |
8825 | } | |
386b8a85 | 8826 | |
9c12301f MM |
8827 | /* If TYPE is a FUNCTION_TYPE, but the function name was explicitly |
8828 | qualified with a class-name, turn it into a METHOD_TYPE, unless | |
8829 | we know that the function is static. We take advantage of this | |
8830 | opportunity to do other processing that pertains to entities | |
8831 | explicitly declared to be class members. Note that if DECLARATOR | |
8832 | is non-NULL, we know it is a cdk_id declarator; otherwise, we | |
8833 | would not have exited the loop above. */ | |
caf93cb0 | 8834 | if (declarator |
1d786913 MM |
8835 | && declarator->u.id.qualifying_scope |
8836 | && TYPE_P (declarator->u.id.qualifying_scope)) | |
058b15c1 MM |
8837 | { |
8838 | tree t; | |
8d08fdba | 8839 | |
1d786913 MM |
8840 | ctype = declarator->u.id.qualifying_scope; |
8841 | ctype = TYPE_MAIN_VARIANT (ctype); | |
058b15c1 MM |
8842 | t = ctype; |
8843 | while (t != NULL_TREE && CLASS_TYPE_P (t)) | |
8844 | { | |
8845 | /* You're supposed to have one `template <...>' for every | |
8846 | template class, but you don't need one for a full | |
8847 | specialization. For example: | |
8d08fdba | 8848 | |
058b15c1 MM |
8849 | template <class T> struct S{}; |
8850 | template <> struct S<int> { void f(); }; | |
8851 | void S<int>::f () {} | |
28cbf42c | 8852 | |
058b15c1 MM |
8853 | is correct; there shouldn't be a `template <>' for the |
8854 | definition of `S<int>::f'. */ | |
f0d60e22 MM |
8855 | if (CLASSTYPE_TEMPLATE_SPECIALIZATION (t) |
8856 | && !any_dependent_template_arguments_p (CLASSTYPE_TI_ARGS (t))) | |
8857 | /* T is an explicit (not partial) specialization. All | |
8858 | containing classes must therefore also be explicitly | |
8859 | specialized. */ | |
8860 | break; | |
8861 | if ((CLASSTYPE_USE_TEMPLATE (t) || CLASSTYPE_IS_TEMPLATE (t)) | |
058b15c1 MM |
8862 | && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (t))) |
8863 | template_count += 1; | |
28cbf42c | 8864 | |
058b15c1 MM |
8865 | t = TYPE_MAIN_DECL (t); |
8866 | t = DECL_CONTEXT (t); | |
8867 | } | |
8d08fdba | 8868 | |
058b15c1 | 8869 | if (ctype == current_class_type) |
59e7c84c VR |
8870 | { |
8871 | if (friendp) | |
b46ce77f | 8872 | { |
cbe5f3b3 | 8873 | permerror (input_location, "member functions are implicitly friends of their class"); |
b46ce77f SM |
8874 | friendp = 0; |
8875 | } | |
59e7c84c | 8876 | else |
cbe5f3b3 | 8877 | permerror (declarator->id_loc, |
7e99f74b MLI |
8878 | "extra qualification %<%T::%> on member %qs", |
8879 | ctype, name); | |
59e7c84c | 8880 | } |
fa6098f8 MM |
8881 | else if (/* If the qualifying type is already complete, then we |
8882 | can skip the following checks. */ | |
8883 | !COMPLETE_TYPE_P (ctype) | |
cc328145 MM |
8884 | && (/* If the function is being defined, then |
8885 | qualifying type must certainly be complete. */ | |
3db45ab5 | 8886 | funcdef_flag |
cc328145 MM |
8887 | /* A friend declaration of "T::f" is OK, even if |
8888 | "T" is a template parameter. But, if this | |
8889 | function is not a friend, the qualifying type | |
8890 | must be a class. */ | |
8891 | || (!friendp && !CLASS_TYPE_P (ctype)) | |
8892 | /* For a declaration, the type need not be | |
8893 | complete, if either it is dependent (since there | |
8894 | is no meaningful definition of complete in that | |
8895 | case) or the qualifying class is currently being | |
8896 | defined. */ | |
fa6098f8 MM |
8897 | || !(dependent_type_p (ctype) |
8898 | || currently_open_class (ctype))) | |
9f9a713e | 8899 | /* Check that the qualifying type is complete. */ |
fa6098f8 MM |
8900 | && !complete_type_or_else (ctype, NULL_TREE)) |
8901 | return error_mark_node; | |
058b15c1 MM |
8902 | else if (TREE_CODE (type) == FUNCTION_TYPE) |
8903 | { | |
1d786913 | 8904 | tree sname = declarator->u.id.unqualified_name; |
50ad9642 | 8905 | |
357d956e MM |
8906 | if (current_class_type |
8907 | && (!friendp || funcdef_flag)) | |
8908 | { | |
8909 | error (funcdef_flag | |
8910 | ? "cannot define member function %<%T::%s%> within %<%T%>" | |
8911 | : "cannot declare member function %<%T::%s%> within %<%T%>", | |
8912 | ctype, name, current_class_type); | |
8913 | return error_mark_node; | |
8914 | } | |
8915 | ||
7ecbca9d GDR |
8916 | /* It is not permitted to define a member function outside ist |
8917 | membership class as `constexpr'. */ | |
8918 | if (constexpr_p) | |
8919 | error ("a constexpr function cannot be defined " | |
612e541c | 8920 | "outside of its class"); |
7ecbca9d | 8921 | |
058b15c1 MM |
8922 | if (TREE_CODE (sname) == IDENTIFIER_NODE |
8923 | && NEW_DELETE_OPNAME_P (sname)) | |
8924 | /* Overloaded operator new and operator delete | |
8925 | are always static functions. */ | |
8926 | ; | |
058b15c1 | 8927 | else |
e2537f2c | 8928 | type = build_memfn_type (type, ctype, memfn_quals); |
058b15c1 | 8929 | } |
62d1db17 | 8930 | else if (declspecs->specs[(int)ds_typedef] |
fa6098f8 | 8931 | && current_class_type) |
058b15c1 | 8932 | { |
fa6098f8 MM |
8933 | error ("cannot declare member %<%T::%s%> within %qT", |
8934 | ctype, name, current_class_type); | |
058b15c1 | 8935 | return error_mark_node; |
8d08fdba MS |
8936 | } |
8937 | } | |
8938 | ||
9c12301f MM |
8939 | /* Now TYPE has the actual type. */ |
8940 | ||
91d231cb | 8941 | if (returned_attrs) |
1eab9b56 | 8942 | { |
91d231cb JM |
8943 | if (attrlist) |
8944 | *attrlist = chainon (returned_attrs, *attrlist); | |
1eab9b56 | 8945 | else |
91d231cb | 8946 | attrlist = &returned_attrs; |
1eab9b56 JM |
8947 | } |
8948 | ||
5d80a306 DG |
8949 | /* Handle parameter packs. */ |
8950 | if (parameter_pack_p) | |
8951 | { | |
8952 | if (decl_context == PARM) | |
8953 | /* Turn the type into a pack expansion.*/ | |
8954 | type = make_pack_expansion (type); | |
8955 | else | |
8956 | error ("non-parameter %qs cannot be a parameter pack", name); | |
8957 | } | |
8958 | ||
55b3d665 JM |
8959 | /* Did array size calculations overflow? */ |
8960 | ||
8961 | if (TREE_CODE (type) == ARRAY_TYPE | |
8962 | && COMPLETE_TYPE_P (type) | |
96ce2ac9 JW |
8963 | && TREE_CODE (TYPE_SIZE_UNIT (type)) == INTEGER_CST |
8964 | && TREE_OVERFLOW (TYPE_SIZE_UNIT (type))) | |
55b3d665 | 8965 | { |
2d01edd7 | 8966 | error ("size of array %qs is too large", name); |
aba649ba | 8967 | /* If we proceed with the array type as it is, we'll eventually |
55b3d665 JM |
8968 | crash in tree_low_cst(). */ |
8969 | type = error_mark_node; | |
8970 | } | |
8971 | ||
2fff6d71 | 8972 | if ((decl_context == FIELD || decl_context == PARM) |
caf93cb0 | 8973 | && !processing_template_decl |
5377d5ba | 8974 | && variably_modified_type_p (type, NULL_TREE)) |
dac45b5c | 8975 | { |
2fff6d71 | 8976 | if (decl_context == FIELD) |
2d01edd7 | 8977 | error ("data member may not have variably modified type %qT", type); |
2fff6d71 | 8978 | else |
2d01edd7 | 8979 | error ("parameter may not have variably modified type %qT", type); |
dac45b5c MM |
8980 | type = error_mark_node; |
8981 | } | |
8982 | ||
34fc957d | 8983 | if (explicitp == 1 || (explicitp && friendp)) |
db5ae43f | 8984 | { |
34fc957d | 8985 | /* [dcl.fct.spec] The explicit specifier shall only be used in |
0cbd7506 | 8986 | declarations of constructors within a class definition. */ |
2d01edd7 | 8987 | error ("only declarations of constructors can be %<explicit%>"); |
db5ae43f MS |
8988 | explicitp = 0; |
8989 | } | |
8990 | ||
1ff3c076 | 8991 | if (storage_class == sc_mutable) |
f30432d7 | 8992 | { |
4223f82f | 8993 | if (decl_context != FIELD || friendp) |
0cbd7506 | 8994 | { |
2d01edd7 | 8995 | error ("non-member %qs cannot be declared %<mutable%>", name); |
1ff3c076 | 8996 | storage_class = sc_none; |
0cbd7506 | 8997 | } |
62d1db17 | 8998 | else if (decl_context == TYPENAME || declspecs->specs[(int)ds_typedef]) |
f30432d7 | 8999 | { |
2d01edd7 | 9000 | error ("non-object member %qs cannot be declared %<mutable%>", name); |
1ff3c076 | 9001 | storage_class = sc_none; |
f30432d7 | 9002 | } |
34fc957d | 9003 | else if (TREE_CODE (type) == FUNCTION_TYPE |
0cbd7506 MS |
9004 | || TREE_CODE (type) == METHOD_TYPE) |
9005 | { | |
2d01edd7 | 9006 | error ("function %qs cannot be declared %<mutable%>", name); |
1ff3c076 | 9007 | storage_class = sc_none; |
0cbd7506 | 9008 | } |
f30432d7 MS |
9009 | else if (staticp) |
9010 | { | |
2d01edd7 | 9011 | error ("static %qs cannot be declared %<mutable%>", name); |
1ff3c076 | 9012 | storage_class = sc_none; |
f30432d7 | 9013 | } |
34fc957d NS |
9014 | else if (type_quals & TYPE_QUAL_CONST) |
9015 | { | |
2d01edd7 | 9016 | error ("const %qs cannot be declared %<mutable%>", name); |
1ff3c076 | 9017 | storage_class = sc_none; |
34fc957d | 9018 | } |
f30432d7 MS |
9019 | } |
9020 | ||
419c6212 | 9021 | /* If this is declaring a typedef name, return a TYPE_DECL. */ |
62d1db17 | 9022 | if (declspecs->specs[(int)ds_typedef] && decl_context != TYPENAME) |
8d08fdba MS |
9023 | { |
9024 | tree decl; | |
9025 | ||
9026 | /* Note that the grammar rejects storage classes | |
9027 | in typenames, fields or parameters. */ | |
eff71ab0 PB |
9028 | if (current_lang_name == lang_name_java) |
9029 | TYPE_FOR_JAVA (type) = 1; | |
3db45ab5 | 9030 | |
e2537f2c MM |
9031 | /* This declaration: |
9032 | ||
3db45ab5 | 9033 | typedef void f(int) const; |
e2537f2c | 9034 | |
3db45ab5 | 9035 | declares a function type which is not a member of any |
e2537f2c | 9036 | particular class, but which is cv-qualified; for |
3db45ab5 | 9037 | example "f S::*" declares a pointer to a const-qualified |
e2537f2c MM |
9038 | member function of S. We record the cv-qualification in the |
9039 | function type. */ | |
9040 | if (memfn_quals && TREE_CODE (type) == FUNCTION_TYPE) | |
771026dd | 9041 | { |
2872152c | 9042 | type = apply_memfn_quals (type, memfn_quals); |
771026dd DG |
9043 | |
9044 | /* We have now dealt with these qualifiers. */ | |
9045 | memfn_quals = TYPE_UNQUALIFIED; | |
9046 | } | |
8d08fdba | 9047 | |
d2e5ee5c | 9048 | if (decl_context == FIELD) |
e3016344 | 9049 | decl = build_lang_decl (TYPE_DECL, unqualified_id, type); |
d2e5ee5c | 9050 | else |
c2255bc4 | 9051 | decl = build_decl (input_location, TYPE_DECL, unqualified_id, type); |
dcbdf612 | 9052 | if (id_declarator && declarator->u.id.qualifying_scope) { |
c5d75364 MLI |
9053 | error_at (DECL_SOURCE_LOCATION (decl), |
9054 | "typedef name may not be a nested-name-specifier"); | |
dcbdf612 SM |
9055 | TREE_TYPE (decl) = error_mark_node; |
9056 | } | |
e3016344 MM |
9057 | |
9058 | if (decl_context != FIELD) | |
6bda7a5e | 9059 | { |
6bda7a5e NS |
9060 | if (!current_function_decl) |
9061 | DECL_CONTEXT (decl) = FROB_CONTEXT (current_namespace); | |
1dc82a99 | 9062 | else if (DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (current_function_decl) |
c8094d83 | 9063 | || (DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P |
1dc82a99 MM |
9064 | (current_function_decl))) |
9065 | /* The TYPE_DECL is "abstract" because there will be | |
9066 | clones of this constructor/destructor, and there will | |
9067 | be copies of this TYPE_DECL generated in those | |
9068 | clones. */ | |
9069 | DECL_ABSTRACT (decl) = 1; | |
6bda7a5e | 9070 | } |
e3016344 | 9071 | else if (constructor_name_p (unqualified_id, current_class_type)) |
cbe5f3b3 | 9072 | permerror (input_location, "ISO C++ forbids nested type %qD with same name " |
37ec60ed JW |
9073 | "as enclosing class", |
9074 | unqualified_id); | |
caf93cb0 | 9075 | |
9188c363 MM |
9076 | /* If the user declares "typedef struct {...} foo" then the |
9077 | struct will have an anonymous name. Fill that name in now. | |
9078 | Nothing can refer to it, so nothing needs know about the name | |
9079 | change. */ | |
8d08fdba | 9080 | if (type != error_mark_node |
058b15c1 | 9081 | && unqualified_id |
8d08fdba MS |
9082 | && TYPE_NAME (type) |
9083 | && TREE_CODE (TYPE_NAME (type)) == TYPE_DECL | |
1951a1b6 | 9084 | && TYPE_ANONYMOUS_P (type) |
89d684bb | 9085 | && cp_type_quals (type) == TYPE_UNQUALIFIED) |
8d08fdba | 9086 | { |
dcd08efc JM |
9087 | tree t; |
9088 | ||
2c73f9f5 | 9089 | /* Replace the anonymous name with the real name everywhere. */ |
dcd08efc | 9090 | for (t = TYPE_MAIN_VARIANT (type); t; t = TYPE_NEXT_VARIANT (t)) |
a417cdd9 CM |
9091 | { |
9092 | if (ANON_AGGRNAME_P (TYPE_IDENTIFIER (t))) | |
e62b90b4 DS |
9093 | /* We do not rename the debug info representing the |
9094 | anonymous tagged type because the standard says in | |
9095 | [dcl.typedef] that the naming applies only for | |
9096 | linkage purposes. */ | |
9097 | /*debug_hooks->set_name (t, decl);*/ | |
9098 | TYPE_NAME (t) = decl; | |
a417cdd9 | 9099 | } |
8d08fdba MS |
9100 | |
9101 | if (TYPE_LANG_SPECIFIC (type)) | |
9102 | TYPE_WAS_ANONYMOUS (type) = 1; | |
9103 | ||
33964bf4 MM |
9104 | /* If this is a typedef within a template class, the nested |
9105 | type is a (non-primary) template. The name for the | |
9106 | template needs updating as well. */ | |
9107 | if (TYPE_LANG_SPECIFIC (type) && CLASSTYPE_TEMPLATE_INFO (type)) | |
68642fb6 | 9108 | DECL_NAME (CLASSTYPE_TI_TEMPLATE (type)) |
33964bf4 MM |
9109 | = TYPE_IDENTIFIER (type); |
9110 | ||
ecc607fc JM |
9111 | /* Adjust linkage now that we aren't anonymous anymore. */ |
9112 | set_linkage_according_to_type (type, TYPE_MAIN_DECL (type)); | |
9113 | determine_visibility (TYPE_MAIN_DECL (type)); | |
9114 | ||
50a6dbd7 JM |
9115 | /* FIXME remangle member functions; member functions of a |
9116 | type with external linkage have external linkage. */ | |
fc378698 | 9117 | } |
fc378698 | 9118 | |
1ff3c076 | 9119 | if (signed_p |
8d08fdba MS |
9120 | || (typedef_decl && C_TYPEDEF_EXPLICITLY_SIGNED (typedef_decl))) |
9121 | C_TYPEDEF_EXPLICITLY_SIGNED (decl) = 1; | |
9122 | ||
3db45ab5 | 9123 | bad_specifiers (decl, "type", virtualp, |
e2537f2c | 9124 | memfn_quals != TYPE_UNQUALIFIED, |
c91a56d2 MS |
9125 | inlinep, friendp, raises != NULL_TREE); |
9126 | ||
8d08fdba MS |
9127 | return decl; |
9128 | } | |
9129 | ||
9130 | /* Detect the case of an array type of unspecified size | |
9131 | which came, as such, direct from a typedef name. | |
8d6e459d NS |
9132 | We must copy the type, so that the array's domain can be |
9133 | individually set by the object's initializer. */ | |
8d08fdba | 9134 | |
8d6e459d NS |
9135 | if (type && typedef_type |
9136 | && TREE_CODE (type) == ARRAY_TYPE && !TYPE_DOMAIN (type) | |
55b3d665 | 9137 | && TYPE_MAIN_VARIANT (type) == TYPE_MAIN_VARIANT (typedef_type)) |
8d6e459d | 9138 | type = build_cplus_array_type (TREE_TYPE (type), NULL_TREE); |
8d08fdba | 9139 | |
969fd501 | 9140 | /* Detect where we're using a typedef of function type to declare a |
4546865e | 9141 | function. PARMS will not be set, so we must create it now. */ |
caf93cb0 | 9142 | |
969fd501 NS |
9143 | if (type == typedef_type && TREE_CODE (type) == FUNCTION_TYPE) |
9144 | { | |
9145 | tree decls = NULL_TREE; | |
9146 | tree args; | |
9147 | ||
7b3ad9f9 JM |
9148 | for (args = TYPE_ARG_TYPES (type); |
9149 | args && args != void_list_node; | |
9150 | args = TREE_CHAIN (args)) | |
969fd501 | 9151 | { |
8e51619a | 9152 | tree decl = cp_build_parm_decl (NULL_TREE, TREE_VALUE (args)); |
969fd501 NS |
9153 | |
9154 | TREE_CHAIN (decl) = decls; | |
9155 | decls = decl; | |
9156 | } | |
caf93cb0 | 9157 | |
4546865e | 9158 | parms = nreverse (decls); |
9804209d DG |
9159 | |
9160 | if (decl_context != TYPENAME) | |
0cbd7506 MS |
9161 | { |
9162 | /* A cv-qualifier-seq shall only be part of the function type | |
9163 | for a non-static member function. [8.3.5/4 dcl.fct] */ | |
2872152c | 9164 | if (type_memfn_quals (type) != TYPE_UNQUALIFIED |
0cbd7506 MS |
9165 | && (current_class_type == NULL_TREE || staticp) ) |
9166 | { | |
ebbc3ce1 | 9167 | error (staticp |
f88d05c0 DM |
9168 | ? G_("qualified function types cannot be used to " |
9169 | "declare static member functions") | |
9170 | : G_("qualified function types cannot be used to " | |
9171 | "declare free functions")); | |
0cbd7506 MS |
9172 | type = TYPE_MAIN_VARIANT (type); |
9173 | } | |
9174 | ||
9175 | /* The qualifiers on the function type become the qualifiers on | |
9176 | the non-static member function. */ | |
2872152c | 9177 | memfn_quals |= type_memfn_quals (type); |
e4672ccd | 9178 | type_quals = TYPE_UNQUALIFIED; |
0cbd7506 | 9179 | } |
969fd501 NS |
9180 | } |
9181 | ||
8d08fdba MS |
9182 | /* If this is a type name (such as, in a cast or sizeof), |
9183 | compute the type and return it now. */ | |
9184 | ||
9185 | if (decl_context == TYPENAME) | |
9186 | { | |
9187 | /* Note that the grammar rejects storage classes | |
9188 | in typenames, fields or parameters. */ | |
91063b51 | 9189 | if (type_quals != TYPE_UNQUALIFIED) |
6eabb241 | 9190 | type_quals = TYPE_UNQUALIFIED; |
8d08fdba MS |
9191 | |
9192 | /* Special case: "friend class foo" looks like a TYPENAME context. */ | |
9193 | if (friendp) | |
9194 | { | |
91063b51 | 9195 | if (type_quals != TYPE_UNQUALIFIED) |
b7484fbe | 9196 | { |
33bd39a2 | 9197 | error ("type qualifiers specified for friend class declaration"); |
91063b51 | 9198 | type_quals = TYPE_UNQUALIFIED; |
b7484fbe MS |
9199 | } |
9200 | if (inlinep) | |
9201 | { | |
2d01edd7 | 9202 | error ("%<inline%> specified for friend class declaration"); |
b7484fbe MS |
9203 | inlinep = 0; |
9204 | } | |
f2ae0c45 | 9205 | |
218e0eb6 | 9206 | if (!current_aggr) |
4b054b80 | 9207 | { |
218e0eb6 | 9208 | /* Don't allow friend declaration without a class-key. */ |
4b054b80 | 9209 | if (TREE_CODE (type) == TEMPLATE_TYPE_PARM) |
cbe5f3b3 | 9210 | permerror (input_location, "template parameters cannot be friends"); |
f2ae0c45 | 9211 | else if (TREE_CODE (type) == TYPENAME_TYPE) |
cbe5f3b3 | 9212 | permerror (input_location, "friend declaration requires class-key, " |
37ec60ed JW |
9213 | "i.e. %<friend class %T::%D%>", |
9214 | TYPE_CONTEXT (type), TYPENAME_TYPE_FULLNAME (type)); | |
4b054b80 | 9215 | else |
cbe5f3b3 | 9216 | permerror (input_location, "friend declaration requires class-key, " |
37ec60ed JW |
9217 | "i.e. %<friend %#T%>", |
9218 | type); | |
4b054b80 | 9219 | } |
b7484fbe MS |
9220 | |
9221 | /* Only try to do this stuff if we didn't already give up. */ | |
9222 | if (type != integer_type_node) | |
9223 | { | |
9224 | /* A friendly class? */ | |
9225 | if (current_class_type) | |
19db77ce KL |
9226 | make_friend_class (current_class_type, TYPE_MAIN_VARIANT (type), |
9227 | /*complain=*/true); | |
b7484fbe | 9228 | else |
2d01edd7 | 9229 | error ("trying to make class %qT a friend of global scope", |
0cbd7506 | 9230 | type); |
d363e7bf | 9231 | |
b7484fbe MS |
9232 | type = void_type_node; |
9233 | } | |
8d08fdba | 9234 | } |
e2537f2c | 9235 | else if (memfn_quals) |
8d08fdba | 9236 | { |
0d9c0892 JM |
9237 | if (ctype == NULL_TREE |
9238 | && TREE_CODE (type) == METHOD_TYPE) | |
9239 | ctype = TYPE_METHOD_BASETYPE (type); | |
9240 | ||
41cbc04c | 9241 | if (ctype) |
e2537f2c | 9242 | type = build_memfn_type (type, ctype, memfn_quals); |
0d9c0892 JM |
9243 | /* Core issue #547: need to allow this in template type args. */ |
9244 | else if (template_type_arg && TREE_CODE (type) == FUNCTION_TYPE) | |
2872152c | 9245 | type = apply_memfn_quals (type, memfn_quals); |
0d9c0892 JM |
9246 | else |
9247 | error ("invalid qualifiers on non-member function type"); | |
8d08fdba MS |
9248 | } |
9249 | ||
9250 | return type; | |
9251 | } | |
058b15c1 | 9252 | else if (unqualified_id == NULL_TREE && decl_context != PARM |
db5ae43f | 9253 | && decl_context != CATCHPARM |
8d08fdba MS |
9254 | && TREE_CODE (type) != UNION_TYPE |
9255 | && ! bitfield) | |
9256 | { | |
2d01edd7 | 9257 | error ("abstract declarator %qT used as declaration", type); |
22ab714d | 9258 | return error_mark_node; |
8d08fdba MS |
9259 | } |
9260 | ||
62e19030 MM |
9261 | /* Only functions may be declared using an operator-function-id. */ |
9262 | if (unqualified_id | |
9263 | && IDENTIFIER_OPNAME_P (unqualified_id) | |
9264 | && TREE_CODE (type) != FUNCTION_TYPE | |
9265 | && TREE_CODE (type) != METHOD_TYPE) | |
8d08fdba | 9266 | { |
62e19030 MM |
9267 | error ("declaration of %qD as non-function", unqualified_id); |
9268 | return error_mark_node; | |
8d08fdba MS |
9269 | } |
9270 | ||
62e19030 MM |
9271 | /* We don't check parameter types here because we can emit a better |
9272 | error message later. */ | |
9273 | if (decl_context != PARM) | |
650fcd07 LM |
9274 | { |
9275 | type = check_var_type (unqualified_id, type); | |
9276 | if (type == error_mark_node) | |
9277 | return error_mark_node; | |
9278 | } | |
62e19030 | 9279 | |
8d08fdba MS |
9280 | /* Now create the decl, which may be a VAR_DECL, a PARM_DECL |
9281 | or a FUNCTION_DECL, depending on DECL_CONTEXT and TYPE. */ | |
9282 | ||
14ae7e7d JM |
9283 | if (decl_context == PARM || decl_context == CATCHPARM) |
9284 | { | |
9285 | if (ctype || in_namespace) | |
2d01edd7 | 9286 | error ("cannot use %<::%> in parameter declaration"); |
14ae7e7d JM |
9287 | |
9288 | /* A parameter declared as an array of T is really a pointer to T. | |
9289 | One declared as a function is really a pointer to a function. | |
9290 | One declared as a member is really a pointer to member. */ | |
9291 | ||
9292 | if (TREE_CODE (type) == ARRAY_TYPE) | |
9293 | { | |
9294 | /* Transfer const-ness of array into that of type pointed to. */ | |
9295 | type = build_pointer_type (TREE_TYPE (type)); | |
91063b51 | 9296 | type_quals = TYPE_UNQUALIFIED; |
14ae7e7d JM |
9297 | } |
9298 | else if (TREE_CODE (type) == FUNCTION_TYPE) | |
9299 | type = build_pointer_type (type); | |
14ae7e7d | 9300 | } |
68642fb6 | 9301 | |
8d08fdba | 9302 | { |
926ce8bd | 9303 | tree decl; |
8d08fdba MS |
9304 | |
9305 | if (decl_context == PARM) | |
9306 | { | |
058b15c1 | 9307 | decl = cp_build_parm_decl (unqualified_id, type); |
8d08fdba | 9308 | |
3db45ab5 | 9309 | bad_specifiers (decl, "parameter", virtualp, |
e2537f2c | 9310 | memfn_quals != TYPE_UNQUALIFIED, |
8d08fdba | 9311 | inlinep, friendp, raises != NULL_TREE); |
8d08fdba MS |
9312 | } |
9313 | else if (decl_context == FIELD) | |
9314 | { | |
01bf0f3e JM |
9315 | /* The C99 flexible array extension. */ |
9316 | if (!staticp && TREE_CODE (type) == ARRAY_TYPE | |
9317 | && TYPE_DOMAIN (type) == NULL_TREE) | |
9318 | { | |
9319 | tree itype = compute_array_index_type (dname, integer_zero_node); | |
9320 | type = build_cplus_array_type (TREE_TYPE (type), itype); | |
9321 | } | |
9322 | ||
8d08fdba MS |
9323 | if (type == error_mark_node) |
9324 | { | |
9325 | /* Happens when declaring arrays of sizes which | |
9326 | are error_mark_node, for example. */ | |
9327 | decl = NULL_TREE; | |
9328 | } | |
997a088c | 9329 | else if (in_namespace && !friendp) |
05008fb9 MM |
9330 | { |
9331 | /* Something like struct S { int N::j; }; */ | |
2d01edd7 | 9332 | error ("invalid use of %<::%>"); |
9a171ca4 | 9333 | return error_mark_node; |
05008fb9 | 9334 | } |
8d08fdba MS |
9335 | else if (TREE_CODE (type) == FUNCTION_TYPE) |
9336 | { | |
9337 | int publicp = 0; | |
e1467ff2 | 9338 | tree function_context; |
8d08fdba MS |
9339 | |
9340 | if (friendp == 0) | |
9341 | { | |
9342 | if (ctype == NULL_TREE) | |
9343 | ctype = current_class_type; | |
9344 | ||
9345 | if (ctype == NULL_TREE) | |
9346 | { | |
2d01edd7 | 9347 | error ("can't make %qD into a method -- not in a class", |
058b15c1 | 9348 | unqualified_id); |
13dbe691 | 9349 | return error_mark_node; |
8d08fdba MS |
9350 | } |
9351 | ||
9352 | /* ``A union may [ ... ] not [ have ] virtual functions.'' | |
9353 | ARM 9.5 */ | |
9354 | if (virtualp && TREE_CODE (ctype) == UNION_TYPE) | |
9355 | { | |
2d01edd7 | 9356 | error ("function %qD declared virtual inside a union", |
058b15c1 | 9357 | unqualified_id); |
13dbe691 | 9358 | return error_mark_node; |
8d08fdba MS |
9359 | } |
9360 | ||
058b15c1 | 9361 | if (NEW_DELETE_OPNAME_P (unqualified_id)) |
8d08fdba MS |
9362 | { |
9363 | if (virtualp) | |
9364 | { | |
2d01edd7 | 9365 | error ("%qD cannot be declared virtual, since it " |
0cbd7506 | 9366 | "is always static", |
058b15c1 | 9367 | unqualified_id); |
8d08fdba MS |
9368 | virtualp = 0; |
9369 | } | |
9370 | } | |
9371 | else if (staticp < 2) | |
e2537f2c | 9372 | type = build_memfn_type (type, ctype, memfn_quals); |
8d08fdba MS |
9373 | } |
9374 | ||
88e95ee3 | 9375 | /* Check that the name used for a destructor makes sense. */ |
6d2989e1 | 9376 | if (sfk == sfk_destructor) |
88e95ee3 | 9377 | { |
bd967b22 JM |
9378 | tree uqname = id_declarator->u.id.unqualified_name; |
9379 | ||
6d2989e1 VR |
9380 | if (!ctype) |
9381 | { | |
9382 | gcc_assert (friendp); | |
9383 | error ("expected qualified name in friend declaration " | |
bd967b22 | 9384 | "for destructor %qD", uqname); |
6d2989e1 VR |
9385 | return error_mark_node; |
9386 | } | |
9387 | ||
bd967b22 | 9388 | if (!check_dtor_name (ctype, TREE_OPERAND (uqname, 0))) |
6d2989e1 VR |
9389 | { |
9390 | error ("declaration of %qD as member of %qT", | |
bd967b22 | 9391 | uqname, ctype); |
6d2989e1 VR |
9392 | return error_mark_node; |
9393 | } | |
7ecbca9d GDR |
9394 | if (constexpr_p) |
9395 | error ("a destructor cannot be %<constexpr%>"); | |
88e95ee3 | 9396 | } |
ac3b1156 JJ |
9397 | else if (sfk == sfk_constructor && friendp) |
9398 | { | |
9399 | error ("expected qualified name in friend declaration " | |
9400 | "for constructor %qD", | |
9401 | id_declarator->u.id.unqualified_name); | |
9402 | return error_mark_node; | |
9403 | } | |
88e95ee3 | 9404 | |
8d08fdba | 9405 | /* Tell grokfndecl if it needs to set TREE_PUBLIC on the node. */ |
68642fb6 | 9406 | function_context = (ctype != NULL_TREE) ? |
4f1c5b7d | 9407 | decl_function_context (TYPE_MAIN_DECL (ctype)) : NULL_TREE; |
e1467ff2 MM |
9408 | publicp = (! friendp || ! staticp) |
9409 | && function_context == NULL_TREE; | |
68642fb6 | 9410 | decl = grokfndecl (ctype, type, |
058b15c1 MM |
9411 | TREE_CODE (unqualified_id) != TEMPLATE_ID_EXPR |
9412 | ? unqualified_id : dname, | |
4546865e | 9413 | parms, |
058b15c1 | 9414 | unqualified_id, |
e2537f2c | 9415 | virtualp, flags, memfn_quals, raises, |
7ecbca9d GDR |
9416 | friendp ? -1 : 0, friendp, publicp, |
9417 | inlinep || constexpr_p, | |
27d6592c | 9418 | sfk, |
402b8cf6 AH |
9419 | funcdef_flag, template_count, in_namespace, |
9420 | attrlist, declarator->id_loc); | |
20496fa2 | 9421 | if (decl == NULL_TREE) |
ba5719d9 | 9422 | return error_mark_node; |
6125f3be DE |
9423 | #if 0 |
9424 | /* This clobbers the attrs stored in `decl' from `attrlist'. */ | |
91d231cb JM |
9425 | /* The decl and setting of decl_attr is also turned off. */ |
9426 | decl = build_decl_attribute_variant (decl, decl_attr); | |
6125f3be | 9427 | #endif |
f0e01782 | 9428 | |
cc804e51 MM |
9429 | /* [class.conv.ctor] |
9430 | ||
9431 | A constructor declared without the function-specifier | |
9432 | explicit that can be called with a single parameter | |
9433 | specifies a conversion from the type of its first | |
9434 | parameter to the type of its class. Such a constructor | |
9435 | is called a converting constructor. */ | |
db5ae43f MS |
9436 | if (explicitp == 2) |
9437 | DECL_NONCONVERTING_P (decl) = 1; | |
8d08fdba MS |
9438 | } |
9439 | else if (TREE_CODE (type) == METHOD_TYPE) | |
9440 | { | |
faae18ab MS |
9441 | /* We only get here for friend declarations of |
9442 | members of other classes. */ | |
8d08fdba MS |
9443 | /* All method decls are public, so tell grokfndecl to set |
9444 | TREE_PUBLIC, also. */ | |
866eb556 | 9445 | decl = grokfndecl (ctype, type, |
058b15c1 MM |
9446 | TREE_CODE (unqualified_id) != TEMPLATE_ID_EXPR |
9447 | ? unqualified_id : dname, | |
4546865e | 9448 | parms, |
058b15c1 | 9449 | unqualified_id, |
e2537f2c | 9450 | virtualp, flags, memfn_quals, raises, |
27d6592c | 9451 | friendp ? -1 : 0, friendp, 1, 0, sfk, |
c8094d83 | 9452 | funcdef_flag, template_count, in_namespace, |
402b8cf6 AH |
9453 | attrlist, |
9454 | declarator->id_loc); | |
f0e01782 | 9455 | if (decl == NULL_TREE) |
13dbe691 | 9456 | return error_mark_node; |
8d08fdba | 9457 | } |
a9f46cbb | 9458 | else if (!staticp && !dependent_type_p (type) |
d0f062fb | 9459 | && !COMPLETE_TYPE_P (complete_type (type)) |
8d08fdba MS |
9460 | && (TREE_CODE (type) != ARRAY_TYPE || initialized == 0)) |
9461 | { | |
058b15c1 | 9462 | if (unqualified_id) |
2d01edd7 | 9463 | error ("field %qD has incomplete type", unqualified_id); |
b7484fbe | 9464 | else |
2d01edd7 | 9465 | error ("name %qT has incomplete type", type); |
8d08fdba MS |
9466 | |
9467 | /* If we're instantiating a template, tell them which | |
9468 | instantiation made the field's type be incomplete. */ | |
9469 | if (current_class_type | |
9470 | && TYPE_NAME (current_class_type) | |
d2e5ee5c | 9471 | && IDENTIFIER_TEMPLATE (TYPE_IDENTIFIER (current_class_type)) |
62d1db17 MM |
9472 | && declspecs->type |
9473 | && declspecs->type == type) | |
2d01edd7 | 9474 | error (" in instantiation of template %qT", |
0cbd7506 | 9475 | current_class_type); |
db5ae43f | 9476 | |
623c65f1 | 9477 | return error_mark_node; |
8d08fdba MS |
9478 | } |
9479 | else | |
9480 | { | |
9481 | if (friendp) | |
9482 | { | |
2d01edd7 | 9483 | error ("%qE is neither function nor member function; " |
0cbd7506 | 9484 | "cannot be declared friend", unqualified_id); |
8d08fdba MS |
9485 | friendp = 0; |
9486 | } | |
9487 | decl = NULL_TREE; | |
9488 | } | |
9489 | ||
9490 | if (friendp) | |
9491 | { | |
9492 | /* Friends are treated specially. */ | |
9493 | if (ctype == current_class_type) | |
37ec60ed | 9494 | ; /* We already issued a permerror. */ |
0cbd7506 | 9495 | else if (decl && DECL_NAME (decl)) |
8db1028e NS |
9496 | { |
9497 | if (template_class_depth (current_class_type) == 0) | |
9498 | { | |
9499 | decl = check_explicit_specialization | |
058b15c1 | 9500 | (unqualified_id, decl, template_count, |
357d956e | 9501 | 2 * funcdef_flag + 4); |
8db1028e NS |
9502 | if (decl == error_mark_node) |
9503 | return error_mark_node; | |
9504 | } | |
caf93cb0 | 9505 | |
9a801c38 | 9506 | DECL_DECLARED_CONSTEXPR_P (decl) = constexpr_p; |
058b15c1 | 9507 | decl = do_friend (ctype, unqualified_id, decl, |
3db45ab5 | 9508 | *attrlist, flags, |
e2537f2c | 9509 | funcdef_flag); |
8db1028e NS |
9510 | return decl; |
9511 | } | |
9512 | else | |
13dbe691 | 9513 | return error_mark_node; |
8d08fdba MS |
9514 | } |
9515 | ||
f4f206f4 | 9516 | /* Structure field. It may not be a function, except for C++. */ |
8d08fdba MS |
9517 | |
9518 | if (decl == NULL_TREE) | |
9519 | { | |
8d08fdba MS |
9520 | if (initialized) |
9521 | { | |
3ac3d9ea MM |
9522 | if (!staticp) |
9523 | { | |
9524 | /* An attempt is being made to initialize a non-static | |
9525 | member. But, from [class.mem]: | |
68642fb6 | 9526 | |
3ac3d9ea MM |
9527 | 4 A member-declarator can contain a |
9528 | constant-initializer only if it declares a static | |
9529 | member (_class.static_) of integral or enumeration | |
68642fb6 | 9530 | type, see _class.static.data_. |
3ac3d9ea MM |
9531 | |
9532 | This used to be relatively common practice, but | |
9533 | the rest of the compiler does not correctly | |
9534 | handle the initialization unless the member is | |
9535 | static so we make it static below. */ | |
cbe5f3b3 | 9536 | permerror (input_location, "ISO C++ forbids initialization of member %qD", |
37ec60ed | 9537 | unqualified_id); |
cbe5f3b3 | 9538 | permerror (input_location, "making %qD static", unqualified_id); |
3ac3d9ea MM |
9539 | staticp = 1; |
9540 | } | |
9541 | ||
6ba89f8e MM |
9542 | if (uses_template_parms (type)) |
9543 | /* We'll check at instantiation time. */ | |
9544 | ; | |
058b15c1 | 9545 | else if (check_static_variable_definition (unqualified_id, |
6ba89f8e MM |
9546 | type)) |
9547 | /* If we just return the declaration, crashes | |
9548 | will sometimes occur. We therefore return | |
72a93143 JM |
9549 | void_type_node, as if this was a friend |
9550 | declaration, to cause callers to completely | |
9551 | ignore this declaration. */ | |
13dbe691 | 9552 | return error_mark_node; |
8d08fdba MS |
9553 | } |
9554 | ||
3ac3d9ea | 9555 | if (staticp) |
8d08fdba | 9556 | { |
f18a14bc MM |
9557 | /* C++ allows static class members. All other work |
9558 | for this is done by grokfield. */ | |
058b15c1 | 9559 | decl = build_lang_decl (VAR_DECL, unqualified_id, type); |
4684cd27 MM |
9560 | set_linkage_for_static_data_member (decl); |
9561 | /* Even if there is an in-class initialization, DECL | |
9562 | is considered undefined until an out-of-class | |
9563 | definition is provided. */ | |
9564 | DECL_EXTERNAL (decl) = 1; | |
31a79236 JJ |
9565 | |
9566 | if (thread_p) | |
8893239d | 9567 | DECL_TLS_MODEL (decl) = decl_default_tls_model (decl); |
8d08fdba MS |
9568 | } |
9569 | else | |
9570 | { | |
7ecbca9d GDR |
9571 | if (constexpr_p) |
9572 | error ("non-static data member %qE declared %<constexpr%>", | |
9573 | unqualified_id); | |
c2255bc4 AH |
9574 | decl = build_decl (input_location, |
9575 | FIELD_DECL, unqualified_id, type); | |
2bf105ab | 9576 | DECL_NONADDRESSABLE_P (decl) = bitfield; |
ab53bae2 AO |
9577 | if (bitfield && !unqualified_id) |
9578 | TREE_NO_WARNING (decl) = 1; | |
9579 | ||
1ff3c076 | 9580 | if (storage_class == sc_mutable) |
8d08fdba MS |
9581 | { |
9582 | DECL_MUTABLE_P (decl) = 1; | |
1ff3c076 | 9583 | storage_class = sc_none; |
8d08fdba MS |
9584 | } |
9585 | } | |
9586 | ||
3db45ab5 | 9587 | bad_specifiers (decl, "field", virtualp, |
e2537f2c | 9588 | memfn_quals != TYPE_UNQUALIFIED, |
8d08fdba MS |
9589 | inlinep, friendp, raises != NULL_TREE); |
9590 | } | |
9591 | } | |
fd9aef9d NS |
9592 | else if (TREE_CODE (type) == FUNCTION_TYPE |
9593 | || TREE_CODE (type) == METHOD_TYPE) | |
8d08fdba | 9594 | { |
386b8a85 | 9595 | tree original_name; |
8d08fdba MS |
9596 | int publicp = 0; |
9597 | ||
058b15c1 | 9598 | if (!unqualified_id) |
13dbe691 | 9599 | return error_mark_node; |
8d08fdba | 9600 | |
058b15c1 | 9601 | if (TREE_CODE (unqualified_id) == TEMPLATE_ID_EXPR) |
386b8a85 JM |
9602 | original_name = dname; |
9603 | else | |
058b15c1 | 9604 | original_name = unqualified_id; |
386b8a85 | 9605 | |
1ff3c076 | 9606 | if (storage_class == sc_auto) |
2d01edd7 | 9607 | error ("storage class %<auto%> invalid for function %qs", name); |
1ff3c076 | 9608 | else if (storage_class == sc_register) |
2d01edd7 | 9609 | error ("storage class %<register%> invalid for function %qs", name); |
1ff3c076 | 9610 | else if (thread_p) |
2d01edd7 | 9611 | error ("storage class %<__thread%> invalid for function %qs", name); |
8d08fdba MS |
9612 | |
9613 | /* Function declaration not at top level. | |
9614 | Storage classes other than `extern' are not allowed | |
9615 | and `extern' makes no difference. */ | |
a9aedbc2 | 9616 | if (! toplevel_bindings_p () |
1ff3c076 | 9617 | && (storage_class == sc_static |
62d1db17 | 9618 | || declspecs->specs[(int)ds_inline]) |
8d08fdba | 9619 | && pedantic) |
8926095f | 9620 | { |
1ff3c076 | 9621 | if (storage_class == sc_static) |
509c9d60 | 9622 | pedwarn (input_location, OPT_pedantic, |
fcf73884 | 9623 | "%<static%> specified invalid for function %qs " |
0cbd7506 | 9624 | "declared out of global scope", name); |
8926095f | 9625 | else |
509c9d60 | 9626 | pedwarn (input_location, OPT_pedantic, |
fcf73884 | 9627 | "%<inline%> specifier invalid for function %qs " |
0cbd7506 | 9628 | "declared out of global scope", name); |
8926095f | 9629 | } |
68642fb6 | 9630 | |
a2712544 AP |
9631 | if (ctype != NULL_TREE |
9632 | && TREE_CODE (ctype) != NAMESPACE_DECL && !MAYBE_CLASS_TYPE_P (ctype)) | |
9633 | { | |
9634 | error ("%q#T is not a class or a namespace", ctype); | |
9635 | ctype = NULL_TREE; | |
9636 | } | |
9637 | ||
8d08fdba MS |
9638 | if (ctype == NULL_TREE) |
9639 | { | |
9640 | if (virtualp) | |
9641 | { | |
2d01edd7 | 9642 | error ("virtual non-class function %qs", name); |
8d08fdba MS |
9643 | virtualp = 0; |
9644 | } | |
48b6cd9d SM |
9645 | else if (sfk == sfk_constructor |
9646 | || sfk == sfk_destructor) | |
9647 | { | |
9648 | error (funcdef_flag | |
9649 | ? "%qs defined in a non-class scope" | |
9650 | : "%qs declared in a non-class scope", name); | |
9651 | sfk = sfk_none; | |
9652 | } | |
8d08fdba | 9653 | } |
4546865e MM |
9654 | else if (TREE_CODE (type) == FUNCTION_TYPE && staticp < 2 |
9655 | && !NEW_DELETE_OPNAME_P (original_name)) | |
caf93cb0 | 9656 | type = build_method_type_directly (ctype, |
43dc123f MM |
9657 | TREE_TYPE (type), |
9658 | TYPE_ARG_TYPES (type)); | |
8d08fdba | 9659 | |
eb66be0e | 9660 | /* Record presence of `static'. */ |
faae18ab | 9661 | publicp = (ctype != NULL_TREE |
1ff3c076 MM |
9662 | || storage_class == sc_extern |
9663 | || storage_class != sc_static); | |
8d08fdba | 9664 | |
058b15c1 | 9665 | decl = grokfndecl (ctype, type, original_name, parms, unqualified_id, |
e2537f2c | 9666 | virtualp, flags, memfn_quals, raises, |
75650646 | 9667 | 1, friendp, |
7ecbca9d | 9668 | publicp, inlinep || constexpr_p, sfk, funcdef_flag, |
402b8cf6 AH |
9669 | template_count, in_namespace, attrlist, |
9670 | declarator->id_loc); | |
f0e01782 | 9671 | if (decl == NULL_TREE) |
13dbe691 | 9672 | return error_mark_node; |
8d08fdba | 9673 | |
8d08fdba MS |
9674 | if (staticp == 1) |
9675 | { | |
0e339752 | 9676 | int invalid_static = 0; |
8d08fdba MS |
9677 | |
9678 | /* Don't allow a static member function in a class, and forbid | |
9679 | declaring main to be static. */ | |
9680 | if (TREE_CODE (type) == METHOD_TYPE) | |
9681 | { | |
cbe5f3b3 | 9682 | permerror (input_location, "cannot declare member function %qD to have " |
37ec60ed | 9683 | "static linkage", decl); |
0e339752 | 9684 | invalid_static = 1; |
8d08fdba | 9685 | } |
8d08fdba MS |
9686 | else if (current_function_decl) |
9687 | { | |
9688 | /* FIXME need arm citation */ | |
8251199e | 9689 | error ("cannot declare static function inside another function"); |
0e339752 | 9690 | invalid_static = 1; |
8d08fdba MS |
9691 | } |
9692 | ||
0e339752 | 9693 | if (invalid_static) |
8d08fdba MS |
9694 | { |
9695 | staticp = 0; | |
1ff3c076 | 9696 | storage_class = sc_none; |
8d08fdba MS |
9697 | } |
9698 | } | |
8d08fdba MS |
9699 | } |
9700 | else | |
9701 | { | |
9702 | /* It's a variable. */ | |
9703 | ||
9704 | /* An uninitialized decl with `extern' is a reference. */ | |
caf93cb0 | 9705 | decl = grokvardecl (type, unqualified_id, |
62d1db17 | 9706 | declspecs, |
68642fb6 UD |
9707 | initialized, |
9708 | (type_quals & TYPE_QUAL_CONST) != 0, | |
9e259dd1 | 9709 | ctype ? ctype : in_namespace); |
3db45ab5 | 9710 | bad_specifiers (decl, "variable", virtualp, |
e2537f2c | 9711 | memfn_quals != TYPE_UNQUALIFIED, |
8d08fdba MS |
9712 | inlinep, friendp, raises != NULL_TREE); |
9713 | ||
9714 | if (ctype) | |
9715 | { | |
f0e01782 | 9716 | DECL_CONTEXT (decl) = ctype; |
8d08fdba MS |
9717 | if (staticp == 1) |
9718 | { | |
cbe5f3b3 | 9719 | permerror (input_location, "%<static%> may not be used when defining " |
37ec60ed | 9720 | "(as opposed to declaring) a static data member"); |
0cbd7506 | 9721 | staticp = 0; |
1ff3c076 | 9722 | storage_class = sc_none; |
8d08fdba | 9723 | } |
1ff3c076 | 9724 | if (storage_class == sc_register && TREE_STATIC (decl)) |
b7484fbe | 9725 | { |
2d01edd7 | 9726 | error ("static member %qD declared %<register%>", decl); |
1ff3c076 | 9727 | storage_class = sc_none; |
b7484fbe | 9728 | } |
1ff3c076 | 9729 | if (storage_class == sc_extern && pedantic) |
8d08fdba | 9730 | { |
509c9d60 | 9731 | pedwarn (input_location, OPT_pedantic, |
fcf73884 MLI |
9732 | "cannot explicitly declare member %q#D to have " |
9733 | "extern linkage", decl); | |
1ff3c076 | 9734 | storage_class = sc_none; |
8d08fdba MS |
9735 | } |
9736 | } | |
9737 | } | |
9738 | ||
94eeabbe DS |
9739 | if (storage_class == sc_extern && initialized && !funcdef_flag) |
9740 | { | |
9741 | if (toplevel_bindings_p ()) | |
9742 | { | |
9743 | /* It's common practice (and completely valid) to have a const | |
9744 | be initialized and declared extern. */ | |
9745 | if (!(type_quals & TYPE_QUAL_CONST)) | |
9746 | warning (0, "%qs initialized and declared %<extern%>", name); | |
9747 | } | |
9748 | else | |
0450a966 PC |
9749 | { |
9750 | error ("%qs has both %<extern%> and initializer", name); | |
9751 | return error_mark_node; | |
9752 | } | |
94eeabbe DS |
9753 | } |
9754 | ||
8d08fdba MS |
9755 | /* Record `register' declaration for warnings on & |
9756 | and in case doing stupid register allocation. */ | |
9757 | ||
1ff3c076 | 9758 | if (storage_class == sc_register) |
8d08fdba | 9759 | DECL_REGISTER (decl) = 1; |
1ff3c076 | 9760 | else if (storage_class == sc_extern) |
8926095f | 9761 | DECL_THIS_EXTERN (decl) = 1; |
1ff3c076 | 9762 | else if (storage_class == sc_static) |
faae18ab MS |
9763 | DECL_THIS_STATIC (decl) = 1; |
9764 | ||
7ecbca9d GDR |
9765 | /* Don't forget constexprness. */ |
9766 | if (VAR_OR_FUNCTION_DECL_P (decl)) | |
9767 | DECL_DECLARED_CONSTEXPR_P (decl) = constexpr_p; | |
9768 | ||
15896502 MM |
9769 | /* Record constancy and volatility on the DECL itself . There's |
9770 | no need to do this when processing a template; we'll do this | |
9771 | for the instantiated declaration based on the type of DECL. */ | |
adecb3f4 | 9772 | if (!processing_template_decl) |
9804209d | 9773 | cp_apply_type_quals_to_decl (type_quals, decl); |
8d08fdba MS |
9774 | |
9775 | return decl; | |
9776 | } | |
9777 | } | |
9778 | \f | |
f181d4ae MM |
9779 | /* Subroutine of start_function. Ensure that each of the parameter |
9780 | types (as listed in PARMS) is complete, as is required for a | |
9781 | function definition. */ | |
e92cc029 | 9782 | |
8d08fdba | 9783 | static void |
11f6b451 | 9784 | require_complete_types_for_parms (tree parms) |
8d08fdba | 9785 | { |
07c88314 | 9786 | for (; parms; parms = TREE_CHAIN (parms)) |
8d08fdba | 9787 | { |
c9387915 GB |
9788 | if (dependent_type_p (TREE_TYPE (parms))) |
9789 | continue; | |
dff1b563 VR |
9790 | if (!VOID_TYPE_P (TREE_TYPE (parms)) |
9791 | && complete_type_or_else (TREE_TYPE (parms), parms)) | |
753225c1 | 9792 | { |
7523dc31 | 9793 | relayout_decl (parms); |
753225c1 JM |
9794 | DECL_ARG_TYPE (parms) = type_passed_as (TREE_TYPE (parms)); |
9795 | } | |
dff1b563 VR |
9796 | else |
9797 | /* grokparms or complete_type_or_else will have already issued | |
9798 | an error. */ | |
9799 | TREE_TYPE (parms) = error_mark_node; | |
8d08fdba MS |
9800 | } |
9801 | } | |
9802 | ||
838dfd8a | 9803 | /* Returns nonzero if T is a local variable. */ |
297e73d8 | 9804 | |
46e8c075 | 9805 | int |
ac7d7749 | 9806 | local_variable_p (const_tree t) |
297e73d8 | 9807 | { |
68642fb6 | 9808 | if ((TREE_CODE (t) == VAR_DECL |
297e73d8 MM |
9809 | /* A VAR_DECL with a context that is a _TYPE is a static data |
9810 | member. */ | |
9811 | && !TYPE_P (CP_DECL_CONTEXT (t)) | |
9812 | /* Any other non-local variable must be at namespace scope. */ | |
46e8c075 | 9813 | && !DECL_NAMESPACE_SCOPE_P (t)) |
297e73d8 | 9814 | || (TREE_CODE (t) == PARM_DECL)) |
46e8c075 | 9815 | return 1; |
297e73d8 | 9816 | |
46e8c075 MM |
9817 | return 0; |
9818 | } | |
9819 | ||
46e8c075 MM |
9820 | /* Like local_variable_p, but suitable for use as a tree-walking |
9821 | function. */ | |
9822 | ||
9823 | static tree | |
44de5aeb RK |
9824 | local_variable_p_walkfn (tree *tp, int *walk_subtrees, |
9825 | void *data ATTRIBUTE_UNUSED) | |
46e8c075 | 9826 | { |
44de5aeb RK |
9827 | if (local_variable_p (*tp) && !DECL_ARTIFICIAL (*tp)) |
9828 | return *tp; | |
9829 | else if (TYPE_P (*tp)) | |
9830 | *walk_subtrees = 0; | |
9831 | ||
9832 | return NULL_TREE; | |
297e73d8 MM |
9833 | } |
9834 | ||
44de5aeb | 9835 | |
297e73d8 | 9836 | /* Check that ARG, which is a default-argument expression for a |
0e339752 | 9837 | parameter DECL, is valid. Returns ARG, or ERROR_MARK_NODE, if |
297e73d8 MM |
9838 | something goes wrong. DECL may also be a _TYPE node, rather than a |
9839 | DECL, if there is no DECL available. */ | |
9840 | ||
9841 | tree | |
11f6b451 | 9842 | check_default_argument (tree decl, tree arg) |
297e73d8 MM |
9843 | { |
9844 | tree var; | |
9845 | tree decl_type; | |
9846 | ||
9847 | if (TREE_CODE (arg) == DEFAULT_ARG) | |
9848 | /* We get a DEFAULT_ARG when looking at an in-class declaration | |
9849 | with a default argument. Ignore the argument for now; we'll | |
9850 | deal with it after the class is complete. */ | |
9851 | return arg; | |
9852 | ||
297e73d8 MM |
9853 | if (TYPE_P (decl)) |
9854 | { | |
9855 | decl_type = decl; | |
9856 | decl = NULL_TREE; | |
9857 | } | |
9858 | else | |
9859 | decl_type = TREE_TYPE (decl); | |
9860 | ||
68642fb6 | 9861 | if (arg == error_mark_node |
297e73d8 MM |
9862 | || decl == error_mark_node |
9863 | || TREE_TYPE (arg) == error_mark_node | |
9864 | || decl_type == error_mark_node) | |
9865 | /* Something already went wrong. There's no need to check | |
9866 | further. */ | |
9867 | return error_mark_node; | |
9868 | ||
9869 | /* [dcl.fct.default] | |
68642fb6 | 9870 | |
297e73d8 MM |
9871 | A default argument expression is implicitly converted to the |
9872 | parameter type. */ | |
9873 | if (!TREE_TYPE (arg) | |
30f86ec3 | 9874 | || !can_convert_arg (decl_type, TREE_TYPE (arg), arg, LOOKUP_NORMAL)) |
297e73d8 MM |
9875 | { |
9876 | if (decl) | |
2d01edd7 | 9877 | error ("default argument for %q#D has type %qT", |
0cbd7506 | 9878 | decl, TREE_TYPE (arg)); |
297e73d8 | 9879 | else |
2d01edd7 | 9880 | error ("default argument for parameter of type %qT has type %qT", |
0cbd7506 | 9881 | decl_type, TREE_TYPE (arg)); |
297e73d8 MM |
9882 | |
9883 | return error_mark_node; | |
9884 | } | |
9885 | ||
9886 | /* [dcl.fct.default] | |
9887 | ||
9888 | Local variables shall not be used in default argument | |
68642fb6 | 9889 | expressions. |
297e73d8 MM |
9890 | |
9891 | The keyword `this' shall not be used in a default argument of a | |
9892 | member function. */ | |
14588106 | 9893 | var = cp_walk_tree_without_duplicates (&arg, local_variable_p_walkfn, NULL); |
297e73d8 MM |
9894 | if (var) |
9895 | { | |
2d01edd7 | 9896 | error ("default argument %qE uses local variable %qD", arg, var); |
297e73d8 MM |
9897 | return error_mark_node; |
9898 | } | |
9899 | ||
9900 | /* All is well. */ | |
9901 | return arg; | |
9902 | } | |
9903 | ||
b344d949 JM |
9904 | /* Returns a deprecated type used within TYPE, or NULL_TREE if none. */ |
9905 | ||
9906 | static tree | |
9907 | type_is_deprecated (tree type) | |
9908 | { | |
9909 | enum tree_code code; | |
9910 | if (TREE_DEPRECATED (type)) | |
9911 | return type; | |
9912 | if (TYPE_NAME (type) | |
9913 | && TREE_DEPRECATED (TYPE_NAME (type))) | |
9914 | return type; | |
9915 | ||
98fba7f7 JM |
9916 | /* Do warn about using typedefs to a deprecated class. */ |
9917 | if (TAGGED_TYPE_P (type) && type != TYPE_MAIN_VARIANT (type)) | |
9918 | return type_is_deprecated (TYPE_MAIN_VARIANT (type)); | |
9919 | ||
b344d949 JM |
9920 | code = TREE_CODE (type); |
9921 | ||
9922 | if (code == POINTER_TYPE || code == REFERENCE_TYPE | |
9923 | || code == OFFSET_TYPE || code == FUNCTION_TYPE | |
9924 | || code == METHOD_TYPE || code == ARRAY_TYPE) | |
9925 | return type_is_deprecated (TREE_TYPE (type)); | |
9926 | ||
9927 | if (TYPE_PTRMEMFUNC_P (type)) | |
9928 | return type_is_deprecated | |
9929 | (TREE_TYPE (TREE_TYPE (TYPE_PTRMEMFUNC_FN_TYPE (type)))); | |
9930 | ||
9931 | return NULL_TREE; | |
9932 | } | |
9933 | ||
8d08fdba MS |
9934 | /* Decode the list of parameter types for a function type. |
9935 | Given the list of things declared inside the parens, | |
9936 | return a list of types. | |
9937 | ||
058b15c1 MM |
9938 | If this parameter does not end with an ellipsis, we append |
9939 | void_list_node. | |
5cce22b6 | 9940 | |
4546865e | 9941 | *PARMS is set to the chain of PARM_DECLs created. */ |
8d08fdba MS |
9942 | |
9943 | static tree | |
b344d949 | 9944 | grokparms (tree parmlist, tree *parms) |
8d08fdba MS |
9945 | { |
9946 | tree result = NULL_TREE; | |
9947 | tree decls = NULL_TREE; | |
b344d949 | 9948 | tree parm; |
5cce22b6 | 9949 | int any_error = 0; |
8d08fdba | 9950 | |
b344d949 | 9951 | for (parm = parmlist; parm != NULL_TREE; parm = TREE_CHAIN (parm)) |
8d08fdba | 9952 | { |
0657c69c | 9953 | tree type = NULL_TREE; |
b344d949 JM |
9954 | tree init = TREE_PURPOSE (parm); |
9955 | tree decl = TREE_VALUE (parm); | |
40449a90 | 9956 | const char *errmsg; |
8d08fdba | 9957 | |
b344d949 | 9958 | if (parm == void_list_node) |
0cbd7506 | 9959 | break; |
8d08fdba | 9960 | |
5cce22b6 | 9961 | if (! decl || TREE_TYPE (decl) == error_mark_node) |
0cbd7506 | 9962 | continue; |
d363e7bf | 9963 | |
5cce22b6 NS |
9964 | type = TREE_TYPE (decl); |
9965 | if (VOID_TYPE_P (type)) | |
0cbd7506 MS |
9966 | { |
9967 | if (same_type_p (type, void_type_node) | |
e7e53192 | 9968 | && DECL_SELF_REFERENCE_P (type) |
b344d949 | 9969 | && !DECL_NAME (decl) && !result && TREE_CHAIN (parm) == void_list_node) |
0cbd7506 MS |
9970 | /* this is a parmlist of `(void)', which is ok. */ |
9971 | break; | |
9972 | cxx_incomplete_type_error (decl, type); | |
0657c69c MM |
9973 | /* It's not a good idea to actually create parameters of |
9974 | type `void'; other parts of the compiler assume that a | |
9975 | void type terminates the parameter list. */ | |
04f3dc2b | 9976 | type = error_mark_node; |
0657c69c | 9977 | TREE_TYPE (decl) = error_mark_node; |
0cbd7506 | 9978 | } |
8d08fdba | 9979 | |
360f866c JJ |
9980 | if (type != error_mark_node |
9981 | && TYPE_FOR_JAVA (type) | |
9e1e64ec | 9982 | && MAYBE_CLASS_TYPE_P (type)) |
360f866c JJ |
9983 | { |
9984 | error ("parameter %qD has Java class type", decl); | |
9985 | type = error_mark_node; | |
9986 | TREE_TYPE (decl) = error_mark_node; | |
9987 | init = NULL_TREE; | |
9988 | } | |
9989 | ||
40449a90 SL |
9990 | if (type != error_mark_node |
9991 | && (errmsg = targetm.invalid_parameter_type (type))) | |
9992 | { | |
9993 | error (errmsg); | |
9994 | type = error_mark_node; | |
9995 | TREE_TYPE (decl) = error_mark_node; | |
9996 | } | |
9997 | ||
d363e7bf | 9998 | if (type != error_mark_node) |
04f3dc2b | 9999 | { |
b344d949 JM |
10000 | if (deprecated_state != DEPRECATED_SUPPRESS) |
10001 | { | |
10002 | tree deptype = type_is_deprecated (type); | |
10003 | if (deptype) | |
9b86d6bb | 10004 | warn_deprecated_use (deptype, NULL_TREE); |
b344d949 JM |
10005 | } |
10006 | ||
04f3dc2b MM |
10007 | /* Top-level qualifiers on the parameters are |
10008 | ignored for function types. */ | |
79a1a736 | 10009 | type = cp_build_qualified_type (type, 0); |
04f3dc2b MM |
10010 | if (TREE_CODE (type) == METHOD_TYPE) |
10011 | { | |
2d01edd7 | 10012 | error ("parameter %qD invalidly declared method type", decl); |
04f3dc2b MM |
10013 | type = build_pointer_type (type); |
10014 | TREE_TYPE (decl) = type; | |
10015 | } | |
04f3dc2b | 10016 | else if (abstract_virtuals_error (decl, type)) |
a1c65f9f | 10017 | any_error = 1; /* Seems like a good idea. */ |
04f3dc2b MM |
10018 | else if (POINTER_TYPE_P (type)) |
10019 | { | |
10020 | /* [dcl.fct]/6, parameter types cannot contain pointers | |
10021 | (references) to arrays of unknown bound. */ | |
98979fe0 NS |
10022 | tree t = TREE_TYPE (type); |
10023 | int ptr = TYPE_PTR_P (type); | |
10024 | ||
0cbd7506 MS |
10025 | while (1) |
10026 | { | |
10027 | if (TYPE_PTR_P (t)) | |
10028 | ptr = 1; | |
10029 | else if (TREE_CODE (t) != ARRAY_TYPE) | |
10030 | break; | |
10031 | else if (!TYPE_DOMAIN (t)) | |
10032 | break; | |
10033 | t = TREE_TYPE (t); | |
10034 | } | |
04f3dc2b | 10035 | if (TREE_CODE (t) == ARRAY_TYPE) |
4cd5a50a PB |
10036 | error (ptr |
10037 | ? G_("parameter %qD includes pointer to array of " | |
10038 | "unknown bound %qT") | |
10039 | : G_("parameter %qD includes reference to array of " | |
10040 | "unknown bound %qT"), | |
10041 | decl, t); | |
04f3dc2b MM |
10042 | } |
10043 | ||
c3ee4651 | 10044 | if (any_error) |
04f3dc2b | 10045 | init = NULL_TREE; |
c3ee4651 NS |
10046 | else if (init && !processing_template_decl) |
10047 | init = check_default_argument (decl, init); | |
04f3dc2b | 10048 | } |
8d08fdba | 10049 | |
5d80a306 DG |
10050 | if (TREE_CODE (decl) == PARM_DECL |
10051 | && FUNCTION_PARAMETER_PACK_P (decl) | |
b344d949 JM |
10052 | && TREE_CHAIN (parm) |
10053 | && TREE_CHAIN (parm) != void_list_node) | |
5d80a306 DG |
10054 | error ("parameter packs must be at the end of the parameter list"); |
10055 | ||
5cce22b6 NS |
10056 | TREE_CHAIN (decl) = decls; |
10057 | decls = decl; | |
0657c69c | 10058 | result = tree_cons (init, type, result); |
8d08fdba | 10059 | } |
5cce22b6 NS |
10060 | decls = nreverse (decls); |
10061 | result = nreverse (result); | |
b344d949 | 10062 | if (parm) |
5cce22b6 | 10063 | result = chainon (result, void_list_node); |
4546865e | 10064 | *parms = decls; |
8d08fdba | 10065 | |
8d08fdba MS |
10066 | return result; |
10067 | } | |
42976354 | 10068 | |
8d08fdba | 10069 | \f |
271e6f02 NS |
10070 | /* D is a constructor or overloaded `operator='. |
10071 | ||
10072 | Let T be the class in which D is declared. Then, this function | |
10073 | returns: | |
10074 | ||
10075 | -1 if D's is an ill-formed constructor or copy assignment operator | |
10076 | whose first parameter is of type `T'. | |
10077 | 0 if D is not a copy constructor or copy assignment | |
10078 | operator. | |
10079 | 1 if D is a copy constructor or copy assignment operator whose | |
271e6f02 | 10080 | first parameter is a reference to non-const qualified T. |
20f2653e JM |
10081 | 2 if D is a copy constructor or copy assignment operator whose |
10082 | first parameter is a reference to const qualified T. | |
271e6f02 NS |
10083 | |
10084 | This function can be used as a predicate. Positive values indicate | |
838dfd8a | 10085 | a copy constructor and nonzero values indicate a copy assignment |
4f1c5b7d MM |
10086 | operator. */ |
10087 | ||
c11b6f21 | 10088 | int |
58f9752a | 10089 | copy_fn_p (const_tree d) |
c11b6f21 | 10090 | { |
271e6f02 NS |
10091 | tree args; |
10092 | tree arg_type; | |
10093 | int result = 1; | |
caf93cb0 | 10094 | |
398cd199 | 10095 | gcc_assert (DECL_FUNCTION_MEMBER_P (d)); |
4f1c5b7d | 10096 | |
7137605e MM |
10097 | if (TREE_CODE (d) == TEMPLATE_DECL |
10098 | || (DECL_TEMPLATE_INFO (d) | |
10099 | && DECL_MEMBER_TEMPLATE_P (DECL_TI_TEMPLATE (d)))) | |
271e6f02 NS |
10100 | /* Instantiations of template member functions are never copy |
10101 | functions. Note that member functions of templated classes are | |
10102 | represented as template functions internally, and we must | |
10103 | accept those as copy functions. */ | |
10104 | return 0; | |
caf93cb0 | 10105 | |
271e6f02 NS |
10106 | args = FUNCTION_FIRST_USER_PARMTYPE (d); |
10107 | if (!args) | |
4f1c5b7d MM |
10108 | return 0; |
10109 | ||
271e6f02 | 10110 | arg_type = TREE_VALUE (args); |
139a78c7 VR |
10111 | if (arg_type == error_mark_node) |
10112 | return 0; | |
271e6f02 NS |
10113 | |
10114 | if (TYPE_MAIN_VARIANT (arg_type) == DECL_CONTEXT (d)) | |
10115 | { | |
10116 | /* Pass by value copy assignment operator. */ | |
10117 | result = -1; | |
10118 | } | |
10119 | else if (TREE_CODE (arg_type) == REFERENCE_TYPE | |
8af2fec4 | 10120 | && !TYPE_REF_IS_RVALUE (arg_type) |
271e6f02 NS |
10121 | && TYPE_MAIN_VARIANT (TREE_TYPE (arg_type)) == DECL_CONTEXT (d)) |
10122 | { | |
10123 | if (CP_TYPE_CONST_P (TREE_TYPE (arg_type))) | |
10124 | result = 2; | |
10125 | } | |
10126 | else | |
10127 | return 0; | |
caf93cb0 | 10128 | |
271e6f02 NS |
10129 | args = TREE_CHAIN (args); |
10130 | ||
10131 | if (args && args != void_list_node && !TREE_PURPOSE (args)) | |
10132 | /* There are more non-optional args. */ | |
10133 | return 0; | |
10134 | ||
10135 | return result; | |
10136 | } | |
10137 | ||
8af2fec4 RY |
10138 | /* D is a constructor or overloaded `operator='. |
10139 | ||
10140 | Let T be the class in which D is declared. Then, this function | |
10141 | returns true when D is a move constructor or move assignment | |
10142 | operator, false otherwise. */ | |
10143 | ||
10144 | bool | |
58f9752a | 10145 | move_fn_p (const_tree d) |
8af2fec4 RY |
10146 | { |
10147 | tree args; | |
10148 | tree arg_type; | |
10149 | bool result = false; | |
10150 | ||
10151 | gcc_assert (DECL_FUNCTION_MEMBER_P (d)); | |
10152 | ||
c1ae8be5 SM |
10153 | if (cxx_dialect == cxx98) |
10154 | /* There are no move constructors if we are in C++98 mode. */ | |
8af2fec4 RY |
10155 | return false; |
10156 | ||
10157 | if (TREE_CODE (d) == TEMPLATE_DECL | |
10158 | || (DECL_TEMPLATE_INFO (d) | |
10159 | && DECL_MEMBER_TEMPLATE_P (DECL_TI_TEMPLATE (d)))) | |
10160 | /* Instantiations of template member functions are never copy | |
10161 | functions. Note that member functions of templated classes are | |
10162 | represented as template functions internally, and we must | |
10163 | accept those as copy functions. */ | |
10164 | return 0; | |
10165 | ||
10166 | args = FUNCTION_FIRST_USER_PARMTYPE (d); | |
10167 | if (!args) | |
10168 | return 0; | |
10169 | ||
10170 | arg_type = TREE_VALUE (args); | |
10171 | if (arg_type == error_mark_node) | |
10172 | return 0; | |
10173 | ||
10174 | if (TREE_CODE (arg_type) == REFERENCE_TYPE | |
10175 | && TYPE_REF_IS_RVALUE (arg_type) | |
10176 | && same_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (arg_type)), | |
10177 | DECL_CONTEXT (d))) | |
10178 | result = true; | |
10179 | ||
10180 | args = TREE_CHAIN (args); | |
10181 | ||
10182 | if (args && args != void_list_node && !TREE_PURPOSE (args)) | |
10183 | /* There are more non-optional args. */ | |
10184 | return false; | |
10185 | ||
10186 | return result; | |
10187 | } | |
10188 | ||
271e6f02 NS |
10189 | /* Remember any special properties of member function DECL. */ |
10190 | ||
0fcedd9c JM |
10191 | void |
10192 | grok_special_member_properties (tree decl) | |
271e6f02 | 10193 | { |
7137605e MM |
10194 | tree class_type; |
10195 | ||
6d69fe27 | 10196 | if (!DECL_NONSTATIC_MEMBER_FUNCTION_P (decl)) |
7137605e MM |
10197 | return; |
10198 | ||
10199 | class_type = DECL_CONTEXT (decl); | |
10200 | if (DECL_CONSTRUCTOR_P (decl)) | |
271e6f02 NS |
10201 | { |
10202 | int ctor = copy_fn_p (decl); | |
caf93cb0 | 10203 | |
0fcedd9c JM |
10204 | if (!DECL_ARTIFICIAL (decl)) |
10205 | TYPE_HAS_USER_CONSTRUCTOR (class_type) = 1; | |
7137605e | 10206 | |
271e6f02 NS |
10207 | if (ctor > 0) |
10208 | { | |
10209 | /* [class.copy] | |
caf93cb0 | 10210 | |
0cbd7506 MS |
10211 | A non-template constructor for class X is a copy |
10212 | constructor if its first parameter is of type X&, const | |
10213 | X&, volatile X& or const volatile X&, and either there | |
10214 | are no other parameters or else all other parameters have | |
10215 | default arguments. */ | |
7137605e | 10216 | TYPE_HAS_INIT_REF (class_type) = 1; |
20f2653e | 10217 | if (user_provided_p (decl)) |
b87d79e6 | 10218 | TYPE_HAS_COMPLEX_INIT_REF (class_type) = 1; |
271e6f02 | 10219 | if (ctor > 1) |
7137605e | 10220 | TYPE_HAS_CONST_INIT_REF (class_type) = 1; |
271e6f02 NS |
10221 | } |
10222 | else if (sufficient_parms_p (FUNCTION_FIRST_USER_PARMTYPE (decl))) | |
f782c65c JM |
10223 | { |
10224 | TYPE_HAS_DEFAULT_CONSTRUCTOR (class_type) = 1; | |
20f2653e | 10225 | if (user_provided_p (decl)) |
f782c65c JM |
10226 | TYPE_HAS_COMPLEX_DFLT (class_type) = 1; |
10227 | } | |
09357846 JM |
10228 | else if (is_list_ctor (decl)) |
10229 | TYPE_HAS_LIST_CTOR (class_type) = 1; | |
271e6f02 NS |
10230 | } |
10231 | else if (DECL_OVERLOADED_OPERATOR_P (decl) == NOP_EXPR) | |
10232 | { | |
10233 | /* [class.copy] | |
caf93cb0 | 10234 | |
0cbd7506 MS |
10235 | A non-template assignment operator for class X is a copy |
10236 | assignment operator if its parameter is of type X, X&, const | |
10237 | X&, volatile X& or const volatile X&. */ | |
caf93cb0 | 10238 | |
271e6f02 | 10239 | int assop = copy_fn_p (decl); |
caf93cb0 | 10240 | |
271e6f02 NS |
10241 | if (assop) |
10242 | { | |
7137605e | 10243 | TYPE_HAS_ASSIGN_REF (class_type) = 1; |
20f2653e | 10244 | if (user_provided_p (decl)) |
b87d79e6 | 10245 | TYPE_HAS_COMPLEX_ASSIGN_REF (class_type) = 1; |
271e6f02 | 10246 | if (assop != 1) |
7137605e | 10247 | TYPE_HAS_CONST_ASSIGN_REF (class_type) = 1; |
271e6f02 NS |
10248 | } |
10249 | } | |
c11b6f21 MS |
10250 | } |
10251 | ||
271e6f02 NS |
10252 | /* Check a constructor DECL has the correct form. Complains |
10253 | if the class has a constructor of the form X(X). */ | |
e92cc029 | 10254 | |
a0a33927 | 10255 | int |
58f9752a | 10256 | grok_ctor_properties (const_tree ctype, const_tree decl) |
8d08fdba | 10257 | { |
271e6f02 NS |
10258 | int ctor_parm = copy_fn_p (decl); |
10259 | ||
10260 | if (ctor_parm < 0) | |
10261 | { | |
10262 | /* [class.copy] | |
caf93cb0 | 10263 | |
0cbd7506 MS |
10264 | A declaration of a constructor for a class X is ill-formed if |
10265 | its first parameter is of type (optionally cv-qualified) X | |
10266 | and either there are no other parameters or else all other | |
10267 | parameters have default arguments. | |
10268 | ||
10269 | We *don't* complain about member template instantiations that | |
10270 | have this form, though; they can occur as we try to decide | |
10271 | what constructor to use during overload resolution. Since | |
10272 | overload resolution will never prefer such a constructor to | |
10273 | the non-template copy constructor (which is either explicitly | |
10274 | or implicitly defined), there's no need to worry about their | |
10275 | existence. Theoretically, they should never even be | |
10276 | instantiated, but that's hard to forestall. */ | |
2d01edd7 | 10277 | error ("invalid constructor; you probably meant %<%T (const %T&)%>", |
0b41abe6 | 10278 | ctype, ctype); |
0b41abe6 | 10279 | return 0; |
8d08fdba | 10280 | } |
caf93cb0 | 10281 | |
a0a33927 | 10282 | return 1; |
8d08fdba MS |
10283 | } |
10284 | ||
596ea4e5 | 10285 | /* An operator with this code is unary, but can also be binary. */ |
e92cc029 | 10286 | |
a28e3c7f | 10287 | static int |
11f6b451 | 10288 | ambi_op_p (enum tree_code code) |
8d08fdba | 10289 | { |
596ea4e5 AS |
10290 | return (code == INDIRECT_REF |
10291 | || code == ADDR_EXPR | |
392e3d51 | 10292 | || code == UNARY_PLUS_EXPR |
596ea4e5 AS |
10293 | || code == NEGATE_EXPR |
10294 | || code == PREINCREMENT_EXPR | |
10295 | || code == PREDECREMENT_EXPR); | |
8d08fdba MS |
10296 | } |
10297 | ||
10298 | /* An operator with this name can only be unary. */ | |
e92cc029 | 10299 | |
a28e3c7f | 10300 | static int |
11f6b451 | 10301 | unary_op_p (enum tree_code code) |
8d08fdba | 10302 | { |
596ea4e5 AS |
10303 | return (code == TRUTH_NOT_EXPR |
10304 | || code == BIT_NOT_EXPR | |
10305 | || code == COMPONENT_REF | |
10306 | || code == TYPE_EXPR); | |
8d08fdba MS |
10307 | } |
10308 | ||
f2a79152 | 10309 | /* DECL is a declaration for an overloaded operator. If COMPLAIN is true, |
4b0d3cbe | 10310 | errors are issued for invalid declarations. */ |
e92cc029 | 10311 | |
398cd199 | 10312 | bool |
7e45bd18 | 10313 | grok_op_properties (tree decl, bool complain) |
8d08fdba MS |
10314 | { |
10315 | tree argtypes = TYPE_ARG_TYPES (TREE_TYPE (decl)); | |
596ea4e5 | 10316 | tree argtype; |
8d08fdba MS |
10317 | int methodp = (TREE_CODE (TREE_TYPE (decl)) == METHOD_TYPE); |
10318 | tree name = DECL_NAME (decl); | |
596ea4e5 AS |
10319 | enum tree_code operator_code; |
10320 | int arity; | |
64844139 | 10321 | bool ellipsis_p; |
7e45bd18 | 10322 | tree class_type; |
596ea4e5 | 10323 | |
64844139 | 10324 | /* Count the number of arguments and check for ellipsis. */ |
596ea4e5 AS |
10325 | for (argtype = argtypes, arity = 0; |
10326 | argtype && argtype != void_list_node; | |
10327 | argtype = TREE_CHAIN (argtype)) | |
10328 | ++arity; | |
64844139 | 10329 | ellipsis_p = !argtype; |
8d08fdba | 10330 | |
7e45bd18 MM |
10331 | class_type = DECL_CONTEXT (decl); |
10332 | if (class_type && !CLASS_TYPE_P (class_type)) | |
10333 | class_type = NULL_TREE; | |
8d08fdba | 10334 | |
596ea4e5 AS |
10335 | if (DECL_CONV_FN_P (decl)) |
10336 | operator_code = TYPE_EXPR; | |
10337 | else | |
10338 | do | |
10339 | { | |
0c918ce5 MM |
10340 | #define DEF_OPERATOR(NAME, CODE, MANGLING, ARITY, ASSN_P) \ |
10341 | if (ansi_opname (CODE) == name) \ | |
10342 | { \ | |
75ac8dec | 10343 | operator_code = (CODE); \ |
0c918ce5 MM |
10344 | break; \ |
10345 | } \ | |
10346 | else if (ansi_assopname (CODE) == name) \ | |
10347 | { \ | |
75ac8dec | 10348 | operator_code = (CODE); \ |
0c918ce5 MM |
10349 | DECL_ASSIGNMENT_OPERATOR_P (decl) = 1; \ |
10350 | break; \ | |
596ea4e5 AS |
10351 | } |
10352 | ||
10353 | #include "operators.def" | |
10354 | #undef DEF_OPERATOR | |
10355 | ||
8dc2b103 | 10356 | gcc_unreachable (); |
596ea4e5 AS |
10357 | } |
10358 | while (0); | |
c0ed0531 | 10359 | gcc_assert (operator_code != MAX_TREE_CODES); |
596ea4e5 AS |
10360 | SET_OVERLOADED_OPERATOR_CODE (decl, operator_code); |
10361 | ||
7e45bd18 MM |
10362 | if (class_type) |
10363 | switch (operator_code) | |
10364 | { | |
10365 | case NEW_EXPR: | |
10366 | TYPE_HAS_NEW_OPERATOR (class_type) = 1; | |
10367 | break; | |
5362b086 | 10368 | |
7e45bd18 MM |
10369 | case DELETE_EXPR: |
10370 | TYPE_GETS_DELETE (class_type) |= 1; | |
10371 | break; | |
5362b086 | 10372 | |
7e45bd18 MM |
10373 | case VEC_NEW_EXPR: |
10374 | TYPE_HAS_ARRAY_NEW_OPERATOR (class_type) = 1; | |
10375 | break; | |
5362b086 | 10376 | |
7e45bd18 MM |
10377 | case VEC_DELETE_EXPR: |
10378 | TYPE_GETS_DELETE (class_type) |= 2; | |
10379 | break; | |
596ea4e5 | 10380 | |
7e45bd18 MM |
10381 | default: |
10382 | break; | |
10383 | } | |
596ea4e5 | 10384 | |
3143d517 GB |
10385 | /* [basic.std.dynamic.allocation]/1: |
10386 | ||
10387 | A program is ill-formed if an allocation function is declared | |
10388 | in a namespace scope other than global scope or declared static | |
10389 | in global scope. | |
10390 | ||
10391 | The same also holds true for deallocation functions. */ | |
10392 | if (operator_code == NEW_EXPR || operator_code == VEC_NEW_EXPR | |
10393 | || operator_code == DELETE_EXPR || operator_code == VEC_DELETE_EXPR) | |
10394 | { | |
10395 | if (DECL_NAMESPACE_SCOPE_P (decl)) | |
10396 | { | |
10397 | if (CP_DECL_CONTEXT (decl) != global_namespace) | |
398cd199 VR |
10398 | { |
10399 | error ("%qD may not be declared within a namespace", decl); | |
10400 | return false; | |
10401 | } | |
3143d517 | 10402 | else if (!TREE_PUBLIC (decl)) |
398cd199 VR |
10403 | { |
10404 | error ("%qD may not be declared as static", decl); | |
10405 | return false; | |
10406 | } | |
3143d517 GB |
10407 | } |
10408 | } | |
10409 | ||
596ea4e5 | 10410 | if (operator_code == NEW_EXPR || operator_code == VEC_NEW_EXPR) |
1ea193c2 ILT |
10411 | { |
10412 | TREE_TYPE (decl) = coerce_new_type (TREE_TYPE (decl)); | |
10413 | DECL_IS_OPERATOR_NEW (decl) = 1; | |
10414 | } | |
596ea4e5 | 10415 | else if (operator_code == DELETE_EXPR || operator_code == VEC_DELETE_EXPR) |
4546865e | 10416 | TREE_TYPE (decl) = coerce_delete_type (TREE_TYPE (decl)); |
8d08fdba MS |
10417 | else |
10418 | { | |
10419 | /* An operator function must either be a non-static member function | |
10420 | or have at least one parameter of a class, a reference to a class, | |
10421 | an enumeration, or a reference to an enumeration. 13.4.0.6 */ | |
700f8a87 | 10422 | if (! methodp || DECL_STATIC_FUNCTION_P (decl)) |
8d08fdba | 10423 | { |
596ea4e5 AS |
10424 | if (operator_code == TYPE_EXPR |
10425 | || operator_code == CALL_EXPR | |
10426 | || operator_code == COMPONENT_REF | |
10427 | || operator_code == ARRAY_REF | |
10428 | || operator_code == NOP_EXPR) | |
f2a79152 | 10429 | { |
c6be04ad JM |
10430 | error ("%qD must be a nonstatic member function", decl); |
10431 | return false; | |
f2a79152 | 10432 | } |
8d08fdba MS |
10433 | else |
10434 | { | |
4b0d3cbe | 10435 | tree p; |
8d08fdba | 10436 | |
700f8a87 | 10437 | if (DECL_STATIC_FUNCTION_P (decl)) |
f2a79152 PC |
10438 | { |
10439 | error ("%qD must be either a non-static member " | |
10440 | "function or a non-member function", decl); | |
398cd199 | 10441 | return false; |
f2a79152 | 10442 | } |
700f8a87 | 10443 | |
4b0d3cbe MM |
10444 | for (p = argtypes; p && p != void_list_node; p = TREE_CHAIN (p)) |
10445 | { | |
10446 | tree arg = non_reference (TREE_VALUE (p)); | |
85990800 | 10447 | if (arg == error_mark_node) |
398cd199 | 10448 | return false; |
85990800 | 10449 | |
9e1e64ec | 10450 | /* MAYBE_CLASS_TYPE_P, rather than CLASS_TYPE_P, is used |
4b0d3cbe MM |
10451 | because these checks are performed even on |
10452 | template functions. */ | |
9e1e64ec PC |
10453 | if (MAYBE_CLASS_TYPE_P (arg) |
10454 | || TREE_CODE (arg) == ENUMERAL_TYPE) | |
4b0d3cbe MM |
10455 | break; |
10456 | } | |
10457 | ||
10458 | if (!p || p == void_list_node) | |
10459 | { | |
398cd199 VR |
10460 | if (complain) |
10461 | error ("%qD must have an argument of class or " | |
10462 | "enumerated type", decl); | |
10463 | return false; | |
4b0d3cbe | 10464 | } |
8d08fdba MS |
10465 | } |
10466 | } | |
68642fb6 | 10467 | |
4b0d3cbe MM |
10468 | /* There are no restrictions on the arguments to an overloaded |
10469 | "operator ()". */ | |
596ea4e5 | 10470 | if (operator_code == CALL_EXPR) |
398cd199 | 10471 | return true; |
8d08fdba | 10472 | |
7e45bd18 | 10473 | /* Warn about conversion operators that will never be used. */ |
c8094d83 | 10474 | if (IDENTIFIER_TYPENAME_P (name) |
7e45bd18 MM |
10475 | && ! DECL_TEMPLATE_INFO (decl) |
10476 | && warn_conversion | |
10477 | /* Warn only declaring the function; there is no need to | |
10478 | warn again about out-of-class definitions. */ | |
10479 | && class_type == current_class_type) | |
a0a33927 MS |
10480 | { |
10481 | tree t = TREE_TYPE (name); | |
7e45bd18 | 10482 | int ref = (TREE_CODE (t) == REFERENCE_TYPE); |
5362b086 | 10483 | |
7e45bd18 MM |
10484 | if (ref) |
10485 | t = TYPE_MAIN_VARIANT (TREE_TYPE (t)); | |
a0a33927 | 10486 | |
7e45bd18 | 10487 | if (TREE_CODE (t) == VOID_TYPE) |
4cd5a50a PB |
10488 | warning (OPT_Wconversion, |
10489 | ref | |
10490 | ? G_("conversion to a reference to void " | |
10491 | "will never use a type conversion operator") | |
10492 | : G_("conversion to void " | |
10493 | "will never use a type conversion operator")); | |
7e45bd18 MM |
10494 | else if (class_type) |
10495 | { | |
10496 | if (t == class_type) | |
4cd5a50a PB |
10497 | warning (OPT_Wconversion, |
10498 | ref | |
10499 | ? G_("conversion to a reference to the same type " | |
10500 | "will never use a type conversion operator") | |
10501 | : G_("conversion to the same type " | |
10502 | "will never use a type conversion operator")); | |
9a3b49ac | 10503 | /* Don't force t to be complete here. */ |
9e1e64ec | 10504 | else if (MAYBE_CLASS_TYPE_P (t) |
d0f062fb | 10505 | && COMPLETE_TYPE_P (t) |
7e45bd18 | 10506 | && DERIVED_FROM_P (t, class_type)) |
4cd5a50a PB |
10507 | warning (OPT_Wconversion, |
10508 | ref | |
10509 | ? G_("conversion to a reference to a base class " | |
10510 | "will never use a type conversion operator") | |
10511 | : G_("conversion to a base class " | |
10512 | "will never use a type conversion operator")); | |
a0a33927 | 10513 | } |
7e45bd18 | 10514 | |
a0a33927 | 10515 | } |
64844139 | 10516 | |
271e6f02 | 10517 | if (operator_code == COND_EXPR) |
8d08fdba MS |
10518 | { |
10519 | /* 13.4.0.3 */ | |
33bd39a2 | 10520 | error ("ISO C++ prohibits overloading operator ?:"); |
398cd199 | 10521 | return false; |
68642fb6 | 10522 | } |
64844139 | 10523 | else if (ellipsis_p) |
398cd199 VR |
10524 | { |
10525 | error ("%qD must not have variable number of arguments", decl); | |
10526 | return false; | |
10527 | } | |
596ea4e5 | 10528 | else if (ambi_op_p (operator_code)) |
8d08fdba | 10529 | { |
596ea4e5 AS |
10530 | if (arity == 1) |
10531 | /* We pick the one-argument operator codes by default, so | |
10532 | we don't have to change anything. */ | |
10533 | ; | |
10534 | else if (arity == 2) | |
8d08fdba | 10535 | { |
596ea4e5 AS |
10536 | /* If we thought this was a unary operator, we now know |
10537 | it to be a binary operator. */ | |
10538 | switch (operator_code) | |
10539 | { | |
10540 | case INDIRECT_REF: | |
10541 | operator_code = MULT_EXPR; | |
10542 | break; | |
10543 | ||
10544 | case ADDR_EXPR: | |
10545 | operator_code = BIT_AND_EXPR; | |
10546 | break; | |
10547 | ||
392e3d51 | 10548 | case UNARY_PLUS_EXPR: |
596ea4e5 AS |
10549 | operator_code = PLUS_EXPR; |
10550 | break; | |
10551 | ||
10552 | case NEGATE_EXPR: | |
10553 | operator_code = MINUS_EXPR; | |
10554 | break; | |
10555 | ||
10556 | case PREINCREMENT_EXPR: | |
10557 | operator_code = POSTINCREMENT_EXPR; | |
10558 | break; | |
10559 | ||
10560 | case PREDECREMENT_EXPR: | |
655dc6ee | 10561 | operator_code = POSTDECREMENT_EXPR; |
596ea4e5 AS |
10562 | break; |
10563 | ||
10564 | default: | |
8dc2b103 | 10565 | gcc_unreachable (); |
596ea4e5 AS |
10566 | } |
10567 | ||
10568 | SET_OVERLOADED_OPERATOR_CODE (decl, operator_code); | |
10569 | ||
10570 | if ((operator_code == POSTINCREMENT_EXPR | |
10571 | || operator_code == POSTDECREMENT_EXPR) | |
5156628f | 10572 | && ! processing_template_decl |
007e5fea | 10573 | && ! same_type_p (TREE_VALUE (TREE_CHAIN (argtypes)), integer_type_node)) |
8d08fdba MS |
10574 | { |
10575 | if (methodp) | |
2d01edd7 | 10576 | error ("postfix %qD must take %<int%> as its argument", |
398cd199 | 10577 | decl); |
8d08fdba | 10578 | else |
398cd199 VR |
10579 | error ("postfix %qD must take %<int%> as its second " |
10580 | "argument", decl); | |
10581 | return false; | |
8d08fdba MS |
10582 | } |
10583 | } | |
10584 | else | |
10585 | { | |
10586 | if (methodp) | |
2d01edd7 | 10587 | error ("%qD must take either zero or one argument", decl); |
8d08fdba | 10588 | else |
2d01edd7 | 10589 | error ("%qD must take either one or two arguments", decl); |
398cd199 | 10590 | return false; |
8d08fdba | 10591 | } |
824b9a4c MS |
10592 | |
10593 | /* More Effective C++ rule 6. */ | |
eb448459 | 10594 | if (warn_ecpp |
596ea4e5 AS |
10595 | && (operator_code == POSTINCREMENT_EXPR |
10596 | || operator_code == POSTDECREMENT_EXPR | |
10597 | || operator_code == PREINCREMENT_EXPR | |
10598 | || operator_code == PREDECREMENT_EXPR)) | |
824b9a4c MS |
10599 | { |
10600 | tree arg = TREE_VALUE (argtypes); | |
10601 | tree ret = TREE_TYPE (TREE_TYPE (decl)); | |
10602 | if (methodp || TREE_CODE (arg) == REFERENCE_TYPE) | |
10603 | arg = TREE_TYPE (arg); | |
10604 | arg = TYPE_MAIN_VARIANT (arg); | |
596ea4e5 AS |
10605 | if (operator_code == PREINCREMENT_EXPR |
10606 | || operator_code == PREDECREMENT_EXPR) | |
824b9a4c MS |
10607 | { |
10608 | if (TREE_CODE (ret) != REFERENCE_TYPE | |
3bfdc719 MM |
10609 | || !same_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (ret)), |
10610 | arg)) | |
b323323f | 10611 | warning (OPT_Weffc__, "prefix %qD should return %qT", decl, |
0cbd7506 | 10612 | build_reference_type (arg)); |
824b9a4c MS |
10613 | } |
10614 | else | |
10615 | { | |
3bfdc719 | 10616 | if (!same_type_p (TYPE_MAIN_VARIANT (ret), arg)) |
b323323f | 10617 | warning (OPT_Weffc__, "postfix %qD should return %qT", decl, arg); |
824b9a4c MS |
10618 | } |
10619 | } | |
8d08fdba | 10620 | } |
596ea4e5 | 10621 | else if (unary_op_p (operator_code)) |
8d08fdba | 10622 | { |
596ea4e5 | 10623 | if (arity != 1) |
8d08fdba MS |
10624 | { |
10625 | if (methodp) | |
2d01edd7 | 10626 | error ("%qD must take %<void%>", decl); |
8d08fdba | 10627 | else |
2d01edd7 | 10628 | error ("%qD must take exactly one argument", decl); |
398cd199 | 10629 | return false; |
8d08fdba MS |
10630 | } |
10631 | } | |
596ea4e5 | 10632 | else /* if (binary_op_p (operator_code)) */ |
8d08fdba | 10633 | { |
596ea4e5 | 10634 | if (arity != 2) |
8d08fdba MS |
10635 | { |
10636 | if (methodp) | |
2d01edd7 | 10637 | error ("%qD must take exactly one argument", decl); |
8d08fdba | 10638 | else |
2d01edd7 | 10639 | error ("%qD must take exactly two arguments", decl); |
398cd199 | 10640 | return false; |
8d08fdba | 10641 | } |
824b9a4c MS |
10642 | |
10643 | /* More Effective C++ rule 7. */ | |
eb448459 | 10644 | if (warn_ecpp |
596ea4e5 AS |
10645 | && (operator_code == TRUTH_ANDIF_EXPR |
10646 | || operator_code == TRUTH_ORIF_EXPR | |
10647 | || operator_code == COMPOUND_EXPR)) | |
b323323f | 10648 | warning (OPT_Weffc__, "user-defined %qD always evaluates both arguments", |
0cbd7506 | 10649 | decl); |
824b9a4c MS |
10650 | } |
10651 | ||
10652 | /* Effective C++ rule 23. */ | |
eb448459 | 10653 | if (warn_ecpp |
596ea4e5 | 10654 | && arity == 2 |
4bd7c270 | 10655 | && !DECL_ASSIGNMENT_OPERATOR_P (decl) |
596ea4e5 AS |
10656 | && (operator_code == PLUS_EXPR |
10657 | || operator_code == MINUS_EXPR | |
10658 | || operator_code == TRUNC_DIV_EXPR | |
4bd7c270 NS |
10659 | || operator_code == MULT_EXPR |
10660 | || operator_code == TRUNC_MOD_EXPR) | |
824b9a4c | 10661 | && TREE_CODE (TREE_TYPE (TREE_TYPE (decl))) == REFERENCE_TYPE) |
b323323f | 10662 | warning (OPT_Weffc__, "%qD should return by value", decl); |
8d08fdba | 10663 | |
271e6f02 | 10664 | /* [over.oper]/8 */ |
34332678 | 10665 | for (; argtypes && argtypes != void_list_node; |
0cbd7506 MS |
10666 | argtypes = TREE_CHAIN (argtypes)) |
10667 | if (TREE_PURPOSE (argtypes)) | |
10668 | { | |
10669 | TREE_PURPOSE (argtypes) = NULL_TREE; | |
10670 | if (operator_code == POSTINCREMENT_EXPR | |
596ea4e5 | 10671 | || operator_code == POSTDECREMENT_EXPR) |
0cbd7506 | 10672 | { |
509c9d60 | 10673 | pedwarn (input_location, OPT_pedantic, "%qD cannot have default arguments", |
fcf73884 | 10674 | decl); |
0cbd7506 MS |
10675 | } |
10676 | else | |
398cd199 VR |
10677 | { |
10678 | error ("%qD cannot have default arguments", decl); | |
10679 | return false; | |
10680 | } | |
0cbd7506 | 10681 | } |
8d08fdba | 10682 | } |
398cd199 | 10683 | return true; |
8d08fdba MS |
10684 | } |
10685 | \f | |
0c88d886 MM |
10686 | /* Return a string giving the keyword associate with CODE. */ |
10687 | ||
d8e178a0 | 10688 | static const char * |
11f6b451 | 10689 | tag_name (enum tag_types code) |
094fe153 JM |
10690 | { |
10691 | switch (code) | |
10692 | { | |
10693 | case record_type: | |
10694 | return "struct"; | |
10695 | case class_type: | |
10696 | return "class"; | |
10697 | case union_type: | |
0c88d886 | 10698 | return "union"; |
094fe153 JM |
10699 | case enum_type: |
10700 | return "enum"; | |
0c88d886 MM |
10701 | case typename_type: |
10702 | return "typename"; | |
094fe153 | 10703 | default: |
8dc2b103 | 10704 | gcc_unreachable (); |
094fe153 JM |
10705 | } |
10706 | } | |
10707 | ||
befcd99b | 10708 | /* Name lookup in an elaborated-type-specifier (after the keyword |
4b0d3cbe | 10709 | indicated by TAG_CODE) has found the TYPE_DECL DECL. If the |
befcd99b | 10710 | elaborated-type-specifier is invalid, issue a diagnostic and return |
4b0d3cbe | 10711 | error_mark_node; otherwise, return the *_TYPE to which it referred. |
cbd63935 | 10712 | If ALLOW_TEMPLATE_P is true, TYPE may be a class template. */ |
befcd99b | 10713 | |
560ad596 | 10714 | tree |
befcd99b | 10715 | check_elaborated_type_specifier (enum tag_types tag_code, |
4b0d3cbe | 10716 | tree decl, |
cbd63935 | 10717 | bool allow_template_p) |
befcd99b | 10718 | { |
4b0d3cbe | 10719 | tree type; |
befcd99b | 10720 | |
4b0d3cbe MM |
10721 | /* In the case of: |
10722 | ||
10723 | struct S { struct S *p; }; | |
10724 | ||
10725 | name lookup will find the TYPE_DECL for the implicit "S::S" | |
10726 | typedef. Adjust for that here. */ | |
10727 | if (DECL_SELF_REFERENCE_P (decl)) | |
10728 | decl = TYPE_NAME (TREE_TYPE (decl)); | |
10729 | ||
10730 | type = TREE_TYPE (decl); | |
10731 | ||
461c6fce KL |
10732 | /* Check TEMPLATE_TYPE_PARM first because DECL_IMPLICIT_TYPEDEF_P |
10733 | is false for this case as well. */ | |
10734 | if (TREE_CODE (type) == TEMPLATE_TYPE_PARM) | |
10735 | { | |
10736 | error ("using template type parameter %qT after %qs", | |
10737 | type, tag_name (tag_code)); | |
10738 | return error_mark_node; | |
10739 | } | |
caf93cb0 | 10740 | /* [dcl.type.elab] |
4b0d3cbe MM |
10741 | |
10742 | If the identifier resolves to a typedef-name or a template | |
10743 | type-parameter, the elaborated-type-specifier is ill-formed. | |
10744 | ||
10745 | In other words, the only legitimate declaration to use in the | |
10746 | elaborated type specifier is the implicit typedef created when | |
10747 | the type is declared. */ | |
0c88d886 | 10748 | else if (!DECL_IMPLICIT_TYPEDEF_P (decl) |
98fba7f7 | 10749 | && !DECL_SELF_REFERENCE_P (decl) |
0c88d886 | 10750 | && tag_code != typename_type) |
befcd99b | 10751 | { |
2d01edd7 | 10752 | error ("using typedef-name %qD after %qs", decl, tag_name (tag_code)); |
dee15844 | 10753 | error ("%q+D has a previous declaration here", decl); |
4b0d3cbe | 10754 | return error_mark_node; |
befcd99b | 10755 | } |
cbd63935 KL |
10756 | else if (TREE_CODE (type) != RECORD_TYPE |
10757 | && TREE_CODE (type) != UNION_TYPE | |
0c88d886 MM |
10758 | && tag_code != enum_type |
10759 | && tag_code != typename_type) | |
cbd63935 | 10760 | { |
2d01edd7 | 10761 | error ("%qT referred to as %qs", type, tag_name (tag_code)); |
dee15844 | 10762 | error ("%q+T has a previous declaration here", type); |
4b0d3cbe | 10763 | return error_mark_node; |
cbd63935 KL |
10764 | } |
10765 | else if (TREE_CODE (type) != ENUMERAL_TYPE | |
4fe8db68 | 10766 | && tag_code == enum_type) |
cbd63935 | 10767 | { |
2d01edd7 | 10768 | error ("%qT referred to as enum", type); |
dee15844 | 10769 | error ("%q+T has a previous declaration here", type); |
4b0d3cbe | 10770 | return error_mark_node; |
cbd63935 KL |
10771 | } |
10772 | else if (!allow_template_p | |
10773 | && TREE_CODE (type) == RECORD_TYPE | |
10774 | && CLASSTYPE_IS_TEMPLATE (type)) | |
10775 | { | |
10776 | /* If a class template appears as elaborated type specifier | |
10777 | without a template header such as: | |
10778 | ||
10779 | template <class T> class C {}; | |
10780 | void f(class C); // No template header here | |
10781 | ||
10782 | then the required template argument is missing. */ | |
2d01edd7 | 10783 | error ("template argument required for %<%s %T%>", |
cbd63935 KL |
10784 | tag_name (tag_code), |
10785 | DECL_NAME (CLASSTYPE_TI_TEMPLATE (type))); | |
4b0d3cbe | 10786 | return error_mark_node; |
cbd63935 | 10787 | } |
befcd99b | 10788 | |
4b0d3cbe | 10789 | return type; |
befcd99b MM |
10790 | } |
10791 | ||
461c6fce | 10792 | /* Lookup NAME in elaborate type specifier in scope according to |
29ef83de | 10793 | SCOPE and issue diagnostics if necessary. |
461c6fce KL |
10794 | Return *_TYPE node upon success, NULL_TREE when the NAME is not |
10795 | found, and ERROR_MARK_NODE for type error. */ | |
10796 | ||
10797 | static tree | |
10798 | lookup_and_check_tag (enum tag_types tag_code, tree name, | |
29ef83de | 10799 | tag_scope scope, bool template_header_p) |
461c6fce KL |
10800 | { |
10801 | tree t; | |
10802 | tree decl; | |
29ef83de | 10803 | if (scope == ts_global) |
bd3d082e KL |
10804 | { |
10805 | /* First try ordinary name lookup, ignoring hidden class name | |
10806 | injected via friend declaration. */ | |
10e6657a | 10807 | decl = lookup_name_prefer_type (name, 2); |
bd3d082e KL |
10808 | /* If that fails, the name will be placed in the smallest |
10809 | non-class, non-function-prototype scope according to 3.3.1/5. | |
10810 | We may already have a hidden name declared as friend in this | |
105d72c5 | 10811 | scope. So lookup again but not ignoring hidden names. |
bd3d082e KL |
10812 | If we find one, that name will be made visible rather than |
10813 | creating a new tag. */ | |
10814 | if (!decl) | |
10815 | decl = lookup_type_scope (name, ts_within_enclosing_non_class); | |
10816 | } | |
461c6fce | 10817 | else |
29ef83de | 10818 | decl = lookup_type_scope (name, scope); |
461c6fce KL |
10819 | |
10820 | if (decl && DECL_CLASS_TEMPLATE_P (decl)) | |
10821 | decl = DECL_TEMPLATE_RESULT (decl); | |
10822 | ||
10823 | if (decl && TREE_CODE (decl) == TYPE_DECL) | |
10824 | { | |
4104f0f4 KL |
10825 | /* Look for invalid nested type: |
10826 | class C { | |
10827 | class C {}; | |
10828 | }; */ | |
10829 | if (scope == ts_current && DECL_SELF_REFERENCE_P (decl)) | |
10830 | { | |
10831 | error ("%qD has the same name as the class in which it is " | |
10832 | "declared", | |
10833 | decl); | |
10834 | return error_mark_node; | |
10835 | } | |
10836 | ||
461c6fce KL |
10837 | /* Two cases we need to consider when deciding if a class |
10838 | template is allowed as an elaborated type specifier: | |
10839 | 1. It is a self reference to its own class. | |
10840 | 2. It comes with a template header. | |
10841 | ||
10842 | For example: | |
10843 | ||
10844 | template <class T> class C { | |
10845 | class C *c1; // DECL_SELF_REFERENCE_P is true | |
10846 | class D; | |
10847 | }; | |
10848 | template <class U> class C; // template_header_p is true | |
10849 | template <class T> class C<T>::D { | |
10850 | class C *c2; // DECL_SELF_REFERENCE_P is true | |
10851 | }; */ | |
10852 | ||
10853 | t = check_elaborated_type_specifier (tag_code, | |
10854 | decl, | |
10855 | template_header_p | |
10856 | | DECL_SELF_REFERENCE_P (decl)); | |
10857 | return t; | |
10858 | } | |
af92ab36 OW |
10859 | else if (decl && TREE_CODE (decl) == TREE_LIST) |
10860 | { | |
10861 | error ("reference to %qD is ambiguous", name); | |
10862 | print_candidates (decl); | |
10863 | return error_mark_node; | |
10864 | } | |
461c6fce KL |
10865 | else |
10866 | return NULL_TREE; | |
10867 | } | |
10868 | ||
cbd63935 | 10869 | /* Get the struct, enum or union (TAG_CODE says which) with tag NAME. |
8d08fdba MS |
10870 | Define the tag as a forward-reference if it is not defined. |
10871 | ||
cbd63935 | 10872 | If a declaration is given, process it here, and report an error if |
38b305d0 | 10873 | multiple declarations are not identical. |
8d08fdba | 10874 | |
29ef83de | 10875 | SCOPE is TS_CURRENT when this is also a definition. Only look in |
8d08fdba | 10876 | the current frame for the name (since C++ allows new names in any |
29ef83de KL |
10877 | scope.) It is TS_WITHIN_ENCLOSING_NON_CLASS if this is a friend |
10878 | declaration. Only look beginning from the current scope outward up | |
10879 | till the nearest non-class scope. Otherwise it is TS_GLOBAL. | |
cbd63935 KL |
10880 | |
10881 | TEMPLATE_HEADER_P is true when this declaration is preceded by | |
10882 | a set of template parameters. */ | |
8d08fdba | 10883 | |
8d08fdba | 10884 | tree |
38b305d0 | 10885 | xref_tag (enum tag_types tag_code, tree name, |
29ef83de | 10886 | tag_scope scope, bool template_header_p) |
8d08fdba | 10887 | { |
8d08fdba | 10888 | enum tree_code code; |
926ce8bd | 10889 | tree t; |
25aab5d0 | 10890 | tree context = NULL_TREE; |
dc8263bc | 10891 | |
22ffcc6f | 10892 | timevar_push (TV_NAME_LOOKUP); |
cbd63935 | 10893 | |
50bc768d | 10894 | gcc_assert (TREE_CODE (name) == IDENTIFIER_NODE); |
cbd63935 | 10895 | |
8d08fdba MS |
10896 | switch (tag_code) |
10897 | { | |
10898 | case record_type: | |
10899 | case class_type: | |
8d08fdba | 10900 | code = RECORD_TYPE; |
8d08fdba MS |
10901 | break; |
10902 | case union_type: | |
10903 | code = UNION_TYPE; | |
8d08fdba MS |
10904 | break; |
10905 | case enum_type: | |
10906 | code = ENUMERAL_TYPE; | |
10907 | break; | |
10908 | default: | |
8dc2b103 | 10909 | gcc_unreachable (); |
8d08fdba MS |
10910 | } |
10911 | ||
461c6fce KL |
10912 | /* In case of anonymous name, xref_tag is only called to |
10913 | make type node and push name. Name lookup is not required. */ | |
10914 | if (ANON_AGGRNAME_P (name)) | |
10915 | t = NULL_TREE; | |
8d08fdba | 10916 | else |
461c6fce | 10917 | t = lookup_and_check_tag (tag_code, name, |
29ef83de | 10918 | scope, template_header_p); |
cbd63935 | 10919 | |
461c6fce KL |
10920 | if (t == error_mark_node) |
10921 | POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, error_mark_node); | |
68642fb6 | 10922 | |
29ef83de | 10923 | if (scope != ts_current && t && current_class_type |
461c6fce KL |
10924 | && template_class_depth (current_class_type) |
10925 | && template_header_p) | |
10926 | { | |
29ef83de | 10927 | /* Since SCOPE is not TS_CURRENT, we are not looking at a |
461c6fce KL |
10928 | definition of this tag. Since, in addition, we are currently |
10929 | processing a (member) template declaration of a template | |
10930 | class, we must be very careful; consider: | |
25aab5d0 | 10931 | |
461c6fce KL |
10932 | template <class X> |
10933 | struct S1 | |
25aab5d0 | 10934 | |
461c6fce KL |
10935 | template <class U> |
10936 | struct S2 | |
10937 | { template <class V> | |
10938 | friend struct S1; }; | |
25aab5d0 | 10939 | |
461c6fce KL |
10940 | Here, the S2::S1 declaration should not be confused with the |
10941 | outer declaration. In particular, the inner version should | |
10942 | have a template parameter of level 2, not level 1. This | |
10943 | would be particularly important if the member declaration | |
10944 | were instead: | |
25aab5d0 | 10945 | |
461c6fce | 10946 | template <class V = U> friend struct S1; |
25aab5d0 | 10947 | |
461c6fce KL |
10948 | say, when we should tsubst into `U' when instantiating |
10949 | S2. On the other hand, when presented with: | |
25aab5d0 | 10950 | |
461c6fce KL |
10951 | template <class T> |
10952 | struct S1 { | |
10953 | template <class U> | |
10954 | struct S2 {}; | |
10955 | template <class U> | |
10956 | friend struct S2; | |
10957 | }; | |
25aab5d0 | 10958 | |
461c6fce KL |
10959 | we must find the inner binding eventually. We |
10960 | accomplish this by making sure that the new type we | |
10961 | create to represent this declaration has the right | |
10962 | TYPE_CONTEXT. */ | |
10963 | context = TYPE_CONTEXT (t); | |
10964 | t = NULL_TREE; | |
8d08fdba MS |
10965 | } |
10966 | ||
cbd63935 | 10967 | if (! t) |
8d08fdba MS |
10968 | { |
10969 | /* If no such tag is yet defined, create a forward-reference node | |
10970 | and record it as the "definition". | |
10971 | When a real declaration of this type is found, | |
10972 | the forward-reference will be altered into a real type. */ | |
8d08fdba MS |
10973 | if (code == ENUMERAL_TYPE) |
10974 | { | |
2d01edd7 | 10975 | error ("use of enum %q#D without previous declaration", name); |
30fc3df7 | 10976 | POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, error_mark_node); |
8d08fdba | 10977 | } |
8d08fdba MS |
10978 | else |
10979 | { | |
9e1e64ec | 10980 | t = make_class_type (code); |
cbd63935 | 10981 | TYPE_CONTEXT (t) = context; |
bd3d082e | 10982 | t = pushtag (name, t, scope); |
8d08fdba MS |
10983 | } |
10984 | } | |
10985 | else | |
10986 | { | |
9e1e64ec | 10987 | if (template_header_p && MAYBE_CLASS_TYPE_P (t)) |
60feef2c LM |
10988 | { |
10989 | if (!redeclare_class_template (t, current_template_parms)) | |
10990 | POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, error_mark_node); | |
10991 | } | |
caf93cb0 | 10992 | else if (!processing_template_decl |
9ce1594a MM |
10993 | && CLASS_TYPE_P (t) |
10994 | && CLASSTYPE_IS_TEMPLATE (t)) | |
10995 | { | |
2d01edd7 | 10996 | error ("redeclaration of %qT as a non-template", t); |
b646edb8 VR |
10997 | error ("previous declaration %q+D", t); |
10998 | POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, error_mark_node); | |
9ce1594a | 10999 | } |
bd3d082e KL |
11000 | |
11001 | /* Make injected friend class visible. */ | |
11002 | if (scope != ts_within_enclosing_non_class | |
11003 | && hidden_name_p (TYPE_NAME (t))) | |
11004 | { | |
11005 | DECL_ANTICIPATED (TYPE_NAME (t)) = 0; | |
11006 | DECL_FRIEND_P (TYPE_NAME (t)) = 0; | |
11007 | ||
11008 | if (TYPE_TEMPLATE_INFO (t)) | |
11009 | { | |
11010 | DECL_ANTICIPATED (TYPE_TI_TEMPLATE (t)) = 0; | |
11011 | DECL_FRIEND_P (TYPE_TI_TEMPLATE (t)) = 0; | |
11012 | } | |
0cbd7506 | 11013 | } |
8d08fdba MS |
11014 | } |
11015 | ||
cbd63935 | 11016 | POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, t); |
8d08fdba | 11017 | } |
8ccc31eb | 11018 | |
fc378698 | 11019 | tree |
29ef83de | 11020 | xref_tag_from_type (tree old, tree id, tag_scope scope) |
fc378698 | 11021 | { |
88e5899c | 11022 | enum tag_types tag_kind; |
fc378698 MS |
11023 | |
11024 | if (TREE_CODE (old) == RECORD_TYPE) | |
88e5899c | 11025 | tag_kind = (CLASSTYPE_DECLARED_CLASS (old) ? class_type : record_type); |
fc378698 | 11026 | else |
88e5899c | 11027 | tag_kind = union_type; |
fc378698 MS |
11028 | |
11029 | if (id == NULL_TREE) | |
11030 | id = TYPE_IDENTIFIER (old); | |
11031 | ||
29ef83de | 11032 | return xref_tag (tag_kind, id, scope, false); |
fc378698 MS |
11033 | } |
11034 | ||
48b45647 NS |
11035 | /* Create the binfo hierarchy for REF with (possibly NULL) base list |
11036 | BASE_LIST. For each element on BASE_LIST the TREE_PURPOSE is an | |
11037 | access_* node, and the TREE_VALUE is the type of the base-class. | |
72f8fc59 LM |
11038 | Non-NULL TREE_TYPE indicates virtual inheritance. |
11039 | ||
bd6f7848 | 11040 | Returns true if the binfo hierarchy was successfully created, |
72f8fc59 | 11041 | false if an error was detected. */ |
3fd71a52 | 11042 | |
72f8fc59 | 11043 | bool |
dbbf88d1 | 11044 | xref_basetypes (tree ref, tree base_list) |
8ccc31eb | 11045 | { |
8fbc5ae7 | 11046 | tree *basep; |
fa743e8c | 11047 | tree binfo, base_binfo; |
03fd3f84 | 11048 | unsigned max_vbases = 0; /* Maximum direct & indirect virtual bases. */ |
77880ae4 | 11049 | unsigned max_bases = 0; /* Maximum direct bases. */ |
8fbc5ae7 | 11050 | int i; |
48b45647 NS |
11051 | tree default_access; |
11052 | tree igo_prev; /* Track Inheritance Graph Order. */ | |
a5d7c4a3 | 11053 | |
bef89e9e | 11054 | if (ref == error_mark_node) |
72f8fc59 | 11055 | return false; |
bef89e9e | 11056 | |
48b45647 NS |
11057 | /* The base of a derived class is private by default, all others are |
11058 | public. */ | |
11059 | default_access = (TREE_CODE (ref) == RECORD_TYPE | |
11060 | && CLASSTYPE_DECLARED_CLASS (ref) | |
11061 | ? access_private_node : access_public_node); | |
da15dae6 | 11062 | |
d6479fe7 MM |
11063 | /* First, make sure that any templates in base-classes are |
11064 | instantiated. This ensures that if we call ourselves recursively | |
11065 | we do not get confused about which classes are marked and which | |
11066 | are not. */ | |
caf93cb0 EC |
11067 | basep = &base_list; |
11068 | while (*basep) | |
8fbc5ae7 MM |
11069 | { |
11070 | tree basetype = TREE_VALUE (*basep); | |
caf93cb0 | 11071 | |
8fbc5ae7 MM |
11072 | if (!(processing_template_decl && uses_template_parms (basetype)) |
11073 | && !complete_type_or_else (basetype, NULL)) | |
dbbf88d1 | 11074 | /* An incomplete type. Remove it from the list. */ |
8fbc5ae7 MM |
11075 | *basep = TREE_CHAIN (*basep); |
11076 | else | |
48b45647 NS |
11077 | { |
11078 | max_bases++; | |
11079 | if (TREE_TYPE (*basep)) | |
11080 | max_vbases++; | |
11081 | if (CLASS_TYPE_P (basetype)) | |
11082 | max_vbases += VEC_length (tree, CLASSTYPE_VBASECLASSES (basetype)); | |
11083 | basep = &TREE_CHAIN (*basep); | |
11084 | } | |
8fbc5ae7 | 11085 | } |
d6479fe7 | 11086 | |
3543e114 | 11087 | TYPE_MARKED_P (ref) = 1; |
48b45647 | 11088 | |
cad7e87b NS |
11089 | /* The binfo slot should be empty, unless this is an (ill-formed) |
11090 | redefinition. */ | |
1a494ab5 PC |
11091 | if (TYPE_BINFO (ref) && !TYPE_SIZE (ref)) |
11092 | { | |
11093 | error ("redefinition of %q#T", ref); | |
11094 | return false; | |
11095 | } | |
11096 | ||
50bc768d | 11097 | gcc_assert (TYPE_MAIN_VARIANT (ref) == ref); |
caf93cb0 | 11098 | |
fa743e8c | 11099 | binfo = make_tree_binfo (max_bases); |
caf93cb0 | 11100 | |
48b45647 NS |
11101 | TYPE_BINFO (ref) = binfo; |
11102 | BINFO_OFFSET (binfo) = size_zero_node; | |
11103 | BINFO_TYPE (binfo) = ref; | |
caf93cb0 | 11104 | |
d0940d56 DS |
11105 | /* Apply base-class info set up to the variants of this type. */ |
11106 | fixup_type_variants (ref); | |
11107 | ||
48b45647 NS |
11108 | if (max_bases) |
11109 | { | |
d4e6fecb | 11110 | BINFO_BASE_ACCESSES (binfo) = VEC_alloc (tree, gc, max_bases); |
48b45647 NS |
11111 | /* An aggregate cannot have baseclasses. */ |
11112 | CLASSTYPE_NON_AGGREGATE (ref) = 1; | |
caf93cb0 | 11113 | |
48b45647 | 11114 | if (TREE_CODE (ref) == UNION_TYPE) |
72f8fc59 LM |
11115 | { |
11116 | error ("derived union %qT invalid", ref); | |
11117 | return false; | |
11118 | } | |
48b45647 | 11119 | } |
caf93cb0 | 11120 | |
48b45647 | 11121 | if (max_bases > 1) |
dbbf88d1 | 11122 | { |
48b45647 | 11123 | if (TYPE_FOR_JAVA (ref)) |
72f8fc59 LM |
11124 | { |
11125 | error ("Java class %qT cannot have multiple bases", ref); | |
11126 | return false; | |
11127 | } | |
48b45647 | 11128 | } |
caf93cb0 | 11129 | |
48b45647 NS |
11130 | if (max_vbases) |
11131 | { | |
d4e6fecb | 11132 | CLASSTYPE_VBASECLASSES (ref) = VEC_alloc (tree, gc, max_vbases); |
caf93cb0 | 11133 | |
48b45647 | 11134 | if (TYPE_FOR_JAVA (ref)) |
72f8fc59 LM |
11135 | { |
11136 | error ("Java class %qT cannot have virtual bases", ref); | |
11137 | return false; | |
11138 | } | |
48b45647 | 11139 | } |
cad7e87b | 11140 | |
48b45647 NS |
11141 | for (igo_prev = binfo; base_list; base_list = TREE_CHAIN (base_list)) |
11142 | { | |
11143 | tree access = TREE_PURPOSE (base_list); | |
11144 | int via_virtual = TREE_TYPE (base_list) != NULL_TREE; | |
11145 | tree basetype = TREE_VALUE (base_list); | |
caf93cb0 | 11146 | |
48b45647 NS |
11147 | if (access == access_default_node) |
11148 | access = default_access; | |
caf93cb0 | 11149 | |
5d80a306 DG |
11150 | if (PACK_EXPANSION_P (basetype)) |
11151 | basetype = PACK_EXPANSION_PATTERN (basetype); | |
48b45647 NS |
11152 | if (TREE_CODE (basetype) == TYPE_DECL) |
11153 | basetype = TREE_TYPE (basetype); | |
76871f0f | 11154 | if (!MAYBE_CLASS_TYPE_P (basetype) || TREE_CODE (basetype) == UNION_TYPE) |
48b45647 | 11155 | { |
2d01edd7 | 11156 | error ("base type %qT fails to be a struct or class type", |
48b45647 | 11157 | basetype); |
72f8fc59 | 11158 | return false; |
8ccc31eb | 11159 | } |
caf93cb0 | 11160 | |
48b45647 NS |
11161 | if (TYPE_FOR_JAVA (basetype) && (current_lang_depth () == 0)) |
11162 | TYPE_FOR_JAVA (ref) = 1; | |
11163 | ||
fa743e8c | 11164 | base_binfo = NULL_TREE; |
48b45647 | 11165 | if (CLASS_TYPE_P (basetype) && !dependent_type_p (basetype)) |
dbbf88d1 | 11166 | { |
48b45647 | 11167 | base_binfo = TYPE_BINFO (basetype); |
77880ae4 | 11168 | /* The original basetype could have been a typedef'd type. */ |
48b45647 | 11169 | basetype = BINFO_TYPE (base_binfo); |
caf93cb0 | 11170 | |
48b45647 NS |
11171 | /* Inherit flags from the base. */ |
11172 | TYPE_HAS_NEW_OPERATOR (ref) | |
11173 | |= TYPE_HAS_NEW_OPERATOR (basetype); | |
11174 | TYPE_HAS_ARRAY_NEW_OPERATOR (ref) | |
11175 | |= TYPE_HAS_ARRAY_NEW_OPERATOR (basetype); | |
11176 | TYPE_GETS_DELETE (ref) |= TYPE_GETS_DELETE (basetype); | |
48b45647 | 11177 | TYPE_HAS_CONVERSION (ref) |= TYPE_HAS_CONVERSION (basetype); |
3543e114 NS |
11178 | CLASSTYPE_DIAMOND_SHAPED_P (ref) |
11179 | |= CLASSTYPE_DIAMOND_SHAPED_P (basetype); | |
11180 | CLASSTYPE_REPEATED_BASE_P (ref) | |
11181 | |= CLASSTYPE_REPEATED_BASE_P (basetype); | |
8fbc5ae7 | 11182 | } |
c8094d83 | 11183 | |
98d6e9af NS |
11184 | /* We must do this test after we've seen through a typedef |
11185 | type. */ | |
11186 | if (TYPE_MARKED_P (basetype)) | |
11187 | { | |
11188 | if (basetype == ref) | |
2d01edd7 | 11189 | error ("recursive type %qT undefined", basetype); |
98d6e9af | 11190 | else |
2d01edd7 | 11191 | error ("duplicate base type %qT invalid", basetype); |
72f8fc59 | 11192 | return false; |
98d6e9af | 11193 | } |
5d80a306 DG |
11194 | |
11195 | if (PACK_EXPANSION_P (TREE_VALUE (base_list))) | |
11196 | /* Regenerate the pack expansion for the bases. */ | |
11197 | basetype = make_pack_expansion (basetype); | |
11198 | ||
98d6e9af | 11199 | TYPE_MARKED_P (basetype) = 1; |
caf93cb0 | 11200 | |
48b45647 NS |
11201 | base_binfo = copy_binfo (base_binfo, basetype, ref, |
11202 | &igo_prev, via_virtual); | |
11203 | if (!BINFO_INHERITANCE_CHAIN (base_binfo)) | |
11204 | BINFO_INHERITANCE_CHAIN (base_binfo) = binfo; | |
f5c28a15 | 11205 | |
fa743e8c | 11206 | BINFO_BASE_APPEND (binfo, base_binfo); |
63d1c7b3 | 11207 | BINFO_BASE_ACCESS_APPEND (binfo, access); |
cad7e87b NS |
11208 | } |
11209 | ||
3543e114 NS |
11210 | if (VEC_space (tree, CLASSTYPE_VBASECLASSES (ref), 1)) |
11211 | /* If we have space in the vbase vector, we must have shared at | |
11212 | least one of them, and are therefore diamond shaped. */ | |
11213 | CLASSTYPE_DIAMOND_SHAPED_P (ref) = 1; | |
11214 | ||
dbbf88d1 | 11215 | /* Unmark all the types. */ |
fa743e8c | 11216 | for (i = 0; BINFO_BASE_ITERATE (binfo, i, base_binfo); i++) |
3543e114 NS |
11217 | TYPE_MARKED_P (BINFO_TYPE (base_binfo)) = 0; |
11218 | TYPE_MARKED_P (ref) = 0; | |
11219 | ||
11220 | /* Now see if we have a repeated base type. */ | |
11221 | if (!CLASSTYPE_REPEATED_BASE_P (ref)) | |
11222 | { | |
11223 | for (base_binfo = binfo; base_binfo; | |
11224 | base_binfo = TREE_CHAIN (base_binfo)) | |
11225 | { | |
11226 | if (TYPE_MARKED_P (BINFO_TYPE (base_binfo))) | |
11227 | { | |
11228 | CLASSTYPE_REPEATED_BASE_P (ref) = 1; | |
11229 | break; | |
11230 | } | |
11231 | TYPE_MARKED_P (BINFO_TYPE (base_binfo)) = 1; | |
11232 | } | |
11233 | for (base_binfo = binfo; base_binfo; | |
11234 | base_binfo = TREE_CHAIN (base_binfo)) | |
11235 | if (TYPE_MARKED_P (BINFO_TYPE (base_binfo))) | |
11236 | TYPE_MARKED_P (BINFO_TYPE (base_binfo)) = 0; | |
11237 | else | |
11238 | break; | |
11239 | } | |
72f8fc59 LM |
11240 | |
11241 | return true; | |
8ccc31eb | 11242 | } |
68642fb6 | 11243 | |
8d08fdba | 11244 | \f |
8d08fdba | 11245 | /* Begin compiling the definition of an enumeration type. |
adf2edec DG |
11246 | NAME is its name, |
11247 | ||
11248 | UNDERLYING_TYPE is the type that will be used as the storage for | |
11249 | the enumeration type. This should be NULL_TREE if no storage type | |
11250 | was specified. | |
11251 | ||
11252 | SCOPED_ENUM_P is true if this is a scoped enumeration type. | |
11253 | ||
8d08fdba MS |
11254 | Returns the type object, as yet incomplete. |
11255 | Also records info about it so that build_enumerator | |
11256 | may be used to declare the individual values as they are read. */ | |
11257 | ||
11258 | tree | |
adf2edec | 11259 | start_enum (tree name, tree underlying_type, bool scoped_enum_p) |
8d08fdba | 11260 | { |
29ef83de KL |
11261 | tree enumtype; |
11262 | ||
11263 | gcc_assert (TREE_CODE (name) == IDENTIFIER_NODE); | |
8d08fdba MS |
11264 | |
11265 | /* If this is the real definition for a previous forward reference, | |
11266 | fill in the contents in the same object that used to be the | |
11267 | forward reference. */ | |
11268 | ||
29ef83de KL |
11269 | enumtype = lookup_and_check_tag (enum_type, name, |
11270 | /*tag_scope=*/ts_current, | |
11271 | /*template_header_p=*/false); | |
8d08fdba MS |
11272 | |
11273 | if (enumtype != NULL_TREE && TREE_CODE (enumtype) == ENUMERAL_TYPE) | |
30ff8252 | 11274 | { |
c5d75364 MLI |
11275 | error_at (input_location, "multiple definition of %q#T", enumtype); |
11276 | error_at (DECL_SOURCE_LOCATION (TYPE_MAIN_DECL (enumtype)), | |
11277 | "previous definition here"); | |
58595203 MM |
11278 | /* Clear out TYPE_VALUES, and start again. */ |
11279 | TYPE_VALUES (enumtype) = NULL_TREE; | |
30ff8252 | 11280 | } |
8d08fdba MS |
11281 | else |
11282 | { | |
29ef83de KL |
11283 | /* In case of error, make a dummy enum to allow parsing to |
11284 | continue. */ | |
11285 | if (enumtype == error_mark_node) | |
11286 | name = make_anon_name (); | |
11287 | ||
7ecbca9d | 11288 | enumtype = cxx_make_type (ENUMERAL_TYPE); |
bd3d082e | 11289 | enumtype = pushtag (name, enumtype, /*tag_scope=*/ts_current); |
8d08fdba MS |
11290 | } |
11291 | ||
19bb3aa5 JJ |
11292 | if (enumtype == error_mark_node) |
11293 | return enumtype; | |
11294 | ||
adf2edec DG |
11295 | if (scoped_enum_p) |
11296 | { | |
11297 | SET_SCOPED_ENUM_P (enumtype, 1); | |
11298 | begin_scope (sk_scoped_enum, enumtype); | |
11299 | ||
11300 | /* [C++0x dcl.enum]p5: | |
11301 | ||
11302 | If not explicitly specified, the underlying type of a scoped | |
11303 | enumeration type is int. */ | |
11304 | if (!underlying_type) | |
11305 | underlying_type = integer_type_node; | |
11306 | } | |
11307 | ||
11308 | if (underlying_type) | |
11309 | { | |
11310 | if (CP_INTEGRAL_TYPE_P (underlying_type)) | |
11311 | { | |
11312 | TYPE_MIN_VALUE (enumtype) = TYPE_MIN_VALUE (underlying_type); | |
11313 | TYPE_MAX_VALUE (enumtype) = TYPE_MAX_VALUE (underlying_type); | |
11314 | TYPE_SIZE (enumtype) = TYPE_SIZE (underlying_type); | |
11315 | TYPE_SIZE_UNIT (enumtype) = TYPE_SIZE_UNIT (underlying_type); | |
179d2f74 | 11316 | SET_TYPE_MODE (enumtype, TYPE_MODE (underlying_type)); |
adf2edec DG |
11317 | TYPE_PRECISION (enumtype) = TYPE_PRECISION (underlying_type); |
11318 | TYPE_ALIGN (enumtype) = TYPE_ALIGN (underlying_type); | |
11319 | TYPE_USER_ALIGN (enumtype) = TYPE_USER_ALIGN (underlying_type); | |
11320 | TYPE_UNSIGNED (enumtype) = TYPE_UNSIGNED (underlying_type); | |
11321 | ENUM_UNDERLYING_TYPE (enumtype) = underlying_type; | |
11322 | } | |
60662d5f | 11323 | else if (!dependent_type_p (underlying_type)) |
adf2edec DG |
11324 | error ("underlying type %<%T%> of %<%T%> must be an integral type", |
11325 | underlying_type, enumtype); | |
11326 | } | |
11327 | ||
8d08fdba MS |
11328 | return enumtype; |
11329 | } | |
11330 | ||
11331 | /* After processing and defining all the values of an enumeration type, | |
11332 | install their decls in the enumeration type and finish it off. | |
968b956a | 11333 | ENUMTYPE is the type object and VALUES a list of name-value pairs. */ |
8d08fdba | 11334 | |
968b956a | 11335 | void |
11f6b451 | 11336 | finish_enum (tree enumtype) |
8d08fdba | 11337 | { |
7b6d72fc MM |
11338 | tree values; |
11339 | tree decl; | |
968b956a MM |
11340 | tree minnode; |
11341 | tree maxnode; | |
adf2edec | 11342 | tree value; |
968b956a | 11343 | tree t; |
ad96995b | 11344 | tree underlying_type = NULL_TREE; |
adf2edec DG |
11345 | bool fixed_underlying_type_p |
11346 | = ENUM_UNDERLYING_TYPE (enumtype) != NULL_TREE; | |
968b956a MM |
11347 | |
11348 | /* We built up the VALUES in reverse order. */ | |
11349 | TYPE_VALUES (enumtype) = nreverse (TYPE_VALUES (enumtype)); | |
11350 | ||
f5d70cc0 JM |
11351 | /* For an enum defined in a template, just set the type of the values; |
11352 | all further processing is postponed until the template is | |
11353 | instantiated. We need to set the type so that tsubst of a CONST_DECL | |
11354 | works. */ | |
968b956a MM |
11355 | if (processing_template_decl) |
11356 | { | |
caf93cb0 EC |
11357 | for (values = TYPE_VALUES (enumtype); |
11358 | values; | |
7b6d72fc MM |
11359 | values = TREE_CHAIN (values)) |
11360 | TREE_TYPE (TREE_VALUE (values)) = enumtype; | |
5f261ba9 | 11361 | if (at_function_scope_p ()) |
968b956a | 11362 | add_stmt (build_min (TAG_DEFN, enumtype)); |
60662d5f JM |
11363 | if (SCOPED_ENUM_P (enumtype)) |
11364 | finish_scope (); | |
968b956a MM |
11365 | return; |
11366 | } | |
11367 | ||
7b6d72fc | 11368 | /* Determine the minimum and maximum values of the enumerators. */ |
968b956a | 11369 | if (TYPE_VALUES (enumtype)) |
8d08fdba | 11370 | { |
968b956a | 11371 | minnode = maxnode = NULL_TREE; |
5566b478 | 11372 | |
caf93cb0 | 11373 | for (values = TYPE_VALUES (enumtype); |
adf2edec DG |
11374 | values; |
11375 | values = TREE_CHAIN (values)) | |
11376 | { | |
11377 | decl = TREE_VALUE (values); | |
11378 | ||
11379 | /* [dcl.enum]: Following the closing brace of an enum-specifier, | |
11380 | each enumerator has the type of its enumeration. Prior to the | |
11381 | closing brace, the type of each enumerator is the type of its | |
11382 | initializing value. */ | |
11383 | TREE_TYPE (decl) = enumtype; | |
11384 | ||
11385 | /* Update the minimum and maximum values, if appropriate. */ | |
11386 | value = DECL_INITIAL (decl); | |
11387 | if (value == error_mark_node) | |
11388 | value = integer_zero_node; | |
11389 | /* Figure out what the minimum and maximum values of the | |
11390 | enumerators are. */ | |
11391 | if (!minnode) | |
11392 | minnode = maxnode = value; | |
11393 | else if (tree_int_cst_lt (maxnode, value)) | |
11394 | maxnode = value; | |
11395 | else if (tree_int_cst_lt (value, minnode)) | |
11396 | minnode = value; | |
11397 | } | |
8d08fdba | 11398 | } |
f376e137 | 11399 | else |
7b6d72fc | 11400 | /* [dcl.enum] |
adf2edec | 11401 | |
7b6d72fc MM |
11402 | If the enumerator-list is empty, the underlying type is as if |
11403 | the enumeration had a single enumerator with value 0. */ | |
968b956a MM |
11404 | minnode = maxnode = integer_zero_node; |
11405 | ||
adf2edec DG |
11406 | if (!fixed_underlying_type_p) |
11407 | { | |
cbb4feb3 JM |
11408 | /* Compute the number of bits require to represent all values of the |
11409 | enumeration. We must do this before the type of MINNODE and | |
11410 | MAXNODE are transformed, since tree_int_cst_min_precision relies | |
11411 | on the TREE_TYPE of the value it is passed. */ | |
11412 | bool unsignedp = tree_int_cst_sgn (minnode) >= 0; | |
11413 | int lowprec = tree_int_cst_min_precision (minnode, unsignedp); | |
11414 | int highprec = tree_int_cst_min_precision (maxnode, unsignedp); | |
11415 | int precision = MAX (lowprec, highprec); | |
11416 | unsigned int itk; | |
11417 | bool use_short_enum; | |
11418 | ||
adf2edec | 11419 | /* Determine the underlying type of the enumeration. |
7b6d72fc | 11420 | |
adf2edec | 11421 | [dcl.enum] |
7b6d72fc | 11422 | |
adf2edec DG |
11423 | The underlying type of an enumeration is an integral type that |
11424 | can represent all the enumerator values defined in the | |
11425 | enumeration. It is implementation-defined which integral type is | |
11426 | used as the underlying type for an enumeration except that the | |
11427 | underlying type shall not be larger than int unless the value of | |
11428 | an enumerator cannot fit in an int or unsigned int. | |
7b6d72fc | 11429 | |
adf2edec DG |
11430 | We use "int" or an "unsigned int" as the underlying type, even if |
11431 | a smaller integral type would work, unless the user has | |
11432 | explicitly requested that we use the smallest possible type. The | |
11433 | user can request that for all enumerations with a command line | |
11434 | flag, or for just one enumeration with an attribute. */ | |
f6af9a15 | 11435 | |
adf2edec DG |
11436 | use_short_enum = flag_short_enums |
11437 | || lookup_attribute ("packed", TYPE_ATTRIBUTES (enumtype)); | |
f6af9a15 | 11438 | |
adf2edec DG |
11439 | for (itk = (use_short_enum ? itk_char : itk_int); |
11440 | itk != itk_none; | |
11441 | itk++) | |
11442 | { | |
11443 | underlying_type = integer_types[itk]; | |
64c31785 KT |
11444 | if (underlying_type != NULL_TREE |
11445 | && TYPE_PRECISION (underlying_type) >= precision | |
adf2edec DG |
11446 | && TYPE_UNSIGNED (underlying_type) == unsignedp) |
11447 | break; | |
11448 | } | |
11449 | if (itk == itk_none) | |
11450 | { | |
11451 | /* DR 377 | |
11452 | ||
11453 | IF no integral type can represent all the enumerator values, the | |
11454 | enumeration is ill-formed. */ | |
11455 | error ("no integral type can represent all of the enumerator values " | |
11456 | "for %qT", enumtype); | |
11457 | precision = TYPE_PRECISION (long_long_integer_type_node); | |
11458 | underlying_type = integer_types[itk_unsigned_long_long]; | |
11459 | } | |
7b6d72fc | 11460 | |
adf2edec DG |
11461 | /* [dcl.enum] |
11462 | ||
11463 | The value of sizeof() applied to an enumeration type, an object | |
11464 | of an enumeration type, or an enumerator, is the value of sizeof() | |
11465 | applied to the underlying type. */ | |
cbb4feb3 JM |
11466 | TYPE_MIN_VALUE (enumtype) = TYPE_MIN_VALUE (underlying_type); |
11467 | TYPE_MAX_VALUE (enumtype) = TYPE_MAX_VALUE (underlying_type); | |
adf2edec DG |
11468 | TYPE_SIZE (enumtype) = TYPE_SIZE (underlying_type); |
11469 | TYPE_SIZE_UNIT (enumtype) = TYPE_SIZE_UNIT (underlying_type); | |
179d2f74 | 11470 | SET_TYPE_MODE (enumtype, TYPE_MODE (underlying_type)); |
cbb4feb3 | 11471 | TYPE_PRECISION (enumtype) = TYPE_PRECISION (underlying_type); |
adf2edec DG |
11472 | TYPE_ALIGN (enumtype) = TYPE_ALIGN (underlying_type); |
11473 | TYPE_USER_ALIGN (enumtype) = TYPE_USER_ALIGN (underlying_type); | |
11474 | TYPE_UNSIGNED (enumtype) = TYPE_UNSIGNED (underlying_type); | |
11475 | ||
cbb4feb3 JM |
11476 | /* Compute the minimum and maximum values for the type. |
11477 | ||
11478 | [dcl.enum] | |
11479 | ||
11480 | For an enumeration where emin is the smallest enumerator and emax | |
11481 | is the largest, the values of the enumeration are the values of the | |
11482 | underlying type in the range bmin to bmax, where bmin and bmax are, | |
11483 | respectively, the smallest and largest values of the smallest bit- | |
11484 | field that can store emin and emax. */ | |
11485 | ||
11486 | /* The middle-end currently assumes that types with TYPE_PRECISION | |
11487 | narrower than their underlying type are suitably zero or sign | |
11488 | extended to fill their mode. Similarly, it assumes that the front | |
11489 | end assures that a value of a particular type must be within | |
11490 | TYPE_MIN_VALUE and TYPE_MAX_VALUE. | |
11491 | ||
11492 | We used to set these fields based on bmin and bmax, but that led | |
11493 | to invalid assumptions like optimizing away bounds checking. So | |
11494 | now we just set the TYPE_PRECISION, TYPE_MIN_VALUE, and | |
11495 | TYPE_MAX_VALUE to the values for the mode above and only restrict | |
11496 | the ENUM_UNDERLYING_TYPE for the benefit of diagnostics. */ | |
22521c89 RG |
11497 | ENUM_UNDERLYING_TYPE (enumtype) |
11498 | = build_distinct_type_copy (underlying_type); | |
cbb4feb3 JM |
11499 | TYPE_PRECISION (ENUM_UNDERLYING_TYPE (enumtype)) = precision; |
11500 | set_min_and_max_values_for_integral_type | |
adf2edec | 11501 | (ENUM_UNDERLYING_TYPE (enumtype), precision, unsignedp); |
cbb4feb3 JM |
11502 | |
11503 | /* If -fstrict-enums, still constrain TYPE_MIN/MAX_VALUE. */ | |
11504 | if (flag_strict_enums) | |
11505 | set_min_and_max_values_for_integral_type (enumtype, precision, | |
11506 | unsignedp); | |
e455bc27 | 11507 | } |
adf2edec DG |
11508 | else |
11509 | underlying_type = ENUM_UNDERLYING_TYPE (enumtype); | |
e455bc27 | 11510 | |
7b6d72fc MM |
11511 | /* Convert each of the enumerators to the type of the underlying |
11512 | type of the enumeration. */ | |
11513 | for (values = TYPE_VALUES (enumtype); values; values = TREE_CHAIN (values)) | |
11514 | { | |
3c955a04 MM |
11515 | location_t saved_location; |
11516 | ||
7b6d72fc | 11517 | decl = TREE_VALUE (values); |
3c955a04 MM |
11518 | saved_location = input_location; |
11519 | input_location = DECL_SOURCE_LOCATION (decl); | |
adf2edec DG |
11520 | if (fixed_underlying_type_p) |
11521 | /* If the enumeration type has a fixed underlying type, we | |
11522 | already checked all of the enumerator values. */ | |
11523 | value = DECL_INITIAL (decl); | |
11524 | else | |
11525 | value = perform_implicit_conversion (underlying_type, | |
11526 | DECL_INITIAL (decl), | |
11527 | tf_warning_or_error); | |
3c955a04 | 11528 | input_location = saved_location; |
89b0433e NS |
11529 | |
11530 | /* Do not clobber shared ints. */ | |
11531 | value = copy_node (value); | |
c8094d83 | 11532 | |
7b6d72fc MM |
11533 | TREE_TYPE (value) = enumtype; |
11534 | DECL_INITIAL (decl) = value; | |
e455bc27 | 11535 | } |
8d08fdba | 11536 | |
968b956a MM |
11537 | /* Fix up all variant types of this enum type. */ |
11538 | for (t = TYPE_MAIN_VARIANT (enumtype); t; t = TYPE_NEXT_VARIANT (t)) | |
11539 | { | |
11540 | TYPE_VALUES (t) = TYPE_VALUES (enumtype); | |
11541 | TYPE_MIN_VALUE (t) = TYPE_MIN_VALUE (enumtype); | |
11542 | TYPE_MAX_VALUE (t) = TYPE_MAX_VALUE (enumtype); | |
11543 | TYPE_SIZE (t) = TYPE_SIZE (enumtype); | |
11544 | TYPE_SIZE_UNIT (t) = TYPE_SIZE_UNIT (enumtype); | |
179d2f74 | 11545 | SET_TYPE_MODE (t, TYPE_MODE (enumtype)); |
968b956a MM |
11546 | TYPE_PRECISION (t) = TYPE_PRECISION (enumtype); |
11547 | TYPE_ALIGN (t) = TYPE_ALIGN (enumtype); | |
11548 | TYPE_USER_ALIGN (t) = TYPE_USER_ALIGN (enumtype); | |
8df83eae | 11549 | TYPE_UNSIGNED (t) = TYPE_UNSIGNED (enumtype); |
adf2edec | 11550 | ENUM_UNDERLYING_TYPE (t) = ENUM_UNDERLYING_TYPE (enumtype); |
cbf882af MM |
11551 | } |
11552 | ||
adf2edec DG |
11553 | /* Finish up the scope of a scoped enumeration. */ |
11554 | if (SCOPED_ENUM_P (enumtype)) | |
11555 | finish_scope (); | |
11556 | ||
968b956a MM |
11557 | /* Finish debugging output for this type. */ |
11558 | rest_of_type_compilation (enumtype, namespace_bindings_p ()); | |
8d08fdba MS |
11559 | } |
11560 | ||
079e1098 | 11561 | /* Build and install a CONST_DECL for an enumeration constant of the |
58595203 | 11562 | enumeration type ENUMTYPE whose NAME and VALUE (if any) are provided. |
8d08fdba MS |
11563 | Assignment of sequential values by default is handled here. */ |
11564 | ||
58595203 | 11565 | void |
11f6b451 | 11566 | build_enumerator (tree name, tree value, tree enumtype) |
8d08fdba | 11567 | { |
58595203 | 11568 | tree decl; |
e8bd800e | 11569 | tree context; |
58595203 | 11570 | tree type; |
8d08fdba | 11571 | |
93678513 MM |
11572 | /* If the VALUE was erroneous, pretend it wasn't there; that will |
11573 | result in the enum being assigned the next value in sequence. */ | |
11574 | if (value == error_mark_node) | |
11575 | value = NULL_TREE; | |
11576 | ||
8d08fdba MS |
11577 | /* Remove no-op casts from the value. */ |
11578 | if (value) | |
11579 | STRIP_TYPE_NOPS (value); | |
11580 | ||
58595203 MM |
11581 | if (! processing_template_decl) |
11582 | { | |
11583 | /* Validate and default VALUE. */ | |
11584 | if (value != NULL_TREE) | |
11585 | { | |
8a784e4a | 11586 | value = integral_constant_value (value); |
58595203 MM |
11587 | |
11588 | if (TREE_CODE (value) == INTEGER_CST) | |
11589 | { | |
0a72704b | 11590 | value = perform_integral_promotions (value); |
58595203 MM |
11591 | constant_expression_warning (value); |
11592 | } | |
11593 | else | |
11594 | { | |
253e0d15 | 11595 | error ("enumerator value for %qD is not an integer constant", name); |
58595203 MM |
11596 | value = NULL_TREE; |
11597 | } | |
11598 | } | |
11599 | ||
11600 | /* Default based on previous value. */ | |
6a540f3c | 11601 | if (value == NULL_TREE) |
58595203 | 11602 | { |
58595203 MM |
11603 | if (TYPE_VALUES (enumtype)) |
11604 | { | |
ff4eb0b5 ZW |
11605 | HOST_WIDE_INT hi; |
11606 | unsigned HOST_WIDE_INT lo; | |
11607 | tree prev_value; | |
11608 | bool overflowed; | |
11609 | ||
0f7a47dd | 11610 | /* The next value is the previous value plus one. |
ff4eb0b5 ZW |
11611 | add_double doesn't know the type of the target expression, |
11612 | so we must check with int_fits_type_p as well. */ | |
58595203 | 11613 | prev_value = DECL_INITIAL (TREE_VALUE (TYPE_VALUES (enumtype))); |
0f7a47dd JJ |
11614 | if (error_operand_p (prev_value)) |
11615 | value = error_mark_node; | |
11616 | else | |
3c955a04 | 11617 | { |
0f7a47dd JJ |
11618 | overflowed = add_double (TREE_INT_CST_LOW (prev_value), |
11619 | TREE_INT_CST_HIGH (prev_value), | |
11620 | 1, 0, &lo, &hi); | |
11621 | value = build_int_cst_wide (TREE_TYPE (prev_value), lo, hi); | |
11622 | overflowed | |
11623 | |= !int_fits_type_p (value, TREE_TYPE (prev_value)); | |
11624 | ||
11625 | if (overflowed) | |
11626 | { | |
11627 | error ("overflow in enumeration values at %qD", name); | |
11628 | value = error_mark_node; | |
11629 | } | |
3c955a04 | 11630 | } |
58595203 MM |
11631 | } |
11632 | else | |
11633 | value = integer_zero_node; | |
11634 | } | |
11635 | ||
11636 | /* Remove no-op casts from the value. */ | |
f5d70cc0 | 11637 | STRIP_TYPE_NOPS (value); |
adf2edec DG |
11638 | |
11639 | /* If the underlying type of the enum is fixed, check whether | |
11640 | the enumerator values fits in the underlying type. If it | |
11641 | does not fit, the program is ill-formed [C++0x dcl.enum]. */ | |
11642 | if (ENUM_UNDERLYING_TYPE (enumtype) | |
11643 | && value | |
11644 | && TREE_CODE (value) == INTEGER_CST | |
11645 | && !int_fits_type_p (value, ENUM_UNDERLYING_TYPE (enumtype))) | |
11646 | { | |
11647 | error ("enumerator value %E is too large for underlying type %<%T%>", | |
11648 | value, ENUM_UNDERLYING_TYPE (enumtype)); | |
11649 | ||
11650 | /* Silently convert the value so that we can continue. */ | |
11651 | value = perform_implicit_conversion (ENUM_UNDERLYING_TYPE (enumtype), | |
11652 | value, tf_none); | |
adf2edec | 11653 | } |
58595203 | 11654 | } |
8d08fdba | 11655 | |
8d08fdba | 11656 | /* C++ associates enums with global, function, or class declarations. */ |
58595203 MM |
11657 | context = current_scope (); |
11658 | ||
11659 | /* Build the actual enumeration constant. Note that the enumeration | |
adf2edec DG |
11660 | constants have the underlying type of the enum (if it is fixed) |
11661 | or the type of their initializer (if the underlying type of the | |
11662 | enum is not fixed): | |
11663 | ||
11664 | [ C++0x dcl.enum ] | |
11665 | ||
11666 | If the underlying type is fixed, the type of each enumerator | |
11667 | prior to the closing brace is the underlying type; if the | |
11668 | initializing value of an enumerator cannot be represented by | |
11669 | the underlying type, the program is ill-formed. If the | |
11670 | underlying type is not fixed, the type of each enumerator is | |
11671 | the type of its initializing value. | |
11672 | ||
11673 | If the underlying type is not fixed, it will be computed by | |
11674 | finish_enum and we will reset the type of this enumerator. Of | |
11675 | course, if we're processing a template, there may be no value. */ | |
58595203 MM |
11676 | type = value ? TREE_TYPE (value) : NULL_TREE; |
11677 | ||
11678 | if (context && context == current_class_type) | |
11679 | /* This enum declaration is local to the class. We need the full | |
8f17b5c5 | 11680 | lang_decl so that we can record DECL_CLASS_CONTEXT, for example. */ |
58595203 MM |
11681 | decl = build_lang_decl (CONST_DECL, name, type); |
11682 | else | |
11683 | /* It's a global enum, or it's local to a function. (Note local to | |
e8bd800e | 11684 | a function could mean local to a class method. */ |
c2255bc4 | 11685 | decl = build_decl (input_location, CONST_DECL, name, type); |
e8bd800e | 11686 | |
58595203 | 11687 | DECL_CONTEXT (decl) = FROB_CONTEXT (context); |
6de9cd9a | 11688 | TREE_CONSTANT (decl) = 1; |
6de9cd9a | 11689 | TREE_READONLY (decl) = 1; |
58595203 | 11690 | DECL_INITIAL (decl) = value; |
e8bd800e | 11691 | |
60662d5f | 11692 | if (context && context == current_class_type && !SCOPED_ENUM_P (enumtype)) |
58595203 | 11693 | /* In something like `struct S { enum E { i = 7 }; };' we put `i' |
7b6d72fc MM |
11694 | on the TYPE_FIELDS list for `S'. (That's so that you can say |
11695 | things like `S::i' later.) */ | |
58595203 MM |
11696 | finish_member_declaration (decl); |
11697 | else | |
9780c24f | 11698 | pushdecl (decl); |
58595203 MM |
11699 | |
11700 | /* Add this enumeration constant to the list for this type. */ | |
11701 | TYPE_VALUES (enumtype) = tree_cons (name, decl, TYPE_VALUES (enumtype)); | |
8d08fdba MS |
11702 | } |
11703 | ||
adf2edec DG |
11704 | /* Look for an enumerator with the given NAME within the enumeration |
11705 | type ENUMTYPE. This routine is used primarily for qualified name | |
11706 | lookup into an enumerator in C++0x, e.g., | |
11707 | ||
11708 | enum class Color { Red, Green, Blue }; | |
11709 | ||
11710 | Color color = Color::Red; | |
11711 | ||
11712 | Returns the value corresponding to the enumerator, or | |
11713 | NULL_TREE if no such enumerator was found. */ | |
11714 | tree | |
11715 | lookup_enumerator (tree enumtype, tree name) | |
11716 | { | |
11717 | tree e; | |
11718 | gcc_assert (enumtype && TREE_CODE (enumtype) == ENUMERAL_TYPE); | |
11719 | ||
11720 | e = purpose_member (name, TYPE_VALUES (enumtype)); | |
11721 | return e? TREE_VALUE (e) : NULL_TREE; | |
11722 | } | |
11723 | ||
8d08fdba | 11724 | \f |
3c3905fc | 11725 | /* We're defining DECL. Make sure that its type is OK. */ |
a8f73d4b MM |
11726 | |
11727 | static void | |
11f6b451 | 11728 | check_function_type (tree decl, tree current_function_parms) |
a8f73d4b MM |
11729 | { |
11730 | tree fntype = TREE_TYPE (decl); | |
d0f062fb | 11731 | tree return_type = complete_type (TREE_TYPE (fntype)); |
a8f73d4b MM |
11732 | |
11733 | /* In a function definition, arg types must be complete. */ | |
11734 | require_complete_types_for_parms (current_function_parms); | |
11735 | ||
7ecbca9d GDR |
11736 | /* constexpr functions must have literal argument types and |
11737 | literal return type. */ | |
11738 | validate_constexpr_fundecl (decl); | |
11739 | ||
c9387915 GB |
11740 | if (dependent_type_p (return_type)) |
11741 | return; | |
360f866c | 11742 | if (!COMPLETE_OR_VOID_TYPE_P (return_type) |
9e1e64ec | 11743 | || (TYPE_FOR_JAVA (return_type) && MAYBE_CLASS_TYPE_P (return_type))) |
a8f73d4b | 11744 | { |
51b15ede | 11745 | tree args = TYPE_ARG_TYPES (fntype); |
3db45ab5 | 11746 | |
360f866c JJ |
11747 | if (!COMPLETE_OR_VOID_TYPE_P (return_type)) |
11748 | error ("return type %q#T is incomplete", return_type); | |
11749 | else | |
11750 | error ("return type has Java class type %q#T", return_type); | |
a8f73d4b | 11751 | |
51b15ede | 11752 | /* Make it return void instead. */ |
a8f73d4b | 11753 | if (TREE_CODE (fntype) == METHOD_TYPE) |
51b15ede NS |
11754 | fntype = build_method_type_directly (TREE_TYPE (TREE_VALUE (args)), |
11755 | void_type_node, | |
11756 | TREE_CHAIN (args)); | |
a8f73d4b | 11757 | else |
51b15ede | 11758 | fntype = build_function_type (void_type_node, args); |
3c3905fc | 11759 | fntype |
a8f73d4b | 11760 | = build_exception_variant (fntype, |
51b15ede | 11761 | TYPE_RAISES_EXCEPTIONS (TREE_TYPE (decl))); |
3c3905fc JM |
11762 | fntype = (cp_build_type_attribute_variant |
11763 | (fntype, TYPE_ATTRIBUTES (TREE_TYPE (decl)))); | |
11764 | TREE_TYPE (decl) = fntype; | |
a8f73d4b MM |
11765 | } |
11766 | else | |
11767 | abstract_virtuals_error (decl, TREE_TYPE (fntype)); | |
11768 | } | |
11769 | ||
8d08fdba MS |
11770 | /* Create the FUNCTION_DECL for a function definition. |
11771 | DECLSPECS and DECLARATOR are the parts of the declaration; | |
11772 | they describe the function's name and the type it returns, | |
11773 | but twisted together in a fashion that parallels the syntax of C. | |
11774 | ||
a8f73d4b MM |
11775 | FLAGS is a bitwise or of SF_PRE_PARSED (indicating that the |
11776 | DECLARATOR is really the DECL for the function we are about to | |
11777 | process and that DECLSPECS should be ignored), SF_INCLASS_INLINE | |
f444e36b | 11778 | indicating that the function is an inline defined in-class. |
68642fb6 | 11779 | |
8d08fdba MS |
11780 | This function creates a binding context for the function body |
11781 | as well as setting up the FUNCTION_DECL in current_function_decl. | |
11782 | ||
8d08fdba MS |
11783 | For C++, we must first check whether that datum makes any sense. |
11784 | For example, "class A local_a(1,2);" means that variable local_a | |
11785 | is an aggregate of type A, which should have a constructor | |
72c4a4ca GK |
11786 | applied to it with the argument list [1, 2]. |
11787 | ||
11788 | On entry, DECL_INITIAL (decl1) should be NULL_TREE or error_mark_node, | |
11789 | or may be a BLOCK if the function has been defined previously | |
11790 | in this translation unit. On exit, DECL_INITIAL (decl1) will be | |
11791 | error_mark_node if the function has never been defined, or | |
11792 | a BLOCK if the function has been defined somewhere. */ | |
8d08fdba | 11793 | |
058b15c1 MM |
11794 | void |
11795 | start_preparsed_function (tree decl1, tree attrs, int flags) | |
8d08fdba | 11796 | { |
8d08fdba MS |
11797 | tree ctype = NULL_TREE; |
11798 | tree fntype; | |
11799 | tree restype; | |
8d08fdba | 11800 | int doing_friend = 0; |
e2500fed | 11801 | struct cp_binding_level *bl; |
f444e36b | 11802 | tree current_function_parms; |
3e3935a9 | 11803 | struct c_fileinfo *finfo |
c533e34d | 11804 | = get_fileinfo (LOCATION_FILE (DECL_SOURCE_LOCATION (decl1))); |
1ef0df47 | 11805 | bool honor_interface; |
8d08fdba | 11806 | |
8d08fdba | 11807 | /* Sanity check. */ |
50bc768d NS |
11808 | gcc_assert (TREE_CODE (TREE_VALUE (void_list_node)) == VOID_TYPE); |
11809 | gcc_assert (TREE_CHAIN (void_list_node) == NULL_TREE); | |
8d08fdba | 11810 | |
058b15c1 MM |
11811 | fntype = TREE_TYPE (decl1); |
11812 | if (TREE_CODE (fntype) == METHOD_TYPE) | |
11813 | ctype = TYPE_METHOD_BASETYPE (fntype); | |
caf93cb0 | 11814 | |
058b15c1 MM |
11815 | /* ISO C++ 11.4/5. A friend function defined in a class is in |
11816 | the (lexical) scope of the class in which it is defined. */ | |
11817 | if (!ctype && DECL_FRIEND_P (decl1)) | |
8d08fdba | 11818 | { |
058b15c1 | 11819 | ctype = DECL_FRIEND_CONTEXT (decl1); |
caf93cb0 | 11820 | |
058b15c1 MM |
11821 | /* CTYPE could be null here if we're dealing with a template; |
11822 | for example, `inline friend float foo()' inside a template | |
11823 | will have no CTYPE set. */ | |
11824 | if (ctype && TREE_CODE (ctype) != RECORD_TYPE) | |
11825 | ctype = NULL_TREE; | |
11826 | else | |
11827 | doing_friend = 1; | |
8d08fdba | 11828 | } |
68642fb6 | 11829 | |
97055d5c AO |
11830 | if (DECL_DECLARED_INLINE_P (decl1) |
11831 | && lookup_attribute ("noinline", attrs)) | |
dee15844 | 11832 | warning (0, "inline function %q+D given attribute noinline", decl1); |
97055d5c | 11833 | |
3a47c4e4 AO |
11834 | /* Handle gnu_inline attribute. */ |
11835 | if (GNU_INLINE_P (decl1)) | |
11836 | { | |
11837 | DECL_EXTERNAL (decl1) = 1; | |
11838 | DECL_NOT_REALLY_EXTERN (decl1) = 0; | |
11839 | DECL_INTERFACE_KNOWN (decl1) = 1; | |
12cdc4fa | 11840 | DECL_DISREGARD_INLINE_LIMITS (decl1) = 1; |
3a47c4e4 AO |
11841 | } |
11842 | ||
5f6eeeb3 NS |
11843 | if (DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (decl1)) |
11844 | /* This is a constructor, we must ensure that any default args | |
11845 | introduced by this definition are propagated to the clones | |
11846 | now. The clones are used directly in overload resolution. */ | |
11847 | adjust_clone_args (decl1); | |
11848 | ||
b35d4555 MM |
11849 | /* Sometimes we don't notice that a function is a static member, and |
11850 | build a METHOD_TYPE for it. Fix that up now. */ | |
11851 | if (ctype != NULL_TREE && DECL_STATIC_FUNCTION_P (decl1) | |
11852 | && TREE_CODE (TREE_TYPE (decl1)) == METHOD_TYPE) | |
11853 | { | |
3afb32a4 | 11854 | revert_static_member_fn (decl1); |
b35d4555 MM |
11855 | ctype = NULL_TREE; |
11856 | } | |
8d08fdba | 11857 | |
f181d4ae MM |
11858 | /* Set up current_class_type, and enter the scope of the class, if |
11859 | appropriate. */ | |
11860 | if (ctype) | |
14d22dd6 | 11861 | push_nested_class (ctype); |
f181d4ae | 11862 | else if (DECL_STATIC_FUNCTION_P (decl1)) |
14d22dd6 | 11863 | push_nested_class (DECL_CONTEXT (decl1)); |
f181d4ae MM |
11864 | |
11865 | /* Now that we have entered the scope of the class, we must restore | |
11866 | the bindings for any template parameters surrounding DECL1, if it | |
11867 | is an inline member template. (Order is important; consider the | |
11868 | case where a template parameter has the same name as a field of | |
11869 | the class.) It is not until after this point that | |
11870 | PROCESSING_TEMPLATE_DECL is guaranteed to be set up correctly. */ | |
a8f73d4b | 11871 | if (flags & SF_INCLASS_INLINE) |
f181d4ae MM |
11872 | maybe_begin_member_template_processing (decl1); |
11873 | ||
56cb9733 | 11874 | /* Effective C++ rule 15. */ |
9188c363 | 11875 | if (warn_ecpp |
596ea4e5 | 11876 | && DECL_OVERLOADED_OPERATOR_P (decl1) == NOP_EXPR |
9188c363 | 11877 | && TREE_CODE (TREE_TYPE (fntype)) == VOID_TYPE) |
b323323f | 11878 | warning (OPT_Weffc__, "%<operator=%> should return a reference to %<*this%>"); |
9188c363 MM |
11879 | |
11880 | /* Make the init_value nonzero so pushdecl knows this is not tentative. | |
11881 | error_mark_node is replaced below (in poplevel) with the BLOCK. */ | |
b35d4555 MM |
11882 | if (!DECL_INITIAL (decl1)) |
11883 | DECL_INITIAL (decl1) = error_mark_node; | |
9188c363 | 11884 | |
9188c363 MM |
11885 | /* This function exists in static storage. |
11886 | (This does not mean `static' in the C sense!) */ | |
11887 | TREE_STATIC (decl1) = 1; | |
11888 | ||
11889 | /* We must call push_template_decl after current_class_type is set | |
11890 | up. (If we are processing inline definitions after exiting a | |
11891 | class scope, current_class_type will be NULL_TREE until set above | |
11892 | by push_nested_class.) */ | |
11893 | if (processing_template_decl) | |
11e97737 VR |
11894 | { |
11895 | /* FIXME: Handle error_mark_node more gracefully. */ | |
11896 | tree newdecl1 = push_template_decl (decl1); | |
11897 | if (newdecl1 != error_mark_node) | |
0cbd7506 | 11898 | decl1 = newdecl1; |
11e97737 | 11899 | } |
9188c363 | 11900 | |
f181d4ae | 11901 | /* We are now in the scope of the function being defined. */ |
8d08fdba | 11902 | current_function_decl = decl1; |
f181d4ae | 11903 | |
5566b478 MS |
11904 | /* Save the parm names or decls from this function's declarator |
11905 | where store_parm_decls will find them. */ | |
4546865e | 11906 | current_function_parms = DECL_ARGUMENTS (decl1); |
8d08fdba | 11907 | |
a8f73d4b MM |
11908 | /* Make sure the parameter and return types are reasonable. When |
11909 | you declare a function, these types can be incomplete, but they | |
11910 | must be complete when you define the function. */ | |
c9387915 | 11911 | check_function_type (decl1, current_function_parms); |
f181d4ae | 11912 | |
a8f73d4b MM |
11913 | /* Build the return declaration for the function. */ |
11914 | restype = TREE_TYPE (fntype); | |
e89a6075 | 11915 | if (DECL_RESULT (decl1) == NULL_TREE) |
a8f73d4b | 11916 | { |
b785f485 RH |
11917 | tree resdecl; |
11918 | ||
c2255bc4 | 11919 | resdecl = build_decl (input_location, RESULT_DECL, 0, restype); |
b785f485 RH |
11920 | DECL_ARTIFICIAL (resdecl) = 1; |
11921 | DECL_IGNORED_P (resdecl) = 1; | |
11922 | DECL_RESULT (decl1) = resdecl; | |
11923 | ||
9804209d | 11924 | cp_apply_type_quals_to_decl (cp_type_quals (restype), resdecl); |
5566b478 | 11925 | } |
a8f73d4b | 11926 | |
a8f73d4b | 11927 | /* Let the user know we're compiling this function. */ |
ea11ca7e | 11928 | announce_function (decl1); |
b7484fbe | 11929 | |
878cd289 MS |
11930 | /* Record the decl so that the function name is defined. |
11931 | If we already have a decl for this name, and it is a FUNCTION_DECL, | |
11932 | use the old decl. */ | |
a8f73d4b | 11933 | if (!processing_template_decl && !(flags & SF_PRE_PARSED)) |
878cd289 | 11934 | { |
75650646 | 11935 | /* A specialization is not used to guide overload resolution. */ |
18f5be99 | 11936 | if (!DECL_FUNCTION_MEMBER_P (decl1) |
caf93cb0 | 11937 | && !(DECL_USE_TEMPLATE (decl1) && |
18f5be99 | 11938 | PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (decl1)))) |
b1a19c7c MM |
11939 | { |
11940 | tree olddecl = pushdecl (decl1); | |
11941 | ||
11942 | if (olddecl == error_mark_node) | |
11943 | /* If something went wrong when registering the declaration, | |
11944 | use DECL1; we have to have a FUNCTION_DECL to use when | |
11945 | parsing the body of the function. */ | |
11946 | ; | |
11947 | else | |
dfdec7a7 ILT |
11948 | { |
11949 | /* Otherwise, OLDDECL is either a previous declaration | |
11950 | of the same function or DECL1 itself. */ | |
11951 | ||
11952 | if (warn_missing_declarations | |
11953 | && olddecl == decl1 | |
11954 | && !DECL_MAIN_P (decl1) | |
11955 | && TREE_PUBLIC (decl1) | |
11956 | && !DECL_DECLARED_INLINE_P (decl1)) | |
11957 | { | |
11958 | tree context; | |
11959 | ||
11960 | /* Check whether DECL1 is in an anonymous | |
11961 | namespace. */ | |
11962 | for (context = DECL_CONTEXT (decl1); | |
11963 | context; | |
11964 | context = DECL_CONTEXT (context)) | |
11965 | { | |
11966 | if (TREE_CODE (context) == NAMESPACE_DECL | |
11967 | && DECL_NAME (context) == NULL_TREE) | |
11968 | break; | |
11969 | } | |
11970 | ||
11971 | if (context == NULL) | |
11972 | warning (OPT_Wmissing_declarations, | |
11973 | "no previous declaration for %q+D", decl1); | |
11974 | } | |
11975 | ||
11976 | decl1 = olddecl; | |
11977 | } | |
b1a19c7c | 11978 | } |
2c73f9f5 | 11979 | else |
b7698cf0 | 11980 | { |
a1c65f9f | 11981 | /* We need to set the DECL_CONTEXT. */ |
b7698cf0 JM |
11982 | if (!DECL_CONTEXT (decl1) && DECL_TEMPLATE_INFO (decl1)) |
11983 | DECL_CONTEXT (decl1) = DECL_CONTEXT (DECL_TI_TEMPLATE (decl1)); | |
b7698cf0 | 11984 | } |
878cd289 | 11985 | fntype = TREE_TYPE (decl1); |
2ef06beb MM |
11986 | |
11987 | /* If #pragma weak applies, mark the decl appropriately now. | |
11988 | The pragma only applies to global functions. Because | |
11989 | determining whether or not the #pragma applies involves | |
11990 | computing the mangled name for the declaration, we cannot | |
11991 | apply the pragma until after we have merged this declaration | |
11992 | with any previous declarations; if the original declaration | |
11993 | has a linkage specification, that specification applies to | |
11994 | the definition as well, and may affect the mangled name. */ | |
11995 | if (!DECL_CONTEXT (decl1)) | |
11996 | maybe_apply_pragma_weak (decl1); | |
878cd289 | 11997 | } |
5566b478 | 11998 | |
72c4a4ca | 11999 | /* Reset this in case the call to pushdecl changed it. */ |
5566b478 | 12000 | current_function_decl = decl1; |
72c4a4ca GK |
12001 | |
12002 | gcc_assert (DECL_INITIAL (decl1)); | |
12003 | ||
12004 | /* This function may already have been parsed, in which case just | |
12005 | return; our caller will skip over the body without parsing. */ | |
12006 | if (DECL_INITIAL (decl1) != error_mark_node) | |
12007 | return; | |
12008 | ||
12009 | /* Initialize RTL machinery. We cannot do this until | |
12010 | CURRENT_FUNCTION_DECL and DECL_RESULT are set up. We do this | |
12011 | even when processing a template; this is how we get | |
12012 | CFUN set up, and our per-function variables initialized. | |
12013 | FIXME factor out the non-RTL stuff. */ | |
12014 | bl = current_binding_level; | |
182e0d71 | 12015 | allocate_struct_function (decl1, processing_template_decl); |
e8924938 PB |
12016 | |
12017 | /* Initialize the language data structures. Whenever we start | |
12018 | a new function, we destroy temporaries in the usual way. */ | |
a9429e29 | 12019 | cfun->language = ggc_alloc_cleared_language_function (); |
e8924938 | 12020 | current_stmt_tree ()->stmts_are_full_exprs_p = 1; |
72c4a4ca GK |
12021 | current_binding_level = bl; |
12022 | ||
12023 | /* Even though we're inside a function body, we still don't want to | |
12024 | call expand_expr to calculate the size of a variable-sized array. | |
12025 | We haven't necessarily assigned RTL to all variables yet, so it's | |
12026 | not safe to try to expand expressions involving them. */ | |
e3b5732b | 12027 | cfun->dont_save_pending_sizes_p = 1; |
72c4a4ca GK |
12028 | |
12029 | /* Start the statement-tree, start the tree now. */ | |
12030 | DECL_SAVED_TREE (decl1) = push_stmt_list (); | |
878cd289 | 12031 | |
78c120b5 MM |
12032 | /* If we are (erroneously) defining a function that we have already |
12033 | defined before, wipe out what we knew before. */ | |
e2500fed GK |
12034 | if (!DECL_PENDING_INLINE_P (decl1)) |
12035 | DECL_SAVED_FUNCTION_DATA (decl1) = NULL; | |
b35d4555 | 12036 | |
f444e36b | 12037 | if (ctype && !doing_friend && !DECL_STATIC_FUNCTION_P (decl1)) |
b35d4555 MM |
12038 | { |
12039 | /* We know that this was set up by `grokclassfn'. We do not | |
12040 | wait until `store_parm_decls', since evil parse errors may | |
12041 | never get us to that point. Here we keep the consistency | |
12042 | between `current_class_type' and `current_class_ptr'. */ | |
12043 | tree t = DECL_ARGUMENTS (decl1); | |
68642fb6 | 12044 | |
50bc768d NS |
12045 | gcc_assert (t != NULL_TREE && TREE_CODE (t) == PARM_DECL); |
12046 | gcc_assert (TREE_CODE (TREE_TYPE (t)) == POINTER_TYPE); | |
68642fb6 UD |
12047 | |
12048 | cp_function_chain->x_current_class_ref | |
dd865ef6 | 12049 | = cp_build_indirect_ref (t, RO_NULL, tf_warning_or_error); |
b35d4555 MM |
12050 | cp_function_chain->x_current_class_ptr = t; |
12051 | ||
018fc244 MM |
12052 | /* Constructors and destructors need to know whether they're "in |
12053 | charge" of initializing virtual base classes. */ | |
e0fff4b3 | 12054 | t = TREE_CHAIN (t); |
454fa7a7 | 12055 | if (DECL_HAS_IN_CHARGE_PARM_P (decl1)) |
e0fff4b3 JM |
12056 | { |
12057 | current_in_charge_parm = t; | |
12058 | t = TREE_CHAIN (t); | |
12059 | } | |
12060 | if (DECL_HAS_VTT_PARM_P (decl1)) | |
12061 | { | |
8dc2b103 | 12062 | gcc_assert (DECL_NAME (t) == vtt_parm_identifier); |
e0fff4b3 JM |
12063 | current_vtt_parm = t; |
12064 | } | |
b35d4555 MM |
12065 | } |
12066 | ||
1ef0df47 MM |
12067 | honor_interface = (!DECL_TEMPLATE_INSTANTIATION (decl1) |
12068 | /* Implicitly-defined methods (like the | |
12069 | destructor for a class in which no destructor | |
12070 | is explicitly declared) must not be defined | |
12071 | until their definition is needed. So, we | |
12072 | ignore interface specifications for | |
12073 | compiler-generated functions. */ | |
12074 | && !DECL_ARTIFICIAL (decl1)); | |
3db45ab5 | 12075 | |
db5ae43f | 12076 | if (DECL_INTERFACE_KNOWN (decl1)) |
faae18ab | 12077 | { |
4f1c5b7d | 12078 | tree ctx = decl_function_context (decl1); |
86052cc3 | 12079 | |
faae18ab MS |
12080 | if (DECL_NOT_REALLY_EXTERN (decl1)) |
12081 | DECL_EXTERNAL (decl1) = 0; | |
86052cc3 | 12082 | |
79065db2 | 12083 | if (ctx != NULL_TREE && DECL_DECLARED_INLINE_P (ctx) |
86052cc3 JM |
12084 | && TREE_PUBLIC (ctx)) |
12085 | /* This is a function in a local class in an extern inline | |
12086 | function. */ | |
12087 | comdat_linkage (decl1); | |
faae18ab | 12088 | } |
8d08fdba MS |
12089 | /* If this function belongs to an interface, it is public. |
12090 | If it belongs to someone else's interface, it is also external. | |
1f901793 | 12091 | This only affects inlines and template instantiations. */ |
1ef0df47 | 12092 | else if (!finfo->interface_unknown && honor_interface) |
8d08fdba | 12093 | { |
caf93cb0 | 12094 | if (DECL_DECLARED_INLINE_P (decl1) |
79065db2 | 12095 | || DECL_TEMPLATE_INSTANTIATION (decl1) |
5156628f | 12096 | || processing_template_decl) |
1f901793 JM |
12097 | { |
12098 | DECL_EXTERNAL (decl1) | |
5d709b00 | 12099 | = (finfo->interface_only |
caf93cb0 | 12100 | || (DECL_DECLARED_INLINE_P (decl1) |
79065db2 | 12101 | && ! flag_implement_inlines |
9c73ec84 | 12102 | && !DECL_VINDEX (decl1))); |
1f901793 JM |
12103 | |
12104 | /* For WIN32 we also want to put these in linkonce sections. */ | |
12105 | maybe_make_one_only (decl1); | |
12106 | } | |
db5ae43f | 12107 | else |
893de33c | 12108 | DECL_EXTERNAL (decl1) = 0; |
db5ae43f | 12109 | DECL_INTERFACE_KNOWN (decl1) = 1; |
4684cd27 | 12110 | /* If this function is in an interface implemented in this file, |
3b426391 | 12111 | make sure that the back end knows to emit this function |
4684cd27 MM |
12112 | here. */ |
12113 | if (!DECL_EXTERNAL (decl1)) | |
12114 | mark_needed (decl1); | |
8d08fdba | 12115 | } |
5d709b00 | 12116 | else if (finfo->interface_unknown && finfo->interface_only |
1ef0df47 | 12117 | && honor_interface) |
c16c47fb JM |
12118 | { |
12119 | /* If MULTIPLE_SYMBOL_SPACES is defined and we saw a #pragma | |
5d709b00 ZW |
12120 | interface, we will have both finfo->interface_unknown and |
12121 | finfo->interface_only set. In that case, we don't want to | |
12122 | use the normal heuristics because someone will supply a | |
12123 | #pragma implementation elsewhere, and deducing it here would | |
12124 | produce a conflict. */ | |
c16c47fb JM |
12125 | comdat_linkage (decl1); |
12126 | DECL_EXTERNAL (decl1) = 0; | |
12127 | DECL_INTERFACE_KNOWN (decl1) = 1; | |
12128 | DECL_DEFER_OUTPUT (decl1) = 1; | |
12129 | } | |
8d08fdba | 12130 | else |
a0a33927 MS |
12131 | { |
12132 | /* This is a definition, not a reference. | |
3a47c4e4 AO |
12133 | So clear DECL_EXTERNAL, unless this is a GNU extern inline. */ |
12134 | if (!GNU_INLINE_P (decl1)) | |
12135 | DECL_EXTERNAL (decl1) = 0; | |
faae18ab | 12136 | |
caf93cb0 | 12137 | if ((DECL_DECLARED_INLINE_P (decl1) |
79065db2 | 12138 | || DECL_TEMPLATE_INSTANTIATION (decl1)) |
fb4117f8 | 12139 | && ! DECL_INTERFACE_KNOWN (decl1)) |
878cd289 MS |
12140 | DECL_DEFER_OUTPUT (decl1) = 1; |
12141 | else | |
893de33c | 12142 | DECL_INTERFACE_KNOWN (decl1) = 1; |
db5ae43f | 12143 | } |
a9aedbc2 | 12144 | |
0ed5edac JM |
12145 | /* Determine the ELF visibility attribute for the function. We must not |
12146 | do this before calling "pushdecl", as we must allow "duplicate_decls" | |
12147 | to merge any attributes appropriately. We also need to wait until | |
12148 | linkage is set. */ | |
12149 | if (!DECL_CLONED_FUNCTION_P (decl1)) | |
12150 | determine_visibility (decl1); | |
12151 | ||
ac20c67a | 12152 | begin_scope (sk_function_parms, decl1); |
8d08fdba | 12153 | |
5566b478 MS |
12154 | ++function_depth; |
12155 | ||
44d10c10 PB |
12156 | if (DECL_DESTRUCTOR_P (decl1) |
12157 | || (DECL_CONSTRUCTOR_P (decl1) | |
12158 | && targetm.cxx.cdtor_returns_this ())) | |
46e8c075 | 12159 | { |
c2255bc4 AH |
12160 | cdtor_label = build_decl (input_location, |
12161 | LABEL_DECL, NULL_TREE, NULL_TREE); | |
44d10c10 | 12162 | DECL_CONTEXT (cdtor_label) = current_function_decl; |
46e8c075 | 12163 | } |
8d08fdba | 12164 | |
0ba8a114 | 12165 | start_fname_decls (); |
caf93cb0 | 12166 | |
f444e36b | 12167 | store_parm_decls (current_function_parms); |
058b15c1 MM |
12168 | } |
12169 | ||
12170 | ||
12171 | /* Like start_preparsed_function, except that instead of a | |
12172 | FUNCTION_DECL, this function takes DECLSPECS and DECLARATOR. | |
12173 | ||
12174 | Returns 1 on success. If the DECLARATOR is not suitable for a function | |
12175 | (it defines a datum instead), we return 0, which tells | |
12176 | yyparse to report a parse error. */ | |
12177 | ||
12178 | int | |
caf93cb0 | 12179 | start_function (cp_decl_specifier_seq *declspecs, |
62d1db17 | 12180 | const cp_declarator *declarator, |
058b15c1 MM |
12181 | tree attrs) |
12182 | { | |
12183 | tree decl1; | |
12184 | ||
058b15c1 | 12185 | decl1 = grokdeclarator (declarator, declspecs, FUNCDEF, 1, &attrs); |
49f098f2 JJ |
12186 | if (decl1 == error_mark_node) |
12187 | return 0; | |
058b15c1 MM |
12188 | /* If the declarator is not suitable for a function definition, |
12189 | cause a syntax error. */ | |
12190 | if (decl1 == NULL_TREE || TREE_CODE (decl1) != FUNCTION_DECL) | |
49f098f2 JJ |
12191 | { |
12192 | error ("invalid function declaration"); | |
12193 | return 0; | |
12194 | } | |
caf93cb0 | 12195 | |
058b15c1 | 12196 | if (DECL_MAIN_P (decl1)) |
2cfe82fe ZW |
12197 | /* main must return int. grokfndecl should have corrected it |
12198 | (and issued a diagnostic) if the user got it wrong. */ | |
12199 | gcc_assert (same_type_p (TREE_TYPE (TREE_TYPE (decl1)), | |
12200 | integer_type_node)); | |
058b15c1 MM |
12201 | |
12202 | start_preparsed_function (decl1, attrs, /*flags=*/SF_DEFAULT); | |
f444e36b | 12203 | |
8d08fdba MS |
12204 | return 1; |
12205 | } | |
12206 | \f | |
68d04c67 MM |
12207 | /* Returns true iff an EH_SPEC_BLOCK should be created in the body of |
12208 | FN. */ | |
12209 | ||
12210 | static bool | |
12211 | use_eh_spec_block (tree fn) | |
12212 | { | |
12213 | return (flag_exceptions && flag_enforce_eh_specs | |
12214 | && !processing_template_decl | |
3a55fb4c | 12215 | && !type_throw_all_p (TREE_TYPE (fn)) |
68d04c67 MM |
12216 | /* We insert the EH_SPEC_BLOCK only in the original |
12217 | function; then, it is copied automatically to the | |
12218 | clones. */ | |
12219 | && !DECL_CLONED_FUNCTION_P (fn) | |
12220 | /* Implicitly-generated constructors and destructors have | |
12221 | exception specifications. However, those specifications | |
12222 | are the union of the possible exceptions specified by the | |
12223 | constructors/destructors for bases and members, so no | |
12224 | unallowed exception will ever reach this function. By | |
12225 | not creating the EH_SPEC_BLOCK we save a little memory, | |
12226 | and we avoid spurious warnings about unreachable | |
12227 | code. */ | |
12228 | && !DECL_ARTIFICIAL (fn)); | |
12229 | } | |
12230 | ||
8d08fdba MS |
12231 | /* Store the parameter declarations into the current function declaration. |
12232 | This is called after parsing the parameter declarations, before | |
12233 | digesting the body of the function. | |
12234 | ||
12235 | Also install to binding contour return value identifier, if any. */ | |
12236 | ||
f444e36b | 12237 | static void |
11f6b451 | 12238 | store_parm_decls (tree current_function_parms) |
8d08fdba | 12239 | { |
926ce8bd KH |
12240 | tree fndecl = current_function_decl; |
12241 | tree parm; | |
8d08fdba | 12242 | |
8d08fdba MS |
12243 | /* This is a chain of any other decls that came in among the parm |
12244 | declarations. If a parm is declared with enum {foo, bar} x; | |
12245 | then CONST_DECLs for foo and bar are put here. */ | |
12246 | tree nonparms = NULL_TREE; | |
12247 | ||
b35d4555 | 12248 | if (current_function_parms) |
8d08fdba MS |
12249 | { |
12250 | /* This case is when the function was defined with an ANSI prototype. | |
12251 | The parms already have decls, so we need not do anything here | |
12252 | except record them as in effect | |
12253 | and complain if any redundant old-style parm decls were written. */ | |
12254 | ||
b35d4555 MM |
12255 | tree specparms = current_function_parms; |
12256 | tree next; | |
12257 | ||
f444e36b | 12258 | /* Must clear this because it might contain TYPE_DECLs declared |
b35d4555 | 12259 | at class level. */ |
00e8de68 | 12260 | current_binding_level->names = NULL; |
8d08fdba | 12261 | |
f444e36b | 12262 | /* If we're doing semantic analysis, then we'll call pushdecl |
b35d4555 MM |
12263 | for each of these. We must do them in reverse order so that |
12264 | they end in the correct forward order. */ | |
f444e36b | 12265 | specparms = nreverse (specparms); |
5566b478 | 12266 | |
b35d4555 | 12267 | for (parm = specparms; parm; parm = next) |
8d08fdba MS |
12268 | { |
12269 | next = TREE_CHAIN (parm); | |
12270 | if (TREE_CODE (parm) == PARM_DECL) | |
12271 | { | |
f444e36b MM |
12272 | if (DECL_NAME (parm) == NULL_TREE |
12273 | || TREE_CODE (parm) != VOID_TYPE) | |
12274 | pushdecl (parm); | |
12275 | else | |
2d01edd7 | 12276 | error ("parameter %qD declared void", parm); |
8d08fdba MS |
12277 | } |
12278 | else | |
12279 | { | |
12280 | /* If we find an enum constant or a type tag, | |
12281 | put it aside for the moment. */ | |
12282 | TREE_CHAIN (parm) = NULL_TREE; | |
12283 | nonparms = chainon (nonparms, parm); | |
12284 | } | |
12285 | } | |
12286 | ||
f444e36b MM |
12287 | /* Get the decls in their original chain order and record in the |
12288 | function. This is all and only the PARM_DECLs that were | |
12289 | pushed into scope by the loop above. */ | |
12290 | DECL_ARGUMENTS (fndecl) = getdecls (); | |
8d08fdba MS |
12291 | } |
12292 | else | |
12293 | DECL_ARGUMENTS (fndecl) = NULL_TREE; | |
12294 | ||
12295 | /* Now store the final chain of decls for the arguments | |
12296 | as the decl-chain of the current lexical scope. | |
12297 | Put the enumerators in as well, at the front so that | |
12298 | DECL_ARGUMENTS is not modified. */ | |
00e8de68 | 12299 | current_binding_level->names = chainon (nonparms, DECL_ARGUMENTS (fndecl)); |
eb448459 | 12300 | |
68d04c67 MM |
12301 | if (use_eh_spec_block (current_function_decl)) |
12302 | current_eh_spec_block = begin_eh_spec_block (); | |
8d08fdba MS |
12303 | } |
12304 | ||
8d08fdba | 12305 | \f |
59026e79 MM |
12306 | /* We have finished doing semantic analysis on DECL, but have not yet |
12307 | generated RTL for its body. Save away our current state, so that | |
12308 | when we want to generate RTL later we know what to do. */ | |
12309 | ||
12310 | static void | |
11f6b451 | 12311 | save_function_data (tree decl) |
59026e79 | 12312 | { |
e2500fed | 12313 | struct language_function *f; |
59026e79 MM |
12314 | |
12315 | /* Save the language-specific per-function data so that we can | |
12316 | get it back when we really expand this function. */ | |
50bc768d | 12317 | gcc_assert (!DECL_PENDING_INLINE_P (decl)); |
68642fb6 | 12318 | |
59026e79 | 12319 | /* Make a copy. */ |
a9429e29 | 12320 | f = ggc_alloc_language_function (); |
e2500fed | 12321 | memcpy (f, cp_function_chain, sizeof (struct language_function)); |
59026e79 MM |
12322 | DECL_SAVED_FUNCTION_DATA (decl) = f; |
12323 | ||
12324 | /* Clear out the bits we don't need. */ | |
325c3691 | 12325 | f->base.x_stmt_tree.x_cur_stmt_list = NULL_TREE; |
59026e79 | 12326 | f->bindings = NULL; |
8e4ce833 | 12327 | f->x_local_names = NULL; |
59026e79 MM |
12328 | } |
12329 | ||
cdd2559c | 12330 | |
44d10c10 | 12331 | /* Set the return value of the constructor (if present). */ |
efee38a9 MM |
12332 | |
12333 | static void | |
11f6b451 | 12334 | finish_constructor_body (void) |
efee38a9 | 12335 | { |
44d10c10 PB |
12336 | tree val; |
12337 | tree exprstmt; | |
12338 | ||
298b7d2b AH |
12339 | if (targetm.cxx.cdtor_returns_this () |
12340 | && (! TYPE_FOR_JAVA (current_class_type))) | |
44d10c10 PB |
12341 | { |
12342 | /* Any return from a constructor will end up here. */ | |
c2255bc4 | 12343 | add_stmt (build_stmt (input_location, LABEL_EXPR, cdtor_label)); |
44d10c10 PB |
12344 | |
12345 | val = DECL_ARGUMENTS (current_function_decl); | |
f293ce4b RS |
12346 | val = build2 (MODIFY_EXPR, TREE_TYPE (val), |
12347 | DECL_RESULT (current_function_decl), val); | |
44d10c10 | 12348 | /* Return the address of the object. */ |
c2255bc4 | 12349 | exprstmt = build_stmt (input_location, RETURN_EXPR, val); |
44d10c10 PB |
12350 | add_stmt (exprstmt); |
12351 | } | |
efee38a9 MM |
12352 | } |
12353 | ||
cdd2559c JM |
12354 | /* Do all the processing for the beginning of a destructor; set up the |
12355 | vtable pointers and cleanups for bases and members. */ | |
12356 | ||
12357 | static void | |
11f6b451 | 12358 | begin_destructor_body (void) |
cdd2559c | 12359 | { |
cdd2559c JM |
12360 | tree compound_stmt; |
12361 | ||
0e686aa6 MM |
12362 | /* If the CURRENT_CLASS_TYPE is incomplete, we will have already |
12363 | issued an error message. We still want to try to process the | |
12364 | body of the function, but initialize_vtbl_ptrs will crash if | |
12365 | TYPE_BINFO is NULL. */ | |
12366 | if (COMPLETE_TYPE_P (current_class_type)) | |
12367 | { | |
12368 | compound_stmt = begin_compound_stmt (0); | |
12369 | /* Make all virtual function table pointers in non-virtual base | |
12370 | classes point to CURRENT_CLASS_TYPE's virtual function | |
12371 | tables. */ | |
12372 | initialize_vtbl_ptrs (current_class_ptr); | |
12373 | finish_compound_stmt (compound_stmt); | |
3db45ab5 | 12374 | |
0e686aa6 MM |
12375 | /* And insert cleanups for our bases and members so that they |
12376 | will be properly destroyed if we throw. */ | |
12377 | push_base_cleanups (); | |
12378 | } | |
cdd2559c JM |
12379 | } |
12380 | ||
ade3dc07 JM |
12381 | /* At the end of every destructor we generate code to delete the object if |
12382 | necessary. Do that now. */ | |
9bfadf57 MM |
12383 | |
12384 | static void | |
11f6b451 | 12385 | finish_destructor_body (void) |
9bfadf57 | 12386 | { |
9bfadf57 MM |
12387 | tree exprstmt; |
12388 | ||
5633b37c MM |
12389 | /* Any return from a destructor will end up here; that way all base |
12390 | and member cleanups will be run when the function returns. */ | |
c2255bc4 | 12391 | add_stmt (build_stmt (input_location, LABEL_EXPR, cdtor_label)); |
5633b37c | 12392 | |
52682a1b MM |
12393 | /* In a virtual destructor, we must call delete. */ |
12394 | if (DECL_VIRTUAL_P (current_function_decl)) | |
12395 | { | |
12396 | tree if_stmt; | |
fa72b064 | 12397 | tree virtual_size = cxx_sizeof (current_class_type); |
68642fb6 | 12398 | |
52682a1b | 12399 | /* [class.dtor] |
68642fb6 | 12400 | |
ade3dc07 JM |
12401 | At the point of definition of a virtual destructor (including |
12402 | an implicit definition), non-placement operator delete shall | |
12403 | be looked up in the scope of the destructor's class and if | |
12404 | found shall be accessible and unambiguous. */ | |
3db45ab5 | 12405 | exprstmt = build_op_delete_call(DELETE_EXPR, current_class_ptr, |
63c9a190 | 12406 | virtual_size, |
3db45ab5 MS |
12407 | /*global_p=*/false, |
12408 | /*placement=*/NULL_TREE, | |
63c9a190 | 12409 | /*alloc_fn=*/NULL_TREE); |
298d6f60 | 12410 | |
52682a1b | 12411 | if_stmt = begin_if_stmt (); |
f293ce4b RS |
12412 | finish_if_stmt_cond (build2 (BIT_AND_EXPR, integer_type_node, |
12413 | current_in_charge_parm, | |
12414 | integer_one_node), | |
52682a1b MM |
12415 | if_stmt); |
12416 | finish_expr_stmt (exprstmt); | |
12417 | finish_then_clause (if_stmt); | |
325c3691 | 12418 | finish_if_stmt (if_stmt); |
52682a1b | 12419 | } |
44d10c10 PB |
12420 | |
12421 | if (targetm.cxx.cdtor_returns_this ()) | |
12422 | { | |
12423 | tree val; | |
12424 | ||
12425 | val = DECL_ARGUMENTS (current_function_decl); | |
f293ce4b RS |
12426 | val = build2 (MODIFY_EXPR, TREE_TYPE (val), |
12427 | DECL_RESULT (current_function_decl), val); | |
44d10c10 | 12428 | /* Return the address of the object. */ |
c2255bc4 | 12429 | exprstmt = build_stmt (input_location, RETURN_EXPR, val); |
44d10c10 PB |
12430 | add_stmt (exprstmt); |
12431 | } | |
ade3dc07 | 12432 | } |
9bfadf57 | 12433 | |
ade3dc07 JM |
12434 | /* Do the necessary processing for the beginning of a function body, which |
12435 | in this case includes member-initializers, but not the catch clauses of | |
12436 | a function-try-block. Currently, this means opening a binding level | |
86ad3aa9 | 12437 | for the member-initializers (in a ctor) and member cleanups (in a dtor). */ |
ade3dc07 JM |
12438 | |
12439 | tree | |
11f6b451 | 12440 | begin_function_body (void) |
ade3dc07 | 12441 | { |
cdd2559c JM |
12442 | tree stmt; |
12443 | ||
86ad3aa9 JM |
12444 | if (! FUNCTION_NEEDS_BODY_BLOCK (current_function_decl)) |
12445 | return NULL_TREE; | |
12446 | ||
b5856475 JM |
12447 | if (processing_template_decl) |
12448 | /* Do nothing now. */; | |
12449 | else | |
12450 | /* Always keep the BLOCK node associated with the outermost pair of | |
12451 | curly braces of a function. These are needed for correct | |
12452 | operation of dwarfout.c. */ | |
ac20c67a | 12453 | keep_next_level (true); |
b5856475 | 12454 | |
325c3691 | 12455 | stmt = begin_compound_stmt (BCS_FN_BODY); |
cdd2559c JM |
12456 | |
12457 | if (processing_template_decl) | |
12458 | /* Do nothing now. */; | |
cdd2559c JM |
12459 | else if (DECL_DESTRUCTOR_P (current_function_decl)) |
12460 | begin_destructor_body (); | |
12461 | ||
ade3dc07 | 12462 | return stmt; |
9bfadf57 MM |
12463 | } |
12464 | ||
ade3dc07 JM |
12465 | /* Do the processing for the end of a function body. Currently, this means |
12466 | closing out the cleanups for fully-constructed bases and members, and in | |
12467 | the case of the destructor, deleting the object if desired. Again, this | |
12468 | is only meaningful for [cd]tors, since they are the only functions where | |
12469 | there is a significant distinction between the main body and any | |
12470 | function catch clauses. Handling, say, main() return semantics here | |
12471 | would be wrong, as flowing off the end of a function catch clause for | |
12472 | main() would also need to return 0. */ | |
12473 | ||
12474 | void | |
11f6b451 | 12475 | finish_function_body (tree compstmt) |
ade3dc07 | 12476 | { |
86ad3aa9 JM |
12477 | if (compstmt == NULL_TREE) |
12478 | return; | |
3db45ab5 | 12479 | |
5633b37c | 12480 | /* Close the block. */ |
7a3397c7 | 12481 | finish_compound_stmt (compstmt); |
ade3dc07 JM |
12482 | |
12483 | if (processing_template_decl) | |
12484 | /* Do nothing now. */; | |
12485 | else if (DECL_CONSTRUCTOR_P (current_function_decl)) | |
12486 | finish_constructor_body (); | |
12487 | else if (DECL_DESTRUCTOR_P (current_function_decl)) | |
12488 | finish_destructor_body (); | |
caf93cb0 | 12489 | } |
ade3dc07 | 12490 | |
86ad3aa9 JM |
12491 | /* Given a function, returns the BLOCK corresponding to the outermost level |
12492 | of curly braces, skipping the artificial block created for constructor | |
12493 | initializers. */ | |
12494 | ||
a68ab351 | 12495 | tree |
86ad3aa9 JM |
12496 | outer_curly_brace_block (tree fndecl) |
12497 | { | |
12498 | tree block = BLOCK_SUBBLOCKS (DECL_INITIAL (fndecl)); | |
12499 | if (FUNCTION_NEEDS_BODY_BLOCK (current_function_decl)) | |
12500 | /* Skip the artificial function body block. */ | |
12501 | block = BLOCK_SUBBLOCKS (block); | |
12502 | return block; | |
12503 | } | |
12504 | ||
8d08fdba MS |
12505 | /* Finish up a function declaration and compile that function |
12506 | all the way to assembler language output. The free the storage | |
12507 | for the function definition. | |
12508 | ||
68642fb6 | 12509 | FLAGS is a bitwise or of the following values: |
f181d4ae MM |
12510 | 2 - INCLASS_INLINE |
12511 | We just finished processing the body of an in-class inline | |
12512 | function definition. (This processing will have taken place | |
87e3dbc9 | 12513 | after the class definition is complete.) */ |
8d08fdba | 12514 | |
4d6abc1c | 12515 | tree |
11f6b451 | 12516 | finish_function (int flags) |
8d08fdba | 12517 | { |
926ce8bd | 12518 | tree fndecl = current_function_decl; |
8d08fdba | 12519 | tree fntype, ctype = NULL_TREE; |
f181d4ae | 12520 | int inclass_inline = (flags & 2) != 0; |
87e3dbc9 | 12521 | int nested; |
8d08fdba MS |
12522 | |
12523 | /* When we get some parse errors, we can end up without a | |
12524 | current_function_decl, so cope. */ | |
12525 | if (fndecl == NULL_TREE) | |
4d6abc1c | 12526 | return error_mark_node; |
8d08fdba | 12527 | |
3368cdd3 JJ |
12528 | gcc_assert (!defer_mark_used_calls); |
12529 | defer_mark_used_calls = true; | |
12530 | ||
9aad8f83 MA |
12531 | if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fndecl) |
12532 | && DECL_VIRTUAL_P (fndecl) | |
12533 | && !processing_template_decl) | |
12534 | { | |
12535 | tree fnclass = DECL_CONTEXT (fndecl); | |
12536 | if (fndecl == CLASSTYPE_KEY_METHOD (fnclass)) | |
12537 | keyed_classes = tree_cons (NULL_TREE, fnclass, keyed_classes); | |
12538 | } | |
12539 | ||
87e3dbc9 | 12540 | nested = function_depth > 1; |
8d08fdba MS |
12541 | fntype = TREE_TYPE (fndecl); |
12542 | ||
9bfadf57 MM |
12543 | /* TREE_READONLY (fndecl) = 1; |
12544 | This caused &foo to be of type ptr-to-const-function | |
12545 | which then got a warning when stored in a ptr-to-function variable. */ | |
8d08fdba | 12546 | |
50bc768d | 12547 | gcc_assert (building_stmt_tree ()); |
72c4a4ca GK |
12548 | /* The current function is being defined, so its DECL_INITIAL should |
12549 | be set, and unless there's a multiple definition, it should be | |
12550 | error_mark_node. */ | |
12551 | gcc_assert (DECL_INITIAL (fndecl) == error_mark_node); | |
caf93cb0 | 12552 | |
db9b2174 MM |
12553 | /* For a cloned function, we've already got all the code we need; |
12554 | there's no need to add any extra bits. */ | |
f444e36b | 12555 | if (!DECL_CLONED_FUNCTION_P (fndecl)) |
8d08fdba | 12556 | { |
ade3dc07 | 12557 | if (DECL_MAIN_P (current_function_decl)) |
efee38a9 | 12558 | { |
43e05e45 SB |
12559 | tree stmt; |
12560 | ||
12561 | /* Make it so that `main' always returns 0 by default (or | |
12562 | 1 for VMS). */ | |
08c7ae5a | 12563 | #if VMS_TARGET |
43e05e45 | 12564 | stmt = finish_return_stmt (integer_one_node); |
efee38a9 | 12565 | #else |
43e05e45 | 12566 | stmt = finish_return_stmt (integer_zero_node); |
efee38a9 | 12567 | #endif |
43e05e45 SB |
12568 | /* Hack. We don't want the middle-end to warn that this |
12569 | return is unreachable, so put the statement on the | |
12570 | special line 0. */ | |
5ffeb913 TT |
12571 | { |
12572 | location_t linezero = linemap_line_start (line_table, 0, 1); | |
12573 | SET_EXPR_LOCATION (stmt, linezero); | |
12574 | } | |
efee38a9 | 12575 | } |
87e3dbc9 | 12576 | |
68d04c67 | 12577 | if (use_eh_spec_block (current_function_decl)) |
52a11cbf RH |
12578 | finish_eh_spec_block (TYPE_RAISES_EXCEPTIONS |
12579 | (TREE_TYPE (current_function_decl)), | |
12580 | current_eh_spec_block); | |
5566b478 | 12581 | } |
68642fb6 | 12582 | |
558475f0 | 12583 | /* If we're saving up tree structure, tie off the function now. */ |
325c3691 RH |
12584 | DECL_SAVED_TREE (fndecl) = pop_stmt_list (DECL_SAVED_TREE (fndecl)); |
12585 | ||
12586 | finish_fname_decls (); | |
8d2733ca | 12587 | |
b2dd096b MM |
12588 | /* If this function can't throw any exceptions, remember that. */ |
12589 | if (!processing_template_decl | |
12590 | && !cp_function_chain->can_throw | |
be0436d7 | 12591 | && !flag_non_call_exceptions |
56fd65c7 | 12592 | && !DECL_REPLACEABLE_P (fndecl)) |
b2dd096b MM |
12593 | TREE_NOTHROW (fndecl) = 1; |
12594 | ||
8d08fdba MS |
12595 | /* This must come after expand_function_end because cleanups might |
12596 | have declarations (from inline functions) that need to go into | |
12597 | this function's blocks. */ | |
caf93cb0 | 12598 | |
7437519c ZW |
12599 | /* If the current binding level isn't the outermost binding level |
12600 | for this function, either there is a bug, or we have experienced | |
12601 | syntax errors and the statement tree is malformed. */ | |
a7e8c268 | 12602 | if (current_binding_level->kind != sk_function_parms) |
7437519c ZW |
12603 | { |
12604 | /* Make sure we have already experienced errors. */ | |
8dc2b103 | 12605 | gcc_assert (errorcount); |
7437519c ZW |
12606 | |
12607 | /* Throw away the broken statement tree and extra binding | |
0cbd7506 | 12608 | levels. */ |
5882f0f3 | 12609 | DECL_SAVED_TREE (fndecl) = alloc_stmt_list (); |
7437519c | 12610 | |
a7e8c268 | 12611 | while (current_binding_level->kind != sk_function_parms) |
7437519c | 12612 | { |
a7e8c268 | 12613 | if (current_binding_level->kind == sk_class) |
7437519c ZW |
12614 | pop_nested_class (); |
12615 | else | |
12616 | poplevel (0, 0, 0); | |
12617 | } | |
12618 | } | |
f444e36b | 12619 | poplevel (1, 0, 1); |
8d08fdba | 12620 | |
4985cde3 RH |
12621 | /* Statements should always be full-expressions at the outermost set |
12622 | of curly braces for a function. */ | |
50bc768d | 12623 | gcc_assert (stmts_are_full_exprs_p ()); |
4985cde3 | 12624 | |
6de9cd9a | 12625 | /* Set up the named return value optimization, if we can. Candidate |
59fe9274 | 12626 | variables are selected in check_return_expr. */ |
07b2f2fd JM |
12627 | if (current_function_return_value) |
12628 | { | |
12629 | tree r = current_function_return_value; | |
35e939ae JM |
12630 | tree outer; |
12631 | ||
07b2f2fd | 12632 | if (r != error_mark_node |
35e939ae JM |
12633 | /* This is only worth doing for fns that return in memory--and |
12634 | simpler, since we don't have to worry about promoted modes. */ | |
61f71b34 | 12635 | && aggregate_value_p (TREE_TYPE (TREE_TYPE (fndecl)), fndecl) |
35e939ae JM |
12636 | /* Only allow this for variables declared in the outer scope of |
12637 | the function so we know that their lifetime always ends with a | |
12638 | return; see g++.dg/opt/nrv6.C. We could be more flexible if | |
12639 | we were to do this optimization in tree-ssa. */ | |
86ad3aa9 | 12640 | && (outer = outer_curly_brace_block (fndecl)) |
325c3691 | 12641 | && chain_member (r, BLOCK_VARS (outer))) |
6de9cd9a DN |
12642 | finalize_nrv (&DECL_SAVED_TREE (fndecl), r, DECL_RESULT (fndecl)); |
12643 | ||
12644 | current_function_return_value = NULL_TREE; | |
07b2f2fd JM |
12645 | } |
12646 | ||
a8f73d4b | 12647 | /* Remember that we were in class scope. */ |
db5ae43f | 12648 | if (current_class_name) |
a8f73d4b | 12649 | ctype = current_class_type; |
db5ae43f | 12650 | |
1caa11d3 MM |
12651 | /* Must mark the RESULT_DECL as being in this function. */ |
12652 | DECL_CONTEXT (DECL_RESULT (fndecl)) = fndecl; | |
12653 | ||
12654 | /* Set the BLOCK_SUPERCONTEXT of the outermost function scope to point | |
12655 | to the FUNCTION_DECL node itself. */ | |
12656 | BLOCK_SUPERCONTEXT (DECL_INITIAL (fndecl)) = fndecl; | |
12657 | ||
59026e79 | 12658 | /* Save away current state, if appropriate. */ |
f444e36b | 12659 | if (!processing_template_decl) |
59026e79 MM |
12660 | save_function_data (fndecl); |
12661 | ||
efe49da0 | 12662 | /* Complain if there's just no return statement. */ |
46cfb101 | 12663 | if (warn_return_type |
efe49da0 | 12664 | && TREE_CODE (TREE_TYPE (fntype)) != VOID_TYPE |
c1b83cc9 | 12665 | && !dependent_type_p (TREE_TYPE (fntype)) |
57d5032b | 12666 | && !current_function_returns_value && !current_function_returns_null |
efe49da0 JM |
12667 | /* Don't complain if we abort or throw. */ |
12668 | && !current_function_returns_abnormally | |
ef5d1181 JJ |
12669 | /* Don't complain if we are declared noreturn. */ |
12670 | && !TREE_THIS_VOLATILE (fndecl) | |
55e99d52 | 12671 | && !DECL_NAME (DECL_RESULT (fndecl)) |
4847609e | 12672 | && !TREE_NO_WARNING (fndecl) |
44d10c10 PB |
12673 | /* Structor return values (if any) are set by the compiler. */ |
12674 | && !DECL_CONSTRUCTOR_P (fndecl) | |
12675 | && !DECL_DESTRUCTOR_P (fndecl)) | |
4847609e JH |
12676 | { |
12677 | warning (OPT_Wreturn_type, | |
12678 | "no return statement in function returning non-void"); | |
12679 | TREE_NO_WARNING (fndecl) = 1; | |
12680 | } | |
4985cde3 | 12681 | |
6de9cd9a DN |
12682 | /* Store the end of the function, so that we get good line number |
12683 | info for the epilogue. */ | |
12684 | cfun->function_end_locus = input_location; | |
12685 | ||
03a904b5 JJ |
12686 | /* Complain about parameters that are only set, but never otherwise used. */ |
12687 | if (warn_unused_but_set_parameter | |
12688 | && !processing_template_decl | |
12689 | && errorcount == unused_but_set_errorcount | |
12690 | && !DECL_CLONED_FUNCTION_P (fndecl)) | |
12691 | { | |
12692 | tree decl; | |
12693 | ||
12694 | for (decl = DECL_ARGUMENTS (fndecl); | |
12695 | decl; | |
12696 | decl = TREE_CHAIN (decl)) | |
12697 | if (TREE_USED (decl) | |
12698 | && TREE_CODE (decl) == PARM_DECL | |
12699 | && !DECL_READ_P (decl) | |
12700 | && DECL_NAME (decl) | |
12701 | && !DECL_ARTIFICIAL (decl) | |
12702 | && !TREE_NO_WARNING (decl) | |
12703 | && !DECL_IN_SYSTEM_HEADER (decl) | |
12704 | && TREE_TYPE (decl) != error_mark_node | |
12705 | && TREE_CODE (TREE_TYPE (decl)) != REFERENCE_TYPE | |
12706 | && (!CLASS_TYPE_P (TREE_TYPE (decl)) | |
12707 | || !TYPE_HAS_NONTRIVIAL_DESTRUCTOR (TREE_TYPE (decl)))) | |
12708 | warning (OPT_Wunused_but_set_parameter, | |
12709 | "parameter %q+D set but not used", decl); | |
12710 | unused_but_set_errorcount = errorcount; | |
12711 | } | |
12712 | ||
6de9cd9a DN |
12713 | /* Genericize before inlining. */ |
12714 | if (!processing_template_decl) | |
12715 | { | |
37e6d6fe | 12716 | struct language_function *f = DECL_SAVED_FUNCTION_DATA (fndecl); |
1c701f96 | 12717 | invoke_plugin_callbacks (PLUGIN_PRE_GENERICIZE, fndecl); |
5a508662 | 12718 | cp_genericize (fndecl); |
37e6d6fe JH |
12719 | /* Clear out the bits we don't need. */ |
12720 | f->x_current_class_ptr = NULL; | |
12721 | f->x_current_class_ref = NULL; | |
12722 | f->x_eh_spec_block = NULL; | |
12723 | f->x_in_charge_parm = NULL; | |
12724 | f->x_vtt_parm = NULL; | |
12725 | f->x_return_value = NULL; | |
12726 | f->bindings = NULL; | |
10827cd8 | 12727 | f->extern_decl_map = NULL; |
6de9cd9a | 12728 | } |
37e6d6fe JH |
12729 | /* Clear out the bits we don't need. */ |
12730 | local_names = NULL; | |
6de9cd9a DN |
12731 | |
12732 | /* We're leaving the context of this function, so zap cfun. It's still in | |
12733 | DECL_STRUCT_FUNCTION, and we'll restore it in tree_rest_of_compilation. */ | |
db2960f4 | 12734 | set_cfun (NULL); |
c1f927e8 | 12735 | current_function_decl = NULL; |
a8f73d4b | 12736 | |
27631dae | 12737 | /* If this is an in-class inline definition, we may have to pop the |
a8f73d4b MM |
12738 | bindings for the template parameters that we added in |
12739 | maybe_begin_member_template_processing when start_function was | |
12740 | called. */ | |
12741 | if (inclass_inline) | |
12742 | maybe_end_member_template_processing (); | |
12743 | ||
12744 | /* Leave the scope of the class. */ | |
12745 | if (ctype) | |
12746 | pop_nested_class (); | |
5566b478 MS |
12747 | |
12748 | --function_depth; | |
8d08fdba | 12749 | |
4d6abc1c | 12750 | /* Clean up. */ |
28cbf42c | 12751 | if (! nested) |
1f8f4a0b MM |
12752 | /* Let the error reporting routines know that we're outside a |
12753 | function. For a nested function, this value is used in | |
b03e38e1 | 12754 | cxx_pop_function_context and then reset via pop_function_context. */ |
1f8f4a0b | 12755 | current_function_decl = NULL_TREE; |
4d6abc1c | 12756 | |
3368cdd3 JJ |
12757 | defer_mark_used_calls = false; |
12758 | if (deferred_mark_used_calls) | |
12759 | { | |
12760 | unsigned int i; | |
12761 | tree decl; | |
12762 | ||
12763 | for (i = 0; VEC_iterate (tree, deferred_mark_used_calls, i, decl); i++) | |
12764 | mark_used (decl); | |
12765 | VEC_free (tree, gc, deferred_mark_used_calls); | |
12766 | } | |
12767 | ||
4d6abc1c | 12768 | return fndecl; |
8d08fdba MS |
12769 | } |
12770 | \f | |
12771 | /* Create the FUNCTION_DECL for a function definition. | |
8d08fdba MS |
12772 | DECLSPECS and DECLARATOR are the parts of the declaration; |
12773 | they describe the return type and the name of the function, | |
12774 | but twisted together in a fashion that parallels the syntax of C. | |
12775 | ||
12776 | This function creates a binding context for the function body | |
12777 | as well as setting up the FUNCTION_DECL in current_function_decl. | |
12778 | ||
12779 | Returns a FUNCTION_DECL on success. | |
12780 | ||
12781 | If the DECLARATOR is not suitable for a function (it defines a datum | |
12782 | instead), we return 0, which tells yyparse to report a parse error. | |
12783 | ||
12784 | May return void_type_node indicating that this method is actually | |
12785 | a friend. See grokfield for more details. | |
12786 | ||
12787 | Came here with a `.pushlevel' . | |
12788 | ||
12789 | DO NOT MAKE ANY CHANGES TO THIS CODE WITHOUT MAKING CORRESPONDING | |
12790 | CHANGES TO CODE IN `grokfield'. */ | |
e92cc029 | 12791 | |
8d08fdba | 12792 | tree |
02c5ff73 JM |
12793 | grokmethod (cp_decl_specifier_seq *declspecs, |
12794 | const cp_declarator *declarator, tree attrlist) | |
8d08fdba | 12795 | { |
c11b6f21 | 12796 | tree fndecl = grokdeclarator (declarator, declspecs, MEMFUNCDEF, 0, |
91d231cb | 12797 | &attrlist); |
8d08fdba | 12798 | |
a723baf1 MM |
12799 | if (fndecl == error_mark_node) |
12800 | return error_mark_node; | |
12801 | ||
12802 | if (fndecl == NULL || TREE_CODE (fndecl) != FUNCTION_DECL) | |
12803 | { | |
12804 | error ("invalid member function declaration"); | |
12805 | return error_mark_node; | |
12806 | } | |
8d08fdba | 12807 | |
195a5def IR |
12808 | if (attrlist) |
12809 | cplus_decl_attributes (&fndecl, attrlist, 0); | |
12810 | ||
8d08fdba | 12811 | /* Pass friends other than inline friend functions back. */ |
a1774733 | 12812 | if (fndecl == void_type_node) |
8d08fdba MS |
12813 | return fndecl; |
12814 | ||
8d08fdba MS |
12815 | if (DECL_IN_AGGR_P (fndecl)) |
12816 | { | |
58ec3cc5 | 12817 | if (DECL_CONTEXT (fndecl) |
6d69fe27 | 12818 | && TREE_CODE (DECL_CONTEXT (fndecl)) != NAMESPACE_DECL) |
2d01edd7 | 12819 | error ("%qD is already defined in class %qT", fndecl, |
58ec3cc5 | 12820 | DECL_CONTEXT (fndecl)); |
8ca4bf25 | 12821 | return error_mark_node; |
8d08fdba MS |
12822 | } |
12823 | ||
f3400fe2 JM |
12824 | check_template_shadow (fndecl); |
12825 | ||
79065db2 | 12826 | DECL_DECLARED_INLINE_P (fndecl) = 1; |
0494626a | 12827 | DECL_NO_INLINE_WARNING_P (fndecl) = 1; |
8d08fdba | 12828 | |
36a117a5 MM |
12829 | /* We process method specializations in finish_struct_1. */ |
12830 | if (processing_template_decl && !DECL_TEMPLATE_SPECIALIZATION (fndecl)) | |
4b0d3cbe MM |
12831 | { |
12832 | fndecl = push_template_decl (fndecl); | |
12833 | if (fndecl == error_mark_node) | |
12834 | return fndecl; | |
12835 | } | |
a0a33927 | 12836 | |
8d08fdba MS |
12837 | if (! DECL_FRIEND_P (fndecl)) |
12838 | { | |
8d08fdba MS |
12839 | if (TREE_CHAIN (fndecl)) |
12840 | { | |
12841 | fndecl = copy_node (fndecl); | |
12842 | TREE_CHAIN (fndecl) = NULL_TREE; | |
12843 | } | |
8d08fdba MS |
12844 | } |
12845 | ||
3600f678 | 12846 | cp_finish_decl (fndecl, NULL_TREE, false, NULL_TREE, 0); |
8d08fdba | 12847 | |
8d08fdba MS |
12848 | DECL_IN_AGGR_P (fndecl) = 1; |
12849 | return fndecl; | |
12850 | } | |
8d08fdba | 12851 | \f |
0154eaa8 MM |
12852 | |
12853 | /* VAR is a VAR_DECL. If its type is incomplete, remember VAR so that | |
12854 | we can lay it out later, when and if its type becomes complete. */ | |
8d08fdba MS |
12855 | |
12856 | void | |
11f6b451 | 12857 | maybe_register_incomplete_var (tree var) |
8d08fdba | 12858 | { |
50bc768d | 12859 | gcc_assert (TREE_CODE (var) == VAR_DECL); |
8d08fdba | 12860 | |
0154eaa8 | 12861 | /* Keep track of variables with incomplete types. */ |
caf93cb0 | 12862 | if (!processing_template_decl && TREE_TYPE (var) != error_mark_node |
0154eaa8 | 12863 | && DECL_EXTERNAL (var)) |
70adf8a9 | 12864 | { |
0154eaa8 | 12865 | tree inner_type = TREE_TYPE (var); |
caf93cb0 | 12866 | |
0154eaa8 MM |
12867 | while (TREE_CODE (inner_type) == ARRAY_TYPE) |
12868 | inner_type = TREE_TYPE (inner_type); | |
12869 | inner_type = TYPE_MAIN_VARIANT (inner_type); | |
caf93cb0 | 12870 | |
0154eaa8 MM |
12871 | if ((!COMPLETE_TYPE_P (inner_type) && CLASS_TYPE_P (inner_type)) |
12872 | /* RTTI TD entries are created while defining the type_info. */ | |
12873 | || (TYPE_LANG_SPECIFIC (inner_type) | |
12874 | && TYPE_BEING_DEFINED (inner_type))) | |
12875 | incomplete_vars = tree_cons (inner_type, var, incomplete_vars); | |
70adf8a9 | 12876 | } |
0154eaa8 | 12877 | } |
70adf8a9 | 12878 | |
0154eaa8 | 12879 | /* Called when a class type (given by TYPE) is defined. If there are |
39a13be5 | 12880 | any existing VAR_DECLs whose type has been completed by this |
0154eaa8 | 12881 | declaration, update them now. */ |
70adf8a9 | 12882 | |
0154eaa8 | 12883 | void |
11f6b451 | 12884 | complete_vars (tree type) |
0154eaa8 MM |
12885 | { |
12886 | tree *list = &incomplete_vars; | |
12887 | ||
50bc768d | 12888 | gcc_assert (CLASS_TYPE_P (type)); |
caf93cb0 | 12889 | while (*list) |
0154eaa8 MM |
12890 | { |
12891 | if (same_type_p (type, TREE_PURPOSE (*list))) | |
70adf8a9 | 12892 | { |
0154eaa8 | 12893 | tree var = TREE_VALUE (*list); |
67935995 | 12894 | tree type = TREE_TYPE (var); |
c740732f MM |
12895 | /* Complete the type of the variable. The VAR_DECL itself |
12896 | will be laid out in expand_expr. */ | |
67935995 MM |
12897 | complete_type (type); |
12898 | cp_apply_type_quals_to_decl (cp_type_quals (type), var); | |
0154eaa8 MM |
12899 | /* Remove this entry from the list. */ |
12900 | *list = TREE_CHAIN (*list); | |
f30432d7 MS |
12901 | } |
12902 | else | |
0154eaa8 | 12903 | list = &TREE_CHAIN (*list); |
f30432d7 | 12904 | } |
7fb213d8 GB |
12905 | |
12906 | /* Check for pending declarations which may have abstract type. */ | |
12907 | complete_type_check_abstract (type); | |
8d08fdba MS |
12908 | } |
12909 | ||
5c113154 MM |
12910 | /* If DECL is of a type which needs a cleanup, build and return an |
12911 | expression to perform that cleanup here. Return NULL_TREE if no | |
12912 | cleanup need be done. */ | |
e92cc029 | 12913 | |
86f45d2c | 12914 | tree |
11f6b451 | 12915 | cxx_maybe_build_cleanup (tree decl) |
8d08fdba | 12916 | { |
5c113154 MM |
12917 | tree type; |
12918 | tree attr; | |
12919 | tree cleanup; | |
12920 | ||
12921 | /* Assume no cleanup is required. */ | |
12922 | cleanup = NULL_TREE; | |
86f45d2c | 12923 | |
5c113154 MM |
12924 | if (error_operand_p (decl)) |
12925 | return cleanup; | |
12926 | ||
12927 | /* Handle "__attribute__((cleanup))". We run the cleanup function | |
12928 | before the destructor since the destructor is what actually | |
12929 | terminates the lifetime of the object. */ | |
12930 | attr = lookup_attribute ("cleanup", DECL_ATTRIBUTES (decl)); | |
12931 | if (attr) | |
12932 | { | |
12933 | tree id; | |
12934 | tree fn; | |
12935 | tree arg; | |
12936 | ||
12937 | /* Get the name specified by the user for the cleanup function. */ | |
12938 | id = TREE_VALUE (TREE_VALUE (attr)); | |
12939 | /* Look up the name to find the cleanup function to call. It is | |
12940 | important to use lookup_name here because that is what is | |
12941 | used in c-common.c:handle_cleanup_attribute when performing | |
12942 | initial checks on the attribute. Note that those checks | |
12943 | include ensuring that the function found is not an overloaded | |
12944 | function, or an object with an overloaded call operator, | |
39a13be5 | 12945 | etc.; we can rely on the fact that the function found is an |
5c113154 MM |
12946 | ordinary FUNCTION_DECL. */ |
12947 | fn = lookup_name (id); | |
12948 | arg = build_address (decl); | |
12949 | mark_used (decl); | |
450f4293 NF |
12950 | cleanup = cp_build_function_call_nary (fn, tf_warning_or_error, |
12951 | arg, NULL_TREE); | |
5c113154 MM |
12952 | } |
12953 | /* Handle ordinary C++ destructors. */ | |
12954 | type = TREE_TYPE (decl); | |
12955 | if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type)) | |
8d08fdba | 12956 | { |
80048418 | 12957 | int flags = LOOKUP_NORMAL|LOOKUP_DESTRUCTOR; |
5775a06a NS |
12958 | bool has_vbases = (TREE_CODE (type) == RECORD_TYPE |
12959 | && CLASSTYPE_VBASECLASSES (type)); | |
5c113154 MM |
12960 | tree addr; |
12961 | tree call; | |
8d08fdba | 12962 | |
8d08fdba | 12963 | if (TREE_CODE (type) == ARRAY_TYPE) |
5c113154 | 12964 | addr = decl; |
8d08fdba | 12965 | else |
5818c8e4 | 12966 | addr = build_address (decl); |
8d08fdba MS |
12967 | |
12968 | /* Optimize for space over speed here. */ | |
5775a06a | 12969 | if (!has_vbases || flag_expensive_optimizations) |
8d08fdba MS |
12970 | flags |= LOOKUP_NONVIRTUAL; |
12971 | ||
5c113154 | 12972 | call = build_delete (TREE_TYPE (addr), addr, |
86f45d2c | 12973 | sfk_complete_destructor, flags, 0); |
5c113154 | 12974 | if (cleanup) |
c2255bc4 | 12975 | cleanup = build_compound_expr (input_location, cleanup, call); |
5c113154 MM |
12976 | else |
12977 | cleanup = call; | |
8d08fdba | 12978 | } |
5c113154 MM |
12979 | |
12980 | return cleanup; | |
8d08fdba MS |
12981 | } |
12982 | \f | |
558475f0 | 12983 | /* When a stmt has been parsed, this function is called. */ |
8d08fdba MS |
12984 | |
12985 | void | |
11f6b451 | 12986 | finish_stmt (void) |
8d08fdba | 12987 | { |
8d08fdba MS |
12988 | } |
12989 | ||
7bead48f JM |
12990 | /* Return the FUNCTION_TYPE that corresponds to MEMFNTYPE, which can be a |
12991 | FUNCTION_DECL, METHOD_TYPE, FUNCTION_TYPE, pointer or reference to | |
12992 | METHOD_TYPE or FUNCTION_TYPE, or pointer to member function. */ | |
12993 | ||
12994 | tree | |
12995 | static_fn_type (tree memfntype) | |
12996 | { | |
12997 | tree fntype; | |
12998 | tree args; | |
7bead48f JM |
12999 | |
13000 | if (TYPE_PTRMEMFUNC_P (memfntype)) | |
13001 | memfntype = TYPE_PTRMEMFUNC_FN_TYPE (memfntype); | |
13002 | if (POINTER_TYPE_P (memfntype) | |
13003 | || TREE_CODE (memfntype) == FUNCTION_DECL) | |
13004 | memfntype = TREE_TYPE (memfntype); | |
13005 | if (TREE_CODE (memfntype) == FUNCTION_TYPE) | |
13006 | return memfntype; | |
13007 | gcc_assert (TREE_CODE (memfntype) == METHOD_TYPE); | |
13008 | args = TYPE_ARG_TYPES (memfntype); | |
13009 | fntype = build_function_type (TREE_TYPE (memfntype), TREE_CHAIN (args)); | |
2872152c | 13010 | fntype = apply_memfn_quals (fntype, type_memfn_quals (memfntype)); |
7bead48f JM |
13011 | fntype = (cp_build_type_attribute_variant |
13012 | (fntype, TYPE_ATTRIBUTES (memfntype))); | |
13013 | fntype = (build_exception_variant | |
13014 | (fntype, TYPE_RAISES_EXCEPTIONS (memfntype))); | |
13015 | return fntype; | |
13016 | } | |
13017 | ||
3afb32a4 MM |
13018 | /* DECL was originally constructed as a non-static member function, |
13019 | but turned out to be static. Update it accordingly. */ | |
700f8a87 | 13020 | |
8857f91e | 13021 | void |
11f6b451 | 13022 | revert_static_member_fn (tree decl) |
8d08fdba | 13023 | { |
7bead48f | 13024 | TREE_TYPE (decl) = static_fn_type (decl); |
8d08fdba | 13025 | |
7bead48f | 13026 | if (cp_type_quals (TREE_TYPE (decl)) != TYPE_UNQUALIFIED) |
c4f73174 | 13027 | error ("static member function %q#D declared with type qualifiers", decl); |
f30432d7 | 13028 | |
3afb32a4 MM |
13029 | if (DECL_ARGUMENTS (decl)) |
13030 | DECL_ARGUMENTS (decl) = TREE_CHAIN (DECL_ARGUMENTS (decl)); | |
13031 | DECL_STATIC_FUNCTION_P (decl) = 1; | |
8d08fdba | 13032 | } |
a4443a08 | 13033 | |
e2500fed GK |
13034 | /* Return which tree structure is used by T, or TS_CP_GENERIC if T is |
13035 | one of the language-independent trees. */ | |
4519c0a8 | 13036 | |
e2500fed | 13037 | enum cp_tree_node_structure_enum |
11f6b451 | 13038 | cp_tree_node_structure (union lang_tree_node * t) |
4519c0a8 | 13039 | { |
e2500fed | 13040 | switch (TREE_CODE (&t->generic)) |
4519c0a8 | 13041 | { |
a723baf1 | 13042 | case DEFAULT_ARG: return TS_CP_DEFAULT_ARG; |
e2500fed | 13043 | case IDENTIFIER_NODE: return TS_CP_IDENTIFIER; |
e2500fed GK |
13044 | case OVERLOAD: return TS_CP_OVERLOAD; |
13045 | case TEMPLATE_PARM_INDEX: return TS_CP_TPI; | |
13046 | case PTRMEM_CST: return TS_CP_PTRMEM; | |
0cbd7506 | 13047 | case BASELINK: return TS_CP_BASELINK; |
54e67af0 | 13048 | case STATIC_ASSERT: return TS_CP_STATIC_ASSERT; |
5d80a306 | 13049 | case ARGUMENT_PACK_SELECT: return TS_CP_ARGUMENT_PACK_SELECT; |
cb68ec50 | 13050 | case TRAIT_EXPR: return TS_CP_TRAIT_EXPR; |
d5f4eddd | 13051 | case LAMBDA_EXPR: return TS_CP_LAMBDA_EXPR; |
aa373032 | 13052 | case TEMPLATE_INFO: return TS_CP_TEMPLATE_INFO; |
e2500fed | 13053 | default: return TS_CP_GENERIC; |
4519c0a8 MM |
13054 | } |
13055 | } | |
5fd8e536 | 13056 | |
eaa7c03f JM |
13057 | /* Build the void_list_node (void_type_node having been created). */ |
13058 | tree | |
11f6b451 | 13059 | build_void_list_node (void) |
eaa7c03f JM |
13060 | { |
13061 | tree t = build_tree_list (NULL_TREE, void_type_node); | |
eaa7c03f JM |
13062 | return t; |
13063 | } | |
13064 | ||
6de9cd9a | 13065 | bool |
11f6b451 | 13066 | cp_missing_noreturn_ok_p (tree decl) |
d363e7bf AJ |
13067 | { |
13068 | /* A missing noreturn is ok for the `main' function. */ | |
92643fea | 13069 | return DECL_MAIN_P (decl); |
d363e7bf | 13070 | } |
e2500fed | 13071 | |
c18a5b6c MM |
13072 | /* Return the COMDAT group into which DECL should be placed. */ |
13073 | ||
fc26fae3 | 13074 | tree |
c18a5b6c MM |
13075 | cxx_comdat_group (tree decl) |
13076 | { | |
13077 | tree name; | |
13078 | ||
13079 | /* Virtual tables, construction virtual tables, and virtual table | |
13080 | tables all go in a single COMDAT group, named after the primary | |
13081 | virtual table. */ | |
13082 | if (TREE_CODE (decl) == VAR_DECL && DECL_VTABLE_OR_VTT_P (decl)) | |
13083 | name = DECL_ASSEMBLER_NAME (CLASSTYPE_VTABLES (DECL_CONTEXT (decl))); | |
13084 | /* For all other DECLs, the COMDAT group is the mangled name of the | |
13085 | declaration itself. */ | |
13086 | else | |
5591e5f9 JJ |
13087 | { |
13088 | while (DECL_THUNK_P (decl)) | |
13089 | { | |
13090 | /* If TARGET_USE_LOCAL_THUNK_ALIAS_P, use_thunk puts the thunk | |
13091 | into the same section as the target function. In that case | |
13092 | we must return target's name. */ | |
13093 | tree target = THUNK_TARGET (decl); | |
13094 | if (TARGET_USE_LOCAL_THUNK_ALIAS_P (target) | |
13095 | && DECL_SECTION_NAME (target) != NULL | |
13096 | && DECL_ONE_ONLY (target)) | |
13097 | decl = target; | |
13098 | else | |
13099 | break; | |
13100 | } | |
13101 | name = DECL_ASSEMBLER_NAME (decl); | |
13102 | } | |
c18a5b6c | 13103 | |
fc26fae3 | 13104 | return name; |
c18a5b6c MM |
13105 | } |
13106 | ||
e2500fed | 13107 | #include "gt-cp-decl.h" |