]>
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, |
b38a05d0 | 3 | 2001, 2002, 2003, 2004, 2005, 2006 Free Software Foundation, Inc. |
e5e809f4 | 4 | Contributed by Michael Tiemann (tiemann@cygnus.com) |
8d08fdba | 5 | |
1c313945 | 6 | This file is part of GCC. |
8d08fdba | 7 | |
1c313945 | 8 | GCC is free software; you can redistribute it and/or modify |
8d08fdba MS |
9 | it under the terms of the GNU General Public License as published by |
10 | the Free Software Foundation; either version 2, or (at your option) | |
11 | any later version. | |
12 | ||
1c313945 | 13 | GCC is distributed in the hope that it will be useful, |
8d08fdba MS |
14 | but WITHOUT ANY WARRANTY; without even the implied warranty of |
15 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
16 | GNU General Public License for more details. | |
17 | ||
18 | You should have received a copy of the GNU General Public License | |
1c313945 | 19 | along with GCC; see the file COPYING. If not, write to |
1788952f KC |
20 | the Free Software Foundation, 51 Franklin Street, Fifth Floor, |
21 | Boston, MA 02110-1301, USA. */ | |
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 MS |
35 | #include "tree.h" |
36 | #include "rtl.h" | |
3bdf5ad1 | 37 | #include "expr.h" |
8d08fdba MS |
38 | #include "flags.h" |
39 | #include "cp-tree.h" | |
25af8512 | 40 | #include "tree-inline.h" |
8d08fdba | 41 | #include "decl.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" |
26f943fd | 48 | #include "c-common.h" |
ecb0eece | 49 | #include "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" |
8d08fdba | 55 | |
62d1db17 | 56 | static tree grokparms (cp_parameter_declarator *, tree *); |
11f6b451 NN |
57 | static const char *redeclaration_error_message (tree, tree); |
58 | ||
11f6b451 | 59 | static int decl_jump_unsafe (tree); |
11f6b451 NN |
60 | static void require_complete_types_for_parms (tree); |
61 | static int ambi_op_p (enum tree_code); | |
62 | static int unary_op_p (enum tree_code); | |
11f6b451 | 63 | static void push_local_name (tree); |
7e99327d | 64 | static tree grok_reference_init (tree, tree, tree, tree *); |
caf93cb0 | 65 | static tree grokvardecl (tree, tree, const cp_decl_specifier_seq *, |
1ff3c076 | 66 | int, int, tree); |
11f6b451 | 67 | static void record_unknown_type (tree, const char *); |
c79efc4d | 68 | static tree builtin_function_1 (tree, tree); |
11f6b451 NN |
69 | static tree build_library_fn_1 (tree, enum tree_code, tree); |
70 | static int member_function_or_else (tree, tree, enum overload_flags); | |
71 | static void bad_specifiers (tree, const char *, int, int, int, int, | |
72 | int); | |
11f6b451 NN |
73 | static void check_for_uninitialized_const_var (tree); |
74 | static hashval_t typename_hash (const void *); | |
75 | static int typename_compare (const void *, const void *); | |
11f6b451 | 76 | static tree local_variable_p_walkfn (tree *, int *, void *); |
11f6b451 | 77 | static tree record_builtin_java_type (const char *, int); |
461c6fce | 78 | static const char *tag_name (enum tag_types); |
29ef83de | 79 | static tree lookup_and_check_tag (enum tag_types, tree, tag_scope, bool); |
11f6b451 | 80 | static int walk_namespaces_r (tree, walk_namespaces_fn, void *); |
11f6b451 NN |
81 | static void maybe_deduce_size_from_array_init (tree, tree); |
82 | static void layout_var_decl (tree); | |
83 | static void maybe_commonize_var (tree); | |
7e99327d | 84 | static tree check_initializer (tree, tree, int, tree *); |
11f6b451 NN |
85 | static void make_rtl_for_nonlocal_decl (tree, tree, const char *); |
86 | static void save_function_data (tree); | |
87 | static void check_function_type (tree, tree); | |
11f6b451 NN |
88 | static void finish_constructor_body (void); |
89 | static void begin_destructor_body (void); | |
90 | static void finish_destructor_body (void); | |
91 | static tree create_array_type_for_decl (tree, tree, tree); | |
92 | static tree get_atexit_node (void); | |
93 | static tree get_dso_handle_node (void); | |
94 | static tree start_cleanup_fn (void); | |
95 | static void end_cleanup_fn (void); | |
96 | static tree cp_make_fname_decl (tree, int); | |
97 | static void initialize_predefined_identifiers (void); | |
caf93cb0 | 98 | static tree check_special_function_return_type |
11f6b451 NN |
99 | (special_function_kind, tree, tree); |
100 | static tree push_cp_library_fn (enum tree_code, tree); | |
101 | static tree build_cp_library_fn (tree, enum tree_code, tree); | |
102 | static void store_parm_decls (tree); | |
8e3df2de MM |
103 | static void initialize_local_var (tree, tree); |
104 | static void expand_static_init (tree, tree); | |
105 | static tree next_initializable_field (tree); | |
8d08fdba | 106 | |
7f4edbcb | 107 | /* The following symbols are subsumed in the cp_global_trees array, and |
68642fb6 | 108 | listed here individually for documentation purposes. |
8d08fdba | 109 | |
7f4edbcb BS |
110 | C++ extensions |
111 | tree wchar_decl_node; | |
37c46b43 | 112 | |
7f4edbcb BS |
113 | tree vtable_entry_type; |
114 | tree delta_type_node; | |
7f4edbcb | 115 | tree __t_desc_type_node; |
8d08fdba | 116 | |
9e62871e | 117 | tree class_type_node; |
7f4edbcb | 118 | tree unknown_type_node; |
8d08fdba | 119 | |
7f4edbcb | 120 | Array type `vtable_entry_type[]' |
8d08fdba | 121 | |
7f4edbcb BS |
122 | tree vtbl_type_node; |
123 | tree vtbl_ptr_type_node; | |
8d08fdba | 124 | |
2854d3c6 | 125 | Namespaces, |
8d08fdba | 126 | |
7f4edbcb | 127 | tree std_node; |
2854d3c6 | 128 | tree abi_node; |
8d08fdba | 129 | |
7f4edbcb BS |
130 | A FUNCTION_DECL which can call `abort'. Not necessarily the |
131 | one that the user will declare, but sufficient to be called | |
132 | by routines that want to abort the program. | |
8d08fdba | 133 | |
7f4edbcb | 134 | tree abort_fndecl; |
8d08fdba | 135 | |
7f4edbcb | 136 | The FUNCTION_DECL for the default `::operator delete'. |
2986ae00 | 137 | |
7f4edbcb | 138 | tree global_delete_fndecl; |
8d08fdba | 139 | |
7f4edbcb | 140 | Used by RTTI |
669ec2b4 | 141 | tree type_info_type_node, tinfo_decl_id, tinfo_decl_type; |
3db45ab5 | 142 | tree tinfo_var_id; */ |
8d08fdba | 143 | |
7f4edbcb | 144 | tree cp_global_trees[CPTI_MAX]; |
8d08fdba | 145 | |
2c73f9f5 | 146 | /* Indicates that there is a type value in some namespace, although |
7f4edbcb | 147 | that is not necessarily in scope at the moment. */ |
2c73f9f5 | 148 | |
00e8de68 | 149 | tree global_type_node; |
2c73f9f5 | 150 | |
82a2669e | 151 | /* The node that holds the "name" of the global scope. */ |
00e8de68 | 152 | tree global_scope_name; |
82a2669e | 153 | |
8e4ce833 JJ |
154 | #define local_names cp_function_chain->x_local_names |
155 | ||
8d08fdba MS |
156 | /* A list of objects which have constructors or destructors |
157 | which reside in the global scope. The decl is stored in | |
158 | the TREE_VALUE slot and the initializer is stored | |
159 | in the TREE_PURPOSE slot. */ | |
160 | tree static_aggregates; | |
161 | ||
8d08fdba MS |
162 | /* -- end of C++ */ |
163 | ||
81b3411c | 164 | /* A node for the integer constants 2, and 3. */ |
d11ad92e | 165 | |
81b3411c | 166 | tree integer_two_node, integer_three_node; |
8d08fdba | 167 | |
1799e5d5 RH |
168 | /* Used only for jumps to as-yet undefined labels, since jumps to |
169 | defined labels can have their validity checked immediately. */ | |
170 | ||
171 | struct named_label_use_entry GTY(()) | |
172 | { | |
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 | ||
1799e5d5 | 194 | struct named_label_entry GTY(()) |
6625cdb5 | 195 | { |
1799e5d5 RH |
196 | /* The decl itself. */ |
197 | tree label_decl; | |
198 | ||
199 | /* The binding level to which the label is *currently* attached. | |
200 | This is initially set to the binding level in which the label | |
201 | is defined, but is modified as scopes are closed. */ | |
e2500fed | 202 | struct cp_binding_level *binding_level; |
3db45ab5 | 203 | /* The head of the names list that was current when the label was |
1799e5d5 RH |
204 | defined, or the inner scope popped. These are the decls that will |
205 | be skipped when jumping to the label. */ | |
6625cdb5 | 206 | tree names_in_scope; |
1799e5d5 RH |
207 | /* A tree list of all decls from all binding levels that would be |
208 | crossed by a backward branch to the label. */ | |
6625cdb5 | 209 | tree bad_decls; |
1799e5d5 RH |
210 | |
211 | /* A list of uses of the label, before the label is defined. */ | |
212 | struct named_label_use_entry *uses; | |
213 | ||
214 | /* The following bits are set after the label is defined, and are | |
215 | updated as scopes are popped. They indicate that a backward jump | |
ddd0b831 | 216 | to the label will illegally enter a scope of the given flavor. */ |
1799e5d5 RH |
217 | bool in_try_scope; |
218 | bool in_catch_scope; | |
219 | bool in_omp_scope; | |
6625cdb5 | 220 | }; |
8d08fdba | 221 | |
4519c0a8 | 222 | #define named_labels cp_function_chain->x_named_labels |
8d08fdba | 223 | \f |
b2244c65 MM |
224 | /* The number of function bodies which we are currently processing. |
225 | (Zero if we are at namespace scope, one inside the body of a | |
226 | function, two inside the body of a function in a local class, etc.) */ | |
227 | int function_depth; | |
e23bd218 IR |
228 | |
229 | /* States indicating how grokdeclarator() should handle declspecs marked | |
230 | with __attribute__((deprecated)). An object declared as | |
231 | __attribute__((deprecated)) suppresses warnings of uses of other | |
232 | deprecated items. */ | |
caf93cb0 | 233 | |
e23bd218 IR |
234 | enum deprecated_states { |
235 | DEPRECATED_NORMAL, | |
236 | DEPRECATED_SUPPRESS | |
237 | }; | |
238 | ||
239 | static enum deprecated_states deprecated_state = DEPRECATED_NORMAL; | |
240 | ||
8d08fdba | 241 | \f |
0154eaa8 MM |
242 | /* A TREE_LIST of VAR_DECLs. The TREE_PURPOSE is a RECORD_TYPE or |
243 | UNION_TYPE; the TREE_VALUE is a VAR_DECL with that type. At the | |
244 | time the VAR_DECL was declared, the type was incomplete. */ | |
245 | ||
e2500fed | 246 | static GTY(()) tree incomplete_vars; |
8d08fdba | 247 | \f |
74b846e0 MM |
248 | /* Returns the kind of template specialization we are currently |
249 | processing, given that it's declaration contained N_CLASS_SCOPES | |
250 | explicit scope qualifications. */ | |
251 | ||
252 | tmpl_spec_kind | |
11f6b451 | 253 | current_tmpl_spec_kind (int n_class_scopes) |
74b846e0 MM |
254 | { |
255 | int n_template_parm_scopes = 0; | |
256 | int seen_specialization_p = 0; | |
257 | int innermost_specialization_p = 0; | |
e2500fed | 258 | struct cp_binding_level *b; |
74b846e0 MM |
259 | |
260 | /* Scan through the template parameter scopes. */ | |
caf93cb0 EC |
261 | for (b = current_binding_level; |
262 | b->kind == sk_template_parms; | |
a7e8c268 | 263 | b = b->level_chain) |
74b846e0 MM |
264 | { |
265 | /* If we see a specialization scope inside a parameter scope, | |
266 | then something is wrong. That corresponds to a declaration | |
267 | like: | |
268 | ||
269 | template <class T> template <> ... | |
270 | ||
0e339752 | 271 | which is always invalid since [temp.expl.spec] forbids the |
74b846e0 MM |
272 | specialization of a class member template if the enclosing |
273 | class templates are not explicitly specialized as well. */ | |
a7e8c268 | 274 | if (b->explicit_spec_p) |
74b846e0 MM |
275 | { |
276 | if (n_template_parm_scopes == 0) | |
277 | innermost_specialization_p = 1; | |
278 | else | |
279 | seen_specialization_p = 1; | |
280 | } | |
281 | else if (seen_specialization_p == 1) | |
282 | return tsk_invalid_member_spec; | |
283 | ||
284 | ++n_template_parm_scopes; | |
285 | } | |
286 | ||
287 | /* Handle explicit instantiations. */ | |
288 | if (processing_explicit_instantiation) | |
289 | { | |
290 | if (n_template_parm_scopes != 0) | |
291 | /* We've seen a template parameter list during an explicit | |
292 | instantiation. For example: | |
293 | ||
294 | template <class T> template void f(int); | |
295 | ||
296 | This is erroneous. */ | |
297 | return tsk_invalid_expl_inst; | |
298 | else | |
299 | return tsk_expl_inst; | |
300 | } | |
301 | ||
302 | if (n_template_parm_scopes < n_class_scopes) | |
303 | /* We've not seen enough template headers to match all the | |
304 | specialized classes present. For example: | |
305 | ||
0cbd7506 | 306 | template <class T> void R<T>::S<T>::f(int); |
74b846e0 | 307 | |
0e339752 | 308 | This is invalid; there needs to be one set of template |
74b846e0 MM |
309 | parameters for each class. */ |
310 | return tsk_insufficient_parms; | |
311 | else if (n_template_parm_scopes == n_class_scopes) | |
312 | /* We're processing a non-template declaration (even though it may | |
313 | be a member of a template class.) For example: | |
314 | ||
0cbd7506 | 315 | template <class T> void S<T>::f(int); |
74b846e0 MM |
316 | |
317 | The `class T' maches the `S<T>', leaving no template headers | |
318 | corresponding to the `f'. */ | |
319 | return tsk_none; | |
320 | else if (n_template_parm_scopes > n_class_scopes + 1) | |
321 | /* We've got too many template headers. For example: | |
322 | ||
0cbd7506 | 323 | template <> template <class T> void f (T); |
74b846e0 MM |
324 | |
325 | There need to be more enclosing classes. */ | |
326 | return tsk_excessive_parms; | |
327 | else | |
328 | /* This must be a template. It's of the form: | |
329 | ||
0cbd7506 | 330 | template <class T> template <class U> void S<T>::f(U); |
74b846e0 MM |
331 | |
332 | This is a specialization if the innermost level was a | |
333 | specialization; otherwise it's just a definition of the | |
334 | template. */ | |
335 | return innermost_specialization_p ? tsk_expl_spec : tsk_template; | |
8d08fdba MS |
336 | } |
337 | ||
74b846e0 MM |
338 | /* Exit the current scope. */ |
339 | ||
340 | void | |
11f6b451 | 341 | finish_scope (void) |
74b846e0 MM |
342 | { |
343 | poplevel (0, 0, 0); | |
344 | } | |
345 | ||
acef433b MM |
346 | /* When a label goes out of scope, check to see if that label was used |
347 | in a valid manner, and issue any appropriate warnings or errors. */ | |
348 | ||
349 | static void | |
11f6b451 | 350 | pop_label (tree label, tree old_value) |
acef433b | 351 | { |
a7e8c268 | 352 | if (!processing_template_decl) |
acef433b | 353 | { |
88848bde MM |
354 | if (DECL_INITIAL (label) == NULL_TREE) |
355 | { | |
5b030314 NS |
356 | location_t location; |
357 | ||
dee15844 | 358 | error ("label %q+D used but not defined", label); |
93409b8c PB |
359 | #ifdef USE_MAPPED_LOCATION |
360 | location = input_location; /* FIXME want (input_filename, (line)0) */ | |
361 | #else | |
0cbd7506 | 362 | location.file = input_filename; |
5b030314 | 363 | location.line = 0; |
93409b8c | 364 | #endif |
88848bde | 365 | /* Avoid crashing later. */ |
5b030314 | 366 | define_label (location, DECL_NAME (label)); |
88848bde | 367 | } |
c616e51b MLI |
368 | else |
369 | warn_for_unused_label (label); | |
acef433b | 370 | } |
acef433b | 371 | |
6625cdb5 | 372 | SET_IDENTIFIER_LABEL_VALUE (DECL_NAME (label), old_value); |
acef433b MM |
373 | } |
374 | ||
0811ea8f | 375 | /* At the end of a function, all labels declared within the function |
68642fb6 | 376 | go out of scope. BLOCK is the top-level block for the |
acef433b MM |
377 | function. */ |
378 | ||
1799e5d5 RH |
379 | static int |
380 | pop_labels_1 (void **slot, void *data) | |
381 | { | |
382 | struct named_label_entry *ent = (struct named_label_entry *) *slot; | |
383 | tree block = (tree) data; | |
384 | ||
385 | pop_label (ent->label_decl, NULL_TREE); | |
386 | ||
387 | /* Put the labels into the "variables" of the top-level block, | |
388 | so debugger can see them. */ | |
389 | TREE_CHAIN (ent->label_decl) = BLOCK_VARS (block); | |
390 | BLOCK_VARS (block) = ent->label_decl; | |
391 | ||
392 | htab_clear_slot (named_labels, slot); | |
393 | ||
394 | return 1; | |
395 | } | |
396 | ||
acef433b | 397 | static void |
11f6b451 | 398 | pop_labels (tree block) |
acef433b | 399 | { |
1799e5d5 | 400 | if (named_labels) |
acef433b | 401 | { |
1799e5d5 RH |
402 | htab_traverse (named_labels, pop_labels_1, block); |
403 | named_labels = NULL; | |
acef433b | 404 | } |
1799e5d5 RH |
405 | } |
406 | ||
407 | /* At the end of a block with local labels, restore the outer definition. */ | |
acef433b | 408 | |
1799e5d5 RH |
409 | static void |
410 | pop_local_label (tree label, tree old_value) | |
411 | { | |
412 | struct named_label_entry dummy; | |
413 | void **slot; | |
414 | ||
415 | pop_label (label, old_value); | |
416 | ||
417 | dummy.label_decl = label; | |
418 | slot = htab_find_slot (named_labels, &dummy, NO_INSERT); | |
419 | htab_clear_slot (named_labels, slot); | |
acef433b MM |
420 | } |
421 | ||
80aa8340 ZL |
422 | /* The following two routines are used to interface to Objective-C++. |
423 | The binding level is purposely treated as an opaque type. */ | |
424 | ||
425 | void * | |
426 | objc_get_current_scope (void) | |
427 | { | |
428 | return current_binding_level; | |
429 | } | |
430 | ||
431 | /* The following routine is used by the NeXT-style SJLJ exceptions; | |
432 | variables get marked 'volatile' so as to not be clobbered by | |
f749f3c2 ZL |
433 | _setjmp()/_longjmp() calls. All variables in the current scope, |
434 | as well as parent scopes up to (but not including) ENCLOSING_BLK | |
435 | shall be thusly marked. */ | |
80aa8340 ZL |
436 | |
437 | void | |
438 | objc_mark_locals_volatile (void *enclosing_blk) | |
439 | { | |
440 | struct cp_binding_level *scope; | |
441 | ||
442 | for (scope = current_binding_level; | |
e58a9aa1 | 443 | scope && scope != enclosing_blk; |
80aa8340 ZL |
444 | scope = scope->level_chain) |
445 | { | |
446 | tree decl; | |
447 | ||
448 | for (decl = scope->names; decl; decl = TREE_CHAIN (decl)) | |
660845bf | 449 | objc_volatilize_decl (decl); |
e58a9aa1 ZL |
450 | |
451 | /* Do not climb up past the current function. */ | |
452 | if (scope->kind == sk_function_parms) | |
453 | break; | |
80aa8340 ZL |
454 | } |
455 | } | |
456 | ||
1799e5d5 RH |
457 | /* Update data for defined and undefined labels when leaving a scope. */ |
458 | ||
459 | static int | |
460 | poplevel_named_label_1 (void **slot, void *data) | |
461 | { | |
462 | struct named_label_entry *ent = (struct named_label_entry *) *slot; | |
463 | struct cp_binding_level *bl = (struct cp_binding_level *) data; | |
464 | struct cp_binding_level *obl = bl->level_chain; | |
465 | ||
466 | if (ent->binding_level == bl) | |
467 | { | |
468 | tree decl; | |
469 | ||
470 | for (decl = ent->names_in_scope; decl; decl = TREE_CHAIN (decl)) | |
471 | if (decl_jump_unsafe (decl)) | |
472 | ent->bad_decls = tree_cons (NULL, decl, ent->bad_decls); | |
473 | ||
474 | ent->binding_level = obl; | |
475 | ent->names_in_scope = obl->names; | |
476 | switch (bl->kind) | |
477 | { | |
478 | case sk_try: | |
479 | ent->in_try_scope = true; | |
480 | break; | |
481 | case sk_catch: | |
482 | ent->in_catch_scope = true; | |
483 | break; | |
484 | case sk_omp: | |
485 | ent->in_omp_scope = true; | |
486 | break; | |
487 | default: | |
488 | break; | |
489 | } | |
490 | } | |
491 | else if (ent->uses) | |
492 | { | |
493 | struct named_label_use_entry *use; | |
494 | ||
495 | for (use = ent->uses; use ; use = use->next) | |
496 | if (use->binding_level == bl) | |
497 | { | |
498 | use->binding_level = obl; | |
499 | use->names_in_scope = obl->names; | |
500 | if (bl->kind == sk_omp) | |
501 | use->in_omp_scope = true; | |
502 | } | |
503 | } | |
504 | ||
505 | return 1; | |
506 | } | |
507 | ||
8d08fdba MS |
508 | /* Exit a binding level. |
509 | Pop the level off, and restore the state of the identifier-decl mappings | |
510 | that were in effect when this level was entered. | |
511 | ||
512 | If KEEP == 1, this level had explicit declarations, so | |
513 | and create a "block" (a BLOCK node) for the level | |
514 | to record its declarations and subblocks for symbol table output. | |
515 | ||
8d08fdba MS |
516 | If FUNCTIONBODY is nonzero, this level is the body of a function, |
517 | so create a block as if KEEP were set and also clear out all | |
518 | label names. | |
519 | ||
520 | If REVERSE is nonzero, reverse the order of decls before putting | |
521 | them into the BLOCK. */ | |
522 | ||
523 | tree | |
11f6b451 | 524 | poplevel (int keep, int reverse, int functionbody) |
8d08fdba | 525 | { |
926ce8bd | 526 | tree link; |
8d08fdba MS |
527 | /* The chain of decls was accumulated in reverse order. |
528 | Put it into forward order, just for cleanliness. */ | |
529 | tree decls; | |
530 | int tmp = functionbody; | |
b35d4555 | 531 | int real_functionbody; |
b35d4555 | 532 | tree subblocks; |
325c3691 | 533 | tree block; |
8d08fdba | 534 | tree decl; |
f181d4ae | 535 | int leaving_for_scope; |
ac20c67a | 536 | scope_kind kind; |
f181d4ae | 537 | |
22ffcc6f | 538 | timevar_push (TV_NAME_LOOKUP); |
325c3691 RH |
539 | restart: |
540 | ||
541 | block = NULL_TREE; | |
b35d4555 | 542 | |
50bc768d | 543 | gcc_assert (current_binding_level->kind != sk_class); |
b74a0560 | 544 | |
ac20c67a | 545 | real_functionbody = (current_binding_level->kind == sk_cleanup |
b35d4555 | 546 | ? ((functionbody = 0), tmp) : functionbody); |
b35d4555 MM |
547 | subblocks = functionbody >= 0 ? current_binding_level->blocks : 0; |
548 | ||
50bc768d NS |
549 | gcc_assert (!VEC_length(cp_class_binding, |
550 | current_binding_level->class_shadowed)); | |
8d08fdba | 551 | |
536333d4 MM |
552 | /* We used to use KEEP == 2 to indicate that the new block should go |
553 | at the beginning of the list of blocks at this binding level, | |
554 | rather than the end. This hack is no longer used. */ | |
50bc768d | 555 | gcc_assert (keep == 0 || keep == 1); |
536333d4 | 556 | |
ac20c67a | 557 | if (current_binding_level->keep) |
8d08fdba MS |
558 | keep = 1; |
559 | ||
6625cdb5 JM |
560 | /* Any uses of undefined labels, and any defined labels, now operate |
561 | under constraints of next binding contour. */ | |
1799e5d5 RH |
562 | if (cfun && !functionbody && named_labels) |
563 | htab_traverse (named_labels, poplevel_named_label_1, | |
564 | current_binding_level); | |
6625cdb5 | 565 | |
8d08fdba MS |
566 | /* Get the decls in the order they were written. |
567 | Usually current_binding_level->names is in reverse order. | |
568 | But parameter decls were previously put in forward order. */ | |
569 | ||
570 | if (reverse) | |
571 | current_binding_level->names | |
572 | = decls = nreverse (current_binding_level->names); | |
573 | else | |
574 | decls = current_binding_level->names; | |
575 | ||
8d08fdba MS |
576 | /* If there were any declarations or structure tags in that level, |
577 | or if this level is a function body, | |
578 | create a BLOCK to record them for the life of this function. */ | |
8d08fdba | 579 | block = NULL_TREE; |
f444e36b | 580 | if (keep == 1 || functionbody) |
8d08fdba MS |
581 | block = make_node (BLOCK); |
582 | if (block != NULL_TREE) | |
583 | { | |
f444e36b MM |
584 | BLOCK_VARS (block) = decls; |
585 | BLOCK_SUBBLOCKS (block) = subblocks; | |
8d08fdba MS |
586 | } |
587 | ||
588 | /* In each subblock, record that this is its superior. */ | |
8d08fdba MS |
589 | if (keep >= 0) |
590 | for (link = subblocks; link; link = TREE_CHAIN (link)) | |
591 | BLOCK_SUPERCONTEXT (link) = block; | |
592 | ||
f181d4ae MM |
593 | /* We still support the old for-scope rules, whereby the variables |
594 | in a for-init statement were in scope after the for-statement | |
92bc1323 | 595 | ended. We only use the new rules if flag_new_for_scope is |
f181d4ae | 596 | nonzero. */ |
68642fb6 | 597 | leaving_for_scope |
a7e8c268 | 598 | = current_binding_level->kind == sk_for && flag_new_for_scope == 1; |
f181d4ae | 599 | |
caf93cb0 EC |
600 | /* Before we remove the declarations first check for unused variables. */ |
601 | if (warn_unused_variable | |
602 | && !processing_template_decl) | |
603 | for (decl = getdecls (); decl; decl = TREE_CHAIN (decl)) | |
604 | if (TREE_CODE (decl) == VAR_DECL | |
605 | && ! TREE_USED (decl) | |
606 | && ! DECL_IN_SYSTEM_HEADER (decl) | |
607 | && DECL_NAME (decl) && ! DECL_ARTIFICIAL (decl)) | |
b323323f | 608 | warning (OPT_Wunused_variable, "unused variable %q+D", decl); |
caf93cb0 | 609 | |
f181d4ae MM |
610 | /* Remove declarations for all the DECLs in this level. */ |
611 | for (link = decls; link; link = TREE_CHAIN (link)) | |
612 | { | |
c3783399 | 613 | if (leaving_for_scope && TREE_CODE (link) == VAR_DECL |
0cbd7506 | 614 | && DECL_NAME (link)) |
f181d4ae | 615 | { |
90ea9897 MM |
616 | tree name = DECL_NAME (link); |
617 | cxx_binding *ob; | |
f181d4ae MM |
618 | tree ns_binding; |
619 | ||
90ea9897 MM |
620 | ob = outer_binding (name, |
621 | IDENTIFIER_BINDING (name), | |
622 | /*class_p=*/true); | |
623 | if (!ob) | |
624 | ns_binding = IDENTIFIER_NAMESPACE_VALUE (name); | |
c7dda1e3 MM |
625 | else |
626 | ns_binding = NULL_TREE; | |
627 | ||
90ea9897 | 628 | if (ob && ob->scope == current_binding_level->level_chain) |
f181d4ae | 629 | /* We have something like: |
68642fb6 | 630 | |
0cbd7506 MS |
631 | int i; |
632 | for (int i; ;); | |
68642fb6 | 633 | |
f181d4ae MM |
634 | and we are leaving the `for' scope. There's no reason to |
635 | keep the binding of the inner `i' in this case. */ | |
90ea9897 MM |
636 | pop_binding (name, link); |
637 | else if ((ob && (TREE_CODE (ob->value) == TYPE_DECL)) | |
147135cc | 638 | || (ns_binding && TREE_CODE (ns_binding) == TYPE_DECL)) |
f181d4ae MM |
639 | /* Here, we have something like: |
640 | ||
641 | typedef int I; | |
642 | ||
643 | void f () { | |
644 | for (int I; ;); | |
645 | } | |
646 | ||
647 | We must pop the for-scope binding so we know what's a | |
648 | type and what isn't. */ | |
90ea9897 | 649 | pop_binding (name, link); |
e76a2646 | 650 | else |
e76a2646 | 651 | { |
f181d4ae MM |
652 | /* Mark this VAR_DECL as dead so that we can tell we left it |
653 | there only for backward compatibility. */ | |
654 | DECL_DEAD_FOR_LOCAL (link) = 1; | |
68642fb6 | 655 | |
517f3315 | 656 | /* Keep track of what should have happened when we |
f181d4ae | 657 | popped the binding. */ |
90ea9897 | 658 | if (ob && ob->value) |
820cc88f DB |
659 | { |
660 | SET_DECL_SHADOWED_FOR_VAR (link, ob->value); | |
661 | DECL_HAS_SHADOWED_FOR_VAR_P (link) = 1; | |
662 | } | |
f181d4ae MM |
663 | |
664 | /* Add it to the list of dead variables in the next | |
665 | outermost binding to that we can remove these when we | |
666 | leave that binding. */ | |
667 | current_binding_level->level_chain->dead_vars_from_for | |
668 | = tree_cons (NULL_TREE, link, | |
669 | current_binding_level->level_chain-> | |
670 | dead_vars_from_for); | |
671 | ||
af6fd53f | 672 | /* Although we don't pop the cxx_binding, we do clear |
147135cc | 673 | its SCOPE since the scope is going away now. */ |
caf93cb0 | 674 | IDENTIFIER_BINDING (name)->scope |
90ea9897 | 675 | = current_binding_level->level_chain; |
e76a2646 | 676 | } |
2ee887f2 | 677 | } |
68642fb6 | 678 | else |
8d6e462b | 679 | { |
8dc2b103 | 680 | tree name; |
c8094d83 | 681 | |
f181d4ae | 682 | /* Remove the binding. */ |
0034cf72 | 683 | decl = link; |
caf93cb0 | 684 | |
0034cf72 JM |
685 | if (TREE_CODE (decl) == TREE_LIST) |
686 | decl = TREE_VALUE (decl); | |
8dc2b103 | 687 | name = decl; |
c8094d83 | 688 | |
8dc2b103 NS |
689 | if (TREE_CODE (name) == OVERLOAD) |
690 | name = OVL_FUNCTION (name); | |
caf93cb0 | 691 | |
8dc2b103 NS |
692 | gcc_assert (DECL_P (name)); |
693 | pop_binding (DECL_NAME (name), decl); | |
8d08fdba | 694 | } |
f181d4ae | 695 | } |
8d08fdba | 696 | |
f181d4ae MM |
697 | /* Remove declarations for any `for' variables from inner scopes |
698 | that we kept around. */ | |
699 | for (link = current_binding_level->dead_vars_from_for; | |
700 | link; link = TREE_CHAIN (link)) | |
d8f8dca1 | 701 | pop_binding (DECL_NAME (TREE_VALUE (link)), TREE_VALUE (link)); |
2ee887f2 | 702 | |
f181d4ae MM |
703 | /* Restore the IDENTIFIER_TYPE_VALUEs. */ |
704 | for (link = current_binding_level->type_shadowed; | |
705 | link; link = TREE_CHAIN (link)) | |
706 | SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (link), TREE_VALUE (link)); | |
acef433b MM |
707 | |
708 | /* Restore the IDENTIFIER_LABEL_VALUEs for local labels. */ | |
709 | for (link = current_binding_level->shadowed_labels; | |
68642fb6 | 710 | link; |
acef433b | 711 | link = TREE_CHAIN (link)) |
1799e5d5 | 712 | pop_local_label (TREE_VALUE (link), TREE_PURPOSE (link)); |
acef433b | 713 | |
f181d4ae MM |
714 | /* There may be OVERLOADs (wrapped in TREE_LISTs) on the BLOCK_VARs |
715 | list if a `using' declaration put them there. The debugging | |
3b426391 | 716 | back ends won't understand OVERLOAD, so we remove them here. |
f181d4ae MM |
717 | Because the BLOCK_VARS are (temporarily) shared with |
718 | CURRENT_BINDING_LEVEL->NAMES we must do this fixup after we have | |
719 | popped all the bindings. */ | |
720 | if (block) | |
721 | { | |
722 | tree* d; | |
8d6e462b | 723 | |
a06d48ef JM |
724 | for (d = &BLOCK_VARS (block); *d; ) |
725 | { | |
726 | if (TREE_CODE (*d) == TREE_LIST) | |
727 | *d = TREE_CHAIN (*d); | |
728 | else | |
729 | d = &TREE_CHAIN (*d); | |
730 | } | |
8d6e462b | 731 | } |
8d08fdba MS |
732 | |
733 | /* If the level being exited is the top level of a function, | |
734 | check over all the labels. */ | |
8d08fdba MS |
735 | if (functionbody) |
736 | { | |
acef433b MM |
737 | /* Since this is the top level block of a function, the vars are |
738 | the function's parameters. Don't leave them in the BLOCK | |
739 | because they are found in the FUNCTION_DECL instead. */ | |
8d08fdba | 740 | BLOCK_VARS (block) = 0; |
acef433b | 741 | pop_labels (block); |
8d08fdba MS |
742 | } |
743 | ||
ac20c67a | 744 | kind = current_binding_level->kind; |
325c3691 RH |
745 | if (kind == sk_cleanup) |
746 | { | |
747 | tree stmt; | |
748 | ||
749 | /* If this is a temporary binding created for a cleanup, then we'll | |
750 | have pushed a statement list level. Pop that, create a new | |
751 | BIND_EXPR for the block, and insert it into the stream. */ | |
752 | stmt = pop_stmt_list (current_binding_level->statement_list); | |
753 | stmt = c_build_bind_expr (block, stmt); | |
754 | add_stmt (stmt); | |
755 | } | |
8d08fdba | 756 | |
1a6daf15 | 757 | leave_scope (); |
8d08fdba | 758 | if (functionbody) |
72c4a4ca GK |
759 | { |
760 | /* The current function is being defined, so its DECL_INITIAL | |
761 | should be error_mark_node. */ | |
762 | gcc_assert (DECL_INITIAL (current_function_decl) == error_mark_node); | |
763 | DECL_INITIAL (current_function_decl) = block; | |
764 | } | |
8d08fdba | 765 | else if (block) |
f444e36b MM |
766 | current_binding_level->blocks |
767 | = chainon (current_binding_level->blocks, block); | |
768 | ||
8d08fdba MS |
769 | /* If we did not make a block for the level just exited, |
770 | any blocks made for inner levels | |
771 | (since they cannot be recorded as subblocks in that level) | |
772 | must be carried forward so they will later become subblocks | |
773 | of something else. */ | |
774 | else if (subblocks) | |
536333d4 MM |
775 | current_binding_level->blocks |
776 | = chainon (current_binding_level->blocks, subblocks); | |
8d08fdba | 777 | |
d9b2d9da MM |
778 | /* Each and every BLOCK node created here in `poplevel' is important |
779 | (e.g. for proper debugging information) so if we created one | |
780 | earlier, mark it as "used". */ | |
781 | if (block) | |
782 | TREE_USED (block) = 1; | |
783 | ||
325c3691 | 784 | /* All temporary bindings created for cleanups are popped silently. */ |
ac20c67a | 785 | if (kind == sk_cleanup) |
325c3691 | 786 | goto restart; |
8d08fdba | 787 | |
22ffcc6f | 788 | POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, block); |
8d08fdba MS |
789 | } |
790 | ||
8d08fdba MS |
791 | /* Insert BLOCK at the end of the list of subblocks of the |
792 | current binding level. This is used when a BIND_EXPR is expanded, | |
793 | to handle the BLOCK node inside the BIND_EXPR. */ | |
794 | ||
795 | void | |
11f6b451 | 796 | insert_block (tree block) |
8d08fdba MS |
797 | { |
798 | TREE_USED (block) = 1; | |
799 | current_binding_level->blocks | |
800 | = chainon (current_binding_level->blocks, block); | |
801 | } | |
802 | ||
0aafb128 MM |
803 | /* Walk all the namespaces contained NAMESPACE, including NAMESPACE |
804 | itself, calling F for each. The DATA is passed to F as well. */ | |
805 | ||
00e8de68 GDR |
806 | static int |
807 | walk_namespaces_r (tree namespace, walk_namespaces_fn f, void* data) | |
808 | { | |
809 | int result = 0; | |
caf93cb0 | 810 | tree current = NAMESPACE_LEVEL (namespace)->namespaces; |
8d08fdba | 811 | |
00e8de68 | 812 | result |= (*f) (namespace, data); |
8d08fdba | 813 | |
00e8de68 GDR |
814 | for (; current; current = TREE_CHAIN (current)) |
815 | result |= walk_namespaces_r (current, f, data); | |
fc0e7bf5 | 816 | |
00e8de68 | 817 | return result; |
5566b478 MS |
818 | } |
819 | ||
00e8de68 GDR |
820 | /* Walk all the namespaces, calling F for each. The DATA is passed to |
821 | F as well. */ | |
822 | ||
823 | int | |
824 | walk_namespaces (walk_namespaces_fn f, void* data) | |
5566b478 | 825 | { |
00e8de68 | 826 | return walk_namespaces_r (global_namespace, f, data); |
8d08fdba MS |
827 | } |
828 | ||
00e8de68 GDR |
829 | /* Call wrapup_globals_declarations for the globals in NAMESPACE. If |
830 | DATA is non-NULL, this is the last time we will call | |
831 | wrapup_global_declarations for this NAMESPACE. */ | |
39c01e4c | 832 | |
00e8de68 GDR |
833 | int |
834 | wrapup_globals_for_namespace (tree namespace, void* data) | |
39c01e4c | 835 | { |
00e8de68 | 836 | struct cp_binding_level *level = NAMESPACE_LEVEL (namespace); |
9857866d KH |
837 | VEC(tree,gc) *statics = level->static_decls; |
838 | tree *vec = VEC_address (tree, statics); | |
839 | int len = VEC_length (tree, statics); | |
00e8de68 | 840 | int last_time = (data != 0); |
68642fb6 | 841 | |
00e8de68 | 842 | if (last_time) |
39c01e4c | 843 | { |
00e8de68 | 844 | check_global_declarations (vec, len); |
db5f8b93 | 845 | emit_debug_global_declarations (vec, len); |
00e8de68 | 846 | return 0; |
39c01e4c MM |
847 | } |
848 | ||
00e8de68 GDR |
849 | /* Write out any globals that need to be output. */ |
850 | return wrapup_global_declarations (vec, len); | |
39c01e4c MM |
851 | } |
852 | ||
00e8de68 | 853 | \f |
9188c363 MM |
854 | /* In C++, you don't have to write `struct S' to refer to `S'; you |
855 | can just use `S'. We accomplish this by creating a TYPE_DECL as | |
856 | if the user had written `typedef struct S S'. Create and return | |
857 | the TYPE_DECL for TYPE. */ | |
858 | ||
859 | tree | |
11f6b451 | 860 | create_implicit_typedef (tree name, tree type) |
9188c363 MM |
861 | { |
862 | tree decl; | |
863 | ||
864 | decl = build_decl (TYPE_DECL, name, type); | |
c727aa5e | 865 | DECL_ARTIFICIAL (decl) = 1; |
9188c363 MM |
866 | /* There are other implicit type declarations, like the one *within* |
867 | a class that allows you to write `S::S'. We must distinguish | |
868 | amongst these. */ | |
869 | SET_DECL_IMPLICIT_TYPEDEF_P (decl); | |
870 | TYPE_NAME (type) = decl; | |
871 | ||
872 | return decl; | |
873 | } | |
874 | ||
8e4ce833 JJ |
875 | /* Remember a local name for name-mangling purposes. */ |
876 | ||
877 | static void | |
11f6b451 | 878 | push_local_name (tree decl) |
8e4ce833 JJ |
879 | { |
880 | size_t i, nelts; | |
881 | tree t, name; | |
882 | ||
22ffcc6f | 883 | timevar_push (TV_NAME_LOOKUP); |
8e4ce833 JJ |
884 | |
885 | name = DECL_NAME (decl); | |
886 | ||
9acaf84a | 887 | nelts = VEC_length (tree, local_names); |
8e4ce833 JJ |
888 | for (i = 0; i < nelts; i++) |
889 | { | |
9acaf84a | 890 | t = VEC_index (tree, local_names, i); |
8e4ce833 JJ |
891 | if (DECL_NAME (t) == name) |
892 | { | |
893 | if (!DECL_LANG_SPECIFIC (decl)) | |
894 | retrofit_lang_decl (decl); | |
e2500fed | 895 | DECL_LANG_SPECIFIC (decl)->decl_flags.u2sel = 1; |
8e4ce833 JJ |
896 | if (DECL_LANG_SPECIFIC (t)) |
897 | DECL_DISCRIMINATOR (decl) = DECL_DISCRIMINATOR (t) + 1; | |
898 | else | |
899 | DECL_DISCRIMINATOR (decl) = 1; | |
900 | ||
9acaf84a | 901 | VEC_replace (tree, local_names, i, decl); |
de94b46c KG |
902 | timevar_pop (TV_NAME_LOOKUP); |
903 | return; | |
8e4ce833 JJ |
904 | } |
905 | } | |
906 | ||
9acaf84a | 907 | VEC_safe_push (tree, gc, local_names, decl); |
22ffcc6f | 908 | timevar_pop (TV_NAME_LOOKUP); |
8e4ce833 | 909 | } |
8d08fdba MS |
910 | \f |
911 | /* Subroutine of duplicate_decls: return truthvalue of whether | |
912 | or not types of these decls match. | |
913 | ||
914 | For C++, we must compare the parameter list so that `int' can match | |
915 | `int&' in a parameter position, but `int&' is not confused with | |
916 | `const int&'. */ | |
e92cc029 | 917 | |
6060a796 | 918 | int |
11f6b451 | 919 | decls_match (tree newdecl, tree olddecl) |
8d08fdba MS |
920 | { |
921 | int types_match; | |
922 | ||
347d73d7 ML |
923 | if (newdecl == olddecl) |
924 | return 1; | |
925 | ||
6b4b3deb MM |
926 | if (TREE_CODE (newdecl) != TREE_CODE (olddecl)) |
927 | /* If the two DECLs are not even the same kind of thing, we're not | |
928 | interested in their types. */ | |
929 | return 0; | |
930 | ||
931 | if (TREE_CODE (newdecl) == FUNCTION_DECL) | |
8d08fdba MS |
932 | { |
933 | tree f1 = TREE_TYPE (newdecl); | |
934 | tree f2 = TREE_TYPE (olddecl); | |
935 | tree p1 = TYPE_ARG_TYPES (f1); | |
936 | tree p2 = TYPE_ARG_TYPES (f2); | |
937 | ||
4f1c5b7d | 938 | if (CP_DECL_CONTEXT (newdecl) != CP_DECL_CONTEXT (olddecl) |
eb68cb58 MM |
939 | && ! (DECL_EXTERN_C_P (newdecl) |
940 | && DECL_EXTERN_C_P (olddecl))) | |
c5a6fc45 JM |
941 | return 0; |
942 | ||
8d08fdba | 943 | if (TREE_CODE (f1) != TREE_CODE (f2)) |
0cbd7506 | 944 | return 0; |
8d08fdba | 945 | |
3bfdc719 | 946 | if (same_type_p (TREE_TYPE (f1), TREE_TYPE (f2))) |
8926095f | 947 | { |
8b27e9ef NS |
948 | if (p2 == NULL_TREE && DECL_EXTERN_C_P (olddecl) |
949 | && (DECL_BUILT_IN (olddecl) | |
950 | #ifndef NO_IMPLICIT_EXTERN_C | |
0cbd7506 MS |
951 | || (DECL_IN_SYSTEM_HEADER (newdecl) && !DECL_CLASS_SCOPE_P (newdecl)) |
952 | || (DECL_IN_SYSTEM_HEADER (olddecl) && !DECL_CLASS_SCOPE_P (olddecl)) | |
8b27e9ef NS |
953 | #endif |
954 | )) | |
a28e3c7f MS |
955 | { |
956 | types_match = self_promoting_args_p (p1); | |
957 | if (p1 == void_list_node) | |
958 | TREE_TYPE (newdecl) = TREE_TYPE (olddecl); | |
959 | } | |
8b27e9ef NS |
960 | #ifndef NO_IMPLICIT_EXTERN_C |
961 | else if (p1 == NULL_TREE | |
962 | && (DECL_EXTERN_C_P (olddecl) | |
0cbd7506 MS |
963 | && DECL_IN_SYSTEM_HEADER (olddecl) |
964 | && !DECL_CLASS_SCOPE_P (olddecl)) | |
8b27e9ef | 965 | && (DECL_EXTERN_C_P (newdecl) |
0cbd7506 MS |
966 | && DECL_IN_SYSTEM_HEADER (newdecl) |
967 | && !DECL_CLASS_SCOPE_P (newdecl))) | |
a28e3c7f MS |
968 | { |
969 | types_match = self_promoting_args_p (p2); | |
970 | TREE_TYPE (newdecl) = TREE_TYPE (olddecl); | |
971 | } | |
8b27e9ef | 972 | #endif |
8926095f | 973 | else |
91063b51 | 974 | types_match = compparms (p1, p2); |
8926095f | 975 | } |
8d08fdba MS |
976 | else |
977 | types_match = 0; | |
978 | } | |
6b4b3deb | 979 | else if (TREE_CODE (newdecl) == TEMPLATE_DECL) |
51c184be | 980 | { |
2bb5d995 JM |
981 | if (TREE_CODE (DECL_TEMPLATE_RESULT (newdecl)) |
982 | != TREE_CODE (DECL_TEMPLATE_RESULT (olddecl))) | |
983 | return 0; | |
984 | ||
ee935db4 MM |
985 | if (!comp_template_parms (DECL_TEMPLATE_PARMS (newdecl), |
986 | DECL_TEMPLATE_PARMS (olddecl))) | |
987 | return 0; | |
988 | ||
f84b4be9 | 989 | if (TREE_CODE (DECL_TEMPLATE_RESULT (newdecl)) == TYPE_DECL) |
ee935db4 MM |
990 | types_match = same_type_p (TREE_TYPE (DECL_TEMPLATE_RESULT (olddecl)), |
991 | TREE_TYPE (DECL_TEMPLATE_RESULT (newdecl))); | |
f84b4be9 JM |
992 | else |
993 | types_match = decls_match (DECL_TEMPLATE_RESULT (olddecl), | |
994 | DECL_TEMPLATE_RESULT (newdecl)); | |
51c184be | 995 | } |
8d08fdba MS |
996 | else |
997 | { | |
91a5bc9f KL |
998 | /* Need to check scope for variable declaration (VAR_DECL). |
999 | For typedef (TYPE_DECL), scope is ignored. */ | |
1000 | if (TREE_CODE (newdecl) == VAR_DECL | |
ace4831d MM |
1001 | && CP_DECL_CONTEXT (newdecl) != CP_DECL_CONTEXT (olddecl) |
1002 | /* [dcl.link] | |
1003 | Two declarations for an object with C language linkage | |
1004 | with the same name (ignoring the namespace that qualify | |
1005 | it) that appear in different namespace scopes refer to | |
1006 | the same object. */ | |
1007 | && !(DECL_EXTERN_C_P (olddecl) && DECL_EXTERN_C_P (newdecl))) | |
91a5bc9f KL |
1008 | return 0; |
1009 | ||
8d08fdba MS |
1010 | if (TREE_TYPE (newdecl) == error_mark_node) |
1011 | types_match = TREE_TYPE (olddecl) == error_mark_node; | |
1012 | else if (TREE_TYPE (olddecl) == NULL_TREE) | |
1013 | types_match = TREE_TYPE (newdecl) == NULL_TREE; | |
a0a33927 MS |
1014 | else if (TREE_TYPE (newdecl) == NULL_TREE) |
1015 | types_match = 0; | |
8d08fdba | 1016 | else |
01240200 | 1017 | types_match = comptypes (TREE_TYPE (newdecl), |
3bfdc719 MM |
1018 | TREE_TYPE (olddecl), |
1019 | COMPARE_REDECLARATION); | |
8d08fdba MS |
1020 | } |
1021 | ||
1022 | return types_match; | |
1023 | } | |
1024 | ||
1025 | /* If NEWDECL is `static' and an `extern' was seen previously, | |
24f30ed4 | 1026 | warn about it. OLDDECL is the previous declaration. |
8d08fdba MS |
1027 | |
1028 | Note that this does not apply to the C++ case of declaring | |
1029 | a variable `extern const' and then later `const'. | |
1030 | ||
8d08fdba MS |
1031 | Don't complain about built-in functions, since they are beyond |
1032 | the user's control. */ | |
1033 | ||
a5e6b29b | 1034 | void |
11f6b451 | 1035 | warn_extern_redeclared_static (tree newdecl, tree olddecl) |
8d08fdba | 1036 | { |
24f30ed4 MM |
1037 | tree name; |
1038 | ||
68642fb6 | 1039 | if (TREE_CODE (newdecl) == TYPE_DECL |
655dc6ee | 1040 | || TREE_CODE (newdecl) == TEMPLATE_DECL |
a2a9e21c GDR |
1041 | || TREE_CODE (newdecl) == CONST_DECL |
1042 | || TREE_CODE (newdecl) == NAMESPACE_DECL) | |
8d08fdba | 1043 | return; |
68642fb6 | 1044 | |
963d5758 MM |
1045 | /* Don't get confused by static member functions; that's a different |
1046 | use of `static'. */ | |
1047 | if (TREE_CODE (newdecl) == FUNCTION_DECL | |
1048 | && DECL_STATIC_FUNCTION_P (newdecl)) | |
1049 | return; | |
8d08fdba | 1050 | |
24f30ed4 MM |
1051 | /* If the old declaration was `static', or the new one isn't, then |
1052 | then everything is OK. */ | |
1053 | if (DECL_THIS_STATIC (olddecl) || !DECL_THIS_STATIC (newdecl)) | |
1054 | return; | |
1055 | ||
1056 | /* It's OK to declare a builtin function as `static'. */ | |
1057 | if (TREE_CODE (olddecl) == FUNCTION_DECL | |
1058 | && DECL_ARTIFICIAL (olddecl)) | |
1059 | return; | |
1060 | ||
8d08fdba | 1061 | name = DECL_ASSEMBLER_NAME (newdecl); |
2d01edd7 | 1062 | pedwarn ("%qD was declared %<extern%> and later %<static%>", newdecl); |
dee15844 | 1063 | pedwarn ("previous declaration of %q+D", olddecl); |
8d08fdba MS |
1064 | } |
1065 | ||
e1f0e7a6 MM |
1066 | /* NEW_DECL is a redeclaration of OLD_DECL; both are functions or |
1067 | function templates. If their exception specifications do not | |
1068 | match, issue an a diagnostic. */ | |
1069 | ||
1070 | static void | |
1071 | check_redeclaration_exception_specification (tree new_decl, | |
1072 | tree old_decl) | |
1073 | { | |
1074 | tree new_type; | |
1075 | tree old_type; | |
1076 | tree new_exceptions; | |
1077 | tree old_exceptions; | |
1078 | ||
1079 | new_type = TREE_TYPE (new_decl); | |
1080 | new_exceptions = TYPE_RAISES_EXCEPTIONS (new_type); | |
1081 | old_type = TREE_TYPE (old_decl); | |
1082 | old_exceptions = TYPE_RAISES_EXCEPTIONS (old_type); | |
1083 | ||
1084 | /* [except.spec] | |
1085 | ||
1086 | If any declaration of a function has an exception-specification, | |
1087 | all declarations, including the definition and an explicit | |
1088 | specialization, of that function shall have an | |
1089 | exception-specification with the same set of type-ids. */ | |
1090 | if ((pedantic || ! DECL_IN_SYSTEM_HEADER (old_decl)) | |
1091 | && ! DECL_IS_BUILTIN (old_decl) | |
1092 | && flag_exceptions | |
3db45ab5 | 1093 | && !comp_except_specs (new_exceptions, old_exceptions, |
e1f0e7a6 MM |
1094 | /*exact=*/true)) |
1095 | { | |
1096 | error ("declaration of %qF throws different exceptions", new_decl); | |
1097 | error ("from previous declaration %q+F", old_decl); | |
1098 | } | |
1099 | } | |
1100 | ||
b1a19c7c MM |
1101 | /* If NEWDECL is a redeclaration of OLDDECL, merge the declarations. |
1102 | If the redeclaration is invalid, a diagnostic is issued, and the | |
1103 | error_mark_node is returned. Otherwise, OLDDECL is returned. | |
8d08fdba | 1104 | |
b1a19c7c | 1105 | If NEWDECL is not a redeclaration of OLDDECL, NULL_TREE is |
d63d5d0c ILT |
1106 | returned. |
1107 | ||
1108 | NEWDECL_IS_FRIEND is true if NEWDECL was declared as a friend. */ | |
8d08fdba | 1109 | |
b1a19c7c | 1110 | tree |
d63d5d0c | 1111 | duplicate_decls (tree newdecl, tree olddecl, bool newdecl_is_friend) |
8d08fdba | 1112 | { |
8d08fdba | 1113 | unsigned olddecl_uid = DECL_UID (olddecl); |
d63d5d0c | 1114 | int olddecl_friend = 0, types_match = 0, hidden_friend = 0; |
0b60dfe3 | 1115 | int new_defines_function = 0; |
50b56799 | 1116 | tree new_template; |
5566b478 MS |
1117 | |
1118 | if (newdecl == olddecl) | |
b1a19c7c | 1119 | return olddecl; |
8d08fdba | 1120 | |
8926095f | 1121 | types_match = decls_match (newdecl, olddecl); |
8d08fdba | 1122 | |
8d08fdba MS |
1123 | /* If either the type of the new decl or the type of the old decl is an |
1124 | error_mark_node, then that implies that we have already issued an | |
1125 | error (earlier) for some bogus type specification, and in that case, | |
1126 | it is rather pointless to harass the user with yet more error message | |
0b60dfe3 | 1127 | about the same declaration, so just pretend the types match here. */ |
bd6dd845 MS |
1128 | if (TREE_TYPE (newdecl) == error_mark_node |
1129 | || TREE_TYPE (olddecl) == error_mark_node) | |
dc5395cc | 1130 | return error_mark_node; |
68642fb6 | 1131 | |
97055d5c AO |
1132 | if (DECL_P (olddecl) |
1133 | && TREE_CODE (newdecl) == FUNCTION_DECL | |
1134 | && TREE_CODE (olddecl) == FUNCTION_DECL | |
1135 | && (DECL_UNINLINABLE (newdecl) || DECL_UNINLINABLE (olddecl))) | |
1136 | { | |
1137 | if (DECL_DECLARED_INLINE_P (newdecl) | |
1138 | && DECL_UNINLINABLE (newdecl) | |
1139 | && lookup_attribute ("noinline", DECL_ATTRIBUTES (newdecl))) | |
1140 | /* Already warned elsewhere. */; | |
1141 | else if (DECL_DECLARED_INLINE_P (olddecl) | |
1142 | && DECL_UNINLINABLE (olddecl) | |
1143 | && lookup_attribute ("noinline", DECL_ATTRIBUTES (olddecl))) | |
1144 | /* Already warned. */; | |
1145 | else if (DECL_DECLARED_INLINE_P (newdecl) | |
1146 | && DECL_UNINLINABLE (olddecl) | |
1147 | && lookup_attribute ("noinline", DECL_ATTRIBUTES (olddecl))) | |
1148 | { | |
dee15844 JM |
1149 | warning (OPT_Wattributes, "function %q+D redeclared as inline", |
1150 | newdecl); | |
1151 | warning (OPT_Wattributes, "previous declaration of %q+D " | |
1152 | "with attribute noinline", olddecl); | |
97055d5c AO |
1153 | } |
1154 | else if (DECL_DECLARED_INLINE_P (olddecl) | |
1155 | && DECL_UNINLINABLE (newdecl) | |
1156 | && lookup_attribute ("noinline", DECL_ATTRIBUTES (newdecl))) | |
1157 | { | |
dee15844 JM |
1158 | warning (OPT_Wattributes, "function %q+D redeclared with " |
1159 | "attribute noinline", newdecl); | |
1160 | warning (OPT_Wattributes, "previous declaration of %q+D was inline", | |
1161 | olddecl); | |
97055d5c AO |
1162 | } |
1163 | } | |
1164 | ||
a1c65f9f | 1165 | /* Check for redeclaration and other discrepancies. */ |
d22c8596 | 1166 | if (TREE_CODE (olddecl) == FUNCTION_DECL |
9f33663b JM |
1167 | && DECL_ARTIFICIAL (olddecl)) |
1168 | { | |
d63d5d0c | 1169 | gcc_assert (!DECL_HIDDEN_FRIEND_P (olddecl)); |
9f33663b JM |
1170 | if (TREE_CODE (newdecl) != FUNCTION_DECL) |
1171 | { | |
d63d5d0c ILT |
1172 | /* Avoid warnings redeclaring built-ins which have not been |
1173 | explicitly declared. */ | |
0cbd7506 MS |
1174 | if (DECL_ANTICIPATED (olddecl)) |
1175 | return NULL_TREE; | |
d52e4867 | 1176 | |
9f33663b JM |
1177 | /* If you declare a built-in or predefined function name as static, |
1178 | the old definition is overridden, but optionally warn this was a | |
1179 | bad choice of name. */ | |
1180 | if (! TREE_PUBLIC (newdecl)) | |
1181 | { | |
b323323f LM |
1182 | warning (OPT_Wshadow, "shadowing %s function %q#D", |
1183 | DECL_BUILT_IN (olddecl) ? "built-in" : "library", | |
1184 | olddecl); | |
9f33663b | 1185 | /* Discard the old built-in function. */ |
b1a19c7c | 1186 | return NULL_TREE; |
9f33663b JM |
1187 | } |
1188 | /* If the built-in is not ansi, then programs can override | |
1189 | it even globally without an error. */ | |
1190 | else if (! DECL_BUILT_IN (olddecl)) | |
d4ee4d25 | 1191 | warning (0, "library function %q#D redeclared as non-function %q#D", |
0cbd7506 | 1192 | olddecl, newdecl); |
9f33663b JM |
1193 | else |
1194 | { | |
2d01edd7 GDR |
1195 | error ("declaration of %q#D", newdecl); |
1196 | error ("conflicts with built-in declaration %q#D", | |
0cbd7506 | 1197 | olddecl); |
9f33663b | 1198 | } |
b1a19c7c | 1199 | return NULL_TREE; |
a4443a08 | 1200 | } |
9f33663b | 1201 | else if (!types_match) |
8d08fdba | 1202 | { |
d63d5d0c ILT |
1203 | /* Avoid warnings redeclaring built-ins which have not been |
1204 | explicitly declared. */ | |
0cbd7506 | 1205 | if (DECL_ANTICIPATED (olddecl)) |
498c0f27 JJ |
1206 | { |
1207 | /* Deal with fileptr_type_node. FILE type is not known | |
1208 | at the time we create the builtins. */ | |
1209 | tree t1, t2; | |
1210 | ||
1211 | for (t1 = TYPE_ARG_TYPES (TREE_TYPE (newdecl)), | |
1212 | t2 = TYPE_ARG_TYPES (TREE_TYPE (olddecl)); | |
1213 | t1 || t2; | |
1214 | t1 = TREE_CHAIN (t1), t2 = TREE_CHAIN (t2)) | |
1215 | if (!t1 || !t2) | |
1216 | break; | |
1217 | else if (TREE_VALUE (t2) == fileptr_type_node) | |
1218 | { | |
1219 | tree t = TREE_VALUE (t1); | |
1220 | ||
1221 | if (TREE_CODE (t) == POINTER_TYPE | |
1222 | && TYPE_NAME (TREE_TYPE (t)) | |
1223 | && DECL_NAME (TYPE_NAME (TREE_TYPE (t))) | |
1224 | == get_identifier ("FILE") | |
1225 | && compparms (TREE_CHAIN (t1), TREE_CHAIN (t2))) | |
1226 | { | |
1227 | tree oldargs = TYPE_ARG_TYPES (TREE_TYPE (olddecl)); | |
1228 | ||
1229 | TYPE_ARG_TYPES (TREE_TYPE (olddecl)) | |
1230 | = TYPE_ARG_TYPES (TREE_TYPE (newdecl)); | |
1231 | types_match = decls_match (newdecl, olddecl); | |
1232 | if (types_match) | |
d63d5d0c ILT |
1233 | return duplicate_decls (newdecl, olddecl, |
1234 | newdecl_is_friend); | |
498c0f27 JJ |
1235 | TYPE_ARG_TYPES (TREE_TYPE (olddecl)) = oldargs; |
1236 | } | |
1237 | } | |
1238 | else if (! same_type_p (TREE_VALUE (t1), TREE_VALUE (t2))) | |
1239 | break; | |
1240 | } | |
d52e4867 | 1241 | else if ((DECL_EXTERN_C_P (newdecl) |
7e99327d MM |
1242 | && DECL_EXTERN_C_P (olddecl)) |
1243 | || compparms (TYPE_ARG_TYPES (TREE_TYPE (newdecl)), | |
1244 | TYPE_ARG_TYPES (TREE_TYPE (olddecl)))) | |
a4443a08 | 1245 | { |
9f33663b JM |
1246 | /* A near match; override the builtin. */ |
1247 | ||
1248 | if (TREE_PUBLIC (newdecl)) | |
a4443a08 | 1249 | { |
d4ee4d25 DD |
1250 | warning (0, "new declaration %q#D", newdecl); |
1251 | warning (0, "ambiguates built-in declaration %q#D", | |
0cbd7506 | 1252 | olddecl); |
a4443a08 | 1253 | } |
b323323f LM |
1254 | else |
1255 | warning (OPT_Wshadow, "shadowing %s function %q#D", | |
0cbd7506 MS |
1256 | DECL_BUILT_IN (olddecl) ? "built-in" : "library", |
1257 | olddecl); | |
a4443a08 | 1258 | } |
9f33663b JM |
1259 | else |
1260 | /* Discard the old built-in function. */ | |
b1a19c7c | 1261 | return NULL_TREE; |
04a9d080 RS |
1262 | |
1263 | /* Replace the old RTL to avoid problems with inlining. */ | |
84b8b0e0 | 1264 | COPY_DECL_RTL (newdecl, olddecl); |
8d08fdba | 1265 | } |
d63d5d0c ILT |
1266 | /* Even if the types match, prefer the new declarations type for |
1267 | built-ins which have not been explicitly declared, for | |
1268 | exception lists, etc... */ | |
10326855 | 1269 | else if (DECL_ANTICIPATED (olddecl)) |
7072018e | 1270 | { |
74869a85 NS |
1271 | tree type = TREE_TYPE (newdecl); |
1272 | tree attribs = (*targetm.merge_type_attributes) | |
1273 | (TREE_TYPE (olddecl), type); | |
1274 | ||
e9525111 | 1275 | type = cp_build_type_attribute_variant (type, attribs); |
74869a85 | 1276 | TREE_TYPE (newdecl) = TREE_TYPE (olddecl) = type; |
7072018e | 1277 | } |
68642fb6 | 1278 | |
7e99327d MM |
1279 | /* Whether or not the builtin can throw exceptions has no |
1280 | bearing on this declarator. */ | |
1281 | TREE_NOTHROW (olddecl) = 0; | |
1282 | ||
24f30ed4 MM |
1283 | if (DECL_THIS_STATIC (newdecl) && !DECL_THIS_STATIC (olddecl)) |
1284 | { | |
1285 | /* If a builtin function is redeclared as `static', merge | |
1286 | the declarations, but make the original one static. */ | |
1287 | DECL_THIS_STATIC (olddecl) = 1; | |
1288 | TREE_PUBLIC (olddecl) = 0; | |
9bfadf57 | 1289 | |
421844e7 MM |
1290 | /* Make the old declaration consistent with the new one so |
1291 | that all remnants of the builtin-ness of this function | |
1292 | will be banished. */ | |
5d2ed28c | 1293 | SET_DECL_LANGUAGE (olddecl, DECL_LANGUAGE (newdecl)); |
84b8b0e0 | 1294 | COPY_DECL_RTL (newdecl, olddecl); |
24f30ed4 | 1295 | } |
39211cd5 MS |
1296 | } |
1297 | else if (TREE_CODE (olddecl) != TREE_CODE (newdecl)) | |
1298 | { | |
9ed182dc JM |
1299 | if ((TREE_CODE (olddecl) == TYPE_DECL && DECL_ARTIFICIAL (olddecl) |
1300 | && TREE_CODE (newdecl) != TYPE_DECL | |
1301 | && ! (TREE_CODE (newdecl) == TEMPLATE_DECL | |
1302 | && TREE_CODE (DECL_TEMPLATE_RESULT (newdecl)) == TYPE_DECL)) | |
1303 | || (TREE_CODE (newdecl) == TYPE_DECL && DECL_ARTIFICIAL (newdecl) | |
1304 | && TREE_CODE (olddecl) != TYPE_DECL | |
1305 | && ! (TREE_CODE (olddecl) == TEMPLATE_DECL | |
1306 | && (TREE_CODE (DECL_TEMPLATE_RESULT (olddecl)) | |
1307 | == TYPE_DECL)))) | |
1308 | { | |
1309 | /* We do nothing special here, because C++ does such nasty | |
1310 | things with TYPE_DECLs. Instead, just let the TYPE_DECL | |
1311 | get shadowed, and know that if we need to find a TYPE_DECL | |
1312 | for a given name, we can look in the IDENTIFIER_TYPE_VALUE | |
1313 | slot of the identifier. */ | |
b1a19c7c | 1314 | return NULL_TREE; |
9ed182dc JM |
1315 | } |
1316 | ||
39211cd5 | 1317 | if ((TREE_CODE (newdecl) == FUNCTION_DECL |
5566b478 | 1318 | && DECL_FUNCTION_TEMPLATE_P (olddecl)) |
39211cd5 | 1319 | || (TREE_CODE (olddecl) == FUNCTION_DECL |
5566b478 | 1320 | && DECL_FUNCTION_TEMPLATE_P (newdecl))) |
b1a19c7c | 1321 | return NULL_TREE; |
9ed182dc | 1322 | |
2d01edd7 | 1323 | error ("%q#D redeclared as different kind of symbol", newdecl); |
39211cd5 MS |
1324 | if (TREE_CODE (olddecl) == TREE_LIST) |
1325 | olddecl = TREE_VALUE (olddecl); | |
dee15844 | 1326 | error ("previous declaration of %q+#D", olddecl); |
39211cd5 | 1327 | |
c0694c4b | 1328 | return error_mark_node; |
8d08fdba | 1329 | } |
8d08fdba MS |
1330 | else if (!types_match) |
1331 | { | |
4f1c5b7d | 1332 | if (CP_DECL_CONTEXT (newdecl) != CP_DECL_CONTEXT (olddecl)) |
7bdbfa05 MM |
1333 | /* These are certainly not duplicate declarations; they're |
1334 | from different scopes. */ | |
b1a19c7c | 1335 | return NULL_TREE; |
7bdbfa05 | 1336 | |
8926095f | 1337 | if (TREE_CODE (newdecl) == TEMPLATE_DECL) |
f0e01782 MS |
1338 | { |
1339 | /* The name of a class template may not be declared to refer to | |
1340 | any other template, class, function, object, namespace, value, | |
e92cc029 | 1341 | or type in the same scope. */ |
5566b478 MS |
1342 | if (TREE_CODE (DECL_TEMPLATE_RESULT (olddecl)) == TYPE_DECL |
1343 | || TREE_CODE (DECL_TEMPLATE_RESULT (newdecl)) == TYPE_DECL) | |
f0e01782 | 1344 | { |
2d01edd7 | 1345 | error ("declaration of template %q#D", newdecl); |
dee15844 | 1346 | error ("conflicts with previous declaration %q+#D", olddecl); |
f0e01782 | 1347 | } |
ec255269 MS |
1348 | else if (TREE_CODE (DECL_TEMPLATE_RESULT (olddecl)) == FUNCTION_DECL |
1349 | && TREE_CODE (DECL_TEMPLATE_RESULT (newdecl)) == FUNCTION_DECL | |
1350 | && compparms (TYPE_ARG_TYPES (TREE_TYPE (DECL_TEMPLATE_RESULT (olddecl))), | |
91063b51 | 1351 | TYPE_ARG_TYPES (TREE_TYPE (DECL_TEMPLATE_RESULT (newdecl)))) |
75650646 | 1352 | && comp_template_parms (DECL_TEMPLATE_PARMS (newdecl), |
b9201622 NS |
1353 | DECL_TEMPLATE_PARMS (olddecl)) |
1354 | /* Template functions can be disambiguated by | |
1355 | return type. */ | |
1356 | && same_type_p (TREE_TYPE (TREE_TYPE (newdecl)), | |
1357 | TREE_TYPE (TREE_TYPE (olddecl)))) | |
ec255269 | 1358 | { |
2d01edd7 | 1359 | error ("new declaration %q#D", newdecl); |
dee15844 | 1360 | error ("ambiguates old declaration %q+#D", olddecl); |
ec255269 | 1361 | } |
b1a19c7c | 1362 | return NULL_TREE; |
f0e01782 | 1363 | } |
8926095f MS |
1364 | if (TREE_CODE (newdecl) == FUNCTION_DECL) |
1365 | { | |
eb68cb58 | 1366 | if (DECL_EXTERN_C_P (newdecl) && DECL_EXTERN_C_P (olddecl)) |
8926095f | 1367 | { |
2d01edd7 | 1368 | error ("declaration of C function %q#D conflicts with", |
0cbd7506 | 1369 | newdecl); |
dee15844 | 1370 | error ("previous declaration %q+#D here", olddecl); |
8926095f | 1371 | } |
00595019 | 1372 | else if (compparms (TYPE_ARG_TYPES (TREE_TYPE (newdecl)), |
91063b51 | 1373 | TYPE_ARG_TYPES (TREE_TYPE (olddecl)))) |
700f8a87 | 1374 | { |
2d01edd7 | 1375 | error ("new declaration %q#D", newdecl); |
dee15844 | 1376 | error ("ambiguates old declaration %q+#D", olddecl); |
492b73bd | 1377 | return error_mark_node; |
700f8a87 MS |
1378 | } |
1379 | else | |
b1a19c7c | 1380 | return NULL_TREE; |
8926095f | 1381 | } |
58ec3cc5 | 1382 | else |
8d08fdba | 1383 | { |
2d01edd7 | 1384 | error ("conflicting declaration %q#D", newdecl); |
dee15844 | 1385 | error ("%q+D has a previous declaration as %q#D", olddecl, olddecl); |
0cbd7506 | 1386 | return error_mark_node; |
8d08fdba MS |
1387 | } |
1388 | } | |
68642fb6 | 1389 | else if (TREE_CODE (newdecl) == FUNCTION_DECL |
75650646 MM |
1390 | && ((DECL_TEMPLATE_SPECIALIZATION (olddecl) |
1391 | && (!DECL_TEMPLATE_INFO (newdecl) | |
68642fb6 | 1392 | || (DECL_TI_TEMPLATE (newdecl) |
75650646 MM |
1393 | != DECL_TI_TEMPLATE (olddecl)))) |
1394 | || (DECL_TEMPLATE_SPECIALIZATION (newdecl) | |
1395 | && (!DECL_TEMPLATE_INFO (olddecl) | |
68642fb6 | 1396 | || (DECL_TI_TEMPLATE (olddecl) |
75650646 | 1397 | != DECL_TI_TEMPLATE (newdecl)))))) |
386b8a85 JM |
1398 | /* It's OK to have a template specialization and a non-template |
1399 | with the same type, or to have specializations of two | |
75650646 MM |
1400 | different templates with the same type. Note that if one is a |
1401 | specialization, and the other is an instantiation of the same | |
1402 | template, that we do not exit at this point. That situation | |
1403 | can occur if we instantiate a template class, and then | |
0e339752 | 1404 | specialize one of its methods. This situation is valid, but |
75650646 | 1405 | the declarations must be merged in the usual way. */ |
b1a19c7c | 1406 | return NULL_TREE; |
68642fb6 UD |
1407 | else if (TREE_CODE (newdecl) == FUNCTION_DECL |
1408 | && ((DECL_TEMPLATE_INSTANTIATION (olddecl) | |
75650646 MM |
1409 | && !DECL_USE_TEMPLATE (newdecl)) |
1410 | || (DECL_TEMPLATE_INSTANTIATION (newdecl) | |
1411 | && !DECL_USE_TEMPLATE (olddecl)))) | |
1412 | /* One of the declarations is a template instantiation, and the | |
1413 | other is not a template at all. That's OK. */ | |
b1a19c7c | 1414 | return NULL_TREE; |
c30b4add MM |
1415 | else if (TREE_CODE (newdecl) == NAMESPACE_DECL) |
1416 | { | |
1417 | /* In [namespace.alias] we have: | |
c8094d83 | 1418 | |
0cbd7506 | 1419 | In a declarative region, a namespace-alias-definition can be |
c30b4add MM |
1420 | used to redefine a namespace-alias declared in that declarative |
1421 | region to refer only to the namespace to which it already | |
1422 | refers. | |
c8094d83 | 1423 | |
c30b4add MM |
1424 | Therefore, if we encounter a second alias directive for the same |
1425 | alias, we can just ignore the second directive. */ | |
1426 | if (DECL_NAMESPACE_ALIAS (newdecl) | |
c8094d83 | 1427 | && (DECL_NAMESPACE_ALIAS (newdecl) |
c30b4add MM |
1428 | == DECL_NAMESPACE_ALIAS (olddecl))) |
1429 | return olddecl; | |
1430 | /* [namespace.alias] | |
1431 | ||
0cbd7506 | 1432 | A namespace-name or namespace-alias shall not be declared as |
c30b4add MM |
1433 | the name of any other entity in the same declarative region. |
1434 | A namespace-name defined at global scope shall not be | |
77880ae4 | 1435 | declared as the name of any other entity in any global scope |
c30b4add | 1436 | of the program. */ |
2d01edd7 | 1437 | error ("declaration of namespace %qD conflicts with", newdecl); |
dee15844 | 1438 | error ("previous declaration of namespace %q+D here", olddecl); |
c30b4add MM |
1439 | return error_mark_node; |
1440 | } | |
8d08fdba MS |
1441 | else |
1442 | { | |
d8e178a0 | 1443 | const char *errmsg = redeclaration_error_message (newdecl, olddecl); |
8251199e | 1444 | if (errmsg) |
8d08fdba | 1445 | { |
33bd39a2 | 1446 | error (errmsg, newdecl); |
8d08fdba | 1447 | if (DECL_NAME (olddecl) != NULL_TREE) |
dee15844 JM |
1448 | error ((DECL_INITIAL (olddecl) && namespace_bindings_p ()) |
1449 | ? "%q+#D previously defined here" | |
1450 | : "%q+#D previously declared here", olddecl); | |
b1a19c7c | 1451 | return error_mark_node; |
8d08fdba MS |
1452 | } |
1453 | else if (TREE_CODE (olddecl) == FUNCTION_DECL | |
1454 | && DECL_INITIAL (olddecl) != NULL_TREE | |
1455 | && TYPE_ARG_TYPES (TREE_TYPE (olddecl)) == NULL_TREE | |
1456 | && TYPE_ARG_TYPES (TREE_TYPE (newdecl)) != NULL_TREE) | |
1457 | { | |
1458 | /* Prototype decl follows defn w/o prototype. */ | |
dee15844 | 1459 | warning (0, "prototype for %q+#D", newdecl); |
d4ee4d25 | 1460 | warning (0, "%Jfollows non-prototype definition here", olddecl); |
8d08fdba | 1461 | } |
ace4831d MM |
1462 | else if ((TREE_CODE (olddecl) == FUNCTION_DECL |
1463 | || TREE_CODE (olddecl) == VAR_DECL) | |
8d08fdba | 1464 | && DECL_LANGUAGE (newdecl) != DECL_LANGUAGE (olddecl)) |
8926095f | 1465 | { |
ace4831d MM |
1466 | /* [dcl.link] |
1467 | If two declarations of the same function or object | |
1468 | specify different linkage-specifications ..., the program | |
1469 | is ill-formed.... Except for functions with C++ linkage, | |
1470 | a function declaration without a linkage specification | |
1471 | shall not precede the first linkage specification for | |
1472 | that function. A function can be declared without a | |
1473 | linkage specification after an explicit linkage | |
1474 | specification has been seen; the linkage explicitly | |
1475 | specified in the earlier declaration is not affected by | |
1476 | such a function declaration. | |
1477 | ||
1478 | DR 563 raises the question why the restrictions on | |
1479 | functions should not also apply to objects. Older | |
1480 | versions of G++ silently ignore the linkage-specification | |
1481 | for this example: | |
1482 | ||
1483 | namespace N { | |
1484 | extern int i; | |
1485 | extern "C" int i; | |
1486 | } | |
1487 | ||
1488 | which is clearly wrong. Therefore, we now treat objects | |
1489 | like functions. */ | |
46ccf50a | 1490 | if (current_lang_depth () == 0) |
ace4831d MM |
1491 | { |
1492 | /* There is no explicit linkage-specification, so we use | |
1493 | the linkage from the previous declaration. */ | |
1494 | if (!DECL_LANG_SPECIFIC (newdecl)) | |
1495 | retrofit_lang_decl (newdecl); | |
1496 | SET_DECL_LANGUAGE (newdecl, DECL_LANGUAGE (olddecl)); | |
1497 | } | |
8926095f MS |
1498 | else |
1499 | { | |
dee15844 JM |
1500 | error ("previous declaration of %q+#D with %qL linkage", |
1501 | olddecl, DECL_LANGUAGE (olddecl)); | |
2d01edd7 | 1502 | error ("conflicts with new declaration with %qL linkage", |
0cbd7506 | 1503 | DECL_LANGUAGE (newdecl)); |
8926095f MS |
1504 | } |
1505 | } | |
e1cd6e56 | 1506 | |
a6f02587 | 1507 | if (DECL_LANG_SPECIFIC (olddecl) && DECL_USE_TEMPLATE (olddecl)) |
c32381b1 JM |
1508 | ; |
1509 | else if (TREE_CODE (olddecl) == FUNCTION_DECL) | |
e1cd6e56 MS |
1510 | { |
1511 | tree t1 = TYPE_ARG_TYPES (TREE_TYPE (olddecl)); | |
1512 | tree t2 = TYPE_ARG_TYPES (TREE_TYPE (newdecl)); | |
1513 | int i = 1; | |
1514 | ||
1515 | if (TREE_CODE (TREE_TYPE (newdecl)) == METHOD_TYPE) | |
1516 | t1 = TREE_CHAIN (t1), t2 = TREE_CHAIN (t2); | |
68642fb6 | 1517 | |
e1cd6e56 MS |
1518 | for (; t1 && t1 != void_list_node; |
1519 | t1 = TREE_CHAIN (t1), t2 = TREE_CHAIN (t2), i++) | |
1520 | if (TREE_PURPOSE (t1) && TREE_PURPOSE (t2)) | |
1521 | { | |
2507f3b5 RK |
1522 | if (1 == simple_cst_equal (TREE_PURPOSE (t1), |
1523 | TREE_PURPOSE (t2))) | |
e1cd6e56 | 1524 | { |
2d01edd7 | 1525 | pedwarn ("default argument given for parameter %d of %q#D", |
624a5800 | 1526 | i, newdecl); |
dee15844 | 1527 | pedwarn ("after previous specification in %q+#D", olddecl); |
e1cd6e56 MS |
1528 | } |
1529 | else | |
1530 | { | |
2d01edd7 | 1531 | error ("default argument given for parameter %d of %q#D", |
0cbd7506 | 1532 | i, newdecl); |
dee15844 | 1533 | error ("after previous specification in %q+#D", |
e1cd6e56 MS |
1534 | olddecl); |
1535 | } | |
1536 | } | |
a5894242 | 1537 | |
caf93cb0 | 1538 | if (DECL_DECLARED_INLINE_P (newdecl) |
79065db2 | 1539 | && ! DECL_DECLARED_INLINE_P (olddecl) |
7fcdf4c2 | 1540 | && TREE_ADDRESSABLE (olddecl) && warn_inline) |
dff6b454 | 1541 | { |
d4ee4d25 DD |
1542 | warning (0, "%q#D was used before it was declared inline", newdecl); |
1543 | warning (0, "%Jprevious non-inline declaration here", olddecl); | |
dff6b454 | 1544 | } |
e1cd6e56 | 1545 | } |
8d08fdba MS |
1546 | } |
1547 | ||
4782bd5b RS |
1548 | /* Do not merge an implicit typedef with an explicit one. In: |
1549 | ||
1550 | class A; | |
1551 | ... | |
1552 | typedef class A A __attribute__ ((foo)); | |
1553 | ||
1554 | the attribute should apply only to the typedef. */ | |
1555 | if (TREE_CODE (olddecl) == TYPE_DECL | |
1556 | && (DECL_IMPLICIT_TYPEDEF_P (olddecl) | |
1557 | || DECL_IMPLICIT_TYPEDEF_P (newdecl))) | |
b1a19c7c | 1558 | return NULL_TREE; |
4782bd5b | 1559 | |
8d08fdba MS |
1560 | /* If new decl is `static' and an `extern' was seen previously, |
1561 | warn about it. */ | |
1562 | warn_extern_redeclared_static (newdecl, olddecl); | |
1563 | ||
e92cc029 | 1564 | /* We have committed to returning 1 at this point. */ |
8d08fdba MS |
1565 | if (TREE_CODE (newdecl) == FUNCTION_DECL) |
1566 | { | |
1567 | /* Now that functions must hold information normally held | |
1568 | by field decls, there is extra work to do so that | |
1569 | declaration information does not get destroyed during | |
1570 | definition. */ | |
1571 | if (DECL_VINDEX (olddecl)) | |
1572 | DECL_VINDEX (newdecl) = DECL_VINDEX (olddecl); | |
1573 | if (DECL_CONTEXT (olddecl)) | |
1574 | DECL_CONTEXT (newdecl) = DECL_CONTEXT (olddecl); | |
e1cd6e56 MS |
1575 | DECL_STATIC_CONSTRUCTOR (newdecl) |= DECL_STATIC_CONSTRUCTOR (olddecl); |
1576 | DECL_STATIC_DESTRUCTOR (newdecl) |= DECL_STATIC_DESTRUCTOR (olddecl); | |
fee7654e | 1577 | DECL_PURE_VIRTUAL_P (newdecl) |= DECL_PURE_VIRTUAL_P (olddecl); |
864b83b9 | 1578 | DECL_VIRTUAL_P (newdecl) |= DECL_VIRTUAL_P (olddecl); |
815951d8 | 1579 | DECL_INVALID_OVERRIDER_P (newdecl) |= DECL_INVALID_OVERRIDER_P (olddecl); |
963d5758 | 1580 | DECL_THIS_STATIC (newdecl) |= DECL_THIS_STATIC (olddecl); |
e0fff4b3 JM |
1581 | if (DECL_OVERLOADED_OPERATOR_P (olddecl) != ERROR_MARK) |
1582 | SET_OVERLOADED_OPERATOR_CODE | |
1583 | (newdecl, DECL_OVERLOADED_OPERATOR_P (olddecl)); | |
0b60dfe3 | 1584 | new_defines_function = DECL_INITIAL (newdecl) != NULL_TREE; |
68642fb6 | 1585 | |
0b60dfe3 | 1586 | /* Optionally warn about more than one declaration for the same |
0cbd7506 MS |
1587 | name, but don't warn about a function declaration followed by a |
1588 | definition. */ | |
0b60dfe3 BK |
1589 | if (warn_redundant_decls && ! DECL_ARTIFICIAL (olddecl) |
1590 | && !(new_defines_function && DECL_INITIAL (olddecl) == NULL_TREE) | |
a1c65f9f | 1591 | /* Don't warn about extern decl followed by definition. */ |
0b60dfe3 | 1592 | && !(DECL_EXTERNAL (olddecl) && ! DECL_EXTERNAL (newdecl)) |
a1c65f9f | 1593 | /* Don't warn about friends, let add_friend take care of it. */ |
d63d5d0c | 1594 | && ! (newdecl_is_friend || DECL_FRIEND_P (olddecl))) |
0b60dfe3 | 1595 | { |
b323323f LM |
1596 | warning (OPT_Wredundant_decls, "redundant redeclaration of %qD in same scope", newdecl); |
1597 | warning (OPT_Wredundant_decls, "previous declaration of %q+D", olddecl); | |
0b60dfe3 | 1598 | } |
8d08fdba MS |
1599 | } |
1600 | ||
1601 | /* Deal with C++: must preserve virtual function table size. */ | |
1602 | if (TREE_CODE (olddecl) == TYPE_DECL) | |
1603 | { | |
926ce8bd KH |
1604 | tree newtype = TREE_TYPE (newdecl); |
1605 | tree oldtype = TREE_TYPE (olddecl); | |
8d08fdba MS |
1606 | |
1607 | if (newtype != error_mark_node && oldtype != error_mark_node | |
1608 | && TYPE_LANG_SPECIFIC (newtype) && TYPE_LANG_SPECIFIC (oldtype)) | |
e93ee644 MM |
1609 | CLASSTYPE_FRIEND_CLASSES (newtype) |
1610 | = CLASSTYPE_FRIEND_CLASSES (oldtype); | |
7df87825 | 1611 | |
970d6386 | 1612 | DECL_ORIGINAL_TYPE (newdecl) = DECL_ORIGINAL_TYPE (olddecl); |
8d08fdba MS |
1613 | } |
1614 | ||
8d08fdba MS |
1615 | /* Copy all the DECL_... slots specified in the new decl |
1616 | except for any that we copy here from the old type. */ | |
91d231cb | 1617 | DECL_ATTRIBUTES (newdecl) |
f6897b10 | 1618 | = (*targetm.merge_decl_attributes) (olddecl, newdecl); |
8d08fdba | 1619 | |
5566b478 MS |
1620 | if (TREE_CODE (newdecl) == TEMPLATE_DECL) |
1621 | { | |
e1f0e7a6 MM |
1622 | tree old_result; |
1623 | tree new_result; | |
1624 | old_result = DECL_TEMPLATE_RESULT (olddecl); | |
1625 | new_result = DECL_TEMPLATE_RESULT (newdecl); | |
1626 | TREE_TYPE (olddecl) = TREE_TYPE (old_result); | |
68642fb6 | 1627 | DECL_TEMPLATE_SPECIALIZATIONS (olddecl) |
4d85e00e MM |
1628 | = chainon (DECL_TEMPLATE_SPECIALIZATIONS (olddecl), |
1629 | DECL_TEMPLATE_SPECIALIZATIONS (newdecl)); | |
68642fb6 | 1630 | |
e1f0e7a6 MM |
1631 | if (DECL_FUNCTION_TEMPLATE_P (newdecl)) |
1632 | { | |
1633 | DECL_INLINE (old_result) | |
1634 | |= DECL_INLINE (new_result); | |
1635 | DECL_DECLARED_INLINE_P (old_result) | |
1636 | |= DECL_DECLARED_INLINE_P (new_result); | |
1637 | check_redeclaration_exception_specification (newdecl, olddecl); | |
1638 | } | |
1639 | ||
daa8df65 | 1640 | /* If the new declaration is a definition, update the file and |
72c4a4ca GK |
1641 | line information on the declaration, and also make |
1642 | the old declaration the same definition. */ | |
e1f0e7a6 MM |
1643 | if (DECL_INITIAL (old_result) == NULL_TREE |
1644 | && DECL_INITIAL (new_result) != NULL_TREE) | |
daa8df65 | 1645 | { |
caf93cb0 | 1646 | DECL_SOURCE_LOCATION (olddecl) |
e1f0e7a6 | 1647 | = DECL_SOURCE_LOCATION (old_result) |
f31686a3 | 1648 | = DECL_SOURCE_LOCATION (newdecl); |
72c4a4ca | 1649 | DECL_INITIAL (old_result) = DECL_INITIAL (new_result); |
26bcf8fc | 1650 | if (DECL_FUNCTION_TEMPLATE_P (newdecl)) |
e1f0e7a6 MM |
1651 | DECL_ARGUMENTS (old_result) |
1652 | = DECL_ARGUMENTS (new_result); | |
c11889ce MM |
1653 | } |
1654 | ||
b1a19c7c | 1655 | return olddecl; |
5566b478 | 1656 | } |
68642fb6 | 1657 | |
8d08fdba MS |
1658 | if (types_match) |
1659 | { | |
1660 | /* Automatically handles default parameters. */ | |
1661 | tree oldtype = TREE_TYPE (olddecl); | |
e1cd6e56 | 1662 | tree newtype; |
8d08fdba | 1663 | |
e1cd6e56 | 1664 | /* Merge the data types specified in the two decls. */ |
6da794e8 | 1665 | newtype = merge_types (TREE_TYPE (newdecl), TREE_TYPE (olddecl)); |
e1cd6e56 | 1666 | |
6da794e8 | 1667 | /* If merge_types produces a non-typedef type, just use the old type. */ |
9076e292 JM |
1668 | if (TREE_CODE (newdecl) == TYPE_DECL |
1669 | && newtype == DECL_ORIGINAL_TYPE (newdecl)) | |
1670 | newtype = oldtype; | |
1671 | ||
8d08fdba | 1672 | if (TREE_CODE (newdecl) == VAR_DECL) |
17bbb839 MM |
1673 | { |
1674 | DECL_THIS_EXTERN (newdecl) |= DECL_THIS_EXTERN (olddecl); | |
1675 | DECL_INITIALIZED_P (newdecl) |= DECL_INITIALIZED_P (olddecl); | |
3db45ab5 | 1676 | DECL_NONTRIVIALLY_INITIALIZED_P (newdecl) |
6c06fbce | 1677 | |= DECL_NONTRIVIALLY_INITIALIZED_P (olddecl); |
39703eb9 MM |
1678 | DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (newdecl) |
1679 | |= DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (olddecl); | |
1799e5d5 RH |
1680 | |
1681 | /* Merge the threadprivate attribute from OLDDECL into NEWDECL. */ | |
1682 | if (DECL_LANG_SPECIFIC (olddecl) | |
1683 | && CP_DECL_THREADPRIVATE_P (olddecl)) | |
1684 | { | |
1685 | /* Allocate a LANG_SPECIFIC structure for NEWDECL, if needed. */ | |
1686 | if (!DECL_LANG_SPECIFIC (newdecl)) | |
1687 | retrofit_lang_decl (newdecl); | |
1688 | ||
1689 | DECL_TLS_MODEL (newdecl) = DECL_TLS_MODEL (olddecl); | |
1690 | CP_DECL_THREADPRIVATE_P (newdecl) = 1; | |
1691 | } | |
17bbb839 MM |
1692 | } |
1693 | ||
6da794e8 | 1694 | /* Do this after calling `merge_types' so that default |
8d08fdba | 1695 | parameters don't confuse us. */ |
e1f0e7a6 MM |
1696 | else if (TREE_CODE (newdecl) == FUNCTION_DECL) |
1697 | check_redeclaration_exception_specification (newdecl, olddecl); | |
8d08fdba MS |
1698 | TREE_TYPE (newdecl) = TREE_TYPE (olddecl) = newtype; |
1699 | ||
4a2f6dc0 VR |
1700 | if (TREE_CODE (newdecl) == FUNCTION_DECL) |
1701 | check_default_args (newdecl); | |
1702 | ||
8d08fdba | 1703 | /* Lay the type out, unless already done. */ |
407f03b8 | 1704 | if (! same_type_p (newtype, oldtype) |
5566b478 | 1705 | && TREE_TYPE (newdecl) != error_mark_node |
5156628f | 1706 | && !(processing_template_decl && uses_template_parms (newdecl))) |
b7484fbe MS |
1707 | layout_type (TREE_TYPE (newdecl)); |
1708 | ||
5566b478 MS |
1709 | if ((TREE_CODE (newdecl) == VAR_DECL |
1710 | || TREE_CODE (newdecl) == PARM_DECL | |
1711 | || TREE_CODE (newdecl) == RESULT_DECL | |
1712 | || TREE_CODE (newdecl) == FIELD_DECL | |
1713 | || TREE_CODE (newdecl) == TYPE_DECL) | |
5156628f | 1714 | && !(processing_template_decl && uses_template_parms (newdecl))) |
b7484fbe | 1715 | layout_decl (newdecl, 0); |
8d08fdba MS |
1716 | |
1717 | /* Merge the type qualifiers. */ | |
1718 | if (TREE_READONLY (newdecl)) | |
1719 | TREE_READONLY (olddecl) = 1; | |
1720 | if (TREE_THIS_VOLATILE (newdecl)) | |
1721 | TREE_THIS_VOLATILE (olddecl) = 1; | |
5cefa0d9 JM |
1722 | if (TREE_NOTHROW (newdecl)) |
1723 | TREE_NOTHROW (olddecl) = 1; | |
8d08fdba | 1724 | |
302a2cc5 JM |
1725 | /* Merge deprecatedness. */ |
1726 | if (TREE_DEPRECATED (newdecl)) | |
1727 | TREE_DEPRECATED (olddecl) = 1; | |
1728 | ||
8d08fdba | 1729 | /* Merge the initialization information. */ |
8926095f MS |
1730 | if (DECL_INITIAL (newdecl) == NULL_TREE |
1731 | && DECL_INITIAL (olddecl) != NULL_TREE) | |
1732 | { | |
1733 | DECL_INITIAL (newdecl) = DECL_INITIAL (olddecl); | |
f31686a3 | 1734 | DECL_SOURCE_LOCATION (newdecl) = DECL_SOURCE_LOCATION (olddecl); |
b0d06515 MM |
1735 | if (CAN_HAVE_FULL_LANG_DECL_P (newdecl) |
1736 | && DECL_LANG_SPECIFIC (newdecl) | |
4d85e00e | 1737 | && DECL_LANG_SPECIFIC (olddecl)) |
69ee8086 RH |
1738 | { |
1739 | DECL_SAVED_TREE (newdecl) = DECL_SAVED_TREE (olddecl); | |
1da326c3 | 1740 | DECL_STRUCT_FUNCTION (newdecl) = DECL_STRUCT_FUNCTION (olddecl); |
69ee8086 | 1741 | } |
8926095f | 1742 | } |
39211cd5 MS |
1743 | |
1744 | /* Merge the section attribute. | |
0cbd7506 | 1745 | We want to issue an error if the sections conflict but that must be |
39211cd5 MS |
1746 | done later in decl_attributes since we are called before attributes |
1747 | are assigned. */ | |
1748 | if (DECL_SECTION_NAME (newdecl) == NULL_TREE) | |
1749 | DECL_SECTION_NAME (newdecl) = DECL_SECTION_NAME (olddecl); | |
1750 | ||
a157febd GK |
1751 | if (TREE_CODE (newdecl) == FUNCTION_DECL) |
1752 | { | |
1753 | DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (newdecl) | |
1754 | |= DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (olddecl); | |
1331d16f | 1755 | DECL_NO_LIMIT_STACK (newdecl) |= DECL_NO_LIMIT_STACK (olddecl); |
220a35cc RS |
1756 | TREE_THIS_VOLATILE (newdecl) |= TREE_THIS_VOLATILE (olddecl); |
1757 | TREE_READONLY (newdecl) |= TREE_READONLY (olddecl); | |
1758 | TREE_NOTHROW (newdecl) |= TREE_NOTHROW (olddecl); | |
1331d16f RS |
1759 | DECL_IS_MALLOC (newdecl) |= DECL_IS_MALLOC (olddecl); |
1760 | DECL_IS_PURE (newdecl) |= DECL_IS_PURE (olddecl); | |
c740732f MM |
1761 | /* Keep the old RTL. */ |
1762 | COPY_DECL_RTL (olddecl, newdecl); | |
1763 | } | |
caf93cb0 | 1764 | else if (TREE_CODE (newdecl) == VAR_DECL |
c740732f MM |
1765 | && (DECL_SIZE (olddecl) || !DECL_SIZE (newdecl))) |
1766 | { | |
1767 | /* Keep the old RTL. We cannot keep the old RTL if the old | |
1768 | declaration was for an incomplete object and the new | |
1769 | declaration is not since many attributes of the RTL will | |
1770 | change. */ | |
1771 | COPY_DECL_RTL (olddecl, newdecl); | |
a157febd | 1772 | } |
8d08fdba MS |
1773 | } |
1774 | /* If cannot merge, then use the new type and qualifiers, | |
1775 | and don't preserve the old rtl. */ | |
1776 | else | |
1777 | { | |
1778 | /* Clean out any memory we had of the old declaration. */ | |
1779 | tree oldstatic = value_member (olddecl, static_aggregates); | |
1780 | if (oldstatic) | |
1781 | TREE_VALUE (oldstatic) = error_mark_node; | |
1782 | ||
1783 | TREE_TYPE (olddecl) = TREE_TYPE (newdecl); | |
1784 | TREE_READONLY (olddecl) = TREE_READONLY (newdecl); | |
1785 | TREE_THIS_VOLATILE (olddecl) = TREE_THIS_VOLATILE (newdecl); | |
1786 | TREE_SIDE_EFFECTS (olddecl) = TREE_SIDE_EFFECTS (newdecl); | |
1787 | } | |
1788 | ||
1789 | /* Merge the storage class information. */ | |
45806a3f FS |
1790 | merge_weak (newdecl, olddecl); |
1791 | ||
e92cc029 | 1792 | DECL_ONE_ONLY (newdecl) |= DECL_ONE_ONLY (olddecl); |
794d4a61 | 1793 | DECL_DEFER_OUTPUT (newdecl) |= DECL_DEFER_OUTPUT (olddecl); |
a9aedbc2 MS |
1794 | TREE_PUBLIC (newdecl) = TREE_PUBLIC (olddecl); |
1795 | TREE_STATIC (olddecl) = TREE_STATIC (newdecl) |= TREE_STATIC (olddecl); | |
1796 | if (! DECL_EXTERNAL (olddecl)) | |
1797 | DECL_EXTERNAL (newdecl) = 0; | |
68642fb6 | 1798 | |
50b56799 | 1799 | new_template = NULL_TREE; |
0b60dfe3 | 1800 | if (DECL_LANG_SPECIFIC (newdecl) && DECL_LANG_SPECIFIC (olddecl)) |
8d08fdba | 1801 | { |
a9aedbc2 MS |
1802 | DECL_INTERFACE_KNOWN (newdecl) |= DECL_INTERFACE_KNOWN (olddecl); |
1803 | DECL_NOT_REALLY_EXTERN (newdecl) |= DECL_NOT_REALLY_EXTERN (olddecl); | |
77be6f82 | 1804 | DECL_COMDAT (newdecl) |= DECL_COMDAT (olddecl); |
68642fb6 | 1805 | DECL_TEMPLATE_INSTANTIATED (newdecl) |
2b0a63a3 | 1806 | |= DECL_TEMPLATE_INSTANTIATED (olddecl); |
c8094d83 | 1807 | |
58fb06b4 NS |
1808 | /* If the OLDDECL is an instantiation and/or specialization, |
1809 | then the NEWDECL must be too. But, it may not yet be marked | |
1810 | as such if the caller has created NEWDECL, but has not yet | |
1811 | figured out that it is a redeclaration. */ | |
1812 | if (!DECL_USE_TEMPLATE (newdecl)) | |
1813 | DECL_USE_TEMPLATE (newdecl) = DECL_USE_TEMPLATE (olddecl); | |
c8094d83 | 1814 | |
0b60dfe3 BK |
1815 | /* Don't really know how much of the language-specific |
1816 | values we should copy from old to new. */ | |
1817 | DECL_IN_AGGR_P (newdecl) = DECL_IN_AGGR_P (olddecl); | |
caf93cb0 | 1818 | DECL_LANG_SPECIFIC (newdecl)->decl_flags.u2 = |
e2500fed | 1819 | DECL_LANG_SPECIFIC (olddecl)->decl_flags.u2; |
0b60dfe3 | 1820 | DECL_NONCONVERTING_P (newdecl) = DECL_NONCONVERTING_P (olddecl); |
4684cd27 | 1821 | DECL_REPO_AVAILABLE_P (newdecl) = DECL_REPO_AVAILABLE_P (olddecl); |
50b56799 MM |
1822 | if (DECL_TEMPLATE_INFO (newdecl)) |
1823 | new_template = DECL_TI_TEMPLATE (newdecl); | |
fbf1c34b | 1824 | DECL_TEMPLATE_INFO (newdecl) = DECL_TEMPLATE_INFO (olddecl); |
3febd123 | 1825 | DECL_INITIALIZED_IN_CLASS_P (newdecl) |
0cbd7506 | 1826 | |= DECL_INITIALIZED_IN_CLASS_P (olddecl); |
0b60dfe3 | 1827 | olddecl_friend = DECL_FRIEND_P (olddecl); |
d63d5d0c ILT |
1828 | hidden_friend = (DECL_ANTICIPATED (olddecl) |
1829 | && DECL_HIDDEN_FRIEND_P (olddecl) | |
1830 | && newdecl_is_friend); | |
6a629cac MM |
1831 | |
1832 | /* Only functions have DECL_BEFRIENDING_CLASSES. */ | |
1833 | if (TREE_CODE (newdecl) == FUNCTION_DECL | |
1834 | || DECL_FUNCTION_TEMPLATE_P (newdecl)) | |
bb5e8a7f MM |
1835 | { |
1836 | DECL_BEFRIENDING_CLASSES (newdecl) | |
1837 | = chainon (DECL_BEFRIENDING_CLASSES (newdecl), | |
1838 | DECL_BEFRIENDING_CLASSES (olddecl)); | |
ca9e1382 KL |
1839 | /* DECL_THUNKS is only valid for virtual functions, |
1840 | otherwise it is a DECL_FRIEND_CONTEXT. */ | |
1841 | if (DECL_VIRTUAL_P (newdecl)) | |
1842 | DECL_THUNKS (newdecl) = DECL_THUNKS (olddecl); | |
bb5e8a7f | 1843 | } |
8d08fdba MS |
1844 | } |
1845 | ||
8d08fdba MS |
1846 | if (TREE_CODE (newdecl) == FUNCTION_DECL) |
1847 | { | |
68642fb6 UD |
1848 | if (DECL_TEMPLATE_INSTANTIATION (olddecl) |
1849 | && !DECL_TEMPLATE_INSTANTIATION (newdecl)) | |
75650646 MM |
1850 | { |
1851 | /* If newdecl is not a specialization, then it is not a | |
1852 | template-related function at all. And that means that we | |
bf7c02dd | 1853 | should have exited above, returning 0. */ |
50bc768d | 1854 | gcc_assert (DECL_TEMPLATE_SPECIALIZATION (newdecl)); |
75650646 | 1855 | |
68642fb6 | 1856 | if (TREE_USED (olddecl)) |
75650646 | 1857 | /* From [temp.expl.spec]: |
68642fb6 | 1858 | |
75650646 MM |
1859 | If a template, a member template or the member of a class |
1860 | template is explicitly specialized then that | |
1861 | specialization shall be declared before the first use of | |
1862 | that specialization that would cause an implicit | |
1863 | instantiation to take place, in every translation unit in | |
1864 | which such a use occurs. */ | |
9e637a26 | 1865 | error ("explicit specialization of %qD after first use", |
75650646 MM |
1866 | olddecl); |
1867 | ||
1868 | SET_DECL_TEMPLATE_SPECIALIZATION (olddecl); | |
d03d18e8 | 1869 | |
b9e75696 JM |
1870 | /* Don't propagate visibility from the template to the |
1871 | specialization here. We'll do that in determine_visibility if | |
1872 | appropriate. */ | |
1873 | DECL_VISIBILITY_SPECIFIED (olddecl) = 0; | |
1874 | ||
d03d18e8 KL |
1875 | /* [temp.expl.spec/14] We don't inline explicit specialization |
1876 | just because the primary template says so. */ | |
75650646 | 1877 | } |
d03d18e8 KL |
1878 | else |
1879 | { | |
1880 | if (DECL_PENDING_INLINE_INFO (newdecl) == 0) | |
1881 | DECL_PENDING_INLINE_INFO (newdecl) = DECL_PENDING_INLINE_INFO (olddecl); | |
faae18ab | 1882 | |
d03d18e8 | 1883 | DECL_DECLARED_INLINE_P (newdecl) |= DECL_DECLARED_INLINE_P (olddecl); |
faae18ab | 1884 | |
caf93cb0 | 1885 | /* If either decl says `inline', this fn is inline, unless |
d03d18e8 KL |
1886 | its definition was passed already. */ |
1887 | if (DECL_INLINE (newdecl) && DECL_INITIAL (olddecl) == NULL_TREE) | |
1888 | DECL_INLINE (olddecl) = 1; | |
1889 | DECL_INLINE (newdecl) = DECL_INLINE (olddecl); | |
1890 | ||
1891 | DECL_UNINLINABLE (newdecl) = DECL_UNINLINABLE (olddecl) | |
1892 | = (DECL_UNINLINABLE (newdecl) || DECL_UNINLINABLE (olddecl)); | |
1893 | } | |
97055d5c | 1894 | |
5daf7c0a JM |
1895 | /* Preserve abstractness on cloned [cd]tors. */ |
1896 | DECL_ABSTRACT (newdecl) = DECL_ABSTRACT (olddecl); | |
1897 | ||
700f8a87 MS |
1898 | if (! types_match) |
1899 | { | |
5d2ed28c | 1900 | SET_DECL_LANGUAGE (olddecl, DECL_LANGUAGE (newdecl)); |
92643fea | 1901 | COPY_DECL_ASSEMBLER_NAME (newdecl, olddecl); |
84b8b0e0 | 1902 | COPY_DECL_RTL (newdecl, olddecl); |
5566b478 MS |
1903 | } |
1904 | if (! types_match || new_defines_function) | |
1905 | { | |
6f1b4c42 JM |
1906 | /* These need to be copied so that the names are available. |
1907 | Note that if the types do match, we'll preserve inline | |
1908 | info and other bits, but if not, we won't. */ | |
700f8a87 MS |
1909 | DECL_ARGUMENTS (olddecl) = DECL_ARGUMENTS (newdecl); |
1910 | DECL_RESULT (olddecl) = DECL_RESULT (newdecl); | |
700f8a87 | 1911 | } |
8d08fdba MS |
1912 | if (new_defines_function) |
1913 | /* If defining a function declared with other language | |
1914 | linkage, use the previously declared language linkage. */ | |
5d2ed28c | 1915 | SET_DECL_LANGUAGE (newdecl, DECL_LANGUAGE (olddecl)); |
6f1b4c42 | 1916 | else if (types_match) |
8d08fdba MS |
1917 | { |
1918 | /* If redeclaring a builtin function, and not a definition, | |
1919 | it stays built in. */ | |
1920 | if (DECL_BUILT_IN (olddecl)) | |
1921 | { | |
26db82d8 | 1922 | DECL_BUILT_IN_CLASS (newdecl) = DECL_BUILT_IN_CLASS (olddecl); |
39211cd5 | 1923 | DECL_FUNCTION_CODE (newdecl) = DECL_FUNCTION_CODE (olddecl); |
8d08fdba MS |
1924 | /* If we're keeping the built-in definition, keep the rtl, |
1925 | regardless of declaration matches. */ | |
84b8b0e0 | 1926 | COPY_DECL_RTL (olddecl, newdecl); |
8d08fdba | 1927 | } |
8d08fdba MS |
1928 | |
1929 | DECL_RESULT (newdecl) = DECL_RESULT (olddecl); | |
8d08fdba MS |
1930 | /* Don't clear out the arguments if we're redefining a function. */ |
1931 | if (DECL_ARGUMENTS (olddecl)) | |
1932 | DECL_ARGUMENTS (newdecl) = DECL_ARGUMENTS (olddecl); | |
1933 | } | |
1934 | } | |
0b1161fc MM |
1935 | else if (TREE_CODE (newdecl) == NAMESPACE_DECL) |
1936 | NAMESPACE_LEVEL (newdecl) = NAMESPACE_LEVEL (olddecl); | |
a9aedbc2 | 1937 | |
8d08fdba MS |
1938 | /* Now preserve various other info from the definition. */ |
1939 | TREE_ADDRESSABLE (newdecl) = TREE_ADDRESSABLE (olddecl); | |
1940 | TREE_ASM_WRITTEN (newdecl) = TREE_ASM_WRITTEN (olddecl); | |
1941 | DECL_COMMON (newdecl) = DECL_COMMON (olddecl); | |
92643fea | 1942 | COPY_DECL_ASSEMBLER_NAME (olddecl, newdecl); |
8d08fdba | 1943 | |
d7afec4b | 1944 | /* Warn about conflicting visibility specifications. */ |
c8094d83 | 1945 | if (DECL_VISIBILITY_SPECIFIED (olddecl) |
73a8adb6 | 1946 | && DECL_VISIBILITY_SPECIFIED (newdecl) |
d7afec4b ND |
1947 | && DECL_VISIBILITY (newdecl) != DECL_VISIBILITY (olddecl)) |
1948 | { | |
dee15844 JM |
1949 | warning (OPT_Wattributes, "%q+D: visibility attribute ignored " |
1950 | "because it", newdecl); | |
5c498b10 DD |
1951 | warning (OPT_Wattributes, "%Jconflicts with previous " |
1952 | "declaration here", olddecl); | |
d7afec4b ND |
1953 | } |
1954 | /* Choose the declaration which specified visibility. */ | |
1955 | if (DECL_VISIBILITY_SPECIFIED (olddecl)) | |
facef326 | 1956 | { |
facef326 | 1957 | DECL_VISIBILITY (newdecl) = DECL_VISIBILITY (olddecl); |
d7afec4b ND |
1958 | DECL_VISIBILITY_SPECIFIED (newdecl) = 1; |
1959 | } | |
3db45ab5 | 1960 | /* Init priority used to be merged from newdecl to olddecl by the memcpy, |
820cc88f DB |
1961 | so keep this behavior. */ |
1962 | if (TREE_CODE (newdecl) == VAR_DECL && DECL_HAS_INIT_PRIORITY_P (newdecl)) | |
1963 | { | |
1964 | SET_DECL_INIT_PRIORITY (olddecl, DECL_INIT_PRIORITY (newdecl)); | |
1965 | DECL_HAS_INIT_PRIORITY_P (olddecl) = 1; | |
1966 | } | |
facef326 | 1967 | |
1d786913 MM |
1968 | /* The DECL_LANG_SPECIFIC information in OLDDECL will be replaced |
1969 | with that from NEWDECL below. */ | |
1970 | if (DECL_LANG_SPECIFIC (olddecl)) | |
1971 | { | |
c8094d83 | 1972 | gcc_assert (DECL_LANG_SPECIFIC (olddecl) |
1d786913 MM |
1973 | != DECL_LANG_SPECIFIC (newdecl)); |
1974 | ggc_free (DECL_LANG_SPECIFIC (olddecl)); | |
1975 | } | |
1976 | ||
8d08fdba MS |
1977 | if (TREE_CODE (newdecl) == FUNCTION_DECL) |
1978 | { | |
1979 | int function_size; | |
8d08fdba | 1980 | |
820cc88f | 1981 | function_size = sizeof (struct tree_decl_common); |
8d08fdba | 1982 | |
730e1556 KG |
1983 | memcpy ((char *) olddecl + sizeof (struct tree_common), |
1984 | (char *) newdecl + sizeof (struct tree_common), | |
1985 | function_size - sizeof (struct tree_common)); | |
8d08fdba | 1986 | |
820cc88f DB |
1987 | memcpy ((char *) olddecl + sizeof (struct tree_decl_common), |
1988 | (char *) newdecl + sizeof (struct tree_decl_common), | |
1989 | sizeof (struct tree_function_decl) - sizeof (struct tree_decl_common)); | |
50b56799 | 1990 | if (new_template) |
b3445994 MM |
1991 | /* If newdecl is a template instantiation, it is possible that |
1992 | the following sequence of events has occurred: | |
1993 | ||
1994 | o A friend function was declared in a class template. The | |
1995 | class template was instantiated. | |
1996 | ||
1997 | o The instantiation of the friend declaration was | |
1998 | recorded on the instantiation list, and is newdecl. | |
1999 | ||
2000 | o Later, however, instantiate_class_template called pushdecl | |
2001 | on the newdecl to perform name injection. But, pushdecl in | |
2002 | turn called duplicate_decls when it discovered that another | |
2003 | declaration of a global function with the same name already | |
2004 | existed. | |
2005 | ||
2006 | o Here, in duplicate_decls, we decided to clobber newdecl. | |
2007 | ||
2008 | If we're going to do that, we'd better make sure that | |
2009 | olddecl, and not newdecl, is on the list of | |
2010 | instantiations so that if we try to do the instantiation | |
2011 | again we won't get the clobbered declaration. */ | |
caf93cb0 | 2012 | reregister_specialization (newdecl, |
50b56799 | 2013 | new_template, |
b3445994 | 2014 | olddecl); |
8d08fdba MS |
2015 | } |
2016 | else | |
2017 | { | |
820cc88f | 2018 | size_t size = tree_code_size (TREE_CODE (olddecl)); |
730e1556 KG |
2019 | memcpy ((char *) olddecl + sizeof (struct tree_common), |
2020 | (char *) newdecl + sizeof (struct tree_common), | |
820cc88f | 2021 | sizeof (struct tree_decl_common) - sizeof (struct tree_common)); |
3db45ab5 | 2022 | switch (TREE_CODE (olddecl)) |
820cc88f DB |
2023 | { |
2024 | case LABEL_DECL: | |
2025 | case VAR_DECL: | |
2026 | case RESULT_DECL: | |
2027 | case PARM_DECL: | |
2028 | case FIELD_DECL: | |
2029 | case TYPE_DECL: | |
2030 | case CONST_DECL: | |
2031 | { | |
2032 | memcpy ((char *) olddecl + sizeof (struct tree_decl_common), | |
2033 | (char *) newdecl + sizeof (struct tree_decl_common), | |
2034 | size - sizeof (struct tree_decl_common) | |
2035 | + TREE_CODE_LENGTH (TREE_CODE (newdecl)) * sizeof (char *)); | |
2036 | } | |
2037 | break; | |
2038 | default: | |
2039 | memcpy ((char *) olddecl + sizeof (struct tree_decl_common), | |
2040 | (char *) newdecl + sizeof (struct tree_decl_common), | |
2041 | sizeof (struct tree_decl_non_common) - sizeof (struct tree_decl_common) | |
2042 | + TREE_CODE_LENGTH (TREE_CODE (newdecl)) * sizeof (char *)); | |
2043 | break; | |
2044 | } | |
8d08fdba | 2045 | } |
8d08fdba MS |
2046 | DECL_UID (olddecl) = olddecl_uid; |
2047 | if (olddecl_friend) | |
2048 | DECL_FRIEND_P (olddecl) = 1; | |
d63d5d0c ILT |
2049 | if (hidden_friend) |
2050 | { | |
2051 | DECL_ANTICIPATED (olddecl) = 1; | |
2052 | DECL_HIDDEN_FRIEND_P (olddecl) = 1; | |
2053 | } | |
8d08fdba | 2054 | |
d9525bec BK |
2055 | /* NEWDECL contains the merged attribute lists. |
2056 | Update OLDDECL to be the same. */ | |
91d231cb | 2057 | DECL_ATTRIBUTES (olddecl) = DECL_ATTRIBUTES (newdecl); |
d9525bec | 2058 | |
16e31964 DS |
2059 | /* If OLDDECL had its DECL_RTL instantiated, re-invoke make_decl_rtl |
2060 | so that encode_section_info has a chance to look at the new decl | |
2061 | flags and attributes. */ | |
caf93cb0 | 2062 | if (DECL_RTL_SET_P (olddecl) |
16e31964 DS |
2063 | && (TREE_CODE (olddecl) == FUNCTION_DECL |
2064 | || (TREE_CODE (olddecl) == VAR_DECL | |
2065 | && TREE_STATIC (olddecl)))) | |
0e6df31e | 2066 | make_decl_rtl (olddecl); |
16e31964 | 2067 | |
1d786913 MM |
2068 | /* The NEWDECL will no longer be needed. Because every out-of-class |
2069 | declaration of a member results in a call to duplicate_decls, | |
2070 | freeing these nodes represents in a significant savings. */ | |
2071 | ggc_free (newdecl); | |
2072 | ||
b1a19c7c | 2073 | return olddecl; |
8d08fdba | 2074 | } |
8d08fdba | 2075 | \f |
8251199e | 2076 | /* Return zero if the declaration NEWDECL is valid |
8d08fdba MS |
2077 | when the declaration OLDDECL (assumed to be for the same name) |
2078 | has already been seen. | |
2079 | Otherwise return an error message format string with a %s | |
2080 | where the identifier should go. */ | |
2081 | ||
d8e178a0 | 2082 | static const char * |
11f6b451 | 2083 | redeclaration_error_message (tree newdecl, tree olddecl) |
8d08fdba MS |
2084 | { |
2085 | if (TREE_CODE (newdecl) == TYPE_DECL) | |
2086 | { | |
2087 | /* Because C++ can put things into name space for free, | |
2088 | constructs like "typedef struct foo { ... } foo" | |
2089 | would look like an erroneous redeclaration. */ | |
3bfdc719 | 2090 | if (same_type_p (TREE_TYPE (newdecl), TREE_TYPE (olddecl))) |
6aed477a | 2091 | return NULL; |
8d08fdba | 2092 | else |
2d01edd7 | 2093 | return "redefinition of %q#D"; |
8d08fdba MS |
2094 | } |
2095 | else if (TREE_CODE (newdecl) == FUNCTION_DECL) | |
2096 | { | |
2097 | /* If this is a pure function, its olddecl will actually be | |
2098 | the original initialization to `0' (which we force to call | |
2099 | abort()). Don't complain about redefinition in this case. */ | |
d1fc3bbd AO |
2100 | if (DECL_LANG_SPECIFIC (olddecl) && DECL_PURE_VIRTUAL_P (olddecl) |
2101 | && DECL_INITIAL (olddecl) == NULL_TREE) | |
6aed477a | 2102 | return NULL; |
8d08fdba | 2103 | |
2c73f9f5 | 2104 | /* If both functions come from different namespaces, this is not |
a1c65f9f | 2105 | a redeclaration - this is a conflict with a used function. */ |
6eb3bb27 | 2106 | if (DECL_NAMESPACE_SCOPE_P (olddecl) |
713101a6 AO |
2107 | && DECL_CONTEXT (olddecl) != DECL_CONTEXT (newdecl) |
2108 | && ! decls_match (olddecl, newdecl)) | |
2d01edd7 | 2109 | return "%qD conflicts with used function"; |
2c73f9f5 | 2110 | |
db5ae43f | 2111 | /* We'll complain about linkage mismatches in |
0cbd7506 | 2112 | warn_extern_redeclared_static. */ |
db5ae43f | 2113 | |
2c73f9f5 | 2114 | /* Defining the same name twice is no good. */ |
8d08fdba | 2115 | if (DECL_INITIAL (olddecl) != NULL_TREE |
faae18ab | 2116 | && DECL_INITIAL (newdecl) != NULL_TREE) |
8d08fdba MS |
2117 | { |
2118 | if (DECL_NAME (olddecl) == NULL_TREE) | |
2d01edd7 | 2119 | return "%q#D not declared in class"; |
8d08fdba | 2120 | else |
2d01edd7 | 2121 | return "redefinition of %q#D"; |
8d08fdba | 2122 | } |
6aed477a | 2123 | return NULL; |
8d08fdba | 2124 | } |
51c184be MS |
2125 | else if (TREE_CODE (newdecl) == TEMPLATE_DECL) |
2126 | { | |
5bd61841 MM |
2127 | tree nt, ot; |
2128 | ||
2129 | if (TREE_CODE (DECL_TEMPLATE_RESULT (newdecl)) == TYPE_DECL) | |
2130 | { | |
2131 | if (COMPLETE_TYPE_P (TREE_TYPE (newdecl)) | |
2132 | && COMPLETE_TYPE_P (TREE_TYPE (olddecl))) | |
2d01edd7 | 2133 | return "redefinition of %q#D"; |
5bd61841 MM |
2134 | return NULL; |
2135 | } | |
2136 | ||
2137 | if (TREE_CODE (DECL_TEMPLATE_RESULT (newdecl)) != FUNCTION_DECL | |
caf93cb0 | 2138 | || (DECL_TEMPLATE_RESULT (newdecl) |
5bd61841 MM |
2139 | == DECL_TEMPLATE_RESULT (olddecl))) |
2140 | return NULL; | |
2141 | ||
2142 | nt = DECL_TEMPLATE_RESULT (newdecl); | |
2143 | if (DECL_TEMPLATE_INFO (nt)) | |
2144 | nt = DECL_TEMPLATE_RESULT (template_for_substitution (nt)); | |
2145 | ot = DECL_TEMPLATE_RESULT (olddecl); | |
2146 | if (DECL_TEMPLATE_INFO (ot)) | |
2147 | ot = DECL_TEMPLATE_RESULT (template_for_substitution (ot)); | |
2148 | if (DECL_INITIAL (nt) && DECL_INITIAL (ot)) | |
2d01edd7 | 2149 | return "redefinition of %q#D"; |
5bd61841 MM |
2150 | |
2151 | return NULL; | |
51c184be | 2152 | } |
31a79236 | 2153 | else if (TREE_CODE (newdecl) == VAR_DECL |
1799e5d5 RH |
2154 | && DECL_THREAD_LOCAL_P (newdecl) != DECL_THREAD_LOCAL_P (olddecl) |
2155 | && (! DECL_LANG_SPECIFIC (olddecl) | |
2156 | || ! CP_DECL_THREADPRIVATE_P (olddecl) | |
2157 | || DECL_THREAD_LOCAL_P (newdecl))) | |
31a79236 JJ |
2158 | { |
2159 | /* Only variables can be thread-local, and all declarations must | |
2160 | agree on this property. */ | |
2161 | if (DECL_THREAD_LOCAL_P (newdecl)) | |
2162 | return "thread-local declaration of %q#D follows " | |
2163 | "non-thread-local declaration"; | |
2164 | else | |
2165 | return "non-thread-local declaration of %q#D follows " | |
2166 | "thread-local declaration"; | |
2167 | } | |
1f51a992 | 2168 | else if (toplevel_bindings_p () || DECL_NAMESPACE_SCOPE_P (newdecl)) |
8d08fdba MS |
2169 | { |
2170 | /* Objects declared at top level: */ | |
2171 | /* If at least one is a reference, it's ok. */ | |
2172 | if (DECL_EXTERNAL (newdecl) || DECL_EXTERNAL (olddecl)) | |
6aed477a | 2173 | return NULL; |
8926095f | 2174 | /* Reject two definitions. */ |
2d01edd7 | 2175 | return "redefinition of %q#D"; |
8d08fdba MS |
2176 | } |
2177 | else | |
2178 | { | |
2179 | /* Objects declared with block scope: */ | |
2180 | /* Reject two definitions, and reject a definition | |
2181 | together with an external reference. */ | |
2182 | if (!(DECL_EXTERNAL (newdecl) && DECL_EXTERNAL (olddecl))) | |
2d01edd7 | 2183 | return "redeclaration of %q#D"; |
6aed477a | 2184 | return NULL; |
8d08fdba MS |
2185 | } |
2186 | } | |
2187 | \f | |
1799e5d5 RH |
2188 | /* Hash and equality functions for the named_label table. */ |
2189 | ||
2190 | static hashval_t | |
2191 | named_label_entry_hash (const void *data) | |
2192 | { | |
2193 | const struct named_label_entry *ent = (const struct named_label_entry *) data; | |
2194 | return DECL_UID (ent->label_decl); | |
2195 | } | |
2196 | ||
2197 | static int | |
2198 | named_label_entry_eq (const void *a, const void *b) | |
2199 | { | |
2200 | const struct named_label_entry *ent_a = (const struct named_label_entry *) a; | |
2201 | const struct named_label_entry *ent_b = (const struct named_label_entry *) b; | |
2202 | return ent_a->label_decl == ent_b->label_decl; | |
2203 | } | |
2204 | ||
acef433b | 2205 | /* Create a new label, named ID. */ |
8d08fdba | 2206 | |
acef433b | 2207 | static tree |
11f6b451 | 2208 | make_label_decl (tree id, int local_p) |
8d08fdba | 2209 | { |
1799e5d5 RH |
2210 | struct named_label_entry *ent; |
2211 | void **slot; | |
acef433b | 2212 | tree decl; |
8d08fdba | 2213 | |
acef433b | 2214 | decl = build_decl (LABEL_DECL, id, void_type_node); |
acef433b MM |
2215 | |
2216 | DECL_CONTEXT (decl) = current_function_decl; | |
2217 | DECL_MODE (decl) = VOIDmode; | |
2218 | C_DECLARED_LABEL_FLAG (decl) = local_p; | |
8d08fdba | 2219 | |
acef433b MM |
2220 | /* Say where one reference is to the label, for the sake of the |
2221 | error if it is not defined. */ | |
f31686a3 | 2222 | DECL_SOURCE_LOCATION (decl) = input_location; |
acef433b MM |
2223 | |
2224 | /* Record the fact that this identifier is bound to this label. */ | |
2225 | SET_IDENTIFIER_LABEL_VALUE (id, decl); | |
2226 | ||
1799e5d5 RH |
2227 | /* Create the label htab for the function on demand. */ |
2228 | if (!named_labels) | |
2229 | named_labels = htab_create_ggc (13, named_label_entry_hash, | |
2230 | named_label_entry_eq, NULL); | |
6625cdb5 | 2231 | |
1799e5d5 RH |
2232 | /* Record this label on the list of labels used in this function. |
2233 | We do this before calling make_label_decl so that we get the | |
2234 | IDENTIFIER_LABEL_VALUE before the new label is declared. */ | |
2235 | ent = GGC_CNEW (struct named_label_entry); | |
2236 | ent->label_decl = decl; | |
6625cdb5 | 2237 | |
1799e5d5 RH |
2238 | slot = htab_find_slot (named_labels, ent, INSERT); |
2239 | gcc_assert (*slot == NULL); | |
2240 | *slot = ent; | |
2241 | ||
2242 | return decl; | |
acef433b | 2243 | } |
8d08fdba | 2244 | |
acef433b MM |
2245 | /* Look for a label named ID in the current function. If one cannot |
2246 | be found, create one. (We keep track of used, but undefined, | |
2247 | labels, and complain about them at the end of a function.) */ | |
8d08fdba | 2248 | |
68642fb6 | 2249 | tree |
11f6b451 | 2250 | lookup_label (tree id) |
acef433b MM |
2251 | { |
2252 | tree decl; | |
8d08fdba | 2253 | |
22ffcc6f | 2254 | timevar_push (TV_NAME_LOOKUP); |
acef433b MM |
2255 | /* You can't use labels at global scope. */ |
2256 | if (current_function_decl == NULL_TREE) | |
2257 | { | |
2d01edd7 | 2258 | error ("label %qE referenced outside of any function", id); |
22ffcc6f | 2259 | POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, NULL_TREE); |
acef433b | 2260 | } |
68642fb6 | 2261 | |
acef433b MM |
2262 | /* See if we've already got this label. */ |
2263 | decl = IDENTIFIER_LABEL_VALUE (id); | |
2264 | if (decl != NULL_TREE && DECL_CONTEXT (decl) == current_function_decl) | |
22ffcc6f | 2265 | POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, decl); |
8d08fdba | 2266 | |
acef433b | 2267 | decl = make_label_decl (id, /*local_p=*/0); |
22ffcc6f | 2268 | POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, decl); |
8d08fdba MS |
2269 | } |
2270 | ||
acef433b | 2271 | /* Declare a local label named ID. */ |
8d08fdba MS |
2272 | |
2273 | tree | |
11f6b451 | 2274 | declare_local_label (tree id) |
8d08fdba | 2275 | { |
1799e5d5 | 2276 | tree decl, shadow; |
8d08fdba | 2277 | |
acef433b | 2278 | /* Add a new entry to the SHADOWED_LABELS list so that when we leave |
1799e5d5 RH |
2279 | this scope we can restore the old value of IDENTIFIER_TYPE_VALUE. */ |
2280 | shadow = tree_cons (IDENTIFIER_LABEL_VALUE (id), NULL_TREE, | |
2281 | current_binding_level->shadowed_labels); | |
2282 | current_binding_level->shadowed_labels = shadow; | |
2283 | ||
acef433b | 2284 | decl = make_label_decl (id, /*local_p=*/1); |
1799e5d5 | 2285 | TREE_VALUE (shadow) = decl; |
68642fb6 | 2286 | |
acef433b | 2287 | return decl; |
8d08fdba MS |
2288 | } |
2289 | ||
6625cdb5 JM |
2290 | /* Returns nonzero if it is ill-formed to jump past the declaration of |
2291 | DECL. Returns 2 if it's also a real problem. */ | |
2292 | ||
2293 | static int | |
11f6b451 | 2294 | decl_jump_unsafe (tree decl) |
6625cdb5 | 2295 | { |
b88b7ced AP |
2296 | if (TREE_CODE (decl) != VAR_DECL || TREE_STATIC (decl) |
2297 | || TREE_TYPE (decl) == error_mark_node) | |
6625cdb5 JM |
2298 | return 0; |
2299 | ||
6c06fbce MM |
2300 | if (TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (decl)) |
2301 | || DECL_NONTRIVIALLY_INITIALIZED_P (decl)) | |
2302 | return 2; | |
2303 | ||
2304 | if (pod_type_p (TREE_TYPE (decl))) | |
6625cdb5 JM |
2305 | return 0; |
2306 | ||
6c06fbce | 2307 | /* The POD stuff is just pedantry; why should it matter if the class |
6625cdb5 | 2308 | contains a field of pointer to member type? */ |
6625cdb5 JM |
2309 | return 1; |
2310 | } | |
2311 | ||
1799e5d5 RH |
2312 | /* A subroutine of check_previous_goto_1 to identify a branch to the user. */ |
2313 | ||
2314 | static void | |
2315 | identify_goto (tree decl, const location_t *locus) | |
2316 | { | |
2317 | if (decl) | |
2318 | pedwarn ("jump to label %qD", decl); | |
2319 | else | |
2320 | pedwarn ("jump to case label"); | |
2321 | if (locus) | |
2322 | pedwarn ("%H from here", locus); | |
2323 | } | |
2324 | ||
6625cdb5 JM |
2325 | /* Check that a single previously seen jump to a newly defined label |
2326 | is OK. DECL is the LABEL_DECL or 0; LEVEL is the binding_level for | |
2327 | the jump context; NAMES are the names in scope in LEVEL at the jump | |
3db45ab5 | 2328 | context; LOCUS is the source position of the jump or 0. Returns |
1799e5d5 | 2329 | true if all is well. */ |
6625cdb5 | 2330 | |
1799e5d5 RH |
2331 | static bool |
2332 | check_previous_goto_1 (tree decl, struct cp_binding_level* level, tree names, | |
2333 | bool exited_omp, const location_t *locus) | |
2334 | { | |
2335 | struct cp_binding_level *b; | |
2336 | bool identified = false, saw_eh = false, saw_omp = false; | |
2337 | ||
2338 | if (exited_omp) | |
2339 | { | |
2340 | identify_goto (decl, locus); | |
2341 | error (" exits OpenMP structured block"); | |
2342 | identified = saw_omp = true; | |
2343 | } | |
2344 | ||
2345 | for (b = current_binding_level; b ; b = b->level_chain) | |
2346 | { | |
2347 | tree new_decls, old_decls = (b == level ? names : NULL_TREE); | |
2348 | ||
2349 | for (new_decls = b->names; new_decls != old_decls; | |
6625cdb5 JM |
2350 | new_decls = TREE_CHAIN (new_decls)) |
2351 | { | |
2352 | int problem = decl_jump_unsafe (new_decls); | |
2353 | if (! problem) | |
2354 | continue; | |
2355 | ||
1799e5d5 | 2356 | if (!identified) |
6625cdb5 | 2357 | { |
1799e5d5 RH |
2358 | identify_goto (decl, locus); |
2359 | identified = true; | |
6625cdb5 | 2360 | } |
826840d9 | 2361 | if (problem > 1) |
dee15844 | 2362 | error (" crosses initialization of %q+#D", new_decls); |
6625cdb5 | 2363 | else |
dee15844 | 2364 | pedwarn (" enters scope of non-POD %q+#D", new_decls); |
6625cdb5 JM |
2365 | } |
2366 | ||
2367 | if (b == level) | |
2368 | break; | |
1799e5d5 | 2369 | if ((b->kind == sk_try || b->kind == sk_catch) && !saw_eh) |
6625cdb5 | 2370 | { |
1799e5d5 | 2371 | if (!identified) |
6625cdb5 | 2372 | { |
1799e5d5 RH |
2373 | identify_goto (decl, locus); |
2374 | identified = true; | |
6625cdb5 | 2375 | } |
a7e8c268 | 2376 | if (b->kind == sk_try) |
826840d9 RH |
2377 | error (" enters try block"); |
2378 | else | |
2379 | error (" enters catch block"); | |
1799e5d5 RH |
2380 | saw_eh = true; |
2381 | } | |
2382 | if (b->kind == sk_omp && !saw_omp) | |
2383 | { | |
2384 | if (!identified) | |
2385 | { | |
2386 | identify_goto (decl, locus); | |
2387 | identified = true; | |
2388 | } | |
2389 | error (" enters OpenMP structured block"); | |
2390 | saw_omp = true; | |
6625cdb5 JM |
2391 | } |
2392 | } | |
6625cdb5 | 2393 | |
1799e5d5 | 2394 | return !identified; |
6625cdb5 JM |
2395 | } |
2396 | ||
2397 | static void | |
1799e5d5 | 2398 | check_previous_goto (tree decl, struct named_label_use_entry *use) |
6625cdb5 | 2399 | { |
1799e5d5 RH |
2400 | check_previous_goto_1 (decl, use->binding_level, |
2401 | use->names_in_scope, use->in_omp_scope, | |
2402 | &use->o_goto_locus); | |
6625cdb5 JM |
2403 | } |
2404 | ||
1799e5d5 RH |
2405 | static bool |
2406 | check_switch_goto (struct cp_binding_level* level) | |
6625cdb5 | 2407 | { |
1799e5d5 | 2408 | return check_previous_goto_1 (NULL_TREE, level, level->names, false, NULL); |
6625cdb5 JM |
2409 | } |
2410 | ||
2411 | /* Check that a new jump to a label DECL is OK. Called by | |
2412 | finish_goto_stmt. */ | |
2413 | ||
2414 | void | |
11f6b451 | 2415 | check_goto (tree decl) |
6625cdb5 | 2416 | { |
1799e5d5 RH |
2417 | struct named_label_entry *ent, dummy; |
2418 | bool saw_catch = false, identified = false; | |
6625cdb5 | 2419 | tree bad; |
6625cdb5 | 2420 | |
1799e5d5 RH |
2421 | /* We can't know where a computed goto is jumping. |
2422 | So we assume that it's OK. */ | |
2423 | if (TREE_CODE (decl) != LABEL_DECL) | |
2424 | return; | |
2425 | ||
2426 | /* We didn't record any information about this label when we created it, | |
2427 | and there's not much point since it's trivial to analyze as a return. */ | |
2428 | if (decl == cdtor_label) | |
e3cd9945 APB |
2429 | return; |
2430 | ||
1799e5d5 RH |
2431 | dummy.label_decl = decl; |
2432 | ent = (struct named_label_entry *) htab_find (named_labels, &dummy); | |
2433 | gcc_assert (ent != NULL); | |
2434 | ||
6625cdb5 JM |
2435 | /* If the label hasn't been defined yet, defer checking. */ |
2436 | if (! DECL_INITIAL (decl)) | |
2437 | { | |
1799e5d5 | 2438 | struct named_label_use_entry *new_use; |
6625cdb5 | 2439 | |
1799e5d5 RH |
2440 | /* Don't bother creating another use if the last goto had the |
2441 | same data, and will therefore create the same set of errors. */ | |
2442 | if (ent->uses | |
2443 | && ent->uses->names_in_scope == current_binding_level->names) | |
2444 | return; | |
6625cdb5 | 2445 | |
1799e5d5 RH |
2446 | new_use = GGC_NEW (struct named_label_use_entry); |
2447 | new_use->binding_level = current_binding_level; | |
2448 | new_use->names_in_scope = current_binding_level->names; | |
2449 | new_use->o_goto_locus = input_location; | |
2450 | new_use->in_omp_scope = false; | |
2451 | ||
2452 | new_use->next = ent->uses; | |
2453 | ent->uses = new_use; | |
2454 | return; | |
2455 | } | |
6625cdb5 | 2456 | |
1799e5d5 RH |
2457 | if (ent->in_try_scope || ent->in_catch_scope |
2458 | || ent->in_omp_scope || ent->bad_decls) | |
6625cdb5 | 2459 | { |
dee15844 | 2460 | pedwarn ("jump to label %q+D", decl); |
6625cdb5 | 2461 | pedwarn (" from here"); |
1799e5d5 | 2462 | identified = true; |
6625cdb5 JM |
2463 | } |
2464 | ||
1799e5d5 | 2465 | for (bad = ent->bad_decls; bad; bad = TREE_CHAIN (bad)) |
6625cdb5 JM |
2466 | { |
2467 | tree b = TREE_VALUE (bad); | |
2468 | int u = decl_jump_unsafe (b); | |
2469 | ||
2470 | if (u > 1 && DECL_ARTIFICIAL (b)) | |
1799e5d5 RH |
2471 | { |
2472 | /* Can't skip init of __exception_info. */ | |
2473 | error ("%J enters catch block", b); | |
2474 | saw_catch = true; | |
2475 | } | |
6625cdb5 | 2476 | else if (u > 1) |
dee15844 | 2477 | error (" skips initialization of %q+#D", b); |
6625cdb5 | 2478 | else |
dee15844 | 2479 | pedwarn (" enters scope of non-POD %q+#D", b); |
6625cdb5 JM |
2480 | } |
2481 | ||
1799e5d5 | 2482 | if (ent->in_try_scope) |
6625cdb5 | 2483 | error (" enters try block"); |
1799e5d5 | 2484 | else if (ent->in_catch_scope && !saw_catch) |
826840d9 | 2485 | error (" enters catch block"); |
1799e5d5 RH |
2486 | |
2487 | if (ent->in_omp_scope) | |
2488 | error (" enters OpenMP structured block"); | |
2489 | else if (flag_openmp) | |
2490 | { | |
2491 | struct cp_binding_level *b; | |
2492 | for (b = current_binding_level; b ; b = b->level_chain) | |
2493 | { | |
2494 | if (b == ent->binding_level) | |
2495 | break; | |
2496 | if (b->kind == sk_omp) | |
2497 | { | |
2498 | if (!identified) | |
2499 | { | |
2500 | pedwarn ("jump to label %q+D", decl); | |
2501 | pedwarn (" from here"); | |
2502 | identified = true; | |
2503 | } | |
2504 | error (" exits OpenMP structured block"); | |
2505 | break; | |
2506 | } | |
2507 | } | |
2508 | } | |
2509 | } | |
2510 | ||
2511 | /* Check that a return is ok wrt OpenMP structured blocks. | |
2512 | Called by finish_return_stmt. Returns true if all is well. */ | |
2513 | ||
2514 | bool | |
2515 | check_omp_return (void) | |
2516 | { | |
2517 | struct cp_binding_level *b; | |
2518 | for (b = current_binding_level; b ; b = b->level_chain) | |
2519 | if (b->kind == sk_omp) | |
2520 | { | |
2521 | error ("invalid exit from OpenMP structured block"); | |
2522 | return false; | |
2523 | } | |
2524 | return true; | |
6625cdb5 JM |
2525 | } |
2526 | ||
8d08fdba | 2527 | /* Define a label, specifying the location in the source file. |
b9c87401 | 2528 | Return the LABEL_DECL node for the label. */ |
8d08fdba MS |
2529 | |
2530 | tree | |
5b030314 | 2531 | define_label (location_t location, tree name) |
8d08fdba | 2532 | { |
1799e5d5 | 2533 | struct named_label_entry *ent, dummy; |
926ce8bd | 2534 | struct cp_binding_level *p; |
1799e5d5 | 2535 | tree decl; |
6625cdb5 | 2536 | |
22ffcc6f | 2537 | timevar_push (TV_NAME_LOOKUP); |
1799e5d5 RH |
2538 | |
2539 | decl = lookup_label (name); | |
2540 | ||
2541 | dummy.label_decl = decl; | |
2542 | ent = (struct named_label_entry *) htab_find (named_labels, &dummy); | |
2543 | gcc_assert (ent != NULL); | |
8d08fdba | 2544 | |
3dc9aec6 | 2545 | /* After labels, make any new cleanups in the function go into their |
8d08fdba | 2546 | own new (temporary) binding contour. */ |
caf93cb0 EC |
2547 | for (p = current_binding_level; |
2548 | p->kind != sk_function_parms; | |
a7e8c268 | 2549 | p = p->level_chain) |
3dc9aec6 | 2550 | p->more_cleanups_ok = 0; |
8d08fdba | 2551 | |
e1cd6e56 | 2552 | if (name == get_identifier ("wchar_t")) |
33bd39a2 | 2553 | pedwarn ("label named wchar_t"); |
e1cd6e56 | 2554 | |
8d08fdba | 2555 | if (DECL_INITIAL (decl) != NULL_TREE) |
417fa55b LM |
2556 | { |
2557 | error ("duplicate label %qD", decl); | |
2558 | POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, error_mark_node); | |
2559 | } | |
8d08fdba MS |
2560 | else |
2561 | { | |
1799e5d5 RH |
2562 | struct named_label_use_entry *use; |
2563 | ||
8d08fdba MS |
2564 | /* Mark label as having been defined. */ |
2565 | DECL_INITIAL (decl) = error_mark_node; | |
2566 | /* Say where in the source. */ | |
f31686a3 | 2567 | DECL_SOURCE_LOCATION (decl) = location; |
1799e5d5 RH |
2568 | |
2569 | ent->binding_level = current_binding_level; | |
2570 | ent->names_in_scope = current_binding_level->names; | |
2571 | ||
2572 | for (use = ent->uses; use ; use = use->next) | |
2573 | check_previous_goto (decl, use); | |
2574 | ent->uses = NULL; | |
8d08fdba | 2575 | } |
b9c87401 | 2576 | |
be99edf8 | 2577 | POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, decl); |
8d08fdba MS |
2578 | } |
2579 | ||
a5894242 MS |
2580 | struct cp_switch |
2581 | { | |
e2500fed | 2582 | struct cp_binding_level *level; |
a5894242 | 2583 | struct cp_switch *next; |
56cb9733 MM |
2584 | /* The SWITCH_STMT being built. */ |
2585 | tree switch_stmt; | |
2586 | /* A splay-tree mapping the low element of a case range to the high | |
2587 | element, or NULL_TREE if there is no high element. Used to | |
2588 | determine whether or not a new case label duplicates an old case | |
2589 | label. We need a tree, rather than simply a hash table, because | |
2590 | of the GNU case range extension. */ | |
2591 | splay_tree cases; | |
a5894242 MS |
2592 | }; |
2593 | ||
56cb9733 MM |
2594 | /* A stack of the currently active switch statements. The innermost |
2595 | switch statement is on the top of the stack. There is no need to | |
2596 | mark the stack for garbage collection because it is only active | |
2597 | during the processing of the body of a function, and we never | |
2598 | collect at that point. */ | |
5362b086 | 2599 | |
a5894242 MS |
2600 | static struct cp_switch *switch_stack; |
2601 | ||
56cb9733 MM |
2602 | /* Called right after a switch-statement condition is parsed. |
2603 | SWITCH_STMT is the switch statement being parsed. */ | |
2604 | ||
a5894242 | 2605 | void |
11f6b451 | 2606 | push_switch (tree switch_stmt) |
a5894242 | 2607 | { |
0ac1b889 | 2608 | struct cp_switch *p = XNEW (struct cp_switch); |
a5894242 MS |
2609 | p->level = current_binding_level; |
2610 | p->next = switch_stack; | |
56cb9733 MM |
2611 | p->switch_stmt = switch_stmt; |
2612 | p->cases = splay_tree_new (case_compare, NULL, NULL); | |
a5894242 MS |
2613 | switch_stack = p; |
2614 | } | |
2615 | ||
2616 | void | |
11f6b451 | 2617 | pop_switch (void) |
a5894242 | 2618 | { |
6de9cd9a | 2619 | struct cp_switch *cs = switch_stack; |
fbc315db | 2620 | location_t switch_location; |
6de9cd9a DN |
2621 | |
2622 | /* Emit warnings as needed. */ | |
fbc315db ILT |
2623 | if (EXPR_HAS_LOCATION (cs->switch_stmt)) |
2624 | switch_location = EXPR_LOCATION (cs->switch_stmt); | |
2625 | else | |
2626 | switch_location = input_location; | |
dddf9a0a AP |
2627 | if (!processing_template_decl) |
2628 | c_do_switch_warnings (cs->cases, switch_location, | |
2629 | SWITCH_STMT_TYPE (cs->switch_stmt), | |
2630 | SWITCH_STMT_COND (cs->switch_stmt)); | |
5362b086 | 2631 | |
56cb9733 | 2632 | splay_tree_delete (cs->cases); |
a5894242 | 2633 | switch_stack = switch_stack->next; |
bedda2da | 2634 | free (cs); |
a5894242 MS |
2635 | } |
2636 | ||
b0a1da19 JM |
2637 | /* Note that we've seen a definition of a case label, and complain if this |
2638 | is a bad place for one. */ | |
e92cc029 | 2639 | |
3e4d04a1 | 2640 | tree |
11f6b451 | 2641 | finish_case_label (tree low_value, tree high_value) |
8d08fdba | 2642 | { |
3e4d04a1 | 2643 | tree cond, r; |
926ce8bd | 2644 | struct cp_binding_level *p; |
a5894242 | 2645 | |
56cb9733 MM |
2646 | if (processing_template_decl) |
2647 | { | |
8f17b5c5 MM |
2648 | tree label; |
2649 | ||
56cb9733 MM |
2650 | /* For templates, just add the case label; we'll do semantic |
2651 | analysis at instantiation-time. */ | |
8f17b5c5 | 2652 | label = build_decl (LABEL_DECL, NULL_TREE, NULL_TREE); |
3e4d04a1 | 2653 | return add_stmt (build_case_label (low_value, high_value, label)); |
56cb9733 MM |
2654 | } |
2655 | ||
2656 | /* Find the condition on which this switch statement depends. */ | |
ebaae582 | 2657 | cond = SWITCH_STMT_COND (switch_stack->switch_stmt); |
56cb9733 MM |
2658 | if (cond && TREE_CODE (cond) == TREE_LIST) |
2659 | cond = TREE_VALUE (cond); | |
56cb9733 | 2660 | |
1799e5d5 RH |
2661 | if (!check_switch_goto (switch_stack->level)) |
2662 | return error_mark_node; | |
2663 | ||
a6c0a76c SB |
2664 | r = c_add_case_label (switch_stack->cases, cond, TREE_TYPE (cond), |
2665 | low_value, high_value); | |
8d08fdba | 2666 | |
3dc9aec6 | 2667 | /* After labels, make any new cleanups in the function go into their |
8d08fdba | 2668 | own new (temporary) binding contour. */ |
caf93cb0 EC |
2669 | for (p = current_binding_level; |
2670 | p->kind != sk_function_parms; | |
a7e8c268 | 2671 | p = p->level_chain) |
3dc9aec6 | 2672 | p->more_cleanups_ok = 0; |
3e4d04a1 RH |
2673 | |
2674 | return r; | |
8d08fdba MS |
2675 | } |
2676 | \f | |
7ddedda4 MM |
2677 | /* Hash a TYPENAME_TYPE. K is really of type `tree'. */ |
2678 | ||
e2500fed | 2679 | static hashval_t |
11f6b451 | 2680 | typename_hash (const void* k) |
7ddedda4 | 2681 | { |
e2500fed GK |
2682 | hashval_t hash; |
2683 | tree t = (tree) k; | |
7ddedda4 | 2684 | |
7bdfd72e KG |
2685 | hash = (htab_hash_pointer (TYPE_CONTEXT (t)) |
2686 | ^ htab_hash_pointer (DECL_NAME (TYPE_NAME (t)))); | |
7ddedda4 MM |
2687 | |
2688 | return hash; | |
2689 | } | |
2690 | ||
fc6a28d7 MM |
2691 | typedef struct typename_info { |
2692 | tree scope; | |
2693 | tree name; | |
2694 | tree template_id; | |
2695 | bool enum_p; | |
2696 | bool class_p; | |
2697 | } typename_info; | |
2698 | ||
06d40de8 DG |
2699 | /* Compare two TYPENAME_TYPEs. K1 is really of type `tree', K2 is |
2700 | really of type `typename_info*' */ | |
7ddedda4 | 2701 | |
e2500fed | 2702 | static int |
11f6b451 | 2703 | typename_compare (const void * k1, const void * k2) |
7ddedda4 MM |
2704 | { |
2705 | tree t1; | |
fc6a28d7 | 2706 | const typename_info *t2; |
7ddedda4 MM |
2707 | |
2708 | t1 = (tree) k1; | |
fc6a28d7 MM |
2709 | t2 = (const typename_info *) k2; |
2710 | ||
2711 | return (DECL_NAME (TYPE_NAME (t1)) == t2->name | |
2712 | && TYPE_CONTEXT (t1) == t2->scope | |
2713 | && TYPENAME_TYPE_FULLNAME (t1) == t2->template_id | |
2714 | && TYPENAME_IS_ENUM_P (t1) == t2->enum_p | |
2715 | && TYPENAME_IS_CLASS_P (t1) == t2->class_p); | |
7ddedda4 MM |
2716 | } |
2717 | ||
45869a6c | 2718 | /* Build a TYPENAME_TYPE. If the type is `typename T::t', CONTEXT is |
fc6a28d7 | 2719 | the type of `T', NAME is the IDENTIFIER_NODE for `t'. |
c8094d83 | 2720 | |
45869a6c MM |
2721 | Returns the new TYPENAME_TYPE. */ |
2722 | ||
e2500fed GK |
2723 | static GTY ((param_is (union tree_node))) htab_t typename_htab; |
2724 | ||
8ce33230 | 2725 | static tree |
fc6a28d7 MM |
2726 | build_typename_type (tree context, tree name, tree fullname, |
2727 | enum tag_types tag_type) | |
45869a6c MM |
2728 | { |
2729 | tree t; | |
2730 | tree d; | |
fc6a28d7 | 2731 | typename_info ti; |
fad205ff | 2732 | void **e; |
fc6a28d7 | 2733 | hashval_t hash; |
45869a6c | 2734 | |
e2500fed | 2735 | if (typename_htab == NULL) |
fc6a28d7 MM |
2736 | typename_htab = htab_create_ggc (61, &typename_hash, |
2737 | &typename_compare, NULL); | |
2738 | ||
c8094d83 | 2739 | ti.scope = FROB_CONTEXT (context); |
fc6a28d7 MM |
2740 | ti.name = name; |
2741 | ti.template_id = fullname; | |
2742 | ti.enum_p = tag_type == enum_type; | |
2743 | ti.class_p = (tag_type == class_type | |
2744 | || tag_type == record_type | |
2745 | || tag_type == union_type); | |
2746 | hash = (htab_hash_pointer (ti.scope) | |
2747 | ^ htab_hash_pointer (ti.name)); | |
45869a6c | 2748 | |
7ddedda4 | 2749 | /* See if we already have this type. */ |
fc6a28d7 | 2750 | e = htab_find_slot_with_hash (typename_htab, &ti, hash, INSERT); |
e2500fed GK |
2751 | if (*e) |
2752 | t = (tree) *e; | |
7ddedda4 | 2753 | else |
fc6a28d7 MM |
2754 | { |
2755 | /* Build the TYPENAME_TYPE. */ | |
2756 | t = make_aggr_type (TYPENAME_TYPE); | |
2757 | TYPE_CONTEXT (t) = ti.scope; | |
2758 | TYPENAME_TYPE_FULLNAME (t) = ti.template_id; | |
2759 | TYPENAME_IS_ENUM_P (t) = ti.enum_p; | |
2760 | TYPENAME_IS_CLASS_P (t) = ti.class_p; | |
c8094d83 | 2761 | |
fc6a28d7 MM |
2762 | /* Build the corresponding TYPE_DECL. */ |
2763 | d = build_decl (TYPE_DECL, name, t); | |
2764 | TYPE_NAME (TREE_TYPE (d)) = d; | |
2765 | TYPE_STUB_DECL (TREE_TYPE (d)) = d; | |
2766 | DECL_CONTEXT (d) = FROB_CONTEXT (context); | |
2767 | DECL_ARTIFICIAL (d) = 1; | |
2768 | ||
2769 | /* Store it in the hash table. */ | |
2770 | *e = t; | |
06d40de8 DG |
2771 | |
2772 | /* TYPENAME_TYPEs must always be compared structurally, because | |
2773 | they may or may not resolve down to another type depending on | |
2774 | the currently open classes. */ | |
2775 | SET_TYPE_STRUCTURAL_EQUALITY (t); | |
fc6a28d7 | 2776 | } |
c8094d83 | 2777 | |
45869a6c MM |
2778 | return t; |
2779 | } | |
2780 | ||
fc6a28d7 MM |
2781 | /* Resolve `typename CONTEXT::NAME'. TAG_TYPE indicates the tag |
2782 | provided to name the type. Returns an appropriate type, unless an | |
2783 | error occurs, in which case error_mark_node is returned. If we | |
2784 | locate a non-artificial TYPE_DECL and TF_KEEP_TYPE_DECL is set, we | |
2785 | return that, rather than the _TYPE it corresponds to, in other | |
2786 | cases we look through the type decl. If TF_ERROR is set, complain | |
2787 | about errors, otherwise be quiet. */ | |
3baa501d | 2788 | |
5566b478 | 2789 | tree |
fc6a28d7 MM |
2790 | make_typename_type (tree context, tree name, enum tag_types tag_type, |
2791 | tsubst_flags_t complain) | |
5566b478 | 2792 | { |
b2b7d40a | 2793 | tree fullname; |
7d3bec9d NS |
2794 | tree t; |
2795 | bool want_template; | |
a80e4195 | 2796 | |
5dc5d13c KL |
2797 | if (name == error_mark_node |
2798 | || context == NULL_TREE | |
2799 | || context == error_mark_node) | |
2800 | return error_mark_node; | |
2801 | ||
2f939d94 | 2802 | if (TYPE_P (name)) |
78638e24 | 2803 | { |
68642fb6 UD |
2804 | if (!(TYPE_LANG_SPECIFIC (name) |
2805 | && (CLASSTYPE_IS_TEMPLATE (name) | |
78638e24 MM |
2806 | || CLASSTYPE_USE_TEMPLATE (name)))) |
2807 | name = TYPE_IDENTIFIER (name); | |
2808 | else | |
2809 | /* Create a TEMPLATE_ID_EXPR for the type. */ | |
2810 | name = build_nt (TEMPLATE_ID_EXPR, | |
2811 | CLASSTYPE_TI_TEMPLATE (name), | |
2812 | CLASSTYPE_TI_ARGS (name)); | |
2813 | } | |
653cc74a | 2814 | else if (TREE_CODE (name) == TYPE_DECL) |
a80e4195 | 2815 | name = DECL_NAME (name); |
b2b7d40a JM |
2816 | |
2817 | fullname = name; | |
2818 | ||
2819 | if (TREE_CODE (name) == TEMPLATE_ID_EXPR) | |
11686454 JM |
2820 | { |
2821 | name = TREE_OPERAND (name, 0); | |
2822 | if (TREE_CODE (name) == TEMPLATE_DECL) | |
2823 | name = TREE_OPERAND (fullname, 0) = DECL_NAME (name); | |
50ef2c18 MM |
2824 | else if (TREE_CODE (name) == OVERLOAD) |
2825 | { | |
2826 | error ("%qD is not a type", name); | |
2827 | return error_mark_node; | |
2828 | } | |
11686454 | 2829 | } |
8a2b77e7 JM |
2830 | if (TREE_CODE (name) == TEMPLATE_DECL) |
2831 | { | |
2d01edd7 | 2832 | error ("%qD used without template parameters", name); |
8a2b77e7 JM |
2833 | return error_mark_node; |
2834 | } | |
50bc768d | 2835 | gcc_assert (TREE_CODE (name) == IDENTIFIER_NODE); |
0c88d886 | 2836 | gcc_assert (TYPE_P (context)); |
04ddee1b | 2837 | |
7d3bec9d NS |
2838 | /* When the CONTEXT is a dependent type, NAME could refer to a |
2839 | dependent base class of CONTEXT. So we cannot peek inside it, | |
2840 | even if CONTEXT is a currently open scope. */ | |
2841 | if (dependent_type_p (context)) | |
2842 | return build_typename_type (context, name, fullname, tag_type); | |
caf93cb0 | 2843 | |
7d3bec9d NS |
2844 | if (!IS_AGGR_TYPE (context)) |
2845 | { | |
2846 | if (complain & tf_error) | |
2847 | error ("%q#T is not a class", context); | |
2848 | return error_mark_node; | |
5566b478 | 2849 | } |
7d3bec9d NS |
2850 | |
2851 | want_template = TREE_CODE (fullname) == TEMPLATE_ID_EXPR; | |
2852 | ||
2853 | /* We should only set WANT_TYPE when we're a nested typename type. | |
2854 | Then we can give better diagnostics if we find a non-type. */ | |
2855 | t = lookup_field (context, name, 0, /*want_type=*/true); | |
2856 | if (!t) | |
11249cf0 | 2857 | { |
4f2b0fb2 | 2858 | if (complain & tf_error) |
7d3bec9d NS |
2859 | error (want_template ? "no class template named %q#T in %q#T" |
2860 | : "no type named %q#T in %q#T", name, context); | |
11249cf0 MM |
2861 | return error_mark_node; |
2862 | } | |
7d3bec9d NS |
2863 | |
2864 | if (want_template && !DECL_CLASS_TEMPLATE_P (t)) | |
2865 | { | |
2866 | if (complain & tf_error) | |
2867 | error ("%<typename %T::%D%> names %q#T, which is not a class template", | |
2868 | context, name, t); | |
2869 | return error_mark_node; | |
2870 | } | |
2871 | if (!want_template && TREE_CODE (t) != TYPE_DECL) | |
2872 | { | |
2873 | if (complain & tf_error) | |
2874 | error ("%<typename %T::%D%> names %q#T, which is not a type", | |
2875 | context, name, t); | |
2876 | return error_mark_node; | |
2877 | } | |
2878 | ||
2879 | if (complain & tf_error) | |
02022f3a | 2880 | perform_or_defer_access_check (TYPE_BINFO (context), t, t); |
7d3bec9d NS |
2881 | |
2882 | if (want_template) | |
2883 | return lookup_template_class (t, TREE_OPERAND (fullname, 1), | |
2884 | NULL_TREE, context, | |
2885 | /*entering_scope=*/0, | |
2886 | tf_warning_or_error | tf_user); | |
2887 | ||
2888 | if (DECL_ARTIFICIAL (t) || !(complain & tf_keep_type_decl)) | |
2889 | t = TREE_TYPE (t); | |
2890 | ||
2891 | return t; | |
5566b478 MS |
2892 | } |
2893 | ||
b939a023 | 2894 | /* Resolve `CONTEXT::template NAME'. Returns a TEMPLATE_DECL if the name |
c8094d83 | 2895 | can be resolved or an UNBOUND_CLASS_TEMPLATE, unless an error occurs, |
b939a023 KL |
2896 | in which case error_mark_node is returned. |
2897 | ||
2898 | If PARM_LIST is non-NULL, also make sure that the template parameter | |
2899 | list of TEMPLATE_DECL matches. | |
2900 | ||
2901 | If COMPLAIN zero, don't complain about any errors that occur. */ | |
b8c6534b KL |
2902 | |
2903 | tree | |
b939a023 KL |
2904 | make_unbound_class_template (tree context, tree name, tree parm_list, |
2905 | tsubst_flags_t complain) | |
b8c6534b KL |
2906 | { |
2907 | tree t; | |
2908 | tree d; | |
2909 | ||
2910 | if (TYPE_P (name)) | |
2911 | name = TYPE_IDENTIFIER (name); | |
2912 | else if (DECL_P (name)) | |
2913 | name = DECL_NAME (name); | |
8dc2b103 | 2914 | gcc_assert (TREE_CODE (name) == IDENTIFIER_NODE); |
b8c6534b | 2915 | |
9579624e | 2916 | if (!dependent_type_p (context) |
b8c6534b KL |
2917 | || currently_open_class (context)) |
2918 | { | |
2919 | tree tmpl = NULL_TREE; | |
2920 | ||
2921 | if (IS_AGGR_TYPE (context)) | |
86ac0575 | 2922 | tmpl = lookup_field (context, name, 0, false); |
b8c6534b KL |
2923 | |
2924 | if (!tmpl || !DECL_CLASS_TEMPLATE_P (tmpl)) | |
2925 | { | |
4f09be91 | 2926 | if (complain & tf_error) |
2d01edd7 | 2927 | error ("no class template named %q#T in %q#T", name, context); |
b8c6534b KL |
2928 | return error_mark_node; |
2929 | } | |
caf93cb0 | 2930 | |
b939a023 KL |
2931 | if (parm_list |
2932 | && !comp_template_parms (DECL_TEMPLATE_PARMS (tmpl), parm_list)) | |
2933 | { | |
2934 | if (complain & tf_error) | |
2935 | { | |
2936 | error ("template parameters do not match template"); | |
dee15844 | 2937 | error ("%q+D declared here", tmpl); |
b939a023 KL |
2938 | } |
2939 | return error_mark_node; | |
2940 | } | |
2941 | ||
2b59fc25 | 2942 | if (complain & tf_error) |
02022f3a | 2943 | perform_or_defer_access_check (TYPE_BINFO (context), tmpl, tmpl); |
b8c6534b KL |
2944 | |
2945 | return tmpl; | |
2946 | } | |
2947 | ||
2948 | /* Build the UNBOUND_CLASS_TEMPLATE. */ | |
2949 | t = make_aggr_type (UNBOUND_CLASS_TEMPLATE); | |
2950 | TYPE_CONTEXT (t) = FROB_CONTEXT (context); | |
2951 | TREE_TYPE (t) = NULL_TREE; | |
06d40de8 | 2952 | SET_TYPE_STRUCTURAL_EQUALITY (t); |
b8c6534b KL |
2953 | |
2954 | /* Build the corresponding TEMPLATE_DECL. */ | |
2955 | d = build_decl (TEMPLATE_DECL, name, t); | |
2956 | TYPE_NAME (TREE_TYPE (d)) = d; | |
2957 | TYPE_STUB_DECL (TREE_TYPE (d)) = d; | |
2958 | DECL_CONTEXT (d) = FROB_CONTEXT (context); | |
2959 | DECL_ARTIFICIAL (d) = 1; | |
b939a023 | 2960 | DECL_TEMPLATE_PARMS (d) = parm_list; |
b8c6534b KL |
2961 | |
2962 | return t; | |
2963 | } | |
2964 | ||
8d08fdba | 2965 | \f |
47aa0df4 | 2966 | |
8d08fdba | 2967 | /* Push the declarations of builtin types into the namespace. |
4b0d3cbe MM |
2968 | RID_INDEX is the index of the builtin type in the array |
2969 | RID_POINTERS. NAME is the name used when looking up the builtin | |
2970 | type. TYPE is the _TYPE node for the builtin type. */ | |
8d08fdba | 2971 | |
eaa7c03f | 2972 | void |
caf93cb0 | 2973 | record_builtin_type (enum rid rid_index, |
0cbd7506 MS |
2974 | const char* name, |
2975 | tree type) | |
8d08fdba MS |
2976 | { |
2977 | tree rname = NULL_TREE, tname = NULL_TREE; | |
a703fb38 | 2978 | tree tdecl = NULL_TREE; |
8d08fdba | 2979 | |
0e5921e8 | 2980 | if ((int) rid_index < (int) RID_MAX) |
8d08fdba MS |
2981 | rname = ridpointers[(int) rid_index]; |
2982 | if (name) | |
2983 | tname = get_identifier (name); | |
2984 | ||
4b0d3cbe MM |
2985 | /* The calls to SET_IDENTIFIER_GLOBAL_VALUE below should be |
2986 | eliminated. Built-in types should not be looked up name; their | |
2987 | names are keywords that the parser can recognize. However, there | |
2988 | is code in c-common.c that uses identifier_global_value to look | |
2989 | up built-in types by name. */ | |
8d08fdba MS |
2990 | if (tname) |
2991 | { | |
4b0d3cbe MM |
2992 | tdecl = build_decl (TYPE_DECL, tname, type); |
2993 | DECL_ARTIFICIAL (tdecl) = 1; | |
a7e8c268 | 2994 | SET_IDENTIFIER_GLOBAL_VALUE (tname, tdecl); |
8d08fdba | 2995 | } |
4b0d3cbe | 2996 | if (rname) |
8d08fdba | 2997 | { |
4b0d3cbe | 2998 | if (!tdecl) |
8d08fdba | 2999 | { |
4b0d3cbe MM |
3000 | tdecl = build_decl (TYPE_DECL, rname, type); |
3001 | DECL_ARTIFICIAL (tdecl) = 1; | |
8d08fdba | 3002 | } |
4b0d3cbe | 3003 | SET_IDENTIFIER_GLOBAL_VALUE (rname, tdecl); |
8d08fdba | 3004 | } |
4b0d3cbe MM |
3005 | |
3006 | if (!TYPE_NAME (type)) | |
3007 | TYPE_NAME (type) = tdecl; | |
47aa0df4 MM |
3008 | |
3009 | if (tdecl) | |
21d13d83 | 3010 | debug_hooks->type_decl (tdecl, 0); |
8d08fdba MS |
3011 | } |
3012 | ||
eff71ab0 | 3013 | /* Record one of the standard Java types. |
4d8a1dd6 MM |
3014 | * Declare it as having the given NAME. |
3015 | * If SIZE > 0, it is the size of one of the integral types; | |
3016 | * otherwise it is the negative of the size of one of the other types. */ | |
eff71ab0 PB |
3017 | |
3018 | static tree | |
11f6b451 | 3019 | record_builtin_java_type (const char* name, int size) |
eff71ab0 PB |
3020 | { |
3021 | tree type, decl; | |
3022 | if (size > 0) | |
3023 | type = make_signed_type (size); | |
3024 | else if (size > -32) | |
a1c65f9f | 3025 | { /* "__java_char" or ""__java_boolean". */ |
eff71ab0 PB |
3026 | type = make_unsigned_type (-size); |
3027 | /*if (size == -1) TREE_SET_CODE (type, BOOLEAN_TYPE);*/ | |
3028 | } | |
3029 | else | |
a1c65f9f | 3030 | { /* "__java_float" or ""__java_double". */ |
eff71ab0 PB |
3031 | type = make_node (REAL_TYPE); |
3032 | TYPE_PRECISION (type) = - size; | |
3033 | layout_type (type); | |
3034 | } | |
0e5921e8 | 3035 | record_builtin_type (RID_MAX, name, type); |
eff71ab0 | 3036 | decl = TYPE_NAME (type); |
e229f2cd PB |
3037 | |
3038 | /* Suppress generate debug symbol entries for these types, | |
3039 | since for normal C++ they are just clutter. | |
a1c65f9f | 3040 | However, push_lang_context undoes this if extern "Java" is seen. */ |
eff71ab0 | 3041 | DECL_IGNORED_P (decl) = 1; |
e229f2cd | 3042 | |
eff71ab0 PB |
3043 | TYPE_FOR_JAVA (type) = 1; |
3044 | return type; | |
3045 | } | |
3046 | ||
3b426391 | 3047 | /* Push a type into the namespace so that the back ends ignore it. */ |
036407f7 ML |
3048 | |
3049 | static void | |
11f6b451 | 3050 | record_unknown_type (tree type, const char* name) |
036407f7 ML |
3051 | { |
3052 | tree decl = pushdecl (build_decl (TYPE_DECL, get_identifier (name), type)); | |
3053 | /* Make sure the "unknown type" typedecl gets ignored for debug info. */ | |
3054 | DECL_IGNORED_P (decl) = 1; | |
3055 | TYPE_DECL_SUPPRESS_DEBUG (decl) = 1; | |
3056 | TYPE_SIZE (type) = TYPE_SIZE (void_type_node); | |
3057 | TYPE_ALIGN (type) = 1; | |
11cf4d18 | 3058 | TYPE_USER_ALIGN (type) = 0; |
036407f7 | 3059 | TYPE_MODE (type) = TYPE_MODE (void_type_node); |
68642fb6 | 3060 | } |
036407f7 | 3061 | |
13a44ee0 | 3062 | /* A string for which we should create an IDENTIFIER_NODE at |
d43829f9 MM |
3063 | startup. */ |
3064 | ||
3065 | typedef struct predefined_identifier | |
3066 | { | |
3067 | /* The name of the identifier. */ | |
8b60264b | 3068 | const char *const name; |
d43829f9 | 3069 | /* The place where the IDENTIFIER_NODE should be stored. */ |
8b60264b | 3070 | tree *const node; |
838dfd8a | 3071 | /* Nonzero if this is the name of a constructor or destructor. */ |
8b60264b | 3072 | const int ctor_or_dtor_p; |
d43829f9 MM |
3073 | } predefined_identifier; |
3074 | ||
3075 | /* Create all the predefined identifiers. */ | |
3076 | ||
3077 | static void | |
11f6b451 | 3078 | initialize_predefined_identifiers (void) |
d43829f9 | 3079 | { |
8b60264b | 3080 | const predefined_identifier *pid; |
d43829f9 MM |
3081 | |
3082 | /* A table of identifiers to create at startup. */ | |
8b60264b | 3083 | static const predefined_identifier predefined_identifiers[] = { |
298d6f60 MM |
3084 | { "C++", &lang_name_cplusplus, 0 }, |
3085 | { "C", &lang_name_c, 0 }, | |
3086 | { "Java", &lang_name_java, 0 }, | |
d6eec208 MM |
3087 | /* Some of these names have a trailing space so that it is |
3088 | impossible for them to conflict with names written by users. */ | |
3089 | { "__ct ", &ctor_identifier, 1 }, | |
3090 | { "__base_ctor ", &base_ctor_identifier, 1 }, | |
3091 | { "__comp_ctor ", &complete_ctor_identifier, 1 }, | |
3092 | { "__dt ", &dtor_identifier, 1 }, | |
3093 | { "__comp_dtor ", &complete_dtor_identifier, 1 }, | |
3094 | { "__base_dtor ", &base_dtor_identifier, 1 }, | |
3095 | { "__deleting_dtor ", &deleting_dtor_identifier, 1 }, | |
298d6f60 | 3096 | { IN_CHARGE_NAME, &in_charge_identifier, 0 }, |
298d6f60 MM |
3097 | { "nelts", &nelts_identifier, 0 }, |
3098 | { THIS_NAME, &this_identifier, 0 }, | |
c4372ef4 | 3099 | { VTABLE_DELTA_NAME, &delta_identifier, 0 }, |
298d6f60 | 3100 | { VTABLE_PFN_NAME, &pfn_identifier, 0 }, |
298d6f60 | 3101 | { "_vptr", &vptr_identifier, 0 }, |
3ec6bad3 | 3102 | { "__vtt_parm", &vtt_parm_identifier, 0 }, |
82a2669e | 3103 | { "::", &global_scope_name, 0 }, |
1f6e1acc | 3104 | { "std", &std_identifier, 0 }, |
298d6f60 | 3105 | { NULL, NULL, 0 } |
d43829f9 MM |
3106 | }; |
3107 | ||
3108 | for (pid = predefined_identifiers; pid->name; ++pid) | |
298d6f60 MM |
3109 | { |
3110 | *pid->node = get_identifier (pid->name); | |
3111 | if (pid->ctor_or_dtor_p) | |
3112 | IDENTIFIER_CTOR_OR_DTOR_P (*pid->node) = 1; | |
3113 | } | |
d43829f9 MM |
3114 | } |
3115 | ||
8d08fdba MS |
3116 | /* Create the predefined scalar types of C, |
3117 | and some nodes representing standard constants (0, 1, (void *)0). | |
3118 | Initialize the global binding level. | |
3119 | Make definitions for built-in primitive functions. */ | |
3120 | ||
3121 | void | |
11f6b451 | 3122 | cxx_init_decl_processing (void) |
8d08fdba | 3123 | { |
10841285 MM |
3124 | tree void_ftype; |
3125 | tree void_ftype_ptr; | |
8d08fdba | 3126 | |
8c1d6d62 | 3127 | build_common_tree_nodes (flag_signed_char, false); |
6de66680 | 3128 | |
d43829f9 MM |
3129 | /* Create all the identifiers we need. */ |
3130 | initialize_predefined_identifiers (); | |
8d08fdba | 3131 | |
9cd64686 MM |
3132 | /* Create the global variables. */ |
3133 | push_to_top_level (); | |
8012c983 | 3134 | |
82a2669e | 3135 | current_function_decl = NULL_TREE; |
1ec57cf0 | 3136 | current_binding_level = NULL; |
a1c65f9f | 3137 | /* Enter the global namespace. */ |
50bc768d | 3138 | gcc_assert (global_namespace == NULL_TREE); |
82a2669e | 3139 | global_namespace = build_lang_decl (NAMESPACE_DECL, global_scope_name, |
0cbd7506 | 3140 | void_type_node); |
b9e75696 | 3141 | TREE_PUBLIC (global_namespace) = 1; |
ac20c67a | 3142 | begin_scope (sk_namespace, global_namespace); |
82a2669e | 3143 | |
30394414 JM |
3144 | current_lang_name = NULL_TREE; |
3145 | ||
bccd95ae | 3146 | /* Adjust various flags based on command-line settings. */ |
4a386498 | 3147 | if (!flag_permissive) |
2642b9bf | 3148 | flag_pedantic_errors = 1; |
bccd95ae | 3149 | if (!flag_no_inline) |
b850de4f MM |
3150 | { |
3151 | flag_inline_trees = 1; | |
3152 | flag_no_inline = 1; | |
3153 | } | |
acc72c37 | 3154 | if (flag_inline_functions) |
39afeb1a | 3155 | flag_inline_trees = 2; |
830fcda8 | 3156 | |
f963b5d9 RS |
3157 | /* Force minimum function alignment if using the least significant |
3158 | bit of function pointers to store the virtual bit. */ | |
3159 | if (TARGET_PTRMEMFUNC_VBIT_LOCATION == ptrmemfunc_vbit_in_pfn | |
3160 | && force_align_functions_log < 1) | |
3161 | force_align_functions_log = 1; | |
3162 | ||
8d08fdba MS |
3163 | /* Initially, C. */ |
3164 | current_lang_name = lang_name_c; | |
3165 | ||
6bcedb4e | 3166 | /* Create the `std' namespace. */ |
1dbb6023 NS |
3167 | push_namespace (std_identifier); |
3168 | std_node = current_namespace; | |
3169 | pop_namespace (); | |
5362b086 | 3170 | |
eaa7c03f | 3171 | c_common_nodes_and_builtins (); |
37c46b43 | 3172 | |
4d8a1dd6 MM |
3173 | java_byte_type_node = record_builtin_java_type ("__java_byte", 8); |
3174 | java_short_type_node = record_builtin_java_type ("__java_short", 16); | |
3175 | java_int_type_node = record_builtin_java_type ("__java_int", 32); | |
3176 | java_long_type_node = record_builtin_java_type ("__java_long", 64); | |
3177 | java_float_type_node = record_builtin_java_type ("__java_float", -32); | |
3178 | java_double_type_node = record_builtin_java_type ("__java_double", -64); | |
3179 | java_char_type_node = record_builtin_java_type ("__java_char", -16); | |
3180 | java_boolean_type_node = record_builtin_java_type ("__java_boolean", -1); | |
eff71ab0 | 3181 | |
7d60be94 NS |
3182 | integer_two_node = build_int_cst (NULL_TREE, 2); |
3183 | integer_three_node = build_int_cst (NULL_TREE, 3); | |
8d08fdba | 3184 | |
255512c1 | 3185 | record_builtin_type (RID_BOOL, "bool", boolean_type_node); |
de7df9eb JM |
3186 | truthvalue_type_node = boolean_type_node; |
3187 | truthvalue_false_node = boolean_false_node; | |
3188 | truthvalue_true_node = boolean_true_node; | |
2986ae00 | 3189 | |
4cc1d462 | 3190 | empty_except_spec = build_tree_list (NULL_TREE, NULL_TREE); |
5fd8e536 JM |
3191 | |
3192 | #if 0 | |
3e411c3f | 3193 | record_builtin_type (RID_MAX, NULL, string_type_node); |
5fd8e536 JM |
3194 | #endif |
3195 | ||
1f84ec23 MM |
3196 | delta_type_node = ptrdiff_type_node; |
3197 | vtable_index_type = ptrdiff_type_node; | |
c7e266a6 | 3198 | |
3ec6bad3 | 3199 | vtt_parm_type = build_pointer_type (const_ptr_type_node); |
10841285 MM |
3200 | void_ftype = build_function_type (void_type_node, void_list_node); |
3201 | void_ftype_ptr = build_function_type (void_type_node, | |
3202 | tree_cons (NULL_TREE, | |
caf93cb0 | 3203 | ptr_type_node, |
10841285 | 3204 | void_list_node)); |
824b9a4c | 3205 | void_ftype_ptr |
4cc1d462 | 3206 | = build_exception_variant (void_ftype_ptr, empty_except_spec); |
8d08fdba | 3207 | |
8d08fdba MS |
3208 | /* C++ extensions */ |
3209 | ||
3210 | unknown_type_node = make_node (UNKNOWN_TYPE); | |
036407f7 ML |
3211 | record_unknown_type (unknown_type_node, "unknown type"); |
3212 | ||
8d08fdba MS |
3213 | /* Indirecting an UNKNOWN_TYPE node yields an UNKNOWN_TYPE node. */ |
3214 | TREE_TYPE (unknown_type_node) = unknown_type_node; | |
a6967cc0 | 3215 | |
a6967cc0 JM |
3216 | /* Looking up TYPE_POINTER_TO and TYPE_REFERENCE_TO yield the same |
3217 | result. */ | |
8d08fdba MS |
3218 | TYPE_POINTER_TO (unknown_type_node) = unknown_type_node; |
3219 | TYPE_REFERENCE_TO (unknown_type_node) = unknown_type_node; | |
3220 | ||
c4372ef4 NS |
3221 | { |
3222 | /* Make sure we get a unique function type, so we can give | |
3223 | its pointer type a name. (This wins for gdb.) */ | |
3224 | tree vfunc_type = make_node (FUNCTION_TYPE); | |
3225 | TREE_TYPE (vfunc_type) = integer_type_node; | |
3226 | TYPE_ARG_TYPES (vfunc_type) = NULL_TREE; | |
3227 | layout_type (vfunc_type); | |
3228 | ||
3229 | vtable_entry_type = build_pointer_type (vfunc_type); | |
3230 | } | |
0e5921e8 | 3231 | record_builtin_type (RID_MAX, VTBL_PTR_TYPE, vtable_entry_type); |
8d08fdba | 3232 | |
8d08fdba | 3233 | vtbl_type_node |
52bf7d5d | 3234 | = build_cplus_array_type (vtable_entry_type, NULL_TREE); |
8d08fdba | 3235 | layout_type (vtbl_type_node); |
91063b51 | 3236 | vtbl_type_node = build_qualified_type (vtbl_type_node, TYPE_QUAL_CONST); |
3e411c3f | 3237 | record_builtin_type (RID_MAX, NULL, vtbl_type_node); |
849da744 MM |
3238 | vtbl_ptr_type_node = build_pointer_type (vtable_entry_type); |
3239 | layout_type (vtbl_ptr_type_node); | |
3e411c3f | 3240 | record_builtin_type (RID_MAX, NULL, vtbl_ptr_type_node); |
8d08fdba | 3241 | |
1f84ec23 MM |
3242 | push_namespace (get_identifier ("__cxxabiv1")); |
3243 | abi_node = current_namespace; | |
3244 | pop_namespace (); | |
6633d636 | 3245 | |
2c73f9f5 | 3246 | global_type_node = make_node (LANG_TYPE); |
036407f7 | 3247 | record_unknown_type (global_type_node, "global type"); |
2c73f9f5 | 3248 | |
db5ae43f MS |
3249 | /* Now, C++. */ |
3250 | current_lang_name = lang_name_cplusplus; | |
8d08fdba | 3251 | |
ced78d8b | 3252 | { |
4b0d3cbe MM |
3253 | tree bad_alloc_id; |
3254 | tree bad_alloc_type_node; | |
3255 | tree bad_alloc_decl; | |
3256 | tree newtype, deltype; | |
10841285 MM |
3257 | tree ptr_ftype_sizetype; |
3258 | ||
1dbb6023 | 3259 | push_namespace (std_identifier); |
4b0d3cbe MM |
3260 | bad_alloc_id = get_identifier ("bad_alloc"); |
3261 | bad_alloc_type_node = make_aggr_type (RECORD_TYPE); | |
3262 | TYPE_CONTEXT (bad_alloc_type_node) = current_namespace; | |
caf93cb0 | 3263 | bad_alloc_decl |
4b0d3cbe MM |
3264 | = create_implicit_typedef (bad_alloc_id, bad_alloc_type_node); |
3265 | DECL_CONTEXT (bad_alloc_decl) = current_namespace; | |
3266 | TYPE_STUB_DECL (bad_alloc_type_node) = bad_alloc_decl; | |
1dbb6023 | 3267 | pop_namespace (); |
caf93cb0 EC |
3268 | |
3269 | ptr_ftype_sizetype | |
10841285 MM |
3270 | = build_function_type (ptr_type_node, |
3271 | tree_cons (NULL_TREE, | |
c9f8536c | 3272 | size_type_node, |
10841285 | 3273 | void_list_node)); |
2c73f9f5 | 3274 | newtype = build_exception_variant |
0ba8a114 NS |
3275 | (ptr_ftype_sizetype, add_exception_specifier |
3276 | (NULL_TREE, bad_alloc_type_node, -1)); | |
4cc1d462 | 3277 | deltype = build_exception_variant (void_ftype_ptr, empty_except_spec); |
596ea4e5 AS |
3278 | push_cp_library_fn (NEW_EXPR, newtype); |
3279 | push_cp_library_fn (VEC_NEW_EXPR, newtype); | |
3280 | global_delete_fndecl = push_cp_library_fn (DELETE_EXPR, deltype); | |
3281 | push_cp_library_fn (VEC_DELETE_EXPR, deltype); | |
ced78d8b | 3282 | } |
8d08fdba MS |
3283 | |
3284 | abort_fndecl | |
1f84ec23 | 3285 | = build_library_fn_ptr ("__cxa_pure_virtual", void_ftype); |
8d08fdba | 3286 | |
8d08fdba MS |
3287 | /* Perform other language dependent initializations. */ |
3288 | init_class_processing (); | |
db48b831 | 3289 | init_rtti_processing (); |
8d08fdba | 3290 | |
6467930b | 3291 | if (flag_exceptions) |
8d2733ca | 3292 | init_exception_processing (); |
9e9ff709 | 3293 | |
7fcdf4c2 | 3294 | if (! supports_one_only ()) |
72b7eeff | 3295 | flag_weak = 0; |
8d08fdba | 3296 | |
2ce07e2d | 3297 | make_fname_decl = cp_make_fname_decl; |
0ba8a114 | 3298 | start_fname_decls (); |
8d08fdba | 3299 | |
e9a25f70 | 3300 | /* Show we use EH for cleanups. */ |
6de9cd9a DN |
3301 | if (flag_exceptions) |
3302 | using_eh_for_cleanups (); | |
62c154ed JM |
3303 | } |
3304 | ||
0ba8a114 | 3305 | /* Generate an initializer for a function naming variable from |
bb885938 | 3306 | NAME. NAME may be NULL, to indicate a dependent name. TYPE_P is |
f4f206f4 | 3307 | filled in with the type of the init. */ |
0ba8a114 NS |
3308 | |
3309 | tree | |
bb885938 | 3310 | cp_fname_init (const char* name, tree *type_p) |
0ba8a114 NS |
3311 | { |
3312 | tree domain = NULL_TREE; | |
3313 | tree type; | |
3314 | tree init = NULL_TREE; | |
3315 | size_t length = 0; | |
3316 | ||
3317 | if (name) | |
3318 | { | |
3319 | length = strlen (name); | |
3320 | domain = build_index_type (size_int (length)); | |
3321 | init = build_string (length + 1, name); | |
3322 | } | |
caf93cb0 | 3323 | |
0ba8a114 NS |
3324 | type = build_qualified_type (char_type_node, TYPE_QUAL_CONST); |
3325 | type = build_cplus_array_type (type, domain); | |
3326 | ||
bb885938 | 3327 | *type_p = type; |
caf93cb0 | 3328 | |
0ba8a114 NS |
3329 | if (init) |
3330 | TREE_TYPE (init) = type; | |
3331 | else | |
bb885938 | 3332 | init = error_mark_node; |
caf93cb0 | 3333 | |
0ba8a114 NS |
3334 | return init; |
3335 | } | |
3336 | ||
2ce07e2d NS |
3337 | /* Create the VAR_DECL for __FUNCTION__ etc. ID is the name to give the |
3338 | decl, NAME is the initialization string and TYPE_DEP indicates whether | |
3339 | NAME depended on the type of the function. We make use of that to detect | |
0ba8a114 | 3340 | __PRETTY_FUNCTION__ inside a template fn. This is being done |
a692ad2e | 3341 | lazily at the point of first use, so we mustn't push the decl now. */ |
2ce07e2d NS |
3342 | |
3343 | static tree | |
11f6b451 | 3344 | cp_make_fname_decl (tree id, int type_dep) |
2ce07e2d | 3345 | { |
83182544 | 3346 | const char *const name = (type_dep && processing_template_decl |
e913996d | 3347 | ? NULL : fname_as_string (type_dep)); |
bb885938 NS |
3348 | tree type; |
3349 | tree init = cp_fname_init (name, &type); | |
3350 | tree decl = build_decl (VAR_DECL, id, type); | |
2ce07e2d | 3351 | |
9e6f2e7d AH |
3352 | if (name) |
3353 | free ((char *) name); | |
3354 | ||
6cce57b0 | 3355 | /* As we're using pushdecl_with_scope, we must set the context. */ |
0ba8a114 NS |
3356 | DECL_CONTEXT (decl) = current_function_decl; |
3357 | DECL_PRETTY_FUNCTION_P (decl) = type_dep; | |
caf93cb0 | 3358 | |
2ce07e2d NS |
3359 | TREE_STATIC (decl) = 1; |
3360 | TREE_READONLY (decl) = 1; | |
2ce07e2d | 3361 | DECL_ARTIFICIAL (decl) = 1; |
caf93cb0 | 3362 | |
0ba8a114 | 3363 | TREE_USED (decl) = 1; |
5362b086 | 3364 | |
6cce57b0 JM |
3365 | if (current_function_decl) |
3366 | { | |
3367 | struct cp_binding_level *b = current_binding_level; | |
a7e8c268 | 3368 | while (b->level_chain->kind != sk_function_parms) |
6cce57b0 | 3369 | b = b->level_chain; |
d63d5d0c | 3370 | pushdecl_with_scope (decl, b, /*is_friend=*/false); |
3db45ab5 | 3371 | cp_finish_decl (decl, init, /*init_const_expr_p=*/false, NULL_TREE, |
d174af6c | 3372 | LOOKUP_ONLYCONVERTING); |
e913996d | 3373 | } |
ad16ae7f MM |
3374 | else |
3375 | pushdecl_top_level_and_finish (decl, init); | |
caf93cb0 | 3376 | |
2ce07e2d NS |
3377 | return decl; |
3378 | } | |
3379 | ||
c79efc4d RÁE |
3380 | static tree |
3381 | builtin_function_1 (tree decl, tree context) | |
3382 | { | |
3383 | tree id = DECL_NAME (decl); | |
3384 | const char *name = IDENTIFIER_POINTER (id); | |
8d08fdba | 3385 | |
c79efc4d | 3386 | retrofit_lang_decl (decl); |
0c11ada6 | 3387 | |
c79efc4d RÁE |
3388 | /* All nesting of C++ functions is lexical; there is never a "static |
3389 | chain" in the sense of GNU C nested functions. */ | |
3390 | DECL_NO_STATIC_CHAIN (decl) = 1; | |
3391 | ||
3392 | DECL_ARTIFICIAL (decl) = 1; | |
3393 | SET_OVERLOADED_OPERATOR_CODE (decl, ERROR_MARK); | |
3394 | SET_DECL_LANGUAGE (decl, lang_c); | |
3395 | /* Runtime library routines are, by definition, available in an | |
3396 | external shared object. */ | |
3397 | DECL_VISIBILITY (decl) = VISIBILITY_DEFAULT; | |
3398 | DECL_VISIBILITY_SPECIFIED (decl) = 1; | |
8d08fdba | 3399 | |
d52e4867 | 3400 | DECL_CONTEXT (decl) = context; |
12a22e76 | 3401 | |
6bcedb4e | 3402 | pushdecl (decl); |
6bcedb4e | 3403 | |
d63d5d0c ILT |
3404 | /* A function in the user's namespace should have an explicit |
3405 | declaration before it is used. Mark the built-in function as | |
3406 | anticipated but not actually declared. */ | |
935d1834 ZW |
3407 | if (name[0] != '_' || name[1] != '_') |
3408 | DECL_ANTICIPATED (decl) = 1; | |
3409 | ||
8d08fdba MS |
3410 | return decl; |
3411 | } | |
7f4edbcb | 3412 | |
d52e4867 | 3413 | tree |
c79efc4d | 3414 | cxx_builtin_function (tree decl) |
d52e4867 | 3415 | { |
c79efc4d RÁE |
3416 | tree id = DECL_NAME (decl); |
3417 | const char *name = IDENTIFIER_POINTER (id); | |
d52e4867 RS |
3418 | /* All builtins that don't begin with an '_' should additionally |
3419 | go in the 'std' namespace. */ | |
3420 | if (name[0] != '_') | |
3421 | { | |
e5b44dfb | 3422 | tree decl2 = copy_node(decl); |
d52e4867 | 3423 | push_namespace (std_identifier); |
e5b44dfb | 3424 | builtin_function_1 (decl2, std_node); |
d52e4867 RS |
3425 | pop_namespace (); |
3426 | } | |
3427 | ||
e5b44dfb | 3428 | return builtin_function_1 (decl, NULL_TREE); |
d52e4867 RS |
3429 | } |
3430 | ||
0c11ada6 JM |
3431 | /* Generate a FUNCTION_DECL with the typical flags for a runtime library |
3432 | function. Not called directly. */ | |
3433 | ||
3434 | static tree | |
11f6b451 | 3435 | build_library_fn_1 (tree name, enum tree_code operator_code, tree type) |
0c11ada6 JM |
3436 | { |
3437 | tree fn = build_lang_decl (FUNCTION_DECL, name, type); | |
3438 | DECL_EXTERNAL (fn) = 1; | |
3439 | TREE_PUBLIC (fn) = 1; | |
3440 | DECL_ARTIFICIAL (fn) = 1; | |
596ea4e5 | 3441 | SET_OVERLOADED_OPERATOR_CODE (fn, operator_code); |
5d2ed28c | 3442 | SET_DECL_LANGUAGE (fn, lang_c); |
73a8adb6 MM |
3443 | /* Runtime library routines are, by definition, available in an |
3444 | external shared object. */ | |
3445 | DECL_VISIBILITY (fn) = VISIBILITY_DEFAULT; | |
3446 | DECL_VISIBILITY_SPECIFIED (fn) = 1; | |
0c11ada6 JM |
3447 | return fn; |
3448 | } | |
c2a37c55 | 3449 | |
0c11ada6 JM |
3450 | /* Returns the _DECL for a library function with C linkage. |
3451 | We assume that such functions never throw; if this is incorrect, | |
3452 | callers should unset TREE_NOTHROW. */ | |
c2a37c55 | 3453 | |
7f4edbcb | 3454 | tree |
11f6b451 | 3455 | build_library_fn (tree name, tree type) |
0c11ada6 | 3456 | { |
f59d2aad RH |
3457 | tree fn = build_library_fn_1 (name, ERROR_MARK, type); |
3458 | TREE_NOTHROW (fn) = 1; | |
3459 | return fn; | |
0c11ada6 JM |
3460 | } |
3461 | ||
3462 | /* Returns the _DECL for a library function with C++ linkage. */ | |
3463 | ||
596ea4e5 | 3464 | static tree |
11f6b451 | 3465 | build_cp_library_fn (tree name, enum tree_code operator_code, tree type) |
0c11ada6 | 3466 | { |
596ea4e5 | 3467 | tree fn = build_library_fn_1 (name, operator_code, type); |
0c11ada6 | 3468 | TREE_NOTHROW (fn) = TYPE_NOTHROW_P (type); |
6bbf1598 | 3469 | DECL_CONTEXT (fn) = FROB_CONTEXT (current_namespace); |
5d2ed28c | 3470 | SET_DECL_LANGUAGE (fn, lang_cplusplus); |
0c11ada6 JM |
3471 | return fn; |
3472 | } | |
3473 | ||
3474 | /* Like build_library_fn, but takes a C string instead of an | |
3475 | IDENTIFIER_NODE. */ | |
3476 | ||
3477 | tree | |
11f6b451 | 3478 | build_library_fn_ptr (const char* name, tree type) |
7f4edbcb | 3479 | { |
0c11ada6 JM |
3480 | return build_library_fn (get_identifier (name), type); |
3481 | } | |
3482 | ||
3483 | /* Like build_cp_library_fn, but takes a C string instead of an | |
3484 | IDENTIFIER_NODE. */ | |
3485 | ||
3486 | tree | |
11f6b451 | 3487 | build_cp_library_fn_ptr (const char* name, tree type) |
0c11ada6 | 3488 | { |
596ea4e5 | 3489 | return build_cp_library_fn (get_identifier (name), ERROR_MARK, type); |
0c11ada6 JM |
3490 | } |
3491 | ||
3492 | /* Like build_library_fn, but also pushes the function so that we will | |
3493 | be able to find it via IDENTIFIER_GLOBAL_VALUE. */ | |
3494 | ||
3495 | tree | |
11f6b451 | 3496 | push_library_fn (tree name, tree type) |
0c11ada6 JM |
3497 | { |
3498 | tree fn = build_library_fn (name, type); | |
3499 | pushdecl_top_level (fn); | |
3500 | return fn; | |
3501 | } | |
3502 | ||
3503 | /* Like build_cp_library_fn, but also pushes the function so that it | |
3504 | will be found by normal lookup. */ | |
3505 | ||
596ea4e5 | 3506 | static tree |
11f6b451 | 3507 | push_cp_library_fn (enum tree_code operator_code, tree type) |
0c11ada6 | 3508 | { |
5362b086 | 3509 | tree fn = build_cp_library_fn (ansi_opname (operator_code), |
596ea4e5 AS |
3510 | operator_code, |
3511 | type); | |
0c11ada6 JM |
3512 | pushdecl (fn); |
3513 | return fn; | |
3514 | } | |
3515 | ||
3516 | /* Like push_library_fn, but takes a TREE_LIST of parm types rather than | |
3517 | a FUNCTION_TYPE. */ | |
3518 | ||
3519 | tree | |
11f6b451 | 3520 | push_void_library_fn (tree name, tree parmtypes) |
0c11ada6 JM |
3521 | { |
3522 | tree type = build_function_type (void_type_node, parmtypes); | |
3523 | return push_library_fn (name, type); | |
3524 | } | |
3525 | ||
cf74fb86 | 3526 | /* Like push_library_fn, but also note that this function throws |
0c11ada6 JM |
3527 | and does not return. Used for __throw_foo and the like. */ |
3528 | ||
3529 | tree | |
11f6b451 | 3530 | push_throw_library_fn (tree name, tree type) |
0c11ada6 | 3531 | { |
cf74fb86 | 3532 | tree fn = push_library_fn (name, type); |
0c11ada6 JM |
3533 | TREE_THIS_VOLATILE (fn) = 1; |
3534 | TREE_NOTHROW (fn) = 0; | |
3535 | return fn; | |
7f4edbcb | 3536 | } |
8d08fdba | 3537 | \f |
61a127b3 MM |
3538 | /* When we call finish_struct for an anonymous union, we create |
3539 | default copy constructors and such. But, an anonymous union | |
3540 | shouldn't have such things; this function undoes the damage to the | |
3541 | anonymous union type T. | |
3542 | ||
3543 | (The reason that we create the synthesized methods is that we don't | |
3544 | distinguish `union { int i; }' from `typedef union { int i; } U'. | |
3545 | The first is an anonymous union; the second is just an ordinary | |
3546 | union type.) */ | |
3547 | ||
3548 | void | |
11f6b451 | 3549 | fixup_anonymous_aggr (tree t) |
61a127b3 MM |
3550 | { |
3551 | tree *q; | |
3552 | ||
f4f206f4 | 3553 | /* Wipe out memory of synthesized methods. */ |
61a127b3 MM |
3554 | TYPE_HAS_CONSTRUCTOR (t) = 0; |
3555 | TYPE_HAS_DEFAULT_CONSTRUCTOR (t) = 0; | |
3556 | TYPE_HAS_INIT_REF (t) = 0; | |
3557 | TYPE_HAS_CONST_INIT_REF (t) = 0; | |
3558 | TYPE_HAS_ASSIGN_REF (t) = 0; | |
61a127b3 MM |
3559 | TYPE_HAS_CONST_ASSIGN_REF (t) = 0; |
3560 | ||
3561 | /* Splice the implicitly generated functions out of the TYPE_METHODS | |
3562 | list. */ | |
3563 | q = &TYPE_METHODS (t); | |
3564 | while (*q) | |
3565 | { | |
3566 | if (DECL_ARTIFICIAL (*q)) | |
3567 | *q = TREE_CHAIN (*q); | |
3568 | else | |
3569 | q = &TREE_CHAIN (*q); | |
3570 | } | |
3571 | ||
cab1f180 | 3572 | /* ISO C++ 9.5.3. Anonymous unions may not have function members. */ |
61a127b3 | 3573 | if (TYPE_METHODS (t)) |
ddd2d57e RH |
3574 | error ("%Jan anonymous union cannot have function members", |
3575 | TYPE_MAIN_DECL (t)); | |
a1c2b86d JJ |
3576 | |
3577 | /* Anonymous aggregates cannot have fields with ctors, dtors or complex | |
3578 | assignment operators (because they cannot have these methods themselves). | |
3579 | For anonymous unions this is already checked because they are not allowed | |
3580 | in any union, otherwise we have to check it. */ | |
3581 | if (TREE_CODE (t) != UNION_TYPE) | |
3582 | { | |
3583 | tree field, type; | |
3584 | ||
3585 | for (field = TYPE_FIELDS (t); field; field = TREE_CHAIN (field)) | |
3586 | if (TREE_CODE (field) == FIELD_DECL) | |
3587 | { | |
3588 | type = TREE_TYPE (field); | |
3589 | if (CLASS_TYPE_P (type)) | |
3590 | { | |
0cbd7506 | 3591 | if (TYPE_NEEDS_CONSTRUCTING (type)) |
dee15844 JM |
3592 | error ("member %q+#D with constructor not allowed " |
3593 | "in anonymous aggregate", field); | |
a1c2b86d | 3594 | if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type)) |
dee15844 JM |
3595 | error ("member %q+#D with destructor not allowed " |
3596 | "in anonymous aggregate", field); | |
a1c2b86d | 3597 | if (TYPE_HAS_COMPLEX_ASSIGN_REF (type)) |
dee15844 JM |
3598 | error ("member %q+#D with copy assignment operator " |
3599 | "not allowed in anonymous aggregate", field); | |
a1c2b86d JJ |
3600 | } |
3601 | } | |
3602 | } | |
61a127b3 MM |
3603 | } |
3604 | ||
72a93143 | 3605 | /* Make sure that a declaration with no declarator is well-formed, i.e. |
a723baf1 | 3606 | just declares a tagged type or anonymous union. |
8d08fdba | 3607 | |
a723baf1 | 3608 | Returns the type declared; or NULL_TREE if none. */ |
8d08fdba | 3609 | |
72a93143 | 3610 | tree |
62d1db17 | 3611 | check_tag_decl (cp_decl_specifier_seq *declspecs) |
8d08fdba | 3612 | { |
62d1db17 MM |
3613 | int saw_friend = declspecs->specs[(int)ds_friend] != 0; |
3614 | int saw_typedef = declspecs->specs[(int)ds_typedef] != 0; | |
a723baf1 MM |
3615 | /* If a class, struct, or enum type is declared by the DECLSPECS |
3616 | (i.e, if a class-specifier, enum-specifier, or non-typename | |
3617 | elaborated-type-specifier appears in the DECLSPECS), | |
3618 | DECLARED_TYPE is set to the corresponding type. */ | |
3619 | tree declared_type = NULL_TREE; | |
3620 | bool error_p = false; | |
8d08fdba | 3621 | |
62d1db17 | 3622 | if (declspecs->multiple_types_p) |
72a93143 | 3623 | error ("multiple types in one declaration"); |
62d1db17 MM |
3624 | else if (declspecs->redefined_builtin_type) |
3625 | { | |
3626 | if (!in_system_header) | |
82b5e52a | 3627 | pedwarn ("redeclaration of C++ built-in type %qT", |
62d1db17 MM |
3628 | declspecs->redefined_builtin_type); |
3629 | return NULL_TREE; | |
3630 | } | |
7e2067ca | 3631 | |
c827f22f MM |
3632 | if (declspecs->type |
3633 | && TYPE_P (declspecs->type) | |
caf93cb0 | 3634 | && ((TREE_CODE (declspecs->type) != TYPENAME_TYPE |
62d1db17 MM |
3635 | && IS_AGGR_TYPE (declspecs->type)) |
3636 | || TREE_CODE (declspecs->type) == ENUMERAL_TYPE)) | |
3637 | declared_type = declspecs->type; | |
3638 | else if (declspecs->type == error_mark_node) | |
3639 | error_p = true; | |
a723baf1 | 3640 | if (declared_type == NULL_TREE && ! saw_friend && !error_p) |
7e2067ca | 3641 | pedwarn ("declaration does not declare anything"); |
1951a1b6 | 3642 | /* Check for an anonymous union. */ |
a723baf1 MM |
3643 | else if (declared_type && IS_AGGR_TYPE_CODE (TREE_CODE (declared_type)) |
3644 | && TYPE_ANONYMOUS_P (declared_type)) | |
0dd3962d | 3645 | { |
e8186ecf | 3646 | /* 7/3 In a simple-declaration, the optional init-declarator-list |
0cbd7506 MS |
3647 | can be omitted only when declaring a class (clause 9) or |
3648 | enumeration (7.2), that is, when the decl-specifier-seq contains | |
3649 | either a class-specifier, an elaborated-type-specifier with | |
3650 | a class-key (9.1), or an enum-specifier. In these cases and | |
3651 | whenever a class-specifier or enum-specifier is present in the | |
3652 | decl-specifier-seq, the identifiers in these specifiers are among | |
3653 | the names being declared by the declaration (as class-name, | |
3654 | enum-names, or enumerators, depending on the syntax). In such | |
3655 | cases, and except for the declaration of an unnamed bit-field (9.6), | |
3656 | the decl-specifier-seq shall introduce one or more names into the | |
3657 | program, or shall redeclare a name introduced by a previous | |
3658 | declaration. [Example: | |
3659 | enum { }; // ill-formed | |
3660 | typedef class { }; // ill-formed | |
3661 | --end example] */ | |
e8186ecf | 3662 | if (saw_typedef) |
0cbd7506 MS |
3663 | { |
3664 | error ("missing type-name in typedef-declaration"); | |
3665 | return NULL_TREE; | |
3666 | } | |
0dd3962d | 3667 | /* Anonymous unions are objects, so they can have specifiers. */; |
a723baf1 | 3668 | SET_ANON_AGGR_TYPE_P (declared_type); |
6bdb8141 | 3669 | |
caf93cb0 | 3670 | if (TREE_CODE (declared_type) != UNION_TYPE && pedantic |
a723baf1 | 3671 | && !in_system_header) |
6bdb8141 | 3672 | pedwarn ("ISO C++ prohibits anonymous structs"); |
0dd3962d JM |
3673 | } |
3674 | ||
62d1db17 | 3675 | else |
8d08fdba | 3676 | { |
62d1db17 MM |
3677 | if (declspecs->specs[(int)ds_inline] |
3678 | || declspecs->specs[(int)ds_virtual]) | |
2d01edd7 | 3679 | error ("%qs can only be specified for functions", |
caf93cb0 | 3680 | declspecs->specs[(int)ds_inline] |
62d1db17 MM |
3681 | ? "inline" : "virtual"); |
3682 | else if (saw_friend | |
caf93cb0 | 3683 | && (!current_class_type |
62d1db17 | 3684 | || current_scope () != current_class_type)) |
2d01edd7 | 3685 | error ("%<friend%> can only be specified inside a class"); |
62d1db17 | 3686 | else if (declspecs->specs[(int)ds_explicit]) |
2d01edd7 | 3687 | error ("%<explicit%> can only be specified for constructors"); |
62d1db17 MM |
3688 | else if (declspecs->storage_class) |
3689 | error ("a storage class can only be specified for objects " | |
3690 | "and functions"); | |
3691 | else if (declspecs->specs[(int)ds_const] | |
3692 | || declspecs->specs[(int)ds_volatile] | |
3693 | || declspecs->specs[(int)ds_restrict] | |
3694 | || declspecs->specs[(int)ds_thread]) | |
3695 | error ("qualifiers can only be specified for objects " | |
3696 | "and functions"); | |
72a93143 | 3697 | } |
8d08fdba | 3698 | |
a723baf1 | 3699 | return declared_type; |
72a93143 JM |
3700 | } |
3701 | ||
3702 | /* Called when a declaration is seen that contains no names to declare. | |
3703 | If its type is a reference to a structure, union or enum inherited | |
3704 | from a containing scope, shadow that tag name for the current scope | |
3705 | with a forward reference. | |
3706 | If its type defines a new named structure or union | |
3707 | or defines an enum, it is valid but we need not do anything here. | |
3708 | Otherwise, it is an error. | |
3709 | ||
3710 | C++: may have to grok the declspecs to learn about static, | |
caf93cb0 | 3711 | complain for anonymous unions. |
72a93143 | 3712 | |
a723baf1 MM |
3713 | Returns the TYPE declared -- or NULL_TREE if none. */ |
3714 | ||
3715 | tree | |
62d1db17 | 3716 | shadow_tag (cp_decl_specifier_seq *declspecs) |
72a93143 JM |
3717 | { |
3718 | tree t = check_tag_decl (declspecs); | |
3719 | ||
a723baf1 MM |
3720 | if (!t) |
3721 | return NULL_TREE; | |
3722 | ||
3cabd8f9 MA |
3723 | if (declspecs->attributes) |
3724 | { | |
dee15844 JM |
3725 | warning (0, "attribute ignored in declaration of %q+#T", t); |
3726 | warning (0, "attribute for %q+#T must follow the %qs keyword", | |
3727 | t, class_key_or_enum_as_string (t)); | |
3cabd8f9 MA |
3728 | |
3729 | } | |
3730 | ||
d2a8ac2c LM |
3731 | if (maybe_process_partial_specialization (t) == error_mark_node) |
3732 | return NULL_TREE; | |
72a93143 JM |
3733 | |
3734 | /* This is where the variables in an anonymous union are | |
3735 | declared. An anonymous union declaration looks like: | |
3736 | union { ... } ; | |
3737 | because there is no declarator after the union, the parser | |
3738 | sends that declaration here. */ | |
a723baf1 | 3739 | if (ANON_AGGR_TYPE_P (t)) |
72a93143 | 3740 | { |
6bdb8141 | 3741 | fixup_anonymous_aggr (t); |
72a93143 JM |
3742 | |
3743 | if (TYPE_FIELDS (t)) | |
3744 | { | |
caf93cb0 | 3745 | tree decl = grokdeclarator (/*declarator=*/NULL, |
058b15c1 | 3746 | declspecs, NORMAL, 0, NULL); |
72a93143 JM |
3747 | finish_anon_union (decl); |
3748 | } | |
8d08fdba | 3749 | } |
a723baf1 MM |
3750 | |
3751 | return t; | |
8d08fdba MS |
3752 | } |
3753 | \f | |
3754 | /* Decode a "typename", such as "int **", returning a ..._TYPE node. */ | |
3755 | ||
3756 | tree | |
caf93cb0 | 3757 | groktypename (cp_decl_specifier_seq *type_specifiers, |
62d1db17 | 3758 | const cp_declarator *declarator) |
8d08fdba | 3759 | { |
62d1db17 | 3760 | tree attrs; |
98884b26 | 3761 | tree type; |
62d1db17 MM |
3762 | attrs = type_specifiers->attributes; |
3763 | type_specifiers->attributes = NULL_TREE; | |
3764 | type = grokdeclarator (declarator, type_specifiers, TYPENAME, 0, &attrs); | |
98884b26 JM |
3765 | if (attrs) |
3766 | cplus_decl_attributes (&type, attrs, 0); | |
3767 | return type; | |
8d08fdba MS |
3768 | } |
3769 | ||
3770 | /* Decode a declarator in an ordinary declaration or data definition. | |
3771 | This is called as soon as the type information and variable name | |
3772 | have been parsed, before parsing the initializer if any. | |
3773 | Here we create the ..._DECL node, fill in its type, | |
3774 | and put it on the list of decls for the current context. | |
3775 | The ..._DECL node is returned as the value. | |
3776 | ||
3777 | Exception: for arrays where the length is not specified, | |
82580166 | 3778 | the type is left null, to be filled in by `cp_finish_decl'. |
8d08fdba MS |
3779 | |
3780 | Function definitions do not come here; they go to start_function | |
3781 | instead. However, external and forward declarations of functions | |
3782 | do go through here. Structure field declarations are done by | |
3783 | grokfield and not through here. */ | |
3784 | ||
8d08fdba | 3785 | tree |
caf93cb0 | 3786 | start_decl (const cp_declarator *declarator, |
62d1db17 | 3787 | cp_decl_specifier_seq *declspecs, |
0cbd7506 MS |
3788 | int initialized, |
3789 | tree attributes, | |
3790 | tree prefix_attributes, | |
4514aa8c | 3791 | tree *pushed_scope_p) |
8d08fdba | 3792 | { |
59387d2e | 3793 | tree decl; |
926ce8bd | 3794 | tree type, tem; |
8d08fdba | 3795 | tree context; |
8d08fdba | 3796 | |
4514aa8c | 3797 | *pushed_scope_p = NULL_TREE; |
c8094d83 | 3798 | |
e23bd218 IR |
3799 | /* An object declared as __attribute__((deprecated)) suppresses |
3800 | warnings of uses of other deprecated items. */ | |
3801 | if (lookup_attribute ("deprecated", attributes)) | |
3802 | deprecated_state = DEPRECATED_SUPPRESS; | |
3803 | ||
91d231cb | 3804 | attributes = chainon (attributes, prefix_attributes); |
b17e2870 | 3805 | |
c11b6f21 | 3806 | decl = grokdeclarator (declarator, declspecs, NORMAL, initialized, |
91d231cb | 3807 | &attributes); |
68642fb6 | 3808 | |
e23bd218 IR |
3809 | deprecated_state = DEPRECATED_NORMAL; |
3810 | ||
2d00b4f2 AP |
3811 | if (decl == NULL_TREE || TREE_CODE (decl) == VOID_TYPE |
3812 | || decl == error_mark_node) | |
44370687 | 3813 | return error_mark_node; |
8d08fdba MS |
3814 | |
3815 | type = TREE_TYPE (decl); | |
3816 | ||
4f1c5b7d | 3817 | context = DECL_CONTEXT (decl); |
8d08fdba | 3818 | |
73a8adb6 | 3819 | if (context) |
4514aa8c NS |
3820 | { |
3821 | *pushed_scope_p = push_scope (context); | |
c8094d83 | 3822 | |
4514aa8c NS |
3823 | /* We are only interested in class contexts, later. */ |
3824 | if (TREE_CODE (context) == NAMESPACE_DECL) | |
3825 | context = NULL_TREE; | |
3826 | } | |
2c73f9f5 | 3827 | |
8d08fdba MS |
3828 | if (initialized) |
3829 | /* Is it valid for this decl to have an initializer at all? | |
3830 | If not, set INITIALIZED to zero, which will indirectly | |
82580166 | 3831 | tell `cp_finish_decl' to ignore the initializer once it is parsed. */ |
8d08fdba MS |
3832 | switch (TREE_CODE (decl)) |
3833 | { | |
3834 | case TYPE_DECL: | |
2d01edd7 | 3835 | error ("typedef %qD is initialized (use __typeof__ instead)", decl); |
cc011e7f | 3836 | return error_mark_node; |
8d08fdba MS |
3837 | |
3838 | case FUNCTION_DECL: | |
2d01edd7 | 3839 | error ("function %q#D is initialized like a variable", decl); |
650fcd07 | 3840 | return error_mark_node; |
8d08fdba MS |
3841 | |
3842 | default: | |
3e41d13b | 3843 | break; |
8d08fdba MS |
3844 | } |
3845 | ||
8d08fdba MS |
3846 | if (initialized) |
3847 | { | |
a9aedbc2 | 3848 | if (! toplevel_bindings_p () |
8d08fdba | 3849 | && DECL_EXTERNAL (decl)) |
d4ee4d25 | 3850 | warning (0, "declaration of %q#D has %<extern%> and is initialized", |
0cbd7506 | 3851 | decl); |
8d08fdba | 3852 | DECL_EXTERNAL (decl) = 0; |
5566b478 | 3853 | if (toplevel_bindings_p ()) |
8d08fdba | 3854 | TREE_STATIC (decl) = 1; |
8d08fdba MS |
3855 | } |
3856 | ||
fa20888b | 3857 | /* Set attributes here so if duplicate decl, will have proper attributes. */ |
91d231cb | 3858 | cplus_decl_attributes (&decl, attributes, 0); |
fa20888b | 3859 | |
4e2bb0a4 DS |
3860 | /* Dllimported symbols cannot be defined. Static data members (which |
3861 | can be initialized in-class and dllimported) go through grokfield, | |
3862 | not here, so we don't need to exclude those decls when checking for | |
3863 | a definition. */ | |
3864 | if (initialized && DECL_DLLIMPORT_P (decl)) | |
3865 | { | |
3866 | error ("definition of %q#D is marked %<dllimport%>", decl); | |
3867 | DECL_DLLIMPORT_P (decl) = 0; | |
3868 | } | |
3869 | ||
ecb0eece | 3870 | /* If #pragma weak was used, mark the decl weak now. */ |
3693d46c | 3871 | maybe_apply_pragma_weak (decl); |
ecb0eece | 3872 | |
97055d5c AO |
3873 | if (TREE_CODE (decl) == FUNCTION_DECL |
3874 | && DECL_DECLARED_INLINE_P (decl) | |
3875 | && DECL_UNINLINABLE (decl) | |
3876 | && lookup_attribute ("noinline", DECL_ATTRIBUTES (decl))) | |
dee15844 | 3877 | warning (0, "inline function %q+D given attribute noinline", decl); |
97055d5c | 3878 | |
d0f062fb | 3879 | if (context && COMPLETE_TYPE_P (complete_type (context))) |
5b605f68 MS |
3880 | { |
3881 | if (TREE_CODE (decl) == VAR_DECL) | |
3882 | { | |
86ac0575 | 3883 | tree field = lookup_field (context, DECL_NAME (decl), 0, false); |
5b605f68 | 3884 | if (field == NULL_TREE || TREE_CODE (field) != VAR_DECL) |
2d01edd7 | 3885 | error ("%q#D is not a static member of %q#T", decl, context); |
e349ee73 MS |
3886 | else |
3887 | { | |
3888 | if (DECL_CONTEXT (field) != context) | |
f2d773a2 | 3889 | { |
a723baf1 | 3890 | if (!same_type_p (DECL_CONTEXT (field), context)) |
2d01edd7 | 3891 | pedwarn ("ISO C++ does not permit %<%T::%D%> " |
0cbd7506 | 3892 | "to be defined as %<%T::%D%>", |
a723baf1 MM |
3893 | DECL_CONTEXT (field), DECL_NAME (decl), |
3894 | context, DECL_NAME (decl)); | |
f2d773a2 JM |
3895 | DECL_CONTEXT (decl) = DECL_CONTEXT (field); |
3896 | } | |
91146169 GB |
3897 | if (processing_specialization |
3898 | && template_class_depth (context) == 0 | |
3899 | && CLASSTYPE_TEMPLATE_SPECIALIZATION (context)) | |
3900 | error ("template header not allowed in member definition " | |
3901 | "of explicitly specialized class"); | |
75650646 MM |
3902 | /* Static data member are tricky; an in-class initialization |
3903 | still doesn't provide a definition, so the in-class | |
3904 | declaration will have DECL_EXTERNAL set, but will have an | |
3905 | initialization. Thus, duplicate_decls won't warn | |
3906 | about this situation, and so we check here. */ | |
e92fb501 | 3907 | if (initialized && DECL_INITIALIZED_IN_CLASS_P (field)) |
9e637a26 | 3908 | error ("duplicate initialization of %qD", decl); |
d63d5d0c | 3909 | if (duplicate_decls (decl, field, /*newdecl_is_friend=*/false)) |
e349ee73 MS |
3910 | decl = field; |
3911 | } | |
5b605f68 | 3912 | } |
f30432d7 MS |
3913 | else |
3914 | { | |
d43f603d | 3915 | tree field = check_classfn (context, decl, |
44021471 GB |
3916 | (processing_template_decl |
3917 | > template_class_depth (context)) | |
3918 | ? current_template_parms | |
3919 | : NULL_TREE); | |
d63d5d0c ILT |
3920 | if (field && duplicate_decls (decl, field, |
3921 | /*newdecl_is_friend=*/false)) | |
f30432d7 MS |
3922 | decl = field; |
3923 | } | |
3924 | ||
3925 | /* cp_finish_decl sets DECL_EXTERNAL if DECL_IN_AGGR_P is set. */ | |
dff3e828 | 3926 | DECL_IN_AGGR_P (decl) = 0; |
9267ee62 NS |
3927 | /* Do not mark DECL as an explicit specialization if it was not |
3928 | already marked as an instantiation; a declaration should | |
3929 | never be marked as a specialization unless we know what | |
c8094d83 | 3930 | template is being specialized. */ |
9267ee62 | 3931 | if (DECL_LANG_SPECIFIC (decl) && DECL_USE_TEMPLATE (decl)) |
84e6233f | 3932 | { |
9267ee62 | 3933 | SET_DECL_TEMPLATE_SPECIALIZATION (decl); |
c8094d83 | 3934 | |
84e6233f JM |
3935 | /* [temp.expl.spec] An explicit specialization of a static data |
3936 | member of a template is a definition if the declaration | |
3937 | includes an initializer; otherwise, it is a declaration. | |
c8094d83 | 3938 | |
84e6233f JM |
3939 | We check for processing_specialization so this only applies |
3940 | to the new specialization syntax. */ | |
e92fb501 | 3941 | if (!initialized && processing_specialization) |
84e6233f JM |
3942 | DECL_EXTERNAL (decl) = 1; |
3943 | } | |
f30432d7 | 3944 | |
b7698cf0 | 3945 | if (DECL_EXTERNAL (decl) && ! DECL_TEMPLATE_SPECIALIZATION (decl)) |
2d01edd7 | 3946 | pedwarn ("declaration of %q#D outside of class is not definition", |
0cbd7506 | 3947 | decl); |
5b605f68 MS |
3948 | } |
3949 | ||
9188c363 MM |
3950 | /* Enter this declaration into the symbol table. */ |
3951 | tem = maybe_push_decl (decl); | |
2ee887f2 | 3952 | |
5156628f | 3953 | if (processing_template_decl) |
cd9f6678 | 3954 | tem = push_template_decl (tem); |
156fc2bb KL |
3955 | if (tem == error_mark_node) |
3956 | return error_mark_node; | |
5566b478 | 3957 | |
3b426391 | 3958 | /* Tell the back end to use or not use .common as appropriate. If we say |
a50f0918 MS |
3959 | -fconserve-space, we want this to save .data space, at the expense of |
3960 | wrong semantics. If we say -fno-conserve-space, we want this to | |
3961 | produce errors about redefs; to do this we force variables into the | |
3962 | data segment. */ | |
434aeebb RS |
3963 | if (flag_conserve_space |
3964 | && TREE_CODE (tem) == VAR_DECL | |
3965 | && TREE_PUBLIC (tem) | |
3966 | && !DECL_THREAD_LOCAL_P (tem) | |
3967 | && !have_global_bss_p ()) | |
3968 | DECL_COMMON (tem) = 1; | |
68642fb6 | 3969 | |
e92fb501 MM |
3970 | if (!processing_template_decl && TREE_CODE (tem) == VAR_DECL) |
3971 | start_decl_1 (tem, initialized); | |
8d08fdba | 3972 | |
8d08fdba MS |
3973 | return tem; |
3974 | } | |
3975 | ||
5566b478 | 3976 | void |
e92fb501 | 3977 | start_decl_1 (tree decl, bool initialized) |
8d08fdba | 3978 | { |
e92fb501 | 3979 | tree type; |
8d08fdba | 3980 | |
e92fb501 MM |
3981 | gcc_assert (!processing_template_decl); |
3982 | ||
3983 | if (error_operand_p (decl)) | |
44689c12 ML |
3984 | return; |
3985 | ||
e92fb501 MM |
3986 | gcc_assert (TREE_CODE (decl) == VAR_DECL); |
3987 | type = TREE_TYPE (decl); | |
3988 | ||
5566b478 MS |
3989 | if (initialized) |
3990 | /* Is it valid for this decl to have an initializer at all? | |
3991 | If not, set INITIALIZED to zero, which will indirectly | |
3992 | tell `cp_finish_decl' to ignore the initializer once it is parsed. */ | |
8d08fdba | 3993 | { |
5566b478 MS |
3994 | /* Don't allow initializations for incomplete types except for |
3995 | arrays which might be completed by the initialization. */ | |
d0f062fb | 3996 | if (COMPLETE_TYPE_P (complete_type (type))) |
5566b478 MS |
3997 | ; /* A complete type is ok. */ |
3998 | else if (TREE_CODE (type) != ARRAY_TYPE) | |
8d08fdba | 3999 | { |
2d01edd7 | 4000 | error ("variable %q#D has initializer but incomplete type", decl); |
5566b478 | 4001 | initialized = 0; |
25eb19ff | 4002 | type = TREE_TYPE (decl) = error_mark_node; |
5566b478 | 4003 | } |
d0f062fb | 4004 | else if (!COMPLETE_TYPE_P (complete_type (TREE_TYPE (type)))) |
5566b478 MS |
4005 | { |
4006 | if (DECL_LANG_SPECIFIC (decl) && DECL_TEMPLATE_INFO (decl)) | |
2d01edd7 | 4007 | error ("elements of array %q#D have incomplete type", decl); |
5566b478 MS |
4008 | /* else we already gave an error in start_decl. */ |
4009 | initialized = 0; | |
8d08fdba | 4010 | } |
8d08fdba | 4011 | } |
e92fb501 MM |
4012 | else if (IS_AGGR_TYPE (type) |
4013 | && ! DECL_EXTERNAL (decl)) | |
8d08fdba | 4014 | { |
e92fb501 | 4015 | if (!COMPLETE_TYPE_P (complete_type (type))) |
5566b478 | 4016 | { |
2d01edd7 | 4017 | error ("aggregate %q#D has incomplete type and cannot be defined", |
5566b478 MS |
4018 | decl); |
4019 | /* Change the type so that assemble_variable will give | |
4020 | DECL an rtl we can live with: (mem (const_int 0)). */ | |
25eb19ff | 4021 | type = TREE_TYPE (decl) = error_mark_node; |
5566b478 MS |
4022 | } |
4023 | else | |
4024 | { | |
4025 | /* If any base type in the hierarchy of TYPE needs a constructor, | |
4026 | then we set initialized to 1. This way any nodes which are | |
4027 | created for the purposes of initializing this aggregate | |
4028 | will live as long as it does. This is necessary for global | |
4029 | aggregates which do not have their initializers processed until | |
4030 | the end of the file. */ | |
4031 | initialized = TYPE_NEEDS_CONSTRUCTING (type); | |
4032 | } | |
4033 | } | |
4034 | ||
c6671cbb MM |
4035 | /* Create a new scope to hold this declaration if necessary. |
4036 | Whether or not a new scope is necessary cannot be determined | |
4037 | until after the type has been completed; if the type is a | |
4038 | specialization of a class template it is not until after | |
4039 | instantiation has occurred that TYPE_HAS_NONTRIVIAL_DESTRUCTOR | |
4040 | will be set correctly. */ | |
4041 | maybe_push_cleanup_level (type); | |
5566b478 MS |
4042 | } |
4043 | ||
7e99327d MM |
4044 | /* Handle initialization of references. DECL, TYPE, and INIT have the |
4045 | same meaning as in cp_finish_decl. *CLEANUP must be NULL on entry, | |
4046 | but will be set to a new CLEANUP_STMT if a temporary is created | |
cd0be382 | 4047 | that must be destroyed subsequently. |
7e99327d MM |
4048 | |
4049 | Returns an initializer expression to use to initialize DECL, or | |
4050 | NULL if the initialization can be performed statically. | |
e92cc029 MS |
4051 | |
4052 | Quotes on semantics can be found in ARM 8.4.3. */ | |
4053 | ||
8e4ce833 | 4054 | static tree |
7e99327d | 4055 | grok_reference_init (tree decl, tree type, tree init, tree *cleanup) |
5566b478 MS |
4056 | { |
4057 | tree tmp; | |
4058 | ||
4059 | if (init == NULL_TREE) | |
4060 | { | |
4061 | if ((DECL_LANG_SPECIFIC (decl) == 0 | |
4062 | || DECL_IN_AGGR_P (decl) == 0) | |
4063 | && ! DECL_THIS_EXTERN (decl)) | |
c4f73174 | 4064 | error ("%qD declared as reference but not initialized", decl); |
8e4ce833 | 4065 | return NULL_TREE; |
5566b478 MS |
4066 | } |
4067 | ||
ed5511d9 | 4068 | if (TREE_CODE (init) == CONSTRUCTOR) |
5566b478 | 4069 | { |
2d01edd7 | 4070 | error ("ISO C++ forbids use of initializer list to " |
0cbd7506 | 4071 | "initialize reference %qD", decl); |
8e4ce833 | 4072 | return NULL_TREE; |
8d08fdba MS |
4073 | } |
4074 | ||
4075 | if (TREE_CODE (init) == TREE_LIST) | |
c7b62f14 | 4076 | init = build_x_compound_expr_from_list (init, "initializer"); |
8d08fdba MS |
4077 | |
4078 | if (TREE_CODE (TREE_TYPE (type)) != ARRAY_TYPE | |
4079 | && TREE_CODE (TREE_TYPE (init)) == ARRAY_TYPE) | |
0a72704b MM |
4080 | /* Note: default conversion is only called in very special cases. */ |
4081 | init = decay_conversion (init); | |
68642fb6 | 4082 | |
24bef158 MM |
4083 | /* Convert INIT to the reference type TYPE. This may involve the |
4084 | creation of a temporary, whose lifetime must be the same as that | |
350fae66 RK |
4085 | of the reference. If so, a DECL_EXPR for the temporary will be |
4086 | added just after the DECL_EXPR for DECL. That's why we don't set | |
24bef158 MM |
4087 | DECL_INITIAL for local references (instead assigning to them |
4088 | explicitly); we need to allow the temporary to be initialized | |
4089 | first. */ | |
7e99327d | 4090 | tmp = initialize_reference (type, init, decl, cleanup); |
8d08fdba | 4091 | |
a3203465 | 4092 | if (tmp == error_mark_node) |
8e4ce833 JJ |
4093 | return NULL_TREE; |
4094 | else if (tmp == NULL_TREE) | |
8d08fdba | 4095 | { |
2d01edd7 | 4096 | error ("cannot initialize %qT from %qT", type, TREE_TYPE (init)); |
8e4ce833 | 4097 | return NULL_TREE; |
8d08fdba | 4098 | } |
8d08fdba | 4099 | |
8e4ce833 JJ |
4100 | if (TREE_STATIC (decl) && !TREE_CONSTANT (tmp)) |
4101 | return tmp; | |
4102 | ||
08ac397c | 4103 | DECL_INITIAL (decl) = tmp; |
8e4ce833 JJ |
4104 | |
4105 | return NULL_TREE; | |
8d08fdba MS |
4106 | } |
4107 | ||
76239779 MM |
4108 | /* Designated initializers in arrays are not supported in GNU C++. |
4109 | The parser cannot detect this error since it does not know whether | |
4110 | a given brace-enclosed initializer is for a class type or for an | |
4111 | array. This function checks that CE does not use a designated | |
4112 | initializer. If it does, an error is issued. Returns true if CE | |
4113 | is valid, i.e., does not have a designated initializer. */ | |
4114 | ||
4115 | static bool | |
4116 | check_array_designated_initializer (const constructor_elt *ce) | |
4117 | { | |
48c9a7f0 | 4118 | /* Designated initializers for array elements are not supported. */ |
76239779 MM |
4119 | if (ce->index) |
4120 | { | |
4121 | /* The parser only allows identifiers as designated | |
4122 | intializers. */ | |
4123 | gcc_assert (TREE_CODE (ce->index) == IDENTIFIER_NODE); | |
4124 | error ("name %qD used in a GNU-style designated " | |
4125 | "initializer for an array", ce->index); | |
4126 | return false; | |
4127 | } | |
4128 | ||
4129 | return true; | |
4130 | } | |
4131 | ||
27778b73 MM |
4132 | /* When parsing `int a[] = {1, 2};' we don't know the size of the |
4133 | array until we finish parsing the initializer. If that's the | |
4134 | situation we're in, update DECL accordingly. */ | |
4135 | ||
4136 | static void | |
11f6b451 | 4137 | maybe_deduce_size_from_array_init (tree decl, tree init) |
27778b73 MM |
4138 | { |
4139 | tree type = TREE_TYPE (decl); | |
4140 | ||
4141 | if (TREE_CODE (type) == ARRAY_TYPE | |
4142 | && TYPE_DOMAIN (type) == NULL_TREE | |
4143 | && TREE_CODE (decl) != TYPE_DECL) | |
4144 | { | |
f2ae0c45 JM |
4145 | /* do_default is really a C-ism to deal with tentative definitions. |
4146 | But let's leave it here to ease the eventual merge. */ | |
4147 | int do_default = !DECL_EXTERNAL (decl); | |
27778b73 | 4148 | tree initializer = init ? init : DECL_INITIAL (decl); |
76239779 | 4149 | int failure = 0; |
27778b73 | 4150 | |
76239779 MM |
4151 | /* Check that there are no designated initializers in INIT, as |
4152 | those are not supported in GNU C++, and as the middle-end | |
4153 | will crash if presented with a non-numeric designated | |
4154 | initializer. */ | |
4155 | if (initializer && TREE_CODE (initializer) == CONSTRUCTOR) | |
2b643eda | 4156 | { |
76239779 MM |
4157 | VEC(constructor_elt,gc) *v = CONSTRUCTOR_ELTS (initializer); |
4158 | constructor_elt *ce; | |
4159 | HOST_WIDE_INT i; | |
4160 | for (i = 0; | |
4161 | VEC_iterate (constructor_elt, v, i, ce); | |
4162 | ++i) | |
4163 | if (!check_array_designated_initializer (ce)) | |
4164 | failure = 1; | |
2b643eda | 4165 | } |
76239779 MM |
4166 | |
4167 | if (!failure) | |
27778b73 | 4168 | { |
76239779 MM |
4169 | failure = cp_complete_array_type (&TREE_TYPE (decl), initializer, |
4170 | do_default); | |
4171 | if (failure == 1) | |
2b643eda | 4172 | { |
76239779 MM |
4173 | error ("initializer fails to determine size of %qD", decl); |
4174 | TREE_TYPE (decl) = error_mark_node; | |
4175 | } | |
4176 | else if (failure == 2) | |
4177 | { | |
4178 | if (do_default) | |
4179 | { | |
4180 | error ("array size missing in %qD", decl); | |
4181 | TREE_TYPE (decl) = error_mark_node; | |
4182 | } | |
4183 | /* If a `static' var's size isn't known, make it extern as | |
4184 | well as static, so it does not get allocated. If it's not | |
4185 | `static', then don't mark it extern; finish_incomplete_decl | |
4186 | will give it a default size and it will get allocated. */ | |
4187 | else if (!pedantic && TREE_STATIC (decl) && !TREE_PUBLIC (decl)) | |
4188 | DECL_EXTERNAL (decl) = 1; | |
4189 | } | |
4190 | else if (failure == 3) | |
4191 | { | |
4192 | error ("zero-size array %qD", decl); | |
2b643eda MM |
4193 | TREE_TYPE (decl) = error_mark_node; |
4194 | } | |
2b643eda | 4195 | } |
27778b73 | 4196 | |
f23b8501 JJ |
4197 | cp_apply_type_quals_to_decl (cp_type_quals (TREE_TYPE (decl)), decl); |
4198 | ||
27778b73 MM |
4199 | layout_decl (decl, 0); |
4200 | } | |
4201 | } | |
4202 | ||
4203 | /* Set DECL_SIZE, DECL_ALIGN, etc. for DECL (a VAR_DECL), and issue | |
57b52417 | 4204 | any appropriate error messages regarding the layout. */ |
27778b73 | 4205 | |
57b52417 | 4206 | static void |
11f6b451 | 4207 | layout_var_decl (tree decl) |
27778b73 | 4208 | { |
2b643eda MM |
4209 | tree type; |
4210 | ||
2b643eda MM |
4211 | type = TREE_TYPE (decl); |
4212 | if (type == error_mark_node) | |
4213 | return; | |
57b52417 MM |
4214 | |
4215 | /* If we haven't already layed out this declaration, do so now. | |
4216 | Note that we must not call complete type for an external object | |
4217 | because it's type might involve templates that we are not | |
34cd5ae7 | 4218 | supposed to instantiate yet. (And it's perfectly valid to say |
57b52417 MM |
4219 | `extern X x' for some incomplete type `X'.) */ |
4220 | if (!DECL_EXTERNAL (decl)) | |
4221 | complete_type (type); | |
caf93cb0 | 4222 | if (!DECL_SIZE (decl) |
328de7c2 | 4223 | && TREE_TYPE (decl) != error_mark_node |
7de85f7e | 4224 | && (COMPLETE_TYPE_P (type) |
caf93cb0 | 4225 | || (TREE_CODE (type) == ARRAY_TYPE |
7de85f7e MM |
4226 | && !TYPE_DOMAIN (type) |
4227 | && COMPLETE_TYPE_P (TREE_TYPE (type))))) | |
27778b73 MM |
4228 | layout_decl (decl, 0); |
4229 | ||
c82dbd95 | 4230 | if (!DECL_EXTERNAL (decl) && DECL_SIZE (decl) == NULL_TREE) |
27778b73 MM |
4231 | { |
4232 | /* An automatic variable with an incomplete type: that is an error. | |
4233 | Don't talk about array types here, since we took care of that | |
4234 | message in grokdeclarator. */ | |
2d01edd7 | 4235 | error ("storage size of %qD isn't known", decl); |
27778b73 MM |
4236 | TREE_TYPE (decl) = error_mark_node; |
4237 | } | |
ae673f14 JM |
4238 | #if 0 |
4239 | /* Keep this code around in case we later want to control debug info | |
4240 | based on whether a type is "used". (jason 1999-11-11) */ | |
4241 | ||
27778b73 MM |
4242 | else if (!DECL_EXTERNAL (decl) && IS_AGGR_TYPE (ttype)) |
4243 | /* Let debugger know it should output info for this type. */ | |
4244 | note_debug_info_needed (ttype); | |
4245 | ||
4246 | if (TREE_STATIC (decl) && DECL_CLASS_SCOPE_P (decl)) | |
4247 | note_debug_info_needed (DECL_CONTEXT (decl)); | |
ae673f14 | 4248 | #endif |
27778b73 MM |
4249 | |
4250 | if ((DECL_EXTERNAL (decl) || TREE_STATIC (decl)) | |
4251 | && DECL_SIZE (decl) != NULL_TREE | |
4252 | && ! TREE_CONSTANT (DECL_SIZE (decl))) | |
4253 | { | |
4254 | if (TREE_CODE (DECL_SIZE (decl)) == INTEGER_CST) | |
4255 | constant_expression_warning (DECL_SIZE (decl)); | |
4256 | else | |
2d01edd7 | 4257 | error ("storage size of %qD isn't constant", decl); |
27778b73 MM |
4258 | } |
4259 | } | |
4260 | ||
27778b73 MM |
4261 | /* If a local static variable is declared in an inline function, or if |
4262 | we have a weak definition, we must endeavor to create only one | |
4263 | instance of the variable at link-time. */ | |
4264 | ||
4265 | static void | |
11f6b451 | 4266 | maybe_commonize_var (tree decl) |
27778b73 MM |
4267 | { |
4268 | /* Static data in a function with comdat linkage also has comdat | |
4269 | linkage. */ | |
4270 | if (TREE_STATIC (decl) | |
4271 | /* Don't mess with __FUNCTION__. */ | |
cf74fb86 | 4272 | && ! DECL_ARTIFICIAL (decl) |
0b50d7f1 MM |
4273 | && DECL_FUNCTION_SCOPE_P (decl) |
4274 | /* Unfortunately, import_export_decl has not always been called | |
4275 | before the function is processed, so we cannot simply check | |
caf93cb0 | 4276 | DECL_COMDAT. */ |
9e6aaf5e | 4277 | && (DECL_COMDAT (DECL_CONTEXT (decl)) |
0b50d7f1 MM |
4278 | || ((DECL_DECLARED_INLINE_P (DECL_CONTEXT (decl)) |
4279 | || DECL_TEMPLATE_INSTANTIATION (DECL_CONTEXT (decl))) | |
4280 | && TREE_PUBLIC (DECL_CONTEXT (decl))))) | |
27778b73 | 4281 | { |
0dbc5cd3 | 4282 | if (flag_weak) |
27778b73 | 4283 | { |
0dbc5cd3 MM |
4284 | /* With weak symbols, we simply make the variable COMDAT; |
4285 | that will cause copies in multiple translations units to | |
4286 | be merged. */ | |
4287 | comdat_linkage (decl); | |
4288 | } | |
4289 | else | |
4290 | { | |
4291 | if (DECL_INITIAL (decl) == NULL_TREE | |
4292 | || DECL_INITIAL (decl) == error_mark_node) | |
27778b73 | 4293 | { |
0dbc5cd3 MM |
4294 | /* Without weak symbols, we can use COMMON to merge |
4295 | uninitialized variables. */ | |
27778b73 MM |
4296 | TREE_PUBLIC (decl) = 1; |
4297 | DECL_COMMON (decl) = 1; | |
4298 | } | |
0dbc5cd3 | 4299 | else |
27778b73 | 4300 | { |
0dbc5cd3 MM |
4301 | /* While for initialized variables, we must use internal |
4302 | linkage -- which means that multiple copies will not | |
4303 | be merged. */ | |
4304 | TREE_PUBLIC (decl) = 0; | |
4305 | DECL_COMMON (decl) = 0; | |
dee15844 JM |
4306 | warning (0, "sorry: semantics of inline function static " |
4307 | "data %q+#D are wrong (you'll wind up " | |
4308 | "with multiple copies)", decl); | |
d4ee4d25 | 4309 | warning (0, "%J you can work around this by removing " |
0cbd7506 | 4310 | "the initializer", |
ddd2d57e | 4311 | decl); |
27778b73 MM |
4312 | } |
4313 | } | |
4314 | } | |
4315 | else if (DECL_LANG_SPECIFIC (decl) && DECL_COMDAT (decl)) | |
4316 | /* Set it up again; we might have set DECL_INITIAL since the last | |
4317 | time. */ | |
4318 | comdat_linkage (decl); | |
4319 | } | |
4320 | ||
91063b51 MM |
4321 | /* Issue an error message if DECL is an uninitialized const variable. */ |
4322 | ||
4323 | static void | |
11f6b451 | 4324 | check_for_uninitialized_const_var (tree decl) |
91063b51 MM |
4325 | { |
4326 | tree type = TREE_TYPE (decl); | |
4327 | ||
4328 | /* ``Unless explicitly declared extern, a const object does not have | |
4329 | external linkage and must be initialized. ($8.4; $12.1)'' ARM | |
4330 | 7.1.6 */ | |
4331 | if (TREE_CODE (decl) == VAR_DECL | |
4332 | && TREE_CODE (type) != REFERENCE_TYPE | |
4333 | && CP_TYPE_CONST_P (type) | |
4334 | && !TYPE_NEEDS_CONSTRUCTING (type) | |
4335 | && !DECL_INITIAL (decl)) | |
2d01edd7 | 4336 | error ("uninitialized const %qD", decl); |
91063b51 MM |
4337 | } |
4338 | ||
4038c495 GB |
4339 | \f |
4340 | /* Structure holding the current initializer being processed by reshape_init. | |
4341 | CUR is a pointer to the current element being processed, END is a pointer | |
4342 | after the last element present in the initializer. */ | |
4343 | typedef struct reshape_iterator_t | |
4344 | { | |
4345 | constructor_elt *cur; | |
4346 | constructor_elt *end; | |
4347 | } reshape_iter; | |
4348 | ||
4349 | static tree reshape_init_r (tree, reshape_iter *, bool); | |
4350 | ||
8e3df2de MM |
4351 | /* FIELD is a FIELD_DECL or NULL. In the former case, the value |
4352 | returned is the next FIELD_DECL (possibly FIELD itself) that can be | |
4353 | initialized. If there are no more such fields, the return value | |
4354 | will be NULL. */ | |
4355 | ||
4356 | static tree | |
4357 | next_initializable_field (tree field) | |
4358 | { | |
4359 | while (field | |
4360 | && (TREE_CODE (field) != FIELD_DECL | |
4361 | || (DECL_C_BIT_FIELD (field) && !DECL_NAME (field)) | |
4362 | || DECL_ARTIFICIAL (field))) | |
4363 | field = TREE_CHAIN (field); | |
4364 | ||
4365 | return field; | |
4366 | } | |
4367 | ||
4038c495 GB |
4368 | /* Subroutine of reshape_init_array and reshape_init_vector, which does |
4369 | the actual work. ELT_TYPE is the element type of the array. MAX_INDEX is an | |
4370 | INTEGER_CST representing the size of the array minus one (the maximum index), | |
4371 | or NULL_TREE if the array was declared without specifying the size. D is | |
4372 | the iterator within the constructor. */ | |
4373 | ||
4374 | static tree | |
4375 | reshape_init_array_1 (tree elt_type, tree max_index, reshape_iter *d) | |
3d142be2 | 4376 | { |
4038c495 | 4377 | tree new_init; |
3d142be2 | 4378 | bool sized_array_p = (max_index != NULL_TREE); |
004c400a JJ |
4379 | unsigned HOST_WIDE_INT max_index_cst = 0; |
4380 | unsigned HOST_WIDE_INT index; | |
3d142be2 | 4381 | |
4038c495 GB |
4382 | /* The initializer for an array is always a CONSTRUCTOR. */ |
4383 | new_init = build_constructor (NULL_TREE, NULL); | |
4384 | ||
3d142be2 | 4385 | if (sized_array_p) |
004c400a | 4386 | { |
d7d93837 AH |
4387 | /* Minus 1 is used for zero sized arrays. */ |
4388 | if (integer_all_onesp (max_index)) | |
4389 | return new_init; | |
4390 | ||
004c400a JJ |
4391 | if (host_integerp (max_index, 1)) |
4392 | max_index_cst = tree_low_cst (max_index, 1); | |
4393 | /* sizetype is sign extended, not zero extended. */ | |
4394 | else | |
4395 | max_index_cst = tree_low_cst (fold_convert (size_type_node, max_index), | |
4396 | 1); | |
4397 | } | |
3d142be2 GB |
4398 | |
4399 | /* Loop until there are no more initializers. */ | |
4400 | for (index = 0; | |
4038c495 | 4401 | d->cur != d->end && (!sized_array_p || index <= max_index_cst); |
3d142be2 GB |
4402 | ++index) |
4403 | { | |
4038c495 GB |
4404 | tree elt_init; |
4405 | ||
76239779 | 4406 | check_array_designated_initializer (d->cur); |
4038c495 | 4407 | elt_init = reshape_init_r (elt_type, d, /*first_initializer_p=*/false); |
07471dfb MM |
4408 | if (elt_init == error_mark_node) |
4409 | return error_mark_node; | |
4038c495 | 4410 | CONSTRUCTOR_APPEND_ELT (CONSTRUCTOR_ELTS (new_init), NULL_TREE, elt_init); |
3d142be2 GB |
4411 | } |
4412 | ||
4038c495 | 4413 | return new_init; |
3d142be2 GB |
4414 | } |
4415 | ||
4038c495 GB |
4416 | /* Subroutine of reshape_init_r, processes the initializers for arrays. |
4417 | Parameters are the same of reshape_init_r. */ | |
8e3df2de | 4418 | |
4038c495 GB |
4419 | static tree |
4420 | reshape_init_array (tree type, reshape_iter *d) | |
4421 | { | |
4422 | tree max_index = NULL_TREE; | |
caf93cb0 | 4423 | |
4038c495 | 4424 | gcc_assert (TREE_CODE (type) == ARRAY_TYPE); |
8e3df2de | 4425 | |
4038c495 GB |
4426 | if (TYPE_DOMAIN (type)) |
4427 | max_index = array_type_nelts (type); | |
4428 | ||
4429 | return reshape_init_array_1 (TREE_TYPE (type), max_index, d); | |
4430 | } | |
4431 | ||
4432 | /* Subroutine of reshape_init_r, processes the initializers for vectors. | |
4433 | Parameters are the same of reshape_init_r. */ | |
8e3df2de MM |
4434 | |
4435 | static tree | |
4038c495 | 4436 | reshape_init_vector (tree type, reshape_iter *d) |
8e3df2de | 4437 | { |
4038c495 GB |
4438 | tree max_index = NULL_TREE; |
4439 | tree rtype; | |
4440 | ||
4441 | gcc_assert (TREE_CODE (type) == VECTOR_TYPE); | |
4442 | ||
3b2db49f | 4443 | if (COMPOUND_LITERAL_P (d->cur->value)) |
4038c495 GB |
4444 | { |
4445 | tree value = d->cur->value; | |
4446 | if (!same_type_p (TREE_TYPE (value), type)) | |
4447 | { | |
4448 | error ("invalid type %qT as initializer for a vector of type %qT", | |
4449 | TREE_TYPE (d->cur->value), type); | |
3db45ab5 | 4450 | value = error_mark_node; |
4038c495 GB |
4451 | } |
4452 | ++d->cur; | |
4453 | return value; | |
4454 | } | |
4455 | ||
4456 | /* For a vector, the representation type is a struct | |
4457 | containing a single member which is an array of the | |
4458 | appropriate size. */ | |
4459 | rtype = TYPE_DEBUG_REPRESENTATION_TYPE (type); | |
4460 | if (rtype && TYPE_DOMAIN (TREE_TYPE (TYPE_FIELDS (rtype)))) | |
4461 | max_index = array_type_nelts (TREE_TYPE (TYPE_FIELDS (rtype))); | |
4462 | ||
4463 | return reshape_init_array_1 (TREE_TYPE (type), max_index, d); | |
4464 | } | |
4465 | ||
4466 | /* Subroutine of reshape_init_r, processes the initializers for classes | |
4467 | or union. Parameters are the same of reshape_init_r. */ | |
4468 | ||
4469 | static tree | |
4470 | reshape_init_class (tree type, reshape_iter *d, bool first_initializer_p) | |
4471 | { | |
4472 | tree field; | |
8e3df2de | 4473 | tree new_init; |
8e3df2de | 4474 | |
4038c495 | 4475 | gcc_assert (CLASS_TYPE_P (type)); |
8e3df2de | 4476 | |
4038c495 GB |
4477 | /* The initializer for a class is always a CONSTRUCTOR. */ |
4478 | new_init = build_constructor (NULL_TREE, NULL); | |
4479 | field = next_initializable_field (TYPE_FIELDS (type)); | |
ee7ecb29 | 4480 | |
4038c495 | 4481 | if (!field) |
8e3df2de | 4482 | { |
4038c495 GB |
4483 | /* [dcl.init.aggr] |
4484 | ||
4485 | An initializer for an aggregate member that is an | |
4486 | empty class shall have the form of an empty | |
4487 | initializer-list {}. */ | |
4488 | if (!first_initializer_p) | |
4489 | { | |
4490 | error ("initializer for %qT must be brace-enclosed", type); | |
4491 | return error_mark_node; | |
4492 | } | |
4493 | return new_init; | |
8e3df2de | 4494 | } |
4038c495 GB |
4495 | |
4496 | /* Loop through the initializable fields, gathering initializers. */ | |
4497 | while (d->cur != d->end) | |
8e3df2de | 4498 | { |
4038c495 GB |
4499 | tree field_init; |
4500 | ||
4501 | /* Handle designated initializers, as an extension. */ | |
4502 | if (d->cur->index) | |
4503 | { | |
4038c495 GB |
4504 | field = lookup_field_1 (type, d->cur->index, /*want_type=*/false); |
4505 | ||
4506 | if (!field || TREE_CODE (field) != FIELD_DECL) | |
77bffd4c SE |
4507 | { |
4508 | error ("%qT has no non-static data member named %qD", type, | |
4509 | d->cur->index); | |
4510 | return error_mark_node; | |
4511 | } | |
4038c495 GB |
4512 | } |
4513 | ||
4514 | /* If we processed all the member of the class, we are done. */ | |
4515 | if (!field) | |
4516 | break; | |
4517 | ||
4518 | field_init = reshape_init_r (TREE_TYPE (field), d, | |
4519 | /*first_initializer_p=*/false); | |
4520 | CONSTRUCTOR_APPEND_ELT (CONSTRUCTOR_ELTS (new_init), field, field_init); | |
4521 | ||
4522 | /* [dcl.init.aggr] | |
4523 | ||
4524 | When a union is initialized with a brace-enclosed | |
4525 | initializer, the braces shall only contain an | |
4526 | initializer for the first member of the union. */ | |
4527 | if (TREE_CODE (type) == UNION_TYPE) | |
4528 | break; | |
4529 | ||
4530 | field = next_initializable_field (TREE_CHAIN (field)); | |
8e3df2de MM |
4531 | } |
4532 | ||
4038c495 GB |
4533 | return new_init; |
4534 | } | |
4535 | ||
4536 | /* Subroutine of reshape_init, which processes a single initializer (part of | |
4537 | a CONSTRUCTOR). TYPE is the type of the variable being initialized, D is the | |
4538 | iterator within the CONSTRUCTOR which points to the initializer to process. | |
4539 | FIRST_INITIALIZER_P is true if this is the first initializer of the | |
4540 | CONSTRUCTOR node. */ | |
4541 | ||
4542 | static tree | |
4543 | reshape_init_r (tree type, reshape_iter *d, bool first_initializer_p) | |
4544 | { | |
4545 | tree init = d->cur->value; | |
4546 | ||
8e3df2de MM |
4547 | /* A non-aggregate type is always initialized with a single |
4548 | initializer. */ | |
4549 | if (!CP_AGGREGATE_TYPE_P (type)) | |
4038c495 GB |
4550 | { |
4551 | /* It is invalid to initialize a non-aggregate type with a | |
4552 | brace-enclosed initializer. | |
4553 | We need to check for BRACE_ENCLOSED_INITIALIZER_P here because | |
4554 | of g++.old-deja/g++.mike/p7626.C: a pointer-to-member constant is | |
4555 | a CONSTRUCTOR (with a record type). */ | |
4556 | if (TREE_CODE (init) == CONSTRUCTOR | |
4557 | && BRACE_ENCLOSED_INITIALIZER_P (init)) /* p7626.C */ | |
4558 | { | |
4559 | error ("braces around scalar initializer for type %qT", type); | |
4560 | init = error_mark_node; | |
4561 | } | |
3db45ab5 | 4562 | |
4038c495 GB |
4563 | d->cur++; |
4564 | return init; | |
4565 | } | |
8e3df2de MM |
4566 | |
4567 | /* [dcl.init.aggr] | |
4568 | ||
4569 | All implicit type conversions (clause _conv_) are considered when | |
4570 | initializing the aggregate member with an initializer from an | |
4571 | initializer-list. If the initializer can initialize a member, | |
4572 | the member is initialized. Otherwise, if the member is itself a | |
4573 | non-empty subaggregate, brace elision is assumed and the | |
4574 | initializer is considered for the initialization of the first | |
4575 | member of the subaggregate. */ | |
4038c495 | 4576 | if (TREE_CODE (init) != CONSTRUCTOR |
30f86ec3 | 4577 | && can_convert_arg (type, TREE_TYPE (init), init, LOOKUP_NORMAL)) |
8e3df2de | 4578 | { |
4038c495 GB |
4579 | d->cur++; |
4580 | return init; | |
8e3df2de MM |
4581 | } |
4582 | ||
4038c495 GB |
4583 | /* [dcl.init.string] |
4584 | ||
4585 | A char array (whether plain char, signed char, or unsigned char) | |
4586 | can be initialized by a string-literal (optionally enclosed in | |
4587 | braces); a wchar_t array can be initialized by a wide | |
4588 | string-literal (optionally enclosed in braces). */ | |
4589 | if (TREE_CODE (type) == ARRAY_TYPE | |
42328048 | 4590 | && char_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (type)))) |
8e3df2de | 4591 | { |
4038c495 | 4592 | tree str_init = init; |
8e3df2de | 4593 | |
4038c495 | 4594 | /* Strip one level of braces if and only if they enclose a single |
3db45ab5 | 4595 | element (as allowed by [dcl.init.string]). */ |
4038c495 GB |
4596 | if (!first_initializer_p |
4597 | && TREE_CODE (str_init) == CONSTRUCTOR | |
4598 | && VEC_length (constructor_elt, CONSTRUCTOR_ELTS (str_init)) == 1) | |
8e3df2de | 4599 | { |
4038c495 GB |
4600 | str_init = VEC_index (constructor_elt, |
4601 | CONSTRUCTOR_ELTS (str_init), 0)->value; | |
4602 | } | |
3db45ab5 | 4603 | |
4038c495 | 4604 | /* If it's a string literal, then it's the initializer for the array |
3db45ab5 | 4605 | as a whole. Otherwise, continue with normal initialization for |
4038c495 GB |
4606 | array types (one value per array element). */ |
4607 | if (TREE_CODE (str_init) == STRING_CST) | |
4608 | { | |
4609 | d->cur++; | |
4610 | return str_init; | |
4611 | } | |
4612 | } | |
8e3df2de | 4613 | |
4038c495 GB |
4614 | /* The following cases are about aggregates. If we are not within a full |
4615 | initializer already, and there is not a CONSTRUCTOR, it means that there | |
4616 | is a missing set of braces (that is, we are processing the case for | |
4617 | which reshape_init exists). */ | |
4618 | if (!first_initializer_p) | |
4619 | { | |
4620 | if (TREE_CODE (init) == CONSTRUCTOR) | |
4621 | { | |
4622 | /* For a nested compound literal, there is no need to reshape since | |
4623 | brace elision is not allowed. Even if we decided to allow it, | |
4624 | we should add a call to reshape_init in finish_compound_literal, | |
4625 | before calling digest_init, so changing this code would still | |
4626 | not be necessary. */ | |
3b2db49f | 4627 | if (!COMPOUND_LITERAL_P (init)) |
8e3df2de | 4628 | { |
4038c495 GB |
4629 | ++d->cur; |
4630 | gcc_assert (BRACE_ENCLOSED_INITIALIZER_P (init)); | |
4631 | return reshape_init (type, init); | |
8e3df2de MM |
4632 | } |
4633 | else | |
4038c495 | 4634 | gcc_assert (!BRACE_ENCLOSED_INITIALIZER_P (init)); |
8e3df2de | 4635 | } |
f8e7a389 | 4636 | |
4038c495 GB |
4637 | warning (OPT_Wmissing_braces, "missing braces around initializer for %qT", |
4638 | type); | |
4639 | } | |
8e3df2de | 4640 | |
4038c495 GB |
4641 | /* Dispatch to specialized routines. */ |
4642 | if (CLASS_TYPE_P (type)) | |
4643 | return reshape_init_class (type, d, first_initializer_p); | |
4644 | else if (TREE_CODE (type) == ARRAY_TYPE) | |
4645 | return reshape_init_array (type, d); | |
4646 | else if (TREE_CODE (type) == VECTOR_TYPE) | |
4647 | return reshape_init_vector (type, d); | |
4648 | else | |
4649 | gcc_unreachable(); | |
4650 | } | |
8e3df2de | 4651 | |
4038c495 GB |
4652 | /* Undo the brace-elision allowed by [dcl.init.aggr] in a |
4653 | brace-enclosed aggregate initializer. | |
8e3df2de | 4654 | |
4038c495 GB |
4655 | INIT is the CONSTRUCTOR containing the list of initializers describing |
4656 | a brace-enclosed initializer for an entity of the indicated aggregate TYPE. | |
4657 | It may not presently match the shape of the TYPE; for example: | |
4658 | ||
4659 | struct S { int a; int b; }; | |
4660 | struct S a[] = { 1, 2, 3, 4 }; | |
4661 | ||
4662 | Here INIT will hold a VEC of four elements, rather than a | |
4663 | VEC of two elements, each itself a VEC of two elements. This | |
4664 | routine transforms INIT from the former form into the latter. The | |
4665 | revised CONSTRUCTOR node is returned. */ | |
4666 | ||
3b2db49f | 4667 | tree |
4038c495 GB |
4668 | reshape_init (tree type, tree init) |
4669 | { | |
4670 | VEC(constructor_elt, gc) *v; | |
4671 | reshape_iter d; | |
4672 | tree new_init; | |
4673 | ||
4038c495 GB |
4674 | gcc_assert (BRACE_ENCLOSED_INITIALIZER_P (init)); |
4675 | ||
4676 | v = CONSTRUCTOR_ELTS (init); | |
4677 | ||
4678 | /* An empty constructor does not need reshaping, and it is always a valid | |
4679 | initializer. */ | |
4680 | if (VEC_empty (constructor_elt, v)) | |
4681 | return init; | |
4682 | ||
4683 | /* Recurse on this CONSTRUCTOR. */ | |
4684 | d.cur = VEC_index (constructor_elt, v, 0); | |
4685 | d.end = d.cur + VEC_length (constructor_elt, v); | |
4686 | ||
4687 | new_init = reshape_init_r (type, &d, true); | |
07471dfb MM |
4688 | if (new_init == error_mark_node) |
4689 | return error_mark_node; | |
4038c495 GB |
4690 | |
4691 | /* Make sure all the element of the constructor were used. Otherwise, | |
4692 | issue an error about exceeding initializers. */ | |
4693 | if (d.cur != d.end) | |
4694 | error ("too many initializers for %qT", type); | |
8e3df2de MM |
4695 | |
4696 | return new_init; | |
4697 | } | |
4698 | ||
c82dbd95 | 4699 | /* Verify INIT (the initializer for DECL), and record the |
7e99327d MM |
4700 | initialization in DECL_INITIAL, if appropriate. CLEANUP is as for |
4701 | grok_reference_init. | |
8e3df2de MM |
4702 | |
4703 | If the return value is non-NULL, it is an expression that must be | |
4704 | evaluated dynamically to initialize DECL. */ | |
27778b73 | 4705 | |
c82dbd95 | 4706 | static tree |
7e99327d | 4707 | check_initializer (tree decl, tree init, int flags, tree *cleanup) |
27778b73 | 4708 | { |
17bbb839 | 4709 | tree type = TREE_TYPE (decl); |
25ebb82a | 4710 | tree init_code = NULL; |
fc0e7bf5 | 4711 | |
328de7c2 MM |
4712 | /* Things that are going to be initialized need to have complete |
4713 | type. */ | |
4714 | TREE_TYPE (decl) = type = complete_type (TREE_TYPE (decl)); | |
c82dbd95 | 4715 | |
328de7c2 MM |
4716 | if (type == error_mark_node) |
4717 | /* We will have already complained. */ | |
f724eac4 MM |
4718 | return NULL_TREE; |
4719 | ||
4720 | if (TREE_CODE (type) == ARRAY_TYPE) | |
328de7c2 | 4721 | { |
f724eac4 MM |
4722 | tree element_type = TREE_TYPE (type); |
4723 | ||
4724 | /* The array type itself need not be complete, because the | |
4725 | initializer may tell us how many elements are in the array. | |
4726 | But, the elements of the array must be complete. */ | |
4727 | if (!COMPLETE_TYPE_P (complete_type (element_type))) | |
4728 | { | |
4729 | error ("elements of array %q#D have incomplete type", decl); | |
4730 | return NULL_TREE; | |
4731 | } | |
4732 | /* It is not valid to initialize an a VLA. */ | |
4733 | if (init | |
4734 | && ((COMPLETE_TYPE_P (type) && !TREE_CONSTANT (TYPE_SIZE (type))) | |
4735 | || !TREE_CONSTANT (TYPE_SIZE (element_type)))) | |
4736 | { | |
4737 | error ("variable-sized object %qD may not be initialized", decl); | |
4738 | return NULL_TREE; | |
4739 | } | |
328de7c2 | 4740 | } |
f724eac4 | 4741 | else if (!COMPLETE_TYPE_P (type)) |
328de7c2 | 4742 | { |
2d01edd7 | 4743 | error ("%qD has incomplete type", decl); |
328de7c2 | 4744 | TREE_TYPE (decl) = error_mark_node; |
f724eac4 | 4745 | return NULL_TREE; |
27778b73 | 4746 | } |
f724eac4 MM |
4747 | else |
4748 | /* There is no way to make a variable-sized class type in GNU C++. */ | |
4749 | gcc_assert (TREE_CONSTANT (TYPE_SIZE (type))); | |
4750 | ||
4751 | if (!CP_AGGREGATE_TYPE_P (type) | |
4752 | && init && BRACE_ENCLOSED_INITIALIZER_P (init) | |
4753 | && VEC_length (constructor_elt, CONSTRUCTOR_ELTS (init)) != 1) | |
f47165c9 SE |
4754 | { |
4755 | error ("scalar object %qD requires one element in initializer", decl); | |
4756 | TREE_TYPE (decl) = error_mark_node; | |
f724eac4 | 4757 | return NULL_TREE; |
f47165c9 | 4758 | } |
27778b73 MM |
4759 | |
4760 | if (TREE_CODE (decl) == CONST_DECL) | |
4761 | { | |
7525db03 | 4762 | gcc_assert (TREE_CODE (type) != REFERENCE_TYPE); |
27778b73 MM |
4763 | |
4764 | DECL_INITIAL (decl) = init; | |
4765 | ||
50bc768d | 4766 | gcc_assert (init != NULL_TREE); |
27778b73 MM |
4767 | init = NULL_TREE; |
4768 | } | |
c82dbd95 | 4769 | else if (!DECL_EXTERNAL (decl) && TREE_CODE (type) == REFERENCE_TYPE) |
7e99327d | 4770 | init = grok_reference_init (decl, type, init, cleanup); |
27778b73 MM |
4771 | else if (init) |
4772 | { | |
4038c495 | 4773 | /* Do not reshape constructors of vectors (they don't need to be |
3db45ab5 | 4774 | reshaped. */ |
caf93cb0 | 4775 | if (TREE_CODE (init) == CONSTRUCTOR |
3b2db49f | 4776 | && !COMPOUND_LITERAL_P (init) |
4038c495 | 4777 | && !TREE_TYPE (init)) /* ptrmemfunc */ |
a16f2357 | 4778 | { |
4038c495 | 4779 | init = reshape_init (type, init); |
6e1b3a7c AH |
4780 | |
4781 | if ((*targetm.vector_opaque_p) (type)) | |
4782 | { | |
4783 | error ("opaque vector types cannot be initialized"); | |
4784 | init = error_mark_node; | |
4785 | } | |
a16f2357 | 4786 | } |
8e3df2de MM |
4787 | |
4788 | /* If DECL has an array type without a specific bound, deduce the | |
4789 | array size from the initializer. */ | |
4790 | maybe_deduce_size_from_array_init (decl, init); | |
4791 | type = TREE_TYPE (decl); | |
2b643eda MM |
4792 | if (type == error_mark_node) |
4793 | return NULL_TREE; | |
8e3df2de | 4794 | |
27778b73 MM |
4795 | if (TYPE_HAS_CONSTRUCTOR (type) || TYPE_NEEDS_CONSTRUCTING (type)) |
4796 | { | |
4797 | if (TREE_CODE (type) == ARRAY_TYPE) | |
8e3df2de | 4798 | goto initialize_aggr; |
4038c495 | 4799 | else if (TREE_CODE (init) == CONSTRUCTOR) |
27778b73 MM |
4800 | { |
4801 | if (TYPE_NON_AGGREGATE_CLASS (type)) | |
4802 | { | |
2d01edd7 | 4803 | error ("%qD must be initialized by constructor, " |
0cbd7506 | 4804 | "not by %<{...}%>", |
8e3df2de | 4805 | decl); |
27778b73 MM |
4806 | init = error_mark_node; |
4807 | } | |
4808 | else | |
4809 | goto dont_use_constructor; | |
4810 | } | |
8e3df2de MM |
4811 | else |
4812 | { | |
4813 | int saved_stmts_are_full_exprs_p; | |
4814 | ||
4815 | initialize_aggr: | |
4816 | saved_stmts_are_full_exprs_p = 0; | |
4817 | if (building_stmt_tree ()) | |
4818 | { | |
4819 | saved_stmts_are_full_exprs_p = stmts_are_full_exprs_p (); | |
4820 | current_stmt_tree ()->stmts_are_full_exprs_p = 1; | |
4821 | } | |
4822 | init = build_aggr_init (decl, init, flags); | |
4823 | if (building_stmt_tree ()) | |
4824 | current_stmt_tree ()->stmts_are_full_exprs_p = | |
4825 | saved_stmts_are_full_exprs_p; | |
4826 | return init; | |
4827 | } | |
27778b73 MM |
4828 | } |
4829 | else | |
4830 | { | |
4831 | dont_use_constructor: | |
4832 | if (TREE_CODE (init) != TREE_VEC) | |
25ebb82a RH |
4833 | { |
4834 | init_code = store_init_value (decl, init); | |
7a8380ae NS |
4835 | if (pedantic && TREE_CODE (type) == ARRAY_TYPE |
4836 | && DECL_INITIAL (decl) | |
4837 | && TREE_CODE (DECL_INITIAL (decl)) == STRING_CST | |
4838 | && PAREN_STRING_LITERAL_P (DECL_INITIAL (decl))) | |
d4ee4d25 | 4839 | warning (0, "array %qD initialized by parenthesized string literal %qE", |
7a8380ae | 4840 | decl, DECL_INITIAL (decl)); |
25ebb82a RH |
4841 | init = NULL; |
4842 | } | |
27778b73 | 4843 | } |
27778b73 MM |
4844 | } |
4845 | else if (DECL_EXTERNAL (decl)) | |
4846 | ; | |
8e3df2de MM |
4847 | else if (TYPE_P (type) && TYPE_NEEDS_CONSTRUCTING (type)) |
4848 | goto initialize_aggr; | |
4849 | else if (IS_AGGR_TYPE (type)) | |
27778b73 MM |
4850 | { |
4851 | tree core_type = strip_array_types (type); | |
4852 | ||
8e3df2de | 4853 | if (CLASSTYPE_READONLY_FIELDS_NEED_INIT (core_type)) |
2d01edd7 | 4854 | error ("structure %qD with uninitialized const members", decl); |
8e3df2de | 4855 | if (CLASSTYPE_REF_FIELDS_NEED_INIT (core_type)) |
2d01edd7 | 4856 | error ("structure %qD with uninitialized reference members", decl); |
27778b73 MM |
4857 | |
4858 | check_for_uninitialized_const_var (decl); | |
27778b73 MM |
4859 | } |
4860 | else | |
4861 | check_for_uninitialized_const_var (decl); | |
68642fb6 | 4862 | |
8e3df2de | 4863 | if (init && init != error_mark_node) |
f293ce4b | 4864 | init_code = build2 (INIT_EXPR, type, decl, init); |
8e3df2de | 4865 | |
25ebb82a | 4866 | return init_code; |
27778b73 MM |
4867 | } |
4868 | ||
4869 | /* If DECL is not a local variable, give it RTL. */ | |
4870 | ||
4871 | static void | |
11f6b451 | 4872 | make_rtl_for_nonlocal_decl (tree decl, tree init, const char* asmspec) |
27778b73 | 4873 | { |
95ee998c MM |
4874 | int toplev = toplevel_bindings_p (); |
4875 | int defer_p; | |
9f12b095 | 4876 | const char *filename; |
27778b73 | 4877 | |
0e6df31e GK |
4878 | /* Set the DECL_ASSEMBLER_NAME for the object. */ |
4879 | if (asmspec) | |
4880 | { | |
4881 | /* The `register' keyword, when used together with an | |
4882 | asm-specification, indicates that the variable should be | |
4883 | placed in a particular register. */ | |
4884 | if (TREE_CODE (decl) == VAR_DECL && DECL_REGISTER (decl)) | |
4885 | { | |
11e3f4b6 | 4886 | set_user_assembler_name (decl, asmspec); |
0e6df31e GK |
4887 | DECL_HARD_REGISTER (decl) = 1; |
4888 | } | |
4889 | else | |
b482789c MA |
4890 | { |
4891 | if (TREE_CODE (decl) == FUNCTION_DECL | |
4892 | && DECL_BUILT_IN_CLASS (decl) == BUILT_IN_NORMAL) | |
4893 | set_builtin_user_assembler_name (decl, asmspec); | |
4894 | set_user_assembler_name (decl, asmspec); | |
4895 | } | |
0e6df31e GK |
4896 | } |
4897 | ||
f39ee884 MM |
4898 | /* Handle non-variables up front. */ |
4899 | if (TREE_CODE (decl) != VAR_DECL) | |
4900 | { | |
0e6df31e | 4901 | rest_of_decl_compilation (decl, toplev, at_eof); |
f39ee884 MM |
4902 | return; |
4903 | } | |
4904 | ||
95ee998c MM |
4905 | /* If we see a class member here, it should be a static data |
4906 | member. */ | |
4907 | if (DECL_LANG_SPECIFIC (decl) && DECL_IN_AGGR_P (decl)) | |
4908 | { | |
50bc768d | 4909 | gcc_assert (TREE_STATIC (decl)); |
95ee998c MM |
4910 | /* An in-class declaration of a static data member should be |
4911 | external; it is only a declaration, and not a definition. */ | |
4912 | if (init == NULL_TREE) | |
50bc768d | 4913 | gcc_assert (DECL_EXTERNAL (decl)); |
95ee998c MM |
4914 | } |
4915 | ||
95ee998c MM |
4916 | /* We don't create any RTL for local variables. */ |
4917 | if (DECL_FUNCTION_SCOPE_P (decl) && !TREE_STATIC (decl)) | |
4918 | return; | |
27778b73 | 4919 | |
95ee998c | 4920 | /* We defer emission of local statics until the corresponding |
350fae66 | 4921 | DECL_EXPR is expanded. */ |
95ee998c MM |
4922 | defer_p = DECL_FUNCTION_SCOPE_P (decl) || DECL_VIRTUAL_P (decl); |
4923 | ||
b602511f JM |
4924 | /* We try to defer namespace-scope static constants so that they are |
4925 | not emitted into the object file unnecessarily. */ | |
9f12b095 | 4926 | filename = input_filename; |
b602511f JM |
4927 | if (!DECL_VIRTUAL_P (decl) |
4928 | && TREE_READONLY (decl) | |
4929 | && DECL_INITIAL (decl) != NULL_TREE | |
4930 | && DECL_INITIAL (decl) != error_mark_node | |
9f12b095 | 4931 | && filename != NULL |
b602511f JM |
4932 | && ! EMPTY_CONSTRUCTOR_P (DECL_INITIAL (decl)) |
4933 | && toplev | |
4934 | && !TREE_PUBLIC (decl)) | |
5cc90635 JM |
4935 | { |
4936 | /* Fool with the linkage of static consts according to #pragma | |
4937 | interface. */ | |
c533e34d | 4938 | struct c_fileinfo *finfo = get_fileinfo (filename); |
5d709b00 | 4939 | if (!finfo->interface_unknown && !TREE_PUBLIC (decl)) |
27778b73 | 4940 | { |
95ee998c | 4941 | TREE_PUBLIC (decl) = 1; |
5d709b00 | 4942 | DECL_EXTERNAL (decl) = finfo->interface_only; |
27778b73 | 4943 | } |
27778b73 | 4944 | |
95ee998c | 4945 | defer_p = 1; |
27778b73 | 4946 | } |
b602511f | 4947 | /* Likewise for template instantiations. */ |
4684cd27 MM |
4948 | else if (DECL_LANG_SPECIFIC (decl) |
4949 | && DECL_IMPLICIT_INSTANTIATION (decl)) | |
b602511f | 4950 | defer_p = 1; |
95ee998c | 4951 | |
95ee998c | 4952 | /* If we're not deferring, go ahead and assemble the variable. */ |
0e6df31e GK |
4953 | if (!defer_p) |
4954 | rest_of_decl_compilation (decl, toplev, at_eof); | |
27778b73 MM |
4955 | } |
4956 | ||
ed5511d9 | 4957 | /* Generate code to initialize DECL (a local variable). */ |
27778b73 | 4958 | |
8e3df2de | 4959 | static void |
11f6b451 | 4960 | initialize_local_var (tree decl, tree init) |
27778b73 | 4961 | { |
9ed9e79a | 4962 | tree type = TREE_TYPE (decl); |
170b020f | 4963 | tree cleanup; |
27778b73 | 4964 | |
50bc768d NS |
4965 | gcc_assert (TREE_CODE (decl) == VAR_DECL |
4966 | || TREE_CODE (decl) == RESULT_DECL); | |
4967 | gcc_assert (!TREE_STATIC (decl)); | |
b7b8bcd2 | 4968 | |
8e3df2de | 4969 | if (DECL_SIZE (decl) == NULL_TREE) |
b7b8bcd2 MM |
4970 | { |
4971 | /* If we used it already as memory, it must stay in memory. */ | |
4972 | DECL_INITIAL (decl) = NULL_TREE; | |
4973 | TREE_ADDRESSABLE (decl) = TREE_USED (decl); | |
4974 | } | |
4975 | ||
27778b73 MM |
4976 | if (DECL_SIZE (decl) && type != error_mark_node) |
4977 | { | |
4978 | int already_used; | |
68642fb6 | 4979 | |
27778b73 | 4980 | /* Compute and store the initial value. */ |
27778b73 MM |
4981 | already_used = TREE_USED (decl) || TREE_USED (type); |
4982 | ||
8e3df2de MM |
4983 | /* Perform the initialization. */ |
4984 | if (init) | |
27778b73 | 4985 | { |
24bef158 MM |
4986 | int saved_stmts_are_full_exprs_p; |
4987 | ||
50bc768d | 4988 | gcc_assert (building_stmt_tree ()); |
f2c5f623 | 4989 | saved_stmts_are_full_exprs_p = stmts_are_full_exprs_p (); |
ae499cce | 4990 | current_stmt_tree ()->stmts_are_full_exprs_p = 1; |
8e3df2de | 4991 | finish_expr_stmt (init); |
5362b086 | 4992 | current_stmt_tree ()->stmts_are_full_exprs_p = |
ae499cce | 4993 | saved_stmts_are_full_exprs_p; |
27778b73 MM |
4994 | } |
4995 | ||
4996 | /* Set this to 0 so we can tell whether an aggregate which was | |
4997 | initialized was ever used. Don't do this if it has a | |
4998 | destructor, so we don't complain about the 'resource | |
b7b8bcd2 MM |
4999 | allocation is initialization' idiom. Now set |
5000 | attribute((unused)) on types so decls of that type will be | |
5001 | marked used. (see TREE_USED, above.) */ | |
27778b73 MM |
5002 | if (TYPE_NEEDS_CONSTRUCTING (type) |
5003 | && ! already_used | |
834c6dff | 5004 | && TYPE_HAS_TRIVIAL_DESTRUCTOR (type) |
27778b73 MM |
5005 | && DECL_NAME (decl)) |
5006 | TREE_USED (decl) = 0; | |
b7b8bcd2 | 5007 | else if (already_used) |
27778b73 MM |
5008 | TREE_USED (decl) = 1; |
5009 | } | |
24bef158 | 5010 | |
8e3df2de | 5011 | /* Generate a cleanup, if necessary. */ |
170b020f MM |
5012 | cleanup = cxx_maybe_build_cleanup (decl); |
5013 | if (DECL_SIZE (decl) && cleanup) | |
5014 | finish_decl_cleanup (decl, cleanup); | |
24bef158 MM |
5015 | } |
5016 | ||
19c29b2f MM |
5017 | /* DECL is a VAR_DECL for a compiler-generated variable with static |
5018 | storage duration (like a virtual table) whose initializer is a | |
3b2db49f MM |
5019 | compile-time constant. INIT must be either a TREE_LIST of values, |
5020 | or a CONSTRUCTOR. Initialize the variable and provide it to the | |
5021 | back end. */ | |
19c29b2f MM |
5022 | |
5023 | void | |
5024 | initialize_artificial_var (tree decl, tree init) | |
5025 | { | |
d23f3d60 | 5026 | gcc_assert (DECL_ARTIFICIAL (decl)); |
3b2db49f MM |
5027 | if (TREE_CODE (init) == TREE_LIST) |
5028 | init = build_constructor_from_list (NULL_TREE, init); | |
5029 | gcc_assert (TREE_CODE (init) == CONSTRUCTOR); | |
5030 | DECL_INITIAL (decl) = init; | |
19c29b2f MM |
5031 | DECL_INITIALIZED_P (decl) = 1; |
5032 | determine_visibility (decl); | |
5033 | layout_var_decl (decl); | |
5034 | maybe_commonize_var (decl); | |
5035 | make_rtl_for_nonlocal_decl (decl, init, /*asmspec=*/NULL); | |
5036 | } | |
5037 | ||
8d08fdba MS |
5038 | /* Finish processing of a declaration; |
5039 | install its line number and initial value. | |
5040 | If the length of an array type is not known before, | |
5041 | it must be determined now, from the initial value, or it is an error. | |
5042 | ||
d174af6c MM |
5043 | INIT is the initializer (if any) for DECL. If INIT_CONST_EXPR_P is |
5044 | true, then INIT is an integral constant expression. | |
8d08fdba | 5045 | |
920f9474 | 5046 | FLAGS is LOOKUP_ONLYCONVERTING if the = init syntax was used, else 0 |
f78c7bc6 | 5047 | if the (init) syntax was used. */ |
8d08fdba MS |
5048 | |
5049 | void | |
3db45ab5 | 5050 | cp_finish_decl (tree decl, tree init, bool init_const_expr_p, |
d174af6c | 5051 | tree asmspec_tree, int flags) |
8d08fdba | 5052 | { |
7e99327d | 5053 | tree type; |
7e99327d | 5054 | tree cleanup; |
9c0758dd | 5055 | const char *asmspec = NULL; |
8d08fdba | 5056 | int was_readonly = 0; |
745d26d9 | 5057 | bool var_definition_p = false; |
2b643eda | 5058 | int saved_processing_template_decl; |
8d08fdba | 5059 | |
11325dcd KL |
5060 | if (decl == error_mark_node) |
5061 | return; | |
5062 | else if (! decl) | |
8d08fdba MS |
5063 | { |
5064 | if (init) | |
8251199e | 5065 | error ("assignment (not initialization) in declaration"); |
8d08fdba MS |
5066 | return; |
5067 | } | |
5068 | ||
50bc768d | 5069 | gcc_assert (TREE_CODE (decl) != RESULT_DECL); |
2b643eda MM |
5070 | /* Parameters are handled by store_parm_decls, not cp_finish_decl. */ |
5071 | gcc_assert (TREE_CODE (decl) != PARM_DECL); | |
5072 | ||
5073 | type = TREE_TYPE (decl); | |
5074 | if (type == error_mark_node) | |
5075 | return; | |
170b020f | 5076 | |
7e99327d MM |
5077 | /* Assume no cleanup is required. */ |
5078 | cleanup = NULL_TREE; | |
2b643eda | 5079 | saved_processing_template_decl = processing_template_decl; |
7e99327d | 5080 | |
a4443a08 | 5081 | /* If a name was specified, get the string. */ |
5f52c0e0 | 5082 | if (global_scope_p (current_binding_level)) |
41c64394 | 5083 | asmspec_tree = maybe_apply_renaming_pragma (decl, asmspec_tree); |
4f543d15 | 5084 | if (asmspec_tree && asmspec_tree != error_mark_node) |
5cc90635 | 5085 | asmspec = TREE_STRING_POINTER (asmspec_tree); |
8d08fdba | 5086 | |
6ba89f8e | 5087 | if (current_class_type |
4f1c5b7d | 5088 | && CP_DECL_CONTEXT (decl) == current_class_type |
6ba89f8e MM |
5089 | && TYPE_BEING_DEFINED (current_class_type) |
5090 | && (DECL_INITIAL (decl) || init)) | |
3febd123 | 5091 | DECL_INITIALIZED_IN_CLASS_P (decl) = 1; |
6ba89f8e | 5092 | |
5156628f | 5093 | if (processing_template_decl) |
5566b478 | 5094 | { |
2b643eda MM |
5095 | bool type_dependent_p; |
5096 | ||
08ac397c | 5097 | /* Add this declaration to the statement-tree. */ |
170b020f | 5098 | if (at_function_scope_p ()) |
350fae66 | 5099 | add_decl_expr (decl); |
08ac397c | 5100 | |
2b643eda MM |
5101 | type_dependent_p = dependent_type_p (type); |
5102 | ||
5103 | if (init && init_const_expr_p) | |
d174af6c | 5104 | { |
2b643eda MM |
5105 | DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (decl) = 1; |
5106 | if (DECL_INTEGRAL_CONSTANT_VAR_P (decl)) | |
5107 | TREE_CONSTANT (decl) = 1; | |
d174af6c MM |
5108 | } |
5109 | ||
2b643eda MM |
5110 | if (!init |
5111 | || !DECL_CLASS_SCOPE_P (decl) | |
5112 | || !DECL_INTEGRAL_CONSTANT_VAR_P (decl) | |
5113 | || type_dependent_p | |
fd5b5108 JJ |
5114 | || value_dependent_expression_p (init) |
5115 | /* Check also if initializer is a value dependent | |
5116 | { integral_constant_expression }. */ | |
5117 | || (TREE_CODE (init) == CONSTRUCTOR | |
5118 | && VEC_length (constructor_elt, CONSTRUCTOR_ELTS (init)) == 1 | |
5119 | && value_dependent_expression_p | |
5120 | (VEC_index (constructor_elt, | |
5121 | CONSTRUCTOR_ELTS (init), 0)->value))) | |
2b643eda MM |
5122 | { |
5123 | if (init) | |
5124 | DECL_INITIAL (decl) = init; | |
5125 | if (TREE_CODE (decl) == VAR_DECL | |
5126 | && !DECL_PRETTY_FUNCTION_P (decl) | |
5127 | && !type_dependent_p) | |
5128 | maybe_deduce_size_from_array_init (decl, init); | |
5129 | goto finish_end; | |
5130 | } | |
c8094d83 | 5131 | |
2b643eda MM |
5132 | init = fold_non_dependent_expr (init); |
5133 | processing_template_decl = 0; | |
5566b478 | 5134 | } |
3e41d13b | 5135 | |
8d08fdba MS |
5136 | /* Take care of TYPE_DECLs up front. */ |
5137 | if (TREE_CODE (decl) == TYPE_DECL) | |
5138 | { | |
a0a33927 MS |
5139 | if (type != error_mark_node |
5140 | && IS_AGGR_TYPE (type) && DECL_NAME (decl)) | |
8d08fdba MS |
5141 | { |
5142 | if (TREE_TYPE (DECL_NAME (decl)) && TREE_TYPE (decl) != type) | |
d4ee4d25 | 5143 | warning (0, "shadowing previous type declaration of %q#D", decl); |
4b0d3cbe | 5144 | set_identifier_type_value (DECL_NAME (decl), decl); |
8d08fdba | 5145 | } |
cffa8729 MS |
5146 | |
5147 | /* If we have installed this as the canonical typedef for this | |
5148 | type, and that type has not been defined yet, delay emitting | |
956d6950 | 5149 | the debug information for it, as we will emit it later. */ |
d2e5ee5c | 5150 | if (TYPE_MAIN_DECL (TREE_TYPE (decl)) == decl |
d0f062fb | 5151 | && !COMPLETE_TYPE_P (TREE_TYPE (decl))) |
cffa8729 MS |
5152 | TYPE_DECL_SUPPRESS_DEBUG (decl) = 1; |
5153 | ||
0e6df31e GK |
5154 | rest_of_decl_compilation (decl, DECL_CONTEXT (decl) == NULL_TREE, |
5155 | at_eof); | |
8d08fdba MS |
5156 | goto finish_end; |
5157 | } | |
3e41d13b | 5158 | |
67935995 | 5159 | /* A reference will be modified here, as it is initialized. */ |
c8094d83 | 5160 | if (! DECL_EXTERNAL (decl) |
67935995 MM |
5161 | && TREE_READONLY (decl) |
5162 | && TREE_CODE (type) == REFERENCE_TYPE) | |
8d08fdba | 5163 | { |
8d08fdba | 5164 | was_readonly = 1; |
67935995 | 5165 | TREE_READONLY (decl) = 0; |
8d08fdba MS |
5166 | } |
5167 | ||
437081d7 | 5168 | if (TREE_CODE (decl) == VAR_DECL) |
17bbb839 MM |
5169 | { |
5170 | /* Only PODs can have thread-local storage. Other types may require | |
5171 | various kinds of non-trivial initialization. */ | |
c2f7fa15 | 5172 | if (DECL_THREAD_LOCAL_P (decl) && !pod_type_p (TREE_TYPE (decl))) |
2d01edd7 | 5173 | error ("%qD cannot be thread-local because it has non-POD type %qT", |
17bbb839 | 5174 | decl, TREE_TYPE (decl)); |
d23f3d60 MM |
5175 | /* If this is a local variable that will need a mangled name, |
5176 | register it now. We must do this before processing the | |
5177 | initializer for the variable, since the initialization might | |
5178 | require a guard variable, and since the mangled name of the | |
5179 | guard variable will depend on the mangled name of this | |
5180 | variable. */ | |
5181 | if (!processing_template_decl | |
5182 | && DECL_FUNCTION_SCOPE_P (decl) | |
5183 | && TREE_STATIC (decl) | |
5184 | && !DECL_ARTIFICIAL (decl)) | |
5185 | push_local_name (decl); | |
17bbb839 MM |
5186 | /* Convert the initializer to the type of DECL, if we have not |
5187 | already initialized DECL. */ | |
5188 | if (!DECL_INITIALIZED_P (decl) | |
5189 | /* If !DECL_EXTERNAL then DECL is being defined. In the | |
8e3df2de | 5190 | case of a static data member initialized inside the |
17bbb839 MM |
5191 | class-specifier, there can be an initializer even if DECL |
5192 | is *not* defined. */ | |
5193 | && (!DECL_EXTERNAL (decl) || init)) | |
5194 | { | |
6c06fbce | 5195 | if (init) |
d174af6c MM |
5196 | { |
5197 | DECL_NONTRIVIALLY_INITIALIZED_P (decl) = 1; | |
5198 | if (init_const_expr_p) | |
5199 | { | |
5200 | DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (decl) = 1; | |
5201 | if (DECL_INTEGRAL_CONSTANT_VAR_P (decl)) | |
5202 | TREE_CONSTANT (decl) = 1; | |
5203 | } | |
5204 | } | |
7e99327d | 5205 | init = check_initializer (decl, init, flags, &cleanup); |
b4c20e52 | 5206 | /* Thread-local storage cannot be dynamically initialized. */ |
c2f7fa15 | 5207 | if (DECL_THREAD_LOCAL_P (decl) && init) |
b4c20e52 | 5208 | { |
2d01edd7 | 5209 | error ("%qD is thread-local and so cannot be dynamically " |
b4c20e52 MM |
5210 | "initialized", decl); |
5211 | init = NULL_TREE; | |
5212 | } | |
b794e321 MM |
5213 | |
5214 | /* Check that the initializer for a static data member was a | |
1634705d | 5215 | constant. Although we check in the parser that the |
b794e321 MM |
5216 | initializer is an integral constant expression, we do not |
5217 | simplify division-by-zero at the point at which it | |
5218 | occurs. Therefore, in: | |
5219 | ||
5220 | struct S { static const int i = 7 / 0; }; | |
3db45ab5 | 5221 | |
b794e321 MM |
5222 | we issue an error at this point. It would |
5223 | probably be better to forbid division by zero in | |
5224 | integral constant expressions. */ | |
8fe4d24b NS |
5225 | if (DECL_EXTERNAL (decl) && init) |
5226 | { | |
8fe4d24b NS |
5227 | error ("%qD cannot be initialized by a non-constant expression" |
5228 | " when being declared", decl); | |
5229 | DECL_INITIALIZED_IN_CLASS_P (decl) = 0; | |
5230 | init = NULL_TREE; | |
5231 | } | |
c8094d83 | 5232 | |
17bbb839 | 5233 | /* Handle: |
caf93cb0 | 5234 | |
17bbb839 | 5235 | [dcl.init] |
caf93cb0 | 5236 | |
17bbb839 MM |
5237 | The memory occupied by any object of static storage |
5238 | duration is zero-initialized at program startup before | |
5239 | any other initialization takes place. | |
caf93cb0 | 5240 | |
17bbb839 MM |
5241 | We cannot create an appropriate initializer until after |
5242 | the type of DECL is finalized. If DECL_INITIAL is set, | |
5243 | then the DECL is statically initialized, and any | |
5244 | necessary zero-initialization has already been performed. */ | |
5245 | if (TREE_STATIC (decl) && !DECL_INITIAL (decl)) | |
5246 | DECL_INITIAL (decl) = build_zero_init (TREE_TYPE (decl), | |
1cb8292f | 5247 | /*nelts=*/NULL_TREE, |
17bbb839 MM |
5248 | /*static_storage_p=*/true); |
5249 | /* Remember that the initialization for this variable has | |
5250 | taken place. */ | |
5251 | DECL_INITIALIZED_P (decl) = 1; | |
745d26d9 MM |
5252 | /* This declaration is the definition of this variable, |
5253 | unless we are initializing a static data member within | |
5254 | the class specifier. */ | |
5255 | if (!DECL_EXTERNAL (decl)) | |
5256 | var_definition_p = true; | |
17bbb839 | 5257 | } |
d881ff25 MM |
5258 | /* If the variable has an array type, lay out the type, even if |
5259 | there is no initializer. It is valid to index through the | |
5260 | array, and we must get TYPE_ALIGN set correctly on the array | |
5261 | type. */ | |
5262 | else if (TREE_CODE (type) == ARRAY_TYPE) | |
5263 | layout_type (type); | |
17bbb839 | 5264 | } |
3e41d13b | 5265 | |
57cf57fb | 5266 | /* Add this declaration to the statement-tree. This needs to happen |
350fae66 RK |
5267 | after the call to check_initializer so that the DECL_EXPR for a |
5268 | reference temp is added before the DECL_EXPR for the reference itself. */ | |
170b020f | 5269 | if (at_function_scope_p ()) |
350fae66 | 5270 | add_decl_expr (decl); |
08ac397c | 5271 | |
da71e18c MM |
5272 | /* Let the middle end know about variables and functions -- but not |
5273 | static data members in uninstantiated class templates. */ | |
5274 | if (!saved_processing_template_decl | |
5275 | && (TREE_CODE (decl) == VAR_DECL | |
5276 | || TREE_CODE (decl) == FUNCTION_DECL)) | |
8d08fdba | 5277 | { |
27778b73 | 5278 | if (TREE_CODE (decl) == VAR_DECL) |
da71e18c MM |
5279 | { |
5280 | layout_var_decl (decl); | |
5281 | maybe_commonize_var (decl); | |
b70f0f48 JM |
5282 | if (DECL_NAMESPACE_SCOPE_P (decl) && !TREE_PUBLIC (decl) |
5283 | && !DECL_THIS_STATIC (decl) && !DECL_ARTIFICIAL (decl)) | |
5284 | { | |
5285 | /* This is a const variable with implicit 'static'. Set | |
5286 | DECL_THIS_STATIC so we can tell it from variables that are | |
5287 | !TREE_PUBLIC because of the anonymous namespace. */ | |
5288 | DECL_THIS_STATIC (decl) = 1; | |
5289 | } | |
da71e18c | 5290 | } |
8d08fdba | 5291 | |
27778b73 | 5292 | make_rtl_for_nonlocal_decl (decl, init, asmspec); |
8d08fdba | 5293 | |
7fb213d8 GB |
5294 | /* Check for abstractness of the type. Notice that there is no |
5295 | need to strip array types here since the check for those types | |
5296 | is already done within create_array_type_for_decl. */ | |
68642fb6 | 5297 | if (TREE_CODE (type) == FUNCTION_TYPE |
27778b73 | 5298 | || TREE_CODE (type) == METHOD_TYPE) |
7fb213d8 | 5299 | abstract_virtuals_error (decl, TREE_TYPE (type)); |
68642fb6 | 5300 | else |
cfb91b67 | 5301 | abstract_virtuals_error (decl, type); |
8d08fdba | 5302 | |
b9e75696 JM |
5303 | /* This needs to happen after the linkage is set. */ |
5304 | determine_visibility (decl); | |
5305 | ||
caf93cb0 | 5306 | if (TREE_CODE (decl) == FUNCTION_DECL |
8e3df2de MM |
5307 | || TREE_TYPE (decl) == error_mark_node) |
5308 | /* No initialization required. */ | |
faae18ab | 5309 | ; |
67d743fe MS |
5310 | else if (DECL_EXTERNAL (decl) |
5311 | && ! (DECL_LANG_SPECIFIC (decl) | |
5312 | && DECL_NOT_REALLY_EXTERN (decl))) | |
5566b478 MS |
5313 | { |
5314 | if (init) | |
5315 | DECL_INITIAL (decl) = init; | |
5316 | } | |
8e3df2de | 5317 | else |
8d08fdba | 5318 | { |
8e3df2de MM |
5319 | /* A variable definition. */ |
5320 | if (DECL_FUNCTION_SCOPE_P (decl)) | |
24bef158 | 5321 | { |
8e3df2de MM |
5322 | /* Initialize the local variable. */ |
5323 | if (processing_template_decl) | |
e92fb501 | 5324 | DECL_INITIAL (decl) = init; |
8e3df2de MM |
5325 | else if (!TREE_STATIC (decl)) |
5326 | initialize_local_var (decl, init); | |
24bef158 | 5327 | } |
c8094d83 | 5328 | |
745d26d9 | 5329 | /* If a variable is defined, and then a subsequent |
06b60445 | 5330 | definition with external linkage is encountered, we will |
745d26d9 MM |
5331 | get here twice for the same variable. We want to avoid |
5332 | calling expand_static_init more than once. For variables | |
5333 | that are not static data members, we can call | |
5334 | expand_static_init only when we actually process the | |
5335 | initializer. It is not legal to redeclare a static data | |
5336 | member, so this issue does not arise in that case. */ | |
5337 | if (var_definition_p && TREE_STATIC (decl)) | |
c8094d83 MS |
5338 | expand_static_init (decl, init); |
5339 | } | |
8d08fdba MS |
5340 | } |
5341 | ||
7e99327d MM |
5342 | /* If a CLEANUP_STMT was created to destroy a temporary bound to a |
5343 | reference, insert it in the statement-tree now. */ | |
5344 | if (cleanup) | |
325c3691 | 5345 | push_cleanup (decl, cleanup, false); |
7e99327d | 5346 | |
8d08fdba | 5347 | finish_end: |
2b643eda | 5348 | processing_template_decl = saved_processing_template_decl; |
8d08fdba | 5349 | |
8d08fdba MS |
5350 | if (was_readonly) |
5351 | TREE_READONLY (decl) = 1; | |
d1bd0ded GK |
5352 | |
5353 | /* If this was marked 'used', be sure it will be output. */ | |
5354 | if (lookup_attribute ("used", DECL_ATTRIBUTES (decl))) | |
bb9a388d | 5355 | mark_decl_referenced (decl); |
8d08fdba MS |
5356 | } |
5357 | ||
f4f206f4 | 5358 | /* This is here for a midend callback from c-common.c. */ |
e92cc029 | 5359 | |
82580166 | 5360 | void |
11f6b451 | 5361 | finish_decl (tree decl, tree init, tree asmspec_tree) |
82580166 | 5362 | { |
d174af6c | 5363 | cp_finish_decl (decl, init, /*init_const_expr_p=*/false, asmspec_tree, 0); |
82580166 MS |
5364 | } |
5365 | ||
db4283a0 MM |
5366 | /* Returns a declaration for a VAR_DECL as if: |
5367 | ||
5368 | extern "C" TYPE NAME; | |
5369 | ||
5370 | had been seen. Used to create compiler-generated global | |
5371 | variables. */ | |
5372 | ||
993acaec | 5373 | static tree |
11f6b451 | 5374 | declare_global_var (tree name, tree type) |
db4283a0 MM |
5375 | { |
5376 | tree decl; | |
5377 | ||
5378 | push_to_top_level (); | |
5379 | decl = build_decl (VAR_DECL, name, type); | |
5380 | TREE_PUBLIC (decl) = 1; | |
5381 | DECL_EXTERNAL (decl) = 1; | |
5382 | DECL_ARTIFICIAL (decl) = 1; | |
de3fe73c MM |
5383 | /* If the user has explicitly declared this variable (perhaps |
5384 | because the code we are compiling is part of a low-level runtime | |
5385 | library), then it is possible that our declaration will be merged | |
5386 | with theirs by pushdecl. */ | |
5387 | decl = pushdecl (decl); | |
d174af6c | 5388 | finish_decl (decl, NULL_TREE, NULL_TREE); |
db4283a0 MM |
5389 | pop_from_top_level (); |
5390 | ||
5391 | return decl; | |
5392 | } | |
5393 | ||
5394 | /* Returns a pointer to the `atexit' function. Note that if | |
838dfd8a | 5395 | FLAG_USE_CXA_ATEXIT is nonzero, then this will actually be the new |
db4283a0 MM |
5396 | `__cxa_atexit' function specified in the IA64 C++ ABI. */ |
5397 | ||
5398 | static tree | |
11f6b451 | 5399 | get_atexit_node (void) |
db4283a0 MM |
5400 | { |
5401 | tree atexit_fndecl; | |
5402 | tree arg_types; | |
5403 | tree fn_type; | |
5404 | tree fn_ptr_type; | |
5405 | const char *name; | |
9f62c3e3 | 5406 | bool use_aeabi_atexit; |
db4283a0 MM |
5407 | |
5408 | if (atexit_node) | |
5409 | return atexit_node; | |
5410 | ||
97388150 | 5411 | if (flag_use_cxa_atexit && !targetm.cxx.use_atexit_for_cxa_atexit ()) |
db4283a0 MM |
5412 | { |
5413 | /* The declaration for `__cxa_atexit' is: | |
5414 | ||
5415 | int __cxa_atexit (void (*)(void *), void *, void *) | |
5416 | ||
5417 | We build up the argument types and then then function type | |
5418 | itself. */ | |
68642fb6 | 5419 | |
9f62c3e3 | 5420 | use_aeabi_atexit = targetm.cxx.use_aeabi_atexit (); |
db4283a0 MM |
5421 | /* First, build the pointer-to-function type for the first |
5422 | argument. */ | |
5423 | arg_types = tree_cons (NULL_TREE, ptr_type_node, void_list_node); | |
5424 | fn_type = build_function_type (void_type_node, arg_types); | |
5425 | fn_ptr_type = build_pointer_type (fn_type); | |
5426 | /* Then, build the rest of the argument types. */ | |
5427 | arg_types = tree_cons (NULL_TREE, ptr_type_node, void_list_node); | |
9f62c3e3 PB |
5428 | if (use_aeabi_atexit) |
5429 | { | |
5430 | arg_types = tree_cons (NULL_TREE, fn_ptr_type, arg_types); | |
5431 | arg_types = tree_cons (NULL_TREE, ptr_type_node, arg_types); | |
5432 | } | |
5433 | else | |
5434 | { | |
5435 | arg_types = tree_cons (NULL_TREE, ptr_type_node, arg_types); | |
5436 | arg_types = tree_cons (NULL_TREE, fn_ptr_type, arg_types); | |
5437 | } | |
db4283a0 MM |
5438 | /* And the final __cxa_atexit type. */ |
5439 | fn_type = build_function_type (integer_type_node, arg_types); | |
5440 | fn_ptr_type = build_pointer_type (fn_type); | |
9f62c3e3 PB |
5441 | if (use_aeabi_atexit) |
5442 | name = "__aeabi_atexit"; | |
5443 | else | |
5444 | name = "__cxa_atexit"; | |
db4283a0 MM |
5445 | } |
5446 | else | |
5447 | { | |
5448 | /* The declaration for `atexit' is: | |
68642fb6 | 5449 | |
0cbd7506 | 5450 | int atexit (void (*)()); |
db4283a0 MM |
5451 | |
5452 | We build up the argument types and then then function type | |
5453 | itself. */ | |
5454 | fn_type = build_function_type (void_type_node, void_list_node); | |
5455 | fn_ptr_type = build_pointer_type (fn_type); | |
5456 | arg_types = tree_cons (NULL_TREE, fn_ptr_type, void_list_node); | |
5457 | /* Build the final atexit type. */ | |
5458 | fn_type = build_function_type (integer_type_node, arg_types); | |
5459 | name = "atexit"; | |
5460 | } | |
5461 | ||
5462 | /* Now, build the function declaration. */ | |
5463 | push_lang_context (lang_name_c); | |
0c11ada6 | 5464 | atexit_fndecl = build_library_fn_ptr (name, fn_type); |
db4283a0 MM |
5465 | mark_used (atexit_fndecl); |
5466 | pop_lang_context (); | |
0a72704b | 5467 | atexit_node = decay_conversion (atexit_fndecl); |
db4283a0 MM |
5468 | |
5469 | return atexit_node; | |
5470 | } | |
5471 | ||
5472 | /* Returns the __dso_handle VAR_DECL. */ | |
5473 | ||
5474 | static tree | |
11f6b451 | 5475 | get_dso_handle_node (void) |
db4283a0 MM |
5476 | { |
5477 | if (dso_handle_node) | |
5478 | return dso_handle_node; | |
5479 | ||
5480 | /* Declare the variable. */ | |
5481 | dso_handle_node = declare_global_var (get_identifier ("__dso_handle"), | |
5482 | ptr_type_node); | |
5483 | ||
5484 | return dso_handle_node; | |
5485 | } | |
5486 | ||
5487 | /* Begin a new function with internal linkage whose job will be simply | |
5488 | to destroy some particular variable. */ | |
5489 | ||
d192828a GK |
5490 | static GTY(()) int start_cleanup_cnt; |
5491 | ||
db4283a0 | 5492 | static tree |
11f6b451 | 5493 | start_cleanup_fn (void) |
db4283a0 | 5494 | { |
db4283a0 MM |
5495 | char name[32]; |
5496 | tree parmtypes; | |
5497 | tree fntype; | |
5498 | tree fndecl; | |
97388150 DS |
5499 | bool use_cxa_atexit = flag_use_cxa_atexit |
5500 | && !targetm.cxx.use_atexit_for_cxa_atexit (); | |
db4283a0 MM |
5501 | |
5502 | push_to_top_level (); | |
5503 | ||
5504 | /* No need to mangle this. */ | |
5505 | push_lang_context (lang_name_c); | |
5506 | ||
db4283a0 MM |
5507 | /* Build the parameter-types. */ |
5508 | parmtypes = void_list_node; | |
5509 | /* Functions passed to __cxa_atexit take an additional parameter. | |
5510 | We'll just ignore it. After we implement the new calling | |
5511 | convention for destructors, we can eliminate the use of | |
5512 | additional cleanup functions entirely in the -fnew-abi case. */ | |
97388150 | 5513 | if (use_cxa_atexit) |
db4283a0 MM |
5514 | parmtypes = tree_cons (NULL_TREE, ptr_type_node, parmtypes); |
5515 | /* Build the function type itself. */ | |
5516 | fntype = build_function_type (void_type_node, parmtypes); | |
5517 | /* Build the name of the function. */ | |
d192828a | 5518 | sprintf (name, "__tcf_%d", start_cleanup_cnt++); |
db4283a0 MM |
5519 | /* Build the function declaration. */ |
5520 | fndecl = build_lang_decl (FUNCTION_DECL, get_identifier (name), fntype); | |
5521 | /* It's a function with internal linkage, generated by the | |
5522 | compiler. */ | |
5523 | TREE_PUBLIC (fndecl) = 0; | |
5524 | DECL_ARTIFICIAL (fndecl) = 1; | |
5a728aca MM |
5525 | /* Make the function `inline' so that it is only emitted if it is |
5526 | actually needed. It is unlikely that it will be inlined, since | |
aba649ba | 5527 | it is only called via a function pointer, but we avoid unnecessary |
5a728aca MM |
5528 | emissions this way. */ |
5529 | DECL_INLINE (fndecl) = 1; | |
d4d1ebc1 JH |
5530 | DECL_DECLARED_INLINE_P (fndecl) = 1; |
5531 | DECL_INTERFACE_KNOWN (fndecl) = 1; | |
db4283a0 | 5532 | /* Build the parameter. */ |
97388150 | 5533 | if (use_cxa_atexit) |
db4283a0 MM |
5534 | { |
5535 | tree parmdecl; | |
5536 | ||
8e51619a | 5537 | parmdecl = cp_build_parm_decl (NULL_TREE, ptr_type_node); |
db4283a0 | 5538 | DECL_CONTEXT (parmdecl) = fndecl; |
db4283a0 MM |
5539 | TREE_USED (parmdecl) = 1; |
5540 | DECL_ARGUMENTS (fndecl) = parmdecl; | |
5541 | } | |
5542 | ||
09ed39ad | 5543 | pushdecl (fndecl); |
058b15c1 | 5544 | start_preparsed_function (fndecl, NULL_TREE, SF_PRE_PARSED); |
db4283a0 | 5545 | |
db4283a0 MM |
5546 | pop_lang_context (); |
5547 | ||
5548 | return current_function_decl; | |
5549 | } | |
5550 | ||
5551 | /* Finish the cleanup function begun by start_cleanup_fn. */ | |
5552 | ||
5553 | static void | |
11f6b451 | 5554 | end_cleanup_fn (void) |
db4283a0 | 5555 | { |
8cd2462c | 5556 | expand_or_defer_fn (finish_function (0)); |
db4283a0 MM |
5557 | |
5558 | pop_from_top_level (); | |
5559 | } | |
5560 | ||
bf419747 MM |
5561 | /* Generate code to handle the destruction of DECL, an object with |
5562 | static storage duration. */ | |
f0105ed3 | 5563 | |
40aac948 | 5564 | tree |
11f6b451 | 5565 | register_dtor_fn (tree decl) |
f0105ed3 | 5566 | { |
db4283a0 | 5567 | tree cleanup; |
f0105ed3 | 5568 | tree compound_stmt; |
db4283a0 MM |
5569 | tree args; |
5570 | tree fcall; | |
f0105ed3 | 5571 | |
834c6dff | 5572 | if (TYPE_HAS_TRIVIAL_DESTRUCTOR (TREE_TYPE (decl))) |
40aac948 | 5573 | return void_zero_node; |
bf419747 | 5574 | |
f0105ed3 MM |
5575 | /* Call build_cleanup before we enter the anonymous function so that |
5576 | any access checks will be done relative to the current scope, | |
5577 | rather than the scope of the anonymous function. */ | |
5578 | build_cleanup (decl); | |
5579 | ||
5580 | /* Now start the function. */ | |
db4283a0 | 5581 | cleanup = start_cleanup_fn (); |
f0105ed3 MM |
5582 | |
5583 | /* Now, recompute the cleanup. It may contain SAVE_EXPRs that refer | |
5584 | to the original function, rather than the anonymous one. That | |
3b426391 | 5585 | will make the back end think that nested functions are in use, |
f0105ed3 | 5586 | which causes confusion. */ |
caf93cb0 | 5587 | |
78757caa | 5588 | push_deferring_access_checks (dk_no_check); |
f0105ed3 | 5589 | fcall = build_cleanup (decl); |
78757caa | 5590 | pop_deferring_access_checks (); |
f0105ed3 MM |
5591 | |
5592 | /* Create the body of the anonymous function. */ | |
325c3691 | 5593 | compound_stmt = begin_compound_stmt (BCS_FN_BODY); |
f0105ed3 | 5594 | finish_expr_stmt (fcall); |
7a3397c7 | 5595 | finish_compound_stmt (compound_stmt); |
db4283a0 | 5596 | end_cleanup_fn (); |
f0105ed3 MM |
5597 | |
5598 | /* Call atexit with the cleanup function. */ | |
dffd7eb6 | 5599 | cxx_mark_addressable (cleanup); |
bb4f6e6b | 5600 | mark_used (cleanup); |
f0105ed3 | 5601 | cleanup = build_unary_op (ADDR_EXPR, cleanup, 0); |
97388150 | 5602 | if (flag_use_cxa_atexit && !targetm.cxx.use_atexit_for_cxa_atexit ()) |
db4283a0 | 5603 | { |
caf93cb0 | 5604 | args = tree_cons (NULL_TREE, |
0f268005 MM |
5605 | build_unary_op (ADDR_EXPR, get_dso_handle_node (), 0), |
5606 | NULL_TREE); | |
9f62c3e3 PB |
5607 | if (targetm.cxx.use_aeabi_atexit ()) |
5608 | { | |
5609 | args = tree_cons (NULL_TREE, cleanup, args); | |
5610 | args = tree_cons (NULL_TREE, null_pointer_node, args); | |
5611 | } | |
5612 | else | |
5613 | { | |
5614 | args = tree_cons (NULL_TREE, null_pointer_node, args); | |
5615 | args = tree_cons (NULL_TREE, cleanup, args); | |
5616 | } | |
db4283a0 MM |
5617 | } |
5618 | else | |
5619 | args = tree_cons (NULL_TREE, cleanup, NULL_TREE); | |
40aac948 | 5620 | return build_function_call (get_atexit_node (), args); |
f0105ed3 MM |
5621 | } |
5622 | ||
8e3df2de MM |
5623 | /* DECL is a VAR_DECL with static storage duration. INIT, if present, |
5624 | is its initializer. Generate code to handle the construction | |
5625 | and destruction of DECL. */ | |
5626 | ||
5627 | static void | |
11f6b451 | 5628 | expand_static_init (tree decl, tree init) |
8d08fdba | 5629 | { |
50bc768d NS |
5630 | gcc_assert (TREE_CODE (decl) == VAR_DECL); |
5631 | gcc_assert (TREE_STATIC (decl)); | |
8e3df2de MM |
5632 | |
5633 | /* Some variables require no initialization. */ | |
caf93cb0 | 5634 | if (!init |
8e3df2de MM |
5635 | && !TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (decl)) |
5636 | && TYPE_HAS_TRIVIAL_DESTRUCTOR (TREE_TYPE (decl))) | |
5637 | return; | |
5638 | ||
eba6cfb6 | 5639 | if (DECL_FUNCTION_SCOPE_P (decl)) |
8d08fdba MS |
5640 | { |
5641 | /* Emit code to perform this initialization but once. */ | |
445cf5eb JM |
5642 | tree if_stmt = NULL_TREE, inner_if_stmt = NULL_TREE; |
5643 | tree then_clause = NULL_TREE, inner_then_clause = NULL_TREE; | |
40aac948 JM |
5644 | tree guard, guard_addr, guard_addr_list; |
5645 | tree acquire_fn, release_fn, abort_fn; | |
5646 | tree flag, begin; | |
8d08fdba | 5647 | |
2036a15c MM |
5648 | /* Emit code to perform this initialization but once. This code |
5649 | looks like: | |
5650 | ||
0cbd7506 MS |
5651 | static <type> guard; |
5652 | if (!guard.first_byte) { | |
40aac948 JM |
5653 | if (__cxa_guard_acquire (&guard)) { |
5654 | bool flag = false; | |
5655 | try { | |
0cbd7506 MS |
5656 | // Do initialization. |
5657 | flag = true; __cxa_guard_release (&guard); | |
5658 | // Register variable for destruction at end of program. | |
40aac948 | 5659 | } catch { |
0cbd7506 | 5660 | if (!flag) __cxa_guard_abort (&guard); |
40aac948 | 5661 | } |
2036a15c MM |
5662 | } |
5663 | ||
40aac948 | 5664 | Note that the `flag' variable is only set to 1 *after* the |
2036a15c MM |
5665 | initialization is complete. This ensures that an exception, |
5666 | thrown during the construction, will cause the variable to | |
5667 | reinitialized when we pass through this code again, as per: | |
68642fb6 | 5668 | |
2036a15c MM |
5669 | [stmt.dcl] |
5670 | ||
c8094d83 | 5671 | If the initialization exits by throwing an exception, the |
2036a15c MM |
5672 | initialization is not complete, so it will be tried again |
5673 | the next time control enters the declaration. | |
5674 | ||
0cbd7506 | 5675 | This process should be thread-safe, too; multiple threads |
40aac948 JM |
5676 | should not be able to initialize the variable more than |
5677 | once. */ | |
c395453c MM |
5678 | |
5679 | /* Create the guard variable. */ | |
5680 | guard = get_guard (decl); | |
2036a15c | 5681 | |
445cf5eb JM |
5682 | /* This optimization isn't safe on targets with relaxed memory |
5683 | consistency. On such targets we force synchronization in | |
5684 | __cxa_guard_acquire. */ | |
5685 | if (!targetm.relaxed_ordering || !flag_threadsafe_statics) | |
5686 | { | |
5687 | /* Begin the conditional initialization. */ | |
5688 | if_stmt = begin_if_stmt (); | |
5689 | finish_if_stmt_cond (get_guard_cond (guard), if_stmt); | |
5690 | then_clause = begin_compound_stmt (BCS_NO_SCOPE); | |
5691 | } | |
40aac948 JM |
5692 | |
5693 | if (flag_threadsafe_statics) | |
5694 | { | |
5695 | guard_addr = build_address (guard); | |
5696 | guard_addr_list = build_tree_list (NULL_TREE, guard_addr); | |
5697 | ||
5698 | acquire_fn = get_identifier ("__cxa_guard_acquire"); | |
5699 | release_fn = get_identifier ("__cxa_guard_release"); | |
5700 | abort_fn = get_identifier ("__cxa_guard_abort"); | |
5701 | if (!get_global_value_if_present (acquire_fn, &acquire_fn)) | |
5702 | { | |
5703 | tree argtypes = tree_cons (NULL_TREE, TREE_TYPE (guard_addr), | |
5704 | void_list_node); | |
5705 | tree vfntype = build_function_type (void_type_node, argtypes); | |
5706 | acquire_fn = push_library_fn | |
5707 | (acquire_fn, build_function_type (integer_type_node, argtypes)); | |
5708 | release_fn = push_library_fn (release_fn, vfntype); | |
5709 | abort_fn = push_library_fn (abort_fn, vfntype); | |
5710 | } | |
5711 | else | |
5712 | { | |
5713 | release_fn = identifier_global_value (release_fn); | |
5714 | abort_fn = identifier_global_value (abort_fn); | |
5715 | } | |
5716 | ||
5717 | inner_if_stmt = begin_if_stmt (); | |
5718 | finish_if_stmt_cond (build_call (acquire_fn, guard_addr_list), | |
5719 | inner_if_stmt); | |
5720 | ||
5721 | inner_then_clause = begin_compound_stmt (BCS_NO_SCOPE); | |
5722 | begin = get_target_expr (boolean_false_node); | |
5723 | flag = TARGET_EXPR_SLOT (begin); | |
5724 | ||
5725 | TARGET_EXPR_CLEANUP (begin) | |
81eba3a8 KH |
5726 | = build3 (COND_EXPR, void_type_node, flag, |
5727 | void_zero_node, | |
5728 | build_call (abort_fn, guard_addr_list)); | |
40aac948 JM |
5729 | CLEANUP_EH_ONLY (begin) = 1; |
5730 | ||
5731 | /* Do the initialization itself. */ | |
5732 | init = add_stmt_to_compound (begin, init); | |
5733 | init = add_stmt_to_compound | |
81eba3a8 | 5734 | (init, build2 (MODIFY_EXPR, void_type_node, flag, boolean_true_node)); |
40aac948 JM |
5735 | init = add_stmt_to_compound |
5736 | (init, build_call (release_fn, guard_addr_list)); | |
5737 | } | |
f1dedc31 | 5738 | else |
40aac948 | 5739 | init = add_stmt_to_compound (init, set_guard (guard)); |
72b7eeff | 5740 | |
2036a15c MM |
5741 | /* Use atexit to register a function for destroying this static |
5742 | variable. */ | |
40aac948 JM |
5743 | init = add_stmt_to_compound (init, register_dtor_fn (decl)); |
5744 | ||
5745 | finish_expr_stmt (init); | |
5746 | ||
5747 | if (flag_threadsafe_statics) | |
5748 | { | |
5749 | finish_compound_stmt (inner_then_clause); | |
5750 | finish_then_clause (inner_if_stmt); | |
5751 | finish_if_stmt (inner_if_stmt); | |
5752 | } | |
72b7eeff | 5753 | |
445cf5eb JM |
5754 | if (!targetm.relaxed_ordering || !flag_threadsafe_statics) |
5755 | { | |
5756 | finish_compound_stmt (then_clause); | |
5757 | finish_then_clause (if_stmt); | |
5758 | finish_if_stmt (if_stmt); | |
5759 | } | |
8d08fdba MS |
5760 | } |
5761 | else | |
bbd15aac | 5762 | static_aggregates = tree_cons (init, decl, static_aggregates); |
8d08fdba | 5763 | } |
3c5c0849 | 5764 | |
8d08fdba MS |
5765 | \f |
5766 | /* Make TYPE a complete type based on INITIAL_VALUE. | |
5767 | Return 0 if successful, 1 if INITIAL_VALUE can't be deciphered, | |
07900878 PC |
5768 | 2 if there was no information (in which case assume 0 if DO_DEFAULT), |
5769 | 3 if the initializer list is empty (in pedantic mode). */ | |
8d08fdba MS |
5770 | |
5771 | int | |
aab038d5 | 5772 | cp_complete_array_type (tree *ptype, tree initial_value, bool do_default) |
8d08fdba | 5773 | { |
aab038d5 RH |
5774 | int failure; |
5775 | tree type, elt_type; | |
68642fb6 | 5776 | |
8d08fdba MS |
5777 | if (initial_value) |
5778 | { | |
7b019c19 | 5779 | /* An array of character type can be initialized from a |
4038c495 GB |
5780 | brace-enclosed string constant. |
5781 | ||
5782 | FIXME: this code is duplicated from reshape_init. Probably | |
5783 | we should just call reshape_init here? */ | |
aab038d5 | 5784 | if (char_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (*ptype))) |
7b019c19 | 5785 | && TREE_CODE (initial_value) == CONSTRUCTOR |
4038c495 GB |
5786 | && !VEC_empty (constructor_elt, CONSTRUCTOR_ELTS (initial_value))) |
5787 | { | |
5788 | VEC(constructor_elt,gc) *v = CONSTRUCTOR_ELTS (initial_value); | |
5789 | tree value = VEC_index (constructor_elt, v, 0)->value; | |
5790 | ||
5791 | if (TREE_CODE (value) == STRING_CST | |
5792 | && VEC_length (constructor_elt, v) == 1) | |
5793 | initial_value = value; | |
5794 | } | |
8d08fdba MS |
5795 | } |
5796 | ||
aab038d5 | 5797 | failure = complete_array_type (ptype, initial_value, do_default); |
8d08fdba | 5798 | |
aab038d5 RH |
5799 | /* We can create the array before the element type is complete, which |
5800 | means that we didn't have these two bits set in the original type | |
5801 | either. In completing the type, we are expected to propagate these | |
5802 | bits. See also complete_type which does the same thing for arrays | |
5803 | of fixed size. */ | |
5804 | type = *ptype; | |
5805 | if (TYPE_DOMAIN (type)) | |
8d08fdba | 5806 | { |
81b4398d | 5807 | elt_type = TREE_TYPE (type); |
aab038d5 | 5808 | TYPE_NEEDS_CONSTRUCTING (type) = TYPE_NEEDS_CONSTRUCTING (elt_type); |
81b4398d | 5809 | TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type) |
aab038d5 | 5810 | = TYPE_HAS_NONTRIVIAL_DESTRUCTOR (elt_type); |
8d08fdba MS |
5811 | } |
5812 | ||
aab038d5 | 5813 | return failure; |
8d08fdba MS |
5814 | } |
5815 | \f | |
5816 | /* Return zero if something is declared to be a member of type | |
5817 | CTYPE when in the context of CUR_TYPE. STRING is the error | |
5818 | message to print in that case. Otherwise, quietly return 1. */ | |
e92cc029 | 5819 | |
8d08fdba | 5820 | static int |
11f6b451 | 5821 | member_function_or_else (tree ctype, tree cur_type, enum overload_flags flags) |
8d08fdba MS |
5822 | { |
5823 | if (ctype && ctype != cur_type) | |
5824 | { | |
4dacf5bd | 5825 | if (flags == DTOR_FLAG) |
2d01edd7 | 5826 | error ("destructor for alien class %qT cannot be a member", ctype); |
4dacf5bd | 5827 | else |
2d01edd7 | 5828 | error ("constructor for alien class %qT cannot be a member", ctype); |
8d08fdba MS |
5829 | return 0; |
5830 | } | |
5831 | return 1; | |
5832 | } | |
5833 | \f | |
5834 | /* Subroutine of `grokdeclarator'. */ | |
5835 | ||
5836 | /* Generate errors possibly applicable for a given set of specifiers. | |
5837 | This is for ARM $7.1.2. */ | |
e92cc029 | 5838 | |
8d08fdba | 5839 | static void |
11f6b451 | 5840 | bad_specifiers (tree object, |
0cbd7506 MS |
5841 | const char* type, |
5842 | int virtualp, | |
5843 | int quals, | |
5844 | int inlinep, | |
5845 | int friendp, | |
5846 | int raises) | |
8d08fdba MS |
5847 | { |
5848 | if (virtualp) | |
2d01edd7 | 5849 | error ("%qD declared as a %<virtual%> %s", object, type); |
8d08fdba | 5850 | if (inlinep) |
2d01edd7 | 5851 | error ("%qD declared as an %<inline%> %s", object, type); |
8d08fdba | 5852 | if (quals) |
2d01edd7 | 5853 | error ("%<const%> and %<volatile%> function specifiers on " |
0cbd7506 MS |
5854 | "%qD invalid in %s declaration", |
5855 | object, type); | |
8d08fdba | 5856 | if (friendp) |
dee15844 | 5857 | error ("%q+D declared as a friend", object); |
e1be26f4 RS |
5858 | if (raises |
5859 | && (TREE_CODE (object) == TYPE_DECL | |
5860 | || (!TYPE_PTRFN_P (TREE_TYPE (object)) | |
742a37d5 | 5861 | && !TYPE_REFFN_P (TREE_TYPE (object)) |
e1be26f4 | 5862 | && !TYPE_PTRMEMFUNC_P (TREE_TYPE (object))))) |
dee15844 | 5863 | error ("%q+D declared with an exception specification", object); |
8d08fdba MS |
5864 | } |
5865 | ||
9c12301f MM |
5866 | /* DECL is a member function or static data member and is presently |
5867 | being defined. Check that the definition is taking place in a | |
5868 | valid namespace. */ | |
5869 | ||
5870 | static void | |
5871 | check_class_member_definition_namespace (tree decl) | |
5872 | { | |
5873 | /* These checks only apply to member functions and static data | |
5874 | members. */ | |
5875 | gcc_assert (TREE_CODE (decl) == FUNCTION_DECL | |
5876 | || TREE_CODE (decl) == VAR_DECL); | |
5877 | /* We check for problems with specializations in pt.c in | |
5878 | check_specialization_namespace, where we can issue better | |
5879 | diagnostics. */ | |
5880 | if (processing_specialization) | |
5881 | return; | |
5882 | /* There are no restrictions on the placement of | |
5883 | explicit instantiations. */ | |
5884 | if (processing_explicit_instantiation) | |
5885 | return; | |
5886 | /* [class.mfct] | |
5887 | ||
5888 | A member function definition that appears outside of the | |
5889 | class definition shall appear in a namespace scope enclosing | |
5890 | the class definition. | |
5891 | ||
5892 | [class.static.data] | |
5893 | ||
5894 | The definition for a static data member shall appear in a | |
5895 | namespace scope enclosing the member's class definition. */ | |
5896 | if (!is_ancestor (current_namespace, DECL_CONTEXT (decl))) | |
5897 | pedwarn ("definition of %qD is not in namespace enclosing %qT", | |
5898 | decl, DECL_CONTEXT (decl)); | |
5899 | } | |
5900 | ||
e2537f2c MM |
5901 | /* Build a PARM_DECL for the "this" parameter. TYPE is the |
5902 | METHOD_TYPE for a non-static member function; QUALS are the | |
5903 | cv-qualifiers that apply to the function. */ | |
3db45ab5 | 5904 | |
e2537f2c MM |
5905 | tree |
5906 | build_this_parm (tree type, cp_cv_quals quals) | |
5907 | { | |
5908 | tree this_type; | |
5909 | tree qual_type; | |
5910 | tree parm; | |
5911 | cp_cv_quals this_quals; | |
5912 | ||
5913 | this_type = TREE_VALUE (TYPE_ARG_TYPES (type)); | |
5914 | /* The `this' parameter is implicitly `const'; it cannot be | |
5915 | assigned to. */ | |
5916 | this_quals = (quals & TYPE_QUAL_RESTRICT) | TYPE_QUAL_CONST; | |
5917 | qual_type = cp_build_qualified_type (this_type, this_quals); | |
5918 | parm = build_artificial_parm (this_identifier, qual_type); | |
5919 | cp_apply_type_quals_to_decl (this_quals, parm); | |
5920 | return parm; | |
3db45ab5 | 5921 | } |
e2537f2c | 5922 | |
8d08fdba MS |
5923 | /* CTYPE is class type, or null if non-class. |
5924 | TYPE is type this FUNCTION_DECL should have, either FUNCTION_TYPE | |
5925 | or METHOD_TYPE. | |
5926 | DECLARATOR is the function's name. | |
4546865e | 5927 | PARMS is a chain of PARM_DECLs for the function. |
8d08fdba MS |
5928 | VIRTUALP is truthvalue of whether the function is virtual or not. |
5929 | FLAGS are to be passed through to `grokclassfn'. | |
5930 | QUALS are qualifiers indicating whether the function is `const' | |
5931 | or `volatile'. | |
5932 | RAISES is a list of exceptions that this function can raise. | |
5933 | CHECK is 1 if we must find this method in CTYPE, 0 if we should | |
68642fb6 | 5934 | not look, and -1 if we should not call `grokclassfn' at all. |
3ddfb0e6 | 5935 | |
27d6592c MM |
5936 | SFK is the kind of special function (if any) for the new function. |
5937 | ||
20496fa2 | 5938 | Returns `NULL_TREE' if something goes wrong, after issuing |
3ddfb0e6 | 5939 | applicable error messages. */ |
e92cc029 | 5940 | |
8d08fdba | 5941 | static tree |
caf93cb0 | 5942 | grokfndecl (tree ctype, |
0cbd7506 MS |
5943 | tree type, |
5944 | tree declarator, | |
4546865e | 5945 | tree parms, |
0cbd7506 MS |
5946 | tree orig_declarator, |
5947 | int virtualp, | |
5948 | enum overload_flags flags, | |
3c01e5df | 5949 | cp_cv_quals quals, |
0cbd7506 MS |
5950 | tree raises, |
5951 | int check, | |
5952 | int friendp, | |
5953 | int publicp, | |
5954 | int inlinep, | |
27d6592c | 5955 | special_function_kind sfk, |
357d956e | 5956 | bool funcdef_flag, |
0cbd7506 MS |
5957 | int template_count, |
5958 | tree in_namespace, | |
037cc9c5 | 5959 | tree* attrlist) |
8d08fdba | 5960 | { |
1951a1b6 | 5961 | tree decl; |
8d08fdba | 5962 | int staticp = ctype && TREE_CODE (type) == FUNCTION_TYPE; |
42976354 | 5963 | tree t; |
8d08fdba | 5964 | |
8d08fdba | 5965 | if (raises) |
271e6f02 | 5966 | type = build_exception_variant (type, raises); |
c11b6f21 | 5967 | |
8d08fdba | 5968 | decl = build_lang_decl (FUNCTION_DECL, declarator, type); |
e2537f2c MM |
5969 | if (TREE_CODE (type) == METHOD_TYPE) |
5970 | { | |
5971 | tree parm; | |
5972 | parm = build_this_parm (type, quals); | |
5973 | TREE_CHAIN (parm) = parms; | |
5974 | parms = parm; | |
5975 | } | |
4546865e | 5976 | DECL_ARGUMENTS (decl) = parms; |
a1c65f9f | 5977 | /* Propagate volatile out from type to decl. */ |
8d08fdba | 5978 | if (TYPE_VOLATILE (type)) |
893de33c | 5979 | TREE_THIS_VOLATILE (decl) = 1; |
8d08fdba | 5980 | |
abc088aa MM |
5981 | if (friendp |
5982 | && TREE_CODE (orig_declarator) == TEMPLATE_ID_EXPR) | |
5983 | { | |
5984 | if (funcdef_flag) | |
5985 | error | |
5986 | ("defining explicit specialization %qD in friend declaration", | |
5987 | orig_declarator); | |
5988 | else | |
5989 | { | |
5990 | tree fns = TREE_OPERAND (orig_declarator, 0); | |
5991 | tree args = TREE_OPERAND (orig_declarator, 1); | |
5992 | ||
5993 | if (PROCESSING_REAL_TEMPLATE_DECL_P ()) | |
5994 | { | |
5995 | /* Something like `template <class T> friend void f<T>()'. */ | |
5996 | error ("invalid use of template-id %qD in declaration " | |
5997 | "of primary template", | |
5998 | orig_declarator); | |
5999 | return NULL_TREE; | |
6000 | } | |
6001 | ||
6002 | ||
6003 | /* A friend declaration of the form friend void f<>(). Record | |
6004 | the information in the TEMPLATE_ID_EXPR. */ | |
6005 | SET_DECL_IMPLICIT_INSTANTIATION (decl); | |
6006 | ||
6007 | if (TREE_CODE (fns) == COMPONENT_REF) | |
6008 | { | |
6009 | /* Due to bison parser ickiness, we will have already looked | |
6010 | up an operator_name or PFUNCNAME within the current class | |
6011 | (see template_id in parse.y). If the current class contains | |
6012 | such a name, we'll get a COMPONENT_REF here. Undo that. */ | |
6013 | ||
6014 | gcc_assert (TREE_TYPE (TREE_OPERAND (fns, 0)) | |
6015 | == current_class_type); | |
6016 | fns = TREE_OPERAND (fns, 1); | |
6017 | } | |
6018 | gcc_assert (TREE_CODE (fns) == IDENTIFIER_NODE | |
6019 | || TREE_CODE (fns) == OVERLOAD); | |
6020 | DECL_TEMPLATE_INFO (decl) = tree_cons (fns, args, NULL_TREE); | |
6021 | ||
6022 | for (t = TYPE_ARG_TYPES (TREE_TYPE (decl)); t; t = TREE_CHAIN (t)) | |
6023 | if (TREE_PURPOSE (t) | |
6024 | && TREE_CODE (TREE_PURPOSE (t)) == DEFAULT_ARG) | |
6025 | { | |
6026 | error ("default arguments are not allowed in declaration " | |
6027 | "of friend template specialization %qD", | |
6028 | decl); | |
6029 | return NULL_TREE; | |
6030 | } | |
6031 | ||
6032 | if (inlinep) | |
6033 | { | |
6034 | error ("%<inline%> is not allowed in declaration of friend " | |
6035 | "template specialization %qD", | |
6036 | decl); | |
6037 | return NULL_TREE; | |
6038 | } | |
6039 | } | |
6040 | } | |
6041 | ||
79c4d4b7 | 6042 | /* If this decl has namespace scope, set that up. */ |
2c73f9f5 | 6043 | if (in_namespace) |
b262d64c | 6044 | set_decl_namespace (decl, in_namespace, friendp); |
adae082f | 6045 | else if (!ctype) |
79c4d4b7 | 6046 | DECL_CONTEXT (decl) = FROB_CONTEXT (current_namespace); |
2c73f9f5 | 6047 | |
0f8766b8 JM |
6048 | /* `main' and builtins have implicit 'C' linkage. */ |
6049 | if ((MAIN_NAME_P (declarator) | |
6050 | || (IDENTIFIER_LENGTH (declarator) > 10 | |
6051 | && IDENTIFIER_POINTER (declarator)[0] == '_' | |
6052 | && IDENTIFIER_POINTER (declarator)[1] == '_' | |
6053 | && strncmp (IDENTIFIER_POINTER (declarator)+2, "builtin_", 8) == 0)) | |
6054 | && current_lang_name == lang_name_cplusplus | |
94706a5c | 6055 | && ctype == NULL_TREE |
79c4d4b7 JM |
6056 | /* NULL_TREE means global namespace. */ |
6057 | && DECL_CONTEXT (decl) == NULL_TREE) | |
5d2ed28c | 6058 | SET_DECL_LANGUAGE (decl, lang_c); |
0f8766b8 | 6059 | |
8d08fdba MS |
6060 | /* Should probably propagate const out from type to decl I bet (mrs). */ |
6061 | if (staticp) | |
6062 | { | |
6063 | DECL_STATIC_FUNCTION_P (decl) = 1; | |
6064 | DECL_CONTEXT (decl) = ctype; | |
8d08fdba MS |
6065 | } |
6066 | ||
e76a2646 | 6067 | if (ctype) |
9c12301f MM |
6068 | { |
6069 | DECL_CONTEXT (decl) = ctype; | |
6070 | if (funcdef_flag) | |
6071 | check_class_member_definition_namespace (decl); | |
6072 | } | |
e76a2646 | 6073 | |
0f8766b8 | 6074 | if (ctype == NULL_TREE && DECL_MAIN_P (decl)) |
faae18ab | 6075 | { |
848b92e1 | 6076 | if (processing_template_decl) |
2d01edd7 | 6077 | error ("cannot declare %<::main%> to be a template"); |
faae18ab | 6078 | if (inlinep) |
2d01edd7 | 6079 | error ("cannot declare %<::main%> to be inline"); |
f22967f3 | 6080 | if (!publicp) |
2d01edd7 | 6081 | error ("cannot declare %<::main%> to be static"); |
faae18ab MS |
6082 | inlinep = 0; |
6083 | publicp = 1; | |
6084 | } | |
50a6dbd7 | 6085 | |
59e76fc6 | 6086 | /* Members of anonymous types and local classes have no linkage; make |
9fc444cc | 6087 | them internal. If a typedef is made later, this will be changed. */ |
1951a1b6 | 6088 | if (ctype && (TYPE_ANONYMOUS_P (ctype) |
4f1c5b7d | 6089 | || decl_function_context (TYPE_MAIN_DECL (ctype)))) |
50a6dbd7 JM |
6090 | publicp = 0; |
6091 | ||
6092 | if (publicp) | |
6093 | { | |
6094 | /* [basic.link]: A name with no linkage (notably, the name of a class | |
6095 | or enumeration declared in a local scope) shall not be used to | |
6096 | declare an entity with linkage. | |
6097 | ||
50b97e0f | 6098 | Only check this for public decls for now. See core 319, 389. */ |
4684cd27 MM |
6099 | t = no_linkage_check (TREE_TYPE (decl), |
6100 | /*relaxed_p=*/false); | |
50a6dbd7 JM |
6101 | if (t) |
6102 | { | |
1951a1b6 | 6103 | if (TYPE_ANONYMOUS_P (t)) |
7f7c930e | 6104 | { |
eb68cb58 | 6105 | if (DECL_EXTERN_C_P (decl)) |
7f7c930e JM |
6106 | /* Allow this; it's pretty common in C. */; |
6107 | else | |
1951a1b6 | 6108 | { |
2d01edd7 | 6109 | pedwarn ("non-local function %q#D uses anonymous type", |
1951a1b6 JM |
6110 | decl); |
6111 | if (DECL_ORIGINAL_TYPE (TYPE_NAME (t))) | |
dee15844 JM |
6112 | pedwarn ("%q+#D does not refer to the unqualified " |
6113 | "type, so it is not used for linkage", | |
6114 | TYPE_NAME (t)); | |
1951a1b6 | 6115 | } |
7f7c930e | 6116 | } |
50a6dbd7 | 6117 | else |
2d01edd7 | 6118 | pedwarn ("non-local function %q#D uses local type %qT", decl, t); |
50a6dbd7 JM |
6119 | } |
6120 | } | |
6121 | ||
893de33c | 6122 | TREE_PUBLIC (decl) = publicp; |
faae18ab | 6123 | if (! publicp) |
893de33c JM |
6124 | { |
6125 | DECL_INTERFACE_KNOWN (decl) = 1; | |
6126 | DECL_NOT_REALLY_EXTERN (decl) = 1; | |
6127 | } | |
faae18ab | 6128 | |
acc72c37 | 6129 | /* If the declaration was declared inline, mark it as such. */ |
faae18ab | 6130 | if (inlinep) |
acc72c37 MM |
6131 | DECL_DECLARED_INLINE_P (decl) = 1; |
6132 | /* We inline functions that are explicitly declared inline, or, when | |
6133 | the user explicitly asks us to, all functions. */ | |
b3c3af2f SB |
6134 | if (DECL_DECLARED_INLINE_P (decl) |
6135 | || (flag_inline_trees == 2 && !DECL_INLINE (decl) && funcdef_flag)) | |
acc72c37 | 6136 | DECL_INLINE (decl) = 1; |
8d08fdba MS |
6137 | |
6138 | DECL_EXTERNAL (decl) = 1; | |
3c01e5df | 6139 | if (quals && TREE_CODE (type) == FUNCTION_TYPE) |
8d08fdba | 6140 | { |
e7c41c99 DM |
6141 | error (ctype |
6142 | ? G_("static member function %qD cannot have cv-qualifier") | |
32b1d579 | 6143 | : G_("non-member function %qD cannot have cv-qualifier"), |
e7c41c99 | 6144 | decl); |
3c01e5df | 6145 | quals = TYPE_UNQUALIFIED; |
8d08fdba MS |
6146 | } |
6147 | ||
398cd199 VR |
6148 | if (IDENTIFIER_OPNAME_P (DECL_NAME (decl)) |
6149 | && !grok_op_properties (decl, /*complain=*/true)) | |
6150 | return NULL_TREE; | |
8d08fdba | 6151 | |
4f1c5b7d | 6152 | if (ctype && decl_function_context (decl)) |
893de33c | 6153 | DECL_NO_STATIC_CHAIN (decl) = 1; |
e76a2646 | 6154 | |
1eb0072d JM |
6155 | if (funcdef_flag) |
6156 | /* Make the init_value nonzero so pushdecl knows this is not | |
6157 | tentative. error_mark_node is replaced later with the BLOCK. */ | |
6158 | DECL_INITIAL (decl) = error_mark_node; | |
6159 | ||
93ca4ba7 | 6160 | if (TYPE_NOTHROW_P (type) || nothrow_libfn_p (decl)) |
1660cb3a JM |
6161 | TREE_NOTHROW (decl) = 1; |
6162 | ||
75650646 | 6163 | /* Caller will do the rest of this. */ |
8d08fdba MS |
6164 | if (check < 0) |
6165 | return decl; | |
6166 | ||
74b846e0 | 6167 | if (ctype != NULL_TREE) |
27d6592c MM |
6168 | { |
6169 | if (sfk == sfk_constructor) | |
6170 | DECL_CONSTRUCTOR_P (decl) = 1; | |
6171 | ||
e2537f2c | 6172 | grokclassfn (ctype, decl, flags); |
27d6592c | 6173 | } |
74b846e0 MM |
6174 | |
6175 | decl = check_explicit_specialization (orig_declarator, decl, | |
6176 | template_count, | |
357d956e | 6177 | 2 * funcdef_flag + |
74b846e0 MM |
6178 | 4 * (friendp != 0)); |
6179 | if (decl == error_mark_node) | |
6180 | return NULL_TREE; | |
98c1c668 | 6181 | |
037cc9c5 FJ |
6182 | if (attrlist) |
6183 | { | |
6184 | cplus_decl_attributes (&decl, *attrlist, 0); | |
6185 | *attrlist = NULL_TREE; | |
6186 | } | |
6187 | ||
da337784 JJ |
6188 | /* Check main's type after attributes have been applied. */ |
6189 | if (ctype == NULL_TREE && DECL_MAIN_P (decl)) | |
6190 | { | |
6191 | if (!same_type_p (TREE_TYPE (TREE_TYPE (decl)), | |
6192 | integer_type_node)) | |
6193 | { | |
6194 | tree oldtypeargs = TYPE_ARG_TYPES (TREE_TYPE (decl)); | |
6195 | tree newtype; | |
6196 | error ("%<::main%> must return %<int%>"); | |
6197 | newtype = build_function_type (integer_type_node, oldtypeargs); | |
6198 | TREE_TYPE (decl) = newtype; | |
6199 | } | |
6200 | check_main_parameter_types (decl); | |
6201 | } | |
6202 | ||
74b846e0 MM |
6203 | if (ctype != NULL_TREE |
6204 | && (! TYPE_FOR_JAVA (ctype) || check_java_method (decl)) | |
6205 | && check) | |
8d08fdba | 6206 | { |
74b846e0 | 6207 | tree old_decl; |
8d08fdba | 6208 | |
d43f603d | 6209 | old_decl = check_classfn (ctype, decl, |
44021471 GB |
6210 | (processing_template_decl |
6211 | > template_class_depth (ctype)) | |
6212 | ? current_template_parms | |
c8094d83 | 6213 | : NULL_TREE); |
74b846e0 | 6214 | if (old_decl) |
8d08fdba | 6215 | { |
79ae853c | 6216 | tree ok; |
4514aa8c | 6217 | tree pushed_scope; |
316a2456 | 6218 | |
357d956e MM |
6219 | if (TREE_CODE (old_decl) == TEMPLATE_DECL) |
6220 | /* Because grokfndecl is always supposed to return a | |
6221 | FUNCTION_DECL, we pull out the DECL_TEMPLATE_RESULT | |
6222 | here. We depend on our callers to figure out that its | |
6223 | really a template that's being returned. */ | |
6224 | old_decl = DECL_TEMPLATE_RESULT (old_decl); | |
6225 | ||
6226 | if (DECL_STATIC_FUNCTION_P (old_decl) | |
6227 | && TREE_CODE (TREE_TYPE (decl)) == METHOD_TYPE) | |
6228 | /* Remove the `this' parm added by grokclassfn. | |
6229 | XXX Isn't this done in start_function, too? */ | |
6230 | revert_static_member_fn (decl); | |
6231 | if (DECL_ARTIFICIAL (old_decl)) | |
6232 | error ("definition of implicitly-declared %qD", old_decl); | |
6233 | ||
74b846e0 MM |
6234 | /* Since we've smashed OLD_DECL to its |
6235 | DECL_TEMPLATE_RESULT, we must do the same to DECL. */ | |
6236 | if (TREE_CODE (decl) == TEMPLATE_DECL) | |
6237 | decl = DECL_TEMPLATE_RESULT (decl); | |
6238 | ||
6239 | /* Attempt to merge the declarations. This can fail, in | |
0e339752 | 6240 | the case of some invalid specialization declarations. */ |
4514aa8c | 6241 | pushed_scope = push_scope (ctype); |
d63d5d0c | 6242 | ok = duplicate_decls (decl, old_decl, friendp); |
4514aa8c NS |
6243 | if (pushed_scope) |
6244 | pop_scope (pushed_scope); | |
316a2456 MM |
6245 | if (!ok) |
6246 | { | |
2d01edd7 | 6247 | error ("no %q#D member function declared in class %qT", |
316a2456 MM |
6248 | decl, ctype); |
6249 | return NULL_TREE; | |
6250 | } | |
74b846e0 | 6251 | return old_decl; |
8d08fdba MS |
6252 | } |
6253 | } | |
74b846e0 MM |
6254 | |
6255 | if (DECL_CONSTRUCTOR_P (decl) && !grok_ctor_properties (ctype, decl)) | |
6256 | return NULL_TREE; | |
6257 | ||
6258 | if (ctype == NULL_TREE || check) | |
6259 | return decl; | |
6260 | ||
6261 | if (virtualp) | |
cbb40945 | 6262 | DECL_VIRTUAL_P (decl) = 1; |
74b846e0 | 6263 | |
8d08fdba MS |
6264 | return decl; |
6265 | } | |
6266 | ||
4684cd27 MM |
6267 | /* DECL is a VAR_DECL for a static data member. Set flags to reflect |
6268 | the linkage that DECL will receive in the object file. */ | |
6269 | ||
6270 | static void | |
6271 | set_linkage_for_static_data_member (tree decl) | |
6272 | { | |
6273 | /* A static data member always has static storage duration and | |
6274 | external linkage. Note that static data members are forbidden in | |
6275 | local classes -- the only situation in which a class has | |
6276 | non-external linkage. */ | |
6277 | TREE_PUBLIC (decl) = 1; | |
6278 | TREE_STATIC (decl) = 1; | |
6279 | /* For non-template classes, static data members are always put | |
6280 | out in exactly those files where they are defined, just as | |
77880ae4 | 6281 | with ordinary namespace-scope variables. */ |
4684cd27 MM |
6282 | if (!processing_template_decl) |
6283 | DECL_INTERFACE_KNOWN (decl) = 1; | |
6284 | } | |
6285 | ||
caf93cb0 | 6286 | /* Create a VAR_DECL named NAME with the indicated TYPE. |
9e259dd1 MM |
6287 | |
6288 | If SCOPE is non-NULL, it is the class type or namespace containing | |
6289 | the variable. If SCOPE is NULL, the variable should is created in | |
6290 | the innermost enclosings scope. */ | |
6291 | ||
8d08fdba | 6292 | static tree |
11f6b451 | 6293 | grokvardecl (tree type, |
0cbd7506 | 6294 | tree name, |
1ff3c076 | 6295 | const cp_decl_specifier_seq *declspecs, |
0cbd7506 MS |
6296 | int initialized, |
6297 | int constp, | |
6298 | tree scope) | |
8d08fdba MS |
6299 | { |
6300 | tree decl; | |
5ae9ba3e | 6301 | tree explicit_scope; |
f7da6097 | 6302 | |
50bc768d | 6303 | gcc_assert (!name || TREE_CODE (name) == IDENTIFIER_NODE); |
9e259dd1 | 6304 | |
5ae9ba3e MM |
6305 | /* Compute the scope in which to place the variable, but remember |
6306 | whether or not that scope was explicitly specified by the user. */ | |
6307 | explicit_scope = scope; | |
9e259dd1 | 6308 | if (!scope) |
8d08fdba | 6309 | { |
9e259dd1 MM |
6310 | /* An explicit "extern" specifier indicates a namespace-scope |
6311 | variable. */ | |
62d1db17 | 6312 | if (declspecs->storage_class == sc_extern) |
9e259dd1 MM |
6313 | scope = current_namespace; |
6314 | else if (!at_function_scope_p ()) | |
a5201a91 | 6315 | scope = current_scope (); |
9e259dd1 MM |
6316 | } |
6317 | ||
6318 | if (scope | |
6319 | && (/* If the variable is a namespace-scope variable declared in a | |
6320 | template, we need DECL_LANG_SPECIFIC. */ | |
6321 | (TREE_CODE (scope) == NAMESPACE_DECL && processing_template_decl) | |
6322 | /* Similarly for namespace-scope variables with language linkage | |
6323 | other than C++. */ | |
caf93cb0 | 6324 | || (TREE_CODE (scope) == NAMESPACE_DECL |
9e259dd1 MM |
6325 | && current_lang_name != lang_name_cplusplus) |
6326 | /* Similarly for static data members. */ | |
6327 | || TYPE_P (scope))) | |
6328 | decl = build_lang_decl (VAR_DECL, name, type); | |
8d08fdba | 6329 | else |
9e259dd1 | 6330 | decl = build_decl (VAR_DECL, name, type); |
79c4d4b7 | 6331 | |
5ae9ba3e MM |
6332 | if (explicit_scope && TREE_CODE (explicit_scope) == NAMESPACE_DECL) |
6333 | set_decl_namespace (decl, explicit_scope, 0); | |
9e259dd1 | 6334 | else |
74b0d490 | 6335 | DECL_CONTEXT (decl) = FROB_CONTEXT (scope); |
6060a796 | 6336 | |
62d1db17 | 6337 | if (declspecs->storage_class == sc_extern) |
8d08fdba MS |
6338 | { |
6339 | DECL_THIS_EXTERN (decl) = 1; | |
6340 | DECL_EXTERNAL (decl) = !initialized; | |
6341 | } | |
6342 | ||
2b9dc906 | 6343 | if (DECL_CLASS_SCOPE_P (decl)) |
8d08fdba | 6344 | { |
4684cd27 MM |
6345 | set_linkage_for_static_data_member (decl); |
6346 | /* This function is only called with out-of-class definitions. */ | |
5b605f68 | 6347 | DECL_EXTERNAL (decl) = 0; |
9c12301f | 6348 | check_class_member_definition_namespace (decl); |
8d08fdba MS |
6349 | } |
6350 | /* At top level, either `static' or no s.c. makes a definition | |
6351 | (perhaps tentative), and absence of `static' makes it public. */ | |
a9aedbc2 | 6352 | else if (toplevel_bindings_p ()) |
8d08fdba | 6353 | { |
62d1db17 | 6354 | TREE_PUBLIC (decl) = (declspecs->storage_class != sc_static |
9fffd093 | 6355 | && (DECL_THIS_EXTERN (decl) || ! constp)); |
8d08fdba MS |
6356 | TREE_STATIC (decl) = ! DECL_EXTERNAL (decl); |
6357 | } | |
6358 | /* Not at top level, only `static' makes a static definition. */ | |
6359 | else | |
6360 | { | |
62d1db17 | 6361 | TREE_STATIC (decl) = declspecs->storage_class == sc_static; |
8d08fdba MS |
6362 | TREE_PUBLIC (decl) = DECL_EXTERNAL (decl); |
6363 | } | |
50a6dbd7 | 6364 | |
62d1db17 | 6365 | if (declspecs->specs[(int)ds_thread]) |
8893239d | 6366 | DECL_TLS_MODEL (decl) = decl_default_tls_model (decl); |
7a1f3f5f | 6367 | |
50a6dbd7 JM |
6368 | if (TREE_PUBLIC (decl)) |
6369 | { | |
6370 | /* [basic.link]: A name with no linkage (notably, the name of a class | |
6371 | or enumeration declared in a local scope) shall not be used to | |
6372 | declare an entity with linkage. | |
6373 | ||
03fd3f84 | 6374 | Only check this for public decls for now. */ |
6b211746 | 6375 | tree t = no_linkage_check (TREE_TYPE (decl), /*relaxed_p=*/false); |
50a6dbd7 JM |
6376 | if (t) |
6377 | { | |
1951a1b6 | 6378 | if (TYPE_ANONYMOUS_P (t)) |
9fc444cc GK |
6379 | { |
6380 | if (DECL_EXTERN_C_P (decl)) | |
6bdb98d1 MA |
6381 | /* Allow this; it's pretty common in C. */ |
6382 | ; | |
9fc444cc GK |
6383 | else |
6384 | { | |
6b211746 AO |
6385 | /* DRs 132, 319 and 389 seem to indicate types with |
6386 | no linkage can only be used to declare extern "C" | |
6387 | entities. Since it's not always an error in the | |
6388 | ISO C++ 90 Standard, we only issue a warning. */ | |
d4ee4d25 | 6389 | warning (0, "non-local variable %q#D uses anonymous type", |
9fc444cc GK |
6390 | decl); |
6391 | if (DECL_ORIGINAL_TYPE (TYPE_NAME (t))) | |
dee15844 JM |
6392 | warning (0, "%q+#D does not refer to the unqualified " |
6393 | "type, so it is not used for linkage", | |
6394 | TYPE_NAME (t)); | |
9fc444cc GK |
6395 | } |
6396 | } | |
50a6dbd7 | 6397 | else |
d4ee4d25 | 6398 | warning (0, "non-local variable %q#D uses local type %qT", decl, t); |
50a6dbd7 JM |
6399 | } |
6400 | } | |
1ceb02be MM |
6401 | else |
6402 | DECL_INTERFACE_KNOWN (decl) = 1; | |
50a6dbd7 | 6403 | |
8d08fdba MS |
6404 | return decl; |
6405 | } | |
6406 | ||
d8f8dca1 MM |
6407 | /* Create and return a canonical pointer to member function type, for |
6408 | TYPE, which is a POINTER_TYPE to a METHOD_TYPE. */ | |
8d08fdba MS |
6409 | |
6410 | tree | |
11f6b451 | 6411 | build_ptrmemfunc_type (tree type) |
8d08fdba | 6412 | { |
4977bab6 | 6413 | tree field, fields; |
8d08fdba | 6414 | tree t; |
46cbda4a | 6415 | tree unqualified_variant = NULL_TREE; |
8d08fdba | 6416 | |
d48ebde1 NS |
6417 | if (type == error_mark_node) |
6418 | return type; | |
d363e7bf | 6419 | |
8d08fdba MS |
6420 | /* If a canonical type already exists for this type, use it. We use |
6421 | this method instead of type_hash_canon, because it only does a | |
6422 | simple equality check on the list of field members. */ | |
6423 | ||
6424 | if ((t = TYPE_GET_PTRMEMFUNC_TYPE (type))) | |
6425 | return t; | |
6426 | ||
46cbda4a MM |
6427 | /* Make sure that we always have the unqualified pointer-to-member |
6428 | type first. */ | |
89d684bb | 6429 | if (cp_type_quals (type) != TYPE_UNQUALIFIED) |
68642fb6 | 6430 | unqualified_variant |
46cbda4a MM |
6431 | = build_ptrmemfunc_type (TYPE_MAIN_VARIANT (type)); |
6432 | ||
33848bb0 | 6433 | t = make_aggr_type (RECORD_TYPE); |
cad7e87b | 6434 | xref_basetypes (t, NULL_TREE); |
caf93cb0 | 6435 | |
3b426391 | 6436 | /* Let the front end know this is a pointer to member function... */ |
db5ae43f | 6437 | TYPE_PTRMEMFUNC_FLAG (t) = 1; |
2c73f9f5 | 6438 | /* ... and not really an aggregate. */ |
7ddedda4 | 6439 | SET_IS_AGGR_TYPE (t, 0); |
8d08fdba | 6440 | |
4977bab6 ZW |
6441 | field = build_decl (FIELD_DECL, pfn_identifier, type); |
6442 | fields = field; | |
caf93cb0 | 6443 | |
4977bab6 ZW |
6444 | field = build_decl (FIELD_DECL, delta_identifier, delta_type_node); |
6445 | TREE_CHAIN (field) = fields; | |
6446 | fields = field; | |
caf93cb0 | 6447 | |
4977bab6 | 6448 | finish_builtin_struct (t, "__ptrmemfunc_type", fields, ptr_type_node); |
8d08fdba | 6449 | |
3b426391 | 6450 | /* Zap out the name so that the back end will give us the debugging |
8d08fdba MS |
6451 | information for this anonymous RECORD_TYPE. */ |
6452 | TYPE_NAME (t) = NULL_TREE; | |
6453 | ||
46cbda4a MM |
6454 | /* If this is not the unqualified form of this pointer-to-member |
6455 | type, set the TYPE_MAIN_VARIANT for this type to be the | |
6456 | unqualified type. Since they are actually RECORD_TYPEs that are | |
6457 | not variants of each other, we must do this manually. */ | |
89d684bb | 6458 | if (cp_type_quals (type) != TYPE_UNQUALIFIED) |
46cbda4a | 6459 | { |
89d684bb | 6460 | t = build_qualified_type (t, cp_type_quals (type)); |
46cbda4a MM |
6461 | TYPE_MAIN_VARIANT (t) = unqualified_variant; |
6462 | TYPE_NEXT_VARIANT (t) = TYPE_NEXT_VARIANT (unqualified_variant); | |
6463 | TYPE_NEXT_VARIANT (unqualified_variant) = t; | |
6464 | } | |
6465 | ||
6466 | /* Cache this pointer-to-member type so that we can find it again | |
6467 | later. */ | |
8d08fdba MS |
6468 | TYPE_SET_PTRMEMFUNC_TYPE (type, t); |
6469 | ||
06d40de8 DG |
6470 | if (TYPE_STRUCTURAL_EQUALITY_P (type)) |
6471 | SET_TYPE_STRUCTURAL_EQUALITY (t); | |
6472 | else if (TYPE_CANONICAL (type) != type) | |
6473 | TYPE_CANONICAL (t) = build_ptrmemfunc_type (TYPE_CANONICAL (type)); | |
6474 | ||
8d08fdba MS |
6475 | return t; |
6476 | } | |
6477 | ||
9e259dd1 MM |
6478 | /* Create and return a pointer to data member type. */ |
6479 | ||
6480 | tree | |
6481 | build_ptrmem_type (tree class_type, tree member_type) | |
6482 | { | |
a5ac359a MM |
6483 | if (TREE_CODE (member_type) == METHOD_TYPE) |
6484 | { | |
6485 | tree arg_types; | |
6486 | ||
6487 | arg_types = TYPE_ARG_TYPES (member_type); | |
caf93cb0 | 6488 | class_type = (cp_build_qualified_type |
a5ac359a MM |
6489 | (class_type, |
6490 | cp_type_quals (TREE_TYPE (TREE_VALUE (arg_types))))); | |
caf93cb0 EC |
6491 | member_type |
6492 | = build_method_type_directly (class_type, | |
43dc123f MM |
6493 | TREE_TYPE (member_type), |
6494 | TREE_CHAIN (arg_types)); | |
a5ac359a MM |
6495 | return build_ptrmemfunc_type (build_pointer_type (member_type)); |
6496 | } | |
6497 | else | |
6498 | { | |
50bc768d | 6499 | gcc_assert (TREE_CODE (member_type) != FUNCTION_TYPE); |
a5ac359a MM |
6500 | return build_offset_type (class_type, member_type); |
6501 | } | |
9e259dd1 MM |
6502 | } |
6503 | ||
b17e2870 JM |
6504 | /* DECL is a VAR_DECL defined in-class, whose TYPE is also given. |
6505 | Check to see that the definition is valid. Issue appropriate error | |
6506 | messages. Return 1 if the definition is particularly bad, or 0 | |
6507 | otherwise. */ | |
6508 | ||
6509 | int | |
11f6b451 | 6510 | check_static_variable_definition (tree decl, tree type) |
b17e2870 JM |
6511 | { |
6512 | /* Motion 10 at San Diego: If a static const integral data member is | |
6513 | initialized with an integral constant expression, the initializer | |
6514 | may appear either in the declaration (within the class), or in | |
6515 | the definition, but not both. If it appears in the class, the | |
6516 | member is a member constant. The file-scope definition is always | |
6517 | required. */ | |
dcba9b0f | 6518 | if (!ARITHMETIC_TYPE_P (type) && TREE_CODE (type) != ENUMERAL_TYPE) |
b17e2870 | 6519 | { |
2d01edd7 | 6520 | error ("invalid in-class initialization of static data member " |
0cbd7506 | 6521 | "of non-integral type %qT", |
dcba9b0f | 6522 | type); |
b17e2870 | 6523 | /* If we just return the declaration, crashes will sometimes |
852dcbdd | 6524 | occur. We therefore return void_type_node, as if this were a |
b17e2870 JM |
6525 | friend declaration, to cause callers to completely ignore |
6526 | this declaration. */ | |
6527 | return 1; | |
6528 | } | |
6529 | else if (!CP_TYPE_CONST_P (type)) | |
2d01edd7 | 6530 | error ("ISO C++ forbids in-class initialization of non-const " |
0cbd7506 MS |
6531 | "static member %qD", |
6532 | decl); | |
b17e2870 | 6533 | else if (pedantic && !INTEGRAL_TYPE_P (type)) |
2d01edd7 | 6534 | pedwarn ("ISO C++ forbids initialization of member constant " |
0cbd7506 | 6535 | "%qD of non-integral type %qT", decl, type); |
b17e2870 JM |
6536 | |
6537 | return 0; | |
6538 | } | |
6539 | ||
2848ad0f MM |
6540 | /* Given the SIZE (i.e., number of elements) in an array, compute an |
6541 | appropriate index type for the array. If non-NULL, NAME is the | |
6542 | name of the thing being declared. */ | |
6543 | ||
c95cd22e | 6544 | tree |
11f6b451 | 6545 | compute_array_index_type (tree name, tree size) |
2848ad0f | 6546 | { |
d174af6c | 6547 | tree type; |
2848ad0f | 6548 | tree itype; |
06d40de8 | 6549 | tree abi_1_itype = NULL_TREE; |
2848ad0f | 6550 | |
d174af6c MM |
6551 | if (error_operand_p (size)) |
6552 | return error_mark_node; | |
6553 | ||
6554 | type = TREE_TYPE (size); | |
d63b5e9f NS |
6555 | /* The array bound must be an integer type. */ |
6556 | if (!dependent_type_p (type) && !INTEGRAL_TYPE_P (type)) | |
2848ad0f | 6557 | { |
d63b5e9f | 6558 | if (name) |
2d01edd7 | 6559 | error ("size of array %qD has non-integral type %qT", name, type); |
d63b5e9f | 6560 | else |
2d01edd7 | 6561 | error ("size of array has non-integral type %qT", type); |
d63b5e9f NS |
6562 | size = integer_one_node; |
6563 | type = TREE_TYPE (size); | |
2848ad0f MM |
6564 | } |
6565 | ||
06d40de8 DG |
6566 | if (value_dependent_expression_p (size)) |
6567 | { | |
6568 | /* We cannot do any checking for a value-dependent SIZE. Just | |
6569 | build the index type and mark that it requires structural | |
6570 | equality checks. */ | |
6571 | itype = build_index_type (build_min (MINUS_EXPR, sizetype, | |
6572 | size, integer_one_node)); | |
6573 | SET_TYPE_STRUCTURAL_EQUALITY (itype); | |
6574 | return itype; | |
6575 | } | |
6576 | ||
6577 | if (!abi_version_at_least (2) && processing_template_decl) | |
6578 | /* For abi-1, we handled all instances in templates the same way, | |
6579 | even when they were non-dependent. This effects the manglings | |
6580 | produced. So, we do the normal checking for non-dependent | |
6581 | sizes, but at the end we'll return the same type that abi-1 | |
6582 | would have, but with TYPE_CANONICAL set to the "right" | |
6583 | value that the current ABI would provide. */ | |
6584 | abi_1_itype = build_index_type (build_min (MINUS_EXPR, sizetype, | |
6585 | size, integer_one_node)); | |
d63b5e9f | 6586 | |
a1c65f9f | 6587 | /* The size might be the result of a cast. */ |
80f5bb34 MM |
6588 | STRIP_TYPE_NOPS (size); |
6589 | ||
6590 | /* It might be a const variable or enumeration constant. */ | |
8a784e4a | 6591 | size = integral_constant_value (size); |
80f5bb34 | 6592 | |
2848ad0f | 6593 | /* Normally, the array-bound will be a constant. */ |
2bb5d995 | 6594 | if (TREE_CODE (size) == INTEGER_CST) |
2848ad0f MM |
6595 | { |
6596 | /* Check to see if the array bound overflowed. Make that an | |
6597 | error, no matter how generous we're being. */ | |
6598 | int old_flag_pedantic_errors = flag_pedantic_errors; | |
6599 | int old_pedantic = pedantic; | |
6600 | pedantic = flag_pedantic_errors = 1; | |
6601 | constant_expression_warning (size); | |
6602 | pedantic = old_pedantic; | |
6603 | flag_pedantic_errors = old_flag_pedantic_errors; | |
6604 | ||
6605 | /* An array must have a positive number of elements. */ | |
6606 | if (INT_CST_LT (size, integer_zero_node)) | |
6607 | { | |
d67cdbc3 | 6608 | if (name) |
2d01edd7 | 6609 | error ("size of array %qD is negative", name); |
d67cdbc3 | 6610 | else |
33bd39a2 | 6611 | error ("size of array is negative"); |
2848ad0f MM |
6612 | size = integer_one_node; |
6613 | } | |
a8e6c82a MM |
6614 | /* As an extension we allow zero-sized arrays. We always allow |
6615 | them in system headers because glibc uses them. */ | |
2848ad0f | 6616 | else if (integer_zerop (size) && pedantic && !in_system_header) |
d67cdbc3 JM |
6617 | { |
6618 | if (name) | |
2d01edd7 | 6619 | pedwarn ("ISO C++ forbids zero-size array %qD", name); |
d67cdbc3 | 6620 | else |
33bd39a2 | 6621 | pedwarn ("ISO C++ forbids zero-size array"); |
d67cdbc3 | 6622 | } |
2848ad0f | 6623 | } |
2bb5d995 JM |
6624 | else if (TREE_CONSTANT (size)) |
6625 | { | |
6626 | /* `(int) &fn' is not a valid array bound. */ | |
6627 | if (name) | |
2d01edd7 | 6628 | error ("size of array %qD is not an integral constant-expression", |
0cbd7506 | 6629 | name); |
2bb5d995 | 6630 | else |
33bd39a2 | 6631 | error ("size of array is not an integral constant-expression"); |
3aa2ddb8 | 6632 | size = integer_one_node; |
2bb5d995 | 6633 | } |
d63b5e9f NS |
6634 | else if (pedantic) |
6635 | { | |
6636 | if (name) | |
2d01edd7 | 6637 | pedwarn ("ISO C++ forbids variable-size array %qD", name); |
d63b5e9f NS |
6638 | else |
6639 | pedwarn ("ISO C++ forbids variable-size array"); | |
6640 | } | |
2848ad0f | 6641 | |
d63b5e9f NS |
6642 | if (processing_template_decl && !TREE_CONSTANT (size)) |
6643 | /* A variable sized array. */ | |
6644 | itype = build_min (MINUS_EXPR, sizetype, size, integer_one_node); | |
6645 | else | |
2848ad0f | 6646 | { |
455f19cb MM |
6647 | HOST_WIDE_INT saved_processing_template_decl; |
6648 | ||
d63b5e9f | 6649 | /* Compute the index of the largest element in the array. It is |
0cbd7506 MS |
6650 | one less than the number of elements in the array. We save |
6651 | and restore PROCESSING_TEMPLATE_DECL so that computations in | |
6652 | cp_build_binary_op will be appropriately folded. */ | |
455f19cb MM |
6653 | saved_processing_template_decl = processing_template_decl; |
6654 | processing_template_decl = 0; | |
6655 | itype = cp_build_binary_op (MINUS_EXPR, | |
6656 | cp_convert (ssizetype, size), | |
6657 | cp_convert (ssizetype, integer_one_node)); | |
6658 | itype = fold (itype); | |
6659 | processing_template_decl = saved_processing_template_decl; | |
6660 | ||
d63b5e9f | 6661 | if (!TREE_CONSTANT (itype)) |
f4f206f4 | 6662 | /* A variable sized array. */ |
d63b5e9f NS |
6663 | itype = variable_size (itype); |
6664 | /* Make sure that there was no overflow when creating to a signed | |
0cbd7506 MS |
6665 | index type. (For example, on a 32-bit machine, an array with |
6666 | size 2^32 - 1 is too big.) */ | |
9116d529 RS |
6667 | else if (TREE_CODE (itype) == INTEGER_CST |
6668 | && TREE_OVERFLOW (itype)) | |
2848ad0f | 6669 | { |
d63b5e9f NS |
6670 | error ("overflow in array dimension"); |
6671 | TREE_OVERFLOW (itype) = 0; | |
2848ad0f | 6672 | } |
2848ad0f | 6673 | } |
68642fb6 | 6674 | |
2848ad0f | 6675 | /* Create and return the appropriate index type. */ |
06d40de8 DG |
6676 | if (abi_1_itype) |
6677 | { | |
6678 | tree t = build_index_type (itype); | |
6679 | TYPE_CANONICAL (abi_1_itype) = TYPE_CANONICAL (t); | |
6680 | return abi_1_itype; | |
6681 | } | |
6682 | else | |
6683 | return build_index_type (itype); | |
2848ad0f MM |
6684 | } |
6685 | ||
a723baf1 MM |
6686 | /* Returns the scope (if any) in which the entity declared by |
6687 | DECLARATOR will be located. If the entity was declared with an | |
6688 | unqualified name, NULL_TREE is returned. */ | |
6689 | ||
6690 | tree | |
058b15c1 | 6691 | get_scope_of_declarator (const cp_declarator *declarator) |
a723baf1 | 6692 | { |
058b15c1 MM |
6693 | while (declarator && declarator->kind != cdk_id) |
6694 | declarator = declarator->declarator; | |
6695 | ||
6696 | /* If the declarator-id is a SCOPE_REF, the scope in which the | |
6697 | declaration occurs is the first operand. */ | |
6698 | if (declarator | |
1d786913 MM |
6699 | && declarator->u.id.qualifying_scope) |
6700 | return declarator->u.id.qualifying_scope; | |
058b15c1 | 6701 | |
77880ae4 | 6702 | /* Otherwise, the declarator is not a qualified name; the entity will |
058b15c1 MM |
6703 | be declared in the current scope. */ |
6704 | return NULL_TREE; | |
a723baf1 MM |
6705 | } |
6706 | ||
2848ad0f MM |
6707 | /* Returns an ARRAY_TYPE for an array with SIZE elements of the |
6708 | indicated TYPE. If non-NULL, NAME is the NAME of the declaration | |
6709 | with this type. */ | |
6710 | ||
6711 | static tree | |
11f6b451 | 6712 | create_array_type_for_decl (tree name, tree type, tree size) |
2848ad0f MM |
6713 | { |
6714 | tree itype = NULL_TREE; | |
6715 | const char* error_msg; | |
6716 | ||
6717 | /* If things have already gone awry, bail now. */ | |
6718 | if (type == error_mark_node || size == error_mark_node) | |
6719 | return error_mark_node; | |
6720 | ||
6721 | /* Assume that everything will go OK. */ | |
6722 | error_msg = NULL; | |
6723 | ||
6724 | /* There are some types which cannot be array elements. */ | |
6725 | switch (TREE_CODE (type)) | |
6726 | { | |
6727 | case VOID_TYPE: | |
6728 | error_msg = "array of void"; | |
6729 | break; | |
6730 | ||
6731 | case FUNCTION_TYPE: | |
6732 | error_msg = "array of functions"; | |
6733 | break; | |
6734 | ||
6735 | case REFERENCE_TYPE: | |
6736 | error_msg = "array of references"; | |
6737 | break; | |
6738 | ||
2848ad0f MM |
6739 | case METHOD_TYPE: |
6740 | error_msg = "array of function members"; | |
6741 | break; | |
6742 | ||
6743 | default: | |
6744 | break; | |
6745 | } | |
6746 | ||
6747 | /* If something went wrong, issue an error-message and return. */ | |
6748 | if (error_msg) | |
6749 | { | |
6750 | if (name) | |
2d01edd7 | 6751 | error ("declaration of %qD as %s", name, error_msg); |
2848ad0f | 6752 | else |
33bd39a2 | 6753 | error ("creating %s", error_msg); |
2848ad0f MM |
6754 | |
6755 | return error_mark_node; | |
6756 | } | |
6757 | ||
6758 | /* [dcl.array] | |
68642fb6 | 6759 | |
2848ad0f MM |
6760 | The constant expressions that specify the bounds of the arrays |
6761 | can be omitted only for the first member of the sequence. */ | |
6762 | if (TREE_CODE (type) == ARRAY_TYPE && !TYPE_DOMAIN (type)) | |
6763 | { | |
b3faacfd | 6764 | if (name) |
2d01edd7 | 6765 | error ("declaration of %qD as multidimensional array must " |
0cbd7506 MS |
6766 | "have bounds for all dimensions except the first", |
6767 | name); | |
b3faacfd | 6768 | else |
2d01edd7 | 6769 | error ("multidimensional array must have bounds for all " |
0cbd7506 | 6770 | "dimensions except the first"); |
2848ad0f MM |
6771 | |
6772 | return error_mark_node; | |
6773 | } | |
6774 | ||
6775 | /* Figure out the index type for the array. */ | |
6776 | if (size) | |
6777 | itype = compute_array_index_type (name, size); | |
6778 | ||
7fb213d8 GB |
6779 | /* [dcl.array] |
6780 | T is called the array element type; this type shall not be [...] an | |
6781 | abstract class type. */ | |
6782 | abstract_virtuals_error (name, type); | |
6783 | ||
2848ad0f MM |
6784 | return build_cplus_array_type (type, itype); |
6785 | } | |
6786 | ||
3dbc07b6 MM |
6787 | /* Check that it's OK to declare a function with the indicated TYPE. |
6788 | SFK indicates the kind of special function (if any) that this | |
1f84ec23 | 6789 | function is. OPTYPE is the type given in a conversion operator |
44d10c10 PB |
6790 | declaration, or the class type for a constructor/destructor. |
6791 | Returns the actual return type of the function; that | |
3dbc07b6 MM |
6792 | may be different than TYPE if an error occurs, or for certain |
6793 | special functions. */ | |
6794 | ||
6795 | static tree | |
11f6b451 | 6796 | check_special_function_return_type (special_function_kind sfk, |
0cbd7506 MS |
6797 | tree type, |
6798 | tree optype) | |
3dbc07b6 MM |
6799 | { |
6800 | switch (sfk) | |
6801 | { | |
6802 | case sfk_constructor: | |
6803 | if (type) | |
33bd39a2 | 6804 | error ("return type specification for constructor invalid"); |
5362b086 | 6805 | |
44d10c10 PB |
6806 | if (targetm.cxx.cdtor_returns_this () && !TYPE_FOR_JAVA (optype)) |
6807 | type = build_pointer_type (optype); | |
6808 | else | |
6809 | type = void_type_node; | |
3dbc07b6 MM |
6810 | break; |
6811 | ||
6812 | case sfk_destructor: | |
6813 | if (type) | |
33bd39a2 | 6814 | error ("return type specification for destructor invalid"); |
44d10c10 | 6815 | /* We can't use the proper return type here because we run into |
77880ae4 | 6816 | problems with ambiguous bases and covariant returns. |
44d10c10 PB |
6817 | Java classes are left unchanged because (void *) isn't a valid |
6818 | Java type, and we don't want to change the Java ABI. */ | |
6819 | if (targetm.cxx.cdtor_returns_this () && !TYPE_FOR_JAVA (optype)) | |
6820 | type = build_pointer_type (void_type_node); | |
6821 | else | |
6822 | type = void_type_node; | |
3dbc07b6 MM |
6823 | break; |
6824 | ||
6825 | case sfk_conversion: | |
6826 | if (type && !same_type_p (type, optype)) | |
2d01edd7 | 6827 | error ("operator %qT declared to return %qT", optype, type); |
3dbc07b6 | 6828 | else if (type) |
2d01edd7 | 6829 | pedwarn ("return type specified for %<operator %T%>", optype); |
3dbc07b6 MM |
6830 | type = optype; |
6831 | break; | |
6832 | ||
6833 | default: | |
8dc2b103 | 6834 | gcc_unreachable (); |
3dbc07b6 MM |
6835 | } |
6836 | ||
6837 | return type; | |
6838 | } | |
6839 | ||
62e19030 MM |
6840 | /* A variable or data member (whose unqualified name is IDENTIFIER) |
6841 | has been declared with the indicated TYPE. If the TYPE is not | |
6842 | acceptable, issue an error message and return a type to use for | |
03fd3f84 | 6843 | error-recovery purposes. */ |
62e19030 MM |
6844 | |
6845 | tree | |
6846 | check_var_type (tree identifier, tree type) | |
6847 | { | |
6848 | if (VOID_TYPE_P (type)) | |
6849 | { | |
6850 | if (!identifier) | |
6851 | error ("unnamed variable or field declared void"); | |
6852 | else if (TREE_CODE (identifier) == IDENTIFIER_NODE) | |
6853 | { | |
6854 | gcc_assert (!IDENTIFIER_OPNAME_P (identifier)); | |
6855 | error ("variable or field %qE declared void", identifier); | |
6856 | } | |
6857 | else | |
6858 | error ("variable or field declared void"); | |
650fcd07 | 6859 | type = error_mark_node; |
62e19030 | 6860 | } |
c8094d83 | 6861 | |
62e19030 MM |
6862 | return type; |
6863 | } | |
6864 | ||
a723baf1 MM |
6865 | /* Given declspecs and a declarator (abstract or otherwise), determine |
6866 | the name and type of the object declared and construct a DECL node | |
6867 | for it. | |
8d08fdba | 6868 | |
5e32a5cf GDR |
6869 | DECLSPECS points to the representation of declaration-specifier |
6870 | sequence that precedes declarator. | |
8d08fdba MS |
6871 | |
6872 | DECL_CONTEXT says which syntactic context this declaration is in: | |
6873 | NORMAL for most contexts. Make a VAR_DECL or FUNCTION_DECL or TYPE_DECL. | |
6874 | FUNCDEF for a function definition. Like NORMAL but a few different | |
6875 | error messages in each case. Return value may be zero meaning | |
6876 | this definition is too screwy to try to parse. | |
6877 | MEMFUNCDEF for a function definition. Like FUNCDEF but prepares to | |
6878 | handle member functions (which have FIELD context). | |
6879 | Return value may be zero meaning this definition is too screwy to | |
6880 | try to parse. | |
6881 | PARM for a parameter declaration (either within a function prototype | |
6882 | or before a function body). Make a PARM_DECL, or return void_type_node. | |
db5ae43f | 6883 | CATCHPARM for a parameter declaration before a catch clause. |
8d08fdba MS |
6884 | TYPENAME if for a typename (in a cast or sizeof). |
6885 | Don't make a DECL node; just return the ..._TYPE node. | |
6886 | FIELD for a struct or union field; make a FIELD_DECL. | |
6887 | BITFIELD for a field with specified width. | |
6888 | INITIALIZED is 1 if the decl has an initializer. | |
6889 | ||
91d231cb JM |
6890 | ATTRLIST is a pointer to the list of attributes, which may be NULL |
6891 | if there are none; *ATTRLIST may be modified if attributes from inside | |
6892 | the declarator should be applied to the declaration. | |
b17e2870 | 6893 | |
a723baf1 MM |
6894 | When this function is called, scoping variables (such as |
6895 | CURRENT_CLASS_TYPE) should reflect the scope in which the | |
6896 | declaration occurs, not the scope in which the new declaration will | |
6897 | be placed. For example, on: | |
8d08fdba | 6898 | |
a723baf1 | 6899 | void S::f() { ... } |
8d08fdba | 6900 | |
a723baf1 | 6901 | when grokdeclarator is called for `S::f', the CURRENT_CLASS_TYPE |
344f237b LM |
6902 | should not be `S'. |
6903 | ||
6904 | Returns a DECL (if a declarator is present), a TYPE (if there is no | |
6905 | declarator, in cases like "struct S;"), or the ERROR_MARK_NODE if an | |
6906 | error occurs. */ | |
8d08fdba | 6907 | |
8d08fdba | 6908 | tree |
058b15c1 | 6909 | grokdeclarator (const cp_declarator *declarator, |
1ff3c076 | 6910 | const cp_decl_specifier_seq *declspecs, |
0cbd7506 MS |
6911 | enum decl_context decl_context, |
6912 | int initialized, | |
6913 | tree* attrlist) | |
8d08fdba | 6914 | { |
8d08fdba MS |
6915 | tree type = NULL_TREE; |
6916 | int longlong = 0; | |
db5ae43f | 6917 | int virtualp, explicitp, friendp, inlinep, staticp; |
8d08fdba MS |
6918 | int explicit_int = 0; |
6919 | int explicit_char = 0; | |
37c46b43 | 6920 | int defaulted_int = 0; |
d1c78882 | 6921 | tree dependent_name = NULL_TREE; |
caf93cb0 | 6922 | |
8d08fdba | 6923 | tree typedef_decl = NULL_TREE; |
058b15c1 | 6924 | const char *name = NULL; |
8d08fdba | 6925 | tree typedef_type = NULL_TREE; |
357d956e MM |
6926 | /* True if this declarator is a function definition. */ |
6927 | bool funcdef_flag = false; | |
058b15c1 | 6928 | cp_declarator_kind innermost_code = cdk_error; |
8d08fdba | 6929 | int bitfield = 0; |
6125f3be DE |
6930 | #if 0 |
6931 | /* See the code below that used this. */ | |
91d231cb | 6932 | tree decl_attr = NULL_TREE; |
6125f3be | 6933 | #endif |
8d08fdba MS |
6934 | |
6935 | /* Keep track of what sort of function is being processed | |
6936 | so that we can warn about default return values, or explicit | |
6937 | return values which do not match prescribed defaults. */ | |
3dbc07b6 | 6938 | special_function_kind sfk = sfk_none; |
8d08fdba MS |
6939 | |
6940 | tree dname = NULL_TREE; | |
8d08fdba MS |
6941 | tree ctor_return_type = NULL_TREE; |
6942 | enum overload_flags flags = NO_SPECIAL; | |
e2537f2c MM |
6943 | /* cv-qualifiers that apply to the declarator, for a declaration of |
6944 | a member function. */ | |
6945 | cp_cv_quals memfn_quals = TYPE_UNQUALIFIED; | |
6946 | /* cv-qualifiers that apply to the type specified by the DECLSPECS. */ | |
6947 | int type_quals; | |
c11b6f21 | 6948 | tree raises = NULL_TREE; |
386b8a85 | 6949 | int template_count = 0; |
91d231cb | 6950 | tree returned_attrs = NULL_TREE; |
4546865e | 6951 | tree parms = NULL_TREE; |
058b15c1 MM |
6952 | const cp_declarator *id_declarator; |
6953 | /* The unqualified name of the declarator; either an | |
6954 | IDENTIFIER_NODE, BIT_NOT_EXPR, or TEMPLATE_ID_EXPR. */ | |
6955 | tree unqualified_id; | |
6956 | /* The class type, if any, in which this entity is located, | |
6957 | or NULL_TREE if none. Note that this value may be different from | |
6958 | the current class type; for example if an attempt is made to declare | |
6959 | "A::f" inside "B", this value will be "A". */ | |
6960 | tree ctype = current_class_type; | |
6961 | /* The NAMESPACE_DECL for the namespace in which this entity is | |
6962 | located. If an unqualified name is used to declare the entity, | |
6963 | this value will be NULL_TREE, even if the entity is located at | |
caf93cb0 | 6964 | namespace scope. */ |
058b15c1 | 6965 | tree in_namespace = NULL_TREE; |
1ff3c076 MM |
6966 | cp_storage_class storage_class; |
6967 | bool unsigned_p, signed_p, short_p, long_p, thread_p; | |
2cfe82fe | 6968 | bool type_was_error_mark_node = false; |
1891dec4 | 6969 | bool set_no_warning = false; |
1ff3c076 MM |
6970 | |
6971 | signed_p = declspecs->specs[(int)ds_signed]; | |
6972 | unsigned_p = declspecs->specs[(int)ds_unsigned]; | |
6973 | short_p = declspecs->specs[(int)ds_short]; | |
6974 | long_p = declspecs->specs[(int)ds_long]; | |
28c84d63 | 6975 | longlong = declspecs->specs[(int)ds_long] >= 2; |
1ff3c076 | 6976 | thread_p = declspecs->specs[(int)ds_thread]; |
8d08fdba | 6977 | |
8d08fdba | 6978 | if (decl_context == FUNCDEF) |
357d956e | 6979 | funcdef_flag = true, decl_context = NORMAL; |
8d08fdba | 6980 | else if (decl_context == MEMFUNCDEF) |
357d956e | 6981 | funcdef_flag = true, decl_context = FIELD; |
8d08fdba MS |
6982 | else if (decl_context == BITFIELD) |
6983 | bitfield = 1, decl_context = FIELD; | |
6984 | ||
8d08fdba MS |
6985 | /* Look inside a declarator for the name being declared |
6986 | and get it as a string, for an error message. */ | |
caf93cb0 EC |
6987 | for (id_declarator = declarator; |
6988 | id_declarator; | |
058b15c1 MM |
6989 | id_declarator = id_declarator->declarator) |
6990 | { | |
6991 | if (id_declarator->kind != cdk_id) | |
6992 | innermost_code = id_declarator->kind; | |
8d08fdba | 6993 | |
058b15c1 MM |
6994 | switch (id_declarator->kind) |
6995 | { | |
6996 | case cdk_function: | |
6997 | if (id_declarator->declarator | |
6998 | && id_declarator->declarator->kind == cdk_id) | |
8d08fdba | 6999 | { |
058b15c1 MM |
7000 | sfk = id_declarator->declarator->u.id.sfk; |
7001 | if (sfk == sfk_destructor) | |
7002 | flags = DTOR_FLAG; | |
51c184be | 7003 | } |
058b15c1 | 7004 | break; |
be99da77 | 7005 | |
058b15c1 MM |
7006 | case cdk_id: |
7007 | { | |
1d786913 MM |
7008 | tree qualifying_scope = id_declarator->u.id.qualifying_scope; |
7009 | tree decl = id_declarator->u.id.unqualified_name; | |
058b15c1 MM |
7010 | if (!decl) |
7011 | break; | |
1d786913 | 7012 | if (qualifying_scope) |
8d08fdba | 7013 | { |
2884e22c MM |
7014 | if (at_function_scope_p ()) |
7015 | { | |
7016 | /* [dcl.meaning] | |
7017 | ||
7018 | A declarator-id shall not be qualified except | |
7019 | for ... | |
7020 | ||
7021 | None of the cases are permitted in block | |
7022 | scope. */ | |
7023 | if (qualifying_scope == global_namespace) | |
7024 | error ("invalid use of qualified-name %<::%D%>", | |
7025 | decl); | |
7026 | else if (TYPE_P (qualifying_scope)) | |
7027 | error ("invalid use of qualified-name %<%T::%D%>", | |
7028 | qualifying_scope, decl); | |
7029 | else | |
7030 | error ("invalid use of qualified-name %<%D::%D%>", | |
7031 | qualifying_scope, decl); | |
7032 | return error_mark_node; | |
7033 | } | |
7034 | else if (TYPE_P (qualifying_scope)) | |
058b15c1 | 7035 | { |
1d786913 | 7036 | ctype = qualifying_scope; |
058b15c1 MM |
7037 | if (innermost_code != cdk_function |
7038 | && current_class_type | |
caf93cb0 | 7039 | && !UNIQUELY_DERIVED_FROM_P (ctype, |
058b15c1 MM |
7040 | current_class_type)) |
7041 | { | |
2d01edd7 | 7042 | error ("type %qT is not derived from type %qT", |
058b15c1 | 7043 | ctype, current_class_type); |
1d786913 | 7044 | return error_mark_node; |
058b15c1 | 7045 | } |
058b15c1 MM |
7046 | } |
7047 | else if (TREE_CODE (qualifying_scope) == NAMESPACE_DECL) | |
7048 | in_namespace = qualifying_scope; | |
058b15c1 | 7049 | } |
058b15c1 MM |
7050 | switch (TREE_CODE (decl)) |
7051 | { | |
7052 | case BIT_NOT_EXPR: | |
be99da77 | 7053 | { |
88e95ee3 MM |
7054 | tree type; |
7055 | ||
7056 | if (innermost_code != cdk_function) | |
7057 | { | |
7058 | error ("declaration of %qD as non-function", decl); | |
7059 | return error_mark_node; | |
7060 | } | |
c8094d83 | 7061 | else if (!qualifying_scope |
88e95ee3 MM |
7062 | && !(current_class_type && at_class_scope_p ())) |
7063 | { | |
7064 | error ("declaration of %qD as non-member", decl); | |
7065 | return error_mark_node; | |
7066 | } | |
c8094d83 | 7067 | |
88e95ee3 MM |
7068 | type = TREE_OPERAND (decl, 0); |
7069 | name = IDENTIFIER_POINTER (constructor_name (type)); | |
af02935e | 7070 | dname = decl; |
058b15c1 MM |
7071 | } |
7072 | break; | |
633221db | 7073 | |
058b15c1 MM |
7074 | case TEMPLATE_ID_EXPR: |
7075 | { | |
7076 | tree fns = TREE_OPERAND (decl, 0); | |
633221db | 7077 | |
058b15c1 | 7078 | dname = fns; |
058b15c1 | 7079 | if (TREE_CODE (dname) != IDENTIFIER_NODE) |
be99da77 | 7080 | { |
50bc768d | 7081 | gcc_assert (is_overloaded_fn (dname)); |
058b15c1 | 7082 | dname = DECL_NAME (get_first_fn (dname)); |
be99da77 MS |
7083 | } |
7084 | } | |
058b15c1 | 7085 | /* Fall through. */ |
be99da77 | 7086 | |
058b15c1 MM |
7087 | case IDENTIFIER_NODE: |
7088 | if (TREE_CODE (decl) == IDENTIFIER_NODE) | |
7089 | dname = decl; | |
be99da77 | 7090 | |
058b15c1 MM |
7091 | if (C_IS_RESERVED_WORD (dname)) |
7092 | { | |
2d01edd7 | 7093 | error ("declarator-id missing; using reserved word %qD", |
058b15c1 MM |
7094 | dname); |
7095 | name = IDENTIFIER_POINTER (dname); | |
7096 | } | |
7097 | else if (!IDENTIFIER_TYPENAME_P (dname)) | |
7098 | name = IDENTIFIER_POINTER (dname); | |
7099 | else | |
7100 | { | |
50bc768d | 7101 | gcc_assert (flags == NO_SPECIAL); |
058b15c1 MM |
7102 | flags = TYPENAME_FLAG; |
7103 | ctor_return_type = TREE_TYPE (dname); | |
7104 | sfk = sfk_conversion; | |
7105 | if (is_typename_at_global_scope (dname)) | |
7106 | name = IDENTIFIER_POINTER (dname); | |
7107 | else | |
7108 | name = "<invalid operator>"; | |
7109 | } | |
7110 | break; | |
7111 | ||
058b15c1 | 7112 | default: |
8dc2b103 | 7113 | gcc_unreachable (); |
058b15c1 | 7114 | } |
45537677 MS |
7115 | break; |
7116 | ||
058b15c1 MM |
7117 | case cdk_array: |
7118 | case cdk_pointer: | |
7119 | case cdk_reference: | |
7120 | case cdk_ptrmem: | |
50ad9642 | 7121 | break; |
2ee366b5 | 7122 | |
058b15c1 | 7123 | case cdk_error: |
fa6098f8 | 7124 | return error_mark_node; |
058b15c1 | 7125 | |
be99da77 | 7126 | default: |
8dc2b103 | 7127 | gcc_unreachable (); |
8d08fdba | 7128 | } |
058b15c1 MM |
7129 | } |
7130 | if (id_declarator->kind == cdk_id) | |
7131 | break; | |
7132 | } | |
8d08fdba | 7133 | |
fa6098f8 | 7134 | /* [dcl.fct.edf] |
3db45ab5 | 7135 | |
fa6098f8 MM |
7136 | The declarator in a function-definition shall have the form |
7137 | D1 ( parameter-declaration-clause) ... */ | |
058b15c1 | 7138 | if (funcdef_flag && innermost_code != cdk_function) |
fa6098f8 MM |
7139 | { |
7140 | error ("function definition does not declare parameters"); | |
7141 | return error_mark_node; | |
7142 | } | |
8d08fdba | 7143 | |
e1cd6e56 | 7144 | if (((dname && IDENTIFIER_OPNAME_P (dname)) || flags == TYPENAME_FLAG) |
058b15c1 | 7145 | && innermost_code != cdk_function |
62d1db17 | 7146 | && ! (ctype && !declspecs->any_specifiers_p)) |
e1cd6e56 | 7147 | { |
2d01edd7 | 7148 | error ("declaration of %qD as non-function", dname); |
943e3ede | 7149 | return error_mark_node; |
e1cd6e56 MS |
7150 | } |
7151 | ||
8d08fdba MS |
7152 | /* Anything declared one level down from the top level |
7153 | must be one of the parameters of a function | |
7154 | (because the body is at least two levels down). */ | |
7155 | ||
7156 | /* This heuristic cannot be applied to C++ nodes! Fixed, however, | |
7157 | by not allowing C++ class definitions to specify their parameters | |
7158 | with xdecls (must be spec.d in the parmlist). | |
7159 | ||
7160 | Since we now wait to push a class scope until we are sure that | |
7161 | we are in a legitimate method context, we must set oldcname | |
a9aedbc2 MS |
7162 | explicitly (since current_class_name is not yet alive). |
7163 | ||
7164 | We also want to avoid calling this a PARM if it is in a namespace. */ | |
8d08fdba | 7165 | |
9188c363 | 7166 | if (decl_context == NORMAL && !toplevel_bindings_p ()) |
a9aedbc2 | 7167 | { |
e2500fed | 7168 | struct cp_binding_level *b = current_binding_level; |
ff955512 | 7169 | current_binding_level = b->level_chain; |
a9aedbc2 MS |
7170 | if (current_binding_level != 0 && toplevel_bindings_p ()) |
7171 | decl_context = PARM; | |
ff955512 | 7172 | current_binding_level = b; |
a9aedbc2 | 7173 | } |
8d08fdba | 7174 | |
34fc957d NS |
7175 | if (name == NULL) |
7176 | name = decl_context == PARM ? "parameter" : "type name"; | |
68642fb6 | 7177 | |
62d1db17 MM |
7178 | /* If there were multiple types specified in the decl-specifier-seq, |
7179 | issue an error message. */ | |
7180 | if (declspecs->multiple_types_p) | |
32273f9f LM |
7181 | { |
7182 | error ("two or more data types in declaration of %qs", name); | |
7183 | return error_mark_node; | |
7184 | } | |
7185 | ||
62d1db17 MM |
7186 | /* Extract the basic type from the decl-specifier-seq. */ |
7187 | type = declspecs->type; | |
7188 | if (type == error_mark_node) | |
2cfe82fe ZW |
7189 | { |
7190 | type = NULL_TREE; | |
7191 | type_was_error_mark_node = true; | |
7192 | } | |
62d1db17 MM |
7193 | /* If the entire declaration is itself tagged as deprecated then |
7194 | suppress reports of deprecated items. */ | |
7195 | if (type && TREE_DEPRECATED (type) | |
7196 | && deprecated_state != DEPRECATED_SUPPRESS) | |
7197 | warn_deprecated_use (type); | |
7198 | if (type && TREE_CODE (type) == TYPE_DECL) | |
8d08fdba | 7199 | { |
62d1db17 MM |
7200 | typedef_decl = type; |
7201 | type = TREE_TYPE (typedef_decl); | |
7202 | } | |
7203 | /* No type at all: default to `int', and set DEFAULTED_INT | |
7204 | because it was not a user-defined typedef. */ | |
1ff3c076 | 7205 | if (type == NULL_TREE && (signed_p || unsigned_p || long_p || short_p)) |
62d1db17 MM |
7206 | { |
7207 | /* These imply 'int'. */ | |
7208 | type = integer_type_node; | |
7209 | defaulted_int = 1; | |
7210 | } | |
7211 | /* Gather flags. */ | |
7212 | explicit_int = declspecs->explicit_int_p; | |
7213 | explicit_char = declspecs->explicit_char_p; | |
7a1f3f5f | 7214 | |
8d6e459d NS |
7215 | #if 0 |
7216 | /* See the code below that used this. */ | |
7217 | if (typedef_decl) | |
7218 | decl_attr = DECL_ATTRIBUTES (typedef_decl); | |
7219 | #endif | |
8d08fdba MS |
7220 | typedef_type = type; |
7221 | ||
a3203465 | 7222 | |
44d10c10 PB |
7223 | if (sfk != sfk_conversion) |
7224 | ctor_return_type = ctype; | |
7225 | ||
3dbc07b6 MM |
7226 | if (sfk != sfk_none) |
7227 | type = check_special_function_return_type (sfk, type, | |
3dbc07b6 MM |
7228 | ctor_return_type); |
7229 | else if (type == NULL_TREE) | |
8d08fdba | 7230 | { |
3dbc07b6 MM |
7231 | int is_main; |
7232 | ||
8d08fdba | 7233 | explicit_int = -1; |
3dbc07b6 | 7234 | |
0fd0b7ee JM |
7235 | /* We handle `main' specially here, because 'main () { }' is so |
7236 | common. With no options, it is allowed. With -Wreturn-type, | |
7237 | it is a warning. It is only an error with -pedantic-errors. */ | |
3dbc07b6 | 7238 | is_main = (funcdef_flag |
7437519c | 7239 | && dname && MAIN_NAME_P (dname) |
3dbc07b6 MM |
7240 | && ctype == NULL_TREE |
7241 | && in_namespace == NULL_TREE | |
7242 | && current_namespace == global_namespace); | |
7243 | ||
2cfe82fe ZW |
7244 | if (type_was_error_mark_node) |
7245 | /* We've already issued an error, don't complain more. */; | |
7246 | else if (in_system_header || flag_ms_extensions) | |
3dbc07b6 MM |
7247 | /* Allow it, sigh. */; |
7248 | else if (pedantic || ! is_main) | |
2d01edd7 | 7249 | pedwarn ("ISO C++ forbids declaration of %qs with no type", name); |
b10fc6f5 GDR |
7250 | else |
7251 | warning (OPT_Wreturn_type, | |
7252 | "ISO C++ forbids declaration of %qs with no type", name); | |
41eff652 | 7253 | |
3dbc07b6 | 7254 | type = integer_type_node; |
51c184be | 7255 | } |
caf93cb0 | 7256 | |
8d08fdba MS |
7257 | ctype = NULL_TREE; |
7258 | ||
7259 | /* Now process the modifiers that were specified | |
7260 | and check for invalid combinations. */ | |
7261 | ||
7262 | /* Long double is a special combination. */ | |
3cc189f5 | 7263 | if (long_p && !longlong && TYPE_MAIN_VARIANT (type) == double_type_node) |
8d08fdba | 7264 | { |
1ff3c076 | 7265 | long_p = false; |
68642fb6 | 7266 | type = build_qualified_type (long_double_type_node, |
89d684bb | 7267 | cp_type_quals (type)); |
8d08fdba MS |
7268 | } |
7269 | ||
7270 | /* Check all other uses of type modifiers. */ | |
7271 | ||
1ff3c076 | 7272 | if (unsigned_p || signed_p || long_p || short_p) |
8d08fdba MS |
7273 | { |
7274 | int ok = 0; | |
7275 | ||
3cc189f5 VR |
7276 | if ((signed_p || unsigned_p) && TREE_CODE (type) != INTEGER_TYPE) |
7277 | error ("%<signed%> or %<unsigned%> invalid for %qs", name); | |
1ff3c076 | 7278 | else if (signed_p && unsigned_p) |
3cc189f5 VR |
7279 | error ("%<signed%> and %<unsigned%> specified together for %qs", name); |
7280 | else if (longlong && TREE_CODE (type) != INTEGER_TYPE) | |
7281 | error ("%<long long%> invalid for %qs", name); | |
7282 | else if (long_p && TREE_CODE (type) == REAL_TYPE) | |
7283 | error ("%<long%> invalid for %qs", name); | |
7284 | else if (short_p && TREE_CODE (type) == REAL_TYPE) | |
7285 | error ("%<short%> invalid for %qs", name); | |
5d48268f VR |
7286 | else if ((long_p || short_p) && TREE_CODE (type) != INTEGER_TYPE) |
7287 | error ("%<long%> or %<short%> invalid for %qs", name); | |
3cc189f5 VR |
7288 | else if ((long_p || short_p) && explicit_char) |
7289 | error ("%<long%> or %<short%> specified with char for %qs", name); | |
7290 | else if (long_p && short_p) | |
7291 | error ("%<long%> and %<short%> specified together for %qs", name); | |
8d08fdba MS |
7292 | else |
7293 | { | |
7294 | ok = 1; | |
37c46b43 | 7295 | if (!explicit_int && !defaulted_int && !explicit_char && pedantic) |
8d08fdba | 7296 | { |
2d01edd7 | 7297 | pedwarn ("long, short, signed or unsigned used invalidly for %qs", |
8d08fdba MS |
7298 | name); |
7299 | if (flag_pedantic_errors) | |
7300 | ok = 0; | |
7301 | } | |
7302 | } | |
7303 | ||
7304 | /* Discard the type modifiers if they are invalid. */ | |
7305 | if (! ok) | |
7306 | { | |
1ff3c076 MM |
7307 | unsigned_p = false; |
7308 | signed_p = false; | |
7309 | long_p = false; | |
7310 | short_p = false; | |
8d08fdba MS |
7311 | longlong = 0; |
7312 | } | |
7313 | } | |
7314 | ||
7315 | /* Decide whether an integer type is signed or not. | |
7316 | Optionally treat bitfields as signed by default. */ | |
1ff3c076 | 7317 | if (unsigned_p |
b89c5a7b MM |
7318 | /* [class.bit] |
7319 | ||
7320 | It is implementation-defined whether a plain (neither | |
7321 | explicitly signed or unsigned) char, short, int, or long | |
7322 | bit-field is signed or unsigned. | |
68642fb6 | 7323 | |
b89c5a7b MM |
7324 | Naturally, we extend this to long long as well. Note that |
7325 | this does not include wchar_t. */ | |
7326 | || (bitfield && !flag_signed_bitfields | |
1ff3c076 | 7327 | && !signed_p |
b89c5a7b MM |
7328 | /* A typedef for plain `int' without `signed' can be |
7329 | controlled just like plain `int', but a typedef for | |
7330 | `signed int' cannot be so controlled. */ | |
68642fb6 | 7331 | && !(typedef_decl |
29bbeb1c | 7332 | && C_TYPEDEF_EXPLICITLY_SIGNED (typedef_decl)) |
b38a05d0 | 7333 | && TREE_CODE (type) == INTEGER_TYPE |
29bbeb1c | 7334 | && !same_type_p (TYPE_MAIN_VARIANT (type), wchar_type_node))) |
8d08fdba MS |
7335 | { |
7336 | if (longlong) | |
7337 | type = long_long_unsigned_type_node; | |
1ff3c076 | 7338 | else if (long_p) |
8d08fdba | 7339 | type = long_unsigned_type_node; |
1ff3c076 | 7340 | else if (short_p) |
8d08fdba MS |
7341 | type = short_unsigned_type_node; |
7342 | else if (type == char_type_node) | |
7343 | type = unsigned_char_type_node; | |
7344 | else if (typedef_decl) | |
ceef8ce4 | 7345 | type = c_common_unsigned_type (type); |
8d08fdba MS |
7346 | else |
7347 | type = unsigned_type_node; | |
7348 | } | |
1ff3c076 | 7349 | else if (signed_p && type == char_type_node) |
8d08fdba MS |
7350 | type = signed_char_type_node; |
7351 | else if (longlong) | |
7352 | type = long_long_integer_type_node; | |
1ff3c076 | 7353 | else if (long_p) |
8d08fdba | 7354 | type = long_integer_type_node; |
1ff3c076 | 7355 | else if (short_p) |
8d08fdba MS |
7356 | type = short_integer_type_node; |
7357 | ||
62d1db17 | 7358 | if (declspecs->specs[(int)ds_complex]) |
37c46b43 | 7359 | { |
1ff3c076 | 7360 | if (TREE_CODE (type) != INTEGER_TYPE && TREE_CODE (type) != REAL_TYPE) |
2d01edd7 | 7361 | error ("complex invalid for %qs", name); |
37c46b43 MS |
7362 | /* If we just have "complex", it is equivalent to |
7363 | "complex double", but if any modifiers at all are specified it is | |
7364 | the complex form of TYPE. E.g, "complex short" is | |
7365 | "complex short int". */ | |
7366 | ||
1ff3c076 MM |
7367 | else if (defaulted_int && ! longlong |
7368 | && ! (long_p || short_p || signed_p || unsigned_p)) | |
37c46b43 MS |
7369 | type = complex_double_type_node; |
7370 | else if (type == integer_type_node) | |
7371 | type = complex_integer_type_node; | |
7372 | else if (type == float_type_node) | |
7373 | type = complex_float_type_node; | |
7374 | else if (type == double_type_node) | |
7375 | type = complex_double_type_node; | |
7376 | else if (type == long_double_type_node) | |
7377 | type = complex_long_double_type_node; | |
7378 | else | |
7379 | type = build_complex_type (type); | |
7380 | } | |
7381 | ||
4f2b0fb2 | 7382 | type_quals = TYPE_UNQUALIFIED; |
62d1db17 | 7383 | if (declspecs->specs[(int)ds_const]) |
4f2b0fb2 | 7384 | type_quals |= TYPE_QUAL_CONST; |
62d1db17 | 7385 | if (declspecs->specs[(int)ds_volatile]) |
4f2b0fb2 | 7386 | type_quals |= TYPE_QUAL_VOLATILE; |
62d1db17 | 7387 | if (declspecs->specs[(int)ds_restrict]) |
4f2b0fb2 NS |
7388 | type_quals |= TYPE_QUAL_RESTRICT; |
7389 | if (sfk == sfk_conversion && type_quals != TYPE_UNQUALIFIED) | |
2d01edd7 | 7390 | error ("qualifiers are not allowed on declaration of %<operator %T%>", |
0cbd7506 | 7391 | ctor_return_type); |
3ac3d9ea | 7392 | |
c8094d83 | 7393 | if (TREE_CODE (type) == FUNCTION_TYPE |
9804209d DG |
7394 | && type_quals != TYPE_UNQUALIFIED) |
7395 | { | |
7396 | /* This was an error in C++98 (cv-qualifiers cannot be added to | |
0cbd7506 MS |
7397 | a function type), but DR 295 makes the code well-formed by |
7398 | dropping the extra qualifiers. */ | |
9804209d | 7399 | if (pedantic) |
0cbd7506 MS |
7400 | { |
7401 | tree bad_type = build_qualified_type (type, type_quals); | |
7402 | pedwarn ("ignoring %qV qualifiers added to function type %qT", | |
7403 | bad_type, type); | |
7404 | } | |
9804209d DG |
7405 | type_quals = TYPE_UNQUALIFIED; |
7406 | } | |
4f2b0fb2 NS |
7407 | type_quals |= cp_type_quals (type); |
7408 | type = cp_build_qualified_type_real | |
7409 | (type, type_quals, ((typedef_decl && !DECL_ARTIFICIAL (typedef_decl) | |
23fca1f5 | 7410 | ? tf_ignore_bad_quals : 0) | tf_warning_or_error)); |
4f2b0fb2 NS |
7411 | /* We might have ignored or rejected some of the qualifiers. */ |
7412 | type_quals = cp_type_quals (type); | |
caf93cb0 | 7413 | |
8d08fdba | 7414 | staticp = 0; |
62d1db17 MM |
7415 | inlinep = !! declspecs->specs[(int)ds_inline]; |
7416 | virtualp = !! declspecs->specs[(int)ds_virtual]; | |
7417 | explicitp = !! declspecs->specs[(int)ds_explicit]; | |
8d08fdba | 7418 | |
1ff3c076 MM |
7419 | storage_class = declspecs->storage_class; |
7420 | if (storage_class == sc_static) | |
8d08fdba MS |
7421 | staticp = 1 + (decl_context == FIELD); |
7422 | ||
7423 | if (virtualp && staticp == 2) | |
7424 | { | |
2d01edd7 | 7425 | error ("member %qD cannot be declared both virtual and static", dname); |
7e1e0765 | 7426 | storage_class = sc_none; |
8d08fdba MS |
7427 | staticp = 0; |
7428 | } | |
62d1db17 | 7429 | friendp = !! declspecs->specs[(int)ds_friend]; |
8d08fdba | 7430 | |
d1c78882 | 7431 | if (dependent_name && !friendp) |
d5614afb | 7432 | { |
d1c78882 | 7433 | error ("%<%T::%D%> is not a valid declarator", ctype, dependent_name); |
13dbe691 | 7434 | return error_mark_node; |
d5614afb | 7435 | } |
8d08fdba | 7436 | |
62d1db17 MM |
7437 | /* Issue errors about use of storage classes for parameters. */ |
7438 | if (decl_context == PARM) | |
8d08fdba | 7439 | { |
62d1db17 | 7440 | if (declspecs->specs[(int)ds_typedef]) |
709f9dcf VR |
7441 | { |
7442 | error ("typedef declaration invalid in parameter declaration"); | |
7443 | return error_mark_node; | |
7444 | } | |
1ff3c076 MM |
7445 | else if (storage_class == sc_static |
7446 | || storage_class == sc_extern | |
7447 | || thread_p) | |
8251199e | 7448 | error ("storage class specifiers invalid in parameter declarations"); |
8d08fdba MS |
7449 | } |
7450 | ||
7451 | /* Give error if `virtual' is used outside of class declaration. */ | |
b7484fbe MS |
7452 | if (virtualp |
7453 | && (current_class_name == NULL_TREE || decl_context != FIELD)) | |
8d08fdba | 7454 | { |
8251199e | 7455 | error ("virtual outside class declaration"); |
8d08fdba MS |
7456 | virtualp = 0; |
7457 | } | |
8d08fdba MS |
7458 | |
7459 | /* Static anonymous unions are dealt with here. */ | |
7460 | if (staticp && decl_context == TYPENAME | |
62d1db17 MM |
7461 | && declspecs->type |
7462 | && ANON_AGGR_TYPE_P (declspecs->type)) | |
8d08fdba MS |
7463 | decl_context = FIELD; |
7464 | ||
8d08fdba MS |
7465 | /* Warn about storage classes that are invalid for certain |
7466 | kinds of declarations (parameters, typenames, etc.). */ | |
3e66d096 JJ |
7467 | if (thread_p |
7468 | && ((storage_class | |
7469 | && storage_class != sc_extern | |
7470 | && storage_class != sc_static) | |
7471 | || declspecs->specs[(int)ds_typedef])) | |
7472 | { | |
7473 | error ("multiple storage classes in declaration of %qs", name); | |
7474 | thread_p = false; | |
7475 | } | |
26106542 | 7476 | if (declspecs->conflicting_specifiers_p) |
a23e08d9 | 7477 | { |
26106542 | 7478 | error ("conflicting specifiers in declaration of %qs", name); |
a23e08d9 VR |
7479 | storage_class = sc_none; |
7480 | } | |
caf93cb0 | 7481 | else if (decl_context != NORMAL |
1ff3c076 MM |
7482 | && ((storage_class != sc_none |
7483 | && storage_class != sc_mutable) | |
7484 | || thread_p)) | |
8d08fdba | 7485 | { |
db5ae43f | 7486 | if ((decl_context == PARM || decl_context == CATCHPARM) |
1ff3c076 MM |
7487 | && (storage_class == sc_register |
7488 | || storage_class == sc_auto)) | |
8d08fdba | 7489 | ; |
62d1db17 | 7490 | else if (declspecs->specs[(int)ds_typedef]) |
fc378698 | 7491 | ; |
8d08fdba | 7492 | else if (decl_context == FIELD |
f4f206f4 | 7493 | /* C++ allows static class elements. */ |
1ff3c076 | 7494 | && storage_class == sc_static) |
d363e7bf AJ |
7495 | /* C++ also allows inlines and signed and unsigned elements, |
7496 | but in those cases we don't come in here. */ | |
8d08fdba MS |
7497 | ; |
7498 | else | |
7499 | { | |
7500 | if (decl_context == FIELD) | |
389c6c8b | 7501 | error ("storage class specified for %qs", name); |
8d08fdba | 7502 | else |
b9d12519 KG |
7503 | { |
7504 | if (decl_context == PARM || decl_context == CATCHPARM) | |
2d01edd7 | 7505 | error ("storage class specified for parameter %qs", name); |
b9d12519 KG |
7506 | else |
7507 | error ("storage class specified for typename"); | |
7508 | } | |
1ff3c076 MM |
7509 | if (storage_class == sc_register |
7510 | || storage_class == sc_auto | |
7511 | || storage_class == sc_extern | |
7512 | || thread_p) | |
7513 | storage_class = sc_none; | |
8d08fdba MS |
7514 | } |
7515 | } | |
caf93cb0 | 7516 | else if (storage_class == sc_extern && initialized |
62d1db17 | 7517 | && !funcdef_flag) |
8d08fdba | 7518 | { |
a9aedbc2 | 7519 | if (toplevel_bindings_p ()) |
8d08fdba | 7520 | { |
59be0cdd | 7521 | /* It's common practice (and completely valid) to have a const |
8d08fdba | 7522 | be initialized and declared extern. */ |
950ad3c3 | 7523 | if (!(type_quals & TYPE_QUAL_CONST)) |
d4ee4d25 | 7524 | warning (0, "%qs initialized and declared %<extern%>", name); |
8d08fdba MS |
7525 | } |
7526 | else | |
2d01edd7 | 7527 | error ("%qs has both %<extern%> and initializer", name); |
8d08fdba | 7528 | } |
1ff3c076 | 7529 | else if (storage_class == sc_extern && funcdef_flag |
a9aedbc2 | 7530 | && ! toplevel_bindings_p ()) |
2d01edd7 | 7531 | error ("nested function %qs declared %<extern%>", name); |
a9aedbc2 | 7532 | else if (toplevel_bindings_p ()) |
8d08fdba | 7533 | { |
1ff3c076 | 7534 | if (storage_class == sc_auto) |
2d01edd7 | 7535 | error ("top-level declaration of %qs specifies %<auto%>", name); |
8d08fdba | 7536 | } |
1ff3c076 MM |
7537 | else if (thread_p |
7538 | && storage_class != sc_extern | |
7539 | && storage_class != sc_static) | |
7a1f3f5f | 7540 | { |
2d01edd7 | 7541 | error ("function-scope %qs implicitly auto and declared %<__thread%>", |
7a1f3f5f | 7542 | name); |
1ff3c076 | 7543 | thread_p = false; |
7a1f3f5f | 7544 | } |
8d08fdba | 7545 | |
1ff3c076 | 7546 | if (storage_class && friendp) |
8251199e | 7547 | error ("storage class specifiers invalid in friend function declarations"); |
909e536a | 7548 | |
058b15c1 MM |
7549 | if (!id_declarator) |
7550 | unqualified_id = NULL_TREE; | |
7551 | else | |
8d08fdba | 7552 | { |
1d786913 | 7553 | unqualified_id = id_declarator->u.id.unqualified_name; |
058b15c1 | 7554 | switch (TREE_CODE (unqualified_id)) |
8d08fdba | 7555 | { |
058b15c1 | 7556 | case BIT_NOT_EXPR: |
caf93cb0 | 7557 | unqualified_id |
058b15c1 MM |
7558 | = constructor_name (TREE_OPERAND (unqualified_id, 0)); |
7559 | break; | |
caf93cb0 | 7560 | |
058b15c1 MM |
7561 | case IDENTIFIER_NODE: |
7562 | case TEMPLATE_ID_EXPR: | |
52fbc847 | 7563 | break; |
caf93cb0 | 7564 | |
058b15c1 | 7565 | default: |
8dc2b103 | 7566 | gcc_unreachable (); |
058b15c1 MM |
7567 | } |
7568 | } | |
52fbc847 | 7569 | |
058b15c1 MM |
7570 | /* Determine the type of the entity declared by recurring on the |
7571 | declarator. */ | |
f4f18103 | 7572 | for (; declarator; declarator = declarator->declarator) |
058b15c1 MM |
7573 | { |
7574 | const cp_declarator *inner_declarator; | |
7575 | tree attrs; | |
8d08fdba | 7576 | |
058b15c1 MM |
7577 | if (type == error_mark_node) |
7578 | return error_mark_node; | |
c1b177ec | 7579 | |
058b15c1 MM |
7580 | attrs = declarator->attributes; |
7581 | if (attrs) | |
7582 | { | |
7583 | int attr_flags; | |
caf93cb0 | 7584 | |
058b15c1 MM |
7585 | attr_flags = 0; |
7586 | if (declarator == NULL || declarator->kind == cdk_id) | |
7587 | attr_flags |= (int) ATTR_FLAG_DECL_NEXT; | |
7588 | if (declarator->kind == cdk_function) | |
7589 | attr_flags |= (int) ATTR_FLAG_FUNCTION_NEXT; | |
7590 | if (declarator->kind == cdk_array) | |
7591 | attr_flags |= (int) ATTR_FLAG_ARRAY_NEXT; | |
7592 | returned_attrs = decl_attributes (&type, | |
7593 | chainon (returned_attrs, attrs), | |
7594 | attr_flags); | |
7595 | } | |
7596 | ||
f4f18103 MM |
7597 | if (declarator->kind == cdk_id) |
7598 | break; | |
7599 | ||
7600 | inner_declarator = declarator->declarator; | |
7601 | ||
058b15c1 MM |
7602 | switch (declarator->kind) |
7603 | { | |
7604 | case cdk_array: | |
caf93cb0 | 7605 | type = create_array_type_for_decl (dname, type, |
058b15c1 | 7606 | declarator->u.array.bounds); |
8d08fdba MS |
7607 | break; |
7608 | ||
058b15c1 | 7609 | case cdk_function: |
8d08fdba MS |
7610 | { |
7611 | tree arg_types; | |
f376e137 | 7612 | int funcdecl_p; |
8d08fdba MS |
7613 | |
7614 | /* Declaring a function type. | |
7615 | Make sure we have a valid type for the function to return. */ | |
8d08fdba | 7616 | |
1891dec4 DM |
7617 | if (type_quals != TYPE_UNQUALIFIED) |
7618 | { | |
7619 | if (SCALAR_TYPE_P (type) || VOID_TYPE_P (type)) | |
7620 | warning (OPT_Wreturn_type, | |
7621 | "type qualifiers ignored on function return type"); | |
7622 | /* We now know that the TYPE_QUALS don't apply to the | |
7623 | decl, but to its return type. */ | |
7624 | type_quals = TYPE_UNQUALIFIED; | |
7625 | set_no_warning = true; | |
7626 | } | |
8d08fdba MS |
7627 | |
7628 | /* Warn about some types functions can't return. */ | |
7629 | ||
7630 | if (TREE_CODE (type) == FUNCTION_TYPE) | |
7631 | { | |
2d01edd7 | 7632 | error ("%qs declared as function returning a function", name); |
8d08fdba MS |
7633 | type = integer_type_node; |
7634 | } | |
7635 | if (TREE_CODE (type) == ARRAY_TYPE) | |
7636 | { | |
2d01edd7 | 7637 | error ("%qs declared as function returning an array", name); |
8d08fdba MS |
7638 | type = integer_type_node; |
7639 | } | |
7640 | ||
b7484fbe | 7641 | /* Pick up type qualifiers which should be applied to `this'. */ |
e2537f2c | 7642 | memfn_quals = declarator->u.function.qualifiers; |
b7484fbe | 7643 | |
c11b6f21 | 7644 | /* Pick up the exception specifications. */ |
058b15c1 | 7645 | raises = declarator->u.function.exception_specification; |
c11b6f21 | 7646 | |
f376e137 MS |
7647 | /* Say it's a definition only for the CALL_EXPR |
7648 | closest to the identifier. */ | |
058b15c1 | 7649 | funcdecl_p = inner_declarator && inner_declarator->kind == cdk_id; |
68642fb6 | 7650 | |
8d08fdba MS |
7651 | if (ctype == NULL_TREE |
7652 | && decl_context == FIELD | |
f376e137 | 7653 | && funcdecl_p |
8d08fdba MS |
7654 | && (friendp == 0 || dname == current_class_name)) |
7655 | ctype = current_class_type; | |
7656 | ||
058b15c1 MM |
7657 | if (ctype && (sfk == sfk_constructor |
7658 | || sfk == sfk_destructor)) | |
8d08fdba MS |
7659 | { |
7660 | /* We are within a class's scope. If our declarator name | |
7661 | is the same as the class name, and we are defining | |
7662 | a function, then it is a constructor/destructor, and | |
7663 | therefore returns a void type. */ | |
3db45ab5 | 7664 | |
e2537f2c MM |
7665 | /* ISO C++ 12.4/2. A destructor may not be declared |
7666 | const or volatile. A destructor may not be | |
7667 | static. | |
3db45ab5 | 7668 | |
e2537f2c MM |
7669 | ISO C++ 12.1. A constructor may not be declared |
7670 | const or volatile. A constructor may not be | |
7671 | virtual. A constructor may not be static. */ | |
3db45ab5 | 7672 | if (staticp == 2) |
e2537f2c MM |
7673 | error ((flags == DTOR_FLAG) |
7674 | ? "destructor cannot be static member function" | |
7675 | : "constructor cannot be static member function"); | |
7676 | if (memfn_quals) | |
8d08fdba | 7677 | { |
e2537f2c MM |
7678 | error ((flags == DTOR_FLAG) |
7679 | ? "destructors may not be cv-qualified" | |
7680 | : "constructors may not be cv-qualified"); | |
7681 | memfn_quals = TYPE_UNQUALIFIED; | |
8d08fdba | 7682 | } |
e2537f2c MM |
7683 | |
7684 | if (decl_context == FIELD | |
7685 | && !member_function_or_else (ctype, | |
7686 | current_class_type, | |
7687 | flags)) | |
13dbe691 | 7688 | return error_mark_node; |
e2537f2c MM |
7689 | |
7690 | if (flags != DTOR_FLAG) | |
8d08fdba | 7691 | { |
e2537f2c | 7692 | /* It's a constructor. */ |
db5ae43f MS |
7693 | if (explicitp == 1) |
7694 | explicitp = 2; | |
8d08fdba MS |
7695 | if (virtualp) |
7696 | { | |
8251199e | 7697 | pedwarn ("constructors cannot be declared virtual"); |
8d08fdba MS |
7698 | virtualp = 0; |
7699 | } | |
7137605e MM |
7700 | if (decl_context == FIELD |
7701 | && sfk != sfk_constructor) | |
13dbe691 | 7702 | return error_mark_node; |
8d08fdba MS |
7703 | } |
7704 | if (decl_context == FIELD) | |
7705 | staticp = 0; | |
7706 | } | |
b7484fbe | 7707 | else if (friendp) |
8d08fdba | 7708 | { |
b7484fbe | 7709 | if (initialized) |
2d01edd7 | 7710 | error ("can't initialize friend function %qs", name); |
b7484fbe MS |
7711 | if (virtualp) |
7712 | { | |
7713 | /* Cannot be both friend and virtual. */ | |
8251199e | 7714 | error ("virtual functions cannot be friends"); |
b7484fbe MS |
7715 | friendp = 0; |
7716 | } | |
28cbf42c | 7717 | if (decl_context == NORMAL) |
8251199e | 7718 | error ("friend declaration not in class definition"); |
28cbf42c | 7719 | if (current_function_decl && funcdef_flag) |
2d01edd7 | 7720 | error ("can't define friend function %qs in a local " |
0cbd7506 MS |
7721 | "class definition", |
7722 | name); | |
8d08fdba MS |
7723 | } |
7724 | ||
caf93cb0 | 7725 | arg_types = grokparms (declarator->u.function.parameters, |
058b15c1 | 7726 | &parms); |
8d08fdba | 7727 | |
058b15c1 MM |
7728 | if (inner_declarator |
7729 | && inner_declarator->kind == cdk_id | |
7730 | && inner_declarator->u.id.sfk == sfk_destructor | |
7731 | && arg_types != void_list_node) | |
8d08fdba | 7732 | { |
058b15c1 MM |
7733 | error ("destructors may not have parameters"); |
7734 | arg_types = void_list_node; | |
7735 | parms = NULL_TREE; | |
8d08fdba | 7736 | } |
caf93cb0 | 7737 | |
d22c8596 | 7738 | type = build_function_type (type, arg_types); |
8d08fdba MS |
7739 | } |
7740 | break; | |
7741 | ||
058b15c1 MM |
7742 | case cdk_pointer: |
7743 | case cdk_reference: | |
7744 | case cdk_ptrmem: | |
8d08fdba MS |
7745 | /* Filter out pointers-to-references and references-to-references. |
7746 | We can get these if a TYPE_DECL is used. */ | |
7747 | ||
7748 | if (TREE_CODE (type) == REFERENCE_TYPE) | |
7749 | { | |
058b15c1 | 7750 | error (declarator->kind == cdk_reference |
2d01edd7 GDR |
7751 | ? "cannot declare reference to %q#T" |
7752 | : "cannot declare pointer to %q#T", type); | |
a5894242 MS |
7753 | type = TREE_TYPE (type); |
7754 | } | |
058b15c1 MM |
7755 | else if (VOID_TYPE_P (type)) |
7756 | { | |
7757 | if (declarator->kind == cdk_reference) | |
2d01edd7 | 7758 | error ("cannot declare reference to %q#T", type); |
058b15c1 | 7759 | else if (declarator->kind == cdk_ptrmem) |
2d01edd7 | 7760 | error ("cannot declare pointer to %q#T member", type); |
058b15c1 | 7761 | } |
61a127b3 | 7762 | |
91063b51 MM |
7763 | /* We now know that the TYPE_QUALS don't apply to the decl, |
7764 | but to the target of the pointer. */ | |
7765 | type_quals = TYPE_UNQUALIFIED; | |
8d08fdba | 7766 | |
058b15c1 | 7767 | if (declarator->kind == cdk_ptrmem |
e2537f2c | 7768 | && (TREE_CODE (type) == FUNCTION_TYPE || memfn_quals)) |
058b15c1 | 7769 | { |
e2537f2c | 7770 | memfn_quals |= cp_type_quals (type); |
3db45ab5 | 7771 | type = build_memfn_type (type, |
e2537f2c MM |
7772 | declarator->u.pointer.class_type, |
7773 | memfn_quals); | |
7774 | memfn_quals = TYPE_UNQUALIFIED; | |
058b15c1 MM |
7775 | } |
7776 | ||
7777 | if (declarator->kind == cdk_reference) | |
8d08fdba | 7778 | { |
dd29188b | 7779 | if (!VOID_TYPE_P (type)) |
69851283 | 7780 | type = build_reference_type (type); |
8d08fdba MS |
7781 | } |
7782 | else if (TREE_CODE (type) == METHOD_TYPE) | |
d8f8dca1 | 7783 | type = build_ptrmemfunc_type (build_pointer_type (type)); |
058b15c1 | 7784 | else if (declarator->kind == cdk_ptrmem) |
f4ed7d21 | 7785 | { |
63c9a190 MM |
7786 | gcc_assert (TREE_CODE (declarator->u.pointer.class_type) |
7787 | != NAMESPACE_DECL); | |
7788 | if (declarator->u.pointer.class_type == error_mark_node) | |
4230cec2 NS |
7789 | /* We will already have complained. */ |
7790 | type = error_mark_node; | |
f4ed7d21 NS |
7791 | else |
7792 | type = build_ptrmem_type (declarator->u.pointer.class_type, | |
7793 | type); | |
7794 | } | |
8d08fdba MS |
7795 | else |
7796 | type = build_pointer_type (type); | |
7797 | ||
7798 | /* Process a list of type modifier keywords (such as | |
7799 | const or volatile) that were given inside the `*' or `&'. */ | |
7800 | ||
058b15c1 | 7801 | if (declarator->u.pointer.qualifiers) |
8d08fdba | 7802 | { |
caf93cb0 EC |
7803 | type |
7804 | = cp_build_qualified_type (type, | |
3c01e5df | 7805 | declarator->u.pointer.qualifiers); |
4f2b0fb2 | 7806 | type_quals = cp_type_quals (type); |
8d08fdba | 7807 | } |
8d08fdba MS |
7808 | ctype = NULL_TREE; |
7809 | break; | |
7810 | ||
058b15c1 MM |
7811 | case cdk_error: |
7812 | break; | |
8d08fdba | 7813 | |
058b15c1 | 7814 | default: |
8dc2b103 | 7815 | gcc_unreachable (); |
058b15c1 MM |
7816 | } |
7817 | } | |
caf93cb0 | 7818 | |
058b15c1 MM |
7819 | if (unqualified_id && TREE_CODE (unqualified_id) == TEMPLATE_ID_EXPR |
7820 | && TREE_CODE (type) != FUNCTION_TYPE | |
7821 | && TREE_CODE (type) != METHOD_TYPE) | |
7822 | { | |
2d01edd7 | 7823 | error ("template-id %qD used as a declarator", |
058b15c1 MM |
7824 | unqualified_id); |
7825 | unqualified_id = dname; | |
7826 | } | |
386b8a85 | 7827 | |
9c12301f MM |
7828 | /* If TYPE is a FUNCTION_TYPE, but the function name was explicitly |
7829 | qualified with a class-name, turn it into a METHOD_TYPE, unless | |
7830 | we know that the function is static. We take advantage of this | |
7831 | opportunity to do other processing that pertains to entities | |
7832 | explicitly declared to be class members. Note that if DECLARATOR | |
7833 | is non-NULL, we know it is a cdk_id declarator; otherwise, we | |
7834 | would not have exited the loop above. */ | |
caf93cb0 | 7835 | if (declarator |
1d786913 MM |
7836 | && declarator->u.id.qualifying_scope |
7837 | && TYPE_P (declarator->u.id.qualifying_scope)) | |
058b15c1 MM |
7838 | { |
7839 | tree t; | |
8d08fdba | 7840 | |
1d786913 MM |
7841 | ctype = declarator->u.id.qualifying_scope; |
7842 | ctype = TYPE_MAIN_VARIANT (ctype); | |
058b15c1 MM |
7843 | t = ctype; |
7844 | while (t != NULL_TREE && CLASS_TYPE_P (t)) | |
7845 | { | |
7846 | /* You're supposed to have one `template <...>' for every | |
7847 | template class, but you don't need one for a full | |
7848 | specialization. For example: | |
8d08fdba | 7849 | |
058b15c1 MM |
7850 | template <class T> struct S{}; |
7851 | template <> struct S<int> { void f(); }; | |
7852 | void S<int>::f () {} | |
28cbf42c | 7853 | |
058b15c1 MM |
7854 | is correct; there shouldn't be a `template <>' for the |
7855 | definition of `S<int>::f'. */ | |
f0d60e22 MM |
7856 | if (CLASSTYPE_TEMPLATE_SPECIALIZATION (t) |
7857 | && !any_dependent_template_arguments_p (CLASSTYPE_TI_ARGS (t))) | |
7858 | /* T is an explicit (not partial) specialization. All | |
7859 | containing classes must therefore also be explicitly | |
7860 | specialized. */ | |
7861 | break; | |
7862 | if ((CLASSTYPE_USE_TEMPLATE (t) || CLASSTYPE_IS_TEMPLATE (t)) | |
058b15c1 MM |
7863 | && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (t))) |
7864 | template_count += 1; | |
28cbf42c | 7865 | |
058b15c1 MM |
7866 | t = TYPE_MAIN_DECL (t); |
7867 | t = DECL_CONTEXT (t); | |
7868 | } | |
8d08fdba | 7869 | |
058b15c1 | 7870 | if (ctype == current_class_type) |
59e7c84c VR |
7871 | { |
7872 | if (friendp) | |
7873 | pedwarn ("member functions are implicitly friends of their class"); | |
7874 | else | |
7875 | pedwarn ("extra qualification %<%T::%> on member %qs", | |
7876 | ctype, name); | |
7877 | } | |
fa6098f8 MM |
7878 | else if (/* If the qualifying type is already complete, then we |
7879 | can skip the following checks. */ | |
7880 | !COMPLETE_TYPE_P (ctype) | |
cc328145 MM |
7881 | && (/* If the function is being defined, then |
7882 | qualifying type must certainly be complete. */ | |
3db45ab5 | 7883 | funcdef_flag |
cc328145 MM |
7884 | /* A friend declaration of "T::f" is OK, even if |
7885 | "T" is a template parameter. But, if this | |
7886 | function is not a friend, the qualifying type | |
7887 | must be a class. */ | |
7888 | || (!friendp && !CLASS_TYPE_P (ctype)) | |
7889 | /* For a declaration, the type need not be | |
7890 | complete, if either it is dependent (since there | |
7891 | is no meaningful definition of complete in that | |
7892 | case) or the qualifying class is currently being | |
7893 | defined. */ | |
fa6098f8 MM |
7894 | || !(dependent_type_p (ctype) |
7895 | || currently_open_class (ctype))) | |
9f9a713e | 7896 | /* Check that the qualifying type is complete. */ |
fa6098f8 MM |
7897 | && !complete_type_or_else (ctype, NULL_TREE)) |
7898 | return error_mark_node; | |
058b15c1 MM |
7899 | else if (TREE_CODE (type) == FUNCTION_TYPE) |
7900 | { | |
1d786913 | 7901 | tree sname = declarator->u.id.unqualified_name; |
50ad9642 | 7902 | |
357d956e MM |
7903 | if (current_class_type |
7904 | && (!friendp || funcdef_flag)) | |
7905 | { | |
7906 | error (funcdef_flag | |
7907 | ? "cannot define member function %<%T::%s%> within %<%T%>" | |
7908 | : "cannot declare member function %<%T::%s%> within %<%T%>", | |
7909 | ctype, name, current_class_type); | |
7910 | return error_mark_node; | |
7911 | } | |
7912 | ||
058b15c1 MM |
7913 | if (TREE_CODE (sname) == IDENTIFIER_NODE |
7914 | && NEW_DELETE_OPNAME_P (sname)) | |
7915 | /* Overloaded operator new and operator delete | |
7916 | are always static functions. */ | |
7917 | ; | |
058b15c1 | 7918 | else |
e2537f2c | 7919 | type = build_memfn_type (type, ctype, memfn_quals); |
058b15c1 | 7920 | } |
62d1db17 | 7921 | else if (declspecs->specs[(int)ds_typedef] |
fa6098f8 | 7922 | && current_class_type) |
058b15c1 | 7923 | { |
fa6098f8 MM |
7924 | error ("cannot declare member %<%T::%s%> within %qT", |
7925 | ctype, name, current_class_type); | |
058b15c1 | 7926 | return error_mark_node; |
8d08fdba MS |
7927 | } |
7928 | } | |
7929 | ||
9c12301f MM |
7930 | /* Now TYPE has the actual type. */ |
7931 | ||
91d231cb | 7932 | if (returned_attrs) |
1eab9b56 | 7933 | { |
91d231cb JM |
7934 | if (attrlist) |
7935 | *attrlist = chainon (returned_attrs, *attrlist); | |
1eab9b56 | 7936 | else |
91d231cb | 7937 | attrlist = &returned_attrs; |
1eab9b56 JM |
7938 | } |
7939 | ||
55b3d665 JM |
7940 | /* Did array size calculations overflow? */ |
7941 | ||
7942 | if (TREE_CODE (type) == ARRAY_TYPE | |
7943 | && COMPLETE_TYPE_P (type) | |
96ce2ac9 JW |
7944 | && TREE_CODE (TYPE_SIZE_UNIT (type)) == INTEGER_CST |
7945 | && TREE_OVERFLOW (TYPE_SIZE_UNIT (type))) | |
55b3d665 | 7946 | { |
2d01edd7 | 7947 | error ("size of array %qs is too large", name); |
aba649ba | 7948 | /* If we proceed with the array type as it is, we'll eventually |
55b3d665 JM |
7949 | crash in tree_low_cst(). */ |
7950 | type = error_mark_node; | |
7951 | } | |
7952 | ||
2fff6d71 | 7953 | if ((decl_context == FIELD || decl_context == PARM) |
caf93cb0 | 7954 | && !processing_template_decl |
5377d5ba | 7955 | && variably_modified_type_p (type, NULL_TREE)) |
dac45b5c | 7956 | { |
2fff6d71 | 7957 | if (decl_context == FIELD) |
2d01edd7 | 7958 | error ("data member may not have variably modified type %qT", type); |
2fff6d71 | 7959 | else |
2d01edd7 | 7960 | error ("parameter may not have variably modified type %qT", type); |
dac45b5c MM |
7961 | type = error_mark_node; |
7962 | } | |
7963 | ||
34fc957d | 7964 | if (explicitp == 1 || (explicitp && friendp)) |
db5ae43f | 7965 | { |
34fc957d | 7966 | /* [dcl.fct.spec] The explicit specifier shall only be used in |
0cbd7506 | 7967 | declarations of constructors within a class definition. */ |
2d01edd7 | 7968 | error ("only declarations of constructors can be %<explicit%>"); |
db5ae43f MS |
7969 | explicitp = 0; |
7970 | } | |
7971 | ||
1ff3c076 | 7972 | if (storage_class == sc_mutable) |
f30432d7 | 7973 | { |
4223f82f | 7974 | if (decl_context != FIELD || friendp) |
0cbd7506 | 7975 | { |
2d01edd7 | 7976 | error ("non-member %qs cannot be declared %<mutable%>", name); |
1ff3c076 | 7977 | storage_class = sc_none; |
0cbd7506 | 7978 | } |
62d1db17 | 7979 | else if (decl_context == TYPENAME || declspecs->specs[(int)ds_typedef]) |
f30432d7 | 7980 | { |
2d01edd7 | 7981 | error ("non-object member %qs cannot be declared %<mutable%>", name); |
1ff3c076 | 7982 | storage_class = sc_none; |
f30432d7 | 7983 | } |
34fc957d | 7984 | else if (TREE_CODE (type) == FUNCTION_TYPE |
0cbd7506 MS |
7985 | || TREE_CODE (type) == METHOD_TYPE) |
7986 | { | |
2d01edd7 | 7987 | error ("function %qs cannot be declared %<mutable%>", name); |
1ff3c076 | 7988 | storage_class = sc_none; |
0cbd7506 | 7989 | } |
f30432d7 MS |
7990 | else if (staticp) |
7991 | { | |
2d01edd7 | 7992 | error ("static %qs cannot be declared %<mutable%>", name); |
1ff3c076 | 7993 | storage_class = sc_none; |
f30432d7 | 7994 | } |
34fc957d NS |
7995 | else if (type_quals & TYPE_QUAL_CONST) |
7996 | { | |
2d01edd7 | 7997 | error ("const %qs cannot be declared %<mutable%>", name); |
1ff3c076 | 7998 | storage_class = sc_none; |
34fc957d | 7999 | } |
f30432d7 MS |
8000 | } |
8001 | ||
419c6212 | 8002 | /* If this is declaring a typedef name, return a TYPE_DECL. */ |
62d1db17 | 8003 | if (declspecs->specs[(int)ds_typedef] && decl_context != TYPENAME) |
8d08fdba MS |
8004 | { |
8005 | tree decl; | |
8006 | ||
8007 | /* Note that the grammar rejects storage classes | |
8008 | in typenames, fields or parameters. */ | |
eff71ab0 PB |
8009 | if (current_lang_name == lang_name_java) |
8010 | TYPE_FOR_JAVA (type) = 1; | |
3db45ab5 | 8011 | |
e2537f2c MM |
8012 | /* This declaration: |
8013 | ||
3db45ab5 | 8014 | typedef void f(int) const; |
e2537f2c | 8015 | |
3db45ab5 | 8016 | declares a function type which is not a member of any |
e2537f2c | 8017 | particular class, but which is cv-qualified; for |
3db45ab5 | 8018 | example "f S::*" declares a pointer to a const-qualified |
e2537f2c MM |
8019 | member function of S. We record the cv-qualification in the |
8020 | function type. */ | |
8021 | if (memfn_quals && TREE_CODE (type) == FUNCTION_TYPE) | |
8022 | type = cp_build_qualified_type (type, memfn_quals); | |
8d08fdba | 8023 | |
d2e5ee5c | 8024 | if (decl_context == FIELD) |
e3016344 | 8025 | decl = build_lang_decl (TYPE_DECL, unqualified_id, type); |
d2e5ee5c | 8026 | else |
e3016344 MM |
8027 | decl = build_decl (TYPE_DECL, unqualified_id, type); |
8028 | if (id_declarator && declarator->u.id.qualifying_scope) | |
8029 | error ("%Jtypedef name may not be a nested-name-specifier", decl); | |
8030 | ||
8031 | if (decl_context != FIELD) | |
6bda7a5e | 8032 | { |
6bda7a5e NS |
8033 | if (!current_function_decl) |
8034 | DECL_CONTEXT (decl) = FROB_CONTEXT (current_namespace); | |
1dc82a99 | 8035 | else if (DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (current_function_decl) |
c8094d83 | 8036 | || (DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P |
1dc82a99 MM |
8037 | (current_function_decl))) |
8038 | /* The TYPE_DECL is "abstract" because there will be | |
8039 | clones of this constructor/destructor, and there will | |
8040 | be copies of this TYPE_DECL generated in those | |
8041 | clones. */ | |
8042 | DECL_ABSTRACT (decl) = 1; | |
6bda7a5e | 8043 | } |
e3016344 MM |
8044 | else if (constructor_name_p (unqualified_id, current_class_type)) |
8045 | pedwarn ("ISO C++ forbids nested type %qD with same name " | |
8046 | "as enclosing class", | |
8047 | unqualified_id); | |
caf93cb0 | 8048 | |
9188c363 MM |
8049 | /* If the user declares "typedef struct {...} foo" then the |
8050 | struct will have an anonymous name. Fill that name in now. | |
8051 | Nothing can refer to it, so nothing needs know about the name | |
8052 | change. */ | |
8d08fdba | 8053 | if (type != error_mark_node |
058b15c1 | 8054 | && unqualified_id |
8d08fdba MS |
8055 | && TYPE_NAME (type) |
8056 | && TREE_CODE (TYPE_NAME (type)) == TYPE_DECL | |
1951a1b6 | 8057 | && TYPE_ANONYMOUS_P (type) |
ac905924 JM |
8058 | /* Don't do this if there are attributes. */ |
8059 | && (!attrlist || !*attrlist) | |
89d684bb | 8060 | && cp_type_quals (type) == TYPE_UNQUALIFIED) |
8d08fdba | 8061 | { |
dcd08efc JM |
8062 | tree oldname = TYPE_NAME (type); |
8063 | tree t; | |
8064 | ||
2c73f9f5 | 8065 | /* Replace the anonymous name with the real name everywhere. */ |
dcd08efc JM |
8066 | for (t = TYPE_MAIN_VARIANT (type); t; t = TYPE_NEXT_VARIANT (t)) |
8067 | if (TYPE_NAME (t) == oldname) | |
8068 | TYPE_NAME (t) = decl; | |
8d08fdba MS |
8069 | |
8070 | if (TYPE_LANG_SPECIFIC (type)) | |
8071 | TYPE_WAS_ANONYMOUS (type) = 1; | |
8072 | ||
33964bf4 MM |
8073 | /* If this is a typedef within a template class, the nested |
8074 | type is a (non-primary) template. The name for the | |
8075 | template needs updating as well. */ | |
8076 | if (TYPE_LANG_SPECIFIC (type) && CLASSTYPE_TEMPLATE_INFO (type)) | |
68642fb6 | 8077 | DECL_NAME (CLASSTYPE_TI_TEMPLATE (type)) |
33964bf4 MM |
8078 | = TYPE_IDENTIFIER (type); |
8079 | ||
50a6dbd7 JM |
8080 | /* FIXME remangle member functions; member functions of a |
8081 | type with external linkage have external linkage. */ | |
fc378698 | 8082 | } |
fc378698 | 8083 | |
e2537f2c MM |
8084 | /* Any qualifiers on a function type typedef have already been |
8085 | dealt with. */ | |
8086 | if (memfn_quals && !ctype && TREE_CODE (type) == FUNCTION_TYPE) | |
8087 | memfn_quals = TYPE_UNQUALIFIED; | |
8d08fdba | 8088 | |
1ff3c076 | 8089 | if (signed_p |
8d08fdba MS |
8090 | || (typedef_decl && C_TYPEDEF_EXPLICITLY_SIGNED (typedef_decl))) |
8091 | C_TYPEDEF_EXPLICITLY_SIGNED (decl) = 1; | |
8092 | ||
3db45ab5 | 8093 | bad_specifiers (decl, "type", virtualp, |
e2537f2c | 8094 | memfn_quals != TYPE_UNQUALIFIED, |
c91a56d2 MS |
8095 | inlinep, friendp, raises != NULL_TREE); |
8096 | ||
8d08fdba MS |
8097 | return decl; |
8098 | } | |
8099 | ||
8100 | /* Detect the case of an array type of unspecified size | |
8101 | which came, as such, direct from a typedef name. | |
8d6e459d NS |
8102 | We must copy the type, so that the array's domain can be |
8103 | individually set by the object's initializer. */ | |
8d08fdba | 8104 | |
8d6e459d NS |
8105 | if (type && typedef_type |
8106 | && TREE_CODE (type) == ARRAY_TYPE && !TYPE_DOMAIN (type) | |
55b3d665 | 8107 | && TYPE_MAIN_VARIANT (type) == TYPE_MAIN_VARIANT (typedef_type)) |
8d6e459d | 8108 | type = build_cplus_array_type (TREE_TYPE (type), NULL_TREE); |
8d08fdba | 8109 | |
969fd501 | 8110 | /* Detect where we're using a typedef of function type to declare a |
4546865e | 8111 | function. PARMS will not be set, so we must create it now. */ |
caf93cb0 | 8112 | |
969fd501 NS |
8113 | if (type == typedef_type && TREE_CODE (type) == FUNCTION_TYPE) |
8114 | { | |
8115 | tree decls = NULL_TREE; | |
8116 | tree args; | |
8117 | ||
8118 | for (args = TYPE_ARG_TYPES (type); args; args = TREE_CHAIN (args)) | |
8119 | { | |
8e51619a | 8120 | tree decl = cp_build_parm_decl (NULL_TREE, TREE_VALUE (args)); |
969fd501 NS |
8121 | |
8122 | TREE_CHAIN (decl) = decls; | |
8123 | decls = decl; | |
8124 | } | |
caf93cb0 | 8125 | |
4546865e | 8126 | parms = nreverse (decls); |
9804209d DG |
8127 | |
8128 | if (decl_context != TYPENAME) | |
0cbd7506 MS |
8129 | { |
8130 | /* A cv-qualifier-seq shall only be part of the function type | |
8131 | for a non-static member function. [8.3.5/4 dcl.fct] */ | |
8132 | if (cp_type_quals (type) != TYPE_UNQUALIFIED | |
8133 | && (current_class_type == NULL_TREE || staticp) ) | |
8134 | { | |
ebbc3ce1 | 8135 | error (staticp |
f88d05c0 DM |
8136 | ? G_("qualified function types cannot be used to " |
8137 | "declare static member functions") | |
8138 | : G_("qualified function types cannot be used to " | |
8139 | "declare free functions")); | |
0cbd7506 MS |
8140 | type = TYPE_MAIN_VARIANT (type); |
8141 | } | |
8142 | ||
8143 | /* The qualifiers on the function type become the qualifiers on | |
8144 | the non-static member function. */ | |
e2537f2c | 8145 | memfn_quals |= cp_type_quals (type); |
0cbd7506 | 8146 | } |
969fd501 NS |
8147 | } |
8148 | ||
8d08fdba MS |
8149 | /* If this is a type name (such as, in a cast or sizeof), |
8150 | compute the type and return it now. */ | |
8151 | ||
8152 | if (decl_context == TYPENAME) | |
8153 | { | |
8154 | /* Note that the grammar rejects storage classes | |
8155 | in typenames, fields or parameters. */ | |
91063b51 | 8156 | if (type_quals != TYPE_UNQUALIFIED) |
6eabb241 | 8157 | type_quals = TYPE_UNQUALIFIED; |
8d08fdba MS |
8158 | |
8159 | /* Special case: "friend class foo" looks like a TYPENAME context. */ | |
8160 | if (friendp) | |
8161 | { | |
91063b51 | 8162 | if (type_quals != TYPE_UNQUALIFIED) |
b7484fbe | 8163 | { |
33bd39a2 | 8164 | error ("type qualifiers specified for friend class declaration"); |
91063b51 | 8165 | type_quals = TYPE_UNQUALIFIED; |
b7484fbe MS |
8166 | } |
8167 | if (inlinep) | |
8168 | { | |
2d01edd7 | 8169 | error ("%<inline%> specified for friend class declaration"); |
b7484fbe MS |
8170 | inlinep = 0; |
8171 | } | |
f2ae0c45 | 8172 | |
218e0eb6 | 8173 | if (!current_aggr) |
4b054b80 | 8174 | { |
218e0eb6 | 8175 | /* Don't allow friend declaration without a class-key. */ |
4b054b80 | 8176 | if (TREE_CODE (type) == TEMPLATE_TYPE_PARM) |
218e0eb6 | 8177 | pedwarn ("template parameters cannot be friends"); |
f2ae0c45 | 8178 | else if (TREE_CODE (type) == TYPENAME_TYPE) |
0cbd7506 | 8179 | pedwarn ("friend declaration requires class-key, " |
2d01edd7 | 8180 | "i.e. %<friend class %T::%D%>", |
218e0eb6 | 8181 | TYPE_CONTEXT (type), TYPENAME_TYPE_FULLNAME (type)); |
4b054b80 | 8182 | else |
0cbd7506 | 8183 | pedwarn ("friend declaration requires class-key, " |
2d01edd7 | 8184 | "i.e. %<friend %#T%>", |
218e0eb6 | 8185 | type); |
4b054b80 | 8186 | } |
b7484fbe MS |
8187 | |
8188 | /* Only try to do this stuff if we didn't already give up. */ | |
8189 | if (type != integer_type_node) | |
8190 | { | |
8191 | /* A friendly class? */ | |
8192 | if (current_class_type) | |
19db77ce KL |
8193 | make_friend_class (current_class_type, TYPE_MAIN_VARIANT (type), |
8194 | /*complain=*/true); | |
b7484fbe | 8195 | else |
2d01edd7 | 8196 | error ("trying to make class %qT a friend of global scope", |
0cbd7506 | 8197 | type); |
d363e7bf | 8198 | |
b7484fbe MS |
8199 | type = void_type_node; |
8200 | } | |
8d08fdba | 8201 | } |
e2537f2c | 8202 | else if (memfn_quals) |
8d08fdba | 8203 | { |
8d08fdba MS |
8204 | if (ctype == NULL_TREE) |
8205 | { | |
41cbc04c | 8206 | if (TREE_CODE (type) != METHOD_TYPE) |
0cbd7506 | 8207 | error ("invalid qualifiers on non-member function type"); |
41cbc04c | 8208 | else |
0cbd7506 | 8209 | ctype = TYPE_METHOD_BASETYPE (type); |
41cbc04c NS |
8210 | } |
8211 | if (ctype) | |
e2537f2c | 8212 | type = build_memfn_type (type, ctype, memfn_quals); |
8d08fdba MS |
8213 | } |
8214 | ||
8215 | return type; | |
8216 | } | |
058b15c1 | 8217 | else if (unqualified_id == NULL_TREE && decl_context != PARM |
db5ae43f | 8218 | && decl_context != CATCHPARM |
8d08fdba MS |
8219 | && TREE_CODE (type) != UNION_TYPE |
8220 | && ! bitfield) | |
8221 | { | |
2d01edd7 | 8222 | error ("abstract declarator %qT used as declaration", type); |
22ab714d | 8223 | return error_mark_node; |
8d08fdba MS |
8224 | } |
8225 | ||
62e19030 MM |
8226 | /* Only functions may be declared using an operator-function-id. */ |
8227 | if (unqualified_id | |
8228 | && IDENTIFIER_OPNAME_P (unqualified_id) | |
8229 | && TREE_CODE (type) != FUNCTION_TYPE | |
8230 | && TREE_CODE (type) != METHOD_TYPE) | |
8d08fdba | 8231 | { |
62e19030 MM |
8232 | error ("declaration of %qD as non-function", unqualified_id); |
8233 | return error_mark_node; | |
8d08fdba MS |
8234 | } |
8235 | ||
62e19030 MM |
8236 | /* We don't check parameter types here because we can emit a better |
8237 | error message later. */ | |
8238 | if (decl_context != PARM) | |
650fcd07 LM |
8239 | { |
8240 | type = check_var_type (unqualified_id, type); | |
8241 | if (type == error_mark_node) | |
8242 | return error_mark_node; | |
8243 | } | |
62e19030 | 8244 | |
8d08fdba MS |
8245 | /* Now create the decl, which may be a VAR_DECL, a PARM_DECL |
8246 | or a FUNCTION_DECL, depending on DECL_CONTEXT and TYPE. */ | |
8247 | ||
14ae7e7d JM |
8248 | if (decl_context == PARM || decl_context == CATCHPARM) |
8249 | { | |
8250 | if (ctype || in_namespace) | |
2d01edd7 | 8251 | error ("cannot use %<::%> in parameter declaration"); |
14ae7e7d JM |
8252 | |
8253 | /* A parameter declared as an array of T is really a pointer to T. | |
8254 | One declared as a function is really a pointer to a function. | |
8255 | One declared as a member is really a pointer to member. */ | |
8256 | ||
8257 | if (TREE_CODE (type) == ARRAY_TYPE) | |
8258 | { | |
8259 | /* Transfer const-ness of array into that of type pointed to. */ | |
8260 | type = build_pointer_type (TREE_TYPE (type)); | |
91063b51 | 8261 | type_quals = TYPE_UNQUALIFIED; |
14ae7e7d JM |
8262 | } |
8263 | else if (TREE_CODE (type) == FUNCTION_TYPE) | |
8264 | type = build_pointer_type (type); | |
14ae7e7d | 8265 | } |
68642fb6 | 8266 | |
8d08fdba | 8267 | { |
926ce8bd | 8268 | tree decl; |
8d08fdba MS |
8269 | |
8270 | if (decl_context == PARM) | |
8271 | { | |
058b15c1 | 8272 | decl = cp_build_parm_decl (unqualified_id, type); |
8d08fdba | 8273 | |
3db45ab5 | 8274 | bad_specifiers (decl, "parameter", virtualp, |
e2537f2c | 8275 | memfn_quals != TYPE_UNQUALIFIED, |
8d08fdba | 8276 | inlinep, friendp, raises != NULL_TREE); |
8d08fdba MS |
8277 | } |
8278 | else if (decl_context == FIELD) | |
8279 | { | |
01bf0f3e JM |
8280 | /* The C99 flexible array extension. */ |
8281 | if (!staticp && TREE_CODE (type) == ARRAY_TYPE | |
8282 | && TYPE_DOMAIN (type) == NULL_TREE) | |
8283 | { | |
8284 | tree itype = compute_array_index_type (dname, integer_zero_node); | |
8285 | type = build_cplus_array_type (TREE_TYPE (type), itype); | |
8286 | } | |
8287 | ||
8d08fdba MS |
8288 | if (type == error_mark_node) |
8289 | { | |
8290 | /* Happens when declaring arrays of sizes which | |
8291 | are error_mark_node, for example. */ | |
8292 | decl = NULL_TREE; | |
8293 | } | |
997a088c | 8294 | else if (in_namespace && !friendp) |
05008fb9 MM |
8295 | { |
8296 | /* Something like struct S { int N::j; }; */ | |
2d01edd7 | 8297 | error ("invalid use of %<::%>"); |
9a171ca4 | 8298 | return error_mark_node; |
05008fb9 | 8299 | } |
8d08fdba MS |
8300 | else if (TREE_CODE (type) == FUNCTION_TYPE) |
8301 | { | |
8302 | int publicp = 0; | |
e1467ff2 | 8303 | tree function_context; |
8d08fdba MS |
8304 | |
8305 | if (friendp == 0) | |
8306 | { | |
8307 | if (ctype == NULL_TREE) | |
8308 | ctype = current_class_type; | |
8309 | ||
8310 | if (ctype == NULL_TREE) | |
8311 | { | |
2d01edd7 | 8312 | error ("can't make %qD into a method -- not in a class", |
058b15c1 | 8313 | unqualified_id); |
13dbe691 | 8314 | return error_mark_node; |
8d08fdba MS |
8315 | } |
8316 | ||
8317 | /* ``A union may [ ... ] not [ have ] virtual functions.'' | |
8318 | ARM 9.5 */ | |
8319 | if (virtualp && TREE_CODE (ctype) == UNION_TYPE) | |
8320 | { | |
2d01edd7 | 8321 | error ("function %qD declared virtual inside a union", |
058b15c1 | 8322 | unqualified_id); |
13dbe691 | 8323 | return error_mark_node; |
8d08fdba MS |
8324 | } |
8325 | ||
058b15c1 | 8326 | if (NEW_DELETE_OPNAME_P (unqualified_id)) |
8d08fdba MS |
8327 | { |
8328 | if (virtualp) | |
8329 | { | |
2d01edd7 | 8330 | error ("%qD cannot be declared virtual, since it " |
0cbd7506 | 8331 | "is always static", |
058b15c1 | 8332 | unqualified_id); |
8d08fdba MS |
8333 | virtualp = 0; |
8334 | } | |
8335 | } | |
8336 | else if (staticp < 2) | |
e2537f2c | 8337 | type = build_memfn_type (type, ctype, memfn_quals); |
8d08fdba MS |
8338 | } |
8339 | ||
88e95ee3 | 8340 | /* Check that the name used for a destructor makes sense. */ |
6d2989e1 | 8341 | if (sfk == sfk_destructor) |
88e95ee3 | 8342 | { |
6d2989e1 VR |
8343 | if (!ctype) |
8344 | { | |
8345 | gcc_assert (friendp); | |
8346 | error ("expected qualified name in friend declaration " | |
8347 | "for destructor %qD", | |
8348 | id_declarator->u.id.unqualified_name); | |
8349 | return error_mark_node; | |
8350 | } | |
8351 | ||
8352 | if (!same_type_p (TREE_OPERAND | |
8353 | (id_declarator->u.id.unqualified_name, 0), | |
8354 | ctype)) | |
8355 | { | |
8356 | error ("declaration of %qD as member of %qT", | |
8357 | id_declarator->u.id.unqualified_name, ctype); | |
8358 | return error_mark_node; | |
8359 | } | |
88e95ee3 MM |
8360 | } |
8361 | ||
8d08fdba | 8362 | /* Tell grokfndecl if it needs to set TREE_PUBLIC on the node. */ |
68642fb6 | 8363 | function_context = (ctype != NULL_TREE) ? |
4f1c5b7d | 8364 | decl_function_context (TYPE_MAIN_DECL (ctype)) : NULL_TREE; |
e1467ff2 MM |
8365 | publicp = (! friendp || ! staticp) |
8366 | && function_context == NULL_TREE; | |
68642fb6 | 8367 | decl = grokfndecl (ctype, type, |
058b15c1 MM |
8368 | TREE_CODE (unqualified_id) != TEMPLATE_ID_EXPR |
8369 | ? unqualified_id : dname, | |
4546865e | 8370 | parms, |
058b15c1 | 8371 | unqualified_id, |
e2537f2c | 8372 | virtualp, flags, memfn_quals, raises, |
386b8a85 | 8373 | friendp ? -1 : 0, friendp, publicp, inlinep, |
27d6592c | 8374 | sfk, |
037cc9c5 | 8375 | funcdef_flag, template_count, in_namespace, attrlist); |
20496fa2 | 8376 | if (decl == NULL_TREE) |
ba5719d9 | 8377 | return error_mark_node; |
6125f3be DE |
8378 | #if 0 |
8379 | /* This clobbers the attrs stored in `decl' from `attrlist'. */ | |
91d231cb JM |
8380 | /* The decl and setting of decl_attr is also turned off. */ |
8381 | decl = build_decl_attribute_variant (decl, decl_attr); | |
6125f3be | 8382 | #endif |
f0e01782 | 8383 | |
cc804e51 MM |
8384 | /* [class.conv.ctor] |
8385 | ||
8386 | A constructor declared without the function-specifier | |
8387 | explicit that can be called with a single parameter | |
8388 | specifies a conversion from the type of its first | |
8389 | parameter to the type of its class. Such a constructor | |
8390 | is called a converting constructor. */ | |
db5ae43f MS |
8391 | if (explicitp == 2) |
8392 | DECL_NONCONVERTING_P (decl) = 1; | |
cc804e51 MM |
8393 | else if (DECL_CONSTRUCTOR_P (decl)) |
8394 | { | |
8395 | /* The constructor can be called with exactly one | |
8396 | parameter if there is at least one parameter, and | |
8397 | any subsequent parameters have default arguments. | |
e0fff4b3 JM |
8398 | Ignore any compiler-added parms. */ |
8399 | tree arg_types = FUNCTION_FIRST_USER_PARMTYPE (decl); | |
cc804e51 MM |
8400 | |
8401 | if (arg_types == void_list_node | |
68642fb6 UD |
8402 | || (arg_types |
8403 | && TREE_CHAIN (arg_types) | |
cc804e51 MM |
8404 | && TREE_CHAIN (arg_types) != void_list_node |
8405 | && !TREE_PURPOSE (TREE_CHAIN (arg_types)))) | |
8406 | DECL_NONCONVERTING_P (decl) = 1; | |
8407 | } | |
8d08fdba MS |
8408 | } |
8409 | else if (TREE_CODE (type) == METHOD_TYPE) | |
8410 | { | |
faae18ab MS |
8411 | /* We only get here for friend declarations of |
8412 | members of other classes. */ | |
8d08fdba MS |
8413 | /* All method decls are public, so tell grokfndecl to set |
8414 | TREE_PUBLIC, also. */ | |
866eb556 | 8415 | decl = grokfndecl (ctype, type, |
058b15c1 MM |
8416 | TREE_CODE (unqualified_id) != TEMPLATE_ID_EXPR |
8417 | ? unqualified_id : dname, | |
4546865e | 8418 | parms, |
058b15c1 | 8419 | unqualified_id, |
e2537f2c | 8420 | virtualp, flags, memfn_quals, raises, |
27d6592c | 8421 | friendp ? -1 : 0, friendp, 1, 0, sfk, |
c8094d83 MS |
8422 | funcdef_flag, template_count, in_namespace, |
8423 | attrlist); | |
f0e01782 | 8424 | if (decl == NULL_TREE) |
13dbe691 | 8425 | return error_mark_node; |
8d08fdba | 8426 | } |
a9f46cbb | 8427 | else if (!staticp && !dependent_type_p (type) |
d0f062fb | 8428 | && !COMPLETE_TYPE_P (complete_type (type)) |
8d08fdba MS |
8429 | && (TREE_CODE (type) != ARRAY_TYPE || initialized == 0)) |
8430 | { | |
058b15c1 | 8431 | if (unqualified_id) |
2d01edd7 | 8432 | error ("field %qD has incomplete type", unqualified_id); |
b7484fbe | 8433 | else |
2d01edd7 | 8434 | error ("name %qT has incomplete type", type); |
8d08fdba MS |
8435 | |
8436 | /* If we're instantiating a template, tell them which | |
8437 | instantiation made the field's type be incomplete. */ | |
8438 | if (current_class_type | |
8439 | && TYPE_NAME (current_class_type) | |
d2e5ee5c | 8440 | && IDENTIFIER_TEMPLATE (TYPE_IDENTIFIER (current_class_type)) |
62d1db17 MM |
8441 | && declspecs->type |
8442 | && declspecs->type == type) | |
2d01edd7 | 8443 | error (" in instantiation of template %qT", |
0cbd7506 | 8444 | current_class_type); |
db5ae43f | 8445 | |
623c65f1 | 8446 | return error_mark_node; |
8d08fdba MS |
8447 | } |
8448 | else | |
8449 | { | |
8450 | if (friendp) | |
8451 | { | |
2d01edd7 | 8452 | error ("%qE is neither function nor member function; " |
0cbd7506 | 8453 | "cannot be declared friend", unqualified_id); |
8d08fdba MS |
8454 | friendp = 0; |
8455 | } | |
8456 | decl = NULL_TREE; | |
8457 | } | |
8458 | ||
8459 | if (friendp) | |
8460 | { | |
8461 | /* Friends are treated specially. */ | |
8462 | if (ctype == current_class_type) | |
59e7c84c | 8463 | ; /* We already issued a pedwarn. */ |
0cbd7506 | 8464 | else if (decl && DECL_NAME (decl)) |
8db1028e NS |
8465 | { |
8466 | if (template_class_depth (current_class_type) == 0) | |
8467 | { | |
8468 | decl = check_explicit_specialization | |
058b15c1 | 8469 | (unqualified_id, decl, template_count, |
357d956e | 8470 | 2 * funcdef_flag + 4); |
8db1028e NS |
8471 | if (decl == error_mark_node) |
8472 | return error_mark_node; | |
8473 | } | |
caf93cb0 | 8474 | |
058b15c1 | 8475 | decl = do_friend (ctype, unqualified_id, decl, |
3db45ab5 | 8476 | *attrlist, flags, |
e2537f2c | 8477 | funcdef_flag); |
8db1028e NS |
8478 | return decl; |
8479 | } | |
8480 | else | |
13dbe691 | 8481 | return error_mark_node; |
8d08fdba MS |
8482 | } |
8483 | ||
f4f206f4 | 8484 | /* Structure field. It may not be a function, except for C++. */ |
8d08fdba MS |
8485 | |
8486 | if (decl == NULL_TREE) | |
8487 | { | |
8d08fdba MS |
8488 | if (initialized) |
8489 | { | |
3ac3d9ea MM |
8490 | if (!staticp) |
8491 | { | |
8492 | /* An attempt is being made to initialize a non-static | |
8493 | member. But, from [class.mem]: | |
68642fb6 | 8494 | |
3ac3d9ea MM |
8495 | 4 A member-declarator can contain a |
8496 | constant-initializer only if it declares a static | |
8497 | member (_class.static_) of integral or enumeration | |
68642fb6 | 8498 | type, see _class.static.data_. |
3ac3d9ea MM |
8499 | |
8500 | This used to be relatively common practice, but | |
8501 | the rest of the compiler does not correctly | |
8502 | handle the initialization unless the member is | |
8503 | static so we make it static below. */ | |
2d01edd7 | 8504 | pedwarn ("ISO C++ forbids initialization of member %qD", |
058b15c1 | 8505 | unqualified_id); |
2d01edd7 | 8506 | pedwarn ("making %qD static", unqualified_id); |
3ac3d9ea MM |
8507 | staticp = 1; |
8508 | } | |
8509 | ||
6ba89f8e MM |
8510 | if (uses_template_parms (type)) |
8511 | /* We'll check at instantiation time. */ | |
8512 | ; | |
058b15c1 | 8513 | else if (check_static_variable_definition (unqualified_id, |
6ba89f8e MM |
8514 | type)) |
8515 | /* If we just return the declaration, crashes | |
8516 | will sometimes occur. We therefore return | |
72a93143 JM |
8517 | void_type_node, as if this was a friend |
8518 | declaration, to cause callers to completely | |
8519 | ignore this declaration. */ | |
13dbe691 | 8520 | return error_mark_node; |
8d08fdba MS |
8521 | } |
8522 | ||
3ac3d9ea | 8523 | if (staticp) |
8d08fdba | 8524 | { |
f18a14bc MM |
8525 | /* C++ allows static class members. All other work |
8526 | for this is done by grokfield. */ | |
058b15c1 | 8527 | decl = build_lang_decl (VAR_DECL, unqualified_id, type); |
4684cd27 MM |
8528 | set_linkage_for_static_data_member (decl); |
8529 | /* Even if there is an in-class initialization, DECL | |
8530 | is considered undefined until an out-of-class | |
8531 | definition is provided. */ | |
8532 | DECL_EXTERNAL (decl) = 1; | |
31a79236 JJ |
8533 | |
8534 | if (thread_p) | |
8893239d | 8535 | DECL_TLS_MODEL (decl) = decl_default_tls_model (decl); |
8d08fdba MS |
8536 | } |
8537 | else | |
8538 | { | |
058b15c1 | 8539 | decl = build_decl (FIELD_DECL, unqualified_id, type); |
2bf105ab | 8540 | DECL_NONADDRESSABLE_P (decl) = bitfield; |
1ff3c076 | 8541 | if (storage_class == sc_mutable) |
8d08fdba MS |
8542 | { |
8543 | DECL_MUTABLE_P (decl) = 1; | |
1ff3c076 | 8544 | storage_class = sc_none; |
8d08fdba MS |
8545 | } |
8546 | } | |
8547 | ||
3db45ab5 | 8548 | bad_specifiers (decl, "field", virtualp, |
e2537f2c | 8549 | memfn_quals != TYPE_UNQUALIFIED, |
8d08fdba MS |
8550 | inlinep, friendp, raises != NULL_TREE); |
8551 | } | |
8552 | } | |
fd9aef9d NS |
8553 | else if (TREE_CODE (type) == FUNCTION_TYPE |
8554 | || TREE_CODE (type) == METHOD_TYPE) | |
8d08fdba | 8555 | { |
386b8a85 | 8556 | tree original_name; |
8d08fdba MS |
8557 | int publicp = 0; |
8558 | ||
058b15c1 | 8559 | if (!unqualified_id) |
13dbe691 | 8560 | return error_mark_node; |
8d08fdba | 8561 | |
058b15c1 | 8562 | if (TREE_CODE (unqualified_id) == TEMPLATE_ID_EXPR) |
386b8a85 JM |
8563 | original_name = dname; |
8564 | else | |
058b15c1 | 8565 | original_name = unqualified_id; |
386b8a85 | 8566 | |
1ff3c076 | 8567 | if (storage_class == sc_auto) |
2d01edd7 | 8568 | error ("storage class %<auto%> invalid for function %qs", name); |
1ff3c076 | 8569 | else if (storage_class == sc_register) |
2d01edd7 | 8570 | error ("storage class %<register%> invalid for function %qs", name); |
1ff3c076 | 8571 | else if (thread_p) |
2d01edd7 | 8572 | error ("storage class %<__thread%> invalid for function %qs", name); |
8d08fdba MS |
8573 | |
8574 | /* Function declaration not at top level. | |
8575 | Storage classes other than `extern' are not allowed | |
8576 | and `extern' makes no difference. */ | |
a9aedbc2 | 8577 | if (! toplevel_bindings_p () |
1ff3c076 | 8578 | && (storage_class == sc_static |
62d1db17 | 8579 | || declspecs->specs[(int)ds_inline]) |
8d08fdba | 8580 | && pedantic) |
8926095f | 8581 | { |
1ff3c076 | 8582 | if (storage_class == sc_static) |
2d01edd7 | 8583 | pedwarn ("%<static%> specified invalid for function %qs " |
0cbd7506 | 8584 | "declared out of global scope", name); |
8926095f | 8585 | else |
2d01edd7 | 8586 | pedwarn ("%<inline%> specifier invalid for function %qs " |
0cbd7506 | 8587 | "declared out of global scope", name); |
8926095f | 8588 | } |
68642fb6 | 8589 | |
8d08fdba MS |
8590 | if (ctype == NULL_TREE) |
8591 | { | |
8592 | if (virtualp) | |
8593 | { | |
2d01edd7 | 8594 | error ("virtual non-class function %qs", name); |
8d08fdba MS |
8595 | virtualp = 0; |
8596 | } | |
8d08fdba | 8597 | } |
4546865e MM |
8598 | else if (TREE_CODE (type) == FUNCTION_TYPE && staticp < 2 |
8599 | && !NEW_DELETE_OPNAME_P (original_name)) | |
caf93cb0 | 8600 | type = build_method_type_directly (ctype, |
43dc123f MM |
8601 | TREE_TYPE (type), |
8602 | TYPE_ARG_TYPES (type)); | |
8d08fdba | 8603 | |
eb66be0e | 8604 | /* Record presence of `static'. */ |
faae18ab | 8605 | publicp = (ctype != NULL_TREE |
1ff3c076 MM |
8606 | || storage_class == sc_extern |
8607 | || storage_class != sc_static); | |
8d08fdba | 8608 | |
058b15c1 | 8609 | decl = grokfndecl (ctype, type, original_name, parms, unqualified_id, |
e2537f2c | 8610 | virtualp, flags, memfn_quals, raises, |
75650646 | 8611 | 1, friendp, |
27d6592c | 8612 | publicp, inlinep, sfk, funcdef_flag, |
037cc9c5 | 8613 | template_count, in_namespace, attrlist); |
f0e01782 | 8614 | if (decl == NULL_TREE) |
13dbe691 | 8615 | return error_mark_node; |
8d08fdba | 8616 | |
8d08fdba MS |
8617 | if (staticp == 1) |
8618 | { | |
0e339752 | 8619 | int invalid_static = 0; |
8d08fdba MS |
8620 | |
8621 | /* Don't allow a static member function in a class, and forbid | |
8622 | declaring main to be static. */ | |
8623 | if (TREE_CODE (type) == METHOD_TYPE) | |
8624 | { | |
2d01edd7 | 8625 | pedwarn ("cannot declare member function %qD to have " |
0cbd7506 | 8626 | "static linkage", decl); |
0e339752 | 8627 | invalid_static = 1; |
8d08fdba | 8628 | } |
8d08fdba MS |
8629 | else if (current_function_decl) |
8630 | { | |
8631 | /* FIXME need arm citation */ | |
8251199e | 8632 | error ("cannot declare static function inside another function"); |
0e339752 | 8633 | invalid_static = 1; |
8d08fdba MS |
8634 | } |
8635 | ||
0e339752 | 8636 | if (invalid_static) |
8d08fdba MS |
8637 | { |
8638 | staticp = 0; | |
1ff3c076 | 8639 | storage_class = sc_none; |
8d08fdba MS |
8640 | } |
8641 | } | |
8d08fdba MS |
8642 | } |
8643 | else | |
8644 | { | |
8645 | /* It's a variable. */ | |
8646 | ||
8647 | /* An uninitialized decl with `extern' is a reference. */ | |
caf93cb0 | 8648 | decl = grokvardecl (type, unqualified_id, |
62d1db17 | 8649 | declspecs, |
68642fb6 UD |
8650 | initialized, |
8651 | (type_quals & TYPE_QUAL_CONST) != 0, | |
9e259dd1 | 8652 | ctype ? ctype : in_namespace); |
3db45ab5 | 8653 | bad_specifiers (decl, "variable", virtualp, |
e2537f2c | 8654 | memfn_quals != TYPE_UNQUALIFIED, |
8d08fdba MS |
8655 | inlinep, friendp, raises != NULL_TREE); |
8656 | ||
8657 | if (ctype) | |
8658 | { | |
f0e01782 | 8659 | DECL_CONTEXT (decl) = ctype; |
8d08fdba MS |
8660 | if (staticp == 1) |
8661 | { | |
0cbd7506 MS |
8662 | pedwarn ("%<static%> may not be used when defining " |
8663 | "(as opposed to declaring) a static data member"); | |
8664 | staticp = 0; | |
1ff3c076 | 8665 | storage_class = sc_none; |
8d08fdba | 8666 | } |
1ff3c076 | 8667 | if (storage_class == sc_register && TREE_STATIC (decl)) |
b7484fbe | 8668 | { |
2d01edd7 | 8669 | error ("static member %qD declared %<register%>", decl); |
1ff3c076 | 8670 | storage_class = sc_none; |
b7484fbe | 8671 | } |
1ff3c076 | 8672 | if (storage_class == sc_extern && pedantic) |
8d08fdba | 8673 | { |
0cbd7506 MS |
8674 | pedwarn ("cannot explicitly declare member %q#D to have " |
8675 | "extern linkage", | |
8676 | decl); | |
1ff3c076 | 8677 | storage_class = sc_none; |
8d08fdba MS |
8678 | } |
8679 | } | |
8680 | } | |
8681 | ||
8d08fdba MS |
8682 | /* Record `register' declaration for warnings on & |
8683 | and in case doing stupid register allocation. */ | |
8684 | ||
1ff3c076 | 8685 | if (storage_class == sc_register) |
8d08fdba | 8686 | DECL_REGISTER (decl) = 1; |
1ff3c076 | 8687 | else if (storage_class == sc_extern) |
8926095f | 8688 | DECL_THIS_EXTERN (decl) = 1; |
1ff3c076 | 8689 | else if (storage_class == sc_static) |
faae18ab MS |
8690 | DECL_THIS_STATIC (decl) = 1; |
8691 | ||
adecb3f4 MM |
8692 | /* Record constancy and volatility. There's no need to do this |
8693 | when processing a template; we'll do this for the instantiated | |
8694 | declaration based on the type of DECL. */ | |
8695 | if (!processing_template_decl) | |
9804209d | 8696 | cp_apply_type_quals_to_decl (type_quals, decl); |
8d08fdba | 8697 | |
1891dec4 DM |
8698 | if (set_no_warning) |
8699 | TREE_NO_WARNING (decl) = 1; | |
8700 | ||
8d08fdba MS |
8701 | return decl; |
8702 | } | |
8703 | } | |
8704 | \f | |
f181d4ae MM |
8705 | /* Subroutine of start_function. Ensure that each of the parameter |
8706 | types (as listed in PARMS) is complete, as is required for a | |
8707 | function definition. */ | |
e92cc029 | 8708 | |
8d08fdba | 8709 | static void |
11f6b451 | 8710 | require_complete_types_for_parms (tree parms) |
8d08fdba | 8711 | { |
07c88314 | 8712 | for (; parms; parms = TREE_CHAIN (parms)) |
8d08fdba | 8713 | { |
c9387915 GB |
8714 | if (dependent_type_p (TREE_TYPE (parms))) |
8715 | continue; | |
dff1b563 VR |
8716 | if (!VOID_TYPE_P (TREE_TYPE (parms)) |
8717 | && complete_type_or_else (TREE_TYPE (parms), parms)) | |
753225c1 | 8718 | { |
7523dc31 | 8719 | relayout_decl (parms); |
753225c1 JM |
8720 | DECL_ARG_TYPE (parms) = type_passed_as (TREE_TYPE (parms)); |
8721 | } | |
dff1b563 VR |
8722 | else |
8723 | /* grokparms or complete_type_or_else will have already issued | |
8724 | an error. */ | |
8725 | TREE_TYPE (parms) = error_mark_node; | |
8d08fdba MS |
8726 | } |
8727 | } | |
8728 | ||
838dfd8a | 8729 | /* Returns nonzero if T is a local variable. */ |
297e73d8 | 8730 | |
46e8c075 | 8731 | int |
11f6b451 | 8732 | local_variable_p (tree t) |
297e73d8 | 8733 | { |
68642fb6 | 8734 | if ((TREE_CODE (t) == VAR_DECL |
297e73d8 MM |
8735 | /* A VAR_DECL with a context that is a _TYPE is a static data |
8736 | member. */ | |
8737 | && !TYPE_P (CP_DECL_CONTEXT (t)) | |
8738 | /* Any other non-local variable must be at namespace scope. */ | |
46e8c075 | 8739 | && !DECL_NAMESPACE_SCOPE_P (t)) |
297e73d8 | 8740 | || (TREE_CODE (t) == PARM_DECL)) |
46e8c075 | 8741 | return 1; |
297e73d8 | 8742 | |
46e8c075 MM |
8743 | return 0; |
8744 | } | |
8745 | ||
838dfd8a | 8746 | /* Returns nonzero if T is an automatic local variable or a label. |
46e8c075 MM |
8747 | (These are the declarations that need to be remapped when the code |
8748 | containing them is duplicated.) */ | |
8749 | ||
8750 | int | |
11f6b451 | 8751 | nonstatic_local_decl_p (tree t) |
46e8c075 MM |
8752 | { |
8753 | return ((local_variable_p (t) && !TREE_STATIC (t)) | |
8754 | || TREE_CODE (t) == LABEL_DECL | |
8755 | || TREE_CODE (t) == RESULT_DECL); | |
8756 | } | |
8757 | ||
8758 | /* Like local_variable_p, but suitable for use as a tree-walking | |
8759 | function. */ | |
8760 | ||
8761 | static tree | |
44de5aeb RK |
8762 | local_variable_p_walkfn (tree *tp, int *walk_subtrees, |
8763 | void *data ATTRIBUTE_UNUSED) | |
46e8c075 | 8764 | { |
44de5aeb RK |
8765 | if (local_variable_p (*tp) && !DECL_ARTIFICIAL (*tp)) |
8766 | return *tp; | |
8767 | else if (TYPE_P (*tp)) | |
8768 | *walk_subtrees = 0; | |
8769 | ||
8770 | return NULL_TREE; | |
297e73d8 MM |
8771 | } |
8772 | ||
44de5aeb | 8773 | |
297e73d8 | 8774 | /* Check that ARG, which is a default-argument expression for a |
0e339752 | 8775 | parameter DECL, is valid. Returns ARG, or ERROR_MARK_NODE, if |
297e73d8 MM |
8776 | something goes wrong. DECL may also be a _TYPE node, rather than a |
8777 | DECL, if there is no DECL available. */ | |
8778 | ||
8779 | tree | |
11f6b451 | 8780 | check_default_argument (tree decl, tree arg) |
297e73d8 MM |
8781 | { |
8782 | tree var; | |
8783 | tree decl_type; | |
8784 | ||
8785 | if (TREE_CODE (arg) == DEFAULT_ARG) | |
8786 | /* We get a DEFAULT_ARG when looking at an in-class declaration | |
8787 | with a default argument. Ignore the argument for now; we'll | |
8788 | deal with it after the class is complete. */ | |
8789 | return arg; | |
8790 | ||
297e73d8 MM |
8791 | if (TYPE_P (decl)) |
8792 | { | |
8793 | decl_type = decl; | |
8794 | decl = NULL_TREE; | |
8795 | } | |
8796 | else | |
8797 | decl_type = TREE_TYPE (decl); | |
8798 | ||
68642fb6 | 8799 | if (arg == error_mark_node |
297e73d8 MM |
8800 | || decl == error_mark_node |
8801 | || TREE_TYPE (arg) == error_mark_node | |
8802 | || decl_type == error_mark_node) | |
8803 | /* Something already went wrong. There's no need to check | |
8804 | further. */ | |
8805 | return error_mark_node; | |
8806 | ||
8807 | /* [dcl.fct.default] | |
68642fb6 | 8808 | |
297e73d8 MM |
8809 | A default argument expression is implicitly converted to the |
8810 | parameter type. */ | |
8811 | if (!TREE_TYPE (arg) | |
30f86ec3 | 8812 | || !can_convert_arg (decl_type, TREE_TYPE (arg), arg, LOOKUP_NORMAL)) |
297e73d8 MM |
8813 | { |
8814 | if (decl) | |
2d01edd7 | 8815 | error ("default argument for %q#D has type %qT", |
0cbd7506 | 8816 | decl, TREE_TYPE (arg)); |
297e73d8 | 8817 | else |
2d01edd7 | 8818 | error ("default argument for parameter of type %qT has type %qT", |
0cbd7506 | 8819 | decl_type, TREE_TYPE (arg)); |
297e73d8 MM |
8820 | |
8821 | return error_mark_node; | |
8822 | } | |
8823 | ||
8824 | /* [dcl.fct.default] | |
8825 | ||
8826 | Local variables shall not be used in default argument | |
68642fb6 | 8827 | expressions. |
297e73d8 MM |
8828 | |
8829 | The keyword `this' shall not be used in a default argument of a | |
8830 | member function. */ | |
5362b086 | 8831 | var = walk_tree_without_duplicates (&arg, local_variable_p_walkfn, |
ee94fce6 | 8832 | NULL); |
297e73d8 MM |
8833 | if (var) |
8834 | { | |
2d01edd7 | 8835 | error ("default argument %qE uses local variable %qD", arg, var); |
297e73d8 MM |
8836 | return error_mark_node; |
8837 | } | |
8838 | ||
8839 | /* All is well. */ | |
8840 | return arg; | |
8841 | } | |
8842 | ||
8d08fdba MS |
8843 | /* Decode the list of parameter types for a function type. |
8844 | Given the list of things declared inside the parens, | |
8845 | return a list of types. | |
8846 | ||
058b15c1 MM |
8847 | If this parameter does not end with an ellipsis, we append |
8848 | void_list_node. | |
5cce22b6 | 8849 | |
4546865e | 8850 | *PARMS is set to the chain of PARM_DECLs created. */ |
8d08fdba MS |
8851 | |
8852 | static tree | |
62d1db17 | 8853 | grokparms (cp_parameter_declarator *first_parm, tree *parms) |
8d08fdba MS |
8854 | { |
8855 | tree result = NULL_TREE; | |
8856 | tree decls = NULL_TREE; | |
058b15c1 | 8857 | int ellipsis = !first_parm || first_parm->ellipsis_p; |
62d1db17 | 8858 | cp_parameter_declarator *parm; |
5cce22b6 | 8859 | int any_error = 0; |
8d08fdba | 8860 | |
058b15c1 | 8861 | for (parm = first_parm; parm != NULL; parm = parm->next) |
8d08fdba | 8862 | { |
0657c69c | 8863 | tree type = NULL_TREE; |
058b15c1 | 8864 | tree init = parm->default_argument; |
62d1db17 | 8865 | tree attrs; |
058b15c1 | 8866 | tree decl; |
8d08fdba | 8867 | |
058b15c1 | 8868 | if (parm == no_parameters) |
0cbd7506 | 8869 | break; |
8d08fdba | 8870 | |
62d1db17 MM |
8871 | attrs = parm->decl_specifiers.attributes; |
8872 | parm->decl_specifiers.attributes = NULL_TREE; | |
8873 | decl = grokdeclarator (parm->declarator, &parm->decl_specifiers, | |
98884b26 | 8874 | PARM, init != NULL_TREE, &attrs); |
5cce22b6 | 8875 | if (! decl || TREE_TYPE (decl) == error_mark_node) |
0cbd7506 | 8876 | continue; |
d363e7bf | 8877 | |
98884b26 JM |
8878 | if (attrs) |
8879 | cplus_decl_attributes (&decl, attrs, 0); | |
8880 | ||
5cce22b6 NS |
8881 | type = TREE_TYPE (decl); |
8882 | if (VOID_TYPE_P (type)) | |
0cbd7506 MS |
8883 | { |
8884 | if (same_type_p (type, void_type_node) | |
e7e53192 | 8885 | && DECL_SELF_REFERENCE_P (type) |
0cbd7506 MS |
8886 | && !DECL_NAME (decl) && !result && !parm->next && !ellipsis) |
8887 | /* this is a parmlist of `(void)', which is ok. */ | |
8888 | break; | |
8889 | cxx_incomplete_type_error (decl, type); | |
0657c69c MM |
8890 | /* It's not a good idea to actually create parameters of |
8891 | type `void'; other parts of the compiler assume that a | |
8892 | void type terminates the parameter list. */ | |
04f3dc2b | 8893 | type = error_mark_node; |
0657c69c | 8894 | TREE_TYPE (decl) = error_mark_node; |
0cbd7506 | 8895 | } |
8d08fdba | 8896 | |
d363e7bf | 8897 | if (type != error_mark_node) |
04f3dc2b MM |
8898 | { |
8899 | /* Top-level qualifiers on the parameters are | |
8900 | ignored for function types. */ | |
79a1a736 | 8901 | type = cp_build_qualified_type (type, 0); |
04f3dc2b MM |
8902 | if (TREE_CODE (type) == METHOD_TYPE) |
8903 | { | |
2d01edd7 | 8904 | error ("parameter %qD invalidly declared method type", decl); |
04f3dc2b MM |
8905 | type = build_pointer_type (type); |
8906 | TREE_TYPE (decl) = type; | |
8907 | } | |
04f3dc2b | 8908 | else if (abstract_virtuals_error (decl, type)) |
a1c65f9f | 8909 | any_error = 1; /* Seems like a good idea. */ |
04f3dc2b MM |
8910 | else if (POINTER_TYPE_P (type)) |
8911 | { | |
8912 | /* [dcl.fct]/6, parameter types cannot contain pointers | |
8913 | (references) to arrays of unknown bound. */ | |
98979fe0 NS |
8914 | tree t = TREE_TYPE (type); |
8915 | int ptr = TYPE_PTR_P (type); | |
8916 | ||
0cbd7506 MS |
8917 | while (1) |
8918 | { | |
8919 | if (TYPE_PTR_P (t)) | |
8920 | ptr = 1; | |
8921 | else if (TREE_CODE (t) != ARRAY_TYPE) | |
8922 | break; | |
8923 | else if (!TYPE_DOMAIN (t)) | |
8924 | break; | |
8925 | t = TREE_TYPE (t); | |
8926 | } | |
04f3dc2b | 8927 | if (TREE_CODE (t) == ARRAY_TYPE) |
2d01edd7 | 8928 | error ("parameter %qD includes %s to array of unknown " |
0cbd7506 MS |
8929 | "bound %qT", |
8930 | decl, ptr ? "pointer" : "reference", t); | |
04f3dc2b MM |
8931 | } |
8932 | ||
c3ee4651 | 8933 | if (any_error) |
04f3dc2b | 8934 | init = NULL_TREE; |
c3ee4651 NS |
8935 | else if (init && !processing_template_decl) |
8936 | init = check_default_argument (decl, init); | |
04f3dc2b | 8937 | } |
8d08fdba | 8938 | |
5cce22b6 NS |
8939 | TREE_CHAIN (decl) = decls; |
8940 | decls = decl; | |
0657c69c | 8941 | result = tree_cons (init, type, result); |
8d08fdba | 8942 | } |
5cce22b6 NS |
8943 | decls = nreverse (decls); |
8944 | result = nreverse (result); | |
8945 | if (!ellipsis) | |
8946 | result = chainon (result, void_list_node); | |
4546865e | 8947 | *parms = decls; |
8d08fdba | 8948 | |
8d08fdba MS |
8949 | return result; |
8950 | } | |
42976354 | 8951 | |
8d08fdba | 8952 | \f |
271e6f02 NS |
8953 | /* D is a constructor or overloaded `operator='. |
8954 | ||
8955 | Let T be the class in which D is declared. Then, this function | |
8956 | returns: | |
8957 | ||
8958 | -1 if D's is an ill-formed constructor or copy assignment operator | |
8959 | whose first parameter is of type `T'. | |
8960 | 0 if D is not a copy constructor or copy assignment | |
8961 | operator. | |
8962 | 1 if D is a copy constructor or copy assignment operator whose | |
8963 | first parameter is a reference to const qualified T. | |
8964 | 2 if D is a copy constructor or copy assignment operator whose | |
8965 | first parameter is a reference to non-const qualified T. | |
8966 | ||
8967 | This function can be used as a predicate. Positive values indicate | |
838dfd8a | 8968 | a copy constructor and nonzero values indicate a copy assignment |
4f1c5b7d MM |
8969 | operator. */ |
8970 | ||
c11b6f21 | 8971 | int |
11f6b451 | 8972 | copy_fn_p (tree d) |
c11b6f21 | 8973 | { |
271e6f02 NS |
8974 | tree args; |
8975 | tree arg_type; | |
8976 | int result = 1; | |
caf93cb0 | 8977 | |
398cd199 | 8978 | gcc_assert (DECL_FUNCTION_MEMBER_P (d)); |
4f1c5b7d | 8979 | |
7137605e MM |
8980 | if (TREE_CODE (d) == TEMPLATE_DECL |
8981 | || (DECL_TEMPLATE_INFO (d) | |
8982 | && DECL_MEMBER_TEMPLATE_P (DECL_TI_TEMPLATE (d)))) | |
271e6f02 NS |
8983 | /* Instantiations of template member functions are never copy |
8984 | functions. Note that member functions of templated classes are | |
8985 | represented as template functions internally, and we must | |
8986 | accept those as copy functions. */ | |
8987 | return 0; | |
caf93cb0 | 8988 | |
271e6f02 NS |
8989 | args = FUNCTION_FIRST_USER_PARMTYPE (d); |
8990 | if (!args) | |
4f1c5b7d MM |
8991 | return 0; |
8992 | ||
271e6f02 | 8993 | arg_type = TREE_VALUE (args); |
139a78c7 VR |
8994 | if (arg_type == error_mark_node) |
8995 | return 0; | |
271e6f02 NS |
8996 | |
8997 | if (TYPE_MAIN_VARIANT (arg_type) == DECL_CONTEXT (d)) | |
8998 | { | |
8999 | /* Pass by value copy assignment operator. */ | |
9000 | result = -1; | |
9001 | } | |
9002 | else if (TREE_CODE (arg_type) == REFERENCE_TYPE | |
9003 | && TYPE_MAIN_VARIANT (TREE_TYPE (arg_type)) == DECL_CONTEXT (d)) | |
9004 | { | |
9005 | if (CP_TYPE_CONST_P (TREE_TYPE (arg_type))) | |
9006 | result = 2; | |
9007 | } | |
9008 | else | |
9009 | return 0; | |
caf93cb0 | 9010 | |
271e6f02 NS |
9011 | args = TREE_CHAIN (args); |
9012 | ||
9013 | if (args && args != void_list_node && !TREE_PURPOSE (args)) | |
9014 | /* There are more non-optional args. */ | |
9015 | return 0; | |
9016 | ||
9017 | return result; | |
9018 | } | |
9019 | ||
9020 | /* Remember any special properties of member function DECL. */ | |
9021 | ||
11f6b451 | 9022 | void grok_special_member_properties (tree decl) |
271e6f02 | 9023 | { |
7137605e MM |
9024 | tree class_type; |
9025 | ||
6d69fe27 | 9026 | if (!DECL_NONSTATIC_MEMBER_FUNCTION_P (decl)) |
7137605e MM |
9027 | return; |
9028 | ||
9029 | class_type = DECL_CONTEXT (decl); | |
9030 | if (DECL_CONSTRUCTOR_P (decl)) | |
271e6f02 NS |
9031 | { |
9032 | int ctor = copy_fn_p (decl); | |
caf93cb0 | 9033 | |
7137605e MM |
9034 | TYPE_HAS_CONSTRUCTOR (class_type) = 1; |
9035 | ||
271e6f02 NS |
9036 | if (ctor > 0) |
9037 | { | |
9038 | /* [class.copy] | |
caf93cb0 | 9039 | |
0cbd7506 MS |
9040 | A non-template constructor for class X is a copy |
9041 | constructor if its first parameter is of type X&, const | |
9042 | X&, volatile X& or const volatile X&, and either there | |
9043 | are no other parameters or else all other parameters have | |
9044 | default arguments. */ | |
7137605e | 9045 | TYPE_HAS_INIT_REF (class_type) = 1; |
271e6f02 | 9046 | if (ctor > 1) |
7137605e | 9047 | TYPE_HAS_CONST_INIT_REF (class_type) = 1; |
271e6f02 NS |
9048 | } |
9049 | else if (sufficient_parms_p (FUNCTION_FIRST_USER_PARMTYPE (decl))) | |
7137605e | 9050 | TYPE_HAS_DEFAULT_CONSTRUCTOR (class_type) = 1; |
271e6f02 NS |
9051 | } |
9052 | else if (DECL_OVERLOADED_OPERATOR_P (decl) == NOP_EXPR) | |
9053 | { | |
9054 | /* [class.copy] | |
caf93cb0 | 9055 | |
0cbd7506 MS |
9056 | A non-template assignment operator for class X is a copy |
9057 | assignment operator if its parameter is of type X, X&, const | |
9058 | X&, volatile X& or const volatile X&. */ | |
caf93cb0 | 9059 | |
271e6f02 | 9060 | int assop = copy_fn_p (decl); |
caf93cb0 | 9061 | |
271e6f02 NS |
9062 | if (assop) |
9063 | { | |
7137605e | 9064 | TYPE_HAS_ASSIGN_REF (class_type) = 1; |
271e6f02 | 9065 | if (assop != 1) |
7137605e | 9066 | TYPE_HAS_CONST_ASSIGN_REF (class_type) = 1; |
271e6f02 NS |
9067 | } |
9068 | } | |
c11b6f21 MS |
9069 | } |
9070 | ||
271e6f02 NS |
9071 | /* Check a constructor DECL has the correct form. Complains |
9072 | if the class has a constructor of the form X(X). */ | |
e92cc029 | 9073 | |
a0a33927 | 9074 | int |
11f6b451 | 9075 | grok_ctor_properties (tree ctype, tree decl) |
8d08fdba | 9076 | { |
271e6f02 NS |
9077 | int ctor_parm = copy_fn_p (decl); |
9078 | ||
9079 | if (ctor_parm < 0) | |
9080 | { | |
9081 | /* [class.copy] | |
caf93cb0 | 9082 | |
0cbd7506 MS |
9083 | A declaration of a constructor for a class X is ill-formed if |
9084 | its first parameter is of type (optionally cv-qualified) X | |
9085 | and either there are no other parameters or else all other | |
9086 | parameters have default arguments. | |
9087 | ||
9088 | We *don't* complain about member template instantiations that | |
9089 | have this form, though; they can occur as we try to decide | |
9090 | what constructor to use during overload resolution. Since | |
9091 | overload resolution will never prefer such a constructor to | |
9092 | the non-template copy constructor (which is either explicitly | |
9093 | or implicitly defined), there's no need to worry about their | |
9094 | existence. Theoretically, they should never even be | |
9095 | instantiated, but that's hard to forestall. */ | |
2d01edd7 | 9096 | error ("invalid constructor; you probably meant %<%T (const %T&)%>", |
0b41abe6 | 9097 | ctype, ctype); |
0b41abe6 | 9098 | return 0; |
8d08fdba | 9099 | } |
caf93cb0 | 9100 | |
a0a33927 | 9101 | return 1; |
8d08fdba MS |
9102 | } |
9103 | ||
596ea4e5 | 9104 | /* An operator with this code is unary, but can also be binary. */ |
e92cc029 | 9105 | |
a28e3c7f | 9106 | static int |
11f6b451 | 9107 | ambi_op_p (enum tree_code code) |
8d08fdba | 9108 | { |
596ea4e5 AS |
9109 | return (code == INDIRECT_REF |
9110 | || code == ADDR_EXPR | |
392e3d51 | 9111 | || code == UNARY_PLUS_EXPR |
596ea4e5 AS |
9112 | || code == NEGATE_EXPR |
9113 | || code == PREINCREMENT_EXPR | |
9114 | || code == PREDECREMENT_EXPR); | |
8d08fdba MS |
9115 | } |
9116 | ||
9117 | /* An operator with this name can only be unary. */ | |
e92cc029 | 9118 | |
a28e3c7f | 9119 | static int |
11f6b451 | 9120 | unary_op_p (enum tree_code code) |
8d08fdba | 9121 | { |
596ea4e5 AS |
9122 | return (code == TRUTH_NOT_EXPR |
9123 | || code == BIT_NOT_EXPR | |
9124 | || code == COMPONENT_REF | |
9125 | || code == TYPE_EXPR); | |
8d08fdba MS |
9126 | } |
9127 | ||
f2a79152 | 9128 | /* DECL is a declaration for an overloaded operator. If COMPLAIN is true, |
4b0d3cbe | 9129 | errors are issued for invalid declarations. */ |
e92cc029 | 9130 | |
398cd199 | 9131 | bool |
7e45bd18 | 9132 | grok_op_properties (tree decl, bool complain) |
8d08fdba MS |
9133 | { |
9134 | tree argtypes = TYPE_ARG_TYPES (TREE_TYPE (decl)); | |
596ea4e5 | 9135 | tree argtype; |
8d08fdba MS |
9136 | int methodp = (TREE_CODE (TREE_TYPE (decl)) == METHOD_TYPE); |
9137 | tree name = DECL_NAME (decl); | |
596ea4e5 AS |
9138 | enum tree_code operator_code; |
9139 | int arity; | |
64844139 | 9140 | bool ellipsis_p; |
7e45bd18 | 9141 | tree class_type; |
596ea4e5 | 9142 | |
64844139 | 9143 | /* Count the number of arguments and check for ellipsis. */ |
596ea4e5 AS |
9144 | for (argtype = argtypes, arity = 0; |
9145 | argtype && argtype != void_list_node; | |
9146 | argtype = TREE_CHAIN (argtype)) | |
9147 | ++arity; | |
64844139 | 9148 | ellipsis_p = !argtype; |
8d08fdba | 9149 | |
7e45bd18 MM |
9150 | class_type = DECL_CONTEXT (decl); |
9151 | if (class_type && !CLASS_TYPE_P (class_type)) | |
9152 | class_type = NULL_TREE; | |
8d08fdba | 9153 | |
596ea4e5 AS |
9154 | if (DECL_CONV_FN_P (decl)) |
9155 | operator_code = TYPE_EXPR; | |
9156 | else | |
9157 | do | |
9158 | { | |
0c918ce5 MM |
9159 | #define DEF_OPERATOR(NAME, CODE, MANGLING, ARITY, ASSN_P) \ |
9160 | if (ansi_opname (CODE) == name) \ | |
9161 | { \ | |
75ac8dec | 9162 | operator_code = (CODE); \ |
0c918ce5 MM |
9163 | break; \ |
9164 | } \ | |
9165 | else if (ansi_assopname (CODE) == name) \ | |
9166 | { \ | |
75ac8dec | 9167 | operator_code = (CODE); \ |
0c918ce5 MM |
9168 | DECL_ASSIGNMENT_OPERATOR_P (decl) = 1; \ |
9169 | break; \ | |
596ea4e5 AS |
9170 | } |
9171 | ||
9172 | #include "operators.def" | |
9173 | #undef DEF_OPERATOR | |
9174 | ||
8dc2b103 | 9175 | gcc_unreachable (); |
596ea4e5 AS |
9176 | } |
9177 | while (0); | |
50bc768d | 9178 | gcc_assert (operator_code != LAST_CPLUS_TREE_CODE); |
596ea4e5 AS |
9179 | SET_OVERLOADED_OPERATOR_CODE (decl, operator_code); |
9180 | ||
7e45bd18 MM |
9181 | if (class_type) |
9182 | switch (operator_code) | |
9183 | { | |
9184 | case NEW_EXPR: | |
9185 | TYPE_HAS_NEW_OPERATOR (class_type) = 1; | |
9186 | break; | |
5362b086 | 9187 | |
7e45bd18 MM |
9188 | case DELETE_EXPR: |
9189 | TYPE_GETS_DELETE (class_type) |= 1; | |
9190 | break; | |
5362b086 | 9191 | |
7e45bd18 MM |
9192 | case VEC_NEW_EXPR: |
9193 | TYPE_HAS_ARRAY_NEW_OPERATOR (class_type) = 1; | |
9194 | break; | |
5362b086 | 9195 | |
7e45bd18 MM |
9196 | case VEC_DELETE_EXPR: |
9197 | TYPE_GETS_DELETE (class_type) |= 2; | |
9198 | break; | |
596ea4e5 | 9199 | |
7e45bd18 MM |
9200 | default: |
9201 | break; | |
9202 | } | |
596ea4e5 | 9203 | |
3143d517 GB |
9204 | /* [basic.std.dynamic.allocation]/1: |
9205 | ||
9206 | A program is ill-formed if an allocation function is declared | |
9207 | in a namespace scope other than global scope or declared static | |
9208 | in global scope. | |
9209 | ||
9210 | The same also holds true for deallocation functions. */ | |
9211 | if (operator_code == NEW_EXPR || operator_code == VEC_NEW_EXPR | |
9212 | || operator_code == DELETE_EXPR || operator_code == VEC_DELETE_EXPR) | |
9213 | { | |
9214 | if (DECL_NAMESPACE_SCOPE_P (decl)) | |
9215 | { | |
9216 | if (CP_DECL_CONTEXT (decl) != global_namespace) | |
398cd199 VR |
9217 | { |
9218 | error ("%qD may not be declared within a namespace", decl); | |
9219 | return false; | |
9220 | } | |
3143d517 | 9221 | else if (!TREE_PUBLIC (decl)) |
398cd199 VR |
9222 | { |
9223 | error ("%qD may not be declared as static", decl); | |
9224 | return false; | |
9225 | } | |
3143d517 GB |
9226 | } |
9227 | } | |
9228 | ||
596ea4e5 | 9229 | if (operator_code == NEW_EXPR || operator_code == VEC_NEW_EXPR) |
4546865e | 9230 | TREE_TYPE (decl) = coerce_new_type (TREE_TYPE (decl)); |
596ea4e5 | 9231 | else if (operator_code == DELETE_EXPR || operator_code == VEC_DELETE_EXPR) |
4546865e | 9232 | TREE_TYPE (decl) = coerce_delete_type (TREE_TYPE (decl)); |
8d08fdba MS |
9233 | else |
9234 | { | |
9235 | /* An operator function must either be a non-static member function | |
9236 | or have at least one parameter of a class, a reference to a class, | |
9237 | an enumeration, or a reference to an enumeration. 13.4.0.6 */ | |
700f8a87 | 9238 | if (! methodp || DECL_STATIC_FUNCTION_P (decl)) |
8d08fdba | 9239 | { |
596ea4e5 AS |
9240 | if (operator_code == TYPE_EXPR |
9241 | || operator_code == CALL_EXPR | |
9242 | || operator_code == COMPONENT_REF | |
9243 | || operator_code == ARRAY_REF | |
9244 | || operator_code == NOP_EXPR) | |
f2a79152 PC |
9245 | { |
9246 | error ("%qD must be a nonstatic member function", decl); | |
398cd199 | 9247 | return false; |
f2a79152 | 9248 | } |
8d08fdba MS |
9249 | else |
9250 | { | |
4b0d3cbe | 9251 | tree p; |
8d08fdba | 9252 | |
700f8a87 | 9253 | if (DECL_STATIC_FUNCTION_P (decl)) |
f2a79152 PC |
9254 | { |
9255 | error ("%qD must be either a non-static member " | |
9256 | "function or a non-member function", decl); | |
398cd199 | 9257 | return false; |
f2a79152 | 9258 | } |
700f8a87 | 9259 | |
4b0d3cbe MM |
9260 | for (p = argtypes; p && p != void_list_node; p = TREE_CHAIN (p)) |
9261 | { | |
9262 | tree arg = non_reference (TREE_VALUE (p)); | |
85990800 | 9263 | if (arg == error_mark_node) |
398cd199 | 9264 | return false; |
85990800 | 9265 | |
4b0d3cbe MM |
9266 | /* IS_AGGR_TYPE, rather than CLASS_TYPE_P, is used |
9267 | because these checks are performed even on | |
9268 | template functions. */ | |
9269 | if (IS_AGGR_TYPE (arg) || TREE_CODE (arg) == ENUMERAL_TYPE) | |
9270 | break; | |
9271 | } | |
9272 | ||
9273 | if (!p || p == void_list_node) | |
9274 | { | |
398cd199 VR |
9275 | if (complain) |
9276 | error ("%qD must have an argument of class or " | |
9277 | "enumerated type", decl); | |
9278 | return false; | |
4b0d3cbe | 9279 | } |
8d08fdba MS |
9280 | } |
9281 | } | |
68642fb6 | 9282 | |
4b0d3cbe MM |
9283 | /* There are no restrictions on the arguments to an overloaded |
9284 | "operator ()". */ | |
596ea4e5 | 9285 | if (operator_code == CALL_EXPR) |
398cd199 | 9286 | return true; |
8d08fdba | 9287 | |
7e45bd18 | 9288 | /* Warn about conversion operators that will never be used. */ |
c8094d83 | 9289 | if (IDENTIFIER_TYPENAME_P (name) |
7e45bd18 MM |
9290 | && ! DECL_TEMPLATE_INFO (decl) |
9291 | && warn_conversion | |
9292 | /* Warn only declaring the function; there is no need to | |
9293 | warn again about out-of-class definitions. */ | |
9294 | && class_type == current_class_type) | |
a0a33927 MS |
9295 | { |
9296 | tree t = TREE_TYPE (name); | |
7e45bd18 MM |
9297 | int ref = (TREE_CODE (t) == REFERENCE_TYPE); |
9298 | const char *what = 0; | |
5362b086 | 9299 | |
7e45bd18 MM |
9300 | if (ref) |
9301 | t = TYPE_MAIN_VARIANT (TREE_TYPE (t)); | |
a0a33927 | 9302 | |
7e45bd18 MM |
9303 | if (TREE_CODE (t) == VOID_TYPE) |
9304 | what = "void"; | |
9305 | else if (class_type) | |
9306 | { | |
9307 | if (t == class_type) | |
a0a33927 | 9308 | what = "the same type"; |
9a3b49ac | 9309 | /* Don't force t to be complete here. */ |
a0a33927 | 9310 | else if (IS_AGGR_TYPE (t) |
d0f062fb | 9311 | && COMPLETE_TYPE_P (t) |
7e45bd18 | 9312 | && DERIVED_FROM_P (t, class_type)) |
a0a33927 | 9313 | what = "a base class"; |
a0a33927 | 9314 | } |
7e45bd18 MM |
9315 | |
9316 | if (what) | |
b323323f | 9317 | warning (OPT_Wconversion, "conversion to %s%s will never use a type " |
7e45bd18 MM |
9318 | "conversion operator", |
9319 | ref ? "a reference to " : "", what); | |
a0a33927 | 9320 | } |
64844139 | 9321 | |
271e6f02 | 9322 | if (operator_code == COND_EXPR) |
8d08fdba MS |
9323 | { |
9324 | /* 13.4.0.3 */ | |
33bd39a2 | 9325 | error ("ISO C++ prohibits overloading operator ?:"); |
398cd199 | 9326 | return false; |
68642fb6 | 9327 | } |
64844139 | 9328 | else if (ellipsis_p) |
398cd199 VR |
9329 | { |
9330 | error ("%qD must not have variable number of arguments", decl); | |
9331 | return false; | |
9332 | } | |
596ea4e5 | 9333 | else if (ambi_op_p (operator_code)) |
8d08fdba | 9334 | { |
596ea4e5 AS |
9335 | if (arity == 1) |
9336 | /* We pick the one-argument operator codes by default, so | |
9337 | we don't have to change anything. */ | |
9338 | ; | |
9339 | else if (arity == 2) | |
8d08fdba | 9340 | { |
596ea4e5 AS |
9341 | /* If we thought this was a unary operator, we now know |
9342 | it to be a binary operator. */ | |
9343 | switch (operator_code) | |
9344 | { | |
9345 | case INDIRECT_REF: | |
9346 | operator_code = MULT_EXPR; | |
9347 | break; | |
9348 | ||
9349 | case ADDR_EXPR: | |
9350 | operator_code = BIT_AND_EXPR; | |
9351 | break; | |
9352 | ||
392e3d51 | 9353 | case UNARY_PLUS_EXPR: |
596ea4e5 AS |
9354 | operator_code = PLUS_EXPR; |
9355 | break; | |
9356 | ||
9357 | case NEGATE_EXPR: | |
9358 | operator_code = MINUS_EXPR; | |
9359 | break; | |
9360 | ||
9361 | case PREINCREMENT_EXPR: | |
9362 | operator_code = POSTINCREMENT_EXPR; | |
9363 | break; | |
9364 | ||
9365 | case PREDECREMENT_EXPR: | |
655dc6ee | 9366 | operator_code = POSTDECREMENT_EXPR; |
596ea4e5 AS |
9367 | break; |
9368 | ||
9369 | default: | |
8dc2b103 | 9370 | gcc_unreachable (); |
596ea4e5 AS |
9371 | } |
9372 | ||
9373 | SET_OVERLOADED_OPERATOR_CODE (decl, operator_code); | |
9374 | ||
9375 | if ((operator_code == POSTINCREMENT_EXPR | |
9376 | || operator_code == POSTDECREMENT_EXPR) | |
5156628f | 9377 | && ! processing_template_decl |
007e5fea | 9378 | && ! same_type_p (TREE_VALUE (TREE_CHAIN (argtypes)), integer_type_node)) |
8d08fdba MS |
9379 | { |
9380 | if (methodp) | |
2d01edd7 | 9381 | error ("postfix %qD must take %<int%> as its argument", |
398cd199 | 9382 | decl); |
8d08fdba | 9383 | else |
398cd199 VR |
9384 | error ("postfix %qD must take %<int%> as its second " |
9385 | "argument", decl); | |
9386 | return false; | |
8d08fdba MS |
9387 | } |
9388 | } | |
9389 | else | |
9390 | { | |
9391 | if (methodp) | |
2d01edd7 | 9392 | error ("%qD must take either zero or one argument", decl); |
8d08fdba | 9393 | else |
2d01edd7 | 9394 | error ("%qD must take either one or two arguments", decl); |
398cd199 | 9395 | return false; |
8d08fdba | 9396 | } |
824b9a4c MS |
9397 | |
9398 | /* More Effective C++ rule 6. */ | |
eb448459 | 9399 | if (warn_ecpp |
596ea4e5 AS |
9400 | && (operator_code == POSTINCREMENT_EXPR |
9401 | || operator_code == POSTDECREMENT_EXPR | |
9402 | || operator_code == PREINCREMENT_EXPR | |
9403 | || operator_code == PREDECREMENT_EXPR)) | |
824b9a4c MS |
9404 | { |
9405 | tree arg = TREE_VALUE (argtypes); | |
9406 | tree ret = TREE_TYPE (TREE_TYPE (decl)); | |
9407 | if (methodp || TREE_CODE (arg) == REFERENCE_TYPE) | |
9408 | arg = TREE_TYPE (arg); | |
9409 | arg = TYPE_MAIN_VARIANT (arg); | |
596ea4e5 AS |
9410 | if (operator_code == PREINCREMENT_EXPR |
9411 | || operator_code == PREDECREMENT_EXPR) | |
824b9a4c MS |
9412 | { |
9413 | if (TREE_CODE (ret) != REFERENCE_TYPE | |
3bfdc719 MM |
9414 | || !same_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (ret)), |
9415 | arg)) | |
b323323f | 9416 | warning (OPT_Weffc__, "prefix %qD should return %qT", decl, |
0cbd7506 | 9417 | build_reference_type (arg)); |
824b9a4c MS |
9418 | } |
9419 | else | |
9420 | { | |
3bfdc719 | 9421 | if (!same_type_p (TYPE_MAIN_VARIANT (ret), arg)) |
b323323f | 9422 | warning (OPT_Weffc__, "postfix %qD should return %qT", decl, arg); |
824b9a4c MS |
9423 | } |
9424 | } | |
8d08fdba | 9425 | } |
596ea4e5 | 9426 | else if (unary_op_p (operator_code)) |
8d08fdba | 9427 | { |
596ea4e5 | 9428 | if (arity != 1) |
8d08fdba MS |
9429 | { |
9430 | if (methodp) | |
2d01edd7 | 9431 | error ("%qD must take %<void%>", decl); |
8d08fdba | 9432 | else |
2d01edd7 | 9433 | error ("%qD must take exactly one argument", decl); |
398cd199 | 9434 | return false; |
8d08fdba MS |
9435 | } |
9436 | } | |
596ea4e5 | 9437 | else /* if (binary_op_p (operator_code)) */ |
8d08fdba | 9438 | { |
596ea4e5 | 9439 | if (arity != 2) |
8d08fdba MS |
9440 | { |
9441 | if (methodp) | |
2d01edd7 | 9442 | error ("%qD must take exactly one argument", decl); |
8d08fdba | 9443 | else |
2d01edd7 | 9444 | error ("%qD must take exactly two arguments", decl); |
398cd199 | 9445 | return false; |
8d08fdba | 9446 | } |
824b9a4c MS |
9447 | |
9448 | /* More Effective C++ rule 7. */ | |
eb448459 | 9449 | if (warn_ecpp |
596ea4e5 AS |
9450 | && (operator_code == TRUTH_ANDIF_EXPR |
9451 | || operator_code == TRUTH_ORIF_EXPR | |
9452 | || operator_code == COMPOUND_EXPR)) | |
b323323f | 9453 | warning (OPT_Weffc__, "user-defined %qD always evaluates both arguments", |
0cbd7506 | 9454 | decl); |
824b9a4c MS |
9455 | } |
9456 | ||
9457 | /* Effective C++ rule 23. */ | |
eb448459 | 9458 | if (warn_ecpp |
596ea4e5 | 9459 | && arity == 2 |
4bd7c270 | 9460 | && !DECL_ASSIGNMENT_OPERATOR_P (decl) |
596ea4e5 AS |
9461 | && (operator_code == PLUS_EXPR |
9462 | || operator_code == MINUS_EXPR | |
9463 | || operator_code == TRUNC_DIV_EXPR | |
4bd7c270 NS |
9464 | || operator_code == MULT_EXPR |
9465 | || operator_code == TRUNC_MOD_EXPR) | |
824b9a4c | 9466 | && TREE_CODE (TREE_TYPE (TREE_TYPE (decl))) == REFERENCE_TYPE) |
b323323f | 9467 | warning (OPT_Weffc__, "%qD should return by value", decl); |
8d08fdba | 9468 | |
271e6f02 | 9469 | /* [over.oper]/8 */ |
34332678 | 9470 | for (; argtypes && argtypes != void_list_node; |
0cbd7506 MS |
9471 | argtypes = TREE_CHAIN (argtypes)) |
9472 | if (TREE_PURPOSE (argtypes)) | |
9473 | { | |
9474 | TREE_PURPOSE (argtypes) = NULL_TREE; | |
9475 | if (operator_code == POSTINCREMENT_EXPR | |
596ea4e5 | 9476 | || operator_code == POSTDECREMENT_EXPR) |
0cbd7506 MS |
9477 | { |
9478 | if (pedantic) | |
9479 | pedwarn ("%qD cannot have default arguments", decl); | |
9480 | } | |
9481 | else | |
398cd199 VR |
9482 | { |
9483 | error ("%qD cannot have default arguments", decl); | |
9484 | return false; | |
9485 | } | |
0cbd7506 | 9486 | } |
8d08fdba | 9487 | } |
398cd199 | 9488 | return true; |
8d08fdba MS |
9489 | } |
9490 | \f | |
0c88d886 MM |
9491 | /* Return a string giving the keyword associate with CODE. */ |
9492 | ||
d8e178a0 | 9493 | static const char * |
11f6b451 | 9494 | tag_name (enum tag_types code) |
094fe153 JM |
9495 | { |
9496 | switch (code) | |
9497 | { | |
9498 | case record_type: | |
9499 | return "struct"; | |
9500 | case class_type: | |
9501 | return "class"; | |
9502 | case union_type: | |
0c88d886 | 9503 | return "union"; |
094fe153 JM |
9504 | case enum_type: |
9505 | return "enum"; | |
0c88d886 MM |
9506 | case typename_type: |
9507 | return "typename"; | |
094fe153 | 9508 | default: |
8dc2b103 | 9509 | gcc_unreachable (); |
094fe153 JM |
9510 | } |
9511 | } | |
9512 | ||
befcd99b | 9513 | /* Name lookup in an elaborated-type-specifier (after the keyword |
4b0d3cbe | 9514 | indicated by TAG_CODE) has found the TYPE_DECL DECL. If the |
befcd99b | 9515 | elaborated-type-specifier is invalid, issue a diagnostic and return |
4b0d3cbe | 9516 | error_mark_node; otherwise, return the *_TYPE to which it referred. |
cbd63935 | 9517 | If ALLOW_TEMPLATE_P is true, TYPE may be a class template. */ |
befcd99b | 9518 | |
560ad596 | 9519 | tree |
befcd99b | 9520 | check_elaborated_type_specifier (enum tag_types tag_code, |
4b0d3cbe | 9521 | tree decl, |
cbd63935 | 9522 | bool allow_template_p) |
befcd99b | 9523 | { |
4b0d3cbe | 9524 | tree type; |
befcd99b | 9525 | |
4b0d3cbe MM |
9526 | /* In the case of: |
9527 | ||
9528 | struct S { struct S *p; }; | |
9529 | ||
9530 | name lookup will find the TYPE_DECL for the implicit "S::S" | |
9531 | typedef. Adjust for that here. */ | |
9532 | if (DECL_SELF_REFERENCE_P (decl)) | |
9533 | decl = TYPE_NAME (TREE_TYPE (decl)); | |
9534 | ||
9535 | type = TREE_TYPE (decl); | |
9536 | ||
461c6fce KL |
9537 | /* Check TEMPLATE_TYPE_PARM first because DECL_IMPLICIT_TYPEDEF_P |
9538 | is false for this case as well. */ | |
9539 | if (TREE_CODE (type) == TEMPLATE_TYPE_PARM) | |
9540 | { | |
9541 | error ("using template type parameter %qT after %qs", | |
9542 | type, tag_name (tag_code)); | |
9543 | return error_mark_node; | |
9544 | } | |
caf93cb0 | 9545 | /* [dcl.type.elab] |
4b0d3cbe MM |
9546 | |
9547 | If the identifier resolves to a typedef-name or a template | |
9548 | type-parameter, the elaborated-type-specifier is ill-formed. | |
9549 | ||
9550 | In other words, the only legitimate declaration to use in the | |
9551 | elaborated type specifier is the implicit typedef created when | |
9552 | the type is declared. */ | |
0c88d886 MM |
9553 | else if (!DECL_IMPLICIT_TYPEDEF_P (decl) |
9554 | && tag_code != typename_type) | |
befcd99b | 9555 | { |
2d01edd7 | 9556 | error ("using typedef-name %qD after %qs", decl, tag_name (tag_code)); |
dee15844 | 9557 | error ("%q+D has a previous declaration here", decl); |
4b0d3cbe | 9558 | return error_mark_node; |
befcd99b | 9559 | } |
cbd63935 KL |
9560 | else if (TREE_CODE (type) != RECORD_TYPE |
9561 | && TREE_CODE (type) != UNION_TYPE | |
0c88d886 MM |
9562 | && tag_code != enum_type |
9563 | && tag_code != typename_type) | |
cbd63935 | 9564 | { |
2d01edd7 | 9565 | error ("%qT referred to as %qs", type, tag_name (tag_code)); |
dee15844 | 9566 | error ("%q+T has a previous declaration here", type); |
4b0d3cbe | 9567 | return error_mark_node; |
cbd63935 KL |
9568 | } |
9569 | else if (TREE_CODE (type) != ENUMERAL_TYPE | |
4fe8db68 | 9570 | && tag_code == enum_type) |
cbd63935 | 9571 | { |
2d01edd7 | 9572 | error ("%qT referred to as enum", type); |
dee15844 | 9573 | error ("%q+T has a previous declaration here", type); |
4b0d3cbe | 9574 | return error_mark_node; |
cbd63935 KL |
9575 | } |
9576 | else if (!allow_template_p | |
9577 | && TREE_CODE (type) == RECORD_TYPE | |
9578 | && CLASSTYPE_IS_TEMPLATE (type)) | |
9579 | { | |
9580 | /* If a class template appears as elaborated type specifier | |
9581 | without a template header such as: | |
9582 | ||
9583 | template <class T> class C {}; | |
9584 | void f(class C); // No template header here | |
9585 | ||
9586 | then the required template argument is missing. */ | |
2d01edd7 | 9587 | error ("template argument required for %<%s %T%>", |
cbd63935 KL |
9588 | tag_name (tag_code), |
9589 | DECL_NAME (CLASSTYPE_TI_TEMPLATE (type))); | |
4b0d3cbe | 9590 | return error_mark_node; |
cbd63935 | 9591 | } |
befcd99b | 9592 | |
4b0d3cbe | 9593 | return type; |
befcd99b MM |
9594 | } |
9595 | ||
461c6fce | 9596 | /* Lookup NAME in elaborate type specifier in scope according to |
29ef83de | 9597 | SCOPE and issue diagnostics if necessary. |
461c6fce KL |
9598 | Return *_TYPE node upon success, NULL_TREE when the NAME is not |
9599 | found, and ERROR_MARK_NODE for type error. */ | |
9600 | ||
9601 | static tree | |
9602 | lookup_and_check_tag (enum tag_types tag_code, tree name, | |
29ef83de | 9603 | tag_scope scope, bool template_header_p) |
461c6fce KL |
9604 | { |
9605 | tree t; | |
9606 | tree decl; | |
29ef83de | 9607 | if (scope == ts_global) |
bd3d082e KL |
9608 | { |
9609 | /* First try ordinary name lookup, ignoring hidden class name | |
9610 | injected via friend declaration. */ | |
10e6657a | 9611 | decl = lookup_name_prefer_type (name, 2); |
bd3d082e KL |
9612 | /* If that fails, the name will be placed in the smallest |
9613 | non-class, non-function-prototype scope according to 3.3.1/5. | |
9614 | We may already have a hidden name declared as friend in this | |
105d72c5 | 9615 | scope. So lookup again but not ignoring hidden names. |
bd3d082e KL |
9616 | If we find one, that name will be made visible rather than |
9617 | creating a new tag. */ | |
9618 | if (!decl) | |
9619 | decl = lookup_type_scope (name, ts_within_enclosing_non_class); | |
9620 | } | |
461c6fce | 9621 | else |
29ef83de | 9622 | decl = lookup_type_scope (name, scope); |
461c6fce KL |
9623 | |
9624 | if (decl && DECL_CLASS_TEMPLATE_P (decl)) | |
9625 | decl = DECL_TEMPLATE_RESULT (decl); | |
9626 | ||
9627 | if (decl && TREE_CODE (decl) == TYPE_DECL) | |
9628 | { | |
4104f0f4 KL |
9629 | /* Look for invalid nested type: |
9630 | class C { | |
9631 | class C {}; | |
9632 | }; */ | |
9633 | if (scope == ts_current && DECL_SELF_REFERENCE_P (decl)) | |
9634 | { | |
9635 | error ("%qD has the same name as the class in which it is " | |
9636 | "declared", | |
9637 | decl); | |
9638 | return error_mark_node; | |
9639 | } | |
9640 | ||
461c6fce KL |
9641 | /* Two cases we need to consider when deciding if a class |
9642 | template is allowed as an elaborated type specifier: | |
9643 | 1. It is a self reference to its own class. | |
9644 | 2. It comes with a template header. | |
9645 | ||
9646 | For example: | |
9647 | ||
9648 | template <class T> class C { | |
9649 | class C *c1; // DECL_SELF_REFERENCE_P is true | |
9650 | class D; | |
9651 | }; | |
9652 | template <class U> class C; // template_header_p is true | |
9653 | template <class T> class C<T>::D { | |
9654 | class C *c2; // DECL_SELF_REFERENCE_P is true | |
9655 | }; */ | |
9656 | ||
9657 | t = check_elaborated_type_specifier (tag_code, | |
9658 | decl, | |
9659 | template_header_p | |
9660 | | DECL_SELF_REFERENCE_P (decl)); | |
9661 | return t; | |
9662 | } | |
9663 | else | |
9664 | return NULL_TREE; | |
9665 | } | |
9666 | ||
cbd63935 | 9667 | /* Get the struct, enum or union (TAG_CODE says which) with tag NAME. |
8d08fdba MS |
9668 | Define the tag as a forward-reference if it is not defined. |
9669 | ||
cbd63935 | 9670 | If a declaration is given, process it here, and report an error if |
38b305d0 | 9671 | multiple declarations are not identical. |
8d08fdba | 9672 | |
29ef83de | 9673 | SCOPE is TS_CURRENT when this is also a definition. Only look in |
8d08fdba | 9674 | the current frame for the name (since C++ allows new names in any |
29ef83de KL |
9675 | scope.) It is TS_WITHIN_ENCLOSING_NON_CLASS if this is a friend |
9676 | declaration. Only look beginning from the current scope outward up | |
9677 | till the nearest non-class scope. Otherwise it is TS_GLOBAL. | |
cbd63935 KL |
9678 | |
9679 | TEMPLATE_HEADER_P is true when this declaration is preceded by | |
9680 | a set of template parameters. */ | |
8d08fdba | 9681 | |
8d08fdba | 9682 | tree |
38b305d0 | 9683 | xref_tag (enum tag_types tag_code, tree name, |
29ef83de | 9684 | tag_scope scope, bool template_header_p) |
8d08fdba | 9685 | { |
8d08fdba | 9686 | enum tree_code code; |
926ce8bd | 9687 | tree t; |
25aab5d0 | 9688 | tree context = NULL_TREE; |
dc8263bc | 9689 | |
22ffcc6f | 9690 | timevar_push (TV_NAME_LOOKUP); |
cbd63935 | 9691 | |
50bc768d | 9692 | gcc_assert (TREE_CODE (name) == IDENTIFIER_NODE); |
cbd63935 | 9693 | |
8d08fdba MS |
9694 | switch (tag_code) |
9695 | { | |
9696 | case record_type: | |
9697 | case class_type: | |
8d08fdba | 9698 | code = RECORD_TYPE; |
8d08fdba MS |
9699 | break; |
9700 | case union_type: | |
9701 | code = UNION_TYPE; | |
8d08fdba MS |
9702 | break; |
9703 | case enum_type: | |
9704 | code = ENUMERAL_TYPE; | |
9705 | break; | |
9706 | default: | |
8dc2b103 | 9707 | gcc_unreachable (); |
8d08fdba MS |
9708 | } |
9709 | ||
461c6fce KL |
9710 | /* In case of anonymous name, xref_tag is only called to |
9711 | make type node and push name. Name lookup is not required. */ | |
9712 | if (ANON_AGGRNAME_P (name)) | |
9713 | t = NULL_TREE; | |
8d08fdba | 9714 | else |
461c6fce | 9715 | t = lookup_and_check_tag (tag_code, name, |
29ef83de | 9716 | scope, template_header_p); |
cbd63935 | 9717 | |
461c6fce KL |
9718 | if (t == error_mark_node) |
9719 | POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, error_mark_node); | |
68642fb6 | 9720 | |
29ef83de | 9721 | if (scope != ts_current && t && current_class_type |
461c6fce KL |
9722 | && template_class_depth (current_class_type) |
9723 | && template_header_p) | |
9724 | { | |
29ef83de | 9725 | /* Since SCOPE is not TS_CURRENT, we are not looking at a |
461c6fce KL |
9726 | definition of this tag. Since, in addition, we are currently |
9727 | processing a (member) template declaration of a template | |
9728 | class, we must be very careful; consider: | |
25aab5d0 | 9729 | |
461c6fce KL |
9730 | template <class X> |
9731 | struct S1 | |
25aab5d0 | 9732 | |
461c6fce KL |
9733 | template <class U> |
9734 | struct S2 | |
9735 | { template <class V> | |
9736 | friend struct S1; }; | |
25aab5d0 | 9737 | |
461c6fce KL |
9738 | Here, the S2::S1 declaration should not be confused with the |
9739 | outer declaration. In particular, the inner version should | |
9740 | have a template parameter of level 2, not level 1. This | |
9741 | would be particularly important if the member declaration | |
9742 | were instead: | |
25aab5d0 | 9743 | |
461c6fce | 9744 | template <class V = U> friend struct S1; |
25aab5d0 | 9745 | |
461c6fce KL |
9746 | say, when we should tsubst into `U' when instantiating |
9747 | S2. On the other hand, when presented with: | |
25aab5d0 | 9748 | |
461c6fce KL |
9749 | template <class T> |
9750 | struct S1 { | |
9751 | template <class U> | |
9752 | struct S2 {}; | |
9753 | template <class U> | |
9754 | friend struct S2; | |
9755 | }; | |
25aab5d0 | 9756 | |
461c6fce KL |
9757 | we must find the inner binding eventually. We |
9758 | accomplish this by making sure that the new type we | |
9759 | create to represent this declaration has the right | |
9760 | TYPE_CONTEXT. */ | |
9761 | context = TYPE_CONTEXT (t); | |
9762 | t = NULL_TREE; | |
8d08fdba MS |
9763 | } |
9764 | ||
cbd63935 | 9765 | if (! t) |
8d08fdba MS |
9766 | { |
9767 | /* If no such tag is yet defined, create a forward-reference node | |
9768 | and record it as the "definition". | |
9769 | When a real declaration of this type is found, | |
9770 | the forward-reference will be altered into a real type. */ | |
8d08fdba MS |
9771 | if (code == ENUMERAL_TYPE) |
9772 | { | |
2d01edd7 | 9773 | error ("use of enum %q#D without previous declaration", name); |
30fc3df7 | 9774 | POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, error_mark_node); |
8d08fdba | 9775 | } |
8d08fdba MS |
9776 | else |
9777 | { | |
cbd63935 KL |
9778 | t = make_aggr_type (code); |
9779 | TYPE_CONTEXT (t) = context; | |
bd3d082e | 9780 | t = pushtag (name, t, scope); |
8d08fdba MS |
9781 | } |
9782 | } | |
9783 | else | |
9784 | { | |
29ef83de | 9785 | if (template_header_p && IS_AGGR_TYPE (t)) |
60feef2c LM |
9786 | { |
9787 | if (!redeclare_class_template (t, current_template_parms)) | |
9788 | POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, error_mark_node); | |
9789 | } | |
caf93cb0 | 9790 | else if (!processing_template_decl |
9ce1594a MM |
9791 | && CLASS_TYPE_P (t) |
9792 | && CLASSTYPE_IS_TEMPLATE (t)) | |
9793 | { | |
2d01edd7 | 9794 | error ("redeclaration of %qT as a non-template", t); |
b646edb8 VR |
9795 | error ("previous declaration %q+D", t); |
9796 | POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, error_mark_node); | |
9ce1594a | 9797 | } |
bd3d082e KL |
9798 | |
9799 | /* Make injected friend class visible. */ | |
9800 | if (scope != ts_within_enclosing_non_class | |
9801 | && hidden_name_p (TYPE_NAME (t))) | |
9802 | { | |
9803 | DECL_ANTICIPATED (TYPE_NAME (t)) = 0; | |
9804 | DECL_FRIEND_P (TYPE_NAME (t)) = 0; | |
9805 | ||
9806 | if (TYPE_TEMPLATE_INFO (t)) | |
9807 | { | |
9808 | DECL_ANTICIPATED (TYPE_TI_TEMPLATE (t)) = 0; | |
9809 | DECL_FRIEND_P (TYPE_TI_TEMPLATE (t)) = 0; | |
9810 | } | |
0cbd7506 | 9811 | } |
8d08fdba MS |
9812 | } |
9813 | ||
cbd63935 | 9814 | POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, t); |
8d08fdba | 9815 | } |
8ccc31eb | 9816 | |
fc378698 | 9817 | tree |
29ef83de | 9818 | xref_tag_from_type (tree old, tree id, tag_scope scope) |
fc378698 | 9819 | { |
88e5899c | 9820 | enum tag_types tag_kind; |
fc378698 MS |
9821 | |
9822 | if (TREE_CODE (old) == RECORD_TYPE) | |
88e5899c | 9823 | tag_kind = (CLASSTYPE_DECLARED_CLASS (old) ? class_type : record_type); |
fc378698 | 9824 | else |
88e5899c | 9825 | tag_kind = union_type; |
fc378698 MS |
9826 | |
9827 | if (id == NULL_TREE) | |
9828 | id = TYPE_IDENTIFIER (old); | |
9829 | ||
29ef83de | 9830 | return xref_tag (tag_kind, id, scope, false); |
fc378698 MS |
9831 | } |
9832 | ||
48b45647 NS |
9833 | /* Create the binfo hierarchy for REF with (possibly NULL) base list |
9834 | BASE_LIST. For each element on BASE_LIST the TREE_PURPOSE is an | |
9835 | access_* node, and the TREE_VALUE is the type of the base-class. | |
72f8fc59 LM |
9836 | Non-NULL TREE_TYPE indicates virtual inheritance. |
9837 | ||
bd6f7848 | 9838 | Returns true if the binfo hierarchy was successfully created, |
72f8fc59 | 9839 | false if an error was detected. */ |
3fd71a52 | 9840 | |
72f8fc59 | 9841 | bool |
dbbf88d1 | 9842 | xref_basetypes (tree ref, tree base_list) |
8ccc31eb | 9843 | { |
8fbc5ae7 | 9844 | tree *basep; |
fa743e8c | 9845 | tree binfo, base_binfo; |
03fd3f84 | 9846 | unsigned max_vbases = 0; /* Maximum direct & indirect virtual bases. */ |
77880ae4 | 9847 | unsigned max_bases = 0; /* Maximum direct bases. */ |
8fbc5ae7 | 9848 | int i; |
48b45647 NS |
9849 | tree default_access; |
9850 | tree igo_prev; /* Track Inheritance Graph Order. */ | |
a5d7c4a3 | 9851 | |
bef89e9e | 9852 | if (ref == error_mark_node) |
72f8fc59 | 9853 | return false; |
bef89e9e | 9854 | |
48b45647 NS |
9855 | /* The base of a derived class is private by default, all others are |
9856 | public. */ | |
9857 | default_access = (TREE_CODE (ref) == RECORD_TYPE | |
9858 | && CLASSTYPE_DECLARED_CLASS (ref) | |
9859 | ? access_private_node : access_public_node); | |
da15dae6 | 9860 | |
d6479fe7 MM |
9861 | /* First, make sure that any templates in base-classes are |
9862 | instantiated. This ensures that if we call ourselves recursively | |
9863 | we do not get confused about which classes are marked and which | |
9864 | are not. */ | |
caf93cb0 EC |
9865 | basep = &base_list; |
9866 | while (*basep) | |
8fbc5ae7 MM |
9867 | { |
9868 | tree basetype = TREE_VALUE (*basep); | |
caf93cb0 | 9869 | |
8fbc5ae7 MM |
9870 | if (!(processing_template_decl && uses_template_parms (basetype)) |
9871 | && !complete_type_or_else (basetype, NULL)) | |
dbbf88d1 | 9872 | /* An incomplete type. Remove it from the list. */ |
8fbc5ae7 MM |
9873 | *basep = TREE_CHAIN (*basep); |
9874 | else | |
48b45647 NS |
9875 | { |
9876 | max_bases++; | |
9877 | if (TREE_TYPE (*basep)) | |
9878 | max_vbases++; | |
9879 | if (CLASS_TYPE_P (basetype)) | |
9880 | max_vbases += VEC_length (tree, CLASSTYPE_VBASECLASSES (basetype)); | |
9881 | basep = &TREE_CHAIN (*basep); | |
9882 | } | |
8fbc5ae7 | 9883 | } |
d6479fe7 | 9884 | |
3543e114 | 9885 | TYPE_MARKED_P (ref) = 1; |
48b45647 | 9886 | |
cad7e87b NS |
9887 | /* The binfo slot should be empty, unless this is an (ill-formed) |
9888 | redefinition. */ | |
50bc768d NS |
9889 | gcc_assert (!TYPE_BINFO (ref) || TYPE_SIZE (ref)); |
9890 | gcc_assert (TYPE_MAIN_VARIANT (ref) == ref); | |
caf93cb0 | 9891 | |
fa743e8c | 9892 | binfo = make_tree_binfo (max_bases); |
caf93cb0 | 9893 | |
48b45647 NS |
9894 | TYPE_BINFO (ref) = binfo; |
9895 | BINFO_OFFSET (binfo) = size_zero_node; | |
9896 | BINFO_TYPE (binfo) = ref; | |
caf93cb0 | 9897 | |
48b45647 NS |
9898 | if (max_bases) |
9899 | { | |
d4e6fecb | 9900 | BINFO_BASE_ACCESSES (binfo) = VEC_alloc (tree, gc, max_bases); |
48b45647 NS |
9901 | /* An aggregate cannot have baseclasses. */ |
9902 | CLASSTYPE_NON_AGGREGATE (ref) = 1; | |
caf93cb0 | 9903 | |
48b45647 | 9904 | if (TREE_CODE (ref) == UNION_TYPE) |
72f8fc59 LM |
9905 | { |
9906 | error ("derived union %qT invalid", ref); | |
9907 | return false; | |
9908 | } | |
48b45647 | 9909 | } |
caf93cb0 | 9910 | |
48b45647 | 9911 | if (max_bases > 1) |
dbbf88d1 | 9912 | { |
48b45647 | 9913 | if (TYPE_FOR_JAVA (ref)) |
72f8fc59 LM |
9914 | { |
9915 | error ("Java class %qT cannot have multiple bases", ref); | |
9916 | return false; | |
9917 | } | |
48b45647 | 9918 | } |
caf93cb0 | 9919 | |
48b45647 NS |
9920 | if (max_vbases) |
9921 | { | |
d4e6fecb | 9922 | CLASSTYPE_VBASECLASSES (ref) = VEC_alloc (tree, gc, max_vbases); |
caf93cb0 | 9923 | |
48b45647 | 9924 | if (TYPE_FOR_JAVA (ref)) |
72f8fc59 LM |
9925 | { |
9926 | error ("Java class %qT cannot have virtual bases", ref); | |
9927 | return false; | |
9928 | } | |
48b45647 | 9929 | } |
cad7e87b | 9930 | |
48b45647 NS |
9931 | for (igo_prev = binfo; base_list; base_list = TREE_CHAIN (base_list)) |
9932 | { | |
9933 | tree access = TREE_PURPOSE (base_list); | |
9934 | int via_virtual = TREE_TYPE (base_list) != NULL_TREE; | |
9935 | tree basetype = TREE_VALUE (base_list); | |
caf93cb0 | 9936 | |
48b45647 NS |
9937 | if (access == access_default_node) |
9938 | access = default_access; | |
caf93cb0 | 9939 | |
48b45647 NS |
9940 | if (TREE_CODE (basetype) == TYPE_DECL) |
9941 | basetype = TREE_TYPE (basetype); | |
9942 | if (TREE_CODE (basetype) != RECORD_TYPE | |
9943 | && TREE_CODE (basetype) != TYPENAME_TYPE | |
9944 | && TREE_CODE (basetype) != TEMPLATE_TYPE_PARM | |
9945 | && TREE_CODE (basetype) != BOUND_TEMPLATE_TEMPLATE_PARM) | |
9946 | { | |
2d01edd7 | 9947 | error ("base type %qT fails to be a struct or class type", |
48b45647 | 9948 | basetype); |
72f8fc59 | 9949 | return false; |
8ccc31eb | 9950 | } |
caf93cb0 | 9951 | |
48b45647 NS |
9952 | if (TYPE_FOR_JAVA (basetype) && (current_lang_depth () == 0)) |
9953 | TYPE_FOR_JAVA (ref) = 1; | |
9954 | ||
fa743e8c | 9955 | base_binfo = NULL_TREE; |
48b45647 | 9956 | if (CLASS_TYPE_P (basetype) && !dependent_type_p (basetype)) |
dbbf88d1 | 9957 | { |
48b45647 | 9958 | base_binfo = TYPE_BINFO (basetype); |
77880ae4 | 9959 | /* The original basetype could have been a typedef'd type. */ |
48b45647 | 9960 | basetype = BINFO_TYPE (base_binfo); |
caf93cb0 | 9961 | |
48b45647 NS |
9962 | /* Inherit flags from the base. */ |
9963 | TYPE_HAS_NEW_OPERATOR (ref) | |
9964 | |= TYPE_HAS_NEW_OPERATOR (basetype); | |
9965 | TYPE_HAS_ARRAY_NEW_OPERATOR (ref) | |
9966 | |= TYPE_HAS_ARRAY_NEW_OPERATOR (basetype); | |
9967 | TYPE_GETS_DELETE (ref) |= TYPE_GETS_DELETE (basetype); | |
48b45647 | 9968 | TYPE_HAS_CONVERSION (ref) |= TYPE_HAS_CONVERSION (basetype); |
3543e114 NS |
9969 | CLASSTYPE_DIAMOND_SHAPED_P (ref) |
9970 | |= CLASSTYPE_DIAMOND_SHAPED_P (basetype); | |
9971 | CLASSTYPE_REPEATED_BASE_P (ref) | |
9972 | |= CLASSTYPE_REPEATED_BASE_P (basetype); | |
8fbc5ae7 | 9973 | } |
c8094d83 | 9974 | |
98d6e9af NS |
9975 | /* We must do this test after we've seen through a typedef |
9976 | type. */ | |
9977 | if (TYPE_MARKED_P (basetype)) | |
9978 | { | |
9979 | if (basetype == ref) | |
2d01edd7 | 9980 | error ("recursive type %qT undefined", basetype); |
98d6e9af | 9981 | else |
2d01edd7 | 9982 | error ("duplicate base type %qT invalid", basetype); |
72f8fc59 | 9983 | return false; |
98d6e9af NS |
9984 | } |
9985 | TYPE_MARKED_P (basetype) = 1; | |
caf93cb0 | 9986 | |
48b45647 NS |
9987 | base_binfo = copy_binfo (base_binfo, basetype, ref, |
9988 | &igo_prev, via_virtual); | |
9989 | if (!BINFO_INHERITANCE_CHAIN (base_binfo)) | |
9990 | BINFO_INHERITANCE_CHAIN (base_binfo) = binfo; | |
f5c28a15 | 9991 | |
fa743e8c | 9992 | BINFO_BASE_APPEND (binfo, base_binfo); |
63d1c7b3 | 9993 | BINFO_BASE_ACCESS_APPEND (binfo, access); |
cad7e87b NS |
9994 | } |
9995 | ||
3543e114 NS |
9996 | if (VEC_space (tree, CLASSTYPE_VBASECLASSES (ref), 1)) |
9997 | /* If we have space in the vbase vector, we must have shared at | |
9998 | least one of them, and are therefore diamond shaped. */ | |
9999 | CLASSTYPE_DIAMOND_SHAPED_P (ref) = 1; | |
10000 | ||
dbbf88d1 | 10001 | /* Unmark all the types. */ |
fa743e8c | 10002 | for (i = 0; BINFO_BASE_ITERATE (binfo, i, base_binfo); i++) |
3543e114 NS |
10003 | TYPE_MARKED_P (BINFO_TYPE (base_binfo)) = 0; |
10004 | TYPE_MARKED_P (ref) = 0; | |
10005 | ||
10006 | /* Now see if we have a repeated base type. */ | |
10007 | if (!CLASSTYPE_REPEATED_BASE_P (ref)) | |
10008 | { | |
10009 | for (base_binfo = binfo; base_binfo; | |
10010 | base_binfo = TREE_CHAIN (base_binfo)) | |
10011 | { | |
10012 | if (TYPE_MARKED_P (BINFO_TYPE (base_binfo))) | |
10013 | { | |
10014 | CLASSTYPE_REPEATED_BASE_P (ref) = 1; | |
10015 | break; | |
10016 | } | |
10017 | TYPE_MARKED_P (BINFO_TYPE (base_binfo)) = 1; | |
10018 | } | |
10019 | for (base_binfo = binfo; base_binfo; | |
10020 | base_binfo = TREE_CHAIN (base_binfo)) | |
10021 | if (TYPE_MARKED_P (BINFO_TYPE (base_binfo))) | |
10022 | TYPE_MARKED_P (BINFO_TYPE (base_binfo)) = 0; | |
10023 | else | |
10024 | break; | |
10025 | } | |
72f8fc59 LM |
10026 | |
10027 | return true; | |
8ccc31eb | 10028 | } |
68642fb6 | 10029 | |
8d08fdba | 10030 | \f |
8d08fdba | 10031 | /* Begin compiling the definition of an enumeration type. |
29ef83de | 10032 | NAME is its name. |
8d08fdba MS |
10033 | Returns the type object, as yet incomplete. |
10034 | Also records info about it so that build_enumerator | |
10035 | may be used to declare the individual values as they are read. */ | |
10036 | ||
10037 | tree | |
11f6b451 | 10038 | start_enum (tree name) |
8d08fdba | 10039 | { |
29ef83de KL |
10040 | tree enumtype; |
10041 | ||
10042 | gcc_assert (TREE_CODE (name) == IDENTIFIER_NODE); | |
8d08fdba MS |
10043 | |
10044 | /* If this is the real definition for a previous forward reference, | |
10045 | fill in the contents in the same object that used to be the | |
10046 | forward reference. */ | |
10047 | ||
29ef83de KL |
10048 | enumtype = lookup_and_check_tag (enum_type, name, |
10049 | /*tag_scope=*/ts_current, | |
10050 | /*template_header_p=*/false); | |
8d08fdba MS |
10051 | |
10052 | if (enumtype != NULL_TREE && TREE_CODE (enumtype) == ENUMERAL_TYPE) | |
30ff8252 | 10053 | { |
2d01edd7 | 10054 | error ("multiple definition of %q#T", enumtype); |
ddd2d57e | 10055 | error ("%Jprevious definition here", TYPE_MAIN_DECL (enumtype)); |
58595203 MM |
10056 | /* Clear out TYPE_VALUES, and start again. */ |
10057 | TYPE_VALUES (enumtype) = NULL_TREE; | |
30ff8252 | 10058 | } |
8d08fdba MS |
10059 | else |
10060 | { | |
29ef83de KL |
10061 | /* In case of error, make a dummy enum to allow parsing to |
10062 | continue. */ | |
10063 | if (enumtype == error_mark_node) | |
10064 | name = make_anon_name (); | |
10065 | ||
8d08fdba | 10066 | enumtype = make_node (ENUMERAL_TYPE); |
bd3d082e | 10067 | enumtype = pushtag (name, enumtype, /*tag_scope=*/ts_current); |
8d08fdba MS |
10068 | } |
10069 | ||
8d08fdba MS |
10070 | return enumtype; |
10071 | } | |
10072 | ||
10073 | /* After processing and defining all the values of an enumeration type, | |
10074 | install their decls in the enumeration type and finish it off. | |
968b956a | 10075 | ENUMTYPE is the type object and VALUES a list of name-value pairs. */ |
8d08fdba | 10076 | |
968b956a | 10077 | void |
11f6b451 | 10078 | finish_enum (tree enumtype) |
8d08fdba | 10079 | { |
7b6d72fc MM |
10080 | tree values; |
10081 | tree decl; | |
10082 | tree value; | |
968b956a MM |
10083 | tree minnode; |
10084 | tree maxnode; | |
10085 | tree t; | |
10086 | bool unsignedp; | |
f6af9a15 | 10087 | bool use_short_enum; |
968b956a | 10088 | int lowprec; |
caf93cb0 | 10089 | int highprec; |
968b956a | 10090 | int precision; |
7b6d72fc | 10091 | integer_type_kind itk; |
ad96995b | 10092 | tree underlying_type = NULL_TREE; |
968b956a MM |
10093 | |
10094 | /* We built up the VALUES in reverse order. */ | |
10095 | TYPE_VALUES (enumtype) = nreverse (TYPE_VALUES (enumtype)); | |
10096 | ||
f5d70cc0 JM |
10097 | /* For an enum defined in a template, just set the type of the values; |
10098 | all further processing is postponed until the template is | |
10099 | instantiated. We need to set the type so that tsubst of a CONST_DECL | |
10100 | works. */ | |
968b956a MM |
10101 | if (processing_template_decl) |
10102 | { | |
caf93cb0 EC |
10103 | for (values = TYPE_VALUES (enumtype); |
10104 | values; | |
7b6d72fc MM |
10105 | values = TREE_CHAIN (values)) |
10106 | TREE_TYPE (TREE_VALUE (values)) = enumtype; | |
5f261ba9 | 10107 | if (at_function_scope_p ()) |
968b956a | 10108 | add_stmt (build_min (TAG_DEFN, enumtype)); |
968b956a MM |
10109 | return; |
10110 | } | |
10111 | ||
7b6d72fc | 10112 | /* Determine the minimum and maximum values of the enumerators. */ |
968b956a | 10113 | if (TYPE_VALUES (enumtype)) |
8d08fdba | 10114 | { |
968b956a | 10115 | minnode = maxnode = NULL_TREE; |
5566b478 | 10116 | |
caf93cb0 EC |
10117 | for (values = TYPE_VALUES (enumtype); |
10118 | values; | |
7b6d72fc | 10119 | values = TREE_CHAIN (values)) |
8d08fdba | 10120 | { |
7b6d72fc | 10121 | decl = TREE_VALUE (values); |
f5d70cc0 JM |
10122 | |
10123 | /* [dcl.enum]: Following the closing brace of an enum-specifier, | |
10124 | each enumerator has the type of its enumeration. Prior to the | |
10125 | closing brace, the type of each enumerator is the type of its | |
10126 | initializing value. */ | |
10127 | TREE_TYPE (decl) = enumtype; | |
10128 | ||
7b6d72fc MM |
10129 | /* Update the minimum and maximum values, if appropriate. */ |
10130 | value = DECL_INITIAL (decl); | |
3c955a04 MM |
10131 | if (value == error_mark_node) |
10132 | value = integer_zero_node; | |
f5d70cc0 JM |
10133 | /* Figure out what the minimum and maximum values of the |
10134 | enumerators are. */ | |
10135 | if (!minnode) | |
10136 | minnode = maxnode = value; | |
10137 | else if (tree_int_cst_lt (maxnode, value)) | |
10138 | maxnode = value; | |
10139 | else if (tree_int_cst_lt (value, minnode)) | |
10140 | minnode = value; | |
8d08fdba MS |
10141 | } |
10142 | } | |
f376e137 | 10143 | else |
7b6d72fc MM |
10144 | /* [dcl.enum] |
10145 | ||
10146 | If the enumerator-list is empty, the underlying type is as if | |
10147 | the enumeration had a single enumerator with value 0. */ | |
968b956a MM |
10148 | minnode = maxnode = integer_zero_node; |
10149 | ||
10150 | /* Compute the number of bits require to represent all values of the | |
10151 | enumeration. We must do this before the type of MINNODE and | |
10152 | MAXNODE are transformed, since min_precision relies on the | |
10153 | TREE_TYPE of the value it is passed. */ | |
10154 | unsignedp = tree_int_cst_sgn (minnode) >= 0; | |
10155 | lowprec = min_precision (minnode, unsignedp); | |
10156 | highprec = min_precision (maxnode, unsignedp); | |
10157 | precision = MAX (lowprec, highprec); | |
10158 | ||
7b6d72fc MM |
10159 | /* Determine the underlying type of the enumeration. |
10160 | ||
10161 | [dcl.enum] | |
10162 | ||
10163 | The underlying type of an enumeration is an integral type that | |
10164 | can represent all the enumerator values defined in the | |
10165 | enumeration. It is implementation-defined which integral type is | |
10166 | used as the underlying type for an enumeration except that the | |
10167 | underlying type shall not be larger than int unless the value of | |
caf93cb0 | 10168 | an enumerator cannot fit in an int or unsigned int. |
7b6d72fc MM |
10169 | |
10170 | We use "int" or an "unsigned int" as the underlying type, even if | |
10171 | a smaller integral type would work, unless the user has | |
f6af9a15 MA |
10172 | explicitly requested that we use the smallest possible type. The |
10173 | user can request that for all enumerations with a command line | |
03fd3f84 | 10174 | flag, or for just one enumeration with an attribute. */ |
f6af9a15 MA |
10175 | |
10176 | use_short_enum = flag_short_enums | |
10177 | || lookup_attribute ("packed", TYPE_ATTRIBUTES (enumtype)); | |
10178 | ||
10179 | for (itk = (use_short_enum ? itk_char : itk_int); | |
caf93cb0 | 10180 | itk != itk_none; |
7b6d72fc | 10181 | itk++) |
e455bc27 | 10182 | { |
7b6d72fc MM |
10183 | underlying_type = integer_types[itk]; |
10184 | if (TYPE_PRECISION (underlying_type) >= precision | |
8df83eae | 10185 | && TYPE_UNSIGNED (underlying_type) == unsignedp) |
7b6d72fc MM |
10186 | break; |
10187 | } | |
10188 | if (itk == itk_none) | |
10189 | { | |
10190 | /* DR 377 | |
10191 | ||
10192 | IF no integral type can represent all the enumerator values, the | |
10193 | enumeration is ill-formed. */ | |
e455bc27 | 10194 | error ("no integral type can represent all of the enumerator values " |
2d01edd7 | 10195 | "for %qT", enumtype); |
e455bc27 | 10196 | precision = TYPE_PRECISION (long_long_integer_type_node); |
7b6d72fc | 10197 | underlying_type = integer_types[itk_unsigned_long_long]; |
e455bc27 MM |
10198 | } |
10199 | ||
caf93cb0 | 10200 | /* Compute the minium and maximum values for the type. |
8d08fdba | 10201 | |
7b6d72fc MM |
10202 | [dcl.enum] |
10203 | ||
10204 | For an enumeration where emin is the smallest enumerator and emax | |
10205 | is the largest, the values of the enumeration are the values of the | |
10206 | underlying type in the range bmin to bmax, where bmin and bmax are, | |
10207 | respectively, the smallest and largest values of the smallest bit- | |
10208 | field that can store emin and emax. */ | |
d0c5c9b1 RS |
10209 | |
10210 | /* The middle-end currently assumes that types with TYPE_PRECISION | |
10211 | narrower than their underlying type are suitably zero or sign | |
10212 | extended to fill their mode. g++ doesn't make these guarantees. | |
10213 | Until the middle-end can represent such paradoxical types, we | |
77880ae4 | 10214 | set the TYPE_PRECISION to the width of the underlying type. */ |
d0c5c9b1 RS |
10215 | TYPE_PRECISION (enumtype) = TYPE_PRECISION (underlying_type); |
10216 | ||
7b6d72fc MM |
10217 | set_min_and_max_values_for_integral_type (enumtype, precision, unsignedp); |
10218 | ||
10219 | /* [dcl.enum] | |
caf93cb0 | 10220 | |
7b6d72fc MM |
10221 | The value of sizeof() applied to an enumeration type, an object |
10222 | of an enumeration type, or an enumerator, is the value of sizeof() | |
10223 | applied to the underlying type. */ | |
10224 | TYPE_SIZE (enumtype) = TYPE_SIZE (underlying_type); | |
10225 | TYPE_SIZE_UNIT (enumtype) = TYPE_SIZE_UNIT (underlying_type); | |
10226 | TYPE_MODE (enumtype) = TYPE_MODE (underlying_type); | |
10227 | TYPE_ALIGN (enumtype) = TYPE_ALIGN (underlying_type); | |
10228 | TYPE_USER_ALIGN (enumtype) = TYPE_USER_ALIGN (underlying_type); | |
8df83eae | 10229 | TYPE_UNSIGNED (enumtype) = TYPE_UNSIGNED (underlying_type); |
7b6d72fc MM |
10230 | |
10231 | /* Convert each of the enumerators to the type of the underlying | |
10232 | type of the enumeration. */ | |
10233 | for (values = TYPE_VALUES (enumtype); values; values = TREE_CHAIN (values)) | |
10234 | { | |
3c955a04 MM |
10235 | location_t saved_location; |
10236 | ||
7b6d72fc | 10237 | decl = TREE_VALUE (values); |
3c955a04 MM |
10238 | saved_location = input_location; |
10239 | input_location = DECL_SOURCE_LOCATION (decl); | |
7b6d72fc MM |
10240 | value = perform_implicit_conversion (underlying_type, |
10241 | DECL_INITIAL (decl)); | |
3c955a04 | 10242 | input_location = saved_location; |
89b0433e NS |
10243 | |
10244 | /* Do not clobber shared ints. */ | |
10245 | value = copy_node (value); | |
c8094d83 | 10246 | |
7b6d72fc MM |
10247 | TREE_TYPE (value) = enumtype; |
10248 | DECL_INITIAL (decl) = value; | |
10249 | TREE_VALUE (values) = value; | |
e455bc27 | 10250 | } |
8d08fdba | 10251 | |
968b956a MM |
10252 | /* Fix up all variant types of this enum type. */ |
10253 | for (t = TYPE_MAIN_VARIANT (enumtype); t; t = TYPE_NEXT_VARIANT (t)) | |
10254 | { | |
10255 | TYPE_VALUES (t) = TYPE_VALUES (enumtype); | |
10256 | TYPE_MIN_VALUE (t) = TYPE_MIN_VALUE (enumtype); | |
10257 | TYPE_MAX_VALUE (t) = TYPE_MAX_VALUE (enumtype); | |
10258 | TYPE_SIZE (t) = TYPE_SIZE (enumtype); | |
10259 | TYPE_SIZE_UNIT (t) = TYPE_SIZE_UNIT (enumtype); | |
10260 | TYPE_MODE (t) = TYPE_MODE (enumtype); | |
10261 | TYPE_PRECISION (t) = TYPE_PRECISION (enumtype); | |
10262 | TYPE_ALIGN (t) = TYPE_ALIGN (enumtype); | |
10263 | TYPE_USER_ALIGN (t) = TYPE_USER_ALIGN (enumtype); | |
8df83eae | 10264 | TYPE_UNSIGNED (t) = TYPE_UNSIGNED (enumtype); |
cbf882af MM |
10265 | } |
10266 | ||
968b956a MM |
10267 | /* Finish debugging output for this type. */ |
10268 | rest_of_type_compilation (enumtype, namespace_bindings_p ()); | |
8d08fdba MS |
10269 | } |
10270 | ||
079e1098 | 10271 | /* Build and install a CONST_DECL for an enumeration constant of the |
58595203 | 10272 | enumeration type ENUMTYPE whose NAME and VALUE (if any) are provided. |
8d08fdba MS |
10273 | Assignment of sequential values by default is handled here. */ |
10274 | ||
58595203 | 10275 | void |
11f6b451 | 10276 | build_enumerator (tree name, tree value, tree enumtype) |
8d08fdba | 10277 | { |
58595203 | 10278 | tree decl; |
e8bd800e | 10279 | tree context; |
58595203 | 10280 | tree type; |
8d08fdba | 10281 | |
93678513 MM |
10282 | /* If the VALUE was erroneous, pretend it wasn't there; that will |
10283 | result in the enum being assigned the next value in sequence. */ | |
10284 | if (value == error_mark_node) | |
10285 | value = NULL_TREE; | |
10286 | ||
8d08fdba MS |
10287 | /* Remove no-op casts from the value. */ |
10288 | if (value) | |
10289 | STRIP_TYPE_NOPS (value); | |
10290 | ||
58595203 MM |
10291 | if (! processing_template_decl) |
10292 | { | |
10293 | /* Validate and default VALUE. */ | |
10294 | if (value != NULL_TREE) | |
10295 | { | |
8a784e4a | 10296 | value = integral_constant_value (value); |
58595203 MM |
10297 | |
10298 | if (TREE_CODE (value) == INTEGER_CST) | |
10299 | { | |
0a72704b | 10300 | value = perform_integral_promotions (value); |
58595203 MM |
10301 | constant_expression_warning (value); |
10302 | } | |
10303 | else | |
10304 | { | |
253e0d15 | 10305 | error ("enumerator value for %qD is not an integer constant", name); |
58595203 MM |
10306 | value = NULL_TREE; |
10307 | } | |
10308 | } | |
10309 | ||
10310 | /* Default based on previous value. */ | |
6a540f3c | 10311 | if (value == NULL_TREE) |
58595203 | 10312 | { |
58595203 MM |
10313 | if (TYPE_VALUES (enumtype)) |
10314 | { | |
ff4eb0b5 ZW |
10315 | HOST_WIDE_INT hi; |
10316 | unsigned HOST_WIDE_INT lo; | |
10317 | tree prev_value; | |
10318 | bool overflowed; | |
10319 | ||
10320 | /* The next value is the previous value plus one. We can | |
0cbd7506 | 10321 | safely assume that the previous value is an INTEGER_CST. |
ff4eb0b5 ZW |
10322 | add_double doesn't know the type of the target expression, |
10323 | so we must check with int_fits_type_p as well. */ | |
58595203 | 10324 | prev_value = DECL_INITIAL (TREE_VALUE (TYPE_VALUES (enumtype))); |
ff4eb0b5 ZW |
10325 | overflowed = add_double (TREE_INT_CST_LOW (prev_value), |
10326 | TREE_INT_CST_HIGH (prev_value), | |
10327 | 1, 0, &lo, &hi); | |
10328 | value = build_int_cst_wide (TREE_TYPE (prev_value), lo, hi); | |
10329 | overflowed |= !int_fits_type_p (value, TREE_TYPE (prev_value)); | |
68642fb6 | 10330 | |
ff4eb0b5 | 10331 | if (overflowed) |
3c955a04 MM |
10332 | { |
10333 | error ("overflow in enumeration values at %qD", name); | |
10334 | value = error_mark_node; | |
10335 | } | |
58595203 MM |
10336 | } |
10337 | else | |
10338 | value = integer_zero_node; | |
10339 | } | |
10340 | ||
10341 | /* Remove no-op casts from the value. */ | |
f5d70cc0 | 10342 | STRIP_TYPE_NOPS (value); |
58595203 | 10343 | } |
8d08fdba | 10344 | |
8d08fdba | 10345 | /* C++ associates enums with global, function, or class declarations. */ |
58595203 MM |
10346 | context = current_scope (); |
10347 | ||
10348 | /* Build the actual enumeration constant. Note that the enumeration | |
10349 | constants have the type of their initializers until the | |
10350 | enumeration is complete: | |
10351 | ||
10352 | [ dcl.enum ] | |
10353 | ||
10354 | Following the closing brace of an enum-specifier, each enumer- | |
10355 | ator has the type of its enumeration. Prior to the closing | |
10356 | brace, the type of each enumerator is the type of its | |
10357 | initializing value. | |
10358 | ||
10359 | In finish_enum we will reset the type. Of course, if we're | |
a1c65f9f | 10360 | processing a template, there may be no value. */ |
58595203 MM |
10361 | type = value ? TREE_TYPE (value) : NULL_TREE; |
10362 | ||
10363 | if (context && context == current_class_type) | |
10364 | /* This enum declaration is local to the class. We need the full | |
8f17b5c5 | 10365 | lang_decl so that we can record DECL_CLASS_CONTEXT, for example. */ |
58595203 MM |
10366 | decl = build_lang_decl (CONST_DECL, name, type); |
10367 | else | |
10368 | /* It's a global enum, or it's local to a function. (Note local to | |
e8bd800e | 10369 | a function could mean local to a class method. */ |
58595203 | 10370 | decl = build_decl (CONST_DECL, name, type); |
e8bd800e | 10371 | |
58595203 | 10372 | DECL_CONTEXT (decl) = FROB_CONTEXT (context); |
6de9cd9a DN |
10373 | TREE_CONSTANT (decl) = 1; |
10374 | TREE_INVARIANT (decl) = 1; | |
10375 | TREE_READONLY (decl) = 1; | |
58595203 | 10376 | DECL_INITIAL (decl) = value; |
e8bd800e | 10377 | |
58595203 MM |
10378 | if (context && context == current_class_type) |
10379 | /* In something like `struct S { enum E { i = 7 }; };' we put `i' | |
7b6d72fc MM |
10380 | on the TYPE_FIELDS list for `S'. (That's so that you can say |
10381 | things like `S::i' later.) */ | |
58595203 MM |
10382 | finish_member_declaration (decl); |
10383 | else | |
9780c24f | 10384 | pushdecl (decl); |
58595203 MM |
10385 | |
10386 | /* Add this enumeration constant to the list for this type. */ | |
10387 | TYPE_VALUES (enumtype) = tree_cons (name, decl, TYPE_VALUES (enumtype)); | |
8d08fdba MS |
10388 | } |
10389 | ||
8d08fdba | 10390 | \f |
a8f73d4b MM |
10391 | /* We're defining DECL. Make sure that it's type is OK. */ |
10392 | ||
10393 | static void | |
11f6b451 | 10394 | check_function_type (tree decl, tree current_function_parms) |
a8f73d4b MM |
10395 | { |
10396 | tree fntype = TREE_TYPE (decl); | |
d0f062fb | 10397 | tree return_type = complete_type (TREE_TYPE (fntype)); |
a8f73d4b MM |
10398 | |
10399 | /* In a function definition, arg types must be complete. */ | |
10400 | require_complete_types_for_parms (current_function_parms); | |
10401 | ||
c9387915 GB |
10402 | if (dependent_type_p (return_type)) |
10403 | return; | |
d0f062fb | 10404 | if (!COMPLETE_OR_VOID_TYPE_P (return_type)) |
a8f73d4b | 10405 | { |
51b15ede | 10406 | tree args = TYPE_ARG_TYPES (fntype); |
3db45ab5 | 10407 | |
51b15ede | 10408 | error ("return type %q#T is incomplete", return_type); |
a8f73d4b | 10409 | |
51b15ede | 10410 | /* Make it return void instead. */ |
a8f73d4b | 10411 | if (TREE_CODE (fntype) == METHOD_TYPE) |
51b15ede NS |
10412 | fntype = build_method_type_directly (TREE_TYPE (TREE_VALUE (args)), |
10413 | void_type_node, | |
10414 | TREE_CHAIN (args)); | |
a8f73d4b | 10415 | else |
51b15ede | 10416 | fntype = build_function_type (void_type_node, args); |
68642fb6 | 10417 | TREE_TYPE (decl) |
a8f73d4b | 10418 | = build_exception_variant (fntype, |
51b15ede | 10419 | TYPE_RAISES_EXCEPTIONS (TREE_TYPE (decl))); |
a8f73d4b MM |
10420 | } |
10421 | else | |
10422 | abstract_virtuals_error (decl, TREE_TYPE (fntype)); | |
10423 | } | |
10424 | ||
8d08fdba MS |
10425 | /* Create the FUNCTION_DECL for a function definition. |
10426 | DECLSPECS and DECLARATOR are the parts of the declaration; | |
10427 | they describe the function's name and the type it returns, | |
10428 | but twisted together in a fashion that parallels the syntax of C. | |
10429 | ||
a8f73d4b MM |
10430 | FLAGS is a bitwise or of SF_PRE_PARSED (indicating that the |
10431 | DECLARATOR is really the DECL for the function we are about to | |
10432 | process and that DECLSPECS should be ignored), SF_INCLASS_INLINE | |
f444e36b | 10433 | indicating that the function is an inline defined in-class. |
68642fb6 | 10434 | |
8d08fdba MS |
10435 | This function creates a binding context for the function body |
10436 | as well as setting up the FUNCTION_DECL in current_function_decl. | |
10437 | ||
8d08fdba MS |
10438 | For C++, we must first check whether that datum makes any sense. |
10439 | For example, "class A local_a(1,2);" means that variable local_a | |
10440 | is an aggregate of type A, which should have a constructor | |
72c4a4ca GK |
10441 | applied to it with the argument list [1, 2]. |
10442 | ||
10443 | On entry, DECL_INITIAL (decl1) should be NULL_TREE or error_mark_node, | |
10444 | or may be a BLOCK if the function has been defined previously | |
10445 | in this translation unit. On exit, DECL_INITIAL (decl1) will be | |
10446 | error_mark_node if the function has never been defined, or | |
10447 | a BLOCK if the function has been defined somewhere. */ | |
8d08fdba | 10448 | |
058b15c1 MM |
10449 | void |
10450 | start_preparsed_function (tree decl1, tree attrs, int flags) | |
8d08fdba | 10451 | { |
8d08fdba MS |
10452 | tree ctype = NULL_TREE; |
10453 | tree fntype; | |
10454 | tree restype; | |
8d08fdba | 10455 | int doing_friend = 0; |
e2500fed | 10456 | struct cp_binding_level *bl; |
f444e36b | 10457 | tree current_function_parms; |
3e3935a9 | 10458 | struct c_fileinfo *finfo |
c533e34d | 10459 | = get_fileinfo (LOCATION_FILE (DECL_SOURCE_LOCATION (decl1))); |
1ef0df47 | 10460 | bool honor_interface; |
8d08fdba | 10461 | |
8d08fdba | 10462 | /* Sanity check. */ |
50bc768d NS |
10463 | gcc_assert (TREE_CODE (TREE_VALUE (void_list_node)) == VOID_TYPE); |
10464 | gcc_assert (TREE_CHAIN (void_list_node) == NULL_TREE); | |
8d08fdba | 10465 | |
058b15c1 MM |
10466 | fntype = TREE_TYPE (decl1); |
10467 | if (TREE_CODE (fntype) == METHOD_TYPE) | |
10468 | ctype = TYPE_METHOD_BASETYPE (fntype); | |
caf93cb0 | 10469 | |
058b15c1 MM |
10470 | /* ISO C++ 11.4/5. A friend function defined in a class is in |
10471 | the (lexical) scope of the class in which it is defined. */ | |
10472 | if (!ctype && DECL_FRIEND_P (decl1)) | |
8d08fdba | 10473 | { |
058b15c1 | 10474 | ctype = DECL_FRIEND_CONTEXT (decl1); |
caf93cb0 | 10475 | |
058b15c1 MM |
10476 | /* CTYPE could be null here if we're dealing with a template; |
10477 | for example, `inline friend float foo()' inside a template | |
10478 | will have no CTYPE set. */ | |
10479 | if (ctype && TREE_CODE (ctype) != RECORD_TYPE) | |
10480 | ctype = NULL_TREE; | |
10481 | else | |
10482 | doing_friend = 1; | |
8d08fdba | 10483 | } |
68642fb6 | 10484 | |
97055d5c AO |
10485 | if (DECL_DECLARED_INLINE_P (decl1) |
10486 | && lookup_attribute ("noinline", attrs)) | |
dee15844 | 10487 | warning (0, "inline function %q+D given attribute noinline", decl1); |
97055d5c | 10488 | |
5f6eeeb3 NS |
10489 | if (DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (decl1)) |
10490 | /* This is a constructor, we must ensure that any default args | |
10491 | introduced by this definition are propagated to the clones | |
10492 | now. The clones are used directly in overload resolution. */ | |
10493 | adjust_clone_args (decl1); | |
10494 | ||
b35d4555 MM |
10495 | /* Sometimes we don't notice that a function is a static member, and |
10496 | build a METHOD_TYPE for it. Fix that up now. */ | |
10497 | if (ctype != NULL_TREE && DECL_STATIC_FUNCTION_P (decl1) | |
10498 | && TREE_CODE (TREE_TYPE (decl1)) == METHOD_TYPE) | |
10499 | { | |
3afb32a4 | 10500 | revert_static_member_fn (decl1); |
b35d4555 MM |
10501 | ctype = NULL_TREE; |
10502 | } | |
8d08fdba | 10503 | |
f181d4ae MM |
10504 | /* Set up current_class_type, and enter the scope of the class, if |
10505 | appropriate. */ | |
10506 | if (ctype) | |
14d22dd6 | 10507 | push_nested_class (ctype); |
f181d4ae | 10508 | else if (DECL_STATIC_FUNCTION_P (decl1)) |
14d22dd6 | 10509 | push_nested_class (DECL_CONTEXT (decl1)); |
f181d4ae MM |
10510 | |
10511 | /* Now that we have entered the scope of the class, we must restore | |
10512 | the bindings for any template parameters surrounding DECL1, if it | |
10513 | is an inline member template. (Order is important; consider the | |
10514 | case where a template parameter has the same name as a field of | |
10515 | the class.) It is not until after this point that | |
10516 | PROCESSING_TEMPLATE_DECL is guaranteed to be set up correctly. */ | |
a8f73d4b | 10517 | if (flags & SF_INCLASS_INLINE) |
f181d4ae MM |
10518 | maybe_begin_member_template_processing (decl1); |
10519 | ||
56cb9733 | 10520 | /* Effective C++ rule 15. */ |
9188c363 | 10521 | if (warn_ecpp |
596ea4e5 | 10522 | && DECL_OVERLOADED_OPERATOR_P (decl1) == NOP_EXPR |
9188c363 | 10523 | && TREE_CODE (TREE_TYPE (fntype)) == VOID_TYPE) |
b323323f | 10524 | warning (OPT_Weffc__, "%<operator=%> should return a reference to %<*this%>"); |
9188c363 MM |
10525 | |
10526 | /* Make the init_value nonzero so pushdecl knows this is not tentative. | |
10527 | error_mark_node is replaced below (in poplevel) with the BLOCK. */ | |
b35d4555 MM |
10528 | if (!DECL_INITIAL (decl1)) |
10529 | DECL_INITIAL (decl1) = error_mark_node; | |
9188c363 | 10530 | |
9188c363 MM |
10531 | /* This function exists in static storage. |
10532 | (This does not mean `static' in the C sense!) */ | |
10533 | TREE_STATIC (decl1) = 1; | |
10534 | ||
10535 | /* We must call push_template_decl after current_class_type is set | |
10536 | up. (If we are processing inline definitions after exiting a | |
10537 | class scope, current_class_type will be NULL_TREE until set above | |
10538 | by push_nested_class.) */ | |
10539 | if (processing_template_decl) | |
11e97737 VR |
10540 | { |
10541 | /* FIXME: Handle error_mark_node more gracefully. */ | |
10542 | tree newdecl1 = push_template_decl (decl1); | |
10543 | if (newdecl1 != error_mark_node) | |
0cbd7506 | 10544 | decl1 = newdecl1; |
11e97737 | 10545 | } |
9188c363 | 10546 | |
f181d4ae | 10547 | /* We are now in the scope of the function being defined. */ |
8d08fdba | 10548 | current_function_decl = decl1; |
f181d4ae | 10549 | |
5566b478 MS |
10550 | /* Save the parm names or decls from this function's declarator |
10551 | where store_parm_decls will find them. */ | |
4546865e | 10552 | current_function_parms = DECL_ARGUMENTS (decl1); |
8d08fdba | 10553 | |
a8f73d4b MM |
10554 | /* Make sure the parameter and return types are reasonable. When |
10555 | you declare a function, these types can be incomplete, but they | |
10556 | must be complete when you define the function. */ | |
c9387915 | 10557 | check_function_type (decl1, current_function_parms); |
f181d4ae | 10558 | |
a8f73d4b MM |
10559 | /* Build the return declaration for the function. */ |
10560 | restype = TREE_TYPE (fntype); | |
e89a6075 JM |
10561 | /* Promote the value to int before returning it. */ |
10562 | if (c_promoting_integer_type_p (restype)) | |
10563 | restype = type_promotes_to (restype); | |
10564 | if (DECL_RESULT (decl1) == NULL_TREE) | |
a8f73d4b | 10565 | { |
b785f485 RH |
10566 | tree resdecl; |
10567 | ||
10568 | resdecl = build_decl (RESULT_DECL, 0, TYPE_MAIN_VARIANT (restype)); | |
10569 | DECL_ARTIFICIAL (resdecl) = 1; | |
10570 | DECL_IGNORED_P (resdecl) = 1; | |
10571 | DECL_RESULT (decl1) = resdecl; | |
10572 | ||
9804209d | 10573 | cp_apply_type_quals_to_decl (cp_type_quals (restype), resdecl); |
5566b478 | 10574 | } |
a8f73d4b | 10575 | |
a8f73d4b | 10576 | /* Let the user know we're compiling this function. */ |
ea11ca7e | 10577 | announce_function (decl1); |
b7484fbe | 10578 | |
878cd289 MS |
10579 | /* Record the decl so that the function name is defined. |
10580 | If we already have a decl for this name, and it is a FUNCTION_DECL, | |
10581 | use the old decl. */ | |
a8f73d4b | 10582 | if (!processing_template_decl && !(flags & SF_PRE_PARSED)) |
878cd289 | 10583 | { |
75650646 | 10584 | /* A specialization is not used to guide overload resolution. */ |
18f5be99 | 10585 | if (!DECL_FUNCTION_MEMBER_P (decl1) |
caf93cb0 | 10586 | && !(DECL_USE_TEMPLATE (decl1) && |
18f5be99 | 10587 | PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (decl1)))) |
b1a19c7c MM |
10588 | { |
10589 | tree olddecl = pushdecl (decl1); | |
10590 | ||
10591 | if (olddecl == error_mark_node) | |
10592 | /* If something went wrong when registering the declaration, | |
10593 | use DECL1; we have to have a FUNCTION_DECL to use when | |
10594 | parsing the body of the function. */ | |
10595 | ; | |
10596 | else | |
dfdec7a7 ILT |
10597 | { |
10598 | /* Otherwise, OLDDECL is either a previous declaration | |
10599 | of the same function or DECL1 itself. */ | |
10600 | ||
10601 | if (warn_missing_declarations | |
10602 | && olddecl == decl1 | |
10603 | && !DECL_MAIN_P (decl1) | |
10604 | && TREE_PUBLIC (decl1) | |
10605 | && !DECL_DECLARED_INLINE_P (decl1)) | |
10606 | { | |
10607 | tree context; | |
10608 | ||
10609 | /* Check whether DECL1 is in an anonymous | |
10610 | namespace. */ | |
10611 | for (context = DECL_CONTEXT (decl1); | |
10612 | context; | |
10613 | context = DECL_CONTEXT (context)) | |
10614 | { | |
10615 | if (TREE_CODE (context) == NAMESPACE_DECL | |
10616 | && DECL_NAME (context) == NULL_TREE) | |
10617 | break; | |
10618 | } | |
10619 | ||
10620 | if (context == NULL) | |
10621 | warning (OPT_Wmissing_declarations, | |
10622 | "no previous declaration for %q+D", decl1); | |
10623 | } | |
10624 | ||
10625 | decl1 = olddecl; | |
10626 | } | |
b1a19c7c | 10627 | } |
2c73f9f5 | 10628 | else |
b7698cf0 | 10629 | { |
a1c65f9f | 10630 | /* We need to set the DECL_CONTEXT. */ |
b7698cf0 JM |
10631 | if (!DECL_CONTEXT (decl1) && DECL_TEMPLATE_INFO (decl1)) |
10632 | DECL_CONTEXT (decl1) = DECL_CONTEXT (DECL_TI_TEMPLATE (decl1)); | |
b7698cf0 | 10633 | } |
878cd289 | 10634 | fntype = TREE_TYPE (decl1); |
2ef06beb MM |
10635 | |
10636 | /* If #pragma weak applies, mark the decl appropriately now. | |
10637 | The pragma only applies to global functions. Because | |
10638 | determining whether or not the #pragma applies involves | |
10639 | computing the mangled name for the declaration, we cannot | |
10640 | apply the pragma until after we have merged this declaration | |
10641 | with any previous declarations; if the original declaration | |
10642 | has a linkage specification, that specification applies to | |
10643 | the definition as well, and may affect the mangled name. */ | |
10644 | if (!DECL_CONTEXT (decl1)) | |
10645 | maybe_apply_pragma_weak (decl1); | |
878cd289 | 10646 | } |
5566b478 | 10647 | |
72c4a4ca | 10648 | /* Reset this in case the call to pushdecl changed it. */ |
5566b478 | 10649 | current_function_decl = decl1; |
72c4a4ca GK |
10650 | |
10651 | gcc_assert (DECL_INITIAL (decl1)); | |
10652 | ||
10653 | /* This function may already have been parsed, in which case just | |
10654 | return; our caller will skip over the body without parsing. */ | |
10655 | if (DECL_INITIAL (decl1) != error_mark_node) | |
10656 | return; | |
10657 | ||
10658 | /* Initialize RTL machinery. We cannot do this until | |
10659 | CURRENT_FUNCTION_DECL and DECL_RESULT are set up. We do this | |
10660 | even when processing a template; this is how we get | |
10661 | CFUN set up, and our per-function variables initialized. | |
10662 | FIXME factor out the non-RTL stuff. */ | |
10663 | bl = current_binding_level; | |
10664 | allocate_struct_function (decl1); | |
10665 | current_binding_level = bl; | |
10666 | ||
10667 | /* Even though we're inside a function body, we still don't want to | |
10668 | call expand_expr to calculate the size of a variable-sized array. | |
10669 | We haven't necessarily assigned RTL to all variables yet, so it's | |
10670 | not safe to try to expand expressions involving them. */ | |
10671 | cfun->x_dont_save_pending_sizes_p = 1; | |
10672 | ||
10673 | /* Start the statement-tree, start the tree now. */ | |
10674 | DECL_SAVED_TREE (decl1) = push_stmt_list (); | |
878cd289 | 10675 | |
78c120b5 MM |
10676 | /* If we are (erroneously) defining a function that we have already |
10677 | defined before, wipe out what we knew before. */ | |
e2500fed GK |
10678 | if (!DECL_PENDING_INLINE_P (decl1)) |
10679 | DECL_SAVED_FUNCTION_DATA (decl1) = NULL; | |
b35d4555 | 10680 | |
f444e36b | 10681 | if (ctype && !doing_friend && !DECL_STATIC_FUNCTION_P (decl1)) |
b35d4555 MM |
10682 | { |
10683 | /* We know that this was set up by `grokclassfn'. We do not | |
10684 | wait until `store_parm_decls', since evil parse errors may | |
10685 | never get us to that point. Here we keep the consistency | |
10686 | between `current_class_type' and `current_class_ptr'. */ | |
10687 | tree t = DECL_ARGUMENTS (decl1); | |
68642fb6 | 10688 | |
50bc768d NS |
10689 | gcc_assert (t != NULL_TREE && TREE_CODE (t) == PARM_DECL); |
10690 | gcc_assert (TREE_CODE (TREE_TYPE (t)) == POINTER_TYPE); | |
68642fb6 UD |
10691 | |
10692 | cp_function_chain->x_current_class_ref | |
3e411c3f | 10693 | = build_indirect_ref (t, NULL); |
b35d4555 MM |
10694 | cp_function_chain->x_current_class_ptr = t; |
10695 | ||
018fc244 MM |
10696 | /* Constructors and destructors need to know whether they're "in |
10697 | charge" of initializing virtual base classes. */ | |
e0fff4b3 | 10698 | t = TREE_CHAIN (t); |
454fa7a7 | 10699 | if (DECL_HAS_IN_CHARGE_PARM_P (decl1)) |
e0fff4b3 JM |
10700 | { |
10701 | current_in_charge_parm = t; | |
10702 | t = TREE_CHAIN (t); | |
10703 | } | |
10704 | if (DECL_HAS_VTT_PARM_P (decl1)) | |
10705 | { | |
8dc2b103 | 10706 | gcc_assert (DECL_NAME (t) == vtt_parm_identifier); |
e0fff4b3 JM |
10707 | current_vtt_parm = t; |
10708 | } | |
b35d4555 MM |
10709 | } |
10710 | ||
1ef0df47 MM |
10711 | honor_interface = (!DECL_TEMPLATE_INSTANTIATION (decl1) |
10712 | /* Implicitly-defined methods (like the | |
10713 | destructor for a class in which no destructor | |
10714 | is explicitly declared) must not be defined | |
10715 | until their definition is needed. So, we | |
10716 | ignore interface specifications for | |
10717 | compiler-generated functions. */ | |
10718 | && !DECL_ARTIFICIAL (decl1)); | |
3db45ab5 | 10719 | |
db5ae43f | 10720 | if (DECL_INTERFACE_KNOWN (decl1)) |
faae18ab | 10721 | { |
4f1c5b7d | 10722 | tree ctx = decl_function_context (decl1); |
86052cc3 | 10723 | |
faae18ab MS |
10724 | if (DECL_NOT_REALLY_EXTERN (decl1)) |
10725 | DECL_EXTERNAL (decl1) = 0; | |
86052cc3 | 10726 | |
79065db2 | 10727 | if (ctx != NULL_TREE && DECL_DECLARED_INLINE_P (ctx) |
86052cc3 JM |
10728 | && TREE_PUBLIC (ctx)) |
10729 | /* This is a function in a local class in an extern inline | |
10730 | function. */ | |
10731 | comdat_linkage (decl1); | |
faae18ab | 10732 | } |
8d08fdba MS |
10733 | /* If this function belongs to an interface, it is public. |
10734 | If it belongs to someone else's interface, it is also external. | |
1f901793 | 10735 | This only affects inlines and template instantiations. */ |
1ef0df47 | 10736 | else if (!finfo->interface_unknown && honor_interface) |
8d08fdba | 10737 | { |
caf93cb0 | 10738 | if (DECL_DECLARED_INLINE_P (decl1) |
79065db2 | 10739 | || DECL_TEMPLATE_INSTANTIATION (decl1) |
5156628f | 10740 | || processing_template_decl) |
1f901793 JM |
10741 | { |
10742 | DECL_EXTERNAL (decl1) | |
5d709b00 | 10743 | = (finfo->interface_only |
caf93cb0 | 10744 | || (DECL_DECLARED_INLINE_P (decl1) |
79065db2 | 10745 | && ! flag_implement_inlines |
9c73ec84 | 10746 | && !DECL_VINDEX (decl1))); |
1f901793 JM |
10747 | |
10748 | /* For WIN32 we also want to put these in linkonce sections. */ | |
10749 | maybe_make_one_only (decl1); | |
10750 | } | |
db5ae43f | 10751 | else |
893de33c | 10752 | DECL_EXTERNAL (decl1) = 0; |
db5ae43f | 10753 | DECL_INTERFACE_KNOWN (decl1) = 1; |
4684cd27 | 10754 | /* If this function is in an interface implemented in this file, |
3b426391 | 10755 | make sure that the back end knows to emit this function |
4684cd27 MM |
10756 | here. */ |
10757 | if (!DECL_EXTERNAL (decl1)) | |
10758 | mark_needed (decl1); | |
8d08fdba | 10759 | } |
5d709b00 | 10760 | else if (finfo->interface_unknown && finfo->interface_only |
1ef0df47 | 10761 | && honor_interface) |
c16c47fb JM |
10762 | { |
10763 | /* If MULTIPLE_SYMBOL_SPACES is defined and we saw a #pragma | |
5d709b00 ZW |
10764 | interface, we will have both finfo->interface_unknown and |
10765 | finfo->interface_only set. In that case, we don't want to | |
10766 | use the normal heuristics because someone will supply a | |
10767 | #pragma implementation elsewhere, and deducing it here would | |
10768 | produce a conflict. */ | |
c16c47fb JM |
10769 | comdat_linkage (decl1); |
10770 | DECL_EXTERNAL (decl1) = 0; | |
10771 | DECL_INTERFACE_KNOWN (decl1) = 1; | |
10772 | DECL_DEFER_OUTPUT (decl1) = 1; | |
10773 | } | |
8d08fdba | 10774 | else |
a0a33927 MS |
10775 | { |
10776 | /* This is a definition, not a reference. | |
b7484fbe MS |
10777 | So clear DECL_EXTERNAL. */ |
10778 | DECL_EXTERNAL (decl1) = 0; | |
faae18ab | 10779 | |
caf93cb0 | 10780 | if ((DECL_DECLARED_INLINE_P (decl1) |
79065db2 | 10781 | || DECL_TEMPLATE_INSTANTIATION (decl1)) |
5566b478 MS |
10782 | && ! DECL_INTERFACE_KNOWN (decl1) |
10783 | /* Don't try to defer nested functions for now. */ | |
4f1c5b7d | 10784 | && ! decl_function_context (decl1)) |
878cd289 MS |
10785 | DECL_DEFER_OUTPUT (decl1) = 1; |
10786 | else | |
893de33c | 10787 | DECL_INTERFACE_KNOWN (decl1) = 1; |
db5ae43f | 10788 | } |
a9aedbc2 | 10789 | |
0ed5edac JM |
10790 | /* Determine the ELF visibility attribute for the function. We must not |
10791 | do this before calling "pushdecl", as we must allow "duplicate_decls" | |
10792 | to merge any attributes appropriately. We also need to wait until | |
10793 | linkage is set. */ | |
10794 | if (!DECL_CLONED_FUNCTION_P (decl1)) | |
10795 | determine_visibility (decl1); | |
10796 | ||
ac20c67a | 10797 | begin_scope (sk_function_parms, decl1); |
8d08fdba | 10798 | |
5566b478 MS |
10799 | ++function_depth; |
10800 | ||
44d10c10 PB |
10801 | if (DECL_DESTRUCTOR_P (decl1) |
10802 | || (DECL_CONSTRUCTOR_P (decl1) | |
10803 | && targetm.cxx.cdtor_returns_this ())) | |
46e8c075 | 10804 | { |
44d10c10 PB |
10805 | cdtor_label = build_decl (LABEL_DECL, NULL_TREE, NULL_TREE); |
10806 | DECL_CONTEXT (cdtor_label) = current_function_decl; | |
46e8c075 | 10807 | } |
8d08fdba | 10808 | |
0ba8a114 | 10809 | start_fname_decls (); |
caf93cb0 | 10810 | |
f444e36b | 10811 | store_parm_decls (current_function_parms); |
058b15c1 MM |
10812 | } |
10813 | ||
10814 | ||
10815 | /* Like start_preparsed_function, except that instead of a | |
10816 | FUNCTION_DECL, this function takes DECLSPECS and DECLARATOR. | |
10817 | ||
10818 | Returns 1 on success. If the DECLARATOR is not suitable for a function | |
10819 | (it defines a datum instead), we return 0, which tells | |
10820 | yyparse to report a parse error. */ | |
10821 | ||
10822 | int | |
caf93cb0 | 10823 | start_function (cp_decl_specifier_seq *declspecs, |
62d1db17 | 10824 | const cp_declarator *declarator, |
058b15c1 MM |
10825 | tree attrs) |
10826 | { | |
10827 | tree decl1; | |
10828 | ||
058b15c1 MM |
10829 | decl1 = grokdeclarator (declarator, declspecs, FUNCDEF, 1, &attrs); |
10830 | /* If the declarator is not suitable for a function definition, | |
10831 | cause a syntax error. */ | |
10832 | if (decl1 == NULL_TREE || TREE_CODE (decl1) != FUNCTION_DECL) | |
10833 | return 0; | |
caf93cb0 | 10834 | |
058b15c1 | 10835 | if (DECL_MAIN_P (decl1)) |
2cfe82fe ZW |
10836 | /* main must return int. grokfndecl should have corrected it |
10837 | (and issued a diagnostic) if the user got it wrong. */ | |
10838 | gcc_assert (same_type_p (TREE_TYPE (TREE_TYPE (decl1)), | |
10839 | integer_type_node)); | |
058b15c1 MM |
10840 | |
10841 | start_preparsed_function (decl1, attrs, /*flags=*/SF_DEFAULT); | |
f444e36b | 10842 | |
8d08fdba MS |
10843 | return 1; |
10844 | } | |
10845 | \f | |
68d04c67 MM |
10846 | /* Returns true iff an EH_SPEC_BLOCK should be created in the body of |
10847 | FN. */ | |
10848 | ||
10849 | static bool | |
10850 | use_eh_spec_block (tree fn) | |
10851 | { | |
10852 | return (flag_exceptions && flag_enforce_eh_specs | |
10853 | && !processing_template_decl | |
10854 | && TYPE_RAISES_EXCEPTIONS (TREE_TYPE (fn)) | |
10855 | /* We insert the EH_SPEC_BLOCK only in the original | |
10856 | function; then, it is copied automatically to the | |
10857 | clones. */ | |
10858 | && !DECL_CLONED_FUNCTION_P (fn) | |
10859 | /* Implicitly-generated constructors and destructors have | |
10860 | exception specifications. However, those specifications | |
10861 | are the union of the possible exceptions specified by the | |
10862 | constructors/destructors for bases and members, so no | |
10863 | unallowed exception will ever reach this function. By | |
10864 | not creating the EH_SPEC_BLOCK we save a little memory, | |
10865 | and we avoid spurious warnings about unreachable | |
10866 | code. */ | |
10867 | && !DECL_ARTIFICIAL (fn)); | |
10868 | } | |
10869 | ||
8d08fdba MS |
10870 | /* Store the parameter declarations into the current function declaration. |
10871 | This is called after parsing the parameter declarations, before | |
10872 | digesting the body of the function. | |
10873 | ||
10874 | Also install to binding contour return value identifier, if any. */ | |
10875 | ||
f444e36b | 10876 | static void |
11f6b451 | 10877 | store_parm_decls (tree current_function_parms) |
8d08fdba | 10878 | { |
926ce8bd KH |
10879 | tree fndecl = current_function_decl; |
10880 | tree parm; | |
8d08fdba | 10881 | |
8d08fdba MS |
10882 | /* This is a chain of any other decls that came in among the parm |
10883 | declarations. If a parm is declared with enum {foo, bar} x; | |
10884 | then CONST_DECLs for foo and bar are put here. */ | |
10885 | tree nonparms = NULL_TREE; | |
10886 | ||
b35d4555 | 10887 | if (current_function_parms) |
8d08fdba MS |
10888 | { |
10889 | /* This case is when the function was defined with an ANSI prototype. | |
10890 | The parms already have decls, so we need not do anything here | |
10891 | except record them as in effect | |
10892 | and complain if any redundant old-style parm decls were written. */ | |
10893 | ||
b35d4555 MM |
10894 | tree specparms = current_function_parms; |
10895 | tree next; | |
10896 | ||
f444e36b | 10897 | /* Must clear this because it might contain TYPE_DECLs declared |
b35d4555 | 10898 | at class level. */ |
00e8de68 | 10899 | current_binding_level->names = NULL; |
8d08fdba | 10900 | |
f444e36b | 10901 | /* If we're doing semantic analysis, then we'll call pushdecl |
b35d4555 MM |
10902 | for each of these. We must do them in reverse order so that |
10903 | they end in the correct forward order. */ | |
f444e36b | 10904 | specparms = nreverse (specparms); |
5566b478 | 10905 | |
b35d4555 | 10906 | for (parm = specparms; parm; parm = next) |
8d08fdba MS |
10907 | { |
10908 | next = TREE_CHAIN (parm); | |
10909 | if (TREE_CODE (parm) == PARM_DECL) | |
10910 | { | |
f444e36b MM |
10911 | if (DECL_NAME (parm) == NULL_TREE |
10912 | || TREE_CODE (parm) != VOID_TYPE) | |
10913 | pushdecl (parm); | |
10914 | else | |
2d01edd7 | 10915 | error ("parameter %qD declared void", parm); |
8d08fdba MS |
10916 | } |
10917 | else | |
10918 | { | |
10919 | /* If we find an enum constant or a type tag, | |
10920 | put it aside for the moment. */ | |
10921 | TREE_CHAIN (parm) = NULL_TREE; | |
10922 | nonparms = chainon (nonparms, parm); | |
10923 | } | |
10924 | } | |
10925 | ||
f444e36b MM |
10926 | /* Get the decls in their original chain order and record in the |
10927 | function. This is all and only the PARM_DECLs that were | |
10928 | pushed into scope by the loop above. */ | |
10929 | DECL_ARGUMENTS (fndecl) = getdecls (); | |
8d08fdba MS |
10930 | } |
10931 | else | |
10932 | DECL_ARGUMENTS (fndecl) = NULL_TREE; | |
10933 | ||
10934 | /* Now store the final chain of decls for the arguments | |
10935 | as the decl-chain of the current lexical scope. | |
10936 | Put the enumerators in as well, at the front so that | |
10937 | DECL_ARGUMENTS is not modified. */ | |
00e8de68 | 10938 | current_binding_level->names = chainon (nonparms, DECL_ARGUMENTS (fndecl)); |
eb448459 | 10939 | |
68d04c67 MM |
10940 | if (use_eh_spec_block (current_function_decl)) |
10941 | current_eh_spec_block = begin_eh_spec_block (); | |
8d08fdba MS |
10942 | } |
10943 | ||
8d08fdba | 10944 | \f |
59026e79 MM |
10945 | /* We have finished doing semantic analysis on DECL, but have not yet |
10946 | generated RTL for its body. Save away our current state, so that | |
10947 | when we want to generate RTL later we know what to do. */ | |
10948 | ||
10949 | static void | |
11f6b451 | 10950 | save_function_data (tree decl) |
59026e79 | 10951 | { |
e2500fed | 10952 | struct language_function *f; |
59026e79 MM |
10953 | |
10954 | /* Save the language-specific per-function data so that we can | |
10955 | get it back when we really expand this function. */ | |
50bc768d | 10956 | gcc_assert (!DECL_PENDING_INLINE_P (decl)); |
68642fb6 | 10957 | |
59026e79 | 10958 | /* Make a copy. */ |
99dd239f | 10959 | f = GGC_NEW (struct language_function); |
e2500fed | 10960 | memcpy (f, cp_function_chain, sizeof (struct language_function)); |
59026e79 MM |
10961 | DECL_SAVED_FUNCTION_DATA (decl) = f; |
10962 | ||
10963 | /* Clear out the bits we don't need. */ | |
325c3691 | 10964 | f->base.x_stmt_tree.x_cur_stmt_list = NULL_TREE; |
59026e79 | 10965 | f->bindings = NULL; |
8e4ce833 | 10966 | f->x_local_names = NULL; |
59026e79 MM |
10967 | } |
10968 | ||
cdd2559c | 10969 | |
44d10c10 | 10970 | /* Set the return value of the constructor (if present). */ |
efee38a9 MM |
10971 | |
10972 | static void | |
11f6b451 | 10973 | finish_constructor_body (void) |
efee38a9 | 10974 | { |
44d10c10 PB |
10975 | tree val; |
10976 | tree exprstmt; | |
10977 | ||
10978 | if (targetm.cxx.cdtor_returns_this ()) | |
10979 | { | |
10980 | /* Any return from a constructor will end up here. */ | |
10981 | add_stmt (build_stmt (LABEL_EXPR, cdtor_label)); | |
10982 | ||
10983 | val = DECL_ARGUMENTS (current_function_decl); | |
f293ce4b RS |
10984 | val = build2 (MODIFY_EXPR, TREE_TYPE (val), |
10985 | DECL_RESULT (current_function_decl), val); | |
44d10c10 PB |
10986 | /* Return the address of the object. */ |
10987 | exprstmt = build_stmt (RETURN_EXPR, val); | |
10988 | add_stmt (exprstmt); | |
10989 | } | |
efee38a9 MM |
10990 | } |
10991 | ||
cdd2559c JM |
10992 | /* Do all the processing for the beginning of a destructor; set up the |
10993 | vtable pointers and cleanups for bases and members. */ | |
10994 | ||
10995 | static void | |
11f6b451 | 10996 | begin_destructor_body (void) |
cdd2559c | 10997 | { |
cdd2559c JM |
10998 | tree compound_stmt; |
10999 | ||
0e686aa6 MM |
11000 | /* If the CURRENT_CLASS_TYPE is incomplete, we will have already |
11001 | issued an error message. We still want to try to process the | |
11002 | body of the function, but initialize_vtbl_ptrs will crash if | |
11003 | TYPE_BINFO is NULL. */ | |
11004 | if (COMPLETE_TYPE_P (current_class_type)) | |
11005 | { | |
11006 | compound_stmt = begin_compound_stmt (0); | |
11007 | /* Make all virtual function table pointers in non-virtual base | |
11008 | classes point to CURRENT_CLASS_TYPE's virtual function | |
11009 | tables. */ | |
11010 | initialize_vtbl_ptrs (current_class_ptr); | |
11011 | finish_compound_stmt (compound_stmt); | |
3db45ab5 | 11012 | |
0e686aa6 MM |
11013 | /* And insert cleanups for our bases and members so that they |
11014 | will be properly destroyed if we throw. */ | |
11015 | push_base_cleanups (); | |
11016 | } | |
cdd2559c JM |
11017 | } |
11018 | ||
ade3dc07 JM |
11019 | /* At the end of every destructor we generate code to delete the object if |
11020 | necessary. Do that now. */ | |
9bfadf57 MM |
11021 | |
11022 | static void | |
11f6b451 | 11023 | finish_destructor_body (void) |
9bfadf57 | 11024 | { |
9bfadf57 MM |
11025 | tree exprstmt; |
11026 | ||
5633b37c MM |
11027 | /* Any return from a destructor will end up here; that way all base |
11028 | and member cleanups will be run when the function returns. */ | |
44d10c10 | 11029 | add_stmt (build_stmt (LABEL_EXPR, cdtor_label)); |
5633b37c | 11030 | |
52682a1b MM |
11031 | /* In a virtual destructor, we must call delete. */ |
11032 | if (DECL_VIRTUAL_P (current_function_decl)) | |
11033 | { | |
11034 | tree if_stmt; | |
fa72b064 | 11035 | tree virtual_size = cxx_sizeof (current_class_type); |
68642fb6 | 11036 | |
52682a1b | 11037 | /* [class.dtor] |
68642fb6 | 11038 | |
ade3dc07 JM |
11039 | At the point of definition of a virtual destructor (including |
11040 | an implicit definition), non-placement operator delete shall | |
11041 | be looked up in the scope of the destructor's class and if | |
11042 | found shall be accessible and unambiguous. */ | |
3db45ab5 | 11043 | exprstmt = build_op_delete_call(DELETE_EXPR, current_class_ptr, |
63c9a190 | 11044 | virtual_size, |
3db45ab5 MS |
11045 | /*global_p=*/false, |
11046 | /*placement=*/NULL_TREE, | |
63c9a190 | 11047 | /*alloc_fn=*/NULL_TREE); |
298d6f60 | 11048 | |
52682a1b | 11049 | if_stmt = begin_if_stmt (); |
f293ce4b RS |
11050 | finish_if_stmt_cond (build2 (BIT_AND_EXPR, integer_type_node, |
11051 | current_in_charge_parm, | |
11052 | integer_one_node), | |
52682a1b MM |
11053 | if_stmt); |
11054 | finish_expr_stmt (exprstmt); | |
11055 | finish_then_clause (if_stmt); | |
325c3691 | 11056 | finish_if_stmt (if_stmt); |
52682a1b | 11057 | } |
44d10c10 PB |
11058 | |
11059 | if (targetm.cxx.cdtor_returns_this ()) | |
11060 | { | |
11061 | tree val; | |
11062 | ||
11063 | val = DECL_ARGUMENTS (current_function_decl); | |
f293ce4b RS |
11064 | val = build2 (MODIFY_EXPR, TREE_TYPE (val), |
11065 | DECL_RESULT (current_function_decl), val); | |
44d10c10 PB |
11066 | /* Return the address of the object. */ |
11067 | exprstmt = build_stmt (RETURN_EXPR, val); | |
11068 | add_stmt (exprstmt); | |
11069 | } | |
ade3dc07 | 11070 | } |
9bfadf57 | 11071 | |
ade3dc07 JM |
11072 | /* Do the necessary processing for the beginning of a function body, which |
11073 | in this case includes member-initializers, but not the catch clauses of | |
11074 | a function-try-block. Currently, this means opening a binding level | |
86ad3aa9 | 11075 | for the member-initializers (in a ctor) and member cleanups (in a dtor). */ |
ade3dc07 JM |
11076 | |
11077 | tree | |
11f6b451 | 11078 | begin_function_body (void) |
ade3dc07 | 11079 | { |
cdd2559c JM |
11080 | tree stmt; |
11081 | ||
86ad3aa9 JM |
11082 | if (! FUNCTION_NEEDS_BODY_BLOCK (current_function_decl)) |
11083 | return NULL_TREE; | |
11084 | ||
b5856475 JM |
11085 | if (processing_template_decl) |
11086 | /* Do nothing now. */; | |
11087 | else | |
11088 | /* Always keep the BLOCK node associated with the outermost pair of | |
11089 | curly braces of a function. These are needed for correct | |
11090 | operation of dwarfout.c. */ | |
ac20c67a | 11091 | keep_next_level (true); |
b5856475 | 11092 | |
325c3691 | 11093 | stmt = begin_compound_stmt (BCS_FN_BODY); |
cdd2559c JM |
11094 | |
11095 | if (processing_template_decl) | |
11096 | /* Do nothing now. */; | |
cdd2559c JM |
11097 | else if (DECL_DESTRUCTOR_P (current_function_decl)) |
11098 | begin_destructor_body (); | |
11099 | ||
ade3dc07 | 11100 | return stmt; |
9bfadf57 MM |
11101 | } |
11102 | ||
ade3dc07 JM |
11103 | /* Do the processing for the end of a function body. Currently, this means |
11104 | closing out the cleanups for fully-constructed bases and members, and in | |
11105 | the case of the destructor, deleting the object if desired. Again, this | |
11106 | is only meaningful for [cd]tors, since they are the only functions where | |
11107 | there is a significant distinction between the main body and any | |
11108 | function catch clauses. Handling, say, main() return semantics here | |
11109 | would be wrong, as flowing off the end of a function catch clause for | |
11110 | main() would also need to return 0. */ | |
11111 | ||
11112 | void | |
11f6b451 | 11113 | finish_function_body (tree compstmt) |
ade3dc07 | 11114 | { |
86ad3aa9 JM |
11115 | if (compstmt == NULL_TREE) |
11116 | return; | |
3db45ab5 | 11117 | |
5633b37c | 11118 | /* Close the block. */ |
7a3397c7 | 11119 | finish_compound_stmt (compstmt); |
ade3dc07 JM |
11120 | |
11121 | if (processing_template_decl) | |
11122 | /* Do nothing now. */; | |
11123 | else if (DECL_CONSTRUCTOR_P (current_function_decl)) | |
11124 | finish_constructor_body (); | |
11125 | else if (DECL_DESTRUCTOR_P (current_function_decl)) | |
11126 | finish_destructor_body (); | |
caf93cb0 | 11127 | } |
ade3dc07 | 11128 | |
86ad3aa9 JM |
11129 | /* Given a function, returns the BLOCK corresponding to the outermost level |
11130 | of curly braces, skipping the artificial block created for constructor | |
11131 | initializers. */ | |
11132 | ||
11133 | static tree | |
11134 | outer_curly_brace_block (tree fndecl) | |
11135 | { | |
11136 | tree block = BLOCK_SUBBLOCKS (DECL_INITIAL (fndecl)); | |
11137 | if (FUNCTION_NEEDS_BODY_BLOCK (current_function_decl)) | |
11138 | /* Skip the artificial function body block. */ | |
11139 | block = BLOCK_SUBBLOCKS (block); | |
11140 | return block; | |
11141 | } | |
11142 | ||
8d08fdba MS |
11143 | /* Finish up a function declaration and compile that function |
11144 | all the way to assembler language output. The free the storage | |
11145 | for the function definition. | |
11146 | ||
68642fb6 | 11147 | FLAGS is a bitwise or of the following values: |
f181d4ae MM |
11148 | 2 - INCLASS_INLINE |
11149 | We just finished processing the body of an in-class inline | |
11150 | function definition. (This processing will have taken place | |
87e3dbc9 | 11151 | after the class definition is complete.) */ |
8d08fdba | 11152 | |
4d6abc1c | 11153 | tree |
11f6b451 | 11154 | finish_function (int flags) |
8d08fdba | 11155 | { |
926ce8bd | 11156 | tree fndecl = current_function_decl; |
8d08fdba | 11157 | tree fntype, ctype = NULL_TREE; |
f181d4ae | 11158 | int inclass_inline = (flags & 2) != 0; |
87e3dbc9 | 11159 | int nested; |
8d08fdba MS |
11160 | |
11161 | /* When we get some parse errors, we can end up without a | |
11162 | current_function_decl, so cope. */ | |
11163 | if (fndecl == NULL_TREE) | |
4d6abc1c | 11164 | return error_mark_node; |
8d08fdba | 11165 | |
9aad8f83 MA |
11166 | if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fndecl) |
11167 | && DECL_VIRTUAL_P (fndecl) | |
11168 | && !processing_template_decl) | |
11169 | { | |
11170 | tree fnclass = DECL_CONTEXT (fndecl); | |
11171 | if (fndecl == CLASSTYPE_KEY_METHOD (fnclass)) | |
11172 | keyed_classes = tree_cons (NULL_TREE, fnclass, keyed_classes); | |
11173 | } | |
11174 | ||
87e3dbc9 | 11175 | nested = function_depth > 1; |
8d08fdba MS |
11176 | fntype = TREE_TYPE (fndecl); |
11177 | ||
9bfadf57 MM |
11178 | /* TREE_READONLY (fndecl) = 1; |
11179 | This caused &foo to be of type ptr-to-const-function | |
11180 | which then got a warning when stored in a ptr-to-function variable. */ | |
8d08fdba | 11181 | |
50bc768d | 11182 | gcc_assert (building_stmt_tree ()); |
72c4a4ca GK |
11183 | /* The current function is being defined, so its DECL_INITIAL should |
11184 | be set, and unless there's a multiple definition, it should be | |
11185 | error_mark_node. */ | |
11186 | gcc_assert (DECL_INITIAL (fndecl) == error_mark_node); | |
caf93cb0 | 11187 | |
db9b2174 MM |
11188 | /* For a cloned function, we've already got all the code we need; |
11189 | there's no need to add any extra bits. */ | |
f444e36b | 11190 | if (!DECL_CLONED_FUNCTION_P (fndecl)) |
8d08fdba | 11191 | { |
ade3dc07 | 11192 | if (DECL_MAIN_P (current_function_decl)) |
efee38a9 | 11193 | { |
43e05e45 SB |
11194 | tree stmt; |
11195 | ||
11196 | /* Make it so that `main' always returns 0 by default (or | |
11197 | 1 for VMS). */ | |
08c7ae5a | 11198 | #if VMS_TARGET |
43e05e45 | 11199 | stmt = finish_return_stmt (integer_one_node); |
efee38a9 | 11200 | #else |
43e05e45 | 11201 | stmt = finish_return_stmt (integer_zero_node); |
efee38a9 | 11202 | #endif |
43e05e45 SB |
11203 | /* Hack. We don't want the middle-end to warn that this |
11204 | return is unreachable, so put the statement on the | |
11205 | special line 0. */ | |
176a0aad PB |
11206 | #ifdef USE_MAPPED_LOCATION |
11207 | SET_EXPR_LOCATION (stmt, UNKNOWN_LOCATION); | |
11208 | #else | |
43e05e45 | 11209 | annotate_with_file_line (stmt, input_filename, 0); |
176a0aad | 11210 | #endif |
efee38a9 | 11211 | } |
87e3dbc9 | 11212 | |
68d04c67 | 11213 | if (use_eh_spec_block (current_function_decl)) |
52a11cbf RH |
11214 | finish_eh_spec_block (TYPE_RAISES_EXCEPTIONS |
11215 | (TREE_TYPE (current_function_decl)), | |
11216 | current_eh_spec_block); | |
5566b478 | 11217 | } |
68642fb6 | 11218 | |
558475f0 | 11219 | /* If we're saving up tree structure, tie off the function now. */ |
325c3691 RH |
11220 | DECL_SAVED_TREE (fndecl) = pop_stmt_list (DECL_SAVED_TREE (fndecl)); |
11221 | ||
11222 | finish_fname_decls (); | |
8d2733ca | 11223 | |
b2dd096b MM |
11224 | /* If this function can't throw any exceptions, remember that. */ |
11225 | if (!processing_template_decl | |
11226 | && !cp_function_chain->can_throw | |
be0436d7 RG |
11227 | && !flag_non_call_exceptions |
11228 | && targetm.binds_local_p (fndecl)) | |
b2dd096b MM |
11229 | TREE_NOTHROW (fndecl) = 1; |
11230 | ||
8d08fdba MS |
11231 | /* This must come after expand_function_end because cleanups might |
11232 | have declarations (from inline functions) that need to go into | |
11233 | this function's blocks. */ | |
caf93cb0 | 11234 | |
7437519c ZW |
11235 | /* If the current binding level isn't the outermost binding level |
11236 | for this function, either there is a bug, or we have experienced | |
11237 | syntax errors and the statement tree is malformed. */ | |
a7e8c268 | 11238 | if (current_binding_level->kind != sk_function_parms) |
7437519c ZW |
11239 | { |
11240 | /* Make sure we have already experienced errors. */ | |
8dc2b103 | 11241 | gcc_assert (errorcount); |
7437519c ZW |
11242 | |
11243 | /* Throw away the broken statement tree and extra binding | |
0cbd7506 | 11244 | levels. */ |
5882f0f3 | 11245 | DECL_SAVED_TREE (fndecl) = alloc_stmt_list (); |
7437519c | 11246 | |
a7e8c268 | 11247 | while (current_binding_level->kind != sk_function_parms) |
7437519c | 11248 | { |
a7e8c268 | 11249 | if (current_binding_level->kind == sk_class) |
7437519c ZW |
11250 | pop_nested_class (); |
11251 | else | |
11252 | poplevel (0, 0, 0); | |
11253 | } | |
11254 | } | |
f444e36b | 11255 | poplevel (1, 0, 1); |
8d08fdba | 11256 | |
4985cde3 RH |
11257 | /* Statements should always be full-expressions at the outermost set |
11258 | of curly braces for a function. */ | |
50bc768d | 11259 | gcc_assert (stmts_are_full_exprs_p ()); |
4985cde3 | 11260 | |
6de9cd9a DN |
11261 | /* Set up the named return value optimization, if we can. Candidate |
11262 | variables are selected in check_return_value. */ | |
07b2f2fd JM |
11263 | if (current_function_return_value) |
11264 | { | |
11265 | tree r = current_function_return_value; | |
35e939ae JM |
11266 | tree outer; |
11267 | ||
07b2f2fd | 11268 | if (r != error_mark_node |
35e939ae JM |
11269 | /* This is only worth doing for fns that return in memory--and |
11270 | simpler, since we don't have to worry about promoted modes. */ | |
61f71b34 | 11271 | && aggregate_value_p (TREE_TYPE (TREE_TYPE (fndecl)), fndecl) |
35e939ae JM |
11272 | /* Only allow this for variables declared in the outer scope of |
11273 | the function so we know that their lifetime always ends with a | |
11274 | return; see g++.dg/opt/nrv6.C. We could be more flexible if | |
11275 | we were to do this optimization in tree-ssa. */ | |
86ad3aa9 | 11276 | && (outer = outer_curly_brace_block (fndecl)) |
325c3691 | 11277 | && chain_member (r, BLOCK_VARS (outer))) |
6de9cd9a DN |
11278 | finalize_nrv (&DECL_SAVED_TREE (fndecl), r, DECL_RESULT (fndecl)); |
11279 | ||
11280 | current_function_return_value = NULL_TREE; | |
07b2f2fd JM |
11281 | } |
11282 | ||
a8f73d4b | 11283 | /* Remember that we were in class scope. */ |
db5ae43f | 11284 | if (current_class_name) |
a8f73d4b | 11285 | ctype = current_class_type; |
db5ae43f | 11286 | |
1caa11d3 MM |
11287 | /* Must mark the RESULT_DECL as being in this function. */ |
11288 | DECL_CONTEXT (DECL_RESULT (fndecl)) = fndecl; | |
11289 | ||
11290 | /* Set the BLOCK_SUPERCONTEXT of the outermost function scope to point | |
11291 | to the FUNCTION_DECL node itself. */ | |
11292 | BLOCK_SUPERCONTEXT (DECL_INITIAL (fndecl)) = fndecl; | |
11293 | ||
59026e79 | 11294 | /* Save away current state, if appropriate. */ |
f444e36b | 11295 | if (!processing_template_decl) |
59026e79 MM |
11296 | save_function_data (fndecl); |
11297 | ||
efe49da0 | 11298 | /* Complain if there's just no return statement. */ |
46cfb101 | 11299 | if (warn_return_type |
efe49da0 | 11300 | && TREE_CODE (TREE_TYPE (fntype)) != VOID_TYPE |
c1b83cc9 | 11301 | && !dependent_type_p (TREE_TYPE (fntype)) |
57d5032b | 11302 | && !current_function_returns_value && !current_function_returns_null |
efe49da0 JM |
11303 | /* Don't complain if we abort or throw. */ |
11304 | && !current_function_returns_abnormally | |
55e99d52 | 11305 | && !DECL_NAME (DECL_RESULT (fndecl)) |
46cfb101 | 11306 | /* Normally, with -Wreturn-type, flow will complain. Unless we're an |
efe49da0 | 11307 | inline function, as we might never be compiled separately. */ |
44d10c10 PB |
11308 | && (DECL_INLINE (fndecl) || processing_template_decl) |
11309 | /* Structor return values (if any) are set by the compiler. */ | |
11310 | && !DECL_CONSTRUCTOR_P (fndecl) | |
11311 | && !DECL_DESTRUCTOR_P (fndecl)) | |
b323323f | 11312 | warning (OPT_Wreturn_type, "no return statement in function returning non-void"); |
4985cde3 | 11313 | |
6de9cd9a DN |
11314 | /* Store the end of the function, so that we get good line number |
11315 | info for the epilogue. */ | |
11316 | cfun->function_end_locus = input_location; | |
11317 | ||
11318 | /* Genericize before inlining. */ | |
11319 | if (!processing_template_decl) | |
11320 | { | |
37e6d6fe | 11321 | struct language_function *f = DECL_SAVED_FUNCTION_DATA (fndecl); |
5a508662 | 11322 | cp_genericize (fndecl); |
37e6d6fe JH |
11323 | /* Clear out the bits we don't need. */ |
11324 | f->x_current_class_ptr = NULL; | |
11325 | f->x_current_class_ref = NULL; | |
11326 | f->x_eh_spec_block = NULL; | |
11327 | f->x_in_charge_parm = NULL; | |
11328 | f->x_vtt_parm = NULL; | |
11329 | f->x_return_value = NULL; | |
11330 | f->bindings = NULL; | |
10827cd8 | 11331 | f->extern_decl_map = NULL; |
6de9cd9a DN |
11332 | |
11333 | /* Handle attribute((warn_unused_result)). Relies on gimple input. */ | |
11334 | c_warn_unused_result (&DECL_SAVED_TREE (fndecl)); | |
11335 | } | |
37e6d6fe JH |
11336 | /* Clear out the bits we don't need. */ |
11337 | local_names = NULL; | |
6de9cd9a DN |
11338 | |
11339 | /* We're leaving the context of this function, so zap cfun. It's still in | |
11340 | DECL_STRUCT_FUNCTION, and we'll restore it in tree_rest_of_compilation. */ | |
f444e36b | 11341 | cfun = NULL; |
c1f927e8 | 11342 | current_function_decl = NULL; |
a8f73d4b | 11343 | |
27631dae | 11344 | /* If this is an in-class inline definition, we may have to pop the |
a8f73d4b MM |
11345 | bindings for the template parameters that we added in |
11346 | maybe_begin_member_template_processing when start_function was | |
11347 | called. */ | |
11348 | if (inclass_inline) | |
11349 | maybe_end_member_template_processing (); | |
11350 | ||
11351 | /* Leave the scope of the class. */ | |
11352 | if (ctype) | |
11353 | pop_nested_class (); | |
5566b478 MS |
11354 | |
11355 | --function_depth; | |
8d08fdba | 11356 | |
4d6abc1c | 11357 | /* Clean up. */ |
28cbf42c | 11358 | if (! nested) |
1f8f4a0b MM |
11359 | /* Let the error reporting routines know that we're outside a |
11360 | function. For a nested function, this value is used in | |
b03e38e1 | 11361 | cxx_pop_function_context and then reset via pop_function_context. */ |
1f8f4a0b | 11362 | current_function_decl = NULL_TREE; |
4d6abc1c MM |
11363 | |
11364 | return fndecl; | |
8d08fdba MS |
11365 | } |
11366 | \f | |
11367 | /* Create the FUNCTION_DECL for a function definition. | |
8d08fdba MS |
11368 | DECLSPECS and DECLARATOR are the parts of the declaration; |
11369 | they describe the return type and the name of the function, | |
11370 | but twisted together in a fashion that parallels the syntax of C. | |
11371 | ||
11372 | This function creates a binding context for the function body | |
11373 | as well as setting up the FUNCTION_DECL in current_function_decl. | |
11374 | ||
11375 | Returns a FUNCTION_DECL on success. | |
11376 | ||
11377 | If the DECLARATOR is not suitable for a function (it defines a datum | |
11378 | instead), we return 0, which tells yyparse to report a parse error. | |
11379 | ||
11380 | May return void_type_node indicating that this method is actually | |
11381 | a friend. See grokfield for more details. | |
11382 | ||
11383 | Came here with a `.pushlevel' . | |
11384 | ||
11385 | DO NOT MAKE ANY CHANGES TO THIS CODE WITHOUT MAKING CORRESPONDING | |
11386 | CHANGES TO CODE IN `grokfield'. */ | |
e92cc029 | 11387 | |
8d08fdba | 11388 | tree |
caf93cb0 | 11389 | start_method (cp_decl_specifier_seq *declspecs, |
0cbd7506 | 11390 | const cp_declarator *declarator, tree attrlist) |
8d08fdba | 11391 | { |
c11b6f21 | 11392 | tree fndecl = grokdeclarator (declarator, declspecs, MEMFUNCDEF, 0, |
91d231cb | 11393 | &attrlist); |
8d08fdba | 11394 | |
a723baf1 MM |
11395 | if (fndecl == error_mark_node) |
11396 | return error_mark_node; | |
11397 | ||
11398 | if (fndecl == NULL || TREE_CODE (fndecl) != FUNCTION_DECL) | |
11399 | { | |
11400 | error ("invalid member function declaration"); | |
11401 | return error_mark_node; | |
11402 | } | |
8d08fdba | 11403 | |
195a5def IR |
11404 | if (attrlist) |
11405 | cplus_decl_attributes (&fndecl, attrlist, 0); | |
11406 | ||
8d08fdba | 11407 | /* Pass friends other than inline friend functions back. */ |
a1774733 | 11408 | if (fndecl == void_type_node) |
8d08fdba MS |
11409 | return fndecl; |
11410 | ||
8d08fdba MS |
11411 | if (DECL_IN_AGGR_P (fndecl)) |
11412 | { | |
58ec3cc5 | 11413 | if (DECL_CONTEXT (fndecl) |
6d69fe27 | 11414 | && TREE_CODE (DECL_CONTEXT (fndecl)) != NAMESPACE_DECL) |
2d01edd7 | 11415 | error ("%qD is already defined in class %qT", fndecl, |
58ec3cc5 | 11416 | DECL_CONTEXT (fndecl)); |
8ca4bf25 | 11417 | return error_mark_node; |
8d08fdba MS |
11418 | } |
11419 | ||
f3400fe2 JM |
11420 | check_template_shadow (fndecl); |
11421 | ||
79065db2 | 11422 | DECL_DECLARED_INLINE_P (fndecl) = 1; |
8926095f | 11423 | if (flag_default_inline) |
8d08fdba MS |
11424 | DECL_INLINE (fndecl) = 1; |
11425 | ||
36a117a5 MM |
11426 | /* We process method specializations in finish_struct_1. */ |
11427 | if (processing_template_decl && !DECL_TEMPLATE_SPECIALIZATION (fndecl)) | |
4b0d3cbe MM |
11428 | { |
11429 | fndecl = push_template_decl (fndecl); | |
11430 | if (fndecl == error_mark_node) | |
11431 | return fndecl; | |
11432 | } | |
a0a33927 | 11433 | |
8d08fdba MS |
11434 | if (! DECL_FRIEND_P (fndecl)) |
11435 | { | |
8d08fdba MS |
11436 | if (TREE_CHAIN (fndecl)) |
11437 | { | |
11438 | fndecl = copy_node (fndecl); | |
11439 | TREE_CHAIN (fndecl) = NULL_TREE; | |
11440 | } | |
8d08fdba MS |
11441 | } |
11442 | ||
d174af6c | 11443 | finish_decl (fndecl, NULL_TREE, NULL_TREE); |
8d08fdba | 11444 | |
f4f206f4 | 11445 | /* Make a place for the parms. */ |
ac20c67a | 11446 | begin_scope (sk_function_parms, fndecl); |
68642fb6 | 11447 | |
8d08fdba MS |
11448 | DECL_IN_AGGR_P (fndecl) = 1; |
11449 | return fndecl; | |
11450 | } | |
11451 | ||
11452 | /* Go through the motions of finishing a function definition. | |
11453 | We don't compile this method until after the whole class has | |
11454 | been processed. | |
11455 | ||
11456 | FINISH_METHOD must return something that looks as though it | |
11457 | came from GROKFIELD (since we are defining a method, after all). | |
11458 | ||
11459 | This is called after parsing the body of the function definition. | |
11460 | STMTS is the chain of statements that makes up the function body. | |
11461 | ||
11462 | DECL is the ..._DECL that `start_method' provided. */ | |
11463 | ||
11464 | tree | |
11f6b451 | 11465 | finish_method (tree decl) |
8d08fdba | 11466 | { |
926ce8bd | 11467 | tree fndecl = decl; |
8d08fdba | 11468 | tree old_initial; |
8d08fdba | 11469 | |
926ce8bd | 11470 | tree link; |
8d08fdba | 11471 | |
a1774733 | 11472 | if (decl == void_type_node) |
8d08fdba MS |
11473 | return decl; |
11474 | ||
11475 | old_initial = DECL_INITIAL (fndecl); | |
11476 | ||
11477 | /* Undo the level for the parms (from start_method). | |
11478 | This is like poplevel, but it causes nothing to be | |
11479 | saved. Saving information here confuses symbol-table | |
11480 | output routines. Besides, this information will | |
11481 | be correctly output when this method is actually | |
11482 | compiled. */ | |
11483 | ||
11484 | /* Clear out the meanings of the local variables of this level; | |
11485 | also record in each decl which block it belongs to. */ | |
11486 | ||
11487 | for (link = current_binding_level->names; link; link = TREE_CHAIN (link)) | |
11488 | { | |
11489 | if (DECL_NAME (link) != NULL_TREE) | |
d8f8dca1 | 11490 | pop_binding (DECL_NAME (link), link); |
50bc768d | 11491 | gcc_assert (TREE_CODE (link) != FUNCTION_DECL); |
8d08fdba MS |
11492 | DECL_CONTEXT (link) = NULL_TREE; |
11493 | } | |
11494 | ||
8d08fdba MS |
11495 | poplevel (0, 0, 0); |
11496 | ||
11497 | DECL_INITIAL (fndecl) = old_initial; | |
11498 | ||
11499 | /* We used to check if the context of FNDECL was different from | |
11500 | current_class_type as another way to get inside here. This didn't work | |
11501 | for String.cc in libg++. */ | |
11502 | if (DECL_FRIEND_P (fndecl)) | |
11503 | { | |
d4e6fecb | 11504 | VEC_safe_push (tree, gc, CLASSTYPE_INLINE_FRIENDS (current_class_type), |
585b44d3 | 11505 | fndecl); |
8d08fdba MS |
11506 | decl = void_type_node; |
11507 | } | |
11508 | ||
11509 | return decl; | |
11510 | } | |
11511 | \f | |
0154eaa8 MM |
11512 | |
11513 | /* VAR is a VAR_DECL. If its type is incomplete, remember VAR so that | |
11514 | we can lay it out later, when and if its type becomes complete. */ | |
8d08fdba MS |
11515 | |
11516 | void | |
11f6b451 | 11517 | maybe_register_incomplete_var (tree var) |
8d08fdba | 11518 | { |
50bc768d | 11519 | gcc_assert (TREE_CODE (var) == VAR_DECL); |
8d08fdba | 11520 | |
0154eaa8 | 11521 | /* Keep track of variables with incomplete types. */ |
caf93cb0 | 11522 | if (!processing_template_decl && TREE_TYPE (var) != error_mark_node |
0154eaa8 | 11523 | && DECL_EXTERNAL (var)) |
70adf8a9 | 11524 | { |
0154eaa8 | 11525 | tree inner_type = TREE_TYPE (var); |
caf93cb0 | 11526 | |
0154eaa8 MM |
11527 | while (TREE_CODE (inner_type) == ARRAY_TYPE) |
11528 | inner_type = TREE_TYPE (inner_type); | |
11529 | inner_type = TYPE_MAIN_VARIANT (inner_type); | |
caf93cb0 | 11530 | |
0154eaa8 MM |
11531 | if ((!COMPLETE_TYPE_P (inner_type) && CLASS_TYPE_P (inner_type)) |
11532 | /* RTTI TD entries are created while defining the type_info. */ | |
11533 | || (TYPE_LANG_SPECIFIC (inner_type) | |
11534 | && TYPE_BEING_DEFINED (inner_type))) | |
11535 | incomplete_vars = tree_cons (inner_type, var, incomplete_vars); | |
70adf8a9 | 11536 | } |
0154eaa8 | 11537 | } |
70adf8a9 | 11538 | |
0154eaa8 MM |
11539 | /* Called when a class type (given by TYPE) is defined. If there are |
11540 | any existing VAR_DECLs whose type hsa been completed by this | |
11541 | declaration, update them now. */ | |
70adf8a9 | 11542 | |
0154eaa8 | 11543 | void |
11f6b451 | 11544 | complete_vars (tree type) |
0154eaa8 MM |
11545 | { |
11546 | tree *list = &incomplete_vars; | |
11547 | ||
50bc768d | 11548 | gcc_assert (CLASS_TYPE_P (type)); |
caf93cb0 | 11549 | while (*list) |
0154eaa8 MM |
11550 | { |
11551 | if (same_type_p (type, TREE_PURPOSE (*list))) | |
70adf8a9 | 11552 | { |
0154eaa8 | 11553 | tree var = TREE_VALUE (*list); |
67935995 | 11554 | tree type = TREE_TYPE (var); |
c740732f MM |
11555 | /* Complete the type of the variable. The VAR_DECL itself |
11556 | will be laid out in expand_expr. */ | |
67935995 MM |
11557 | complete_type (type); |
11558 | cp_apply_type_quals_to_decl (cp_type_quals (type), var); | |
0154eaa8 MM |
11559 | /* Remove this entry from the list. */ |
11560 | *list = TREE_CHAIN (*list); | |
f30432d7 MS |
11561 | } |
11562 | else | |
0154eaa8 | 11563 | list = &TREE_CHAIN (*list); |
f30432d7 | 11564 | } |
7fb213d8 GB |
11565 | |
11566 | /* Check for pending declarations which may have abstract type. */ | |
11567 | complete_type_check_abstract (type); | |
8d08fdba MS |
11568 | } |
11569 | ||
86f45d2c MM |
11570 | /* If DECL is of a type which needs a cleanup, build that cleanup |
11571 | here. */ | |
e92cc029 | 11572 | |
86f45d2c | 11573 | tree |
11f6b451 | 11574 | cxx_maybe_build_cleanup (tree decl) |
8d08fdba MS |
11575 | { |
11576 | tree type = TREE_TYPE (decl); | |
86f45d2c | 11577 | |
834c6dff | 11578 | if (type != error_mark_node && TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type)) |
8d08fdba | 11579 | { |
80048418 | 11580 | int flags = LOOKUP_NORMAL|LOOKUP_DESTRUCTOR; |
8d08fdba | 11581 | tree rval; |
5775a06a NS |
11582 | bool has_vbases = (TREE_CODE (type) == RECORD_TYPE |
11583 | && CLASSTYPE_VBASECLASSES (type)); | |
8d08fdba | 11584 | |
8d08fdba MS |
11585 | if (TREE_CODE (type) == ARRAY_TYPE) |
11586 | rval = decl; | |
11587 | else | |
11588 | { | |
dffd7eb6 | 11589 | cxx_mark_addressable (decl); |
8d08fdba MS |
11590 | rval = build_unary_op (ADDR_EXPR, decl, 0); |
11591 | } | |
11592 | ||
11593 | /* Optimize for space over speed here. */ | |
5775a06a | 11594 | if (!has_vbases || flag_expensive_optimizations) |
8d08fdba MS |
11595 | flags |= LOOKUP_NONVIRTUAL; |
11596 | ||
86f45d2c MM |
11597 | rval = build_delete (TREE_TYPE (rval), rval, |
11598 | sfk_complete_destructor, flags, 0); | |
8d08fdba | 11599 | |
8d08fdba MS |
11600 | return rval; |
11601 | } | |
6e4ae815 | 11602 | return NULL_TREE; |
8d08fdba MS |
11603 | } |
11604 | \f | |
558475f0 | 11605 | /* When a stmt has been parsed, this function is called. */ |
8d08fdba MS |
11606 | |
11607 | void | |
11f6b451 | 11608 | finish_stmt (void) |
8d08fdba | 11609 | { |
8d08fdba MS |
11610 | } |
11611 | ||
3afb32a4 MM |
11612 | /* DECL was originally constructed as a non-static member function, |
11613 | but turned out to be static. Update it accordingly. */ | |
700f8a87 | 11614 | |
8857f91e | 11615 | void |
11f6b451 | 11616 | revert_static_member_fn (tree decl) |
8d08fdba | 11617 | { |
700f8a87 | 11618 | tree tmp; |
3afb32a4 MM |
11619 | tree function = TREE_TYPE (decl); |
11620 | tree args = TYPE_ARG_TYPES (function); | |
8d08fdba | 11621 | |
89d684bb | 11622 | if (cp_type_quals (TREE_TYPE (TREE_VALUE (args))) |
91063b51 | 11623 | != TYPE_UNQUALIFIED) |
c4f73174 | 11624 | error ("static member function %q#D declared with type qualifiers", decl); |
f30432d7 | 11625 | |
700f8a87 MS |
11626 | args = TREE_CHAIN (args); |
11627 | tmp = build_function_type (TREE_TYPE (function), args); | |
89d684bb | 11628 | tmp = build_qualified_type (tmp, cp_type_quals (function)); |
f30432d7 | 11629 | tmp = build_exception_variant (tmp, |
8d08fdba | 11630 | TYPE_RAISES_EXCEPTIONS (function)); |
3afb32a4 MM |
11631 | TREE_TYPE (decl) = tmp; |
11632 | if (DECL_ARGUMENTS (decl)) | |
11633 | DECL_ARGUMENTS (decl) = TREE_CHAIN (DECL_ARGUMENTS (decl)); | |
11634 | DECL_STATIC_FUNCTION_P (decl) = 1; | |
8d08fdba | 11635 | } |
a4443a08 | 11636 | |
68642fb6 UD |
11637 | /* Initialize the variables used during compilation of a C++ |
11638 | function. */ | |
db5ae43f | 11639 | |
b03e38e1 | 11640 | void |
11f6b451 | 11641 | cxx_push_function_context (struct function * f) |
99dccabc | 11642 | { |
99dd239f | 11643 | struct language_function *p = GGC_CNEW (struct language_function); |
e2500fed | 11644 | f->language = p; |
db5ae43f | 11645 | |
f1dedc31 MM |
11646 | /* Whenever we start a new function, we destroy temporaries in the |
11647 | usual way. */ | |
ae499cce | 11648 | current_stmt_tree ()->stmts_are_full_exprs_p = 1; |
4985cde3 RH |
11649 | |
11650 | if (f->decl) | |
11651 | { | |
11652 | tree fn = f->decl; | |
11653 | ||
4985cde3 RH |
11654 | if (DECL_SAVED_FUNCTION_DATA (fn)) |
11655 | { | |
11656 | /* If we already parsed this function, and we're just expanding it | |
11657 | now, restore saved state. */ | |
11658 | *cp_function_chain = *DECL_SAVED_FUNCTION_DATA (fn); | |
11659 | ||
4985cde3 | 11660 | /* We don't need the saved data anymore. Unless this is an inline |
caf93cb0 | 11661 | function; we need the named return value info for |
7740f00d | 11662 | declare_return_variable. */ |
4985cde3 RH |
11663 | if (! DECL_INLINE (fn)) |
11664 | DECL_SAVED_FUNCTION_DATA (fn) = NULL; | |
11665 | } | |
11666 | } | |
db5ae43f MS |
11667 | } |
11668 | ||
a8f73d4b MM |
11669 | /* Free the language-specific parts of F, now that we've finished |
11670 | compiling the function. */ | |
db5ae43f | 11671 | |
b03e38e1 | 11672 | void |
11f6b451 | 11673 | cxx_pop_function_context (struct function * f) |
db5ae43f | 11674 | { |
99dccabc | 11675 | f->language = 0; |
db5ae43f | 11676 | } |
ebfc180f | 11677 | |
e2500fed GK |
11678 | /* Return which tree structure is used by T, or TS_CP_GENERIC if T is |
11679 | one of the language-independent trees. */ | |
4519c0a8 | 11680 | |
e2500fed | 11681 | enum cp_tree_node_structure_enum |
11f6b451 | 11682 | cp_tree_node_structure (union lang_tree_node * t) |
4519c0a8 | 11683 | { |
e2500fed | 11684 | switch (TREE_CODE (&t->generic)) |
4519c0a8 | 11685 | { |
a723baf1 | 11686 | case DEFAULT_ARG: return TS_CP_DEFAULT_ARG; |
e2500fed | 11687 | case IDENTIFIER_NODE: return TS_CP_IDENTIFIER; |
e2500fed GK |
11688 | case OVERLOAD: return TS_CP_OVERLOAD; |
11689 | case TEMPLATE_PARM_INDEX: return TS_CP_TPI; | |
406d77a4 | 11690 | case TINST_LEVEL: return TS_CP_TINST_LEVEL; |
e2500fed | 11691 | case PTRMEM_CST: return TS_CP_PTRMEM; |
0cbd7506 | 11692 | case BASELINK: return TS_CP_BASELINK; |
54e67af0 | 11693 | case STATIC_ASSERT: return TS_CP_STATIC_ASSERT; |
e2500fed | 11694 | default: return TS_CP_GENERIC; |
4519c0a8 MM |
11695 | } |
11696 | } | |
5fd8e536 | 11697 | |
eaa7c03f JM |
11698 | /* Build the void_list_node (void_type_node having been created). */ |
11699 | tree | |
11f6b451 | 11700 | build_void_list_node (void) |
eaa7c03f JM |
11701 | { |
11702 | tree t = build_tree_list (NULL_TREE, void_type_node); | |
eaa7c03f JM |
11703 | return t; |
11704 | } | |
11705 | ||
6de9cd9a | 11706 | bool |
11f6b451 | 11707 | cp_missing_noreturn_ok_p (tree decl) |
d363e7bf AJ |
11708 | { |
11709 | /* A missing noreturn is ok for the `main' function. */ | |
92643fea | 11710 | return DECL_MAIN_P (decl); |
d363e7bf | 11711 | } |
e2500fed | 11712 | |
c18a5b6c MM |
11713 | /* Return the COMDAT group into which DECL should be placed. */ |
11714 | ||
11715 | const char * | |
11716 | cxx_comdat_group (tree decl) | |
11717 | { | |
11718 | tree name; | |
11719 | ||
11720 | /* Virtual tables, construction virtual tables, and virtual table | |
11721 | tables all go in a single COMDAT group, named after the primary | |
11722 | virtual table. */ | |
11723 | if (TREE_CODE (decl) == VAR_DECL && DECL_VTABLE_OR_VTT_P (decl)) | |
11724 | name = DECL_ASSEMBLER_NAME (CLASSTYPE_VTABLES (DECL_CONTEXT (decl))); | |
11725 | /* For all other DECLs, the COMDAT group is the mangled name of the | |
11726 | declaration itself. */ | |
11727 | else | |
5591e5f9 JJ |
11728 | { |
11729 | while (DECL_THUNK_P (decl)) | |
11730 | { | |
11731 | /* If TARGET_USE_LOCAL_THUNK_ALIAS_P, use_thunk puts the thunk | |
11732 | into the same section as the target function. In that case | |
11733 | we must return target's name. */ | |
11734 | tree target = THUNK_TARGET (decl); | |
11735 | if (TARGET_USE_LOCAL_THUNK_ALIAS_P (target) | |
11736 | && DECL_SECTION_NAME (target) != NULL | |
11737 | && DECL_ONE_ONLY (target)) | |
11738 | decl = target; | |
11739 | else | |
11740 | break; | |
11741 | } | |
11742 | name = DECL_ASSEMBLER_NAME (decl); | |
11743 | } | |
c18a5b6c MM |
11744 | |
11745 | return IDENTIFIER_POINTER (name); | |
11746 | } | |
11747 | ||
e2500fed | 11748 | #include "gt-cp-decl.h" |