]>
Commit | Line | Data |
---|---|---|
af86cc06 | 1 | /* Process declarations and variables for C++ compiler. |
20c01ba9 | 2 | Copyright (C) 1988, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000, |
c3a5d13a | 3 | 2001, 2002, 2003, 2004 Free Software Foundation, Inc. |
997d68fe | 4 | Contributed by Michael Tiemann (tiemann@cygnus.com) |
471086d6 | 5 | |
510c8531 | 6 | This file is part of GCC. |
471086d6 | 7 | |
510c8531 | 8 | GCC is free software; you can redistribute it and/or modify |
471086d6 | 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 | ||
510c8531 | 13 | GCC is distributed in the hope that it will be useful, |
471086d6 | 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 | |
510c8531 | 19 | along with GCC; see the file COPYING. If not, write to |
c58d4270 | 20 | the Free Software Foundation, 59 Temple Place - Suite 330, |
21 | Boston, MA 02111-1307, USA. */ | |
471086d6 | 22 | |
23 | ||
510c8531 | 24 | /* Process declarations and symbol lookup for C++ front end. |
471086d6 | 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 | ||
471086d6 | 31 | #include "config.h" |
b3ef7553 | 32 | #include "system.h" |
805e22b2 | 33 | #include "coretypes.h" |
34 | #include "tm.h" | |
471086d6 | 35 | #include "tree.h" |
36 | #include "rtl.h" | |
f7c44134 | 37 | #include "expr.h" |
471086d6 | 38 | #include "flags.h" |
39 | #include "cp-tree.h" | |
1e3b023c | 40 | #include "tree-inline.h" |
471086d6 | 41 | #include "decl.h" |
42 | #include "lex.h" | |
71ccdfff | 43 | #include "output.h" |
44 | #include "except.h" | |
2a4e40b0 | 45 | #include "toplev.h" |
1f3233d1 | 46 | #include "hashtab.h" |
aed0bd19 | 47 | #include "tm_p.h" |
a767736d | 48 | #include "target.h" |
5f3cead1 | 49 | #include "c-common.h" |
5626f4cd | 50 | #include "c-pragma.h" |
6cd31fa5 | 51 | #include "diagnostic.h" |
1f3233d1 | 52 | #include "debug.h" |
851fe51a | 53 | #include "timevar.h" |
4ee9c684 | 54 | #include "tree-flow.h" |
471086d6 | 55 | |
7ef14399 | 56 | static tree grokparms (tree, tree *); |
1b72315d | 57 | static const char *redeclaration_error_message (tree, tree); |
58 | ||
1b72315d | 59 | static int decl_jump_unsafe (tree); |
1b72315d | 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); | |
1b72315d | 63 | static void push_local_name (tree); |
d7d79557 | 64 | static tree grok_reference_init (tree, tree, tree, tree *); |
7ef14399 | 65 | static tree grokfndecl (tree, tree, tree, tree, tree, int, |
1b72315d | 66 | enum overload_flags, tree, |
67 | tree, int, int, int, int, int, int, tree); | |
68 | static tree grokvardecl (tree, tree, RID_BIT_TYPE *, int, int, tree); | |
1b72315d | 69 | static void record_unknown_type (tree, const char *); |
70 | static tree builtin_function_1 (const char *, tree, tree, int, | |
71 | enum built_in_class, const char *, | |
72 | tree); | |
73 | static tree build_library_fn_1 (tree, enum tree_code, tree); | |
74 | static int member_function_or_else (tree, tree, enum overload_flags); | |
75 | static void bad_specifiers (tree, const char *, int, int, int, int, | |
76 | int); | |
1b72315d | 77 | static void check_for_uninitialized_const_var (tree); |
78 | static hashval_t typename_hash (const void *); | |
79 | static int typename_compare (const void *, const void *); | |
1b72315d | 80 | static tree local_variable_p_walkfn (tree *, int *, void *); |
1b72315d | 81 | static tree record_builtin_java_type (const char *, int); |
82 | static const char *tag_name (enum tag_types code); | |
1b72315d | 83 | static int walk_namespaces_r (tree, walk_namespaces_fn, void *); |
84 | static int walk_globals_r (tree, void*); | |
85 | static int walk_vtables_r (tree, void*); | |
1b72315d | 86 | static tree make_label_decl (tree, int); |
87 | static void use_label (tree); | |
88 | static void check_previous_goto_1 (tree, struct cp_binding_level *, tree, | |
7727e009 | 89 | const location_t *); |
1b72315d | 90 | static void check_previous_goto (struct named_label_use_list *); |
91 | static void check_switch_goto (struct cp_binding_level *); | |
92 | static void check_previous_gotos (tree); | |
93 | static void pop_label (tree, tree); | |
94 | static void pop_labels (tree); | |
95 | static void maybe_deduce_size_from_array_init (tree, tree); | |
96 | static void layout_var_decl (tree); | |
97 | static void maybe_commonize_var (tree); | |
d7d79557 | 98 | static tree check_initializer (tree, tree, int, tree *); |
1b72315d | 99 | static void make_rtl_for_nonlocal_decl (tree, tree, const char *); |
100 | static void save_function_data (tree); | |
101 | static void check_function_type (tree, tree); | |
102 | static void begin_constructor_body (void); | |
103 | static void finish_constructor_body (void); | |
104 | static void begin_destructor_body (void); | |
105 | static void finish_destructor_body (void); | |
106 | static tree create_array_type_for_decl (tree, tree, tree); | |
107 | static tree get_atexit_node (void); | |
108 | static tree get_dso_handle_node (void); | |
109 | static tree start_cleanup_fn (void); | |
110 | static void end_cleanup_fn (void); | |
111 | static tree cp_make_fname_decl (tree, int); | |
112 | static void initialize_predefined_identifiers (void); | |
113 | static tree check_special_function_return_type | |
114 | (special_function_kind, tree, tree); | |
115 | static tree push_cp_library_fn (enum tree_code, tree); | |
116 | static tree build_cp_library_fn (tree, enum tree_code, tree); | |
117 | static void store_parm_decls (tree); | |
2437a99c | 118 | static void initialize_local_var (tree, tree); |
119 | static void expand_static_init (tree, tree); | |
120 | static tree next_initializable_field (tree); | |
121 | static tree reshape_init (tree, tree *); | |
954ad420 | 122 | static tree build_typename_type (tree, tree, tree); |
471086d6 | 123 | |
471086d6 | 124 | /* Erroneous argument lists can use this *IFF* they do not modify it. */ |
125 | tree error_mark_list; | |
126 | ||
72040e7e | 127 | /* The following symbols are subsumed in the cp_global_trees array, and |
980877d7 | 128 | listed here individually for documentation purposes. |
471086d6 | 129 | |
72040e7e | 130 | C++ extensions |
131 | tree wchar_decl_node; | |
c4a8ac95 | 132 | |
72040e7e | 133 | tree vtable_entry_type; |
134 | tree delta_type_node; | |
72040e7e | 135 | tree __t_desc_type_node; |
73a07fbc | 136 | tree ti_desc_type_node; |
378e5add | 137 | tree bltn_desc_type_node, ptr_desc_type_node; |
73a07fbc | 138 | tree ary_desc_type_node, func_desc_type_node, enum_desc_type_node; |
139 | tree class_desc_type_node, si_class_desc_type_node, vmi_class_desc_type_node; | |
15acd583 | 140 | tree ptm_desc_type_node; |
73a07fbc | 141 | tree base_desc_type_node; |
471086d6 | 142 | |
38253b86 | 143 | tree class_type_node; |
72040e7e | 144 | tree unknown_type_node; |
471086d6 | 145 | |
72040e7e | 146 | Array type `vtable_entry_type[]' |
471086d6 | 147 | |
72040e7e | 148 | tree vtbl_type_node; |
149 | tree vtbl_ptr_type_node; | |
471086d6 | 150 | |
13d8774b | 151 | Namespaces, |
471086d6 | 152 | |
72040e7e | 153 | tree std_node; |
13d8774b | 154 | tree abi_node; |
471086d6 | 155 | |
72040e7e | 156 | A FUNCTION_DECL which can call `abort'. Not necessarily the |
157 | one that the user will declare, but sufficient to be called | |
158 | by routines that want to abort the program. | |
471086d6 | 159 | |
72040e7e | 160 | tree abort_fndecl; |
471086d6 | 161 | |
72040e7e | 162 | The FUNCTION_DECL for the default `::operator delete'. |
bb0726a1 | 163 | |
72040e7e | 164 | tree global_delete_fndecl; |
471086d6 | 165 | |
72040e7e | 166 | Used by RTTI |
442fd60a | 167 | tree type_info_type_node, tinfo_decl_id, tinfo_decl_type; |
168 | tree tinfo_var_id; | |
169 | ||
72040e7e | 170 | */ |
471086d6 | 171 | |
72040e7e | 172 | tree cp_global_trees[CPTI_MAX]; |
471086d6 | 173 | |
8417823c | 174 | /* Indicates that there is a type value in some namespace, although |
72040e7e | 175 | that is not necessarily in scope at the moment. */ |
8417823c | 176 | |
836495aa | 177 | tree global_type_node; |
8417823c | 178 | |
7bfd46d1 | 179 | /* The node that holds the "name" of the global scope. */ |
836495aa | 180 | tree global_scope_name; |
7bfd46d1 | 181 | |
c48d6aec | 182 | /* Used only for jumps to as-yet undefined labels, since jumps to |
183 | defined labels can have their validity checked immediately. */ | |
184 | ||
1f3233d1 | 185 | struct named_label_use_list GTY(()) |
1ad432f2 | 186 | { |
1f3233d1 | 187 | struct cp_binding_level *binding_level; |
1ad432f2 | 188 | tree names_in_scope; |
189 | tree label_decl; | |
7727e009 | 190 | location_t o_goto_locus; |
c48d6aec | 191 | struct named_label_use_list *next; |
1ad432f2 | 192 | }; |
193 | ||
18a4cb16 | 194 | #define named_label_uses cp_function_chain->x_named_label_uses |
471086d6 | 195 | |
e6393a02 | 196 | #define local_names cp_function_chain->x_local_names |
197 | ||
471086d6 | 198 | /* A list of objects which have constructors or destructors |
199 | which reside in the global scope. The decl is stored in | |
200 | the TREE_VALUE slot and the initializer is stored | |
201 | in the TREE_PURPOSE slot. */ | |
202 | tree static_aggregates; | |
203 | ||
471086d6 | 204 | /* -- end of C++ */ |
205 | ||
775e7cc0 | 206 | /* A node for the integer constants 2, and 3. */ |
2739960c | 207 | |
775e7cc0 | 208 | tree integer_two_node, integer_three_node; |
471086d6 | 209 | |
c48d6aec | 210 | /* A list of all LABEL_DECLs in the function that have names. Here so |
211 | we can clear out their names' definitions at the end of the | |
212 | function, and so we can check the validity of jumps to these labels. */ | |
213 | ||
1f3233d1 | 214 | struct named_label_list GTY(()) |
c48d6aec | 215 | { |
1f3233d1 | 216 | struct cp_binding_level *binding_level; |
c48d6aec | 217 | tree names_in_scope; |
218 | tree old_value; | |
219 | tree label_decl; | |
220 | tree bad_decls; | |
c48d6aec | 221 | struct named_label_list *next; |
65750829 | 222 | unsigned int in_try_scope : 1; |
223 | unsigned int in_catch_scope : 1; | |
c48d6aec | 224 | }; |
471086d6 | 225 | |
1e463950 | 226 | #define named_labels cp_function_chain->x_named_labels |
471086d6 | 227 | \f |
3563027c | 228 | /* The number of function bodies which we are currently processing. |
229 | (Zero if we are at namespace scope, one inside the body of a | |
230 | function, two inside the body of a function in a local class, etc.) */ | |
231 | int function_depth; | |
88da234d | 232 | |
233 | /* States indicating how grokdeclarator() should handle declspecs marked | |
234 | with __attribute__((deprecated)). An object declared as | |
235 | __attribute__((deprecated)) suppresses warnings of uses of other | |
236 | deprecated items. */ | |
237 | ||
238 | enum deprecated_states { | |
239 | DEPRECATED_NORMAL, | |
240 | DEPRECATED_SUPPRESS | |
241 | }; | |
242 | ||
243 | static enum deprecated_states deprecated_state = DEPRECATED_NORMAL; | |
244 | ||
245 | /* Set by add_implicitly_declared_members() to keep those members from | |
246 | being flagged as deprecated or reported as using deprecated | |
247 | types. */ | |
248 | int adding_implicit_members = 0; | |
92c38d80 | 249 | |
250 | /* True if a declaration with an `extern' linkage specifier is being | |
251 | processed. */ | |
252 | bool have_extern_spec; | |
253 | ||
471086d6 | 254 | \f |
242fc35c | 255 | /* A TREE_LIST of VAR_DECLs. The TREE_PURPOSE is a RECORD_TYPE or |
256 | UNION_TYPE; the TREE_VALUE is a VAR_DECL with that type. At the | |
257 | time the VAR_DECL was declared, the type was incomplete. */ | |
258 | ||
1f3233d1 | 259 | static GTY(()) tree incomplete_vars; |
471086d6 | 260 | \f |
3467e461 | 261 | /* Returns the kind of template specialization we are currently |
262 | processing, given that it's declaration contained N_CLASS_SCOPES | |
263 | explicit scope qualifications. */ | |
264 | ||
265 | tmpl_spec_kind | |
1b72315d | 266 | current_tmpl_spec_kind (int n_class_scopes) |
3467e461 | 267 | { |
268 | int n_template_parm_scopes = 0; | |
269 | int seen_specialization_p = 0; | |
270 | int innermost_specialization_p = 0; | |
1f3233d1 | 271 | struct cp_binding_level *b; |
3467e461 | 272 | |
273 | /* Scan through the template parameter scopes. */ | |
37b9a732 | 274 | for (b = current_binding_level; |
275 | b->kind == sk_template_parms; | |
276 | b = b->level_chain) | |
3467e461 | 277 | { |
278 | /* If we see a specialization scope inside a parameter scope, | |
279 | then something is wrong. That corresponds to a declaration | |
280 | like: | |
281 | ||
282 | template <class T> template <> ... | |
283 | ||
6c0cc2cd | 284 | which is always invalid since [temp.expl.spec] forbids the |
3467e461 | 285 | specialization of a class member template if the enclosing |
286 | class templates are not explicitly specialized as well. */ | |
37b9a732 | 287 | if (b->explicit_spec_p) |
3467e461 | 288 | { |
289 | if (n_template_parm_scopes == 0) | |
290 | innermost_specialization_p = 1; | |
291 | else | |
292 | seen_specialization_p = 1; | |
293 | } | |
294 | else if (seen_specialization_p == 1) | |
295 | return tsk_invalid_member_spec; | |
296 | ||
297 | ++n_template_parm_scopes; | |
298 | } | |
299 | ||
300 | /* Handle explicit instantiations. */ | |
301 | if (processing_explicit_instantiation) | |
302 | { | |
303 | if (n_template_parm_scopes != 0) | |
304 | /* We've seen a template parameter list during an explicit | |
305 | instantiation. For example: | |
306 | ||
307 | template <class T> template void f(int); | |
308 | ||
309 | This is erroneous. */ | |
310 | return tsk_invalid_expl_inst; | |
311 | else | |
312 | return tsk_expl_inst; | |
313 | } | |
314 | ||
315 | if (n_template_parm_scopes < n_class_scopes) | |
316 | /* We've not seen enough template headers to match all the | |
317 | specialized classes present. For example: | |
318 | ||
319 | template <class T> void R<T>::S<T>::f(int); | |
320 | ||
6c0cc2cd | 321 | This is invalid; there needs to be one set of template |
3467e461 | 322 | parameters for each class. */ |
323 | return tsk_insufficient_parms; | |
324 | else if (n_template_parm_scopes == n_class_scopes) | |
325 | /* We're processing a non-template declaration (even though it may | |
326 | be a member of a template class.) For example: | |
327 | ||
328 | template <class T> void S<T>::f(int); | |
329 | ||
330 | The `class T' maches the `S<T>', leaving no template headers | |
331 | corresponding to the `f'. */ | |
332 | return tsk_none; | |
333 | else if (n_template_parm_scopes > n_class_scopes + 1) | |
334 | /* We've got too many template headers. For example: | |
335 | ||
336 | template <> template <class T> void f (T); | |
337 | ||
338 | There need to be more enclosing classes. */ | |
339 | return tsk_excessive_parms; | |
340 | else | |
341 | /* This must be a template. It's of the form: | |
342 | ||
343 | template <class T> template <class U> void S<T>::f(U); | |
344 | ||
345 | This is a specialization if the innermost level was a | |
346 | specialization; otherwise it's just a definition of the | |
347 | template. */ | |
348 | return innermost_specialization_p ? tsk_expl_spec : tsk_template; | |
471086d6 | 349 | } |
350 | ||
3467e461 | 351 | /* Exit the current scope. */ |
352 | ||
353 | void | |
1b72315d | 354 | finish_scope (void) |
3467e461 | 355 | { |
356 | poplevel (0, 0, 0); | |
357 | } | |
358 | ||
2d46e540 | 359 | /* When a label goes out of scope, check to see if that label was used |
360 | in a valid manner, and issue any appropriate warnings or errors. */ | |
361 | ||
362 | static void | |
1b72315d | 363 | pop_label (tree label, tree old_value) |
2d46e540 | 364 | { |
37b9a732 | 365 | if (!processing_template_decl) |
2d46e540 | 366 | { |
149a6627 | 367 | if (DECL_INITIAL (label) == NULL_TREE) |
368 | { | |
92ddaf90 | 369 | location_t location; |
370 | ||
149a6627 | 371 | cp_error_at ("label `%D' used but not defined", label); |
92ddaf90 | 372 | location.file = input_filename; |
373 | location.line = 0; | |
149a6627 | 374 | /* Avoid crashing later. */ |
92ddaf90 | 375 | define_label (location, DECL_NAME (label)); |
149a6627 | 376 | } |
6dfd0eba | 377 | else if (warn_unused_label && !TREE_USED (label)) |
149a6627 | 378 | cp_warning_at ("label `%D' defined but not used", label); |
2d46e540 | 379 | } |
2d46e540 | 380 | |
c48d6aec | 381 | SET_IDENTIFIER_LABEL_VALUE (DECL_NAME (label), old_value); |
2d46e540 | 382 | } |
383 | ||
9594b69d | 384 | /* At the end of a function, all labels declared within the function |
980877d7 | 385 | go out of scope. BLOCK is the top-level block for the |
2d46e540 | 386 | function. */ |
387 | ||
388 | static void | |
1b72315d | 389 | pop_labels (tree block) |
2d46e540 | 390 | { |
c48d6aec | 391 | struct named_label_list *link; |
2d46e540 | 392 | |
393 | /* Clear out the definitions of all label names, since their scopes | |
394 | end here. */ | |
c48d6aec | 395 | for (link = named_labels; link; link = link->next) |
2d46e540 | 396 | { |
c48d6aec | 397 | pop_label (link->label_decl, link->old_value); |
2d46e540 | 398 | /* Put the labels into the "variables" of the top-level block, |
399 | so debugger can see them. */ | |
c48d6aec | 400 | TREE_CHAIN (link->label_decl) = BLOCK_VARS (block); |
401 | BLOCK_VARS (block) = link->label_decl; | |
2d46e540 | 402 | } |
403 | ||
c48d6aec | 404 | named_labels = NULL; |
2d46e540 | 405 | } |
406 | ||
471086d6 | 407 | /* Exit a binding level. |
408 | Pop the level off, and restore the state of the identifier-decl mappings | |
409 | that were in effect when this level was entered. | |
410 | ||
411 | If KEEP == 1, this level had explicit declarations, so | |
412 | and create a "block" (a BLOCK node) for the level | |
413 | to record its declarations and subblocks for symbol table output. | |
414 | ||
471086d6 | 415 | If FUNCTIONBODY is nonzero, this level is the body of a function, |
416 | so create a block as if KEEP were set and also clear out all | |
417 | label names. | |
418 | ||
419 | If REVERSE is nonzero, reverse the order of decls before putting | |
420 | them into the BLOCK. */ | |
421 | ||
422 | tree | |
1b72315d | 423 | poplevel (int keep, int reverse, int functionbody) |
471086d6 | 424 | { |
cd16867a | 425 | tree link; |
471086d6 | 426 | /* The chain of decls was accumulated in reverse order. |
427 | Put it into forward order, just for cleanliness. */ | |
428 | tree decls; | |
429 | int tmp = functionbody; | |
e0e489c4 | 430 | int real_functionbody; |
e0e489c4 | 431 | tree subblocks; |
2363ef00 | 432 | tree block; |
471086d6 | 433 | tree decl; |
53137e6a | 434 | int leaving_for_scope; |
e880f232 | 435 | scope_kind kind; |
53137e6a | 436 | |
851fe51a | 437 | timevar_push (TV_NAME_LOOKUP); |
2363ef00 | 438 | restart: |
439 | ||
440 | block = NULL_TREE; | |
e0e489c4 | 441 | |
37b9a732 | 442 | my_friendly_assert (current_binding_level->kind != sk_class, 19990916); |
8fc54128 | 443 | |
e880f232 | 444 | real_functionbody = (current_binding_level->kind == sk_cleanup |
e0e489c4 | 445 | ? ((functionbody = 0), tmp) : functionbody); |
e0e489c4 | 446 | subblocks = functionbody >= 0 ? current_binding_level->blocks : 0; |
447 | ||
8fc54128 | 448 | my_friendly_assert (!current_binding_level->class_shadowed, |
449 | 19990414); | |
471086d6 | 450 | |
ef3eb7cc | 451 | /* We used to use KEEP == 2 to indicate that the new block should go |
452 | at the beginning of the list of blocks at this binding level, | |
453 | rather than the end. This hack is no longer used. */ | |
454 | my_friendly_assert (keep == 0 || keep == 1, 0); | |
455 | ||
e880f232 | 456 | if (current_binding_level->keep) |
471086d6 | 457 | keep = 1; |
458 | ||
c48d6aec | 459 | /* Any uses of undefined labels, and any defined labels, now operate |
460 | under constraints of next binding contour. */ | |
461 | if (cfun && !functionbody) | |
462 | { | |
1f3233d1 | 463 | struct cp_binding_level *level_chain; |
c48d6aec | 464 | level_chain = current_binding_level->level_chain; |
465 | if (level_chain) | |
466 | { | |
467 | struct named_label_use_list *uses; | |
468 | struct named_label_list *labels; | |
469 | for (labels = named_labels; labels; labels = labels->next) | |
470 | if (labels->binding_level == current_binding_level) | |
471 | { | |
472 | tree decl; | |
37b9a732 | 473 | if (current_binding_level->kind == sk_try) |
65750829 | 474 | labels->in_try_scope = 1; |
37b9a732 | 475 | if (current_binding_level->kind == sk_catch) |
65750829 | 476 | labels->in_catch_scope = 1; |
c48d6aec | 477 | for (decl = labels->names_in_scope; decl; |
478 | decl = TREE_CHAIN (decl)) | |
479 | if (decl_jump_unsafe (decl)) | |
480 | labels->bad_decls = tree_cons (NULL_TREE, decl, | |
481 | labels->bad_decls); | |
482 | labels->binding_level = level_chain; | |
483 | labels->names_in_scope = level_chain->names; | |
484 | } | |
485 | ||
486 | for (uses = named_label_uses; uses; uses = uses->next) | |
487 | if (uses->binding_level == current_binding_level) | |
488 | { | |
489 | uses->binding_level = level_chain; | |
490 | uses->names_in_scope = level_chain->names; | |
491 | } | |
492 | } | |
493 | } | |
494 | ||
471086d6 | 495 | /* Get the decls in the order they were written. |
496 | Usually current_binding_level->names is in reverse order. | |
497 | But parameter decls were previously put in forward order. */ | |
498 | ||
499 | if (reverse) | |
500 | current_binding_level->names | |
501 | = decls = nreverse (current_binding_level->names); | |
502 | else | |
503 | decls = current_binding_level->names; | |
504 | ||
1ec2510f | 505 | /* When not in function-at-a-time mode, expand_end_bindings will |
506 | warn about unused variables. But, in function-at-a-time mode | |
507 | expand_end_bindings is not passed the list of variables in the | |
508 | current scope, and therefore no warning is emitted. So, we | |
509 | explicitly warn here. */ | |
510 | if (!processing_template_decl) | |
511 | warn_about_unused_variables (getdecls ()); | |
512 | ||
471086d6 | 513 | /* If there were any declarations or structure tags in that level, |
514 | or if this level is a function body, | |
515 | create a BLOCK to record them for the life of this function. */ | |
471086d6 | 516 | block = NULL_TREE; |
6528331d | 517 | if (keep == 1 || functionbody) |
471086d6 | 518 | block = make_node (BLOCK); |
519 | if (block != NULL_TREE) | |
520 | { | |
6528331d | 521 | BLOCK_VARS (block) = decls; |
522 | BLOCK_SUBBLOCKS (block) = subblocks; | |
471086d6 | 523 | } |
524 | ||
525 | /* In each subblock, record that this is its superior. */ | |
471086d6 | 526 | if (keep >= 0) |
527 | for (link = subblocks; link; link = TREE_CHAIN (link)) | |
528 | BLOCK_SUPERCONTEXT (link) = block; | |
529 | ||
53137e6a | 530 | /* We still support the old for-scope rules, whereby the variables |
531 | in a for-init statement were in scope after the for-statement | |
6e9029b4 | 532 | ended. We only use the new rules if flag_new_for_scope is |
53137e6a | 533 | nonzero. */ |
980877d7 | 534 | leaving_for_scope |
37b9a732 | 535 | = current_binding_level->kind == sk_for && flag_new_for_scope == 1; |
53137e6a | 536 | |
537 | /* Remove declarations for all the DECLs in this level. */ | |
538 | for (link = decls; link; link = TREE_CHAIN (link)) | |
539 | { | |
7108eaab | 540 | if (leaving_for_scope && TREE_CODE (link) == VAR_DECL |
541 | && DECL_NAME (link)) | |
53137e6a | 542 | { |
771cf831 | 543 | cxx_binding *outer_binding |
544 | = IDENTIFIER_BINDING (DECL_NAME (link))->previous; | |
53137e6a | 545 | tree ns_binding; |
546 | ||
547 | if (!outer_binding) | |
548 | ns_binding = IDENTIFIER_NAMESPACE_VALUE (DECL_NAME (link)); | |
ac63fdff | 549 | else |
550 | ns_binding = NULL_TREE; | |
551 | ||
980877d7 | 552 | if (outer_binding |
76608a37 | 553 | && outer_binding->scope == current_binding_level->level_chain) |
53137e6a | 554 | /* We have something like: |
980877d7 | 555 | |
53137e6a | 556 | int i; |
557 | for (int i; ;); | |
980877d7 | 558 | |
53137e6a | 559 | and we are leaving the `for' scope. There's no reason to |
560 | keep the binding of the inner `i' in this case. */ | |
2b77484d | 561 | pop_binding (DECL_NAME (link), link); |
980877d7 | 562 | else if ((outer_binding |
76608a37 | 563 | && (TREE_CODE (outer_binding->value) == TYPE_DECL)) |
564 | || (ns_binding && TREE_CODE (ns_binding) == TYPE_DECL)) | |
53137e6a | 565 | /* Here, we have something like: |
566 | ||
567 | typedef int I; | |
568 | ||
569 | void f () { | |
570 | for (int I; ;); | |
571 | } | |
572 | ||
573 | We must pop the for-scope binding so we know what's a | |
574 | type and what isn't. */ | |
2b77484d | 575 | pop_binding (DECL_NAME (link), link); |
e4ce2dc4 | 576 | else |
e4ce2dc4 | 577 | { |
53137e6a | 578 | /* Mark this VAR_DECL as dead so that we can tell we left it |
579 | there only for backward compatibility. */ | |
580 | DECL_DEAD_FOR_LOCAL (link) = 1; | |
980877d7 | 581 | |
b8afbea5 | 582 | /* Keep track of what should have happened when we |
53137e6a | 583 | popped the binding. */ |
76608a37 | 584 | if (outer_binding && outer_binding->value) |
585 | DECL_SHADOWED_FOR_VAR (link) = outer_binding->value; | |
53137e6a | 586 | |
587 | /* Add it to the list of dead variables in the next | |
588 | outermost binding to that we can remove these when we | |
589 | leave that binding. */ | |
590 | current_binding_level->level_chain->dead_vars_from_for | |
591 | = tree_cons (NULL_TREE, link, | |
592 | current_binding_level->level_chain-> | |
593 | dead_vars_from_for); | |
594 | ||
771cf831 | 595 | /* Although we don't pop the cxx_binding, we do clear |
76608a37 | 596 | its SCOPE since the scope is going away now. */ |
597 | IDENTIFIER_BINDING (DECL_NAME (link))->scope = NULL; | |
e4ce2dc4 | 598 | } |
de9554eb | 599 | } |
980877d7 | 600 | else |
0a4a126e | 601 | { |
53137e6a | 602 | /* Remove the binding. */ |
2da051b5 | 603 | decl = link; |
604 | if (TREE_CODE (decl) == TREE_LIST) | |
605 | decl = TREE_VALUE (decl); | |
9308e976 | 606 | if (DECL_P (decl)) |
2da051b5 | 607 | pop_binding (DECL_NAME (decl), decl); |
608 | else if (TREE_CODE (decl) == OVERLOAD) | |
609 | pop_binding (DECL_NAME (OVL_FUNCTION (decl)), decl); | |
980877d7 | 610 | else |
523ac844 | 611 | abort (); |
471086d6 | 612 | } |
53137e6a | 613 | } |
471086d6 | 614 | |
53137e6a | 615 | /* Remove declarations for any `for' variables from inner scopes |
616 | that we kept around. */ | |
617 | for (link = current_binding_level->dead_vars_from_for; | |
618 | link; link = TREE_CHAIN (link)) | |
2b77484d | 619 | pop_binding (DECL_NAME (TREE_VALUE (link)), TREE_VALUE (link)); |
de9554eb | 620 | |
53137e6a | 621 | /* Restore the IDENTIFIER_TYPE_VALUEs. */ |
622 | for (link = current_binding_level->type_shadowed; | |
623 | link; link = TREE_CHAIN (link)) | |
624 | SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (link), TREE_VALUE (link)); | |
2d46e540 | 625 | |
626 | /* Restore the IDENTIFIER_LABEL_VALUEs for local labels. */ | |
627 | for (link = current_binding_level->shadowed_labels; | |
980877d7 | 628 | link; |
2d46e540 | 629 | link = TREE_CHAIN (link)) |
c48d6aec | 630 | pop_label (TREE_VALUE (link), TREE_PURPOSE (link)); |
2d46e540 | 631 | |
53137e6a | 632 | /* There may be OVERLOADs (wrapped in TREE_LISTs) on the BLOCK_VARs |
633 | list if a `using' declaration put them there. The debugging | |
634 | back-ends won't understand OVERLOAD, so we remove them here. | |
635 | Because the BLOCK_VARS are (temporarily) shared with | |
636 | CURRENT_BINDING_LEVEL->NAMES we must do this fixup after we have | |
637 | popped all the bindings. */ | |
638 | if (block) | |
639 | { | |
640 | tree* d; | |
0a4a126e | 641 | |
02e19191 | 642 | for (d = &BLOCK_VARS (block); *d; ) |
643 | { | |
644 | if (TREE_CODE (*d) == TREE_LIST) | |
645 | *d = TREE_CHAIN (*d); | |
646 | else | |
647 | d = &TREE_CHAIN (*d); | |
648 | } | |
0a4a126e | 649 | } |
471086d6 | 650 | |
651 | /* If the level being exited is the top level of a function, | |
652 | check over all the labels. */ | |
471086d6 | 653 | if (functionbody) |
654 | { | |
2d46e540 | 655 | /* Since this is the top level block of a function, the vars are |
656 | the function's parameters. Don't leave them in the BLOCK | |
657 | because they are found in the FUNCTION_DECL instead. */ | |
471086d6 | 658 | BLOCK_VARS (block) = 0; |
2d46e540 | 659 | pop_labels (block); |
471086d6 | 660 | } |
661 | ||
e880f232 | 662 | kind = current_binding_level->kind; |
2363ef00 | 663 | if (kind == sk_cleanup) |
664 | { | |
665 | tree stmt; | |
666 | ||
667 | /* If this is a temporary binding created for a cleanup, then we'll | |
668 | have pushed a statement list level. Pop that, create a new | |
669 | BIND_EXPR for the block, and insert it into the stream. */ | |
670 | stmt = pop_stmt_list (current_binding_level->statement_list); | |
671 | stmt = c_build_bind_expr (block, stmt); | |
672 | add_stmt (stmt); | |
673 | } | |
471086d6 | 674 | |
e2b8a7ee | 675 | leave_scope (); |
471086d6 | 676 | if (functionbody) |
677 | DECL_INITIAL (current_function_decl) = block; | |
678 | else if (block) | |
6528331d | 679 | current_binding_level->blocks |
680 | = chainon (current_binding_level->blocks, block); | |
681 | ||
471086d6 | 682 | /* If we did not make a block for the level just exited, |
683 | any blocks made for inner levels | |
684 | (since they cannot be recorded as subblocks in that level) | |
685 | must be carried forward so they will later become subblocks | |
686 | of something else. */ | |
687 | else if (subblocks) | |
ef3eb7cc | 688 | current_binding_level->blocks |
689 | = chainon (current_binding_level->blocks, subblocks); | |
471086d6 | 690 | |
1ec2510f | 691 | /* Each and every BLOCK node created here in `poplevel' is important |
692 | (e.g. for proper debugging information) so if we created one | |
693 | earlier, mark it as "used". */ | |
694 | if (block) | |
695 | TREE_USED (block) = 1; | |
696 | ||
2363ef00 | 697 | /* All temporary bindings created for cleanups are popped silently. */ |
e880f232 | 698 | if (kind == sk_cleanup) |
2363ef00 | 699 | goto restart; |
471086d6 | 700 | |
851fe51a | 701 | POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, block); |
471086d6 | 702 | } |
703 | ||
704 | /* Delete the node BLOCK from the current binding level. | |
705 | This is used for the block inside a stmt expr ({...}) | |
706 | so that the block can be reinserted where appropriate. */ | |
707 | ||
708 | void | |
1b72315d | 709 | delete_block (tree block) |
471086d6 | 710 | { |
711 | tree t; | |
712 | if (current_binding_level->blocks == block) | |
713 | current_binding_level->blocks = TREE_CHAIN (block); | |
714 | for (t = current_binding_level->blocks; t;) | |
715 | { | |
716 | if (TREE_CHAIN (t) == block) | |
717 | TREE_CHAIN (t) = TREE_CHAIN (block); | |
718 | else | |
719 | t = TREE_CHAIN (t); | |
720 | } | |
721 | TREE_CHAIN (block) = NULL_TREE; | |
722 | /* Clear TREE_USED which is always set by poplevel. | |
723 | The flag is set again if insert_block is called. */ | |
724 | TREE_USED (block) = 0; | |
725 | } | |
726 | ||
727 | /* Insert BLOCK at the end of the list of subblocks of the | |
728 | current binding level. This is used when a BIND_EXPR is expanded, | |
729 | to handle the BLOCK node inside the BIND_EXPR. */ | |
730 | ||
731 | void | |
1b72315d | 732 | insert_block (tree block) |
471086d6 | 733 | { |
734 | TREE_USED (block) = 1; | |
735 | current_binding_level->blocks | |
736 | = chainon (current_binding_level->blocks, block); | |
737 | } | |
738 | ||
471086d6 | 739 | /* Set the BLOCK node for the innermost scope |
740 | (the one we are currently in). */ | |
741 | ||
742 | void | |
1b72315d | 743 | set_block (tree block ATTRIBUTE_UNUSED ) |
471086d6 | 744 | { |
6528331d | 745 | /* The RTL expansion machinery requires us to provide this callback, |
746 | but it is not applicable in function-at-a-time mode. */ | |
471086d6 | 747 | } |
748 | ||
3160db1d | 749 | /* Returns nonzero if T is a virtual function table. */ |
cec1f6a6 | 750 | |
751 | int | |
1b72315d | 752 | vtable_decl_p (tree t, void* data ATTRIBUTE_UNUSED ) |
cec1f6a6 | 753 | { |
754 | return (TREE_CODE (t) == VAR_DECL && DECL_VIRTUAL_P (t)); | |
755 | } | |
756 | ||
3160db1d | 757 | /* Returns nonzero if T is a TYPE_DECL for a type with virtual |
cec1f6a6 | 758 | functions. */ |
759 | ||
760 | int | |
1b72315d | 761 | vtype_decl_p (tree t, void *data ATTRIBUTE_UNUSED ) |
cec1f6a6 | 762 | { |
763 | return (TREE_CODE (t) == TYPE_DECL | |
14b8f8f6 | 764 | && TREE_CODE (TREE_TYPE (t)) == RECORD_TYPE |
765 | && TYPE_POLYMORPHIC_P (TREE_TYPE (t))); | |
cec1f6a6 | 766 | } |
767 | ||
422f3ebe | 768 | struct walk_globals_data { |
769 | walk_globals_pred p; | |
770 | walk_globals_fn f; | |
771 | void *data; | |
772 | }; | |
773 | ||
774 | /* Walk the vtable declarations in NAMESPACE. Whenever one is found | |
3160db1d | 775 | for which P returns nonzero, call F with its address. If any call |
776 | to F returns a nonzero value, return a nonzero value. */ | |
422f3ebe | 777 | |
778 | static int | |
1b72315d | 779 | walk_vtables_r (tree namespace, void* data) |
422f3ebe | 780 | { |
781 | struct walk_globals_data* wgd = (struct walk_globals_data *) data; | |
782 | walk_globals_fn f = wgd->f; | |
783 | void *d = wgd->data; | |
784 | tree decl = NAMESPACE_LEVEL (namespace)->vtables; | |
785 | int result = 0; | |
786 | ||
787 | for (; decl ; decl = TREE_CHAIN (decl)) | |
0b4c7896 | 788 | result |= (*f) (&decl, d); |
422f3ebe | 789 | |
790 | return result; | |
791 | } | |
792 | ||
793 | /* Walk the vtable declarations. Whenever one is found for which P | |
3160db1d | 794 | returns nonzero, call F with its address. If any call to F |
795 | returns a nonzero value, return a nonzero value. */ | |
26ac6687 | 796 | bool |
797 | walk_vtables (walk_globals_pred p, walk_globals_fn f, void *data) | |
422f3ebe | 798 | { |
799 | struct walk_globals_data wgd; | |
800 | wgd.p = p; | |
801 | wgd.f = f; | |
802 | wgd.data = data; | |
803 | ||
804 | return walk_namespaces (walk_vtables_r, &wgd); | |
805 | } | |
806 | ||
cec1f6a6 | 807 | /* Walk all the namespaces contained NAMESPACE, including NAMESPACE |
808 | itself, calling F for each. The DATA is passed to F as well. */ | |
809 | ||
836495aa | 810 | static int |
811 | walk_namespaces_r (tree namespace, walk_namespaces_fn f, void* data) | |
812 | { | |
813 | int result = 0; | |
814 | tree current = NAMESPACE_LEVEL (namespace)->namespaces; | |
471086d6 | 815 | |
836495aa | 816 | result |= (*f) (namespace, data); |
471086d6 | 817 | |
836495aa | 818 | for (; current; current = TREE_CHAIN (current)) |
819 | result |= walk_namespaces_r (current, f, data); | |
a35129cf | 820 | |
836495aa | 821 | return result; |
e857e9c7 | 822 | } |
823 | ||
836495aa | 824 | /* Walk all the namespaces, calling F for each. The DATA is passed to |
825 | F as well. */ | |
826 | ||
827 | int | |
828 | walk_namespaces (walk_namespaces_fn f, void* data) | |
e857e9c7 | 829 | { |
836495aa | 830 | return walk_namespaces_r (global_namespace, f, data); |
471086d6 | 831 | } |
832 | ||
836495aa | 833 | /* Walk the global declarations in NAMESPACE. Whenever one is found |
834 | for which P returns nonzero, call F with its address. If any call | |
835 | to F returns a nonzero value, return a nonzero value. */ | |
471086d6 | 836 | |
836495aa | 837 | static int |
838 | walk_globals_r (tree namespace, void* data) | |
839 | { | |
840 | struct walk_globals_data* wgd = (struct walk_globals_data *) data; | |
841 | walk_globals_pred p = wgd->p; | |
842 | walk_globals_fn f = wgd->f; | |
843 | void *d = wgd->data; | |
844 | tree *t; | |
845 | int result = 0; | |
471086d6 | 846 | |
836495aa | 847 | t = &NAMESPACE_LEVEL (namespace)->names; |
1e4853c2 | 848 | |
836495aa | 849 | while (*t) |
471086d6 | 850 | { |
836495aa | 851 | tree glbl = *t; |
471086d6 | 852 | |
836495aa | 853 | if ((*p) (glbl, d)) |
854 | result |= (*f) (t, d); | |
b7d1e8ea | 855 | |
836495aa | 856 | /* If F changed *T, then *T still points at the next item to |
857 | examine. */ | |
858 | if (*t == glbl) | |
859 | t = &TREE_CHAIN (*t); | |
8417823c | 860 | } |
471086d6 | 861 | |
836495aa | 862 | return result; |
471086d6 | 863 | } |
864 | ||
836495aa | 865 | /* Walk the global declarations. Whenever one is found for which P |
866 | returns true, call F with its address. If any call to F | |
867 | returns true, return true. */ | |
8417823c | 868 | |
836495aa | 869 | bool |
870 | walk_globals (walk_globals_pred p, walk_globals_fn f, void *data) | |
8417823c | 871 | { |
836495aa | 872 | struct walk_globals_data wgd; |
873 | wgd.p = p; | |
874 | wgd.f = f; | |
875 | wgd.data = data; | |
96624a9e | 876 | |
836495aa | 877 | return walk_namespaces (walk_globals_r, &wgd); |
0543e7a9 | 878 | } |
879 | ||
836495aa | 880 | /* Call wrapup_globals_declarations for the globals in NAMESPACE. If |
881 | DATA is non-NULL, this is the last time we will call | |
882 | wrapup_global_declarations for this NAMESPACE. */ | |
63e8563c | 883 | |
836495aa | 884 | int |
885 | wrapup_globals_for_namespace (tree namespace, void* data) | |
63e8563c | 886 | { |
836495aa | 887 | struct cp_binding_level *level = NAMESPACE_LEVEL (namespace); |
888 | varray_type statics = level->static_decls; | |
889 | tree *vec = &VARRAY_TREE (statics, 0); | |
890 | int len = VARRAY_ACTIVE_SIZE (statics); | |
891 | int last_time = (data != 0); | |
980877d7 | 892 | |
836495aa | 893 | if (last_time) |
63e8563c | 894 | { |
836495aa | 895 | check_global_declarations (vec, len); |
896 | return 0; | |
63e8563c | 897 | } |
898 | ||
836495aa | 899 | /* Write out any globals that need to be output. */ |
900 | return wrapup_global_declarations (vec, len); | |
63e8563c | 901 | } |
902 | ||
836495aa | 903 | \f |
70a658bd | 904 | /* In C++, you don't have to write `struct S' to refer to `S'; you |
905 | can just use `S'. We accomplish this by creating a TYPE_DECL as | |
906 | if the user had written `typedef struct S S'. Create and return | |
907 | the TYPE_DECL for TYPE. */ | |
908 | ||
909 | tree | |
1b72315d | 910 | create_implicit_typedef (tree name, tree type) |
70a658bd | 911 | { |
912 | tree decl; | |
913 | ||
914 | decl = build_decl (TYPE_DECL, name, type); | |
ecdd3d84 | 915 | DECL_ARTIFICIAL (decl) = 1; |
70a658bd | 916 | /* There are other implicit type declarations, like the one *within* |
917 | a class that allows you to write `S::S'. We must distinguish | |
918 | amongst these. */ | |
919 | SET_DECL_IMPLICIT_TYPEDEF_P (decl); | |
920 | TYPE_NAME (type) = decl; | |
921 | ||
922 | return decl; | |
923 | } | |
924 | ||
e6393a02 | 925 | /* Remember a local name for name-mangling purposes. */ |
926 | ||
927 | static void | |
1b72315d | 928 | push_local_name (tree decl) |
e6393a02 | 929 | { |
930 | size_t i, nelts; | |
931 | tree t, name; | |
932 | ||
851fe51a | 933 | timevar_push (TV_NAME_LOOKUP); |
e6393a02 | 934 | if (!local_names) |
935 | VARRAY_TREE_INIT (local_names, 8, "local_names"); | |
936 | ||
937 | name = DECL_NAME (decl); | |
938 | ||
939 | nelts = VARRAY_ACTIVE_SIZE (local_names); | |
940 | for (i = 0; i < nelts; i++) | |
941 | { | |
942 | t = VARRAY_TREE (local_names, i); | |
943 | if (DECL_NAME (t) == name) | |
944 | { | |
945 | if (!DECL_LANG_SPECIFIC (decl)) | |
946 | retrofit_lang_decl (decl); | |
1f3233d1 | 947 | DECL_LANG_SPECIFIC (decl)->decl_flags.u2sel = 1; |
e6393a02 | 948 | if (DECL_LANG_SPECIFIC (t)) |
949 | DECL_DISCRIMINATOR (decl) = DECL_DISCRIMINATOR (t) + 1; | |
950 | else | |
951 | DECL_DISCRIMINATOR (decl) = 1; | |
952 | ||
953 | VARRAY_TREE (local_names, i) = decl; | |
4fa0b096 | 954 | timevar_pop (TV_NAME_LOOKUP); |
955 | return; | |
e6393a02 | 956 | } |
957 | } | |
958 | ||
959 | VARRAY_PUSH_TREE (local_names, decl); | |
851fe51a | 960 | timevar_pop (TV_NAME_LOOKUP); |
e6393a02 | 961 | } |
471086d6 | 962 | \f |
963 | /* Subroutine of duplicate_decls: return truthvalue of whether | |
964 | or not types of these decls match. | |
965 | ||
966 | For C++, we must compare the parameter list so that `int' can match | |
967 | `int&' in a parameter position, but `int&' is not confused with | |
968 | `const int&'. */ | |
96624a9e | 969 | |
a74e8896 | 970 | int |
1b72315d | 971 | decls_match (tree newdecl, tree olddecl) |
471086d6 | 972 | { |
973 | int types_match; | |
974 | ||
42085533 | 975 | if (newdecl == olddecl) |
976 | return 1; | |
977 | ||
5b35cb67 | 978 | if (TREE_CODE (newdecl) != TREE_CODE (olddecl)) |
979 | /* If the two DECLs are not even the same kind of thing, we're not | |
980 | interested in their types. */ | |
981 | return 0; | |
982 | ||
983 | if (TREE_CODE (newdecl) == FUNCTION_DECL) | |
471086d6 | 984 | { |
985 | tree f1 = TREE_TYPE (newdecl); | |
986 | tree f2 = TREE_TYPE (olddecl); | |
987 | tree p1 = TYPE_ARG_TYPES (f1); | |
988 | tree p2 = TYPE_ARG_TYPES (f2); | |
989 | ||
9ba4048d | 990 | if (CP_DECL_CONTEXT (newdecl) != CP_DECL_CONTEXT (olddecl) |
a2697ab6 | 991 | && ! (DECL_EXTERN_C_P (newdecl) |
992 | && DECL_EXTERN_C_P (olddecl))) | |
510e8b9c | 993 | return 0; |
994 | ||
471086d6 | 995 | if (TREE_CODE (f1) != TREE_CODE (f2)) |
30fbe833 | 996 | return 0; |
471086d6 | 997 | |
daf9ff67 | 998 | if (same_type_p (TREE_TYPE (f1), TREE_TYPE (f2))) |
0543e7a9 | 999 | { |
0f497990 | 1000 | if (p2 == NULL_TREE && DECL_EXTERN_C_P (olddecl) |
1001 | && (DECL_BUILT_IN (olddecl) | |
1002 | #ifndef NO_IMPLICIT_EXTERN_C | |
1003 | || (DECL_IN_SYSTEM_HEADER (newdecl) && !DECL_CLASS_SCOPE_P (newdecl)) | |
1004 | || (DECL_IN_SYSTEM_HEADER (olddecl) && !DECL_CLASS_SCOPE_P (olddecl)) | |
1005 | #endif | |
1006 | )) | |
e581f478 | 1007 | { |
1008 | types_match = self_promoting_args_p (p1); | |
1009 | if (p1 == void_list_node) | |
1010 | TREE_TYPE (newdecl) = TREE_TYPE (olddecl); | |
1011 | } | |
0f497990 | 1012 | #ifndef NO_IMPLICIT_EXTERN_C |
1013 | else if (p1 == NULL_TREE | |
1014 | && (DECL_EXTERN_C_P (olddecl) | |
1015 | && DECL_IN_SYSTEM_HEADER (olddecl) | |
1016 | && !DECL_CLASS_SCOPE_P (olddecl)) | |
1017 | && (DECL_EXTERN_C_P (newdecl) | |
1018 | && DECL_IN_SYSTEM_HEADER (newdecl) | |
1019 | && !DECL_CLASS_SCOPE_P (newdecl))) | |
e581f478 | 1020 | { |
1021 | types_match = self_promoting_args_p (p2); | |
1022 | TREE_TYPE (newdecl) = TREE_TYPE (olddecl); | |
1023 | } | |
0f497990 | 1024 | #endif |
0543e7a9 | 1025 | else |
3e04bd45 | 1026 | types_match = compparms (p1, p2); |
0543e7a9 | 1027 | } |
471086d6 | 1028 | else |
1029 | types_match = 0; | |
1030 | } | |
5b35cb67 | 1031 | else if (TREE_CODE (newdecl) == TEMPLATE_DECL) |
ac9386a0 | 1032 | { |
f9b9bf39 | 1033 | if (TREE_CODE (DECL_TEMPLATE_RESULT (newdecl)) |
1034 | != TREE_CODE (DECL_TEMPLATE_RESULT (olddecl))) | |
1035 | return 0; | |
1036 | ||
c0b419db | 1037 | if (!comp_template_parms (DECL_TEMPLATE_PARMS (newdecl), |
1038 | DECL_TEMPLATE_PARMS (olddecl))) | |
1039 | return 0; | |
1040 | ||
f3110581 | 1041 | if (TREE_CODE (DECL_TEMPLATE_RESULT (newdecl)) == TYPE_DECL) |
c0b419db | 1042 | types_match = same_type_p (TREE_TYPE (DECL_TEMPLATE_RESULT (olddecl)), |
1043 | TREE_TYPE (DECL_TEMPLATE_RESULT (newdecl))); | |
f3110581 | 1044 | else |
1045 | types_match = decls_match (DECL_TEMPLATE_RESULT (olddecl), | |
1046 | DECL_TEMPLATE_RESULT (newdecl)); | |
ac9386a0 | 1047 | } |
471086d6 | 1048 | else |
1049 | { | |
1050 | if (TREE_TYPE (newdecl) == error_mark_node) | |
1051 | types_match = TREE_TYPE (olddecl) == error_mark_node; | |
1052 | else if (TREE_TYPE (olddecl) == NULL_TREE) | |
1053 | types_match = TREE_TYPE (newdecl) == NULL_TREE; | |
ddb9bca7 | 1054 | else if (TREE_TYPE (newdecl) == NULL_TREE) |
1055 | types_match = 0; | |
471086d6 | 1056 | else |
ca23ec64 | 1057 | types_match = comptypes (TREE_TYPE (newdecl), |
daf9ff67 | 1058 | TREE_TYPE (olddecl), |
1059 | COMPARE_REDECLARATION); | |
471086d6 | 1060 | } |
1061 | ||
1062 | return types_match; | |
1063 | } | |
1064 | ||
1065 | /* If NEWDECL is `static' and an `extern' was seen previously, | |
dcbe7838 | 1066 | warn about it. OLDDECL is the previous declaration. |
471086d6 | 1067 | |
1068 | Note that this does not apply to the C++ case of declaring | |
1069 | a variable `extern const' and then later `const'. | |
1070 | ||
471086d6 | 1071 | Don't complain about built-in functions, since they are beyond |
1072 | the user's control. */ | |
1073 | ||
9a49d46b | 1074 | void |
1b72315d | 1075 | warn_extern_redeclared_static (tree newdecl, tree olddecl) |
471086d6 | 1076 | { |
dcbe7838 | 1077 | tree name; |
1078 | ||
980877d7 | 1079 | if (TREE_CODE (newdecl) == TYPE_DECL |
b81be439 | 1080 | || TREE_CODE (newdecl) == TEMPLATE_DECL |
2a9d763b | 1081 | || TREE_CODE (newdecl) == CONST_DECL |
1082 | || TREE_CODE (newdecl) == NAMESPACE_DECL) | |
471086d6 | 1083 | return; |
980877d7 | 1084 | |
8a4bf740 | 1085 | /* Don't get confused by static member functions; that's a different |
1086 | use of `static'. */ | |
1087 | if (TREE_CODE (newdecl) == FUNCTION_DECL | |
1088 | && DECL_STATIC_FUNCTION_P (newdecl)) | |
1089 | return; | |
471086d6 | 1090 | |
dcbe7838 | 1091 | /* If the old declaration was `static', or the new one isn't, then |
1092 | then everything is OK. */ | |
1093 | if (DECL_THIS_STATIC (olddecl) || !DECL_THIS_STATIC (newdecl)) | |
1094 | return; | |
1095 | ||
1096 | /* It's OK to declare a builtin function as `static'. */ | |
1097 | if (TREE_CODE (olddecl) == FUNCTION_DECL | |
1098 | && DECL_ARTIFICIAL (olddecl)) | |
1099 | return; | |
1100 | ||
471086d6 | 1101 | name = DECL_ASSEMBLER_NAME (newdecl); |
28bbd27a | 1102 | pedwarn ("`%D' was declared `extern' and later `static'", newdecl); |
dcbe7838 | 1103 | cp_pedwarn_at ("previous declaration of `%D'", olddecl); |
471086d6 | 1104 | } |
1105 | ||
947f430b | 1106 | /* If NEWDECL is a redeclaration of OLDDECL, merge the declarations. |
1107 | If the redeclaration is invalid, a diagnostic is issued, and the | |
1108 | error_mark_node is returned. Otherwise, OLDDECL is returned. | |
471086d6 | 1109 | |
947f430b | 1110 | If NEWDECL is not a redeclaration of OLDDECL, NULL_TREE is |
1111 | returned. */ | |
471086d6 | 1112 | |
947f430b | 1113 | tree |
1b72315d | 1114 | duplicate_decls (tree newdecl, tree olddecl) |
471086d6 | 1115 | { |
471086d6 | 1116 | unsigned olddecl_uid = DECL_UID (olddecl); |
1117 | int olddecl_friend = 0, types_match = 0; | |
3340d527 | 1118 | int new_defines_function = 0; |
e857e9c7 | 1119 | |
1120 | if (newdecl == olddecl) | |
947f430b | 1121 | return olddecl; |
471086d6 | 1122 | |
0543e7a9 | 1123 | types_match = decls_match (newdecl, olddecl); |
471086d6 | 1124 | |
471086d6 | 1125 | /* If either the type of the new decl or the type of the old decl is an |
1126 | error_mark_node, then that implies that we have already issued an | |
1127 | error (earlier) for some bogus type specification, and in that case, | |
1128 | it is rather pointless to harass the user with yet more error message | |
3340d527 | 1129 | about the same declaration, so just pretend the types match here. */ |
b465397d | 1130 | if (TREE_TYPE (newdecl) == error_mark_node |
1131 | || TREE_TYPE (olddecl) == error_mark_node) | |
471086d6 | 1132 | types_match = 1; |
980877d7 | 1133 | |
5955c361 | 1134 | if (DECL_P (olddecl) |
1135 | && TREE_CODE (newdecl) == FUNCTION_DECL | |
1136 | && TREE_CODE (olddecl) == FUNCTION_DECL | |
1137 | && (DECL_UNINLINABLE (newdecl) || DECL_UNINLINABLE (olddecl))) | |
1138 | { | |
1139 | if (DECL_DECLARED_INLINE_P (newdecl) | |
1140 | && DECL_UNINLINABLE (newdecl) | |
1141 | && lookup_attribute ("noinline", DECL_ATTRIBUTES (newdecl))) | |
1142 | /* Already warned elsewhere. */; | |
1143 | else if (DECL_DECLARED_INLINE_P (olddecl) | |
1144 | && DECL_UNINLINABLE (olddecl) | |
1145 | && lookup_attribute ("noinline", DECL_ATTRIBUTES (olddecl))) | |
1146 | /* Already warned. */; | |
1147 | else if (DECL_DECLARED_INLINE_P (newdecl) | |
1148 | && DECL_UNINLINABLE (olddecl) | |
1149 | && lookup_attribute ("noinline", DECL_ATTRIBUTES (olddecl))) | |
1150 | { | |
9bc3739f | 1151 | warning ("%Jfunction '%D' redeclared as inline", newdecl, newdecl); |
1152 | warning ("%Jprevious declaration of '%D' with attribute noinline", | |
1153 | olddecl, olddecl); | |
5955c361 | 1154 | } |
1155 | else if (DECL_DECLARED_INLINE_P (olddecl) | |
1156 | && DECL_UNINLINABLE (newdecl) | |
1157 | && lookup_attribute ("noinline", DECL_ATTRIBUTES (newdecl))) | |
1158 | { | |
9bc3739f | 1159 | warning ("%Jfunction '%D' redeclared with attribute noinline", |
1160 | newdecl, newdecl); | |
1161 | warning ("%Jprevious declaration of '%D' was inline", | |
1162 | olddecl, olddecl); | |
5955c361 | 1163 | } |
1164 | } | |
1165 | ||
a109dc3b | 1166 | /* Check for redeclaration and other discrepancies. */ |
48ec80c8 | 1167 | if (TREE_CODE (olddecl) == FUNCTION_DECL |
175a96e8 | 1168 | && DECL_ARTIFICIAL (olddecl)) |
1169 | { | |
1170 | if (TREE_CODE (newdecl) != FUNCTION_DECL) | |
1171 | { | |
ae8cbbc8 | 1172 | /* Avoid warnings redeclaring anticipated built-ins. */ |
1173 | if (DECL_ANTICIPATED (olddecl)) | |
947f430b | 1174 | return NULL_TREE; |
ae8cbbc8 | 1175 | |
175a96e8 | 1176 | /* If you declare a built-in or predefined function name as static, |
1177 | the old definition is overridden, but optionally warn this was a | |
1178 | bad choice of name. */ | |
1179 | if (! TREE_PUBLIC (newdecl)) | |
1180 | { | |
1181 | if (warn_shadow) | |
cf103c6c | 1182 | warning ("shadowing %s function `%#D'", |
175a96e8 | 1183 | DECL_BUILT_IN (olddecl) ? "built-in" : "library", |
1184 | olddecl); | |
1185 | /* Discard the old built-in function. */ | |
947f430b | 1186 | return NULL_TREE; |
175a96e8 | 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)) | |
cf103c6c | 1191 | warning ("library function `%#D' redeclared as non-function `%#D'", |
175a96e8 | 1192 | olddecl, newdecl); |
1193 | else | |
1194 | { | |
cf103c6c | 1195 | error ("declaration of `%#D'", newdecl); |
1196 | error ("conflicts with built-in declaration `%#D'", | |
d81e00a4 | 1197 | olddecl); |
175a96e8 | 1198 | } |
947f430b | 1199 | return NULL_TREE; |
d81e00a4 | 1200 | } |
175a96e8 | 1201 | else if (!types_match) |
471086d6 | 1202 | { |
ae8cbbc8 | 1203 | /* Avoid warnings redeclaring anticipated built-ins. */ |
1204 | if (DECL_ANTICIPATED (olddecl)) | |
e256d445 | 1205 | { |
1206 | /* Deal with fileptr_type_node. FILE type is not known | |
1207 | at the time we create the builtins. */ | |
1208 | tree t1, t2; | |
1209 | ||
1210 | for (t1 = TYPE_ARG_TYPES (TREE_TYPE (newdecl)), | |
1211 | t2 = TYPE_ARG_TYPES (TREE_TYPE (olddecl)); | |
1212 | t1 || t2; | |
1213 | t1 = TREE_CHAIN (t1), t2 = TREE_CHAIN (t2)) | |
1214 | if (!t1 || !t2) | |
1215 | break; | |
1216 | else if (TREE_VALUE (t2) == fileptr_type_node) | |
1217 | { | |
1218 | tree t = TREE_VALUE (t1); | |
1219 | ||
1220 | if (TREE_CODE (t) == POINTER_TYPE | |
1221 | && TYPE_NAME (TREE_TYPE (t)) | |
1222 | && DECL_NAME (TYPE_NAME (TREE_TYPE (t))) | |
1223 | == get_identifier ("FILE") | |
1224 | && compparms (TREE_CHAIN (t1), TREE_CHAIN (t2))) | |
1225 | { | |
1226 | tree oldargs = TYPE_ARG_TYPES (TREE_TYPE (olddecl)); | |
1227 | ||
1228 | TYPE_ARG_TYPES (TREE_TYPE (olddecl)) | |
1229 | = TYPE_ARG_TYPES (TREE_TYPE (newdecl)); | |
1230 | types_match = decls_match (newdecl, olddecl); | |
1231 | if (types_match) | |
1232 | return duplicate_decls (newdecl, olddecl); | |
1233 | TYPE_ARG_TYPES (TREE_TYPE (olddecl)) = oldargs; | |
1234 | } | |
1235 | } | |
1236 | else if (! same_type_p (TREE_VALUE (t1), TREE_VALUE (t2))) | |
1237 | break; | |
1238 | } | |
ae8cbbc8 | 1239 | else if ((DECL_EXTERN_C_P (newdecl) |
d7d79557 | 1240 | && DECL_EXTERN_C_P (olddecl)) |
1241 | || compparms (TYPE_ARG_TYPES (TREE_TYPE (newdecl)), | |
1242 | TYPE_ARG_TYPES (TREE_TYPE (olddecl)))) | |
d81e00a4 | 1243 | { |
175a96e8 | 1244 | /* A near match; override the builtin. */ |
1245 | ||
1246 | if (TREE_PUBLIC (newdecl)) | |
d81e00a4 | 1247 | { |
cf103c6c | 1248 | warning ("new declaration `%#D'", newdecl); |
1249 | warning ("ambiguates built-in declaration `%#D'", | |
175a96e8 | 1250 | olddecl); |
d81e00a4 | 1251 | } |
175a96e8 | 1252 | else if (warn_shadow) |
cf103c6c | 1253 | warning ("shadowing %s function `%#D'", |
175a96e8 | 1254 | DECL_BUILT_IN (olddecl) ? "built-in" : "library", |
1255 | olddecl); | |
d81e00a4 | 1256 | } |
175a96e8 | 1257 | else |
1258 | /* Discard the old built-in function. */ | |
947f430b | 1259 | return NULL_TREE; |
70e907c2 | 1260 | |
1261 | /* Replace the old RTL to avoid problems with inlining. */ | |
1262 | SET_DECL_RTL (olddecl, DECL_RTL (newdecl)); | |
471086d6 | 1263 | } |
88d394b3 | 1264 | /* Even if the types match, prefer the new declarations type |
4df55fce | 1265 | for anticipated built-ins, for exception lists, etc... */ |
88d394b3 | 1266 | else if (DECL_ANTICIPATED (olddecl)) |
8a6f9fad | 1267 | { |
f5af39bc | 1268 | tree type = TREE_TYPE (newdecl); |
1269 | tree attribs = (*targetm.merge_type_attributes) | |
1270 | (TREE_TYPE (olddecl), type); | |
1271 | ||
b3beaf30 | 1272 | type = cp_build_type_attribute_variant (type, attribs); |
f5af39bc | 1273 | TREE_TYPE (newdecl) = TREE_TYPE (olddecl) = type; |
8a6f9fad | 1274 | } |
980877d7 | 1275 | |
d7d79557 | 1276 | /* Whether or not the builtin can throw exceptions has no |
1277 | bearing on this declarator. */ | |
1278 | TREE_NOTHROW (olddecl) = 0; | |
1279 | ||
dcbe7838 | 1280 | if (DECL_THIS_STATIC (newdecl) && !DECL_THIS_STATIC (olddecl)) |
1281 | { | |
1282 | /* If a builtin function is redeclared as `static', merge | |
1283 | the declarations, but make the original one static. */ | |
1284 | DECL_THIS_STATIC (olddecl) = 1; | |
1285 | TREE_PUBLIC (olddecl) = 0; | |
3da16ddc | 1286 | |
f0edcca6 | 1287 | /* Make the old declaration consistent with the new one so |
1288 | that all remnants of the builtin-ness of this function | |
1289 | will be banished. */ | |
4b1984f5 | 1290 | SET_DECL_LANGUAGE (olddecl, DECL_LANGUAGE (newdecl)); |
0e8e37b2 | 1291 | SET_DECL_RTL (olddecl, DECL_RTL (newdecl)); |
dcbe7838 | 1292 | } |
bc3887cf | 1293 | } |
1294 | else if (TREE_CODE (olddecl) != TREE_CODE (newdecl)) | |
1295 | { | |
f826d4f9 | 1296 | if ((TREE_CODE (olddecl) == TYPE_DECL && DECL_ARTIFICIAL (olddecl) |
1297 | && TREE_CODE (newdecl) != TYPE_DECL | |
1298 | && ! (TREE_CODE (newdecl) == TEMPLATE_DECL | |
1299 | && TREE_CODE (DECL_TEMPLATE_RESULT (newdecl)) == TYPE_DECL)) | |
1300 | || (TREE_CODE (newdecl) == TYPE_DECL && DECL_ARTIFICIAL (newdecl) | |
1301 | && TREE_CODE (olddecl) != TYPE_DECL | |
1302 | && ! (TREE_CODE (olddecl) == TEMPLATE_DECL | |
1303 | && (TREE_CODE (DECL_TEMPLATE_RESULT (olddecl)) | |
1304 | == TYPE_DECL)))) | |
1305 | { | |
1306 | /* We do nothing special here, because C++ does such nasty | |
1307 | things with TYPE_DECLs. Instead, just let the TYPE_DECL | |
1308 | get shadowed, and know that if we need to find a TYPE_DECL | |
1309 | for a given name, we can look in the IDENTIFIER_TYPE_VALUE | |
1310 | slot of the identifier. */ | |
947f430b | 1311 | return NULL_TREE; |
f826d4f9 | 1312 | } |
1313 | ||
bc3887cf | 1314 | if ((TREE_CODE (newdecl) == FUNCTION_DECL |
e857e9c7 | 1315 | && DECL_FUNCTION_TEMPLATE_P (olddecl)) |
bc3887cf | 1316 | || (TREE_CODE (olddecl) == FUNCTION_DECL |
e857e9c7 | 1317 | && DECL_FUNCTION_TEMPLATE_P (newdecl))) |
947f430b | 1318 | return NULL_TREE; |
f826d4f9 | 1319 | |
cf103c6c | 1320 | error ("`%#D' redeclared as different kind of symbol", newdecl); |
bc3887cf | 1321 | if (TREE_CODE (olddecl) == TREE_LIST) |
1322 | olddecl = TREE_VALUE (olddecl); | |
905d4035 | 1323 | cp_error_at ("previous declaration of `%#D'", olddecl); |
bc3887cf | 1324 | |
1940f978 | 1325 | return error_mark_node; |
471086d6 | 1326 | } |
471086d6 | 1327 | else if (!types_match) |
1328 | { | |
9ba4048d | 1329 | if (CP_DECL_CONTEXT (newdecl) != CP_DECL_CONTEXT (olddecl)) |
91bbfe2a | 1330 | /* These are certainly not duplicate declarations; they're |
1331 | from different scopes. */ | |
947f430b | 1332 | return NULL_TREE; |
91bbfe2a | 1333 | |
0543e7a9 | 1334 | if (TREE_CODE (newdecl) == TEMPLATE_DECL) |
617abf06 | 1335 | { |
1336 | /* The name of a class template may not be declared to refer to | |
1337 | any other template, class, function, object, namespace, value, | |
96624a9e | 1338 | or type in the same scope. */ |
e857e9c7 | 1339 | if (TREE_CODE (DECL_TEMPLATE_RESULT (olddecl)) == TYPE_DECL |
1340 | || TREE_CODE (DECL_TEMPLATE_RESULT (newdecl)) == TYPE_DECL) | |
617abf06 | 1341 | { |
cf103c6c | 1342 | error ("declaration of template `%#D'", newdecl); |
905d4035 | 1343 | cp_error_at ("conflicts with previous declaration `%#D'", |
617abf06 | 1344 | olddecl); |
1345 | } | |
dbdf67c6 | 1346 | else if (TREE_CODE (DECL_TEMPLATE_RESULT (olddecl)) == FUNCTION_DECL |
1347 | && TREE_CODE (DECL_TEMPLATE_RESULT (newdecl)) == FUNCTION_DECL | |
1348 | && compparms (TYPE_ARG_TYPES (TREE_TYPE (DECL_TEMPLATE_RESULT (olddecl))), | |
3e04bd45 | 1349 | TYPE_ARG_TYPES (TREE_TYPE (DECL_TEMPLATE_RESULT (newdecl)))) |
668ae905 | 1350 | && comp_template_parms (DECL_TEMPLATE_PARMS (newdecl), |
a81e6834 | 1351 | DECL_TEMPLATE_PARMS (olddecl)) |
1352 | /* Template functions can be disambiguated by | |
1353 | return type. */ | |
1354 | && same_type_p (TREE_TYPE (TREE_TYPE (newdecl)), | |
1355 | TREE_TYPE (TREE_TYPE (olddecl)))) | |
dbdf67c6 | 1356 | { |
cf103c6c | 1357 | error ("new declaration `%#D'", newdecl); |
905d4035 | 1358 | cp_error_at ("ambiguates old declaration `%#D'", olddecl); |
dbdf67c6 | 1359 | } |
947f430b | 1360 | return NULL_TREE; |
617abf06 | 1361 | } |
0543e7a9 | 1362 | if (TREE_CODE (newdecl) == FUNCTION_DECL) |
1363 | { | |
a2697ab6 | 1364 | if (DECL_EXTERN_C_P (newdecl) && DECL_EXTERN_C_P (olddecl)) |
0543e7a9 | 1365 | { |
cf103c6c | 1366 | error ("declaration of C function `%#D' conflicts with", |
0543e7a9 | 1367 | newdecl); |
905d4035 | 1368 | cp_error_at ("previous declaration `%#D' here", olddecl); |
0543e7a9 | 1369 | } |
6495357a | 1370 | else if (compparms (TYPE_ARG_TYPES (TREE_TYPE (newdecl)), |
3e04bd45 | 1371 | TYPE_ARG_TYPES (TREE_TYPE (olddecl)))) |
94f3b32d | 1372 | { |
cf103c6c | 1373 | error ("new declaration `%#D'", newdecl); |
905d4035 | 1374 | cp_error_at ("ambiguates old declaration `%#D'", olddecl); |
94f3b32d | 1375 | } |
1376 | else | |
947f430b | 1377 | return NULL_TREE; |
0543e7a9 | 1378 | } |
28bbd27a | 1379 | else |
471086d6 | 1380 | { |
2a9d763b | 1381 | error ("conflicting declaration '%#D'", newdecl); |
1382 | cp_error_at ("'%D' has a previous declaration as `%#D'", | |
1383 | olddecl, olddecl); | |
947f430b | 1384 | return NULL_TREE; |
471086d6 | 1385 | } |
1386 | } | |
980877d7 | 1387 | else if (TREE_CODE (newdecl) == FUNCTION_DECL |
668ae905 | 1388 | && ((DECL_TEMPLATE_SPECIALIZATION (olddecl) |
1389 | && (!DECL_TEMPLATE_INFO (newdecl) | |
980877d7 | 1390 | || (DECL_TI_TEMPLATE (newdecl) |
668ae905 | 1391 | != DECL_TI_TEMPLATE (olddecl)))) |
1392 | || (DECL_TEMPLATE_SPECIALIZATION (newdecl) | |
1393 | && (!DECL_TEMPLATE_INFO (olddecl) | |
980877d7 | 1394 | || (DECL_TI_TEMPLATE (olddecl) |
668ae905 | 1395 | != DECL_TI_TEMPLATE (newdecl)))))) |
b1cfe2be | 1396 | /* It's OK to have a template specialization and a non-template |
1397 | with the same type, or to have specializations of two | |
668ae905 | 1398 | different templates with the same type. Note that if one is a |
1399 | specialization, and the other is an instantiation of the same | |
1400 | template, that we do not exit at this point. That situation | |
1401 | can occur if we instantiate a template class, and then | |
6c0cc2cd | 1402 | specialize one of its methods. This situation is valid, but |
668ae905 | 1403 | the declarations must be merged in the usual way. */ |
947f430b | 1404 | return NULL_TREE; |
980877d7 | 1405 | else if (TREE_CODE (newdecl) == FUNCTION_DECL |
1406 | && ((DECL_TEMPLATE_INSTANTIATION (olddecl) | |
668ae905 | 1407 | && !DECL_USE_TEMPLATE (newdecl)) |
1408 | || (DECL_TEMPLATE_INSTANTIATION (newdecl) | |
1409 | && !DECL_USE_TEMPLATE (olddecl)))) | |
1410 | /* One of the declarations is a template instantiation, and the | |
1411 | other is not a template at all. That's OK. */ | |
947f430b | 1412 | return NULL_TREE; |
aae06a58 | 1413 | else if (TREE_CODE (newdecl) == NAMESPACE_DECL |
1414 | && DECL_NAMESPACE_ALIAS (newdecl) | |
1415 | && DECL_NAMESPACE_ALIAS (newdecl) == DECL_NAMESPACE_ALIAS (olddecl)) | |
947f430b | 1416 | /* In [namespace.alias] we have: |
1417 | ||
1418 | In a declarative region, a namespace-alias-definition can be | |
1419 | used to redefine a namespace-alias declared in that declarative | |
1420 | region to refer only to the namespace to which it already | |
1421 | refers. | |
1422 | ||
1423 | Therefore, if we encounter a second alias directive for the same | |
1424 | alias, we can just ignore the second directive. */ | |
1425 | return olddecl; | |
471086d6 | 1426 | else |
1427 | { | |
e1721763 | 1428 | const char *errmsg = redeclaration_error_message (newdecl, olddecl); |
905d4035 | 1429 | if (errmsg) |
471086d6 | 1430 | { |
cf103c6c | 1431 | error (errmsg, newdecl); |
471086d6 | 1432 | if (DECL_NAME (olddecl) != NULL_TREE) |
1433 | cp_error_at ((DECL_INITIAL (olddecl) | |
8417823c | 1434 | && namespace_bindings_p ()) |
905d4035 | 1435 | ? "`%#D' previously defined here" |
1436 | : "`%#D' previously declared here", olddecl); | |
947f430b | 1437 | return error_mark_node; |
471086d6 | 1438 | } |
1439 | else if (TREE_CODE (olddecl) == FUNCTION_DECL | |
1440 | && DECL_INITIAL (olddecl) != NULL_TREE | |
1441 | && TYPE_ARG_TYPES (TREE_TYPE (olddecl)) == NULL_TREE | |
1442 | && TYPE_ARG_TYPES (TREE_TYPE (newdecl)) != NULL_TREE) | |
1443 | { | |
1444 | /* Prototype decl follows defn w/o prototype. */ | |
905d4035 | 1445 | cp_warning_at ("prototype for `%#D'", newdecl); |
9bc3739f | 1446 | warning ("%Jfollows non-prototype definition here", olddecl); |
471086d6 | 1447 | } |
1448 | else if (TREE_CODE (olddecl) == FUNCTION_DECL | |
1449 | && DECL_LANGUAGE (newdecl) != DECL_LANGUAGE (olddecl)) | |
0543e7a9 | 1450 | { |
1451 | /* extern "C" int foo (); | |
1452 | int foo () { bar (); } | |
1453 | is OK. */ | |
b53db2b0 | 1454 | if (current_lang_depth () == 0) |
4b1984f5 | 1455 | SET_DECL_LANGUAGE (newdecl, DECL_LANGUAGE (olddecl)); |
0543e7a9 | 1456 | else |
1457 | { | |
905d4035 | 1458 | cp_error_at ("previous declaration of `%#D' with %L linkage", |
0543e7a9 | 1459 | olddecl, DECL_LANGUAGE (olddecl)); |
cf103c6c | 1460 | error ("conflicts with new declaration with %L linkage", |
0543e7a9 | 1461 | DECL_LANGUAGE (newdecl)); |
1462 | } | |
1463 | } | |
bcf789d7 | 1464 | |
2329ce7e | 1465 | if (DECL_LANG_SPECIFIC (olddecl) && DECL_USE_TEMPLATE (olddecl)) |
a5a4ff77 | 1466 | ; |
1467 | else if (TREE_CODE (olddecl) == FUNCTION_DECL) | |
bcf789d7 | 1468 | { |
1469 | tree t1 = TYPE_ARG_TYPES (TREE_TYPE (olddecl)); | |
1470 | tree t2 = TYPE_ARG_TYPES (TREE_TYPE (newdecl)); | |
1471 | int i = 1; | |
1472 | ||
1473 | if (TREE_CODE (TREE_TYPE (newdecl)) == METHOD_TYPE) | |
1474 | t1 = TREE_CHAIN (t1), t2 = TREE_CHAIN (t2); | |
980877d7 | 1475 | |
bcf789d7 | 1476 | for (; t1 && t1 != void_list_node; |
1477 | t1 = TREE_CHAIN (t1), t2 = TREE_CHAIN (t2), i++) | |
1478 | if (TREE_PURPOSE (t1) && TREE_PURPOSE (t2)) | |
1479 | { | |
8953e390 | 1480 | if (1 == simple_cst_equal (TREE_PURPOSE (t1), |
1481 | TREE_PURPOSE (t2))) | |
bcf789d7 | 1482 | { |
26c29087 | 1483 | pedwarn ("default argument given for parameter %d of `%#D'", |
1484 | i, newdecl); | |
1485 | cp_pedwarn_at ("after previous specification in `%#D'", | |
1486 | olddecl); | |
bcf789d7 | 1487 | } |
1488 | else | |
1489 | { | |
cf103c6c | 1490 | error ("default argument given for parameter %d of `%#D'", |
bcf789d7 | 1491 | i, newdecl); |
905d4035 | 1492 | cp_error_at ("after previous specification in `%#D'", |
bcf789d7 | 1493 | olddecl); |
1494 | } | |
1495 | } | |
127a1cd0 | 1496 | |
d3981643 | 1497 | if (DECL_DECLARED_INLINE_P (newdecl) |
1498 | && ! DECL_DECLARED_INLINE_P (olddecl) | |
d200dc92 | 1499 | && TREE_ADDRESSABLE (olddecl) && warn_inline) |
ef34cee5 | 1500 | { |
9bc3739f | 1501 | warning ("`%#D' was used before it was declared inline", newdecl); |
1502 | warning ("%Jprevious non-inline declaration here", olddecl); | |
ef34cee5 | 1503 | } |
bcf789d7 | 1504 | } |
471086d6 | 1505 | } |
1506 | ||
c498fbee | 1507 | /* Do not merge an implicit typedef with an explicit one. In: |
1508 | ||
1509 | class A; | |
1510 | ... | |
1511 | typedef class A A __attribute__ ((foo)); | |
1512 | ||
1513 | the attribute should apply only to the typedef. */ | |
1514 | if (TREE_CODE (olddecl) == TYPE_DECL | |
1515 | && (DECL_IMPLICIT_TYPEDEF_P (olddecl) | |
1516 | || DECL_IMPLICIT_TYPEDEF_P (newdecl))) | |
947f430b | 1517 | return NULL_TREE; |
c498fbee | 1518 | |
471086d6 | 1519 | /* If new decl is `static' and an `extern' was seen previously, |
1520 | warn about it. */ | |
1521 | warn_extern_redeclared_static (newdecl, olddecl); | |
1522 | ||
96624a9e | 1523 | /* We have committed to returning 1 at this point. */ |
471086d6 | 1524 | if (TREE_CODE (newdecl) == FUNCTION_DECL) |
1525 | { | |
1526 | /* Now that functions must hold information normally held | |
1527 | by field decls, there is extra work to do so that | |
1528 | declaration information does not get destroyed during | |
1529 | definition. */ | |
1530 | if (DECL_VINDEX (olddecl)) | |
1531 | DECL_VINDEX (newdecl) = DECL_VINDEX (olddecl); | |
1532 | if (DECL_CONTEXT (olddecl)) | |
1533 | DECL_CONTEXT (newdecl) = DECL_CONTEXT (olddecl); | |
bcf789d7 | 1534 | DECL_STATIC_CONSTRUCTOR (newdecl) |= DECL_STATIC_CONSTRUCTOR (olddecl); |
1535 | DECL_STATIC_DESTRUCTOR (newdecl) |= DECL_STATIC_DESTRUCTOR (olddecl); | |
a98fd0a1 | 1536 | DECL_PURE_VIRTUAL_P (newdecl) |= DECL_PURE_VIRTUAL_P (olddecl); |
8cb67d5d | 1537 | DECL_VIRTUAL_P (newdecl) |= DECL_VIRTUAL_P (olddecl); |
6588242c | 1538 | DECL_NEEDS_FINAL_OVERRIDER_P (newdecl) |= DECL_NEEDS_FINAL_OVERRIDER_P (olddecl); |
8a4bf740 | 1539 | DECL_THIS_STATIC (newdecl) |= DECL_THIS_STATIC (olddecl); |
dcbeb3ef | 1540 | if (DECL_OVERLOADED_OPERATOR_P (olddecl) != ERROR_MARK) |
1541 | SET_OVERLOADED_OPERATOR_CODE | |
1542 | (newdecl, DECL_OVERLOADED_OPERATOR_P (olddecl)); | |
3340d527 | 1543 | new_defines_function = DECL_INITIAL (newdecl) != NULL_TREE; |
980877d7 | 1544 | |
3340d527 | 1545 | /* Optionally warn about more than one declaration for the same |
1546 | name, but don't warn about a function declaration followed by a | |
1547 | definition. */ | |
1548 | if (warn_redundant_decls && ! DECL_ARTIFICIAL (olddecl) | |
1549 | && !(new_defines_function && DECL_INITIAL (olddecl) == NULL_TREE) | |
a109dc3b | 1550 | /* Don't warn about extern decl followed by definition. */ |
3340d527 | 1551 | && !(DECL_EXTERNAL (olddecl) && ! DECL_EXTERNAL (newdecl)) |
a109dc3b | 1552 | /* Don't warn about friends, let add_friend take care of it. */ |
7bf4741d | 1553 | && ! (DECL_FRIEND_P (newdecl) || DECL_FRIEND_P (olddecl))) |
3340d527 | 1554 | { |
cf103c6c | 1555 | warning ("redundant redeclaration of `%D' in same scope", newdecl); |
905d4035 | 1556 | cp_warning_at ("previous declaration of `%D'", olddecl); |
3340d527 | 1557 | } |
471086d6 | 1558 | } |
1559 | ||
1560 | /* Deal with C++: must preserve virtual function table size. */ | |
1561 | if (TREE_CODE (olddecl) == TYPE_DECL) | |
1562 | { | |
cd16867a | 1563 | tree newtype = TREE_TYPE (newdecl); |
1564 | tree oldtype = TREE_TYPE (olddecl); | |
471086d6 | 1565 | |
1566 | if (newtype != error_mark_node && oldtype != error_mark_node | |
1567 | && TYPE_LANG_SPECIFIC (newtype) && TYPE_LANG_SPECIFIC (oldtype)) | |
c83788c9 | 1568 | CLASSTYPE_FRIEND_CLASSES (newtype) |
1569 | = CLASSTYPE_FRIEND_CLASSES (oldtype); | |
4df55fce | 1570 | |
33f7d3d2 | 1571 | DECL_ORIGINAL_TYPE (newdecl) = DECL_ORIGINAL_TYPE (olddecl); |
471086d6 | 1572 | } |
1573 | ||
471086d6 | 1574 | /* Copy all the DECL_... slots specified in the new decl |
1575 | except for any that we copy here from the old type. */ | |
e3c541f0 | 1576 | DECL_ATTRIBUTES (newdecl) |
57e4bbfb | 1577 | = (*targetm.merge_decl_attributes) (olddecl, newdecl); |
471086d6 | 1578 | |
e857e9c7 | 1579 | if (TREE_CODE (newdecl) == TEMPLATE_DECL) |
1580 | { | |
a072266a | 1581 | TREE_TYPE (olddecl) = TREE_TYPE (DECL_TEMPLATE_RESULT (olddecl)); |
980877d7 | 1582 | DECL_TEMPLATE_SPECIALIZATIONS (olddecl) |
a072266a | 1583 | = chainon (DECL_TEMPLATE_SPECIALIZATIONS (olddecl), |
1584 | DECL_TEMPLATE_SPECIALIZATIONS (newdecl)); | |
980877d7 | 1585 | |
6ac91b4a | 1586 | /* If the new declaration is a definition, update the file and |
1587 | line information on the declaration. */ | |
a7501a3c | 1588 | if (DECL_INITIAL (DECL_TEMPLATE_RESULT (olddecl)) == NULL_TREE |
1589 | && DECL_INITIAL (DECL_TEMPLATE_RESULT (newdecl)) != NULL_TREE) | |
6ac91b4a | 1590 | { |
346064d9 | 1591 | DECL_SOURCE_LOCATION (olddecl) |
1592 | = DECL_SOURCE_LOCATION (DECL_TEMPLATE_RESULT (olddecl)) | |
1593 | = DECL_SOURCE_LOCATION (newdecl); | |
d45cef9b | 1594 | if (DECL_FUNCTION_TEMPLATE_P (newdecl)) |
1595 | DECL_ARGUMENTS (DECL_TEMPLATE_RESULT (olddecl)) | |
1596 | = DECL_ARGUMENTS (DECL_TEMPLATE_RESULT (newdecl)); | |
6ac91b4a | 1597 | } |
1598 | ||
3b67dbda | 1599 | if (DECL_FUNCTION_TEMPLATE_P (newdecl)) |
1600 | { | |
1601 | DECL_INLINE (DECL_TEMPLATE_RESULT (olddecl)) | |
1602 | |= DECL_INLINE (DECL_TEMPLATE_RESULT (newdecl)); | |
1603 | DECL_DECLARED_INLINE_P (DECL_TEMPLATE_RESULT (olddecl)) | |
1604 | |= DECL_DECLARED_INLINE_P (DECL_TEMPLATE_RESULT (newdecl)); | |
1605 | } | |
1606 | ||
947f430b | 1607 | return olddecl; |
e857e9c7 | 1608 | } |
980877d7 | 1609 | |
471086d6 | 1610 | if (types_match) |
1611 | { | |
1612 | /* Automatically handles default parameters. */ | |
1613 | tree oldtype = TREE_TYPE (olddecl); | |
bcf789d7 | 1614 | tree newtype; |
471086d6 | 1615 | |
bcf789d7 | 1616 | /* Merge the data types specified in the two decls. */ |
be94aed9 | 1617 | newtype = merge_types (TREE_TYPE (newdecl), TREE_TYPE (olddecl)); |
bcf789d7 | 1618 | |
be94aed9 | 1619 | /* If merge_types produces a non-typedef type, just use the old type. */ |
1459abb8 | 1620 | if (TREE_CODE (newdecl) == TYPE_DECL |
1621 | && newtype == DECL_ORIGINAL_TYPE (newdecl)) | |
1622 | newtype = oldtype; | |
1623 | ||
471086d6 | 1624 | if (TREE_CODE (newdecl) == VAR_DECL) |
23ed74d8 | 1625 | { |
1626 | DECL_THIS_EXTERN (newdecl) |= DECL_THIS_EXTERN (olddecl); | |
1627 | DECL_INITIALIZED_P (newdecl) |= DECL_INITIALIZED_P (olddecl); | |
878870b4 | 1628 | DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (newdecl) |
1629 | |= DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (olddecl); | |
23ed74d8 | 1630 | } |
1631 | ||
be94aed9 | 1632 | /* Do this after calling `merge_types' so that default |
471086d6 | 1633 | parameters don't confuse us. */ |
1634 | else if (TREE_CODE (newdecl) == FUNCTION_DECL | |
1635 | && (TYPE_RAISES_EXCEPTIONS (TREE_TYPE (newdecl)) | |
1636 | != TYPE_RAISES_EXCEPTIONS (TREE_TYPE (olddecl)))) | |
1637 | { | |
ce28ee2e | 1638 | TREE_TYPE (newdecl) = build_exception_variant (newtype, |
471086d6 | 1639 | TYPE_RAISES_EXCEPTIONS (TREE_TYPE (newdecl))); |
ce28ee2e | 1640 | TREE_TYPE (olddecl) = build_exception_variant (newtype, |
471086d6 | 1641 | TYPE_RAISES_EXCEPTIONS (oldtype)); |
1642 | ||
e7b664be | 1643 | if ((pedantic || ! DECL_IN_SYSTEM_HEADER (olddecl)) |
346064d9 | 1644 | && DECL_SOURCE_LINE (olddecl) != 0 |
39c8ac16 | 1645 | && flag_exceptions |
316b7a44 | 1646 | && !comp_except_specs (TYPE_RAISES_EXCEPTIONS (TREE_TYPE (newdecl)), |
1647 | TYPE_RAISES_EXCEPTIONS (TREE_TYPE (olddecl)), 1)) | |
471086d6 | 1648 | { |
cf103c6c | 1649 | error ("declaration of `%F' throws different exceptions", |
346064d9 | 1650 | newdecl); |
deb27283 | 1651 | cp_error_at ("than previous declaration `%F'", olddecl); |
471086d6 | 1652 | } |
1653 | } | |
1654 | TREE_TYPE (newdecl) = TREE_TYPE (olddecl) = newtype; | |
1655 | ||
1656 | /* Lay the type out, unless already done. */ | |
4d9c8e11 | 1657 | if (! same_type_p (newtype, oldtype) |
e857e9c7 | 1658 | && TREE_TYPE (newdecl) != error_mark_node |
3cc0b4b9 | 1659 | && !(processing_template_decl && uses_template_parms (newdecl))) |
1e66592c | 1660 | layout_type (TREE_TYPE (newdecl)); |
1661 | ||
e857e9c7 | 1662 | if ((TREE_CODE (newdecl) == VAR_DECL |
1663 | || TREE_CODE (newdecl) == PARM_DECL | |
1664 | || TREE_CODE (newdecl) == RESULT_DECL | |
1665 | || TREE_CODE (newdecl) == FIELD_DECL | |
1666 | || TREE_CODE (newdecl) == TYPE_DECL) | |
3cc0b4b9 | 1667 | && !(processing_template_decl && uses_template_parms (newdecl))) |
1e66592c | 1668 | layout_decl (newdecl, 0); |
471086d6 | 1669 | |
1670 | /* Merge the type qualifiers. */ | |
1671 | if (TREE_READONLY (newdecl)) | |
1672 | TREE_READONLY (olddecl) = 1; | |
1673 | if (TREE_THIS_VOLATILE (newdecl)) | |
1674 | TREE_THIS_VOLATILE (olddecl) = 1; | |
1675 | ||
1676 | /* Merge the initialization information. */ | |
0543e7a9 | 1677 | if (DECL_INITIAL (newdecl) == NULL_TREE |
1678 | && DECL_INITIAL (olddecl) != NULL_TREE) | |
1679 | { | |
1680 | DECL_INITIAL (newdecl) = DECL_INITIAL (olddecl); | |
346064d9 | 1681 | DECL_SOURCE_LOCATION (newdecl) = DECL_SOURCE_LOCATION (olddecl); |
c6138f2d | 1682 | if (CAN_HAVE_FULL_LANG_DECL_P (newdecl) |
1683 | && DECL_LANG_SPECIFIC (newdecl) | |
a072266a | 1684 | && DECL_LANG_SPECIFIC (olddecl)) |
acd77abe | 1685 | { |
1686 | DECL_SAVED_TREE (newdecl) = DECL_SAVED_TREE (olddecl); | |
cbc44df5 | 1687 | DECL_STRUCT_FUNCTION (newdecl) = DECL_STRUCT_FUNCTION (olddecl); |
acd77abe | 1688 | } |
0543e7a9 | 1689 | } |
bc3887cf | 1690 | |
1691 | /* Merge the section attribute. | |
1692 | We want to issue an error if the sections conflict but that must be | |
1693 | done later in decl_attributes since we are called before attributes | |
1694 | are assigned. */ | |
1695 | if (DECL_SECTION_NAME (newdecl) == NULL_TREE) | |
1696 | DECL_SECTION_NAME (newdecl) = DECL_SECTION_NAME (olddecl); | |
1697 | ||
8f8ac140 | 1698 | if (TREE_CODE (newdecl) == FUNCTION_DECL) |
1699 | { | |
1700 | DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (newdecl) | |
1701 | |= DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (olddecl); | |
32ef1cd2 | 1702 | DECL_NO_LIMIT_STACK (newdecl) |= DECL_NO_LIMIT_STACK (olddecl); |
f2f6bdab | 1703 | TREE_THIS_VOLATILE (newdecl) |= TREE_THIS_VOLATILE (olddecl); |
1704 | TREE_READONLY (newdecl) |= TREE_READONLY (olddecl); | |
1705 | TREE_NOTHROW (newdecl) |= TREE_NOTHROW (olddecl); | |
32ef1cd2 | 1706 | DECL_IS_MALLOC (newdecl) |= DECL_IS_MALLOC (olddecl); |
1707 | DECL_IS_PURE (newdecl) |= DECL_IS_PURE (olddecl); | |
b3609646 | 1708 | /* Keep the old RTL. */ |
1709 | COPY_DECL_RTL (olddecl, newdecl); | |
1710 | } | |
1711 | else if (TREE_CODE (newdecl) == VAR_DECL | |
1712 | && (DECL_SIZE (olddecl) || !DECL_SIZE (newdecl))) | |
1713 | { | |
1714 | /* Keep the old RTL. We cannot keep the old RTL if the old | |
1715 | declaration was for an incomplete object and the new | |
1716 | declaration is not since many attributes of the RTL will | |
1717 | change. */ | |
1718 | COPY_DECL_RTL (olddecl, newdecl); | |
8f8ac140 | 1719 | } |
471086d6 | 1720 | } |
1721 | /* If cannot merge, then use the new type and qualifiers, | |
1722 | and don't preserve the old rtl. */ | |
1723 | else | |
1724 | { | |
1725 | /* Clean out any memory we had of the old declaration. */ | |
1726 | tree oldstatic = value_member (olddecl, static_aggregates); | |
1727 | if (oldstatic) | |
1728 | TREE_VALUE (oldstatic) = error_mark_node; | |
1729 | ||
1730 | TREE_TYPE (olddecl) = TREE_TYPE (newdecl); | |
1731 | TREE_READONLY (olddecl) = TREE_READONLY (newdecl); | |
1732 | TREE_THIS_VOLATILE (olddecl) = TREE_THIS_VOLATILE (newdecl); | |
1733 | TREE_SIDE_EFFECTS (olddecl) = TREE_SIDE_EFFECTS (newdecl); | |
1734 | } | |
1735 | ||
1736 | /* Merge the storage class information. */ | |
296c463e | 1737 | merge_weak (newdecl, olddecl); |
1738 | ||
96624a9e | 1739 | DECL_ONE_ONLY (newdecl) |= DECL_ONE_ONLY (olddecl); |
73aad9b9 | 1740 | DECL_DEFER_OUTPUT (newdecl) |= DECL_DEFER_OUTPUT (olddecl); |
d0622bdf | 1741 | TREE_PUBLIC (newdecl) = TREE_PUBLIC (olddecl); |
1742 | TREE_STATIC (olddecl) = TREE_STATIC (newdecl) |= TREE_STATIC (olddecl); | |
1743 | if (! DECL_EXTERNAL (olddecl)) | |
1744 | DECL_EXTERNAL (newdecl) = 0; | |
980877d7 | 1745 | |
3340d527 | 1746 | if (DECL_LANG_SPECIFIC (newdecl) && DECL_LANG_SPECIFIC (olddecl)) |
471086d6 | 1747 | { |
d0622bdf | 1748 | DECL_INTERFACE_KNOWN (newdecl) |= DECL_INTERFACE_KNOWN (olddecl); |
1749 | DECL_NOT_REALLY_EXTERN (newdecl) |= DECL_NOT_REALLY_EXTERN (olddecl); | |
9d06cca0 | 1750 | DECL_COMDAT (newdecl) |= DECL_COMDAT (olddecl); |
980877d7 | 1751 | DECL_TEMPLATE_INSTANTIATED (newdecl) |
2699dcee | 1752 | |= DECL_TEMPLATE_INSTANTIATED (olddecl); |
3340d527 | 1753 | /* Don't really know how much of the language-specific |
1754 | values we should copy from old to new. */ | |
1755 | DECL_IN_AGGR_P (newdecl) = DECL_IN_AGGR_P (olddecl); | |
1f3233d1 | 1756 | DECL_LANG_SPECIFIC (newdecl)->decl_flags.u2 = |
1757 | DECL_LANG_SPECIFIC (olddecl)->decl_flags.u2; | |
3340d527 | 1758 | DECL_NONCONVERTING_P (newdecl) = DECL_NONCONVERTING_P (olddecl); |
4012c20a | 1759 | DECL_TEMPLATE_INFO (newdecl) = DECL_TEMPLATE_INFO (olddecl); |
c792eccc | 1760 | DECL_INITIALIZED_IN_CLASS_P (newdecl) |
1761 | |= DECL_INITIALIZED_IN_CLASS_P (olddecl); | |
3340d527 | 1762 | olddecl_friend = DECL_FRIEND_P (olddecl); |
a731c87f | 1763 | |
1764 | /* Only functions have DECL_BEFRIENDING_CLASSES. */ | |
1765 | if (TREE_CODE (newdecl) == FUNCTION_DECL | |
1766 | || DECL_FUNCTION_TEMPLATE_P (newdecl)) | |
641985fa | 1767 | { |
1768 | DECL_BEFRIENDING_CLASSES (newdecl) | |
1769 | = chainon (DECL_BEFRIENDING_CLASSES (newdecl), | |
1770 | DECL_BEFRIENDING_CLASSES (olddecl)); | |
fb6e00c5 | 1771 | /* DECL_THUNKS is only valid for virtual functions, |
1772 | otherwise it is a DECL_FRIEND_CONTEXT. */ | |
1773 | if (DECL_VIRTUAL_P (newdecl)) | |
1774 | DECL_THUNKS (newdecl) = DECL_THUNKS (olddecl); | |
641985fa | 1775 | } |
471086d6 | 1776 | } |
1777 | ||
471086d6 | 1778 | if (TREE_CODE (newdecl) == FUNCTION_DECL) |
1779 | { | |
980877d7 | 1780 | if (DECL_TEMPLATE_INSTANTIATION (olddecl) |
1781 | && !DECL_TEMPLATE_INSTANTIATION (newdecl)) | |
668ae905 | 1782 | { |
1783 | /* If newdecl is not a specialization, then it is not a | |
1784 | template-related function at all. And that means that we | |
c465b94a | 1785 | should have exited above, returning 0. */ |
668ae905 | 1786 | my_friendly_assert (DECL_TEMPLATE_SPECIALIZATION (newdecl), |
1787 | 0); | |
1788 | ||
980877d7 | 1789 | if (TREE_USED (olddecl)) |
668ae905 | 1790 | /* From [temp.expl.spec]: |
980877d7 | 1791 | |
668ae905 | 1792 | If a template, a member template or the member of a class |
1793 | template is explicitly specialized then that | |
1794 | specialization shall be declared before the first use of | |
1795 | that specialization that would cause an implicit | |
1796 | instantiation to take place, in every translation unit in | |
1797 | which such a use occurs. */ | |
cf103c6c | 1798 | error ("explicit specialization of %D after first use", |
668ae905 | 1799 | olddecl); |
1800 | ||
1801 | SET_DECL_TEMPLATE_SPECIALIZATION (olddecl); | |
1d1c6a54 | 1802 | |
1803 | /* [temp.expl.spec/14] We don't inline explicit specialization | |
1804 | just because the primary template says so. */ | |
668ae905 | 1805 | } |
1d1c6a54 | 1806 | else |
1807 | { | |
1808 | if (DECL_PENDING_INLINE_INFO (newdecl) == 0) | |
1809 | DECL_PENDING_INLINE_INFO (newdecl) = DECL_PENDING_INLINE_INFO (olddecl); | |
bb09dca5 | 1810 | |
1d1c6a54 | 1811 | DECL_DECLARED_INLINE_P (newdecl) |= DECL_DECLARED_INLINE_P (olddecl); |
bb09dca5 | 1812 | |
1d1c6a54 | 1813 | /* If either decl says `inline', this fn is inline, unless |
1814 | its definition was passed already. */ | |
1815 | if (DECL_INLINE (newdecl) && DECL_INITIAL (olddecl) == NULL_TREE) | |
1816 | DECL_INLINE (olddecl) = 1; | |
1817 | DECL_INLINE (newdecl) = DECL_INLINE (olddecl); | |
1818 | ||
1819 | DECL_UNINLINABLE (newdecl) = DECL_UNINLINABLE (olddecl) | |
1820 | = (DECL_UNINLINABLE (newdecl) || DECL_UNINLINABLE (olddecl)); | |
1821 | } | |
5955c361 | 1822 | |
8f80e66d | 1823 | /* Preserve abstractness on cloned [cd]tors. */ |
1824 | DECL_ABSTRACT (newdecl) = DECL_ABSTRACT (olddecl); | |
1825 | ||
94f3b32d | 1826 | if (! types_match) |
1827 | { | |
4b1984f5 | 1828 | SET_DECL_LANGUAGE (olddecl, DECL_LANGUAGE (newdecl)); |
7e64c604 | 1829 | COPY_DECL_ASSEMBLER_NAME (newdecl, olddecl); |
0e8e37b2 | 1830 | SET_DECL_RTL (olddecl, DECL_RTL (newdecl)); |
e857e9c7 | 1831 | } |
1832 | if (! types_match || new_defines_function) | |
1833 | { | |
8036fa43 | 1834 | /* These need to be copied so that the names are available. |
1835 | Note that if the types do match, we'll preserve inline | |
1836 | info and other bits, but if not, we won't. */ | |
94f3b32d | 1837 | DECL_ARGUMENTS (olddecl) = DECL_ARGUMENTS (newdecl); |
1838 | DECL_RESULT (olddecl) = DECL_RESULT (newdecl); | |
94f3b32d | 1839 | } |
471086d6 | 1840 | if (new_defines_function) |
1841 | /* If defining a function declared with other language | |
1842 | linkage, use the previously declared language linkage. */ | |
4b1984f5 | 1843 | SET_DECL_LANGUAGE (newdecl, DECL_LANGUAGE (olddecl)); |
8036fa43 | 1844 | else if (types_match) |
471086d6 | 1845 | { |
1846 | /* If redeclaring a builtin function, and not a definition, | |
1847 | it stays built in. */ | |
1848 | if (DECL_BUILT_IN (olddecl)) | |
1849 | { | |
8305149e | 1850 | DECL_BUILT_IN_CLASS (newdecl) = DECL_BUILT_IN_CLASS (olddecl); |
bc3887cf | 1851 | DECL_FUNCTION_CODE (newdecl) = DECL_FUNCTION_CODE (olddecl); |
471086d6 | 1852 | /* If we're keeping the built-in definition, keep the rtl, |
1853 | regardless of declaration matches. */ | |
0e8e37b2 | 1854 | SET_DECL_RTL (newdecl, DECL_RTL (olddecl)); |
471086d6 | 1855 | } |
471086d6 | 1856 | |
1857 | DECL_RESULT (newdecl) = DECL_RESULT (olddecl); | |
471086d6 | 1858 | /* Don't clear out the arguments if we're redefining a function. */ |
1859 | if (DECL_ARGUMENTS (olddecl)) | |
1860 | DECL_ARGUMENTS (newdecl) = DECL_ARGUMENTS (olddecl); | |
1861 | } | |
1862 | } | |
6146c0d9 | 1863 | else if (TREE_CODE (newdecl) == NAMESPACE_DECL) |
1864 | NAMESPACE_LEVEL (newdecl) = NAMESPACE_LEVEL (olddecl); | |
d0622bdf | 1865 | |
471086d6 | 1866 | /* Now preserve various other info from the definition. */ |
1867 | TREE_ADDRESSABLE (newdecl) = TREE_ADDRESSABLE (olddecl); | |
1868 | TREE_ASM_WRITTEN (newdecl) = TREE_ASM_WRITTEN (olddecl); | |
1869 | DECL_COMMON (newdecl) = DECL_COMMON (olddecl); | |
7e64c604 | 1870 | COPY_DECL_ASSEMBLER_NAME (olddecl, newdecl); |
471086d6 | 1871 | |
331bc0ad | 1872 | /* If either declaration has a nondefault visibility, use it. */ |
50333348 | 1873 | if (DECL_VISIBILITY (olddecl) != VISIBILITY_DEFAULT) |
1874 | { | |
1875 | if (DECL_VISIBILITY (newdecl) != VISIBILITY_DEFAULT | |
1876 | && DECL_VISIBILITY (newdecl) != DECL_VISIBILITY (olddecl)) | |
1877 | { | |
1878 | warning ("%J'%D': visibility attribute ignored because it", | |
1879 | newdecl, newdecl); | |
1880 | warning ("%Jconflicts with previous declaration here", olddecl); | |
1881 | } | |
1882 | DECL_VISIBILITY (newdecl) = DECL_VISIBILITY (olddecl); | |
1883 | } | |
1884 | ||
471086d6 | 1885 | if (TREE_CODE (newdecl) == FUNCTION_DECL) |
1886 | { | |
1887 | int function_size; | |
471086d6 | 1888 | |
1889 | function_size = sizeof (struct tree_decl); | |
1890 | ||
f702522a | 1891 | memcpy ((char *) olddecl + sizeof (struct tree_common), |
1892 | (char *) newdecl + sizeof (struct tree_common), | |
1893 | function_size - sizeof (struct tree_common)); | |
471086d6 | 1894 | |
668ae905 | 1895 | if (DECL_TEMPLATE_INSTANTIATION (newdecl)) |
0886adbc | 1896 | /* If newdecl is a template instantiation, it is possible that |
1897 | the following sequence of events has occurred: | |
1898 | ||
1899 | o A friend function was declared in a class template. The | |
1900 | class template was instantiated. | |
1901 | ||
1902 | o The instantiation of the friend declaration was | |
1903 | recorded on the instantiation list, and is newdecl. | |
1904 | ||
1905 | o Later, however, instantiate_class_template called pushdecl | |
1906 | on the newdecl to perform name injection. But, pushdecl in | |
1907 | turn called duplicate_decls when it discovered that another | |
1908 | declaration of a global function with the same name already | |
1909 | existed. | |
1910 | ||
1911 | o Here, in duplicate_decls, we decided to clobber newdecl. | |
1912 | ||
1913 | If we're going to do that, we'd better make sure that | |
1914 | olddecl, and not newdecl, is on the list of | |
1915 | instantiations so that if we try to do the instantiation | |
1916 | again we won't get the clobbered declaration. */ | |
1917 | reregister_specialization (newdecl, | |
1918 | DECL_TI_TEMPLATE (newdecl), | |
1919 | olddecl); | |
471086d6 | 1920 | } |
1921 | else | |
1922 | { | |
f702522a | 1923 | memcpy ((char *) olddecl + sizeof (struct tree_common), |
1924 | (char *) newdecl + sizeof (struct tree_common), | |
1925 | sizeof (struct tree_decl) - sizeof (struct tree_common) | |
ab1a776d | 1926 | + TREE_CODE_LENGTH (TREE_CODE (newdecl)) * sizeof (char *)); |
471086d6 | 1927 | } |
1928 | ||
1929 | DECL_UID (olddecl) = olddecl_uid; | |
1930 | if (olddecl_friend) | |
1931 | DECL_FRIEND_P (olddecl) = 1; | |
1932 | ||
0bf60c2b | 1933 | /* NEWDECL contains the merged attribute lists. |
1934 | Update OLDDECL to be the same. */ | |
e3c541f0 | 1935 | DECL_ATTRIBUTES (olddecl) = DECL_ATTRIBUTES (newdecl); |
0bf60c2b | 1936 | |
f8ed00ce | 1937 | /* If OLDDECL had its DECL_RTL instantiated, re-invoke make_decl_rtl |
1938 | so that encode_section_info has a chance to look at the new decl | |
1939 | flags and attributes. */ | |
1940 | if (DECL_RTL_SET_P (olddecl) | |
1941 | && (TREE_CODE (olddecl) == FUNCTION_DECL | |
1942 | || (TREE_CODE (olddecl) == VAR_DECL | |
1943 | && TREE_STATIC (olddecl)))) | |
1944 | make_decl_rtl (olddecl, NULL); | |
1945 | ||
947f430b | 1946 | return olddecl; |
471086d6 | 1947 | } |
471086d6 | 1948 | \f |
905d4035 | 1949 | /* Return zero if the declaration NEWDECL is valid |
471086d6 | 1950 | when the declaration OLDDECL (assumed to be for the same name) |
1951 | has already been seen. | |
1952 | Otherwise return an error message format string with a %s | |
1953 | where the identifier should go. */ | |
1954 | ||
e1721763 | 1955 | static const char * |
1b72315d | 1956 | redeclaration_error_message (tree newdecl, tree olddecl) |
471086d6 | 1957 | { |
1958 | if (TREE_CODE (newdecl) == TYPE_DECL) | |
1959 | { | |
1960 | /* Because C++ can put things into name space for free, | |
1961 | constructs like "typedef struct foo { ... } foo" | |
1962 | would look like an erroneous redeclaration. */ | |
daf9ff67 | 1963 | if (same_type_p (TREE_TYPE (newdecl), TREE_TYPE (olddecl))) |
905d4035 | 1964 | return 0; |
471086d6 | 1965 | else |
905d4035 | 1966 | return "redefinition of `%#D'"; |
471086d6 | 1967 | } |
1968 | else if (TREE_CODE (newdecl) == FUNCTION_DECL) | |
1969 | { | |
1970 | /* If this is a pure function, its olddecl will actually be | |
1971 | the original initialization to `0' (which we force to call | |
1972 | abort()). Don't complain about redefinition in this case. */ | |
a98fd0a1 | 1973 | if (DECL_LANG_SPECIFIC (olddecl) && DECL_PURE_VIRTUAL_P (olddecl)) |
905d4035 | 1974 | return 0; |
471086d6 | 1975 | |
8417823c | 1976 | /* If both functions come from different namespaces, this is not |
a109dc3b | 1977 | a redeclaration - this is a conflict with a used function. */ |
ddb39453 | 1978 | if (DECL_NAMESPACE_SCOPE_P (olddecl) |
8417823c | 1979 | && DECL_CONTEXT (olddecl) != DECL_CONTEXT (newdecl)) |
905d4035 | 1980 | return "`%D' conflicts with used function"; |
8417823c | 1981 | |
c25194fd | 1982 | /* We'll complain about linkage mismatches in |
1983 | warn_extern_redeclared_static. */ | |
1984 | ||
8417823c | 1985 | /* Defining the same name twice is no good. */ |
471086d6 | 1986 | if (DECL_INITIAL (olddecl) != NULL_TREE |
bb09dca5 | 1987 | && DECL_INITIAL (newdecl) != NULL_TREE) |
471086d6 | 1988 | { |
1989 | if (DECL_NAME (olddecl) == NULL_TREE) | |
905d4035 | 1990 | return "`%#D' not declared in class"; |
471086d6 | 1991 | else |
905d4035 | 1992 | return "redefinition of `%#D'"; |
471086d6 | 1993 | } |
905d4035 | 1994 | return 0; |
471086d6 | 1995 | } |
ac9386a0 | 1996 | else if (TREE_CODE (newdecl) == TEMPLATE_DECL) |
1997 | { | |
1611df57 | 1998 | tree nt, ot; |
1999 | ||
2000 | if (TREE_CODE (DECL_TEMPLATE_RESULT (newdecl)) == TYPE_DECL) | |
2001 | { | |
2002 | if (COMPLETE_TYPE_P (TREE_TYPE (newdecl)) | |
2003 | && COMPLETE_TYPE_P (TREE_TYPE (olddecl))) | |
2004 | return "redefinition of `%#D'"; | |
2005 | return NULL; | |
2006 | } | |
2007 | ||
2008 | if (TREE_CODE (DECL_TEMPLATE_RESULT (newdecl)) != FUNCTION_DECL | |
2009 | || (DECL_TEMPLATE_RESULT (newdecl) | |
2010 | == DECL_TEMPLATE_RESULT (olddecl))) | |
2011 | return NULL; | |
2012 | ||
2013 | nt = DECL_TEMPLATE_RESULT (newdecl); | |
2014 | if (DECL_TEMPLATE_INFO (nt)) | |
2015 | nt = DECL_TEMPLATE_RESULT (template_for_substitution (nt)); | |
2016 | ot = DECL_TEMPLATE_RESULT (olddecl); | |
2017 | if (DECL_TEMPLATE_INFO (ot)) | |
2018 | ot = DECL_TEMPLATE_RESULT (template_for_substitution (ot)); | |
2019 | if (DECL_INITIAL (nt) && DECL_INITIAL (ot)) | |
905d4035 | 2020 | return "redefinition of `%#D'"; |
1611df57 | 2021 | |
2022 | return NULL; | |
ac9386a0 | 2023 | } |
e238c961 | 2024 | else if (toplevel_bindings_p () || DECL_NAMESPACE_SCOPE_P (newdecl)) |
471086d6 | 2025 | { |
2026 | /* Objects declared at top level: */ | |
2027 | /* If at least one is a reference, it's ok. */ | |
2028 | if (DECL_EXTERNAL (newdecl) || DECL_EXTERNAL (olddecl)) | |
905d4035 | 2029 | return 0; |
0543e7a9 | 2030 | /* Reject two definitions. */ |
905d4035 | 2031 | return "redefinition of `%#D'"; |
471086d6 | 2032 | } |
2033 | else | |
2034 | { | |
2035 | /* Objects declared with block scope: */ | |
2036 | /* Reject two definitions, and reject a definition | |
2037 | together with an external reference. */ | |
2038 | if (!(DECL_EXTERNAL (newdecl) && DECL_EXTERNAL (olddecl))) | |
905d4035 | 2039 | return "redeclaration of `%#D'"; |
2040 | return 0; | |
471086d6 | 2041 | } |
2042 | } | |
2043 | \f | |
2d46e540 | 2044 | /* Create a new label, named ID. */ |
471086d6 | 2045 | |
2d46e540 | 2046 | static tree |
1b72315d | 2047 | make_label_decl (tree id, int local_p) |
471086d6 | 2048 | { |
2d46e540 | 2049 | tree decl; |
471086d6 | 2050 | |
2d46e540 | 2051 | decl = build_decl (LABEL_DECL, id, void_type_node); |
2d46e540 | 2052 | |
2053 | DECL_CONTEXT (decl) = current_function_decl; | |
2054 | DECL_MODE (decl) = VOIDmode; | |
2055 | C_DECLARED_LABEL_FLAG (decl) = local_p; | |
471086d6 | 2056 | |
2d46e540 | 2057 | /* Say where one reference is to the label, for the sake of the |
2058 | error if it is not defined. */ | |
346064d9 | 2059 | DECL_SOURCE_LOCATION (decl) = input_location; |
2d46e540 | 2060 | |
2061 | /* Record the fact that this identifier is bound to this label. */ | |
2062 | SET_IDENTIFIER_LABEL_VALUE (id, decl); | |
2063 | ||
c48d6aec | 2064 | return decl; |
2065 | } | |
2066 | ||
2067 | /* Record this label on the list of used labels so that we can check | |
2068 | at the end of the function to see whether or not the label was | |
2069 | actually defined, and so we can check when the label is defined whether | |
2070 | this use is valid. */ | |
2071 | ||
2072 | static void | |
1b72315d | 2073 | use_label (tree decl) |
c48d6aec | 2074 | { |
2075 | if (named_label_uses == NULL | |
2076 | || named_label_uses->names_in_scope != current_binding_level->names | |
2077 | || named_label_uses->label_decl != decl) | |
2078 | { | |
2079 | struct named_label_use_list *new_ent; | |
6edf18a6 | 2080 | new_ent = ggc_alloc (sizeof (struct named_label_use_list)); |
1ad432f2 | 2081 | new_ent->label_decl = decl; |
2082 | new_ent->names_in_scope = current_binding_level->names; | |
2083 | new_ent->binding_level = current_binding_level; | |
6a86d77b | 2084 | new_ent->o_goto_locus = input_location; |
1ad432f2 | 2085 | new_ent->next = named_label_uses; |
2086 | named_label_uses = new_ent; | |
471086d6 | 2087 | } |
2d46e540 | 2088 | } |
471086d6 | 2089 | |
2d46e540 | 2090 | /* Look for a label named ID in the current function. If one cannot |
2091 | be found, create one. (We keep track of used, but undefined, | |
2092 | labels, and complain about them at the end of a function.) */ | |
471086d6 | 2093 | |
980877d7 | 2094 | tree |
1b72315d | 2095 | lookup_label (tree id) |
2d46e540 | 2096 | { |
2097 | tree decl; | |
c48d6aec | 2098 | struct named_label_list *ent; |
471086d6 | 2099 | |
851fe51a | 2100 | timevar_push (TV_NAME_LOOKUP); |
2d46e540 | 2101 | /* You can't use labels at global scope. */ |
2102 | if (current_function_decl == NULL_TREE) | |
2103 | { | |
286daa79 | 2104 | error ("label `%E' referenced outside of any function", id); |
851fe51a | 2105 | POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, NULL_TREE); |
2d46e540 | 2106 | } |
980877d7 | 2107 | |
2d46e540 | 2108 | /* See if we've already got this label. */ |
2109 | decl = IDENTIFIER_LABEL_VALUE (id); | |
2110 | if (decl != NULL_TREE && DECL_CONTEXT (decl) == current_function_decl) | |
851fe51a | 2111 | POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, decl); |
471086d6 | 2112 | |
2d46e540 | 2113 | /* Record this label on the list of labels used in this function. |
2114 | We do this before calling make_label_decl so that we get the | |
2115 | IDENTIFIER_LABEL_VALUE before the new label is declared. */ | |
6edf18a6 | 2116 | ent = ggc_alloc_cleared (sizeof (struct named_label_list)); |
c48d6aec | 2117 | ent->old_value = IDENTIFIER_LABEL_VALUE (id); |
2118 | ent->next = named_labels; | |
2119 | named_labels = ent; | |
2120 | ||
2d46e540 | 2121 | /* We need a new label. */ |
2122 | decl = make_label_decl (id, /*local_p=*/0); | |
c48d6aec | 2123 | |
2d46e540 | 2124 | /* Now fill in the information we didn't have before. */ |
c48d6aec | 2125 | ent->label_decl = decl; |
471086d6 | 2126 | |
851fe51a | 2127 | POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, decl); |
471086d6 | 2128 | } |
2129 | ||
2d46e540 | 2130 | /* Declare a local label named ID. */ |
471086d6 | 2131 | |
2132 | tree | |
1b72315d | 2133 | declare_local_label (tree id) |
471086d6 | 2134 | { |
2d46e540 | 2135 | tree decl; |
471086d6 | 2136 | |
2d46e540 | 2137 | /* Add a new entry to the SHADOWED_LABELS list so that when we leave |
2138 | this scope we can restore the old value of | |
2139 | IDENTIFIER_TYPE_VALUE. */ | |
980877d7 | 2140 | current_binding_level->shadowed_labels |
2d46e540 | 2141 | = tree_cons (IDENTIFIER_LABEL_VALUE (id), NULL_TREE, |
2142 | current_binding_level->shadowed_labels); | |
2143 | /* Look for the label. */ | |
2144 | decl = make_label_decl (id, /*local_p=*/1); | |
2145 | /* Now fill in the information we didn't have before. */ | |
2146 | TREE_VALUE (current_binding_level->shadowed_labels) = decl; | |
980877d7 | 2147 | |
2d46e540 | 2148 | return decl; |
471086d6 | 2149 | } |
2150 | ||
c48d6aec | 2151 | /* Returns nonzero if it is ill-formed to jump past the declaration of |
2152 | DECL. Returns 2 if it's also a real problem. */ | |
2153 | ||
2154 | static int | |
1b72315d | 2155 | decl_jump_unsafe (tree decl) |
c48d6aec | 2156 | { |
2157 | if (TREE_CODE (decl) != VAR_DECL || TREE_STATIC (decl)) | |
2158 | return 0; | |
2159 | ||
2160 | if (DECL_INITIAL (decl) == NULL_TREE | |
2161 | && pod_type_p (TREE_TYPE (decl))) | |
2162 | return 0; | |
2163 | ||
2164 | /* This is really only important if we're crossing an initialization. | |
2165 | The POD stuff is just pedantry; why should it matter if the class | |
2166 | contains a field of pointer to member type? */ | |
2167 | if (DECL_INITIAL (decl) | |
2168 | || (TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (decl)))) | |
2169 | return 2; | |
2170 | return 1; | |
2171 | } | |
2172 | ||
2173 | /* Check that a single previously seen jump to a newly defined label | |
2174 | is OK. DECL is the LABEL_DECL or 0; LEVEL is the binding_level for | |
2175 | the jump context; NAMES are the names in scope in LEVEL at the jump | |
2176 | context; FILE and LINE are the source position of the jump or 0. */ | |
2177 | ||
2178 | static void | |
1b72315d | 2179 | check_previous_goto_1 (tree decl, |
2180 | struct cp_binding_level* level, | |
7727e009 | 2181 | tree names, const location_t *locus) |
c48d6aec | 2182 | { |
2183 | int identified = 0; | |
2184 | int saw_eh = 0; | |
1f3233d1 | 2185 | struct cp_binding_level *b = current_binding_level; |
c48d6aec | 2186 | for (; b; b = b->level_chain) |
2187 | { | |
2188 | tree new_decls = b->names; | |
2189 | tree old_decls = (b == level ? names : NULL_TREE); | |
2190 | for (; new_decls != old_decls; | |
2191 | new_decls = TREE_CHAIN (new_decls)) | |
2192 | { | |
2193 | int problem = decl_jump_unsafe (new_decls); | |
2194 | if (! problem) | |
2195 | continue; | |
2196 | ||
2197 | if (! identified) | |
2198 | { | |
2199 | if (decl) | |
cf103c6c | 2200 | pedwarn ("jump to label `%D'", decl); |
c48d6aec | 2201 | else |
2202 | pedwarn ("jump to case label"); | |
2203 | ||
7727e009 | 2204 | if (locus) |
2205 | pedwarn ("%H from here", locus); | |
c48d6aec | 2206 | identified = 1; |
2207 | } | |
2208 | ||
65750829 | 2209 | if (problem > 1) |
c48d6aec | 2210 | cp_error_at (" crosses initialization of `%#D'", |
2211 | new_decls); | |
2212 | else | |
2213 | cp_pedwarn_at (" enters scope of non-POD `%#D'", | |
2214 | new_decls); | |
2215 | } | |
2216 | ||
2217 | if (b == level) | |
2218 | break; | |
37b9a732 | 2219 | if ((b->kind == sk_try || b->kind == sk_catch) && ! saw_eh) |
c48d6aec | 2220 | { |
2221 | if (! identified) | |
2222 | { | |
2223 | if (decl) | |
cf103c6c | 2224 | pedwarn ("jump to label `%D'", decl); |
c48d6aec | 2225 | else |
2226 | pedwarn ("jump to case label"); | |
2227 | ||
7727e009 | 2228 | if (locus) |
2229 | pedwarn ("%H from here", locus); | |
c48d6aec | 2230 | identified = 1; |
2231 | } | |
37b9a732 | 2232 | if (b->kind == sk_try) |
65750829 | 2233 | error (" enters try block"); |
2234 | else | |
2235 | error (" enters catch block"); | |
c48d6aec | 2236 | saw_eh = 1; |
2237 | } | |
2238 | } | |
2239 | } | |
2240 | ||
2241 | static void | |
1b72315d | 2242 | check_previous_goto (struct named_label_use_list* use) |
c48d6aec | 2243 | { |
2244 | check_previous_goto_1 (use->label_decl, use->binding_level, | |
7727e009 | 2245 | use->names_in_scope, &use->o_goto_locus); |
c48d6aec | 2246 | } |
2247 | ||
2248 | static void | |
1b72315d | 2249 | check_switch_goto (struct cp_binding_level* level) |
c48d6aec | 2250 | { |
7727e009 | 2251 | check_previous_goto_1 (NULL_TREE, level, level->names, NULL); |
c48d6aec | 2252 | } |
2253 | ||
2254 | /* Check that any previously seen jumps to a newly defined label DECL | |
2255 | are OK. Called by define_label. */ | |
2256 | ||
2257 | static void | |
1b72315d | 2258 | check_previous_gotos (tree decl) |
c48d6aec | 2259 | { |
2260 | struct named_label_use_list **usep; | |
2261 | ||
2262 | if (! TREE_USED (decl)) | |
2263 | return; | |
2264 | ||
2265 | for (usep = &named_label_uses; *usep; ) | |
2266 | { | |
2267 | struct named_label_use_list *use = *usep; | |
2268 | if (use->label_decl == decl) | |
2269 | { | |
2270 | check_previous_goto (use); | |
2271 | *usep = use->next; | |
2272 | } | |
2273 | else | |
2274 | usep = &(use->next); | |
2275 | } | |
2276 | } | |
2277 | ||
2278 | /* Check that a new jump to a label DECL is OK. Called by | |
2279 | finish_goto_stmt. */ | |
2280 | ||
2281 | void | |
1b72315d | 2282 | check_goto (tree decl) |
c48d6aec | 2283 | { |
2284 | int identified = 0; | |
2285 | tree bad; | |
2286 | struct named_label_list *lab; | |
2287 | ||
5ba7b7e9 | 2288 | /* We can't know where a computed goto is jumping. So we assume |
2289 | that it's OK. */ | |
2290 | if (! DECL_P (decl)) | |
2291 | return; | |
2292 | ||
c48d6aec | 2293 | /* If the label hasn't been defined yet, defer checking. */ |
2294 | if (! DECL_INITIAL (decl)) | |
2295 | { | |
2296 | use_label (decl); | |
2297 | return; | |
2298 | } | |
2299 | ||
2300 | for (lab = named_labels; lab; lab = lab->next) | |
2301 | if (decl == lab->label_decl) | |
2302 | break; | |
2303 | ||
2304 | /* If the label is not on named_labels it's a gcc local label, so | |
2305 | it must be in an outer scope, so jumping to it is always OK. */ | |
2306 | if (lab == 0) | |
2307 | return; | |
2308 | ||
65750829 | 2309 | if ((lab->in_try_scope || lab->in_catch_scope || lab->bad_decls) |
2310 | && !identified) | |
c48d6aec | 2311 | { |
2312 | cp_pedwarn_at ("jump to label `%D'", decl); | |
2313 | pedwarn (" from here"); | |
2314 | identified = 1; | |
2315 | } | |
2316 | ||
2317 | for (bad = lab->bad_decls; bad; bad = TREE_CHAIN (bad)) | |
2318 | { | |
2319 | tree b = TREE_VALUE (bad); | |
2320 | int u = decl_jump_unsafe (b); | |
2321 | ||
2322 | if (u > 1 && DECL_ARTIFICIAL (b)) | |
2323 | /* Can't skip init of __exception_info. */ | |
9bc3739f | 2324 | error ("%J enters catch block", b); |
c48d6aec | 2325 | else if (u > 1) |
2326 | cp_error_at (" skips initialization of `%#D'", b); | |
2327 | else | |
2328 | cp_pedwarn_at (" enters scope of non-POD `%#D'", b); | |
2329 | } | |
2330 | ||
65750829 | 2331 | if (lab->in_try_scope) |
c48d6aec | 2332 | error (" enters try block"); |
65750829 | 2333 | else if (lab->in_catch_scope) |
2334 | error (" enters catch block"); | |
c48d6aec | 2335 | } |
2336 | ||
471086d6 | 2337 | /* Define a label, specifying the location in the source file. |
91a39dda | 2338 | Return the LABEL_DECL node for the label. */ |
471086d6 | 2339 | |
2340 | tree | |
92ddaf90 | 2341 | define_label (location_t location, tree name) |
471086d6 | 2342 | { |
edf2a96a | 2343 | tree decl = lookup_label (name); |
c48d6aec | 2344 | struct named_label_list *ent; |
cd16867a | 2345 | struct cp_binding_level *p; |
c48d6aec | 2346 | |
851fe51a | 2347 | timevar_push (TV_NAME_LOOKUP); |
c48d6aec | 2348 | for (ent = named_labels; ent; ent = ent->next) |
2349 | if (ent->label_decl == decl) | |
2350 | break; | |
471086d6 | 2351 | |
886deab8 | 2352 | /* After labels, make any new cleanups in the function go into their |
471086d6 | 2353 | own new (temporary) binding contour. */ |
37b9a732 | 2354 | for (p = current_binding_level; |
2355 | p->kind != sk_function_parms; | |
2356 | p = p->level_chain) | |
886deab8 | 2357 | p->more_cleanups_ok = 0; |
471086d6 | 2358 | |
bcf789d7 | 2359 | if (name == get_identifier ("wchar_t")) |
cf103c6c | 2360 | pedwarn ("label named wchar_t"); |
bcf789d7 | 2361 | |
471086d6 | 2362 | if (DECL_INITIAL (decl) != NULL_TREE) |
91a39dda | 2363 | error ("duplicate label `%D'", decl); |
471086d6 | 2364 | else |
2365 | { | |
471086d6 | 2366 | /* Mark label as having been defined. */ |
2367 | DECL_INITIAL (decl) = error_mark_node; | |
2368 | /* Say where in the source. */ | |
346064d9 | 2369 | DECL_SOURCE_LOCATION (decl) = location; |
c48d6aec | 2370 | if (ent) |
2371 | { | |
2372 | ent->names_in_scope = current_binding_level->names; | |
2373 | ent->binding_level = current_binding_level; | |
2374 | } | |
2375 | check_previous_gotos (decl); | |
471086d6 | 2376 | } |
91a39dda | 2377 | |
851fe51a | 2378 | timevar_pop (TV_NAME_LOOKUP); |
91a39dda | 2379 | return decl; |
471086d6 | 2380 | } |
2381 | ||
127a1cd0 | 2382 | struct cp_switch |
2383 | { | |
1f3233d1 | 2384 | struct cp_binding_level *level; |
127a1cd0 | 2385 | struct cp_switch *next; |
225ec6aa | 2386 | /* The SWITCH_STMT being built. */ |
2387 | tree switch_stmt; | |
2388 | /* A splay-tree mapping the low element of a case range to the high | |
2389 | element, or NULL_TREE if there is no high element. Used to | |
2390 | determine whether or not a new case label duplicates an old case | |
2391 | label. We need a tree, rather than simply a hash table, because | |
2392 | of the GNU case range extension. */ | |
2393 | splay_tree cases; | |
127a1cd0 | 2394 | }; |
2395 | ||
225ec6aa | 2396 | /* A stack of the currently active switch statements. The innermost |
2397 | switch statement is on the top of the stack. There is no need to | |
2398 | mark the stack for garbage collection because it is only active | |
2399 | during the processing of the body of a function, and we never | |
2400 | collect at that point. */ | |
3c3beda6 | 2401 | |
127a1cd0 | 2402 | static struct cp_switch *switch_stack; |
2403 | ||
225ec6aa | 2404 | /* Called right after a switch-statement condition is parsed. |
2405 | SWITCH_STMT is the switch statement being parsed. */ | |
2406 | ||
127a1cd0 | 2407 | void |
1b72315d | 2408 | push_switch (tree switch_stmt) |
127a1cd0 | 2409 | { |
6edf18a6 | 2410 | struct cp_switch *p = xmalloc (sizeof (struct cp_switch)); |
127a1cd0 | 2411 | p->level = current_binding_level; |
2412 | p->next = switch_stack; | |
225ec6aa | 2413 | p->switch_stmt = switch_stmt; |
2414 | p->cases = splay_tree_new (case_compare, NULL, NULL); | |
127a1cd0 | 2415 | switch_stack = p; |
2416 | } | |
2417 | ||
2418 | void | |
1b72315d | 2419 | pop_switch (void) |
127a1cd0 | 2420 | { |
4ee9c684 | 2421 | struct cp_switch *cs = switch_stack; |
2422 | ||
2423 | /* Emit warnings as needed. */ | |
2424 | c_do_switch_warnings (cs->cases, cs->switch_stmt); | |
3c3beda6 | 2425 | |
225ec6aa | 2426 | splay_tree_delete (cs->cases); |
127a1cd0 | 2427 | switch_stack = switch_stack->next; |
769177ac | 2428 | free (cs); |
127a1cd0 | 2429 | } |
2430 | ||
c2af356c | 2431 | /* Note that we've seen a definition of a case label, and complain if this |
2432 | is a bad place for one. */ | |
96624a9e | 2433 | |
4aa0811f | 2434 | tree |
1b72315d | 2435 | finish_case_label (tree low_value, tree high_value) |
471086d6 | 2436 | { |
4aa0811f | 2437 | tree cond, r; |
cd16867a | 2438 | struct cp_binding_level *p; |
127a1cd0 | 2439 | |
225ec6aa | 2440 | if (processing_template_decl) |
2441 | { | |
e41f0d80 | 2442 | tree label; |
2443 | ||
225ec6aa | 2444 | /* For templates, just add the case label; we'll do semantic |
2445 | analysis at instantiation-time. */ | |
e41f0d80 | 2446 | label = build_decl (LABEL_DECL, NULL_TREE, NULL_TREE); |
4aa0811f | 2447 | return add_stmt (build_case_label (low_value, high_value, label)); |
225ec6aa | 2448 | } |
2449 | ||
2450 | /* Find the condition on which this switch statement depends. */ | |
2451 | cond = SWITCH_COND (switch_stack->switch_stmt); | |
2452 | if (cond && TREE_CODE (cond) == TREE_LIST) | |
2453 | cond = TREE_VALUE (cond); | |
225ec6aa | 2454 | |
4aa0811f | 2455 | r = c_add_case_label (switch_stack->cases, cond, low_value, high_value); |
471086d6 | 2456 | |
c48d6aec | 2457 | check_switch_goto (switch_stack->level); |
127a1cd0 | 2458 | |
886deab8 | 2459 | /* After labels, make any new cleanups in the function go into their |
471086d6 | 2460 | own new (temporary) binding contour. */ |
37b9a732 | 2461 | for (p = current_binding_level; |
2462 | p->kind != sk_function_parms; | |
2463 | p = p->level_chain) | |
886deab8 | 2464 | p->more_cleanups_ok = 0; |
4aa0811f | 2465 | |
2466 | return r; | |
471086d6 | 2467 | } |
2468 | \f | |
e4e283ec | 2469 | /* Hash a TYPENAME_TYPE. K is really of type `tree'. */ |
2470 | ||
1f3233d1 | 2471 | static hashval_t |
1b72315d | 2472 | typename_hash (const void* k) |
e4e283ec | 2473 | { |
1f3233d1 | 2474 | hashval_t hash; |
2475 | tree t = (tree) k; | |
e4e283ec | 2476 | |
957b210f | 2477 | hash = (htab_hash_pointer (TYPE_CONTEXT (t)) |
2478 | ^ htab_hash_pointer (DECL_NAME (TYPE_NAME (t)))); | |
e4e283ec | 2479 | |
2480 | return hash; | |
2481 | } | |
2482 | ||
2483 | /* Compare two TYPENAME_TYPEs. K1 and K2 are really of type `tree'. */ | |
2484 | ||
1f3233d1 | 2485 | static int |
1b72315d | 2486 | typename_compare (const void * k1, const void * k2) |
e4e283ec | 2487 | { |
2488 | tree t1; | |
2489 | tree t2; | |
2490 | tree d1; | |
2491 | tree d2; | |
2492 | ||
2493 | t1 = (tree) k1; | |
2494 | t2 = (tree) k2; | |
2495 | d1 = TYPE_NAME (t1); | |
2496 | d2 = TYPE_NAME (t2); | |
980877d7 | 2497 | |
e4e283ec | 2498 | return (DECL_NAME (d1) == DECL_NAME (d2) |
1f3233d1 | 2499 | && TYPE_CONTEXT (t1) == TYPE_CONTEXT (t2) |
980877d7 | 2500 | && ((TREE_TYPE (t1) != NULL_TREE) |
e4e283ec | 2501 | == (TREE_TYPE (t2) != NULL_TREE)) |
2502 | && same_type_p (TREE_TYPE (t1), TREE_TYPE (t2)) | |
2503 | && TYPENAME_TYPE_FULLNAME (t1) == TYPENAME_TYPE_FULLNAME (t2)); | |
2504 | } | |
2505 | ||
871d88e7 | 2506 | /* Build a TYPENAME_TYPE. If the type is `typename T::t', CONTEXT is |
2507 | the type of `T', NAME is the IDENTIFIER_NODE for `t'. If BASE_TYPE | |
2508 | is non-NULL, this type is being created by the implicit typename | |
2509 | extension, and BASE_TYPE is a type named `t' in some base class of | |
980877d7 | 2510 | `T' which depends on template parameters. |
871d88e7 | 2511 | |
2512 | Returns the new TYPENAME_TYPE. */ | |
2513 | ||
1f3233d1 | 2514 | static GTY ((param_is (union tree_node))) htab_t typename_htab; |
2515 | ||
9140e457 | 2516 | static tree |
954ad420 | 2517 | build_typename_type (tree context, tree name, tree fullname) |
871d88e7 | 2518 | { |
2519 | tree t; | |
2520 | tree d; | |
b9a7cc69 | 2521 | void **e; |
871d88e7 | 2522 | |
1f3233d1 | 2523 | if (typename_htab == NULL) |
1e4853c2 | 2524 | { |
1f3233d1 | 2525 | typename_htab = htab_create_ggc (61, &typename_hash, |
2526 | &typename_compare, NULL); | |
1e4853c2 | 2527 | } |
871d88e7 | 2528 | |
2529 | /* Build the TYPENAME_TYPE. */ | |
9972f65e | 2530 | t = make_aggr_type (TYPENAME_TYPE); |
871d88e7 | 2531 | TYPE_CONTEXT (t) = FROB_CONTEXT (context); |
2532 | TYPENAME_TYPE_FULLNAME (t) = fullname; | |
871d88e7 | 2533 | |
2534 | /* Build the corresponding TYPE_DECL. */ | |
2535 | d = build_decl (TYPE_DECL, name, t); | |
2536 | TYPE_NAME (TREE_TYPE (d)) = d; | |
2537 | TYPE_STUB_DECL (TREE_TYPE (d)) = d; | |
2538 | DECL_CONTEXT (d) = FROB_CONTEXT (context); | |
caa99b15 | 2539 | DECL_ARTIFICIAL (d) = 1; |
871d88e7 | 2540 | |
e4e283ec | 2541 | /* See if we already have this type. */ |
1f3233d1 | 2542 | e = htab_find_slot (typename_htab, t, INSERT); |
2543 | if (*e) | |
2544 | t = (tree) *e; | |
e4e283ec | 2545 | else |
1f3233d1 | 2546 | *e = t; |
e4e283ec | 2547 | |
871d88e7 | 2548 | return t; |
2549 | } | |
2550 | ||
97dbca2f | 2551 | /* Resolve `typename CONTEXT::NAME'. Returns an appropriate type, |
2552 | unless an error occurs, in which case error_mark_node is returned. | |
9edbac04 | 2553 | If we locate a non-artificial TYPE_DECL and TF_KEEP_TYPE_DECL is |
2554 | set, we return that, rather than the _TYPE it corresponds to, in | |
2555 | other cases we look through the type decl. If TF_ERROR is set, | |
2556 | complain about errors, otherwise be quiet. */ | |
97dbca2f | 2557 | |
e857e9c7 | 2558 | tree |
1b72315d | 2559 | make_typename_type (tree context, tree name, tsubst_flags_t complain) |
e857e9c7 | 2560 | { |
15ba7646 | 2561 | tree fullname; |
bccffb3a | 2562 | |
50a06544 | 2563 | if (name == error_mark_node |
2564 | || context == NULL_TREE | |
2565 | || context == error_mark_node) | |
2566 | return error_mark_node; | |
2567 | ||
9308e976 | 2568 | if (TYPE_P (name)) |
91fa7c70 | 2569 | { |
980877d7 | 2570 | if (!(TYPE_LANG_SPECIFIC (name) |
2571 | && (CLASSTYPE_IS_TEMPLATE (name) | |
91fa7c70 | 2572 | || CLASSTYPE_USE_TEMPLATE (name)))) |
2573 | name = TYPE_IDENTIFIER (name); | |
2574 | else | |
2575 | /* Create a TEMPLATE_ID_EXPR for the type. */ | |
2576 | name = build_nt (TEMPLATE_ID_EXPR, | |
2577 | CLASSTYPE_TI_TEMPLATE (name), | |
2578 | CLASSTYPE_TI_ARGS (name)); | |
2579 | } | |
9dc9e65f | 2580 | else if (TREE_CODE (name) == TYPE_DECL) |
bccffb3a | 2581 | name = DECL_NAME (name); |
15ba7646 | 2582 | |
2583 | fullname = name; | |
2584 | ||
2585 | if (TREE_CODE (name) == TEMPLATE_ID_EXPR) | |
eab00fbe | 2586 | { |
2587 | name = TREE_OPERAND (name, 0); | |
2588 | if (TREE_CODE (name) == TEMPLATE_DECL) | |
2589 | name = TREE_OPERAND (fullname, 0) = DECL_NAME (name); | |
2590 | } | |
69773da0 | 2591 | if (TREE_CODE (name) == TEMPLATE_DECL) |
2592 | { | |
cf103c6c | 2593 | error ("`%D' used without template parameters", name); |
69773da0 | 2594 | return error_mark_node; |
2595 | } | |
6267cb8a | 2596 | my_friendly_assert (TREE_CODE (name) == IDENTIFIER_NODE, 20030802); |
2597 | ||
aba12bf8 | 2598 | if (TREE_CODE (context) == NAMESPACE_DECL) |
2599 | { | |
2600 | /* We can get here from typename_sub0 in the explicit_template_type | |
2601 | expansion. Just fail. */ | |
9edbac04 | 2602 | if (complain & tf_error) |
cf103c6c | 2603 | error ("no class template named `%#T' in `%#T'", |
97dbca2f | 2604 | name, context); |
aba12bf8 | 2605 | return error_mark_node; |
2606 | } | |
2607 | ||
c04baa53 | 2608 | if (!dependent_type_p (context) |
7e277854 | 2609 | || currently_open_class (context)) |
e857e9c7 | 2610 | { |
15ba7646 | 2611 | if (TREE_CODE (fullname) == TEMPLATE_ID_EXPR) |
2612 | { | |
73c10977 | 2613 | tree tmpl = NULL_TREE; |
15ba7646 | 2614 | if (IS_AGGR_TYPE (context)) |
b330805e | 2615 | tmpl = lookup_field (context, name, 0, false); |
73c10977 | 2616 | if (!tmpl || !DECL_CLASS_TEMPLATE_P (tmpl)) |
15ba7646 | 2617 | { |
9edbac04 | 2618 | if (complain & tf_error) |
cf103c6c | 2619 | error ("no class template named `%#T' in `%#T'", |
97dbca2f | 2620 | name, context); |
15ba7646 | 2621 | return error_mark_node; |
2622 | } | |
241ce711 | 2623 | |
7a468236 | 2624 | if (complain & tf_error) |
e4f430b5 | 2625 | perform_or_defer_access_check (TYPE_BINFO (context), tmpl); |
01d4830b | 2626 | |
980877d7 | 2627 | return lookup_template_class (tmpl, |
73c10977 | 2628 | TREE_OPERAND (fullname, 1), |
980877d7 | 2629 | NULL_TREE, context, |
f8ce2bac | 2630 | /*entering_scope=*/0, |
b992fe70 | 2631 | tf_error | tf_warning | tf_user); |
15ba7646 | 2632 | } |
2633 | else | |
e857e9c7 | 2634 | { |
1f3b0a54 | 2635 | tree t; |
980877d7 | 2636 | |
1f3b0a54 | 2637 | if (!IS_AGGR_TYPE (context)) |
15ba7646 | 2638 | { |
9edbac04 | 2639 | if (complain & tf_error) |
cf103c6c | 2640 | error ("no type named `%#T' in `%#T'", name, context); |
15ba7646 | 2641 | return error_mark_node; |
2642 | } | |
1d23987c | 2643 | |
b330805e | 2644 | t = lookup_field (context, name, 0, true); |
60c1a862 | 2645 | if (t) |
9edbac04 | 2646 | { |
981a251c | 2647 | if (TREE_CODE (t) != TYPE_DECL) |
2648 | { | |
2649 | if (complain & tf_error) | |
2650 | error ("no type named `%#T' in `%#T'", name, context); | |
2651 | return error_mark_node; | |
2652 | } | |
2653 | ||
7a468236 | 2654 | if (complain & tf_error) |
e4f430b5 | 2655 | perform_or_defer_access_check (TYPE_BINFO (context), t); |
01d4830b | 2656 | |
9edbac04 | 2657 | if (DECL_ARTIFICIAL (t) || !(complain & tf_keep_type_decl)) |
2658 | t = TREE_TYPE (t); | |
a15ce1f8 | 2659 | |
9edbac04 | 2660 | return t; |
2661 | } | |
e857e9c7 | 2662 | } |
e857e9c7 | 2663 | } |
06a748d7 | 2664 | |
2665 | /* If the CONTEXT is not a template type, then either the field is | |
2666 | there now or its never going to be. */ | |
c04baa53 | 2667 | if (!dependent_type_p (context)) |
06a748d7 | 2668 | { |
9edbac04 | 2669 | if (complain & tf_error) |
cf103c6c | 2670 | error ("no type named `%#T' in `%#T'", name, context); |
06a748d7 | 2671 | return error_mark_node; |
2672 | } | |
980877d7 | 2673 | |
954ad420 | 2674 | return build_typename_type (context, name, fullname); |
e857e9c7 | 2675 | } |
2676 | ||
47d727d4 | 2677 | /* Resolve `CONTEXT::template NAME'. Returns an appropriate type, |
2678 | unless an error occurs, in which case error_mark_node is returned. | |
9edbac04 | 2679 | If we locate a TYPE_DECL, we return that, rather than the _TYPE it |
2680 | corresponds to. If COMPLAIN zero, don't complain about any errors | |
2681 | that occur. */ | |
47d727d4 | 2682 | |
2683 | tree | |
1b72315d | 2684 | make_unbound_class_template (tree context, tree name, tsubst_flags_t complain) |
47d727d4 | 2685 | { |
2686 | tree t; | |
2687 | tree d; | |
2688 | ||
2689 | if (TYPE_P (name)) | |
2690 | name = TYPE_IDENTIFIER (name); | |
2691 | else if (DECL_P (name)) | |
2692 | name = DECL_NAME (name); | |
2693 | if (TREE_CODE (name) != IDENTIFIER_NODE) | |
523ac844 | 2694 | abort (); |
47d727d4 | 2695 | |
c04baa53 | 2696 | if (!dependent_type_p (context) |
47d727d4 | 2697 | || currently_open_class (context)) |
2698 | { | |
2699 | tree tmpl = NULL_TREE; | |
2700 | ||
2701 | if (IS_AGGR_TYPE (context)) | |
b330805e | 2702 | tmpl = lookup_field (context, name, 0, false); |
47d727d4 | 2703 | |
2704 | if (!tmpl || !DECL_CLASS_TEMPLATE_P (tmpl)) | |
2705 | { | |
b9a2c51c | 2706 | if (complain & tf_error) |
cf103c6c | 2707 | error ("no class template named `%#T' in `%#T'", name, context); |
47d727d4 | 2708 | return error_mark_node; |
2709 | } | |
2710 | ||
7a468236 | 2711 | if (complain & tf_error) |
e4f430b5 | 2712 | perform_or_defer_access_check (TYPE_BINFO (context), tmpl); |
47d727d4 | 2713 | |
2714 | return tmpl; | |
2715 | } | |
2716 | ||
2717 | /* Build the UNBOUND_CLASS_TEMPLATE. */ | |
2718 | t = make_aggr_type (UNBOUND_CLASS_TEMPLATE); | |
2719 | TYPE_CONTEXT (t) = FROB_CONTEXT (context); | |
2720 | TREE_TYPE (t) = NULL_TREE; | |
2721 | ||
2722 | /* Build the corresponding TEMPLATE_DECL. */ | |
2723 | d = build_decl (TEMPLATE_DECL, name, t); | |
2724 | TYPE_NAME (TREE_TYPE (d)) = d; | |
2725 | TYPE_STUB_DECL (TREE_TYPE (d)) = d; | |
2726 | DECL_CONTEXT (d) = FROB_CONTEXT (context); | |
2727 | DECL_ARTIFICIAL (d) = 1; | |
2728 | ||
2729 | return t; | |
2730 | } | |
2731 | ||
471086d6 | 2732 | \f |
54bd1509 | 2733 | |
471086d6 | 2734 | /* Push the declarations of builtin types into the namespace. |
b7d1e8ea | 2735 | RID_INDEX is the index of the builtin type in the array |
2736 | RID_POINTERS. NAME is the name used when looking up the builtin | |
2737 | type. TYPE is the _TYPE node for the builtin type. */ | |
471086d6 | 2738 | |
174fcc61 | 2739 | void |
1b72315d | 2740 | record_builtin_type (enum rid rid_index, |
2741 | const char* name, | |
2742 | tree type) | |
471086d6 | 2743 | { |
2744 | tree rname = NULL_TREE, tname = NULL_TREE; | |
034b484a | 2745 | tree tdecl = NULL_TREE; |
471086d6 | 2746 | |
518796ad | 2747 | if ((int) rid_index < (int) RID_MAX) |
471086d6 | 2748 | rname = ridpointers[(int) rid_index]; |
2749 | if (name) | |
2750 | tname = get_identifier (name); | |
2751 | ||
b7d1e8ea | 2752 | /* The calls to SET_IDENTIFIER_GLOBAL_VALUE below should be |
2753 | eliminated. Built-in types should not be looked up name; their | |
2754 | names are keywords that the parser can recognize. However, there | |
2755 | is code in c-common.c that uses identifier_global_value to look | |
2756 | up built-in types by name. */ | |
471086d6 | 2757 | if (tname) |
2758 | { | |
b7d1e8ea | 2759 | tdecl = build_decl (TYPE_DECL, tname, type); |
2760 | DECL_ARTIFICIAL (tdecl) = 1; | |
37b9a732 | 2761 | SET_IDENTIFIER_GLOBAL_VALUE (tname, tdecl); |
471086d6 | 2762 | } |
b7d1e8ea | 2763 | if (rname) |
471086d6 | 2764 | { |
b7d1e8ea | 2765 | if (!tdecl) |
471086d6 | 2766 | { |
b7d1e8ea | 2767 | tdecl = build_decl (TYPE_DECL, rname, type); |
2768 | DECL_ARTIFICIAL (tdecl) = 1; | |
471086d6 | 2769 | } |
b7d1e8ea | 2770 | SET_IDENTIFIER_GLOBAL_VALUE (rname, tdecl); |
471086d6 | 2771 | } |
b7d1e8ea | 2772 | |
2773 | if (!TYPE_NAME (type)) | |
2774 | TYPE_NAME (type) = tdecl; | |
54bd1509 | 2775 | |
2776 | if (tdecl) | |
73ae3ef7 | 2777 | debug_hooks->type_decl (tdecl, 0); |
471086d6 | 2778 | } |
2779 | ||
7d53e30d | 2780 | /* Record one of the standard Java types. |
84ea6a1d | 2781 | * Declare it as having the given NAME. |
2782 | * If SIZE > 0, it is the size of one of the integral types; | |
2783 | * otherwise it is the negative of the size of one of the other types. */ | |
7d53e30d | 2784 | |
2785 | static tree | |
1b72315d | 2786 | record_builtin_java_type (const char* name, int size) |
7d53e30d | 2787 | { |
2788 | tree type, decl; | |
2789 | if (size > 0) | |
2790 | type = make_signed_type (size); | |
2791 | else if (size > -32) | |
a109dc3b | 2792 | { /* "__java_char" or ""__java_boolean". */ |
7d53e30d | 2793 | type = make_unsigned_type (-size); |
2794 | /*if (size == -1) TREE_SET_CODE (type, BOOLEAN_TYPE);*/ | |
2795 | } | |
2796 | else | |
a109dc3b | 2797 | { /* "__java_float" or ""__java_double". */ |
7d53e30d | 2798 | type = make_node (REAL_TYPE); |
2799 | TYPE_PRECISION (type) = - size; | |
2800 | layout_type (type); | |
2801 | } | |
518796ad | 2802 | record_builtin_type (RID_MAX, name, type); |
7d53e30d | 2803 | decl = TYPE_NAME (type); |
47b15141 | 2804 | |
2805 | /* Suppress generate debug symbol entries for these types, | |
2806 | since for normal C++ they are just clutter. | |
a109dc3b | 2807 | However, push_lang_context undoes this if extern "Java" is seen. */ |
7d53e30d | 2808 | DECL_IGNORED_P (decl) = 1; |
47b15141 | 2809 | |
7d53e30d | 2810 | TYPE_FOR_JAVA (type) = 1; |
2811 | return type; | |
2812 | } | |
2813 | ||
a109dc3b | 2814 | /* Push a type into the namespace so that the back-ends ignore it. */ |
2100d3e8 | 2815 | |
2816 | static void | |
1b72315d | 2817 | record_unknown_type (tree type, const char* name) |
2100d3e8 | 2818 | { |
2819 | tree decl = pushdecl (build_decl (TYPE_DECL, get_identifier (name), type)); | |
2820 | /* Make sure the "unknown type" typedecl gets ignored for debug info. */ | |
2821 | DECL_IGNORED_P (decl) = 1; | |
2822 | TYPE_DECL_SUPPRESS_DEBUG (decl) = 1; | |
2823 | TYPE_SIZE (type) = TYPE_SIZE (void_type_node); | |
2824 | TYPE_ALIGN (type) = 1; | |
aca14577 | 2825 | TYPE_USER_ALIGN (type) = 0; |
2100d3e8 | 2826 | TYPE_MODE (type) = TYPE_MODE (void_type_node); |
980877d7 | 2827 | } |
2100d3e8 | 2828 | |
8eadd521 | 2829 | /* An string for which we should create an IDENTIFIER_NODE at |
2830 | startup. */ | |
2831 | ||
2832 | typedef struct predefined_identifier | |
2833 | { | |
2834 | /* The name of the identifier. */ | |
e99c3a1d | 2835 | const char *const name; |
8eadd521 | 2836 | /* The place where the IDENTIFIER_NODE should be stored. */ |
e99c3a1d | 2837 | tree *const node; |
3160db1d | 2838 | /* Nonzero if this is the name of a constructor or destructor. */ |
e99c3a1d | 2839 | const int ctor_or_dtor_p; |
8eadd521 | 2840 | } predefined_identifier; |
2841 | ||
2842 | /* Create all the predefined identifiers. */ | |
2843 | ||
2844 | static void | |
1b72315d | 2845 | initialize_predefined_identifiers (void) |
8eadd521 | 2846 | { |
e99c3a1d | 2847 | const predefined_identifier *pid; |
8eadd521 | 2848 | |
2849 | /* A table of identifiers to create at startup. */ | |
e99c3a1d | 2850 | static const predefined_identifier predefined_identifiers[] = { |
f04596da | 2851 | { "C++", &lang_name_cplusplus, 0 }, |
2852 | { "C", &lang_name_c, 0 }, | |
2853 | { "Java", &lang_name_java, 0 }, | |
2854 | { CTOR_NAME, &ctor_identifier, 1 }, | |
2855 | { "__base_ctor", &base_ctor_identifier, 1 }, | |
2856 | { "__comp_ctor", &complete_ctor_identifier, 1 }, | |
2857 | { DTOR_NAME, &dtor_identifier, 1 }, | |
2858 | { "__comp_dtor", &complete_dtor_identifier, 1 }, | |
2859 | { "__base_dtor", &base_dtor_identifier, 1 }, | |
2860 | { "__deleting_dtor", &deleting_dtor_identifier, 1 }, | |
f04596da | 2861 | { IN_CHARGE_NAME, &in_charge_identifier, 0 }, |
f04596da | 2862 | { "nelts", &nelts_identifier, 0 }, |
2863 | { THIS_NAME, &this_identifier, 0 }, | |
dc9b5a48 | 2864 | { VTABLE_DELTA_NAME, &delta_identifier, 0 }, |
f04596da | 2865 | { VTABLE_PFN_NAME, &pfn_identifier, 0 }, |
f04596da | 2866 | { "_vptr", &vptr_identifier, 0 }, |
0ce25b06 | 2867 | { "__vtt_parm", &vtt_parm_identifier, 0 }, |
7bfd46d1 | 2868 | { "::", &global_scope_name, 0 }, |
98eaf693 | 2869 | { "std", &std_identifier, 0 }, |
f04596da | 2870 | { NULL, NULL, 0 } |
8eadd521 | 2871 | }; |
2872 | ||
2873 | for (pid = predefined_identifiers; pid->name; ++pid) | |
f04596da | 2874 | { |
2875 | *pid->node = get_identifier (pid->name); | |
2876 | if (pid->ctor_or_dtor_p) | |
2877 | IDENTIFIER_CTOR_OR_DTOR_P (*pid->node) = 1; | |
2878 | } | |
8eadd521 | 2879 | } |
2880 | ||
471086d6 | 2881 | /* Create the predefined scalar types of C, |
2882 | and some nodes representing standard constants (0, 1, (void *)0). | |
2883 | Initialize the global binding level. | |
2884 | Make definitions for built-in primitive functions. */ | |
2885 | ||
2886 | void | |
1b72315d | 2887 | cxx_init_decl_processing (void) |
471086d6 | 2888 | { |
d2d4bdde | 2889 | tree void_ftype; |
2890 | tree void_ftype_ptr; | |
471086d6 | 2891 | |
8eadd521 | 2892 | /* Create all the identifiers we need. */ |
2893 | initialize_predefined_identifiers (); | |
471086d6 | 2894 | |
1e4853c2 | 2895 | /* Create the global variables. */ |
2896 | push_to_top_level (); | |
509cd7a7 | 2897 | |
7bfd46d1 | 2898 | current_function_decl = NULL_TREE; |
66115136 | 2899 | current_binding_level = NULL; |
a109dc3b | 2900 | /* Enter the global namespace. */ |
18e99d00 | 2901 | my_friendly_assert (global_namespace == NULL_TREE, 375); |
7bfd46d1 | 2902 | global_namespace = build_lang_decl (NAMESPACE_DECL, global_scope_name, |
2903 | void_type_node); | |
e880f232 | 2904 | begin_scope (sk_namespace, global_namespace); |
7bfd46d1 | 2905 | |
18e99d00 | 2906 | current_lang_name = NULL_TREE; |
2907 | ||
5882ce16 | 2908 | /* Adjust various flags based on command-line settings. */ |
a442e18f | 2909 | if (!flag_permissive) |
caa99b15 | 2910 | flag_pedantic_errors = 1; |
5882ce16 | 2911 | if (!flag_no_inline) |
1f1fa73c | 2912 | { |
2913 | flag_inline_trees = 1; | |
2914 | flag_no_inline = 1; | |
2915 | } | |
10c08065 | 2916 | if (flag_inline_functions) |
2917 | { | |
2918 | flag_inline_trees = 2; | |
2919 | flag_inline_functions = 0; | |
2920 | } | |
eae9825c | 2921 | |
fc5cb4c0 | 2922 | /* Force minimum function alignment if using the least significant |
2923 | bit of function pointers to store the virtual bit. */ | |
2924 | if (TARGET_PTRMEMFUNC_VBIT_LOCATION == ptrmemfunc_vbit_in_pfn | |
2925 | && force_align_functions_log < 1) | |
2926 | force_align_functions_log = 1; | |
2927 | ||
471086d6 | 2928 | /* Initially, C. */ |
2929 | current_lang_name = lang_name_c; | |
2930 | ||
775e7cc0 | 2931 | build_common_tree_nodes (flag_signed_char); |
2932 | ||
471086d6 | 2933 | error_mark_list = build_tree_list (error_mark_node, error_mark_node); |
2934 | TREE_TYPE (error_mark_list) = error_mark_node; | |
2935 | ||
0270ae90 | 2936 | /* Create the `std' namespace. */ |
eaf45f93 | 2937 | push_namespace (std_identifier); |
2938 | std_node = current_namespace; | |
2939 | pop_namespace (); | |
3c3beda6 | 2940 | |
174fcc61 | 2941 | c_common_nodes_and_builtins (); |
c4a8ac95 | 2942 | |
84ea6a1d | 2943 | java_byte_type_node = record_builtin_java_type ("__java_byte", 8); |
2944 | java_short_type_node = record_builtin_java_type ("__java_short", 16); | |
2945 | java_int_type_node = record_builtin_java_type ("__java_int", 32); | |
2946 | java_long_type_node = record_builtin_java_type ("__java_long", 64); | |
2947 | java_float_type_node = record_builtin_java_type ("__java_float", -32); | |
2948 | java_double_type_node = record_builtin_java_type ("__java_double", -64); | |
2949 | java_char_type_node = record_builtin_java_type ("__java_char", -16); | |
2950 | java_boolean_type_node = record_builtin_java_type ("__java_boolean", -1); | |
7d53e30d | 2951 | |
471086d6 | 2952 | integer_two_node = build_int_2 (2, 0); |
2953 | TREE_TYPE (integer_two_node) = integer_type_node; | |
2954 | integer_three_node = build_int_2 (3, 0); | |
2955 | TREE_TYPE (integer_three_node) = integer_type_node; | |
471086d6 | 2956 | |
ca2be8b5 | 2957 | record_builtin_type (RID_BOOL, "bool", boolean_type_node); |
3c2239cf | 2958 | truthvalue_type_node = boolean_type_node; |
2959 | truthvalue_false_node = boolean_false_node; | |
2960 | truthvalue_true_node = boolean_true_node; | |
bb0726a1 | 2961 | |
316b7a44 | 2962 | empty_except_spec = build_tree_list (NULL_TREE, NULL_TREE); |
6bf5ed8d | 2963 | |
2964 | #if 0 | |
4d698345 | 2965 | record_builtin_type (RID_MAX, NULL, string_type_node); |
6bf5ed8d | 2966 | #endif |
2967 | ||
606b494c | 2968 | delta_type_node = ptrdiff_type_node; |
2969 | vtable_index_type = ptrdiff_type_node; | |
63a6a423 | 2970 | |
0ce25b06 | 2971 | vtt_parm_type = build_pointer_type (const_ptr_type_node); |
d2d4bdde | 2972 | void_ftype = build_function_type (void_type_node, void_list_node); |
2973 | void_ftype_ptr = build_function_type (void_type_node, | |
2974 | tree_cons (NULL_TREE, | |
2975 | ptr_type_node, | |
2976 | void_list_node)); | |
02d7f858 | 2977 | void_ftype_ptr |
316b7a44 | 2978 | = build_exception_variant (void_ftype_ptr, empty_except_spec); |
471086d6 | 2979 | |
471086d6 | 2980 | /* C++ extensions */ |
2981 | ||
2982 | unknown_type_node = make_node (UNKNOWN_TYPE); | |
2100d3e8 | 2983 | record_unknown_type (unknown_type_node, "unknown type"); |
2984 | ||
471086d6 | 2985 | /* Indirecting an UNKNOWN_TYPE node yields an UNKNOWN_TYPE node. */ |
2986 | TREE_TYPE (unknown_type_node) = unknown_type_node; | |
c4d89d79 | 2987 | |
c4d89d79 | 2988 | /* Looking up TYPE_POINTER_TO and TYPE_REFERENCE_TO yield the same |
2989 | result. */ | |
471086d6 | 2990 | TYPE_POINTER_TO (unknown_type_node) = unknown_type_node; |
2991 | TYPE_REFERENCE_TO (unknown_type_node) = unknown_type_node; | |
2992 | ||
dc9b5a48 | 2993 | { |
2994 | /* Make sure we get a unique function type, so we can give | |
2995 | its pointer type a name. (This wins for gdb.) */ | |
2996 | tree vfunc_type = make_node (FUNCTION_TYPE); | |
2997 | TREE_TYPE (vfunc_type) = integer_type_node; | |
2998 | TYPE_ARG_TYPES (vfunc_type) = NULL_TREE; | |
2999 | layout_type (vfunc_type); | |
3000 | ||
3001 | vtable_entry_type = build_pointer_type (vfunc_type); | |
3002 | } | |
518796ad | 3003 | record_builtin_type (RID_MAX, VTBL_PTR_TYPE, vtable_entry_type); |
471086d6 | 3004 | |
471086d6 | 3005 | vtbl_type_node |
457b74c8 | 3006 | = build_cplus_array_type (vtable_entry_type, NULL_TREE); |
471086d6 | 3007 | layout_type (vtbl_type_node); |
3e04bd45 | 3008 | vtbl_type_node = build_qualified_type (vtbl_type_node, TYPE_QUAL_CONST); |
4d698345 | 3009 | record_builtin_type (RID_MAX, NULL, vtbl_type_node); |
8ec060ec | 3010 | vtbl_ptr_type_node = build_pointer_type (vtable_entry_type); |
3011 | layout_type (vtbl_ptr_type_node); | |
4d698345 | 3012 | record_builtin_type (RID_MAX, NULL, vtbl_ptr_type_node); |
471086d6 | 3013 | |
606b494c | 3014 | push_namespace (get_identifier ("__cxxabiv1")); |
3015 | abi_node = current_namespace; | |
3016 | pop_namespace (); | |
6686e84d | 3017 | |
8417823c | 3018 | global_type_node = make_node (LANG_TYPE); |
2100d3e8 | 3019 | record_unknown_type (global_type_node, "global type"); |
8417823c | 3020 | |
c25194fd | 3021 | /* Now, C++. */ |
3022 | current_lang_name = lang_name_cplusplus; | |
471086d6 | 3023 | |
4b7a79e2 | 3024 | { |
b7d1e8ea | 3025 | tree bad_alloc_id; |
3026 | tree bad_alloc_type_node; | |
3027 | tree bad_alloc_decl; | |
3028 | tree newtype, deltype; | |
d2d4bdde | 3029 | tree ptr_ftype_sizetype; |
3030 | ||
eaf45f93 | 3031 | push_namespace (std_identifier); |
b7d1e8ea | 3032 | bad_alloc_id = get_identifier ("bad_alloc"); |
3033 | bad_alloc_type_node = make_aggr_type (RECORD_TYPE); | |
3034 | TYPE_CONTEXT (bad_alloc_type_node) = current_namespace; | |
3035 | bad_alloc_decl | |
3036 | = create_implicit_typedef (bad_alloc_id, bad_alloc_type_node); | |
3037 | DECL_CONTEXT (bad_alloc_decl) = current_namespace; | |
3038 | TYPE_STUB_DECL (bad_alloc_type_node) = bad_alloc_decl; | |
eaf45f93 | 3039 | pop_namespace (); |
b7d1e8ea | 3040 | |
d2d4bdde | 3041 | ptr_ftype_sizetype |
3042 | = build_function_type (ptr_type_node, | |
3043 | tree_cons (NULL_TREE, | |
654ef926 | 3044 | size_type_node, |
d2d4bdde | 3045 | void_list_node)); |
8417823c | 3046 | newtype = build_exception_variant |
65b7f83f | 3047 | (ptr_ftype_sizetype, add_exception_specifier |
3048 | (NULL_TREE, bad_alloc_type_node, -1)); | |
316b7a44 | 3049 | deltype = build_exception_variant (void_ftype_ptr, empty_except_spec); |
97cc4539 | 3050 | push_cp_library_fn (NEW_EXPR, newtype); |
3051 | push_cp_library_fn (VEC_NEW_EXPR, newtype); | |
3052 | global_delete_fndecl = push_cp_library_fn (DELETE_EXPR, deltype); | |
3053 | push_cp_library_fn (VEC_DELETE_EXPR, deltype); | |
4b7a79e2 | 3054 | } |
471086d6 | 3055 | |
3056 | abort_fndecl | |
606b494c | 3057 | = build_library_fn_ptr ("__cxa_pure_virtual", void_ftype); |
471086d6 | 3058 | |
471086d6 | 3059 | /* Perform other language dependent initializations. */ |
3060 | init_class_processing (); | |
471086d6 | 3061 | init_search_processing (); |
1ca0e0c0 | 3062 | init_rtti_processing (); |
471086d6 | 3063 | |
596c0ae6 | 3064 | if (flag_exceptions) |
f96b25bb | 3065 | init_exception_processing (); |
63b1d638 | 3066 | |
d200dc92 | 3067 | if (! supports_one_only ()) |
3d4e092a | 3068 | flag_weak = 0; |
471086d6 | 3069 | |
9e5a737d | 3070 | make_fname_decl = cp_make_fname_decl; |
65b7f83f | 3071 | start_fname_decls (); |
471086d6 | 3072 | |
0dbd1c74 | 3073 | /* Show we use EH for cleanups. */ |
4ee9c684 | 3074 | if (flag_exceptions) |
3075 | using_eh_for_cleanups (); | |
fce73460 | 3076 | } |
3077 | ||
65b7f83f | 3078 | /* Generate an initializer for a function naming variable from |
4880ab99 | 3079 | NAME. NAME may be NULL, to indicate a dependent name. TYPE_P is |
331bc0ad | 3080 | filled in with the type of the init. */ |
65b7f83f | 3081 | |
3082 | tree | |
4880ab99 | 3083 | cp_fname_init (const char* name, tree *type_p) |
65b7f83f | 3084 | { |
3085 | tree domain = NULL_TREE; | |
3086 | tree type; | |
3087 | tree init = NULL_TREE; | |
3088 | size_t length = 0; | |
3089 | ||
3090 | if (name) | |
3091 | { | |
3092 | length = strlen (name); | |
3093 | domain = build_index_type (size_int (length)); | |
3094 | init = build_string (length + 1, name); | |
3095 | } | |
3096 | ||
3097 | type = build_qualified_type (char_type_node, TYPE_QUAL_CONST); | |
3098 | type = build_cplus_array_type (type, domain); | |
3099 | ||
4880ab99 | 3100 | *type_p = type; |
3101 | ||
65b7f83f | 3102 | if (init) |
3103 | TREE_TYPE (init) = type; | |
3104 | else | |
4880ab99 | 3105 | init = error_mark_node; |
65b7f83f | 3106 | |
3107 | return init; | |
3108 | } | |
3109 | ||
9e5a737d | 3110 | /* Create the VAR_DECL for __FUNCTION__ etc. ID is the name to give the |
3111 | decl, NAME is the initialization string and TYPE_DEP indicates whether | |
3112 | NAME depended on the type of the function. We make use of that to detect | |
65b7f83f | 3113 | __PRETTY_FUNCTION__ inside a template fn. This is being done |
f5f73833 | 3114 | lazily at the point of first use, so we mustn't push the decl now. */ |
9e5a737d | 3115 | |
3116 | static tree | |
1b72315d | 3117 | cp_make_fname_decl (tree id, int type_dep) |
9e5a737d | 3118 | { |
0d95286f | 3119 | const char *const name = (type_dep && processing_template_decl |
d148dc28 | 3120 | ? NULL : fname_as_string (type_dep)); |
4880ab99 | 3121 | tree type; |
3122 | tree init = cp_fname_init (name, &type); | |
3123 | tree decl = build_decl (VAR_DECL, id, type); | |
9e5a737d | 3124 | |
15c4b973 | 3125 | if (name) |
3126 | free ((char *) name); | |
3127 | ||
81010c97 | 3128 | /* As we're using pushdecl_with_scope, we must set the context. */ |
65b7f83f | 3129 | DECL_CONTEXT (decl) = current_function_decl; |
3130 | DECL_PRETTY_FUNCTION_P (decl) = type_dep; | |
3131 | ||
9e5a737d | 3132 | TREE_STATIC (decl) = 1; |
3133 | TREE_READONLY (decl) = 1; | |
9e5a737d | 3134 | DECL_ARTIFICIAL (decl) = 1; |
9e5a737d | 3135 | DECL_INITIAL (decl) = init; |
65b7f83f | 3136 | |
3137 | TREE_USED (decl) = 1; | |
3c3beda6 | 3138 | |
81010c97 | 3139 | if (current_function_decl) |
3140 | { | |
3141 | struct cp_binding_level *b = current_binding_level; | |
37b9a732 | 3142 | while (b->level_chain->kind != sk_function_parms) |
81010c97 | 3143 | b = b->level_chain; |
3144 | pushdecl_with_scope (decl, b); | |
2f24a61c | 3145 | cp_finish_decl (decl, init, NULL_TREE, LOOKUP_ONLYCONVERTING); |
d148dc28 | 3146 | } |
2f24a61c | 3147 | else |
3148 | pushdecl_top_level_and_finish (decl, init); | |
65b7f83f | 3149 | |
9e5a737d | 3150 | return decl; |
3151 | } | |
3152 | ||
ae8cbbc8 | 3153 | /* Make a definition for a builtin function named NAME in the current |
3154 | namespace, whose data type is TYPE and whose context is CONTEXT. | |
3155 | TYPE should be a function type with argument types. | |
471086d6 | 3156 | |
d267eaf5 | 3157 | CLASS and CODE tell later passes how to compile calls to this function. |
3158 | See tree.h for possible values. | |
3159 | ||
3160 | If LIBNAME is nonzero, use that for DECL_ASSEMBLER_NAME, | |
a06abcfb | 3161 | the name to be called if we can't opencode the function. |
3162 | If ATTRS is nonzero, use that for the function's attribute | |
3163 | list. */ | |
471086d6 | 3164 | |
ae8cbbc8 | 3165 | static tree |
1b72315d | 3166 | builtin_function_1 (const char* name, |
3167 | tree type, | |
3168 | tree context, | |
3169 | int code, | |
3170 | enum built_in_class class, | |
3171 | const char* libname, | |
3172 | tree attrs) | |
471086d6 | 3173 | { |
97cc4539 | 3174 | tree decl = build_library_fn_1 (get_identifier (name), ERROR_MARK, type); |
d267eaf5 | 3175 | DECL_BUILT_IN_CLASS (decl) = class; |
3176 | DECL_FUNCTION_CODE (decl) = code; | |
ae8cbbc8 | 3177 | DECL_CONTEXT (decl) = context; |
00dd2e9e | 3178 | |
0270ae90 | 3179 | pushdecl (decl); |
0270ae90 | 3180 | |
471086d6 | 3181 | /* Since `pushdecl' relies on DECL_ASSEMBLER_NAME instead of DECL_NAME, |
3182 | we cannot change DECL_ASSEMBLER_NAME until we have installed this | |
3183 | function in the namespace. */ | |
d267eaf5 | 3184 | if (libname) |
7e64c604 | 3185 | SET_DECL_ASSEMBLER_NAME (decl, get_identifier (libname)); |
3186 | make_decl_rtl (decl, NULL); | |
c324ed63 | 3187 | |
3188 | /* Warn if a function in the namespace for users | |
3189 | is used without an occasion to consider it declared. */ | |
3190 | if (name[0] != '_' || name[1] != '_') | |
3191 | DECL_ANTICIPATED (decl) = 1; | |
3192 | ||
7d3b509a | 3193 | /* Possibly apply some default attributes to this built-in function. */ |
a06abcfb | 3194 | if (attrs) |
3195 | decl_attributes (&decl, attrs, ATTR_FLAG_BUILT_IN); | |
3196 | else | |
3197 | decl_attributes (&decl, NULL_TREE, 0); | |
7d3b509a | 3198 | |
471086d6 | 3199 | return decl; |
3200 | } | |
72040e7e | 3201 | |
ae8cbbc8 | 3202 | /* Entry point for the benefit of c_common_nodes_and_builtins. |
3203 | ||
755edffd | 3204 | Make a definition for a builtin function named NAME and whose data type |
ae8cbbc8 | 3205 | is TYPE. TYPE should be a function type with argument types. This |
3206 | function places the anticipated declaration in the global namespace | |
3207 | and additionally in the std namespace if appropriate. | |
3208 | ||
3209 | CLASS and CODE tell later passes how to compile calls to this function. | |
3210 | See tree.h for possible values. | |
3211 | ||
3212 | If LIBNAME is nonzero, use that for DECL_ASSEMBLER_NAME, | |
a06abcfb | 3213 | the name to be called if we can't opencode the function. |
3214 | ||
3215 | If ATTRS is nonzero, use that for the function's attribute | |
3216 | list. */ | |
ae8cbbc8 | 3217 | |
3218 | tree | |
1b72315d | 3219 | builtin_function (const char* name, |
3220 | tree type, | |
3221 | int code, | |
3222 | enum built_in_class class, | |
3223 | const char* libname, | |
3224 | tree attrs) | |
ae8cbbc8 | 3225 | { |
3226 | /* All builtins that don't begin with an '_' should additionally | |
3227 | go in the 'std' namespace. */ | |
3228 | if (name[0] != '_') | |
3229 | { | |
3230 | push_namespace (std_identifier); | |
a06abcfb | 3231 | builtin_function_1 (name, type, std_node, code, class, libname, attrs); |
ae8cbbc8 | 3232 | pop_namespace (); |
3233 | } | |
3234 | ||
a06abcfb | 3235 | return builtin_function_1 (name, type, NULL_TREE, code, |
3236 | class, libname, attrs); | |
ae8cbbc8 | 3237 | } |
3238 | ||
d267eaf5 | 3239 | /* Generate a FUNCTION_DECL with the typical flags for a runtime library |
3240 | function. Not called directly. */ | |
3241 | ||
3242 | static tree | |
1b72315d | 3243 | build_library_fn_1 (tree name, enum tree_code operator_code, tree type) |
d267eaf5 | 3244 | { |
3245 | tree fn = build_lang_decl (FUNCTION_DECL, name, type); | |
3246 | DECL_EXTERNAL (fn) = 1; | |
3247 | TREE_PUBLIC (fn) = 1; | |
3248 | DECL_ARTIFICIAL (fn) = 1; | |
3249 | TREE_NOTHROW (fn) = 1; | |
97cc4539 | 3250 | SET_OVERLOADED_OPERATOR_CODE (fn, operator_code); |
4b1984f5 | 3251 | SET_DECL_LANGUAGE (fn, lang_c); |
d267eaf5 | 3252 | return fn; |
3253 | } | |
c215939a | 3254 | |
d267eaf5 | 3255 | /* Returns the _DECL for a library function with C linkage. |
3256 | We assume that such functions never throw; if this is incorrect, | |
3257 | callers should unset TREE_NOTHROW. */ | |
c215939a | 3258 | |
72040e7e | 3259 | tree |
1b72315d | 3260 | build_library_fn (tree name, tree type) |
d267eaf5 | 3261 | { |
0e8e37b2 | 3262 | return build_library_fn_1 (name, ERROR_MARK, type); |
d267eaf5 | 3263 | } |
3264 | ||
3265 | /* Returns the _DECL for a library function with C++ linkage. */ | |
3266 | ||
97cc4539 | 3267 | static tree |
1b72315d | 3268 | build_cp_library_fn (tree name, enum tree_code operator_code, tree type) |
d267eaf5 | 3269 | { |
97cc4539 | 3270 | tree fn = build_library_fn_1 (name, operator_code, type); |
d267eaf5 | 3271 | TREE_NOTHROW (fn) = TYPE_NOTHROW_P (type); |
c87435c8 | 3272 | DECL_CONTEXT (fn) = FROB_CONTEXT (current_namespace); |
4b1984f5 | 3273 | SET_DECL_LANGUAGE (fn, lang_cplusplus); |
d267eaf5 | 3274 | set_mangled_name_for_decl (fn); |
d267eaf5 | 3275 | return fn; |
3276 | } | |
3277 | ||
3278 | /* Like build_library_fn, but takes a C string instead of an | |
3279 | IDENTIFIER_NODE. */ | |
3280 | ||
3281 | tree | |
1b72315d | 3282 | build_library_fn_ptr (const char* name, tree type) |
72040e7e | 3283 | { |
d267eaf5 | 3284 | return build_library_fn (get_identifier (name), type); |
3285 | } | |
3286 | ||
3287 | /* Like build_cp_library_fn, but takes a C string instead of an | |
3288 | IDENTIFIER_NODE. */ | |
3289 | ||
3290 | tree | |
1b72315d | 3291 | build_cp_library_fn_ptr (const char* name, tree type) |
d267eaf5 | 3292 | { |
97cc4539 | 3293 | return build_cp_library_fn (get_identifier (name), ERROR_MARK, type); |
d267eaf5 | 3294 | } |
3295 | ||
3296 | /* Like build_library_fn, but also pushes the function so that we will | |
3297 | be able to find it via IDENTIFIER_GLOBAL_VALUE. */ | |
3298 | ||
3299 | tree | |
1b72315d | 3300 | push_library_fn (tree name, tree type) |
d267eaf5 | 3301 | { |
3302 | tree fn = build_library_fn (name, type); | |
3303 | pushdecl_top_level (fn); | |
3304 | return fn; | |
3305 | } | |
3306 | ||
3307 | /* Like build_cp_library_fn, but also pushes the function so that it | |
3308 | will be found by normal lookup. */ | |
3309 | ||
97cc4539 | 3310 | static tree |
1b72315d | 3311 | push_cp_library_fn (enum tree_code operator_code, tree type) |
d267eaf5 | 3312 | { |
3c3beda6 | 3313 | tree fn = build_cp_library_fn (ansi_opname (operator_code), |
97cc4539 | 3314 | operator_code, |
3315 | type); | |
d267eaf5 | 3316 | pushdecl (fn); |
3317 | return fn; | |
3318 | } | |
3319 | ||
3320 | /* Like push_library_fn, but takes a TREE_LIST of parm types rather than | |
3321 | a FUNCTION_TYPE. */ | |
3322 | ||
3323 | tree | |
1b72315d | 3324 | push_void_library_fn (tree name, tree parmtypes) |
d267eaf5 | 3325 | { |
3326 | tree type = build_function_type (void_type_node, parmtypes); | |
3327 | return push_library_fn (name, type); | |
3328 | } | |
3329 | ||
93d6541c | 3330 | /* Like push_library_fn, but also note that this function throws |
d267eaf5 | 3331 | and does not return. Used for __throw_foo and the like. */ |
3332 | ||
3333 | tree | |
1b72315d | 3334 | push_throw_library_fn (tree name, tree type) |
d267eaf5 | 3335 | { |
93d6541c | 3336 | tree fn = push_library_fn (name, type); |
d267eaf5 | 3337 | TREE_THIS_VOLATILE (fn) = 1; |
3338 | TREE_NOTHROW (fn) = 0; | |
3339 | return fn; | |
72040e7e | 3340 | } |
471086d6 | 3341 | \f |
0f2952a1 | 3342 | /* When we call finish_struct for an anonymous union, we create |
3343 | default copy constructors and such. But, an anonymous union | |
3344 | shouldn't have such things; this function undoes the damage to the | |
3345 | anonymous union type T. | |
3346 | ||
3347 | (The reason that we create the synthesized methods is that we don't | |
3348 | distinguish `union { int i; }' from `typedef union { int i; } U'. | |
3349 | The first is an anonymous union; the second is just an ordinary | |
3350 | union type.) */ | |
3351 | ||
3352 | void | |
1b72315d | 3353 | fixup_anonymous_aggr (tree t) |
0f2952a1 | 3354 | { |
3355 | tree *q; | |
3356 | ||
331bc0ad | 3357 | /* Wipe out memory of synthesized methods. */ |
0f2952a1 | 3358 | TYPE_HAS_CONSTRUCTOR (t) = 0; |
3359 | TYPE_HAS_DEFAULT_CONSTRUCTOR (t) = 0; | |
3360 | TYPE_HAS_INIT_REF (t) = 0; | |
3361 | TYPE_HAS_CONST_INIT_REF (t) = 0; | |
3362 | TYPE_HAS_ASSIGN_REF (t) = 0; | |
0f2952a1 | 3363 | TYPE_HAS_CONST_ASSIGN_REF (t) = 0; |
3364 | ||
3365 | /* Splice the implicitly generated functions out of the TYPE_METHODS | |
3366 | list. */ | |
3367 | q = &TYPE_METHODS (t); | |
3368 | while (*q) | |
3369 | { | |
3370 | if (DECL_ARTIFICIAL (*q)) | |
3371 | *q = TREE_CHAIN (*q); | |
3372 | else | |
3373 | q = &TREE_CHAIN (*q); | |
3374 | } | |
3375 | ||
657c76e1 | 3376 | /* ISO C++ 9.5.3. Anonymous unions may not have function members. */ |
0f2952a1 | 3377 | if (TYPE_METHODS (t)) |
9bc3739f | 3378 | error ("%Jan anonymous union cannot have function members", |
3379 | TYPE_MAIN_DECL (t)); | |
69821268 | 3380 | |
3381 | /* Anonymous aggregates cannot have fields with ctors, dtors or complex | |
3382 | assignment operators (because they cannot have these methods themselves). | |
3383 | For anonymous unions this is already checked because they are not allowed | |
3384 | in any union, otherwise we have to check it. */ | |
3385 | if (TREE_CODE (t) != UNION_TYPE) | |
3386 | { | |
3387 | tree field, type; | |
3388 | ||
3389 | for (field = TYPE_FIELDS (t); field; field = TREE_CHAIN (field)) | |
3390 | if (TREE_CODE (field) == FIELD_DECL) | |
3391 | { | |
3392 | type = TREE_TYPE (field); | |
3393 | if (CLASS_TYPE_P (type)) | |
3394 | { | |
3395 | if (TYPE_NEEDS_CONSTRUCTING (type)) | |
3396 | cp_error_at ("member %#D' with constructor not allowed in anonymous aggregate", | |
3397 | field); | |
3398 | if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type)) | |
3399 | cp_error_at ("member %#D' with destructor not allowed in anonymous aggregate", | |
3400 | field); | |
3401 | if (TYPE_HAS_COMPLEX_ASSIGN_REF (type)) | |
3402 | cp_error_at ("member %#D' with copy assignment operator not allowed in anonymous aggregate", | |
3403 | field); | |
3404 | } | |
3405 | } | |
3406 | } | |
0f2952a1 | 3407 | } |
3408 | ||
37b8b0d0 | 3409 | /* Make sure that a declaration with no declarator is well-formed, i.e. |
0a3b29ad | 3410 | just declares a tagged type or anonymous union. |
471086d6 | 3411 | |
0a3b29ad | 3412 | Returns the type declared; or NULL_TREE if none. */ |
471086d6 | 3413 | |
37b8b0d0 | 3414 | tree |
1b72315d | 3415 | check_tag_decl (tree declspecs) |
471086d6 | 3416 | { |
37b8b0d0 | 3417 | int found_type = 0; |
d9f88785 | 3418 | int saw_friend = 0; |
a614c830 | 3419 | int saw_typedef = 0; |
bb0726a1 | 3420 | tree ob_modifier = NULL_TREE; |
cd16867a | 3421 | tree link; |
0a3b29ad | 3422 | /* If a class, struct, or enum type is declared by the DECLSPECS |
3423 | (i.e, if a class-specifier, enum-specifier, or non-typename | |
3424 | elaborated-type-specifier appears in the DECLSPECS), | |
3425 | DECLARED_TYPE is set to the corresponding type. */ | |
3426 | tree declared_type = NULL_TREE; | |
3427 | bool error_p = false; | |
471086d6 | 3428 | |
3429 | for (link = declspecs; link; link = TREE_CHAIN (link)) | |
3430 | { | |
0a3b29ad | 3431 | tree value = TREE_VALUE (link); |
471086d6 | 3432 | |
df2c7ecb | 3433 | if (TYPE_P (value) || TREE_CODE (value) == TYPE_DECL |
d9f88785 | 3434 | || (TREE_CODE (value) == IDENTIFIER_NODE |
df2c7ecb | 3435 | && is_typename_at_global_scope (value))) |
471086d6 | 3436 | { |
37b8b0d0 | 3437 | ++found_type; |
e857e9c7 | 3438 | |
614cc70d | 3439 | if (found_type == 2 && TREE_CODE (value) == IDENTIFIER_NODE) |
3440 | { | |
3441 | if (! in_system_header) | |
cf103c6c | 3442 | pedwarn ("redeclaration of C++ built-in type `%T'", value); |
614cc70d | 3443 | return NULL_TREE; |
3444 | } | |
3445 | ||
3446 | if (TYPE_P (value) | |
3447 | && ((TREE_CODE (value) != TYPENAME_TYPE && IS_AGGR_TYPE (value)) | |
3448 | || TREE_CODE (value) == ENUMERAL_TYPE)) | |
37b8b0d0 | 3449 | { |
3450 | my_friendly_assert (TYPE_MAIN_DECL (value) != NULL_TREE, 261); | |
0a3b29ad | 3451 | declared_type = value; |
37b8b0d0 | 3452 | } |
471086d6 | 3453 | } |
a614c830 | 3454 | else if (value == ridpointers[(int) RID_TYPEDEF]) |
3455 | saw_typedef = 1; | |
6896278d | 3456 | else if (value == ridpointers[(int) RID_FRIEND]) |
3457 | { | |
6896278d | 3458 | if (current_class_type == NULL_TREE |
3459 | || current_scope () != current_class_type) | |
3460 | ob_modifier = value; | |
d9f88785 | 3461 | else |
3462 | saw_friend = 1; | |
6896278d | 3463 | } |
471086d6 | 3464 | else if (value == ridpointers[(int) RID_STATIC] |
bb0726a1 | 3465 | || value == ridpointers[(int) RID_EXTERN] |
3466 | || value == ridpointers[(int) RID_AUTO] | |
bea7d742 | 3467 | || value == ridpointers[(int) RID_REGISTER] |
3468 | || value == ridpointers[(int) RID_INLINE] | |
3469 | || value == ridpointers[(int) RID_VIRTUAL] | |
37b8b0d0 | 3470 | || value == ridpointers[(int) RID_CONST] |
3471 | || value == ridpointers[(int) RID_VOLATILE] | |
e396cd54 | 3472 | || value == ridpointers[(int) RID_EXPLICIT] |
3473 | || value == ridpointers[(int) RID_THREAD]) | |
bb0726a1 | 3474 | ob_modifier = value; |
0a3b29ad | 3475 | else if (value == error_mark_node) |
3476 | error_p = true; | |
471086d6 | 3477 | } |
3478 | ||
37b8b0d0 | 3479 | if (found_type > 1) |
3480 | error ("multiple types in one declaration"); | |
48994391 | 3481 | |
0a3b29ad | 3482 | if (declared_type == NULL_TREE && ! saw_friend && !error_p) |
48994391 | 3483 | pedwarn ("declaration does not declare anything"); |
83c4eacf | 3484 | /* Check for an anonymous union. */ |
0a3b29ad | 3485 | else if (declared_type && IS_AGGR_TYPE_CODE (TREE_CODE (declared_type)) |
3486 | && TYPE_ANONYMOUS_P (declared_type)) | |
84b5d9d7 | 3487 | { |
a614c830 | 3488 | /* 7/3 In a simple-declaration, the optional init-declarator-list |
3489 | can be omitted only when declaring a class (clause 9) or | |
3490 | enumeration (7.2), that is, when the decl-specifier-seq contains | |
3491 | either a class-specifier, an elaborated-type-specifier with | |
3492 | a class-key (9.1), or an enum-specifier. In these cases and | |
3493 | whenever a class-specifier or enum-specifier is present in the | |
3494 | decl-specifier-seq, the identifiers in these specifiers are among | |
3495 | the names being declared by the declaration (as class-name, | |
3496 | enum-names, or enumerators, depending on the syntax). In such | |
3497 | cases, and except for the declaration of an unnamed bit-field (9.6), | |
3498 | the decl-specifier-seq shall introduce one or more names into the | |
3499 | program, or shall redeclare a name introduced by a previous | |
3500 | declaration. [Example: | |
3501 | enum { }; // ill-formed | |
3502 | typedef class { }; // ill-formed | |
3503 | --end example] */ | |
3504 | if (saw_typedef) | |
3505 | { | |
ebae5c09 | 3506 | error ("missing type-name in typedef-declaration"); |
a614c830 | 3507 | return NULL_TREE; |
3508 | } | |
84b5d9d7 | 3509 | /* Anonymous unions are objects, so they can have specifiers. */; |
0a3b29ad | 3510 | SET_ANON_AGGR_TYPE_P (declared_type); |
128e1d72 | 3511 | |
0a3b29ad | 3512 | if (TREE_CODE (declared_type) != UNION_TYPE && pedantic |
3513 | && !in_system_header) | |
128e1d72 | 3514 | pedwarn ("ISO C++ prohibits anonymous structs"); |
84b5d9d7 | 3515 | } |
3516 | ||
6896278d | 3517 | else if (ob_modifier) |
471086d6 | 3518 | { |
6896278d | 3519 | if (ob_modifier == ridpointers[(int) RID_INLINE] |
3520 | || ob_modifier == ridpointers[(int) RID_VIRTUAL]) | |
cf103c6c | 3521 | error ("`%D' can only be specified for functions", ob_modifier); |
6896278d | 3522 | else if (ob_modifier == ridpointers[(int) RID_FRIEND]) |
cf103c6c | 3523 | error ("`%D' can only be specified inside a class", ob_modifier); |
6896278d | 3524 | else if (ob_modifier == ridpointers[(int) RID_EXPLICIT]) |
cf103c6c | 3525 | error ("`%D' can only be specified for constructors", |
6896278d | 3526 | ob_modifier); |
3527 | else | |
cf103c6c | 3528 | error ("`%D' can only be specified for objects and functions", |
6896278d | 3529 | ob_modifier); |
37b8b0d0 | 3530 | } |
471086d6 | 3531 | |
0a3b29ad | 3532 | return declared_type; |
37b8b0d0 | 3533 | } |
3534 | ||
3535 | /* Called when a declaration is seen that contains no names to declare. | |
3536 | If its type is a reference to a structure, union or enum inherited | |
3537 | from a containing scope, shadow that tag name for the current scope | |
3538 | with a forward reference. | |
3539 | If its type defines a new named structure or union | |
3540 | or defines an enum, it is valid but we need not do anything here. | |
3541 | Otherwise, it is an error. | |
3542 | ||
3543 | C++: may have to grok the declspecs to learn about static, | |
0a3b29ad | 3544 | complain for anonymous unions. |
37b8b0d0 | 3545 | |
0a3b29ad | 3546 | Returns the TYPE declared -- or NULL_TREE if none. */ |
3547 | ||
3548 | tree | |
1b72315d | 3549 | shadow_tag (tree declspecs) |
37b8b0d0 | 3550 | { |
3551 | tree t = check_tag_decl (declspecs); | |
3552 | ||
0a3b29ad | 3553 | if (!t) |
3554 | return NULL_TREE; | |
3555 | ||
3556 | maybe_process_partial_specialization (t); | |
37b8b0d0 | 3557 | |
3558 | /* This is where the variables in an anonymous union are | |
3559 | declared. An anonymous union declaration looks like: | |
3560 | union { ... } ; | |
3561 | because there is no declarator after the union, the parser | |
3562 | sends that declaration here. */ | |
0a3b29ad | 3563 | if (ANON_AGGR_TYPE_P (t)) |
37b8b0d0 | 3564 | { |
128e1d72 | 3565 | fixup_anonymous_aggr (t); |
37b8b0d0 | 3566 | |
3567 | if (TYPE_FIELDS (t)) | |
3568 | { | |
3569 | tree decl = grokdeclarator (NULL_TREE, declspecs, NORMAL, 0, | |
e3c541f0 | 3570 | NULL); |
37b8b0d0 | 3571 | finish_anon_union (decl); |
3572 | } | |
471086d6 | 3573 | } |
0a3b29ad | 3574 | |
3575 | return t; | |
471086d6 | 3576 | } |
3577 | \f | |
3578 | /* Decode a "typename", such as "int **", returning a ..._TYPE node. */ | |
3579 | ||
3580 | tree | |
1b72315d | 3581 | groktypename (tree typename) |
471086d6 | 3582 | { |
bf2bc322 | 3583 | tree specs, attrs; |
3584 | tree type; | |
471086d6 | 3585 | if (TREE_CODE (typename) != TREE_LIST) |
3586 | return typename; | |
bf2bc322 | 3587 | split_specs_attrs (TREE_PURPOSE (typename), &specs, &attrs); |
3588 | type = grokdeclarator (TREE_VALUE (typename), specs, | |
3589 | TYPENAME, 0, &attrs); | |
3590 | if (attrs) | |
3591 | cplus_decl_attributes (&type, attrs, 0); | |
3592 | return type; | |
471086d6 | 3593 | } |
3594 | ||
3595 | /* Decode a declarator in an ordinary declaration or data definition. | |
3596 | This is called as soon as the type information and variable name | |
3597 | have been parsed, before parsing the initializer if any. | |
3598 | Here we create the ..._DECL node, fill in its type, | |
3599 | and put it on the list of decls for the current context. | |
3600 | The ..._DECL node is returned as the value. | |
3601 | ||
3602 | Exception: for arrays where the length is not specified, | |
e4118769 | 3603 | the type is left null, to be filled in by `cp_finish_decl'. |
471086d6 | 3604 | |
3605 | Function definitions do not come here; they go to start_function | |
3606 | instead. However, external and forward declarations of functions | |
3607 | do go through here. Structure field declarations are done by | |
3608 | grokfield and not through here. */ | |
3609 | ||
471086d6 | 3610 | tree |
1b72315d | 3611 | start_decl (tree declarator, |
3612 | tree declspecs, | |
3613 | int initialized, | |
3614 | tree attributes, | |
3615 | tree prefix_attributes) | |
471086d6 | 3616 | { |
9581e01c | 3617 | tree decl; |
cd16867a | 3618 | tree type, tem; |
471086d6 | 3619 | tree context; |
471086d6 | 3620 | |
96624a9e | 3621 | /* This should only be done once on the top most decl. */ |
92c38d80 | 3622 | if (have_extern_spec) |
471086d6 | 3623 | { |
d7c47c0e | 3624 | declspecs = tree_cons (NULL_TREE, get_identifier ("extern"), |
3625 | declspecs); | |
92c38d80 | 3626 | have_extern_spec = false; |
471086d6 | 3627 | } |
3628 | ||
88da234d | 3629 | /* An object declared as __attribute__((deprecated)) suppresses |
3630 | warnings of uses of other deprecated items. */ | |
3631 | if (lookup_attribute ("deprecated", attributes)) | |
3632 | deprecated_state = DEPRECATED_SUPPRESS; | |
3633 | ||
e3c541f0 | 3634 | attributes = chainon (attributes, prefix_attributes); |
d8f6e09c | 3635 | |
f9670f72 | 3636 | decl = grokdeclarator (declarator, declspecs, NORMAL, initialized, |
e3c541f0 | 3637 | &attributes); |
980877d7 | 3638 | |
88da234d | 3639 | deprecated_state = DEPRECATED_NORMAL; |
3640 | ||
f468434d | 3641 | if (decl == NULL_TREE || TREE_CODE (decl) == VOID_TYPE) |
471086d6 | 3642 | return NULL_TREE; |
3643 | ||
3644 | type = TREE_TYPE (decl); | |
3645 | ||
67b61957 | 3646 | if (type == error_mark_node) |
3647 | return NULL_TREE; | |
3648 | ||
9ba4048d | 3649 | context = DECL_CONTEXT (decl); |
471086d6 | 3650 | |
6f186963 | 3651 | if (initialized && context && TREE_CODE (context) == NAMESPACE_DECL |
3652 | && context != current_namespace && TREE_CODE (decl) == VAR_DECL) | |
3653 | { | |
3654 | /* When parsing the initializer, lookup should use the object's | |
a109dc3b | 3655 | namespace. */ |
6f186963 | 3656 | push_decl_namespace (context); |
3657 | } | |
3658 | ||
a109dc3b | 3659 | /* We are only interested in class contexts, later. */ |
8417823c | 3660 | if (context && TREE_CODE (context) == NAMESPACE_DECL) |
3661 | context = NULL_TREE; | |
3662 | ||
471086d6 | 3663 | if (initialized) |
3664 | /* Is it valid for this decl to have an initializer at all? | |
3665 | If not, set INITIALIZED to zero, which will indirectly | |
e4118769 | 3666 | tell `cp_finish_decl' to ignore the initializer once it is parsed. */ |
471086d6 | 3667 | switch (TREE_CODE (decl)) |
3668 | { | |
3669 | case TYPE_DECL: | |
bffbea28 | 3670 | error ("typedef `%D' is initialized (use __typeof__ instead)", decl); |
f6f89f14 | 3671 | initialized = 0; |
471086d6 | 3672 | break; |
3673 | ||
3674 | case FUNCTION_DECL: | |
cf103c6c | 3675 | error ("function `%#D' is initialized like a variable", decl); |
471086d6 | 3676 | initialized = 0; |
3677 | break; | |
3678 | ||
3679 | default: | |
4a7414ab | 3680 | break; |
471086d6 | 3681 | } |
3682 | ||
471086d6 | 3683 | if (initialized) |
3684 | { | |
d0622bdf | 3685 | if (! toplevel_bindings_p () |
471086d6 | 3686 | && DECL_EXTERNAL (decl)) |
cf103c6c | 3687 | warning ("declaration of `%#D' has `extern' and is initialized", |
471086d6 | 3688 | decl); |
3689 | DECL_EXTERNAL (decl) = 0; | |
e857e9c7 | 3690 | if (toplevel_bindings_p ()) |
471086d6 | 3691 | TREE_STATIC (decl) = 1; |
3692 | ||
3693 | /* Tell `pushdecl' this is an initialized decl | |
3694 | even though we don't yet have the initializer expression. | |
e4118769 | 3695 | Also tell `cp_finish_decl' it may store the real initializer. */ |
471086d6 | 3696 | DECL_INITIAL (decl) = error_mark_node; |
3697 | } | |
3698 | ||
9f45906c | 3699 | /* Set attributes here so if duplicate decl, will have proper attributes. */ |
e3c541f0 | 3700 | cplus_decl_attributes (&decl, attributes, 0); |
9f45906c | 3701 | |
5626f4cd | 3702 | /* If #pragma weak was used, mark the decl weak now. */ |
ddeeea02 | 3703 | if (global_scope_p (current_binding_level)) |
5626f4cd | 3704 | maybe_apply_pragma_weak (decl); |
3705 | ||
5955c361 | 3706 | if (TREE_CODE (decl) == FUNCTION_DECL |
3707 | && DECL_DECLARED_INLINE_P (decl) | |
3708 | && DECL_UNINLINABLE (decl) | |
3709 | && lookup_attribute ("noinline", DECL_ATTRIBUTES (decl))) | |
9bc3739f | 3710 | warning ("%Jinline function '%D' given attribute noinline", decl, decl); |
5955c361 | 3711 | |
4b72716d | 3712 | if (context && COMPLETE_TYPE_P (complete_type (context))) |
822f06da | 3713 | { |
5f6526e1 | 3714 | push_nested_class (context); |
07f4da33 | 3715 | |
822f06da | 3716 | if (TREE_CODE (decl) == VAR_DECL) |
3717 | { | |
b330805e | 3718 | tree field = lookup_field (context, DECL_NAME (decl), 0, false); |
822f06da | 3719 | if (field == NULL_TREE || TREE_CODE (field) != VAR_DECL) |
cf103c6c | 3720 | error ("`%#D' is not a static member of `%#T'", decl, context); |
1ad432f2 | 3721 | else |
3722 | { | |
3723 | if (DECL_CONTEXT (field) != context) | |
3d2dcf3a | 3724 | { |
0a3b29ad | 3725 | if (!same_type_p (DECL_CONTEXT (field), context)) |
3726 | pedwarn ("ISO C++ does not permit `%T::%D' to be defined as `%T::%D'", | |
3727 | DECL_CONTEXT (field), DECL_NAME (decl), | |
3728 | context, DECL_NAME (decl)); | |
3d2dcf3a | 3729 | DECL_CONTEXT (decl) = DECL_CONTEXT (field); |
3730 | } | |
668ae905 | 3731 | /* Static data member are tricky; an in-class initialization |
3732 | still doesn't provide a definition, so the in-class | |
3733 | declaration will have DECL_EXTERNAL set, but will have an | |
3734 | initialization. Thus, duplicate_decls won't warn | |
3735 | about this situation, and so we check here. */ | |
3736 | if (DECL_INITIAL (decl) && DECL_INITIAL (field)) | |
cf103c6c | 3737 | error ("duplicate initialization of %D", decl); |
1ad432f2 | 3738 | if (duplicate_decls (decl, field)) |
3739 | decl = field; | |
3740 | } | |
822f06da | 3741 | } |
ce28ee2e | 3742 | else |
3743 | { | |
7bdfc61c | 3744 | tree field = check_classfn (context, decl, |
0122f52b | 3745 | (processing_template_decl |
3746 | > template_class_depth (context)) | |
3747 | ? current_template_parms | |
3748 | : NULL_TREE); | |
ce28ee2e | 3749 | if (field && duplicate_decls (decl, field)) |
3750 | decl = field; | |
3751 | } | |
3752 | ||
3753 | /* cp_finish_decl sets DECL_EXTERNAL if DECL_IN_AGGR_P is set. */ | |
8a5e9d02 | 3754 | DECL_IN_AGGR_P (decl) = 0; |
980877d7 | 3755 | if ((DECL_LANG_SPECIFIC (decl) && DECL_USE_TEMPLATE (decl)) |
98eaf693 | 3756 | || CLASSTYPE_TEMPLATE_INSTANTIATION (context)) |
2ad9569d | 3757 | { |
3758 | SET_DECL_TEMPLATE_SPECIALIZATION (decl); | |
3759 | /* [temp.expl.spec] An explicit specialization of a static data | |
3760 | member of a template is a definition if the declaration | |
3761 | includes an initializer; otherwise, it is a declaration. | |
3762 | ||
3763 | We check for processing_specialization so this only applies | |
3764 | to the new specialization syntax. */ | |
3765 | if (DECL_INITIAL (decl) == NULL_TREE && processing_specialization) | |
3766 | DECL_EXTERNAL (decl) = 1; | |
3767 | } | |
ce28ee2e | 3768 | |
ef5a592c | 3769 | if (DECL_EXTERNAL (decl) && ! DECL_TEMPLATE_SPECIALIZATION (decl)) |
cf103c6c | 3770 | pedwarn ("declaration of `%#D' outside of class is not definition", |
ce28ee2e | 3771 | decl); |
822f06da | 3772 | } |
3773 | ||
70a658bd | 3774 | /* Enter this declaration into the symbol table. */ |
3775 | tem = maybe_push_decl (decl); | |
de9554eb | 3776 | |
3cc0b4b9 | 3777 | if (processing_template_decl) |
ce23987e | 3778 | tem = push_template_decl (tem); |
3cbf947d | 3779 | if (tem == error_mark_node) |
3780 | return error_mark_node; | |
e857e9c7 | 3781 | |
de9554eb | 3782 | #if ! defined (ASM_OUTPUT_BSS) && ! defined (ASM_OUTPUT_ALIGNED_BSS) |
ad91f3ed | 3783 | /* Tell the back-end to use or not use .common as appropriate. If we say |
4c4e55a3 | 3784 | -fconserve-space, we want this to save .data space, at the expense of |
3785 | wrong semantics. If we say -fno-conserve-space, we want this to | |
3786 | produce errors about redefs; to do this we force variables into the | |
3787 | data segment. */ | |
d6981147 | 3788 | DECL_COMMON (tem) = ((TREE_CODE (tem) != VAR_DECL |
3789 | || !DECL_THREAD_LOCAL (tem)) | |
2555ff80 | 3790 | && (flag_conserve_space || ! TREE_PUBLIC (tem))); |
de9554eb | 3791 | #endif |
980877d7 | 3792 | |
3cc0b4b9 | 3793 | if (! processing_template_decl) |
e857e9c7 | 3794 | start_decl_1 (tem); |
471086d6 | 3795 | |
471086d6 | 3796 | return tem; |
3797 | } | |
3798 | ||
e857e9c7 | 3799 | void |
1b72315d | 3800 | start_decl_1 (tree decl) |
471086d6 | 3801 | { |
e857e9c7 | 3802 | tree type = TREE_TYPE (decl); |
3803 | int initialized = (DECL_INITIAL (decl) != NULL_TREE); | |
471086d6 | 3804 | |
67b61957 | 3805 | if (type == error_mark_node) |
3806 | return; | |
3807 | ||
e857e9c7 | 3808 | if (initialized) |
3809 | /* Is it valid for this decl to have an initializer at all? | |
3810 | If not, set INITIALIZED to zero, which will indirectly | |
3811 | tell `cp_finish_decl' to ignore the initializer once it is parsed. */ | |
471086d6 | 3812 | { |
e857e9c7 | 3813 | /* Don't allow initializations for incomplete types except for |
3814 | arrays which might be completed by the initialization. */ | |
4b72716d | 3815 | if (COMPLETE_TYPE_P (complete_type (type))) |
e857e9c7 | 3816 | ; /* A complete type is ok. */ |
3817 | else if (TREE_CODE (type) != ARRAY_TYPE) | |
471086d6 | 3818 | { |
cf103c6c | 3819 | error ("variable `%#D' has initializer but incomplete type", |
e857e9c7 | 3820 | decl); |
3821 | initialized = 0; | |
3aa622aa | 3822 | type = TREE_TYPE (decl) = error_mark_node; |
e857e9c7 | 3823 | } |
4b72716d | 3824 | else if (!COMPLETE_TYPE_P (complete_type (TREE_TYPE (type)))) |
e857e9c7 | 3825 | { |
3826 | if (DECL_LANG_SPECIFIC (decl) && DECL_TEMPLATE_INFO (decl)) | |
cf103c6c | 3827 | error ("elements of array `%#D' have incomplete type", decl); |
e857e9c7 | 3828 | /* else we already gave an error in start_decl. */ |
3829 | initialized = 0; | |
471086d6 | 3830 | } |
471086d6 | 3831 | } |
3832 | ||
e857e9c7 | 3833 | if (!initialized |
3834 | && TREE_CODE (decl) != TYPE_DECL | |
3835 | && TREE_CODE (decl) != TEMPLATE_DECL | |
3d411d73 | 3836 | && type != error_mark_node |
3c3beda6 | 3837 | && IS_AGGR_TYPE (type) |
3d411d73 | 3838 | && ! DECL_EXTERNAL (decl)) |
471086d6 | 3839 | { |
3cc0b4b9 | 3840 | if ((! processing_template_decl || ! uses_template_parms (type)) |
4b72716d | 3841 | && !COMPLETE_TYPE_P (complete_type (type))) |
e857e9c7 | 3842 | { |
242fc35c | 3843 | error ("aggregate `%#D' has incomplete type and cannot be defined", |
e857e9c7 | 3844 | decl); |
3845 | /* Change the type so that assemble_variable will give | |
3846 | DECL an rtl we can live with: (mem (const_int 0)). */ | |
3aa622aa | 3847 | type = TREE_TYPE (decl) = error_mark_node; |
e857e9c7 | 3848 | } |
3849 | else | |
3850 | { | |
3851 | /* If any base type in the hierarchy of TYPE needs a constructor, | |
3852 | then we set initialized to 1. This way any nodes which are | |
3853 | created for the purposes of initializing this aggregate | |
3854 | will live as long as it does. This is necessary for global | |
3855 | aggregates which do not have their initializers processed until | |
3856 | the end of the file. */ | |
3857 | initialized = TYPE_NEEDS_CONSTRUCTING (type); | |
3858 | } | |
3859 | } | |
3860 | ||
e857e9c7 | 3861 | if (! initialized) |
3862 | DECL_INITIAL (decl) = NULL_TREE; | |
6f46e702 | 3863 | |
3864 | /* Create a new scope to hold this declaration if necessary. | |
3865 | Whether or not a new scope is necessary cannot be determined | |
3866 | until after the type has been completed; if the type is a | |
3867 | specialization of a class template it is not until after | |
3868 | instantiation has occurred that TYPE_HAS_NONTRIVIAL_DESTRUCTOR | |
3869 | will be set correctly. */ | |
3870 | maybe_push_cleanup_level (type); | |
e857e9c7 | 3871 | } |
3872 | ||
d7d79557 | 3873 | /* Handle initialization of references. DECL, TYPE, and INIT have the |
3874 | same meaning as in cp_finish_decl. *CLEANUP must be NULL on entry, | |
3875 | but will be set to a new CLEANUP_STMT if a temporary is created | |
63eff20d | 3876 | that must be destroyed subsequently. |
d7d79557 | 3877 | |
3878 | Returns an initializer expression to use to initialize DECL, or | |
3879 | NULL if the initialization can be performed statically. | |
96624a9e | 3880 | |
3881 | Quotes on semantics can be found in ARM 8.4.3. */ | |
3882 | ||
e6393a02 | 3883 | static tree |
d7d79557 | 3884 | grok_reference_init (tree decl, tree type, tree init, tree *cleanup) |
e857e9c7 | 3885 | { |
3886 | tree tmp; | |
3887 | ||
3888 | if (init == NULL_TREE) | |
3889 | { | |
3890 | if ((DECL_LANG_SPECIFIC (decl) == 0 | |
3891 | || DECL_IN_AGGR_P (decl) == 0) | |
3892 | && ! DECL_THIS_EXTERN (decl)) | |
cf103c6c | 3893 | error ("`%D' declared as reference but not initialized", decl); |
e6393a02 | 3894 | return NULL_TREE; |
e857e9c7 | 3895 | } |
3896 | ||
18a4cb16 | 3897 | if (TREE_CODE (init) == CONSTRUCTOR) |
e857e9c7 | 3898 | { |
cf103c6c | 3899 | error ("ISO C++ forbids use of initializer list to initialize reference `%D'", decl); |
e6393a02 | 3900 | return NULL_TREE; |
471086d6 | 3901 | } |
3902 | ||
3903 | if (TREE_CODE (init) == TREE_LIST) | |
8a4008da | 3904 | init = build_x_compound_expr_from_list (init, "initializer"); |
471086d6 | 3905 | |
1a3f833b | 3906 | if (TREE_CODE (TREE_TYPE (init)) == REFERENCE_TYPE) |
3907 | init = convert_from_reference (init); | |
3908 | ||
471086d6 | 3909 | if (TREE_CODE (TREE_TYPE (type)) != ARRAY_TYPE |
3910 | && TREE_CODE (TREE_TYPE (init)) == ARRAY_TYPE) | |
a681799d | 3911 | /* Note: default conversion is only called in very special cases. */ |
3912 | init = decay_conversion (init); | |
980877d7 | 3913 | |
2243fa67 | 3914 | /* Convert INIT to the reference type TYPE. This may involve the |
3915 | creation of a temporary, whose lifetime must be the same as that | |
3916 | of the reference. If so, a DECL_STMT for the temporary will be | |
3917 | added just after the DECL_STMT for DECL. That's why we don't set | |
3918 | DECL_INITIAL for local references (instead assigning to them | |
3919 | explicitly); we need to allow the temporary to be initialized | |
3920 | first. */ | |
d7d79557 | 3921 | tmp = initialize_reference (type, init, decl, cleanup); |
471086d6 | 3922 | |
ad91f3ed | 3923 | if (tmp == error_mark_node) |
e6393a02 | 3924 | return NULL_TREE; |
3925 | else if (tmp == NULL_TREE) | |
471086d6 | 3926 | { |
cf103c6c | 3927 | error ("cannot initialize `%T' from `%T'", type, TREE_TYPE (init)); |
e6393a02 | 3928 | return NULL_TREE; |
471086d6 | 3929 | } |
471086d6 | 3930 | |
e6393a02 | 3931 | if (TREE_STATIC (decl) && !TREE_CONSTANT (tmp)) |
3932 | return tmp; | |
3933 | ||
ca106ab1 | 3934 | DECL_INITIAL (decl) = tmp; |
e6393a02 | 3935 | |
3936 | return NULL_TREE; | |
471086d6 | 3937 | } |
3938 | ||
ece7bde7 | 3939 | /* When parsing `int a[] = {1, 2};' we don't know the size of the |
3940 | array until we finish parsing the initializer. If that's the | |
3941 | situation we're in, update DECL accordingly. */ | |
3942 | ||
3943 | static void | |
1b72315d | 3944 | maybe_deduce_size_from_array_init (tree decl, tree init) |
ece7bde7 | 3945 | { |
3946 | tree type = TREE_TYPE (decl); | |
3947 | ||
3948 | if (TREE_CODE (type) == ARRAY_TYPE | |
3949 | && TYPE_DOMAIN (type) == NULL_TREE | |
3950 | && TREE_CODE (decl) != TYPE_DECL) | |
3951 | { | |
cb4cc35f | 3952 | /* do_default is really a C-ism to deal with tentative definitions. |
3953 | But let's leave it here to ease the eventual merge. */ | |
3954 | int do_default = !DECL_EXTERNAL (decl); | |
ece7bde7 | 3955 | tree initializer = init ? init : DECL_INITIAL (decl); |
3956 | int failure = complete_array_type (type, initializer, do_default); | |
3957 | ||
3958 | if (failure == 1) | |
cf103c6c | 3959 | error ("initializer fails to determine size of `%D'", decl); |
ece7bde7 | 3960 | |
3961 | if (failure == 2) | |
3962 | { | |
3963 | if (do_default) | |
cf103c6c | 3964 | error ("array size missing in `%D'", decl); |
ece7bde7 | 3965 | /* If a `static' var's size isn't known, make it extern as |
3966 | well as static, so it does not get allocated. If it's not | |
3967 | `static', then don't mark it extern; finish_incomplete_decl | |
3968 | will give it a default size and it will get allocated. */ | |
3969 | else if (!pedantic && TREE_STATIC (decl) && !TREE_PUBLIC (decl)) | |
3970 | DECL_EXTERNAL (decl) = 1; | |
3971 | } | |
3972 | ||
3973 | if (pedantic && TYPE_DOMAIN (type) != NULL_TREE | |
3974 | && tree_int_cst_lt (TYPE_MAX_VALUE (TYPE_DOMAIN (type)), | |
3975 | integer_zero_node)) | |
cf103c6c | 3976 | error ("zero-size array `%D'", decl); |
ece7bde7 | 3977 | |
3978 | layout_decl (decl, 0); | |
3979 | } | |
3980 | } | |
3981 | ||
3982 | /* Set DECL_SIZE, DECL_ALIGN, etc. for DECL (a VAR_DECL), and issue | |
73b8a26b | 3983 | any appropriate error messages regarding the layout. */ |
ece7bde7 | 3984 | |
73b8a26b | 3985 | static void |
1b72315d | 3986 | layout_var_decl (tree decl) |
ece7bde7 | 3987 | { |
73b8a26b | 3988 | tree type = TREE_TYPE (decl); |
949d8cc7 | 3989 | #if 0 |
73b8a26b | 3990 | tree ttype = target_type (type); |
949d8cc7 | 3991 | #endif |
73b8a26b | 3992 | |
3993 | /* If we haven't already layed out this declaration, do so now. | |
3994 | Note that we must not call complete type for an external object | |
3995 | because it's type might involve templates that we are not | |
755edffd | 3996 | supposed to instantiate yet. (And it's perfectly valid to say |
73b8a26b | 3997 | `extern X x' for some incomplete type `X'.) */ |
3998 | if (!DECL_EXTERNAL (decl)) | |
3999 | complete_type (type); | |
15a7c339 | 4000 | if (!DECL_SIZE (decl) |
2c73aca0 | 4001 | && TREE_TYPE (decl) != error_mark_node |
15a7c339 | 4002 | && (COMPLETE_TYPE_P (type) |
4003 | || (TREE_CODE (type) == ARRAY_TYPE | |
4004 | && !TYPE_DOMAIN (type) | |
4005 | && COMPLETE_TYPE_P (TREE_TYPE (type))))) | |
ece7bde7 | 4006 | layout_decl (decl, 0); |
4007 | ||
9f9b1983 | 4008 | if (!DECL_EXTERNAL (decl) && DECL_SIZE (decl) == NULL_TREE) |
ece7bde7 | 4009 | { |
4010 | /* An automatic variable with an incomplete type: that is an error. | |
4011 | Don't talk about array types here, since we took care of that | |
4012 | message in grokdeclarator. */ | |
cf103c6c | 4013 | error ("storage size of `%D' isn't known", decl); |
ece7bde7 | 4014 | TREE_TYPE (decl) = error_mark_node; |
4015 | } | |
b3908271 | 4016 | #if 0 |
4017 | /* Keep this code around in case we later want to control debug info | |
4018 | based on whether a type is "used". (jason 1999-11-11) */ | |
4019 | ||
ece7bde7 | 4020 | else if (!DECL_EXTERNAL (decl) && IS_AGGR_TYPE (ttype)) |
4021 | /* Let debugger know it should output info for this type. */ | |
4022 | note_debug_info_needed (ttype); | |
4023 | ||
4024 | if (TREE_STATIC (decl) && DECL_CLASS_SCOPE_P (decl)) | |
4025 | note_debug_info_needed (DECL_CONTEXT (decl)); | |
b3908271 | 4026 | #endif |
ece7bde7 | 4027 | |
4028 | if ((DECL_EXTERNAL (decl) || TREE_STATIC (decl)) | |
4029 | && DECL_SIZE (decl) != NULL_TREE | |
4030 | && ! TREE_CONSTANT (DECL_SIZE (decl))) | |
4031 | { | |
4032 | if (TREE_CODE (DECL_SIZE (decl)) == INTEGER_CST) | |
4033 | constant_expression_warning (DECL_SIZE (decl)); | |
4034 | else | |
cf103c6c | 4035 | error ("storage size of `%D' isn't constant", decl); |
ece7bde7 | 4036 | } |
e6393a02 | 4037 | |
4038 | if (TREE_STATIC (decl) | |
4039 | && !DECL_ARTIFICIAL (decl) | |
4040 | && current_function_decl | |
4041 | && DECL_CONTEXT (decl) == current_function_decl) | |
4042 | push_local_name (decl); | |
ece7bde7 | 4043 | } |
4044 | ||
ece7bde7 | 4045 | /* If a local static variable is declared in an inline function, or if |
4046 | we have a weak definition, we must endeavor to create only one | |
4047 | instance of the variable at link-time. */ | |
4048 | ||
4049 | static void | |
1b72315d | 4050 | maybe_commonize_var (tree decl) |
ece7bde7 | 4051 | { |
4052 | /* Static data in a function with comdat linkage also has comdat | |
4053 | linkage. */ | |
4054 | if (TREE_STATIC (decl) | |
4055 | /* Don't mess with __FUNCTION__. */ | |
93d6541c | 4056 | && ! DECL_ARTIFICIAL (decl) |
20b8c6bf | 4057 | && DECL_FUNCTION_SCOPE_P (decl) |
4058 | /* Unfortunately, import_export_decl has not always been called | |
4059 | before the function is processed, so we cannot simply check | |
4060 | DECL_COMDAT. */ | |
a70c1164 | 4061 | && (DECL_COMDAT (DECL_CONTEXT (decl)) |
20b8c6bf | 4062 | || ((DECL_DECLARED_INLINE_P (DECL_CONTEXT (decl)) |
4063 | || DECL_TEMPLATE_INSTANTIATION (DECL_CONTEXT (decl))) | |
4064 | && TREE_PUBLIC (DECL_CONTEXT (decl))))) | |
ece7bde7 | 4065 | { |
de496319 | 4066 | if (flag_weak) |
ece7bde7 | 4067 | { |
de496319 | 4068 | /* With weak symbols, we simply make the variable COMDAT; |
4069 | that will cause copies in multiple translations units to | |
4070 | be merged. */ | |
4071 | comdat_linkage (decl); | |
4072 | } | |
4073 | else | |
4074 | { | |
4075 | if (DECL_INITIAL (decl) == NULL_TREE | |
4076 | || DECL_INITIAL (decl) == error_mark_node) | |
ece7bde7 | 4077 | { |
de496319 | 4078 | /* Without weak symbols, we can use COMMON to merge |
4079 | uninitialized variables. */ | |
ece7bde7 | 4080 | TREE_PUBLIC (decl) = 1; |
4081 | DECL_COMMON (decl) = 1; | |
4082 | } | |
de496319 | 4083 | else |
ece7bde7 | 4084 | { |
de496319 | 4085 | /* While for initialized variables, we must use internal |
4086 | linkage -- which means that multiple copies will not | |
4087 | be merged. */ | |
4088 | TREE_PUBLIC (decl) = 0; | |
4089 | DECL_COMMON (decl) = 0; | |
ece7bde7 | 4090 | cp_warning_at ("sorry: semantics of inline function static data `%#D' are wrong (you'll wind up with multiple copies)", decl); |
9bc3739f | 4091 | warning ("%J you can work around this by removing the initializer", |
4092 | decl); | |
ece7bde7 | 4093 | } |
4094 | } | |
4095 | } | |
4096 | else if (DECL_LANG_SPECIFIC (decl) && DECL_COMDAT (decl)) | |
4097 | /* Set it up again; we might have set DECL_INITIAL since the last | |
4098 | time. */ | |
4099 | comdat_linkage (decl); | |
4100 | } | |
4101 | ||
3e04bd45 | 4102 | /* Issue an error message if DECL is an uninitialized const variable. */ |
4103 | ||
4104 | static void | |
1b72315d | 4105 | check_for_uninitialized_const_var (tree decl) |
3e04bd45 | 4106 | { |
4107 | tree type = TREE_TYPE (decl); | |
4108 | ||
4109 | /* ``Unless explicitly declared extern, a const object does not have | |
4110 | external linkage and must be initialized. ($8.4; $12.1)'' ARM | |
4111 | 7.1.6 */ | |
4112 | if (TREE_CODE (decl) == VAR_DECL | |
4113 | && TREE_CODE (type) != REFERENCE_TYPE | |
4114 | && CP_TYPE_CONST_P (type) | |
4115 | && !TYPE_NEEDS_CONSTRUCTING (type) | |
4116 | && !DECL_INITIAL (decl)) | |
cf103c6c | 4117 | error ("uninitialized const `%D'", decl); |
3e04bd45 | 4118 | } |
4119 | ||
2437a99c | 4120 | /* FIELD is a FIELD_DECL or NULL. In the former case, the value |
4121 | returned is the next FIELD_DECL (possibly FIELD itself) that can be | |
4122 | initialized. If there are no more such fields, the return value | |
4123 | will be NULL. */ | |
4124 | ||
4125 | static tree | |
4126 | next_initializable_field (tree field) | |
4127 | { | |
4128 | while (field | |
4129 | && (TREE_CODE (field) != FIELD_DECL | |
4130 | || (DECL_C_BIT_FIELD (field) && !DECL_NAME (field)) | |
4131 | || DECL_ARTIFICIAL (field))) | |
4132 | field = TREE_CHAIN (field); | |
4133 | ||
4134 | return field; | |
4135 | } | |
4136 | ||
4137 | /* Undo the brace-elision allowed by [dcl.init.aggr] in a | |
4138 | brace-enclosed aggregate initializer. | |
4139 | ||
4140 | *INITP is one of a list of initializers describing a brace-enclosed | |
4141 | initializer for an entity of the indicated aggregate TYPE. It may | |
4142 | not presently match the shape of the TYPE; for example: | |
4143 | ||
4144 | struct S { int a; int b; }; | |
4145 | struct S a[] = { 1, 2, 3, 4 }; | |
4146 | ||
4147 | Here *INITP will point to TREE_LIST of four elements, rather than a | |
4148 | list of two elements, each itself a list of two elements. This | |
4149 | routine transforms INIT from the former form into the latter. The | |
4150 | revised initializer is returned. */ | |
4151 | ||
4152 | static tree | |
4153 | reshape_init (tree type, tree *initp) | |
4154 | { | |
4155 | tree inits; | |
4156 | tree old_init; | |
4157 | tree old_init_value; | |
4158 | tree new_init; | |
4159 | bool brace_enclosed_p; | |
4160 | ||
4161 | old_init = *initp; | |
4162 | old_init_value = (TREE_CODE (*initp) == TREE_LIST | |
4163 | ? TREE_VALUE (*initp) : old_init); | |
4164 | ||
2b4b4925 | 4165 | my_friendly_assert (old_init_value, 20030723); |
062e8fef | 4166 | |
2437a99c | 4167 | /* If the initializer is brace-enclosed, pull initializers from the |
4168 | enclosed elements. Advance past the brace-enclosed initializer | |
4169 | now. */ | |
5264d007 | 4170 | if (TREE_CODE (old_init_value) == CONSTRUCTOR |
e6517de8 | 4171 | && BRACE_ENCLOSED_INITIALIZER_P (old_init_value)) |
2437a99c | 4172 | { |
4173 | *initp = TREE_CHAIN (old_init); | |
4174 | TREE_CHAIN (old_init) = NULL_TREE; | |
4175 | inits = CONSTRUCTOR_ELTS (old_init_value); | |
4176 | initp = &inits; | |
4177 | brace_enclosed_p = true; | |
4178 | } | |
4179 | else | |
4180 | { | |
4181 | inits = NULL_TREE; | |
4182 | brace_enclosed_p = false; | |
4183 | } | |
4184 | ||
4185 | /* A non-aggregate type is always initialized with a single | |
4186 | initializer. */ | |
4187 | if (!CP_AGGREGATE_TYPE_P (type)) | |
4188 | { | |
4189 | *initp = TREE_CHAIN (old_init); | |
4190 | TREE_CHAIN (old_init) = NULL_TREE; | |
4191 | /* It is invalid to initialize a non-aggregate type with a | |
4192 | brace-enclosed initializer. */ | |
4193 | if (brace_enclosed_p) | |
4194 | { | |
4195 | error ("brace-enclosed initializer used to initialize `%T'", | |
4196 | type); | |
4197 | if (TREE_CODE (old_init) == TREE_LIST) | |
4198 | TREE_VALUE (old_init) = error_mark_node; | |
4199 | else | |
4200 | old_init = error_mark_node; | |
4201 | } | |
4202 | ||
4203 | return old_init; | |
4204 | } | |
4205 | ||
4206 | /* [dcl.init.aggr] | |
4207 | ||
4208 | All implicit type conversions (clause _conv_) are considered when | |
4209 | initializing the aggregate member with an initializer from an | |
4210 | initializer-list. If the initializer can initialize a member, | |
4211 | the member is initialized. Otherwise, if the member is itself a | |
4212 | non-empty subaggregate, brace elision is assumed and the | |
4213 | initializer is considered for the initialization of the first | |
4214 | member of the subaggregate. */ | |
5264d007 | 4215 | if (!brace_enclosed_p |
2437a99c | 4216 | && can_convert_arg (type, TREE_TYPE (old_init_value), old_init_value)) |
4217 | { | |
4218 | *initp = TREE_CHAIN (old_init); | |
4219 | TREE_CHAIN (old_init) = NULL_TREE; | |
4220 | return old_init; | |
4221 | } | |
4222 | ||
94302392 | 4223 | if (TREE_CODE (old_init_value) == STRING_CST |
2437a99c | 4224 | && TREE_CODE (type) == ARRAY_TYPE |
791f63f0 | 4225 | && char_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (type)))) |
2437a99c | 4226 | { |
4227 | /* [dcl.init.string] | |
4228 | ||
4229 | A char array (whether plain char, signed char, or unsigned char) | |
4230 | can be initialized by a string-literal (optionally enclosed in | |
4231 | braces); a wchar_t array can be initialized by a wide | |
4232 | string-literal (optionally enclosed in braces). */ | |
4233 | new_init = old_init; | |
4234 | /* Move past the initializer. */ | |
4235 | *initp = TREE_CHAIN (old_init); | |
4236 | TREE_CHAIN (old_init) = NULL_TREE; | |
4237 | } | |
4238 | else | |
4239 | { | |
4240 | /* Build a CONSTRUCTOR to hold the contents of the aggregate. */ | |
e6517de8 | 4241 | new_init = build_constructor (NULL_TREE, NULL_TREE); |
2437a99c | 4242 | |
4243 | if (CLASS_TYPE_P (type)) | |
4244 | { | |
4245 | tree field; | |
4246 | ||
4247 | field = next_initializable_field (TYPE_FIELDS (type)); | |
4248 | ||
4249 | if (!field) | |
4250 | { | |
4251 | /* [dcl.init.aggr] | |
4252 | ||
4253 | An initializer for an aggregate member that is an | |
4254 | empty class shall have the form of an empty | |
4255 | initializer-list {}. */ | |
4256 | if (!brace_enclosed_p) | |
a6143adf | 4257 | { |
4258 | error ("initializer for `%T' must be brace-enclosed", | |
4259 | type); | |
4260 | return error_mark_node; | |
4261 | } | |
2437a99c | 4262 | } |
4263 | else | |
4264 | { | |
4265 | /* Loop through the initializable fields, gathering | |
4266 | initializers. */ | |
35e7b3ed | 4267 | while (*initp) |
2437a99c | 4268 | { |
4269 | tree field_init; | |
4270 | ||
35e7b3ed | 4271 | /* Handle designated initializers, as an extension. */ |
4272 | if (TREE_PURPOSE (*initp)) | |
4273 | { | |
4274 | if (pedantic) | |
4275 | pedwarn ("ISO C++ does not allow designated initializers"); | |
4276 | field = lookup_field_1 (type, TREE_PURPOSE (*initp), | |
4277 | /*want_type=*/false); | |
4278 | if (!field || TREE_CODE (field) != FIELD_DECL) | |
4279 | error ("`%T' has no non-static data member named `%D'", | |
4280 | type, TREE_PURPOSE (*initp)); | |
4281 | } | |
4282 | if (!field) | |
4283 | break; | |
4284 | ||
2437a99c | 4285 | field_init = reshape_init (TREE_TYPE (field), initp); |
a6143adf | 4286 | if (field_init == error_mark_node) |
4287 | return error_mark_node; | |
2437a99c | 4288 | TREE_CHAIN (field_init) = CONSTRUCTOR_ELTS (new_init); |
4289 | CONSTRUCTOR_ELTS (new_init) = field_init; | |
4290 | /* [dcl.init.aggr] | |
4291 | ||
4292 | When a union is initialized with a brace-enclosed | |
4293 | initializer, the braces shall only contain an | |
4294 | initializer for the first member of the union. */ | |
4295 | if (TREE_CODE (type) == UNION_TYPE) | |
4296 | break; | |
2437a99c | 4297 | field = next_initializable_field (TREE_CHAIN (field)); |
4298 | } | |
4299 | } | |
4300 | } | |
e6517de8 | 4301 | else if (TREE_CODE (type) == ARRAY_TYPE |
4302 | || TREE_CODE (type) == VECTOR_TYPE) | |
2437a99c | 4303 | { |
4304 | tree index; | |
4305 | tree max_index; | |
4306 | ||
4307 | /* If the bound of the array is known, take no more initializers | |
4308 | than are allowed. */ | |
d76f7d08 | 4309 | max_index = NULL_TREE; |
4310 | if (TREE_CODE (type) == ARRAY_TYPE) | |
4311 | { | |
4312 | if (TYPE_DOMAIN (type)) | |
4313 | max_index = array_type_nelts (type); | |
4314 | } | |
4315 | else | |
4316 | { | |
4317 | /* For a vector, the representation type is a struct | |
4318 | containing a single member which is an array of the | |
4319 | appropriate size. */ | |
4320 | tree rtype = TYPE_DEBUG_REPRESENTATION_TYPE (type); | |
4321 | if (rtype && TYPE_DOMAIN (TREE_TYPE (TYPE_FIELDS (rtype)))) | |
4322 | max_index = array_type_nelts (TREE_TYPE (TYPE_FIELDS (rtype))); | |
4323 | } | |
4324 | ||
2437a99c | 4325 | /* Loop through the array elements, gathering initializers. */ |
4326 | for (index = size_zero_node; | |
4327 | *initp && (!max_index || !tree_int_cst_lt (max_index, index)); | |
4328 | index = size_binop (PLUS_EXPR, index, size_one_node)) | |
4329 | { | |
4330 | tree element_init; | |
4331 | ||
4332 | element_init = reshape_init (TREE_TYPE (type), initp); | |
a6143adf | 4333 | if (element_init == error_mark_node) |
4334 | return error_mark_node; | |
2437a99c | 4335 | TREE_CHAIN (element_init) = CONSTRUCTOR_ELTS (new_init); |
4336 | CONSTRUCTOR_ELTS (new_init) = element_init; | |
4337 | if (TREE_PURPOSE (element_init)) | |
3b67dbda | 4338 | { |
4339 | tree next_index = TREE_PURPOSE (element_init); | |
4340 | if (TREE_CODE (next_index) == IDENTIFIER_NODE) | |
4341 | { | |
4342 | error ("name `%D' used in a GNU-style designated " | |
4343 | "initializer for an array", next_index); | |
4344 | TREE_PURPOSE (element_init) = NULL_TREE; | |
4345 | } | |
4346 | else | |
4347 | index = next_index; | |
4348 | } | |
2437a99c | 4349 | } |
4350 | } | |
4351 | else | |
4352 | abort (); | |
4353 | ||
4354 | /* The initializers were placed in reverse order in the | |
4355 | CONSTRUCTOR. */ | |
4356 | CONSTRUCTOR_ELTS (new_init) = nreverse (CONSTRUCTOR_ELTS (new_init)); | |
4357 | ||
4358 | if (TREE_CODE (old_init) == TREE_LIST) | |
4359 | new_init = build_tree_list (TREE_PURPOSE (old_init), new_init); | |
4360 | } | |
4361 | ||
4362 | /* If this was a brace-enclosed initializer and all of the | |
4363 | initializers were not used up, there is a problem. */ | |
4364 | if (brace_enclosed_p && *initp) | |
4365 | error ("too many initializers for `%T'", type); | |
4366 | ||
4367 | return new_init; | |
4368 | } | |
4369 | ||
9f9b1983 | 4370 | /* Verify INIT (the initializer for DECL), and record the |
d7d79557 | 4371 | initialization in DECL_INITIAL, if appropriate. CLEANUP is as for |
4372 | grok_reference_init. | |
2437a99c | 4373 | |
4374 | If the return value is non-NULL, it is an expression that must be | |
4375 | evaluated dynamically to initialize DECL. */ | |
ece7bde7 | 4376 | |
9f9b1983 | 4377 | static tree |
d7d79557 | 4378 | check_initializer (tree decl, tree init, int flags, tree *cleanup) |
ece7bde7 | 4379 | { |
23ed74d8 | 4380 | tree type = TREE_TYPE (decl); |
3afe9b43 | 4381 | tree init_code = NULL; |
a35129cf | 4382 | |
ece7bde7 | 4383 | /* If `start_decl' didn't like having an initialization, ignore it now. */ |
4384 | if (init != NULL_TREE && DECL_INITIAL (decl) == NULL_TREE) | |
4385 | init = NULL_TREE; | |
ece7bde7 | 4386 | |
23ed74d8 | 4387 | /* If an initializer is present, DECL_INITIAL has been |
4388 | error_mark_node, to indicate that an as-of-yet unevaluated | |
4389 | initialization will occur. From now on, DECL_INITIAL reflects | |
4390 | the static initialization -- if any -- of DECL. */ | |
4391 | DECL_INITIAL (decl) = NULL_TREE; | |
4392 | ||
2c73aca0 | 4393 | /* Things that are going to be initialized need to have complete |
4394 | type. */ | |
4395 | TREE_TYPE (decl) = type = complete_type (TREE_TYPE (decl)); | |
9f9b1983 | 4396 | |
2c73aca0 | 4397 | if (type == error_mark_node) |
4398 | /* We will have already complained. */ | |
4399 | init = NULL_TREE; | |
4400 | else if (init && COMPLETE_TYPE_P (type) | |
4401 | && !TREE_CONSTANT (TYPE_SIZE (type))) | |
4402 | { | |
4403 | error ("variable-sized object `%D' may not be initialized", decl); | |
4404 | init = NULL_TREE; | |
4405 | } | |
4406 | else if (TREE_CODE (type) == ARRAY_TYPE | |
4407 | && !COMPLETE_TYPE_P (complete_type (TREE_TYPE (type)))) | |
4408 | { | |
4409 | error ("elements of array `%#D' have incomplete type", decl); | |
4410 | init = NULL_TREE; | |
4411 | } | |
4412 | else if (TREE_CODE (type) != ARRAY_TYPE && !COMPLETE_TYPE_P (type)) | |
4413 | { | |
4414 | error ("`%D' has incomplete type", decl); | |
4415 | TREE_TYPE (decl) = error_mark_node; | |
4416 | init = NULL_TREE; | |
ece7bde7 | 4417 | } |
4418 | ||
4419 | if (TREE_CODE (decl) == CONST_DECL) | |
4420 | { | |
4421 | my_friendly_assert (TREE_CODE (decl) != REFERENCE_TYPE, 148); | |
4422 | ||
4423 | DECL_INITIAL (decl) = init; | |
4424 | ||
ece7bde7 | 4425 | my_friendly_assert (init != NULL_TREE, 149); |
4426 | init = NULL_TREE; | |
4427 | } | |
9f9b1983 | 4428 | else if (!DECL_EXTERNAL (decl) && TREE_CODE (type) == REFERENCE_TYPE) |
d7d79557 | 4429 | init = grok_reference_init (decl, type, init, cleanup); |
ece7bde7 | 4430 | else if (init) |
4431 | { | |
e6517de8 | 4432 | if (TREE_CODE (init) == CONSTRUCTOR |
4433 | && BRACE_ENCLOSED_INITIALIZER_P (init)) | |
a9df464b | 4434 | { |
4435 | /* [dcl.init] paragraph 13, | |
4436 | If T is a scalar type, then a declaration of the form | |
4437 | T x = { a }; | |
4438 | is equivalent to | |
4439 | T x = a; | |
4440 | ||
4441 | reshape_init will complain about the extra braces, | |
4442 | and doesn't do anything useful in the case where TYPE is | |
4443 | scalar, so just don't call it. */ | |
4444 | if (CP_AGGREGATE_TYPE_P (type)) | |
4445 | init = reshape_init (type, &init); | |
b448d263 | 4446 | |
4447 | if ((*targetm.vector_opaque_p) (type)) | |
4448 | { | |
4449 | error ("opaque vector types cannot be initialized"); | |
4450 | init = error_mark_node; | |
4451 | } | |
a9df464b | 4452 | } |
2437a99c | 4453 | |
4454 | /* If DECL has an array type without a specific bound, deduce the | |
4455 | array size from the initializer. */ | |
4456 | maybe_deduce_size_from_array_init (decl, init); | |
4457 | type = TREE_TYPE (decl); | |
2437a99c | 4458 | |
ece7bde7 | 4459 | if (TYPE_HAS_CONSTRUCTOR (type) || TYPE_NEEDS_CONSTRUCTING (type)) |
4460 | { | |
4461 | if (TREE_CODE (type) == ARRAY_TYPE) | |
2437a99c | 4462 | goto initialize_aggr; |
ece7bde7 | 4463 | else if (TREE_CODE (init) == CONSTRUCTOR |
e6517de8 | 4464 | && BRACE_ENCLOSED_INITIALIZER_P (init)) |
ece7bde7 | 4465 | { |
4466 | if (TYPE_NON_AGGREGATE_CLASS (type)) | |
4467 | { | |
cf103c6c | 4468 | error ("`%D' must be initialized by constructor, not by `{...}'", |
2437a99c | 4469 | decl); |
ece7bde7 | 4470 | init = error_mark_node; |
4471 | } | |
4472 | else | |
4473 | goto dont_use_constructor; | |
4474 | } | |
2437a99c | 4475 | else |
4476 | { | |
4477 | int saved_stmts_are_full_exprs_p; | |
4478 | ||
4479 | initialize_aggr: | |
4480 | saved_stmts_are_full_exprs_p = 0; | |
4481 | if (building_stmt_tree ()) | |
4482 | { | |
4483 | saved_stmts_are_full_exprs_p = stmts_are_full_exprs_p (); | |
4484 | current_stmt_tree ()->stmts_are_full_exprs_p = 1; | |
4485 | } | |
4486 | init = build_aggr_init (decl, init, flags); | |
4487 | if (building_stmt_tree ()) | |
4488 | current_stmt_tree ()->stmts_are_full_exprs_p = | |
4489 | saved_stmts_are_full_exprs_p; | |
4490 | return init; | |
4491 | } | |
ece7bde7 | 4492 | } |
4493 | else | |
4494 | { | |
4495 | dont_use_constructor: | |
4496 | if (TREE_CODE (init) != TREE_VEC) | |
3afe9b43 | 4497 | { |
4498 | init_code = store_init_value (decl, init); | |
4499 | init = NULL; | |
4500 | } | |
ece7bde7 | 4501 | } |
ece7bde7 | 4502 | } |
4503 | else if (DECL_EXTERNAL (decl)) | |
4504 | ; | |
2437a99c | 4505 | else if (TYPE_P (type) && TYPE_NEEDS_CONSTRUCTING (type)) |
4506 | goto initialize_aggr; | |
4507 | else if (IS_AGGR_TYPE (type)) | |
ece7bde7 | 4508 | { |
4509 | tree core_type = strip_array_types (type); | |
4510 | ||
2437a99c | 4511 | if (CLASSTYPE_READONLY_FIELDS_NEED_INIT (core_type)) |
4512 | error ("structure `%D' with uninitialized const members", decl); | |
4513 | if (CLASSTYPE_REF_FIELDS_NEED_INIT (core_type)) | |
4514 | error ("structure `%D' with uninitialized reference members", | |
4515 | decl); | |
ece7bde7 | 4516 | |
4517 | check_for_uninitialized_const_var (decl); | |
ece7bde7 | 4518 | } |
4519 | else | |
4520 | check_for_uninitialized_const_var (decl); | |
980877d7 | 4521 | |
2437a99c | 4522 | if (init && init != error_mark_node) |
3afe9b43 | 4523 | init_code = build (INIT_EXPR, type, decl, init); |
2437a99c | 4524 | |
3afe9b43 | 4525 | return init_code; |
ece7bde7 | 4526 | } |
4527 | ||
4528 | /* If DECL is not a local variable, give it RTL. */ | |
4529 | ||
4530 | static void | |
1b72315d | 4531 | make_rtl_for_nonlocal_decl (tree decl, tree init, const char* asmspec) |
ece7bde7 | 4532 | { |
5ef286c9 | 4533 | int toplev = toplevel_bindings_p (); |
4534 | int defer_p; | |
ece7bde7 | 4535 | |
a8e8221e | 4536 | /* Handle non-variables up front. */ |
4537 | if (TREE_CODE (decl) != VAR_DECL) | |
4538 | { | |
4539 | rest_of_decl_compilation (decl, asmspec, toplev, at_eof); | |
4540 | return; | |
4541 | } | |
4542 | ||
5ef286c9 | 4543 | /* If we see a class member here, it should be a static data |
4544 | member. */ | |
4545 | if (DECL_LANG_SPECIFIC (decl) && DECL_IN_AGGR_P (decl)) | |
4546 | { | |
4547 | my_friendly_assert (TREE_STATIC (decl), 19990828); | |
4548 | /* An in-class declaration of a static data member should be | |
4549 | external; it is only a declaration, and not a definition. */ | |
4550 | if (init == NULL_TREE) | |
4551 | my_friendly_assert (DECL_EXTERNAL (decl), 20000723); | |
4552 | } | |
4553 | ||
a8e8221e | 4554 | /* Set the DECL_ASSEMBLER_NAME for the variable. */ |
4555 | if (asmspec) | |
384351aa | 4556 | { |
681a883f | 4557 | change_decl_assembler_name (decl, get_identifier (asmspec)); |
384351aa | 4558 | /* The `register' keyword, when used together with an |
4559 | asm-specification, indicates that the variable should be | |
4560 | placed in a particular register. */ | |
4561 | if (DECL_REGISTER (decl)) | |
4ee9c684 | 4562 | DECL_HARD_REGISTER (decl) = 1; |
384351aa | 4563 | } |
a8e8221e | 4564 | |
5ef286c9 | 4565 | /* We don't create any RTL for local variables. */ |
4566 | if (DECL_FUNCTION_SCOPE_P (decl) && !TREE_STATIC (decl)) | |
4567 | return; | |
ece7bde7 | 4568 | |
5ef286c9 | 4569 | /* We defer emission of local statics until the corresponding |
4570 | DECL_STMT is expanded. */ | |
4571 | defer_p = DECL_FUNCTION_SCOPE_P (decl) || DECL_VIRTUAL_P (decl); | |
4572 | ||
f626b489 | 4573 | /* We try to defer namespace-scope static constants so that they are |
4574 | not emitted into the object file unnecessarily. */ | |
4575 | if (!DECL_VIRTUAL_P (decl) | |
4576 | && TREE_READONLY (decl) | |
4577 | && DECL_INITIAL (decl) != NULL_TREE | |
4578 | && DECL_INITIAL (decl) != error_mark_node | |
4579 | && ! EMPTY_CONSTRUCTOR_P (DECL_INITIAL (decl)) | |
4580 | && toplev | |
4581 | && !TREE_PUBLIC (decl)) | |
c4c3877b | 4582 | { |
4583 | /* Fool with the linkage of static consts according to #pragma | |
4584 | interface. */ | |
4585 | if (!interface_unknown && !TREE_PUBLIC (decl)) | |
ece7bde7 | 4586 | { |
5ef286c9 | 4587 | TREE_PUBLIC (decl) = 1; |
4588 | DECL_EXTERNAL (decl) = interface_only; | |
ece7bde7 | 4589 | } |
ece7bde7 | 4590 | |
5ef286c9 | 4591 | defer_p = 1; |
ece7bde7 | 4592 | } |
f626b489 | 4593 | /* Likewise for template instantiations. */ |
4594 | else if (DECL_COMDAT (decl)) | |
4595 | defer_p = 1; | |
5ef286c9 | 4596 | |
7e64c604 | 4597 | /* If we're deferring the variable, we only need to make RTL if |
4598 | there's an ASMSPEC. Otherwise, we'll lazily create it later when | |
4599 | we need it. (There's no way to lazily create RTL for things that | |
4600 | have assembly specs because the information about the specifier | |
4601 | isn't stored in the tree, yet) */ | |
4602 | if (defer_p && asmspec) | |
125c7a9d | 4603 | make_decl_rtl (decl, asmspec); |
5ef286c9 | 4604 | /* If we're not deferring, go ahead and assemble the variable. */ |
7e64c604 | 4605 | else if (!defer_p) |
ece7bde7 | 4606 | rest_of_decl_compilation (decl, asmspec, toplev, at_eof); |
ece7bde7 | 4607 | } |
4608 | ||
18a4cb16 | 4609 | /* Generate code to initialize DECL (a local variable). */ |
ece7bde7 | 4610 | |
2437a99c | 4611 | static void |
1b72315d | 4612 | initialize_local_var (tree decl, tree init) |
ece7bde7 | 4613 | { |
43295e27 | 4614 | tree type = TREE_TYPE (decl); |
ce0c3b07 | 4615 | tree cleanup; |
ece7bde7 | 4616 | |
2437a99c | 4617 | my_friendly_assert (TREE_CODE (decl) == VAR_DECL |
4618 | || TREE_CODE (decl) == RESULT_DECL, | |
4619 | 20021010); | |
4620 | my_friendly_assert (!TREE_STATIC (decl), 20021010); | |
ba3a3d1f | 4621 | |
2437a99c | 4622 | if (DECL_SIZE (decl) == NULL_TREE) |
ba3a3d1f | 4623 | { |
4624 | /* If we used it already as memory, it must stay in memory. */ | |
4625 | DECL_INITIAL (decl) = NULL_TREE; | |
4626 | TREE_ADDRESSABLE (decl) = TREE_USED (decl); | |
4627 | } | |
4628 | ||
ece7bde7 | 4629 | if (DECL_SIZE (decl) && type != error_mark_node) |
4630 | { | |
4631 | int already_used; | |
980877d7 | 4632 | |
ece7bde7 | 4633 | /* Compute and store the initial value. */ |
ece7bde7 | 4634 | already_used = TREE_USED (decl) || TREE_USED (type); |
4635 | ||
2437a99c | 4636 | /* Perform the initialization. */ |
4637 | if (init) | |
ece7bde7 | 4638 | { |
2243fa67 | 4639 | int saved_stmts_are_full_exprs_p; |
4640 | ||
f098ee0c | 4641 | my_friendly_assert (building_stmt_tree (), 20000906); |
5c3247a9 | 4642 | saved_stmts_are_full_exprs_p = stmts_are_full_exprs_p (); |
a08e60ae | 4643 | current_stmt_tree ()->stmts_are_full_exprs_p = 1; |
2437a99c | 4644 | finish_expr_stmt (init); |
3c3beda6 | 4645 | current_stmt_tree ()->stmts_are_full_exprs_p = |
a08e60ae | 4646 | saved_stmts_are_full_exprs_p; |
ece7bde7 | 4647 | } |
4648 | ||
4649 | /* Set this to 0 so we can tell whether an aggregate which was | |
4650 | initialized was ever used. Don't do this if it has a | |
4651 | destructor, so we don't complain about the 'resource | |
ba3a3d1f | 4652 | allocation is initialization' idiom. Now set |
4653 | attribute((unused)) on types so decls of that type will be | |
4654 | marked used. (see TREE_USED, above.) */ | |
ece7bde7 | 4655 | if (TYPE_NEEDS_CONSTRUCTING (type) |
4656 | && ! already_used | |
89e923d8 | 4657 | && TYPE_HAS_TRIVIAL_DESTRUCTOR (type) |
ece7bde7 | 4658 | && DECL_NAME (decl)) |
4659 | TREE_USED (decl) = 0; | |
ba3a3d1f | 4660 | else if (already_used) |
ece7bde7 | 4661 | TREE_USED (decl) = 1; |
4662 | } | |
2243fa67 | 4663 | |
2437a99c | 4664 | /* Generate a cleanup, if necessary. */ |
ce0c3b07 | 4665 | cleanup = cxx_maybe_build_cleanup (decl); |
4666 | if (DECL_SIZE (decl) && cleanup) | |
4667 | finish_decl_cleanup (decl, cleanup); | |
2243fa67 | 4668 | } |
4669 | ||
471086d6 | 4670 | /* Finish processing of a declaration; |
4671 | install its line number and initial value. | |
4672 | If the length of an array type is not known before, | |
4673 | it must be determined now, from the initial value, or it is an error. | |
4674 | ||
0f497990 | 4675 | INIT holds the value of an initializer that should be allowed to escape |
471086d6 | 4676 | the normal rules. |
4677 | ||
8823d708 | 4678 | FLAGS is LOOKUP_ONLYCONVERTING if the = init syntax was used, else 0 |
991ab8f3 | 4679 | if the (init) syntax was used. */ |
471086d6 | 4680 | |
4681 | void | |
1b72315d | 4682 | cp_finish_decl (tree decl, tree init, tree asmspec_tree, int flags) |
471086d6 | 4683 | { |
d7d79557 | 4684 | tree type; |
ece7bde7 | 4685 | tree ttype = NULL_TREE; |
d7d79557 | 4686 | tree cleanup; |
023b3db6 | 4687 | const char *asmspec = NULL; |
471086d6 | 4688 | int was_readonly = 0; |
4689 | ||
f3959165 | 4690 | if (decl == error_mark_node) |
4691 | return; | |
4692 | else if (! decl) | |
471086d6 | 4693 | { |
4694 | if (init) | |
905d4035 | 4695 | error ("assignment (not initialization) in declaration"); |
471086d6 | 4696 | return; |
4697 | } | |
4698 | ||
ce0c3b07 | 4699 | my_friendly_assert (TREE_CODE (decl) != RESULT_DECL, 20030619); |
4700 | ||
d7d79557 | 4701 | /* Assume no cleanup is required. */ |
4702 | cleanup = NULL_TREE; | |
4703 | ||
d81e00a4 | 4704 | /* If a name was specified, get the string. */ |
ddeeea02 | 4705 | if (global_scope_p (current_binding_level)) |
ea42c4de | 4706 | asmspec_tree = maybe_apply_renaming_pragma (decl, asmspec_tree); |
6c666cd5 | 4707 | if (asmspec_tree) |
c4c3877b | 4708 | asmspec = TREE_STRING_POINTER (asmspec_tree); |
471086d6 | 4709 | |
8417823c | 4710 | if (init && TREE_CODE (init) == NAMESPACE_DECL) |
4711 | { | |
cf103c6c | 4712 | error ("cannot initialize `%D' to namespace `%D'", |
8417823c | 4713 | decl, init); |
4714 | init = NULL_TREE; | |
4715 | } | |
4716 | ||
df5066e2 | 4717 | if (current_class_type |
9ba4048d | 4718 | && CP_DECL_CONTEXT (decl) == current_class_type |
df5066e2 | 4719 | && TYPE_BEING_DEFINED (current_class_type) |
4720 | && (DECL_INITIAL (decl) || init)) | |
c792eccc | 4721 | DECL_INITIALIZED_IN_CLASS_P (decl) = 1; |
df5066e2 | 4722 | |
980877d7 | 4723 | if (TREE_CODE (decl) == VAR_DECL |
6f186963 | 4724 | && DECL_CONTEXT (decl) |
4725 | && TREE_CODE (DECL_CONTEXT (decl)) == NAMESPACE_DECL | |
4726 | && DECL_CONTEXT (decl) != current_namespace | |
4727 | && init) | |
4728 | { | |
a109dc3b | 4729 | /* Leave the namespace of the object. */ |
6f186963 | 4730 | pop_decl_namespace (); |
4731 | } | |
4732 | ||
9f9b1983 | 4733 | type = TREE_TYPE (decl); |
471086d6 | 4734 | |
c38086bd | 4735 | if (type == error_mark_node) |
9ef989d8 | 4736 | goto finish_end0; |
3c3beda6 | 4737 | |
6f9b1420 | 4738 | if (TYPE_HAS_MUTABLE_P (type)) |
4739 | TREE_READONLY (decl) = 0; | |
2243fa67 | 4740 | |
3cc0b4b9 | 4741 | if (processing_template_decl) |
e857e9c7 | 4742 | { |
ca106ab1 | 4743 | /* Add this declaration to the statement-tree. */ |
ce0c3b07 | 4744 | if (at_function_scope_p ()) |
ca106ab1 | 4745 | add_decl_stmt (decl); |
4746 | ||
e857e9c7 | 4747 | if (init && DECL_INITIAL (decl)) |
f8b2b358 | 4748 | DECL_INITIAL (decl) = init; |
e6d8a6d5 | 4749 | if (TREE_CODE (decl) == VAR_DECL |
4750 | && !DECL_PRETTY_FUNCTION_P (decl) | |
4751 | && !dependent_type_p (TREE_TYPE (decl))) | |
4752 | maybe_deduce_size_from_array_init (decl, init); | |
e857e9c7 | 4753 | goto finish_end0; |
4754 | } | |
4a7414ab | 4755 | |
ece7bde7 | 4756 | /* Parameters are handled by store_parm_decls, not cp_finish_decl. */ |
4757 | my_friendly_assert (TREE_CODE (decl) != PARM_DECL, 19990828); | |
4758 | ||
471086d6 | 4759 | /* Take care of TYPE_DECLs up front. */ |
4760 | if (TREE_CODE (decl) == TYPE_DECL) | |
4761 | { | |
ddb9bca7 | 4762 | if (type != error_mark_node |
4763 | && IS_AGGR_TYPE (type) && DECL_NAME (decl)) | |
471086d6 | 4764 | { |
4765 | if (TREE_TYPE (DECL_NAME (decl)) && TREE_TYPE (decl) != type) | |
cf103c6c | 4766 | warning ("shadowing previous type declaration of `%#D'", decl); |
b7d1e8ea | 4767 | set_identifier_type_value (DECL_NAME (decl), decl); |
471086d6 | 4768 | } |
fff5e605 | 4769 | |
4770 | /* If we have installed this as the canonical typedef for this | |
4771 | type, and that type has not been defined yet, delay emitting | |
ad87de1e | 4772 | the debug information for it, as we will emit it later. */ |
b0df6589 | 4773 | if (TYPE_MAIN_DECL (TREE_TYPE (decl)) == decl |
4b72716d | 4774 | && !COMPLETE_TYPE_P (TREE_TYPE (decl))) |
fff5e605 | 4775 | TYPE_DECL_SUPPRESS_DEBUG (decl) = 1; |
4776 | ||
4d698345 | 4777 | rest_of_decl_compilation (decl, NULL, |
e857e9c7 | 4778 | DECL_CONTEXT (decl) == NULL_TREE, at_eof); |
471086d6 | 4779 | goto finish_end; |
4780 | } | |
4a7414ab | 4781 | |
471086d6 | 4782 | if (TREE_CODE (decl) != FUNCTION_DECL) |
4a7414ab | 4783 | ttype = target_type (type); |
471086d6 | 4784 | |
09742c66 | 4785 | |
4786 | /* Currently, GNU C++ puts constants in text space, making them | |
4787 | impossible to initialize. In the future, one would hope for | |
4788 | an operating system which understood the difference between | |
4789 | initialization and the running of a program. */ | |
4790 | if (! DECL_EXTERNAL (decl) && TREE_READONLY (decl)) | |
471086d6 | 4791 | { |
471086d6 | 4792 | was_readonly = 1; |
09742c66 | 4793 | if (TYPE_NEEDS_CONSTRUCTING (type) |
4794 | || TREE_CODE (type) == REFERENCE_TYPE) | |
4795 | TREE_READONLY (decl) = 0; | |
471086d6 | 4796 | } |
4797 | ||
6c666cd5 | 4798 | if (TREE_CODE (decl) == VAR_DECL) |
23ed74d8 | 4799 | { |
4800 | /* Only PODs can have thread-local storage. Other types may require | |
4801 | various kinds of non-trivial initialization. */ | |
4802 | if (DECL_THREAD_LOCAL (decl) && !pod_type_p (TREE_TYPE (decl))) | |
4803 | error ("`%D' cannot be thread-local because it has non-POD type `%T'", | |
4804 | decl, TREE_TYPE (decl)); | |
4805 | /* Convert the initializer to the type of DECL, if we have not | |
4806 | already initialized DECL. */ | |
4807 | if (!DECL_INITIALIZED_P (decl) | |
4808 | /* If !DECL_EXTERNAL then DECL is being defined. In the | |
2437a99c | 4809 | case of a static data member initialized inside the |
23ed74d8 | 4810 | class-specifier, there can be an initializer even if DECL |
4811 | is *not* defined. */ | |
4812 | && (!DECL_EXTERNAL (decl) || init)) | |
4813 | { | |
d7d79557 | 4814 | init = check_initializer (decl, init, flags, &cleanup); |
77b5d754 | 4815 | /* Thread-local storage cannot be dynamically initialized. */ |
4816 | if (DECL_THREAD_LOCAL (decl) && init) | |
4817 | { | |
4818 | error ("`%D' is thread-local and so cannot be dynamically " | |
4819 | "initialized", decl); | |
4820 | init = NULL_TREE; | |
4821 | } | |
23ed74d8 | 4822 | /* Handle: |
4823 | ||
4824 | [dcl.init] | |
4825 | ||
4826 | The memory occupied by any object of static storage | |
4827 | duration is zero-initialized at program startup before | |
4828 | any other initialization takes place. | |
4829 | ||
4830 | We cannot create an appropriate initializer until after | |
4831 | the type of DECL is finalized. If DECL_INITIAL is set, | |
4832 | then the DECL is statically initialized, and any | |
4833 | necessary zero-initialization has already been performed. */ | |
4834 | if (TREE_STATIC (decl) && !DECL_INITIAL (decl)) | |
4835 | DECL_INITIAL (decl) = build_zero_init (TREE_TYPE (decl), | |
5d3c3f21 | 4836 | /*nelts=*/NULL_TREE, |
23ed74d8 | 4837 | /*static_storage_p=*/true); |
4838 | /* Remember that the initialization for this variable has | |
4839 | taken place. */ | |
4840 | DECL_INITIALIZED_P (decl) = 1; | |
4841 | } | |
db2d58f1 | 4842 | /* If the variable has an array type, lay out the type, even if |
4843 | there is no initializer. It is valid to index through the | |
4844 | array, and we must get TYPE_ALIGN set correctly on the array | |
4845 | type. */ | |
4846 | else if (TREE_CODE (type) == ARRAY_TYPE) | |
4847 | layout_type (type); | |
23ed74d8 | 4848 | } |
4a7414ab | 4849 | |
ddb449aa | 4850 | /* Add this declaration to the statement-tree. This needs to happen |
4851 | after the call to check_initializer so that the DECL_STMT for a | |
4852 | reference temp is added before the DECL_STMT for the reference itself. */ | |
ce0c3b07 | 4853 | if (at_function_scope_p ()) |
ca106ab1 | 4854 | add_decl_stmt (decl); |
4855 | ||
471086d6 | 4856 | if (TREE_CODE (decl) == VAR_DECL) |
73b8a26b | 4857 | layout_var_decl (decl); |
471086d6 | 4858 | |
4859 | /* Output the assembler code and/or RTL code for variables and functions, | |
4860 | unless the type is an undefined structure or union. | |
4861 | If not, it will get done when the type is completed. */ | |
ce0c3b07 | 4862 | if (TREE_CODE (decl) == VAR_DECL || TREE_CODE (decl) == FUNCTION_DECL) |
471086d6 | 4863 | { |
ece7bde7 | 4864 | if (TREE_CODE (decl) == VAR_DECL) |
4865 | maybe_commonize_var (decl); | |
471086d6 | 4866 | |
ece7bde7 | 4867 | make_rtl_for_nonlocal_decl (decl, init, asmspec); |
471086d6 | 4868 | |
980877d7 | 4869 | if (TREE_CODE (type) == FUNCTION_TYPE |
ece7bde7 | 4870 | || TREE_CODE (type) == METHOD_TYPE) |
980877d7 | 4871 | abstract_virtuals_error (decl, |
ece7bde7 | 4872 | strip_array_types (TREE_TYPE (type))); |
71817734 | 4873 | else if (POINTER_TYPE_P (type) || TREE_CODE (type) == ARRAY_TYPE) |
4874 | { | |
4875 | /* If it's either a pointer or an array type, strip through all | |
4876 | of them but the last one. If the last is an array type, issue | |
4877 | an error if the element type is abstract. */ | |
4878 | while (POINTER_TYPE_P (TREE_TYPE (type)) | |
4879 | || TREE_CODE (TREE_TYPE (type)) == ARRAY_TYPE) | |
4880 | type = TREE_TYPE (type); | |
4881 | if (TREE_CODE (type) == ARRAY_TYPE) | |
4882 | abstract_virtuals_error (decl, TREE_TYPE (type)); | |
4883 | } | |
980877d7 | 4884 | else |
71817734 | 4885 | abstract_virtuals_error (decl, type); |
471086d6 | 4886 | |
2437a99c | 4887 | if (TREE_CODE (decl) == FUNCTION_DECL |
4888 | || TREE_TYPE (decl) == error_mark_node) | |
4889 | /* No initialization required. */ | |
bb09dca5 | 4890 | ; |
bf1b65b4 | 4891 | else if (DECL_EXTERNAL (decl) |
4892 | && ! (DECL_LANG_SPECIFIC (decl) | |
4893 | && DECL_NOT_REALLY_EXTERN (decl))) | |
e857e9c7 | 4894 | { |
4895 | if (init) | |
4896 | DECL_INITIAL (decl) = init; | |
4897 | } | |
2437a99c | 4898 | else |
471086d6 | 4899 | { |
2437a99c | 4900 | /* A variable definition. */ |
4901 | if (DECL_FUNCTION_SCOPE_P (decl)) | |
2243fa67 | 4902 | { |
2437a99c | 4903 | /* This is a local declaration. */ |
37b9a732 | 4904 | maybe_inject_for_scope_var (decl); |
2437a99c | 4905 | /* Initialize the local variable. */ |
4906 | if (processing_template_decl) | |
4907 | { | |
4908 | if (init || DECL_INITIAL (decl) == error_mark_node) | |
4909 | DECL_INITIAL (decl) = init; | |
4910 | } | |
4911 | else if (!TREE_STATIC (decl)) | |
4912 | initialize_local_var (decl, init); | |
2243fa67 | 4913 | } |
2437a99c | 4914 | |
4915 | if (TREE_STATIC (decl)) | |
43295e27 | 4916 | expand_static_init (decl, init); |
4917 | } | |
471086d6 | 4918 | finish_end0: |
4919 | ||
4920 | /* Undo call to `pushclass' that was done in `start_decl' | |
4921 | due to initialization of qualified member variable. | |
4922 | I.e., Foo::x = 10; */ | |
4923 | { | |
9ba4048d | 4924 | tree context = CP_DECL_CONTEXT (decl); |
471086d6 | 4925 | if (context |
9308e976 | 4926 | && TYPE_P (context) |
471086d6 | 4927 | && (TREE_CODE (decl) == VAR_DECL |
4928 | /* We also have a pushclass done that we need to undo here | |
4929 | if we're at top level and declare a method. */ | |
e857e9c7 | 4930 | || TREE_CODE (decl) == FUNCTION_DECL) |
4931 | /* If size hasn't been set, we're still defining it, | |
4932 | and therefore inside the class body; don't pop | |
4933 | the binding level.. */ | |
4b72716d | 4934 | && COMPLETE_TYPE_P (context) |
e857e9c7 | 4935 | && context == current_class_type) |
b2b68b19 | 4936 | pop_nested_class (); |
471086d6 | 4937 | } |
4938 | } | |
4939 | ||
d7d79557 | 4940 | /* If a CLEANUP_STMT was created to destroy a temporary bound to a |
4941 | reference, insert it in the statement-tree now. */ | |
4942 | if (cleanup) | |
2363ef00 | 4943 | push_cleanup (decl, cleanup, false); |
d7d79557 | 4944 | |
471086d6 | 4945 | finish_end: |
4946 | ||
471086d6 | 4947 | if (was_readonly) |
4948 | TREE_READONLY (decl) = 1; | |
40109983 | 4949 | |
4950 | /* If this was marked 'used', be sure it will be output. */ | |
4951 | if (lookup_attribute ("used", DECL_ATTRIBUTES (decl))) | |
4490a821 | 4952 | mark_decl_referenced (decl); |
471086d6 | 4953 | } |
4954 | ||
331bc0ad | 4955 | /* This is here for a midend callback from c-common.c. */ |
96624a9e | 4956 | |
e4118769 | 4957 | void |
1b72315d | 4958 | finish_decl (tree decl, tree init, tree asmspec_tree) |
e4118769 | 4959 | { |
ce23987e | 4960 | cp_finish_decl (decl, init, asmspec_tree, 0); |
e4118769 | 4961 | } |
4962 | ||
1da45f21 | 4963 | /* Returns a declaration for a VAR_DECL as if: |
4964 | ||
4965 | extern "C" TYPE NAME; | |
4966 | ||
4967 | had been seen. Used to create compiler-generated global | |
4968 | variables. */ | |
4969 | ||
4970 | tree | |
1b72315d | 4971 | declare_global_var (tree name, tree type) |
1da45f21 | 4972 | { |
4973 | tree decl; | |
4974 | ||
4975 | push_to_top_level (); | |
4976 | decl = build_decl (VAR_DECL, name, type); | |
4977 | TREE_PUBLIC (decl) = 1; | |
4978 | DECL_EXTERNAL (decl) = 1; | |
4979 | DECL_ARTIFICIAL (decl) = 1; | |
4980 | pushdecl (decl); | |
4981 | cp_finish_decl (decl, NULL_TREE, NULL_TREE, 0); | |
4982 | pop_from_top_level (); | |
4983 | ||
4984 | return decl; | |
4985 | } | |
4986 | ||
4987 | /* Returns a pointer to the `atexit' function. Note that if | |
3160db1d | 4988 | FLAG_USE_CXA_ATEXIT is nonzero, then this will actually be the new |
1da45f21 | 4989 | `__cxa_atexit' function specified in the IA64 C++ ABI. */ |
4990 | ||
4991 | static tree | |
1b72315d | 4992 | get_atexit_node (void) |
1da45f21 | 4993 | { |
4994 | tree atexit_fndecl; | |
4995 | tree arg_types; | |
4996 | tree fn_type; | |
4997 | tree fn_ptr_type; | |
4998 | const char *name; | |
4999 | ||
5000 | if (atexit_node) | |
5001 | return atexit_node; | |
5002 | ||
5003 | if (flag_use_cxa_atexit) | |
5004 | { | |
5005 | /* The declaration for `__cxa_atexit' is: | |
5006 | ||
5007 | int __cxa_atexit (void (*)(void *), void *, void *) | |
5008 | ||
5009 | We build up the argument types and then then function type | |
5010 | itself. */ | |
980877d7 | 5011 | |
1da45f21 | 5012 | /* First, build the pointer-to-function type for the first |
5013 | argument. */ | |
5014 | arg_types = tree_cons (NULL_TREE, ptr_type_node, void_list_node); | |
5015 | fn_type = build_function_type (void_type_node, arg_types); | |
5016 | fn_ptr_type = build_pointer_type (fn_type); | |
5017 | /* Then, build the rest of the argument types. */ | |
5018 | arg_types = tree_cons (NULL_TREE, ptr_type_node, void_list_node); | |
5019 | arg_types = tree_cons (NULL_TREE, ptr_type_node, arg_types); | |
5020 | arg_types = tree_cons (NULL_TREE, fn_ptr_type, arg_types); | |
5021 | /* And the final __cxa_atexit type. */ | |
5022 | fn_type = build_function_type (integer_type_node, arg_types); | |
5023 | fn_ptr_type = build_pointer_type (fn_type); | |
5024 | name = "__cxa_atexit"; | |
5025 | } | |
5026 | else | |
5027 | { | |
5028 | /* The declaration for `atexit' is: | |
980877d7 | 5029 | |
1da45f21 | 5030 | int atexit (void (*)()); |
5031 | ||
5032 | We build up the argument types and then then function type | |
5033 | itself. */ | |
5034 | fn_type = build_function_type (void_type_node, void_list_node); | |
5035 | fn_ptr_type = build_pointer_type (fn_type); | |
5036 | arg_types = tree_cons (NULL_TREE, fn_ptr_type, void_list_node); | |
5037 | /* Build the final atexit type. */ | |
5038 | fn_type = build_function_type (integer_type_node, arg_types); | |
5039 | name = "atexit"; | |
5040 | } | |
5041 | ||
5042 | /* Now, build the function declaration. */ | |
5043 | push_lang_context (lang_name_c); | |
d267eaf5 | 5044 | atexit_fndecl = build_library_fn_ptr (name, fn_type); |
1da45f21 | 5045 | mark_used (atexit_fndecl); |
5046 | pop_lang_context (); | |
a681799d | 5047 | atexit_node = decay_conversion (atexit_fndecl); |
1da45f21 | 5048 | |
5049 | return atexit_node; | |
5050 | } | |
5051 | ||
5052 | /* Returns the __dso_handle VAR_DECL. */ | |
5053 | ||
5054 | static tree | |
1b72315d | 5055 | get_dso_handle_node (void) |
1da45f21 | 5056 | { |
5057 | if (dso_handle_node) | |
5058 | return dso_handle_node; | |
5059 | ||
5060 | /* Declare the variable. */ | |
5061 | dso_handle_node = declare_global_var (get_identifier ("__dso_handle"), | |
5062 | ptr_type_node); | |
5063 | ||
5064 | return dso_handle_node; | |
5065 | } | |
5066 | ||
5067 | /* Begin a new function with internal linkage whose job will be simply | |
5068 | to destroy some particular variable. */ | |
5069 | ||
4c1de685 | 5070 | static GTY(()) int start_cleanup_cnt; |
5071 | ||
1da45f21 | 5072 | static tree |
1b72315d | 5073 | start_cleanup_fn (void) |
1da45f21 | 5074 | { |
936a2e99 | 5075 | int old_interface_only = interface_only; |
1da45f21 | 5076 | int old_interface_unknown = interface_unknown; |
5077 | char name[32]; | |
5078 | tree parmtypes; | |
5079 | tree fntype; | |
5080 | tree fndecl; | |
5081 | ||
5082 | push_to_top_level (); | |
5083 | ||
5084 | /* No need to mangle this. */ | |
5085 | push_lang_context (lang_name_c); | |
5086 | ||
936a2e99 | 5087 | interface_only = 0; |
1da45f21 | 5088 | interface_unknown = 1; |
5089 | ||
5090 | /* Build the parameter-types. */ | |
5091 | parmtypes = void_list_node; | |
5092 | /* Functions passed to __cxa_atexit take an additional parameter. | |
5093 | We'll just ignore it. After we implement the new calling | |
5094 | convention for destructors, we can eliminate the use of | |
5095 | additional cleanup functions entirely in the -fnew-abi case. */ | |
5096 | if (flag_use_cxa_atexit) | |
5097 | parmtypes = tree_cons (NULL_TREE, ptr_type_node, parmtypes); | |
5098 | /* Build the function type itself. */ | |
5099 | fntype = build_function_type (void_type_node, parmtypes); | |
5100 | /* Build the name of the function. */ | |
4c1de685 | 5101 | sprintf (name, "__tcf_%d", start_cleanup_cnt++); |
1da45f21 | 5102 | /* Build the function declaration. */ |
5103 | fndecl = build_lang_decl (FUNCTION_DECL, get_identifier (name), fntype); | |
5104 | /* It's a function with internal linkage, generated by the | |
5105 | compiler. */ | |
5106 | TREE_PUBLIC (fndecl) = 0; | |
5107 | DECL_ARTIFICIAL (fndecl) = 1; | |
52b5ec4c | 5108 | /* Make the function `inline' so that it is only emitted if it is |
5109 | actually needed. It is unlikely that it will be inlined, since | |
4109ca29 | 5110 | it is only called via a function pointer, but we avoid unnecessary |
52b5ec4c | 5111 | emissions this way. */ |
5112 | DECL_INLINE (fndecl) = 1; | |
19489abd | 5113 | DECL_DECLARED_INLINE_P (fndecl) = 1; |
5114 | DECL_INTERFACE_KNOWN (fndecl) = 1; | |
1da45f21 | 5115 | /* Build the parameter. */ |
5116 | if (flag_use_cxa_atexit) | |
5117 | { | |
5118 | tree parmdecl; | |
5119 | ||
d145d8d5 | 5120 | parmdecl = cp_build_parm_decl (NULL_TREE, ptr_type_node); |
1da45f21 | 5121 | DECL_CONTEXT (parmdecl) = fndecl; |
1da45f21 | 5122 | TREE_USED (parmdecl) = 1; |
5123 | DECL_ARGUMENTS (fndecl) = parmdecl; | |
5124 | } | |
5125 | ||
24c5ffc6 | 5126 | pushdecl (fndecl); |
1da45f21 | 5127 | start_function (/*specs=*/NULL_TREE, fndecl, NULL_TREE, SF_PRE_PARSED); |
1da45f21 | 5128 | |
5129 | interface_unknown = old_interface_unknown; | |
936a2e99 | 5130 | interface_only = old_interface_only; |
1da45f21 | 5131 | |
5132 | pop_lang_context (); | |
5133 | ||
5134 | return current_function_decl; | |
5135 | } | |
5136 | ||
5137 | /* Finish the cleanup function begun by start_cleanup_fn. */ | |
5138 | ||
5139 | static void | |
1b72315d | 5140 | end_cleanup_fn (void) |
1da45f21 | 5141 | { |
6cb758f0 | 5142 | expand_or_defer_fn (finish_function (0)); |
1da45f21 | 5143 | |
5144 | pop_from_top_level (); | |
5145 | } | |
5146 | ||
060ff7d8 | 5147 | /* Generate code to handle the destruction of DECL, an object with |
5148 | static storage duration. */ | |
b9920b13 | 5149 | |
060ff7d8 | 5150 | void |
1b72315d | 5151 | register_dtor_fn (tree decl) |
b9920b13 | 5152 | { |
1da45f21 | 5153 | tree cleanup; |
b9920b13 | 5154 | tree compound_stmt; |
1da45f21 | 5155 | tree args; |
5156 | tree fcall; | |
b9920b13 | 5157 | |
89e923d8 | 5158 | if (TYPE_HAS_TRIVIAL_DESTRUCTOR (TREE_TYPE (decl))) |
060ff7d8 | 5159 | return; |
5160 | ||
b9920b13 | 5161 | /* Call build_cleanup before we enter the anonymous function so that |
5162 | any access checks will be done relative to the current scope, | |
5163 | rather than the scope of the anonymous function. */ | |
5164 | build_cleanup (decl); | |
5165 | ||
5166 | /* Now start the function. */ | |
1da45f21 | 5167 | cleanup = start_cleanup_fn (); |
b9920b13 | 5168 | |
5169 | /* Now, recompute the cleanup. It may contain SAVE_EXPRs that refer | |
5170 | to the original function, rather than the anonymous one. That | |
5171 | will make the back-end think that nested functions are in use, | |
5172 | which causes confusion. */ | |
4cab8273 | 5173 | |
5174 | push_deferring_access_checks (dk_no_check); | |
b9920b13 | 5175 | fcall = build_cleanup (decl); |
4cab8273 | 5176 | pop_deferring_access_checks (); |
b9920b13 | 5177 | |
5178 | /* Create the body of the anonymous function. */ | |
2363ef00 | 5179 | compound_stmt = begin_compound_stmt (BCS_FN_BODY); |
b9920b13 | 5180 | finish_expr_stmt (fcall); |
68f8f8cc | 5181 | finish_compound_stmt (compound_stmt); |
1da45f21 | 5182 | end_cleanup_fn (); |
b9920b13 | 5183 | |
5184 | /* Call atexit with the cleanup function. */ | |
9b86eec0 | 5185 | cxx_mark_addressable (cleanup); |
b04d4dc3 | 5186 | mark_used (cleanup); |
b9920b13 | 5187 | cleanup = build_unary_op (ADDR_EXPR, cleanup, 0); |
1da45f21 | 5188 | if (flag_use_cxa_atexit) |
5189 | { | |
ffe1802e | 5190 | args = tree_cons (NULL_TREE, |
5191 | build_unary_op (ADDR_EXPR, get_dso_handle_node (), 0), | |
5192 | NULL_TREE); | |
1da45f21 | 5193 | args = tree_cons (NULL_TREE, null_pointer_node, args); |
5194 | args = tree_cons (NULL_TREE, cleanup, args); | |
5195 | } | |
5196 | else | |
5197 | args = tree_cons (NULL_TREE, cleanup, NULL_TREE); | |
5198 | finish_expr_stmt (build_function_call (get_atexit_node (), args)); | |
b9920b13 | 5199 | } |
5200 | ||
2437a99c | 5201 | /* DECL is a VAR_DECL with static storage duration. INIT, if present, |
5202 | is its initializer. Generate code to handle the construction | |
5203 | and destruction of DECL. */ | |
5204 | ||
5205 | static void | |
1b72315d | 5206 | expand_static_init (tree decl, tree init) |
471086d6 | 5207 | { |
2437a99c | 5208 | my_friendly_assert (TREE_CODE (decl) == VAR_DECL, 20021010); |
5209 | my_friendly_assert (TREE_STATIC (decl), 20021010); | |
5210 | ||
5211 | /* Some variables require no initialization. */ | |
5212 | if (!init | |
5213 | && !TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (decl)) | |
5214 | && TYPE_HAS_TRIVIAL_DESTRUCTOR (TREE_TYPE (decl))) | |
5215 | return; | |
5216 | ||
b7d1e8ea | 5217 | if (! toplevel_bindings_p ()) |
471086d6 | 5218 | { |
5219 | /* Emit code to perform this initialization but once. */ | |
ba3a3d1f | 5220 | tree if_stmt; |
b9920b13 | 5221 | tree then_clause; |
b48733fd | 5222 | tree assignment; |
4eb32e62 | 5223 | tree guard; |
5224 | tree guard_init; | |
471086d6 | 5225 | |
1fc84929 | 5226 | /* Emit code to perform this initialization but once. This code |
5227 | looks like: | |
5228 | ||
4eb32e62 | 5229 | static int guard = 0; |
5230 | if (!guard) { | |
1fc84929 | 5231 | // Do initialization. |
4eb32e62 | 5232 | guard = 1; |
1fc84929 | 5233 | // Register variable for destruction at end of program. |
5234 | } | |
5235 | ||
5236 | Note that the `temp' variable is only set to 1 *after* the | |
5237 | initialization is complete. This ensures that an exception, | |
5238 | thrown during the construction, will cause the variable to | |
5239 | reinitialized when we pass through this code again, as per: | |
980877d7 | 5240 | |
1fc84929 | 5241 | [stmt.dcl] |
5242 | ||
5243 | If the initialization exits by throwing an exception, the | |
5244 | initialization is not complete, so it will be tried again | |
5245 | the next time control enters the declaration. | |
5246 | ||
5247 | In theory, this process should be thread-safe, too; multiple | |
5248 | threads should not be able to initialize the variable more | |
5249 | than once. We don't yet attempt to ensure thread-safety. */ | |
4eb32e62 | 5250 | |
5251 | /* Create the guard variable. */ | |
5252 | guard = get_guard (decl); | |
1fc84929 | 5253 | |
5254 | /* Begin the conditional initialization. */ | |
ba3a3d1f | 5255 | if_stmt = begin_if_stmt (); |
4eb32e62 | 5256 | finish_if_stmt_cond (get_guard_cond (guard), if_stmt); |
2363ef00 | 5257 | then_clause = begin_compound_stmt (0); |
3d4e092a | 5258 | |
1fc84929 | 5259 | /* Do the initialization itself. */ |
2437a99c | 5260 | assignment = init ? init : NULL_TREE; |
b48733fd | 5261 | |
5262 | /* Once the assignment is complete, set TEMP to 1. Since the | |
5263 | construction of the static object is complete at this point, | |
5264 | we want to make sure TEMP is set to 1 even if a temporary | |
5265 | constructed during the initialization throws an exception | |
5266 | when it is destroyed. So, we combine the initialization and | |
5267 | the assignment to TEMP into a single expression, ensuring | |
5268 | that when we call finish_expr_stmt the cleanups will not be | |
5269 | run until after TEMP is set to 1. */ | |
4eb32e62 | 5270 | guard_init = set_guard (guard); |
b48733fd | 5271 | if (assignment) |
8a4008da | 5272 | assignment = build_compound_expr (assignment, guard_init); |
b48733fd | 5273 | else |
4eb32e62 | 5274 | assignment = guard_init; |
b48733fd | 5275 | finish_expr_stmt (assignment); |
3d4e092a | 5276 | |
1fc84929 | 5277 | /* Use atexit to register a function for destroying this static |
5278 | variable. */ | |
060ff7d8 | 5279 | register_dtor_fn (decl); |
3d4e092a | 5280 | |
68f8f8cc | 5281 | finish_compound_stmt (then_clause); |
ba3a3d1f | 5282 | finish_then_clause (if_stmt); |
2363ef00 | 5283 | finish_if_stmt (if_stmt); |
471086d6 | 5284 | } |
5285 | else | |
b53fb33d | 5286 | static_aggregates = tree_cons (init, decl, static_aggregates); |
471086d6 | 5287 | } |
357d301c | 5288 | |
5289 | /* Finish the declaration of a catch-parameter. */ | |
5290 | ||
e0e489c4 | 5291 | tree |
1b72315d | 5292 | start_handler_parms (tree declspecs, tree declarator) |
357d301c | 5293 | { |
5294 | tree decl; | |
5295 | if (declspecs) | |
5296 | { | |
5297 | decl = grokdeclarator (declarator, declspecs, CATCHPARM, | |
e3c541f0 | 5298 | 1, NULL); |
357d301c | 5299 | if (decl == NULL_TREE) |
5300 | error ("invalid catch parameter"); | |
5301 | } | |
5302 | else | |
5303 | decl = NULL_TREE; | |
e0e489c4 | 5304 | |
5305 | return decl; | |
357d301c | 5306 | } |
5307 | ||
471086d6 | 5308 | \f |
5309 | /* Make TYPE a complete type based on INITIAL_VALUE. | |
5310 | Return 0 if successful, 1 if INITIAL_VALUE can't be deciphered, | |
2ec59cf5 | 5311 | 2 if there was no information (in which case assume 0 if DO_DEFAULT). */ |
471086d6 | 5312 | |
5313 | int | |
1b72315d | 5314 | complete_array_type (tree type, tree initial_value, int do_default) |
471086d6 | 5315 | { |
cd16867a | 5316 | tree maxindex = NULL_TREE; |
471086d6 | 5317 | int value = 0; |
980877d7 | 5318 | |
471086d6 | 5319 | if (initial_value) |
5320 | { | |
e67164f5 | 5321 | /* An array of character type can be initialized from a |
5322 | brace-enclosed string constant. */ | |
5323 | if (char_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (type))) | |
5324 | && TREE_CODE (initial_value) == CONSTRUCTOR | |
5325 | && CONSTRUCTOR_ELTS (initial_value) | |
5326 | && (TREE_CODE (TREE_VALUE (CONSTRUCTOR_ELTS (initial_value))) | |
5327 | == STRING_CST) | |
5328 | && TREE_CHAIN (CONSTRUCTOR_ELTS (initial_value)) == NULL_TREE) | |
5329 | initial_value = TREE_VALUE (CONSTRUCTOR_ELTS (initial_value)); | |
5330 | ||
5331 | /* Note MAXINDEX is really the maximum index, one less than the | |
5332 | size. */ | |
471086d6 | 5333 | if (TREE_CODE (initial_value) == STRING_CST) |
bcf789d7 | 5334 | { |
5335 | int eltsize | |
5336 | = int_size_in_bytes (TREE_TYPE (TREE_TYPE (initial_value))); | |
5337 | maxindex = build_int_2 ((TREE_STRING_LENGTH (initial_value) | |
5338 | / eltsize) - 1, 0); | |
5339 | } | |
471086d6 | 5340 | else if (TREE_CODE (initial_value) == CONSTRUCTOR) |
5341 | { | |
bcf789d7 | 5342 | tree elts = CONSTRUCTOR_ELTS (initial_value); |
902de8ed | 5343 | |
5344 | maxindex = ssize_int (-1); | |
bcf789d7 | 5345 | for (; elts; elts = TREE_CHAIN (elts)) |
5346 | { | |
5347 | if (TREE_PURPOSE (elts)) | |
5348 | maxindex = TREE_PURPOSE (elts); | |
5349 | else | |
902de8ed | 5350 | maxindex = size_binop (PLUS_EXPR, maxindex, ssize_int (1)); |
bcf789d7 | 5351 | } |
5352 | maxindex = copy_node (maxindex); | |
471086d6 | 5353 | } |
5354 | else | |
5355 | { | |
5356 | /* Make an error message unless that happened already. */ | |
5357 | if (initial_value != error_mark_node) | |
5358 | value = 1; | |
308c6c51 | 5359 | else |
5360 | initial_value = NULL_TREE; | |
471086d6 | 5361 | |
5362 | /* Prevent further error messages. */ | |
5363 | maxindex = build_int_2 (0, 0); | |
5364 | } | |
5365 | } | |
5366 | ||
5367 | if (!maxindex) | |
5368 | { | |
5369 | if (do_default) | |
5370 | maxindex = build_int_2 (0, 0); | |
5371 | value = 2; | |
5372 | } | |
5373 | ||
5374 | if (maxindex) | |
5375 | { | |
ac9386a0 | 5376 | tree itype; |
2ec59cf5 | 5377 | tree domain; |
e945eb2d | 5378 | tree elt_type; |
2ec59cf5 | 5379 | |
5380 | domain = build_index_type (maxindex); | |
5381 | TYPE_DOMAIN (type) = domain; | |
ac9386a0 | 5382 | |
ef34cee5 | 5383 | if (! TREE_TYPE (maxindex)) |
2ec59cf5 | 5384 | TREE_TYPE (maxindex) = domain; |
ac9386a0 | 5385 | if (initial_value) |
5386 | itype = TREE_TYPE (initial_value); | |
5387 | else | |
5388 | itype = NULL; | |
5389 | if (itype && !TYPE_DOMAIN (itype)) | |
2ec59cf5 | 5390 | TYPE_DOMAIN (itype) = domain; |
ef34cee5 | 5391 | /* The type of the main variant should never be used for arrays |
5392 | of different sizes. It should only ever be completed with the | |
5393 | size of the array. */ | |
5394 | if (! TYPE_DOMAIN (TYPE_MAIN_VARIANT (type))) | |
2ec59cf5 | 5395 | TYPE_DOMAIN (TYPE_MAIN_VARIANT (type)) = domain; |
e945eb2d | 5396 | |
5397 | elt_type = TREE_TYPE (type); | |
5398 | TYPE_NEEDS_CONSTRUCTING (type) | |
5399 | = TYPE_NEEDS_CONSTRUCTING (TYPE_MAIN_VARIANT (elt_type)); | |
5400 | TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type) | |
5401 | = TYPE_HAS_NONTRIVIAL_DESTRUCTOR (TYPE_MAIN_VARIANT (elt_type)); | |
471086d6 | 5402 | } |
5403 | ||
5404 | /* Lay out the type now that we can get the real answer. */ | |
5405 | ||
5406 | layout_type (type); | |
5407 | ||
5408 | return value; | |
5409 | } | |
5410 | \f | |
5411 | /* Return zero if something is declared to be a member of type | |
5412 | CTYPE when in the context of CUR_TYPE. STRING is the error | |
5413 | message to print in that case. Otherwise, quietly return 1. */ | |
96624a9e | 5414 | |
471086d6 | 5415 | static int |
1b72315d | 5416 | member_function_or_else (tree ctype, tree cur_type, enum overload_flags flags) |
471086d6 | 5417 | { |
5418 | if (ctype && ctype != cur_type) | |
5419 | { | |
017fafd4 | 5420 | if (flags == DTOR_FLAG) |
cf103c6c | 5421 | error ("destructor for alien class `%T' cannot be a member", |
a0ec9fa5 | 5422 | ctype); |
017fafd4 | 5423 | else |
cf103c6c | 5424 | error ("constructor for alien class `%T' cannot be a member", |
a0ec9fa5 | 5425 | ctype); |
471086d6 | 5426 | return 0; |
5427 | } | |
5428 | return 1; | |
5429 | } | |
5430 | \f | |
5431 | /* Subroutine of `grokdeclarator'. */ | |
5432 | ||
5433 | /* Generate errors possibly applicable for a given set of specifiers. | |
5434 | This is for ARM $7.1.2. */ | |
96624a9e | 5435 | |
471086d6 | 5436 | static void |
1b72315d | 5437 | bad_specifiers (tree object, |
5438 | const char* type, | |
5439 | int virtualp, | |
5440 | int quals, | |
23aecd7a | 5441 | int inlinep, |
1b72315d | 5442 | int friendp, |
23aecd7a | 5443 | int raises) |
471086d6 | 5444 | { |
5445 | if (virtualp) | |
cf103c6c | 5446 | error ("`%D' declared as a `virtual' %s", object, type); |
471086d6 | 5447 | if (inlinep) |
cf103c6c | 5448 | error ("`%D' declared as an `inline' %s", object, type); |
471086d6 | 5449 | if (quals) |
cf103c6c | 5450 | error ("`const' and `volatile' function specifiers on `%D' invalid in %s declaration", |
e581f478 | 5451 | object, type); |
471086d6 | 5452 | if (friendp) |
ab88d33b | 5453 | cp_error_at ("`%D' declared as a friend", object); |
a49facc5 | 5454 | if (raises |
5455 | && (TREE_CODE (object) == TYPE_DECL | |
5456 | || (!TYPE_PTRFN_P (TREE_TYPE (object)) | |
054e01a7 | 5457 | && !TYPE_REFFN_P (TREE_TYPE (object)) |
a49facc5 | 5458 | && !TYPE_PTRMEMFUNC_P (TREE_TYPE (object))))) |
ab88d33b | 5459 | cp_error_at ("`%D' declared with an exception specification", object); |
471086d6 | 5460 | } |
5461 | ||
5462 | /* CTYPE is class type, or null if non-class. | |
5463 | TYPE is type this FUNCTION_DECL should have, either FUNCTION_TYPE | |
5464 | or METHOD_TYPE. | |
5465 | DECLARATOR is the function's name. | |
7ef14399 | 5466 | PARMS is a chain of PARM_DECLs for the function. |
471086d6 | 5467 | VIRTUALP is truthvalue of whether the function is virtual or not. |
5468 | FLAGS are to be passed through to `grokclassfn'. | |
5469 | QUALS are qualifiers indicating whether the function is `const' | |
5470 | or `volatile'. | |
5471 | RAISES is a list of exceptions that this function can raise. | |
5472 | CHECK is 1 if we must find this method in CTYPE, 0 if we should | |
980877d7 | 5473 | not look, and -1 if we should not call `grokclassfn' at all. |
76c1ba40 | 5474 | |
e0d8778b | 5475 | Returns `NULL_TREE' if something goes wrong, after issuing |
76c1ba40 | 5476 | applicable error messages. */ |
96624a9e | 5477 | |
471086d6 | 5478 | static tree |
1b72315d | 5479 | grokfndecl (tree ctype, |
5480 | tree type, | |
5481 | tree declarator, | |
7ef14399 | 5482 | tree parms, |
1b72315d | 5483 | tree orig_declarator, |
5484 | int virtualp, | |
5485 | enum overload_flags flags, | |
5486 | tree quals, | |
5487 | tree raises, | |
5488 | int check, | |
5489 | int friendp, | |
5490 | int publicp, | |
5491 | int inlinep, | |
5492 | int funcdef_flag, | |
5493 | int template_count, | |
5494 | tree in_namespace) | |
471086d6 | 5495 | { |
83c4eacf | 5496 | tree decl; |
471086d6 | 5497 | int staticp = ctype && TREE_CODE (type) == FUNCTION_TYPE; |
8a5f292f | 5498 | int has_default_arg = 0; |
03db3ebd | 5499 | tree t; |
471086d6 | 5500 | |
471086d6 | 5501 | if (raises) |
01779b5f | 5502 | type = build_exception_variant (type, raises); |
f9670f72 | 5503 | |
471086d6 | 5504 | decl = build_lang_decl (FUNCTION_DECL, declarator, type); |
7ef14399 | 5505 | DECL_ARGUMENTS (decl) = parms; |
a109dc3b | 5506 | /* Propagate volatile out from type to decl. */ |
471086d6 | 5507 | if (TYPE_VOLATILE (type)) |
f69ecb3b | 5508 | TREE_THIS_VOLATILE (decl) = 1; |
471086d6 | 5509 | |
62be7b35 | 5510 | /* If this decl has namespace scope, set that up. */ |
8417823c | 5511 | if (in_namespace) |
ce82f1c3 | 5512 | set_decl_namespace (decl, in_namespace, friendp); |
f4ef27d5 | 5513 | else if (!ctype) |
62be7b35 | 5514 | DECL_CONTEXT (decl) = FROB_CONTEXT (current_namespace); |
8417823c | 5515 | |
16fd72fa | 5516 | /* `main' and builtins have implicit 'C' linkage. */ |
5517 | if ((MAIN_NAME_P (declarator) | |
5518 | || (IDENTIFIER_LENGTH (declarator) > 10 | |
5519 | && IDENTIFIER_POINTER (declarator)[0] == '_' | |
5520 | && IDENTIFIER_POINTER (declarator)[1] == '_' | |
5521 | && strncmp (IDENTIFIER_POINTER (declarator)+2, "builtin_", 8) == 0)) | |
5522 | && current_lang_name == lang_name_cplusplus | |
3ea58ecd | 5523 | && ctype == NULL_TREE |
62be7b35 | 5524 | /* NULL_TREE means global namespace. */ |
5525 | && DECL_CONTEXT (decl) == NULL_TREE) | |
4b1984f5 | 5526 | SET_DECL_LANGUAGE (decl, lang_c); |
16fd72fa | 5527 | |
471086d6 | 5528 | /* Should probably propagate const out from type to decl I bet (mrs). */ |
5529 | if (staticp) | |
5530 | { | |
5531 | DECL_STATIC_FUNCTION_P (decl) = 1; | |
5532 | DECL_CONTEXT (decl) = ctype; | |
471086d6 | 5533 | } |
5534 | ||
e4ce2dc4 | 5535 | if (ctype) |
9ba4048d | 5536 | DECL_CONTEXT (decl) = ctype; |
e4ce2dc4 | 5537 | |
16fd72fa | 5538 | if (ctype == NULL_TREE && DECL_MAIN_P (decl)) |
bb09dca5 | 5539 | { |
95b2ac55 | 5540 | if (processing_template_decl) |
76afd7f0 | 5541 | error ("cannot declare `::main' to be a template"); |
bb09dca5 | 5542 | if (inlinep) |
76afd7f0 | 5543 | error ("cannot declare `::main' to be inline"); |
78390ff9 | 5544 | if (!publicp) |
76afd7f0 | 5545 | error ("cannot declare `::main' to be static"); |
78390ff9 | 5546 | if (!same_type_p (TREE_TYPE (TREE_TYPE (decl)), |
5547 | integer_type_node)) | |
5548 | error ("`main' must return `int'"); | |
bb09dca5 | 5549 | inlinep = 0; |
5550 | publicp = 1; | |
5551 | } | |
844e1a9a | 5552 | |
6cbb4197 | 5553 | /* Members of anonymous types and local classes have no linkage; make |
1112ccbc | 5554 | them internal. If a typedef is made later, this will be changed. */ |
83c4eacf | 5555 | if (ctype && (TYPE_ANONYMOUS_P (ctype) |
9ba4048d | 5556 | || decl_function_context (TYPE_MAIN_DECL (ctype)))) |
844e1a9a | 5557 | publicp = 0; |
5558 | ||
5559 | if (publicp) | |
5560 | { | |
5561 | /* [basic.link]: A name with no linkage (notably, the name of a class | |
5562 | or enumeration declared in a local scope) shall not be used to | |
5563 | declare an entity with linkage. | |
5564 | ||
bf594afa | 5565 | Only check this for public decls for now. See core 319, 389. */ |
844e1a9a | 5566 | t = no_linkage_check (TREE_TYPE (decl)); |
5567 | if (t) | |
5568 | { | |
83c4eacf | 5569 | if (TYPE_ANONYMOUS_P (t)) |
cbaacf5e | 5570 | { |
a2697ab6 | 5571 | if (DECL_EXTERN_C_P (decl)) |
cbaacf5e | 5572 | /* Allow this; it's pretty common in C. */; |
5573 | else | |
83c4eacf | 5574 | { |
cf103c6c | 5575 | pedwarn ("non-local function `%#D' uses anonymous type", |
83c4eacf | 5576 | decl); |
5577 | if (DECL_ORIGINAL_TYPE (TYPE_NAME (t))) | |
5578 | cp_pedwarn_at ("\ | |
5579 | `%#D' does not refer to the unqualified type, so it is not used for linkage", | |
5580 | TYPE_NAME (t)); | |
5581 | } | |
cbaacf5e | 5582 | } |
844e1a9a | 5583 | else |
cf103c6c | 5584 | pedwarn ("non-local function `%#D' uses local type `%T'", |
0762a377 | 5585 | decl, t); |
844e1a9a | 5586 | } |
5587 | } | |
5588 | ||
f69ecb3b | 5589 | TREE_PUBLIC (decl) = publicp; |
bb09dca5 | 5590 | if (! publicp) |
f69ecb3b | 5591 | { |
5592 | DECL_INTERFACE_KNOWN (decl) = 1; | |
5593 | DECL_NOT_REALLY_EXTERN (decl) = 1; | |
5594 | } | |
bb09dca5 | 5595 | |
10c08065 | 5596 | /* If the declaration was declared inline, mark it as such. */ |
bb09dca5 | 5597 | if (inlinep) |
10c08065 | 5598 | DECL_DECLARED_INLINE_P (decl) = 1; |
5599 | /* We inline functions that are explicitly declared inline, or, when | |
5600 | the user explicitly asks us to, all functions. */ | |
746149b7 | 5601 | if (DECL_DECLARED_INLINE_P (decl) |
5602 | || (flag_inline_trees == 2 && !DECL_INLINE (decl) && funcdef_flag)) | |
10c08065 | 5603 | DECL_INLINE (decl) = 1; |
471086d6 | 5604 | |
5605 | DECL_EXTERNAL (decl) = 1; | |
5606 | if (quals != NULL_TREE && TREE_CODE (type) == FUNCTION_TYPE) | |
5607 | { | |
cf103c6c | 5608 | error ("%smember function `%D' cannot have `%T' method qualifier", |
471086d6 | 5609 | (ctype ? "static " : "non-"), decl, TREE_VALUE (quals)); |
5610 | quals = NULL_TREE; | |
5611 | } | |
5612 | ||
97cc4539 | 5613 | if (IDENTIFIER_OPNAME_P (DECL_NAME (decl))) |
b7d1e8ea | 5614 | grok_op_properties (decl, friendp, /*complain=*/true); |
471086d6 | 5615 | |
9ba4048d | 5616 | if (ctype && decl_function_context (decl)) |
f69ecb3b | 5617 | DECL_NO_STATIC_CHAIN (decl) = 1; |
e4ce2dc4 | 5618 | |
03db3ebd | 5619 | for (t = TYPE_ARG_TYPES (TREE_TYPE (decl)); t; t = TREE_CHAIN (t)) |
5620 | if (TREE_PURPOSE (t) | |
5621 | && TREE_CODE (TREE_PURPOSE (t)) == DEFAULT_ARG) | |
5622 | { | |
8a5f292f | 5623 | has_default_arg = 1; |
03db3ebd | 5624 | break; |
5625 | } | |
5626 | ||
a16804f1 | 5627 | if (friendp |
5628 | && TREE_CODE (orig_declarator) == TEMPLATE_ID_EXPR) | |
5629 | { | |
5630 | if (funcdef_flag) | |
cf103c6c | 5631 | error |
905d4035 | 5632 | ("defining explicit specialization `%D' in friend declaration", |
a16804f1 | 5633 | orig_declarator); |
5634 | else | |
5635 | { | |
178ecb0c | 5636 | tree fns = TREE_OPERAND (orig_declarator, 0); |
5637 | tree args = TREE_OPERAND (orig_declarator, 1); | |
20c01ba9 | 5638 | |
44d34baf | 5639 | if (PROCESSING_REAL_TEMPLATE_DECL_P ()) |
5640 | { | |
5641 | /* Something like `template <class T> friend void f<T>()'. */ | |
cf103c6c | 5642 | error ("invalid use of template-id `%D' in declaration of primary template", |
44d34baf | 5643 | orig_declarator); |
e0d8778b | 5644 | return NULL_TREE; |
44d34baf | 5645 | } |
5646 | ||
8a5f292f | 5647 | |
a16804f1 | 5648 | /* A friend declaration of the form friend void f<>(). Record |
5649 | the information in the TEMPLATE_ID_EXPR. */ | |
5650 | SET_DECL_IMPLICIT_INSTANTIATION (decl); | |
178ecb0c | 5651 | |
5652 | if (TREE_CODE (fns) == COMPONENT_REF) | |
5653 | { | |
5654 | /* Due to bison parser ickiness, we will have already looked | |
5655 | up an operator_name or PFUNCNAME within the current class | |
5656 | (see template_id in parse.y). If the current class contains | |
a109dc3b | 5657 | such a name, we'll get a COMPONENT_REF here. Undo that. */ |
20c01ba9 | 5658 | |
178ecb0c | 5659 | my_friendly_assert (TREE_TYPE (TREE_OPERAND (fns, 0)) |
5660 | == current_class_type, 20001120); | |
5661 | fns = TREE_OPERAND (fns, 1); | |
5662 | } | |
5663 | my_friendly_assert (TREE_CODE (fns) == IDENTIFIER_NODE | |
178ecb0c | 5664 | || TREE_CODE (fns) == OVERLOAD, 20001120); |
5665 | DECL_TEMPLATE_INFO (decl) = tree_cons (fns, args, NULL_TREE); | |
8a5f292f | 5666 | |
5667 | if (has_default_arg) | |
5668 | { | |
cf103c6c | 5669 | error ("default arguments are not allowed in declaration of friend template specialization `%D'", |
8a5f292f | 5670 | decl); |
5671 | return NULL_TREE; | |
5672 | } | |
5673 | ||
5674 | if (inlinep) | |
5675 | { | |
cf103c6c | 5676 | error ("`inline' is not allowed in declaration of friend template specialization `%D'", |
8a5f292f | 5677 | decl); |
5678 | return NULL_TREE; | |
5679 | } | |
a16804f1 | 5680 | } |
f3110581 | 5681 | } |
b1cfe2be | 5682 | |
f13e7b2b | 5683 | if (funcdef_flag) |
5684 | /* Make the init_value nonzero so pushdecl knows this is not | |
5685 | tentative. error_mark_node is replaced later with the BLOCK. */ | |
5686 | DECL_INITIAL (decl) = error_mark_node; | |
5687 | ||
78fdeecc | 5688 | if (TYPE_NOTHROW_P (type) || nothrow_libfn_p (decl)) |
90252716 | 5689 | TREE_NOTHROW (decl) = 1; |
5690 | ||
668ae905 | 5691 | /* Caller will do the rest of this. */ |
471086d6 | 5692 | if (check < 0) |
5693 | return decl; | |
5694 | ||
0a3b29ad | 5695 | if (flags == NO_SPECIAL && ctype && constructor_name_p (declarator, ctype)) |
3467e461 | 5696 | DECL_CONSTRUCTOR_P (decl) = 1; |
5697 | ||
5698 | /* Function gets the ugly name, field gets the nice one. This call | |
5699 | may change the type of the function (because of default | |
5700 | parameters)! */ | |
5701 | if (ctype != NULL_TREE) | |
5702 | grokclassfn (ctype, decl, flags, quals); | |
5703 | ||
5704 | decl = check_explicit_specialization (orig_declarator, decl, | |
5705 | template_count, | |
5706 | 2 * (funcdef_flag != 0) + | |
5707 | 4 * (friendp != 0)); | |
5708 | if (decl == error_mark_node) | |
5709 | return NULL_TREE; | |
64b4f183 | 5710 | |
3467e461 | 5711 | if (ctype != NULL_TREE |
5712 | && (! TYPE_FOR_JAVA (ctype) || check_java_method (decl)) | |
5713 | && check) | |
471086d6 | 5714 | { |
3467e461 | 5715 | tree old_decl; |
471086d6 | 5716 | |
7bdfc61c | 5717 | old_decl = check_classfn (ctype, decl, |
0122f52b | 5718 | (processing_template_decl |
5719 | > template_class_depth (ctype)) | |
5720 | ? current_template_parms | |
5721 | : NULL_TREE); | |
471086d6 | 5722 | |
3467e461 | 5723 | if (old_decl && TREE_CODE (old_decl) == TEMPLATE_DECL) |
5724 | /* Because grokfndecl is always supposed to return a | |
5725 | FUNCTION_DECL, we pull out the DECL_TEMPLATE_RESULT | |
5726 | here. We depend on our callers to figure out that its | |
5727 | really a template that's being returned. */ | |
5728 | old_decl = DECL_TEMPLATE_RESULT (old_decl); | |
1d42585d | 5729 | |
3467e461 | 5730 | if (old_decl && DECL_STATIC_FUNCTION_P (old_decl) |
5731 | && TREE_CODE (TREE_TYPE (decl)) == METHOD_TYPE) | |
7ef14399 | 5732 | /* Remove the `this' parm added by grokclassfn. |
5733 | XXX Isn't this done in start_function, too? */ | |
5734 | revert_static_member_fn (decl); | |
3467e461 | 5735 | if (old_decl && DECL_ARTIFICIAL (old_decl)) |
cf103c6c | 5736 | error ("definition of implicitly-declared `%D'", old_decl); |
471086d6 | 5737 | |
3467e461 | 5738 | if (old_decl) |
471086d6 | 5739 | { |
f12b8e1e | 5740 | tree ok; |
1cbda81f | 5741 | bool pop_p; |
66bf0ee5 | 5742 | |
3467e461 | 5743 | /* Since we've smashed OLD_DECL to its |
5744 | DECL_TEMPLATE_RESULT, we must do the same to DECL. */ | |
5745 | if (TREE_CODE (decl) == TEMPLATE_DECL) | |
5746 | decl = DECL_TEMPLATE_RESULT (decl); | |
5747 | ||
5748 | /* Attempt to merge the declarations. This can fail, in | |
6c0cc2cd | 5749 | the case of some invalid specialization declarations. */ |
1cbda81f | 5750 | pop_p = push_scope (ctype); |
66bf0ee5 | 5751 | ok = duplicate_decls (decl, old_decl); |
1cbda81f | 5752 | if (pop_p) |
5753 | pop_scope (ctype); | |
66bf0ee5 | 5754 | if (!ok) |
5755 | { | |
5756 | error ("no `%#D' member function declared in class `%T'", | |
5757 | decl, ctype); | |
5758 | return NULL_TREE; | |
5759 | } | |
3467e461 | 5760 | return old_decl; |
471086d6 | 5761 | } |
5762 | } | |
3467e461 | 5763 | |
5764 | if (DECL_CONSTRUCTOR_P (decl) && !grok_ctor_properties (ctype, decl)) | |
5765 | return NULL_TREE; | |
5766 | ||
5767 | if (ctype == NULL_TREE || check) | |
5768 | return decl; | |
5769 | ||
5770 | if (virtualp) | |
4c481f71 | 5771 | DECL_VIRTUAL_P (decl) = 1; |
3467e461 | 5772 | |
471086d6 | 5773 | return decl; |
5774 | } | |
5775 | ||
3645386f | 5776 | /* Create a VAR_DECL named NAME with the indicated TYPE. |
5777 | ||
5778 | If SCOPE is non-NULL, it is the class type or namespace containing | |
5779 | the variable. If SCOPE is NULL, the variable should is created in | |
5780 | the innermost enclosings scope. */ | |
5781 | ||
471086d6 | 5782 | static tree |
1b72315d | 5783 | grokvardecl (tree type, |
5784 | tree name, | |
5785 | RID_BIT_TYPE * specbits_in, | |
5786 | int initialized, | |
5787 | int constp, | |
5788 | tree scope) | |
471086d6 | 5789 | { |
5790 | tree decl; | |
eaf26d83 | 5791 | RID_BIT_TYPE specbits; |
5792 | ||
3645386f | 5793 | my_friendly_assert (!name || TREE_CODE (name) == IDENTIFIER_NODE, |
5794 | 20020808); | |
5795 | ||
eaf26d83 | 5796 | specbits = *specbits_in; |
471086d6 | 5797 | |
3645386f | 5798 | /* Compute the scope in which to place the variable. */ |
5799 | if (!scope) | |
471086d6 | 5800 | { |
3645386f | 5801 | /* An explicit "extern" specifier indicates a namespace-scope |
5802 | variable. */ | |
5803 | if (RIDBIT_SETP (RID_EXTERN, specbits)) | |
5804 | scope = current_namespace; | |
5805 | else if (!at_function_scope_p ()) | |
5806 | { | |
5807 | scope = current_scope (); | |
5808 | if (!scope) | |
5809 | scope = current_namespace; | |
5810 | } | |
5811 | } | |
5812 | ||
5813 | if (scope | |
5814 | && (/* If the variable is a namespace-scope variable declared in a | |
5815 | template, we need DECL_LANG_SPECIFIC. */ | |
5816 | (TREE_CODE (scope) == NAMESPACE_DECL && processing_template_decl) | |
5817 | /* Similarly for namespace-scope variables with language linkage | |
5818 | other than C++. */ | |
5819 | || (TREE_CODE (scope) == NAMESPACE_DECL | |
5820 | && current_lang_name != lang_name_cplusplus) | |
5821 | /* Similarly for static data members. */ | |
5822 | || TYPE_P (scope))) | |
5823 | decl = build_lang_decl (VAR_DECL, name, type); | |
471086d6 | 5824 | else |
3645386f | 5825 | decl = build_decl (VAR_DECL, name, type); |
62be7b35 | 5826 | |
3645386f | 5827 | if (scope && TREE_CODE (scope) == NAMESPACE_DECL) |
5828 | set_decl_namespace (decl, scope, 0); | |
5829 | else | |
5830 | DECL_CONTEXT (decl) = scope; | |
a74e8896 | 5831 | |
3645386f | 5832 | if (name && scope && current_lang_name != lang_name_c) |
5833 | /* We can't mangle lazily here because we don't have any | |
5834 | way to recover whether or not a variable was `extern | |
5835 | "C"' later. */ | |
5836 | mangle_decl (decl); | |
8417823c | 5837 | |
471086d6 | 5838 | if (RIDBIT_SETP (RID_EXTERN, specbits)) |
5839 | { | |
5840 | DECL_THIS_EXTERN (decl) = 1; | |
5841 | DECL_EXTERNAL (decl) = !initialized; | |
5842 | } | |
5843 | ||
5844 | /* In class context, static means one per class, | |
5845 | public access, and static storage. */ | |
00d2b1b9 | 5846 | if (DECL_CLASS_SCOPE_P (decl)) |
471086d6 | 5847 | { |
5848 | TREE_PUBLIC (decl) = 1; | |
5849 | TREE_STATIC (decl) = 1; | |
822f06da | 5850 | DECL_EXTERNAL (decl) = 0; |
471086d6 | 5851 | } |
5852 | /* At top level, either `static' or no s.c. makes a definition | |
5853 | (perhaps tentative), and absence of `static' makes it public. */ | |
d0622bdf | 5854 | else if (toplevel_bindings_p ()) |
471086d6 | 5855 | { |
d0622bdf | 5856 | TREE_PUBLIC (decl) = (RIDBIT_NOTSETP (RID_STATIC, specbits) |
02b4641e | 5857 | && (DECL_THIS_EXTERN (decl) || ! constp)); |
471086d6 | 5858 | TREE_STATIC (decl) = ! DECL_EXTERNAL (decl); |
5859 | } | |
5860 | /* Not at top level, only `static' makes a static definition. */ | |
5861 | else | |
5862 | { | |
5863 | TREE_STATIC (decl) = !! RIDBIT_SETP (RID_STATIC, specbits); | |
5864 | TREE_PUBLIC (decl) = DECL_EXTERNAL (decl); | |
5865 | } | |
844e1a9a | 5866 | |
e396cd54 | 5867 | if (RIDBIT_SETP (RID_THREAD, specbits)) |
5868 | { | |
5869 | if (targetm.have_tls) | |
5870 | DECL_THREAD_LOCAL (decl) = 1; | |
5871 | else | |
5872 | /* A mere warning is sure to result in improper semantics | |
5873 | at runtime. Don't bother to allow this to compile. */ | |
5874 | error ("thread-local storage not supported for this target"); | |
5875 | } | |
5876 | ||
844e1a9a | 5877 | if (TREE_PUBLIC (decl)) |
5878 | { | |
5879 | /* [basic.link]: A name with no linkage (notably, the name of a class | |
5880 | or enumeration declared in a local scope) shall not be used to | |
5881 | declare an entity with linkage. | |
5882 | ||
5883 | Only check this for public decls for now. */ | |
5884 | tree t = no_linkage_check (TREE_TYPE (decl)); | |
5885 | if (t) | |
5886 | { | |
83c4eacf | 5887 | if (TYPE_ANONYMOUS_P (t)) |
1112ccbc | 5888 | { |
5889 | if (DECL_EXTERN_C_P (decl)) | |
5890 | /* Allow this; it's pretty common in C. */; | |
5891 | else | |
5892 | { | |
5893 | pedwarn ("non-local variable `%#D' uses anonymous type", | |
5894 | decl); | |
5895 | if (DECL_ORIGINAL_TYPE (TYPE_NAME (t))) | |
5896 | cp_pedwarn_at ("\ | |
5897 | `%#D' does not refer to the unqualified type, so it is not used for linkage", | |
5898 | TYPE_NAME (t)); | |
5899 | } | |
5900 | } | |
844e1a9a | 5901 | else |
cf103c6c | 5902 | pedwarn ("non-local variable `%#D' uses local type `%T'", |
844e1a9a | 5903 | decl, t); |
5904 | } | |
5905 | } | |
5906 | ||
471086d6 | 5907 | return decl; |
5908 | } | |
5909 | ||
2b77484d | 5910 | /* Create and return a canonical pointer to member function type, for |
5911 | TYPE, which is a POINTER_TYPE to a METHOD_TYPE. */ | |
471086d6 | 5912 | |
5913 | tree | |
1b72315d | 5914 | build_ptrmemfunc_type (tree type) |
471086d6 | 5915 | { |
805e22b2 | 5916 | tree field, fields; |
471086d6 | 5917 | tree t; |
3970dedc | 5918 | tree unqualified_variant = NULL_TREE; |
471086d6 | 5919 | |
594f37d2 | 5920 | if (type == error_mark_node) |
5921 | return type; | |
20c01ba9 | 5922 | |
471086d6 | 5923 | /* If a canonical type already exists for this type, use it. We use |
5924 | this method instead of type_hash_canon, because it only does a | |
5925 | simple equality check on the list of field members. */ | |
5926 | ||
5927 | if ((t = TYPE_GET_PTRMEMFUNC_TYPE (type))) | |
5928 | return t; | |
5929 | ||
3970dedc | 5930 | /* Make sure that we always have the unqualified pointer-to-member |
5931 | type first. */ | |
3119c950 | 5932 | if (cp_type_quals (type) != TYPE_UNQUALIFIED) |
980877d7 | 5933 | unqualified_variant |
3970dedc | 5934 | = build_ptrmemfunc_type (TYPE_MAIN_VARIANT (type)); |
5935 | ||
9972f65e | 5936 | t = make_aggr_type (RECORD_TYPE); |
8417823c | 5937 | /* Let the front-end know this is a pointer to member function... */ |
c25194fd | 5938 | TYPE_PTRMEMFUNC_FLAG (t) = 1; |
8417823c | 5939 | /* ... and not really an aggregate. */ |
e4e283ec | 5940 | SET_IS_AGGR_TYPE (t, 0); |
471086d6 | 5941 | |
805e22b2 | 5942 | field = build_decl (FIELD_DECL, pfn_identifier, type); |
5943 | fields = field; | |
5944 | ||
5945 | field = build_decl (FIELD_DECL, delta_identifier, delta_type_node); | |
5946 | TREE_CHAIN (field) = fields; | |
5947 | fields = field; | |
5948 | ||
5949 | finish_builtin_struct (t, "__ptrmemfunc_type", fields, ptr_type_node); | |
471086d6 | 5950 | |
471086d6 | 5951 | /* Zap out the name so that the back-end will give us the debugging |
5952 | information for this anonymous RECORD_TYPE. */ | |
5953 | TYPE_NAME (t) = NULL_TREE; | |
5954 | ||
3970dedc | 5955 | /* If this is not the unqualified form of this pointer-to-member |
5956 | type, set the TYPE_MAIN_VARIANT for this type to be the | |
5957 | unqualified type. Since they are actually RECORD_TYPEs that are | |
5958 | not variants of each other, we must do this manually. */ | |
3119c950 | 5959 | if (cp_type_quals (type) != TYPE_UNQUALIFIED) |
3970dedc | 5960 | { |
3119c950 | 5961 | t = build_qualified_type (t, cp_type_quals (type)); |
3970dedc | 5962 | TYPE_MAIN_VARIANT (t) = unqualified_variant; |
5963 | TYPE_NEXT_VARIANT (t) = TYPE_NEXT_VARIANT (unqualified_variant); | |
5964 | TYPE_NEXT_VARIANT (unqualified_variant) = t; | |
5965 | } | |
5966 | ||
5967 | /* Cache this pointer-to-member type so that we can find it again | |
5968 | later. */ | |
471086d6 | 5969 | TYPE_SET_PTRMEMFUNC_TYPE (type, t); |
5970 | ||
471086d6 | 5971 | return t; |
5972 | } | |
5973 | ||
3645386f | 5974 | /* Create and return a pointer to data member type. */ |
5975 | ||
5976 | tree | |
5977 | build_ptrmem_type (tree class_type, tree member_type) | |
5978 | { | |
1bc16cab | 5979 | if (TREE_CODE (member_type) == METHOD_TYPE) |
5980 | { | |
5981 | tree arg_types; | |
5982 | ||
5983 | arg_types = TYPE_ARG_TYPES (member_type); | |
5984 | class_type = (cp_build_qualified_type | |
5985 | (class_type, | |
5986 | cp_type_quals (TREE_TYPE (TREE_VALUE (arg_types))))); | |
5987 | member_type | |
5bfb0742 | 5988 | = build_method_type_directly (class_type, |
5989 | TREE_TYPE (member_type), | |
5990 | TREE_CHAIN (arg_types)); | |
1bc16cab | 5991 | return build_ptrmemfunc_type (build_pointer_type (member_type)); |
5992 | } | |
5993 | else | |
5994 | { | |
5995 | my_friendly_assert (TREE_CODE (member_type) != FUNCTION_TYPE, | |
5996 | 20030716); | |
5997 | return build_offset_type (class_type, member_type); | |
5998 | } | |
3645386f | 5999 | } |
6000 | ||
d8f6e09c | 6001 | /* DECL is a VAR_DECL defined in-class, whose TYPE is also given. |
6002 | Check to see that the definition is valid. Issue appropriate error | |
6003 | messages. Return 1 if the definition is particularly bad, or 0 | |
6004 | otherwise. */ | |
6005 | ||
6006 | int | |
1b72315d | 6007 | check_static_variable_definition (tree decl, tree type) |
d8f6e09c | 6008 | { |
6009 | /* Motion 10 at San Diego: If a static const integral data member is | |
6010 | initialized with an integral constant expression, the initializer | |
6011 | may appear either in the declaration (within the class), or in | |
6012 | the definition, but not both. If it appears in the class, the | |
6013 | member is a member constant. The file-scope definition is always | |
6014 | required. */ | |
0fe26a86 | 6015 | if (!ARITHMETIC_TYPE_P (type) && TREE_CODE (type) != ENUMERAL_TYPE) |
d8f6e09c | 6016 | { |
cf103c6c | 6017 | error ("invalid in-class initialization of static data member of non-integral type `%T'", |
0fe26a86 | 6018 | type); |
d8f6e09c | 6019 | /* If we just return the declaration, crashes will sometimes |
0f3ccaa3 | 6020 | occur. We therefore return void_type_node, as if this were a |
d8f6e09c | 6021 | friend declaration, to cause callers to completely ignore |
6022 | this declaration. */ | |
6023 | return 1; | |
6024 | } | |
6025 | else if (!CP_TYPE_CONST_P (type)) | |
cf103c6c | 6026 | error ("ISO C++ forbids in-class initialization of non-const static member `%D'", |
d8f6e09c | 6027 | decl); |
6028 | else if (pedantic && !INTEGRAL_TYPE_P (type)) | |
cf103c6c | 6029 | pedwarn ("ISO C++ forbids initialization of member constant `%D' of non-integral type `%T'", decl, type); |
d8f6e09c | 6030 | |
6031 | return 0; | |
6032 | } | |
6033 | ||
b1e0749b | 6034 | /* Given the SIZE (i.e., number of elements) in an array, compute an |
6035 | appropriate index type for the array. If non-NULL, NAME is the | |
6036 | name of the thing being declared. */ | |
6037 | ||
949d8cc7 | 6038 | tree |
1b72315d | 6039 | compute_array_index_type (tree name, tree size) |
b1e0749b | 6040 | { |
1cd6548d | 6041 | tree type = TREE_TYPE (size); |
b1e0749b | 6042 | tree itype; |
6043 | ||
1cd6548d | 6044 | /* The array bound must be an integer type. */ |
6045 | if (!dependent_type_p (type) && !INTEGRAL_TYPE_P (type)) | |
b1e0749b | 6046 | { |
1cd6548d | 6047 | if (name) |
6048 | error ("size of array `%D' has non-integral type `%T'", name, type); | |
6049 | else | |
6050 | error ("size of array has non-integral type `%T'", type); | |
6051 | size = integer_one_node; | |
6052 | type = TREE_TYPE (size); | |
b1e0749b | 6053 | } |
6054 | ||
1cd6548d | 6055 | if (abi_version_at_least (2) |
6056 | /* We should only handle value dependent expressions specially. */ | |
6057 | ? value_dependent_expression_p (size) | |
6058 | /* But for abi-1, we handled all instances in templates. This | |
6059 | effects the manglings produced. */ | |
6060 | : processing_template_decl) | |
6061 | return build_index_type (build_min (MINUS_EXPR, sizetype, | |
6062 | size, integer_one_node)); | |
6063 | ||
a109dc3b | 6064 | /* The size might be the result of a cast. */ |
db4f24e2 | 6065 | STRIP_TYPE_NOPS (size); |
6066 | ||
6067 | /* It might be a const variable or enumeration constant. */ | |
6068 | size = decl_constant_value (size); | |
6069 | ||
b1e0749b | 6070 | /* Normally, the array-bound will be a constant. */ |
f9b9bf39 | 6071 | if (TREE_CODE (size) == INTEGER_CST) |
b1e0749b | 6072 | { |
6073 | /* Check to see if the array bound overflowed. Make that an | |
6074 | error, no matter how generous we're being. */ | |
6075 | int old_flag_pedantic_errors = flag_pedantic_errors; | |
6076 | int old_pedantic = pedantic; | |
6077 | pedantic = flag_pedantic_errors = 1; | |
6078 | constant_expression_warning (size); | |
6079 | pedantic = old_pedantic; | |
6080 | flag_pedantic_errors = old_flag_pedantic_errors; | |
6081 | ||
6082 | /* An array must have a positive number of elements. */ | |
6083 | if (INT_CST_LT (size, integer_zero_node)) | |
6084 | { | |
32997f84 | 6085 | if (name) |
cf103c6c | 6086 | error ("size of array `%D' is negative", name); |
32997f84 | 6087 | else |
cf103c6c | 6088 | error ("size of array is negative"); |
b1e0749b | 6089 | size = integer_one_node; |
6090 | } | |
8f034d15 | 6091 | /* As an extension we allow zero-sized arrays. We always allow |
6092 | them in system headers because glibc uses them. */ | |
b1e0749b | 6093 | else if (integer_zerop (size) && pedantic && !in_system_header) |
32997f84 | 6094 | { |
6095 | if (name) | |
cf103c6c | 6096 | pedwarn ("ISO C++ forbids zero-size array `%D'", name); |
32997f84 | 6097 | else |
cf103c6c | 6098 | pedwarn ("ISO C++ forbids zero-size array"); |
32997f84 | 6099 | } |
b1e0749b | 6100 | } |
f9b9bf39 | 6101 | else if (TREE_CONSTANT (size)) |
6102 | { | |
6103 | /* `(int) &fn' is not a valid array bound. */ | |
6104 | if (name) | |
cf103c6c | 6105 | error ("size of array `%D' is not an integral constant-expression", |
f9b9bf39 | 6106 | name); |
6107 | else | |
cf103c6c | 6108 | error ("size of array is not an integral constant-expression"); |
f9b9bf39 | 6109 | } |
1cd6548d | 6110 | else if (pedantic) |
6111 | { | |
6112 | if (name) | |
6113 | pedwarn ("ISO C++ forbids variable-size array `%D'", name); | |
6114 | else | |
6115 | pedwarn ("ISO C++ forbids variable-size array"); | |
6116 | } | |
b1e0749b | 6117 | |
1cd6548d | 6118 | if (processing_template_decl && !TREE_CONSTANT (size)) |
6119 | /* A variable sized array. */ | |
6120 | itype = build_min (MINUS_EXPR, sizetype, size, integer_one_node); | |
6121 | else | |
b1e0749b | 6122 | { |
1cd6548d | 6123 | /* Compute the index of the largest element in the array. It is |
6124 | one less than the number of elements in the array. */ | |
6125 | itype | |
6126 | = fold (cp_build_binary_op (MINUS_EXPR, | |
6127 | cp_convert (ssizetype, size), | |
6128 | cp_convert (ssizetype, integer_one_node))); | |
6129 | if (!TREE_CONSTANT (itype)) | |
331bc0ad | 6130 | /* A variable sized array. */ |
1cd6548d | 6131 | itype = variable_size (itype); |
6132 | /* Make sure that there was no overflow when creating to a signed | |
6133 | index type. (For example, on a 32-bit machine, an array with | |
6134 | size 2^32 - 1 is too big.) */ | |
6135 | else if (TREE_OVERFLOW (itype)) | |
b1e0749b | 6136 | { |
1cd6548d | 6137 | error ("overflow in array dimension"); |
6138 | TREE_OVERFLOW (itype) = 0; | |
b1e0749b | 6139 | } |
b1e0749b | 6140 | } |
980877d7 | 6141 | |
b1e0749b | 6142 | /* Create and return the appropriate index type. */ |
6143 | return build_index_type (itype); | |
6144 | } | |
6145 | ||
0a3b29ad | 6146 | /* Returns the scope (if any) in which the entity declared by |
6147 | DECLARATOR will be located. If the entity was declared with an | |
6148 | unqualified name, NULL_TREE is returned. */ | |
6149 | ||
6150 | tree | |
1b72315d | 6151 | get_scope_of_declarator (tree declarator) |
0a3b29ad | 6152 | { |
6153 | if (!declarator) | |
6154 | return NULL_TREE; | |
6155 | ||
6156 | switch (TREE_CODE (declarator)) | |
6157 | { | |
6158 | case CALL_EXPR: | |
6159 | case ARRAY_REF: | |
6160 | case INDIRECT_REF: | |
6161 | case ADDR_EXPR: | |
6162 | /* For any of these, the main declarator is the first operand. */ | |
6163 | return get_scope_of_declarator (TREE_OPERAND | |
6164 | (declarator, 0)); | |
6165 | ||
6166 | case SCOPE_REF: | |
6167 | /* For a pointer-to-member, continue descending. */ | |
6168 | if (TREE_CODE (TREE_OPERAND (declarator, 1)) | |
6169 | == INDIRECT_REF) | |
6170 | return get_scope_of_declarator (TREE_OPERAND | |
6171 | (declarator, 1)); | |
6172 | /* Otherwise, if the declarator-id is a SCOPE_REF, the scope in | |
6173 | which the declaration occurs is the first operand. */ | |
6174 | return TREE_OPERAND (declarator, 0); | |
6175 | ||
6176 | case TREE_LIST: | |
6177 | /* Attributes to be applied. The declarator is TREE_VALUE. */ | |
6178 | return get_scope_of_declarator (TREE_VALUE (declarator)); | |
6179 | ||
6180 | default: | |
6181 | /* Otherwise, we have a declarator-id which is not a qualified | |
6182 | name; the entity will be declared in the current scope. */ | |
6183 | return NULL_TREE; | |
6184 | } | |
6185 | } | |
6186 | ||
b1e0749b | 6187 | /* Returns an ARRAY_TYPE for an array with SIZE elements of the |
6188 | indicated TYPE. If non-NULL, NAME is the NAME of the declaration | |
6189 | with this type. */ | |
6190 | ||
6191 | static tree | |
1b72315d | 6192 | create_array_type_for_decl (tree name, tree type, tree size) |
b1e0749b | 6193 | { |
6194 | tree itype = NULL_TREE; | |
6195 | const char* error_msg; | |
6196 | ||
6197 | /* If things have already gone awry, bail now. */ | |
6198 | if (type == error_mark_node || size == error_mark_node) | |
6199 | return error_mark_node; | |
6200 | ||
6201 | /* Assume that everything will go OK. */ | |
6202 | error_msg = NULL; | |
6203 | ||
6204 | /* There are some types which cannot be array elements. */ | |
6205 | switch (TREE_CODE (type)) | |
6206 | { | |
6207 | case VOID_TYPE: | |
6208 | error_msg = "array of void"; | |
6209 | break; | |
6210 | ||
6211 | case FUNCTION_TYPE: | |
6212 | error_msg = "array of functions"; | |
6213 | break; | |
6214 | ||
6215 | case REFERENCE_TYPE: | |
6216 | error_msg = "array of references"; | |
6217 | break; | |
6218 | ||
b1e0749b | 6219 | case METHOD_TYPE: |
6220 | error_msg = "array of function members"; | |
6221 | break; | |
6222 | ||
6223 | default: | |
6224 | break; | |
6225 | } | |
6226 | ||
6227 | /* If something went wrong, issue an error-message and return. */ | |
6228 | if (error_msg) | |
6229 | { | |
6230 | if (name) | |
cf103c6c | 6231 | error ("declaration of `%D' as %s", name, error_msg); |
b1e0749b | 6232 | else |
cf103c6c | 6233 | error ("creating %s", error_msg); |
b1e0749b | 6234 | |
6235 | return error_mark_node; | |
6236 | } | |
6237 | ||
6238 | /* [dcl.array] | |
980877d7 | 6239 | |
b1e0749b | 6240 | The constant expressions that specify the bounds of the arrays |
6241 | can be omitted only for the first member of the sequence. */ | |
6242 | if (TREE_CODE (type) == ARRAY_TYPE && !TYPE_DOMAIN (type)) | |
6243 | { | |
80ca7112 | 6244 | if (name) |
cf103c6c | 6245 | error ("declaration of `%D' as multidimensional array must have bounds for all dimensions except the first", |
80ca7112 | 6246 | name); |
6247 | else | |
cf103c6c | 6248 | error ("multidimensional array must have bounds for all dimensions except the first"); |
b1e0749b | 6249 | |
6250 | return error_mark_node; | |
6251 | } | |
6252 | ||
6253 | /* Figure out the index type for the array. */ | |
6254 | if (size) | |
6255 | itype = compute_array_index_type (name, size); | |
6256 | ||
6257 | return build_cplus_array_type (type, itype); | |
6258 | } | |
6259 | ||
bb855ff9 | 6260 | /* Check that it's OK to declare a function with the indicated TYPE. |
6261 | SFK indicates the kind of special function (if any) that this | |
606b494c | 6262 | function is. OPTYPE is the type given in a conversion operator |
bb855ff9 | 6263 | declaration. Returns the actual return type of the function; that |
6264 | may be different than TYPE if an error occurs, or for certain | |
6265 | special functions. */ | |
6266 | ||
6267 | static tree | |
1b72315d | 6268 | check_special_function_return_type (special_function_kind sfk, |
6269 | tree type, | |
6270 | tree optype) | |
bb855ff9 | 6271 | { |
6272 | switch (sfk) | |
6273 | { | |
6274 | case sfk_constructor: | |
6275 | if (type) | |
cf103c6c | 6276 | error ("return type specification for constructor invalid"); |
3c3beda6 | 6277 | |
606b494c | 6278 | type = void_type_node; |
bb855ff9 | 6279 | break; |
6280 | ||
6281 | case sfk_destructor: | |
6282 | if (type) | |
cf103c6c | 6283 | error ("return type specification for destructor invalid"); |
bb855ff9 | 6284 | type = void_type_node; |
6285 | break; | |
6286 | ||
6287 | case sfk_conversion: | |
6288 | if (type && !same_type_p (type, optype)) | |
cf103c6c | 6289 | error ("operator `%T' declared to return `%T'", optype, type); |
bb855ff9 | 6290 | else if (type) |
cf103c6c | 6291 | pedwarn ("return type specified for `operator %T'", optype); |
bb855ff9 | 6292 | type = optype; |
6293 | break; | |
6294 | ||
6295 | default: | |
523ac844 | 6296 | abort (); |
bb855ff9 | 6297 | break; |
6298 | } | |
6299 | ||
6300 | return type; | |
6301 | } | |
6302 | ||
0a3b29ad | 6303 | /* Given declspecs and a declarator (abstract or otherwise), determine |
6304 | the name and type of the object declared and construct a DECL node | |
6305 | for it. | |
471086d6 | 6306 | |
6307 | DECLSPECS is a chain of tree_list nodes whose value fields | |
6308 | are the storage classes and type specifiers. | |
6309 | ||
6310 | DECL_CONTEXT says which syntactic context this declaration is in: | |
6311 | NORMAL for most contexts. Make a VAR_DECL or FUNCTION_DECL or TYPE_DECL. | |
6312 | FUNCDEF for a function definition. Like NORMAL but a few different | |
6313 | error messages in each case. Return value may be zero meaning | |
6314 | this definition is too screwy to try to parse. | |
6315 | MEMFUNCDEF for a function definition. Like FUNCDEF but prepares to | |
6316 | handle member functions (which have FIELD context). | |
6317 | Return value may be zero meaning this definition is too screwy to | |
6318 | try to parse. | |
6319 | PARM for a parameter declaration (either within a function prototype | |
6320 | or before a function body). Make a PARM_DECL, or return void_type_node. | |
c25194fd | 6321 | CATCHPARM for a parameter declaration before a catch clause. |
471086d6 | 6322 | TYPENAME if for a typename (in a cast or sizeof). |
6323 | Don't make a DECL node; just return the ..._TYPE node. | |
6324 | FIELD for a struct or union field; make a FIELD_DECL. | |
6325 | BITFIELD for a field with specified width. | |
6326 | INITIALIZED is 1 if the decl has an initializer. | |
6327 | ||
e3c541f0 | 6328 | ATTRLIST is a pointer to the list of attributes, which may be NULL |
6329 | if there are none; *ATTRLIST may be modified if attributes from inside | |
6330 | the declarator should be applied to the declaration. | |
d8f6e09c | 6331 | |
0a3b29ad | 6332 | When this function is called, scoping variables (such as |
6333 | CURRENT_CLASS_TYPE) should reflect the scope in which the | |
6334 | declaration occurs, not the scope in which the new declaration will | |
6335 | be placed. For example, on: | |
471086d6 | 6336 | |
0a3b29ad | 6337 | void S::f() { ... } |
471086d6 | 6338 | |
0a3b29ad | 6339 | when grokdeclarator is called for `S::f', the CURRENT_CLASS_TYPE |
6340 | should not be `S'. */ | |
471086d6 | 6341 | |
471086d6 | 6342 | tree |
1b72315d | 6343 | grokdeclarator (tree declarator, |
6344 | tree declspecs, | |
6345 | enum decl_context decl_context, | |
6346 | int initialized, | |
6347 | tree* attrlist) | |
471086d6 | 6348 | { |
6349 | RID_BIT_TYPE specbits; | |
6350 | int nclasses = 0; | |
6351 | tree spec; | |
6352 | tree type = NULL_TREE; | |
6353 | int longlong = 0; | |
3e04bd45 | 6354 | int type_quals; |
c25194fd | 6355 | int virtualp, explicitp, friendp, inlinep, staticp; |
471086d6 | 6356 | int explicit_int = 0; |
6357 | int explicit_char = 0; | |
c4a8ac95 | 6358 | int defaulted_int = 0; |
179d1a03 | 6359 | int extern_langp = 0; |
6debb1d0 | 6360 | tree dependant_name = NULL_TREE; |
179d1a03 | 6361 | |
471086d6 | 6362 | tree typedef_decl = NULL_TREE; |
023b3db6 | 6363 | const char *name; |
471086d6 | 6364 | tree typedef_type = NULL_TREE; |
6365 | int funcdef_flag = 0; | |
6366 | enum tree_code innermost_code = ERROR_MARK; | |
6367 | int bitfield = 0; | |
7d85c040 | 6368 | #if 0 |
6369 | /* See the code below that used this. */ | |
e3c541f0 | 6370 | tree decl_attr = NULL_TREE; |
7d85c040 | 6371 | #endif |
471086d6 | 6372 | |
6373 | /* Keep track of what sort of function is being processed | |
6374 | so that we can warn about default return values, or explicit | |
6375 | return values which do not match prescribed defaults. */ | |
bb855ff9 | 6376 | special_function_kind sfk = sfk_none; |
471086d6 | 6377 | |
6378 | tree dname = NULL_TREE; | |
6379 | tree ctype = current_class_type; | |
6380 | tree ctor_return_type = NULL_TREE; | |
6381 | enum overload_flags flags = NO_SPECIAL; | |
471086d6 | 6382 | tree quals = NULL_TREE; |
f9670f72 | 6383 | tree raises = NULL_TREE; |
b1cfe2be | 6384 | int template_count = 0; |
8417823c | 6385 | tree in_namespace = NULL_TREE; |
e3c541f0 | 6386 | tree returned_attrs = NULL_TREE; |
0a3b29ad | 6387 | tree scope = NULL_TREE; |
7ef14399 | 6388 | tree parms = NULL_TREE; |
471086d6 | 6389 | |
6390 | RIDBIT_RESET_ALL (specbits); | |
6391 | if (decl_context == FUNCDEF) | |
6392 | funcdef_flag = 1, decl_context = NORMAL; | |
6393 | else if (decl_context == MEMFUNCDEF) | |
6394 | funcdef_flag = -1, decl_context = FIELD; | |
6395 | else if (decl_context == BITFIELD) | |
6396 | bitfield = 1, decl_context = FIELD; | |
6397 | ||
471086d6 | 6398 | /* Look inside a declarator for the name being declared |
6399 | and get it as a string, for an error message. */ | |
6400 | { | |
652e1a2d | 6401 | tree *next = &declarator; |
cd16867a | 6402 | tree decl; |
471086d6 | 6403 | name = NULL; |
6404 | ||
652e1a2d | 6405 | while (next && *next) |
6406 | { | |
6407 | decl = *next; | |
6408 | switch (TREE_CODE (decl)) | |
471086d6 | 6409 | { |
222b8af3 | 6410 | case TREE_LIST: |
6411 | /* For attributes. */ | |
6412 | next = &TREE_VALUE (decl); | |
6413 | break; | |
6414 | ||
652e1a2d | 6415 | case COND_EXPR: |
6416 | ctype = NULL_TREE; | |
6417 | next = &TREE_OPERAND (decl, 0); | |
6418 | break; | |
471086d6 | 6419 | |
8417823c | 6420 | case BIT_NOT_EXPR: /* For C++ destructors! */ |
471086d6 | 6421 | { |
652e1a2d | 6422 | tree name = TREE_OPERAND (decl, 0); |
6423 | tree rename = NULL_TREE; | |
6424 | ||
6425 | my_friendly_assert (flags == NO_SPECIAL, 152); | |
6426 | flags = DTOR_FLAG; | |
bb855ff9 | 6427 | sfk = sfk_destructor; |
0a3b29ad | 6428 | if (TYPE_P (name)) |
e857e9c7 | 6429 | TREE_OPERAND (decl, 0) = name = constructor_name (name); |
652e1a2d | 6430 | my_friendly_assert (TREE_CODE (name) == IDENTIFIER_NODE, 153); |
6431 | if (ctype == NULL_TREE) | |
6432 | { | |
6433 | if (current_class_type == NULL_TREE) | |
6434 | { | |
905d4035 | 6435 | error ("destructors must be member functions"); |
652e1a2d | 6436 | flags = NO_SPECIAL; |
6437 | } | |
6438 | else | |
6439 | { | |
0a3b29ad | 6440 | tree t = constructor_name (current_class_type); |
652e1a2d | 6441 | if (t != name) |
6442 | rename = t; | |
6443 | } | |
6444 | } | |
471086d6 | 6445 | else |
652e1a2d | 6446 | { |
6447 | tree t = constructor_name (ctype); | |
6448 | if (t != name) | |
6449 | rename = t; | |
6450 | } | |
ac9386a0 | 6451 | |
652e1a2d | 6452 | if (rename) |
bc3887cf | 6453 | { |
cf103c6c | 6454 | error ("destructor `%T' must match class name `%T'", |
e857e9c7 | 6455 | name, rename); |
652e1a2d | 6456 | TREE_OPERAND (decl, 0) = rename; |
bc3887cf | 6457 | } |
652e1a2d | 6458 | next = &name; |
ac9386a0 | 6459 | } |
652e1a2d | 6460 | break; |
471086d6 | 6461 | |
652e1a2d | 6462 | case ADDR_EXPR: /* C++ reference declaration */ |
a109dc3b | 6463 | /* Fall through. */ |
652e1a2d | 6464 | case ARRAY_REF: |
6465 | case INDIRECT_REF: | |
6466 | ctype = NULL_TREE; | |
6467 | innermost_code = TREE_CODE (decl); | |
6468 | next = &TREE_OPERAND (decl, 0); | |
6469 | break; | |
471086d6 | 6470 | |
652e1a2d | 6471 | case CALL_EXPR: |
652e1a2d | 6472 | innermost_code = TREE_CODE (decl); |
6473 | if (decl_context == FIELD && ctype == NULL_TREE) | |
6474 | ctype = current_class_type; | |
e178a5a9 | 6475 | if (ctype |
f9670f72 | 6476 | && TREE_OPERAND (decl, 0) |
e178a5a9 | 6477 | && (TREE_CODE (TREE_OPERAND (decl, 0)) == TYPE_DECL |
4c487414 | 6478 | && constructor_name_p (DECL_NAME (TREE_OPERAND (decl, 0)), |
6479 | ctype))) | |
652e1a2d | 6480 | TREE_OPERAND (decl, 0) = constructor_name (ctype); |
6481 | next = &TREE_OPERAND (decl, 0); | |
6482 | decl = *next; | |
6483 | if (ctype != NULL_TREE | |
6484 | && decl != NULL_TREE && flags != DTOR_FLAG | |
0a3b29ad | 6485 | && constructor_name_p (decl, ctype)) |
471086d6 | 6486 | { |
bb855ff9 | 6487 | sfk = sfk_constructor; |
652e1a2d | 6488 | ctor_return_type = ctype; |
471086d6 | 6489 | } |
652e1a2d | 6490 | ctype = NULL_TREE; |
6491 | break; | |
980877d7 | 6492 | |
b1cfe2be | 6493 | case TEMPLATE_ID_EXPR: |
6494 | { | |
6495 | tree fns = TREE_OPERAND (decl, 0); | |
6496 | ||
1eaf178d | 6497 | dname = fns; |
6498 | if (TREE_CODE (dname) == COMPONENT_REF) | |
6499 | dname = TREE_OPERAND (dname, 1); | |
6500 | if (TREE_CODE (dname) != IDENTIFIER_NODE) | |
6501 | { | |
6502 | my_friendly_assert (is_overloaded_fn (dname), | |
6503 | 19990331); | |
6504 | dname = DECL_NAME (get_first_fn (dname)); | |
6505 | } | |
b1cfe2be | 6506 | } |
a109dc3b | 6507 | /* Fall through. */ |
652e1a2d | 6508 | |
6509 | case IDENTIFIER_NODE: | |
b1cfe2be | 6510 | if (TREE_CODE (decl) == IDENTIFIER_NODE) |
6511 | dname = decl; | |
6512 | ||
652e1a2d | 6513 | next = 0; |
6514 | ||
518796ad | 6515 | if (C_IS_RESERVED_WORD (dname)) |
471086d6 | 6516 | { |
cf103c6c | 6517 | error ("declarator-id missing; using reserved word `%D'", |
652e1a2d | 6518 | dname); |
6519 | name = IDENTIFIER_POINTER (dname); | |
471086d6 | 6520 | } |
97cc4539 | 6521 | else if (!IDENTIFIER_TYPENAME_P (dname)) |
652e1a2d | 6522 | name = IDENTIFIER_POINTER (dname); |
471086d6 | 6523 | else |
6524 | { | |
97cc4539 | 6525 | my_friendly_assert (flags == NO_SPECIAL, 154); |
6526 | flags = TYPENAME_FLAG; | |
6527 | ctor_return_type = TREE_TYPE (dname); | |
6528 | sfk = sfk_conversion; | |
df2c7ecb | 6529 | if (is_typename_at_global_scope (dname)) |
97cc4539 | 6530 | name = IDENTIFIER_POINTER (dname); |
6531 | else | |
6532 | name = "<invalid operator>"; | |
471086d6 | 6533 | } |
652e1a2d | 6534 | break; |
471086d6 | 6535 | |
652e1a2d | 6536 | /* C++ extension */ |
6537 | case SCOPE_REF: | |
6538 | { | |
6539 | /* Perform error checking, and decide on a ctype. */ | |
6540 | tree cname = TREE_OPERAND (decl, 0); | |
6541 | if (cname == NULL_TREE) | |
6542 | ctype = NULL_TREE; | |
8417823c | 6543 | else if (TREE_CODE (cname) == NAMESPACE_DECL) |
6544 | { | |
6545 | ctype = NULL_TREE; | |
6546 | in_namespace = TREE_OPERAND (decl, 0); | |
8417823c | 6547 | } |
652e1a2d | 6548 | else if (! is_aggr_type (cname, 1)) |
0a3b29ad | 6549 | ctype = NULL_TREE; |
652e1a2d | 6550 | /* Must test TREE_OPERAND (decl, 1), in case user gives |
6551 | us `typedef (class::memfunc)(int); memfunc *memfuncptr;' */ | |
6552 | else if (TREE_OPERAND (decl, 1) | |
6553 | && TREE_CODE (TREE_OPERAND (decl, 1)) == INDIRECT_REF) | |
6554 | ctype = cname; | |
cd5dd2d8 | 6555 | else if (TREE_CODE (cname) == TEMPLATE_TYPE_PARM |
1e93ca27 | 6556 | || TREE_CODE (cname) == BOUND_TEMPLATE_TEMPLATE_PARM) |
e857e9c7 | 6557 | { |
6debb1d0 | 6558 | /* This might be declaring a member of a template |
6559 | parm to be a friend. */ | |
6560 | ctype = cname; | |
6561 | dependant_name = TREE_OPERAND (decl, 1); | |
e857e9c7 | 6562 | } |
652e1a2d | 6563 | else if (ctype == NULL_TREE) |
6564 | ctype = cname; | |
6565 | else if (TREE_COMPLEXITY (decl) == current_class_depth) | |
0a3b29ad | 6566 | ; |
652e1a2d | 6567 | else |
6568 | { | |
6569 | if (! UNIQUELY_DERIVED_FROM_P (cname, ctype)) | |
6570 | { | |
cf103c6c | 6571 | error ("type `%T' is not derived from type `%T'", |
652e1a2d | 6572 | cname, ctype); |
0a3b29ad | 6573 | ctype = NULL_TREE; |
652e1a2d | 6574 | } |
6575 | else | |
6576 | ctype = cname; | |
6577 | } | |
6578 | ||
0a3b29ad | 6579 | /* It is valid to write: |
6580 | ||
6581 | class C { void f(); }; | |
6582 | typedef C D; | |
6583 | void D::f(); | |
6584 | ||
6585 | The standard is not clear about whether `typedef const C D' is | |
6586 | legal; as of 2002-09-15 the committee is considering | |
6587 | that question. EDG 3.0 allows that syntax. | |
6588 | Therefore, we do as well. */ | |
6589 | if (ctype) | |
6590 | ctype = TYPE_MAIN_VARIANT (ctype); | |
6591 | /* Update the declarator so that when we process it | |
6592 | again the correct type is present. */ | |
6593 | TREE_OPERAND (decl, 0) = ctype; | |
6594 | ||
1e28ccf1 | 6595 | if (ctype && TREE_CODE (TREE_OPERAND (decl, 1)) == TYPE_DECL |
4c487414 | 6596 | && constructor_name_p (DECL_NAME (TREE_OPERAND (decl, 1)), |
6597 | ctype)) | |
652e1a2d | 6598 | TREE_OPERAND (decl, 1) = constructor_name (ctype); |
6599 | next = &TREE_OPERAND (decl, 1); | |
6600 | decl = *next; | |
6601 | if (ctype) | |
6602 | { | |
e8d95fdc | 6603 | tree name = decl; |
6604 | ||
6605 | if (TREE_CODE (name) == BIT_NOT_EXPR) | |
6606 | name = TREE_OPERAND (name, 0); | |
6607 | ||
6608 | if (!constructor_name_p (decl, ctype)) | |
6609 | ; | |
6610 | else if (decl == name) | |
652e1a2d | 6611 | { |
bb855ff9 | 6612 | sfk = sfk_constructor; |
652e1a2d | 6613 | ctor_return_type = ctype; |
6614 | } | |
e8d95fdc | 6615 | else |
652e1a2d | 6616 | { |
bb855ff9 | 6617 | sfk = sfk_destructor; |
652e1a2d | 6618 | ctor_return_type = ctype; |
6619 | flags = DTOR_FLAG; | |
6620 | TREE_OPERAND (decl, 0) = constructor_name (ctype); | |
6621 | next = &TREE_OPERAND (decl, 0); | |
6622 | } | |
6623 | } | |
6624 | } | |
6625 | break; | |
6626 | ||
6627 | case ERROR_MARK: | |
6628 | next = 0; | |
6629 | break; | |
6630 | ||
e178a5a9 | 6631 | case TYPE_DECL: |
6632 | /* Parse error puts this typespec where | |
6633 | a declarator should go. */ | |
cf103c6c | 6634 | error ("`%T' specified as declarator-id", DECL_NAME (decl)); |
e178a5a9 | 6635 | if (TREE_TYPE (decl) == current_class_type) |
cf103c6c | 6636 | error (" perhaps you want `%T' for a constructor", |
e178a5a9 | 6637 | current_class_name); |
6638 | dname = DECL_NAME (decl); | |
6639 | name = IDENTIFIER_POINTER (dname); | |
6640 | ||
96624a9e | 6641 | /* Avoid giving two errors for this. */ |
e178a5a9 | 6642 | IDENTIFIER_CLASS_VALUE (dname) = NULL_TREE; |
6643 | ||
9f6e8c5e | 6644 | declspecs = tree_cons (NULL_TREE, integer_type_node, declspecs); |
e178a5a9 | 6645 | *next = dname; |
6646 | next = 0; | |
6647 | break; | |
6648 | ||
4ac852cb | 6649 | case BASELINK: |
6650 | next = &BASELINK_FUNCTIONS (decl); | |
6651 | break; | |
acb91513 | 6652 | |
6653 | case TEMPLATE_DECL: | |
6654 | /* Sometimes, we see a template-name used as part of a | |
6655 | decl-specifier like in | |
6656 | std::allocator alloc; | |
6657 | Handle that gracefully. */ | |
6658 | error ("invalid use of template-name '%E' in a declarator", decl); | |
6659 | return error_mark_node; | |
6660 | break; | |
4ac852cb | 6661 | |
652e1a2d | 6662 | default: |
7f134624 | 6663 | my_friendly_assert (0, 20020917); |
471086d6 | 6664 | } |
652e1a2d | 6665 | } |
471086d6 | 6666 | } |
6667 | ||
6668 | /* A function definition's declarator must have the form of | |
6669 | a function declarator. */ | |
6670 | ||
6671 | if (funcdef_flag && innermost_code != CALL_EXPR) | |
6672 | return 0; | |
6673 | ||
bcf789d7 | 6674 | if (((dname && IDENTIFIER_OPNAME_P (dname)) || flags == TYPENAME_FLAG) |
6675 | && innermost_code != CALL_EXPR | |
6676 | && ! (ctype && declspecs == NULL_TREE)) | |
6677 | { | |
cf103c6c | 6678 | error ("declaration of `%D' as non-function", dname); |
bcf789d7 | 6679 | return void_type_node; |
6680 | } | |
6681 | ||
471086d6 | 6682 | /* Anything declared one level down from the top level |
6683 | must be one of the parameters of a function | |
6684 | (because the body is at least two levels down). */ | |
6685 | ||
6686 | /* This heuristic cannot be applied to C++ nodes! Fixed, however, | |
6687 | by not allowing C++ class definitions to specify their parameters | |
6688 | with xdecls (must be spec.d in the parmlist). | |
6689 | ||
6690 | Since we now wait to push a class scope until we are sure that | |
6691 | we are in a legitimate method context, we must set oldcname | |
d0622bdf | 6692 | explicitly (since current_class_name is not yet alive). |
6693 | ||
6694 | We also want to avoid calling this a PARM if it is in a namespace. */ | |
471086d6 | 6695 | |
70a658bd | 6696 | if (decl_context == NORMAL && !toplevel_bindings_p ()) |
d0622bdf | 6697 | { |
1f3233d1 | 6698 | struct cp_binding_level *b = current_binding_level; |
fa3834f1 | 6699 | current_binding_level = b->level_chain; |
d0622bdf | 6700 | if (current_binding_level != 0 && toplevel_bindings_p ()) |
6701 | decl_context = PARM; | |
fa3834f1 | 6702 | current_binding_level = b; |
d0622bdf | 6703 | } |
471086d6 | 6704 | |
2a80b8e1 | 6705 | if (name == NULL) |
6706 | name = decl_context == PARM ? "parameter" : "type name"; | |
980877d7 | 6707 | |
471086d6 | 6708 | /* Look through the decl specs and record which ones appear. |
6709 | Some typespecs are defined as built-in typenames. | |
6710 | Others, the ones that are modifiers of other types, | |
6711 | are represented by bits in SPECBITS: set the bits for | |
6712 | the modifiers that appear. Storage class keywords are also in SPECBITS. | |
6713 | ||
6714 | If there is a typedef name or a type, store the type in TYPE. | |
6715 | This includes builtin typedefs such as `int'. | |
6716 | ||
6717 | Set EXPLICIT_INT if the type is `int' or `char' and did not | |
6718 | come from a user typedef. | |
6719 | ||
6720 | Set LONGLONG if `long' is mentioned twice. | |
6721 | ||
6722 | For C++, constructors and destructors have their own fast treatment. */ | |
6723 | ||
6724 | for (spec = declspecs; spec; spec = TREE_CHAIN (spec)) | |
6725 | { | |
cd16867a | 6726 | int i; |
6727 | tree id; | |
471086d6 | 6728 | |
6729 | /* Certain parse errors slip through. For example, | |
6730 | `int class;' is not caught by the parser. Try | |
6731 | weakly to recover here. */ | |
6732 | if (TREE_CODE (spec) != TREE_LIST) | |
6733 | return 0; | |
6734 | ||
6735 | id = TREE_VALUE (spec); | |
6736 | ||
88da234d | 6737 | /* If the entire declaration is itself tagged as deprecated then |
6738 | suppress reports of deprecated items. */ | |
6739 | if (!adding_implicit_members && id && TREE_DEPRECATED (id)) | |
6740 | { | |
6741 | if (deprecated_state != DEPRECATED_SUPPRESS) | |
6742 | warn_deprecated_use (id); | |
6743 | } | |
6744 | ||
471086d6 | 6745 | if (TREE_CODE (id) == IDENTIFIER_NODE) |
6746 | { | |
ad91f3ed | 6747 | if (id == ridpointers[(int) RID_INT] |
6748 | || id == ridpointers[(int) RID_CHAR] | |
6749 | || id == ridpointers[(int) RID_BOOL] | |
6750 | || id == ridpointers[(int) RID_WCHAR]) | |
471086d6 | 6751 | { |
6752 | if (type) | |
1a3f833b | 6753 | { |
6754 | if (id == ridpointers[(int) RID_BOOL]) | |
905d4035 | 6755 | error ("`bool' is now a keyword"); |
1a3f833b | 6756 | else |
cf103c6c | 6757 | error ("extraneous `%T' ignored", id); |
1a3f833b | 6758 | } |
471086d6 | 6759 | else |
6760 | { | |
ad91f3ed | 6761 | if (id == ridpointers[(int) RID_INT]) |
6762 | explicit_int = 1; | |
6763 | else if (id == ridpointers[(int) RID_CHAR]) | |
6764 | explicit_char = 1; | |
471086d6 | 6765 | type = TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (id)); |
6766 | } | |
6767 | goto found; | |
6768 | } | |
96624a9e | 6769 | /* C++ aggregate types. */ |
471086d6 | 6770 | if (IDENTIFIER_HAS_TYPE_VALUE (id)) |
6771 | { | |
6772 | if (type) | |
cf103c6c | 6773 | error ("multiple declarations `%T' and `%T'", type, id); |
471086d6 | 6774 | else |
6775 | type = IDENTIFIER_TYPE_VALUE (id); | |
6776 | goto found; | |
6777 | } | |
6778 | ||
c38086bd | 6779 | for (i = (int) RID_FIRST_MODIFIER; i <= (int) RID_LAST_MODIFIER; i++) |
471086d6 | 6780 | { |
6781 | if (ridpointers[i] == id) | |
6782 | { | |
6783 | if (i == (int) RID_LONG && RIDBIT_SETP (i, specbits)) | |
6784 | { | |
89c1adad | 6785 | if (pedantic && ! in_system_header && warn_long_long) |
76afd7f0 | 6786 | pedwarn ("ISO C++ does not support `long long'"); |
38281c46 | 6787 | if (longlong) |
905d4035 | 6788 | error ("`long long long' is too long for GCC"); |
471086d6 | 6789 | else |
6790 | longlong = 1; | |
6791 | } | |
6792 | else if (RIDBIT_SETP (i, specbits)) | |
286daa79 | 6793 | pedwarn ("duplicate `%E'", id); |
e396cd54 | 6794 | |
a7acd1c6 | 6795 | /* Diagnose "__thread extern" or "__thread static". */ |
6796 | if (RIDBIT_SETP (RID_THREAD, specbits)) | |
e396cd54 | 6797 | { |
a7acd1c6 | 6798 | if (i == (int)RID_EXTERN) |
e396cd54 | 6799 | error ("`__thread' before `extern'"); |
a7acd1c6 | 6800 | else if (i == (int)RID_STATIC) |
e396cd54 | 6801 | error ("`__thread' before `static'"); |
6802 | } | |
6803 | ||
179d1a03 | 6804 | if (i == (int)RID_EXTERN |
6805 | && TREE_PURPOSE (spec) == error_mark_node) | |
6806 | /* This extern was part of a language linkage. */ | |
6807 | extern_langp = 1; | |
e396cd54 | 6808 | |
471086d6 | 6809 | RIDBIT_SET (i, specbits); |
6810 | goto found; | |
6811 | } | |
6812 | } | |
6813 | } | |
6d2b611f | 6814 | else if (TREE_CODE (id) == TYPE_DECL) |
e178a5a9 | 6815 | { |
6816 | if (type) | |
cf103c6c | 6817 | error ("multiple declarations `%T' and `%T'", type, |
e178a5a9 | 6818 | TREE_TYPE (id)); |
6819 | else | |
e857e9c7 | 6820 | { |
6821 | type = TREE_TYPE (id); | |
6822 | TREE_VALUE (spec) = type; | |
47fd99f9 | 6823 | typedef_decl = id; |
e857e9c7 | 6824 | } |
e178a5a9 | 6825 | goto found; |
6826 | } | |
471086d6 | 6827 | if (type) |
905d4035 | 6828 | error ("two or more data types in declaration of `%s'", name); |
471086d6 | 6829 | else if (TREE_CODE (id) == IDENTIFIER_NODE) |
6830 | { | |
cd16867a | 6831 | tree t = lookup_name (id, 1); |
471086d6 | 6832 | if (!t || TREE_CODE (t) != TYPE_DECL) |
286daa79 | 6833 | error ("`%E' fails to be a typedef or built in type", id); |
471086d6 | 6834 | else |
6835 | { | |
6836 | type = TREE_TYPE (t); | |
6837 | typedef_decl = t; | |
6838 | } | |
6839 | } | |
b465397d | 6840 | else if (id != error_mark_node) |
471086d6 | 6841 | /* Can't change CLASS nodes into RECORD nodes here! */ |
6842 | type = id; | |
6843 | ||
6844 | found: ; | |
6845 | } | |
6846 | ||
47fd99f9 | 6847 | #if 0 |
6848 | /* See the code below that used this. */ | |
6849 | if (typedef_decl) | |
6850 | decl_attr = DECL_ATTRIBUTES (typedef_decl); | |
6851 | #endif | |
471086d6 | 6852 | typedef_type = type; |
6853 | ||
c4a8ac95 | 6854 | /* No type at all: default to `int', and set DEFAULTED_INT |
771665d8 | 6855 | because it was not a user-defined typedef. */ |
471086d6 | 6856 | |
ad91f3ed | 6857 | if (type == NULL_TREE |
6858 | && (RIDBIT_SETP (RID_SIGNED, specbits) | |
6859 | || RIDBIT_SETP (RID_UNSIGNED, specbits) | |
6860 | || RIDBIT_SETP (RID_LONG, specbits) | |
6861 | || RIDBIT_SETP (RID_SHORT, specbits))) | |
6862 | { | |
6863 | /* These imply 'int'. */ | |
6864 | type = integer_type_node; | |
c4a8ac95 | 6865 | defaulted_int = 1; |
ad91f3ed | 6866 | } |
6867 | ||
bb855ff9 | 6868 | if (sfk != sfk_none) |
6869 | type = check_special_function_return_type (sfk, type, | |
bb855ff9 | 6870 | ctor_return_type); |
6871 | else if (type == NULL_TREE) | |
471086d6 | 6872 | { |
bb855ff9 | 6873 | int is_main; |
6874 | ||
471086d6 | 6875 | explicit_int = -1; |
bb855ff9 | 6876 | |
fccd46be | 6877 | /* We handle `main' specially here, because 'main () { }' is so |
6878 | common. With no options, it is allowed. With -Wreturn-type, | |
6879 | it is a warning. It is only an error with -pedantic-errors. */ | |
bb855ff9 | 6880 | is_main = (funcdef_flag |
6cd31fa5 | 6881 | && dname && MAIN_NAME_P (dname) |
bb855ff9 | 6882 | && ctype == NULL_TREE |
6883 | && in_namespace == NULL_TREE | |
6884 | && current_namespace == global_namespace); | |
6885 | ||
6886 | if (in_system_header || flag_ms_extensions) | |
6887 | /* Allow it, sigh. */; | |
6888 | else if (pedantic || ! is_main) | |
cf103c6c | 6889 | pedwarn ("ISO C++ forbids declaration of `%s' with no type", |
bb855ff9 | 6890 | name); |
6891 | else if (warn_return_type) | |
cf103c6c | 6892 | warning ("ISO C++ forbids declaration of `%s' with no type", |
bb855ff9 | 6893 | name); |
262108c9 | 6894 | |
bb855ff9 | 6895 | type = integer_type_node; |
ac9386a0 | 6896 | } |
57a9b138 | 6897 | |
471086d6 | 6898 | ctype = NULL_TREE; |
6899 | ||
6900 | /* Now process the modifiers that were specified | |
6901 | and check for invalid combinations. */ | |
6902 | ||
6903 | /* Long double is a special combination. */ | |
6904 | ||
6905 | if (RIDBIT_SETP (RID_LONG, specbits) | |
6906 | && TYPE_MAIN_VARIANT (type) == double_type_node) | |
6907 | { | |
6908 | RIDBIT_RESET (RID_LONG, specbits); | |
980877d7 | 6909 | type = build_qualified_type (long_double_type_node, |
3119c950 | 6910 | cp_type_quals (type)); |
471086d6 | 6911 | } |
6912 | ||
6913 | /* Check all other uses of type modifiers. */ | |
6914 | ||
6915 | if (RIDBIT_SETP (RID_UNSIGNED, specbits) | |
6916 | || RIDBIT_SETP (RID_SIGNED, specbits) | |
6917 | || RIDBIT_SETP (RID_LONG, specbits) | |
6918 | || RIDBIT_SETP (RID_SHORT, specbits)) | |
6919 | { | |
6920 | int ok = 0; | |
6921 | ||
6922 | if (TREE_CODE (type) == REAL_TYPE) | |
905d4035 | 6923 | error ("short, signed or unsigned invalid for `%s'", name); |
1e66592c | 6924 | else if (TREE_CODE (type) != INTEGER_TYPE) |
905d4035 | 6925 | error ("long, short, signed or unsigned invalid for `%s'", name); |
471086d6 | 6926 | else if (RIDBIT_SETP (RID_LONG, specbits) |
6927 | && RIDBIT_SETP (RID_SHORT, specbits)) | |
905d4035 | 6928 | error ("long and short specified together for `%s'", name); |
471086d6 | 6929 | else if ((RIDBIT_SETP (RID_LONG, specbits) |
6930 | || RIDBIT_SETP (RID_SHORT, specbits)) | |
6931 | && explicit_char) | |
905d4035 | 6932 | error ("long or short specified with char for `%s'", name); |
471086d6 | 6933 | else if ((RIDBIT_SETP (RID_LONG, specbits) |
6934 | || RIDBIT_SETP (RID_SHORT, specbits)) | |
6935 | && TREE_CODE (type) == REAL_TYPE) | |
905d4035 | 6936 | error ("long or short specified with floating type for `%s'", name); |
471086d6 | 6937 | else if (RIDBIT_SETP (RID_SIGNED, specbits) |
6938 | && RIDBIT_SETP (RID_UNSIGNED, specbits)) | |
905d4035 | 6939 | error ("signed and unsigned given together for `%s'", name); |
471086d6 | 6940 | else |
6941 | { | |
6942 | ok = 1; | |
c4a8ac95 | 6943 | if (!explicit_int && !defaulted_int && !explicit_char && pedantic) |
471086d6 | 6944 | { |
905d4035 | 6945 | pedwarn ("long, short, signed or unsigned used invalidly for `%s'", |
471086d6 | 6946 | name); |
6947 | if (flag_pedantic_errors) | |
6948 | ok = 0; | |
6949 | } | |
6950 | } | |
6951 | ||
6952 | /* Discard the type modifiers if they are invalid. */ | |
6953 | if (! ok) | |
6954 | { | |
6955 | RIDBIT_RESET (RID_UNSIGNED, specbits); | |
6956 | RIDBIT_RESET (RID_SIGNED, specbits); | |
6957 | RIDBIT_RESET (RID_LONG, specbits); | |
6958 | RIDBIT_RESET (RID_SHORT, specbits); | |
6959 | longlong = 0; | |
6960 | } | |
6961 | } | |
6962 | ||
c4a8ac95 | 6963 | if (RIDBIT_SETP (RID_COMPLEX, specbits) |
6964 | && TREE_CODE (type) != INTEGER_TYPE && TREE_CODE (type) != REAL_TYPE) | |
6965 | { | |
905d4035 | 6966 | error ("complex invalid for `%s'", name); |
c4a8ac95 | 6967 | RIDBIT_RESET (RID_COMPLEX, specbits); |
6968 | } | |
6969 | ||
471086d6 | 6970 | /* Decide whether an integer type is signed or not. |
6971 | Optionally treat bitfields as signed by default. */ | |
6972 | if (RIDBIT_SETP (RID_UNSIGNED, specbits) | |
3498bcb9 | 6973 | /* [class.bit] |
6974 | ||
6975 | It is implementation-defined whether a plain (neither | |
6976 | explicitly signed or unsigned) char, short, int, or long | |
6977 | bit-field is signed or unsigned. | |
980877d7 | 6978 | |
3498bcb9 | 6979 | Naturally, we extend this to long long as well. Note that |
6980 | this does not include wchar_t. */ | |
6981 | || (bitfield && !flag_signed_bitfields | |
6982 | && RIDBIT_NOTSETP (RID_SIGNED, specbits) | |
6983 | /* A typedef for plain `int' without `signed' can be | |
6984 | controlled just like plain `int', but a typedef for | |
6985 | `signed int' cannot be so controlled. */ | |
980877d7 | 6986 | && !(typedef_decl |
b981ae4a | 6987 | && C_TYPEDEF_EXPLICITLY_SIGNED (typedef_decl)) |
3498bcb9 | 6988 | && (TREE_CODE (type) == INTEGER_TYPE |
6989 | || TREE_CODE (type) == CHAR_TYPE) | |
b981ae4a | 6990 | && !same_type_p (TYPE_MAIN_VARIANT (type), wchar_type_node))) |
471086d6 | 6991 | { |
6992 | if (longlong) | |
6993 | type = long_long_unsigned_type_node; | |
6994 | else if (RIDBIT_SETP (RID_LONG, specbits)) | |
6995 | type = long_unsigned_type_node; | |
6996 | else if (RIDBIT_SETP (RID_SHORT, specbits)) | |
6997 | type = short_unsigned_type_node; | |
6998 | else if (type == char_type_node) | |
6999 | type = unsigned_char_type_node; | |
7000 | else if (typedef_decl) | |
4070745f | 7001 | type = c_common_unsigned_type (type); |
471086d6 | 7002 | else |
7003 | type = unsigned_type_node; | |
7004 | } | |
7005 | else if (RIDBIT_SETP (RID_SIGNED, specbits) | |
7006 | && type == char_type_node) | |
7007 | type = signed_char_type_node; | |
7008 | else if (longlong) | |
7009 | type = long_long_integer_type_node; | |
7010 | else if (RIDBIT_SETP (RID_LONG, specbits)) | |
7011 | type = long_integer_type_node; | |
7012 | else if (RIDBIT_SETP (RID_SHORT, specbits)) | |
7013 | type = short_integer_type_node; | |
7014 | ||
c4a8ac95 | 7015 | if (RIDBIT_SETP (RID_COMPLEX, specbits)) |
7016 | { | |
7017 | /* If we just have "complex", it is equivalent to | |
7018 | "complex double", but if any modifiers at all are specified it is | |
7019 | the complex form of TYPE. E.g, "complex short" is | |
7020 | "complex short int". */ | |
7021 | ||
7022 | if (defaulted_int && ! longlong | |
7023 | && ! (RIDBIT_SETP (RID_LONG, specbits) | |
7024 | || RIDBIT_SETP (RID_SHORT, specbits) | |
7025 | || RIDBIT_SETP (RID_SIGNED, specbits) | |
7026 | || RIDBIT_SETP (RID_UNSIGNED, specbits))) | |
7027 | type = complex_double_type_node; | |
7028 | else if (type == integer_type_node) | |
7029 | type = complex_integer_type_node; | |
7030 | else if (type == float_type_node) | |
7031 | type = complex_float_type_node; | |
7032 | else if (type == double_type_node) | |
7033 | type = complex_double_type_node; | |
7034 | else if (type == long_double_type_node) | |
7035 | type = complex_long_double_type_node; | |
7036 | else | |
7037 | type = build_complex_type (type); | |
7038 | } | |
7039 | ||
9edbac04 | 7040 | type_quals = TYPE_UNQUALIFIED; |
7041 | if (RIDBIT_SETP (RID_CONST, specbits)) | |
7042 | type_quals |= TYPE_QUAL_CONST; | |
7043 | if (RIDBIT_SETP (RID_VOLATILE, specbits)) | |
7044 | type_quals |= TYPE_QUAL_VOLATILE; | |
7045 | if (RIDBIT_SETP (RID_RESTRICT, specbits)) | |
7046 | type_quals |= TYPE_QUAL_RESTRICT; | |
7047 | if (sfk == sfk_conversion && type_quals != TYPE_UNQUALIFIED) | |
cf103c6c | 7048 | error ("qualifiers are not allowed on declaration of `operator %T'", |
1ca935fd | 7049 | ctor_return_type); |
7050 | ||
9edbac04 | 7051 | type_quals |= cp_type_quals (type); |
7052 | type = cp_build_qualified_type_real | |
7053 | (type, type_quals, ((typedef_decl && !DECL_ARTIFICIAL (typedef_decl) | |
7054 | ? tf_ignore_bad_quals : 0) | tf_error | tf_warning)); | |
7055 | /* We might have ignored or rejected some of the qualifiers. */ | |
7056 | type_quals = cp_type_quals (type); | |
7057 | ||
471086d6 | 7058 | staticp = 0; |
7059 | inlinep = !! RIDBIT_SETP (RID_INLINE, specbits); | |
9ae4175e | 7060 | virtualp = !! RIDBIT_SETP (RID_VIRTUAL, specbits); |
c25194fd | 7061 | RIDBIT_RESET (RID_VIRTUAL, specbits); |
9ae4175e | 7062 | explicitp = !! RIDBIT_SETP (RID_EXPLICIT, specbits); |
c25194fd | 7063 | RIDBIT_RESET (RID_EXPLICIT, specbits); |
471086d6 | 7064 | |
471086d6 | 7065 | if (RIDBIT_SETP (RID_STATIC, specbits)) |
7066 | staticp = 1 + (decl_context == FIELD); | |
7067 | ||
7068 | if (virtualp && staticp == 2) | |
7069 | { | |
cf103c6c | 7070 | error ("member `%D' cannot be declared both virtual and static", |
471086d6 | 7071 | dname); |
7072 | staticp = 0; | |
7073 | } | |
9ae4175e | 7074 | friendp = !! RIDBIT_SETP (RID_FRIEND, specbits); |
471086d6 | 7075 | RIDBIT_RESET (RID_FRIEND, specbits); |
7076 | ||
6debb1d0 | 7077 | if (dependant_name && !friendp) |
7078 | { | |
7079 | error ("`%T::%D' is not a valid declarator", ctype, dependant_name); | |
7080 | return void_type_node; | |
7081 | } | |
7082 | ||
471086d6 | 7083 | /* Warn if two storage classes are given. Default to `auto'. */ |
7084 | ||
7085 | if (RIDBIT_ANY_SET (specbits)) | |
7086 | { | |
7087 | if (RIDBIT_SETP (RID_STATIC, specbits)) nclasses++; | |
179d1a03 | 7088 | if (RIDBIT_SETP (RID_EXTERN, specbits) && !extern_langp) nclasses++; |
e396cd54 | 7089 | if (RIDBIT_SETP (RID_THREAD, specbits)) nclasses++; |
471086d6 | 7090 | if (decl_context == PARM && nclasses > 0) |
905d4035 | 7091 | error ("storage class specifiers invalid in parameter declarations"); |
471086d6 | 7092 | if (RIDBIT_SETP (RID_TYPEDEF, specbits)) |
7093 | { | |
7094 | if (decl_context == PARM) | |
905d4035 | 7095 | error ("typedef declaration invalid in parameter declaration"); |
471086d6 | 7096 | nclasses++; |
7097 | } | |
7098 | if (RIDBIT_SETP (RID_AUTO, specbits)) nclasses++; | |
7099 | if (RIDBIT_SETP (RID_REGISTER, specbits)) nclasses++; | |
179d1a03 | 7100 | if (!nclasses && !friendp && extern_langp) |
7101 | nclasses++; | |
471086d6 | 7102 | } |
7103 | ||
7104 | /* Give error if `virtual' is used outside of class declaration. */ | |
1e66592c | 7105 | if (virtualp |
7106 | && (current_class_name == NULL_TREE || decl_context != FIELD)) | |
471086d6 | 7107 | { |
905d4035 | 7108 | error ("virtual outside class declaration"); |
471086d6 | 7109 | virtualp = 0; |
7110 | } | |
471086d6 | 7111 | |
7112 | /* Static anonymous unions are dealt with here. */ | |
7113 | if (staticp && decl_context == TYPENAME | |
7114 | && TREE_CODE (declspecs) == TREE_LIST | |
128e1d72 | 7115 | && ANON_AGGR_TYPE_P (TREE_VALUE (declspecs))) |
471086d6 | 7116 | decl_context = FIELD; |
7117 | ||
471086d6 | 7118 | /* Warn about storage classes that are invalid for certain |
7119 | kinds of declarations (parameters, typenames, etc.). */ | |
7120 | ||
e396cd54 | 7121 | /* "static __thread" and "extern __thread" are allowed. */ |
7122 | if (nclasses == 2 | |
7123 | && RIDBIT_SETP (RID_THREAD, specbits) | |
7124 | && (RIDBIT_SETP (RID_EXTERN, specbits) | |
7125 | || RIDBIT_SETP (RID_STATIC, specbits))) | |
7126 | nclasses = 1; | |
7127 | ||
471086d6 | 7128 | if (nclasses > 1) |
905d4035 | 7129 | error ("multiple storage classes in declaration of `%s'", name); |
471086d6 | 7130 | else if (decl_context != NORMAL && nclasses > 0) |
7131 | { | |
c25194fd | 7132 | if ((decl_context == PARM || decl_context == CATCHPARM) |
471086d6 | 7133 | && (RIDBIT_SETP (RID_REGISTER, specbits) |
7134 | || RIDBIT_SETP (RID_AUTO, specbits))) | |
7135 | ; | |
d2a15a12 | 7136 | else if (RIDBIT_SETP (RID_TYPEDEF, specbits)) |
7137 | ; | |
471086d6 | 7138 | else if (decl_context == FIELD |
331bc0ad | 7139 | /* C++ allows static class elements. */ |
20c01ba9 | 7140 | && RIDBIT_SETP (RID_STATIC, specbits)) |
7141 | /* C++ also allows inlines and signed and unsigned elements, | |
7142 | but in those cases we don't come in here. */ | |
471086d6 | 7143 | ; |
7144 | else | |
7145 | { | |
7146 | if (decl_context == FIELD) | |
7147 | { | |
1e66592c | 7148 | tree tmp = NULL_TREE; |
cd16867a | 7149 | int op = 0; |
1e66592c | 7150 | |
7151 | if (declarator) | |
7152 | { | |
980877d7 | 7153 | /* Avoid trying to get an operand off an identifier node. */ |
63b1d638 | 7154 | if (TREE_CODE (declarator) == IDENTIFIER_NODE) |
7155 | tmp = declarator; | |
7156 | else | |
7157 | tmp = TREE_OPERAND (declarator, 0); | |
1e66592c | 7158 | op = IDENTIFIER_OPNAME_P (tmp); |
97cc4539 | 7159 | if (IDENTIFIER_TYPENAME_P (tmp)) |
7160 | { | |
df2c7ecb | 7161 | if (is_typename_at_global_scope (tmp)) |
97cc4539 | 7162 | name = IDENTIFIER_POINTER (tmp); |
7163 | else | |
7164 | name = "<invalid operator>"; | |
7165 | } | |
1e66592c | 7166 | } |
905d4035 | 7167 | error ("storage class specified for %s `%s'", |
771665d8 | 7168 | op ? "member operator" : "field", |
97cc4539 | 7169 | name); |
471086d6 | 7170 | } |
7171 | else | |
5212eb00 | 7172 | { |
7173 | if (decl_context == PARM || decl_context == CATCHPARM) | |
7174 | error ("storage class specified for parameter `%s'", name); | |
7175 | else | |
7176 | error ("storage class specified for typename"); | |
7177 | } | |
471086d6 | 7178 | RIDBIT_RESET (RID_REGISTER, specbits); |
7179 | RIDBIT_RESET (RID_AUTO, specbits); | |
7180 | RIDBIT_RESET (RID_EXTERN, specbits); | |
e396cd54 | 7181 | RIDBIT_RESET (RID_THREAD, specbits); |
471086d6 | 7182 | } |
7183 | } | |
7184 | else if (RIDBIT_SETP (RID_EXTERN, specbits) && initialized && !funcdef_flag) | |
7185 | { | |
d0622bdf | 7186 | if (toplevel_bindings_p ()) |
471086d6 | 7187 | { |
3748625f | 7188 | /* It's common practice (and completely valid) to have a const |
471086d6 | 7189 | be initialized and declared extern. */ |
0cb64d99 | 7190 | if (!(type_quals & TYPE_QUAL_CONST)) |
905d4035 | 7191 | warning ("`%s' initialized and declared `extern'", name); |
471086d6 | 7192 | } |
7193 | else | |
905d4035 | 7194 | error ("`%s' has both `extern' and initializer", name); |
471086d6 | 7195 | } |
7196 | else if (RIDBIT_SETP (RID_EXTERN, specbits) && funcdef_flag | |
d0622bdf | 7197 | && ! toplevel_bindings_p ()) |
905d4035 | 7198 | error ("nested function `%s' declared `extern'", name); |
d0622bdf | 7199 | else if (toplevel_bindings_p ()) |
471086d6 | 7200 | { |
7201 | if (RIDBIT_SETP (RID_AUTO, specbits)) | |
905d4035 | 7202 | error ("top-level declaration of `%s' specifies `auto'", name); |
471086d6 | 7203 | } |
e396cd54 | 7204 | else if (RIDBIT_SETP (RID_THREAD, specbits) |
7205 | && !RIDBIT_SETP (RID_EXTERN, specbits) | |
7206 | && !RIDBIT_SETP (RID_STATIC, specbits)) | |
7207 | { | |
7208 | error ("function-scope `%s' implicitly auto and declared `__thread'", | |
7209 | name); | |
7210 | RIDBIT_RESET (RID_THREAD, specbits); | |
7211 | } | |
471086d6 | 7212 | |
4742975e | 7213 | if (nclasses > 0 && friendp) |
905d4035 | 7214 | error ("storage class specifiers invalid in friend function declarations"); |
4742975e | 7215 | |
0a3b29ad | 7216 | scope = get_scope_of_declarator (declarator); |
7217 | ||
471086d6 | 7218 | /* Now figure out the structure of the declarator proper. |
7219 | Descend through it, creating more complex types, until we reach | |
3645386f | 7220 | the declared identifier (or NULL_TREE, in an abstract declarator). */ |
471086d6 | 7221 | |
b1cfe2be | 7222 | while (declarator && TREE_CODE (declarator) != IDENTIFIER_NODE |
7223 | && TREE_CODE (declarator) != TEMPLATE_ID_EXPR) | |
471086d6 | 7224 | { |
7225 | /* Each level of DECLARATOR is either an ARRAY_REF (for ...[..]), | |
7226 | an INDIRECT_REF (for *...), | |
7227 | a CALL_EXPR (for ...(...)), | |
7228 | an identifier (for the name being declared) | |
7229 | or a null pointer (for the place in an absolute declarator | |
7230 | where the name was omitted). | |
7231 | For the last two cases, we have just exited the loop. | |
7232 | ||
7233 | For C++ it could also be | |
7234 | a SCOPE_REF (for class :: ...). In this case, we have converted | |
7235 | sensible names to types, and those are the values we use to | |
7236 | qualify the member name. | |
7237 | an ADDR_EXPR (for &...), | |
7238 | a BIT_NOT_EXPR (for destructors) | |
471086d6 | 7239 | |
7240 | At this point, TYPE is the type of elements of an array, | |
7241 | or for a function to return, or for a pointer to point to. | |
7242 | After this sequence of ifs, TYPE is the type of the | |
7243 | array or function or pointer, and DECLARATOR has had its | |
7244 | outermost layer removed. */ | |
7245 | ||
b465397d | 7246 | if (type == error_mark_node) |
471086d6 | 7247 | { |
6d01d568 | 7248 | if (declarator == error_mark_node) |
7249 | return error_mark_node; | |
7250 | else if (TREE_CODE (declarator) == SCOPE_REF) | |
471086d6 | 7251 | declarator = TREE_OPERAND (declarator, 1); |
7252 | else | |
7253 | declarator = TREE_OPERAND (declarator, 0); | |
7254 | continue; | |
7255 | } | |
7256 | if (quals != NULL_TREE | |
7257 | && (declarator == NULL_TREE | |
7258 | || TREE_CODE (declarator) != SCOPE_REF)) | |
7259 | { | |
7260 | if (ctype == NULL_TREE && TREE_CODE (type) == METHOD_TYPE) | |
7261 | ctype = TYPE_METHOD_BASETYPE (type); | |
7262 | if (ctype != NULL_TREE) | |
7263 | { | |
471086d6 | 7264 | tree dummy = build_decl (TYPE_DECL, NULL_TREE, type); |
6795ece9 | 7265 | grok_method_quals (ctype, dummy, quals); |
471086d6 | 7266 | type = TREE_TYPE (dummy); |
7267 | quals = NULL_TREE; | |
7268 | } | |
7269 | } | |
57e7b4d8 | 7270 | |
471086d6 | 7271 | switch (TREE_CODE (declarator)) |
7272 | { | |
222b8af3 | 7273 | case TREE_LIST: |
7274 | { | |
7275 | /* We encode a declarator with embedded attributes using | |
e3c541f0 | 7276 | a TREE_LIST. */ |
7277 | tree attrs = TREE_PURPOSE (declarator); | |
7278 | tree inner_decl; | |
7469e185 | 7279 | int attr_flags; |
7280 | ||
222b8af3 | 7281 | declarator = TREE_VALUE (declarator); |
e3c541f0 | 7282 | inner_decl = declarator; |
7283 | while (inner_decl != NULL_TREE | |
7284 | && TREE_CODE (inner_decl) == TREE_LIST) | |
7285 | inner_decl = TREE_VALUE (inner_decl); | |
7469e185 | 7286 | attr_flags = 0; |
e3c541f0 | 7287 | if (inner_decl == NULL_TREE |
7288 | || TREE_CODE (inner_decl) == IDENTIFIER_NODE) | |
7289 | attr_flags |= (int) ATTR_FLAG_DECL_NEXT; | |
7290 | if (TREE_CODE (inner_decl) == CALL_EXPR) | |
7291 | attr_flags |= (int) ATTR_FLAG_FUNCTION_NEXT; | |
7292 | if (TREE_CODE (inner_decl) == ARRAY_REF) | |
7293 | attr_flags |= (int) ATTR_FLAG_ARRAY_NEXT; | |
7294 | returned_attrs = decl_attributes (&type, | |
7295 | chainon (returned_attrs, attrs), | |
7296 | attr_flags); | |
222b8af3 | 7297 | } |
7298 | break; | |
7299 | ||
471086d6 | 7300 | case ARRAY_REF: |
7301 | { | |
30bedc1f | 7302 | tree size = TREE_OPERAND (declarator, 1); |
68ea5a1d | 7303 | declarator = TREE_OPERAND (declarator, 0); |
471086d6 | 7304 | |
b1e0749b | 7305 | type = create_array_type_for_decl (dname, type, size); |
faa4e1f1 | 7306 | |
4ee9c684 | 7307 | if (declarator |
7308 | && (TREE_CODE (declarator) == INDIRECT_REF | |
7309 | || TREE_CODE (declarator) == ADDR_EXPR)) | |
7310 | /* We can never complete an array type which is the target of a | |
7311 | pointer, so go ahead and lay it out. */ | |
7312 | layout_type (type); | |
7313 | ||
471086d6 | 7314 | ctype = NULL_TREE; |
7315 | } | |
7316 | break; | |
7317 | ||
7318 | case CALL_EXPR: | |
7319 | { | |
7320 | tree arg_types; | |
c38086bd | 7321 | int funcdecl_p; |
f27113ad | 7322 | tree inner_parms = CALL_DECLARATOR_PARMS (declarator); |
c38086bd | 7323 | tree inner_decl = TREE_OPERAND (declarator, 0); |
471086d6 | 7324 | |
7325 | /* Declaring a function type. | |
7326 | Make sure we have a valid type for the function to return. */ | |
471086d6 | 7327 | |
3e04bd45 | 7328 | /* We now know that the TYPE_QUALS don't apply to the |
77b7e009 | 7329 | decl, but to its return type. */ |
3e04bd45 | 7330 | type_quals = TYPE_UNQUALIFIED; |
471086d6 | 7331 | |
7332 | /* Warn about some types functions can't return. */ | |
7333 | ||
7334 | if (TREE_CODE (type) == FUNCTION_TYPE) | |
7335 | { | |
905d4035 | 7336 | error ("`%s' declared as function returning a function", name); |
471086d6 | 7337 | type = integer_type_node; |
7338 | } | |
7339 | if (TREE_CODE (type) == ARRAY_TYPE) | |
7340 | { | |
905d4035 | 7341 | error ("`%s' declared as function returning an array", name); |
471086d6 | 7342 | type = integer_type_node; |
7343 | } | |
7344 | ||
c38086bd | 7345 | if (inner_decl && TREE_CODE (inner_decl) == SCOPE_REF) |
7346 | inner_decl = TREE_OPERAND (inner_decl, 1); | |
7347 | ||
980877d7 | 7348 | if (inner_decl && TREE_CODE (inner_decl) == TEMPLATE_ID_EXPR) |
b1cfe2be | 7349 | inner_decl = dname; |
7350 | ||
1e66592c | 7351 | /* Pick up type qualifiers which should be applied to `this'. */ |
f27113ad | 7352 | quals = CALL_DECLARATOR_QUALS (declarator); |
1e66592c | 7353 | |
f9670f72 | 7354 | /* Pick up the exception specifications. */ |
f27113ad | 7355 | raises = CALL_DECLARATOR_EXCEPTION_SPEC (declarator); |
f9670f72 | 7356 | |
c38086bd | 7357 | /* Say it's a definition only for the CALL_EXPR |
7358 | closest to the identifier. */ | |
9e16e695 | 7359 | funcdecl_p |
980877d7 | 7360 | = inner_decl |
b1cfe2be | 7361 | && (TREE_CODE (inner_decl) == IDENTIFIER_NODE |
980877d7 | 7362 | || TREE_CODE (inner_decl) == TEMPLATE_ID_EXPR |
b1cfe2be | 7363 | || TREE_CODE (inner_decl) == BIT_NOT_EXPR); |
980877d7 | 7364 | |
471086d6 | 7365 | if (ctype == NULL_TREE |
7366 | && decl_context == FIELD | |
c38086bd | 7367 | && funcdecl_p |
471086d6 | 7368 | && (friendp == 0 || dname == current_class_name)) |
7369 | ctype = current_class_type; | |
7370 | ||
bb855ff9 | 7371 | if (ctype && sfk == sfk_conversion) |
471086d6 | 7372 | TYPE_HAS_CONVERSION (ctype) = 1; |
0a3b29ad | 7373 | if (ctype && constructor_name_p (dname, ctype)) |
471086d6 | 7374 | { |
7375 | /* We are within a class's scope. If our declarator name | |
7376 | is the same as the class name, and we are defining | |
7377 | a function, then it is a constructor/destructor, and | |
7378 | therefore returns a void type. */ | |
7379 | ||
7380 | if (flags == DTOR_FLAG) | |
7381 | { | |
657c76e1 | 7382 | /* ISO C++ 12.4/2. A destructor may not be |
7383 | declared const or volatile. A destructor may | |
7384 | not be static. */ | |
471086d6 | 7385 | if (staticp == 2) |
905d4035 | 7386 | error ("destructor cannot be static member function"); |
1e66592c | 7387 | if (quals) |
471086d6 | 7388 | { |
286daa79 | 7389 | error ("destructors may not be `%E'", |
7390 | TREE_VALUE (quals)); | |
9989bb55 | 7391 | quals = NULL_TREE; |
471086d6 | 7392 | } |
7393 | if (decl_context == FIELD) | |
7394 | { | |
017fafd4 | 7395 | if (! member_function_or_else (ctype, |
7396 | current_class_type, | |
7397 | flags)) | |
471086d6 | 7398 | return void_type_node; |
7399 | } | |
7400 | } | |
8417823c | 7401 | else /* It's a constructor. */ |
471086d6 | 7402 | { |
c25194fd | 7403 | if (explicitp == 1) |
7404 | explicitp = 2; | |
657c76e1 | 7405 | /* ISO C++ 12.1. A constructor may not be |
7406 | declared const or volatile. A constructor may | |
7407 | not be virtual. A constructor may not be | |
7408 | static. */ | |
471086d6 | 7409 | if (staticp == 2) |
905d4035 | 7410 | error ("constructor cannot be static member function"); |
471086d6 | 7411 | if (virtualp) |
7412 | { | |
905d4035 | 7413 | pedwarn ("constructors cannot be declared virtual"); |
471086d6 | 7414 | virtualp = 0; |
7415 | } | |
1e66592c | 7416 | if (quals) |
471086d6 | 7417 | { |
286daa79 | 7418 | error ("constructors may not be `%E'", |
7419 | TREE_VALUE (quals)); | |
9989bb55 | 7420 | quals = NULL_TREE; |
20c01ba9 | 7421 | } |
471086d6 | 7422 | { |
ac9386a0 | 7423 | RID_BIT_TYPE tmp_bits; |
b1b63592 | 7424 | memcpy (&tmp_bits, &specbits, sizeof (RID_BIT_TYPE)); |
ac9386a0 | 7425 | RIDBIT_RESET (RID_INLINE, tmp_bits); |
7426 | RIDBIT_RESET (RID_STATIC, tmp_bits); | |
7427 | if (RIDBIT_ANY_SET (tmp_bits)) | |
905d4035 | 7428 | error ("return value type specifier for constructor ignored"); |
471086d6 | 7429 | } |
771665d8 | 7430 | if (decl_context == FIELD) |
471086d6 | 7431 | { |
017fafd4 | 7432 | if (! member_function_or_else (ctype, |
7433 | current_class_type, | |
7434 | flags)) | |
471086d6 | 7435 | return void_type_node; |
7436 | TYPE_HAS_CONSTRUCTOR (ctype) = 1; | |
bb855ff9 | 7437 | if (sfk != sfk_constructor) |
471086d6 | 7438 | return NULL_TREE; |
7439 | } | |
7440 | } | |
7441 | if (decl_context == FIELD) | |
7442 | staticp = 0; | |
7443 | } | |
1e66592c | 7444 | else if (friendp) |
471086d6 | 7445 | { |
1e66592c | 7446 | if (initialized) |
905d4035 | 7447 | error ("can't initialize friend function `%s'", name); |
1e66592c | 7448 | if (virtualp) |
7449 | { | |
7450 | /* Cannot be both friend and virtual. */ | |
905d4035 | 7451 | error ("virtual functions cannot be friends"); |
1e66592c | 7452 | RIDBIT_RESET (RID_FRIEND, specbits); |
7453 | friendp = 0; | |
7454 | } | |
bea7d742 | 7455 | if (decl_context == NORMAL) |
905d4035 | 7456 | error ("friend declaration not in class definition"); |
bea7d742 | 7457 | if (current_function_decl && funcdef_flag) |
cf103c6c | 7458 | error ("can't define friend function `%s' in a local class definition", |
bea7d742 | 7459 | name); |
471086d6 | 7460 | } |
7461 | ||
471086d6 | 7462 | /* Construct the function type and go to the next |
7463 | inner layer of declarator. */ | |
7464 | ||
c38086bd | 7465 | declarator = TREE_OPERAND (declarator, 0); |
471086d6 | 7466 | |
7ef14399 | 7467 | arg_types = grokparms (inner_parms, &parms); |
471086d6 | 7468 | |
9989bb55 | 7469 | if (declarator && flags == DTOR_FLAG) |
471086d6 | 7470 | { |
9989bb55 | 7471 | /* A destructor declared in the body of a class will |
7472 | be represented as a BIT_NOT_EXPR. But, we just | |
7473 | want the underlying IDENTIFIER. */ | |
471086d6 | 7474 | if (TREE_CODE (declarator) == BIT_NOT_EXPR) |
9989bb55 | 7475 | declarator = TREE_OPERAND (declarator, 0); |
980877d7 | 7476 | |
0f497990 | 7477 | if (arg_types != void_list_node) |
471086d6 | 7478 | { |
cf103c6c | 7479 | error ("destructors may not have parameters"); |
9989bb55 | 7480 | arg_types = void_list_node; |
7ef14399 | 7481 | parms = NULL_TREE; |
471086d6 | 7482 | } |
7483 | } | |
7484 | ||
48ec80c8 | 7485 | /* ANSI says that `const int foo ();' |
471086d6 | 7486 | does not make the function foo const. */ |
48ec80c8 | 7487 | type = build_function_type (type, arg_types); |
471086d6 | 7488 | } |
7489 | break; | |
7490 | ||
7491 | case ADDR_EXPR: | |
7492 | case INDIRECT_REF: | |
7493 | /* Filter out pointers-to-references and references-to-references. | |
7494 | We can get these if a TYPE_DECL is used. */ | |
7495 | ||
7496 | if (TREE_CODE (type) == REFERENCE_TYPE) | |
7497 | { | |
7f134624 | 7498 | error (TREE_CODE (declarator) == ADDR_EXPR |
7499 | ? "cannot declare reference to `%#T'" | |
7500 | : "cannot declare pointer to `%#T'", type); | |
127a1cd0 | 7501 | type = TREE_TYPE (type); |
7502 | } | |
7f134624 | 7503 | else if (VOID_TYPE_P (type) |
7504 | && (ctype || TREE_CODE (declarator) == ADDR_EXPR)) | |
7505 | error (ctype ? "cannot declare pointer to `%#T' member" | |
7506 | : "cannot declare reference to `%#T'", type); | |
127a1cd0 | 7507 | |
0f2952a1 | 7508 | /* Merge any constancy or volatility into the target type |
7509 | for the pointer. */ | |
7510 | ||
3e04bd45 | 7511 | /* We now know that the TYPE_QUALS don't apply to the decl, |
7512 | but to the target of the pointer. */ | |
7513 | type_quals = TYPE_UNQUALIFIED; | |
471086d6 | 7514 | |
771665d8 | 7515 | if (TREE_CODE (declarator) == ADDR_EXPR) |
471086d6 | 7516 | { |
7f134624 | 7517 | if (!VOID_TYPE_P (type)) |
938b347c | 7518 | type = build_reference_type (type); |
471086d6 | 7519 | } |
7520 | else if (TREE_CODE (type) == METHOD_TYPE) | |
2b77484d | 7521 | type = build_ptrmemfunc_type (build_pointer_type (type)); |
3645386f | 7522 | else if (ctype) |
7523 | type = build_ptrmem_type (ctype, type); | |
471086d6 | 7524 | else |
7525 | type = build_pointer_type (type); | |
7526 | ||
7527 | /* Process a list of type modifier keywords (such as | |
7528 | const or volatile) that were given inside the `*' or `&'. */ | |
7529 | ||
7530 | if (TREE_TYPE (declarator)) | |
7531 | { | |
cd16867a | 7532 | tree typemodlist; |
471086d6 | 7533 | int erred = 0; |
9edbac04 | 7534 | int constp = 0; |
7535 | int volatilep = 0; | |
7536 | int restrictp = 0; | |
7537 | ||
471086d6 | 7538 | for (typemodlist = TREE_TYPE (declarator); typemodlist; |
7539 | typemodlist = TREE_CHAIN (typemodlist)) | |
7540 | { | |
3e04bd45 | 7541 | tree qualifier = TREE_VALUE (typemodlist); |
7542 | ||
7543 | if (qualifier == ridpointers[(int) RID_CONST]) | |
9edbac04 | 7544 | { |
7545 | constp++; | |
7546 | type_quals |= TYPE_QUAL_CONST; | |
7547 | } | |
3e04bd45 | 7548 | else if (qualifier == ridpointers[(int) RID_VOLATILE]) |
9edbac04 | 7549 | { |
7550 | volatilep++; | |
7551 | type_quals |= TYPE_QUAL_VOLATILE; | |
7552 | } | |
3e04bd45 | 7553 | else if (qualifier == ridpointers[(int) RID_RESTRICT]) |
9edbac04 | 7554 | { |
7555 | restrictp++; | |
7556 | type_quals |= TYPE_QUAL_RESTRICT; | |
7557 | } | |
471086d6 | 7558 | else if (!erred) |
7559 | { | |
7560 | erred = 1; | |
3e04bd45 | 7561 | error ("invalid type modifier within pointer declarator"); |
471086d6 | 7562 | } |
7563 | } | |
7564 | if (constp > 1) | |
905d4035 | 7565 | pedwarn ("duplicate `const'"); |
471086d6 | 7566 | if (volatilep > 1) |
905d4035 | 7567 | pedwarn ("duplicate `volatile'"); |
3e04bd45 | 7568 | if (restrictp > 1) |
7569 | pedwarn ("duplicate `restrict'"); | |
3e04bd45 | 7570 | type = cp_build_qualified_type (type, type_quals); |
9edbac04 | 7571 | type_quals = cp_type_quals (type); |
471086d6 | 7572 | } |
7573 | declarator = TREE_OPERAND (declarator, 0); | |
7574 | ctype = NULL_TREE; | |
7575 | break; | |
7576 | ||
7577 | case SCOPE_REF: | |
7578 | { | |
7579 | /* We have converted type names to NULL_TREE if the | |
7580 | name was bogus, or to a _TYPE node, if not. | |
7581 | ||
7582 | The variable CTYPE holds the type we will ultimately | |
7583 | resolve to. The code here just needs to build | |
7584 | up appropriate member types. */ | |
7585 | tree sname = TREE_OPERAND (declarator, 1); | |
b1cfe2be | 7586 | tree t; |
7587 | ||
471086d6 | 7588 | /* Destructors can have their visibilities changed as well. */ |
7589 | if (TREE_CODE (sname) == BIT_NOT_EXPR) | |
7590 | sname = TREE_OPERAND (sname, 0); | |
7591 | ||
471086d6 | 7592 | if (TREE_OPERAND (declarator, 0) == NULL_TREE) |
7593 | { | |
7594 | /* We had a reference to a global decl, or | |
7595 | perhaps we were given a non-aggregate typedef, | |
7596 | in which case we cleared this out, and should just | |
7597 | keep going as though it wasn't there. */ | |
7598 | declarator = sname; | |
7599 | continue; | |
7600 | } | |
7601 | ctype = TREE_OPERAND (declarator, 0); | |
7602 | ||
b1cfe2be | 7603 | t = ctype; |
2efe4daf | 7604 | if (TREE_CODE (TREE_OPERAND (declarator, 1)) != INDIRECT_REF) |
7605 | while (t != NULL_TREE && CLASS_TYPE_P (t)) | |
7606 | { | |
7607 | /* You're supposed to have one `template <...>' | |
7608 | for every template class, but you don't need one | |
7609 | for a full specialization. For example: | |
7610 | ||
52d6ab53 | 7611 | template <class T> struct S{}; |
7612 | template <> struct S<int> { void f(); }; | |
7613 | void S<int>::f () {} | |
2efe4daf | 7614 | |
7615 | is correct; there shouldn't be a `template <>' for | |
7616 | the definition of `S<int>::f'. */ | |
7617 | if (CLASSTYPE_TEMPLATE_INFO (t) | |
7618 | && (CLASSTYPE_TEMPLATE_INSTANTIATION (t) | |
7619 | || uses_template_parms (CLASSTYPE_TI_ARGS (t))) | |
7620 | && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (t))) | |
7621 | template_count += 1; | |
7622 | ||
7623 | t = TYPE_MAIN_DECL (t); | |
7624 | t = DECL_CONTEXT (t); | |
7625 | } | |
b1cfe2be | 7626 | |
471086d6 | 7627 | if (sname == NULL_TREE) |
7628 | goto done_scoping; | |
7629 | ||
7630 | if (TREE_CODE (sname) == IDENTIFIER_NODE) | |
7631 | { | |
7632 | /* This is the `standard' use of the scoping operator: | |
7633 | basetype :: member . */ | |
7634 | ||
c25194fd | 7635 | if (ctype == current_class_type) |
bea7d742 | 7636 | { |
7637 | /* class A { | |
7638 | void A::f (); | |
7639 | }; | |
7640 | ||
7641 | Is this ill-formed? */ | |
7642 | ||
7643 | if (pedantic) | |
cf103c6c | 7644 | pedwarn ("extra qualification `%T::' on member `%s' ignored", |
bea7d742 | 7645 | ctype, name); |
7646 | } | |
c25194fd | 7647 | else if (TREE_CODE (type) == FUNCTION_TYPE) |
471086d6 | 7648 | { |
7ef14399 | 7649 | if (NEW_DELETE_OPNAME_P (sname)) |
7650 | /* Overloaded operator new and operator delete | |
7651 | are always static functions. */ | |
7652 | ; | |
7653 | else if (current_class_type == NULL_TREE || friendp) | |
5bfb0742 | 7654 | type |
7655 | = build_method_type_directly (ctype, | |
7656 | TREE_TYPE (type), | |
77b7e009 | 7657 | TYPE_ARG_TYPES (type)); |
471086d6 | 7658 | else |
7659 | { | |
cf103c6c | 7660 | error ("cannot declare member function `%T::%s' within `%T'", |
ad91f3ed | 7661 | ctype, name, current_class_type); |
0a3b29ad | 7662 | return error_mark_node; |
471086d6 | 7663 | } |
7664 | } | |
e857e9c7 | 7665 | else if (RIDBIT_SETP (RID_TYPEDEF, specbits) |
4b72716d | 7666 | || COMPLETE_TYPE_P (complete_type (ctype))) |
471086d6 | 7667 | { |
8417823c | 7668 | /* Have to move this code elsewhere in this function. |
c25194fd | 7669 | this code is used for i.e., typedef int A::M; M *pm; |
7670 | ||
7671 | It is? How? jason 10/2/94 */ | |
471086d6 | 7672 | |
471086d6 | 7673 | if (current_class_type) |
7674 | { | |
cf103c6c | 7675 | error ("cannot declare member `%T::%s' within `%T'", |
c25194fd | 7676 | ctype, name, current_class_type); |
7677 | return void_type_node; | |
471086d6 | 7678 | } |
471086d6 | 7679 | } |
471086d6 | 7680 | else |
102f8029 | 7681 | { |
1dd25100 | 7682 | cxx_incomplete_type_error (NULL_TREE, ctype); |
102f8029 | 7683 | return error_mark_node; |
20c01ba9 | 7684 | } |
471086d6 | 7685 | |
7686 | declarator = sname; | |
7687 | } | |
471086d6 | 7688 | else if (TREE_CODE (sname) == SCOPE_REF) |
523ac844 | 7689 | abort (); |
471086d6 | 7690 | else |
7691 | { | |
7692 | done_scoping: | |
7693 | declarator = TREE_OPERAND (declarator, 1); | |
7694 | if (declarator && TREE_CODE (declarator) == CALL_EXPR) | |
7695 | /* In this case, we will deal with it later. */ | |
7696 | ; | |
3645386f | 7697 | else if (TREE_CODE (type) == FUNCTION_TYPE) |
5bfb0742 | 7698 | type = build_method_type_directly (ctype, |
7699 | TREE_TYPE (type), | |
7700 | TYPE_ARG_TYPES (type)); | |
471086d6 | 7701 | } |
7702 | } | |
7703 | break; | |
7704 | ||
7705 | case BIT_NOT_EXPR: | |
7706 | declarator = TREE_OPERAND (declarator, 0); | |
7707 | break; | |
7708 | ||
4ac852cb | 7709 | case BASELINK: |
7710 | declarator = BASELINK_FUNCTIONS (declarator); | |
7711 | break; | |
7712 | ||
471086d6 | 7713 | case RECORD_TYPE: |
7714 | case UNION_TYPE: | |
7715 | case ENUMERAL_TYPE: | |
7716 | declarator = NULL_TREE; | |
7717 | break; | |
7718 | ||
7719 | case ERROR_MARK: | |
7720 | declarator = NULL_TREE; | |
7721 | break; | |
7722 | ||
7723 | default: | |
523ac844 | 7724 | abort (); |
471086d6 | 7725 | } |
7726 | } | |
7727 | ||
e3c541f0 | 7728 | if (returned_attrs) |
57e7b4d8 | 7729 | { |
e3c541f0 | 7730 | if (attrlist) |
7731 | *attrlist = chainon (returned_attrs, *attrlist); | |
57e7b4d8 | 7732 | else |
e3c541f0 | 7733 | attrlist = &returned_attrs; |
57e7b4d8 | 7734 | } |
7735 | ||
4a442922 | 7736 | /* Now TYPE has the actual type. */ |
7737 | ||
119c9424 | 7738 | /* Did array size calculations overflow? */ |
7739 | ||
7740 | if (TREE_CODE (type) == ARRAY_TYPE | |
7741 | && COMPLETE_TYPE_P (type) | |
7742 | && TREE_OVERFLOW (TYPE_SIZE (type))) | |
7743 | { | |
7744 | error ("size of array `%s' is too large", name); | |
4109ca29 | 7745 | /* If we proceed with the array type as it is, we'll eventually |
119c9424 | 7746 | crash in tree_low_cst(). */ |
7747 | type = error_mark_node; | |
7748 | } | |
7749 | ||
c015cd2f | 7750 | if ((decl_context == FIELD || decl_context == PARM) |
bab7b18e | 7751 | && !processing_template_decl |
7752 | && variably_modified_type_p (type)) | |
7753 | { | |
c015cd2f | 7754 | if (decl_context == FIELD) |
7755 | error ("data member may not have variably modified type `%T'", type); | |
7756 | else | |
7757 | error ("parameter may not have variably modified type `%T'", type); | |
bab7b18e | 7758 | type = error_mark_node; |
7759 | } | |
7760 | ||
2a80b8e1 | 7761 | if (explicitp == 1 || (explicitp && friendp)) |
c25194fd | 7762 | { |
2a80b8e1 | 7763 | /* [dcl.fct.spec] The explicit specifier shall only be used in |
7764 | declarations of constructors within a class definition. */ | |
7765 | error ("only declarations of constructors can be `explicit'"); | |
c25194fd | 7766 | explicitp = 0; |
7767 | } | |
7768 | ||
ce28ee2e | 7769 | if (RIDBIT_SETP (RID_MUTABLE, specbits)) |
7770 | { | |
e4494371 | 7771 | if (decl_context != FIELD || friendp) |
2a80b8e1 | 7772 | { |
7773 | error ("non-member `%s' cannot be declared `mutable'", name); | |
7774 | RIDBIT_RESET (RID_MUTABLE, specbits); | |
7775 | } | |
7776 | else if (decl_context == TYPENAME || RIDBIT_SETP (RID_TYPEDEF, specbits)) | |
ce28ee2e | 7777 | { |
2a80b8e1 | 7778 | error ("non-object member `%s' cannot be declared `mutable'", name); |
ce28ee2e | 7779 | RIDBIT_RESET (RID_MUTABLE, specbits); |
7780 | } | |
2a80b8e1 | 7781 | else if (TREE_CODE (type) == FUNCTION_TYPE |
7782 | || TREE_CODE (type) == METHOD_TYPE) | |
7783 | { | |
7784 | error ("function `%s' cannot be declared `mutable'", name); | |
7785 | RIDBIT_RESET (RID_MUTABLE, specbits); | |
7786 | } | |
ce28ee2e | 7787 | else if (staticp) |
7788 | { | |
905d4035 | 7789 | error ("static `%s' cannot be declared `mutable'", name); |
ce28ee2e | 7790 | RIDBIT_RESET (RID_MUTABLE, specbits); |
7791 | } | |
2a80b8e1 | 7792 | else if (type_quals & TYPE_QUAL_CONST) |
7793 | { | |
7794 | error ("const `%s' cannot be declared `mutable'", name); | |
9edbac04 | 7795 | RIDBIT_RESET (RID_MUTABLE, specbits); |
2a80b8e1 | 7796 | } |
ce28ee2e | 7797 | } |
7798 | ||
82dda06c | 7799 | if (declarator == NULL_TREE |
4ee9c684 | 7800 | || TREE_CODE (declarator) == ERROR_MARK |
82dda06c | 7801 | || TREE_CODE (declarator) == IDENTIFIER_NODE |
7802 | || (TREE_CODE (declarator) == TEMPLATE_ID_EXPR | |
7803 | && (TREE_CODE (type) == FUNCTION_TYPE | |
7804 | || TREE_CODE (type) == METHOD_TYPE))) | |
7805 | /* OK */; | |
7806 | else if (TREE_CODE (declarator) == TEMPLATE_ID_EXPR) | |
7807 | { | |
cf103c6c | 7808 | error ("template-id `%D' used as a declarator", declarator); |
82dda06c | 7809 | declarator = dname; |
7810 | } | |
7811 | else | |
4a442922 | 7812 | /* Unexpected declarator format. */ |
523ac844 | 7813 | abort (); |
82dda06c | 7814 | |
4a442922 | 7815 | /* If this is declaring a typedef name, return a TYPE_DECL. */ |
7816 | ||
d2a15a12 | 7817 | if (RIDBIT_SETP (RID_TYPEDEF, specbits) && decl_context != TYPENAME) |
471086d6 | 7818 | { |
7819 | tree decl; | |
7820 | ||
7821 | /* Note that the grammar rejects storage classes | |
7822 | in typenames, fields or parameters. */ | |
7d53e30d | 7823 | if (current_lang_name == lang_name_java) |
7824 | TYPE_FOR_JAVA (type) = 1; | |
471086d6 | 7825 | |
b0df6589 | 7826 | if (decl_context == FIELD) |
7827 | { | |
0a3b29ad | 7828 | if (constructor_name_p (declarator, current_class_type)) |
cf103c6c | 7829 | pedwarn ("ISO C++ forbids nested type `%D' with same name as enclosing class", |
b0df6589 | 7830 | declarator); |
7831 | decl = build_lang_decl (TYPE_DECL, declarator, type); | |
b0df6589 | 7832 | } |
7833 | else | |
b04d77fe | 7834 | { |
7835 | decl = build_decl (TYPE_DECL, declarator, type); | |
0a3b29ad | 7836 | if (in_namespace || ctype) |
9bc3739f | 7837 | error ("%Jtypedef name may not be a nested-name-specifier", decl); |
b04d77fe | 7838 | if (!current_function_decl) |
7839 | DECL_CONTEXT (decl) = FROB_CONTEXT (current_namespace); | |
7840 | } | |
7841 | ||
70a658bd | 7842 | /* If the user declares "typedef struct {...} foo" then the |
7843 | struct will have an anonymous name. Fill that name in now. | |
7844 | Nothing can refer to it, so nothing needs know about the name | |
7845 | change. */ | |
471086d6 | 7846 | if (type != error_mark_node |
d9f88785 | 7847 | && declarator |
471086d6 | 7848 | && TYPE_NAME (type) |
7849 | && TREE_CODE (TYPE_NAME (type)) == TYPE_DECL | |
83c4eacf | 7850 | && TYPE_ANONYMOUS_P (type) |
88be9eb2 | 7851 | /* Don't do this if there are attributes. */ |
7852 | && (!attrlist || !*attrlist) | |
3119c950 | 7853 | && cp_type_quals (type) == TYPE_UNQUALIFIED) |
471086d6 | 7854 | { |
1717856a | 7855 | tree oldname = TYPE_NAME (type); |
7856 | tree t; | |
7857 | ||
8417823c | 7858 | /* Replace the anonymous name with the real name everywhere. */ |
471086d6 | 7859 | lookup_tag_reverse (type, declarator); |
1717856a | 7860 | for (t = TYPE_MAIN_VARIANT (type); t; t = TYPE_NEXT_VARIANT (t)) |
7861 | if (TYPE_NAME (t) == oldname) | |
7862 | TYPE_NAME (t) = decl; | |
471086d6 | 7863 | |
7864 | if (TYPE_LANG_SPECIFIC (type)) | |
7865 | TYPE_WAS_ANONYMOUS (type) = 1; | |
7866 | ||
586f49f7 | 7867 | /* If this is a typedef within a template class, the nested |
7868 | type is a (non-primary) template. The name for the | |
7869 | template needs updating as well. */ | |
7870 | if (TYPE_LANG_SPECIFIC (type) && CLASSTYPE_TEMPLATE_INFO (type)) | |
980877d7 | 7871 | DECL_NAME (CLASSTYPE_TI_TEMPLATE (type)) |
586f49f7 | 7872 | = TYPE_IDENTIFIER (type); |
7873 | ||
844e1a9a | 7874 | /* FIXME remangle member functions; member functions of a |
7875 | type with external linkage have external linkage. */ | |
d2a15a12 | 7876 | } |
d2a15a12 | 7877 | |
0a3b29ad | 7878 | if (quals) |
471086d6 | 7879 | { |
7880 | if (ctype == NULL_TREE) | |
7881 | { | |
7882 | if (TREE_CODE (type) != METHOD_TYPE) | |
9bc3739f | 7883 | error ("%Jinvalid type qualifier for non-member function type", |
7884 | decl); | |
471086d6 | 7885 | else |
7886 | ctype = TYPE_METHOD_BASETYPE (type); | |
7887 | } | |
7888 | if (ctype != NULL_TREE) | |
7889 | grok_method_quals (ctype, decl, quals); | |
7890 | } | |
7891 | ||
7892 | if (RIDBIT_SETP (RID_SIGNED, specbits) | |
7893 | || (typedef_decl && C_TYPEDEF_EXPLICITLY_SIGNED (typedef_decl))) | |
7894 | C_TYPEDEF_EXPLICITLY_SIGNED (decl) = 1; | |
7895 | ||
1e28ccf1 | 7896 | bad_specifiers (decl, "type", virtualp, quals != NULL_TREE, |
7897 | inlinep, friendp, raises != NULL_TREE); | |
7898 | ||
471086d6 | 7899 | return decl; |
7900 | } | |
7901 | ||
7902 | /* Detect the case of an array type of unspecified size | |
7903 | which came, as such, direct from a typedef name. | |
47fd99f9 | 7904 | We must copy the type, so that the array's domain can be |
7905 | individually set by the object's initializer. */ | |
471086d6 | 7906 | |
47fd99f9 | 7907 | if (type && typedef_type |
7908 | && TREE_CODE (type) == ARRAY_TYPE && !TYPE_DOMAIN (type) | |
119c9424 | 7909 | && TYPE_MAIN_VARIANT (type) == TYPE_MAIN_VARIANT (typedef_type)) |
47fd99f9 | 7910 | type = build_cplus_array_type (TREE_TYPE (type), NULL_TREE); |
471086d6 | 7911 | |
54da4cc8 | 7912 | /* Detect where we're using a typedef of function type to declare a |
7ef14399 | 7913 | function. PARMS will not be set, so we must create it now. */ |
54da4cc8 | 7914 | |
7915 | if (type == typedef_type && TREE_CODE (type) == FUNCTION_TYPE) | |
7916 | { | |
7917 | tree decls = NULL_TREE; | |
7918 | tree args; | |
7919 | ||
7920 | for (args = TYPE_ARG_TYPES (type); args; args = TREE_CHAIN (args)) | |
7921 | { | |
d145d8d5 | 7922 | tree decl = cp_build_parm_decl (NULL_TREE, TREE_VALUE (args)); |
54da4cc8 | 7923 | |
7924 | TREE_CHAIN (decl) = decls; | |
7925 | decls = decl; | |
7926 | } | |
7927 | ||
7ef14399 | 7928 | parms = nreverse (decls); |
54da4cc8 | 7929 | } |
7930 | ||
471086d6 | 7931 | /* If this is a type name (such as, in a cast or sizeof), |
7932 | compute the type and return it now. */ | |
7933 | ||
7934 | if (decl_context == TYPENAME) | |
7935 | { | |
7936 | /* Note that the grammar rejects storage classes | |
7937 | in typenames, fields or parameters. */ | |
3e04bd45 | 7938 | if (type_quals != TYPE_UNQUALIFIED) |
771665d8 | 7939 | type_quals = TYPE_UNQUALIFIED; |
471086d6 | 7940 | |
7941 | /* Special case: "friend class foo" looks like a TYPENAME context. */ | |
7942 | if (friendp) | |
7943 | { | |
3e04bd45 | 7944 | if (type_quals != TYPE_UNQUALIFIED) |
1e66592c | 7945 | { |
cf103c6c | 7946 | error ("type qualifiers specified for friend class declaration"); |
3e04bd45 | 7947 | type_quals = TYPE_UNQUALIFIED; |
1e66592c | 7948 | } |
7949 | if (inlinep) | |
7950 | { | |
cf103c6c | 7951 | error ("`inline' specified for friend class declaration"); |
1e66592c | 7952 | inlinep = 0; |
7953 | } | |
cb4cc35f | 7954 | |
55ebab6e | 7955 | if (!current_aggr) |
eccec853 | 7956 | { |
55ebab6e | 7957 | /* Don't allow friend declaration without a class-key. */ |
eccec853 | 7958 | if (TREE_CODE (type) == TEMPLATE_TYPE_PARM) |
55ebab6e | 7959 | pedwarn ("template parameters cannot be friends"); |
cb4cc35f | 7960 | else if (TREE_CODE (type) == TYPENAME_TYPE) |
55ebab6e | 7961 | pedwarn ("friend declaration requires class-key, " |
7962 | "i.e. `friend class %T::%D'", | |
7963 | TYPE_CONTEXT (type), TYPENAME_TYPE_FULLNAME (type)); | |
eccec853 | 7964 | else |
55ebab6e | 7965 | pedwarn ("friend declaration requires class-key, " |
7966 | "i.e. `friend %#T'", | |
7967 | type); | |
eccec853 | 7968 | } |
1e66592c | 7969 | |
7970 | /* Only try to do this stuff if we didn't already give up. */ | |
7971 | if (type != integer_type_node) | |
7972 | { | |
7973 | /* A friendly class? */ | |
7974 | if (current_class_type) | |
b123b79d | 7975 | make_friend_class (current_class_type, TYPE_MAIN_VARIANT (type), |
7976 | /*complain=*/true); | |
1e66592c | 7977 | else |
cf103c6c | 7978 | error ("trying to make class `%T' a friend of global scope", |
a0ec9fa5 | 7979 | type); |
20c01ba9 | 7980 | |
1e66592c | 7981 | type = void_type_node; |
7982 | } | |
471086d6 | 7983 | } |
7984 | else if (quals) | |
7985 | { | |
471086d6 | 7986 | if (ctype == NULL_TREE) |
7987 | { | |
7b2c7b37 | 7988 | if (TREE_CODE (type) != METHOD_TYPE) |
cf103c6c | 7989 | error ("invalid qualifiers on non-member function type"); |
7b2c7b37 | 7990 | else |
7991 | ctype = TYPE_METHOD_BASETYPE (type); | |
7992 | } | |
7993 | if (ctype) | |
7994 | { | |
7995 | tree dummy = build_decl (TYPE_DECL, declarator, type); | |
7996 | grok_method_quals (ctype, dummy, quals); | |
7997 | type = TREE_TYPE (dummy); | |
471086d6 | 7998 | } |
471086d6 | 7999 | } |
8000 | ||
8001 | return type; | |
8002 | } | |
8003 | else if (declarator == NULL_TREE && decl_context != PARM | |
c25194fd | 8004 | && decl_context != CATCHPARM |
471086d6 | 8005 | && TREE_CODE (type) != UNION_TYPE |
8006 | && ! bitfield) | |
8007 | { | |
cf103c6c | 8008 | error ("abstract declarator `%T' used as declaration", type); |
471086d6 | 8009 | declarator = make_anon_name (); |
8010 | } | |
8011 | ||
8012 | /* `void' at top level (not within pointer) | |
8013 | is allowed only in typedefs or type names. | |
8014 | We don't complain about parms either, but that is because | |
8015 | a better error message can be made later. */ | |
8016 | ||
f468434d | 8017 | if (TREE_CODE (type) == VOID_TYPE && decl_context != PARM) |
471086d6 | 8018 | { |
1e66592c | 8019 | if (! declarator) |
905d4035 | 8020 | error ("unnamed variable or field declared void"); |
1e66592c | 8021 | else if (TREE_CODE (declarator) == IDENTIFIER_NODE) |
471086d6 | 8022 | { |
8023 | if (IDENTIFIER_OPNAME_P (declarator)) | |
523ac844 | 8024 | abort (); |
471086d6 | 8025 | else |
905d4035 | 8026 | error ("variable or field `%s' declared void", name); |
471086d6 | 8027 | } |
8028 | else | |
905d4035 | 8029 | error ("variable or field declared void"); |
471086d6 | 8030 | type = integer_type_node; |
8031 | } | |
8032 | ||
8033 | /* Now create the decl, which may be a VAR_DECL, a PARM_DECL | |
8034 | or a FUNCTION_DECL, depending on DECL_CONTEXT and TYPE. */ | |
8035 | ||
77b7e009 | 8036 | if (decl_context == PARM || decl_context == CATCHPARM) |
8037 | { | |
8038 | if (ctype || in_namespace) | |
8039 | error ("cannot use `::' in parameter declaration"); | |
8040 | ||
8041 | /* A parameter declared as an array of T is really a pointer to T. | |
8042 | One declared as a function is really a pointer to a function. | |
8043 | One declared as a member is really a pointer to member. */ | |
8044 | ||
8045 | if (TREE_CODE (type) == ARRAY_TYPE) | |
8046 | { | |
8047 | /* Transfer const-ness of array into that of type pointed to. */ | |
8048 | type = build_pointer_type (TREE_TYPE (type)); | |
3e04bd45 | 8049 | type_quals = TYPE_UNQUALIFIED; |
77b7e009 | 8050 | } |
8051 | else if (TREE_CODE (type) == FUNCTION_TYPE) | |
8052 | type = build_pointer_type (type); | |
77b7e009 | 8053 | } |
980877d7 | 8054 | |
471086d6 | 8055 | { |
cd16867a | 8056 | tree decl; |
471086d6 | 8057 | |
8058 | if (decl_context == PARM) | |
8059 | { | |
d145d8d5 | 8060 | decl = cp_build_parm_decl (declarator, type); |
471086d6 | 8061 | |
8062 | bad_specifiers (decl, "parameter", virtualp, quals != NULL_TREE, | |
8063 | inlinep, friendp, raises != NULL_TREE); | |
471086d6 | 8064 | } |
8065 | else if (decl_context == FIELD) | |
8066 | { | |
30bedc1f | 8067 | /* The C99 flexible array extension. */ |
8068 | if (!staticp && TREE_CODE (type) == ARRAY_TYPE | |
8069 | && TYPE_DOMAIN (type) == NULL_TREE) | |
8070 | { | |
8071 | tree itype = compute_array_index_type (dname, integer_zero_node); | |
8072 | type = build_cplus_array_type (TREE_TYPE (type), itype); | |
8073 | } | |
8074 | ||
471086d6 | 8075 | if (type == error_mark_node) |
8076 | { | |
8077 | /* Happens when declaring arrays of sizes which | |
8078 | are error_mark_node, for example. */ | |
8079 | decl = NULL_TREE; | |
8080 | } | |
4e8042b1 | 8081 | else if (in_namespace && !friendp) |
f50dc4d4 | 8082 | { |
8083 | /* Something like struct S { int N::j; }; */ | |
cf103c6c | 8084 | error ("invalid use of `::'"); |
f50dc4d4 | 8085 | decl = NULL_TREE; |
8086 | } | |
471086d6 | 8087 | else if (TREE_CODE (type) == FUNCTION_TYPE) |
8088 | { | |
8089 | int publicp = 0; | |
1146f179 | 8090 | tree function_context; |
471086d6 | 8091 | |
3d4e092a | 8092 | /* We catch the others as conflicts with the builtin |
8093 | typedefs. */ | |
8094 | if (friendp && declarator == ridpointers[(int) RID_SIGNED]) | |
8095 | { | |
cf103c6c | 8096 | error ("function `%D' cannot be declared friend", |
3d4e092a | 8097 | declarator); |
8098 | friendp = 0; | |
8099 | } | |
8100 | ||
471086d6 | 8101 | if (friendp == 0) |
8102 | { | |
8103 | if (ctype == NULL_TREE) | |
8104 | ctype = current_class_type; | |
8105 | ||
8106 | if (ctype == NULL_TREE) | |
8107 | { | |
cf103c6c | 8108 | error ("can't make `%D' into a method -- not in a class", |
471086d6 | 8109 | declarator); |
8110 | return void_type_node; | |
8111 | } | |
8112 | ||
8113 | /* ``A union may [ ... ] not [ have ] virtual functions.'' | |
8114 | ARM 9.5 */ | |
8115 | if (virtualp && TREE_CODE (ctype) == UNION_TYPE) | |
8116 | { | |
cf103c6c | 8117 | error ("function `%D' declared virtual inside a union", |
471086d6 | 8118 | declarator); |
8119 | return void_type_node; | |
8120 | } | |
8121 | ||
7ef14399 | 8122 | if (NEW_DELETE_OPNAME_P (declarator)) |
471086d6 | 8123 | { |
8124 | if (virtualp) | |
8125 | { | |
cf103c6c | 8126 | error ("`%D' cannot be declared virtual, since it is always static", |
471086d6 | 8127 | declarator); |
8128 | virtualp = 0; | |
8129 | } | |
8130 | } | |
8131 | else if (staticp < 2) | |
5bfb0742 | 8132 | type = build_method_type_directly (ctype, |
8133 | TREE_TYPE (type), | |
8134 | TYPE_ARG_TYPES (type)); | |
471086d6 | 8135 | } |
8136 | ||
8137 | /* Tell grokfndecl if it needs to set TREE_PUBLIC on the node. */ | |
980877d7 | 8138 | function_context = (ctype != NULL_TREE) ? |
9ba4048d | 8139 | decl_function_context (TYPE_MAIN_DECL (ctype)) : NULL_TREE; |
1146f179 | 8140 | publicp = (! friendp || ! staticp) |
8141 | && function_context == NULL_TREE; | |
980877d7 | 8142 | decl = grokfndecl (ctype, type, |
b1cfe2be | 8143 | TREE_CODE (declarator) != TEMPLATE_ID_EXPR |
8144 | ? declarator : dname, | |
7ef14399 | 8145 | parms, |
b1cfe2be | 8146 | declarator, |
607f6131 | 8147 | virtualp, flags, quals, raises, |
b1cfe2be | 8148 | friendp ? -1 : 0, friendp, publicp, inlinep, |
8417823c | 8149 | funcdef_flag, template_count, in_namespace); |
e0d8778b | 8150 | if (decl == NULL_TREE) |
76c1ba40 | 8151 | return decl; |
7d85c040 | 8152 | #if 0 |
8153 | /* This clobbers the attrs stored in `decl' from `attrlist'. */ | |
e3c541f0 | 8154 | /* The decl and setting of decl_attr is also turned off. */ |
8155 | decl = build_decl_attribute_variant (decl, decl_attr); | |
7d85c040 | 8156 | #endif |
617abf06 | 8157 | |
6c5af975 | 8158 | /* [class.conv.ctor] |
8159 | ||
8160 | A constructor declared without the function-specifier | |
8161 | explicit that can be called with a single parameter | |
8162 | specifies a conversion from the type of its first | |
8163 | parameter to the type of its class. Such a constructor | |
8164 | is called a converting constructor. */ | |
c25194fd | 8165 | if (explicitp == 2) |
8166 | DECL_NONCONVERTING_P (decl) = 1; | |
6c5af975 | 8167 | else if (DECL_CONSTRUCTOR_P (decl)) |
8168 | { | |
8169 | /* The constructor can be called with exactly one | |
8170 | parameter if there is at least one parameter, and | |
8171 | any subsequent parameters have default arguments. | |
dcbeb3ef | 8172 | Ignore any compiler-added parms. */ |
8173 | tree arg_types = FUNCTION_FIRST_USER_PARMTYPE (decl); | |
6c5af975 | 8174 | |
8175 | if (arg_types == void_list_node | |
980877d7 | 8176 | || (arg_types |
8177 | && TREE_CHAIN (arg_types) | |
6c5af975 | 8178 | && TREE_CHAIN (arg_types) != void_list_node |
8179 | && !TREE_PURPOSE (TREE_CHAIN (arg_types)))) | |
8180 | DECL_NONCONVERTING_P (decl) = 1; | |
8181 | } | |
471086d6 | 8182 | } |
8183 | else if (TREE_CODE (type) == METHOD_TYPE) | |
8184 | { | |
bb09dca5 | 8185 | /* We only get here for friend declarations of |
8186 | members of other classes. */ | |
471086d6 | 8187 | /* All method decls are public, so tell grokfndecl to set |
8188 | TREE_PUBLIC, also. */ | |
6994351f | 8189 | decl = grokfndecl (ctype, type, |
8190 | TREE_CODE (declarator) != TEMPLATE_ID_EXPR | |
8191 | ? declarator : dname, | |
7ef14399 | 8192 | parms, |
6994351f | 8193 | declarator, |
607f6131 | 8194 | virtualp, flags, quals, raises, |
b1cfe2be | 8195 | friendp ? -1 : 0, friendp, 1, 0, funcdef_flag, |
8417823c | 8196 | template_count, in_namespace); |
617abf06 | 8197 | if (decl == NULL_TREE) |
8198 | return NULL_TREE; | |
471086d6 | 8199 | } |
d2b38b0e | 8200 | else if (!staticp && !dependent_type_p (type) |
4b72716d | 8201 | && !COMPLETE_TYPE_P (complete_type (type)) |
471086d6 | 8202 | && (TREE_CODE (type) != ARRAY_TYPE || initialized == 0)) |
8203 | { | |
1e66592c | 8204 | if (declarator) |
cf103c6c | 8205 | error ("field `%D' has incomplete type", declarator); |
1e66592c | 8206 | else |
cf103c6c | 8207 | error ("name `%T' has incomplete type", type); |
471086d6 | 8208 | |
8209 | /* If we're instantiating a template, tell them which | |
8210 | instantiation made the field's type be incomplete. */ | |
8211 | if (current_class_type | |
8212 | && TYPE_NAME (current_class_type) | |
b0df6589 | 8213 | && IDENTIFIER_TEMPLATE (TYPE_IDENTIFIER (current_class_type)) |
471086d6 | 8214 | && declspecs && TREE_VALUE (declspecs) |
8215 | && TREE_TYPE (TREE_VALUE (declspecs)) == type) | |
cf103c6c | 8216 | error (" in instantiation of template `%T'", |
c25194fd | 8217 | current_class_type); |
8218 | ||
471086d6 | 8219 | type = error_mark_node; |
8220 | decl = NULL_TREE; | |
8221 | } | |
8222 | else | |
8223 | { | |
8224 | if (friendp) | |
8225 | { | |
286daa79 | 8226 | error ("`%E' is neither function nor member function; " |
8227 | "cannot be declared friend", declarator); | |
471086d6 | 8228 | friendp = 0; |
8229 | } | |
8230 | decl = NULL_TREE; | |
8231 | } | |
8232 | ||
8233 | if (friendp) | |
8234 | { | |
8235 | /* Friends are treated specially. */ | |
8236 | if (ctype == current_class_type) | |
905d4035 | 8237 | warning ("member functions are implicitly friends of their class"); |
69b6679c | 8238 | else if (decl && DECL_NAME (decl)) |
8239 | { | |
8240 | if (template_class_depth (current_class_type) == 0) | |
8241 | { | |
8242 | decl = check_explicit_specialization | |
8243 | (declarator, decl, template_count, | |
8244 | 2 * (funcdef_flag != 0) + 4); | |
8245 | if (decl == error_mark_node) | |
8246 | return error_mark_node; | |
8247 | } | |
8248 | ||
8249 | decl = do_friend (ctype, declarator, decl, | |
7ef14399 | 8250 | *attrlist, flags, quals, funcdef_flag); |
69b6679c | 8251 | return decl; |
8252 | } | |
8253 | else | |
8254 | return void_type_node; | |
471086d6 | 8255 | } |
8256 | ||
331bc0ad | 8257 | /* Structure field. It may not be a function, except for C++. */ |
471086d6 | 8258 | |
8259 | if (decl == NULL_TREE) | |
8260 | { | |
471086d6 | 8261 | if (initialized) |
8262 | { | |
1ca935fd | 8263 | if (!staticp) |
8264 | { | |
8265 | /* An attempt is being made to initialize a non-static | |
8266 | member. But, from [class.mem]: | |
980877d7 | 8267 | |
1ca935fd | 8268 | 4 A member-declarator can contain a |
8269 | constant-initializer only if it declares a static | |
8270 | member (_class.static_) of integral or enumeration | |
980877d7 | 8271 | type, see _class.static.data_. |
1ca935fd | 8272 | |
8273 | This used to be relatively common practice, but | |
8274 | the rest of the compiler does not correctly | |
8275 | handle the initialization unless the member is | |
8276 | static so we make it static below. */ | |
cf103c6c | 8277 | pedwarn ("ISO C++ forbids initialization of member `%D'", |
1ca935fd | 8278 | declarator); |
cf103c6c | 8279 | pedwarn ("making `%D' static", declarator); |
1ca935fd | 8280 | staticp = 1; |
8281 | } | |
8282 | ||
df5066e2 | 8283 | if (uses_template_parms (type)) |
8284 | /* We'll check at instantiation time. */ | |
8285 | ; | |
8286 | else if (check_static_variable_definition (declarator, | |
8287 | type)) | |
8288 | /* If we just return the declaration, crashes | |
8289 | will sometimes occur. We therefore return | |
37b8b0d0 | 8290 | void_type_node, as if this was a friend |
8291 | declaration, to cause callers to completely | |
8292 | ignore this declaration. */ | |
df5066e2 | 8293 | return void_type_node; |
471086d6 | 8294 | } |
8295 | ||
1ca935fd | 8296 | if (staticp) |
471086d6 | 8297 | { |
2ee03578 | 8298 | /* C++ allows static class members. All other work |
8299 | for this is done by grokfield. */ | |
c4802aa6 | 8300 | decl = build_lang_decl (VAR_DECL, declarator, type); |
822f06da | 8301 | TREE_STATIC (decl) = 1; |
8302 | /* In class context, 'static' means public access. */ | |
1ca935fd | 8303 | TREE_PUBLIC (decl) = DECL_EXTERNAL (decl) = 1; |
471086d6 | 8304 | } |
8305 | else | |
8306 | { | |
a484e8db | 8307 | decl = build_decl (FIELD_DECL, declarator, type); |
851dfbff | 8308 | DECL_NONADDRESSABLE_P (decl) = bitfield; |
471086d6 | 8309 | if (RIDBIT_SETP (RID_MUTABLE, specbits)) |
8310 | { | |
8311 | DECL_MUTABLE_P (decl) = 1; | |
8312 | RIDBIT_RESET (RID_MUTABLE, specbits); | |
8313 | } | |
8314 | } | |
8315 | ||
8316 | bad_specifiers (decl, "field", virtualp, quals != NULL_TREE, | |
8317 | inlinep, friendp, raises != NULL_TREE); | |
8318 | } | |
8319 | } | |
e310e8dd | 8320 | else if (TREE_CODE (type) == FUNCTION_TYPE |
8321 | || TREE_CODE (type) == METHOD_TYPE) | |
471086d6 | 8322 | { |
b1cfe2be | 8323 | tree original_name; |
471086d6 | 8324 | int publicp = 0; |
8325 | ||
8326 | if (! declarator) | |
8327 | return NULL_TREE; | |
8328 | ||
b1cfe2be | 8329 | if (TREE_CODE (declarator) == TEMPLATE_ID_EXPR) |
8330 | original_name = dname; | |
8331 | else | |
8332 | original_name = declarator; | |
8333 | ||
0543e7a9 | 8334 | if (RIDBIT_SETP (RID_AUTO, specbits)) |
905d4035 | 8335 | error ("storage class `auto' invalid for function `%s'", name); |
0543e7a9 | 8336 | else if (RIDBIT_SETP (RID_REGISTER, specbits)) |
905d4035 | 8337 | error ("storage class `register' invalid for function `%s'", name); |
e396cd54 | 8338 | else if (RIDBIT_SETP (RID_THREAD, specbits)) |
8339 | error ("storage class `__thread' invalid for function `%s'", name); | |
471086d6 | 8340 | |
8341 | /* Function declaration not at top level. | |
8342 | Storage classes other than `extern' are not allowed | |
8343 | and `extern' makes no difference. */ | |
d0622bdf | 8344 | if (! toplevel_bindings_p () |
0543e7a9 | 8345 | && (RIDBIT_SETP (RID_STATIC, specbits) |
8346 | || RIDBIT_SETP (RID_INLINE, specbits)) | |
471086d6 | 8347 | && pedantic) |
0543e7a9 | 8348 | { |
8349 | if (RIDBIT_SETP (RID_STATIC, specbits)) | |
905d4035 | 8350 | pedwarn ("storage class `static' invalid for function `%s' declared out of global scope", name); |
0543e7a9 | 8351 | else |
905d4035 | 8352 | pedwarn ("storage class `inline' invalid for function `%s' declared out of global scope", name); |
0543e7a9 | 8353 | } |
980877d7 | 8354 | |
471086d6 | 8355 | if (ctype == NULL_TREE) |
8356 | { | |
8357 | if (virtualp) | |
8358 | { | |
905d4035 | 8359 | error ("virtual non-class function `%s'", name); |
471086d6 | 8360 | virtualp = 0; |
8361 | } | |
471086d6 | 8362 | } |
7ef14399 | 8363 | else if (TREE_CODE (type) == FUNCTION_TYPE && staticp < 2 |
8364 | && !NEW_DELETE_OPNAME_P (original_name)) | |
5bfb0742 | 8365 | type = build_method_type_directly (ctype, |
8366 | TREE_TYPE (type), | |
8367 | TYPE_ARG_TYPES (type)); | |
471086d6 | 8368 | |
c76251c1 | 8369 | /* Record presence of `static'. */ |
bb09dca5 | 8370 | publicp = (ctype != NULL_TREE |
d0622bdf | 8371 | || RIDBIT_SETP (RID_EXTERN, specbits) |
c76251c1 | 8372 | || !RIDBIT_SETP (RID_STATIC, specbits)); |
471086d6 | 8373 | |
7ef14399 | 8374 | decl = grokfndecl (ctype, type, original_name, parms, declarator, |
607f6131 | 8375 | virtualp, flags, quals, raises, |
668ae905 | 8376 | 1, friendp, |
980877d7 | 8377 | publicp, inlinep, funcdef_flag, |
8417823c | 8378 | template_count, in_namespace); |
617abf06 | 8379 | if (decl == NULL_TREE) |
8380 | return NULL_TREE; | |
471086d6 | 8381 | |
471086d6 | 8382 | if (staticp == 1) |
8383 | { | |
6c0cc2cd | 8384 | int invalid_static = 0; |
471086d6 | 8385 | |
8386 | /* Don't allow a static member function in a class, and forbid | |
8387 | declaring main to be static. */ | |
8388 | if (TREE_CODE (type) == METHOD_TYPE) | |
8389 | { | |
cf103c6c | 8390 | pedwarn ("cannot declare member function `%D' to have static linkage", decl); |
6c0cc2cd | 8391 | invalid_static = 1; |
471086d6 | 8392 | } |
471086d6 | 8393 | else if (current_function_decl) |
8394 | { | |
8395 | /* FIXME need arm citation */ | |
905d4035 | 8396 | error ("cannot declare static function inside another function"); |
6c0cc2cd | 8397 | invalid_static = 1; |
471086d6 | 8398 | } |
8399 | ||
6c0cc2cd | 8400 | if (invalid_static) |
471086d6 | 8401 | { |
8402 | staticp = 0; | |
8403 | RIDBIT_RESET (RID_STATIC, specbits); | |
8404 | } | |
8405 | } | |
471086d6 | 8406 | } |
8407 | else | |
8408 | { | |
8409 | /* It's a variable. */ | |
8410 | ||
8411 | /* An uninitialized decl with `extern' is a reference. */ | |
980877d7 | 8412 | decl = grokvardecl (type, declarator, &specbits, |
8413 | initialized, | |
8414 | (type_quals & TYPE_QUAL_CONST) != 0, | |
3645386f | 8415 | ctype ? ctype : in_namespace); |
471086d6 | 8416 | bad_specifiers (decl, "variable", virtualp, quals != NULL_TREE, |
8417 | inlinep, friendp, raises != NULL_TREE); | |
8418 | ||
8419 | if (ctype) | |
8420 | { | |
617abf06 | 8421 | DECL_CONTEXT (decl) = ctype; |
471086d6 | 8422 | if (staticp == 1) |
8423 | { | |
cf103c6c | 8424 | pedwarn ("`static' may not be used when defining (as opposed to declaring) a static data member"); |
471086d6 | 8425 | staticp = 0; |
8426 | RIDBIT_RESET (RID_STATIC, specbits); | |
8427 | } | |
1e66592c | 8428 | if (RIDBIT_SETP (RID_REGISTER, specbits) && TREE_STATIC (decl)) |
8429 | { | |
cf103c6c | 8430 | error ("static member `%D' declared `register'", decl); |
1e66592c | 8431 | RIDBIT_RESET (RID_REGISTER, specbits); |
8432 | } | |
ce28ee2e | 8433 | if (RIDBIT_SETP (RID_EXTERN, specbits) && pedantic) |
471086d6 | 8434 | { |
cf103c6c | 8435 | pedwarn ("cannot explicitly declare member `%#D' to have extern linkage", |
ce28ee2e | 8436 | decl); |
471086d6 | 8437 | RIDBIT_RESET (RID_EXTERN, specbits); |
8438 | } | |
8439 | } | |
8440 | } | |
8441 | ||
2a80b8e1 | 8442 | my_friendly_assert (!RIDBIT_SETP (RID_MUTABLE, specbits), 19990927); |
471086d6 | 8443 | |
8444 | /* Record `register' declaration for warnings on & | |
8445 | and in case doing stupid register allocation. */ | |
8446 | ||
8447 | if (RIDBIT_SETP (RID_REGISTER, specbits)) | |
8448 | DECL_REGISTER (decl) = 1; | |
8449 | ||
0543e7a9 | 8450 | if (RIDBIT_SETP (RID_EXTERN, specbits)) |
8451 | DECL_THIS_EXTERN (decl) = 1; | |
8452 | ||
bb09dca5 | 8453 | if (RIDBIT_SETP (RID_STATIC, specbits)) |
8454 | DECL_THIS_STATIC (decl) = 1; | |
8455 | ||
e9c0ac6a | 8456 | /* Record constancy and volatility. There's no need to do this |
8457 | when processing a template; we'll do this for the instantiated | |
8458 | declaration based on the type of DECL. */ | |
8459 | if (!processing_template_decl) | |
8460 | c_apply_type_quals_to_decl (type_quals, decl); | |
471086d6 | 8461 | |
8462 | return decl; | |
8463 | } | |
8464 | } | |
8465 | \f | |
53137e6a | 8466 | /* Subroutine of start_function. Ensure that each of the parameter |
8467 | types (as listed in PARMS) is complete, as is required for a | |
8468 | function definition. */ | |
96624a9e | 8469 | |
471086d6 | 8470 | static void |
1b72315d | 8471 | require_complete_types_for_parms (tree parms) |
471086d6 | 8472 | { |
3d411d73 | 8473 | for (; parms; parms = TREE_CHAIN (parms)) |
471086d6 | 8474 | { |
1d75985e | 8475 | if (VOID_TYPE_P (TREE_TYPE (parms))) |
331bc0ad | 8476 | /* grokparms will have already issued an error. */ |
1d75985e | 8477 | TREE_TYPE (parms) = error_mark_node; |
8478 | else if (complete_type_or_else (TREE_TYPE (parms), parms)) | |
4c9d06ba | 8479 | { |
8480 | layout_decl (parms, 0); | |
8481 | DECL_ARG_TYPE (parms) = type_passed_as (TREE_TYPE (parms)); | |
8482 | } | |
471086d6 | 8483 | } |
8484 | } | |
8485 | ||
3160db1d | 8486 | /* Returns nonzero if T is a local variable. */ |
74410faa | 8487 | |
31236dcd | 8488 | int |
1b72315d | 8489 | local_variable_p (tree t) |
74410faa | 8490 | { |
980877d7 | 8491 | if ((TREE_CODE (t) == VAR_DECL |
74410faa | 8492 | /* A VAR_DECL with a context that is a _TYPE is a static data |
8493 | member. */ | |
8494 | && !TYPE_P (CP_DECL_CONTEXT (t)) | |
8495 | /* Any other non-local variable must be at namespace scope. */ | |
31236dcd | 8496 | && !DECL_NAMESPACE_SCOPE_P (t)) |
74410faa | 8497 | || (TREE_CODE (t) == PARM_DECL)) |
31236dcd | 8498 | return 1; |
74410faa | 8499 | |
31236dcd | 8500 | return 0; |
8501 | } | |
8502 | ||
3160db1d | 8503 | /* Returns nonzero if T is an automatic local variable or a label. |
31236dcd | 8504 | (These are the declarations that need to be remapped when the code |
8505 | containing them is duplicated.) */ | |
8506 | ||
8507 | int | |
1b72315d | 8508 | nonstatic_local_decl_p (tree t) |
31236dcd | 8509 | { |
8510 | return ((local_variable_p (t) && !TREE_STATIC (t)) | |
8511 | || TREE_CODE (t) == LABEL_DECL | |
8512 | || TREE_CODE (t) == RESULT_DECL); | |
8513 | } | |
8514 | ||
8515 | /* Like local_variable_p, but suitable for use as a tree-walking | |
8516 | function. */ | |
8517 | ||
8518 | static tree | |
1b72315d | 8519 | local_variable_p_walkfn (tree* tp, |
8520 | int* walk_subtrees ATTRIBUTE_UNUSED , | |
8521 | void* data ATTRIBUTE_UNUSED ) | |
31236dcd | 8522 | { |
980877d7 | 8523 | return ((local_variable_p (*tp) && !DECL_ARTIFICIAL (*tp)) |
31236dcd | 8524 | ? *tp : NULL_TREE); |
74410faa | 8525 | } |
8526 | ||
8527 | /* Check that ARG, which is a default-argument expression for a | |
6c0cc2cd | 8528 | parameter DECL, is valid. Returns ARG, or ERROR_MARK_NODE, if |
74410faa | 8529 | something goes wrong. DECL may also be a _TYPE node, rather than a |
8530 | DECL, if there is no DECL available. */ | |
8531 | ||
8532 | tree | |
1b72315d | 8533 | check_default_argument (tree decl, tree arg) |
74410faa | 8534 | { |
8535 | tree var; | |
8536 | tree decl_type; | |
8537 | ||
8538 | if (TREE_CODE (arg) == DEFAULT_ARG) | |
8539 | /* We get a DEFAULT_ARG when looking at an in-class declaration | |
8540 | with a default argument. Ignore the argument for now; we'll | |
8541 | deal with it after the class is complete. */ | |
8542 | return arg; | |
8543 | ||
8544 | if (processing_template_decl || uses_template_parms (arg)) | |
8545 | /* We don't do anything checking until instantiation-time. Note | |
8546 | that there may be uninstantiated arguments even for an | |
8547 | instantiated function, since default arguments are not | |
8548 | instantiated until they are needed. */ | |
8549 | return arg; | |
8550 | ||
8551 | if (TYPE_P (decl)) | |
8552 | { | |
8553 | decl_type = decl; | |
8554 | decl = NULL_TREE; | |
8555 | } | |
8556 | else | |
8557 | decl_type = TREE_TYPE (decl); | |
8558 | ||
980877d7 | 8559 | if (arg == error_mark_node |
74410faa | 8560 | || decl == error_mark_node |
8561 | || TREE_TYPE (arg) == error_mark_node | |
8562 | || decl_type == error_mark_node) | |
8563 | /* Something already went wrong. There's no need to check | |
8564 | further. */ | |
8565 | return error_mark_node; | |
8566 | ||
8567 | /* [dcl.fct.default] | |
980877d7 | 8568 | |
74410faa | 8569 | A default argument expression is implicitly converted to the |
8570 | parameter type. */ | |
8571 | if (!TREE_TYPE (arg) | |
8572 | || !can_convert_arg (decl_type, TREE_TYPE (arg), arg)) | |
8573 | { | |
8574 | if (decl) | |
cf103c6c | 8575 | error ("default argument for `%#D' has type `%T'", |
74410faa | 8576 | decl, TREE_TYPE (arg)); |
8577 | else | |
cf103c6c | 8578 | error ("default argument for parameter of type `%T' has type `%T'", |
74410faa | 8579 | decl_type, TREE_TYPE (arg)); |
8580 | ||
8581 | return error_mark_node; | |
8582 | } | |
8583 | ||
8584 | /* [dcl.fct.default] | |
8585 | ||
8586 | Local variables shall not be used in default argument | |
980877d7 | 8587 | expressions. |
74410faa | 8588 | |
8589 | The keyword `this' shall not be used in a default argument of a | |
8590 | member function. */ | |
3c3beda6 | 8591 | var = walk_tree_without_duplicates (&arg, local_variable_p_walkfn, |
39adccd6 | 8592 | NULL); |
74410faa | 8593 | if (var) |
8594 | { | |
cf103c6c | 8595 | error ("default argument `%E' uses local variable `%D'", |
74410faa | 8596 | arg, var); |
8597 | return error_mark_node; | |
8598 | } | |
8599 | ||
8600 | /* All is well. */ | |
8601 | return arg; | |
8602 | } | |
8603 | ||
471086d6 | 8604 | /* Decode the list of parameter types for a function type. |
8605 | Given the list of things declared inside the parens, | |
8606 | return a list of types. | |
8607 | ||
1d75985e | 8608 | We determine whether ellipsis parms are used by PARMLIST_ELLIPSIS_P |
8609 | flag. If unset, we append void_list_node. A parmlist declared | |
8610 | as `(void)' is accepted as the empty parmlist. | |
8611 | ||
7ef14399 | 8612 | *PARMS is set to the chain of PARM_DECLs created. */ |
471086d6 | 8613 | |
8614 | static tree | |
7ef14399 | 8615 | grokparms (tree first_parm, tree *parms) |
471086d6 | 8616 | { |
8617 | tree result = NULL_TREE; | |
8618 | tree decls = NULL_TREE; | |
1d75985e | 8619 | int ellipsis = !first_parm || PARMLIST_ELLIPSIS_P (first_parm); |
8620 | tree parm, chain; | |
8621 | int any_error = 0; | |
471086d6 | 8622 | |
1d75985e | 8623 | my_friendly_assert (!first_parm || TREE_PARMLIST (first_parm), 20001115); |
8624 | ||
8625 | for (parm = first_parm; parm != NULL_TREE; parm = chain) | |
471086d6 | 8626 | { |
8bc97186 | 8627 | tree type = NULL_TREE; |
bf2bc322 | 8628 | tree decl = TREE_VALUE (parm); |
1d75985e | 8629 | tree init = TREE_PURPOSE (parm); |
bf2bc322 | 8630 | tree specs, attrs; |
471086d6 | 8631 | |
1d75985e | 8632 | chain = TREE_CHAIN (parm); |
8633 | /* @@ weak defense against parse errors. */ | |
8634 | if (TREE_CODE (decl) != VOID_TYPE | |
8635 | && TREE_CODE (decl) != TREE_LIST) | |
471086d6 | 8636 | { |
1d75985e | 8637 | /* Give various messages as the need arises. */ |
8638 | if (TREE_CODE (decl) == STRING_CST) | |
cf103c6c | 8639 | error ("invalid string constant `%E'", decl); |
1d75985e | 8640 | else if (TREE_CODE (decl) == INTEGER_CST) |
8641 | error ("invalid integer constant in parameter list, did you forget to give parameter name?"); | |
8642 | continue; | |
8643 | } | |
471086d6 | 8644 | |
1d75985e | 8645 | if (parm == void_list_node) |
8646 | break; | |
471086d6 | 8647 | |
bf2bc322 | 8648 | split_specs_attrs (TREE_PURPOSE (decl), &specs, &attrs); |
8649 | decl = grokdeclarator (TREE_VALUE (decl), specs, | |
8650 | PARM, init != NULL_TREE, &attrs); | |
1d75985e | 8651 | if (! decl || TREE_TYPE (decl) == error_mark_node) |
8652 | continue; | |
20c01ba9 | 8653 | |
bf2bc322 | 8654 | if (attrs) |
8655 | cplus_decl_attributes (&decl, attrs, 0); | |
8656 | ||
1d75985e | 8657 | type = TREE_TYPE (decl); |
8658 | if (VOID_TYPE_P (type)) | |
8659 | { | |
8660 | if (same_type_p (type, void_type_node) | |
8661 | && !DECL_NAME (decl) && !result && !chain && !ellipsis) | |
8662 | /* this is a parmlist of `(void)', which is ok. */ | |
8663 | break; | |
1dd25100 | 8664 | cxx_incomplete_type_error (decl, type); |
8bc97186 | 8665 | /* It's not a good idea to actually create parameters of |
8666 | type `void'; other parts of the compiler assume that a | |
8667 | void type terminates the parameter list. */ | |
0cd69b17 | 8668 | type = error_mark_node; |
8bc97186 | 8669 | TREE_TYPE (decl) = error_mark_node; |
1d75985e | 8670 | } |
471086d6 | 8671 | |
20c01ba9 | 8672 | if (type != error_mark_node) |
0cd69b17 | 8673 | { |
8674 | /* Top-level qualifiers on the parameters are | |
8675 | ignored for function types. */ | |
66521570 | 8676 | type = cp_build_qualified_type (type, 0); |
0cd69b17 | 8677 | if (TREE_CODE (type) == METHOD_TYPE) |
8678 | { | |
cf103c6c | 8679 | error ("parameter `%D' invalidly declared method type", decl); |
0cd69b17 | 8680 | type = build_pointer_type (type); |
8681 | TREE_TYPE (decl) = type; | |
8682 | } | |
0cd69b17 | 8683 | else if (abstract_virtuals_error (decl, type)) |
a109dc3b | 8684 | any_error = 1; /* Seems like a good idea. */ |
0cd69b17 | 8685 | else if (POINTER_TYPE_P (type)) |
8686 | { | |
8687 | /* [dcl.fct]/6, parameter types cannot contain pointers | |
8688 | (references) to arrays of unknown bound. */ | |
3b6baa6d | 8689 | tree t = TREE_TYPE (type); |
8690 | int ptr = TYPE_PTR_P (type); | |
8691 | ||
8692 | while (1) | |
8693 | { | |
8694 | if (TYPE_PTR_P (t)) | |
8695 | ptr = 1; | |
8696 | else if (TREE_CODE (t) != ARRAY_TYPE) | |
8697 | break; | |
8698 | else if (!TYPE_DOMAIN (t)) | |
8699 | break; | |
8700 | t = TREE_TYPE (t); | |
8701 | } | |
0cd69b17 | 8702 | if (TREE_CODE (t) == ARRAY_TYPE) |
cf103c6c | 8703 | error ("parameter `%D' includes %s to array of unknown bound `%T'", |
3b6baa6d | 8704 | decl, ptr ? "pointer" : "reference", t); |
0cd69b17 | 8705 | } |
8706 | ||
0cd69b17 | 8707 | if (!any_error && init) |
8708 | init = check_default_argument (decl, init); | |
8709 | else | |
8710 | init = NULL_TREE; | |
8711 | } | |
471086d6 | 8712 | |
1d75985e | 8713 | TREE_CHAIN (decl) = decls; |
8714 | decls = decl; | |
8bc97186 | 8715 | result = tree_cons (init, type, result); |
471086d6 | 8716 | } |
1d75985e | 8717 | decls = nreverse (decls); |
8718 | result = nreverse (result); | |
8719 | if (!ellipsis) | |
8720 | result = chainon (result, void_list_node); | |
7ef14399 | 8721 | *parms = decls; |
471086d6 | 8722 | |
471086d6 | 8723 | return result; |
8724 | } | |
03db3ebd | 8725 | |
471086d6 | 8726 | \f |
01779b5f | 8727 | /* D is a constructor or overloaded `operator='. |
8728 | ||
8729 | Let T be the class in which D is declared. Then, this function | |
8730 | returns: | |
8731 | ||
8732 | -1 if D's is an ill-formed constructor or copy assignment operator | |
8733 | whose first parameter is of type `T'. | |
8734 | 0 if D is not a copy constructor or copy assignment | |
8735 | operator. | |
8736 | 1 if D is a copy constructor or copy assignment operator whose | |
8737 | first parameter is a reference to const qualified T. | |
8738 | 2 if D is a copy constructor or copy assignment operator whose | |
8739 | first parameter is a reference to non-const qualified T. | |
8740 | ||
8741 | This function can be used as a predicate. Positive values indicate | |
3160db1d | 8742 | a copy constructor and nonzero values indicate a copy assignment |
9ba4048d | 8743 | operator. */ |
8744 | ||
f9670f72 | 8745 | int |
1b72315d | 8746 | copy_fn_p (tree d) |
f9670f72 | 8747 | { |
01779b5f | 8748 | tree args; |
8749 | tree arg_type; | |
8750 | int result = 1; | |
8751 | ||
8752 | my_friendly_assert (DECL_FUNCTION_MEMBER_P (d), 20011208); | |
9ba4048d | 8753 | |
01779b5f | 8754 | if (DECL_TEMPLATE_INFO (d) && is_member_template (DECL_TI_TEMPLATE (d))) |
8755 | /* Instantiations of template member functions are never copy | |
8756 | functions. Note that member functions of templated classes are | |
8757 | represented as template functions internally, and we must | |
8758 | accept those as copy functions. */ | |
8759 | return 0; | |
8760 | ||
8761 | args = FUNCTION_FIRST_USER_PARMTYPE (d); | |
8762 | if (!args) | |
9ba4048d | 8763 | return 0; |
8764 | ||
01779b5f | 8765 | arg_type = TREE_VALUE (args); |
8766 | ||
8767 | if (TYPE_MAIN_VARIANT (arg_type) == DECL_CONTEXT (d)) | |
8768 | { | |
8769 | /* Pass by value copy assignment operator. */ | |
8770 | result = -1; | |
8771 | } | |
8772 | else if (TREE_CODE (arg_type) == REFERENCE_TYPE | |
8773 | && TYPE_MAIN_VARIANT (TREE_TYPE (arg_type)) == DECL_CONTEXT (d)) | |
8774 | { | |
8775 | if (CP_TYPE_CONST_P (TREE_TYPE (arg_type))) | |
8776 | result = 2; | |
8777 | } | |
8778 | else | |
8779 | return 0; | |
8780 | ||
8781 | args = TREE_CHAIN (args); | |
8782 | ||
8783 | if (args && args != void_list_node && !TREE_PURPOSE (args)) | |
8784 | /* There are more non-optional args. */ | |
8785 | return 0; | |
8786 | ||
8787 | return result; | |
8788 | } | |
8789 | ||
8790 | /* Remember any special properties of member function DECL. */ | |
8791 | ||
1b72315d | 8792 | void grok_special_member_properties (tree decl) |
01779b5f | 8793 | { |
8794 | if (!DECL_NONSTATIC_MEMBER_FUNCTION_P(decl)) | |
8795 | ; /* Not special. */ | |
8796 | else if (DECL_CONSTRUCTOR_P (decl)) | |
8797 | { | |
8798 | int ctor = copy_fn_p (decl); | |
8799 | ||
8800 | if (ctor > 0) | |
8801 | { | |
8802 | /* [class.copy] | |
8803 | ||
8804 | A non-template constructor for class X is a copy | |
8805 | constructor if its first parameter is of type X&, const | |
8806 | X&, volatile X& or const volatile X&, and either there | |
8807 | are no other parameters or else all other parameters have | |
8808 | default arguments. */ | |
8809 | TYPE_HAS_INIT_REF (DECL_CONTEXT (decl)) = 1; | |
8810 | if (ctor > 1) | |
8811 | TYPE_HAS_CONST_INIT_REF (DECL_CONTEXT (decl)) = 1; | |
8812 | } | |
8813 | else if (sufficient_parms_p (FUNCTION_FIRST_USER_PARMTYPE (decl))) | |
8814 | TYPE_HAS_DEFAULT_CONSTRUCTOR (DECL_CONTEXT (decl)) = 1; | |
8815 | } | |
8816 | else if (DECL_OVERLOADED_OPERATOR_P (decl) == NOP_EXPR) | |
8817 | { | |
8818 | /* [class.copy] | |
8819 | ||
8820 | A non-template assignment operator for class X is a copy | |
8821 | assignment operator if its parameter is of type X, X&, const | |
8822 | X&, volatile X& or const volatile X&. */ | |
8823 | ||
8824 | int assop = copy_fn_p (decl); | |
8825 | ||
8826 | if (assop) | |
8827 | { | |
8828 | TYPE_HAS_ASSIGN_REF (DECL_CONTEXT (decl)) = 1; | |
8829 | if (assop != 1) | |
8830 | TYPE_HAS_CONST_ASSIGN_REF (DECL_CONTEXT (decl)) = 1; | |
8831 | if (DECL_PURE_VIRTUAL_P (decl)) | |
8832 | TYPE_HAS_ABSTRACT_ASSIGN_REF (DECL_CONTEXT (decl)) = 1; | |
8833 | } | |
8834 | } | |
f9670f72 | 8835 | } |
8836 | ||
01779b5f | 8837 | /* Check a constructor DECL has the correct form. Complains |
8838 | if the class has a constructor of the form X(X). */ | |
96624a9e | 8839 | |
ddb9bca7 | 8840 | int |
1b72315d | 8841 | grok_ctor_properties (tree ctype, tree decl) |
471086d6 | 8842 | { |
01779b5f | 8843 | int ctor_parm = copy_fn_p (decl); |
8844 | ||
8845 | if (ctor_parm < 0) | |
8846 | { | |
8847 | /* [class.copy] | |
8848 | ||
8849 | A declaration of a constructor for a class X is ill-formed if | |
8850 | its first parameter is of type (optionally cv-qualified) X | |
8851 | and either there are no other parameters or else all other | |
8852 | parameters have default arguments. | |
8853 | ||
8854 | We *don't* complain about member template instantiations that | |
8855 | have this form, though; they can occur as we try to decide | |
8856 | what constructor to use during overload resolution. Since | |
8857 | overload resolution will never prefer such a constructor to | |
8858 | the non-template copy constructor (which is either explicitly | |
8859 | or implicitly defined), there's no need to worry about their | |
8860 | existence. Theoretically, they should never even be | |
8861 | instantiated, but that's hard to forestall. */ | |
cf103c6c | 8862 | error ("invalid constructor; you probably meant `%T (const %T&)'", |
745f5bd2 | 8863 | ctype, ctype); |
745f5bd2 | 8864 | return 0; |
471086d6 | 8865 | } |
01779b5f | 8866 | |
ddb9bca7 | 8867 | return 1; |
471086d6 | 8868 | } |
8869 | ||
97cc4539 | 8870 | /* An operator with this code is unary, but can also be binary. */ |
96624a9e | 8871 | |
e581f478 | 8872 | static int |
1b72315d | 8873 | ambi_op_p (enum tree_code code) |
471086d6 | 8874 | { |
97cc4539 | 8875 | return (code == INDIRECT_REF |
8876 | || code == ADDR_EXPR | |
8877 | || code == CONVERT_EXPR | |
8878 | || code == NEGATE_EXPR | |
8879 | || code == PREINCREMENT_EXPR | |
8880 | || code == PREDECREMENT_EXPR); | |
471086d6 | 8881 | } |
8882 | ||
8883 | /* An operator with this name can only be unary. */ | |
96624a9e | 8884 | |
e581f478 | 8885 | static int |
1b72315d | 8886 | unary_op_p (enum tree_code code) |
471086d6 | 8887 | { |
97cc4539 | 8888 | return (code == TRUTH_NOT_EXPR |
8889 | || code == BIT_NOT_EXPR | |
8890 | || code == COMPONENT_REF | |
8891 | || code == TYPE_EXPR); | |
471086d6 | 8892 | } |
8893 | ||
b7d1e8ea | 8894 | /* DECL is a declaration for an overloaded operator. Returns true if |
8895 | the declaration is valid; false otherwise. If COMPLAIN is true, | |
8896 | errors are issued for invalid declarations. */ | |
96624a9e | 8897 | |
b7d1e8ea | 8898 | bool |
8899 | grok_op_properties (tree decl, int friendp, bool complain) | |
471086d6 | 8900 | { |
8901 | tree argtypes = TYPE_ARG_TYPES (TREE_TYPE (decl)); | |
97cc4539 | 8902 | tree argtype; |
471086d6 | 8903 | int methodp = (TREE_CODE (TREE_TYPE (decl)) == METHOD_TYPE); |
8904 | tree name = DECL_NAME (decl); | |
97cc4539 | 8905 | enum tree_code operator_code; |
8906 | int arity; | |
b7d1e8ea | 8907 | bool ok; |
8908 | ||
8909 | /* Assume that the declaration is valid. */ | |
8910 | ok = true; | |
97cc4539 | 8911 | |
8912 | /* Count the number of arguments. */ | |
8913 | for (argtype = argtypes, arity = 0; | |
8914 | argtype && argtype != void_list_node; | |
8915 | argtype = TREE_CHAIN (argtype)) | |
8916 | ++arity; | |
471086d6 | 8917 | |
e581f478 | 8918 | if (current_class_type == NULL_TREE) |
8919 | friendp = 1; | |
471086d6 | 8920 | |
97cc4539 | 8921 | if (DECL_CONV_FN_P (decl)) |
8922 | operator_code = TYPE_EXPR; | |
8923 | else | |
8924 | do | |
8925 | { | |
c5144efa | 8926 | #define DEF_OPERATOR(NAME, CODE, MANGLING, ARITY, ASSN_P) \ |
8927 | if (ansi_opname (CODE) == name) \ | |
8928 | { \ | |
7216a9ff | 8929 | operator_code = (CODE); \ |
c5144efa | 8930 | break; \ |
8931 | } \ | |
8932 | else if (ansi_assopname (CODE) == name) \ | |
8933 | { \ | |
7216a9ff | 8934 | operator_code = (CODE); \ |
c5144efa | 8935 | DECL_ASSIGNMENT_OPERATOR_P (decl) = 1; \ |
8936 | break; \ | |
97cc4539 | 8937 | } |
8938 | ||
8939 | #include "operators.def" | |
8940 | #undef DEF_OPERATOR | |
8941 | ||
523ac844 | 8942 | abort (); |
97cc4539 | 8943 | } |
8944 | while (0); | |
8945 | my_friendly_assert (operator_code != LAST_CPLUS_TREE_CODE, 20000526); | |
8946 | SET_OVERLOADED_OPERATOR_CODE (decl, operator_code); | |
8947 | ||
e581f478 | 8948 | if (! friendp) |
8949 | { | |
97cc4539 | 8950 | switch (operator_code) |
8951 | { | |
97cc4539 | 8952 | case NEW_EXPR: |
8953 | TYPE_HAS_NEW_OPERATOR (current_class_type) = 1; | |
8954 | break; | |
3c3beda6 | 8955 | |
97cc4539 | 8956 | case DELETE_EXPR: |
8957 | TYPE_GETS_DELETE (current_class_type) |= 1; | |
8958 | break; | |
3c3beda6 | 8959 | |
97cc4539 | 8960 | case VEC_NEW_EXPR: |
8961 | TYPE_HAS_ARRAY_NEW_OPERATOR (current_class_type) = 1; | |
8962 | break; | |
3c3beda6 | 8963 | |
97cc4539 | 8964 | case VEC_DELETE_EXPR: |
8965 | TYPE_GETS_DELETE (current_class_type) |= 2; | |
8966 | break; | |
8967 | ||
8968 | default: | |
8969 | break; | |
8970 | } | |
8971 | } | |
8972 | ||
8973 | if (operator_code == NEW_EXPR || operator_code == VEC_NEW_EXPR) | |
7ef14399 | 8974 | TREE_TYPE (decl) = coerce_new_type (TREE_TYPE (decl)); |
97cc4539 | 8975 | else if (operator_code == DELETE_EXPR || operator_code == VEC_DELETE_EXPR) |
7ef14399 | 8976 | TREE_TYPE (decl) = coerce_delete_type (TREE_TYPE (decl)); |
471086d6 | 8977 | else |
8978 | { | |
8979 | /* An operator function must either be a non-static member function | |
8980 | or have at least one parameter of a class, a reference to a class, | |
8981 | an enumeration, or a reference to an enumeration. 13.4.0.6 */ | |
94f3b32d | 8982 | if (! methodp || DECL_STATIC_FUNCTION_P (decl)) |
471086d6 | 8983 | { |
97cc4539 | 8984 | if (operator_code == TYPE_EXPR |
8985 | || operator_code == CALL_EXPR | |
8986 | || operator_code == COMPONENT_REF | |
8987 | || operator_code == ARRAY_REF | |
8988 | || operator_code == NOP_EXPR) | |
cf103c6c | 8989 | error ("`%D' must be a nonstatic member function", decl); |
471086d6 | 8990 | else |
8991 | { | |
b7d1e8ea | 8992 | tree p; |
471086d6 | 8993 | |
94f3b32d | 8994 | if (DECL_STATIC_FUNCTION_P (decl)) |
cf103c6c | 8995 | error ("`%D' must be either a non-static member function or a non-member function", decl); |
94f3b32d | 8996 | |
b7d1e8ea | 8997 | for (p = argtypes; p && p != void_list_node; p = TREE_CHAIN (p)) |
8998 | { | |
8999 | tree arg = non_reference (TREE_VALUE (p)); | |
9000 | /* IS_AGGR_TYPE, rather than CLASS_TYPE_P, is used | |
9001 | because these checks are performed even on | |
9002 | template functions. */ | |
9003 | if (IS_AGGR_TYPE (arg) || TREE_CODE (arg) == ENUMERAL_TYPE) | |
9004 | break; | |
9005 | } | |
9006 | ||
9007 | if (!p || p == void_list_node) | |
9008 | { | |
9009 | if (!complain) | |
9010 | return false; | |
9011 | ||
9012 | error ("`%D' must have an argument of class or " | |
9013 | "enumerated type", | |
9014 | decl); | |
9015 | ok = false; | |
9016 | } | |
471086d6 | 9017 | } |
9018 | } | |
980877d7 | 9019 | |
b7d1e8ea | 9020 | /* There are no restrictions on the arguments to an overloaded |
9021 | "operator ()". */ | |
97cc4539 | 9022 | if (operator_code == CALL_EXPR) |
b7d1e8ea | 9023 | return ok; |
471086d6 | 9024 | |
38281c46 | 9025 | if (IDENTIFIER_TYPENAME_P (name) && ! DECL_TEMPLATE_INFO (decl)) |
ddb9bca7 | 9026 | { |
9027 | tree t = TREE_TYPE (name); | |
6d97d550 | 9028 | if (! friendp) |
ddb9bca7 | 9029 | { |
9030 | int ref = (TREE_CODE (t) == REFERENCE_TYPE); | |
e1721763 | 9031 | const char *what = 0; |
3c3beda6 | 9032 | |
ddb9bca7 | 9033 | if (ref) |
9034 | t = TYPE_MAIN_VARIANT (TREE_TYPE (t)); | |
9035 | ||
6d97d550 | 9036 | if (TREE_CODE (t) == VOID_TYPE) |
9037 | what = "void"; | |
9038 | else if (t == current_class_type) | |
ddb9bca7 | 9039 | what = "the same type"; |
38281c46 | 9040 | /* Don't force t to be complete here. */ |
ddb9bca7 | 9041 | else if (IS_AGGR_TYPE (t) |
4b72716d | 9042 | && COMPLETE_TYPE_P (t) |
ddb9bca7 | 9043 | && DERIVED_FROM_P (t, current_class_type)) |
9044 | what = "a base class"; | |
9045 | ||
65404a7f | 9046 | if (what && warn_conversion) |
905d4035 | 9047 | warning ("conversion to %s%s will never use a type conversion operator", |
ddb9bca7 | 9048 | ref ? "a reference to " : "", what); |
9049 | } | |
9050 | } | |
01779b5f | 9051 | if (operator_code == COND_EXPR) |
471086d6 | 9052 | { |
9053 | /* 13.4.0.3 */ | |
cf103c6c | 9054 | error ("ISO C++ prohibits overloading operator ?:"); |
980877d7 | 9055 | } |
97cc4539 | 9056 | else if (ambi_op_p (operator_code)) |
471086d6 | 9057 | { |
97cc4539 | 9058 | if (arity == 1) |
9059 | /* We pick the one-argument operator codes by default, so | |
9060 | we don't have to change anything. */ | |
9061 | ; | |
9062 | else if (arity == 2) | |
471086d6 | 9063 | { |
97cc4539 | 9064 | /* If we thought this was a unary operator, we now know |
9065 | it to be a binary operator. */ | |
9066 | switch (operator_code) | |
9067 | { | |
9068 | case INDIRECT_REF: | |
9069 | operator_code = MULT_EXPR; | |
9070 | break; | |
9071 | ||
9072 | case ADDR_EXPR: | |
9073 | operator_code = BIT_AND_EXPR; | |
9074 | break; | |
9075 | ||
9076 | case CONVERT_EXPR: | |
9077 | operator_code = PLUS_EXPR; | |
9078 | break; | |
9079 | ||
9080 | case NEGATE_EXPR: | |
9081 | operator_code = MINUS_EXPR; | |
9082 | break; | |
9083 | ||
9084 | case PREINCREMENT_EXPR: | |
9085 | operator_code = POSTINCREMENT_EXPR; | |
9086 | break; | |
9087 | ||
9088 | case PREDECREMENT_EXPR: | |
b81be439 | 9089 | operator_code = POSTDECREMENT_EXPR; |
97cc4539 | 9090 | break; |
9091 | ||
9092 | default: | |
523ac844 | 9093 | abort (); |
97cc4539 | 9094 | } |
9095 | ||
9096 | SET_OVERLOADED_OPERATOR_CODE (decl, operator_code); | |
9097 | ||
9098 | if ((operator_code == POSTINCREMENT_EXPR | |
9099 | || operator_code == POSTDECREMENT_EXPR) | |
3cc0b4b9 | 9100 | && ! processing_template_decl |
48edae76 | 9101 | && ! same_type_p (TREE_VALUE (TREE_CHAIN (argtypes)), integer_type_node)) |
471086d6 | 9102 | { |
9103 | if (methodp) | |
cf103c6c | 9104 | error ("postfix `%D' must take `int' as its argument", |
471086d6 | 9105 | decl); |
9106 | else | |
cf103c6c | 9107 | error |
905d4035 | 9108 | ("postfix `%D' must take `int' as its second argument", |
9109 | decl); | |
471086d6 | 9110 | } |
9111 | } | |
9112 | else | |
9113 | { | |
9114 | if (methodp) | |
cf103c6c | 9115 | error ("`%D' must take either zero or one argument", decl); |
471086d6 | 9116 | else |
cf103c6c | 9117 | error ("`%D' must take either one or two arguments", decl); |
471086d6 | 9118 | } |
02d7f858 | 9119 | |
9120 | /* More Effective C++ rule 6. */ | |
f85d646a | 9121 | if (warn_ecpp |
97cc4539 | 9122 | && (operator_code == POSTINCREMENT_EXPR |
9123 | || operator_code == POSTDECREMENT_EXPR | |
9124 | || operator_code == PREINCREMENT_EXPR | |
9125 | || operator_code == PREDECREMENT_EXPR)) | |
02d7f858 | 9126 | { |
9127 | tree arg = TREE_VALUE (argtypes); | |
9128 | tree ret = TREE_TYPE (TREE_TYPE (decl)); | |
9129 | if (methodp || TREE_CODE (arg) == REFERENCE_TYPE) | |
9130 | arg = TREE_TYPE (arg); | |
9131 | arg = TYPE_MAIN_VARIANT (arg); | |
97cc4539 | 9132 | if (operator_code == PREINCREMENT_EXPR |
9133 | || operator_code == PREDECREMENT_EXPR) | |
02d7f858 | 9134 | { |
9135 | if (TREE_CODE (ret) != REFERENCE_TYPE | |
daf9ff67 | 9136 | || !same_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (ret)), |
9137 | arg)) | |
cf103c6c | 9138 | warning ("prefix `%D' should return `%T'", decl, |
02d7f858 | 9139 | build_reference_type (arg)); |
9140 | } | |
9141 | else | |
9142 | { | |
daf9ff67 | 9143 | if (!same_type_p (TYPE_MAIN_VARIANT (ret), arg)) |
cf103c6c | 9144 | warning ("postfix `%D' should return `%T'", decl, arg); |
02d7f858 | 9145 | } |
9146 | } | |
471086d6 | 9147 | } |
97cc4539 | 9148 | else if (unary_op_p (operator_code)) |
471086d6 | 9149 | { |
97cc4539 | 9150 | if (arity != 1) |
471086d6 | 9151 | { |
9152 | if (methodp) | |
cf103c6c | 9153 | error ("`%D' must take `void'", decl); |
471086d6 | 9154 | else |
cf103c6c | 9155 | error ("`%D' must take exactly one argument", decl); |
471086d6 | 9156 | } |
9157 | } | |
97cc4539 | 9158 | else /* if (binary_op_p (operator_code)) */ |
471086d6 | 9159 | { |
97cc4539 | 9160 | if (arity != 2) |
471086d6 | 9161 | { |
9162 | if (methodp) | |
cf103c6c | 9163 | error ("`%D' must take exactly one argument", decl); |
471086d6 | 9164 | else |
cf103c6c | 9165 | error ("`%D' must take exactly two arguments", decl); |
471086d6 | 9166 | } |
02d7f858 | 9167 | |
9168 | /* More Effective C++ rule 7. */ | |
f85d646a | 9169 | if (warn_ecpp |
97cc4539 | 9170 | && (operator_code == TRUTH_ANDIF_EXPR |
9171 | || operator_code == TRUTH_ORIF_EXPR | |
9172 | || operator_code == COMPOUND_EXPR)) | |
cf103c6c | 9173 | warning ("user-defined `%D' always evaluates both arguments", |
02d7f858 | 9174 | decl); |
9175 | } | |
9176 | ||
9177 | /* Effective C++ rule 23. */ | |
f85d646a | 9178 | if (warn_ecpp |
97cc4539 | 9179 | && arity == 2 |
40590b10 | 9180 | && !DECL_ASSIGNMENT_OPERATOR_P (decl) |
97cc4539 | 9181 | && (operator_code == PLUS_EXPR |
9182 | || operator_code == MINUS_EXPR | |
9183 | || operator_code == TRUNC_DIV_EXPR | |
40590b10 | 9184 | || operator_code == MULT_EXPR |
9185 | || operator_code == TRUNC_MOD_EXPR) | |
02d7f858 | 9186 | && TREE_CODE (TREE_TYPE (TREE_TYPE (decl))) == REFERENCE_TYPE) |
cf103c6c | 9187 | warning ("`%D' should return by value", decl); |
471086d6 | 9188 | |
01779b5f | 9189 | /* [over.oper]/8 */ |
356ca252 | 9190 | for (; argtypes && argtypes != void_list_node; |
9191 | argtypes = TREE_CHAIN (argtypes)) | |
9192 | if (TREE_PURPOSE (argtypes)) | |
9193 | { | |
9194 | TREE_PURPOSE (argtypes) = NULL_TREE; | |
97cc4539 | 9195 | if (operator_code == POSTINCREMENT_EXPR |
9196 | || operator_code == POSTDECREMENT_EXPR) | |
356ca252 | 9197 | { |
9198 | if (pedantic) | |
cf103c6c | 9199 | pedwarn ("`%D' cannot have default arguments", decl); |
356ca252 | 9200 | } |
9201 | else | |
cf103c6c | 9202 | error ("`%D' cannot have default arguments", decl); |
356ca252 | 9203 | } |
9204 | ||
471086d6 | 9205 | } |
b7d1e8ea | 9206 | |
9207 | return ok; | |
471086d6 | 9208 | } |
9209 | \f | |
e1721763 | 9210 | static const char * |
1b72315d | 9211 | tag_name (enum tag_types code) |
435a15bf | 9212 | { |
9213 | switch (code) | |
9214 | { | |
9215 | case record_type: | |
9216 | return "struct"; | |
9217 | case class_type: | |
9218 | return "class"; | |
9219 | case union_type: | |
9220 | return "union "; | |
9221 | case enum_type: | |
9222 | return "enum"; | |
435a15bf | 9223 | default: |
523ac844 | 9224 | abort (); |
435a15bf | 9225 | } |
9226 | } | |
9227 | ||
ac12b007 | 9228 | /* Name lookup in an elaborated-type-specifier (after the keyword |
b7d1e8ea | 9229 | indicated by TAG_CODE) has found the TYPE_DECL DECL. If the |
ac12b007 | 9230 | elaborated-type-specifier is invalid, issue a diagnostic and return |
b7d1e8ea | 9231 | error_mark_node; otherwise, return the *_TYPE to which it referred. |
220b71ed | 9232 | If ALLOW_TEMPLATE_P is true, TYPE may be a class template. */ |
ac12b007 | 9233 | |
8172be22 | 9234 | tree |
ac12b007 | 9235 | check_elaborated_type_specifier (enum tag_types tag_code, |
b7d1e8ea | 9236 | tree decl, |
220b71ed | 9237 | bool allow_template_p) |
ac12b007 | 9238 | { |
b7d1e8ea | 9239 | tree type; |
ac12b007 | 9240 | |
b7d1e8ea | 9241 | /* In the case of: |
9242 | ||
9243 | struct S { struct S *p; }; | |
9244 | ||
9245 | name lookup will find the TYPE_DECL for the implicit "S::S" | |
9246 | typedef. Adjust for that here. */ | |
9247 | if (DECL_SELF_REFERENCE_P (decl)) | |
9248 | decl = TYPE_NAME (TREE_TYPE (decl)); | |
9249 | ||
9250 | type = TREE_TYPE (decl); | |
9251 | ||
9252 | /* [dcl.type.elab] | |
9253 | ||
9254 | If the identifier resolves to a typedef-name or a template | |
9255 | type-parameter, the elaborated-type-specifier is ill-formed. | |
9256 | ||
9257 | In other words, the only legitimate declaration to use in the | |
9258 | elaborated type specifier is the implicit typedef created when | |
9259 | the type is declared. */ | |
9260 | if (!DECL_IMPLICIT_TYPEDEF_P (decl)) | |
ac12b007 | 9261 | { |
b7d1e8ea | 9262 | error ("using typedef-name `%D' after `%s'", decl, tag_name (tag_code)); |
9263 | return IS_AGGR_TYPE (type) ? type : error_mark_node; | |
ac12b007 | 9264 | } |
b7d1e8ea | 9265 | |
9266 | if (TREE_CODE (type) == TEMPLATE_TYPE_PARM) | |
ac12b007 | 9267 | { |
9268 | error ("using template type parameter `%T' after `%s'", | |
9269 | type, tag_name (tag_code)); | |
b7d1e8ea | 9270 | return error_mark_node; |
ac12b007 | 9271 | } |
220b71ed | 9272 | else if (TREE_CODE (type) != RECORD_TYPE |
9273 | && TREE_CODE (type) != UNION_TYPE | |
9274 | && tag_code != enum_type) | |
9275 | { | |
9276 | error ("`%T' referred to as `%s'", type, tag_name (tag_code)); | |
b7d1e8ea | 9277 | return error_mark_node; |
220b71ed | 9278 | } |
9279 | else if (TREE_CODE (type) != ENUMERAL_TYPE | |
9280 | && tag_code == enum_type) | |
9281 | { | |
9282 | error ("`%T' referred to as enum", type); | |
b7d1e8ea | 9283 | return error_mark_node; |
220b71ed | 9284 | } |
9285 | else if (!allow_template_p | |
9286 | && TREE_CODE (type) == RECORD_TYPE | |
9287 | && CLASSTYPE_IS_TEMPLATE (type)) | |
9288 | { | |
9289 | /* If a class template appears as elaborated type specifier | |
9290 | without a template header such as: | |
9291 | ||
9292 | template <class T> class C {}; | |
9293 | void f(class C); // No template header here | |
9294 | ||
9295 | then the required template argument is missing. */ | |
9296 | ||
9297 | error ("template argument required for `%s %T'", | |
9298 | tag_name (tag_code), | |
9299 | DECL_NAME (CLASSTYPE_TI_TEMPLATE (type))); | |
b7d1e8ea | 9300 | return error_mark_node; |
220b71ed | 9301 | } |
ac12b007 | 9302 | |
b7d1e8ea | 9303 | return type; |
ac12b007 | 9304 | } |
9305 | ||
220b71ed | 9306 | /* Get the struct, enum or union (TAG_CODE says which) with tag NAME. |
471086d6 | 9307 | Define the tag as a forward-reference if it is not defined. |
9308 | ||
220b71ed | 9309 | If a declaration is given, process it here, and report an error if |
fb3e3237 | 9310 | multiple declarations are not identical. |
471086d6 | 9311 | |
220b71ed | 9312 | GLOBALIZE is false when this is also a definition. Only look in |
471086d6 | 9313 | the current frame for the name (since C++ allows new names in any |
220b71ed | 9314 | scope.) |
9315 | ||
9316 | TEMPLATE_HEADER_P is true when this declaration is preceded by | |
9317 | a set of template parameters. */ | |
471086d6 | 9318 | |
471086d6 | 9319 | tree |
fb3e3237 | 9320 | xref_tag (enum tag_types tag_code, tree name, |
220b71ed | 9321 | bool globalize, bool template_header_p) |
471086d6 | 9322 | { |
471086d6 | 9323 | enum tree_code code; |
cd16867a | 9324 | tree t; |
1f3233d1 | 9325 | struct cp_binding_level *b = current_binding_level; |
162ed5b9 | 9326 | tree context = NULL_TREE; |
f5edc715 | 9327 | |
851fe51a | 9328 | timevar_push (TV_NAME_LOOKUP); |
220b71ed | 9329 | |
9330 | my_friendly_assert (TREE_CODE (name) == IDENTIFIER_NODE, 0); | |
9331 | ||
471086d6 | 9332 | switch (tag_code) |
9333 | { | |
9334 | case record_type: | |
9335 | case class_type: | |
471086d6 | 9336 | code = RECORD_TYPE; |
471086d6 | 9337 | break; |
9338 | case union_type: | |
9339 | code = UNION_TYPE; | |
471086d6 | 9340 | break; |
9341 | case enum_type: | |
9342 | code = ENUMERAL_TYPE; | |
9343 | break; | |
9344 | default: | |
523ac844 | 9345 | abort (); |
471086d6 | 9346 | } |
9347 | ||
1a3f833b | 9348 | if (! globalize) |
471086d6 | 9349 | { |
c24cced6 | 9350 | /* If we know we are defining this tag, only look it up in |
9351 | this scope and don't try to find it as a type. */ | |
220b71ed | 9352 | t = lookup_tag (code, name, b, 1); |
471086d6 | 9353 | } |
9354 | else | |
9355 | { | |
d48f6141 | 9356 | tree decl = lookup_name (name, 2); |
220b71ed | 9357 | |
9358 | if (decl && DECL_CLASS_TEMPLATE_P (decl)) | |
9359 | decl = DECL_TEMPLATE_RESULT (decl); | |
980877d7 | 9360 | |
220b71ed | 9361 | if (decl && TREE_CODE (decl) == TYPE_DECL) |
162ed5b9 | 9362 | { |
220b71ed | 9363 | /* Two cases we need to consider when deciding if a class |
9364 | template is allowed as an elaborated type specifier: | |
9365 | 1. It is a self reference to its own class. | |
9366 | 2. It comes with a template header. | |
162ed5b9 | 9367 | |
220b71ed | 9368 | For example: |
0f0d5a69 | 9369 | |
220b71ed | 9370 | template <class T> class C { |
9371 | class C *c1; // DECL_SELF_REFERENCE_P is true | |
9372 | class D; | |
9373 | }; | |
9374 | template <class U> class C; // template_header_p is true | |
9375 | template <class T> class C<T>::D { | |
9376 | class C *c2; // DECL_SELF_REFERENCE_P is true | |
9377 | }; */ | |
9378 | ||
b7d1e8ea | 9379 | t = check_elaborated_type_specifier (tag_code, |
9380 | decl, | |
220b71ed | 9381 | template_header_p |
9382 | | DECL_SELF_REFERENCE_P (decl)); | |
9383 | if (t == error_mark_node) | |
9384 | POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, error_mark_node); | |
162ed5b9 | 9385 | } |
220b71ed | 9386 | else |
9387 | t = NULL_TREE; | |
162ed5b9 | 9388 | |
220b71ed | 9389 | if (t && current_class_type |
980877d7 | 9390 | && template_class_depth (current_class_type) |
220b71ed | 9391 | && template_header_p) |
162ed5b9 | 9392 | { |
3160db1d | 9393 | /* Since GLOBALIZE is nonzero, we are not looking at a |
162ed5b9 | 9394 | definition of this tag. Since, in addition, we are currently |
9395 | processing a (member) template declaration of a template | |
9396 | class, we must be very careful; consider: | |
9397 | ||
9398 | template <class X> | |
9399 | struct S1 | |
9400 | ||
9401 | template <class U> | |
9402 | struct S2 | |
9403 | { template <class V> | |
9404 | friend struct S1; }; | |
9405 | ||
9406 | Here, the S2::S1 declaration should not be confused with the | |
9407 | outer declaration. In particular, the inner version should | |
9408 | have a template parameter of level 2, not level 1. This | |
9409 | would be particularly important if the member declaration | |
9410 | were instead: | |
9411 | ||
9412 | template <class V = U> friend struct S1; | |
9413 | ||
9414 | say, when we should tsubst into `U' when instantiating | |
9415 | S2. On the other hand, when presented with: | |
9416 | ||
9417 | template <class T> | |
9418 | struct S1 { | |
9419 | template <class U> | |
9420 | struct S2 {}; | |
9421 | template <class U> | |
9422 | friend struct S2; | |
9423 | }; | |
9424 | ||
9425 | we must find the inner binding eventually. We | |
9426 | accomplish this by making sure that the new type we | |
9427 | create to represent this declaration has the right | |
9428 | TYPE_CONTEXT. */ | |
220b71ed | 9429 | context = TYPE_CONTEXT (t); |
9430 | t = NULL_TREE; | |
471086d6 | 9431 | } |
9432 | } | |
9433 | ||
220b71ed | 9434 | if (! t) |
471086d6 | 9435 | { |
9436 | /* If no such tag is yet defined, create a forward-reference node | |
9437 | and record it as the "definition". | |
9438 | When a real declaration of this type is found, | |
9439 | the forward-reference will be altered into a real type. */ | |
471086d6 | 9440 | if (code == ENUMERAL_TYPE) |
9441 | { | |
cf103c6c | 9442 | error ("use of enum `%#D' without previous declaration", name); |
84a51273 | 9443 | POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, error_mark_node); |
471086d6 | 9444 | } |
471086d6 | 9445 | else |
9446 | { | |
220b71ed | 9447 | t = make_aggr_type (code); |
9448 | TYPE_CONTEXT (t) = context; | |
9449 | pushtag (name, t, globalize); | |
471086d6 | 9450 | } |
9451 | } | |
9452 | else | |
9453 | { | |
220b71ed | 9454 | if (!globalize && processing_template_decl && IS_AGGR_TYPE (t)) |
9455 | redeclare_class_template (t, current_template_parms); | |
86b92c8e | 9456 | else if (!processing_template_decl |
9457 | && CLASS_TYPE_P (t) | |
9458 | && CLASSTYPE_IS_TEMPLATE (t)) | |
9459 | { | |
9460 | error ("redeclaration of `%T' as a non-template", t); | |
9461 | t = error_mark_node; | |
9462 | } | |
471086d6 | 9463 | } |
9464 | ||
220b71ed | 9465 | POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, t); |
471086d6 | 9466 | } |
1a3f833b | 9467 | |
d2a15a12 | 9468 | tree |
1b72315d | 9469 | xref_tag_from_type (tree old, tree id, int globalize) |
d2a15a12 | 9470 | { |
160175b4 | 9471 | enum tag_types tag_kind; |
d2a15a12 | 9472 | |
9473 | if (TREE_CODE (old) == RECORD_TYPE) | |
160175b4 | 9474 | tag_kind = (CLASSTYPE_DECLARED_CLASS (old) ? class_type : record_type); |
d2a15a12 | 9475 | else |
160175b4 | 9476 | tag_kind = union_type; |
d2a15a12 | 9477 | |
9478 | if (id == NULL_TREE) | |
9479 | id = TYPE_IDENTIFIER (old); | |
9480 | ||
fb3e3237 | 9481 | return xref_tag (tag_kind, id, globalize, false); |
d2a15a12 | 9482 | } |
9483 | ||
d1aed66b | 9484 | /* REF is a type (named NAME), for which we have just seen some |
95f3173a | 9485 | baseclasses. BASE_LIST is a list of those baseclasses; the |
d1aed66b | 9486 | TREE_PURPOSE is an access_* node, and the TREE_VALUE is the type of |
95f3173a | 9487 | the base-class. TREE_VIA_VIRTUAL indicates virtual |
9488 | inheritance. CODE_TYPE_NODE indicates whether REF is a class, | |
d1aed66b | 9489 | struct, or union. */ |
9490 | ||
1a3f833b | 9491 | void |
95f3173a | 9492 | xref_basetypes (tree ref, tree base_list) |
1a3f833b | 9493 | { |
9494 | /* In the declaration `A : X, Y, ... Z' we mark all the types | |
9495 | (A, X, Y, ..., Z) so we can check for duplicates. */ | |
954ad420 | 9496 | tree *basep; |
b90e9c68 | 9497 | |
954ad420 | 9498 | int i; |
59cd1185 | 9499 | enum tag_types tag_code; |
e4eb931c | 9500 | |
670f67e2 | 9501 | if (ref == error_mark_node) |
9502 | return; | |
9503 | ||
8042247d | 9504 | if (TREE_CODE (ref) == UNION_TYPE) |
1a3f833b | 9505 | { |
cf103c6c | 9506 | error ("derived union `%T' invalid", ref); |
1a3f833b | 9507 | return; |
9508 | } | |
9509 | ||
8042247d | 9510 | tag_code = (CLASSTYPE_DECLARED_CLASS (ref) ? class_type : record_type); |
9511 | ||
b90e9c68 | 9512 | /* First, make sure that any templates in base-classes are |
9513 | instantiated. This ensures that if we call ourselves recursively | |
9514 | we do not get confused about which classes are marked and which | |
9515 | are not. */ | |
95f3173a | 9516 | basep = &base_list; |
954ad420 | 9517 | while (*basep) |
9518 | { | |
9519 | tree basetype = TREE_VALUE (*basep); | |
9520 | if (!(processing_template_decl && uses_template_parms (basetype)) | |
9521 | && !complete_type_or_else (basetype, NULL)) | |
95f3173a | 9522 | /* An incomplete type. Remove it from the list. */ |
954ad420 | 9523 | *basep = TREE_CHAIN (*basep); |
9524 | else | |
9525 | basep = &TREE_CHAIN (*basep); | |
9526 | } | |
b90e9c68 | 9527 | |
1a3f833b | 9528 | SET_CLASSTYPE_MARKED (ref); |
95f3173a | 9529 | i = list_length (base_list); |
9530 | if (i) | |
9531 | { | |
9532 | tree binfo = TYPE_BINFO (ref); | |
9533 | tree binfos = make_tree_vec (i); | |
9534 | tree accesses = make_tree_vec (i); | |
9535 | ||
9536 | BINFO_BASETYPES (binfo) = binfos; | |
9537 | BINFO_BASEACCESSES (binfo) = accesses; | |
9538 | ||
9539 | for (i = 0; base_list; base_list = TREE_CHAIN (base_list)) | |
1a3f833b | 9540 | { |
95f3173a | 9541 | tree access = TREE_PURPOSE (base_list); |
9542 | int via_virtual = TREE_VIA_VIRTUAL (base_list); | |
9543 | tree basetype = TREE_VALUE (base_list); | |
9544 | tree base_binfo; | |
9545 | ||
9546 | if (access == access_default_node) | |
9547 | /* The base of a derived struct is public by default. */ | |
9548 | access = (tag_code == class_type | |
9549 | ? access_private_node : access_public_node); | |
9550 | ||
9551 | if (basetype && TREE_CODE (basetype) == TYPE_DECL) | |
9552 | basetype = TREE_TYPE (basetype); | |
9553 | if (!basetype | |
9554 | || (TREE_CODE (basetype) != RECORD_TYPE | |
9555 | && TREE_CODE (basetype) != TYPENAME_TYPE | |
9556 | && TREE_CODE (basetype) != TEMPLATE_TYPE_PARM | |
9557 | && TREE_CODE (basetype) != BOUND_TEMPLATE_TEMPLATE_PARM)) | |
9558 | { | |
9559 | error ("base type `%T' fails to be a struct or class type", | |
9560 | basetype); | |
9561 | continue; | |
9562 | } | |
9563 | ||
9564 | if (CLASSTYPE_MARKED (basetype)) | |
9565 | { | |
9566 | if (basetype == ref) | |
9567 | error ("recursive type `%T' undefined", basetype); | |
9568 | else | |
9569 | error ("duplicate base type `%T' invalid", basetype); | |
9570 | continue; | |
9571 | } | |
9572 | ||
9573 | if (TYPE_FOR_JAVA (basetype) | |
9574 | && (current_lang_depth () == 0)) | |
9575 | TYPE_FOR_JAVA (ref) = 1; | |
9576 | ||
9577 | if (CLASS_TYPE_P (basetype)) | |
9578 | { | |
9579 | base_binfo = TYPE_BINFO (basetype); | |
9580 | /* This flag will be in the binfo of the base type, we must | |
9581 | clear it after copying the base binfos. */ | |
9582 | BINFO_DEPENDENT_BASE_P (base_binfo) | |
9583 | = dependent_type_p (basetype); | |
9584 | } | |
954ad420 | 9585 | else |
95f3173a | 9586 | base_binfo = make_binfo (size_zero_node, basetype, |
9587 | NULL_TREE, NULL_TREE); | |
9588 | ||
9589 | TREE_VEC_ELT (binfos, i) = base_binfo; | |
9590 | TREE_VEC_ELT (accesses, i) = access; | |
9591 | /* This flag will be in the binfo of the base type, we must | |
9592 | clear it after copying the base binfos. */ | |
9593 | TREE_VIA_VIRTUAL (base_binfo) = via_virtual; | |
9594 | ||
9595 | SET_CLASSTYPE_MARKED (basetype); | |
9596 | ||
9597 | /* We are free to modify these bits because they are meaningless | |
9598 | at top level, and BASETYPE is a top-level type. */ | |
9599 | if (via_virtual || TYPE_USES_VIRTUAL_BASECLASSES (basetype)) | |
9600 | { | |
9601 | TYPE_USES_VIRTUAL_BASECLASSES (ref) = 1; | |
9602 | /* Converting to a virtual base class requires looking | |
9603 | up the offset of the virtual base. */ | |
9604 | TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (ref) = 1; | |
9605 | } | |
9606 | ||
9607 | if (CLASS_TYPE_P (basetype)) | |
9608 | { | |
9609 | TYPE_HAS_NEW_OPERATOR (ref) | |
9610 | |= TYPE_HAS_NEW_OPERATOR (basetype); | |
9611 | TYPE_HAS_ARRAY_NEW_OPERATOR (ref) | |
9612 | |= TYPE_HAS_ARRAY_NEW_OPERATOR (basetype); | |
9613 | TYPE_GETS_DELETE (ref) |= TYPE_GETS_DELETE (basetype); | |
9614 | /* If the base-class uses multiple inheritance, so do we. */ | |
9615 | TYPE_USES_MULTIPLE_INHERITANCE (ref) | |
9616 | |= TYPE_USES_MULTIPLE_INHERITANCE (basetype); | |
9617 | /* Likewise, if converting to a base of the base may require | |
9618 | code, then we may need to generate code to convert to a | |
9619 | base as well. */ | |
9620 | TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (ref) | |
9621 | |= TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (basetype); | |
9622 | } | |
9623 | i++; | |
1a3f833b | 9624 | } |
95f3173a | 9625 | if (i) |
9626 | TREE_VEC_LENGTH (accesses) = TREE_VEC_LENGTH (binfos) = i; | |
9627 | else | |
9628 | BINFO_BASEACCESSES (binfo) = BINFO_BASETYPES (binfo) = NULL_TREE; | |
9629 | ||
9630 | if (i > 1) | |
9631 | { | |
9632 | TYPE_USES_MULTIPLE_INHERITANCE (ref) = 1; | |
9633 | /* If there is more than one non-empty they cannot be at the same | |
9634 | address. */ | |
954ad420 | 9635 | TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (ref) = 1; |
9636 | } | |
95f3173a | 9637 | } |
9638 | ||
9639 | /* Copy the base binfos, collect the virtual bases and set the | |
9640 | inheritance order chain. */ | |
9641 | copy_base_binfos (TYPE_BINFO (ref), ref, NULL_TREE); | |
9642 | CLASSTYPE_VBASECLASSES (ref) = nreverse (CLASSTYPE_VBASECLASSES (ref)); | |
de4355dc | 9643 | |
9644 | if (TYPE_FOR_JAVA (ref)) | |
9645 | { | |
9646 | if (TYPE_USES_MULTIPLE_INHERITANCE (ref)) | |
9647 | error ("Java class '%T' cannot have multiple bases", ref); | |
9648 | if (CLASSTYPE_VBASECLASSES (ref)) | |
9649 | error ("Java class '%T' cannot have virtual bases", ref); | |
9650 | } | |
9651 | ||
95f3173a | 9652 | /* Unmark all the types. */ |
9653 | while (i--) | |
9654 | { | |
9655 | tree basetype = BINFO_TYPE (BINFO_BASETYPE (TYPE_BINFO (ref), i)); | |
9656 | ||
9657 | CLEAR_CLASSTYPE_MARKED (basetype); | |
954ad420 | 9658 | if (CLASS_TYPE_P (basetype)) |
9659 | { | |
95f3173a | 9660 | TREE_VIA_VIRTUAL (TYPE_BINFO (basetype)) = 0; |
9661 | BINFO_DEPENDENT_BASE_P (TYPE_BINFO (basetype)) = 0; | |
954ad420 | 9662 | } |
e4e283ec | 9663 | } |
1a3f833b | 9664 | CLEAR_CLASSTYPE_MARKED (ref); |
1a3f833b | 9665 | } |
980877d7 | 9666 | |
471086d6 | 9667 | \f |
471086d6 | 9668 | /* Begin compiling the definition of an enumeration type. |
9669 | NAME is its name (or null if anonymous). | |
9670 | Returns the type object, as yet incomplete. | |
9671 | Also records info about it so that build_enumerator | |
9672 | may be used to declare the individual values as they are read. */ | |
9673 | ||
9674 | tree | |
1b72315d | 9675 | start_enum (tree name) |
471086d6 | 9676 | { |
cd16867a | 9677 | tree enumtype = NULL_TREE; |
1f3233d1 | 9678 | struct cp_binding_level *b = current_binding_level; |
471086d6 | 9679 | |
9680 | /* If this is the real definition for a previous forward reference, | |
9681 | fill in the contents in the same object that used to be the | |
9682 | forward reference. */ | |
9683 | ||
9684 | if (name != NULL_TREE) | |
9685 | enumtype = lookup_tag (ENUMERAL_TYPE, name, b, 1); | |
9686 | ||
9687 | if (enumtype != NULL_TREE && TREE_CODE (enumtype) == ENUMERAL_TYPE) | |
43476131 | 9688 | { |
cf103c6c | 9689 | error ("multiple definition of `%#T'", enumtype); |
9bc3739f | 9690 | error ("%Jprevious definition here", TYPE_MAIN_DECL (enumtype)); |
383acc13 | 9691 | /* Clear out TYPE_VALUES, and start again. */ |
9692 | TYPE_VALUES (enumtype) = NULL_TREE; | |
43476131 | 9693 | } |
471086d6 | 9694 | else |
9695 | { | |
9696 | enumtype = make_node (ENUMERAL_TYPE); | |
9697 | pushtag (name, enumtype, 0); | |
9698 | } | |
9699 | ||
471086d6 | 9700 | return enumtype; |
9701 | } | |
9702 | ||
9703 | /* After processing and defining all the values of an enumeration type, | |
9704 | install their decls in the enumeration type and finish it off. | |
a4fb1d94 | 9705 | ENUMTYPE is the type object and VALUES a list of name-value pairs. */ |
471086d6 | 9706 | |
a4fb1d94 | 9707 | void |
1b72315d | 9708 | finish_enum (tree enumtype) |
471086d6 | 9709 | { |
ee1ab431 | 9710 | tree values; |
9711 | tree decl; | |
9712 | tree value; | |
a4fb1d94 | 9713 | tree minnode; |
9714 | tree maxnode; | |
9715 | tree t; | |
9716 | bool unsignedp; | |
9717 | int lowprec; | |
9718 | int highprec; | |
9719 | int precision; | |
ee1ab431 | 9720 | integer_type_kind itk; |
d0ef003f | 9721 | tree underlying_type = NULL_TREE; |
a4fb1d94 | 9722 | |
9723 | /* We built up the VALUES in reverse order. */ | |
9724 | TYPE_VALUES (enumtype) = nreverse (TYPE_VALUES (enumtype)); | |
9725 | ||
15da6f57 | 9726 | /* For an enum defined in a template, just set the type of the values; |
9727 | all further processing is postponed until the template is | |
9728 | instantiated. We need to set the type so that tsubst of a CONST_DECL | |
9729 | works. */ | |
a4fb1d94 | 9730 | if (processing_template_decl) |
9731 | { | |
ee1ab431 | 9732 | for (values = TYPE_VALUES (enumtype); |
9733 | values; | |
9734 | values = TREE_CHAIN (values)) | |
9735 | TREE_TYPE (TREE_VALUE (values)) = enumtype; | |
334ec926 | 9736 | if (at_function_scope_p ()) |
a4fb1d94 | 9737 | add_stmt (build_min (TAG_DEFN, enumtype)); |
a4fb1d94 | 9738 | return; |
9739 | } | |
9740 | ||
ee1ab431 | 9741 | /* Determine the minimum and maximum values of the enumerators. */ |
a4fb1d94 | 9742 | if (TYPE_VALUES (enumtype)) |
471086d6 | 9743 | { |
a4fb1d94 | 9744 | minnode = maxnode = NULL_TREE; |
e857e9c7 | 9745 | |
ee1ab431 | 9746 | for (values = TYPE_VALUES (enumtype); |
9747 | values; | |
9748 | values = TREE_CHAIN (values)) | |
471086d6 | 9749 | { |
ee1ab431 | 9750 | decl = TREE_VALUE (values); |
15da6f57 | 9751 | |
9752 | /* [dcl.enum]: Following the closing brace of an enum-specifier, | |
9753 | each enumerator has the type of its enumeration. Prior to the | |
9754 | closing brace, the type of each enumerator is the type of its | |
9755 | initializing value. */ | |
9756 | TREE_TYPE (decl) = enumtype; | |
9757 | ||
ee1ab431 | 9758 | /* Update the minimum and maximum values, if appropriate. */ |
9759 | value = DECL_INITIAL (decl); | |
15da6f57 | 9760 | /* Figure out what the minimum and maximum values of the |
9761 | enumerators are. */ | |
9762 | if (!minnode) | |
9763 | minnode = maxnode = value; | |
9764 | else if (tree_int_cst_lt (maxnode, value)) | |
9765 | maxnode = value; | |
9766 | else if (tree_int_cst_lt (value, minnode)) | |
9767 | minnode = value; | |
9768 | ||
9769 | /* Set the TREE_TYPE for the values as well. That's so that when | |
9770 | we call decl_constant_value we get an entity of the right type | |
9771 | (but with the constant value). But first make a copy so we | |
9772 | don't clobber shared INTEGER_CSTs. */ | |
9773 | if (TREE_TYPE (value) != enumtype) | |
40256ecd | 9774 | { |
15da6f57 | 9775 | value = DECL_INITIAL (decl) = copy_node (value); |
9776 | TREE_TYPE (value) = enumtype; | |
40256ecd | 9777 | } |
471086d6 | 9778 | } |
9779 | } | |
c38086bd | 9780 | else |
ee1ab431 | 9781 | /* [dcl.enum] |
9782 | ||
9783 | If the enumerator-list is empty, the underlying type is as if | |
9784 | the enumeration had a single enumerator with value 0. */ | |
a4fb1d94 | 9785 | minnode = maxnode = integer_zero_node; |
9786 | ||
9787 | /* Compute the number of bits require to represent all values of the | |
9788 | enumeration. We must do this before the type of MINNODE and | |
9789 | MAXNODE are transformed, since min_precision relies on the | |
9790 | TREE_TYPE of the value it is passed. */ | |
9791 | unsignedp = tree_int_cst_sgn (minnode) >= 0; | |
9792 | lowprec = min_precision (minnode, unsignedp); | |
9793 | highprec = min_precision (maxnode, unsignedp); | |
9794 | precision = MAX (lowprec, highprec); | |
9795 | ||
ee1ab431 | 9796 | /* Determine the underlying type of the enumeration. |
9797 | ||
9798 | [dcl.enum] | |
9799 | ||
9800 | The underlying type of an enumeration is an integral type that | |
9801 | can represent all the enumerator values defined in the | |
9802 | enumeration. It is implementation-defined which integral type is | |
9803 | used as the underlying type for an enumeration except that the | |
9804 | underlying type shall not be larger than int unless the value of | |
9805 | an enumerator cannot fit in an int or unsigned int. | |
9806 | ||
9807 | We use "int" or an "unsigned int" as the underlying type, even if | |
9808 | a smaller integral type would work, unless the user has | |
9809 | explicitly requested that we use the smallest possible type. */ | |
9810 | for (itk = (flag_short_enums ? itk_char : itk_int); | |
9811 | itk != itk_none; | |
9812 | itk++) | |
1791b32e | 9813 | { |
ee1ab431 | 9814 | underlying_type = integer_types[itk]; |
9815 | if (TYPE_PRECISION (underlying_type) >= precision | |
78a8ed03 | 9816 | && TYPE_UNSIGNED (underlying_type) == unsignedp) |
ee1ab431 | 9817 | break; |
9818 | } | |
9819 | if (itk == itk_none) | |
9820 | { | |
9821 | /* DR 377 | |
9822 | ||
9823 | IF no integral type can represent all the enumerator values, the | |
9824 | enumeration is ill-formed. */ | |
1791b32e | 9825 | error ("no integral type can represent all of the enumerator values " |
9826 | "for `%T'", enumtype); | |
9827 | precision = TYPE_PRECISION (long_long_integer_type_node); | |
ee1ab431 | 9828 | underlying_type = integer_types[itk_unsigned_long_long]; |
1791b32e | 9829 | } |
9830 | ||
ee1ab431 | 9831 | /* Compute the minium and maximum values for the type. |
471086d6 | 9832 | |
ee1ab431 | 9833 | [dcl.enum] |
9834 | ||
9835 | For an enumeration where emin is the smallest enumerator and emax | |
9836 | is the largest, the values of the enumeration are the values of the | |
9837 | underlying type in the range bmin to bmax, where bmin and bmax are, | |
9838 | respectively, the smallest and largest values of the smallest bit- | |
9839 | field that can store emin and emax. */ | |
9840 | TYPE_PRECISION (enumtype) = precision; | |
9841 | set_min_and_max_values_for_integral_type (enumtype, precision, unsignedp); | |
9842 | ||
9843 | /* [dcl.enum] | |
9844 | ||
9845 | The value of sizeof() applied to an enumeration type, an object | |
9846 | of an enumeration type, or an enumerator, is the value of sizeof() | |
9847 | applied to the underlying type. */ | |
9848 | TYPE_SIZE (enumtype) = TYPE_SIZE (underlying_type); | |
9849 | TYPE_SIZE_UNIT (enumtype) = TYPE_SIZE_UNIT (underlying_type); | |
9850 | TYPE_MODE (enumtype) = TYPE_MODE (underlying_type); | |
9851 | TYPE_ALIGN (enumtype) = TYPE_ALIGN (underlying_type); | |
9852 | TYPE_USER_ALIGN (enumtype) = TYPE_USER_ALIGN (underlying_type); | |
78a8ed03 | 9853 | TYPE_UNSIGNED (enumtype) = TYPE_UNSIGNED (underlying_type); |
ee1ab431 | 9854 | |
9855 | /* Convert each of the enumerators to the type of the underlying | |
9856 | type of the enumeration. */ | |
9857 | for (values = TYPE_VALUES (enumtype); values; values = TREE_CHAIN (values)) | |
9858 | { | |
9859 | decl = TREE_VALUE (values); | |
9860 | value = perform_implicit_conversion (underlying_type, | |
9861 | DECL_INITIAL (decl)); | |
9862 | TREE_TYPE (value) = enumtype; | |
9863 | DECL_INITIAL (decl) = value; | |
9864 | TREE_VALUE (values) = value; | |
1791b32e | 9865 | } |
471086d6 | 9866 | |
a4fb1d94 | 9867 | /* Fix up all variant types of this enum type. */ |
9868 | for (t = TYPE_MAIN_VARIANT (enumtype); t; t = TYPE_NEXT_VARIANT (t)) | |
9869 | { | |
9870 | TYPE_VALUES (t) = TYPE_VALUES (enumtype); | |
9871 | TYPE_MIN_VALUE (t) = TYPE_MIN_VALUE (enumtype); | |
9872 | TYPE_MAX_VALUE (t) = TYPE_MAX_VALUE (enumtype); | |
9873 | TYPE_SIZE (t) = TYPE_SIZE (enumtype); | |
9874 | TYPE_SIZE_UNIT (t) = TYPE_SIZE_UNIT (enumtype); | |
9875 | TYPE_MODE (t) = TYPE_MODE (enumtype); | |
9876 | TYPE_PRECISION (t) = TYPE_PRECISION (enumtype); | |
9877 | TYPE_ALIGN (t) = TYPE_ALIGN (enumtype); | |
9878 | TYPE_USER_ALIGN (t) = TYPE_USER_ALIGN (enumtype); | |
78a8ed03 | 9879 | TYPE_UNSIGNED (t) = TYPE_UNSIGNED (enumtype); |
1bb4c5ad | 9880 | } |
9881 | ||
a4fb1d94 | 9882 | /* Finish debugging output for this type. */ |
9883 | rest_of_type_compilation (enumtype, namespace_bindings_p ()); | |
471086d6 | 9884 | } |
9885 | ||
990c78e1 | 9886 | /* Build and install a CONST_DECL for an enumeration constant of the |
383acc13 | 9887 | enumeration type ENUMTYPE whose NAME and VALUE (if any) are provided. |
471086d6 | 9888 | Assignment of sequential values by default is handled here. */ |
9889 | ||
383acc13 | 9890 | void |
1b72315d | 9891 | build_enumerator (tree name, tree value, tree enumtype) |
471086d6 | 9892 | { |
383acc13 | 9893 | tree decl; |
10151236 | 9894 | tree context; |
383acc13 | 9895 | tree type; |
471086d6 | 9896 | |
9897 | /* Remove no-op casts from the value. */ | |
9898 | if (value) | |
9899 | STRIP_TYPE_NOPS (value); | |
9900 | ||
383acc13 | 9901 | if (! processing_template_decl) |
9902 | { | |
9903 | /* Validate and default VALUE. */ | |
9904 | if (value != NULL_TREE) | |
9905 | { | |
1202e392 | 9906 | value = decl_constant_value (value); |
383acc13 | 9907 | |
9908 | if (TREE_CODE (value) == INTEGER_CST) | |
9909 | { | |
a681799d | 9910 | value = perform_integral_promotions (value); |
383acc13 | 9911 | constant_expression_warning (value); |
9912 | } | |
9913 | else | |
9914 | { | |
cf103c6c | 9915 | error ("enumerator value for `%D' not integer constant", name); |
383acc13 | 9916 | value = NULL_TREE; |
9917 | } | |
9918 | } | |
9919 | ||
9920 | /* Default based on previous value. */ | |
b4451e15 | 9921 | if (value == NULL_TREE) |
383acc13 | 9922 | { |
9923 | tree prev_value; | |
9924 | ||
9925 | if (TYPE_VALUES (enumtype)) | |
9926 | { | |
a109dc3b | 9927 | /* The next value is the previous value ... */ |
383acc13 | 9928 | prev_value = DECL_INITIAL (TREE_VALUE (TYPE_VALUES (enumtype))); |
9929 | /* ... plus one. */ | |
29d00ba7 | 9930 | value = cp_build_binary_op (PLUS_EXPR, |
9931 | prev_value, | |
9932 | integer_one_node); | |
980877d7 | 9933 | |
383acc13 | 9934 | if (tree_int_cst_lt (value, prev_value)) |
cf103c6c | 9935 | error ("overflow in enumeration values at `%D'", name); |
383acc13 | 9936 | } |
9937 | else | |
9938 | value = integer_zero_node; | |
9939 | } | |
9940 | ||
9941 | /* Remove no-op casts from the value. */ | |
15da6f57 | 9942 | STRIP_TYPE_NOPS (value); |
383acc13 | 9943 | } |
471086d6 | 9944 | |
471086d6 | 9945 | /* C++ associates enums with global, function, or class declarations. */ |
383acc13 | 9946 | context = current_scope (); |
ee1ab431 | 9947 | if (!context) |
9948 | context = current_namespace; | |
383acc13 | 9949 | |
9950 | /* Build the actual enumeration constant. Note that the enumeration | |
9951 | constants have the type of their initializers until the | |
9952 | enumeration is complete: | |
9953 | ||
9954 | [ dcl.enum ] | |
9955 | ||
9956 | Following the closing brace of an enum-specifier, each enumer- | |
9957 | ator has the type of its enumeration. Prior to the closing | |
9958 | brace, the type of each enumerator is the type of its | |
9959 | initializing value. | |
9960 | ||
9961 | In finish_enum we will reset the type. Of course, if we're | |
a109dc3b | 9962 | processing a template, there may be no value. */ |
383acc13 | 9963 | type = value ? TREE_TYPE (value) : NULL_TREE; |
9964 | ||
9965 | if (context && context == current_class_type) | |
9966 | /* This enum declaration is local to the class. We need the full | |
e41f0d80 | 9967 | lang_decl so that we can record DECL_CLASS_CONTEXT, for example. */ |
383acc13 | 9968 | decl = build_lang_decl (CONST_DECL, name, type); |
9969 | else | |
9970 | /* It's a global enum, or it's local to a function. (Note local to | |
10151236 | 9971 | a function could mean local to a class method. */ |
383acc13 | 9972 | decl = build_decl (CONST_DECL, name, type); |
10151236 | 9973 | |
383acc13 | 9974 | DECL_CONTEXT (decl) = FROB_CONTEXT (context); |
4ee9c684 | 9975 | TREE_CONSTANT (decl) = 1; |
9976 | TREE_INVARIANT (decl) = 1; | |
9977 | TREE_READONLY (decl) = 1; | |
383acc13 | 9978 | DECL_INITIAL (decl) = value; |
10151236 | 9979 | |
383acc13 | 9980 | if (context && context == current_class_type) |
9981 | /* In something like `struct S { enum E { i = 7 }; };' we put `i' | |
ee1ab431 | 9982 | on the TYPE_FIELDS list for `S'. (That's so that you can say |
9983 | things like `S::i' later.) */ | |
383acc13 | 9984 | finish_member_declaration (decl); |
9985 | else | |
d03f29c4 | 9986 | pushdecl (decl); |
383acc13 | 9987 | |
9988 | /* Add this enumeration constant to the list for this type. */ | |
9989 | TYPE_VALUES (enumtype) = tree_cons (name, decl, TYPE_VALUES (enumtype)); | |
471086d6 | 9990 | } |
9991 | ||
471086d6 | 9992 | \f |
d119628b | 9993 | /* We're defining DECL. Make sure that it's type is OK. */ |
9994 | ||
9995 | static void | |
1b72315d | 9996 | check_function_type (tree decl, tree current_function_parms) |
d119628b | 9997 | { |
9998 | tree fntype = TREE_TYPE (decl); | |
4b72716d | 9999 | tree return_type = complete_type (TREE_TYPE (fntype)); |
d119628b | 10000 | |
10001 | /* In a function definition, arg types must be complete. */ | |
10002 | require_complete_types_for_parms (current_function_parms); | |
10003 | ||
4b72716d | 10004 | if (!COMPLETE_OR_VOID_TYPE_P (return_type)) |
d119628b | 10005 | { |
cf103c6c | 10006 | error ("return type `%#T' is incomplete", TREE_TYPE (fntype)); |
d119628b | 10007 | |
10008 | /* Make it return void instead, but don't change the | |
10009 | type of the DECL_RESULT, in case we have a named return value. */ | |
10010 | if (TREE_CODE (fntype) == METHOD_TYPE) | |
10011 | { | |
10012 | tree ctype = TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (fntype))); | |
10013 | TREE_TYPE (decl) | |
5bfb0742 | 10014 | = build_method_type_directly (ctype, |
10015 | void_type_node, | |
10016 | FUNCTION_ARG_CHAIN (decl)); | |
d119628b | 10017 | } |
10018 | else | |
10019 | TREE_TYPE (decl) | |
10020 | = build_function_type (void_type_node, | |
10021 | TYPE_ARG_TYPES (TREE_TYPE (decl))); | |
980877d7 | 10022 | TREE_TYPE (decl) |
d119628b | 10023 | = build_exception_variant (fntype, |
10024 | TYPE_RAISES_EXCEPTIONS (fntype)); | |
10025 | } | |
10026 | else | |
10027 | abstract_virtuals_error (decl, TREE_TYPE (fntype)); | |
10028 | } | |
10029 | ||
471086d6 | 10030 | /* Create the FUNCTION_DECL for a function definition. |
10031 | DECLSPECS and DECLARATOR are the parts of the declaration; | |
10032 | they describe the function's name and the type it returns, | |
10033 | but twisted together in a fashion that parallels the syntax of C. | |
10034 | ||
d119628b | 10035 | FLAGS is a bitwise or of SF_PRE_PARSED (indicating that the |
10036 | DECLARATOR is really the DECL for the function we are about to | |
10037 | process and that DECLSPECS should be ignored), SF_INCLASS_INLINE | |
6528331d | 10038 | indicating that the function is an inline defined in-class. |
980877d7 | 10039 | |
471086d6 | 10040 | This function creates a binding context for the function body |
10041 | as well as setting up the FUNCTION_DECL in current_function_decl. | |
10042 | ||
10043 | Returns 1 on success. If the DECLARATOR is not suitable for a function | |
10044 | (it defines a datum instead), we return 0, which tells | |
10045 | yyparse to report a parse error. | |
10046 | ||
10047 | For C++, we must first check whether that datum makes any sense. | |
10048 | For example, "class A local_a(1,2);" means that variable local_a | |
10049 | is an aggregate of type A, which should have a constructor | |
23f83a9a | 10050 | applied to it with the argument list [1, 2]. */ |
471086d6 | 10051 | |
10052 | int | |
1b72315d | 10053 | start_function (tree declspecs, tree declarator, tree attrs, int flags) |
471086d6 | 10054 | { |
e857e9c7 | 10055 | tree decl1; |
471086d6 | 10056 | tree ctype = NULL_TREE; |
10057 | tree fntype; | |
10058 | tree restype; | |
471086d6 | 10059 | int doing_friend = 0; |
1f3233d1 | 10060 | struct cp_binding_level *bl; |
6528331d | 10061 | tree current_function_parms; |
471086d6 | 10062 | |
471086d6 | 10063 | /* Sanity check. */ |
f468434d | 10064 | my_friendly_assert (TREE_CODE (TREE_VALUE (void_list_node)) == VOID_TYPE, 160); |
471086d6 | 10065 | my_friendly_assert (TREE_CHAIN (void_list_node) == NULL_TREE, 161); |
10066 | ||
96624a9e | 10067 | /* This should only be done once on the top most decl. */ |
92c38d80 | 10068 | if (have_extern_spec) |
471086d6 | 10069 | { |
d7c47c0e | 10070 | declspecs = tree_cons (NULL_TREE, get_identifier ("extern"), declspecs); |
92c38d80 | 10071 | have_extern_spec = false; |
471086d6 | 10072 | } |
10073 | ||
d119628b | 10074 | if (flags & SF_PRE_PARSED) |
471086d6 | 10075 | { |
10076 | decl1 = declarator; | |
10077 | ||
471086d6 | 10078 | fntype = TREE_TYPE (decl1); |
10079 | if (TREE_CODE (fntype) == METHOD_TYPE) | |
10080 | ctype = TYPE_METHOD_BASETYPE (fntype); | |
10081 | ||
657c76e1 | 10082 | /* ISO C++ 11.4/5. A friend function defined in a class is in |
10083 | the (lexical) scope of the class in which it is defined. */ | |
471086d6 | 10084 | if (!ctype && DECL_FRIEND_P (decl1)) |
10085 | { | |
9ba4048d | 10086 | ctype = DECL_FRIEND_CONTEXT (decl1); |
471086d6 | 10087 | |
10088 | /* CTYPE could be null here if we're dealing with a template; | |
10089 | for example, `inline friend float foo()' inside a template | |
10090 | will have no CTYPE set. */ | |
10091 | if (ctype && TREE_CODE (ctype) != RECORD_TYPE) | |
10092 | ctype = NULL_TREE; | |
10093 | else | |
10094 | doing_friend = 1; | |
10095 | } | |
471086d6 | 10096 | } |
10097 | else | |
10098 | { | |
6d84574d | 10099 | decl1 = grokdeclarator (declarator, declspecs, FUNCDEF, 1, &attrs); |
471086d6 | 10100 | /* If the declarator is not suitable for a function definition, |
10101 | cause a syntax error. */ | |
b8e2eb91 | 10102 | if (decl1 == NULL_TREE || TREE_CODE (decl1) != FUNCTION_DECL) |
10103 | return 0; | |
10104 | ||
10105 | cplus_decl_attributes (&decl1, attrs, 0); | |
471086d6 | 10106 | |
5626f4cd | 10107 | /* If #pragma weak was used, mark the decl weak now. */ |
ddeeea02 | 10108 | if (global_scope_p (current_binding_level)) |
5626f4cd | 10109 | maybe_apply_pragma_weak (decl1); |
10110 | ||
471086d6 | 10111 | fntype = TREE_TYPE (decl1); |
10112 | ||
10113 | restype = TREE_TYPE (fntype); | |
471086d6 | 10114 | |
10115 | if (TREE_CODE (fntype) == METHOD_TYPE) | |
10116 | ctype = TYPE_METHOD_BASETYPE (fntype); | |
9426b767 | 10117 | else if (DECL_MAIN_P (decl1)) |
471086d6 | 10118 | { |
577a5d34 | 10119 | /* If this doesn't return integer_type, or a typedef to |
10120 | integer_type, complain. */ | |
10121 | if (!same_type_p (TREE_TYPE (TREE_TYPE (decl1)), integer_type_node)) | |
471086d6 | 10122 | { |
e581f478 | 10123 | if (pedantic || warn_return_type) |
905d4035 | 10124 | pedwarn ("return type for `main' changed to `int'"); |
471086d6 | 10125 | TREE_TYPE (decl1) = fntype = default_function_type; |
10126 | } | |
471086d6 | 10127 | } |
10128 | } | |
980877d7 | 10129 | |
5955c361 | 10130 | if (DECL_DECLARED_INLINE_P (decl1) |
10131 | && lookup_attribute ("noinline", attrs)) | |
9bc3739f | 10132 | warning ("%Jinline function '%D' given attribute noinline", decl1, decl1); |
5955c361 | 10133 | |
a321abdb | 10134 | if (DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (decl1)) |
10135 | /* This is a constructor, we must ensure that any default args | |
10136 | introduced by this definition are propagated to the clones | |
10137 | now. The clones are used directly in overload resolution. */ | |
10138 | adjust_clone_args (decl1); | |
10139 | ||
e0e489c4 | 10140 | /* Sometimes we don't notice that a function is a static member, and |
10141 | build a METHOD_TYPE for it. Fix that up now. */ | |
10142 | if (ctype != NULL_TREE && DECL_STATIC_FUNCTION_P (decl1) | |
10143 | && TREE_CODE (TREE_TYPE (decl1)) == METHOD_TYPE) | |
10144 | { | |
11fa0266 | 10145 | revert_static_member_fn (decl1); |
e0e489c4 | 10146 | ctype = NULL_TREE; |
10147 | } | |
471086d6 | 10148 | |
53137e6a | 10149 | /* Set up current_class_type, and enter the scope of the class, if |
10150 | appropriate. */ | |
10151 | if (ctype) | |
5f6526e1 | 10152 | push_nested_class (ctype); |
53137e6a | 10153 | else if (DECL_STATIC_FUNCTION_P (decl1)) |
5f6526e1 | 10154 | push_nested_class (DECL_CONTEXT (decl1)); |
53137e6a | 10155 | |
10156 | /* Now that we have entered the scope of the class, we must restore | |
10157 | the bindings for any template parameters surrounding DECL1, if it | |
10158 | is an inline member template. (Order is important; consider the | |
10159 | case where a template parameter has the same name as a field of | |
10160 | the class.) It is not until after this point that | |
10161 | PROCESSING_TEMPLATE_DECL is guaranteed to be set up correctly. */ | |
d119628b | 10162 | if (flags & SF_INCLASS_INLINE) |
53137e6a | 10163 | maybe_begin_member_template_processing (decl1); |
10164 | ||
225ec6aa | 10165 | /* Effective C++ rule 15. */ |
70a658bd | 10166 | if (warn_ecpp |
97cc4539 | 10167 | && DECL_OVERLOADED_OPERATOR_P (decl1) == NOP_EXPR |
70a658bd | 10168 | && TREE_CODE (TREE_TYPE (fntype)) == VOID_TYPE) |
cf103c6c | 10169 | warning ("`operator=' should return a reference to `*this'"); |
70a658bd | 10170 | |
10171 | /* Make the init_value nonzero so pushdecl knows this is not tentative. | |
10172 | error_mark_node is replaced below (in poplevel) with the BLOCK. */ | |
e0e489c4 | 10173 | if (!DECL_INITIAL (decl1)) |
10174 | DECL_INITIAL (decl1) = error_mark_node; | |
70a658bd | 10175 | |
70a658bd | 10176 | /* This function exists in static storage. |
10177 | (This does not mean `static' in the C sense!) */ | |
10178 | TREE_STATIC (decl1) = 1; | |
10179 | ||
10180 | /* We must call push_template_decl after current_class_type is set | |
10181 | up. (If we are processing inline definitions after exiting a | |
10182 | class scope, current_class_type will be NULL_TREE until set above | |
10183 | by push_nested_class.) */ | |
10184 | if (processing_template_decl) | |
10185 | decl1 = push_template_decl (decl1); | |
10186 | ||
53137e6a | 10187 | /* We are now in the scope of the function being defined. */ |
471086d6 | 10188 | current_function_decl = decl1; |
53137e6a | 10189 | |
e857e9c7 | 10190 | /* Save the parm names or decls from this function's declarator |
10191 | where store_parm_decls will find them. */ | |
7ef14399 | 10192 | current_function_parms = DECL_ARGUMENTS (decl1); |
471086d6 | 10193 | |
d119628b | 10194 | /* Make sure the parameter and return types are reasonable. When |
10195 | you declare a function, these types can be incomplete, but they | |
10196 | must be complete when you define the function. */ | |
3cc0b4b9 | 10197 | if (! processing_template_decl) |
6528331d | 10198 | check_function_type (decl1, current_function_parms); |
53137e6a | 10199 | |
d119628b | 10200 | /* Build the return declaration for the function. */ |
10201 | restype = TREE_TYPE (fntype); | |
b8e2eb91 | 10202 | /* Promote the value to int before returning it. */ |
10203 | if (c_promoting_integer_type_p (restype)) | |
10204 | restype = type_promotes_to (restype); | |
10205 | if (DECL_RESULT (decl1) == NULL_TREE) | |
d119628b | 10206 | { |
b8e2eb91 | 10207 | DECL_RESULT (decl1) |
10208 | = build_decl (RESULT_DECL, 0, TYPE_MAIN_VARIANT (restype)); | |
10209 | c_apply_type_quals_to_decl (cp_type_quals (restype), | |
10210 | DECL_RESULT (decl1)); | |
e857e9c7 | 10211 | } |
d119628b | 10212 | |
10213 | /* Initialize RTL machinery. We cannot do this until | |
10214 | CURRENT_FUNCTION_DECL and DECL_RESULT are set up. We do this | |
10215 | even when processing a template; this is how we get | |
90a83261 | 10216 | CFUN set up, and our per-function variables initialized. |
10217 | FIXME factor out the non-RTL stuff. */ | |
d119628b | 10218 | bl = current_binding_level; |
90e3d9ba | 10219 | allocate_struct_function (decl1); |
fa3834f1 | 10220 | current_binding_level = bl; |
d119628b | 10221 | |
10222 | /* Even though we're inside a function body, we still don't want to | |
10223 | call expand_expr to calculate the size of a variable-sized array. | |
10224 | We haven't necessarily assigned RTL to all variables yet, so it's | |
10225 | not safe to try to expand expressions involving them. */ | |
10226 | immediate_size_expand = 0; | |
08513b52 | 10227 | cfun->x_dont_save_pending_sizes_p = 1; |
d119628b | 10228 | |
6528331d | 10229 | /* Start the statement-tree, start the tree now. */ |
2363ef00 | 10230 | DECL_SAVED_TREE (decl1) = push_stmt_list (); |
76a24869 | 10231 | |
d119628b | 10232 | /* Let the user know we're compiling this function. */ |
a6260fc7 | 10233 | announce_function (decl1); |
1e66592c | 10234 | |
b248d3f7 | 10235 | /* Record the decl so that the function name is defined. |
10236 | If we already have a decl for this name, and it is a FUNCTION_DECL, | |
10237 | use the old decl. */ | |
d119628b | 10238 | if (!processing_template_decl && !(flags & SF_PRE_PARSED)) |
b248d3f7 | 10239 | { |
668ae905 | 10240 | /* A specialization is not used to guide overload resolution. */ |
f99f0e9c | 10241 | if (!DECL_FUNCTION_MEMBER_P (decl1) |
10242 | && !(DECL_USE_TEMPLATE (decl1) && | |
10243 | PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (decl1)))) | |
947f430b | 10244 | { |
10245 | tree olddecl = pushdecl (decl1); | |
10246 | ||
10247 | if (olddecl == error_mark_node) | |
10248 | /* If something went wrong when registering the declaration, | |
10249 | use DECL1; we have to have a FUNCTION_DECL to use when | |
10250 | parsing the body of the function. */ | |
10251 | ; | |
10252 | else | |
10253 | /* Otherwise, OLDDECL is either a previous declaration of | |
10254 | the same function or DECL1 itself. */ | |
10255 | decl1 = olddecl; | |
10256 | } | |
8417823c | 10257 | else |
ef5a592c | 10258 | { |
a109dc3b | 10259 | /* We need to set the DECL_CONTEXT. */ |
ef5a592c | 10260 | if (!DECL_CONTEXT (decl1) && DECL_TEMPLATE_INFO (decl1)) |
10261 | DECL_CONTEXT (decl1) = DECL_CONTEXT (DECL_TI_TEMPLATE (decl1)); | |
10262 | /* And make sure we have enough default args. */ | |
10263 | check_default_args (decl1); | |
10264 | } | |
b248d3f7 | 10265 | fntype = TREE_TYPE (decl1); |
10266 | } | |
e857e9c7 | 10267 | |
d119628b | 10268 | /* Reset these in case the call to pushdecl changed them. */ |
e857e9c7 | 10269 | current_function_decl = decl1; |
08513b52 | 10270 | cfun->decl = decl1; |
b248d3f7 | 10271 | |
c15addfa | 10272 | /* If we are (erroneously) defining a function that we have already |
10273 | defined before, wipe out what we knew before. */ | |
1f3233d1 | 10274 | if (!DECL_PENDING_INLINE_P (decl1)) |
10275 | DECL_SAVED_FUNCTION_DATA (decl1) = NULL; | |
e0e489c4 | 10276 | |
6528331d | 10277 | if (ctype && !doing_friend && !DECL_STATIC_FUNCTION_P (decl1)) |
e0e489c4 | 10278 | { |
10279 | /* We know that this was set up by `grokclassfn'. We do not | |
10280 | wait until `store_parm_decls', since evil parse errors may | |
10281 | never get us to that point. Here we keep the consistency | |
10282 | between `current_class_type' and `current_class_ptr'. */ | |
10283 | tree t = DECL_ARGUMENTS (decl1); | |
980877d7 | 10284 | |
10285 | my_friendly_assert (t != NULL_TREE && TREE_CODE (t) == PARM_DECL, | |
e0e489c4 | 10286 | 162); |
10287 | my_friendly_assert (TREE_CODE (TREE_TYPE (t)) == POINTER_TYPE, | |
10288 | 19990811); | |
980877d7 | 10289 | |
10290 | cp_function_chain->x_current_class_ref | |
4d698345 | 10291 | = build_indirect_ref (t, NULL); |
e0e489c4 | 10292 | cp_function_chain->x_current_class_ptr = t; |
10293 | ||
16cb20eb | 10294 | /* Constructors and destructors need to know whether they're "in |
10295 | charge" of initializing virtual base classes. */ | |
dcbeb3ef | 10296 | t = TREE_CHAIN (t); |
a23287c6 | 10297 | if (DECL_HAS_IN_CHARGE_PARM_P (decl1)) |
dcbeb3ef | 10298 | { |
10299 | current_in_charge_parm = t; | |
10300 | t = TREE_CHAIN (t); | |
10301 | } | |
10302 | if (DECL_HAS_VTT_PARM_P (decl1)) | |
10303 | { | |
10304 | if (DECL_NAME (t) != vtt_parm_identifier) | |
10305 | abort (); | |
10306 | current_vtt_parm = t; | |
10307 | } | |
e0e489c4 | 10308 | } |
10309 | ||
c25194fd | 10310 | if (DECL_INTERFACE_KNOWN (decl1)) |
bb09dca5 | 10311 | { |
9ba4048d | 10312 | tree ctx = decl_function_context (decl1); |
f5246b56 | 10313 | |
bb09dca5 | 10314 | if (DECL_NOT_REALLY_EXTERN (decl1)) |
10315 | DECL_EXTERNAL (decl1) = 0; | |
f5246b56 | 10316 | |
d3981643 | 10317 | if (ctx != NULL_TREE && DECL_DECLARED_INLINE_P (ctx) |
f5246b56 | 10318 | && TREE_PUBLIC (ctx)) |
10319 | /* This is a function in a local class in an extern inline | |
10320 | function. */ | |
10321 | comdat_linkage (decl1); | |
bb09dca5 | 10322 | } |
471086d6 | 10323 | /* If this function belongs to an interface, it is public. |
10324 | If it belongs to someone else's interface, it is also external. | |
c576929b | 10325 | This only affects inlines and template instantiations. */ |
e857e9c7 | 10326 | else if (interface_unknown == 0 |
c79f94a2 | 10327 | && ! DECL_TEMPLATE_INSTANTIATION (decl1)) |
471086d6 | 10328 | { |
d3981643 | 10329 | if (DECL_DECLARED_INLINE_P (decl1) |
10330 | || DECL_TEMPLATE_INSTANTIATION (decl1) | |
3cc0b4b9 | 10331 | || processing_template_decl) |
c576929b | 10332 | { |
10333 | DECL_EXTERNAL (decl1) | |
10334 | = (interface_only | |
d3981643 | 10335 | || (DECL_DECLARED_INLINE_P (decl1) |
10336 | && ! flag_implement_inlines | |
f3758bba | 10337 | && !DECL_VINDEX (decl1))); |
c576929b | 10338 | |
10339 | /* For WIN32 we also want to put these in linkonce sections. */ | |
10340 | maybe_make_one_only (decl1); | |
10341 | } | |
c25194fd | 10342 | else |
f69ecb3b | 10343 | DECL_EXTERNAL (decl1) = 0; |
3f7d79e4 | 10344 | DECL_NOT_REALLY_EXTERN (decl1) = 0; |
c25194fd | 10345 | DECL_INTERFACE_KNOWN (decl1) = 1; |
471086d6 | 10346 | } |
d557c996 | 10347 | else if (interface_unknown && interface_only |
c79f94a2 | 10348 | && ! DECL_TEMPLATE_INSTANTIATION (decl1)) |
d557c996 | 10349 | { |
10350 | /* If MULTIPLE_SYMBOL_SPACES is defined and we saw a #pragma | |
10351 | interface, we will have interface_only set but not | |
10352 | interface_known. In that case, we don't want to use the normal | |
10353 | heuristics because someone will supply a #pragma implementation | |
10354 | elsewhere, and deducing it here would produce a conflict. */ | |
10355 | comdat_linkage (decl1); | |
10356 | DECL_EXTERNAL (decl1) = 0; | |
10357 | DECL_INTERFACE_KNOWN (decl1) = 1; | |
10358 | DECL_DEFER_OUTPUT (decl1) = 1; | |
10359 | } | |
471086d6 | 10360 | else |
ddb9bca7 | 10361 | { |
10362 | /* This is a definition, not a reference. | |
1e66592c | 10363 | So clear DECL_EXTERNAL. */ |
10364 | DECL_EXTERNAL (decl1) = 0; | |
bb09dca5 | 10365 | |
d3981643 | 10366 | if ((DECL_DECLARED_INLINE_P (decl1) |
10367 | || DECL_TEMPLATE_INSTANTIATION (decl1)) | |
e857e9c7 | 10368 | && ! DECL_INTERFACE_KNOWN (decl1) |
10369 | /* Don't try to defer nested functions for now. */ | |
9ba4048d | 10370 | && ! decl_function_context (decl1)) |
b248d3f7 | 10371 | DECL_DEFER_OUTPUT (decl1) = 1; |
10372 | else | |
f69ecb3b | 10373 | DECL_INTERFACE_KNOWN (decl1) = 1; |
c25194fd | 10374 | } |
d0622bdf | 10375 | |
e880f232 | 10376 | begin_scope (sk_function_parms, decl1); |
471086d6 | 10377 | |
e857e9c7 | 10378 | ++function_depth; |
10379 | ||
7ac05dd7 | 10380 | if (DECL_DESTRUCTOR_P (decl1)) |
31236dcd | 10381 | { |
10382 | dtor_label = build_decl (LABEL_DECL, NULL_TREE, NULL_TREE); | |
10383 | DECL_CONTEXT (dtor_label) = current_function_decl; | |
10384 | } | |
471086d6 | 10385 | |
65b7f83f | 10386 | start_fname_decls (); |
10387 | ||
6528331d | 10388 | store_parm_decls (current_function_parms); |
10389 | ||
471086d6 | 10390 | return 1; |
10391 | } | |
10392 | \f | |
10393 | /* Store the parameter declarations into the current function declaration. | |
10394 | This is called after parsing the parameter declarations, before | |
10395 | digesting the body of the function. | |
10396 | ||
10397 | Also install to binding contour return value identifier, if any. */ | |
10398 | ||
6528331d | 10399 | static void |
1b72315d | 10400 | store_parm_decls (tree current_function_parms) |
471086d6 | 10401 | { |
cd16867a | 10402 | tree fndecl = current_function_decl; |
10403 | tree parm; | |
471086d6 | 10404 | |
471086d6 | 10405 | /* This is a chain of any other decls that came in among the parm |
10406 | declarations. If a parm is declared with enum {foo, bar} x; | |
10407 | then CONST_DECLs for foo and bar are put here. */ | |
10408 | tree nonparms = NULL_TREE; | |
10409 | ||
e0e489c4 | 10410 | if (current_function_parms) |
471086d6 | 10411 | { |
10412 | /* This case is when the function was defined with an ANSI prototype. | |
10413 | The parms already have decls, so we need not do anything here | |
10414 | except record them as in effect | |
10415 | and complain if any redundant old-style parm decls were written. */ | |
10416 | ||
e0e489c4 | 10417 | tree specparms = current_function_parms; |
10418 | tree next; | |
10419 | ||
6528331d | 10420 | /* Must clear this because it might contain TYPE_DECLs declared |
e0e489c4 | 10421 | at class level. */ |
836495aa | 10422 | current_binding_level->names = NULL; |
471086d6 | 10423 | |
6528331d | 10424 | /* If we're doing semantic analysis, then we'll call pushdecl |
e0e489c4 | 10425 | for each of these. We must do them in reverse order so that |
10426 | they end in the correct forward order. */ | |
6528331d | 10427 | specparms = nreverse (specparms); |
e857e9c7 | 10428 | |
e0e489c4 | 10429 | for (parm = specparms; parm; parm = next) |
471086d6 | 10430 | { |
10431 | next = TREE_CHAIN (parm); | |
10432 | if (TREE_CODE (parm) == PARM_DECL) | |
10433 | { | |
6528331d | 10434 | if (DECL_NAME (parm) == NULL_TREE |
10435 | || TREE_CODE (parm) != VOID_TYPE) | |
10436 | pushdecl (parm); | |
10437 | else | |
cf103c6c | 10438 | error ("parameter `%D' declared void", parm); |
471086d6 | 10439 | } |
10440 | else | |
10441 | { | |
10442 | /* If we find an enum constant or a type tag, | |
10443 | put it aside for the moment. */ | |
10444 | TREE_CHAIN (parm) = NULL_TREE; | |
10445 | nonparms = chainon (nonparms, parm); | |
10446 | } | |
10447 | } | |
10448 | ||
6528331d | 10449 | /* Get the decls in their original chain order and record in the |
10450 | function. This is all and only the PARM_DECLs that were | |
10451 | pushed into scope by the loop above. */ | |
10452 | DECL_ARGUMENTS (fndecl) = getdecls (); | |
471086d6 | 10453 | } |
10454 | else | |
10455 | DECL_ARGUMENTS (fndecl) = NULL_TREE; | |
10456 | ||
10457 | /* Now store the final chain of decls for the arguments | |
10458 | as the decl-chain of the current lexical scope. | |
10459 | Put the enumerators in as well, at the front so that | |
10460 | DECL_ARGUMENTS is not modified. */ | |
836495aa | 10461 | current_binding_level->names = chainon (nonparms, DECL_ARGUMENTS (fndecl)); |
f85d646a | 10462 | |
e0e489c4 | 10463 | /* Do the starting of the exception specifications, if we have any. */ |
980877d7 | 10464 | if (flag_exceptions && !processing_template_decl |
90252716 | 10465 | && flag_enforce_eh_specs |
e0e489c4 | 10466 | && TYPE_RAISES_EXCEPTIONS (TREE_TYPE (current_function_decl))) |
df4b504c | 10467 | current_eh_spec_block = begin_eh_spec_block (); |
471086d6 | 10468 | } |
10469 | ||
471086d6 | 10470 | \f |
7f075a5e | 10471 | /* We have finished doing semantic analysis on DECL, but have not yet |
10472 | generated RTL for its body. Save away our current state, so that | |
10473 | when we want to generate RTL later we know what to do. */ | |
10474 | ||
10475 | static void | |
1b72315d | 10476 | save_function_data (tree decl) |
7f075a5e | 10477 | { |
1f3233d1 | 10478 | struct language_function *f; |
7f075a5e | 10479 | |
10480 | /* Save the language-specific per-function data so that we can | |
10481 | get it back when we really expand this function. */ | |
10482 | my_friendly_assert (!DECL_PENDING_INLINE_P (decl), | |
10483 | 19990908); | |
980877d7 | 10484 | |
7f075a5e | 10485 | /* Make a copy. */ |
6edf18a6 | 10486 | f = ggc_alloc (sizeof (struct language_function)); |
1f3233d1 | 10487 | memcpy (f, cp_function_chain, sizeof (struct language_function)); |
7f075a5e | 10488 | DECL_SAVED_FUNCTION_DATA (decl) = f; |
10489 | ||
10490 | /* Clear out the bits we don't need. */ | |
2363ef00 | 10491 | f->base.x_stmt_tree.x_cur_stmt_list = NULL_TREE; |
7f075a5e | 10492 | f->x_named_label_uses = NULL; |
10493 | f->bindings = NULL; | |
e6393a02 | 10494 | f->x_local_names = NULL; |
7f075a5e | 10495 | } |
10496 | ||
7e3e1bb9 | 10497 | /* Add a note to mark the beginning of the main body of the constructor. |
10498 | This is used to set up the data structures for the cleanup regions for | |
10499 | fully-constructed bases and members. */ | |
10500 | ||
10501 | static void | |
1b72315d | 10502 | begin_constructor_body (void) |
7e3e1bb9 | 10503 | { |
7e3e1bb9 | 10504 | } |
10505 | ||
52616263 | 10506 | /* Add a note to mark the end of the main body of the constructor. This is |
10507 | used to end the cleanup regions for fully-constructed bases and | |
10508 | members. */ | |
51046b65 | 10509 | |
10510 | static void | |
1b72315d | 10511 | finish_constructor_body (void) |
51046b65 | 10512 | { |
51046b65 | 10513 | } |
10514 | ||
7e3e1bb9 | 10515 | /* Do all the processing for the beginning of a destructor; set up the |
10516 | vtable pointers and cleanups for bases and members. */ | |
10517 | ||
10518 | static void | |
1b72315d | 10519 | begin_destructor_body (void) |
7e3e1bb9 | 10520 | { |
10521 | tree if_stmt; | |
10522 | tree compound_stmt; | |
10523 | ||
10524 | /* If the dtor is empty, and we know there is not any possible | |
10525 | way we could use any vtable entries, before they are possibly | |
10526 | set by a base class dtor, we don't have to setup the vtables, | |
10527 | as we know that any base class dtor will set up any vtables | |
10528 | it needs. We avoid MI, because one base class dtor can do a | |
10529 | virtual dispatch to an overridden function that would need to | |
10530 | have a non-related vtable set up, we cannot avoid setting up | |
10531 | vtables in that case. We could change this to see if there | |
10532 | is just one vtable. | |
10533 | ||
10534 | ??? In the destructor for a class, the vtables are set | |
10535 | appropriately for that class. There will be no non-related | |
10536 | vtables. jason 2001-12-11. */ | |
10537 | if_stmt = begin_if_stmt (); | |
10538 | ||
10539 | /* If it is not safe to avoid setting up the vtables, then | |
10540 | someone will change the condition to be boolean_true_node. | |
10541 | (Actually, for now, we do not have code to set the condition | |
10542 | appropriately, so we just assume that we always need to | |
10543 | initialize the vtables.) */ | |
10544 | finish_if_stmt_cond (boolean_true_node, if_stmt); | |
7e3e1bb9 | 10545 | |
2363ef00 | 10546 | compound_stmt = begin_compound_stmt (0); |
7e3e1bb9 | 10547 | |
10548 | /* Make all virtual function table pointers in non-virtual base | |
10549 | classes point to CURRENT_CLASS_TYPE's virtual function | |
10550 | tables. */ | |
10551 | initialize_vtbl_ptrs (current_class_ptr); | |
10552 | ||
68f8f8cc | 10553 | finish_compound_stmt (compound_stmt); |
7e3e1bb9 | 10554 | finish_then_clause (if_stmt); |
2363ef00 | 10555 | finish_if_stmt (if_stmt); |
7e3e1bb9 | 10556 | |
10557 | /* And insert cleanups for our bases and members so that they | |
10558 | will be properly destroyed if we throw. */ | |
10559 | push_base_cleanups (); | |
10560 | } | |
10561 | ||
52616263 | 10562 | /* At the end of every destructor we generate code to delete the object if |
10563 | necessary. Do that now. */ | |
3da16ddc | 10564 | |
10565 | static void | |
1b72315d | 10566 | finish_destructor_body (void) |
3da16ddc | 10567 | { |
3da16ddc | 10568 | tree exprstmt; |
10569 | ||
c47a7ada | 10570 | /* Any return from a destructor will end up here; that way all base |
10571 | and member cleanups will be run when the function returns. */ | |
10572 | add_stmt (build_stmt (LABEL_STMT, dtor_label)); | |
10573 | ||
b429d3ee | 10574 | /* In a virtual destructor, we must call delete. */ |
10575 | if (DECL_VIRTUAL_P (current_function_decl)) | |
10576 | { | |
10577 | tree if_stmt; | |
d4c4d95c | 10578 | tree virtual_size = cxx_sizeof (current_class_type); |
980877d7 | 10579 | |
b429d3ee | 10580 | /* [class.dtor] |
980877d7 | 10581 | |
52616263 | 10582 | At the point of definition of a virtual destructor (including |
10583 | an implicit definition), non-placement operator delete shall | |
10584 | be looked up in the scope of the destructor's class and if | |
10585 | found shall be accessible and unambiguous. */ | |
b429d3ee | 10586 | exprstmt = build_op_delete_call |
1611df57 | 10587 | (DELETE_EXPR, current_class_ptr, virtual_size, |
10588 | /*global_p=*/false, NULL_TREE); | |
f04596da | 10589 | |
b429d3ee | 10590 | if_stmt = begin_if_stmt (); |
10591 | finish_if_stmt_cond (build (BIT_AND_EXPR, integer_type_node, | |
10592 | current_in_charge_parm, | |
10593 | integer_one_node), | |
10594 | if_stmt); | |
10595 | finish_expr_stmt (exprstmt); | |
10596 | finish_then_clause (if_stmt); | |
2363ef00 | 10597 | finish_if_stmt (if_stmt); |
b429d3ee | 10598 | } |
52616263 | 10599 | } |
3da16ddc | 10600 | |
52616263 | 10601 | /* Do the necessary processing for the beginning of a function body, which |
10602 | in this case includes member-initializers, but not the catch clauses of | |
10603 | a function-try-block. Currently, this means opening a binding level | |
10604 | for the member-initializers (in a ctor) and member cleanups (in a dtor). | |
10605 | In other functions, this isn't necessary, but it doesn't hurt. */ | |
10606 | ||
10607 | tree | |
1b72315d | 10608 | begin_function_body (void) |
52616263 | 10609 | { |
7e3e1bb9 | 10610 | tree stmt; |
10611 | ||
e0c6233d | 10612 | if (processing_template_decl) |
10613 | /* Do nothing now. */; | |
10614 | else | |
10615 | /* Always keep the BLOCK node associated with the outermost pair of | |
10616 | curly braces of a function. These are needed for correct | |
10617 | operation of dwarfout.c. */ | |
e880f232 | 10618 | keep_next_level (true); |
e0c6233d | 10619 | |
2363ef00 | 10620 | stmt = begin_compound_stmt (BCS_FN_BODY); |
52616263 | 10621 | COMPOUND_STMT_BODY_BLOCK (stmt) = 1; |
7e3e1bb9 | 10622 | |
10623 | if (processing_template_decl) | |
10624 | /* Do nothing now. */; | |
10625 | else if (DECL_CONSTRUCTOR_P (current_function_decl)) | |
10626 | begin_constructor_body (); | |
10627 | else if (DECL_DESTRUCTOR_P (current_function_decl)) | |
10628 | begin_destructor_body (); | |
10629 | ||
52616263 | 10630 | return stmt; |
3da16ddc | 10631 | } |
10632 | ||
52616263 | 10633 | /* Do the processing for the end of a function body. Currently, this means |
10634 | closing out the cleanups for fully-constructed bases and members, and in | |
10635 | the case of the destructor, deleting the object if desired. Again, this | |
10636 | is only meaningful for [cd]tors, since they are the only functions where | |
10637 | there is a significant distinction between the main body and any | |
10638 | function catch clauses. Handling, say, main() return semantics here | |
10639 | would be wrong, as flowing off the end of a function catch clause for | |
10640 | main() would also need to return 0. */ | |
10641 | ||
10642 | void | |
1b72315d | 10643 | finish_function_body (tree compstmt) |
52616263 | 10644 | { |
c47a7ada | 10645 | /* Close the block. */ |
68f8f8cc | 10646 | finish_compound_stmt (compstmt); |
52616263 | 10647 | |
10648 | if (processing_template_decl) | |
10649 | /* Do nothing now. */; | |
10650 | else if (DECL_CONSTRUCTOR_P (current_function_decl)) | |
10651 | finish_constructor_body (); | |
10652 | else if (DECL_DESTRUCTOR_P (current_function_decl)) | |
10653 | finish_destructor_body (); | |
10654 | } | |
10655 | ||
471086d6 | 10656 | /* Finish up a function declaration and compile that function |
10657 | all the way to assembler language output. The free the storage | |
10658 | for the function definition. | |
10659 | ||
980877d7 | 10660 | FLAGS is a bitwise or of the following values: |
53137e6a | 10661 | 2 - INCLASS_INLINE |
10662 | We just finished processing the body of an in-class inline | |
10663 | function definition. (This processing will have taken place | |
23f83a9a | 10664 | after the class definition is complete.) */ |
471086d6 | 10665 | |
07d01fbf | 10666 | tree |
1b72315d | 10667 | finish_function (int flags) |
471086d6 | 10668 | { |
cd16867a | 10669 | tree fndecl = current_function_decl; |
471086d6 | 10670 | tree fntype, ctype = NULL_TREE; |
53137e6a | 10671 | int inclass_inline = (flags & 2) != 0; |
23f83a9a | 10672 | int nested; |
471086d6 | 10673 | |
10674 | /* When we get some parse errors, we can end up without a | |
10675 | current_function_decl, so cope. */ | |
10676 | if (fndecl == NULL_TREE) | |
07d01fbf | 10677 | return error_mark_node; |
471086d6 | 10678 | |
9bacae7e | 10679 | if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fndecl) |
10680 | && DECL_VIRTUAL_P (fndecl) | |
10681 | && !processing_template_decl) | |
10682 | { | |
10683 | tree fnclass = DECL_CONTEXT (fndecl); | |
10684 | if (fndecl == CLASSTYPE_KEY_METHOD (fnclass)) | |
10685 | keyed_classes = tree_cons (NULL_TREE, fnclass, keyed_classes); | |
10686 | } | |
10687 | ||
23f83a9a | 10688 | nested = function_depth > 1; |
471086d6 | 10689 | fntype = TREE_TYPE (fndecl); |
10690 | ||
3da16ddc | 10691 | /* TREE_READONLY (fndecl) = 1; |
10692 | This caused &foo to be of type ptr-to-const-function | |
10693 | which then got a warning when stored in a ptr-to-function variable. */ | |
471086d6 | 10694 | |
6528331d | 10695 | my_friendly_assert (building_stmt_tree (), 20000911); |
65b7f83f | 10696 | |
e55cba4c | 10697 | /* For a cloned function, we've already got all the code we need; |
10698 | there's no need to add any extra bits. */ | |
6528331d | 10699 | if (!DECL_CLONED_FUNCTION_P (fndecl)) |
471086d6 | 10700 | { |
52616263 | 10701 | if (DECL_MAIN_P (current_function_decl)) |
51046b65 | 10702 | { |
10703 | /* Make it so that `main' always returns 0 by default. */ | |
d442be7a | 10704 | #if VMS_TARGET |
51046b65 | 10705 | finish_return_stmt (integer_one_node); |
10706 | #else | |
10707 | finish_return_stmt (integer_zero_node); | |
10708 | #endif | |
10709 | } | |
23f83a9a | 10710 | |
e0e489c4 | 10711 | /* Finish dealing with exception specifiers. */ |
10712 | if (flag_exceptions && !processing_template_decl | |
90252716 | 10713 | && flag_enforce_eh_specs |
e0e489c4 | 10714 | && TYPE_RAISES_EXCEPTIONS (TREE_TYPE (current_function_decl))) |
df4b504c | 10715 | finish_eh_spec_block (TYPE_RAISES_EXCEPTIONS |
10716 | (TREE_TYPE (current_function_decl)), | |
10717 | current_eh_spec_block); | |
e857e9c7 | 10718 | } |
980877d7 | 10719 | |
019cf886 | 10720 | /* If we're saving up tree structure, tie off the function now. */ |
2363ef00 | 10721 | DECL_SAVED_TREE (fndecl) = pop_stmt_list (DECL_SAVED_TREE (fndecl)); |
10722 | ||
10723 | finish_fname_decls (); | |
f96b25bb | 10724 | |
95cedffb | 10725 | /* If this function can't throw any exceptions, remember that. */ |
10726 | if (!processing_template_decl | |
10727 | && !cp_function_chain->can_throw | |
10728 | && !flag_non_call_exceptions) | |
10729 | TREE_NOTHROW (fndecl) = 1; | |
10730 | ||
471086d6 | 10731 | /* This must come after expand_function_end because cleanups might |
10732 | have declarations (from inline functions) that need to go into | |
10733 | this function's blocks. */ | |
6cd31fa5 | 10734 | |
10735 | /* If the current binding level isn't the outermost binding level | |
10736 | for this function, either there is a bug, or we have experienced | |
10737 | syntax errors and the statement tree is malformed. */ | |
37b9a732 | 10738 | if (current_binding_level->kind != sk_function_parms) |
6cd31fa5 | 10739 | { |
10740 | /* Make sure we have already experienced errors. */ | |
10741 | if (errorcount == 0) | |
10742 | abort (); | |
10743 | ||
10744 | /* Throw away the broken statement tree and extra binding | |
10745 | levels. */ | |
10746 | DECL_SAVED_TREE (fndecl) = build_stmt (COMPOUND_STMT, NULL_TREE); | |
10747 | ||
37b9a732 | 10748 | while (current_binding_level->kind != sk_function_parms) |
6cd31fa5 | 10749 | { |
37b9a732 | 10750 | if (current_binding_level->kind == sk_class) |
6cd31fa5 | 10751 | pop_nested_class (); |
10752 | else | |
10753 | poplevel (0, 0, 0); | |
10754 | } | |
10755 | } | |
6528331d | 10756 | poplevel (1, 0, 1); |
471086d6 | 10757 | |
90e3d9ba | 10758 | /* Statements should always be full-expressions at the outermost set |
10759 | of curly braces for a function. */ | |
10760 | my_friendly_assert (stmts_are_full_exprs_p (), 19990831); | |
10761 | ||
4ee9c684 | 10762 | /* Set up the named return value optimization, if we can. Candidate |
10763 | variables are selected in check_return_value. */ | |
4cfd9030 | 10764 | if (current_function_return_value) |
10765 | { | |
10766 | tree r = current_function_return_value; | |
7a8682e3 | 10767 | tree outer; |
10768 | ||
4cfd9030 | 10769 | if (r != error_mark_node |
7a8682e3 | 10770 | /* This is only worth doing for fns that return in memory--and |
10771 | simpler, since we don't have to worry about promoted modes. */ | |
45550790 | 10772 | && aggregate_value_p (TREE_TYPE (TREE_TYPE (fndecl)), fndecl) |
7a8682e3 | 10773 | /* Only allow this for variables declared in the outer scope of |
10774 | the function so we know that their lifetime always ends with a | |
10775 | return; see g++.dg/opt/nrv6.C. We could be more flexible if | |
10776 | we were to do this optimization in tree-ssa. */ | |
2363ef00 | 10777 | && (outer = BLOCK_SUBBLOCKS (DECL_INITIAL (fndecl))) |
7a8682e3 | 10778 | /* Skip the artificial function body block. */ |
2363ef00 | 10779 | && (outer = BLOCK_SUBBLOCKS (outer)) |
10780 | && chain_member (r, BLOCK_VARS (outer))) | |
4ee9c684 | 10781 | finalize_nrv (&DECL_SAVED_TREE (fndecl), r, DECL_RESULT (fndecl)); |
10782 | ||
10783 | current_function_return_value = NULL_TREE; | |
4cfd9030 | 10784 | } |
10785 | ||
d119628b | 10786 | /* Remember that we were in class scope. */ |
c25194fd | 10787 | if (current_class_name) |
d119628b | 10788 | ctype = current_class_type; |
c25194fd | 10789 | |
c98119cd | 10790 | /* Must mark the RESULT_DECL as being in this function. */ |
10791 | DECL_CONTEXT (DECL_RESULT (fndecl)) = fndecl; | |
10792 | ||
10793 | /* Set the BLOCK_SUPERCONTEXT of the outermost function scope to point | |
10794 | to the FUNCTION_DECL node itself. */ | |
10795 | BLOCK_SUPERCONTEXT (DECL_INITIAL (fndecl)) = fndecl; | |
10796 | ||
7f075a5e | 10797 | /* Save away current state, if appropriate. */ |
6528331d | 10798 | if (!processing_template_decl) |
7f075a5e | 10799 | save_function_data (fndecl); |
10800 | ||
69f4b398 | 10801 | /* Complain if there's just no return statement. */ |
4edb3605 | 10802 | if (warn_return_type |
69f4b398 | 10803 | && TREE_CODE (TREE_TYPE (fntype)) != VOID_TYPE |
7fac55ae | 10804 | && !dependent_type_p (TREE_TYPE (fntype)) |
8fb42a55 | 10805 | && !current_function_returns_value && !current_function_returns_null |
69f4b398 | 10806 | /* Don't complain if we abort or throw. */ |
10807 | && !current_function_returns_abnormally | |
15899e2f | 10808 | && !DECL_NAME (DECL_RESULT (fndecl))) |
10809 | #if 0 | |
10810 | /* Enable this for all functions until bug 14107 is fixed properly. */ | |
4edb3605 | 10811 | /* Normally, with -Wreturn-type, flow will complain. Unless we're an |
69f4b398 | 10812 | inline function, as we might never be compiled separately. */ |
261c3c20 | 10813 | && (DECL_INLINE (fndecl) || processing_template_decl)) |
15899e2f | 10814 | #endif |
69f4b398 | 10815 | warning ("no return statement in function returning non-void"); |
90e3d9ba | 10816 | |
4ee9c684 | 10817 | /* Store the end of the function, so that we get good line number |
10818 | info for the epilogue. */ | |
10819 | cfun->function_end_locus = input_location; | |
10820 | ||
10821 | /* Genericize before inlining. */ | |
10822 | if (!processing_template_decl) | |
10823 | { | |
10824 | c_genericize (fndecl); | |
10825 | ||
10826 | /* Handle attribute((warn_unused_result)). Relies on gimple input. */ | |
10827 | c_warn_unused_result (&DECL_SAVED_TREE (fndecl)); | |
10828 | } | |
10829 | ||
10830 | /* We're leaving the context of this function, so zap cfun. It's still in | |
10831 | DECL_STRUCT_FUNCTION, and we'll restore it in tree_rest_of_compilation. */ | |
6528331d | 10832 | cfun = NULL; |
c437b0dc | 10833 | current_function_decl = NULL; |
d119628b | 10834 | |
92d27c95 | 10835 | /* If this is an in-class inline definition, we may have to pop the |
d119628b | 10836 | bindings for the template parameters that we added in |
10837 | maybe_begin_member_template_processing when start_function was | |
10838 | called. */ | |
10839 | if (inclass_inline) | |
10840 | maybe_end_member_template_processing (); | |
10841 | ||
10842 | /* Leave the scope of the class. */ | |
10843 | if (ctype) | |
10844 | pop_nested_class (); | |
e857e9c7 | 10845 | |
10846 | --function_depth; | |
471086d6 | 10847 | |
07d01fbf | 10848 | /* Clean up. */ |
bea7d742 | 10849 | if (! nested) |
d7c47c0e | 10850 | /* Let the error reporting routines know that we're outside a |
10851 | function. For a nested function, this value is used in | |
c80c4f22 | 10852 | cxx_pop_function_context and then reset via pop_function_context. */ |
d7c47c0e | 10853 | current_function_decl = NULL_TREE; |
07d01fbf | 10854 | |
10855 | return fndecl; | |
471086d6 | 10856 | } |
10857 | \f | |
10858 | /* Create the FUNCTION_DECL for a function definition. | |
471086d6 | 10859 | DECLSPECS and DECLARATOR are the parts of the declaration; |
10860 | they describe the return type and the name of the function, | |
10861 | but twisted together in a fashion that parallels the syntax of C. | |
10862 | ||
10863 | This function creates a binding context for the function body | |
10864 | as well as setting up the FUNCTION_DECL in current_function_decl. | |
10865 | ||
10866 | Returns a FUNCTION_DECL on success. | |
10867 | ||
10868 | If the DECLARATOR is not suitable for a function (it defines a datum | |
10869 | instead), we return 0, which tells yyparse to report a parse error. | |
10870 | ||
10871 | May return void_type_node indicating that this method is actually | |
10872 | a friend. See grokfield for more details. | |
10873 | ||
10874 | Came here with a `.pushlevel' . | |
10875 | ||
10876 | DO NOT MAKE ANY CHANGES TO THIS CODE WITHOUT MAKING CORRESPONDING | |
10877 | CHANGES TO CODE IN `grokfield'. */ | |
96624a9e | 10878 | |
471086d6 | 10879 | tree |
1b72315d | 10880 | start_method (tree declspecs, tree declarator, tree attrlist) |
471086d6 | 10881 | { |
f9670f72 | 10882 | tree fndecl = grokdeclarator (declarator, declspecs, MEMFUNCDEF, 0, |
e3c541f0 | 10883 | &attrlist); |
471086d6 | 10884 | |
0a3b29ad | 10885 | if (fndecl == error_mark_node) |
10886 | return error_mark_node; | |
10887 | ||
10888 | if (fndecl == NULL || TREE_CODE (fndecl) != FUNCTION_DECL) | |
10889 | { | |
10890 | error ("invalid member function declaration"); | |
10891 | return error_mark_node; | |
10892 | } | |
471086d6 | 10893 | |
34966237 | 10894 | if (attrlist) |
10895 | cplus_decl_attributes (&fndecl, attrlist, 0); | |
10896 | ||
471086d6 | 10897 | /* Pass friends other than inline friend functions back. */ |
f468434d | 10898 | if (fndecl == void_type_node) |
471086d6 | 10899 | return fndecl; |
10900 | ||
471086d6 | 10901 | if (DECL_IN_AGGR_P (fndecl)) |
10902 | { | |
28bbd27a | 10903 | if (DECL_CONTEXT (fndecl) |
10904 | && TREE_CODE( DECL_CONTEXT (fndecl)) != NAMESPACE_DECL) | |
10905 | error ("`%D' is already defined in class `%T'", fndecl, | |
10906 | DECL_CONTEXT (fndecl)); | |
471086d6 | 10907 | return void_type_node; |
10908 | } | |
10909 | ||
c24cced6 | 10910 | check_template_shadow (fndecl); |
10911 | ||
d3981643 | 10912 | DECL_DECLARED_INLINE_P (fndecl) = 1; |
0543e7a9 | 10913 | if (flag_default_inline) |
471086d6 | 10914 | DECL_INLINE (fndecl) = 1; |
10915 | ||
34197853 | 10916 | /* We process method specializations in finish_struct_1. */ |
10917 | if (processing_template_decl && !DECL_TEMPLATE_SPECIALIZATION (fndecl)) | |
b7d1e8ea | 10918 | { |
10919 | fndecl = push_template_decl (fndecl); | |
10920 | if (fndecl == error_mark_node) | |
10921 | return fndecl; | |
10922 | } | |
ddb9bca7 | 10923 | |
471086d6 | 10924 | if (! DECL_FRIEND_P (fndecl)) |
10925 | { | |
471086d6 | 10926 | if (TREE_CHAIN (fndecl)) |
10927 | { | |
10928 | fndecl = copy_node (fndecl); | |
10929 | TREE_CHAIN (fndecl) = NULL_TREE; | |
10930 | } | |
01779b5f | 10931 | grok_special_member_properties (fndecl); |
471086d6 | 10932 | } |
10933 | ||
ce23987e | 10934 | cp_finish_decl (fndecl, NULL_TREE, NULL_TREE, 0); |
471086d6 | 10935 | |
331bc0ad | 10936 | /* Make a place for the parms. */ |
e880f232 | 10937 | begin_scope (sk_function_parms, fndecl); |
980877d7 | 10938 | |
471086d6 | 10939 | DECL_IN_AGGR_P (fndecl) = 1; |
10940 | return fndecl; | |
10941 | } | |
10942 | ||
10943 | /* Go through the motions of finishing a function definition. | |
10944 | We don't compile this method until after the whole class has | |
10945 | been processed. | |
10946 | ||
10947 | FINISH_METHOD must return something that looks as though it | |
10948 | came from GROKFIELD (since we are defining a method, after all). | |
10949 | ||
10950 | This is called after parsing the body of the function definition. | |
10951 | STMTS is the chain of statements that makes up the function body. | |
10952 | ||
10953 | DECL is the ..._DECL that `start_method' provided. */ | |
10954 | ||
10955 | tree | |
1b72315d | 10956 | finish_method (tree decl) |
471086d6 | 10957 | { |
cd16867a | 10958 | tree fndecl = decl; |
471086d6 | 10959 | tree old_initial; |
471086d6 | 10960 | |
cd16867a | 10961 | tree link; |
471086d6 | 10962 | |
f468434d | 10963 | if (decl == void_type_node) |
471086d6 | 10964 | return decl; |
10965 | ||
10966 | old_initial = DECL_INITIAL (fndecl); | |
10967 | ||
10968 | /* Undo the level for the parms (from start_method). | |
10969 | This is like poplevel, but it causes nothing to be | |
10970 | saved. Saving information here confuses symbol-table | |
10971 | output routines. Besides, this information will | |
10972 | be correctly output when this method is actually | |
10973 | compiled. */ | |
10974 | ||
10975 | /* Clear out the meanings of the local variables of this level; | |
10976 | also record in each decl which block it belongs to. */ | |
10977 | ||
10978 | for (link = current_binding_level->names; link; link = TREE_CHAIN (link)) | |
10979 | { | |
10980 | if (DECL_NAME (link) != NULL_TREE) | |
2b77484d | 10981 | pop_binding (DECL_NAME (link), link); |
471086d6 | 10982 | my_friendly_assert (TREE_CODE (link) != FUNCTION_DECL, 163); |
10983 | DECL_CONTEXT (link) = NULL_TREE; | |
10984 | } | |
10985 | ||
471086d6 | 10986 | poplevel (0, 0, 0); |
10987 | ||
10988 | DECL_INITIAL (fndecl) = old_initial; | |
10989 | ||
10990 | /* We used to check if the context of FNDECL was different from | |
10991 | current_class_type as another way to get inside here. This didn't work | |
10992 | for String.cc in libg++. */ | |
10993 | if (DECL_FRIEND_P (fndecl)) | |
10994 | { | |
10995 | CLASSTYPE_INLINE_FRIENDS (current_class_type) | |
10996 | = tree_cons (NULL_TREE, fndecl, CLASSTYPE_INLINE_FRIENDS (current_class_type)); | |
10997 | decl = void_type_node; | |
10998 | } | |
10999 | ||
11000 | return decl; | |
11001 | } | |
11002 | \f | |
242fc35c | 11003 | |
11004 | /* VAR is a VAR_DECL. If its type is incomplete, remember VAR so that | |
11005 | we can lay it out later, when and if its type becomes complete. */ | |
471086d6 | 11006 | |
11007 | void | |
1b72315d | 11008 | maybe_register_incomplete_var (tree var) |
471086d6 | 11009 | { |
242fc35c | 11010 | my_friendly_assert (TREE_CODE (var) == VAR_DECL, 20020406); |
471086d6 | 11011 | |
242fc35c | 11012 | /* Keep track of variables with incomplete types. */ |
11013 | if (!processing_template_decl && TREE_TYPE (var) != error_mark_node | |
11014 | && DECL_EXTERNAL (var)) | |
fd8d6049 | 11015 | { |
242fc35c | 11016 | tree inner_type = TREE_TYPE (var); |
11017 | ||
11018 | while (TREE_CODE (inner_type) == ARRAY_TYPE) | |
11019 | inner_type = TREE_TYPE (inner_type); | |
11020 | inner_type = TYPE_MAIN_VARIANT (inner_type); | |
11021 | ||
11022 | if ((!COMPLETE_TYPE_P (inner_type) && CLASS_TYPE_P (inner_type)) | |
11023 | /* RTTI TD entries are created while defining the type_info. */ | |
11024 | || (TYPE_LANG_SPECIFIC (inner_type) | |
11025 | && TYPE_BEING_DEFINED (inner_type))) | |
11026 | incomplete_vars = tree_cons (inner_type, var, incomplete_vars); | |
fd8d6049 | 11027 | } |
242fc35c | 11028 | } |
fd8d6049 | 11029 | |
242fc35c | 11030 | /* Called when a class type (given by TYPE) is defined. If there are |
11031 | any existing VAR_DECLs whose type hsa been completed by this | |
11032 | declaration, update them now. */ | |
fd8d6049 | 11033 | |
242fc35c | 11034 | void |
1b72315d | 11035 | complete_vars (tree type) |
242fc35c | 11036 | { |
11037 | tree *list = &incomplete_vars; | |
11038 | ||
11039 | my_friendly_assert (CLASS_TYPE_P (type), 20020406); | |
11040 | while (*list) | |
11041 | { | |
11042 | if (same_type_p (type, TREE_PURPOSE (*list))) | |
fd8d6049 | 11043 | { |
242fc35c | 11044 | tree var = TREE_VALUE (*list); |
b3609646 | 11045 | /* Complete the type of the variable. The VAR_DECL itself |
11046 | will be laid out in expand_expr. */ | |
11047 | complete_type (TREE_TYPE (var)); | |
242fc35c | 11048 | /* Remove this entry from the list. */ |
11049 | *list = TREE_CHAIN (*list); | |
ce28ee2e | 11050 | } |
11051 | else | |
242fc35c | 11052 | list = &TREE_CHAIN (*list); |
ce28ee2e | 11053 | } |
471086d6 | 11054 | } |
11055 | ||
675996d9 | 11056 | /* If DECL is of a type which needs a cleanup, build that cleanup |
11057 | here. */ | |
96624a9e | 11058 | |
675996d9 | 11059 | tree |
1b72315d | 11060 | cxx_maybe_build_cleanup (tree decl) |
471086d6 | 11061 | { |
11062 | tree type = TREE_TYPE (decl); | |
675996d9 | 11063 | |
89e923d8 | 11064 | if (type != error_mark_node && TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type)) |
471086d6 | 11065 | { |
5af5654a | 11066 | int flags = LOOKUP_NORMAL|LOOKUP_DESTRUCTOR; |
471086d6 | 11067 | tree rval; |
471086d6 | 11068 | |
471086d6 | 11069 | if (TREE_CODE (type) == ARRAY_TYPE) |
11070 | rval = decl; | |
11071 | else | |
11072 | { | |
9b86eec0 | 11073 | cxx_mark_addressable (decl); |
471086d6 | 11074 | rval = build_unary_op (ADDR_EXPR, decl, 0); |
11075 | } | |
11076 | ||
11077 | /* Optimize for space over speed here. */ | |
11078 | if (! TYPE_USES_VIRTUAL_BASECLASSES (type) | |
11079 | || flag_expensive_optimizations) | |
11080 | flags |= LOOKUP_NONVIRTUAL; | |
11081 | ||
675996d9 | 11082 | rval = build_delete (TREE_TYPE (rval), rval, |
11083 | sfk_complete_destructor, flags, 0); | |
471086d6 | 11084 | |
11085 | if (TYPE_USES_VIRTUAL_BASECLASSES (type) | |
11086 | && ! TYPE_HAS_DESTRUCTOR (type)) | |
8a4008da | 11087 | rval = build_compound_expr (rval, build_vbase_delete (type, decl)); |
471086d6 | 11088 | |
471086d6 | 11089 | return rval; |
11090 | } | |
7b6facbf | 11091 | return NULL_TREE; |
471086d6 | 11092 | } |
11093 | \f | |
019cf886 | 11094 | /* When a stmt has been parsed, this function is called. */ |
471086d6 | 11095 | |
11096 | void | |
1b72315d | 11097 | finish_stmt (void) |
471086d6 | 11098 | { |
471086d6 | 11099 | } |
11100 | ||
11fa0266 | 11101 | /* DECL was originally constructed as a non-static member function, |
11102 | but turned out to be static. Update it accordingly. */ | |
94f3b32d | 11103 | |
2d45f35b | 11104 | void |
1b72315d | 11105 | revert_static_member_fn (tree decl) |
471086d6 | 11106 | { |
94f3b32d | 11107 | tree tmp; |
11fa0266 | 11108 | tree function = TREE_TYPE (decl); |
11109 | tree args = TYPE_ARG_TYPES (function); | |
471086d6 | 11110 | |
3119c950 | 11111 | if (cp_type_quals (TREE_TYPE (TREE_VALUE (args))) |
3e04bd45 | 11112 | != TYPE_UNQUALIFIED) |
cf103c6c | 11113 | error ("static member function `%#D' declared with type qualifiers", |
2eee06a0 | 11114 | decl); |
ce28ee2e | 11115 | |
94f3b32d | 11116 | args = TREE_CHAIN (args); |
11117 | tmp = build_function_type (TREE_TYPE (function), args); | |
3119c950 | 11118 | tmp = build_qualified_type (tmp, cp_type_quals (function)); |
ce28ee2e | 11119 | tmp = build_exception_variant (tmp, |
471086d6 | 11120 | TYPE_RAISES_EXCEPTIONS (function)); |
11fa0266 | 11121 | TREE_TYPE (decl) = tmp; |
11122 | if (DECL_ARGUMENTS (decl)) | |
11123 | DECL_ARGUMENTS (decl) = TREE_CHAIN (DECL_ARGUMENTS (decl)); | |
11124 | DECL_STATIC_FUNCTION_P (decl) = 1; | |
471086d6 | 11125 | } |
d81e00a4 | 11126 | |
980877d7 | 11127 | /* Initialize the variables used during compilation of a C++ |
11128 | function. */ | |
c25194fd | 11129 | |
c80c4f22 | 11130 | void |
1b72315d | 11131 | cxx_push_function_context (struct function * f) |
54c2eeba | 11132 | { |
1f3233d1 | 11133 | struct language_function *p |
6edf18a6 | 11134 | = ggc_alloc_cleared (sizeof (struct language_function)); |
1f3233d1 | 11135 | f->language = p; |
c25194fd | 11136 | |
b48733fd | 11137 | /* Whenever we start a new function, we destroy temporaries in the |
11138 | usual way. */ | |
a08e60ae | 11139 | current_stmt_tree ()->stmts_are_full_exprs_p = 1; |
90e3d9ba | 11140 | |
11141 | if (f->decl) | |
11142 | { | |
11143 | tree fn = f->decl; | |
11144 | ||
90e3d9ba | 11145 | if (DECL_SAVED_FUNCTION_DATA (fn)) |
11146 | { | |
11147 | /* If we already parsed this function, and we're just expanding it | |
11148 | now, restore saved state. */ | |
11149 | *cp_function_chain = *DECL_SAVED_FUNCTION_DATA (fn); | |
11150 | ||
90e3d9ba | 11151 | /* We don't need the saved data anymore. Unless this is an inline |
11152 | function; we need the named return value info for | |
11153 | cp_copy_res_decl_for_inlining. */ | |
11154 | if (! DECL_INLINE (fn)) | |
11155 | DECL_SAVED_FUNCTION_DATA (fn) = NULL; | |
11156 | } | |
11157 | } | |
c25194fd | 11158 | } |
11159 | ||
d119628b | 11160 | /* Free the language-specific parts of F, now that we've finished |
11161 | compiling the function. */ | |
c25194fd | 11162 | |
c80c4f22 | 11163 | void |
1b72315d | 11164 | cxx_pop_function_context (struct function * f) |
c25194fd | 11165 | { |
54c2eeba | 11166 | f->language = 0; |
c25194fd | 11167 | } |
5eb54a7a | 11168 | |
1f3233d1 | 11169 | /* Return which tree structure is used by T, or TS_CP_GENERIC if T is |
11170 | one of the language-independent trees. */ | |
1e463950 | 11171 | |
1f3233d1 | 11172 | enum cp_tree_node_structure_enum |
1b72315d | 11173 | cp_tree_node_structure (union lang_tree_node * t) |
1e463950 | 11174 | { |
1f3233d1 | 11175 | switch (TREE_CODE (&t->generic)) |
1e463950 | 11176 | { |
0a3b29ad | 11177 | case DEFAULT_ARG: return TS_CP_DEFAULT_ARG; |
1f3233d1 | 11178 | case IDENTIFIER_NODE: return TS_CP_IDENTIFIER; |
1f3233d1 | 11179 | case OVERLOAD: return TS_CP_OVERLOAD; |
11180 | case TEMPLATE_PARM_INDEX: return TS_CP_TPI; | |
11181 | case PTRMEM_CST: return TS_CP_PTRMEM; | |
8c1f65e6 | 11182 | case BASELINK: return TS_CP_BASELINK; |
1f3233d1 | 11183 | default: return TS_CP_GENERIC; |
1e463950 | 11184 | } |
11185 | } | |
6bf5ed8d | 11186 | |
174fcc61 | 11187 | /* Build the void_list_node (void_type_node having been created). */ |
11188 | tree | |
1b72315d | 11189 | build_void_list_node (void) |
174fcc61 | 11190 | { |
11191 | tree t = build_tree_list (NULL_TREE, void_type_node); | |
11192 | TREE_PARMLIST (t) = 1; | |
11193 | return t; | |
11194 | } | |
11195 | ||
4ee9c684 | 11196 | bool |
1b72315d | 11197 | cp_missing_noreturn_ok_p (tree decl) |
20c01ba9 | 11198 | { |
11199 | /* A missing noreturn is ok for the `main' function. */ | |
7e64c604 | 11200 | return DECL_MAIN_P (decl); |
20c01ba9 | 11201 | } |
1f3233d1 | 11202 | |
11203 | #include "gt-cp-decl.h" | |
11204 | #include "gtype-cp.h" |