decl.c revision 259268
1/* Process declarations and variables for C++ compiler. 2 Copyright (C) 1988, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000, 3 2001, 2002, 2003, 2004, 2005, 2006 Free Software Foundation, Inc. 4 Contributed by Michael Tiemann (tiemann@cygnus.com) 5 6This file is part of GCC. 7 8GCC is free software; you can redistribute it and/or modify 9it under the terms of the GNU General Public License as published by 10the Free Software Foundation; either version 2, or (at your option) 11any later version. 12 13GCC is distributed in the hope that it will be useful, 14but WITHOUT ANY WARRANTY; without even the implied warranty of 15MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 16GNU General Public License for more details. 17 18You should have received a copy of the GNU General Public License 19along with GCC; see the file COPYING. If not, write to 20the Free Software Foundation, 51 Franklin Street, Fifth Floor, 21Boston, MA 02110-1301, USA. */ 22 23 24/* Process declarations and symbol lookup for C++ front end. 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 31#include "config.h" 32#include "system.h" 33#include "coretypes.h" 34#include "tm.h" 35#include "tree.h" 36#include "rtl.h" 37#include "expr.h" 38#include "flags.h" 39#include "cp-tree.h" 40#include "tree-inline.h" 41#include "decl.h" 42#include "output.h" 43#include "except.h" 44#include "toplev.h" 45#include "hashtab.h" 46#include "tm_p.h" 47#include "target.h" 48#include "c-common.h" 49#include "c-pragma.h" 50#include "diagnostic.h" 51#include "debug.h" 52#include "timevar.h" 53#include "tree-flow.h" 54 55static tree grokparms (cp_parameter_declarator *, tree *); 56static const char *redeclaration_error_message (tree, tree); 57 58static int decl_jump_unsafe (tree); 59static void require_complete_types_for_parms (tree); 60static int ambi_op_p (enum tree_code); 61static int unary_op_p (enum tree_code); 62static void push_local_name (tree); 63static tree grok_reference_init (tree, tree, tree, tree *); 64static tree grokvardecl (tree, tree, const cp_decl_specifier_seq *, 65 int, int, tree); 66static void record_unknown_type (tree, const char *); 67static tree builtin_function_1 (const char *, tree, tree, 68 enum built_in_function code, 69 enum built_in_class cl, const char *, 70 tree); 71static tree build_library_fn_1 (tree, enum tree_code, tree); 72static int member_function_or_else (tree, tree, enum overload_flags); 73static void bad_specifiers (tree, const char *, int, int, int, int, 74 int); 75static void check_for_uninitialized_const_var (tree); 76static hashval_t typename_hash (const void *); 77static int typename_compare (const void *, const void *); 78static tree local_variable_p_walkfn (tree *, int *, void *); 79static tree record_builtin_java_type (const char *, int); 80static const char *tag_name (enum tag_types); 81static tree lookup_and_check_tag (enum tag_types, tree, tag_scope, bool); 82static int walk_namespaces_r (tree, walk_namespaces_fn, void *); 83static void maybe_deduce_size_from_array_init (tree, tree); 84static void layout_var_decl (tree); 85static void maybe_commonize_var (tree); 86static tree check_initializer (tree, tree, int, tree *); 87static void make_rtl_for_nonlocal_decl (tree, tree, const char *); 88static void save_function_data (tree); 89static void check_function_type (tree, tree); 90static void finish_constructor_body (void); 91static void begin_destructor_body (void); 92static void finish_destructor_body (void); 93static tree create_array_type_for_decl (tree, tree, tree); 94static tree get_atexit_node (void); 95static tree get_dso_handle_node (void); 96static tree start_cleanup_fn (void); 97static void end_cleanup_fn (void); 98static tree cp_make_fname_decl (tree, int); 99static void initialize_predefined_identifiers (void); 100static tree check_special_function_return_type 101 (special_function_kind, tree, tree); 102static tree push_cp_library_fn (enum tree_code, tree); 103static tree build_cp_library_fn (tree, enum tree_code, tree); 104static void store_parm_decls (tree); 105static void initialize_local_var (tree, tree); 106static void expand_static_init (tree, tree); 107static tree next_initializable_field (tree); 108 109/* The following symbols are subsumed in the cp_global_trees array, and 110 listed here individually for documentation purposes. 111 112 C++ extensions 113 tree wchar_decl_node; 114 115 tree vtable_entry_type; 116 tree delta_type_node; 117 tree __t_desc_type_node; 118 119 tree class_type_node; 120 tree unknown_type_node; 121 122 Array type `vtable_entry_type[]' 123 124 tree vtbl_type_node; 125 tree vtbl_ptr_type_node; 126 127 Namespaces, 128 129 tree std_node; 130 tree abi_node; 131 132 A FUNCTION_DECL which can call `abort'. Not necessarily the 133 one that the user will declare, but sufficient to be called 134 by routines that want to abort the program. 135 136 tree abort_fndecl; 137 138 The FUNCTION_DECL for the default `::operator delete'. 139 140 tree global_delete_fndecl; 141 142 Used by RTTI 143 tree type_info_type_node, tinfo_decl_id, tinfo_decl_type; 144 tree tinfo_var_id; */ 145 146tree cp_global_trees[CPTI_MAX]; 147 148/* Indicates that there is a type value in some namespace, although 149 that is not necessarily in scope at the moment. */ 150 151tree global_type_node; 152 153/* The node that holds the "name" of the global scope. */ 154tree global_scope_name; 155 156#define local_names cp_function_chain->x_local_names 157 158/* A list of objects which have constructors or destructors 159 which reside in the global scope. The decl is stored in 160 the TREE_VALUE slot and the initializer is stored 161 in the TREE_PURPOSE slot. */ 162tree static_aggregates; 163 164/* -- end of C++ */ 165 166/* A node for the integer constants 2, and 3. */ 167 168tree integer_two_node, integer_three_node; 169 170/* Used only for jumps to as-yet undefined labels, since jumps to 171 defined labels can have their validity checked immediately. */ 172 173struct named_label_use_entry GTY(()) 174{ 175 struct named_label_use_entry *next; 176 /* The binding level to which this entry is *currently* attached. 177 This is initially the binding level in which the goto appeared, 178 but is modified as scopes are closed. */ 179 struct cp_binding_level *binding_level; 180 /* The head of the names list that was current when the goto appeared, 181 or the inner scope popped. These are the decls that will *not* be 182 skipped when jumping to the label. */ 183 tree names_in_scope; 184 /* The location of the goto, for error reporting. */ 185 location_t o_goto_locus; 186 /* True if an OpenMP structured block scope has been closed since 187 the goto appeared. This means that the branch from the label will 188 illegally exit an OpenMP scope. */ 189 bool in_omp_scope; 190}; 191 192/* A list of all LABEL_DECLs in the function that have names. Here so 193 we can clear out their names' definitions at the end of the 194 function, and so we can check the validity of jumps to these labels. */ 195 196struct named_label_entry GTY(()) 197{ 198 /* The decl itself. */ 199 tree label_decl; 200 201 /* The binding level to which the label is *currently* attached. 202 This is initially set to the binding level in which the label 203 is defined, but is modified as scopes are closed. */ 204 struct cp_binding_level *binding_level; 205 /* The head of the names list that was current when the label was 206 defined, or the inner scope popped. These are the decls that will 207 be skipped when jumping to the label. */ 208 tree names_in_scope; 209 /* A tree list of all decls from all binding levels that would be 210 crossed by a backward branch to the label. */ 211 tree bad_decls; 212 213 /* A list of uses of the label, before the label is defined. */ 214 struct named_label_use_entry *uses; 215 216 /* The following bits are set after the label is defined, and are 217 updated as scopes are popped. They indicate that a backward jump 218 to the label will illegally enter a scope of the given flavor. */ 219 bool in_try_scope; 220 bool in_catch_scope; 221 bool in_omp_scope; 222}; 223 224#define named_labels cp_function_chain->x_named_labels 225 226/* The number of function bodies which we are currently processing. 227 (Zero if we are at namespace scope, one inside the body of a 228 function, two inside the body of a function in a local class, etc.) */ 229int function_depth; 230 231/* States indicating how grokdeclarator() should handle declspecs marked 232 with __attribute__((deprecated)). An object declared as 233 __attribute__((deprecated)) suppresses warnings of uses of other 234 deprecated items. */ 235 236enum deprecated_states { 237 DEPRECATED_NORMAL, 238 DEPRECATED_SUPPRESS 239}; 240 241static enum deprecated_states deprecated_state = DEPRECATED_NORMAL; 242 243 244/* A TREE_LIST of VAR_DECLs. The TREE_PURPOSE is a RECORD_TYPE or 245 UNION_TYPE; the TREE_VALUE is a VAR_DECL with that type. At the 246 time the VAR_DECL was declared, the type was incomplete. */ 247 248static GTY(()) tree incomplete_vars; 249 250/* Returns the kind of template specialization we are currently 251 processing, given that it's declaration contained N_CLASS_SCOPES 252 explicit scope qualifications. */ 253 254tmpl_spec_kind 255current_tmpl_spec_kind (int n_class_scopes) 256{ 257 int n_template_parm_scopes = 0; 258 int seen_specialization_p = 0; 259 int innermost_specialization_p = 0; 260 struct cp_binding_level *b; 261 262 /* Scan through the template parameter scopes. */ 263 for (b = current_binding_level; 264 b->kind == sk_template_parms; 265 b = b->level_chain) 266 { 267 /* If we see a specialization scope inside a parameter scope, 268 then something is wrong. That corresponds to a declaration 269 like: 270 271 template <class T> template <> ... 272 273 which is always invalid since [temp.expl.spec] forbids the 274 specialization of a class member template if the enclosing 275 class templates are not explicitly specialized as well. */ 276 if (b->explicit_spec_p) 277 { 278 if (n_template_parm_scopes == 0) 279 innermost_specialization_p = 1; 280 else 281 seen_specialization_p = 1; 282 } 283 else if (seen_specialization_p == 1) 284 return tsk_invalid_member_spec; 285 286 ++n_template_parm_scopes; 287 } 288 289 /* Handle explicit instantiations. */ 290 if (processing_explicit_instantiation) 291 { 292 if (n_template_parm_scopes != 0) 293 /* We've seen a template parameter list during an explicit 294 instantiation. For example: 295 296 template <class T> template void f(int); 297 298 This is erroneous. */ 299 return tsk_invalid_expl_inst; 300 else 301 return tsk_expl_inst; 302 } 303 304 if (n_template_parm_scopes < n_class_scopes) 305 /* We've not seen enough template headers to match all the 306 specialized classes present. For example: 307 308 template <class T> void R<T>::S<T>::f(int); 309 310 This is invalid; there needs to be one set of template 311 parameters for each class. */ 312 return tsk_insufficient_parms; 313 else if (n_template_parm_scopes == n_class_scopes) 314 /* We're processing a non-template declaration (even though it may 315 be a member of a template class.) For example: 316 317 template <class T> void S<T>::f(int); 318 319 The `class T' maches the `S<T>', leaving no template headers 320 corresponding to the `f'. */ 321 return tsk_none; 322 else if (n_template_parm_scopes > n_class_scopes + 1) 323 /* We've got too many template headers. For example: 324 325 template <> template <class T> void f (T); 326 327 There need to be more enclosing classes. */ 328 return tsk_excessive_parms; 329 else 330 /* This must be a template. It's of the form: 331 332 template <class T> template <class U> void S<T>::f(U); 333 334 This is a specialization if the innermost level was a 335 specialization; otherwise it's just a definition of the 336 template. */ 337 return innermost_specialization_p ? tsk_expl_spec : tsk_template; 338} 339 340/* Exit the current scope. */ 341 342void 343finish_scope (void) 344{ 345 poplevel (0, 0, 0); 346} 347 348/* When a label goes out of scope, check to see if that label was used 349 in a valid manner, and issue any appropriate warnings or errors. */ 350 351static void 352pop_label (tree label, tree old_value) 353{ 354 if (!processing_template_decl) 355 { 356 if (DECL_INITIAL (label) == NULL_TREE) 357 { 358 location_t location; 359 360 error ("label %q+D used but not defined", label); 361#ifdef USE_MAPPED_LOCATION 362 location = input_location; /* FIXME want (input_filename, (line)0) */ 363#else 364 location.file = input_filename; 365 location.line = 0; 366#endif 367 /* Avoid crashing later. */ 368 define_label (location, DECL_NAME (label)); 369 } 370 else if (!TREE_USED (label)) 371 warning (OPT_Wunused_label, "label %q+D defined but not used", label); 372 } 373 374 SET_IDENTIFIER_LABEL_VALUE (DECL_NAME (label), old_value); 375} 376 377/* At the end of a function, all labels declared within the function 378 go out of scope. BLOCK is the top-level block for the 379 function. */ 380 381static int 382pop_labels_1 (void **slot, void *data) 383{ 384 struct named_label_entry *ent = (struct named_label_entry *) *slot; 385 tree block = (tree) data; 386 387 pop_label (ent->label_decl, NULL_TREE); 388 389 /* Put the labels into the "variables" of the top-level block, 390 so debugger can see them. */ 391 TREE_CHAIN (ent->label_decl) = BLOCK_VARS (block); 392 BLOCK_VARS (block) = ent->label_decl; 393 394 htab_clear_slot (named_labels, slot); 395 396 return 1; 397} 398 399static void 400pop_labels (tree block) 401{ 402 if (named_labels) 403 { 404 htab_traverse (named_labels, pop_labels_1, block); 405 named_labels = NULL; 406 } 407} 408 409/* At the end of a block with local labels, restore the outer definition. */ 410 411static void 412pop_local_label (tree label, tree old_value) 413{ 414 struct named_label_entry dummy; 415 void **slot; 416 417 pop_label (label, old_value); 418 419 dummy.label_decl = label; 420 slot = htab_find_slot (named_labels, &dummy, NO_INSERT); 421 htab_clear_slot (named_labels, slot); 422} 423 424/* The following two routines are used to interface to Objective-C++. 425 The binding level is purposely treated as an opaque type. */ 426 427void * 428objc_get_current_scope (void) 429{ 430 return current_binding_level; 431} 432 433/* The following routine is used by the NeXT-style SJLJ exceptions; 434 variables get marked 'volatile' so as to not be clobbered by 435 _setjmp()/_longjmp() calls. All variables in the current scope, 436 as well as parent scopes up to (but not including) ENCLOSING_BLK 437 shall be thusly marked. */ 438 439void 440objc_mark_locals_volatile (void *enclosing_blk) 441{ 442 struct cp_binding_level *scope; 443 444 for (scope = current_binding_level; 445 scope && scope != enclosing_blk; 446 scope = scope->level_chain) 447 { 448 tree decl; 449 450 for (decl = scope->names; decl; decl = TREE_CHAIN (decl)) 451 objc_volatilize_decl (decl); 452 453 /* Do not climb up past the current function. */ 454 if (scope->kind == sk_function_parms) 455 break; 456 } 457} 458 459/* Update data for defined and undefined labels when leaving a scope. */ 460 461static int 462poplevel_named_label_1 (void **slot, void *data) 463{ 464 struct named_label_entry *ent = (struct named_label_entry *) *slot; 465 struct cp_binding_level *bl = (struct cp_binding_level *) data; 466 struct cp_binding_level *obl = bl->level_chain; 467 468 if (ent->binding_level == bl) 469 { 470 tree decl; 471 472 for (decl = ent->names_in_scope; decl; decl = TREE_CHAIN (decl)) 473 if (decl_jump_unsafe (decl)) 474 ent->bad_decls = tree_cons (NULL, decl, ent->bad_decls); 475 476 ent->binding_level = obl; 477 ent->names_in_scope = obl->names; 478 switch (bl->kind) 479 { 480 case sk_try: 481 ent->in_try_scope = true; 482 break; 483 case sk_catch: 484 ent->in_catch_scope = true; 485 break; 486 case sk_omp: 487 ent->in_omp_scope = true; 488 break; 489 default: 490 break; 491 } 492 } 493 else if (ent->uses) 494 { 495 struct named_label_use_entry *use; 496 497 for (use = ent->uses; use ; use = use->next) 498 if (use->binding_level == bl) 499 { 500 use->binding_level = obl; 501 use->names_in_scope = obl->names; 502 if (bl->kind == sk_omp) 503 use->in_omp_scope = true; 504 } 505 } 506 507 return 1; 508} 509 510/* Exit a binding level. 511 Pop the level off, and restore the state of the identifier-decl mappings 512 that were in effect when this level was entered. 513 514 If KEEP == 1, this level had explicit declarations, so 515 and create a "block" (a BLOCK node) for the level 516 to record its declarations and subblocks for symbol table output. 517 518 If FUNCTIONBODY is nonzero, this level is the body of a function, 519 so create a block as if KEEP were set and also clear out all 520 label names. 521 522 If REVERSE is nonzero, reverse the order of decls before putting 523 them into the BLOCK. */ 524 525tree 526poplevel (int keep, int reverse, int functionbody) 527{ 528 tree link; 529 /* The chain of decls was accumulated in reverse order. 530 Put it into forward order, just for cleanliness. */ 531 tree decls; 532 int tmp = functionbody; 533 int real_functionbody; 534 tree subblocks; 535 tree block; 536 tree decl; 537 int leaving_for_scope; 538 scope_kind kind; 539 540 timevar_push (TV_NAME_LOOKUP); 541 restart: 542 543 block = NULL_TREE; 544 545 gcc_assert (current_binding_level->kind != sk_class); 546 547 real_functionbody = (current_binding_level->kind == sk_cleanup 548 ? ((functionbody = 0), tmp) : functionbody); 549 subblocks = functionbody >= 0 ? current_binding_level->blocks : 0; 550 551 gcc_assert (!VEC_length(cp_class_binding, 552 current_binding_level->class_shadowed)); 553 554 /* We used to use KEEP == 2 to indicate that the new block should go 555 at the beginning of the list of blocks at this binding level, 556 rather than the end. This hack is no longer used. */ 557 gcc_assert (keep == 0 || keep == 1); 558 559 if (current_binding_level->keep) 560 keep = 1; 561 562 /* Any uses of undefined labels, and any defined labels, now operate 563 under constraints of next binding contour. */ 564 if (cfun && !functionbody && named_labels) 565 htab_traverse (named_labels, poplevel_named_label_1, 566 current_binding_level); 567 568 /* Get the decls in the order they were written. 569 Usually current_binding_level->names is in reverse order. 570 But parameter decls were previously put in forward order. */ 571 572 if (reverse) 573 current_binding_level->names 574 = decls = nreverse (current_binding_level->names); 575 else 576 decls = current_binding_level->names; 577 578 /* If there were any declarations or structure tags in that level, 579 or if this level is a function body, 580 create a BLOCK to record them for the life of this function. */ 581 block = NULL_TREE; 582 if (keep == 1 || functionbody) 583 block = make_node (BLOCK); 584 if (block != NULL_TREE) 585 { 586 BLOCK_VARS (block) = decls; 587 BLOCK_SUBBLOCKS (block) = subblocks; 588 } 589 590 /* In each subblock, record that this is its superior. */ 591 if (keep >= 0) 592 for (link = subblocks; link; link = TREE_CHAIN (link)) 593 BLOCK_SUPERCONTEXT (link) = block; 594 595 /* We still support the old for-scope rules, whereby the variables 596 in a for-init statement were in scope after the for-statement 597 ended. We only use the new rules if flag_new_for_scope is 598 nonzero. */ 599 leaving_for_scope 600 = current_binding_level->kind == sk_for && flag_new_for_scope == 1; 601 602 /* Before we remove the declarations first check for unused variables. */ 603 if (warn_unused_variable 604 && !processing_template_decl) 605 for (decl = getdecls (); decl; decl = TREE_CHAIN (decl)) 606 if (TREE_CODE (decl) == VAR_DECL 607 && ! TREE_USED (decl) 608 && ! DECL_IN_SYSTEM_HEADER (decl) 609 && DECL_NAME (decl) && ! DECL_ARTIFICIAL (decl)) 610 warning (OPT_Wunused_variable, "unused variable %q+D", decl); 611 612 /* Remove declarations for all the DECLs in this level. */ 613 for (link = decls; link; link = TREE_CHAIN (link)) 614 { 615 if (leaving_for_scope && TREE_CODE (link) == VAR_DECL 616 && DECL_NAME (link)) 617 { 618 tree name = DECL_NAME (link); 619 cxx_binding *ob; 620 tree ns_binding; 621 622 ob = outer_binding (name, 623 IDENTIFIER_BINDING (name), 624 /*class_p=*/true); 625 if (!ob) 626 ns_binding = IDENTIFIER_NAMESPACE_VALUE (name); 627 else 628 ns_binding = NULL_TREE; 629 630 if (ob && ob->scope == current_binding_level->level_chain) 631 /* We have something like: 632 633 int i; 634 for (int i; ;); 635 636 and we are leaving the `for' scope. There's no reason to 637 keep the binding of the inner `i' in this case. */ 638 pop_binding (name, link); 639 else if ((ob && (TREE_CODE (ob->value) == TYPE_DECL)) 640 || (ns_binding && TREE_CODE (ns_binding) == TYPE_DECL)) 641 /* Here, we have something like: 642 643 typedef int I; 644 645 void f () { 646 for (int I; ;); 647 } 648 649 We must pop the for-scope binding so we know what's a 650 type and what isn't. */ 651 pop_binding (name, link); 652 else 653 { 654 /* Mark this VAR_DECL as dead so that we can tell we left it 655 there only for backward compatibility. */ 656 DECL_DEAD_FOR_LOCAL (link) = 1; 657 658 /* Keep track of what should have happened when we 659 popped the binding. */ 660 if (ob && ob->value) 661 { 662 SET_DECL_SHADOWED_FOR_VAR (link, ob->value); 663 DECL_HAS_SHADOWED_FOR_VAR_P (link) = 1; 664 } 665 666 /* Add it to the list of dead variables in the next 667 outermost binding to that we can remove these when we 668 leave that binding. */ 669 current_binding_level->level_chain->dead_vars_from_for 670 = tree_cons (NULL_TREE, link, 671 current_binding_level->level_chain-> 672 dead_vars_from_for); 673 674 /* Although we don't pop the cxx_binding, we do clear 675 its SCOPE since the scope is going away now. */ 676 IDENTIFIER_BINDING (name)->scope 677 = current_binding_level->level_chain; 678 } 679 } 680 else 681 { 682 tree name; 683 684 /* Remove the binding. */ 685 decl = link; 686 687 if (TREE_CODE (decl) == TREE_LIST) 688 decl = TREE_VALUE (decl); 689 name = decl; 690 691 if (TREE_CODE (name) == OVERLOAD) 692 name = OVL_FUNCTION (name); 693 694 gcc_assert (DECL_P (name)); 695 pop_binding (DECL_NAME (name), decl); 696 } 697 } 698 699 /* Remove declarations for any `for' variables from inner scopes 700 that we kept around. */ 701 for (link = current_binding_level->dead_vars_from_for; 702 link; link = TREE_CHAIN (link)) 703 pop_binding (DECL_NAME (TREE_VALUE (link)), TREE_VALUE (link)); 704 705 /* Restore the IDENTIFIER_TYPE_VALUEs. */ 706 for (link = current_binding_level->type_shadowed; 707 link; link = TREE_CHAIN (link)) 708 SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (link), TREE_VALUE (link)); 709 710 /* Restore the IDENTIFIER_LABEL_VALUEs for local labels. */ 711 for (link = current_binding_level->shadowed_labels; 712 link; 713 link = TREE_CHAIN (link)) 714 pop_local_label (TREE_VALUE (link), TREE_PURPOSE (link)); 715 716 /* There may be OVERLOADs (wrapped in TREE_LISTs) on the BLOCK_VARs 717 list if a `using' declaration put them there. The debugging 718 back-ends won't understand OVERLOAD, so we remove them here. 719 Because the BLOCK_VARS are (temporarily) shared with 720 CURRENT_BINDING_LEVEL->NAMES we must do this fixup after we have 721 popped all the bindings. */ 722 if (block) 723 { 724 tree* d; 725 726 for (d = &BLOCK_VARS (block); *d; ) 727 { 728 if (TREE_CODE (*d) == TREE_LIST) 729 *d = TREE_CHAIN (*d); 730 else 731 d = &TREE_CHAIN (*d); 732 } 733 } 734 735 /* If the level being exited is the top level of a function, 736 check over all the labels. */ 737 if (functionbody) 738 { 739 /* Since this is the top level block of a function, the vars are 740 the function's parameters. Don't leave them in the BLOCK 741 because they are found in the FUNCTION_DECL instead. */ 742 BLOCK_VARS (block) = 0; 743 pop_labels (block); 744 } 745 746 kind = current_binding_level->kind; 747 if (kind == sk_cleanup) 748 { 749 tree stmt; 750 751 /* If this is a temporary binding created for a cleanup, then we'll 752 have pushed a statement list level. Pop that, create a new 753 BIND_EXPR for the block, and insert it into the stream. */ 754 stmt = pop_stmt_list (current_binding_level->statement_list); 755 stmt = c_build_bind_expr (block, stmt); 756 add_stmt (stmt); 757 } 758 759 leave_scope (); 760 if (functionbody) 761 DECL_INITIAL (current_function_decl) = block; 762 else if (block) 763 current_binding_level->blocks 764 = chainon (current_binding_level->blocks, block); 765 766 /* If we did not make a block for the level just exited, 767 any blocks made for inner levels 768 (since they cannot be recorded as subblocks in that level) 769 must be carried forward so they will later become subblocks 770 of something else. */ 771 else if (subblocks) 772 current_binding_level->blocks 773 = chainon (current_binding_level->blocks, subblocks); 774 775 /* Each and every BLOCK node created here in `poplevel' is important 776 (e.g. for proper debugging information) so if we created one 777 earlier, mark it as "used". */ 778 if (block) 779 TREE_USED (block) = 1; 780 781 /* All temporary bindings created for cleanups are popped silently. */ 782 if (kind == sk_cleanup) 783 goto restart; 784 785 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, block); 786} 787 788/* Insert BLOCK at the end of the list of subblocks of the 789 current binding level. This is used when a BIND_EXPR is expanded, 790 to handle the BLOCK node inside the BIND_EXPR. */ 791 792void 793insert_block (tree block) 794{ 795 TREE_USED (block) = 1; 796 current_binding_level->blocks 797 = chainon (current_binding_level->blocks, block); 798} 799 800/* Walk all the namespaces contained NAMESPACE, including NAMESPACE 801 itself, calling F for each. The DATA is passed to F as well. */ 802 803static int 804walk_namespaces_r (tree namespace, walk_namespaces_fn f, void* data) 805{ 806 int result = 0; 807 tree current = NAMESPACE_LEVEL (namespace)->namespaces; 808 809 result |= (*f) (namespace, data); 810 811 for (; current; current = TREE_CHAIN (current)) 812 result |= walk_namespaces_r (current, f, data); 813 814 return result; 815} 816 817/* Walk all the namespaces, calling F for each. The DATA is passed to 818 F as well. */ 819 820int 821walk_namespaces (walk_namespaces_fn f, void* data) 822{ 823 return walk_namespaces_r (global_namespace, f, data); 824} 825 826/* Call wrapup_globals_declarations for the globals in NAMESPACE. If 827 DATA is non-NULL, this is the last time we will call 828 wrapup_global_declarations for this NAMESPACE. */ 829 830int 831wrapup_globals_for_namespace (tree namespace, void* data) 832{ 833 struct cp_binding_level *level = NAMESPACE_LEVEL (namespace); 834 VEC(tree,gc) *statics = level->static_decls; 835 tree *vec = VEC_address (tree, statics); 836 int len = VEC_length (tree, statics); 837 int last_time = (data != 0); 838 839 if (last_time) 840 { 841 check_global_declarations (vec, len); 842 emit_debug_global_declarations (vec, len); 843 return 0; 844 } 845 846 /* Write out any globals that need to be output. */ 847 return wrapup_global_declarations (vec, len); 848} 849 850 851/* In C++, you don't have to write `struct S' to refer to `S'; you 852 can just use `S'. We accomplish this by creating a TYPE_DECL as 853 if the user had written `typedef struct S S'. Create and return 854 the TYPE_DECL for TYPE. */ 855 856tree 857create_implicit_typedef (tree name, tree type) 858{ 859 tree decl; 860 861 decl = build_decl (TYPE_DECL, name, type); 862 DECL_ARTIFICIAL (decl) = 1; 863 /* There are other implicit type declarations, like the one *within* 864 a class that allows you to write `S::S'. We must distinguish 865 amongst these. */ 866 SET_DECL_IMPLICIT_TYPEDEF_P (decl); 867 TYPE_NAME (type) = decl; 868 869 return decl; 870} 871 872/* Remember a local name for name-mangling purposes. */ 873 874static void 875push_local_name (tree decl) 876{ 877 size_t i, nelts; 878 tree t, name; 879 880 timevar_push (TV_NAME_LOOKUP); 881 882 name = DECL_NAME (decl); 883 884 nelts = VEC_length (tree, local_names); 885 for (i = 0; i < nelts; i++) 886 { 887 t = VEC_index (tree, local_names, i); 888 if (DECL_NAME (t) == name) 889 { 890 if (!DECL_LANG_SPECIFIC (decl)) 891 retrofit_lang_decl (decl); 892 DECL_LANG_SPECIFIC (decl)->decl_flags.u2sel = 1; 893 if (DECL_LANG_SPECIFIC (t)) 894 DECL_DISCRIMINATOR (decl) = DECL_DISCRIMINATOR (t) + 1; 895 else 896 DECL_DISCRIMINATOR (decl) = 1; 897 898 VEC_replace (tree, local_names, i, decl); 899 timevar_pop (TV_NAME_LOOKUP); 900 return; 901 } 902 } 903 904 VEC_safe_push (tree, gc, local_names, decl); 905 timevar_pop (TV_NAME_LOOKUP); 906} 907 908/* Subroutine of duplicate_decls: return truthvalue of whether 909 or not types of these decls match. 910 911 For C++, we must compare the parameter list so that `int' can match 912 `int&' in a parameter position, but `int&' is not confused with 913 `const int&'. */ 914 915int 916decls_match (tree newdecl, tree olddecl) 917{ 918 int types_match; 919 920 if (newdecl == olddecl) 921 return 1; 922 923 if (TREE_CODE (newdecl) != TREE_CODE (olddecl)) 924 /* If the two DECLs are not even the same kind of thing, we're not 925 interested in their types. */ 926 return 0; 927 928 if (TREE_CODE (newdecl) == FUNCTION_DECL) 929 { 930 tree f1 = TREE_TYPE (newdecl); 931 tree f2 = TREE_TYPE (olddecl); 932 tree p1 = TYPE_ARG_TYPES (f1); 933 tree p2 = TYPE_ARG_TYPES (f2); 934 935 if (CP_DECL_CONTEXT (newdecl) != CP_DECL_CONTEXT (olddecl) 936 && ! (DECL_EXTERN_C_P (newdecl) 937 && DECL_EXTERN_C_P (olddecl))) 938 return 0; 939 940 if (TREE_CODE (f1) != TREE_CODE (f2)) 941 return 0; 942 943 if (same_type_p (TREE_TYPE (f1), TREE_TYPE (f2))) 944 { 945 if (p2 == NULL_TREE && DECL_EXTERN_C_P (olddecl) 946 && (DECL_BUILT_IN (olddecl) 947#ifndef NO_IMPLICIT_EXTERN_C 948 || (DECL_IN_SYSTEM_HEADER (newdecl) && !DECL_CLASS_SCOPE_P (newdecl)) 949 || (DECL_IN_SYSTEM_HEADER (olddecl) && !DECL_CLASS_SCOPE_P (olddecl)) 950#endif 951 )) 952 { 953 types_match = self_promoting_args_p (p1); 954 if (p1 == void_list_node) 955 TREE_TYPE (newdecl) = TREE_TYPE (olddecl); 956 } 957#ifndef NO_IMPLICIT_EXTERN_C 958 else if (p1 == NULL_TREE 959 && (DECL_EXTERN_C_P (olddecl) 960 && DECL_IN_SYSTEM_HEADER (olddecl) 961 && !DECL_CLASS_SCOPE_P (olddecl)) 962 && (DECL_EXTERN_C_P (newdecl) 963 && DECL_IN_SYSTEM_HEADER (newdecl) 964 && !DECL_CLASS_SCOPE_P (newdecl))) 965 { 966 types_match = self_promoting_args_p (p2); 967 TREE_TYPE (newdecl) = TREE_TYPE (olddecl); 968 } 969#endif 970 else 971 types_match = compparms (p1, p2); 972 } 973 else 974 types_match = 0; 975 } 976 else if (TREE_CODE (newdecl) == TEMPLATE_DECL) 977 { 978 if (TREE_CODE (DECL_TEMPLATE_RESULT (newdecl)) 979 != TREE_CODE (DECL_TEMPLATE_RESULT (olddecl))) 980 return 0; 981 982 if (!comp_template_parms (DECL_TEMPLATE_PARMS (newdecl), 983 DECL_TEMPLATE_PARMS (olddecl))) 984 return 0; 985 986 if (TREE_CODE (DECL_TEMPLATE_RESULT (newdecl)) == TYPE_DECL) 987 types_match = same_type_p (TREE_TYPE (DECL_TEMPLATE_RESULT (olddecl)), 988 TREE_TYPE (DECL_TEMPLATE_RESULT (newdecl))); 989 else 990 types_match = decls_match (DECL_TEMPLATE_RESULT (olddecl), 991 DECL_TEMPLATE_RESULT (newdecl)); 992 } 993 else 994 { 995 /* Need to check scope for variable declaration (VAR_DECL). 996 For typedef (TYPE_DECL), scope is ignored. */ 997 if (TREE_CODE (newdecl) == VAR_DECL 998 && CP_DECL_CONTEXT (newdecl) != CP_DECL_CONTEXT (olddecl) 999 /* [dcl.link] 1000 Two declarations for an object with C language linkage 1001 with the same name (ignoring the namespace that qualify 1002 it) that appear in different namespace scopes refer to 1003 the same object. */ 1004 && !(DECL_EXTERN_C_P (olddecl) && DECL_EXTERN_C_P (newdecl))) 1005 return 0; 1006 1007 if (TREE_TYPE (newdecl) == error_mark_node) 1008 types_match = TREE_TYPE (olddecl) == error_mark_node; 1009 else if (TREE_TYPE (olddecl) == NULL_TREE) 1010 types_match = TREE_TYPE (newdecl) == NULL_TREE; 1011 else if (TREE_TYPE (newdecl) == NULL_TREE) 1012 types_match = 0; 1013 else 1014 types_match = comptypes (TREE_TYPE (newdecl), 1015 TREE_TYPE (olddecl), 1016 COMPARE_REDECLARATION); 1017 } 1018 1019 return types_match; 1020} 1021 1022/* If NEWDECL is `static' and an `extern' was seen previously, 1023 warn about it. OLDDECL is the previous declaration. 1024 1025 Note that this does not apply to the C++ case of declaring 1026 a variable `extern const' and then later `const'. 1027 1028 Don't complain about built-in functions, since they are beyond 1029 the user's control. */ 1030 1031void 1032warn_extern_redeclared_static (tree newdecl, tree olddecl) 1033{ 1034 tree name; 1035 1036 if (TREE_CODE (newdecl) == TYPE_DECL 1037 || TREE_CODE (newdecl) == TEMPLATE_DECL 1038 || TREE_CODE (newdecl) == CONST_DECL 1039 || TREE_CODE (newdecl) == NAMESPACE_DECL) 1040 return; 1041 1042 /* Don't get confused by static member functions; that's a different 1043 use of `static'. */ 1044 if (TREE_CODE (newdecl) == FUNCTION_DECL 1045 && DECL_STATIC_FUNCTION_P (newdecl)) 1046 return; 1047 1048 /* If the old declaration was `static', or the new one isn't, then 1049 then everything is OK. */ 1050 if (DECL_THIS_STATIC (olddecl) || !DECL_THIS_STATIC (newdecl)) 1051 return; 1052 1053 /* It's OK to declare a builtin function as `static'. */ 1054 if (TREE_CODE (olddecl) == FUNCTION_DECL 1055 && DECL_ARTIFICIAL (olddecl)) 1056 return; 1057 1058 name = DECL_ASSEMBLER_NAME (newdecl); 1059 pedwarn ("%qD was declared %<extern%> and later %<static%>", newdecl); 1060 pedwarn ("previous declaration of %q+D", olddecl); 1061} 1062 1063/* NEW_DECL is a redeclaration of OLD_DECL; both are functions or 1064 function templates. If their exception specifications do not 1065 match, issue an a diagnostic. */ 1066 1067static void 1068check_redeclaration_exception_specification (tree new_decl, 1069 tree old_decl) 1070{ 1071 tree new_type; 1072 tree old_type; 1073 tree new_exceptions; 1074 tree old_exceptions; 1075 1076 new_type = TREE_TYPE (new_decl); 1077 new_exceptions = TYPE_RAISES_EXCEPTIONS (new_type); 1078 old_type = TREE_TYPE (old_decl); 1079 old_exceptions = TYPE_RAISES_EXCEPTIONS (old_type); 1080 1081 /* [except.spec] 1082 1083 If any declaration of a function has an exception-specification, 1084 all declarations, including the definition and an explicit 1085 specialization, of that function shall have an 1086 exception-specification with the same set of type-ids. */ 1087 if ((pedantic || ! DECL_IN_SYSTEM_HEADER (old_decl)) 1088 && ! DECL_IS_BUILTIN (old_decl) 1089 && flag_exceptions 1090 && !comp_except_specs (new_exceptions, old_exceptions, 1091 /*exact=*/true)) 1092 { 1093 error ("declaration of %qF throws different exceptions", new_decl); 1094 error ("from previous declaration %q+F", old_decl); 1095 } 1096} 1097 1098/* If NEWDECL is a redeclaration of OLDDECL, merge the declarations. 1099 If the redeclaration is invalid, a diagnostic is issued, and the 1100 error_mark_node is returned. Otherwise, OLDDECL is returned. 1101 1102 If NEWDECL is not a redeclaration of OLDDECL, NULL_TREE is 1103 returned. 1104 1105 NEWDECL_IS_FRIEND is true if NEWDECL was declared as a friend. */ 1106 1107tree 1108duplicate_decls (tree newdecl, tree olddecl, bool newdecl_is_friend) 1109{ 1110 unsigned olddecl_uid = DECL_UID (olddecl); 1111 int olddecl_friend = 0, types_match = 0, hidden_friend = 0; 1112 int new_defines_function = 0; 1113 tree new_template; 1114 1115 if (newdecl == olddecl) 1116 return olddecl; 1117 1118 types_match = decls_match (newdecl, olddecl); 1119 1120 /* If either the type of the new decl or the type of the old decl is an 1121 error_mark_node, then that implies that we have already issued an 1122 error (earlier) for some bogus type specification, and in that case, 1123 it is rather pointless to harass the user with yet more error message 1124 about the same declaration, so just pretend the types match here. */ 1125 if (TREE_TYPE (newdecl) == error_mark_node 1126 || TREE_TYPE (olddecl) == error_mark_node) 1127 return error_mark_node; 1128 1129 if (DECL_P (olddecl) 1130 && TREE_CODE (newdecl) == FUNCTION_DECL 1131 && TREE_CODE (olddecl) == FUNCTION_DECL 1132 && (DECL_UNINLINABLE (newdecl) || DECL_UNINLINABLE (olddecl))) 1133 { 1134 if (DECL_DECLARED_INLINE_P (newdecl) 1135 && DECL_UNINLINABLE (newdecl) 1136 && lookup_attribute ("noinline", DECL_ATTRIBUTES (newdecl))) 1137 /* Already warned elsewhere. */; 1138 else if (DECL_DECLARED_INLINE_P (olddecl) 1139 && DECL_UNINLINABLE (olddecl) 1140 && lookup_attribute ("noinline", DECL_ATTRIBUTES (olddecl))) 1141 /* Already warned. */; 1142 else if (DECL_DECLARED_INLINE_P (newdecl) 1143 && DECL_UNINLINABLE (olddecl) 1144 && lookup_attribute ("noinline", DECL_ATTRIBUTES (olddecl))) 1145 { 1146 warning (OPT_Wattributes, "function %q+D redeclared as inline", 1147 newdecl); 1148 warning (OPT_Wattributes, "previous declaration of %q+D " 1149 "with attribute noinline", olddecl); 1150 } 1151 else if (DECL_DECLARED_INLINE_P (olddecl) 1152 && DECL_UNINLINABLE (newdecl) 1153 && lookup_attribute ("noinline", DECL_ATTRIBUTES (newdecl))) 1154 { 1155 warning (OPT_Wattributes, "function %q+D redeclared with " 1156 "attribute noinline", newdecl); 1157 warning (OPT_Wattributes, "previous declaration of %q+D was inline", 1158 olddecl); 1159 } 1160 } 1161 1162 /* Check for redeclaration and other discrepancies. */ 1163 if (TREE_CODE (olddecl) == FUNCTION_DECL 1164 && DECL_ARTIFICIAL (olddecl)) 1165 { 1166 gcc_assert (!DECL_HIDDEN_FRIEND_P (olddecl)); 1167 if (TREE_CODE (newdecl) != FUNCTION_DECL) 1168 { 1169 /* Avoid warnings redeclaring built-ins which have not been 1170 explicitly declared. */ 1171 if (DECL_ANTICIPATED (olddecl)) 1172 return NULL_TREE; 1173 1174 /* If you declare a built-in or predefined function name as static, 1175 the old definition is overridden, but optionally warn this was a 1176 bad choice of name. */ 1177 if (! TREE_PUBLIC (newdecl)) 1178 { 1179 warning (OPT_Wshadow, "shadowing %s function %q#D", 1180 DECL_BUILT_IN (olddecl) ? "built-in" : "library", 1181 olddecl); 1182 /* Discard the old built-in function. */ 1183 return NULL_TREE; 1184 } 1185 /* If the built-in is not ansi, then programs can override 1186 it even globally without an error. */ 1187 else if (! DECL_BUILT_IN (olddecl)) 1188 warning (0, "library function %q#D redeclared as non-function %q#D", 1189 olddecl, newdecl); 1190 else 1191 { 1192 error ("declaration of %q#D", newdecl); 1193 error ("conflicts with built-in declaration %q#D", 1194 olddecl); 1195 } 1196 return NULL_TREE; 1197 } 1198 else if (!types_match) 1199 { 1200 /* Avoid warnings redeclaring built-ins which have not been 1201 explicitly declared. */ 1202 if (DECL_ANTICIPATED (olddecl)) 1203 { 1204 /* Deal with fileptr_type_node. FILE type is not known 1205 at the time we create the builtins. */ 1206 tree t1, t2; 1207 1208 for (t1 = TYPE_ARG_TYPES (TREE_TYPE (newdecl)), 1209 t2 = TYPE_ARG_TYPES (TREE_TYPE (olddecl)); 1210 t1 || t2; 1211 t1 = TREE_CHAIN (t1), t2 = TREE_CHAIN (t2)) 1212 if (!t1 || !t2) 1213 break; 1214 else if (TREE_VALUE (t2) == fileptr_type_node) 1215 { 1216 tree t = TREE_VALUE (t1); 1217 1218 if (TREE_CODE (t) == POINTER_TYPE 1219 && TYPE_NAME (TREE_TYPE (t)) 1220 && DECL_NAME (TYPE_NAME (TREE_TYPE (t))) 1221 == get_identifier ("FILE") 1222 && compparms (TREE_CHAIN (t1), TREE_CHAIN (t2))) 1223 { 1224 tree oldargs = TYPE_ARG_TYPES (TREE_TYPE (olddecl)); 1225 1226 TYPE_ARG_TYPES (TREE_TYPE (olddecl)) 1227 = TYPE_ARG_TYPES (TREE_TYPE (newdecl)); 1228 types_match = decls_match (newdecl, olddecl); 1229 if (types_match) 1230 return duplicate_decls (newdecl, olddecl, 1231 newdecl_is_friend); 1232 TYPE_ARG_TYPES (TREE_TYPE (olddecl)) = oldargs; 1233 } 1234 } 1235 else if (! same_type_p (TREE_VALUE (t1), TREE_VALUE (t2))) 1236 break; 1237 } 1238 else if ((DECL_EXTERN_C_P (newdecl) 1239 && DECL_EXTERN_C_P (olddecl)) 1240 || compparms (TYPE_ARG_TYPES (TREE_TYPE (newdecl)), 1241 TYPE_ARG_TYPES (TREE_TYPE (olddecl)))) 1242 { 1243 /* A near match; override the builtin. */ 1244 1245 if (TREE_PUBLIC (newdecl)) 1246 { 1247 warning (0, "new declaration %q#D", newdecl); 1248 warning (0, "ambiguates built-in declaration %q#D", 1249 olddecl); 1250 } 1251 else 1252 warning (OPT_Wshadow, "shadowing %s function %q#D", 1253 DECL_BUILT_IN (olddecl) ? "built-in" : "library", 1254 olddecl); 1255 } 1256 else 1257 /* Discard the old built-in function. */ 1258 return NULL_TREE; 1259 1260 /* Replace the old RTL to avoid problems with inlining. */ 1261 COPY_DECL_RTL (newdecl, olddecl); 1262 } 1263 /* Even if the types match, prefer the new declarations type for 1264 built-ins which have not been explicitly declared, for 1265 exception lists, etc... */ 1266 else if (DECL_ANTICIPATED (olddecl)) 1267 { 1268 tree type = TREE_TYPE (newdecl); 1269 tree attribs = (*targetm.merge_type_attributes) 1270 (TREE_TYPE (olddecl), type); 1271 1272 type = cp_build_type_attribute_variant (type, attribs); 1273 TREE_TYPE (newdecl) = TREE_TYPE (olddecl) = type; 1274 } 1275 1276 /* Whether or not the builtin can throw exceptions has no 1277 bearing on this declarator. */ 1278 TREE_NOTHROW (olddecl) = 0; 1279 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; 1286 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. */ 1290 SET_DECL_LANGUAGE (olddecl, DECL_LANGUAGE (newdecl)); 1291 COPY_DECL_RTL (newdecl, olddecl); 1292 } 1293 } 1294 else if (TREE_CODE (olddecl) != TREE_CODE (newdecl)) 1295 { 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. */ 1311 return NULL_TREE; 1312 } 1313 1314 if ((TREE_CODE (newdecl) == FUNCTION_DECL 1315 && DECL_FUNCTION_TEMPLATE_P (olddecl)) 1316 || (TREE_CODE (olddecl) == FUNCTION_DECL 1317 && DECL_FUNCTION_TEMPLATE_P (newdecl))) 1318 return NULL_TREE; 1319 1320 error ("%q#D redeclared as different kind of symbol", newdecl); 1321 if (TREE_CODE (olddecl) == TREE_LIST) 1322 olddecl = TREE_VALUE (olddecl); 1323 error ("previous declaration of %q+#D", olddecl); 1324 1325 return error_mark_node; 1326 } 1327 else if (!types_match) 1328 { 1329 if (CP_DECL_CONTEXT (newdecl) != CP_DECL_CONTEXT (olddecl)) 1330 /* These are certainly not duplicate declarations; they're 1331 from different scopes. */ 1332 return NULL_TREE; 1333 1334 if (TREE_CODE (newdecl) == TEMPLATE_DECL) 1335 { 1336 /* The name of a class template may not be declared to refer to 1337 any other template, class, function, object, namespace, value, 1338 or type in the same scope. */ 1339 if (TREE_CODE (DECL_TEMPLATE_RESULT (olddecl)) == TYPE_DECL 1340 || TREE_CODE (DECL_TEMPLATE_RESULT (newdecl)) == TYPE_DECL) 1341 { 1342 error ("declaration of template %q#D", newdecl); 1343 error ("conflicts with previous declaration %q+#D", olddecl); 1344 } 1345 else if (TREE_CODE (DECL_TEMPLATE_RESULT (olddecl)) == FUNCTION_DECL 1346 && TREE_CODE (DECL_TEMPLATE_RESULT (newdecl)) == FUNCTION_DECL 1347 && compparms (TYPE_ARG_TYPES (TREE_TYPE (DECL_TEMPLATE_RESULT (olddecl))), 1348 TYPE_ARG_TYPES (TREE_TYPE (DECL_TEMPLATE_RESULT (newdecl)))) 1349 && comp_template_parms (DECL_TEMPLATE_PARMS (newdecl), 1350 DECL_TEMPLATE_PARMS (olddecl)) 1351 /* Template functions can be disambiguated by 1352 return type. */ 1353 && same_type_p (TREE_TYPE (TREE_TYPE (newdecl)), 1354 TREE_TYPE (TREE_TYPE (olddecl)))) 1355 { 1356 error ("new declaration %q#D", newdecl); 1357 error ("ambiguates old declaration %q+#D", olddecl); 1358 } 1359 return NULL_TREE; 1360 } 1361 if (TREE_CODE (newdecl) == FUNCTION_DECL) 1362 { 1363 if (DECL_EXTERN_C_P (newdecl) && DECL_EXTERN_C_P (olddecl)) 1364 { 1365 error ("declaration of C function %q#D conflicts with", 1366 newdecl); 1367 error ("previous declaration %q+#D here", olddecl); 1368 } 1369 else if (compparms (TYPE_ARG_TYPES (TREE_TYPE (newdecl)), 1370 TYPE_ARG_TYPES (TREE_TYPE (olddecl)))) 1371 { 1372 error ("new declaration %q#D", newdecl); 1373 error ("ambiguates old declaration %q+#D", olddecl); 1374 return error_mark_node; 1375 } 1376 else 1377 return NULL_TREE; 1378 } 1379 else 1380 { 1381 error ("conflicting declaration %q#D", newdecl); 1382 error ("%q+D has a previous declaration as %q#D", olddecl, olddecl); 1383 return error_mark_node; 1384 } 1385 } 1386 else if (TREE_CODE (newdecl) == FUNCTION_DECL 1387 && ((DECL_TEMPLATE_SPECIALIZATION (olddecl) 1388 && (!DECL_TEMPLATE_INFO (newdecl) 1389 || (DECL_TI_TEMPLATE (newdecl) 1390 != DECL_TI_TEMPLATE (olddecl)))) 1391 || (DECL_TEMPLATE_SPECIALIZATION (newdecl) 1392 && (!DECL_TEMPLATE_INFO (olddecl) 1393 || (DECL_TI_TEMPLATE (olddecl) 1394 != DECL_TI_TEMPLATE (newdecl)))))) 1395 /* It's OK to have a template specialization and a non-template 1396 with the same type, or to have specializations of two 1397 different templates with the same type. Note that if one is a 1398 specialization, and the other is an instantiation of the same 1399 template, that we do not exit at this point. That situation 1400 can occur if we instantiate a template class, and then 1401 specialize one of its methods. This situation is valid, but 1402 the declarations must be merged in the usual way. */ 1403 return NULL_TREE; 1404 else if (TREE_CODE (newdecl) == FUNCTION_DECL 1405 && ((DECL_TEMPLATE_INSTANTIATION (olddecl) 1406 && !DECL_USE_TEMPLATE (newdecl)) 1407 || (DECL_TEMPLATE_INSTANTIATION (newdecl) 1408 && !DECL_USE_TEMPLATE (olddecl)))) 1409 /* One of the declarations is a template instantiation, and the 1410 other is not a template at all. That's OK. */ 1411 return NULL_TREE; 1412 else if (TREE_CODE (newdecl) == NAMESPACE_DECL) 1413 { 1414 /* In [namespace.alias] we have: 1415 1416 In a declarative region, a namespace-alias-definition can be 1417 used to redefine a namespace-alias declared in that declarative 1418 region to refer only to the namespace to which it already 1419 refers. 1420 1421 Therefore, if we encounter a second alias directive for the same 1422 alias, we can just ignore the second directive. */ 1423 if (DECL_NAMESPACE_ALIAS (newdecl) 1424 && (DECL_NAMESPACE_ALIAS (newdecl) 1425 == DECL_NAMESPACE_ALIAS (olddecl))) 1426 return olddecl; 1427 /* [namespace.alias] 1428 1429 A namespace-name or namespace-alias shall not be declared as 1430 the name of any other entity in the same declarative region. 1431 A namespace-name defined at global scope shall not be 1432 declared as the name of any other entity in any global scope 1433 of the program. */ 1434 error ("declaration of namespace %qD conflicts with", newdecl); 1435 error ("previous declaration of namespace %q+D here", olddecl); 1436 return error_mark_node; 1437 } 1438 else 1439 { 1440 const char *errmsg = redeclaration_error_message (newdecl, olddecl); 1441 if (errmsg) 1442 { 1443 error (errmsg, newdecl); 1444 if (DECL_NAME (olddecl) != NULL_TREE) 1445 error ((DECL_INITIAL (olddecl) && namespace_bindings_p ()) 1446 ? "%q+#D previously defined here" 1447 : "%q+#D previously declared here", olddecl); 1448 return error_mark_node; 1449 } 1450 else if (TREE_CODE (olddecl) == FUNCTION_DECL 1451 && DECL_INITIAL (olddecl) != NULL_TREE 1452 && TYPE_ARG_TYPES (TREE_TYPE (olddecl)) == NULL_TREE 1453 && TYPE_ARG_TYPES (TREE_TYPE (newdecl)) != NULL_TREE) 1454 { 1455 /* Prototype decl follows defn w/o prototype. */ 1456 warning (0, "prototype for %q+#D", newdecl); 1457 warning (0, "%Jfollows non-prototype definition here", olddecl); 1458 } 1459 else if ((TREE_CODE (olddecl) == FUNCTION_DECL 1460 || TREE_CODE (olddecl) == VAR_DECL) 1461 && DECL_LANGUAGE (newdecl) != DECL_LANGUAGE (olddecl)) 1462 { 1463 /* [dcl.link] 1464 If two declarations of the same function or object 1465 specify different linkage-specifications ..., the program 1466 is ill-formed.... Except for functions with C++ linkage, 1467 a function declaration without a linkage specification 1468 shall not precede the first linkage specification for 1469 that function. A function can be declared without a 1470 linkage specification after an explicit linkage 1471 specification has been seen; the linkage explicitly 1472 specified in the earlier declaration is not affected by 1473 such a function declaration. 1474 1475 DR 563 raises the question why the restrictions on 1476 functions should not also apply to objects. Older 1477 versions of G++ silently ignore the linkage-specification 1478 for this example: 1479 1480 namespace N { 1481 extern int i; 1482 extern "C" int i; 1483 } 1484 1485 which is clearly wrong. Therefore, we now treat objects 1486 like functions. */ 1487 if (current_lang_depth () == 0) 1488 { 1489 /* There is no explicit linkage-specification, so we use 1490 the linkage from the previous declaration. */ 1491 if (!DECL_LANG_SPECIFIC (newdecl)) 1492 retrofit_lang_decl (newdecl); 1493 SET_DECL_LANGUAGE (newdecl, DECL_LANGUAGE (olddecl)); 1494 } 1495 else 1496 { 1497 error ("previous declaration of %q+#D with %qL linkage", 1498 olddecl, DECL_LANGUAGE (olddecl)); 1499 error ("conflicts with new declaration with %qL linkage", 1500 DECL_LANGUAGE (newdecl)); 1501 } 1502 } 1503 1504 if (DECL_LANG_SPECIFIC (olddecl) && DECL_USE_TEMPLATE (olddecl)) 1505 ; 1506 else if (TREE_CODE (olddecl) == FUNCTION_DECL) 1507 { 1508 tree t1 = TYPE_ARG_TYPES (TREE_TYPE (olddecl)); 1509 tree t2 = TYPE_ARG_TYPES (TREE_TYPE (newdecl)); 1510 int i = 1; 1511 1512 if (TREE_CODE (TREE_TYPE (newdecl)) == METHOD_TYPE) 1513 t1 = TREE_CHAIN (t1), t2 = TREE_CHAIN (t2); 1514 1515 for (; t1 && t1 != void_list_node; 1516 t1 = TREE_CHAIN (t1), t2 = TREE_CHAIN (t2), i++) 1517 if (TREE_PURPOSE (t1) && TREE_PURPOSE (t2)) 1518 { 1519 if (1 == simple_cst_equal (TREE_PURPOSE (t1), 1520 TREE_PURPOSE (t2))) 1521 { 1522 pedwarn ("default argument given for parameter %d of %q#D", 1523 i, newdecl); 1524 pedwarn ("after previous specification in %q+#D", olddecl); 1525 } 1526 else 1527 { 1528 error ("default argument given for parameter %d of %q#D", 1529 i, newdecl); 1530 error ("after previous specification in %q+#D", 1531 olddecl); 1532 } 1533 } 1534 1535 if (DECL_DECLARED_INLINE_P (newdecl) 1536 && ! DECL_DECLARED_INLINE_P (olddecl) 1537 && TREE_ADDRESSABLE (olddecl) && warn_inline) 1538 { 1539 warning (0, "%q#D was used before it was declared inline", newdecl); 1540 warning (0, "%Jprevious non-inline declaration here", olddecl); 1541 } 1542 } 1543 } 1544 1545 /* Do not merge an implicit typedef with an explicit one. In: 1546 1547 class A; 1548 ... 1549 typedef class A A __attribute__ ((foo)); 1550 1551 the attribute should apply only to the typedef. */ 1552 if (TREE_CODE (olddecl) == TYPE_DECL 1553 && (DECL_IMPLICIT_TYPEDEF_P (olddecl) 1554 || DECL_IMPLICIT_TYPEDEF_P (newdecl))) 1555 return NULL_TREE; 1556 1557 /* If new decl is `static' and an `extern' was seen previously, 1558 warn about it. */ 1559 warn_extern_redeclared_static (newdecl, olddecl); 1560 1561 /* We have committed to returning 1 at this point. */ 1562 if (TREE_CODE (newdecl) == FUNCTION_DECL) 1563 { 1564 /* Now that functions must hold information normally held 1565 by field decls, there is extra work to do so that 1566 declaration information does not get destroyed during 1567 definition. */ 1568 if (DECL_VINDEX (olddecl)) 1569 DECL_VINDEX (newdecl) = DECL_VINDEX (olddecl); 1570 if (DECL_CONTEXT (olddecl)) 1571 DECL_CONTEXT (newdecl) = DECL_CONTEXT (olddecl); 1572 DECL_STATIC_CONSTRUCTOR (newdecl) |= DECL_STATIC_CONSTRUCTOR (olddecl); 1573 DECL_STATIC_DESTRUCTOR (newdecl) |= DECL_STATIC_DESTRUCTOR (olddecl); 1574 DECL_PURE_VIRTUAL_P (newdecl) |= DECL_PURE_VIRTUAL_P (olddecl); 1575 DECL_VIRTUAL_P (newdecl) |= DECL_VIRTUAL_P (olddecl); 1576 DECL_INVALID_OVERRIDER_P (newdecl) |= DECL_INVALID_OVERRIDER_P (olddecl); 1577 DECL_THIS_STATIC (newdecl) |= DECL_THIS_STATIC (olddecl); 1578 if (DECL_OVERLOADED_OPERATOR_P (olddecl) != ERROR_MARK) 1579 SET_OVERLOADED_OPERATOR_CODE 1580 (newdecl, DECL_OVERLOADED_OPERATOR_P (olddecl)); 1581 new_defines_function = DECL_INITIAL (newdecl) != NULL_TREE; 1582 1583 /* Optionally warn about more than one declaration for the same 1584 name, but don't warn about a function declaration followed by a 1585 definition. */ 1586 if (warn_redundant_decls && ! DECL_ARTIFICIAL (olddecl) 1587 && !(new_defines_function && DECL_INITIAL (olddecl) == NULL_TREE) 1588 /* Don't warn about extern decl followed by definition. */ 1589 && !(DECL_EXTERNAL (olddecl) && ! DECL_EXTERNAL (newdecl)) 1590 /* Don't warn about friends, let add_friend take care of it. */ 1591 && ! (newdecl_is_friend || DECL_FRIEND_P (olddecl))) 1592 { 1593 warning (OPT_Wredundant_decls, "redundant redeclaration of %qD in same scope", newdecl); 1594 warning (OPT_Wredundant_decls, "previous declaration of %q+D", olddecl); 1595 } 1596 } 1597 1598 /* Deal with C++: must preserve virtual function table size. */ 1599 if (TREE_CODE (olddecl) == TYPE_DECL) 1600 { 1601 tree newtype = TREE_TYPE (newdecl); 1602 tree oldtype = TREE_TYPE (olddecl); 1603 1604 if (newtype != error_mark_node && oldtype != error_mark_node 1605 && TYPE_LANG_SPECIFIC (newtype) && TYPE_LANG_SPECIFIC (oldtype)) 1606 CLASSTYPE_FRIEND_CLASSES (newtype) 1607 = CLASSTYPE_FRIEND_CLASSES (oldtype); 1608 1609 DECL_ORIGINAL_TYPE (newdecl) = DECL_ORIGINAL_TYPE (olddecl); 1610 } 1611 1612 /* Copy all the DECL_... slots specified in the new decl 1613 except for any that we copy here from the old type. */ 1614 DECL_ATTRIBUTES (newdecl) 1615 = (*targetm.merge_decl_attributes) (olddecl, newdecl); 1616 1617 if (TREE_CODE (newdecl) == TEMPLATE_DECL) 1618 { 1619 tree old_result; 1620 tree new_result; 1621 old_result = DECL_TEMPLATE_RESULT (olddecl); 1622 new_result = DECL_TEMPLATE_RESULT (newdecl); 1623 TREE_TYPE (olddecl) = TREE_TYPE (old_result); 1624 DECL_TEMPLATE_SPECIALIZATIONS (olddecl) 1625 = chainon (DECL_TEMPLATE_SPECIALIZATIONS (olddecl), 1626 DECL_TEMPLATE_SPECIALIZATIONS (newdecl)); 1627 1628 if (DECL_FUNCTION_TEMPLATE_P (newdecl)) 1629 { 1630 DECL_INLINE (old_result) 1631 |= DECL_INLINE (new_result); 1632 DECL_DECLARED_INLINE_P (old_result) 1633 |= DECL_DECLARED_INLINE_P (new_result); 1634 check_redeclaration_exception_specification (newdecl, olddecl); 1635 } 1636 1637 /* If the new declaration is a definition, update the file and 1638 line information on the declaration. */ 1639 if (DECL_INITIAL (old_result) == NULL_TREE 1640 && DECL_INITIAL (new_result) != NULL_TREE) 1641 { 1642 DECL_SOURCE_LOCATION (olddecl) 1643 = DECL_SOURCE_LOCATION (old_result) 1644 = DECL_SOURCE_LOCATION (newdecl); 1645 if (DECL_FUNCTION_TEMPLATE_P (newdecl)) 1646 DECL_ARGUMENTS (old_result) 1647 = DECL_ARGUMENTS (new_result); 1648 } 1649 1650 return olddecl; 1651 } 1652 1653 if (types_match) 1654 { 1655 /* Automatically handles default parameters. */ 1656 tree oldtype = TREE_TYPE (olddecl); 1657 tree newtype; 1658 1659 /* Merge the data types specified in the two decls. */ 1660 newtype = merge_types (TREE_TYPE (newdecl), TREE_TYPE (olddecl)); 1661 1662 /* If merge_types produces a non-typedef type, just use the old type. */ 1663 if (TREE_CODE (newdecl) == TYPE_DECL 1664 && newtype == DECL_ORIGINAL_TYPE (newdecl)) 1665 newtype = oldtype; 1666 1667 if (TREE_CODE (newdecl) == VAR_DECL) 1668 { 1669 DECL_THIS_EXTERN (newdecl) |= DECL_THIS_EXTERN (olddecl); 1670 DECL_INITIALIZED_P (newdecl) |= DECL_INITIALIZED_P (olddecl); 1671 DECL_NONTRIVIALLY_INITIALIZED_P (newdecl) 1672 |= DECL_NONTRIVIALLY_INITIALIZED_P (olddecl); 1673 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (newdecl) 1674 |= DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (olddecl); 1675 1676 /* Merge the threadprivate attribute from OLDDECL into NEWDECL. */ 1677 if (DECL_LANG_SPECIFIC (olddecl) 1678 && CP_DECL_THREADPRIVATE_P (olddecl)) 1679 { 1680 /* Allocate a LANG_SPECIFIC structure for NEWDECL, if needed. */ 1681 if (!DECL_LANG_SPECIFIC (newdecl)) 1682 retrofit_lang_decl (newdecl); 1683 1684 DECL_TLS_MODEL (newdecl) = DECL_TLS_MODEL (olddecl); 1685 CP_DECL_THREADPRIVATE_P (newdecl) = 1; 1686 } 1687 } 1688 1689 /* Do this after calling `merge_types' so that default 1690 parameters don't confuse us. */ 1691 else if (TREE_CODE (newdecl) == FUNCTION_DECL) 1692 check_redeclaration_exception_specification (newdecl, olddecl); 1693 TREE_TYPE (newdecl) = TREE_TYPE (olddecl) = newtype; 1694 1695 if (TREE_CODE (newdecl) == FUNCTION_DECL) 1696 check_default_args (newdecl); 1697 1698 /* Lay the type out, unless already done. */ 1699 if (! same_type_p (newtype, oldtype) 1700 && TREE_TYPE (newdecl) != error_mark_node 1701 && !(processing_template_decl && uses_template_parms (newdecl))) 1702 layout_type (TREE_TYPE (newdecl)); 1703 1704 if ((TREE_CODE (newdecl) == VAR_DECL 1705 || TREE_CODE (newdecl) == PARM_DECL 1706 || TREE_CODE (newdecl) == RESULT_DECL 1707 || TREE_CODE (newdecl) == FIELD_DECL 1708 || TREE_CODE (newdecl) == TYPE_DECL) 1709 && !(processing_template_decl && uses_template_parms (newdecl))) 1710 layout_decl (newdecl, 0); 1711 1712 /* Merge the type qualifiers. */ 1713 if (TREE_READONLY (newdecl)) 1714 TREE_READONLY (olddecl) = 1; 1715 if (TREE_THIS_VOLATILE (newdecl)) 1716 TREE_THIS_VOLATILE (olddecl) = 1; 1717 if (TREE_NOTHROW (newdecl)) 1718 TREE_NOTHROW (olddecl) = 1; 1719 1720 /* Merge deprecatedness. */ 1721 if (TREE_DEPRECATED (newdecl)) 1722 TREE_DEPRECATED (olddecl) = 1; 1723 1724 /* Merge the initialization information. */ 1725 if (DECL_INITIAL (newdecl) == NULL_TREE 1726 && DECL_INITIAL (olddecl) != NULL_TREE) 1727 { 1728 DECL_INITIAL (newdecl) = DECL_INITIAL (olddecl); 1729 DECL_SOURCE_LOCATION (newdecl) = DECL_SOURCE_LOCATION (olddecl); 1730 if (CAN_HAVE_FULL_LANG_DECL_P (newdecl) 1731 && DECL_LANG_SPECIFIC (newdecl) 1732 && DECL_LANG_SPECIFIC (olddecl)) 1733 { 1734 DECL_SAVED_TREE (newdecl) = DECL_SAVED_TREE (olddecl); 1735 DECL_STRUCT_FUNCTION (newdecl) = DECL_STRUCT_FUNCTION (olddecl); 1736 } 1737 } 1738 1739 /* Merge the section attribute. 1740 We want to issue an error if the sections conflict but that must be 1741 done later in decl_attributes since we are called before attributes 1742 are assigned. */ 1743 if (DECL_SECTION_NAME (newdecl) == NULL_TREE) 1744 DECL_SECTION_NAME (newdecl) = DECL_SECTION_NAME (olddecl); 1745 1746 if (TREE_CODE (newdecl) == FUNCTION_DECL) 1747 { 1748 DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (newdecl) 1749 |= DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (olddecl); 1750 DECL_NO_LIMIT_STACK (newdecl) |= DECL_NO_LIMIT_STACK (olddecl); 1751 TREE_THIS_VOLATILE (newdecl) |= TREE_THIS_VOLATILE (olddecl); 1752 TREE_READONLY (newdecl) |= TREE_READONLY (olddecl); 1753 TREE_NOTHROW (newdecl) |= TREE_NOTHROW (olddecl); 1754 DECL_IS_MALLOC (newdecl) |= DECL_IS_MALLOC (olddecl); 1755 DECL_IS_PURE (newdecl) |= DECL_IS_PURE (olddecl); 1756 /* Keep the old RTL. */ 1757 COPY_DECL_RTL (olddecl, newdecl); 1758 } 1759 else if (TREE_CODE (newdecl) == VAR_DECL 1760 && (DECL_SIZE (olddecl) || !DECL_SIZE (newdecl))) 1761 { 1762 /* Keep the old RTL. We cannot keep the old RTL if the old 1763 declaration was for an incomplete object and the new 1764 declaration is not since many attributes of the RTL will 1765 change. */ 1766 COPY_DECL_RTL (olddecl, newdecl); 1767 } 1768 } 1769 /* If cannot merge, then use the new type and qualifiers, 1770 and don't preserve the old rtl. */ 1771 else 1772 { 1773 /* Clean out any memory we had of the old declaration. */ 1774 tree oldstatic = value_member (olddecl, static_aggregates); 1775 if (oldstatic) 1776 TREE_VALUE (oldstatic) = error_mark_node; 1777 1778 TREE_TYPE (olddecl) = TREE_TYPE (newdecl); 1779 TREE_READONLY (olddecl) = TREE_READONLY (newdecl); 1780 TREE_THIS_VOLATILE (olddecl) = TREE_THIS_VOLATILE (newdecl); 1781 TREE_SIDE_EFFECTS (olddecl) = TREE_SIDE_EFFECTS (newdecl); 1782 } 1783 1784 /* Merge the storage class information. */ 1785 merge_weak (newdecl, olddecl); 1786 1787 DECL_ONE_ONLY (newdecl) |= DECL_ONE_ONLY (olddecl); 1788 DECL_DEFER_OUTPUT (newdecl) |= DECL_DEFER_OUTPUT (olddecl); 1789 TREE_PUBLIC (newdecl) = TREE_PUBLIC (olddecl); 1790 TREE_STATIC (olddecl) = TREE_STATIC (newdecl) |= TREE_STATIC (olddecl); 1791 if (! DECL_EXTERNAL (olddecl)) 1792 DECL_EXTERNAL (newdecl) = 0; 1793 1794 new_template = NULL_TREE; 1795 if (DECL_LANG_SPECIFIC (newdecl) && DECL_LANG_SPECIFIC (olddecl)) 1796 { 1797 DECL_INTERFACE_KNOWN (newdecl) |= DECL_INTERFACE_KNOWN (olddecl); 1798 DECL_NOT_REALLY_EXTERN (newdecl) |= DECL_NOT_REALLY_EXTERN (olddecl); 1799 DECL_COMDAT (newdecl) |= DECL_COMDAT (olddecl); 1800 DECL_TEMPLATE_INSTANTIATED (newdecl) 1801 |= DECL_TEMPLATE_INSTANTIATED (olddecl); 1802 1803 /* If the OLDDECL is an instantiation and/or specialization, 1804 then the NEWDECL must be too. But, it may not yet be marked 1805 as such if the caller has created NEWDECL, but has not yet 1806 figured out that it is a redeclaration. */ 1807 if (!DECL_USE_TEMPLATE (newdecl)) 1808 DECL_USE_TEMPLATE (newdecl) = DECL_USE_TEMPLATE (olddecl); 1809 1810 /* Don't really know how much of the language-specific 1811 values we should copy from old to new. */ 1812 DECL_IN_AGGR_P (newdecl) = DECL_IN_AGGR_P (olddecl); 1813 DECL_LANG_SPECIFIC (newdecl)->decl_flags.u2 = 1814 DECL_LANG_SPECIFIC (olddecl)->decl_flags.u2; 1815 DECL_NONCONVERTING_P (newdecl) = DECL_NONCONVERTING_P (olddecl); 1816 DECL_REPO_AVAILABLE_P (newdecl) = DECL_REPO_AVAILABLE_P (olddecl); 1817 if (DECL_TEMPLATE_INFO (newdecl)) 1818 new_template = DECL_TI_TEMPLATE (newdecl); 1819 DECL_TEMPLATE_INFO (newdecl) = DECL_TEMPLATE_INFO (olddecl); 1820 DECL_INITIALIZED_IN_CLASS_P (newdecl) 1821 |= DECL_INITIALIZED_IN_CLASS_P (olddecl); 1822 olddecl_friend = DECL_FRIEND_P (olddecl); 1823 hidden_friend = (DECL_ANTICIPATED (olddecl) 1824 && DECL_HIDDEN_FRIEND_P (olddecl) 1825 && newdecl_is_friend); 1826 1827 /* Only functions have DECL_BEFRIENDING_CLASSES. */ 1828 if (TREE_CODE (newdecl) == FUNCTION_DECL 1829 || DECL_FUNCTION_TEMPLATE_P (newdecl)) 1830 { 1831 DECL_BEFRIENDING_CLASSES (newdecl) 1832 = chainon (DECL_BEFRIENDING_CLASSES (newdecl), 1833 DECL_BEFRIENDING_CLASSES (olddecl)); 1834 /* DECL_THUNKS is only valid for virtual functions, 1835 otherwise it is a DECL_FRIEND_CONTEXT. */ 1836 if (DECL_VIRTUAL_P (newdecl)) 1837 DECL_THUNKS (newdecl) = DECL_THUNKS (olddecl); 1838 } 1839 } 1840 1841 if (TREE_CODE (newdecl) == FUNCTION_DECL) 1842 { 1843 if (DECL_TEMPLATE_INSTANTIATION (olddecl) 1844 && !DECL_TEMPLATE_INSTANTIATION (newdecl)) 1845 { 1846 /* If newdecl is not a specialization, then it is not a 1847 template-related function at all. And that means that we 1848 should have exited above, returning 0. */ 1849 gcc_assert (DECL_TEMPLATE_SPECIALIZATION (newdecl)); 1850 1851 if (TREE_USED (olddecl)) 1852 /* From [temp.expl.spec]: 1853 1854 If a template, a member template or the member of a class 1855 template is explicitly specialized then that 1856 specialization shall be declared before the first use of 1857 that specialization that would cause an implicit 1858 instantiation to take place, in every translation unit in 1859 which such a use occurs. */ 1860 error ("explicit specialization of %qD after first use", 1861 olddecl); 1862 1863 SET_DECL_TEMPLATE_SPECIALIZATION (olddecl); 1864 1865 /* Don't propagate visibility from the template to the 1866 specialization here. We'll do that in determine_visibility if 1867 appropriate. */ 1868 DECL_VISIBILITY_SPECIFIED (olddecl) = 0; 1869 1870 /* [temp.expl.spec/14] We don't inline explicit specialization 1871 just because the primary template says so. */ 1872 } 1873 else 1874 { 1875 if (DECL_PENDING_INLINE_INFO (newdecl) == 0) 1876 DECL_PENDING_INLINE_INFO (newdecl) = DECL_PENDING_INLINE_INFO (olddecl); 1877 1878 DECL_DECLARED_INLINE_P (newdecl) |= DECL_DECLARED_INLINE_P (olddecl); 1879 1880 /* If either decl says `inline', this fn is inline, unless 1881 its definition was passed already. */ 1882 if (DECL_INLINE (newdecl) && DECL_INITIAL (olddecl) == NULL_TREE) 1883 DECL_INLINE (olddecl) = 1; 1884 DECL_INLINE (newdecl) = DECL_INLINE (olddecl); 1885 1886 DECL_UNINLINABLE (newdecl) = DECL_UNINLINABLE (olddecl) 1887 = (DECL_UNINLINABLE (newdecl) || DECL_UNINLINABLE (olddecl)); 1888 } 1889 1890 /* Preserve abstractness on cloned [cd]tors. */ 1891 DECL_ABSTRACT (newdecl) = DECL_ABSTRACT (olddecl); 1892 1893 if (! types_match) 1894 { 1895 SET_DECL_LANGUAGE (olddecl, DECL_LANGUAGE (newdecl)); 1896 COPY_DECL_ASSEMBLER_NAME (newdecl, olddecl); 1897 COPY_DECL_RTL (newdecl, olddecl); 1898 } 1899 if (! types_match || new_defines_function) 1900 { 1901 /* These need to be copied so that the names are available. 1902 Note that if the types do match, we'll preserve inline 1903 info and other bits, but if not, we won't. */ 1904 DECL_ARGUMENTS (olddecl) = DECL_ARGUMENTS (newdecl); 1905 DECL_RESULT (olddecl) = DECL_RESULT (newdecl); 1906 } 1907 if (new_defines_function) 1908 /* If defining a function declared with other language 1909 linkage, use the previously declared language linkage. */ 1910 SET_DECL_LANGUAGE (newdecl, DECL_LANGUAGE (olddecl)); 1911 else if (types_match) 1912 { 1913 /* If redeclaring a builtin function, and not a definition, 1914 it stays built in. */ 1915 if (DECL_BUILT_IN (olddecl)) 1916 { 1917 DECL_BUILT_IN_CLASS (newdecl) = DECL_BUILT_IN_CLASS (olddecl); 1918 DECL_FUNCTION_CODE (newdecl) = DECL_FUNCTION_CODE (olddecl); 1919 /* If we're keeping the built-in definition, keep the rtl, 1920 regardless of declaration matches. */ 1921 COPY_DECL_RTL (olddecl, newdecl); 1922 } 1923 1924 DECL_RESULT (newdecl) = DECL_RESULT (olddecl); 1925 /* Don't clear out the arguments if we're redefining a function. */ 1926 if (DECL_ARGUMENTS (olddecl)) 1927 DECL_ARGUMENTS (newdecl) = DECL_ARGUMENTS (olddecl); 1928 } 1929 } 1930 else if (TREE_CODE (newdecl) == NAMESPACE_DECL) 1931 NAMESPACE_LEVEL (newdecl) = NAMESPACE_LEVEL (olddecl); 1932 1933 /* Now preserve various other info from the definition. */ 1934 TREE_ADDRESSABLE (newdecl) = TREE_ADDRESSABLE (olddecl); 1935 TREE_ASM_WRITTEN (newdecl) = TREE_ASM_WRITTEN (olddecl); 1936 DECL_COMMON (newdecl) = DECL_COMMON (olddecl); 1937 COPY_DECL_ASSEMBLER_NAME (olddecl, newdecl); 1938 1939 /* Warn about conflicting visibility specifications. */ 1940 if (DECL_VISIBILITY_SPECIFIED (olddecl) 1941 && DECL_VISIBILITY_SPECIFIED (newdecl) 1942 && DECL_VISIBILITY (newdecl) != DECL_VISIBILITY (olddecl)) 1943 { 1944 warning (OPT_Wattributes, "%q+D: visibility attribute ignored " 1945 "because it", newdecl); 1946 warning (OPT_Wattributes, "%Jconflicts with previous " 1947 "declaration here", olddecl); 1948 } 1949 /* Choose the declaration which specified visibility. */ 1950 if (DECL_VISIBILITY_SPECIFIED (olddecl)) 1951 { 1952 DECL_VISIBILITY (newdecl) = DECL_VISIBILITY (olddecl); 1953 DECL_VISIBILITY_SPECIFIED (newdecl) = 1; 1954 } 1955 /* Init priority used to be merged from newdecl to olddecl by the memcpy, 1956 so keep this behavior. */ 1957 if (TREE_CODE (newdecl) == VAR_DECL && DECL_HAS_INIT_PRIORITY_P (newdecl)) 1958 { 1959 SET_DECL_INIT_PRIORITY (olddecl, DECL_INIT_PRIORITY (newdecl)); 1960 DECL_HAS_INIT_PRIORITY_P (olddecl) = 1; 1961 } 1962 1963 /* The DECL_LANG_SPECIFIC information in OLDDECL will be replaced 1964 with that from NEWDECL below. */ 1965 if (DECL_LANG_SPECIFIC (olddecl)) 1966 { 1967 gcc_assert (DECL_LANG_SPECIFIC (olddecl) 1968 != DECL_LANG_SPECIFIC (newdecl)); 1969 ggc_free (DECL_LANG_SPECIFIC (olddecl)); 1970 } 1971 1972 if (TREE_CODE (newdecl) == FUNCTION_DECL) 1973 { 1974 int function_size; 1975 1976 function_size = sizeof (struct tree_decl_common); 1977 1978 memcpy ((char *) olddecl + sizeof (struct tree_common), 1979 (char *) newdecl + sizeof (struct tree_common), 1980 function_size - sizeof (struct tree_common)); 1981 1982 memcpy ((char *) olddecl + sizeof (struct tree_decl_common), 1983 (char *) newdecl + sizeof (struct tree_decl_common), 1984 sizeof (struct tree_function_decl) - sizeof (struct tree_decl_common)); 1985 if (new_template) 1986 /* If newdecl is a template instantiation, it is possible that 1987 the following sequence of events has occurred: 1988 1989 o A friend function was declared in a class template. The 1990 class template was instantiated. 1991 1992 o The instantiation of the friend declaration was 1993 recorded on the instantiation list, and is newdecl. 1994 1995 o Later, however, instantiate_class_template called pushdecl 1996 on the newdecl to perform name injection. But, pushdecl in 1997 turn called duplicate_decls when it discovered that another 1998 declaration of a global function with the same name already 1999 existed. 2000 2001 o Here, in duplicate_decls, we decided to clobber newdecl. 2002 2003 If we're going to do that, we'd better make sure that 2004 olddecl, and not newdecl, is on the list of 2005 instantiations so that if we try to do the instantiation 2006 again we won't get the clobbered declaration. */ 2007 reregister_specialization (newdecl, 2008 new_template, 2009 olddecl); 2010 } 2011 else 2012 { 2013 size_t size = tree_code_size (TREE_CODE (olddecl)); 2014 memcpy ((char *) olddecl + sizeof (struct tree_common), 2015 (char *) newdecl + sizeof (struct tree_common), 2016 sizeof (struct tree_decl_common) - sizeof (struct tree_common)); 2017 switch (TREE_CODE (olddecl)) 2018 { 2019 case LABEL_DECL: 2020 case VAR_DECL: 2021 case RESULT_DECL: 2022 case PARM_DECL: 2023 case FIELD_DECL: 2024 case TYPE_DECL: 2025 case CONST_DECL: 2026 { 2027 memcpy ((char *) olddecl + sizeof (struct tree_decl_common), 2028 (char *) newdecl + sizeof (struct tree_decl_common), 2029 size - sizeof (struct tree_decl_common) 2030 + TREE_CODE_LENGTH (TREE_CODE (newdecl)) * sizeof (char *)); 2031 } 2032 break; 2033 default: 2034 memcpy ((char *) olddecl + sizeof (struct tree_decl_common), 2035 (char *) newdecl + sizeof (struct tree_decl_common), 2036 sizeof (struct tree_decl_non_common) - sizeof (struct tree_decl_common) 2037 + TREE_CODE_LENGTH (TREE_CODE (newdecl)) * sizeof (char *)); 2038 break; 2039 } 2040 } 2041 DECL_UID (olddecl) = olddecl_uid; 2042 if (olddecl_friend) 2043 DECL_FRIEND_P (olddecl) = 1; 2044 if (hidden_friend) 2045 { 2046 DECL_ANTICIPATED (olddecl) = 1; 2047 DECL_HIDDEN_FRIEND_P (olddecl) = 1; 2048 } 2049 2050 /* NEWDECL contains the merged attribute lists. 2051 Update OLDDECL to be the same. */ 2052 DECL_ATTRIBUTES (olddecl) = DECL_ATTRIBUTES (newdecl); 2053 2054 /* If OLDDECL had its DECL_RTL instantiated, re-invoke make_decl_rtl 2055 so that encode_section_info has a chance to look at the new decl 2056 flags and attributes. */ 2057 if (DECL_RTL_SET_P (olddecl) 2058 && (TREE_CODE (olddecl) == FUNCTION_DECL 2059 || (TREE_CODE (olddecl) == VAR_DECL 2060 && TREE_STATIC (olddecl)))) 2061 make_decl_rtl (olddecl); 2062 2063 /* The NEWDECL will no longer be needed. Because every out-of-class 2064 declaration of a member results in a call to duplicate_decls, 2065 freeing these nodes represents in a significant savings. */ 2066 ggc_free (newdecl); 2067 2068 return olddecl; 2069} 2070 2071/* Return zero if the declaration NEWDECL is valid 2072 when the declaration OLDDECL (assumed to be for the same name) 2073 has already been seen. 2074 Otherwise return an error message format string with a %s 2075 where the identifier should go. */ 2076 2077static const char * 2078redeclaration_error_message (tree newdecl, tree olddecl) 2079{ 2080 if (TREE_CODE (newdecl) == TYPE_DECL) 2081 { 2082 /* Because C++ can put things into name space for free, 2083 constructs like "typedef struct foo { ... } foo" 2084 would look like an erroneous redeclaration. */ 2085 if (same_type_p (TREE_TYPE (newdecl), TREE_TYPE (olddecl))) 2086 return NULL; 2087 else 2088 return "redefinition of %q#D"; 2089 } 2090 else if (TREE_CODE (newdecl) == FUNCTION_DECL) 2091 { 2092 /* If this is a pure function, its olddecl will actually be 2093 the original initialization to `0' (which we force to call 2094 abort()). Don't complain about redefinition in this case. */ 2095 if (DECL_LANG_SPECIFIC (olddecl) && DECL_PURE_VIRTUAL_P (olddecl) 2096 && DECL_INITIAL (olddecl) == NULL_TREE) 2097 return NULL; 2098 2099 /* If both functions come from different namespaces, this is not 2100 a redeclaration - this is a conflict with a used function. */ 2101 if (DECL_NAMESPACE_SCOPE_P (olddecl) 2102 && DECL_CONTEXT (olddecl) != DECL_CONTEXT (newdecl) 2103 && ! decls_match (olddecl, newdecl)) 2104 return "%qD conflicts with used function"; 2105 2106 /* We'll complain about linkage mismatches in 2107 warn_extern_redeclared_static. */ 2108 2109 /* Defining the same name twice is no good. */ 2110 if (DECL_INITIAL (olddecl) != NULL_TREE 2111 && DECL_INITIAL (newdecl) != NULL_TREE) 2112 { 2113 if (DECL_NAME (olddecl) == NULL_TREE) 2114 return "%q#D not declared in class"; 2115 else 2116 return "redefinition of %q#D"; 2117 } 2118 return NULL; 2119 } 2120 else if (TREE_CODE (newdecl) == TEMPLATE_DECL) 2121 { 2122 tree nt, ot; 2123 2124 if (TREE_CODE (DECL_TEMPLATE_RESULT (newdecl)) == TYPE_DECL) 2125 { 2126 if (COMPLETE_TYPE_P (TREE_TYPE (newdecl)) 2127 && COMPLETE_TYPE_P (TREE_TYPE (olddecl))) 2128 return "redefinition of %q#D"; 2129 return NULL; 2130 } 2131 2132 if (TREE_CODE (DECL_TEMPLATE_RESULT (newdecl)) != FUNCTION_DECL 2133 || (DECL_TEMPLATE_RESULT (newdecl) 2134 == DECL_TEMPLATE_RESULT (olddecl))) 2135 return NULL; 2136 2137 nt = DECL_TEMPLATE_RESULT (newdecl); 2138 if (DECL_TEMPLATE_INFO (nt)) 2139 nt = DECL_TEMPLATE_RESULT (template_for_substitution (nt)); 2140 ot = DECL_TEMPLATE_RESULT (olddecl); 2141 if (DECL_TEMPLATE_INFO (ot)) 2142 ot = DECL_TEMPLATE_RESULT (template_for_substitution (ot)); 2143 if (DECL_INITIAL (nt) && DECL_INITIAL (ot)) 2144 return "redefinition of %q#D"; 2145 2146 return NULL; 2147 } 2148 else if (TREE_CODE (newdecl) == VAR_DECL 2149 && DECL_THREAD_LOCAL_P (newdecl) != DECL_THREAD_LOCAL_P (olddecl) 2150 && (! DECL_LANG_SPECIFIC (olddecl) 2151 || ! CP_DECL_THREADPRIVATE_P (olddecl) 2152 || DECL_THREAD_LOCAL_P (newdecl))) 2153 { 2154 /* Only variables can be thread-local, and all declarations must 2155 agree on this property. */ 2156 if (DECL_THREAD_LOCAL_P (newdecl)) 2157 return "thread-local declaration of %q#D follows " 2158 "non-thread-local declaration"; 2159 else 2160 return "non-thread-local declaration of %q#D follows " 2161 "thread-local declaration"; 2162 } 2163 else if (toplevel_bindings_p () || DECL_NAMESPACE_SCOPE_P (newdecl)) 2164 { 2165 /* The objects have been declared at namespace scope. If either 2166 is a member of an anonymous union, then this is an invalid 2167 redeclaration. For example: 2168 2169 int i; 2170 union { int i; }; 2171 2172 is invalid. */ 2173 if (DECL_ANON_UNION_VAR_P (newdecl) 2174 || DECL_ANON_UNION_VAR_P (olddecl)) 2175 return "redeclaration of %q#D"; 2176 /* If at least one declaration is a reference, there is no 2177 conflict. For example: 2178 2179 int i = 3; 2180 extern int i; 2181 2182 is valid. */ 2183 if (DECL_EXTERNAL (newdecl) || DECL_EXTERNAL (olddecl)) 2184 return NULL; 2185 /* Reject two definitions. */ 2186 return "redefinition of %q#D"; 2187 } 2188 else 2189 { 2190 /* Objects declared with block scope: */ 2191 /* Reject two definitions, and reject a definition 2192 together with an external reference. */ 2193 if (!(DECL_EXTERNAL (newdecl) && DECL_EXTERNAL (olddecl))) 2194 return "redeclaration of %q#D"; 2195 return NULL; 2196 } 2197} 2198 2199/* Hash and equality functions for the named_label table. */ 2200 2201static hashval_t 2202named_label_entry_hash (const void *data) 2203{ 2204 const struct named_label_entry *ent = (const struct named_label_entry *) data; 2205 return DECL_UID (ent->label_decl); 2206} 2207 2208static int 2209named_label_entry_eq (const void *a, const void *b) 2210{ 2211 const struct named_label_entry *ent_a = (const struct named_label_entry *) a; 2212 const struct named_label_entry *ent_b = (const struct named_label_entry *) b; 2213 return ent_a->label_decl == ent_b->label_decl; 2214} 2215 2216/* Create a new label, named ID. */ 2217 2218static tree 2219make_label_decl (tree id, int local_p) 2220{ 2221 struct named_label_entry *ent; 2222 void **slot; 2223 tree decl; 2224 2225 decl = build_decl (LABEL_DECL, id, void_type_node); 2226 2227 DECL_CONTEXT (decl) = current_function_decl; 2228 DECL_MODE (decl) = VOIDmode; 2229 C_DECLARED_LABEL_FLAG (decl) = local_p; 2230 2231 /* Say where one reference is to the label, for the sake of the 2232 error if it is not defined. */ 2233 DECL_SOURCE_LOCATION (decl) = input_location; 2234 2235 /* Record the fact that this identifier is bound to this label. */ 2236 SET_IDENTIFIER_LABEL_VALUE (id, decl); 2237 2238 /* Create the label htab for the function on demand. */ 2239 if (!named_labels) 2240 named_labels = htab_create_ggc (13, named_label_entry_hash, 2241 named_label_entry_eq, NULL); 2242 2243 /* Record this label on the list of labels used in this function. 2244 We do this before calling make_label_decl so that we get the 2245 IDENTIFIER_LABEL_VALUE before the new label is declared. */ 2246 ent = GGC_CNEW (struct named_label_entry); 2247 ent->label_decl = decl; 2248 2249 slot = htab_find_slot (named_labels, ent, INSERT); 2250 gcc_assert (*slot == NULL); 2251 *slot = ent; 2252 2253 return decl; 2254} 2255 2256/* Look for a label named ID in the current function. If one cannot 2257 be found, create one. (We keep track of used, but undefined, 2258 labels, and complain about them at the end of a function.) */ 2259 2260tree 2261lookup_label (tree id) 2262{ 2263 tree decl; 2264 2265 timevar_push (TV_NAME_LOOKUP); 2266 /* You can't use labels at global scope. */ 2267 if (current_function_decl == NULL_TREE) 2268 { 2269 error ("label %qE referenced outside of any function", id); 2270 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, NULL_TREE); 2271 } 2272 2273 /* See if we've already got this label. */ 2274 decl = IDENTIFIER_LABEL_VALUE (id); 2275 if (decl != NULL_TREE && DECL_CONTEXT (decl) == current_function_decl) 2276 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, decl); 2277 2278 decl = make_label_decl (id, /*local_p=*/0); 2279 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, decl); 2280} 2281 2282/* Declare a local label named ID. */ 2283 2284tree 2285declare_local_label (tree id) 2286{ 2287 tree decl, shadow; 2288 2289 /* Add a new entry to the SHADOWED_LABELS list so that when we leave 2290 this scope we can restore the old value of IDENTIFIER_TYPE_VALUE. */ 2291 shadow = tree_cons (IDENTIFIER_LABEL_VALUE (id), NULL_TREE, 2292 current_binding_level->shadowed_labels); 2293 current_binding_level->shadowed_labels = shadow; 2294 2295 decl = make_label_decl (id, /*local_p=*/1); 2296 TREE_VALUE (shadow) = decl; 2297 2298 return decl; 2299} 2300 2301/* Returns nonzero if it is ill-formed to jump past the declaration of 2302 DECL. Returns 2 if it's also a real problem. */ 2303 2304static int 2305decl_jump_unsafe (tree decl) 2306{ 2307 if (TREE_CODE (decl) != VAR_DECL || TREE_STATIC (decl) 2308 || TREE_TYPE (decl) == error_mark_node) 2309 return 0; 2310 2311 if (TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (decl)) 2312 || DECL_NONTRIVIALLY_INITIALIZED_P (decl)) 2313 return 2; 2314 2315 if (pod_type_p (TREE_TYPE (decl))) 2316 return 0; 2317 2318 /* The POD stuff is just pedantry; why should it matter if the class 2319 contains a field of pointer to member type? */ 2320 return 1; 2321} 2322 2323/* A subroutine of check_previous_goto_1 to identify a branch to the user. */ 2324 2325static void 2326identify_goto (tree decl, const location_t *locus) 2327{ 2328 if (decl) 2329 pedwarn ("jump to label %qD", decl); 2330 else 2331 pedwarn ("jump to case label"); 2332 if (locus) 2333 pedwarn ("%H from here", locus); 2334} 2335 2336/* Check that a single previously seen jump to a newly defined label 2337 is OK. DECL is the LABEL_DECL or 0; LEVEL is the binding_level for 2338 the jump context; NAMES are the names in scope in LEVEL at the jump 2339 context; LOCUS is the source position of the jump or 0. Returns 2340 true if all is well. */ 2341 2342static bool 2343check_previous_goto_1 (tree decl, struct cp_binding_level* level, tree names, 2344 bool exited_omp, const location_t *locus) 2345{ 2346 struct cp_binding_level *b; 2347 bool identified = false, saw_eh = false, saw_omp = false; 2348 2349 if (exited_omp) 2350 { 2351 identify_goto (decl, locus); 2352 error (" exits OpenMP structured block"); 2353 identified = saw_omp = true; 2354 } 2355 2356 for (b = current_binding_level; b ; b = b->level_chain) 2357 { 2358 tree new_decls, old_decls = (b == level ? names : NULL_TREE); 2359 2360 for (new_decls = b->names; new_decls != old_decls; 2361 new_decls = TREE_CHAIN (new_decls)) 2362 { 2363 int problem = decl_jump_unsafe (new_decls); 2364 if (! problem) 2365 continue; 2366 2367 if (!identified) 2368 { 2369 identify_goto (decl, locus); 2370 identified = true; 2371 } 2372 if (problem > 1) 2373 error (" crosses initialization of %q+#D", new_decls); 2374 else 2375 pedwarn (" enters scope of non-POD %q+#D", new_decls); 2376 } 2377 2378 if (b == level) 2379 break; 2380 if ((b->kind == sk_try || b->kind == sk_catch) && !saw_eh) 2381 { 2382 if (!identified) 2383 { 2384 identify_goto (decl, locus); 2385 identified = true; 2386 } 2387 if (b->kind == sk_try) 2388 error (" enters try block"); 2389 else 2390 error (" enters catch block"); 2391 saw_eh = true; 2392 } 2393 if (b->kind == sk_omp && !saw_omp) 2394 { 2395 if (!identified) 2396 { 2397 identify_goto (decl, locus); 2398 identified = true; 2399 } 2400 error (" enters OpenMP structured block"); 2401 saw_omp = true; 2402 } 2403 } 2404 2405 return !identified; 2406} 2407 2408static void 2409check_previous_goto (tree decl, struct named_label_use_entry *use) 2410{ 2411 check_previous_goto_1 (decl, use->binding_level, 2412 use->names_in_scope, use->in_omp_scope, 2413 &use->o_goto_locus); 2414} 2415 2416static bool 2417check_switch_goto (struct cp_binding_level* level) 2418{ 2419 return check_previous_goto_1 (NULL_TREE, level, level->names, false, NULL); 2420} 2421 2422/* Check that a new jump to a label DECL is OK. Called by 2423 finish_goto_stmt. */ 2424 2425void 2426check_goto (tree decl) 2427{ 2428 struct named_label_entry *ent, dummy; 2429 bool saw_catch = false, identified = false; 2430 tree bad; 2431 2432 /* We can't know where a computed goto is jumping. 2433 So we assume that it's OK. */ 2434 if (TREE_CODE (decl) != LABEL_DECL) 2435 return; 2436 2437 /* We didn't record any information about this label when we created it, 2438 and there's not much point since it's trivial to analyze as a return. */ 2439 if (decl == cdtor_label) 2440 return; 2441 2442 dummy.label_decl = decl; 2443 ent = (struct named_label_entry *) htab_find (named_labels, &dummy); 2444 gcc_assert (ent != NULL); 2445 2446 /* If the label hasn't been defined yet, defer checking. */ 2447 if (! DECL_INITIAL (decl)) 2448 { 2449 struct named_label_use_entry *new_use; 2450 2451 /* Don't bother creating another use if the last goto had the 2452 same data, and will therefore create the same set of errors. */ 2453 if (ent->uses 2454 && ent->uses->names_in_scope == current_binding_level->names) 2455 return; 2456 2457 new_use = GGC_NEW (struct named_label_use_entry); 2458 new_use->binding_level = current_binding_level; 2459 new_use->names_in_scope = current_binding_level->names; 2460 new_use->o_goto_locus = input_location; 2461 new_use->in_omp_scope = false; 2462 2463 new_use->next = ent->uses; 2464 ent->uses = new_use; 2465 return; 2466 } 2467 2468 if (ent->in_try_scope || ent->in_catch_scope 2469 || ent->in_omp_scope || ent->bad_decls) 2470 { 2471 pedwarn ("jump to label %q+D", decl); 2472 pedwarn (" from here"); 2473 identified = true; 2474 } 2475 2476 for (bad = ent->bad_decls; bad; bad = TREE_CHAIN (bad)) 2477 { 2478 tree b = TREE_VALUE (bad); 2479 int u = decl_jump_unsafe (b); 2480 2481 if (u > 1 && DECL_ARTIFICIAL (b)) 2482 { 2483 /* Can't skip init of __exception_info. */ 2484 error ("%J enters catch block", b); 2485 saw_catch = true; 2486 } 2487 else if (u > 1) 2488 error (" skips initialization of %q+#D", b); 2489 else 2490 pedwarn (" enters scope of non-POD %q+#D", b); 2491 } 2492 2493 if (ent->in_try_scope) 2494 error (" enters try block"); 2495 else if (ent->in_catch_scope && !saw_catch) 2496 error (" enters catch block"); 2497 2498 if (ent->in_omp_scope) 2499 error (" enters OpenMP structured block"); 2500 else if (flag_openmp) 2501 { 2502 struct cp_binding_level *b; 2503 for (b = current_binding_level; b ; b = b->level_chain) 2504 { 2505 if (b == ent->binding_level) 2506 break; 2507 if (b->kind == sk_omp) 2508 { 2509 if (!identified) 2510 { 2511 pedwarn ("jump to label %q+D", decl); 2512 pedwarn (" from here"); 2513 identified = true; 2514 } 2515 error (" exits OpenMP structured block"); 2516 break; 2517 } 2518 } 2519 } 2520} 2521 2522/* Check that a return is ok wrt OpenMP structured blocks. 2523 Called by finish_return_stmt. Returns true if all is well. */ 2524 2525bool 2526check_omp_return (void) 2527{ 2528 struct cp_binding_level *b; 2529 for (b = current_binding_level; b ; b = b->level_chain) 2530 if (b->kind == sk_omp) 2531 { 2532 error ("invalid exit from OpenMP structured block"); 2533 return false; 2534 } 2535 return true; 2536} 2537 2538/* Define a label, specifying the location in the source file. 2539 Return the LABEL_DECL node for the label. */ 2540 2541tree 2542define_label (location_t location, tree name) 2543{ 2544 struct named_label_entry *ent, dummy; 2545 struct cp_binding_level *p; 2546 tree decl; 2547 2548 timevar_push (TV_NAME_LOOKUP); 2549 2550 decl = lookup_label (name); 2551 2552 dummy.label_decl = decl; 2553 ent = (struct named_label_entry *) htab_find (named_labels, &dummy); 2554 gcc_assert (ent != NULL); 2555 2556 /* After labels, make any new cleanups in the function go into their 2557 own new (temporary) binding contour. */ 2558 for (p = current_binding_level; 2559 p->kind != sk_function_parms; 2560 p = p->level_chain) 2561 p->more_cleanups_ok = 0; 2562 2563 if (name == get_identifier ("wchar_t")) 2564 pedwarn ("label named wchar_t"); 2565 2566 if (DECL_INITIAL (decl) != NULL_TREE) 2567 { 2568 error ("duplicate label %qD", decl); 2569 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, error_mark_node); 2570 } 2571 else 2572 { 2573 struct named_label_use_entry *use; 2574 2575 /* Mark label as having been defined. */ 2576 DECL_INITIAL (decl) = error_mark_node; 2577 /* Say where in the source. */ 2578 DECL_SOURCE_LOCATION (decl) = location; 2579 2580 ent->binding_level = current_binding_level; 2581 ent->names_in_scope = current_binding_level->names; 2582 2583 for (use = ent->uses; use ; use = use->next) 2584 check_previous_goto (decl, use); 2585 ent->uses = NULL; 2586 } 2587 2588 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, decl); 2589} 2590 2591struct cp_switch 2592{ 2593 struct cp_binding_level *level; 2594 struct cp_switch *next; 2595 /* The SWITCH_STMT being built. */ 2596 tree switch_stmt; 2597 /* A splay-tree mapping the low element of a case range to the high 2598 element, or NULL_TREE if there is no high element. Used to 2599 determine whether or not a new case label duplicates an old case 2600 label. We need a tree, rather than simply a hash table, because 2601 of the GNU case range extension. */ 2602 splay_tree cases; 2603}; 2604 2605/* A stack of the currently active switch statements. The innermost 2606 switch statement is on the top of the stack. There is no need to 2607 mark the stack for garbage collection because it is only active 2608 during the processing of the body of a function, and we never 2609 collect at that point. */ 2610 2611static struct cp_switch *switch_stack; 2612 2613/* Called right after a switch-statement condition is parsed. 2614 SWITCH_STMT is the switch statement being parsed. */ 2615 2616void 2617push_switch (tree switch_stmt) 2618{ 2619 struct cp_switch *p = XNEW (struct cp_switch); 2620 p->level = current_binding_level; 2621 p->next = switch_stack; 2622 p->switch_stmt = switch_stmt; 2623 p->cases = splay_tree_new (case_compare, NULL, NULL); 2624 switch_stack = p; 2625} 2626 2627void 2628pop_switch (void) 2629{ 2630 struct cp_switch *cs = switch_stack; 2631 location_t switch_location; 2632 2633 /* Emit warnings as needed. */ 2634 if (EXPR_HAS_LOCATION (cs->switch_stmt)) 2635 switch_location = EXPR_LOCATION (cs->switch_stmt); 2636 else 2637 switch_location = input_location; 2638 if (!processing_template_decl) 2639 c_do_switch_warnings (cs->cases, switch_location, 2640 SWITCH_STMT_TYPE (cs->switch_stmt), 2641 SWITCH_STMT_COND (cs->switch_stmt)); 2642 2643 splay_tree_delete (cs->cases); 2644 switch_stack = switch_stack->next; 2645 free (cs); 2646} 2647 2648/* Note that we've seen a definition of a case label, and complain if this 2649 is a bad place for one. */ 2650 2651tree 2652finish_case_label (tree low_value, tree high_value) 2653{ 2654 tree cond, r; 2655 struct cp_binding_level *p; 2656 2657 if (processing_template_decl) 2658 { 2659 tree label; 2660 2661 /* For templates, just add the case label; we'll do semantic 2662 analysis at instantiation-time. */ 2663 label = build_decl (LABEL_DECL, NULL_TREE, NULL_TREE); 2664 return add_stmt (build_case_label (low_value, high_value, label)); 2665 } 2666 2667 /* Find the condition on which this switch statement depends. */ 2668 cond = SWITCH_STMT_COND (switch_stack->switch_stmt); 2669 if (cond && TREE_CODE (cond) == TREE_LIST) 2670 cond = TREE_VALUE (cond); 2671 2672 if (!check_switch_goto (switch_stack->level)) 2673 return error_mark_node; 2674 2675 r = c_add_case_label (switch_stack->cases, cond, TREE_TYPE (cond), 2676 low_value, high_value); 2677 2678 /* After labels, make any new cleanups in the function go into their 2679 own new (temporary) binding contour. */ 2680 for (p = current_binding_level; 2681 p->kind != sk_function_parms; 2682 p = p->level_chain) 2683 p->more_cleanups_ok = 0; 2684 2685 return r; 2686} 2687 2688/* Hash a TYPENAME_TYPE. K is really of type `tree'. */ 2689 2690static hashval_t 2691typename_hash (const void* k) 2692{ 2693 hashval_t hash; 2694 tree t = (tree) k; 2695 2696 hash = (htab_hash_pointer (TYPE_CONTEXT (t)) 2697 ^ htab_hash_pointer (DECL_NAME (TYPE_NAME (t)))); 2698 2699 return hash; 2700} 2701 2702typedef struct typename_info { 2703 tree scope; 2704 tree name; 2705 tree template_id; 2706 bool enum_p; 2707 bool class_p; 2708} typename_info; 2709 2710/* Compare two TYPENAME_TYPEs. K1 and K2 are really of type `tree'. */ 2711 2712static int 2713typename_compare (const void * k1, const void * k2) 2714{ 2715 tree t1; 2716 const typename_info *t2; 2717 2718 t1 = (tree) k1; 2719 t2 = (const typename_info *) k2; 2720 2721 return (DECL_NAME (TYPE_NAME (t1)) == t2->name 2722 && TYPE_CONTEXT (t1) == t2->scope 2723 && TYPENAME_TYPE_FULLNAME (t1) == t2->template_id 2724 && TYPENAME_IS_ENUM_P (t1) == t2->enum_p 2725 && TYPENAME_IS_CLASS_P (t1) == t2->class_p); 2726} 2727 2728/* Build a TYPENAME_TYPE. If the type is `typename T::t', CONTEXT is 2729 the type of `T', NAME is the IDENTIFIER_NODE for `t'. 2730 2731 Returns the new TYPENAME_TYPE. */ 2732 2733static GTY ((param_is (union tree_node))) htab_t typename_htab; 2734 2735static tree 2736build_typename_type (tree context, tree name, tree fullname, 2737 enum tag_types tag_type) 2738{ 2739 tree t; 2740 tree d; 2741 typename_info ti; 2742 void **e; 2743 hashval_t hash; 2744 2745 if (typename_htab == NULL) 2746 typename_htab = htab_create_ggc (61, &typename_hash, 2747 &typename_compare, NULL); 2748 2749 ti.scope = FROB_CONTEXT (context); 2750 ti.name = name; 2751 ti.template_id = fullname; 2752 ti.enum_p = tag_type == enum_type; 2753 ti.class_p = (tag_type == class_type 2754 || tag_type == record_type 2755 || tag_type == union_type); 2756 hash = (htab_hash_pointer (ti.scope) 2757 ^ htab_hash_pointer (ti.name)); 2758 2759 /* See if we already have this type. */ 2760 e = htab_find_slot_with_hash (typename_htab, &ti, hash, INSERT); 2761 if (*e) 2762 t = (tree) *e; 2763 else 2764 { 2765 /* Build the TYPENAME_TYPE. */ 2766 t = make_aggr_type (TYPENAME_TYPE); 2767 TYPE_CONTEXT (t) = ti.scope; 2768 TYPENAME_TYPE_FULLNAME (t) = ti.template_id; 2769 TYPENAME_IS_ENUM_P (t) = ti.enum_p; 2770 TYPENAME_IS_CLASS_P (t) = ti.class_p; 2771 2772 /* Build the corresponding TYPE_DECL. */ 2773 d = build_decl (TYPE_DECL, name, t); 2774 TYPE_NAME (TREE_TYPE (d)) = d; 2775 TYPE_STUB_DECL (TREE_TYPE (d)) = d; 2776 DECL_CONTEXT (d) = FROB_CONTEXT (context); 2777 DECL_ARTIFICIAL (d) = 1; 2778 2779 /* Store it in the hash table. */ 2780 *e = t; 2781 } 2782 2783 return t; 2784} 2785 2786/* Resolve `typename CONTEXT::NAME'. TAG_TYPE indicates the tag 2787 provided to name the type. Returns an appropriate type, unless an 2788 error occurs, in which case error_mark_node is returned. If we 2789 locate a non-artificial TYPE_DECL and TF_KEEP_TYPE_DECL is set, we 2790 return that, rather than the _TYPE it corresponds to, in other 2791 cases we look through the type decl. If TF_ERROR is set, complain 2792 about errors, otherwise be quiet. */ 2793 2794tree 2795make_typename_type (tree context, tree name, enum tag_types tag_type, 2796 tsubst_flags_t complain) 2797{ 2798 tree fullname; 2799 tree t; 2800 bool want_template; 2801 2802 if (name == error_mark_node 2803 || context == NULL_TREE 2804 || context == error_mark_node) 2805 return error_mark_node; 2806 2807 if (TYPE_P (name)) 2808 { 2809 if (!(TYPE_LANG_SPECIFIC (name) 2810 && (CLASSTYPE_IS_TEMPLATE (name) 2811 || CLASSTYPE_USE_TEMPLATE (name)))) 2812 name = TYPE_IDENTIFIER (name); 2813 else 2814 /* Create a TEMPLATE_ID_EXPR for the type. */ 2815 name = build_nt (TEMPLATE_ID_EXPR, 2816 CLASSTYPE_TI_TEMPLATE (name), 2817 CLASSTYPE_TI_ARGS (name)); 2818 } 2819 else if (TREE_CODE (name) == TYPE_DECL) 2820 name = DECL_NAME (name); 2821 2822 fullname = name; 2823 2824 if (TREE_CODE (name) == TEMPLATE_ID_EXPR) 2825 { 2826 name = TREE_OPERAND (name, 0); 2827 if (TREE_CODE (name) == TEMPLATE_DECL) 2828 name = TREE_OPERAND (fullname, 0) = DECL_NAME (name); 2829 else if (TREE_CODE (name) == OVERLOAD) 2830 { 2831 error ("%qD is not a type", name); 2832 return error_mark_node; 2833 } 2834 } 2835 if (TREE_CODE (name) == TEMPLATE_DECL) 2836 { 2837 error ("%qD used without template parameters", name); 2838 return error_mark_node; 2839 } 2840 gcc_assert (TREE_CODE (name) == IDENTIFIER_NODE); 2841 gcc_assert (TYPE_P (context)); 2842 2843 /* When the CONTEXT is a dependent type, NAME could refer to a 2844 dependent base class of CONTEXT. So we cannot peek inside it, 2845 even if CONTEXT is a currently open scope. */ 2846 if (dependent_type_p (context)) 2847 return build_typename_type (context, name, fullname, tag_type); 2848 2849 if (!IS_AGGR_TYPE (context)) 2850 { 2851 if (complain & tf_error) 2852 error ("%q#T is not a class", context); 2853 return error_mark_node; 2854 } 2855 2856 want_template = TREE_CODE (fullname) == TEMPLATE_ID_EXPR; 2857 2858 /* We should only set WANT_TYPE when we're a nested typename type. 2859 Then we can give better diagnostics if we find a non-type. */ 2860 t = lookup_field (context, name, 0, /*want_type=*/true); 2861 if (!t) 2862 { 2863 if (complain & tf_error) 2864 error (want_template ? "no class template named %q#T in %q#T" 2865 : "no type named %q#T in %q#T", name, context); 2866 return error_mark_node; 2867 } 2868 2869 if (want_template && !DECL_CLASS_TEMPLATE_P (t)) 2870 { 2871 if (complain & tf_error) 2872 error ("%<typename %T::%D%> names %q#T, which is not a class template", 2873 context, name, t); 2874 return error_mark_node; 2875 } 2876 if (!want_template && TREE_CODE (t) != TYPE_DECL) 2877 { 2878 if (complain & tf_error) 2879 error ("%<typename %T::%D%> names %q#T, which is not a type", 2880 context, name, t); 2881 return error_mark_node; 2882 } 2883 2884 if (complain & tf_error) 2885 perform_or_defer_access_check (TYPE_BINFO (context), t, t); 2886 2887 if (want_template) 2888 return lookup_template_class (t, TREE_OPERAND (fullname, 1), 2889 NULL_TREE, context, 2890 /*entering_scope=*/0, 2891 tf_warning_or_error | tf_user); 2892 2893 if (DECL_ARTIFICIAL (t) || !(complain & tf_keep_type_decl)) 2894 t = TREE_TYPE (t); 2895 2896 return t; 2897} 2898 2899/* Resolve `CONTEXT::template NAME'. Returns a TEMPLATE_DECL if the name 2900 can be resolved or an UNBOUND_CLASS_TEMPLATE, unless an error occurs, 2901 in which case error_mark_node is returned. 2902 2903 If PARM_LIST is non-NULL, also make sure that the template parameter 2904 list of TEMPLATE_DECL matches. 2905 2906 If COMPLAIN zero, don't complain about any errors that occur. */ 2907 2908tree 2909make_unbound_class_template (tree context, tree name, tree parm_list, 2910 tsubst_flags_t complain) 2911{ 2912 tree t; 2913 tree d; 2914 2915 if (TYPE_P (name)) 2916 name = TYPE_IDENTIFIER (name); 2917 else if (DECL_P (name)) 2918 name = DECL_NAME (name); 2919 gcc_assert (TREE_CODE (name) == IDENTIFIER_NODE); 2920 2921 if (!dependent_type_p (context) 2922 || currently_open_class (context)) 2923 { 2924 tree tmpl = NULL_TREE; 2925 2926 if (IS_AGGR_TYPE (context)) 2927 tmpl = lookup_field (context, name, 0, false); 2928 2929 if (!tmpl || !DECL_CLASS_TEMPLATE_P (tmpl)) 2930 { 2931 if (complain & tf_error) 2932 error ("no class template named %q#T in %q#T", name, context); 2933 return error_mark_node; 2934 } 2935 2936 if (parm_list 2937 && !comp_template_parms (DECL_TEMPLATE_PARMS (tmpl), parm_list)) 2938 { 2939 if (complain & tf_error) 2940 { 2941 error ("template parameters do not match template"); 2942 error ("%q+D declared here", tmpl); 2943 } 2944 return error_mark_node; 2945 } 2946 2947 if (complain & tf_error) 2948 perform_or_defer_access_check (TYPE_BINFO (context), tmpl, tmpl); 2949 2950 return tmpl; 2951 } 2952 2953 /* Build the UNBOUND_CLASS_TEMPLATE. */ 2954 t = make_aggr_type (UNBOUND_CLASS_TEMPLATE); 2955 TYPE_CONTEXT (t) = FROB_CONTEXT (context); 2956 TREE_TYPE (t) = NULL_TREE; 2957 2958 /* Build the corresponding TEMPLATE_DECL. */ 2959 d = build_decl (TEMPLATE_DECL, name, t); 2960 TYPE_NAME (TREE_TYPE (d)) = d; 2961 TYPE_STUB_DECL (TREE_TYPE (d)) = d; 2962 DECL_CONTEXT (d) = FROB_CONTEXT (context); 2963 DECL_ARTIFICIAL (d) = 1; 2964 DECL_TEMPLATE_PARMS (d) = parm_list; 2965 2966 return t; 2967} 2968 2969 2970 2971/* Push the declarations of builtin types into the namespace. 2972 RID_INDEX is the index of the builtin type in the array 2973 RID_POINTERS. NAME is the name used when looking up the builtin 2974 type. TYPE is the _TYPE node for the builtin type. */ 2975 2976void 2977record_builtin_type (enum rid rid_index, 2978 const char* name, 2979 tree type) 2980{ 2981 tree rname = NULL_TREE, tname = NULL_TREE; 2982 tree tdecl = NULL_TREE; 2983 2984 if ((int) rid_index < (int) RID_MAX) 2985 rname = ridpointers[(int) rid_index]; 2986 if (name) 2987 tname = get_identifier (name); 2988 2989 /* The calls to SET_IDENTIFIER_GLOBAL_VALUE below should be 2990 eliminated. Built-in types should not be looked up name; their 2991 names are keywords that the parser can recognize. However, there 2992 is code in c-common.c that uses identifier_global_value to look 2993 up built-in types by name. */ 2994 if (tname) 2995 { 2996 tdecl = build_decl (TYPE_DECL, tname, type); 2997 DECL_ARTIFICIAL (tdecl) = 1; 2998 SET_IDENTIFIER_GLOBAL_VALUE (tname, tdecl); 2999 } 3000 if (rname) 3001 { 3002 if (!tdecl) 3003 { 3004 tdecl = build_decl (TYPE_DECL, rname, type); 3005 DECL_ARTIFICIAL (tdecl) = 1; 3006 } 3007 SET_IDENTIFIER_GLOBAL_VALUE (rname, tdecl); 3008 } 3009 3010 if (!TYPE_NAME (type)) 3011 TYPE_NAME (type) = tdecl; 3012 3013 if (tdecl) 3014 debug_hooks->type_decl (tdecl, 0); 3015} 3016 3017/* Record one of the standard Java types. 3018 * Declare it as having the given NAME. 3019 * If SIZE > 0, it is the size of one of the integral types; 3020 * otherwise it is the negative of the size of one of the other types. */ 3021 3022static tree 3023record_builtin_java_type (const char* name, int size) 3024{ 3025 tree type, decl; 3026 if (size > 0) 3027 type = make_signed_type (size); 3028 else if (size > -32) 3029 { /* "__java_char" or ""__java_boolean". */ 3030 type = make_unsigned_type (-size); 3031 /*if (size == -1) TREE_SET_CODE (type, BOOLEAN_TYPE);*/ 3032 } 3033 else 3034 { /* "__java_float" or ""__java_double". */ 3035 type = make_node (REAL_TYPE); 3036 TYPE_PRECISION (type) = - size; 3037 layout_type (type); 3038 } 3039 record_builtin_type (RID_MAX, name, type); 3040 decl = TYPE_NAME (type); 3041 3042 /* Suppress generate debug symbol entries for these types, 3043 since for normal C++ they are just clutter. 3044 However, push_lang_context undoes this if extern "Java" is seen. */ 3045 DECL_IGNORED_P (decl) = 1; 3046 3047 TYPE_FOR_JAVA (type) = 1; 3048 return type; 3049} 3050 3051/* Push a type into the namespace so that the back-ends ignore it. */ 3052 3053static void 3054record_unknown_type (tree type, const char* name) 3055{ 3056 tree decl = pushdecl (build_decl (TYPE_DECL, get_identifier (name), type)); 3057 /* Make sure the "unknown type" typedecl gets ignored for debug info. */ 3058 DECL_IGNORED_P (decl) = 1; 3059 TYPE_DECL_SUPPRESS_DEBUG (decl) = 1; 3060 TYPE_SIZE (type) = TYPE_SIZE (void_type_node); 3061 TYPE_ALIGN (type) = 1; 3062 TYPE_USER_ALIGN (type) = 0; 3063 TYPE_MODE (type) = TYPE_MODE (void_type_node); 3064} 3065 3066/* A string for which we should create an IDENTIFIER_NODE at 3067 startup. */ 3068 3069typedef struct predefined_identifier 3070{ 3071 /* The name of the identifier. */ 3072 const char *const name; 3073 /* The place where the IDENTIFIER_NODE should be stored. */ 3074 tree *const node; 3075 /* Nonzero if this is the name of a constructor or destructor. */ 3076 const int ctor_or_dtor_p; 3077} predefined_identifier; 3078 3079/* Create all the predefined identifiers. */ 3080 3081static void 3082initialize_predefined_identifiers (void) 3083{ 3084 const predefined_identifier *pid; 3085 3086 /* A table of identifiers to create at startup. */ 3087 static const predefined_identifier predefined_identifiers[] = { 3088 { "C++", &lang_name_cplusplus, 0 }, 3089 { "C", &lang_name_c, 0 }, 3090 { "Java", &lang_name_java, 0 }, 3091 /* Some of these names have a trailing space so that it is 3092 impossible for them to conflict with names written by users. */ 3093 { "__ct ", &ctor_identifier, 1 }, 3094 { "__base_ctor ", &base_ctor_identifier, 1 }, 3095 { "__comp_ctor ", &complete_ctor_identifier, 1 }, 3096 { "__dt ", &dtor_identifier, 1 }, 3097 { "__comp_dtor ", &complete_dtor_identifier, 1 }, 3098 { "__base_dtor ", &base_dtor_identifier, 1 }, 3099 { "__deleting_dtor ", &deleting_dtor_identifier, 1 }, 3100 { IN_CHARGE_NAME, &in_charge_identifier, 0 }, 3101 { "nelts", &nelts_identifier, 0 }, 3102 { THIS_NAME, &this_identifier, 0 }, 3103 { VTABLE_DELTA_NAME, &delta_identifier, 0 }, 3104 { VTABLE_PFN_NAME, &pfn_identifier, 0 }, 3105 { "_vptr", &vptr_identifier, 0 }, 3106 { "__vtt_parm", &vtt_parm_identifier, 0 }, 3107 { "::", &global_scope_name, 0 }, 3108 { "std", &std_identifier, 0 }, 3109 { NULL, NULL, 0 } 3110 }; 3111 3112 for (pid = predefined_identifiers; pid->name; ++pid) 3113 { 3114 *pid->node = get_identifier (pid->name); 3115 if (pid->ctor_or_dtor_p) 3116 IDENTIFIER_CTOR_OR_DTOR_P (*pid->node) = 1; 3117 } 3118} 3119 3120/* Create the predefined scalar types of C, 3121 and some nodes representing standard constants (0, 1, (void *)0). 3122 Initialize the global binding level. 3123 Make definitions for built-in primitive functions. */ 3124 3125void 3126cxx_init_decl_processing (void) 3127{ 3128 tree void_ftype; 3129 tree void_ftype_ptr; 3130 3131 build_common_tree_nodes (flag_signed_char, false); 3132 3133 /* Create all the identifiers we need. */ 3134 initialize_predefined_identifiers (); 3135 3136 /* Create the global variables. */ 3137 push_to_top_level (); 3138 3139 current_function_decl = NULL_TREE; 3140 current_binding_level = NULL; 3141 /* Enter the global namespace. */ 3142 gcc_assert (global_namespace == NULL_TREE); 3143 global_namespace = build_lang_decl (NAMESPACE_DECL, global_scope_name, 3144 void_type_node); 3145 TREE_PUBLIC (global_namespace) = 1; 3146 begin_scope (sk_namespace, global_namespace); 3147 3148 current_lang_name = NULL_TREE; 3149 3150 /* Adjust various flags based on command-line settings. */ 3151 if (!flag_permissive) 3152 flag_pedantic_errors = 1; 3153 if (!flag_no_inline) 3154 { 3155 flag_inline_trees = 1; 3156 flag_no_inline = 1; 3157 } 3158 if (flag_inline_functions) 3159 flag_inline_trees = 2; 3160 3161 /* Force minimum function alignment if using the least significant 3162 bit of function pointers to store the virtual bit. */ 3163 if (TARGET_PTRMEMFUNC_VBIT_LOCATION == ptrmemfunc_vbit_in_pfn 3164 && force_align_functions_log < 1) 3165 force_align_functions_log = 1; 3166 3167 /* Initially, C. */ 3168 current_lang_name = lang_name_c; 3169 3170 /* Create the `std' namespace. */ 3171 push_namespace (std_identifier); 3172 std_node = current_namespace; 3173 pop_namespace (); 3174 3175 c_common_nodes_and_builtins (); 3176 3177 java_byte_type_node = record_builtin_java_type ("__java_byte", 8); 3178 java_short_type_node = record_builtin_java_type ("__java_short", 16); 3179 java_int_type_node = record_builtin_java_type ("__java_int", 32); 3180 java_long_type_node = record_builtin_java_type ("__java_long", 64); 3181 java_float_type_node = record_builtin_java_type ("__java_float", -32); 3182 java_double_type_node = record_builtin_java_type ("__java_double", -64); 3183 java_char_type_node = record_builtin_java_type ("__java_char", -16); 3184 java_boolean_type_node = record_builtin_java_type ("__java_boolean", -1); 3185 3186 integer_two_node = build_int_cst (NULL_TREE, 2); 3187 integer_three_node = build_int_cst (NULL_TREE, 3); 3188 3189 record_builtin_type (RID_BOOL, "bool", boolean_type_node); 3190 truthvalue_type_node = boolean_type_node; 3191 truthvalue_false_node = boolean_false_node; 3192 truthvalue_true_node = boolean_true_node; 3193 3194 empty_except_spec = build_tree_list (NULL_TREE, NULL_TREE); 3195 3196#if 0 3197 record_builtin_type (RID_MAX, NULL, string_type_node); 3198#endif 3199 3200 delta_type_node = ptrdiff_type_node; 3201 vtable_index_type = ptrdiff_type_node; 3202 3203 vtt_parm_type = build_pointer_type (const_ptr_type_node); 3204 void_ftype = build_function_type (void_type_node, void_list_node); 3205 void_ftype_ptr = build_function_type (void_type_node, 3206 tree_cons (NULL_TREE, 3207 ptr_type_node, 3208 void_list_node)); 3209 void_ftype_ptr 3210 = build_exception_variant (void_ftype_ptr, empty_except_spec); 3211 3212 /* C++ extensions */ 3213 3214 unknown_type_node = make_node (UNKNOWN_TYPE); 3215 record_unknown_type (unknown_type_node, "unknown type"); 3216 3217 /* Indirecting an UNKNOWN_TYPE node yields an UNKNOWN_TYPE node. */ 3218 TREE_TYPE (unknown_type_node) = unknown_type_node; 3219 3220 /* Looking up TYPE_POINTER_TO and TYPE_REFERENCE_TO yield the same 3221 result. */ 3222 TYPE_POINTER_TO (unknown_type_node) = unknown_type_node; 3223 TYPE_REFERENCE_TO (unknown_type_node) = unknown_type_node; 3224 3225 { 3226 /* Make sure we get a unique function type, so we can give 3227 its pointer type a name. (This wins for gdb.) */ 3228 tree vfunc_type = make_node (FUNCTION_TYPE); 3229 TREE_TYPE (vfunc_type) = integer_type_node; 3230 TYPE_ARG_TYPES (vfunc_type) = NULL_TREE; 3231 layout_type (vfunc_type); 3232 3233 vtable_entry_type = build_pointer_type (vfunc_type); 3234 } 3235 record_builtin_type (RID_MAX, VTBL_PTR_TYPE, vtable_entry_type); 3236 3237 vtbl_type_node 3238 = build_cplus_array_type (vtable_entry_type, NULL_TREE); 3239 layout_type (vtbl_type_node); 3240 vtbl_type_node = build_qualified_type (vtbl_type_node, TYPE_QUAL_CONST); 3241 record_builtin_type (RID_MAX, NULL, vtbl_type_node); 3242 vtbl_ptr_type_node = build_pointer_type (vtable_entry_type); 3243 layout_type (vtbl_ptr_type_node); 3244 record_builtin_type (RID_MAX, NULL, vtbl_ptr_type_node); 3245 3246 push_namespace (get_identifier ("__cxxabiv1")); 3247 abi_node = current_namespace; 3248 pop_namespace (); 3249 3250 global_type_node = make_node (LANG_TYPE); 3251 record_unknown_type (global_type_node, "global type"); 3252 3253 /* Now, C++. */ 3254 current_lang_name = lang_name_cplusplus; 3255 3256 { 3257 tree bad_alloc_id; 3258 tree bad_alloc_type_node; 3259 tree bad_alloc_decl; 3260 tree newtype, deltype; 3261 tree ptr_ftype_sizetype; 3262 3263 push_namespace (std_identifier); 3264 bad_alloc_id = get_identifier ("bad_alloc"); 3265 bad_alloc_type_node = make_aggr_type (RECORD_TYPE); 3266 TYPE_CONTEXT (bad_alloc_type_node) = current_namespace; 3267 bad_alloc_decl 3268 = create_implicit_typedef (bad_alloc_id, bad_alloc_type_node); 3269 DECL_CONTEXT (bad_alloc_decl) = current_namespace; 3270 TYPE_STUB_DECL (bad_alloc_type_node) = bad_alloc_decl; 3271 pop_namespace (); 3272 3273 ptr_ftype_sizetype 3274 = build_function_type (ptr_type_node, 3275 tree_cons (NULL_TREE, 3276 size_type_node, 3277 void_list_node)); 3278 newtype = build_exception_variant 3279 (ptr_ftype_sizetype, add_exception_specifier 3280 (NULL_TREE, bad_alloc_type_node, -1)); 3281 deltype = build_exception_variant (void_ftype_ptr, empty_except_spec); 3282 push_cp_library_fn (NEW_EXPR, newtype); 3283 push_cp_library_fn (VEC_NEW_EXPR, newtype); 3284 global_delete_fndecl = push_cp_library_fn (DELETE_EXPR, deltype); 3285 push_cp_library_fn (VEC_DELETE_EXPR, deltype); 3286 } 3287 3288 abort_fndecl 3289 = build_library_fn_ptr ("__cxa_pure_virtual", void_ftype); 3290 3291 /* Perform other language dependent initializations. */ 3292 init_class_processing (); 3293 init_rtti_processing (); 3294 3295 if (flag_exceptions) 3296 init_exception_processing (); 3297 3298 if (! supports_one_only ()) 3299 flag_weak = 0; 3300 3301 make_fname_decl = cp_make_fname_decl; 3302 start_fname_decls (); 3303 3304 /* Show we use EH for cleanups. */ 3305 if (flag_exceptions) 3306 using_eh_for_cleanups (); 3307} 3308 3309/* Generate an initializer for a function naming variable from 3310 NAME. NAME may be NULL, to indicate a dependent name. TYPE_P is 3311 filled in with the type of the init. */ 3312 3313tree 3314cp_fname_init (const char* name, tree *type_p) 3315{ 3316 tree domain = NULL_TREE; 3317 tree type; 3318 tree init = NULL_TREE; 3319 size_t length = 0; 3320 3321 if (name) 3322 { 3323 length = strlen (name); 3324 domain = build_index_type (size_int (length)); 3325 init = build_string (length + 1, name); 3326 } 3327 3328 type = build_qualified_type (char_type_node, TYPE_QUAL_CONST); 3329 type = build_cplus_array_type (type, domain); 3330 3331 *type_p = type; 3332 3333 if (init) 3334 TREE_TYPE (init) = type; 3335 else 3336 init = error_mark_node; 3337 3338 return init; 3339} 3340 3341/* Create the VAR_DECL for __FUNCTION__ etc. ID is the name to give the 3342 decl, NAME is the initialization string and TYPE_DEP indicates whether 3343 NAME depended on the type of the function. We make use of that to detect 3344 __PRETTY_FUNCTION__ inside a template fn. This is being done 3345 lazily at the point of first use, so we mustn't push the decl now. */ 3346 3347static tree 3348cp_make_fname_decl (tree id, int type_dep) 3349{ 3350 const char *const name = (type_dep && processing_template_decl 3351 ? NULL : fname_as_string (type_dep)); 3352 tree type; 3353 tree init = cp_fname_init (name, &type); 3354 tree decl = build_decl (VAR_DECL, id, type); 3355 3356 if (name) 3357 free ((char *) name); 3358 3359 /* As we're using pushdecl_with_scope, we must set the context. */ 3360 DECL_CONTEXT (decl) = current_function_decl; 3361 DECL_PRETTY_FUNCTION_P (decl) = type_dep; 3362 3363 TREE_STATIC (decl) = 1; 3364 TREE_READONLY (decl) = 1; 3365 DECL_ARTIFICIAL (decl) = 1; 3366 3367 TREE_USED (decl) = 1; 3368 3369 if (current_function_decl) 3370 { 3371 struct cp_binding_level *b = current_binding_level; 3372 while (b->level_chain->kind != sk_function_parms) 3373 b = b->level_chain; 3374 pushdecl_with_scope (decl, b, /*is_friend=*/false); 3375 cp_finish_decl (decl, init, /*init_const_expr_p=*/false, NULL_TREE, 3376 LOOKUP_ONLYCONVERTING); 3377 } 3378 else 3379 pushdecl_top_level_and_finish (decl, init); 3380 3381 return decl; 3382} 3383 3384/* Make a definition for a builtin function named NAME in the current 3385 namespace, whose data type is TYPE and whose context is CONTEXT. 3386 TYPE should be a function type with argument types. 3387 3388 CLASS and CODE tell later passes how to compile calls to this function. 3389 See tree.h for possible values. 3390 3391 If LIBNAME is nonzero, use that for DECL_ASSEMBLER_NAME, 3392 the name to be called if we can't opencode the function. 3393 If ATTRS is nonzero, use that for the function's attribute 3394 list. */ 3395 3396static tree 3397builtin_function_1 (const char* name, 3398 tree type, 3399 tree context, 3400 enum built_in_function code, 3401 enum built_in_class class, 3402 const char* libname, 3403 tree attrs) 3404{ 3405 tree decl = build_library_fn_1 (get_identifier (name), ERROR_MARK, type); 3406 DECL_BUILT_IN_CLASS (decl) = class; 3407 DECL_FUNCTION_CODE (decl) = code; 3408 DECL_CONTEXT (decl) = context; 3409 3410 pushdecl (decl); 3411 3412 /* Since `pushdecl' relies on DECL_ASSEMBLER_NAME instead of DECL_NAME, 3413 we cannot change DECL_ASSEMBLER_NAME until we have installed this 3414 function in the namespace. */ 3415 if (libname) 3416 SET_DECL_ASSEMBLER_NAME (decl, get_identifier (libname)); 3417 3418 /* A function in the user's namespace should have an explicit 3419 declaration before it is used. Mark the built-in function as 3420 anticipated but not actually declared. */ 3421 if (name[0] != '_' || name[1] != '_') 3422 DECL_ANTICIPATED (decl) = 1; 3423 3424 /* Possibly apply some default attributes to this built-in function. */ 3425 if (attrs) 3426 decl_attributes (&decl, attrs, ATTR_FLAG_BUILT_IN); 3427 else 3428 decl_attributes (&decl, NULL_TREE, 0); 3429 3430 return decl; 3431} 3432 3433/* Entry point for the benefit of c_common_nodes_and_builtins. 3434 3435 Make a definition for a builtin function named NAME and whose data type 3436 is TYPE. TYPE should be a function type with argument types. This 3437 function places the anticipated declaration in the global namespace 3438 and additionally in the std namespace if appropriate. 3439 3440 CLASS and CODE tell later passes how to compile calls to this function. 3441 See tree.h for possible values. 3442 3443 If LIBNAME is nonzero, use that for DECL_ASSEMBLER_NAME, 3444 the name to be called if we can't opencode the function. 3445 3446 If ATTRS is nonzero, use that for the function's attribute 3447 list. */ 3448 3449tree 3450builtin_function (const char* name, 3451 tree type, 3452 int code, 3453 enum built_in_class cl, 3454 const char* libname, 3455 tree attrs) 3456{ 3457 /* All builtins that don't begin with an '_' should additionally 3458 go in the 'std' namespace. */ 3459 if (name[0] != '_') 3460 { 3461 push_namespace (std_identifier); 3462 builtin_function_1 (name, type, std_node, code, cl, libname, attrs); 3463 pop_namespace (); 3464 } 3465 3466 return builtin_function_1 (name, type, NULL_TREE, code, 3467 cl, libname, attrs); 3468} 3469 3470/* Generate a FUNCTION_DECL with the typical flags for a runtime library 3471 function. Not called directly. */ 3472 3473static tree 3474build_library_fn_1 (tree name, enum tree_code operator_code, tree type) 3475{ 3476 tree fn = build_lang_decl (FUNCTION_DECL, name, type); 3477 DECL_EXTERNAL (fn) = 1; 3478 TREE_PUBLIC (fn) = 1; 3479 DECL_ARTIFICIAL (fn) = 1; 3480 SET_OVERLOADED_OPERATOR_CODE (fn, operator_code); 3481 SET_DECL_LANGUAGE (fn, lang_c); 3482 /* Runtime library routines are, by definition, available in an 3483 external shared object. */ 3484 DECL_VISIBILITY (fn) = VISIBILITY_DEFAULT; 3485 DECL_VISIBILITY_SPECIFIED (fn) = 1; 3486 return fn; 3487} 3488 3489/* Returns the _DECL for a library function with C linkage. 3490 We assume that such functions never throw; if this is incorrect, 3491 callers should unset TREE_NOTHROW. */ 3492 3493tree 3494build_library_fn (tree name, tree type) 3495{ 3496 tree fn = build_library_fn_1 (name, ERROR_MARK, type); 3497 TREE_NOTHROW (fn) = 1; 3498 return fn; 3499} 3500 3501/* Returns the _DECL for a library function with C++ linkage. */ 3502 3503static tree 3504build_cp_library_fn (tree name, enum tree_code operator_code, tree type) 3505{ 3506 tree fn = build_library_fn_1 (name, operator_code, type); 3507 TREE_NOTHROW (fn) = TYPE_NOTHROW_P (type); 3508 DECL_CONTEXT (fn) = FROB_CONTEXT (current_namespace); 3509 SET_DECL_LANGUAGE (fn, lang_cplusplus); 3510 return fn; 3511} 3512 3513/* Like build_library_fn, but takes a C string instead of an 3514 IDENTIFIER_NODE. */ 3515 3516tree 3517build_library_fn_ptr (const char* name, tree type) 3518{ 3519 return build_library_fn (get_identifier (name), type); 3520} 3521 3522/* Like build_cp_library_fn, but takes a C string instead of an 3523 IDENTIFIER_NODE. */ 3524 3525tree 3526build_cp_library_fn_ptr (const char* name, tree type) 3527{ 3528 return build_cp_library_fn (get_identifier (name), ERROR_MARK, type); 3529} 3530 3531/* Like build_library_fn, but also pushes the function so that we will 3532 be able to find it via IDENTIFIER_GLOBAL_VALUE. */ 3533 3534tree 3535push_library_fn (tree name, tree type) 3536{ 3537 tree fn = build_library_fn (name, type); 3538 pushdecl_top_level (fn); 3539 return fn; 3540} 3541 3542/* Like build_cp_library_fn, but also pushes the function so that it 3543 will be found by normal lookup. */ 3544 3545static tree 3546push_cp_library_fn (enum tree_code operator_code, tree type) 3547{ 3548 tree fn = build_cp_library_fn (ansi_opname (operator_code), 3549 operator_code, 3550 type); 3551 pushdecl (fn); 3552 return fn; 3553} 3554 3555/* Like push_library_fn, but takes a TREE_LIST of parm types rather than 3556 a FUNCTION_TYPE. */ 3557 3558tree 3559push_void_library_fn (tree name, tree parmtypes) 3560{ 3561 tree type = build_function_type (void_type_node, parmtypes); 3562 return push_library_fn (name, type); 3563} 3564 3565/* Like push_library_fn, but also note that this function throws 3566 and does not return. Used for __throw_foo and the like. */ 3567 3568tree 3569push_throw_library_fn (tree name, tree type) 3570{ 3571 tree fn = push_library_fn (name, type); 3572 TREE_THIS_VOLATILE (fn) = 1; 3573 TREE_NOTHROW (fn) = 0; 3574 return fn; 3575} 3576 3577/* When we call finish_struct for an anonymous union, we create 3578 default copy constructors and such. But, an anonymous union 3579 shouldn't have such things; this function undoes the damage to the 3580 anonymous union type T. 3581 3582 (The reason that we create the synthesized methods is that we don't 3583 distinguish `union { int i; }' from `typedef union { int i; } U'. 3584 The first is an anonymous union; the second is just an ordinary 3585 union type.) */ 3586 3587void 3588fixup_anonymous_aggr (tree t) 3589{ 3590 tree *q; 3591 3592 /* Wipe out memory of synthesized methods. */ 3593 TYPE_HAS_CONSTRUCTOR (t) = 0; 3594 TYPE_HAS_DEFAULT_CONSTRUCTOR (t) = 0; 3595 TYPE_HAS_INIT_REF (t) = 0; 3596 TYPE_HAS_CONST_INIT_REF (t) = 0; 3597 TYPE_HAS_ASSIGN_REF (t) = 0; 3598 TYPE_HAS_CONST_ASSIGN_REF (t) = 0; 3599 3600 /* Splice the implicitly generated functions out of the TYPE_METHODS 3601 list. */ 3602 q = &TYPE_METHODS (t); 3603 while (*q) 3604 { 3605 if (DECL_ARTIFICIAL (*q)) 3606 *q = TREE_CHAIN (*q); 3607 else 3608 q = &TREE_CHAIN (*q); 3609 } 3610 3611 /* ISO C++ 9.5.3. Anonymous unions may not have function members. */ 3612 if (TYPE_METHODS (t)) 3613 error ("%Jan anonymous union cannot have function members", 3614 TYPE_MAIN_DECL (t)); 3615 3616 /* Anonymous aggregates cannot have fields with ctors, dtors or complex 3617 assignment operators (because they cannot have these methods themselves). 3618 For anonymous unions this is already checked because they are not allowed 3619 in any union, otherwise we have to check it. */ 3620 if (TREE_CODE (t) != UNION_TYPE) 3621 { 3622 tree field, type; 3623 3624 for (field = TYPE_FIELDS (t); field; field = TREE_CHAIN (field)) 3625 if (TREE_CODE (field) == FIELD_DECL) 3626 { 3627 type = TREE_TYPE (field); 3628 if (CLASS_TYPE_P (type)) 3629 { 3630 if (TYPE_NEEDS_CONSTRUCTING (type)) 3631 error ("member %q+#D with constructor not allowed " 3632 "in anonymous aggregate", field); 3633 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type)) 3634 error ("member %q+#D with destructor not allowed " 3635 "in anonymous aggregate", field); 3636 if (TYPE_HAS_COMPLEX_ASSIGN_REF (type)) 3637 error ("member %q+#D with copy assignment operator " 3638 "not allowed in anonymous aggregate", field); 3639 } 3640 } 3641 } 3642} 3643 3644/* Make sure that a declaration with no declarator is well-formed, i.e. 3645 just declares a tagged type or anonymous union. 3646 3647 Returns the type declared; or NULL_TREE if none. */ 3648 3649tree 3650check_tag_decl (cp_decl_specifier_seq *declspecs) 3651{ 3652 int saw_friend = declspecs->specs[(int)ds_friend] != 0; 3653 int saw_typedef = declspecs->specs[(int)ds_typedef] != 0; 3654 /* If a class, struct, or enum type is declared by the DECLSPECS 3655 (i.e, if a class-specifier, enum-specifier, or non-typename 3656 elaborated-type-specifier appears in the DECLSPECS), 3657 DECLARED_TYPE is set to the corresponding type. */ 3658 tree declared_type = NULL_TREE; 3659 bool error_p = false; 3660 3661 if (declspecs->multiple_types_p) 3662 error ("multiple types in one declaration"); 3663 else if (declspecs->redefined_builtin_type) 3664 { 3665 if (!in_system_header) 3666 pedwarn ("redeclaration of C++ built-in type %qT", 3667 declspecs->redefined_builtin_type); 3668 return NULL_TREE; 3669 } 3670 3671 if (declspecs->type 3672 && TYPE_P (declspecs->type) 3673 && ((TREE_CODE (declspecs->type) != TYPENAME_TYPE 3674 && IS_AGGR_TYPE (declspecs->type)) 3675 || TREE_CODE (declspecs->type) == ENUMERAL_TYPE)) 3676 declared_type = declspecs->type; 3677 else if (declspecs->type == error_mark_node) 3678 error_p = true; 3679 if (declared_type == NULL_TREE && ! saw_friend && !error_p) 3680 pedwarn ("declaration does not declare anything"); 3681 /* Check for an anonymous union. */ 3682 else if (declared_type && IS_AGGR_TYPE_CODE (TREE_CODE (declared_type)) 3683 && TYPE_ANONYMOUS_P (declared_type)) 3684 { 3685 /* 7/3 In a simple-declaration, the optional init-declarator-list 3686 can be omitted only when declaring a class (clause 9) or 3687 enumeration (7.2), that is, when the decl-specifier-seq contains 3688 either a class-specifier, an elaborated-type-specifier with 3689 a class-key (9.1), or an enum-specifier. In these cases and 3690 whenever a class-specifier or enum-specifier is present in the 3691 decl-specifier-seq, the identifiers in these specifiers are among 3692 the names being declared by the declaration (as class-name, 3693 enum-names, or enumerators, depending on the syntax). In such 3694 cases, and except for the declaration of an unnamed bit-field (9.6), 3695 the decl-specifier-seq shall introduce one or more names into the 3696 program, or shall redeclare a name introduced by a previous 3697 declaration. [Example: 3698 enum { }; // ill-formed 3699 typedef class { }; // ill-formed 3700 --end example] */ 3701 if (saw_typedef) 3702 { 3703 error ("missing type-name in typedef-declaration"); 3704 return NULL_TREE; 3705 } 3706 /* Anonymous unions are objects, so they can have specifiers. */; 3707 SET_ANON_AGGR_TYPE_P (declared_type); 3708 3709 if (TREE_CODE (declared_type) != UNION_TYPE && pedantic 3710 && !in_system_header) 3711 pedwarn ("ISO C++ prohibits anonymous structs"); 3712 } 3713 3714 else 3715 { 3716 if (declspecs->specs[(int)ds_inline] 3717 || declspecs->specs[(int)ds_virtual]) 3718 error ("%qs can only be specified for functions", 3719 declspecs->specs[(int)ds_inline] 3720 ? "inline" : "virtual"); 3721 else if (saw_friend 3722 && (!current_class_type 3723 || current_scope () != current_class_type)) 3724 error ("%<friend%> can only be specified inside a class"); 3725 else if (declspecs->specs[(int)ds_explicit]) 3726 error ("%<explicit%> can only be specified for constructors"); 3727 else if (declspecs->storage_class) 3728 error ("a storage class can only be specified for objects " 3729 "and functions"); 3730 else if (declspecs->specs[(int)ds_const] 3731 || declspecs->specs[(int)ds_volatile] 3732 || declspecs->specs[(int)ds_restrict] 3733 || declspecs->specs[(int)ds_thread]) 3734 error ("qualifiers can only be specified for objects " 3735 "and functions"); 3736 } 3737 3738 return declared_type; 3739} 3740 3741/* Called when a declaration is seen that contains no names to declare. 3742 If its type is a reference to a structure, union or enum inherited 3743 from a containing scope, shadow that tag name for the current scope 3744 with a forward reference. 3745 If its type defines a new named structure or union 3746 or defines an enum, it is valid but we need not do anything here. 3747 Otherwise, it is an error. 3748 3749 C++: may have to grok the declspecs to learn about static, 3750 complain for anonymous unions. 3751 3752 Returns the TYPE declared -- or NULL_TREE if none. */ 3753 3754tree 3755shadow_tag (cp_decl_specifier_seq *declspecs) 3756{ 3757 tree t = check_tag_decl (declspecs); 3758 3759 if (!t) 3760 return NULL_TREE; 3761 3762 if (declspecs->attributes) 3763 { 3764 warning (0, "attribute ignored in declaration of %q+#T", t); 3765 warning (0, "attribute for %q+#T must follow the %qs keyword", 3766 t, class_key_or_enum_as_string (t)); 3767 3768 } 3769 3770 if (maybe_process_partial_specialization (t) == error_mark_node) 3771 return NULL_TREE; 3772 3773 /* This is where the variables in an anonymous union are 3774 declared. An anonymous union declaration looks like: 3775 union { ... } ; 3776 because there is no declarator after the union, the parser 3777 sends that declaration here. */ 3778 if (ANON_AGGR_TYPE_P (t)) 3779 { 3780 fixup_anonymous_aggr (t); 3781 3782 if (TYPE_FIELDS (t)) 3783 { 3784 tree decl = grokdeclarator (/*declarator=*/NULL, 3785 declspecs, NORMAL, 0, NULL); 3786 finish_anon_union (decl); 3787 } 3788 } 3789 3790 return t; 3791} 3792 3793/* Decode a "typename", such as "int **", returning a ..._TYPE node. */ 3794 3795tree 3796groktypename (cp_decl_specifier_seq *type_specifiers, 3797 const cp_declarator *declarator) 3798{ 3799 tree attrs; 3800 tree type; 3801 attrs = type_specifiers->attributes; 3802 type_specifiers->attributes = NULL_TREE; 3803 type = grokdeclarator (declarator, type_specifiers, TYPENAME, 0, &attrs); 3804 if (attrs) 3805 cplus_decl_attributes (&type, attrs, 0); 3806 return type; 3807} 3808 3809/* Decode a declarator in an ordinary declaration or data definition. 3810 This is called as soon as the type information and variable name 3811 have been parsed, before parsing the initializer if any. 3812 Here we create the ..._DECL node, fill in its type, 3813 and put it on the list of decls for the current context. 3814 The ..._DECL node is returned as the value. 3815 3816 Exception: for arrays where the length is not specified, 3817 the type is left null, to be filled in by `cp_finish_decl'. 3818 3819 Function definitions do not come here; they go to start_function 3820 instead. However, external and forward declarations of functions 3821 do go through here. Structure field declarations are done by 3822 grokfield and not through here. */ 3823 3824tree 3825start_decl (const cp_declarator *declarator, 3826 cp_decl_specifier_seq *declspecs, 3827 int initialized, 3828 tree attributes, 3829 tree prefix_attributes, 3830 tree *pushed_scope_p) 3831{ 3832 tree decl; 3833 tree type, tem; 3834 tree context; 3835 bool was_public; 3836 3837 *pushed_scope_p = NULL_TREE; 3838 3839 /* An object declared as __attribute__((deprecated)) suppresses 3840 warnings of uses of other deprecated items. */ 3841 if (lookup_attribute ("deprecated", attributes)) 3842 deprecated_state = DEPRECATED_SUPPRESS; 3843 3844 attributes = chainon (attributes, prefix_attributes); 3845 3846 decl = grokdeclarator (declarator, declspecs, NORMAL, initialized, 3847 &attributes); 3848 3849 deprecated_state = DEPRECATED_NORMAL; 3850 3851 if (decl == NULL_TREE || TREE_CODE (decl) == VOID_TYPE 3852 || decl == error_mark_node) 3853 return error_mark_node; 3854 3855 type = TREE_TYPE (decl); 3856 3857 context = DECL_CONTEXT (decl); 3858 3859 if (context) 3860 { 3861 *pushed_scope_p = push_scope (context); 3862 3863 /* We are only interested in class contexts, later. */ 3864 if (TREE_CODE (context) == NAMESPACE_DECL) 3865 context = NULL_TREE; 3866 } 3867 3868 if (initialized) 3869 /* Is it valid for this decl to have an initializer at all? 3870 If not, set INITIALIZED to zero, which will indirectly 3871 tell `cp_finish_decl' to ignore the initializer once it is parsed. */ 3872 switch (TREE_CODE (decl)) 3873 { 3874 case TYPE_DECL: 3875 error ("typedef %qD is initialized (use __typeof__ instead)", decl); 3876 return error_mark_node; 3877 3878 case FUNCTION_DECL: 3879 error ("function %q#D is initialized like a variable", decl); 3880 return error_mark_node; 3881 3882 default: 3883 break; 3884 } 3885 3886 if (initialized) 3887 { 3888 if (! toplevel_bindings_p () 3889 && DECL_EXTERNAL (decl)) 3890 warning (0, "declaration of %q#D has %<extern%> and is initialized", 3891 decl); 3892 DECL_EXTERNAL (decl) = 0; 3893 if (toplevel_bindings_p ()) 3894 TREE_STATIC (decl) = 1; 3895 } 3896 3897 /* Set attributes here so if duplicate decl, will have proper attributes. */ 3898 cplus_decl_attributes (&decl, attributes, 0); 3899 3900 /* Dllimported symbols cannot be defined. Static data members (which 3901 can be initialized in-class and dllimported) go through grokfield, 3902 not here, so we don't need to exclude those decls when checking for 3903 a definition. */ 3904 if (initialized && DECL_DLLIMPORT_P (decl)) 3905 { 3906 error ("definition of %q#D is marked %<dllimport%>", decl); 3907 DECL_DLLIMPORT_P (decl) = 0; 3908 } 3909 3910 /* If #pragma weak was used, mark the decl weak now. */ 3911 maybe_apply_pragma_weak (decl); 3912 3913 if (TREE_CODE (decl) == FUNCTION_DECL 3914 && DECL_DECLARED_INLINE_P (decl) 3915 && DECL_UNINLINABLE (decl) 3916 && lookup_attribute ("noinline", DECL_ATTRIBUTES (decl))) 3917 warning (0, "inline function %q+D given attribute noinline", decl); 3918 3919 if (context && COMPLETE_TYPE_P (complete_type (context))) 3920 { 3921 if (TREE_CODE (decl) == VAR_DECL) 3922 { 3923 tree field = lookup_field (context, DECL_NAME (decl), 0, false); 3924 if (field == NULL_TREE || TREE_CODE (field) != VAR_DECL) 3925 error ("%q#D is not a static member of %q#T", decl, context); 3926 else 3927 { 3928 if (DECL_CONTEXT (field) != context) 3929 { 3930 if (!same_type_p (DECL_CONTEXT (field), context)) 3931 pedwarn ("ISO C++ does not permit %<%T::%D%> " 3932 "to be defined as %<%T::%D%>", 3933 DECL_CONTEXT (field), DECL_NAME (decl), 3934 context, DECL_NAME (decl)); 3935 DECL_CONTEXT (decl) = DECL_CONTEXT (field); 3936 } 3937 if (processing_specialization 3938 && template_class_depth (context) == 0 3939 && CLASSTYPE_TEMPLATE_SPECIALIZATION (context)) 3940 error ("template header not allowed in member definition " 3941 "of explicitly specialized class"); 3942 /* Static data member are tricky; an in-class initialization 3943 still doesn't provide a definition, so the in-class 3944 declaration will have DECL_EXTERNAL set, but will have an 3945 initialization. Thus, duplicate_decls won't warn 3946 about this situation, and so we check here. */ 3947 if (initialized && DECL_INITIALIZED_IN_CLASS_P (field)) 3948 error ("duplicate initialization of %qD", decl); 3949 if (duplicate_decls (decl, field, /*newdecl_is_friend=*/false)) 3950 decl = field; 3951 } 3952 } 3953 else 3954 { 3955 tree field = check_classfn (context, decl, 3956 (processing_template_decl 3957 > template_class_depth (context)) 3958 ? current_template_parms 3959 : NULL_TREE); 3960 if (field && duplicate_decls (decl, field, 3961 /*newdecl_is_friend=*/false)) 3962 decl = field; 3963 } 3964 3965 /* cp_finish_decl sets DECL_EXTERNAL if DECL_IN_AGGR_P is set. */ 3966 DECL_IN_AGGR_P (decl) = 0; 3967 /* Do not mark DECL as an explicit specialization if it was not 3968 already marked as an instantiation; a declaration should 3969 never be marked as a specialization unless we know what 3970 template is being specialized. */ 3971 if (DECL_LANG_SPECIFIC (decl) && DECL_USE_TEMPLATE (decl)) 3972 { 3973 SET_DECL_TEMPLATE_SPECIALIZATION (decl); 3974 3975 /* [temp.expl.spec] An explicit specialization of a static data 3976 member of a template is a definition if the declaration 3977 includes an initializer; otherwise, it is a declaration. 3978 3979 We check for processing_specialization so this only applies 3980 to the new specialization syntax. */ 3981 if (!initialized && processing_specialization) 3982 DECL_EXTERNAL (decl) = 1; 3983 } 3984 3985 if (DECL_EXTERNAL (decl) && ! DECL_TEMPLATE_SPECIALIZATION (decl)) 3986 pedwarn ("declaration of %q#D outside of class is not definition", 3987 decl); 3988 } 3989 3990 was_public = TREE_PUBLIC (decl); 3991 3992 /* Enter this declaration into the symbol table. */ 3993 tem = maybe_push_decl (decl); 3994 3995 if (processing_template_decl) 3996 tem = push_template_decl (tem); 3997 if (tem == error_mark_node) 3998 return error_mark_node; 3999 4000 /* Tell the back-end to use or not use .common as appropriate. If we say 4001 -fconserve-space, we want this to save .data space, at the expense of 4002 wrong semantics. If we say -fno-conserve-space, we want this to 4003 produce errors about redefs; to do this we force variables into the 4004 data segment. */ 4005 if (flag_conserve_space 4006 && TREE_CODE (tem) == VAR_DECL 4007 && TREE_PUBLIC (tem) 4008 && !DECL_THREAD_LOCAL_P (tem) 4009 && !have_global_bss_p ()) 4010 DECL_COMMON (tem) = 1; 4011 4012 if (TREE_CODE (tem) == VAR_DECL 4013 && DECL_NAMESPACE_SCOPE_P (tem) && !TREE_PUBLIC (tem) && !was_public 4014 && !DECL_THIS_STATIC (tem) && !DECL_ARTIFICIAL (tem)) 4015 { 4016 /* This is a const variable with implicit 'static'. Set 4017 DECL_THIS_STATIC so we can tell it from variables that are 4018 !TREE_PUBLIC because of the anonymous namespace. */ 4019 gcc_assert (cp_type_readonly (TREE_TYPE (tem))); 4020 DECL_THIS_STATIC (tem) = 1; 4021 } 4022 4023 if (!processing_template_decl && TREE_CODE (tem) == VAR_DECL) 4024 start_decl_1 (tem, initialized); 4025 4026 return tem; 4027} 4028 4029void 4030start_decl_1 (tree decl, bool initialized) 4031{ 4032 tree type; 4033 4034 gcc_assert (!processing_template_decl); 4035 4036 if (error_operand_p (decl)) 4037 return; 4038 4039 gcc_assert (TREE_CODE (decl) == VAR_DECL); 4040 type = TREE_TYPE (decl); 4041 4042 if (initialized) 4043 /* Is it valid for this decl to have an initializer at all? 4044 If not, set INITIALIZED to zero, which will indirectly 4045 tell `cp_finish_decl' to ignore the initializer once it is parsed. */ 4046 { 4047 /* Don't allow initializations for incomplete types except for 4048 arrays which might be completed by the initialization. */ 4049 if (COMPLETE_TYPE_P (complete_type (type))) 4050 ; /* A complete type is ok. */ 4051 else if (TREE_CODE (type) != ARRAY_TYPE) 4052 { 4053 error ("variable %q#D has initializer but incomplete type", decl); 4054 initialized = 0; 4055 type = TREE_TYPE (decl) = error_mark_node; 4056 } 4057 else if (!COMPLETE_TYPE_P (complete_type (TREE_TYPE (type)))) 4058 { 4059 if (DECL_LANG_SPECIFIC (decl) && DECL_TEMPLATE_INFO (decl)) 4060 error ("elements of array %q#D have incomplete type", decl); 4061 /* else we already gave an error in start_decl. */ 4062 initialized = 0; 4063 } 4064 } 4065 else if (IS_AGGR_TYPE (type) 4066 && ! DECL_EXTERNAL (decl)) 4067 { 4068 if (!COMPLETE_TYPE_P (complete_type (type))) 4069 { 4070 error ("aggregate %q#D has incomplete type and cannot be defined", 4071 decl); 4072 /* Change the type so that assemble_variable will give 4073 DECL an rtl we can live with: (mem (const_int 0)). */ 4074 type = TREE_TYPE (decl) = error_mark_node; 4075 } 4076 else 4077 { 4078 /* If any base type in the hierarchy of TYPE needs a constructor, 4079 then we set initialized to 1. This way any nodes which are 4080 created for the purposes of initializing this aggregate 4081 will live as long as it does. This is necessary for global 4082 aggregates which do not have their initializers processed until 4083 the end of the file. */ 4084 initialized = TYPE_NEEDS_CONSTRUCTING (type); 4085 } 4086 } 4087 4088 /* Create a new scope to hold this declaration if necessary. 4089 Whether or not a new scope is necessary cannot be determined 4090 until after the type has been completed; if the type is a 4091 specialization of a class template it is not until after 4092 instantiation has occurred that TYPE_HAS_NONTRIVIAL_DESTRUCTOR 4093 will be set correctly. */ 4094 maybe_push_cleanup_level (type); 4095} 4096 4097/* Handle initialization of references. DECL, TYPE, and INIT have the 4098 same meaning as in cp_finish_decl. *CLEANUP must be NULL on entry, 4099 but will be set to a new CLEANUP_STMT if a temporary is created 4100 that must be destroyed subsequently. 4101 4102 Returns an initializer expression to use to initialize DECL, or 4103 NULL if the initialization can be performed statically. 4104 4105 Quotes on semantics can be found in ARM 8.4.3. */ 4106 4107static tree 4108grok_reference_init (tree decl, tree type, tree init, tree *cleanup) 4109{ 4110 tree tmp; 4111 4112 if (init == NULL_TREE) 4113 { 4114 if ((DECL_LANG_SPECIFIC (decl) == 0 4115 || DECL_IN_AGGR_P (decl) == 0) 4116 && ! DECL_THIS_EXTERN (decl)) 4117 error ("%qD declared as reference but not initialized", decl); 4118 return NULL_TREE; 4119 } 4120 4121 if (TREE_CODE (init) == CONSTRUCTOR) 4122 { 4123 error ("ISO C++ forbids use of initializer list to " 4124 "initialize reference %qD", decl); 4125 return NULL_TREE; 4126 } 4127 4128 if (TREE_CODE (init) == TREE_LIST) 4129 init = build_x_compound_expr_from_list (init, "initializer"); 4130 4131 if (TREE_CODE (TREE_TYPE (type)) != ARRAY_TYPE 4132 && TREE_CODE (TREE_TYPE (init)) == ARRAY_TYPE) 4133 /* Note: default conversion is only called in very special cases. */ 4134 init = decay_conversion (init); 4135 4136 /* Convert INIT to the reference type TYPE. This may involve the 4137 creation of a temporary, whose lifetime must be the same as that 4138 of the reference. If so, a DECL_EXPR for the temporary will be 4139 added just after the DECL_EXPR for DECL. That's why we don't set 4140 DECL_INITIAL for local references (instead assigning to them 4141 explicitly); we need to allow the temporary to be initialized 4142 first. */ 4143 tmp = initialize_reference (type, init, decl, cleanup); 4144 4145 if (tmp == error_mark_node) 4146 return NULL_TREE; 4147 else if (tmp == NULL_TREE) 4148 { 4149 error ("cannot initialize %qT from %qT", type, TREE_TYPE (init)); 4150 return NULL_TREE; 4151 } 4152 4153 if (TREE_STATIC (decl) && !TREE_CONSTANT (tmp)) 4154 return tmp; 4155 4156 DECL_INITIAL (decl) = tmp; 4157 4158 return NULL_TREE; 4159} 4160 4161/* Designated initializers in arrays are not supported in GNU C++. 4162 The parser cannot detect this error since it does not know whether 4163 a given brace-enclosed initializer is for a class type or for an 4164 array. This function checks that CE does not use a designated 4165 initializer. If it does, an error is issued. Returns true if CE 4166 is valid, i.e., does not have a designated initializer. */ 4167 4168static bool 4169check_array_designated_initializer (const constructor_elt *ce) 4170{ 4171 /* Designated initializers for array elements arenot supported. */ 4172 if (ce->index) 4173 { 4174 /* The parser only allows identifiers as designated 4175 intializers. */ 4176 gcc_assert (TREE_CODE (ce->index) == IDENTIFIER_NODE); 4177 error ("name %qD used in a GNU-style designated " 4178 "initializer for an array", ce->index); 4179 return false; 4180 } 4181 4182 return true; 4183} 4184 4185/* When parsing `int a[] = {1, 2};' we don't know the size of the 4186 array until we finish parsing the initializer. If that's the 4187 situation we're in, update DECL accordingly. */ 4188 4189static void 4190maybe_deduce_size_from_array_init (tree decl, tree init) 4191{ 4192 tree type = TREE_TYPE (decl); 4193 4194 if (TREE_CODE (type) == ARRAY_TYPE 4195 && TYPE_DOMAIN (type) == NULL_TREE 4196 && TREE_CODE (decl) != TYPE_DECL) 4197 { 4198 /* do_default is really a C-ism to deal with tentative definitions. 4199 But let's leave it here to ease the eventual merge. */ 4200 int do_default = !DECL_EXTERNAL (decl); 4201 tree initializer = init ? init : DECL_INITIAL (decl); 4202 int failure = 0; 4203 4204 /* Check that there are no designated initializers in INIT, as 4205 those are not supported in GNU C++, and as the middle-end 4206 will crash if presented with a non-numeric designated 4207 initializer. */ 4208 if (initializer && TREE_CODE (initializer) == CONSTRUCTOR) 4209 { 4210 VEC(constructor_elt,gc) *v = CONSTRUCTOR_ELTS (initializer); 4211 constructor_elt *ce; 4212 HOST_WIDE_INT i; 4213 for (i = 0; 4214 VEC_iterate (constructor_elt, v, i, ce); 4215 ++i) 4216 if (!check_array_designated_initializer (ce)) 4217 failure = 1; 4218 } 4219 4220 if (!failure) 4221 { 4222 failure = cp_complete_array_type (&TREE_TYPE (decl), initializer, 4223 do_default); 4224 if (failure == 1) 4225 { 4226 error ("initializer fails to determine size of %qD", decl); 4227 TREE_TYPE (decl) = error_mark_node; 4228 } 4229 else if (failure == 2) 4230 { 4231 if (do_default) 4232 { 4233 error ("array size missing in %qD", decl); 4234 TREE_TYPE (decl) = error_mark_node; 4235 } 4236 /* If a `static' var's size isn't known, make it extern as 4237 well as static, so it does not get allocated. If it's not 4238 `static', then don't mark it extern; finish_incomplete_decl 4239 will give it a default size and it will get allocated. */ 4240 else if (!pedantic && TREE_STATIC (decl) && !TREE_PUBLIC (decl)) 4241 DECL_EXTERNAL (decl) = 1; 4242 } 4243 else if (failure == 3) 4244 { 4245 error ("zero-size array %qD", decl); 4246 TREE_TYPE (decl) = error_mark_node; 4247 } 4248 } 4249 4250 cp_apply_type_quals_to_decl (cp_type_quals (TREE_TYPE (decl)), decl); 4251 4252 layout_decl (decl, 0); 4253 } 4254} 4255 4256/* Set DECL_SIZE, DECL_ALIGN, etc. for DECL (a VAR_DECL), and issue 4257 any appropriate error messages regarding the layout. */ 4258 4259static void 4260layout_var_decl (tree decl) 4261{ 4262 tree type; 4263 4264 type = TREE_TYPE (decl); 4265 if (type == error_mark_node) 4266 return; 4267 4268 /* If we haven't already layed out this declaration, do so now. 4269 Note that we must not call complete type for an external object 4270 because it's type might involve templates that we are not 4271 supposed to instantiate yet. (And it's perfectly valid to say 4272 `extern X x' for some incomplete type `X'.) */ 4273 if (!DECL_EXTERNAL (decl)) 4274 complete_type (type); 4275 if (!DECL_SIZE (decl) 4276 && TREE_TYPE (decl) != error_mark_node 4277 && (COMPLETE_TYPE_P (type) 4278 || (TREE_CODE (type) == ARRAY_TYPE 4279 && !TYPE_DOMAIN (type) 4280 && COMPLETE_TYPE_P (TREE_TYPE (type))))) 4281 layout_decl (decl, 0); 4282 4283 if (!DECL_EXTERNAL (decl) && DECL_SIZE (decl) == NULL_TREE) 4284 { 4285 /* An automatic variable with an incomplete type: that is an error. 4286 Don't talk about array types here, since we took care of that 4287 message in grokdeclarator. */ 4288 error ("storage size of %qD isn't known", decl); 4289 TREE_TYPE (decl) = error_mark_node; 4290 } 4291#if 0 4292 /* Keep this code around in case we later want to control debug info 4293 based on whether a type is "used". (jason 1999-11-11) */ 4294 4295 else if (!DECL_EXTERNAL (decl) && IS_AGGR_TYPE (ttype)) 4296 /* Let debugger know it should output info for this type. */ 4297 note_debug_info_needed (ttype); 4298 4299 if (TREE_STATIC (decl) && DECL_CLASS_SCOPE_P (decl)) 4300 note_debug_info_needed (DECL_CONTEXT (decl)); 4301#endif 4302 4303 if ((DECL_EXTERNAL (decl) || TREE_STATIC (decl)) 4304 && DECL_SIZE (decl) != NULL_TREE 4305 && ! TREE_CONSTANT (DECL_SIZE (decl))) 4306 { 4307 if (TREE_CODE (DECL_SIZE (decl)) == INTEGER_CST) 4308 constant_expression_warning (DECL_SIZE (decl)); 4309 else 4310 error ("storage size of %qD isn't constant", decl); 4311 } 4312} 4313 4314/* If a local static variable is declared in an inline function, or if 4315 we have a weak definition, we must endeavor to create only one 4316 instance of the variable at link-time. */ 4317 4318static void 4319maybe_commonize_var (tree decl) 4320{ 4321 /* Static data in a function with comdat linkage also has comdat 4322 linkage. */ 4323 if (TREE_STATIC (decl) 4324 /* Don't mess with __FUNCTION__. */ 4325 && ! DECL_ARTIFICIAL (decl) 4326 && DECL_FUNCTION_SCOPE_P (decl) 4327 /* Unfortunately, import_export_decl has not always been called 4328 before the function is processed, so we cannot simply check 4329 DECL_COMDAT. */ 4330 && (DECL_COMDAT (DECL_CONTEXT (decl)) 4331 || ((DECL_DECLARED_INLINE_P (DECL_CONTEXT (decl)) 4332 || DECL_TEMPLATE_INSTANTIATION (DECL_CONTEXT (decl))) 4333 && TREE_PUBLIC (DECL_CONTEXT (decl))))) 4334 { 4335 if (flag_weak) 4336 { 4337 /* With weak symbols, we simply make the variable COMDAT; 4338 that will cause copies in multiple translations units to 4339 be merged. */ 4340 comdat_linkage (decl); 4341 } 4342 else 4343 { 4344 if (DECL_INITIAL (decl) == NULL_TREE 4345 || DECL_INITIAL (decl) == error_mark_node) 4346 { 4347 /* Without weak symbols, we can use COMMON to merge 4348 uninitialized variables. */ 4349 TREE_PUBLIC (decl) = 1; 4350 DECL_COMMON (decl) = 1; 4351 } 4352 else 4353 { 4354 /* While for initialized variables, we must use internal 4355 linkage -- which means that multiple copies will not 4356 be merged. */ 4357 TREE_PUBLIC (decl) = 0; 4358 DECL_COMMON (decl) = 0; 4359 warning (0, "sorry: semantics of inline function static " 4360 "data %q+#D are wrong (you'll wind up " 4361 "with multiple copies)", decl); 4362 warning (0, "%J you can work around this by removing " 4363 "the initializer", 4364 decl); 4365 } 4366 } 4367 } 4368 else if (DECL_LANG_SPECIFIC (decl) && DECL_COMDAT (decl)) 4369 /* Set it up again; we might have set DECL_INITIAL since the last 4370 time. */ 4371 comdat_linkage (decl); 4372} 4373 4374/* Issue an error message if DECL is an uninitialized const variable. */ 4375 4376static void 4377check_for_uninitialized_const_var (tree decl) 4378{ 4379 tree type = TREE_TYPE (decl); 4380 4381 /* ``Unless explicitly declared extern, a const object does not have 4382 external linkage and must be initialized. ($8.4; $12.1)'' ARM 4383 7.1.6 */ 4384 if (TREE_CODE (decl) == VAR_DECL 4385 && TREE_CODE (type) != REFERENCE_TYPE 4386 && CP_TYPE_CONST_P (type) 4387 && !TYPE_NEEDS_CONSTRUCTING (type) 4388 && !DECL_INITIAL (decl)) 4389 error ("uninitialized const %qD", decl); 4390} 4391 4392 4393/* Structure holding the current initializer being processed by reshape_init. 4394 CUR is a pointer to the current element being processed, END is a pointer 4395 after the last element present in the initializer. */ 4396typedef struct reshape_iterator_t 4397{ 4398 constructor_elt *cur; 4399 constructor_elt *end; 4400} reshape_iter; 4401 4402static tree reshape_init_r (tree, reshape_iter *, bool); 4403 4404/* FIELD is a FIELD_DECL or NULL. In the former case, the value 4405 returned is the next FIELD_DECL (possibly FIELD itself) that can be 4406 initialized. If there are no more such fields, the return value 4407 will be NULL. */ 4408 4409static tree 4410next_initializable_field (tree field) 4411{ 4412 while (field 4413 && (TREE_CODE (field) != FIELD_DECL 4414 || (DECL_C_BIT_FIELD (field) && !DECL_NAME (field)) 4415 || DECL_ARTIFICIAL (field))) 4416 field = TREE_CHAIN (field); 4417 4418 return field; 4419} 4420 4421/* Subroutine of reshape_init_array and reshape_init_vector, which does 4422 the actual work. ELT_TYPE is the element type of the array. MAX_INDEX is an 4423 INTEGER_CST representing the size of the array minus one (the maximum index), 4424 or NULL_TREE if the array was declared without specifying the size. D is 4425 the iterator within the constructor. */ 4426 4427static tree 4428reshape_init_array_1 (tree elt_type, tree max_index, reshape_iter *d) 4429{ 4430 tree new_init; 4431 bool sized_array_p = (max_index != NULL_TREE); 4432 unsigned HOST_WIDE_INT max_index_cst = 0; 4433 unsigned HOST_WIDE_INT index; 4434 4435 /* The initializer for an array is always a CONSTRUCTOR. */ 4436 new_init = build_constructor (NULL_TREE, NULL); 4437 4438 if (sized_array_p) 4439 { 4440 /* Minus 1 is used for zero sized arrays. */ 4441 if (integer_all_onesp (max_index)) 4442 return new_init; 4443 4444 if (host_integerp (max_index, 1)) 4445 max_index_cst = tree_low_cst (max_index, 1); 4446 /* sizetype is sign extended, not zero extended. */ 4447 else 4448 max_index_cst = tree_low_cst (fold_convert (size_type_node, max_index), 4449 1); 4450 } 4451 4452 /* Loop until there are no more initializers. */ 4453 for (index = 0; 4454 d->cur != d->end && (!sized_array_p || index <= max_index_cst); 4455 ++index) 4456 { 4457 tree elt_init; 4458 4459 check_array_designated_initializer (d->cur); 4460 elt_init = reshape_init_r (elt_type, d, /*first_initializer_p=*/false); 4461 if (elt_init == error_mark_node) 4462 return error_mark_node; 4463 CONSTRUCTOR_APPEND_ELT (CONSTRUCTOR_ELTS (new_init), NULL_TREE, elt_init); 4464 } 4465 4466 return new_init; 4467} 4468 4469/* Subroutine of reshape_init_r, processes the initializers for arrays. 4470 Parameters are the same of reshape_init_r. */ 4471 4472static tree 4473reshape_init_array (tree type, reshape_iter *d) 4474{ 4475 tree max_index = NULL_TREE; 4476 4477 gcc_assert (TREE_CODE (type) == ARRAY_TYPE); 4478 4479 if (TYPE_DOMAIN (type)) 4480 max_index = array_type_nelts (type); 4481 4482 return reshape_init_array_1 (TREE_TYPE (type), max_index, d); 4483} 4484 4485/* Subroutine of reshape_init_r, processes the initializers for vectors. 4486 Parameters are the same of reshape_init_r. */ 4487 4488static tree 4489reshape_init_vector (tree type, reshape_iter *d) 4490{ 4491 tree max_index = NULL_TREE; 4492 tree rtype; 4493 4494 gcc_assert (TREE_CODE (type) == VECTOR_TYPE); 4495 4496 if (COMPOUND_LITERAL_P (d->cur->value)) 4497 { 4498 tree value = d->cur->value; 4499 if (!same_type_p (TREE_TYPE (value), type)) 4500 { 4501 error ("invalid type %qT as initializer for a vector of type %qT", 4502 TREE_TYPE (d->cur->value), type); 4503 value = error_mark_node; 4504 } 4505 ++d->cur; 4506 return value; 4507 } 4508 4509 /* For a vector, the representation type is a struct 4510 containing a single member which is an array of the 4511 appropriate size. */ 4512 rtype = TYPE_DEBUG_REPRESENTATION_TYPE (type); 4513 if (rtype && TYPE_DOMAIN (TREE_TYPE (TYPE_FIELDS (rtype)))) 4514 max_index = array_type_nelts (TREE_TYPE (TYPE_FIELDS (rtype))); 4515 4516 return reshape_init_array_1 (TREE_TYPE (type), max_index, d); 4517} 4518 4519/* Subroutine of reshape_init_r, processes the initializers for classes 4520 or union. Parameters are the same of reshape_init_r. */ 4521 4522static tree 4523reshape_init_class (tree type, reshape_iter *d, bool first_initializer_p) 4524{ 4525 tree field; 4526 tree new_init; 4527 4528 gcc_assert (CLASS_TYPE_P (type)); 4529 4530 /* The initializer for a class is always a CONSTRUCTOR. */ 4531 new_init = build_constructor (NULL_TREE, NULL); 4532 field = next_initializable_field (TYPE_FIELDS (type)); 4533 4534 if (!field) 4535 { 4536 /* [dcl.init.aggr] 4537 4538 An initializer for an aggregate member that is an 4539 empty class shall have the form of an empty 4540 initializer-list {}. */ 4541 if (!first_initializer_p) 4542 { 4543 error ("initializer for %qT must be brace-enclosed", type); 4544 return error_mark_node; 4545 } 4546 return new_init; 4547 } 4548 4549 /* Loop through the initializable fields, gathering initializers. */ 4550 while (d->cur != d->end) 4551 { 4552 tree field_init; 4553 4554 /* Handle designated initializers, as an extension. */ 4555 if (d->cur->index) 4556 { 4557 field = lookup_field_1 (type, d->cur->index, /*want_type=*/false); 4558 4559 if (!field || TREE_CODE (field) != FIELD_DECL) 4560 { 4561 error ("%qT has no non-static data member named %qD", type, 4562 d->cur->index); 4563 return error_mark_node; 4564 } 4565 } 4566 4567 /* If we processed all the member of the class, we are done. */ 4568 if (!field) 4569 break; 4570 4571 field_init = reshape_init_r (TREE_TYPE (field), d, 4572 /*first_initializer_p=*/false); 4573 CONSTRUCTOR_APPEND_ELT (CONSTRUCTOR_ELTS (new_init), field, field_init); 4574 4575 /* [dcl.init.aggr] 4576 4577 When a union is initialized with a brace-enclosed 4578 initializer, the braces shall only contain an 4579 initializer for the first member of the union. */ 4580 if (TREE_CODE (type) == UNION_TYPE) 4581 break; 4582 4583 field = next_initializable_field (TREE_CHAIN (field)); 4584 } 4585 4586 return new_init; 4587} 4588 4589/* Subroutine of reshape_init, which processes a single initializer (part of 4590 a CONSTRUCTOR). TYPE is the type of the variable being initialized, D is the 4591 iterator within the CONSTRUCTOR which points to the initializer to process. 4592 FIRST_INITIALIZER_P is true if this is the first initializer of the 4593 CONSTRUCTOR node. */ 4594 4595static tree 4596reshape_init_r (tree type, reshape_iter *d, bool first_initializer_p) 4597{ 4598 tree init = d->cur->value; 4599 4600 /* A non-aggregate type is always initialized with a single 4601 initializer. */ 4602 if (!CP_AGGREGATE_TYPE_P (type)) 4603 { 4604 /* It is invalid to initialize a non-aggregate type with a 4605 brace-enclosed initializer. 4606 We need to check for BRACE_ENCLOSED_INITIALIZER_P here because 4607 of g++.old-deja/g++.mike/p7626.C: a pointer-to-member constant is 4608 a CONSTRUCTOR (with a record type). */ 4609 if (TREE_CODE (init) == CONSTRUCTOR 4610 && BRACE_ENCLOSED_INITIALIZER_P (init)) /* p7626.C */ 4611 { 4612 error ("braces around scalar initializer for type %qT", type); 4613 init = error_mark_node; 4614 } 4615 4616 d->cur++; 4617 return init; 4618 } 4619 4620 /* [dcl.init.aggr] 4621 4622 All implicit type conversions (clause _conv_) are considered when 4623 initializing the aggregate member with an initializer from an 4624 initializer-list. If the initializer can initialize a member, 4625 the member is initialized. Otherwise, if the member is itself a 4626 non-empty subaggregate, brace elision is assumed and the 4627 initializer is considered for the initialization of the first 4628 member of the subaggregate. */ 4629 if (TREE_CODE (init) != CONSTRUCTOR 4630 && can_convert_arg (type, TREE_TYPE (init), init, LOOKUP_NORMAL)) 4631 { 4632 d->cur++; 4633 return init; 4634 } 4635 4636 /* [dcl.init.string] 4637 4638 A char array (whether plain char, signed char, or unsigned char) 4639 can be initialized by a string-literal (optionally enclosed in 4640 braces); a wchar_t array can be initialized by a wide 4641 string-literal (optionally enclosed in braces). */ 4642 if (TREE_CODE (type) == ARRAY_TYPE 4643 && char_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (type)))) 4644 { 4645 tree str_init = init; 4646 4647 /* Strip one level of braces if and only if they enclose a single 4648 element (as allowed by [dcl.init.string]). */ 4649 if (!first_initializer_p 4650 && TREE_CODE (str_init) == CONSTRUCTOR 4651 && VEC_length (constructor_elt, CONSTRUCTOR_ELTS (str_init)) == 1) 4652 { 4653 str_init = VEC_index (constructor_elt, 4654 CONSTRUCTOR_ELTS (str_init), 0)->value; 4655 } 4656 4657 /* If it's a string literal, then it's the initializer for the array 4658 as a whole. Otherwise, continue with normal initialization for 4659 array types (one value per array element). */ 4660 if (TREE_CODE (str_init) == STRING_CST) 4661 { 4662 d->cur++; 4663 return str_init; 4664 } 4665 } 4666 4667 /* The following cases are about aggregates. If we are not within a full 4668 initializer already, and there is not a CONSTRUCTOR, it means that there 4669 is a missing set of braces (that is, we are processing the case for 4670 which reshape_init exists). */ 4671 if (!first_initializer_p) 4672 { 4673 if (TREE_CODE (init) == CONSTRUCTOR) 4674 { 4675 if (TREE_TYPE (init) && TYPE_PTRMEMFUNC_P (TREE_TYPE (init))) 4676 /* There is no need to reshape pointer-to-member function 4677 initializers, as they are always constructed correctly 4678 by the front end. */ 4679 ; 4680 else if (COMPOUND_LITERAL_P (init)) 4681 /* For a nested compound literal, there is no need to reshape since 4682 brace elision is not allowed. Even if we decided to allow it, 4683 we should add a call to reshape_init in finish_compound_literal, 4684 before calling digest_init, so changing this code would still 4685 not be necessary. */ 4686 gcc_assert (!BRACE_ENCLOSED_INITIALIZER_P (init)); 4687 else 4688 { 4689 ++d->cur; 4690 gcc_assert (BRACE_ENCLOSED_INITIALIZER_P (init)); 4691 return reshape_init (type, init); 4692 } 4693 } 4694 4695 warning (OPT_Wmissing_braces, "missing braces around initializer for %qT", 4696 type); 4697 } 4698 4699 /* Dispatch to specialized routines. */ 4700 if (CLASS_TYPE_P (type)) 4701 return reshape_init_class (type, d, first_initializer_p); 4702 else if (TREE_CODE (type) == ARRAY_TYPE) 4703 return reshape_init_array (type, d); 4704 else if (TREE_CODE (type) == VECTOR_TYPE) 4705 return reshape_init_vector (type, d); 4706 else 4707 gcc_unreachable(); 4708} 4709 4710/* Undo the brace-elision allowed by [dcl.init.aggr] in a 4711 brace-enclosed aggregate initializer. 4712 4713 INIT is the CONSTRUCTOR containing the list of initializers describing 4714 a brace-enclosed initializer for an entity of the indicated aggregate TYPE. 4715 It may not presently match the shape of the TYPE; for example: 4716 4717 struct S { int a; int b; }; 4718 struct S a[] = { 1, 2, 3, 4 }; 4719 4720 Here INIT will hold a VEC of four elements, rather than a 4721 VEC of two elements, each itself a VEC of two elements. This 4722 routine transforms INIT from the former form into the latter. The 4723 revised CONSTRUCTOR node is returned. */ 4724 4725tree 4726reshape_init (tree type, tree init) 4727{ 4728 VEC(constructor_elt, gc) *v; 4729 reshape_iter d; 4730 tree new_init; 4731 4732 gcc_assert (BRACE_ENCLOSED_INITIALIZER_P (init)); 4733 4734 v = CONSTRUCTOR_ELTS (init); 4735 4736 /* An empty constructor does not need reshaping, and it is always a valid 4737 initializer. */ 4738 if (VEC_empty (constructor_elt, v)) 4739 return init; 4740 4741 /* Recurse on this CONSTRUCTOR. */ 4742 d.cur = VEC_index (constructor_elt, v, 0); 4743 d.end = d.cur + VEC_length (constructor_elt, v); 4744 4745 new_init = reshape_init_r (type, &d, true); 4746 if (new_init == error_mark_node) 4747 return error_mark_node; 4748 4749 /* Make sure all the element of the constructor were used. Otherwise, 4750 issue an error about exceeding initializers. */ 4751 if (d.cur != d.end) 4752 error ("too many initializers for %qT", type); 4753 4754 return new_init; 4755} 4756 4757/* Verify INIT (the initializer for DECL), and record the 4758 initialization in DECL_INITIAL, if appropriate. CLEANUP is as for 4759 grok_reference_init. 4760 4761 If the return value is non-NULL, it is an expression that must be 4762 evaluated dynamically to initialize DECL. */ 4763 4764static tree 4765check_initializer (tree decl, tree init, int flags, tree *cleanup) 4766{ 4767 tree type = TREE_TYPE (decl); 4768 tree init_code = NULL; 4769 4770 /* Things that are going to be initialized need to have complete 4771 type. */ 4772 TREE_TYPE (decl) = type = complete_type (TREE_TYPE (decl)); 4773 4774 if (type == error_mark_node) 4775 /* We will have already complained. */ 4776 return NULL_TREE; 4777 4778 if (TREE_CODE (type) == ARRAY_TYPE) 4779 { 4780 tree element_type = TREE_TYPE (type); 4781 4782 /* The array type itself need not be complete, because the 4783 initializer may tell us how many elements are in the array. 4784 But, the elements of the array must be complete. */ 4785 if (!COMPLETE_TYPE_P (complete_type (element_type))) 4786 { 4787 error ("elements of array %q#D have incomplete type", decl); 4788 return NULL_TREE; 4789 } 4790 /* It is not valid to initialize an a VLA. */ 4791 if (init 4792 && ((COMPLETE_TYPE_P (type) && !TREE_CONSTANT (TYPE_SIZE (type))) 4793 || !TREE_CONSTANT (TYPE_SIZE (element_type)))) 4794 { 4795 error ("variable-sized object %qD may not be initialized", decl); 4796 return NULL_TREE; 4797 } 4798 } 4799 else if (!COMPLETE_TYPE_P (type)) 4800 { 4801 error ("%qD has incomplete type", decl); 4802 TREE_TYPE (decl) = error_mark_node; 4803 return NULL_TREE; 4804 } 4805 else 4806 /* There is no way to make a variable-sized class type in GNU C++. */ 4807 gcc_assert (TREE_CONSTANT (TYPE_SIZE (type))); 4808 4809 if (!CP_AGGREGATE_TYPE_P (type) 4810 && init && BRACE_ENCLOSED_INITIALIZER_P (init) 4811 && VEC_length (constructor_elt, CONSTRUCTOR_ELTS (init)) != 1) 4812 { 4813 error ("scalar object %qD requires one element in initializer", decl); 4814 TREE_TYPE (decl) = error_mark_node; 4815 return NULL_TREE; 4816 } 4817 4818 if (TREE_CODE (decl) == CONST_DECL) 4819 { 4820 gcc_assert (TREE_CODE (type) != REFERENCE_TYPE); 4821 4822 DECL_INITIAL (decl) = init; 4823 4824 gcc_assert (init != NULL_TREE); 4825 init = NULL_TREE; 4826 } 4827 else if (!DECL_EXTERNAL (decl) && TREE_CODE (type) == REFERENCE_TYPE) 4828 init = grok_reference_init (decl, type, init, cleanup); 4829 else if (init) 4830 { 4831 /* Do not reshape constructors of vectors (they don't need to be 4832 reshaped. */ 4833 if (TREE_CODE (init) == CONSTRUCTOR 4834 && !COMPOUND_LITERAL_P (init) 4835 && !TREE_TYPE (init)) /* ptrmemfunc */ 4836 { 4837 init = reshape_init (type, init); 4838 4839 if ((*targetm.vector_opaque_p) (type)) 4840 { 4841 error ("opaque vector types cannot be initialized"); 4842 init = error_mark_node; 4843 } 4844 } 4845 4846 /* If DECL has an array type without a specific bound, deduce the 4847 array size from the initializer. */ 4848 maybe_deduce_size_from_array_init (decl, init); 4849 type = TREE_TYPE (decl); 4850 if (type == error_mark_node) 4851 return NULL_TREE; 4852 4853 if (TYPE_HAS_CONSTRUCTOR (type) || TYPE_NEEDS_CONSTRUCTING (type)) 4854 { 4855 if (TREE_CODE (type) == ARRAY_TYPE) 4856 goto initialize_aggr; 4857 else if (TREE_CODE (init) == CONSTRUCTOR) 4858 { 4859 if (TYPE_NON_AGGREGATE_CLASS (type)) 4860 { 4861 error ("%qD must be initialized by constructor, " 4862 "not by %<{...}%>", 4863 decl); 4864 init = error_mark_node; 4865 } 4866 else 4867 goto dont_use_constructor; 4868 } 4869 else 4870 { 4871 int saved_stmts_are_full_exprs_p; 4872 4873 initialize_aggr: 4874 saved_stmts_are_full_exprs_p = 0; 4875 if (building_stmt_tree ()) 4876 { 4877 saved_stmts_are_full_exprs_p = stmts_are_full_exprs_p (); 4878 current_stmt_tree ()->stmts_are_full_exprs_p = 1; 4879 } 4880 init = build_aggr_init (decl, init, flags); 4881 if (building_stmt_tree ()) 4882 current_stmt_tree ()->stmts_are_full_exprs_p = 4883 saved_stmts_are_full_exprs_p; 4884 return init; 4885 } 4886 } 4887 else 4888 { 4889 dont_use_constructor: 4890 if (TREE_CODE (init) != TREE_VEC) 4891 { 4892 init_code = store_init_value (decl, init); 4893 if (pedantic && TREE_CODE (type) == ARRAY_TYPE 4894 && DECL_INITIAL (decl) 4895 && TREE_CODE (DECL_INITIAL (decl)) == STRING_CST 4896 && PAREN_STRING_LITERAL_P (DECL_INITIAL (decl))) 4897 warning (0, "array %qD initialized by parenthesized string literal %qE", 4898 decl, DECL_INITIAL (decl)); 4899 init = NULL; 4900 } 4901 } 4902 } 4903 else if (DECL_EXTERNAL (decl)) 4904 ; 4905 else if (TYPE_P (type) && TYPE_NEEDS_CONSTRUCTING (type)) 4906 goto initialize_aggr; 4907 else if (IS_AGGR_TYPE (type)) 4908 { 4909 tree core_type = strip_array_types (type); 4910 4911 if (CLASSTYPE_READONLY_FIELDS_NEED_INIT (core_type)) 4912 error ("structure %qD with uninitialized const members", decl); 4913 if (CLASSTYPE_REF_FIELDS_NEED_INIT (core_type)) 4914 error ("structure %qD with uninitialized reference members", decl); 4915 4916 check_for_uninitialized_const_var (decl); 4917 } 4918 else 4919 check_for_uninitialized_const_var (decl); 4920 4921 if (init && init != error_mark_node) 4922 init_code = build2 (INIT_EXPR, type, decl, init); 4923 4924 return init_code; 4925} 4926 4927/* If DECL is not a local variable, give it RTL. */ 4928 4929static void 4930make_rtl_for_nonlocal_decl (tree decl, tree init, const char* asmspec) 4931{ 4932 int toplev = toplevel_bindings_p (); 4933 int defer_p; 4934 const char *filename; 4935 4936 /* Set the DECL_ASSEMBLER_NAME for the object. */ 4937 if (asmspec) 4938 { 4939 /* The `register' keyword, when used together with an 4940 asm-specification, indicates that the variable should be 4941 placed in a particular register. */ 4942 if (TREE_CODE (decl) == VAR_DECL && DECL_REGISTER (decl)) 4943 { 4944 set_user_assembler_name (decl, asmspec); 4945 DECL_HARD_REGISTER (decl) = 1; 4946 } 4947 else 4948 { 4949 if (TREE_CODE (decl) == FUNCTION_DECL 4950 && DECL_BUILT_IN_CLASS (decl) == BUILT_IN_NORMAL) 4951 set_builtin_user_assembler_name (decl, asmspec); 4952 set_user_assembler_name (decl, asmspec); 4953 } 4954 } 4955 4956 /* Handle non-variables up front. */ 4957 if (TREE_CODE (decl) != VAR_DECL) 4958 { 4959 rest_of_decl_compilation (decl, toplev, at_eof); 4960 return; 4961 } 4962 4963 /* If we see a class member here, it should be a static data 4964 member. */ 4965 if (DECL_LANG_SPECIFIC (decl) && DECL_IN_AGGR_P (decl)) 4966 { 4967 gcc_assert (TREE_STATIC (decl)); 4968 /* An in-class declaration of a static data member should be 4969 external; it is only a declaration, and not a definition. */ 4970 if (init == NULL_TREE) 4971 gcc_assert (DECL_EXTERNAL (decl) || !TREE_PUBLIC (decl)); 4972 } 4973 4974 /* We don't create any RTL for local variables. */ 4975 if (DECL_FUNCTION_SCOPE_P (decl) && !TREE_STATIC (decl)) 4976 return; 4977 4978 /* We defer emission of local statics until the corresponding 4979 DECL_EXPR is expanded. */ 4980 defer_p = DECL_FUNCTION_SCOPE_P (decl) || DECL_VIRTUAL_P (decl); 4981 4982 /* We try to defer namespace-scope static constants so that they are 4983 not emitted into the object file unnecessarily. */ 4984 filename = input_filename; 4985 if (!DECL_VIRTUAL_P (decl) 4986 && TREE_READONLY (decl) 4987 && DECL_INITIAL (decl) != NULL_TREE 4988 && DECL_INITIAL (decl) != error_mark_node 4989 && filename != NULL 4990 && ! EMPTY_CONSTRUCTOR_P (DECL_INITIAL (decl)) 4991 && toplev 4992 && !TREE_PUBLIC (decl)) 4993 { 4994 /* Fool with the linkage of static consts according to #pragma 4995 interface. */ 4996 struct c_fileinfo *finfo = get_fileinfo (filename); 4997 if (!finfo->interface_unknown && !TREE_PUBLIC (decl)) 4998 { 4999 TREE_PUBLIC (decl) = 1; 5000 DECL_EXTERNAL (decl) = finfo->interface_only; 5001 } 5002 5003 defer_p = 1; 5004 } 5005 /* Likewise for template instantiations. */ 5006 else if (DECL_LANG_SPECIFIC (decl) 5007 && DECL_IMPLICIT_INSTANTIATION (decl)) 5008 defer_p = 1; 5009 5010 /* If we're not deferring, go ahead and assemble the variable. */ 5011 if (!defer_p) 5012 rest_of_decl_compilation (decl, toplev, at_eof); 5013} 5014 5015/* Generate code to initialize DECL (a local variable). */ 5016 5017static void 5018initialize_local_var (tree decl, tree init) 5019{ 5020 tree type = TREE_TYPE (decl); 5021 tree cleanup; 5022 5023 gcc_assert (TREE_CODE (decl) == VAR_DECL 5024 || TREE_CODE (decl) == RESULT_DECL); 5025 gcc_assert (!TREE_STATIC (decl)); 5026 5027 if (DECL_SIZE (decl) == NULL_TREE) 5028 { 5029 /* If we used it already as memory, it must stay in memory. */ 5030 DECL_INITIAL (decl) = NULL_TREE; 5031 TREE_ADDRESSABLE (decl) = TREE_USED (decl); 5032 } 5033 5034 if (DECL_SIZE (decl) && type != error_mark_node) 5035 { 5036 int already_used; 5037 5038 /* Compute and store the initial value. */ 5039 already_used = TREE_USED (decl) || TREE_USED (type); 5040 5041 /* Perform the initialization. */ 5042 if (init) 5043 { 5044 int saved_stmts_are_full_exprs_p; 5045 5046 gcc_assert (building_stmt_tree ()); 5047 saved_stmts_are_full_exprs_p = stmts_are_full_exprs_p (); 5048 current_stmt_tree ()->stmts_are_full_exprs_p = 1; 5049 finish_expr_stmt (init); 5050 current_stmt_tree ()->stmts_are_full_exprs_p = 5051 saved_stmts_are_full_exprs_p; 5052 } 5053 5054 /* Set this to 0 so we can tell whether an aggregate which was 5055 initialized was ever used. Don't do this if it has a 5056 destructor, so we don't complain about the 'resource 5057 allocation is initialization' idiom. Now set 5058 attribute((unused)) on types so decls of that type will be 5059 marked used. (see TREE_USED, above.) */ 5060 if (TYPE_NEEDS_CONSTRUCTING (type) 5061 && ! already_used 5062 && TYPE_HAS_TRIVIAL_DESTRUCTOR (type) 5063 && DECL_NAME (decl)) 5064 TREE_USED (decl) = 0; 5065 else if (already_used) 5066 TREE_USED (decl) = 1; 5067 } 5068 5069 /* Generate a cleanup, if necessary. */ 5070 cleanup = cxx_maybe_build_cleanup (decl); 5071 if (DECL_SIZE (decl) && cleanup) 5072 finish_decl_cleanup (decl, cleanup); 5073} 5074 5075/* DECL is a VAR_DECL for a compiler-generated variable with static 5076 storage duration (like a virtual table) whose initializer is a 5077 compile-time constant. INIT must be either a TREE_LIST of values, 5078 or a CONSTRUCTOR. Initialize the variable and provide it to the 5079 back end. */ 5080 5081void 5082initialize_artificial_var (tree decl, tree init) 5083{ 5084 gcc_assert (DECL_ARTIFICIAL (decl)); 5085 if (TREE_CODE (init) == TREE_LIST) 5086 init = build_constructor_from_list (NULL_TREE, init); 5087 gcc_assert (TREE_CODE (init) == CONSTRUCTOR); 5088 DECL_INITIAL (decl) = init; 5089 DECL_INITIALIZED_P (decl) = 1; 5090 determine_visibility (decl); 5091 layout_var_decl (decl); 5092 maybe_commonize_var (decl); 5093 make_rtl_for_nonlocal_decl (decl, init, /*asmspec=*/NULL); 5094} 5095 5096/* INIT is the initializer for a variable, as represented by the 5097 parser. Returns true iff INIT is value-dependent. */ 5098 5099static bool 5100value_dependent_init_p (tree init) 5101{ 5102 if (TREE_CODE (init) == TREE_LIST) 5103 /* A parenthesized initializer, e.g.: int i (3, 2); ? */ 5104 return any_value_dependent_elements_p (init); 5105 else if (TREE_CODE (init) == CONSTRUCTOR) 5106 /* A brace-enclosed initializer, e.g.: int i = { 3 }; ? */ 5107 { 5108 VEC(constructor_elt, gc) *elts; 5109 size_t nelts; 5110 size_t i; 5111 5112 elts = CONSTRUCTOR_ELTS (init); 5113 nelts = VEC_length (constructor_elt, elts); 5114 for (i = 0; i < nelts; ++i) 5115 if (value_dependent_init_p (VEC_index (constructor_elt, 5116 elts, i)->value)) 5117 return true; 5118 } 5119 else 5120 /* It must be a simple expression, e.g., int i = 3; */ 5121 return value_dependent_expression_p (init); 5122 5123 return false; 5124} 5125 5126/* Finish processing of a declaration; 5127 install its line number and initial value. 5128 If the length of an array type is not known before, 5129 it must be determined now, from the initial value, or it is an error. 5130 5131 INIT is the initializer (if any) for DECL. If INIT_CONST_EXPR_P is 5132 true, then INIT is an integral constant expression. 5133 5134 FLAGS is LOOKUP_ONLYCONVERTING if the = init syntax was used, else 0 5135 if the (init) syntax was used. */ 5136 5137void 5138cp_finish_decl (tree decl, tree init, bool init_const_expr_p, 5139 tree asmspec_tree, int flags) 5140{ 5141 tree type; 5142 tree cleanup; 5143 const char *asmspec = NULL; 5144 int was_readonly = 0; 5145 bool var_definition_p = false; 5146 int saved_processing_template_decl; 5147 5148 if (decl == error_mark_node) 5149 return; 5150 else if (! decl) 5151 { 5152 if (init) 5153 error ("assignment (not initialization) in declaration"); 5154 return; 5155 } 5156 5157 gcc_assert (TREE_CODE (decl) != RESULT_DECL); 5158 /* Parameters are handled by store_parm_decls, not cp_finish_decl. */ 5159 gcc_assert (TREE_CODE (decl) != PARM_DECL); 5160 5161 type = TREE_TYPE (decl); 5162 if (type == error_mark_node) 5163 return; 5164 5165 /* Assume no cleanup is required. */ 5166 cleanup = NULL_TREE; 5167 saved_processing_template_decl = processing_template_decl; 5168 5169 /* If a name was specified, get the string. */ 5170 if (global_scope_p (current_binding_level)) 5171 asmspec_tree = maybe_apply_renaming_pragma (decl, asmspec_tree); 5172 if (asmspec_tree && asmspec_tree != error_mark_node) 5173 asmspec = TREE_STRING_POINTER (asmspec_tree); 5174 5175 if (current_class_type 5176 && CP_DECL_CONTEXT (decl) == current_class_type 5177 && TYPE_BEING_DEFINED (current_class_type) 5178 && (DECL_INITIAL (decl) || init)) 5179 DECL_INITIALIZED_IN_CLASS_P (decl) = 1; 5180 5181 if (processing_template_decl) 5182 { 5183 bool type_dependent_p; 5184 5185 /* Add this declaration to the statement-tree. */ 5186 if (at_function_scope_p ()) 5187 add_decl_expr (decl); 5188 5189 type_dependent_p = dependent_type_p (type); 5190 5191 if (init && init_const_expr_p) 5192 { 5193 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (decl) = 1; 5194 if (DECL_INTEGRAL_CONSTANT_VAR_P (decl)) 5195 TREE_CONSTANT (decl) = 1; 5196 } 5197 5198 /* Generally, initializers in templates are expanded when the 5199 template is instantiated. But, if DECL is an integral 5200 constant static data member, then it can be used in future 5201 integral constant expressions, and its value must be 5202 available. */ 5203 if (!(init 5204 && DECL_CLASS_SCOPE_P (decl) 5205 && DECL_INTEGRAL_CONSTANT_VAR_P (decl) 5206 && !type_dependent_p 5207 && !value_dependent_init_p (init))) 5208 { 5209 if (init) 5210 DECL_INITIAL (decl) = init; 5211 if (TREE_CODE (decl) == VAR_DECL 5212 && !DECL_PRETTY_FUNCTION_P (decl) 5213 && !type_dependent_p) 5214 maybe_deduce_size_from_array_init (decl, init); 5215 goto finish_end; 5216 } 5217 5218 init = fold_non_dependent_expr (init); 5219 processing_template_decl = 0; 5220 } 5221 5222 /* Take care of TYPE_DECLs up front. */ 5223 if (TREE_CODE (decl) == TYPE_DECL) 5224 { 5225 if (type != error_mark_node 5226 && IS_AGGR_TYPE (type) && DECL_NAME (decl)) 5227 { 5228 if (TREE_TYPE (DECL_NAME (decl)) && TREE_TYPE (decl) != type) 5229 warning (0, "shadowing previous type declaration of %q#D", decl); 5230 set_identifier_type_value (DECL_NAME (decl), decl); 5231 } 5232 5233 /* If we have installed this as the canonical typedef for this 5234 type, and that type has not been defined yet, delay emitting 5235 the debug information for it, as we will emit it later. */ 5236 if (TYPE_MAIN_DECL (TREE_TYPE (decl)) == decl 5237 && !COMPLETE_TYPE_P (TREE_TYPE (decl))) 5238 TYPE_DECL_SUPPRESS_DEBUG (decl) = 1; 5239 5240 rest_of_decl_compilation (decl, DECL_CONTEXT (decl) == NULL_TREE, 5241 at_eof); 5242 goto finish_end; 5243 } 5244 5245 /* A reference will be modified here, as it is initialized. */ 5246 if (! DECL_EXTERNAL (decl) 5247 && TREE_READONLY (decl) 5248 && TREE_CODE (type) == REFERENCE_TYPE) 5249 { 5250 was_readonly = 1; 5251 TREE_READONLY (decl) = 0; 5252 } 5253 5254 if (TREE_CODE (decl) == VAR_DECL) 5255 { 5256 /* Only PODs can have thread-local storage. Other types may require 5257 various kinds of non-trivial initialization. */ 5258 if (DECL_THREAD_LOCAL_P (decl) && !pod_type_p (TREE_TYPE (decl))) 5259 error ("%qD cannot be thread-local because it has non-POD type %qT", 5260 decl, TREE_TYPE (decl)); 5261 /* If this is a local variable that will need a mangled name, 5262 register it now. We must do this before processing the 5263 initializer for the variable, since the initialization might 5264 require a guard variable, and since the mangled name of the 5265 guard variable will depend on the mangled name of this 5266 variable. */ 5267 if (!processing_template_decl 5268 && DECL_FUNCTION_SCOPE_P (decl) 5269 && TREE_STATIC (decl) 5270 && !DECL_ARTIFICIAL (decl)) 5271 push_local_name (decl); 5272 /* Convert the initializer to the type of DECL, if we have not 5273 already initialized DECL. */ 5274 if (!DECL_INITIALIZED_P (decl) 5275 /* If !DECL_EXTERNAL then DECL is being defined. In the 5276 case of a static data member initialized inside the 5277 class-specifier, there can be an initializer even if DECL 5278 is *not* defined. */ 5279 && (!DECL_EXTERNAL (decl) || init)) 5280 { 5281 if (init) 5282 { 5283 DECL_NONTRIVIALLY_INITIALIZED_P (decl) = 1; 5284 if (init_const_expr_p) 5285 { 5286 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (decl) = 1; 5287 if (DECL_INTEGRAL_CONSTANT_VAR_P (decl)) 5288 TREE_CONSTANT (decl) = 1; 5289 } 5290 } 5291 init = check_initializer (decl, init, flags, &cleanup); 5292 /* Thread-local storage cannot be dynamically initialized. */ 5293 if (DECL_THREAD_LOCAL_P (decl) && init) 5294 { 5295 error ("%qD is thread-local and so cannot be dynamically " 5296 "initialized", decl); 5297 init = NULL_TREE; 5298 } 5299 5300 /* Check that the initializer for a static data member was a 5301 constant. Although we check in the parser that the 5302 initializer is an integral constant expression, we do not 5303 simplify division-by-zero at the point at which it 5304 occurs. Therefore, in: 5305 5306 struct S { static const int i = 7 / 0; }; 5307 5308 we issue an error at this point. It would 5309 probably be better to forbid division by zero in 5310 integral constant expressions. */ 5311 if (DECL_EXTERNAL (decl) && init) 5312 { 5313 error ("%qD cannot be initialized by a non-constant expression" 5314 " when being declared", decl); 5315 DECL_INITIALIZED_IN_CLASS_P (decl) = 0; 5316 init = NULL_TREE; 5317 } 5318 5319 /* Handle: 5320 5321 [dcl.init] 5322 5323 The memory occupied by any object of static storage 5324 duration is zero-initialized at program startup before 5325 any other initialization takes place. 5326 5327 We cannot create an appropriate initializer until after 5328 the type of DECL is finalized. If DECL_INITIAL is set, 5329 then the DECL is statically initialized, and any 5330 necessary zero-initialization has already been performed. */ 5331 if (TREE_STATIC (decl) && !DECL_INITIAL (decl)) 5332 DECL_INITIAL (decl) = build_zero_init (TREE_TYPE (decl), 5333 /*nelts=*/NULL_TREE, 5334 /*static_storage_p=*/true); 5335 /* Remember that the initialization for this variable has 5336 taken place. */ 5337 DECL_INITIALIZED_P (decl) = 1; 5338 /* This declaration is the definition of this variable, 5339 unless we are initializing a static data member within 5340 the class specifier. */ 5341 if (!DECL_EXTERNAL (decl)) 5342 var_definition_p = true; 5343 } 5344 /* If the variable has an array type, lay out the type, even if 5345 there is no initializer. It is valid to index through the 5346 array, and we must get TYPE_ALIGN set correctly on the array 5347 type. */ 5348 else if (TREE_CODE (type) == ARRAY_TYPE) 5349 layout_type (type); 5350 } 5351 5352 /* Add this declaration to the statement-tree. This needs to happen 5353 after the call to check_initializer so that the DECL_EXPR for a 5354 reference temp is added before the DECL_EXPR for the reference itself. */ 5355 if (at_function_scope_p ()) 5356 add_decl_expr (decl); 5357 5358 /* Let the middle end know about variables and functions -- but not 5359 static data members in uninstantiated class templates. */ 5360 if (!saved_processing_template_decl 5361 && (TREE_CODE (decl) == VAR_DECL 5362 || TREE_CODE (decl) == FUNCTION_DECL)) 5363 { 5364 if (TREE_CODE (decl) == VAR_DECL) 5365 { 5366 layout_var_decl (decl); 5367 maybe_commonize_var (decl); 5368 } 5369 5370 make_rtl_for_nonlocal_decl (decl, init, asmspec); 5371 5372 /* Check for abstractness of the type. Notice that there is no 5373 need to strip array types here since the check for those types 5374 is already done within create_array_type_for_decl. */ 5375 if (TREE_CODE (type) == FUNCTION_TYPE 5376 || TREE_CODE (type) == METHOD_TYPE) 5377 abstract_virtuals_error (decl, TREE_TYPE (type)); 5378 else 5379 abstract_virtuals_error (decl, type); 5380 5381 /* This needs to happen after the linkage is set. */ 5382 determine_visibility (decl); 5383 5384 if (TREE_CODE (decl) == FUNCTION_DECL 5385 || TREE_TYPE (decl) == error_mark_node) 5386 /* No initialization required. */ 5387 ; 5388 else if (DECL_EXTERNAL (decl) 5389 && ! (DECL_LANG_SPECIFIC (decl) 5390 && DECL_NOT_REALLY_EXTERN (decl))) 5391 { 5392 if (init) 5393 DECL_INITIAL (decl) = init; 5394 } 5395 else 5396 { 5397 /* A variable definition. */ 5398 if (DECL_FUNCTION_SCOPE_P (decl)) 5399 { 5400 /* Initialize the local variable. */ 5401 if (processing_template_decl) 5402 DECL_INITIAL (decl) = init; 5403 else if (!TREE_STATIC (decl)) 5404 initialize_local_var (decl, init); 5405 } 5406 5407 /* If a variable is defined, and then a subsequent 5408 definition with external linkage is encountered, we will 5409 get here twice for the same variable. We want to avoid 5410 calling expand_static_init more than once. For variables 5411 that are not static data members, we can call 5412 expand_static_init only when we actually process the 5413 initializer. It is not legal to redeclare a static data 5414 member, so this issue does not arise in that case. */ 5415 if (var_definition_p && TREE_STATIC (decl)) 5416 { 5417 /* If a TREE_READONLY variable needs initialization 5418 at runtime, it is no longer readonly and we need to 5419 avoid MEM_READONLY_P being set on RTL created for it. */ 5420 if (init) 5421 { 5422 if (TREE_READONLY (decl)) 5423 TREE_READONLY (decl) = 0; 5424 was_readonly = 0; 5425 } 5426 expand_static_init (decl, init); 5427 } 5428 } 5429 } 5430 5431 /* If a CLEANUP_STMT was created to destroy a temporary bound to a 5432 reference, insert it in the statement-tree now. */ 5433 if (cleanup) 5434 push_cleanup (decl, cleanup, false); 5435 5436 finish_end: 5437 processing_template_decl = saved_processing_template_decl; 5438 5439 if (was_readonly) 5440 TREE_READONLY (decl) = 1; 5441 5442 /* If this was marked 'used', be sure it will be output. */ 5443 if (lookup_attribute ("used", DECL_ATTRIBUTES (decl))) 5444 mark_decl_referenced (decl); 5445} 5446 5447/* This is here for a midend callback from c-common.c. */ 5448 5449void 5450finish_decl (tree decl, tree init, tree asmspec_tree) 5451{ 5452 cp_finish_decl (decl, init, /*init_const_expr_p=*/false, asmspec_tree, 0); 5453} 5454 5455/* Returns a declaration for a VAR_DECL as if: 5456 5457 extern "C" TYPE NAME; 5458 5459 had been seen. Used to create compiler-generated global 5460 variables. */ 5461 5462static tree 5463declare_global_var (tree name, tree type) 5464{ 5465 tree decl; 5466 5467 push_to_top_level (); 5468 decl = build_decl (VAR_DECL, name, type); 5469 TREE_PUBLIC (decl) = 1; 5470 DECL_EXTERNAL (decl) = 1; 5471 DECL_ARTIFICIAL (decl) = 1; 5472 /* If the user has explicitly declared this variable (perhaps 5473 because the code we are compiling is part of a low-level runtime 5474 library), then it is possible that our declaration will be merged 5475 with theirs by pushdecl. */ 5476 decl = pushdecl (decl); 5477 finish_decl (decl, NULL_TREE, NULL_TREE); 5478 pop_from_top_level (); 5479 5480 return decl; 5481} 5482 5483/* Returns a pointer to the `atexit' function. Note that if 5484 FLAG_USE_CXA_ATEXIT is nonzero, then this will actually be the new 5485 `__cxa_atexit' function specified in the IA64 C++ ABI. */ 5486 5487static tree 5488get_atexit_node (void) 5489{ 5490 tree atexit_fndecl; 5491 tree arg_types; 5492 tree fn_type; 5493 tree fn_ptr_type; 5494 const char *name; 5495 bool use_aeabi_atexit; 5496 5497 if (atexit_node) 5498 return atexit_node; 5499 5500 if (flag_use_cxa_atexit) 5501 { 5502 /* The declaration for `__cxa_atexit' is: 5503 5504 int __cxa_atexit (void (*)(void *), void *, void *) 5505 5506 We build up the argument types and then then function type 5507 itself. */ 5508 5509 use_aeabi_atexit = targetm.cxx.use_aeabi_atexit (); 5510 /* First, build the pointer-to-function type for the first 5511 argument. */ 5512 arg_types = tree_cons (NULL_TREE, ptr_type_node, void_list_node); 5513 fn_type = build_function_type (void_type_node, arg_types); 5514 fn_ptr_type = build_pointer_type (fn_type); 5515 /* Then, build the rest of the argument types. */ 5516 arg_types = tree_cons (NULL_TREE, ptr_type_node, void_list_node); 5517 if (use_aeabi_atexit) 5518 { 5519 arg_types = tree_cons (NULL_TREE, fn_ptr_type, arg_types); 5520 arg_types = tree_cons (NULL_TREE, ptr_type_node, arg_types); 5521 } 5522 else 5523 { 5524 arg_types = tree_cons (NULL_TREE, ptr_type_node, arg_types); 5525 arg_types = tree_cons (NULL_TREE, fn_ptr_type, arg_types); 5526 } 5527 /* And the final __cxa_atexit type. */ 5528 fn_type = build_function_type (integer_type_node, arg_types); 5529 fn_ptr_type = build_pointer_type (fn_type); 5530 if (use_aeabi_atexit) 5531 name = "__aeabi_atexit"; 5532 else 5533 name = "__cxa_atexit"; 5534 } 5535 else 5536 { 5537 /* The declaration for `atexit' is: 5538 5539 int atexit (void (*)()); 5540 5541 We build up the argument types and then then function type 5542 itself. */ 5543 fn_type = build_function_type (void_type_node, void_list_node); 5544 fn_ptr_type = build_pointer_type (fn_type); 5545 arg_types = tree_cons (NULL_TREE, fn_ptr_type, void_list_node); 5546 /* Build the final atexit type. */ 5547 fn_type = build_function_type (integer_type_node, arg_types); 5548 name = "atexit"; 5549 } 5550 5551 /* Now, build the function declaration. */ 5552 push_lang_context (lang_name_c); 5553 atexit_fndecl = build_library_fn_ptr (name, fn_type); 5554 mark_used (atexit_fndecl); 5555 pop_lang_context (); 5556 atexit_node = decay_conversion (atexit_fndecl); 5557 5558 return atexit_node; 5559} 5560 5561/* Returns the __dso_handle VAR_DECL. */ 5562 5563static tree 5564get_dso_handle_node (void) 5565{ 5566 if (dso_handle_node) 5567 return dso_handle_node; 5568 5569 /* Declare the variable. */ 5570 dso_handle_node = declare_global_var (get_identifier ("__dso_handle"), 5571 ptr_type_node); 5572 5573 return dso_handle_node; 5574} 5575 5576/* Begin a new function with internal linkage whose job will be simply 5577 to destroy some particular variable. */ 5578 5579static GTY(()) int start_cleanup_cnt; 5580 5581static tree 5582start_cleanup_fn (void) 5583{ 5584 char name[32]; 5585 tree parmtypes; 5586 tree fntype; 5587 tree fndecl; 5588 5589 push_to_top_level (); 5590 5591 /* No need to mangle this. */ 5592 push_lang_context (lang_name_c); 5593 5594 /* Build the parameter-types. */ 5595 parmtypes = void_list_node; 5596 /* Functions passed to __cxa_atexit take an additional parameter. 5597 We'll just ignore it. After we implement the new calling 5598 convention for destructors, we can eliminate the use of 5599 additional cleanup functions entirely in the -fnew-abi case. */ 5600 if (flag_use_cxa_atexit) 5601 parmtypes = tree_cons (NULL_TREE, ptr_type_node, parmtypes); 5602 /* Build the function type itself. */ 5603 fntype = build_function_type (void_type_node, parmtypes); 5604 /* Build the name of the function. */ 5605 sprintf (name, "__tcf_%d", start_cleanup_cnt++); 5606 /* Build the function declaration. */ 5607 fndecl = build_lang_decl (FUNCTION_DECL, get_identifier (name), fntype); 5608 /* It's a function with internal linkage, generated by the 5609 compiler. */ 5610 TREE_PUBLIC (fndecl) = 0; 5611 DECL_ARTIFICIAL (fndecl) = 1; 5612 /* Make the function `inline' so that it is only emitted if it is 5613 actually needed. It is unlikely that it will be inlined, since 5614 it is only called via a function pointer, but we avoid unnecessary 5615 emissions this way. */ 5616 DECL_INLINE (fndecl) = 1; 5617 DECL_DECLARED_INLINE_P (fndecl) = 1; 5618 DECL_INTERFACE_KNOWN (fndecl) = 1; 5619 /* Build the parameter. */ 5620 if (flag_use_cxa_atexit) 5621 { 5622 tree parmdecl; 5623 5624 parmdecl = cp_build_parm_decl (NULL_TREE, ptr_type_node); 5625 DECL_CONTEXT (parmdecl) = fndecl; 5626 TREE_USED (parmdecl) = 1; 5627 DECL_ARGUMENTS (fndecl) = parmdecl; 5628 } 5629 5630 pushdecl (fndecl); 5631 start_preparsed_function (fndecl, NULL_TREE, SF_PRE_PARSED); 5632 5633 pop_lang_context (); 5634 5635 return current_function_decl; 5636} 5637 5638/* Finish the cleanup function begun by start_cleanup_fn. */ 5639 5640static void 5641end_cleanup_fn (void) 5642{ 5643 expand_or_defer_fn (finish_function (0)); 5644 5645 pop_from_top_level (); 5646} 5647 5648/* Generate code to handle the destruction of DECL, an object with 5649 static storage duration. */ 5650 5651tree 5652register_dtor_fn (tree decl) 5653{ 5654 tree cleanup; 5655 tree compound_stmt; 5656 tree args; 5657 tree fcall; 5658 5659 if (TYPE_HAS_TRIVIAL_DESTRUCTOR (TREE_TYPE (decl))) 5660 return void_zero_node; 5661 5662 /* Call build_cleanup before we enter the anonymous function so that 5663 any access checks will be done relative to the current scope, 5664 rather than the scope of the anonymous function. */ 5665 build_cleanup (decl); 5666 5667 /* Now start the function. */ 5668 cleanup = start_cleanup_fn (); 5669 5670 /* Now, recompute the cleanup. It may contain SAVE_EXPRs that refer 5671 to the original function, rather than the anonymous one. That 5672 will make the back-end think that nested functions are in use, 5673 which causes confusion. */ 5674 5675 push_deferring_access_checks (dk_no_check); 5676 fcall = build_cleanup (decl); 5677 pop_deferring_access_checks (); 5678 5679 /* Create the body of the anonymous function. */ 5680 compound_stmt = begin_compound_stmt (BCS_FN_BODY); 5681 finish_expr_stmt (fcall); 5682 finish_compound_stmt (compound_stmt); 5683 end_cleanup_fn (); 5684 5685 /* Call atexit with the cleanup function. */ 5686 cxx_mark_addressable (cleanup); 5687 mark_used (cleanup); 5688 cleanup = build_unary_op (ADDR_EXPR, cleanup, 0); 5689 if (flag_use_cxa_atexit) 5690 { 5691 args = tree_cons (NULL_TREE, 5692 build_unary_op (ADDR_EXPR, get_dso_handle_node (), 0), 5693 NULL_TREE); 5694 if (targetm.cxx.use_aeabi_atexit ()) 5695 { 5696 args = tree_cons (NULL_TREE, cleanup, args); 5697 args = tree_cons (NULL_TREE, null_pointer_node, args); 5698 } 5699 else 5700 { 5701 args = tree_cons (NULL_TREE, null_pointer_node, args); 5702 args = tree_cons (NULL_TREE, cleanup, args); 5703 } 5704 } 5705 else 5706 args = tree_cons (NULL_TREE, cleanup, NULL_TREE); 5707 return build_function_call (get_atexit_node (), args); 5708} 5709 5710/* DECL is a VAR_DECL with static storage duration. INIT, if present, 5711 is its initializer. Generate code to handle the construction 5712 and destruction of DECL. */ 5713 5714static void 5715expand_static_init (tree decl, tree init) 5716{ 5717 gcc_assert (TREE_CODE (decl) == VAR_DECL); 5718 gcc_assert (TREE_STATIC (decl)); 5719 5720 /* Some variables require no initialization. */ 5721 if (!init 5722 && !TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (decl)) 5723 && TYPE_HAS_TRIVIAL_DESTRUCTOR (TREE_TYPE (decl))) 5724 return; 5725 5726 if (DECL_FUNCTION_SCOPE_P (decl)) 5727 { 5728 /* Emit code to perform this initialization but once. */ 5729 tree if_stmt = NULL_TREE, inner_if_stmt = NULL_TREE; 5730 tree then_clause = NULL_TREE, inner_then_clause = NULL_TREE; 5731 tree guard, guard_addr, guard_addr_list; 5732 tree acquire_fn, release_fn, abort_fn; 5733 tree flag, begin; 5734 5735 /* Emit code to perform this initialization but once. This code 5736 looks like: 5737 5738 static <type> guard; 5739 if (!guard.first_byte) { 5740 if (__cxa_guard_acquire (&guard)) { 5741 bool flag = false; 5742 try { 5743 // Do initialization. 5744 flag = true; __cxa_guard_release (&guard); 5745 // Register variable for destruction at end of program. 5746 } catch { 5747 if (!flag) __cxa_guard_abort (&guard); 5748 } 5749 } 5750 5751 Note that the `flag' variable is only set to 1 *after* the 5752 initialization is complete. This ensures that an exception, 5753 thrown during the construction, will cause the variable to 5754 reinitialized when we pass through this code again, as per: 5755 5756 [stmt.dcl] 5757 5758 If the initialization exits by throwing an exception, the 5759 initialization is not complete, so it will be tried again 5760 the next time control enters the declaration. 5761 5762 This process should be thread-safe, too; multiple threads 5763 should not be able to initialize the variable more than 5764 once. */ 5765 5766 /* Create the guard variable. */ 5767 guard = get_guard (decl); 5768 5769 /* This optimization isn't safe on targets with relaxed memory 5770 consistency. On such targets we force synchronization in 5771 __cxa_guard_acquire. */ 5772 if (!targetm.relaxed_ordering || !flag_threadsafe_statics) 5773 { 5774 /* Begin the conditional initialization. */ 5775 if_stmt = begin_if_stmt (); 5776 finish_if_stmt_cond (get_guard_cond (guard), if_stmt); 5777 then_clause = begin_compound_stmt (BCS_NO_SCOPE); 5778 } 5779 5780 if (flag_threadsafe_statics) 5781 { 5782 guard_addr = build_address (guard); 5783 guard_addr_list = build_tree_list (NULL_TREE, guard_addr); 5784 5785 acquire_fn = get_identifier ("__cxa_guard_acquire"); 5786 release_fn = get_identifier ("__cxa_guard_release"); 5787 abort_fn = get_identifier ("__cxa_guard_abort"); 5788 if (!get_global_value_if_present (acquire_fn, &acquire_fn)) 5789 { 5790 tree argtypes = tree_cons (NULL_TREE, TREE_TYPE (guard_addr), 5791 void_list_node); 5792 tree vfntype = build_function_type (void_type_node, argtypes); 5793 acquire_fn = push_library_fn 5794 (acquire_fn, build_function_type (integer_type_node, argtypes)); 5795 release_fn = push_library_fn (release_fn, vfntype); 5796 abort_fn = push_library_fn (abort_fn, vfntype); 5797 } 5798 else 5799 { 5800 release_fn = identifier_global_value (release_fn); 5801 abort_fn = identifier_global_value (abort_fn); 5802 } 5803 5804 inner_if_stmt = begin_if_stmt (); 5805 finish_if_stmt_cond (build_call (acquire_fn, guard_addr_list), 5806 inner_if_stmt); 5807 5808 inner_then_clause = begin_compound_stmt (BCS_NO_SCOPE); 5809 begin = get_target_expr (boolean_false_node); 5810 flag = TARGET_EXPR_SLOT (begin); 5811 5812 TARGET_EXPR_CLEANUP (begin) 5813 = build3 (COND_EXPR, void_type_node, flag, 5814 void_zero_node, 5815 build_call (abort_fn, guard_addr_list)); 5816 CLEANUP_EH_ONLY (begin) = 1; 5817 5818 /* Do the initialization itself. */ 5819 init = add_stmt_to_compound (begin, init); 5820 init = add_stmt_to_compound 5821 (init, build2 (MODIFY_EXPR, void_type_node, flag, boolean_true_node)); 5822 init = add_stmt_to_compound 5823 (init, build_call (release_fn, guard_addr_list)); 5824 } 5825 else 5826 init = add_stmt_to_compound (init, set_guard (guard)); 5827 5828 /* Use atexit to register a function for destroying this static 5829 variable. */ 5830 init = add_stmt_to_compound (init, register_dtor_fn (decl)); 5831 5832 finish_expr_stmt (init); 5833 5834 if (flag_threadsafe_statics) 5835 { 5836 finish_compound_stmt (inner_then_clause); 5837 finish_then_clause (inner_if_stmt); 5838 finish_if_stmt (inner_if_stmt); 5839 } 5840 5841 if (!targetm.relaxed_ordering || !flag_threadsafe_statics) 5842 { 5843 finish_compound_stmt (then_clause); 5844 finish_then_clause (if_stmt); 5845 finish_if_stmt (if_stmt); 5846 } 5847 } 5848 else 5849 static_aggregates = tree_cons (init, decl, static_aggregates); 5850} 5851 5852 5853/* Make TYPE a complete type based on INITIAL_VALUE. 5854 Return 0 if successful, 1 if INITIAL_VALUE can't be deciphered, 5855 2 if there was no information (in which case assume 0 if DO_DEFAULT), 5856 3 if the initializer list is empty (in pedantic mode). */ 5857 5858int 5859cp_complete_array_type (tree *ptype, tree initial_value, bool do_default) 5860{ 5861 int failure; 5862 tree type, elt_type; 5863 5864 if (initial_value) 5865 { 5866 /* An array of character type can be initialized from a 5867 brace-enclosed string constant. 5868 5869 FIXME: this code is duplicated from reshape_init. Probably 5870 we should just call reshape_init here? */ 5871 if (char_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (*ptype))) 5872 && TREE_CODE (initial_value) == CONSTRUCTOR 5873 && !VEC_empty (constructor_elt, CONSTRUCTOR_ELTS (initial_value))) 5874 { 5875 VEC(constructor_elt,gc) *v = CONSTRUCTOR_ELTS (initial_value); 5876 tree value = VEC_index (constructor_elt, v, 0)->value; 5877 5878 if (TREE_CODE (value) == STRING_CST 5879 && VEC_length (constructor_elt, v) == 1) 5880 initial_value = value; 5881 } 5882 } 5883 5884 failure = complete_array_type (ptype, initial_value, do_default); 5885 5886 /* We can create the array before the element type is complete, which 5887 means that we didn't have these two bits set in the original type 5888 either. In completing the type, we are expected to propagate these 5889 bits. See also complete_type which does the same thing for arrays 5890 of fixed size. */ 5891 type = *ptype; 5892 if (TYPE_DOMAIN (type)) 5893 { 5894 elt_type = TREE_TYPE (type); 5895 TYPE_NEEDS_CONSTRUCTING (type) = TYPE_NEEDS_CONSTRUCTING (elt_type); 5896 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type) 5897 = TYPE_HAS_NONTRIVIAL_DESTRUCTOR (elt_type); 5898 } 5899 5900 return failure; 5901} 5902 5903/* Return zero if something is declared to be a member of type 5904 CTYPE when in the context of CUR_TYPE. STRING is the error 5905 message to print in that case. Otherwise, quietly return 1. */ 5906 5907static int 5908member_function_or_else (tree ctype, tree cur_type, enum overload_flags flags) 5909{ 5910 if (ctype && ctype != cur_type) 5911 { 5912 if (flags == DTOR_FLAG) 5913 error ("destructor for alien class %qT cannot be a member", ctype); 5914 else 5915 error ("constructor for alien class %qT cannot be a member", ctype); 5916 return 0; 5917 } 5918 return 1; 5919} 5920 5921/* Subroutine of `grokdeclarator'. */ 5922 5923/* Generate errors possibly applicable for a given set of specifiers. 5924 This is for ARM $7.1.2. */ 5925 5926static void 5927bad_specifiers (tree object, 5928 const char* type, 5929 int virtualp, 5930 int quals, 5931 int inlinep, 5932 int friendp, 5933 int raises) 5934{ 5935 if (virtualp) 5936 error ("%qD declared as a %<virtual%> %s", object, type); 5937 if (inlinep) 5938 error ("%qD declared as an %<inline%> %s", object, type); 5939 if (quals) 5940 error ("%<const%> and %<volatile%> function specifiers on " 5941 "%qD invalid in %s declaration", 5942 object, type); 5943 if (friendp) 5944 error ("%q+D declared as a friend", object); 5945 if (raises 5946 && (TREE_CODE (object) == TYPE_DECL 5947 || (!TYPE_PTRFN_P (TREE_TYPE (object)) 5948 && !TYPE_REFFN_P (TREE_TYPE (object)) 5949 && !TYPE_PTRMEMFUNC_P (TREE_TYPE (object))))) 5950 error ("%q+D declared with an exception specification", object); 5951} 5952 5953/* DECL is a member function or static data member and is presently 5954 being defined. Check that the definition is taking place in a 5955 valid namespace. */ 5956 5957static void 5958check_class_member_definition_namespace (tree decl) 5959{ 5960 /* These checks only apply to member functions and static data 5961 members. */ 5962 gcc_assert (TREE_CODE (decl) == FUNCTION_DECL 5963 || TREE_CODE (decl) == VAR_DECL); 5964 /* We check for problems with specializations in pt.c in 5965 check_specialization_namespace, where we can issue better 5966 diagnostics. */ 5967 if (processing_specialization) 5968 return; 5969 /* There are no restrictions on the placement of 5970 explicit instantiations. */ 5971 if (processing_explicit_instantiation) 5972 return; 5973 /* [class.mfct] 5974 5975 A member function definition that appears outside of the 5976 class definition shall appear in a namespace scope enclosing 5977 the class definition. 5978 5979 [class.static.data] 5980 5981 The definition for a static data member shall appear in a 5982 namespace scope enclosing the member's class definition. */ 5983 if (!is_ancestor (current_namespace, DECL_CONTEXT (decl))) 5984 pedwarn ("definition of %qD is not in namespace enclosing %qT", 5985 decl, DECL_CONTEXT (decl)); 5986} 5987 5988/* Build a PARM_DECL for the "this" parameter. TYPE is the 5989 METHOD_TYPE for a non-static member function; QUALS are the 5990 cv-qualifiers that apply to the function. */ 5991 5992tree 5993build_this_parm (tree type, cp_cv_quals quals) 5994{ 5995 tree this_type; 5996 tree qual_type; 5997 tree parm; 5998 cp_cv_quals this_quals; 5999 6000 this_type = TREE_VALUE (TYPE_ARG_TYPES (type)); 6001 /* The `this' parameter is implicitly `const'; it cannot be 6002 assigned to. */ 6003 this_quals = (quals & TYPE_QUAL_RESTRICT) | TYPE_QUAL_CONST; 6004 qual_type = cp_build_qualified_type (this_type, this_quals); 6005 parm = build_artificial_parm (this_identifier, qual_type); 6006 cp_apply_type_quals_to_decl (this_quals, parm); 6007 return parm; 6008} 6009 6010/* CTYPE is class type, or null if non-class. 6011 TYPE is type this FUNCTION_DECL should have, either FUNCTION_TYPE 6012 or METHOD_TYPE. 6013 DECLARATOR is the function's name. 6014 PARMS is a chain of PARM_DECLs for the function. 6015 VIRTUALP is truthvalue of whether the function is virtual or not. 6016 FLAGS are to be passed through to `grokclassfn'. 6017 QUALS are qualifiers indicating whether the function is `const' 6018 or `volatile'. 6019 RAISES is a list of exceptions that this function can raise. 6020 CHECK is 1 if we must find this method in CTYPE, 0 if we should 6021 not look, and -1 if we should not call `grokclassfn' at all. 6022 6023 SFK is the kind of special function (if any) for the new function. 6024 6025 Returns `NULL_TREE' if something goes wrong, after issuing 6026 applicable error messages. */ 6027 6028static tree 6029grokfndecl (tree ctype, 6030 tree type, 6031 tree declarator, 6032 tree parms, 6033 tree orig_declarator, 6034 int virtualp, 6035 enum overload_flags flags, 6036 cp_cv_quals quals, 6037 tree raises, 6038 int check, 6039 int friendp, 6040 int publicp, 6041 int inlinep, 6042 special_function_kind sfk, 6043 bool funcdef_flag, 6044 int template_count, 6045 tree in_namespace, 6046 tree* attrlist) 6047{ 6048 tree decl; 6049 int staticp = ctype && TREE_CODE (type) == FUNCTION_TYPE; 6050 tree t; 6051 6052 if (raises) 6053 type = build_exception_variant (type, raises); 6054 6055 decl = build_lang_decl (FUNCTION_DECL, declarator, type); 6056 if (TREE_CODE (type) == METHOD_TYPE) 6057 { 6058 tree parm; 6059 parm = build_this_parm (type, quals); 6060 TREE_CHAIN (parm) = parms; 6061 parms = parm; 6062 } 6063 DECL_ARGUMENTS (decl) = parms; 6064 /* Propagate volatile out from type to decl. */ 6065 if (TYPE_VOLATILE (type)) 6066 TREE_THIS_VOLATILE (decl) = 1; 6067 6068 if (friendp 6069 && TREE_CODE (orig_declarator) == TEMPLATE_ID_EXPR) 6070 { 6071 if (funcdef_flag) 6072 error 6073 ("defining explicit specialization %qD in friend declaration", 6074 orig_declarator); 6075 else 6076 { 6077 tree fns = TREE_OPERAND (orig_declarator, 0); 6078 tree args = TREE_OPERAND (orig_declarator, 1); 6079 6080 if (PROCESSING_REAL_TEMPLATE_DECL_P ()) 6081 { 6082 /* Something like `template <class T> friend void f<T>()'. */ 6083 error ("invalid use of template-id %qD in declaration " 6084 "of primary template", 6085 orig_declarator); 6086 return NULL_TREE; 6087 } 6088 6089 6090 /* A friend declaration of the form friend void f<>(). Record 6091 the information in the TEMPLATE_ID_EXPR. */ 6092 SET_DECL_IMPLICIT_INSTANTIATION (decl); 6093 6094 if (TREE_CODE (fns) == COMPONENT_REF) 6095 { 6096 /* Due to bison parser ickiness, we will have already looked 6097 up an operator_name or PFUNCNAME within the current class 6098 (see template_id in parse.y). If the current class contains 6099 such a name, we'll get a COMPONENT_REF here. Undo that. */ 6100 6101 gcc_assert (TREE_TYPE (TREE_OPERAND (fns, 0)) 6102 == current_class_type); 6103 fns = TREE_OPERAND (fns, 1); 6104 } 6105 gcc_assert (TREE_CODE (fns) == IDENTIFIER_NODE 6106 || TREE_CODE (fns) == OVERLOAD); 6107 DECL_TEMPLATE_INFO (decl) = tree_cons (fns, args, NULL_TREE); 6108 6109 for (t = TYPE_ARG_TYPES (TREE_TYPE (decl)); t; t = TREE_CHAIN (t)) 6110 if (TREE_PURPOSE (t) 6111 && TREE_CODE (TREE_PURPOSE (t)) == DEFAULT_ARG) 6112 { 6113 error ("default arguments are not allowed in declaration " 6114 "of friend template specialization %qD", 6115 decl); 6116 return NULL_TREE; 6117 } 6118 6119 if (inlinep) 6120 { 6121 error ("%<inline%> is not allowed in declaration of friend " 6122 "template specialization %qD", 6123 decl); 6124 return NULL_TREE; 6125 } 6126 } 6127 } 6128 6129 /* If this decl has namespace scope, set that up. */ 6130 if (in_namespace) 6131 set_decl_namespace (decl, in_namespace, friendp); 6132 else if (!ctype) 6133 DECL_CONTEXT (decl) = FROB_CONTEXT (current_namespace); 6134 6135 /* `main' and builtins have implicit 'C' linkage. */ 6136 if ((MAIN_NAME_P (declarator) 6137 || (IDENTIFIER_LENGTH (declarator) > 10 6138 && IDENTIFIER_POINTER (declarator)[0] == '_' 6139 && IDENTIFIER_POINTER (declarator)[1] == '_' 6140 && strncmp (IDENTIFIER_POINTER (declarator)+2, "builtin_", 8) == 0)) 6141 && current_lang_name == lang_name_cplusplus 6142 && ctype == NULL_TREE 6143 /* NULL_TREE means global namespace. */ 6144 && DECL_CONTEXT (decl) == NULL_TREE) 6145 SET_DECL_LANGUAGE (decl, lang_c); 6146 6147 /* Should probably propagate const out from type to decl I bet (mrs). */ 6148 if (staticp) 6149 { 6150 DECL_STATIC_FUNCTION_P (decl) = 1; 6151 DECL_CONTEXT (decl) = ctype; 6152 } 6153 6154 if (ctype) 6155 { 6156 DECL_CONTEXT (decl) = ctype; 6157 if (funcdef_flag) 6158 check_class_member_definition_namespace (decl); 6159 } 6160 6161 if (ctype == NULL_TREE && DECL_MAIN_P (decl)) 6162 { 6163 if (processing_template_decl) 6164 error ("cannot declare %<::main%> to be a template"); 6165 if (inlinep) 6166 error ("cannot declare %<::main%> to be inline"); 6167 if (!publicp) 6168 error ("cannot declare %<::main%> to be static"); 6169 inlinep = 0; 6170 publicp = 1; 6171 } 6172 6173 /* Members of anonymous types and local classes have no linkage; make 6174 them internal. If a typedef is made later, this will be changed. */ 6175 if (ctype && (TYPE_ANONYMOUS_P (ctype) 6176 || decl_function_context (TYPE_MAIN_DECL (ctype)))) 6177 publicp = 0; 6178 6179 if (publicp) 6180 { 6181 /* [basic.link]: A name with no linkage (notably, the name of a class 6182 or enumeration declared in a local scope) shall not be used to 6183 declare an entity with linkage. 6184 6185 Only check this for public decls for now. See core 319, 389. */ 6186 t = no_linkage_check (TREE_TYPE (decl), 6187 /*relaxed_p=*/false); 6188 if (t) 6189 { 6190 if (TYPE_ANONYMOUS_P (t)) 6191 { 6192 if (DECL_EXTERN_C_P (decl)) 6193 /* Allow this; it's pretty common in C. */; 6194 else 6195 { 6196 pedwarn ("non-local function %q#D uses anonymous type", 6197 decl); 6198 if (DECL_ORIGINAL_TYPE (TYPE_NAME (t))) 6199 pedwarn ("%q+#D does not refer to the unqualified " 6200 "type, so it is not used for linkage", 6201 TYPE_NAME (t)); 6202 } 6203 } 6204 else 6205 pedwarn ("non-local function %q#D uses local type %qT", decl, t); 6206 } 6207 } 6208 6209 TREE_PUBLIC (decl) = publicp; 6210 if (! publicp) 6211 { 6212 DECL_INTERFACE_KNOWN (decl) = 1; 6213 DECL_NOT_REALLY_EXTERN (decl) = 1; 6214 } 6215 6216 /* If the declaration was declared inline, mark it as such. */ 6217 if (inlinep) 6218 DECL_DECLARED_INLINE_P (decl) = 1; 6219 /* We inline functions that are explicitly declared inline, or, when 6220 the user explicitly asks us to, all functions. */ 6221 if (DECL_DECLARED_INLINE_P (decl) 6222 || (flag_inline_trees == 2 && !DECL_INLINE (decl) && funcdef_flag)) 6223 DECL_INLINE (decl) = 1; 6224 6225 DECL_EXTERNAL (decl) = 1; 6226 if (quals && TREE_CODE (type) == FUNCTION_TYPE) 6227 { 6228 error ("%smember function %qD cannot have cv-qualifier", 6229 (ctype ? "static " : "non-"), decl); 6230 quals = TYPE_UNQUALIFIED; 6231 } 6232 6233 if (IDENTIFIER_OPNAME_P (DECL_NAME (decl)) 6234 && !grok_op_properties (decl, /*complain=*/true)) 6235 return NULL_TREE; 6236 6237 if (ctype && decl_function_context (decl)) 6238 DECL_NO_STATIC_CHAIN (decl) = 1; 6239 6240 if (funcdef_flag) 6241 /* Make the init_value nonzero so pushdecl knows this is not 6242 tentative. error_mark_node is replaced later with the BLOCK. */ 6243 DECL_INITIAL (decl) = error_mark_node; 6244 6245 if (TYPE_NOTHROW_P (type) || nothrow_libfn_p (decl)) 6246 TREE_NOTHROW (decl) = 1; 6247 6248 /* Caller will do the rest of this. */ 6249 if (check < 0) 6250 return decl; 6251 6252 if (ctype != NULL_TREE) 6253 { 6254 if (sfk == sfk_constructor) 6255 DECL_CONSTRUCTOR_P (decl) = 1; 6256 6257 grokclassfn (ctype, decl, flags); 6258 } 6259 6260 decl = check_explicit_specialization (orig_declarator, decl, 6261 template_count, 6262 2 * funcdef_flag + 6263 4 * (friendp != 0)); 6264 if (decl == error_mark_node) 6265 return NULL_TREE; 6266 6267 if (attrlist) 6268 { 6269 cplus_decl_attributes (&decl, *attrlist, 0); 6270 *attrlist = NULL_TREE; 6271 } 6272 6273 /* Check main's type after attributes have been applied. */ 6274 if (ctype == NULL_TREE && DECL_MAIN_P (decl) 6275 && !same_type_p (TREE_TYPE (TREE_TYPE (decl)), 6276 integer_type_node)) 6277 { 6278 tree oldtypeargs = TYPE_ARG_TYPES (TREE_TYPE (decl)); 6279 tree newtype; 6280 error ("%<::main%> must return %<int%>"); 6281 newtype = build_function_type (integer_type_node, oldtypeargs); 6282 TREE_TYPE (decl) = newtype; 6283 } 6284 6285 if (ctype != NULL_TREE 6286 && (! TYPE_FOR_JAVA (ctype) || check_java_method (decl)) 6287 && check) 6288 { 6289 tree old_decl; 6290 6291 old_decl = check_classfn (ctype, decl, 6292 (processing_template_decl 6293 > template_class_depth (ctype)) 6294 ? current_template_parms 6295 : NULL_TREE); 6296 if (old_decl) 6297 { 6298 tree ok; 6299 tree pushed_scope; 6300 6301 if (TREE_CODE (old_decl) == TEMPLATE_DECL) 6302 /* Because grokfndecl is always supposed to return a 6303 FUNCTION_DECL, we pull out the DECL_TEMPLATE_RESULT 6304 here. We depend on our callers to figure out that its 6305 really a template that's being returned. */ 6306 old_decl = DECL_TEMPLATE_RESULT (old_decl); 6307 6308 if (DECL_STATIC_FUNCTION_P (old_decl) 6309 && TREE_CODE (TREE_TYPE (decl)) == METHOD_TYPE) 6310 /* Remove the `this' parm added by grokclassfn. 6311 XXX Isn't this done in start_function, too? */ 6312 revert_static_member_fn (decl); 6313 if (DECL_ARTIFICIAL (old_decl)) 6314 error ("definition of implicitly-declared %qD", old_decl); 6315 6316 /* Since we've smashed OLD_DECL to its 6317 DECL_TEMPLATE_RESULT, we must do the same to DECL. */ 6318 if (TREE_CODE (decl) == TEMPLATE_DECL) 6319 decl = DECL_TEMPLATE_RESULT (decl); 6320 6321 /* Attempt to merge the declarations. This can fail, in 6322 the case of some invalid specialization declarations. */ 6323 pushed_scope = push_scope (ctype); 6324 ok = duplicate_decls (decl, old_decl, friendp); 6325 if (pushed_scope) 6326 pop_scope (pushed_scope); 6327 if (!ok) 6328 { 6329 error ("no %q#D member function declared in class %qT", 6330 decl, ctype); 6331 return NULL_TREE; 6332 } 6333 return old_decl; 6334 } 6335 } 6336 6337 if (DECL_CONSTRUCTOR_P (decl) && !grok_ctor_properties (ctype, decl)) 6338 return NULL_TREE; 6339 6340 if (ctype == NULL_TREE || check) 6341 return decl; 6342 6343 if (virtualp) 6344 DECL_VIRTUAL_P (decl) = 1; 6345 6346 return decl; 6347} 6348 6349/* DECL is a VAR_DECL for a static data member. Set flags to reflect 6350 the linkage that DECL will receive in the object file. */ 6351 6352static void 6353set_linkage_for_static_data_member (tree decl) 6354{ 6355 /* A static data member always has static storage duration and 6356 external linkage. Note that static data members are forbidden in 6357 local classes -- the only situation in which a class has 6358 non-external linkage. */ 6359 TREE_PUBLIC (decl) = 1; 6360 TREE_STATIC (decl) = 1; 6361 /* For non-template classes, static data members are always put 6362 out in exactly those files where they are defined, just as 6363 with ordinary namespace-scope variables. */ 6364 if (!processing_template_decl) 6365 DECL_INTERFACE_KNOWN (decl) = 1; 6366} 6367 6368/* Create a VAR_DECL named NAME with the indicated TYPE. 6369 6370 If SCOPE is non-NULL, it is the class type or namespace containing 6371 the variable. If SCOPE is NULL, the variable should is created in 6372 the innermost enclosings scope. */ 6373 6374static tree 6375grokvardecl (tree type, 6376 tree name, 6377 const cp_decl_specifier_seq *declspecs, 6378 int initialized, 6379 int constp, 6380 tree scope) 6381{ 6382 tree decl; 6383 tree explicit_scope; 6384 6385 gcc_assert (!name || TREE_CODE (name) == IDENTIFIER_NODE); 6386 6387 /* Compute the scope in which to place the variable, but remember 6388 whether or not that scope was explicitly specified by the user. */ 6389 explicit_scope = scope; 6390 if (!scope) 6391 { 6392 /* An explicit "extern" specifier indicates a namespace-scope 6393 variable. */ 6394 if (declspecs->storage_class == sc_extern) 6395 scope = current_namespace; 6396 else if (!at_function_scope_p ()) 6397 scope = current_scope (); 6398 } 6399 6400 if (scope 6401 && (/* If the variable is a namespace-scope variable declared in a 6402 template, we need DECL_LANG_SPECIFIC. */ 6403 (TREE_CODE (scope) == NAMESPACE_DECL && processing_template_decl) 6404 /* Similarly for namespace-scope variables with language linkage 6405 other than C++. */ 6406 || (TREE_CODE (scope) == NAMESPACE_DECL 6407 && current_lang_name != lang_name_cplusplus) 6408 /* Similarly for static data members. */ 6409 || TYPE_P (scope))) 6410 decl = build_lang_decl (VAR_DECL, name, type); 6411 else 6412 decl = build_decl (VAR_DECL, name, type); 6413 6414 if (explicit_scope && TREE_CODE (explicit_scope) == NAMESPACE_DECL) 6415 set_decl_namespace (decl, explicit_scope, 0); 6416 else 6417 DECL_CONTEXT (decl) = FROB_CONTEXT (scope); 6418 6419 if (declspecs->storage_class == sc_extern) 6420 { 6421 DECL_THIS_EXTERN (decl) = 1; 6422 DECL_EXTERNAL (decl) = !initialized; 6423 } 6424 6425 if (DECL_CLASS_SCOPE_P (decl)) 6426 { 6427 set_linkage_for_static_data_member (decl); 6428 /* This function is only called with out-of-class definitions. */ 6429 DECL_EXTERNAL (decl) = 0; 6430 check_class_member_definition_namespace (decl); 6431 } 6432 /* At top level, either `static' or no s.c. makes a definition 6433 (perhaps tentative), and absence of `static' makes it public. */ 6434 else if (toplevel_bindings_p ()) 6435 { 6436 TREE_PUBLIC (decl) = (declspecs->storage_class != sc_static 6437 && (DECL_THIS_EXTERN (decl) || ! constp)); 6438 TREE_STATIC (decl) = ! DECL_EXTERNAL (decl); 6439 } 6440 /* Not at top level, only `static' makes a static definition. */ 6441 else 6442 { 6443 TREE_STATIC (decl) = declspecs->storage_class == sc_static; 6444 TREE_PUBLIC (decl) = DECL_EXTERNAL (decl); 6445 } 6446 6447 if (declspecs->specs[(int)ds_thread]) 6448 { 6449 if (targetm.have_tls) 6450 DECL_TLS_MODEL (decl) = decl_default_tls_model (decl); 6451 else 6452 /* A mere warning is sure to result in improper semantics 6453 at runtime. Don't bother to allow this to compile. */ 6454 error ("thread-local storage not supported for this target"); 6455 } 6456 6457 if (TREE_PUBLIC (decl)) 6458 { 6459 /* [basic.link]: A name with no linkage (notably, the name of a class 6460 or enumeration declared in a local scope) shall not be used to 6461 declare an entity with linkage. 6462 6463 Only check this for public decls for now. */ 6464 tree t = no_linkage_check (TREE_TYPE (decl), /*relaxed_p=*/false); 6465 if (t) 6466 { 6467 if (TYPE_ANONYMOUS_P (t)) 6468 { 6469 if (DECL_EXTERN_C_P (decl)) 6470 /* Allow this; it's pretty common in C. */ 6471 ; 6472 else 6473 { 6474 /* DRs 132, 319 and 389 seem to indicate types with 6475 no linkage can only be used to declare extern "C" 6476 entities. Since it's not always an error in the 6477 ISO C++ 90 Standard, we only issue a warning. */ 6478 warning (0, "non-local variable %q#D uses anonymous type", 6479 decl); 6480 if (DECL_ORIGINAL_TYPE (TYPE_NAME (t))) 6481 warning (0, "%q+#D does not refer to the unqualified " 6482 "type, so it is not used for linkage", 6483 TYPE_NAME (t)); 6484 } 6485 } 6486 else 6487 warning (0, "non-local variable %q#D uses local type %qT", decl, t); 6488 } 6489 } 6490 else 6491 DECL_INTERFACE_KNOWN (decl) = 1; 6492 6493 return decl; 6494} 6495 6496/* Create and return a canonical pointer to member function type, for 6497 TYPE, which is a POINTER_TYPE to a METHOD_TYPE. */ 6498 6499tree 6500build_ptrmemfunc_type (tree type) 6501{ 6502 tree field, fields; 6503 tree t; 6504 tree unqualified_variant = NULL_TREE; 6505 6506 if (type == error_mark_node) 6507 return type; 6508 6509 /* If a canonical type already exists for this type, use it. We use 6510 this method instead of type_hash_canon, because it only does a 6511 simple equality check on the list of field members. */ 6512 6513 if ((t = TYPE_GET_PTRMEMFUNC_TYPE (type))) 6514 return t; 6515 6516 /* Make sure that we always have the unqualified pointer-to-member 6517 type first. */ 6518 if (cp_type_quals (type) != TYPE_UNQUALIFIED) 6519 unqualified_variant 6520 = build_ptrmemfunc_type (TYPE_MAIN_VARIANT (type)); 6521 6522 t = make_aggr_type (RECORD_TYPE); 6523 xref_basetypes (t, NULL_TREE); 6524 6525 /* Let the front-end know this is a pointer to member function... */ 6526 TYPE_PTRMEMFUNC_FLAG (t) = 1; 6527 /* ... and not really an aggregate. */ 6528 SET_IS_AGGR_TYPE (t, 0); 6529 6530 field = build_decl (FIELD_DECL, pfn_identifier, type); 6531 fields = field; 6532 6533 field = build_decl (FIELD_DECL, delta_identifier, delta_type_node); 6534 TREE_CHAIN (field) = fields; 6535 fields = field; 6536 6537 finish_builtin_struct (t, "__ptrmemfunc_type", fields, ptr_type_node); 6538 6539 /* Zap out the name so that the back-end will give us the debugging 6540 information for this anonymous RECORD_TYPE. */ 6541 TYPE_NAME (t) = NULL_TREE; 6542 6543 /* If this is not the unqualified form of this pointer-to-member 6544 type, set the TYPE_MAIN_VARIANT for this type to be the 6545 unqualified type. Since they are actually RECORD_TYPEs that are 6546 not variants of each other, we must do this manually. */ 6547 if (cp_type_quals (type) != TYPE_UNQUALIFIED) 6548 { 6549 t = build_qualified_type (t, cp_type_quals (type)); 6550 TYPE_MAIN_VARIANT (t) = unqualified_variant; 6551 TYPE_NEXT_VARIANT (t) = TYPE_NEXT_VARIANT (unqualified_variant); 6552 TYPE_NEXT_VARIANT (unqualified_variant) = t; 6553 } 6554 6555 /* Cache this pointer-to-member type so that we can find it again 6556 later. */ 6557 TYPE_SET_PTRMEMFUNC_TYPE (type, t); 6558 6559 return t; 6560} 6561 6562/* Create and return a pointer to data member type. */ 6563 6564tree 6565build_ptrmem_type (tree class_type, tree member_type) 6566{ 6567 if (TREE_CODE (member_type) == METHOD_TYPE) 6568 { 6569 tree arg_types; 6570 6571 arg_types = TYPE_ARG_TYPES (member_type); 6572 class_type = (cp_build_qualified_type 6573 (class_type, 6574 cp_type_quals (TREE_TYPE (TREE_VALUE (arg_types))))); 6575 member_type 6576 = build_method_type_directly (class_type, 6577 TREE_TYPE (member_type), 6578 TREE_CHAIN (arg_types)); 6579 return build_ptrmemfunc_type (build_pointer_type (member_type)); 6580 } 6581 else 6582 { 6583 gcc_assert (TREE_CODE (member_type) != FUNCTION_TYPE); 6584 return build_offset_type (class_type, member_type); 6585 } 6586} 6587 6588/* DECL is a VAR_DECL defined in-class, whose TYPE is also given. 6589 Check to see that the definition is valid. Issue appropriate error 6590 messages. Return 1 if the definition is particularly bad, or 0 6591 otherwise. */ 6592 6593int 6594check_static_variable_definition (tree decl, tree type) 6595{ 6596 /* Motion 10 at San Diego: If a static const integral data member is 6597 initialized with an integral constant expression, the initializer 6598 may appear either in the declaration (within the class), or in 6599 the definition, but not both. If it appears in the class, the 6600 member is a member constant. The file-scope definition is always 6601 required. */ 6602 if (!ARITHMETIC_TYPE_P (type) && TREE_CODE (type) != ENUMERAL_TYPE) 6603 { 6604 error ("invalid in-class initialization of static data member " 6605 "of non-integral type %qT", 6606 type); 6607 /* If we just return the declaration, crashes will sometimes 6608 occur. We therefore return void_type_node, as if this were a 6609 friend declaration, to cause callers to completely ignore 6610 this declaration. */ 6611 return 1; 6612 } 6613 else if (!CP_TYPE_CONST_P (type)) 6614 error ("ISO C++ forbids in-class initialization of non-const " 6615 "static member %qD", 6616 decl); 6617 else if (pedantic && !INTEGRAL_TYPE_P (type)) 6618 pedwarn ("ISO C++ forbids initialization of member constant " 6619 "%qD of non-integral type %qT", decl, type); 6620 6621 return 0; 6622} 6623 6624/* Given the SIZE (i.e., number of elements) in an array, compute an 6625 appropriate index type for the array. If non-NULL, NAME is the 6626 name of the thing being declared. */ 6627 6628tree 6629compute_array_index_type (tree name, tree size) 6630{ 6631 tree type; 6632 tree itype; 6633 6634 if (error_operand_p (size)) 6635 return error_mark_node; 6636 6637 type = TREE_TYPE (size); 6638 /* The array bound must be an integer type. */ 6639 if (!dependent_type_p (type) && !INTEGRAL_TYPE_P (type)) 6640 { 6641 if (name) 6642 error ("size of array %qD has non-integral type %qT", name, type); 6643 else 6644 error ("size of array has non-integral type %qT", type); 6645 size = integer_one_node; 6646 type = TREE_TYPE (size); 6647 } 6648 6649 if (abi_version_at_least (2) 6650 /* We should only handle value dependent expressions specially. */ 6651 ? value_dependent_expression_p (size) 6652 /* But for abi-1, we handled all instances in templates. This 6653 effects the manglings produced. */ 6654 : processing_template_decl) 6655 return build_index_type (build_min (MINUS_EXPR, sizetype, 6656 size, integer_one_node)); 6657 6658 /* The size might be the result of a cast. */ 6659 STRIP_TYPE_NOPS (size); 6660 6661 /* It might be a const variable or enumeration constant. */ 6662 size = integral_constant_value (size); 6663 6664 /* Normally, the array-bound will be a constant. */ 6665 if (TREE_CODE (size) == INTEGER_CST) 6666 { 6667 /* Check to see if the array bound overflowed. Make that an 6668 error, no matter how generous we're being. */ 6669 int old_flag_pedantic_errors = flag_pedantic_errors; 6670 int old_pedantic = pedantic; 6671 pedantic = flag_pedantic_errors = 1; 6672 constant_expression_warning (size); 6673 pedantic = old_pedantic; 6674 flag_pedantic_errors = old_flag_pedantic_errors; 6675 6676 /* An array must have a positive number of elements. */ 6677 if (INT_CST_LT (size, integer_zero_node)) 6678 { 6679 if (name) 6680 error ("size of array %qD is negative", name); 6681 else 6682 error ("size of array is negative"); 6683 size = integer_one_node; 6684 } 6685 /* As an extension we allow zero-sized arrays. We always allow 6686 them in system headers because glibc uses them. */ 6687 else if (integer_zerop (size) && pedantic && !in_system_header) 6688 { 6689 if (name) 6690 pedwarn ("ISO C++ forbids zero-size array %qD", name); 6691 else 6692 pedwarn ("ISO C++ forbids zero-size array"); 6693 } 6694 } 6695 else if (TREE_CONSTANT (size)) 6696 { 6697 /* `(int) &fn' is not a valid array bound. */ 6698 if (name) 6699 error ("size of array %qD is not an integral constant-expression", 6700 name); 6701 else 6702 error ("size of array is not an integral constant-expression"); 6703 size = integer_one_node; 6704 } 6705 else if (pedantic && warn_vla != 0) 6706 { 6707 if (name) 6708 pedwarn ("ISO C++ forbids variable length array %qD", name); 6709 else 6710 pedwarn ("ISO C++ forbids variable length array"); 6711 } 6712 else if (warn_vla > 0) 6713 { 6714 if (name) 6715 warning (OPT_Wvla, 6716 "variable length array %qD is used", name); 6717 else 6718 warning (OPT_Wvla, 6719 "variable length array is used"); 6720 } 6721 6722 if (processing_template_decl && !TREE_CONSTANT (size)) 6723 /* A variable sized array. */ 6724 itype = build_min (MINUS_EXPR, sizetype, size, integer_one_node); 6725 else 6726 { 6727 HOST_WIDE_INT saved_processing_template_decl; 6728 6729 /* Compute the index of the largest element in the array. It is 6730 one less than the number of elements in the array. We save 6731 and restore PROCESSING_TEMPLATE_DECL so that computations in 6732 cp_build_binary_op will be appropriately folded. */ 6733 saved_processing_template_decl = processing_template_decl; 6734 processing_template_decl = 0; 6735 itype = cp_build_binary_op (MINUS_EXPR, 6736 cp_convert (ssizetype, size), 6737 cp_convert (ssizetype, integer_one_node)); 6738 itype = fold (itype); 6739 processing_template_decl = saved_processing_template_decl; 6740 6741 if (!TREE_CONSTANT (itype)) 6742 /* A variable sized array. */ 6743 itype = variable_size (itype); 6744 /* Make sure that there was no overflow when creating to a signed 6745 index type. (For example, on a 32-bit machine, an array with 6746 size 2^32 - 1 is too big.) */ 6747 else if (TREE_CODE (itype) == INTEGER_CST 6748 && TREE_OVERFLOW (itype)) 6749 { 6750 error ("overflow in array dimension"); 6751 TREE_OVERFLOW (itype) = 0; 6752 } 6753 } 6754 6755 /* Create and return the appropriate index type. */ 6756 return build_index_type (itype); 6757} 6758 6759/* Returns the scope (if any) in which the entity declared by 6760 DECLARATOR will be located. If the entity was declared with an 6761 unqualified name, NULL_TREE is returned. */ 6762 6763tree 6764get_scope_of_declarator (const cp_declarator *declarator) 6765{ 6766 while (declarator && declarator->kind != cdk_id) 6767 declarator = declarator->declarator; 6768 6769 /* If the declarator-id is a SCOPE_REF, the scope in which the 6770 declaration occurs is the first operand. */ 6771 if (declarator 6772 && declarator->u.id.qualifying_scope) 6773 return declarator->u.id.qualifying_scope; 6774 6775 /* Otherwise, the declarator is not a qualified name; the entity will 6776 be declared in the current scope. */ 6777 return NULL_TREE; 6778} 6779 6780/* Returns an ARRAY_TYPE for an array with SIZE elements of the 6781 indicated TYPE. If non-NULL, NAME is the NAME of the declaration 6782 with this type. */ 6783 6784static tree 6785create_array_type_for_decl (tree name, tree type, tree size) 6786{ 6787 tree itype = NULL_TREE; 6788 const char* error_msg; 6789 6790 /* If things have already gone awry, bail now. */ 6791 if (type == error_mark_node || size == error_mark_node) 6792 return error_mark_node; 6793 6794 /* Assume that everything will go OK. */ 6795 error_msg = NULL; 6796 6797 /* There are some types which cannot be array elements. */ 6798 switch (TREE_CODE (type)) 6799 { 6800 case VOID_TYPE: 6801 error_msg = "array of void"; 6802 break; 6803 6804 case FUNCTION_TYPE: 6805 error_msg = "array of functions"; 6806 break; 6807 6808 case REFERENCE_TYPE: 6809 error_msg = "array of references"; 6810 break; 6811 6812 case METHOD_TYPE: 6813 error_msg = "array of function members"; 6814 break; 6815 6816 default: 6817 break; 6818 } 6819 6820 /* If something went wrong, issue an error-message and return. */ 6821 if (error_msg) 6822 { 6823 if (name) 6824 error ("declaration of %qD as %s", name, error_msg); 6825 else 6826 error ("creating %s", error_msg); 6827 6828 return error_mark_node; 6829 } 6830 6831 /* [dcl.array] 6832 6833 The constant expressions that specify the bounds of the arrays 6834 can be omitted only for the first member of the sequence. */ 6835 if (TREE_CODE (type) == ARRAY_TYPE && !TYPE_DOMAIN (type)) 6836 { 6837 if (name) 6838 error ("declaration of %qD as multidimensional array must " 6839 "have bounds for all dimensions except the first", 6840 name); 6841 else 6842 error ("multidimensional array must have bounds for all " 6843 "dimensions except the first"); 6844 6845 return error_mark_node; 6846 } 6847 6848 /* Figure out the index type for the array. */ 6849 if (size) 6850 itype = compute_array_index_type (name, size); 6851 6852 /* [dcl.array] 6853 T is called the array element type; this type shall not be [...] an 6854 abstract class type. */ 6855 abstract_virtuals_error (name, type); 6856 6857 return build_cplus_array_type (type, itype); 6858} 6859 6860/* Check that it's OK to declare a function with the indicated TYPE. 6861 SFK indicates the kind of special function (if any) that this 6862 function is. OPTYPE is the type given in a conversion operator 6863 declaration, or the class type for a constructor/destructor. 6864 Returns the actual return type of the function; that 6865 may be different than TYPE if an error occurs, or for certain 6866 special functions. */ 6867 6868static tree 6869check_special_function_return_type (special_function_kind sfk, 6870 tree type, 6871 tree optype) 6872{ 6873 switch (sfk) 6874 { 6875 case sfk_constructor: 6876 if (type) 6877 error ("return type specification for constructor invalid"); 6878 6879 if (targetm.cxx.cdtor_returns_this () && !TYPE_FOR_JAVA (optype)) 6880 type = build_pointer_type (optype); 6881 else 6882 type = void_type_node; 6883 break; 6884 6885 case sfk_destructor: 6886 if (type) 6887 error ("return type specification for destructor invalid"); 6888 /* We can't use the proper return type here because we run into 6889 problems with ambiguous bases and covariant returns. 6890 Java classes are left unchanged because (void *) isn't a valid 6891 Java type, and we don't want to change the Java ABI. */ 6892 if (targetm.cxx.cdtor_returns_this () && !TYPE_FOR_JAVA (optype)) 6893 type = build_pointer_type (void_type_node); 6894 else 6895 type = void_type_node; 6896 break; 6897 6898 case sfk_conversion: 6899 if (type && !same_type_p (type, optype)) 6900 error ("operator %qT declared to return %qT", optype, type); 6901 else if (type) 6902 pedwarn ("return type specified for %<operator %T%>", optype); 6903 type = optype; 6904 break; 6905 6906 default: 6907 gcc_unreachable (); 6908 } 6909 6910 return type; 6911} 6912 6913/* A variable or data member (whose unqualified name is IDENTIFIER) 6914 has been declared with the indicated TYPE. If the TYPE is not 6915 acceptable, issue an error message and return a type to use for 6916 error-recovery purposes. */ 6917 6918tree 6919check_var_type (tree identifier, tree type) 6920{ 6921 if (VOID_TYPE_P (type)) 6922 { 6923 if (!identifier) 6924 error ("unnamed variable or field declared void"); 6925 else if (TREE_CODE (identifier) == IDENTIFIER_NODE) 6926 { 6927 gcc_assert (!IDENTIFIER_OPNAME_P (identifier)); 6928 error ("variable or field %qE declared void", identifier); 6929 } 6930 else 6931 error ("variable or field declared void"); 6932 type = error_mark_node; 6933 } 6934 6935 return type; 6936} 6937 6938/* Given declspecs and a declarator (abstract or otherwise), determine 6939 the name and type of the object declared and construct a DECL node 6940 for it. 6941 6942 DECLSPECS is a chain of tree_list nodes whose value fields 6943 are the storage classes and type specifiers. 6944 6945 DECL_CONTEXT says which syntactic context this declaration is in: 6946 NORMAL for most contexts. Make a VAR_DECL or FUNCTION_DECL or TYPE_DECL. 6947 FUNCDEF for a function definition. Like NORMAL but a few different 6948 error messages in each case. Return value may be zero meaning 6949 this definition is too screwy to try to parse. 6950 MEMFUNCDEF for a function definition. Like FUNCDEF but prepares to 6951 handle member functions (which have FIELD context). 6952 Return value may be zero meaning this definition is too screwy to 6953 try to parse. 6954 PARM for a parameter declaration (either within a function prototype 6955 or before a function body). Make a PARM_DECL, or return void_type_node. 6956 CATCHPARM for a parameter declaration before a catch clause. 6957 TYPENAME if for a typename (in a cast or sizeof). 6958 Don't make a DECL node; just return the ..._TYPE node. 6959 FIELD for a struct or union field; make a FIELD_DECL. 6960 BITFIELD for a field with specified width. 6961 INITIALIZED is 1 if the decl has an initializer. 6962 6963 ATTRLIST is a pointer to the list of attributes, which may be NULL 6964 if there are none; *ATTRLIST may be modified if attributes from inside 6965 the declarator should be applied to the declaration. 6966 6967 When this function is called, scoping variables (such as 6968 CURRENT_CLASS_TYPE) should reflect the scope in which the 6969 declaration occurs, not the scope in which the new declaration will 6970 be placed. For example, on: 6971 6972 void S::f() { ... } 6973 6974 when grokdeclarator is called for `S::f', the CURRENT_CLASS_TYPE 6975 should not be `S'. 6976 6977 Returns a DECL (if a declarator is present), a TYPE (if there is no 6978 declarator, in cases like "struct S;"), or the ERROR_MARK_NODE if an 6979 error occurs. */ 6980 6981tree 6982grokdeclarator (const cp_declarator *declarator, 6983 const cp_decl_specifier_seq *declspecs, 6984 enum decl_context decl_context, 6985 int initialized, 6986 tree* attrlist) 6987{ 6988 tree type = NULL_TREE; 6989 int longlong = 0; 6990 int virtualp, explicitp, friendp, inlinep, staticp; 6991 int explicit_int = 0; 6992 int explicit_char = 0; 6993 int defaulted_int = 0; 6994 tree dependent_name = NULL_TREE; 6995 6996 tree typedef_decl = NULL_TREE; 6997 const char *name = NULL; 6998 tree typedef_type = NULL_TREE; 6999 /* True if this declarator is a function definition. */ 7000 bool funcdef_flag = false; 7001 cp_declarator_kind innermost_code = cdk_error; 7002 int bitfield = 0; 7003#if 0 7004 /* See the code below that used this. */ 7005 tree decl_attr = NULL_TREE; 7006#endif 7007 7008 /* Keep track of what sort of function is being processed 7009 so that we can warn about default return values, or explicit 7010 return values which do not match prescribed defaults. */ 7011 special_function_kind sfk = sfk_none; 7012 7013 tree dname = NULL_TREE; 7014 tree ctor_return_type = NULL_TREE; 7015 enum overload_flags flags = NO_SPECIAL; 7016 /* cv-qualifiers that apply to the declarator, for a declaration of 7017 a member function. */ 7018 cp_cv_quals memfn_quals = TYPE_UNQUALIFIED; 7019 /* cv-qualifiers that apply to the type specified by the DECLSPECS. */ 7020 int type_quals; 7021 tree raises = NULL_TREE; 7022 int template_count = 0; 7023 tree returned_attrs = NULL_TREE; 7024 tree parms = NULL_TREE; 7025 const cp_declarator *id_declarator; 7026 /* The unqualified name of the declarator; either an 7027 IDENTIFIER_NODE, BIT_NOT_EXPR, or TEMPLATE_ID_EXPR. */ 7028 tree unqualified_id; 7029 /* The class type, if any, in which this entity is located, 7030 or NULL_TREE if none. Note that this value may be different from 7031 the current class type; for example if an attempt is made to declare 7032 "A::f" inside "B", this value will be "A". */ 7033 tree ctype = current_class_type; 7034 /* The NAMESPACE_DECL for the namespace in which this entity is 7035 located. If an unqualified name is used to declare the entity, 7036 this value will be NULL_TREE, even if the entity is located at 7037 namespace scope. */ 7038 tree in_namespace = NULL_TREE; 7039 cp_storage_class storage_class; 7040 bool unsigned_p, signed_p, short_p, long_p, thread_p; 7041 bool type_was_error_mark_node = false; 7042 7043 signed_p = declspecs->specs[(int)ds_signed]; 7044 unsigned_p = declspecs->specs[(int)ds_unsigned]; 7045 short_p = declspecs->specs[(int)ds_short]; 7046 long_p = declspecs->specs[(int)ds_long]; 7047 longlong = declspecs->specs[(int)ds_long] >= 2; 7048 thread_p = declspecs->specs[(int)ds_thread]; 7049 7050 if (decl_context == FUNCDEF) 7051 funcdef_flag = true, decl_context = NORMAL; 7052 else if (decl_context == MEMFUNCDEF) 7053 funcdef_flag = true, decl_context = FIELD; 7054 else if (decl_context == BITFIELD) 7055 bitfield = 1, decl_context = FIELD; 7056 7057 /* Look inside a declarator for the name being declared 7058 and get it as a string, for an error message. */ 7059 for (id_declarator = declarator; 7060 id_declarator; 7061 id_declarator = id_declarator->declarator) 7062 { 7063 if (id_declarator->kind != cdk_id) 7064 innermost_code = id_declarator->kind; 7065 7066 switch (id_declarator->kind) 7067 { 7068 case cdk_function: 7069 if (id_declarator->declarator 7070 && id_declarator->declarator->kind == cdk_id) 7071 { 7072 sfk = id_declarator->declarator->u.id.sfk; 7073 if (sfk == sfk_destructor) 7074 flags = DTOR_FLAG; 7075 } 7076 break; 7077 7078 case cdk_id: 7079 { 7080 tree qualifying_scope = id_declarator->u.id.qualifying_scope; 7081 tree decl = id_declarator->u.id.unqualified_name; 7082 if (!decl) 7083 break; 7084 if (qualifying_scope) 7085 { 7086 if (at_function_scope_p ()) 7087 { 7088 /* [dcl.meaning] 7089 7090 A declarator-id shall not be qualified except 7091 for ... 7092 7093 None of the cases are permitted in block 7094 scope. */ 7095 if (qualifying_scope == global_namespace) 7096 error ("invalid use of qualified-name %<::%D%>", 7097 decl); 7098 else if (TYPE_P (qualifying_scope)) 7099 error ("invalid use of qualified-name %<%T::%D%>", 7100 qualifying_scope, decl); 7101 else 7102 error ("invalid use of qualified-name %<%D::%D%>", 7103 qualifying_scope, decl); 7104 return error_mark_node; 7105 } 7106 else if (TYPE_P (qualifying_scope)) 7107 { 7108 ctype = qualifying_scope; 7109 if (innermost_code != cdk_function 7110 && current_class_type 7111 && !UNIQUELY_DERIVED_FROM_P (ctype, 7112 current_class_type)) 7113 { 7114 error ("type %qT is not derived from type %qT", 7115 ctype, current_class_type); 7116 return error_mark_node; 7117 } 7118 } 7119 else if (TREE_CODE (qualifying_scope) == NAMESPACE_DECL) 7120 in_namespace = qualifying_scope; 7121 } 7122 switch (TREE_CODE (decl)) 7123 { 7124 case BIT_NOT_EXPR: 7125 { 7126 tree type; 7127 7128 if (innermost_code != cdk_function) 7129 { 7130 error ("declaration of %qD as non-function", decl); 7131 return error_mark_node; 7132 } 7133 else if (!qualifying_scope 7134 && !(current_class_type && at_class_scope_p ())) 7135 { 7136 error ("declaration of %qD as non-member", decl); 7137 return error_mark_node; 7138 } 7139 7140 type = TREE_OPERAND (decl, 0); 7141 name = IDENTIFIER_POINTER (constructor_name (type)); 7142 dname = decl; 7143 } 7144 break; 7145 7146 case TEMPLATE_ID_EXPR: 7147 { 7148 tree fns = TREE_OPERAND (decl, 0); 7149 7150 dname = fns; 7151 if (TREE_CODE (dname) != IDENTIFIER_NODE) 7152 { 7153 gcc_assert (is_overloaded_fn (dname)); 7154 dname = DECL_NAME (get_first_fn (dname)); 7155 } 7156 } 7157 /* Fall through. */ 7158 7159 case IDENTIFIER_NODE: 7160 if (TREE_CODE (decl) == IDENTIFIER_NODE) 7161 dname = decl; 7162 7163 if (C_IS_RESERVED_WORD (dname)) 7164 { 7165 error ("declarator-id missing; using reserved word %qD", 7166 dname); 7167 name = IDENTIFIER_POINTER (dname); 7168 } 7169 else if (!IDENTIFIER_TYPENAME_P (dname)) 7170 name = IDENTIFIER_POINTER (dname); 7171 else 7172 { 7173 gcc_assert (flags == NO_SPECIAL); 7174 flags = TYPENAME_FLAG; 7175 ctor_return_type = TREE_TYPE (dname); 7176 sfk = sfk_conversion; 7177 if (is_typename_at_global_scope (dname)) 7178 name = IDENTIFIER_POINTER (dname); 7179 else 7180 name = "<invalid operator>"; 7181 } 7182 break; 7183 7184 default: 7185 gcc_unreachable (); 7186 } 7187 break; 7188 7189 case cdk_array: 7190 case cdk_pointer: 7191 case cdk_reference: 7192 case cdk_ptrmem: 7193 break; 7194 7195 case cdk_error: 7196 return error_mark_node; 7197 7198 default: 7199 gcc_unreachable (); 7200 } 7201 } 7202 if (id_declarator->kind == cdk_id) 7203 break; 7204 } 7205 7206 /* [dcl.fct.edf] 7207 7208 The declarator in a function-definition shall have the form 7209 D1 ( parameter-declaration-clause) ... */ 7210 if (funcdef_flag && innermost_code != cdk_function) 7211 { 7212 error ("function definition does not declare parameters"); 7213 return error_mark_node; 7214 } 7215 7216 if (((dname && IDENTIFIER_OPNAME_P (dname)) || flags == TYPENAME_FLAG) 7217 && innermost_code != cdk_function 7218 && ! (ctype && !declspecs->any_specifiers_p)) 7219 { 7220 error ("declaration of %qD as non-function", dname); 7221 return error_mark_node; 7222 } 7223 7224 /* Anything declared one level down from the top level 7225 must be one of the parameters of a function 7226 (because the body is at least two levels down). */ 7227 7228 /* This heuristic cannot be applied to C++ nodes! Fixed, however, 7229 by not allowing C++ class definitions to specify their parameters 7230 with xdecls (must be spec.d in the parmlist). 7231 7232 Since we now wait to push a class scope until we are sure that 7233 we are in a legitimate method context, we must set oldcname 7234 explicitly (since current_class_name is not yet alive). 7235 7236 We also want to avoid calling this a PARM if it is in a namespace. */ 7237 7238 if (decl_context == NORMAL && !toplevel_bindings_p ()) 7239 { 7240 struct cp_binding_level *b = current_binding_level; 7241 current_binding_level = b->level_chain; 7242 if (current_binding_level != 0 && toplevel_bindings_p ()) 7243 decl_context = PARM; 7244 current_binding_level = b; 7245 } 7246 7247 if (name == NULL) 7248 name = decl_context == PARM ? "parameter" : "type name"; 7249 7250 /* If there were multiple types specified in the decl-specifier-seq, 7251 issue an error message. */ 7252 if (declspecs->multiple_types_p) 7253 { 7254 error ("two or more data types in declaration of %qs", name); 7255 return error_mark_node; 7256 } 7257 7258 /* Extract the basic type from the decl-specifier-seq. */ 7259 type = declspecs->type; 7260 if (type == error_mark_node) 7261 { 7262 type = NULL_TREE; 7263 type_was_error_mark_node = true; 7264 } 7265 /* If the entire declaration is itself tagged as deprecated then 7266 suppress reports of deprecated items. */ 7267 if (type && TREE_DEPRECATED (type) 7268 && deprecated_state != DEPRECATED_SUPPRESS) 7269 warn_deprecated_use (type); 7270 if (type && TREE_CODE (type) == TYPE_DECL) 7271 { 7272 typedef_decl = type; 7273 type = TREE_TYPE (typedef_decl); 7274 } 7275 /* No type at all: default to `int', and set DEFAULTED_INT 7276 because it was not a user-defined typedef. */ 7277 if (type == NULL_TREE && (signed_p || unsigned_p || long_p || short_p)) 7278 { 7279 /* These imply 'int'. */ 7280 type = integer_type_node; 7281 defaulted_int = 1; 7282 } 7283 /* Gather flags. */ 7284 explicit_int = declspecs->explicit_int_p; 7285 explicit_char = declspecs->explicit_char_p; 7286 7287#if 0 7288 /* See the code below that used this. */ 7289 if (typedef_decl) 7290 decl_attr = DECL_ATTRIBUTES (typedef_decl); 7291#endif 7292 typedef_type = type; 7293 7294 7295 if (sfk != sfk_conversion) 7296 ctor_return_type = ctype; 7297 7298 if (sfk != sfk_none) 7299 type = check_special_function_return_type (sfk, type, 7300 ctor_return_type); 7301 else if (type == NULL_TREE) 7302 { 7303 int is_main; 7304 7305 explicit_int = -1; 7306 7307 /* We handle `main' specially here, because 'main () { }' is so 7308 common. With no options, it is allowed. With -Wreturn-type, 7309 it is a warning. It is only an error with -pedantic-errors. */ 7310 is_main = (funcdef_flag 7311 && dname && MAIN_NAME_P (dname) 7312 && ctype == NULL_TREE 7313 && in_namespace == NULL_TREE 7314 && current_namespace == global_namespace); 7315 7316 if (type_was_error_mark_node) 7317 /* We've already issued an error, don't complain more. */; 7318 else if (in_system_header || flag_ms_extensions) 7319 /* Allow it, sigh. */; 7320 else if (pedantic || ! is_main) 7321 pedwarn ("ISO C++ forbids declaration of %qs with no type", name); 7322 else if (warn_return_type) 7323 warning (0, "ISO C++ forbids declaration of %qs with no type", name); 7324 7325 type = integer_type_node; 7326 } 7327 7328 ctype = NULL_TREE; 7329 7330 /* Now process the modifiers that were specified 7331 and check for invalid combinations. */ 7332 7333 /* Long double is a special combination. */ 7334 if (long_p && !longlong && TYPE_MAIN_VARIANT (type) == double_type_node) 7335 { 7336 long_p = false; 7337 type = build_qualified_type (long_double_type_node, 7338 cp_type_quals (type)); 7339 } 7340 7341 /* Check all other uses of type modifiers. */ 7342 7343 if (unsigned_p || signed_p || long_p || short_p) 7344 { 7345 int ok = 0; 7346 7347 if ((signed_p || unsigned_p) && TREE_CODE (type) != INTEGER_TYPE) 7348 error ("%<signed%> or %<unsigned%> invalid for %qs", name); 7349 else if (signed_p && unsigned_p) 7350 error ("%<signed%> and %<unsigned%> specified together for %qs", name); 7351 else if (longlong && TREE_CODE (type) != INTEGER_TYPE) 7352 error ("%<long long%> invalid for %qs", name); 7353 else if (long_p && TREE_CODE (type) == REAL_TYPE) 7354 error ("%<long%> invalid for %qs", name); 7355 else if (short_p && TREE_CODE (type) == REAL_TYPE) 7356 error ("%<short%> invalid for %qs", name); 7357 else if ((long_p || short_p) && TREE_CODE (type) != INTEGER_TYPE) 7358 error ("%<long%> or %<short%> invalid for %qs", name); 7359 else if ((long_p || short_p) && explicit_char) 7360 error ("%<long%> or %<short%> specified with char for %qs", name); 7361 else if (long_p && short_p) 7362 error ("%<long%> and %<short%> specified together for %qs", name); 7363 else 7364 { 7365 ok = 1; 7366 if (!explicit_int && !defaulted_int && !explicit_char && pedantic) 7367 { 7368 pedwarn ("long, short, signed or unsigned used invalidly for %qs", 7369 name); 7370 if (flag_pedantic_errors) 7371 ok = 0; 7372 } 7373 } 7374 7375 /* Discard the type modifiers if they are invalid. */ 7376 if (! ok) 7377 { 7378 unsigned_p = false; 7379 signed_p = false; 7380 long_p = false; 7381 short_p = false; 7382 longlong = 0; 7383 } 7384 } 7385 7386 /* Decide whether an integer type is signed or not. 7387 Optionally treat bitfields as signed by default. */ 7388 if (unsigned_p 7389 /* [class.bit] 7390 7391 It is implementation-defined whether a plain (neither 7392 explicitly signed or unsigned) char, short, int, or long 7393 bit-field is signed or unsigned. 7394 7395 Naturally, we extend this to long long as well. Note that 7396 this does not include wchar_t. */ 7397 || (bitfield && !flag_signed_bitfields 7398 && !signed_p 7399 /* A typedef for plain `int' without `signed' can be 7400 controlled just like plain `int', but a typedef for 7401 `signed int' cannot be so controlled. */ 7402 && !(typedef_decl 7403 && C_TYPEDEF_EXPLICITLY_SIGNED (typedef_decl)) 7404 && TREE_CODE (type) == INTEGER_TYPE 7405 && !same_type_p (TYPE_MAIN_VARIANT (type), wchar_type_node))) 7406 { 7407 if (longlong) 7408 type = long_long_unsigned_type_node; 7409 else if (long_p) 7410 type = long_unsigned_type_node; 7411 else if (short_p) 7412 type = short_unsigned_type_node; 7413 else if (type == char_type_node) 7414 type = unsigned_char_type_node; 7415 else if (typedef_decl) 7416 type = c_common_unsigned_type (type); 7417 else 7418 type = unsigned_type_node; 7419 } 7420 else if (signed_p && type == char_type_node) 7421 type = signed_char_type_node; 7422 else if (longlong) 7423 type = long_long_integer_type_node; 7424 else if (long_p) 7425 type = long_integer_type_node; 7426 else if (short_p) 7427 type = short_integer_type_node; 7428 7429 if (declspecs->specs[(int)ds_complex]) 7430 { 7431 if (TREE_CODE (type) != INTEGER_TYPE && TREE_CODE (type) != REAL_TYPE) 7432 error ("complex invalid for %qs", name); 7433 /* If we just have "complex", it is equivalent to 7434 "complex double", but if any modifiers at all are specified it is 7435 the complex form of TYPE. E.g, "complex short" is 7436 "complex short int". */ 7437 7438 else if (defaulted_int && ! longlong 7439 && ! (long_p || short_p || signed_p || unsigned_p)) 7440 type = complex_double_type_node; 7441 else if (type == integer_type_node) 7442 type = complex_integer_type_node; 7443 else if (type == float_type_node) 7444 type = complex_float_type_node; 7445 else if (type == double_type_node) 7446 type = complex_double_type_node; 7447 else if (type == long_double_type_node) 7448 type = complex_long_double_type_node; 7449 else 7450 type = build_complex_type (type); 7451 } 7452 7453 type_quals = TYPE_UNQUALIFIED; 7454 if (declspecs->specs[(int)ds_const]) 7455 type_quals |= TYPE_QUAL_CONST; 7456 if (declspecs->specs[(int)ds_volatile]) 7457 type_quals |= TYPE_QUAL_VOLATILE; 7458 if (declspecs->specs[(int)ds_restrict]) 7459 type_quals |= TYPE_QUAL_RESTRICT; 7460 if (sfk == sfk_conversion && type_quals != TYPE_UNQUALIFIED) 7461 error ("qualifiers are not allowed on declaration of %<operator %T%>", 7462 ctor_return_type); 7463 7464 if (TREE_CODE (type) == FUNCTION_TYPE 7465 && type_quals != TYPE_UNQUALIFIED) 7466 { 7467 /* This was an error in C++98 (cv-qualifiers cannot be added to 7468 a function type), but DR 295 makes the code well-formed by 7469 dropping the extra qualifiers. */ 7470 if (pedantic) 7471 { 7472 tree bad_type = build_qualified_type (type, type_quals); 7473 pedwarn ("ignoring %qV qualifiers added to function type %qT", 7474 bad_type, type); 7475 } 7476 type_quals = TYPE_UNQUALIFIED; 7477 } 7478 type_quals |= cp_type_quals (type); 7479 type = cp_build_qualified_type_real 7480 (type, type_quals, ((typedef_decl && !DECL_ARTIFICIAL (typedef_decl) 7481 ? tf_ignore_bad_quals : 0) | tf_warning_or_error)); 7482 /* We might have ignored or rejected some of the qualifiers. */ 7483 type_quals = cp_type_quals (type); 7484 7485 staticp = 0; 7486 inlinep = !! declspecs->specs[(int)ds_inline]; 7487 virtualp = !! declspecs->specs[(int)ds_virtual]; 7488 explicitp = !! declspecs->specs[(int)ds_explicit]; 7489 7490 storage_class = declspecs->storage_class; 7491 if (storage_class == sc_static) 7492 staticp = 1 + (decl_context == FIELD); 7493 7494 if (virtualp && staticp == 2) 7495 { 7496 error ("member %qD cannot be declared both virtual and static", dname); 7497 storage_class = sc_none; 7498 staticp = 0; 7499 } 7500 friendp = !! declspecs->specs[(int)ds_friend]; 7501 7502 if (dependent_name && !friendp) 7503 { 7504 error ("%<%T::%D%> is not a valid declarator", ctype, dependent_name); 7505 return error_mark_node; 7506 } 7507 7508 /* Issue errors about use of storage classes for parameters. */ 7509 if (decl_context == PARM) 7510 { 7511 if (declspecs->specs[(int)ds_typedef]) 7512 { 7513 error ("typedef declaration invalid in parameter declaration"); 7514 return error_mark_node; 7515 } 7516 else if (storage_class == sc_static 7517 || storage_class == sc_extern 7518 || thread_p) 7519 error ("storage class specifiers invalid in parameter declarations"); 7520 } 7521 7522 /* Give error if `virtual' is used outside of class declaration. */ 7523 if (virtualp 7524 && (current_class_name == NULL_TREE || decl_context != FIELD)) 7525 { 7526 error ("virtual outside class declaration"); 7527 virtualp = 0; 7528 } 7529 7530 /* Static anonymous unions are dealt with here. */ 7531 if (staticp && decl_context == TYPENAME 7532 && declspecs->type 7533 && ANON_AGGR_TYPE_P (declspecs->type)) 7534 decl_context = FIELD; 7535 7536 /* Warn about storage classes that are invalid for certain 7537 kinds of declarations (parameters, typenames, etc.). */ 7538 if (thread_p 7539 && ((storage_class 7540 && storage_class != sc_extern 7541 && storage_class != sc_static) 7542 || declspecs->specs[(int)ds_typedef])) 7543 { 7544 error ("multiple storage classes in declaration of %qs", name); 7545 thread_p = false; 7546 } 7547 if (declspecs->conflicting_specifiers_p) 7548 { 7549 error ("conflicting specifiers in declaration of %qs", name); 7550 storage_class = sc_none; 7551 } 7552 else if (decl_context != NORMAL 7553 && ((storage_class != sc_none 7554 && storage_class != sc_mutable) 7555 || thread_p)) 7556 { 7557 if ((decl_context == PARM || decl_context == CATCHPARM) 7558 && (storage_class == sc_register 7559 || storage_class == sc_auto)) 7560 ; 7561 else if (declspecs->specs[(int)ds_typedef]) 7562 ; 7563 else if (decl_context == FIELD 7564 /* C++ allows static class elements. */ 7565 && storage_class == sc_static) 7566 /* C++ also allows inlines and signed and unsigned elements, 7567 but in those cases we don't come in here. */ 7568 ; 7569 else 7570 { 7571 if (decl_context == FIELD) 7572 error ("storage class specified for %qs", name); 7573 else 7574 { 7575 if (decl_context == PARM || decl_context == CATCHPARM) 7576 error ("storage class specified for parameter %qs", name); 7577 else 7578 error ("storage class specified for typename"); 7579 } 7580 if (storage_class == sc_register 7581 || storage_class == sc_auto 7582 || storage_class == sc_extern 7583 || thread_p) 7584 storage_class = sc_none; 7585 } 7586 } 7587 else if (storage_class == sc_extern && initialized 7588 && !funcdef_flag) 7589 { 7590 if (toplevel_bindings_p ()) 7591 { 7592 /* It's common practice (and completely valid) to have a const 7593 be initialized and declared extern. */ 7594 if (!(type_quals & TYPE_QUAL_CONST)) 7595 warning (0, "%qs initialized and declared %<extern%>", name); 7596 } 7597 else 7598 error ("%qs has both %<extern%> and initializer", name); 7599 } 7600 else if (storage_class == sc_extern && funcdef_flag 7601 && ! toplevel_bindings_p ()) 7602 error ("nested function %qs declared %<extern%>", name); 7603 else if (toplevel_bindings_p ()) 7604 { 7605 if (storage_class == sc_auto) 7606 error ("top-level declaration of %qs specifies %<auto%>", name); 7607 } 7608 else if (thread_p 7609 && storage_class != sc_extern 7610 && storage_class != sc_static) 7611 { 7612 error ("function-scope %qs implicitly auto and declared %<__thread%>", 7613 name); 7614 thread_p = false; 7615 } 7616 7617 if (storage_class && friendp) 7618 error ("storage class specifiers invalid in friend function declarations"); 7619 7620 if (!id_declarator) 7621 unqualified_id = NULL_TREE; 7622 else 7623 { 7624 unqualified_id = id_declarator->u.id.unqualified_name; 7625 switch (TREE_CODE (unqualified_id)) 7626 { 7627 case BIT_NOT_EXPR: 7628 unqualified_id 7629 = constructor_name (TREE_OPERAND (unqualified_id, 0)); 7630 break; 7631 7632 case IDENTIFIER_NODE: 7633 case TEMPLATE_ID_EXPR: 7634 break; 7635 7636 default: 7637 gcc_unreachable (); 7638 } 7639 } 7640 7641 /* Determine the type of the entity declared by recurring on the 7642 declarator. */ 7643 for (; declarator; declarator = declarator->declarator) 7644 { 7645 const cp_declarator *inner_declarator; 7646 tree attrs; 7647 7648 if (type == error_mark_node) 7649 return error_mark_node; 7650 7651 attrs = declarator->attributes; 7652 if (attrs) 7653 { 7654 int attr_flags; 7655 7656 attr_flags = 0; 7657 if (declarator == NULL || declarator->kind == cdk_id) 7658 attr_flags |= (int) ATTR_FLAG_DECL_NEXT; 7659 if (declarator->kind == cdk_function) 7660 attr_flags |= (int) ATTR_FLAG_FUNCTION_NEXT; 7661 if (declarator->kind == cdk_array) 7662 attr_flags |= (int) ATTR_FLAG_ARRAY_NEXT; 7663 returned_attrs = decl_attributes (&type, 7664 chainon (returned_attrs, attrs), 7665 attr_flags); 7666 } 7667 7668 if (declarator->kind == cdk_id) 7669 break; 7670 7671 inner_declarator = declarator->declarator; 7672 7673 switch (declarator->kind) 7674 { 7675 case cdk_array: 7676 type = create_array_type_for_decl (dname, type, 7677 declarator->u.array.bounds); 7678 break; 7679 7680 case cdk_function: 7681 { 7682 tree arg_types; 7683 int funcdecl_p; 7684 7685 /* Declaring a function type. 7686 Make sure we have a valid type for the function to return. */ 7687 7688 /* We now know that the TYPE_QUALS don't apply to the 7689 decl, but to its return type. */ 7690 type_quals = TYPE_UNQUALIFIED; 7691 7692 /* Warn about some types functions can't return. */ 7693 7694 if (TREE_CODE (type) == FUNCTION_TYPE) 7695 { 7696 error ("%qs declared as function returning a function", name); 7697 type = integer_type_node; 7698 } 7699 if (TREE_CODE (type) == ARRAY_TYPE) 7700 { 7701 error ("%qs declared as function returning an array", name); 7702 type = integer_type_node; 7703 } 7704 7705 /* Pick up type qualifiers which should be applied to `this'. */ 7706 memfn_quals = declarator->u.function.qualifiers; 7707 7708 /* Pick up the exception specifications. */ 7709 raises = declarator->u.function.exception_specification; 7710 7711 /* Say it's a definition only for the CALL_EXPR 7712 closest to the identifier. */ 7713 funcdecl_p = inner_declarator && inner_declarator->kind == cdk_id; 7714 7715 if (ctype == NULL_TREE 7716 && decl_context == FIELD 7717 && funcdecl_p 7718 && (friendp == 0 || dname == current_class_name)) 7719 ctype = current_class_type; 7720 7721 if (ctype && (sfk == sfk_constructor 7722 || sfk == sfk_destructor)) 7723 { 7724 /* We are within a class's scope. If our declarator name 7725 is the same as the class name, and we are defining 7726 a function, then it is a constructor/destructor, and 7727 therefore returns a void type. */ 7728 7729 /* ISO C++ 12.4/2. A destructor may not be declared 7730 const or volatile. A destructor may not be 7731 static. 7732 7733 ISO C++ 12.1. A constructor may not be declared 7734 const or volatile. A constructor may not be 7735 virtual. A constructor may not be static. */ 7736 if (staticp == 2) 7737 error ((flags == DTOR_FLAG) 7738 ? "destructor cannot be static member function" 7739 : "constructor cannot be static member function"); 7740 if (memfn_quals) 7741 { 7742 error ((flags == DTOR_FLAG) 7743 ? "destructors may not be cv-qualified" 7744 : "constructors may not be cv-qualified"); 7745 memfn_quals = TYPE_UNQUALIFIED; 7746 } 7747 7748 if (decl_context == FIELD 7749 && !member_function_or_else (ctype, 7750 current_class_type, 7751 flags)) 7752 return error_mark_node; 7753 7754 if (flags != DTOR_FLAG) 7755 { 7756 /* It's a constructor. */ 7757 if (explicitp == 1) 7758 explicitp = 2; 7759 if (virtualp) 7760 { 7761 pedwarn ("constructors cannot be declared virtual"); 7762 virtualp = 0; 7763 } 7764 if (decl_context == FIELD 7765 && sfk != sfk_constructor) 7766 return error_mark_node; 7767 } 7768 if (decl_context == FIELD) 7769 staticp = 0; 7770 } 7771 else if (friendp) 7772 { 7773 if (initialized) 7774 error ("can't initialize friend function %qs", name); 7775 if (virtualp) 7776 { 7777 /* Cannot be both friend and virtual. */ 7778 error ("virtual functions cannot be friends"); 7779 friendp = 0; 7780 } 7781 if (decl_context == NORMAL) 7782 error ("friend declaration not in class definition"); 7783 if (current_function_decl && funcdef_flag) 7784 error ("can't define friend function %qs in a local " 7785 "class definition", 7786 name); 7787 } 7788 7789 arg_types = grokparms (declarator->u.function.parameters, 7790 &parms); 7791 7792 if (inner_declarator 7793 && inner_declarator->kind == cdk_id 7794 && inner_declarator->u.id.sfk == sfk_destructor 7795 && arg_types != void_list_node) 7796 { 7797 error ("destructors may not have parameters"); 7798 arg_types = void_list_node; 7799 parms = NULL_TREE; 7800 } 7801 7802 type = build_function_type (type, arg_types); 7803 } 7804 break; 7805 7806 case cdk_pointer: 7807 case cdk_reference: 7808 case cdk_ptrmem: 7809 /* Filter out pointers-to-references and references-to-references. 7810 We can get these if a TYPE_DECL is used. */ 7811 7812 if (TREE_CODE (type) == REFERENCE_TYPE) 7813 { 7814 error (declarator->kind == cdk_reference 7815 ? "cannot declare reference to %q#T" 7816 : "cannot declare pointer to %q#T", type); 7817 type = TREE_TYPE (type); 7818 } 7819 else if (VOID_TYPE_P (type)) 7820 { 7821 if (declarator->kind == cdk_reference) 7822 error ("cannot declare reference to %q#T", type); 7823 else if (declarator->kind == cdk_ptrmem) 7824 error ("cannot declare pointer to %q#T member", type); 7825 } 7826 7827 /* We now know that the TYPE_QUALS don't apply to the decl, 7828 but to the target of the pointer. */ 7829 type_quals = TYPE_UNQUALIFIED; 7830 7831 if (declarator->kind == cdk_ptrmem 7832 && (TREE_CODE (type) == FUNCTION_TYPE || memfn_quals)) 7833 { 7834 memfn_quals |= cp_type_quals (type); 7835 type = build_memfn_type (type, 7836 declarator->u.pointer.class_type, 7837 memfn_quals); 7838 memfn_quals = TYPE_UNQUALIFIED; 7839 } 7840 7841 if (declarator->kind == cdk_reference) 7842 { 7843 if (!VOID_TYPE_P (type)) 7844 type = build_reference_type (type); 7845 } 7846 else if (TREE_CODE (type) == METHOD_TYPE) 7847 type = build_ptrmemfunc_type (build_pointer_type (type)); 7848 else if (declarator->kind == cdk_ptrmem) 7849 { 7850 gcc_assert (TREE_CODE (declarator->u.pointer.class_type) 7851 != NAMESPACE_DECL); 7852 if (declarator->u.pointer.class_type == error_mark_node) 7853 /* We will already have complained. */ 7854 type = error_mark_node; 7855 else 7856 type = build_ptrmem_type (declarator->u.pointer.class_type, 7857 type); 7858 } 7859 else 7860 type = build_pointer_type (type); 7861 7862 /* Process a list of type modifier keywords (such as 7863 const or volatile) that were given inside the `*' or `&'. */ 7864 7865 if (declarator->u.pointer.qualifiers) 7866 { 7867 type 7868 = cp_build_qualified_type (type, 7869 declarator->u.pointer.qualifiers); 7870 type_quals = cp_type_quals (type); 7871 } 7872 ctype = NULL_TREE; 7873 break; 7874 7875 case cdk_error: 7876 break; 7877 7878 default: 7879 gcc_unreachable (); 7880 } 7881 } 7882 7883 if (unqualified_id && TREE_CODE (unqualified_id) == TEMPLATE_ID_EXPR 7884 && TREE_CODE (type) != FUNCTION_TYPE 7885 && TREE_CODE (type) != METHOD_TYPE) 7886 { 7887 error ("template-id %qD used as a declarator", 7888 unqualified_id); 7889 unqualified_id = dname; 7890 } 7891 7892 /* If TYPE is a FUNCTION_TYPE, but the function name was explicitly 7893 qualified with a class-name, turn it into a METHOD_TYPE, unless 7894 we know that the function is static. We take advantage of this 7895 opportunity to do other processing that pertains to entities 7896 explicitly declared to be class members. Note that if DECLARATOR 7897 is non-NULL, we know it is a cdk_id declarator; otherwise, we 7898 would not have exited the loop above. */ 7899 if (declarator 7900 && declarator->u.id.qualifying_scope 7901 && TYPE_P (declarator->u.id.qualifying_scope)) 7902 { 7903 tree t; 7904 7905 ctype = declarator->u.id.qualifying_scope; 7906 ctype = TYPE_MAIN_VARIANT (ctype); 7907 t = ctype; 7908 while (t != NULL_TREE && CLASS_TYPE_P (t)) 7909 { 7910 /* You're supposed to have one `template <...>' for every 7911 template class, but you don't need one for a full 7912 specialization. For example: 7913 7914 template <class T> struct S{}; 7915 template <> struct S<int> { void f(); }; 7916 void S<int>::f () {} 7917 7918 is correct; there shouldn't be a `template <>' for the 7919 definition of `S<int>::f'. */ 7920 if (CLASSTYPE_TEMPLATE_SPECIALIZATION (t) 7921 && !any_dependent_template_arguments_p (CLASSTYPE_TI_ARGS (t))) 7922 /* T is an explicit (not partial) specialization. All 7923 containing classes must therefore also be explicitly 7924 specialized. */ 7925 break; 7926 if ((CLASSTYPE_USE_TEMPLATE (t) || CLASSTYPE_IS_TEMPLATE (t)) 7927 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (t))) 7928 template_count += 1; 7929 7930 t = TYPE_MAIN_DECL (t); 7931 t = DECL_CONTEXT (t); 7932 } 7933 7934 if (ctype == current_class_type) 7935 { 7936 if (friendp) 7937 pedwarn ("member functions are implicitly friends of their class"); 7938 else 7939 pedwarn ("extra qualification %<%T::%> on member %qs", 7940 ctype, name); 7941 } 7942 else if (/* If the qualifying type is already complete, then we 7943 can skip the following checks. */ 7944 !COMPLETE_TYPE_P (ctype) 7945 && (/* If the function is being defined, then 7946 qualifying type must certainly be complete. */ 7947 funcdef_flag 7948 /* A friend declaration of "T::f" is OK, even if 7949 "T" is a template parameter. But, if this 7950 function is not a friend, the qualifying type 7951 must be a class. */ 7952 || (!friendp && !CLASS_TYPE_P (ctype)) 7953 /* For a declaration, the type need not be 7954 complete, if either it is dependent (since there 7955 is no meaningful definition of complete in that 7956 case) or the qualifying class is currently being 7957 defined. */ 7958 || !(dependent_type_p (ctype) 7959 || currently_open_class (ctype))) 7960 /* Check that the qualifying type is complete. */ 7961 && !complete_type_or_else (ctype, NULL_TREE)) 7962 return error_mark_node; 7963 else if (TREE_CODE (type) == FUNCTION_TYPE) 7964 { 7965 tree sname = declarator->u.id.unqualified_name; 7966 7967 if (current_class_type 7968 && (!friendp || funcdef_flag)) 7969 { 7970 error (funcdef_flag 7971 ? "cannot define member function %<%T::%s%> within %<%T%>" 7972 : "cannot declare member function %<%T::%s%> within %<%T%>", 7973 ctype, name, current_class_type); 7974 return error_mark_node; 7975 } 7976 7977 if (TREE_CODE (sname) == IDENTIFIER_NODE 7978 && NEW_DELETE_OPNAME_P (sname)) 7979 /* Overloaded operator new and operator delete 7980 are always static functions. */ 7981 ; 7982 else 7983 type = build_memfn_type (type, ctype, memfn_quals); 7984 } 7985 else if (declspecs->specs[(int)ds_typedef] 7986 && current_class_type) 7987 { 7988 error ("cannot declare member %<%T::%s%> within %qT", 7989 ctype, name, current_class_type); 7990 return error_mark_node; 7991 } 7992 } 7993 7994 /* Now TYPE has the actual type. */ 7995 7996 if (returned_attrs) 7997 { 7998 if (attrlist) 7999 *attrlist = chainon (returned_attrs, *attrlist); 8000 else 8001 attrlist = &returned_attrs; 8002 } 8003 8004 /* Did array size calculations overflow? */ 8005 8006 if (TREE_CODE (type) == ARRAY_TYPE 8007 && COMPLETE_TYPE_P (type) 8008 && TREE_CODE (TYPE_SIZE_UNIT (type)) == INTEGER_CST 8009 && TREE_OVERFLOW (TYPE_SIZE_UNIT (type))) 8010 { 8011 error ("size of array %qs is too large", name); 8012 /* If we proceed with the array type as it is, we'll eventually 8013 crash in tree_low_cst(). */ 8014 type = error_mark_node; 8015 } 8016 8017 if ((decl_context == FIELD || decl_context == PARM) 8018 && !processing_template_decl 8019 && variably_modified_type_p (type, NULL_TREE)) 8020 { 8021 if (decl_context == FIELD) 8022 error ("data member may not have variably modified type %qT", type); 8023 else 8024 error ("parameter may not have variably modified type %qT", type); 8025 type = error_mark_node; 8026 } 8027 8028 if (explicitp == 1 || (explicitp && friendp)) 8029 { 8030 /* [dcl.fct.spec] The explicit specifier shall only be used in 8031 declarations of constructors within a class definition. */ 8032 error ("only declarations of constructors can be %<explicit%>"); 8033 explicitp = 0; 8034 } 8035 8036 if (storage_class == sc_mutable) 8037 { 8038 if (decl_context != FIELD || friendp) 8039 { 8040 error ("non-member %qs cannot be declared %<mutable%>", name); 8041 storage_class = sc_none; 8042 } 8043 else if (decl_context == TYPENAME || declspecs->specs[(int)ds_typedef]) 8044 { 8045 error ("non-object member %qs cannot be declared %<mutable%>", name); 8046 storage_class = sc_none; 8047 } 8048 else if (TREE_CODE (type) == FUNCTION_TYPE 8049 || TREE_CODE (type) == METHOD_TYPE) 8050 { 8051 error ("function %qs cannot be declared %<mutable%>", name); 8052 storage_class = sc_none; 8053 } 8054 else if (staticp) 8055 { 8056 error ("static %qs cannot be declared %<mutable%>", name); 8057 storage_class = sc_none; 8058 } 8059 else if (type_quals & TYPE_QUAL_CONST) 8060 { 8061 error ("const %qs cannot be declared %<mutable%>", name); 8062 storage_class = sc_none; 8063 } 8064 } 8065 8066 /* If this is declaring a typedef name, return a TYPE_DECL. */ 8067 if (declspecs->specs[(int)ds_typedef] && decl_context != TYPENAME) 8068 { 8069 tree decl; 8070 8071 /* Note that the grammar rejects storage classes 8072 in typenames, fields or parameters. */ 8073 if (current_lang_name == lang_name_java) 8074 TYPE_FOR_JAVA (type) = 1; 8075 8076 /* This declaration: 8077 8078 typedef void f(int) const; 8079 8080 declares a function type which is not a member of any 8081 particular class, but which is cv-qualified; for 8082 example "f S::*" declares a pointer to a const-qualified 8083 member function of S. We record the cv-qualification in the 8084 function type. */ 8085 if (memfn_quals && TREE_CODE (type) == FUNCTION_TYPE) 8086 type = cp_build_qualified_type (type, memfn_quals); 8087 8088 if (decl_context == FIELD) 8089 decl = build_lang_decl (TYPE_DECL, unqualified_id, type); 8090 else 8091 decl = build_decl (TYPE_DECL, unqualified_id, type); 8092 if (id_declarator && declarator->u.id.qualifying_scope) 8093 error ("%Jtypedef name may not be a nested-name-specifier", decl); 8094 8095 if (decl_context != FIELD) 8096 { 8097 if (!current_function_decl) 8098 DECL_CONTEXT (decl) = FROB_CONTEXT (current_namespace); 8099 else if (DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (current_function_decl) 8100 || (DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P 8101 (current_function_decl))) 8102 /* The TYPE_DECL is "abstract" because there will be 8103 clones of this constructor/destructor, and there will 8104 be copies of this TYPE_DECL generated in those 8105 clones. */ 8106 DECL_ABSTRACT (decl) = 1; 8107 } 8108 else if (constructor_name_p (unqualified_id, current_class_type)) 8109 pedwarn ("ISO C++ forbids nested type %qD with same name " 8110 "as enclosing class", 8111 unqualified_id); 8112 8113 /* If the user declares "typedef struct {...} foo" then the 8114 struct will have an anonymous name. Fill that name in now. 8115 Nothing can refer to it, so nothing needs know about the name 8116 change. */ 8117 if (type != error_mark_node 8118 && unqualified_id 8119 && TYPE_NAME (type) 8120 && TREE_CODE (TYPE_NAME (type)) == TYPE_DECL 8121 && TYPE_ANONYMOUS_P (type) 8122 /* Don't do this if there are attributes. */ 8123 && (!attrlist || !*attrlist) 8124 && cp_type_quals (type) == TYPE_UNQUALIFIED) 8125 { 8126 tree oldname = TYPE_NAME (type); 8127 tree t; 8128 8129 /* Replace the anonymous name with the real name everywhere. */ 8130 for (t = TYPE_MAIN_VARIANT (type); t; t = TYPE_NEXT_VARIANT (t)) 8131 if (TYPE_NAME (t) == oldname) 8132 TYPE_NAME (t) = decl; 8133 8134 if (TYPE_LANG_SPECIFIC (type)) 8135 TYPE_WAS_ANONYMOUS (type) = 1; 8136 8137 /* If this is a typedef within a template class, the nested 8138 type is a (non-primary) template. The name for the 8139 template needs updating as well. */ 8140 if (TYPE_LANG_SPECIFIC (type) && CLASSTYPE_TEMPLATE_INFO (type)) 8141 DECL_NAME (CLASSTYPE_TI_TEMPLATE (type)) 8142 = TYPE_IDENTIFIER (type); 8143 8144 /* FIXME remangle member functions; member functions of a 8145 type with external linkage have external linkage. */ 8146 } 8147 8148 /* Any qualifiers on a function type typedef have already been 8149 dealt with. */ 8150 if (memfn_quals && !ctype && TREE_CODE (type) == FUNCTION_TYPE) 8151 memfn_quals = TYPE_UNQUALIFIED; 8152 8153 if (signed_p 8154 || (typedef_decl && C_TYPEDEF_EXPLICITLY_SIGNED (typedef_decl))) 8155 C_TYPEDEF_EXPLICITLY_SIGNED (decl) = 1; 8156 8157 bad_specifiers (decl, "type", virtualp, 8158 memfn_quals != TYPE_UNQUALIFIED, 8159 inlinep, friendp, raises != NULL_TREE); 8160 8161 return decl; 8162 } 8163 8164 /* Detect the case of an array type of unspecified size 8165 which came, as such, direct from a typedef name. 8166 We must copy the type, so that the array's domain can be 8167 individually set by the object's initializer. */ 8168 8169 if (type && typedef_type 8170 && TREE_CODE (type) == ARRAY_TYPE && !TYPE_DOMAIN (type) 8171 && TYPE_MAIN_VARIANT (type) == TYPE_MAIN_VARIANT (typedef_type)) 8172 type = build_cplus_array_type (TREE_TYPE (type), NULL_TREE); 8173 8174 /* Detect where we're using a typedef of function type to declare a 8175 function. PARMS will not be set, so we must create it now. */ 8176 8177 if (type == typedef_type && TREE_CODE (type) == FUNCTION_TYPE) 8178 { 8179 tree decls = NULL_TREE; 8180 tree args; 8181 8182 for (args = TYPE_ARG_TYPES (type); args; args = TREE_CHAIN (args)) 8183 { 8184 tree decl = cp_build_parm_decl (NULL_TREE, TREE_VALUE (args)); 8185 8186 TREE_CHAIN (decl) = decls; 8187 decls = decl; 8188 } 8189 8190 parms = nreverse (decls); 8191 8192 if (decl_context != TYPENAME) 8193 { 8194 /* A cv-qualifier-seq shall only be part of the function type 8195 for a non-static member function. [8.3.5/4 dcl.fct] */ 8196 if (cp_type_quals (type) != TYPE_UNQUALIFIED 8197 && (current_class_type == NULL_TREE || staticp) ) 8198 { 8199 error ("qualified function types cannot be used to declare %s functions", 8200 (staticp? "static member" : "free")); 8201 type = TYPE_MAIN_VARIANT (type); 8202 } 8203 8204 /* The qualifiers on the function type become the qualifiers on 8205 the non-static member function. */ 8206 memfn_quals |= cp_type_quals (type); 8207 } 8208 } 8209 8210 /* If this is a type name (such as, in a cast or sizeof), 8211 compute the type and return it now. */ 8212 8213 if (decl_context == TYPENAME) 8214 { 8215 /* Note that the grammar rejects storage classes 8216 in typenames, fields or parameters. */ 8217 if (type_quals != TYPE_UNQUALIFIED) 8218 type_quals = TYPE_UNQUALIFIED; 8219 8220 /* Special case: "friend class foo" looks like a TYPENAME context. */ 8221 if (friendp) 8222 { 8223 if (type_quals != TYPE_UNQUALIFIED) 8224 { 8225 error ("type qualifiers specified for friend class declaration"); 8226 type_quals = TYPE_UNQUALIFIED; 8227 } 8228 if (inlinep) 8229 { 8230 error ("%<inline%> specified for friend class declaration"); 8231 inlinep = 0; 8232 } 8233 8234 if (!current_aggr) 8235 { 8236 /* Don't allow friend declaration without a class-key. */ 8237 if (TREE_CODE (type) == TEMPLATE_TYPE_PARM) 8238 pedwarn ("template parameters cannot be friends"); 8239 else if (TREE_CODE (type) == TYPENAME_TYPE) 8240 pedwarn ("friend declaration requires class-key, " 8241 "i.e. %<friend class %T::%D%>", 8242 TYPE_CONTEXT (type), TYPENAME_TYPE_FULLNAME (type)); 8243 else 8244 pedwarn ("friend declaration requires class-key, " 8245 "i.e. %<friend %#T%>", 8246 type); 8247 } 8248 8249 /* Only try to do this stuff if we didn't already give up. */ 8250 if (type != integer_type_node) 8251 { 8252 /* A friendly class? */ 8253 if (current_class_type) 8254 make_friend_class (current_class_type, TYPE_MAIN_VARIANT (type), 8255 /*complain=*/true); 8256 else 8257 error ("trying to make class %qT a friend of global scope", 8258 type); 8259 8260 type = void_type_node; 8261 } 8262 } 8263 else if (memfn_quals) 8264 { 8265 if (ctype == NULL_TREE) 8266 { 8267 if (TREE_CODE (type) != METHOD_TYPE) 8268 error ("invalid qualifiers on non-member function type"); 8269 else 8270 ctype = TYPE_METHOD_BASETYPE (type); 8271 } 8272 if (ctype) 8273 type = build_memfn_type (type, ctype, memfn_quals); 8274 } 8275 8276 return type; 8277 } 8278 else if (unqualified_id == NULL_TREE && decl_context != PARM 8279 && decl_context != CATCHPARM 8280 && TREE_CODE (type) != UNION_TYPE 8281 && ! bitfield) 8282 { 8283 error ("abstract declarator %qT used as declaration", type); 8284 return error_mark_node; 8285 } 8286 8287 /* Only functions may be declared using an operator-function-id. */ 8288 if (unqualified_id 8289 && IDENTIFIER_OPNAME_P (unqualified_id) 8290 && TREE_CODE (type) != FUNCTION_TYPE 8291 && TREE_CODE (type) != METHOD_TYPE) 8292 { 8293 error ("declaration of %qD as non-function", unqualified_id); 8294 return error_mark_node; 8295 } 8296 8297 /* We don't check parameter types here because we can emit a better 8298 error message later. */ 8299 if (decl_context != PARM) 8300 { 8301 type = check_var_type (unqualified_id, type); 8302 if (type == error_mark_node) 8303 return error_mark_node; 8304 } 8305 8306 /* Now create the decl, which may be a VAR_DECL, a PARM_DECL 8307 or a FUNCTION_DECL, depending on DECL_CONTEXT and TYPE. */ 8308 8309 if (decl_context == PARM || decl_context == CATCHPARM) 8310 { 8311 if (ctype || in_namespace) 8312 error ("cannot use %<::%> in parameter declaration"); 8313 8314 /* A parameter declared as an array of T is really a pointer to T. 8315 One declared as a function is really a pointer to a function. 8316 One declared as a member is really a pointer to member. */ 8317 8318 if (TREE_CODE (type) == ARRAY_TYPE) 8319 { 8320 /* Transfer const-ness of array into that of type pointed to. */ 8321 type = build_pointer_type (TREE_TYPE (type)); 8322 type_quals = TYPE_UNQUALIFIED; 8323 } 8324 else if (TREE_CODE (type) == FUNCTION_TYPE) 8325 type = build_pointer_type (type); 8326 } 8327 8328 { 8329 tree decl; 8330 8331 if (decl_context == PARM) 8332 { 8333 decl = cp_build_parm_decl (unqualified_id, type); 8334 8335 bad_specifiers (decl, "parameter", virtualp, 8336 memfn_quals != TYPE_UNQUALIFIED, 8337 inlinep, friendp, raises != NULL_TREE); 8338 } 8339 else if (decl_context == FIELD) 8340 { 8341 /* The C99 flexible array extension. */ 8342 if (!staticp && TREE_CODE (type) == ARRAY_TYPE 8343 && TYPE_DOMAIN (type) == NULL_TREE) 8344 { 8345 tree itype = compute_array_index_type (dname, integer_zero_node); 8346 type = build_cplus_array_type (TREE_TYPE (type), itype); 8347 } 8348 8349 if (type == error_mark_node) 8350 { 8351 /* Happens when declaring arrays of sizes which 8352 are error_mark_node, for example. */ 8353 decl = NULL_TREE; 8354 } 8355 else if (in_namespace && !friendp) 8356 { 8357 /* Something like struct S { int N::j; }; */ 8358 error ("invalid use of %<::%>"); 8359 return error_mark_node; 8360 } 8361 else if (TREE_CODE (type) == FUNCTION_TYPE) 8362 { 8363 int publicp = 0; 8364 tree function_context; 8365 8366 if (friendp == 0) 8367 { 8368 if (ctype == NULL_TREE) 8369 ctype = current_class_type; 8370 8371 if (ctype == NULL_TREE) 8372 { 8373 error ("can't make %qD into a method -- not in a class", 8374 unqualified_id); 8375 return error_mark_node; 8376 } 8377 8378 /* ``A union may [ ... ] not [ have ] virtual functions.'' 8379 ARM 9.5 */ 8380 if (virtualp && TREE_CODE (ctype) == UNION_TYPE) 8381 { 8382 error ("function %qD declared virtual inside a union", 8383 unqualified_id); 8384 return error_mark_node; 8385 } 8386 8387 if (NEW_DELETE_OPNAME_P (unqualified_id)) 8388 { 8389 if (virtualp) 8390 { 8391 error ("%qD cannot be declared virtual, since it " 8392 "is always static", 8393 unqualified_id); 8394 virtualp = 0; 8395 } 8396 } 8397 else if (staticp < 2) 8398 type = build_memfn_type (type, ctype, memfn_quals); 8399 } 8400 8401 /* Check that the name used for a destructor makes sense. */ 8402 if (sfk == sfk_destructor) 8403 { 8404 if (!ctype) 8405 { 8406 gcc_assert (friendp); 8407 error ("expected qualified name in friend declaration " 8408 "for destructor %qD", 8409 id_declarator->u.id.unqualified_name); 8410 return error_mark_node; 8411 } 8412 8413 if (!same_type_p (TREE_OPERAND 8414 (id_declarator->u.id.unqualified_name, 0), 8415 ctype)) 8416 { 8417 error ("declaration of %qD as member of %qT", 8418 id_declarator->u.id.unqualified_name, ctype); 8419 return error_mark_node; 8420 } 8421 } 8422 8423 /* Tell grokfndecl if it needs to set TREE_PUBLIC on the node. */ 8424 function_context = (ctype != NULL_TREE) ? 8425 decl_function_context (TYPE_MAIN_DECL (ctype)) : NULL_TREE; 8426 publicp = (! friendp || ! staticp) 8427 && function_context == NULL_TREE; 8428 decl = grokfndecl (ctype, type, 8429 TREE_CODE (unqualified_id) != TEMPLATE_ID_EXPR 8430 ? unqualified_id : dname, 8431 parms, 8432 unqualified_id, 8433 virtualp, flags, memfn_quals, raises, 8434 friendp ? -1 : 0, friendp, publicp, inlinep, 8435 sfk, 8436 funcdef_flag, template_count, in_namespace, attrlist); 8437 if (decl == NULL_TREE) 8438 return error_mark_node; 8439#if 0 8440 /* This clobbers the attrs stored in `decl' from `attrlist'. */ 8441 /* The decl and setting of decl_attr is also turned off. */ 8442 decl = build_decl_attribute_variant (decl, decl_attr); 8443#endif 8444 8445 /* [class.conv.ctor] 8446 8447 A constructor declared without the function-specifier 8448 explicit that can be called with a single parameter 8449 specifies a conversion from the type of its first 8450 parameter to the type of its class. Such a constructor 8451 is called a converting constructor. */ 8452 if (explicitp == 2) 8453 DECL_NONCONVERTING_P (decl) = 1; 8454 else if (DECL_CONSTRUCTOR_P (decl)) 8455 { 8456 /* The constructor can be called with exactly one 8457 parameter if there is at least one parameter, and 8458 any subsequent parameters have default arguments. 8459 Ignore any compiler-added parms. */ 8460 tree arg_types = FUNCTION_FIRST_USER_PARMTYPE (decl); 8461 8462 if (arg_types == void_list_node 8463 || (arg_types 8464 && TREE_CHAIN (arg_types) 8465 && TREE_CHAIN (arg_types) != void_list_node 8466 && !TREE_PURPOSE (TREE_CHAIN (arg_types)))) 8467 DECL_NONCONVERTING_P (decl) = 1; 8468 } 8469 } 8470 else if (TREE_CODE (type) == METHOD_TYPE) 8471 { 8472 /* We only get here for friend declarations of 8473 members of other classes. */ 8474 /* All method decls are public, so tell grokfndecl to set 8475 TREE_PUBLIC, also. */ 8476 decl = grokfndecl (ctype, type, 8477 TREE_CODE (unqualified_id) != TEMPLATE_ID_EXPR 8478 ? unqualified_id : dname, 8479 parms, 8480 unqualified_id, 8481 virtualp, flags, memfn_quals, raises, 8482 friendp ? -1 : 0, friendp, 1, 0, sfk, 8483 funcdef_flag, template_count, in_namespace, 8484 attrlist); 8485 if (decl == NULL_TREE) 8486 return error_mark_node; 8487 } 8488 else if (!staticp && !dependent_type_p (type) 8489 && !COMPLETE_TYPE_P (complete_type (type)) 8490 && (TREE_CODE (type) != ARRAY_TYPE || initialized == 0)) 8491 { 8492 if (unqualified_id) 8493 error ("field %qD has incomplete type", unqualified_id); 8494 else 8495 error ("name %qT has incomplete type", type); 8496 8497 /* If we're instantiating a template, tell them which 8498 instantiation made the field's type be incomplete. */ 8499 if (current_class_type 8500 && TYPE_NAME (current_class_type) 8501 && IDENTIFIER_TEMPLATE (TYPE_IDENTIFIER (current_class_type)) 8502 && declspecs->type 8503 && declspecs->type == type) 8504 error (" in instantiation of template %qT", 8505 current_class_type); 8506 8507 return error_mark_node; 8508 } 8509 else 8510 { 8511 if (friendp) 8512 { 8513 error ("%qE is neither function nor member function; " 8514 "cannot be declared friend", unqualified_id); 8515 friendp = 0; 8516 } 8517 decl = NULL_TREE; 8518 } 8519 8520 if (friendp) 8521 { 8522 /* Friends are treated specially. */ 8523 if (ctype == current_class_type) 8524 ; /* We already issued a pedwarn. */ 8525 else if (decl && DECL_NAME (decl)) 8526 { 8527 if (template_class_depth (current_class_type) == 0) 8528 { 8529 decl = check_explicit_specialization 8530 (unqualified_id, decl, template_count, 8531 2 * funcdef_flag + 4); 8532 if (decl == error_mark_node) 8533 return error_mark_node; 8534 } 8535 8536 decl = do_friend (ctype, unqualified_id, decl, 8537 *attrlist, flags, 8538 funcdef_flag); 8539 return decl; 8540 } 8541 else 8542 return error_mark_node; 8543 } 8544 8545 /* Structure field. It may not be a function, except for C++. */ 8546 8547 if (decl == NULL_TREE) 8548 { 8549 if (initialized) 8550 { 8551 if (!staticp) 8552 { 8553 /* An attempt is being made to initialize a non-static 8554 member. But, from [class.mem]: 8555 8556 4 A member-declarator can contain a 8557 constant-initializer only if it declares a static 8558 member (_class.static_) of integral or enumeration 8559 type, see _class.static.data_. 8560 8561 This used to be relatively common practice, but 8562 the rest of the compiler does not correctly 8563 handle the initialization unless the member is 8564 static so we make it static below. */ 8565 pedwarn ("ISO C++ forbids initialization of member %qD", 8566 unqualified_id); 8567 pedwarn ("making %qD static", unqualified_id); 8568 staticp = 1; 8569 } 8570 8571 if (uses_template_parms (type)) 8572 /* We'll check at instantiation time. */ 8573 ; 8574 else if (check_static_variable_definition (unqualified_id, 8575 type)) 8576 /* If we just return the declaration, crashes 8577 will sometimes occur. We therefore return 8578 void_type_node, as if this was a friend 8579 declaration, to cause callers to completely 8580 ignore this declaration. */ 8581 return error_mark_node; 8582 } 8583 8584 if (staticp) 8585 { 8586 /* C++ allows static class members. All other work 8587 for this is done by grokfield. */ 8588 decl = build_lang_decl (VAR_DECL, unqualified_id, type); 8589 set_linkage_for_static_data_member (decl); 8590 /* Even if there is an in-class initialization, DECL 8591 is considered undefined until an out-of-class 8592 definition is provided. */ 8593 DECL_EXTERNAL (decl) = 1; 8594 8595 if (thread_p) 8596 { 8597 if (targetm.have_tls) 8598 DECL_TLS_MODEL (decl) = decl_default_tls_model (decl); 8599 else 8600 /* A mere warning is sure to result in improper 8601 semantics at runtime. Don't bother to allow this to 8602 compile. */ 8603 error ("thread-local storage not supported for this target"); 8604 } 8605 } 8606 else 8607 { 8608 decl = build_decl (FIELD_DECL, unqualified_id, type); 8609 DECL_NONADDRESSABLE_P (decl) = bitfield; 8610 if (storage_class == sc_mutable) 8611 { 8612 DECL_MUTABLE_P (decl) = 1; 8613 storage_class = sc_none; 8614 } 8615 } 8616 8617 bad_specifiers (decl, "field", virtualp, 8618 memfn_quals != TYPE_UNQUALIFIED, 8619 inlinep, friendp, raises != NULL_TREE); 8620 } 8621 } 8622 else if (TREE_CODE (type) == FUNCTION_TYPE 8623 || TREE_CODE (type) == METHOD_TYPE) 8624 { 8625 tree original_name; 8626 int publicp = 0; 8627 8628 if (!unqualified_id) 8629 return error_mark_node; 8630 8631 if (TREE_CODE (unqualified_id) == TEMPLATE_ID_EXPR) 8632 original_name = dname; 8633 else 8634 original_name = unqualified_id; 8635 8636 if (storage_class == sc_auto) 8637 error ("storage class %<auto%> invalid for function %qs", name); 8638 else if (storage_class == sc_register) 8639 error ("storage class %<register%> invalid for function %qs", name); 8640 else if (thread_p) 8641 error ("storage class %<__thread%> invalid for function %qs", name); 8642 8643 /* Function declaration not at top level. 8644 Storage classes other than `extern' are not allowed 8645 and `extern' makes no difference. */ 8646 if (! toplevel_bindings_p () 8647 && (storage_class == sc_static 8648 || declspecs->specs[(int)ds_inline]) 8649 && pedantic) 8650 { 8651 if (storage_class == sc_static) 8652 pedwarn ("%<static%> specified invalid for function %qs " 8653 "declared out of global scope", name); 8654 else 8655 pedwarn ("%<inline%> specifier invalid for function %qs " 8656 "declared out of global scope", name); 8657 } 8658 8659 if (ctype == NULL_TREE) 8660 { 8661 if (virtualp) 8662 { 8663 error ("virtual non-class function %qs", name); 8664 virtualp = 0; 8665 } 8666 } 8667 else if (TREE_CODE (type) == FUNCTION_TYPE && staticp < 2 8668 && !NEW_DELETE_OPNAME_P (original_name)) 8669 type = build_method_type_directly (ctype, 8670 TREE_TYPE (type), 8671 TYPE_ARG_TYPES (type)); 8672 8673 /* Record presence of `static'. */ 8674 publicp = (ctype != NULL_TREE 8675 || storage_class == sc_extern 8676 || storage_class != sc_static); 8677 8678 decl = grokfndecl (ctype, type, original_name, parms, unqualified_id, 8679 virtualp, flags, memfn_quals, raises, 8680 1, friendp, 8681 publicp, inlinep, sfk, funcdef_flag, 8682 template_count, in_namespace, attrlist); 8683 if (decl == NULL_TREE) 8684 return error_mark_node; 8685 8686 if (staticp == 1) 8687 { 8688 int invalid_static = 0; 8689 8690 /* Don't allow a static member function in a class, and forbid 8691 declaring main to be static. */ 8692 if (TREE_CODE (type) == METHOD_TYPE) 8693 { 8694 pedwarn ("cannot declare member function %qD to have " 8695 "static linkage", decl); 8696 invalid_static = 1; 8697 } 8698 else if (current_function_decl) 8699 { 8700 /* FIXME need arm citation */ 8701 error ("cannot declare static function inside another function"); 8702 invalid_static = 1; 8703 } 8704 8705 if (invalid_static) 8706 { 8707 staticp = 0; 8708 storage_class = sc_none; 8709 } 8710 } 8711 } 8712 else 8713 { 8714 /* It's a variable. */ 8715 8716 /* An uninitialized decl with `extern' is a reference. */ 8717 decl = grokvardecl (type, unqualified_id, 8718 declspecs, 8719 initialized, 8720 (type_quals & TYPE_QUAL_CONST) != 0, 8721 ctype ? ctype : in_namespace); 8722 bad_specifiers (decl, "variable", virtualp, 8723 memfn_quals != TYPE_UNQUALIFIED, 8724 inlinep, friendp, raises != NULL_TREE); 8725 8726 if (ctype) 8727 { 8728 DECL_CONTEXT (decl) = ctype; 8729 if (staticp == 1) 8730 { 8731 pedwarn ("%<static%> may not be used when defining " 8732 "(as opposed to declaring) a static data member"); 8733 staticp = 0; 8734 storage_class = sc_none; 8735 } 8736 if (storage_class == sc_register && TREE_STATIC (decl)) 8737 { 8738 error ("static member %qD declared %<register%>", decl); 8739 storage_class = sc_none; 8740 } 8741 if (storage_class == sc_extern && pedantic) 8742 { 8743 pedwarn ("cannot explicitly declare member %q#D to have " 8744 "extern linkage", 8745 decl); 8746 storage_class = sc_none; 8747 } 8748 } 8749 } 8750 8751 /* Record `register' declaration for warnings on & 8752 and in case doing stupid register allocation. */ 8753 8754 if (storage_class == sc_register) 8755 DECL_REGISTER (decl) = 1; 8756 else if (storage_class == sc_extern) 8757 DECL_THIS_EXTERN (decl) = 1; 8758 else if (storage_class == sc_static) 8759 DECL_THIS_STATIC (decl) = 1; 8760 8761 /* Record constancy and volatility. There's no need to do this 8762 when processing a template; we'll do this for the instantiated 8763 declaration based on the type of DECL. */ 8764 if (!processing_template_decl) 8765 cp_apply_type_quals_to_decl (type_quals, decl); 8766 8767 return decl; 8768 } 8769} 8770 8771/* Subroutine of start_function. Ensure that each of the parameter 8772 types (as listed in PARMS) is complete, as is required for a 8773 function definition. */ 8774 8775static void 8776require_complete_types_for_parms (tree parms) 8777{ 8778 for (; parms; parms = TREE_CHAIN (parms)) 8779 { 8780 if (dependent_type_p (TREE_TYPE (parms))) 8781 continue; 8782 if (!VOID_TYPE_P (TREE_TYPE (parms)) 8783 && complete_type_or_else (TREE_TYPE (parms), parms)) 8784 { 8785 relayout_decl (parms); 8786 DECL_ARG_TYPE (parms) = type_passed_as (TREE_TYPE (parms)); 8787 } 8788 else 8789 /* grokparms or complete_type_or_else will have already issued 8790 an error. */ 8791 TREE_TYPE (parms) = error_mark_node; 8792 } 8793} 8794 8795/* Returns nonzero if T is a local variable. */ 8796 8797int 8798local_variable_p (tree t) 8799{ 8800 if ((TREE_CODE (t) == VAR_DECL 8801 /* A VAR_DECL with a context that is a _TYPE is a static data 8802 member. */ 8803 && !TYPE_P (CP_DECL_CONTEXT (t)) 8804 /* Any other non-local variable must be at namespace scope. */ 8805 && !DECL_NAMESPACE_SCOPE_P (t)) 8806 || (TREE_CODE (t) == PARM_DECL)) 8807 return 1; 8808 8809 return 0; 8810} 8811 8812/* Returns nonzero if T is an automatic local variable or a label. 8813 (These are the declarations that need to be remapped when the code 8814 containing them is duplicated.) */ 8815 8816int 8817nonstatic_local_decl_p (tree t) 8818{ 8819 return ((local_variable_p (t) && !TREE_STATIC (t)) 8820 || TREE_CODE (t) == LABEL_DECL 8821 || TREE_CODE (t) == RESULT_DECL); 8822} 8823 8824/* Like local_variable_p, but suitable for use as a tree-walking 8825 function. */ 8826 8827static tree 8828local_variable_p_walkfn (tree *tp, int *walk_subtrees, 8829 void *data ATTRIBUTE_UNUSED) 8830{ 8831 if (local_variable_p (*tp) && !DECL_ARTIFICIAL (*tp)) 8832 return *tp; 8833 else if (TYPE_P (*tp)) 8834 *walk_subtrees = 0; 8835 8836 return NULL_TREE; 8837} 8838 8839 8840/* Check that ARG, which is a default-argument expression for a 8841 parameter DECL, is valid. Returns ARG, or ERROR_MARK_NODE, if 8842 something goes wrong. DECL may also be a _TYPE node, rather than a 8843 DECL, if there is no DECL available. */ 8844 8845tree 8846check_default_argument (tree decl, tree arg) 8847{ 8848 tree var; 8849 tree decl_type; 8850 8851 if (TREE_CODE (arg) == DEFAULT_ARG) 8852 /* We get a DEFAULT_ARG when looking at an in-class declaration 8853 with a default argument. Ignore the argument for now; we'll 8854 deal with it after the class is complete. */ 8855 return arg; 8856 8857 if (TYPE_P (decl)) 8858 { 8859 decl_type = decl; 8860 decl = NULL_TREE; 8861 } 8862 else 8863 decl_type = TREE_TYPE (decl); 8864 8865 if (arg == error_mark_node 8866 || decl == error_mark_node 8867 || TREE_TYPE (arg) == error_mark_node 8868 || decl_type == error_mark_node) 8869 /* Something already went wrong. There's no need to check 8870 further. */ 8871 return error_mark_node; 8872 8873 /* [dcl.fct.default] 8874 8875 A default argument expression is implicitly converted to the 8876 parameter type. */ 8877 if (!TREE_TYPE (arg) 8878 || !can_convert_arg (decl_type, TREE_TYPE (arg), arg, LOOKUP_NORMAL)) 8879 { 8880 if (decl) 8881 error ("default argument for %q#D has type %qT", 8882 decl, TREE_TYPE (arg)); 8883 else 8884 error ("default argument for parameter of type %qT has type %qT", 8885 decl_type, TREE_TYPE (arg)); 8886 8887 return error_mark_node; 8888 } 8889 8890 /* [dcl.fct.default] 8891 8892 Local variables shall not be used in default argument 8893 expressions. 8894 8895 The keyword `this' shall not be used in a default argument of a 8896 member function. */ 8897 var = walk_tree_without_duplicates (&arg, local_variable_p_walkfn, 8898 NULL); 8899 if (var) 8900 { 8901 error ("default argument %qE uses local variable %qD", arg, var); 8902 return error_mark_node; 8903 } 8904 8905 /* All is well. */ 8906 return arg; 8907} 8908 8909/* Decode the list of parameter types for a function type. 8910 Given the list of things declared inside the parens, 8911 return a list of types. 8912 8913 If this parameter does not end with an ellipsis, we append 8914 void_list_node. 8915 8916 *PARMS is set to the chain of PARM_DECLs created. */ 8917 8918static tree 8919grokparms (cp_parameter_declarator *first_parm, tree *parms) 8920{ 8921 tree result = NULL_TREE; 8922 tree decls = NULL_TREE; 8923 int ellipsis = !first_parm || first_parm->ellipsis_p; 8924 cp_parameter_declarator *parm; 8925 int any_error = 0; 8926 8927 for (parm = first_parm; parm != NULL; parm = parm->next) 8928 { 8929 tree type = NULL_TREE; 8930 tree init = parm->default_argument; 8931 tree attrs; 8932 tree decl; 8933 8934 if (parm == no_parameters) 8935 break; 8936 8937 attrs = parm->decl_specifiers.attributes; 8938 parm->decl_specifiers.attributes = NULL_TREE; 8939 decl = grokdeclarator (parm->declarator, &parm->decl_specifiers, 8940 PARM, init != NULL_TREE, &attrs); 8941 if (! decl || TREE_TYPE (decl) == error_mark_node) 8942 continue; 8943 8944 if (attrs) 8945 cplus_decl_attributes (&decl, attrs, 0); 8946 8947 type = TREE_TYPE (decl); 8948 if (VOID_TYPE_P (type)) 8949 { 8950 if (same_type_p (type, void_type_node) 8951 && DECL_SELF_REFERENCE_P (type) 8952 && !DECL_NAME (decl) && !result && !parm->next && !ellipsis) 8953 /* this is a parmlist of `(void)', which is ok. */ 8954 break; 8955 cxx_incomplete_type_error (decl, type); 8956 /* It's not a good idea to actually create parameters of 8957 type `void'; other parts of the compiler assume that a 8958 void type terminates the parameter list. */ 8959 type = error_mark_node; 8960 TREE_TYPE (decl) = error_mark_node; 8961 } 8962 8963 if (type != error_mark_node) 8964 { 8965 /* Top-level qualifiers on the parameters are 8966 ignored for function types. */ 8967 type = cp_build_qualified_type (type, 0); 8968 if (TREE_CODE (type) == METHOD_TYPE) 8969 { 8970 error ("parameter %qD invalidly declared method type", decl); 8971 type = build_pointer_type (type); 8972 TREE_TYPE (decl) = type; 8973 } 8974 else if (abstract_virtuals_error (decl, type)) 8975 any_error = 1; /* Seems like a good idea. */ 8976 else if (POINTER_TYPE_P (type)) 8977 { 8978 /* [dcl.fct]/6, parameter types cannot contain pointers 8979 (references) to arrays of unknown bound. */ 8980 tree t = TREE_TYPE (type); 8981 int ptr = TYPE_PTR_P (type); 8982 8983 while (1) 8984 { 8985 if (TYPE_PTR_P (t)) 8986 ptr = 1; 8987 else if (TREE_CODE (t) != ARRAY_TYPE) 8988 break; 8989 else if (!TYPE_DOMAIN (t)) 8990 break; 8991 t = TREE_TYPE (t); 8992 } 8993 if (TREE_CODE (t) == ARRAY_TYPE) 8994 error ("parameter %qD includes %s to array of unknown " 8995 "bound %qT", 8996 decl, ptr ? "pointer" : "reference", t); 8997 } 8998 8999 if (any_error) 9000 init = NULL_TREE; 9001 else if (init && !processing_template_decl) 9002 init = check_default_argument (decl, init); 9003 } 9004 9005 TREE_CHAIN (decl) = decls; 9006 decls = decl; 9007 result = tree_cons (init, type, result); 9008 } 9009 decls = nreverse (decls); 9010 result = nreverse (result); 9011 if (!ellipsis) 9012 result = chainon (result, void_list_node); 9013 *parms = decls; 9014 9015 return result; 9016} 9017 9018 9019/* D is a constructor or overloaded `operator='. 9020 9021 Let T be the class in which D is declared. Then, this function 9022 returns: 9023 9024 -1 if D's is an ill-formed constructor or copy assignment operator 9025 whose first parameter is of type `T'. 9026 0 if D is not a copy constructor or copy assignment 9027 operator. 9028 1 if D is a copy constructor or copy assignment operator whose 9029 first parameter is a reference to const qualified T. 9030 2 if D is a copy constructor or copy assignment operator whose 9031 first parameter is a reference to non-const qualified T. 9032 9033 This function can be used as a predicate. Positive values indicate 9034 a copy constructor and nonzero values indicate a copy assignment 9035 operator. */ 9036 9037int 9038copy_fn_p (tree d) 9039{ 9040 tree args; 9041 tree arg_type; 9042 int result = 1; 9043 9044 gcc_assert (DECL_FUNCTION_MEMBER_P (d)); 9045 9046 if (TREE_CODE (d) == TEMPLATE_DECL 9047 || (DECL_TEMPLATE_INFO (d) 9048 && DECL_MEMBER_TEMPLATE_P (DECL_TI_TEMPLATE (d)))) 9049 /* Instantiations of template member functions are never copy 9050 functions. Note that member functions of templated classes are 9051 represented as template functions internally, and we must 9052 accept those as copy functions. */ 9053 return 0; 9054 9055 args = FUNCTION_FIRST_USER_PARMTYPE (d); 9056 if (!args) 9057 return 0; 9058 9059 arg_type = TREE_VALUE (args); 9060 if (arg_type == error_mark_node) 9061 return 0; 9062 9063 if (TYPE_MAIN_VARIANT (arg_type) == DECL_CONTEXT (d)) 9064 { 9065 /* Pass by value copy assignment operator. */ 9066 result = -1; 9067 } 9068 else if (TREE_CODE (arg_type) == REFERENCE_TYPE 9069 && TYPE_MAIN_VARIANT (TREE_TYPE (arg_type)) == DECL_CONTEXT (d)) 9070 { 9071 if (CP_TYPE_CONST_P (TREE_TYPE (arg_type))) 9072 result = 2; 9073 } 9074 else 9075 return 0; 9076 9077 args = TREE_CHAIN (args); 9078 9079 if (args && args != void_list_node && !TREE_PURPOSE (args)) 9080 /* There are more non-optional args. */ 9081 return 0; 9082 9083 return result; 9084} 9085 9086/* Remember any special properties of member function DECL. */ 9087 9088void grok_special_member_properties (tree decl) 9089{ 9090 tree class_type; 9091 9092 if (!DECL_NONSTATIC_MEMBER_FUNCTION_P (decl)) 9093 return; 9094 9095 class_type = DECL_CONTEXT (decl); 9096 if (DECL_CONSTRUCTOR_P (decl)) 9097 { 9098 int ctor = copy_fn_p (decl); 9099 9100 TYPE_HAS_CONSTRUCTOR (class_type) = 1; 9101 9102 if (ctor > 0) 9103 { 9104 /* [class.copy] 9105 9106 A non-template constructor for class X is a copy 9107 constructor if its first parameter is of type X&, const 9108 X&, volatile X& or const volatile X&, and either there 9109 are no other parameters or else all other parameters have 9110 default arguments. */ 9111 TYPE_HAS_INIT_REF (class_type) = 1; 9112 if (ctor > 1) 9113 TYPE_HAS_CONST_INIT_REF (class_type) = 1; 9114 } 9115 else if (sufficient_parms_p (FUNCTION_FIRST_USER_PARMTYPE (decl))) 9116 TYPE_HAS_DEFAULT_CONSTRUCTOR (class_type) = 1; 9117 } 9118 else if (DECL_OVERLOADED_OPERATOR_P (decl) == NOP_EXPR) 9119 { 9120 /* [class.copy] 9121 9122 A non-template assignment operator for class X is a copy 9123 assignment operator if its parameter is of type X, X&, const 9124 X&, volatile X& or const volatile X&. */ 9125 9126 int assop = copy_fn_p (decl); 9127 9128 if (assop) 9129 { 9130 TYPE_HAS_ASSIGN_REF (class_type) = 1; 9131 if (assop != 1) 9132 TYPE_HAS_CONST_ASSIGN_REF (class_type) = 1; 9133 } 9134 } 9135} 9136 9137/* Check a constructor DECL has the correct form. Complains 9138 if the class has a constructor of the form X(X). */ 9139 9140int 9141grok_ctor_properties (tree ctype, tree decl) 9142{ 9143 int ctor_parm = copy_fn_p (decl); 9144 9145 if (ctor_parm < 0) 9146 { 9147 /* [class.copy] 9148 9149 A declaration of a constructor for a class X is ill-formed if 9150 its first parameter is of type (optionally cv-qualified) X 9151 and either there are no other parameters or else all other 9152 parameters have default arguments. 9153 9154 We *don't* complain about member template instantiations that 9155 have this form, though; they can occur as we try to decide 9156 what constructor to use during overload resolution. Since 9157 overload resolution will never prefer such a constructor to 9158 the non-template copy constructor (which is either explicitly 9159 or implicitly defined), there's no need to worry about their 9160 existence. Theoretically, they should never even be 9161 instantiated, but that's hard to forestall. */ 9162 error ("invalid constructor; you probably meant %<%T (const %T&)%>", 9163 ctype, ctype); 9164 return 0; 9165 } 9166 9167 return 1; 9168} 9169 9170/* An operator with this code is unary, but can also be binary. */ 9171 9172static int 9173ambi_op_p (enum tree_code code) 9174{ 9175 return (code == INDIRECT_REF 9176 || code == ADDR_EXPR 9177 || code == UNARY_PLUS_EXPR 9178 || code == NEGATE_EXPR 9179 || code == PREINCREMENT_EXPR 9180 || code == PREDECREMENT_EXPR); 9181} 9182 9183/* An operator with this name can only be unary. */ 9184 9185static int 9186unary_op_p (enum tree_code code) 9187{ 9188 return (code == TRUTH_NOT_EXPR 9189 || code == BIT_NOT_EXPR 9190 || code == COMPONENT_REF 9191 || code == TYPE_EXPR); 9192} 9193 9194/* DECL is a declaration for an overloaded operator. If COMPLAIN is true, 9195 errors are issued for invalid declarations. */ 9196 9197bool 9198grok_op_properties (tree decl, bool complain) 9199{ 9200 tree argtypes = TYPE_ARG_TYPES (TREE_TYPE (decl)); 9201 tree argtype; 9202 int methodp = (TREE_CODE (TREE_TYPE (decl)) == METHOD_TYPE); 9203 tree name = DECL_NAME (decl); 9204 enum tree_code operator_code; 9205 int arity; 9206 bool ellipsis_p; 9207 tree class_type; 9208 9209 /* Count the number of arguments and check for ellipsis. */ 9210 for (argtype = argtypes, arity = 0; 9211 argtype && argtype != void_list_node; 9212 argtype = TREE_CHAIN (argtype)) 9213 ++arity; 9214 ellipsis_p = !argtype; 9215 9216 class_type = DECL_CONTEXT (decl); 9217 if (class_type && !CLASS_TYPE_P (class_type)) 9218 class_type = NULL_TREE; 9219 9220 if (DECL_CONV_FN_P (decl)) 9221 operator_code = TYPE_EXPR; 9222 else 9223 do 9224 { 9225#define DEF_OPERATOR(NAME, CODE, MANGLING, ARITY, ASSN_P) \ 9226 if (ansi_opname (CODE) == name) \ 9227 { \ 9228 operator_code = (CODE); \ 9229 break; \ 9230 } \ 9231 else if (ansi_assopname (CODE) == name) \ 9232 { \ 9233 operator_code = (CODE); \ 9234 DECL_ASSIGNMENT_OPERATOR_P (decl) = 1; \ 9235 break; \ 9236 } 9237 9238#include "operators.def" 9239#undef DEF_OPERATOR 9240 9241 gcc_unreachable (); 9242 } 9243 while (0); 9244 gcc_assert (operator_code != LAST_CPLUS_TREE_CODE); 9245 SET_OVERLOADED_OPERATOR_CODE (decl, operator_code); 9246 9247 if (class_type) 9248 switch (operator_code) 9249 { 9250 case NEW_EXPR: 9251 TYPE_HAS_NEW_OPERATOR (class_type) = 1; 9252 break; 9253 9254 case DELETE_EXPR: 9255 TYPE_GETS_DELETE (class_type) |= 1; 9256 break; 9257 9258 case VEC_NEW_EXPR: 9259 TYPE_HAS_ARRAY_NEW_OPERATOR (class_type) = 1; 9260 break; 9261 9262 case VEC_DELETE_EXPR: 9263 TYPE_GETS_DELETE (class_type) |= 2; 9264 break; 9265 9266 default: 9267 break; 9268 } 9269 9270 /* [basic.std.dynamic.allocation]/1: 9271 9272 A program is ill-formed if an allocation function is declared 9273 in a namespace scope other than global scope or declared static 9274 in global scope. 9275 9276 The same also holds true for deallocation functions. */ 9277 if (operator_code == NEW_EXPR || operator_code == VEC_NEW_EXPR 9278 || operator_code == DELETE_EXPR || operator_code == VEC_DELETE_EXPR) 9279 { 9280 if (DECL_NAMESPACE_SCOPE_P (decl)) 9281 { 9282 if (CP_DECL_CONTEXT (decl) != global_namespace) 9283 { 9284 error ("%qD may not be declared within a namespace", decl); 9285 return false; 9286 } 9287 else if (!TREE_PUBLIC (decl)) 9288 { 9289 error ("%qD may not be declared as static", decl); 9290 return false; 9291 } 9292 } 9293 } 9294 9295 if (operator_code == NEW_EXPR || operator_code == VEC_NEW_EXPR) 9296 TREE_TYPE (decl) = coerce_new_type (TREE_TYPE (decl)); 9297 else if (operator_code == DELETE_EXPR || operator_code == VEC_DELETE_EXPR) 9298 TREE_TYPE (decl) = coerce_delete_type (TREE_TYPE (decl)); 9299 else 9300 { 9301 /* An operator function must either be a non-static member function 9302 or have at least one parameter of a class, a reference to a class, 9303 an enumeration, or a reference to an enumeration. 13.4.0.6 */ 9304 if (! methodp || DECL_STATIC_FUNCTION_P (decl)) 9305 { 9306 if (operator_code == TYPE_EXPR 9307 || operator_code == CALL_EXPR 9308 || operator_code == COMPONENT_REF 9309 || operator_code == ARRAY_REF 9310 || operator_code == NOP_EXPR) 9311 { 9312 error ("%qD must be a nonstatic member function", decl); 9313 return false; 9314 } 9315 else 9316 { 9317 tree p; 9318 9319 if (DECL_STATIC_FUNCTION_P (decl)) 9320 { 9321 error ("%qD must be either a non-static member " 9322 "function or a non-member function", decl); 9323 return false; 9324 } 9325 9326 for (p = argtypes; p && p != void_list_node; p = TREE_CHAIN (p)) 9327 { 9328 tree arg = non_reference (TREE_VALUE (p)); 9329 if (arg == error_mark_node) 9330 return false; 9331 9332 /* IS_AGGR_TYPE, rather than CLASS_TYPE_P, is used 9333 because these checks are performed even on 9334 template functions. */ 9335 if (IS_AGGR_TYPE (arg) || TREE_CODE (arg) == ENUMERAL_TYPE) 9336 break; 9337 } 9338 9339 if (!p || p == void_list_node) 9340 { 9341 if (complain) 9342 error ("%qD must have an argument of class or " 9343 "enumerated type", decl); 9344 return false; 9345 } 9346 } 9347 } 9348 9349 /* There are no restrictions on the arguments to an overloaded 9350 "operator ()". */ 9351 if (operator_code == CALL_EXPR) 9352 return true; 9353 9354 /* Warn about conversion operators that will never be used. */ 9355 if (IDENTIFIER_TYPENAME_P (name) 9356 && ! DECL_TEMPLATE_INFO (decl) 9357 && warn_conversion 9358 /* Warn only declaring the function; there is no need to 9359 warn again about out-of-class definitions. */ 9360 && class_type == current_class_type) 9361 { 9362 tree t = TREE_TYPE (name); 9363 int ref = (TREE_CODE (t) == REFERENCE_TYPE); 9364 const char *what = 0; 9365 9366 if (ref) 9367 t = TYPE_MAIN_VARIANT (TREE_TYPE (t)); 9368 9369 if (TREE_CODE (t) == VOID_TYPE) 9370 what = "void"; 9371 else if (class_type) 9372 { 9373 if (t == class_type) 9374 what = "the same type"; 9375 /* Don't force t to be complete here. */ 9376 else if (IS_AGGR_TYPE (t) 9377 && COMPLETE_TYPE_P (t) 9378 && DERIVED_FROM_P (t, class_type)) 9379 what = "a base class"; 9380 } 9381 9382 if (what) 9383 warning (OPT_Wconversion, "conversion to %s%s will never use a type " 9384 "conversion operator", 9385 ref ? "a reference to " : "", what); 9386 } 9387 9388 if (operator_code == COND_EXPR) 9389 { 9390 /* 13.4.0.3 */ 9391 error ("ISO C++ prohibits overloading operator ?:"); 9392 return false; 9393 } 9394 else if (ellipsis_p) 9395 { 9396 error ("%qD must not have variable number of arguments", decl); 9397 return false; 9398 } 9399 else if (ambi_op_p (operator_code)) 9400 { 9401 if (arity == 1) 9402 /* We pick the one-argument operator codes by default, so 9403 we don't have to change anything. */ 9404 ; 9405 else if (arity == 2) 9406 { 9407 /* If we thought this was a unary operator, we now know 9408 it to be a binary operator. */ 9409 switch (operator_code) 9410 { 9411 case INDIRECT_REF: 9412 operator_code = MULT_EXPR; 9413 break; 9414 9415 case ADDR_EXPR: 9416 operator_code = BIT_AND_EXPR; 9417 break; 9418 9419 case UNARY_PLUS_EXPR: 9420 operator_code = PLUS_EXPR; 9421 break; 9422 9423 case NEGATE_EXPR: 9424 operator_code = MINUS_EXPR; 9425 break; 9426 9427 case PREINCREMENT_EXPR: 9428 operator_code = POSTINCREMENT_EXPR; 9429 break; 9430 9431 case PREDECREMENT_EXPR: 9432 operator_code = POSTDECREMENT_EXPR; 9433 break; 9434 9435 default: 9436 gcc_unreachable (); 9437 } 9438 9439 SET_OVERLOADED_OPERATOR_CODE (decl, operator_code); 9440 9441 if ((operator_code == POSTINCREMENT_EXPR 9442 || operator_code == POSTDECREMENT_EXPR) 9443 && ! processing_template_decl 9444 && ! same_type_p (TREE_VALUE (TREE_CHAIN (argtypes)), integer_type_node)) 9445 { 9446 if (methodp) 9447 error ("postfix %qD must take %<int%> as its argument", 9448 decl); 9449 else 9450 error ("postfix %qD must take %<int%> as its second " 9451 "argument", decl); 9452 return false; 9453 } 9454 } 9455 else 9456 { 9457 if (methodp) 9458 error ("%qD must take either zero or one argument", decl); 9459 else 9460 error ("%qD must take either one or two arguments", decl); 9461 return false; 9462 } 9463 9464 /* More Effective C++ rule 6. */ 9465 if (warn_ecpp 9466 && (operator_code == POSTINCREMENT_EXPR 9467 || operator_code == POSTDECREMENT_EXPR 9468 || operator_code == PREINCREMENT_EXPR 9469 || operator_code == PREDECREMENT_EXPR)) 9470 { 9471 tree arg = TREE_VALUE (argtypes); 9472 tree ret = TREE_TYPE (TREE_TYPE (decl)); 9473 if (methodp || TREE_CODE (arg) == REFERENCE_TYPE) 9474 arg = TREE_TYPE (arg); 9475 arg = TYPE_MAIN_VARIANT (arg); 9476 if (operator_code == PREINCREMENT_EXPR 9477 || operator_code == PREDECREMENT_EXPR) 9478 { 9479 if (TREE_CODE (ret) != REFERENCE_TYPE 9480 || !same_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (ret)), 9481 arg)) 9482 warning (OPT_Weffc__, "prefix %qD should return %qT", decl, 9483 build_reference_type (arg)); 9484 } 9485 else 9486 { 9487 if (!same_type_p (TYPE_MAIN_VARIANT (ret), arg)) 9488 warning (OPT_Weffc__, "postfix %qD should return %qT", decl, arg); 9489 } 9490 } 9491 } 9492 else if (unary_op_p (operator_code)) 9493 { 9494 if (arity != 1) 9495 { 9496 if (methodp) 9497 error ("%qD must take %<void%>", decl); 9498 else 9499 error ("%qD must take exactly one argument", decl); 9500 return false; 9501 } 9502 } 9503 else /* if (binary_op_p (operator_code)) */ 9504 { 9505 if (arity != 2) 9506 { 9507 if (methodp) 9508 error ("%qD must take exactly one argument", decl); 9509 else 9510 error ("%qD must take exactly two arguments", decl); 9511 return false; 9512 } 9513 9514 /* More Effective C++ rule 7. */ 9515 if (warn_ecpp 9516 && (operator_code == TRUTH_ANDIF_EXPR 9517 || operator_code == TRUTH_ORIF_EXPR 9518 || operator_code == COMPOUND_EXPR)) 9519 warning (OPT_Weffc__, "user-defined %qD always evaluates both arguments", 9520 decl); 9521 } 9522 9523 /* Effective C++ rule 23. */ 9524 if (warn_ecpp 9525 && arity == 2 9526 && !DECL_ASSIGNMENT_OPERATOR_P (decl) 9527 && (operator_code == PLUS_EXPR 9528 || operator_code == MINUS_EXPR 9529 || operator_code == TRUNC_DIV_EXPR 9530 || operator_code == MULT_EXPR 9531 || operator_code == TRUNC_MOD_EXPR) 9532 && TREE_CODE (TREE_TYPE (TREE_TYPE (decl))) == REFERENCE_TYPE) 9533 warning (OPT_Weffc__, "%qD should return by value", decl); 9534 9535 /* [over.oper]/8 */ 9536 for (; argtypes && argtypes != void_list_node; 9537 argtypes = TREE_CHAIN (argtypes)) 9538 if (TREE_PURPOSE (argtypes)) 9539 { 9540 TREE_PURPOSE (argtypes) = NULL_TREE; 9541 if (operator_code == POSTINCREMENT_EXPR 9542 || operator_code == POSTDECREMENT_EXPR) 9543 { 9544 if (pedantic) 9545 pedwarn ("%qD cannot have default arguments", decl); 9546 } 9547 else 9548 { 9549 error ("%qD cannot have default arguments", decl); 9550 return false; 9551 } 9552 } 9553 } 9554 return true; 9555} 9556 9557/* Return a string giving the keyword associate with CODE. */ 9558 9559static const char * 9560tag_name (enum tag_types code) 9561{ 9562 switch (code) 9563 { 9564 case record_type: 9565 return "struct"; 9566 case class_type: 9567 return "class"; 9568 case union_type: 9569 return "union"; 9570 case enum_type: 9571 return "enum"; 9572 case typename_type: 9573 return "typename"; 9574 default: 9575 gcc_unreachable (); 9576 } 9577} 9578 9579/* Name lookup in an elaborated-type-specifier (after the keyword 9580 indicated by TAG_CODE) has found the TYPE_DECL DECL. If the 9581 elaborated-type-specifier is invalid, issue a diagnostic and return 9582 error_mark_node; otherwise, return the *_TYPE to which it referred. 9583 If ALLOW_TEMPLATE_P is true, TYPE may be a class template. */ 9584 9585tree 9586check_elaborated_type_specifier (enum tag_types tag_code, 9587 tree decl, 9588 bool allow_template_p) 9589{ 9590 tree type; 9591 9592 /* In the case of: 9593 9594 struct S { struct S *p; }; 9595 9596 name lookup will find the TYPE_DECL for the implicit "S::S" 9597 typedef. Adjust for that here. */ 9598 if (DECL_SELF_REFERENCE_P (decl)) 9599 decl = TYPE_NAME (TREE_TYPE (decl)); 9600 9601 type = TREE_TYPE (decl); 9602 9603 /* Check TEMPLATE_TYPE_PARM first because DECL_IMPLICIT_TYPEDEF_P 9604 is false for this case as well. */ 9605 if (TREE_CODE (type) == TEMPLATE_TYPE_PARM) 9606 { 9607 error ("using template type parameter %qT after %qs", 9608 type, tag_name (tag_code)); 9609 return error_mark_node; 9610 } 9611 /* [dcl.type.elab] 9612 9613 If the identifier resolves to a typedef-name or a template 9614 type-parameter, the elaborated-type-specifier is ill-formed. 9615 9616 In other words, the only legitimate declaration to use in the 9617 elaborated type specifier is the implicit typedef created when 9618 the type is declared. */ 9619 else if (!DECL_IMPLICIT_TYPEDEF_P (decl) 9620 && tag_code != typename_type) 9621 { 9622 error ("using typedef-name %qD after %qs", decl, tag_name (tag_code)); 9623 error ("%q+D has a previous declaration here", decl); 9624 return error_mark_node; 9625 } 9626 else if (TREE_CODE (type) != RECORD_TYPE 9627 && TREE_CODE (type) != UNION_TYPE 9628 && tag_code != enum_type 9629 && tag_code != typename_type) 9630 { 9631 error ("%qT referred to as %qs", type, tag_name (tag_code)); 9632 error ("%q+T has a previous declaration here", type); 9633 return error_mark_node; 9634 } 9635 else if (TREE_CODE (type) != ENUMERAL_TYPE 9636 && tag_code == enum_type) 9637 { 9638 error ("%qT referred to as enum", type); 9639 error ("%q+T has a previous declaration here", type); 9640 return error_mark_node; 9641 } 9642 else if (!allow_template_p 9643 && TREE_CODE (type) == RECORD_TYPE 9644 && CLASSTYPE_IS_TEMPLATE (type)) 9645 { 9646 /* If a class template appears as elaborated type specifier 9647 without a template header such as: 9648 9649 template <class T> class C {}; 9650 void f(class C); // No template header here 9651 9652 then the required template argument is missing. */ 9653 error ("template argument required for %<%s %T%>", 9654 tag_name (tag_code), 9655 DECL_NAME (CLASSTYPE_TI_TEMPLATE (type))); 9656 return error_mark_node; 9657 } 9658 9659 return type; 9660} 9661 9662/* Lookup NAME in elaborate type specifier in scope according to 9663 SCOPE and issue diagnostics if necessary. 9664 Return *_TYPE node upon success, NULL_TREE when the NAME is not 9665 found, and ERROR_MARK_NODE for type error. */ 9666 9667static tree 9668lookup_and_check_tag (enum tag_types tag_code, tree name, 9669 tag_scope scope, bool template_header_p) 9670{ 9671 tree t; 9672 tree decl; 9673 if (scope == ts_global) 9674 { 9675 /* First try ordinary name lookup, ignoring hidden class name 9676 injected via friend declaration. */ 9677 decl = lookup_name_prefer_type (name, 2); 9678 /* If that fails, the name will be placed in the smallest 9679 non-class, non-function-prototype scope according to 3.3.1/5. 9680 We may already have a hidden name declared as friend in this 9681 scope. So lookup again but not ignoring hidden names. 9682 If we find one, that name will be made visible rather than 9683 creating a new tag. */ 9684 if (!decl) 9685 decl = lookup_type_scope (name, ts_within_enclosing_non_class); 9686 } 9687 else 9688 decl = lookup_type_scope (name, scope); 9689 9690 if (decl && DECL_CLASS_TEMPLATE_P (decl)) 9691 decl = DECL_TEMPLATE_RESULT (decl); 9692 9693 if (decl && TREE_CODE (decl) == TYPE_DECL) 9694 { 9695 /* Look for invalid nested type: 9696 class C { 9697 class C {}; 9698 }; */ 9699 if (scope == ts_current && DECL_SELF_REFERENCE_P (decl)) 9700 { 9701 error ("%qD has the same name as the class in which it is " 9702 "declared", 9703 decl); 9704 return error_mark_node; 9705 } 9706 9707 /* Two cases we need to consider when deciding if a class 9708 template is allowed as an elaborated type specifier: 9709 1. It is a self reference to its own class. 9710 2. It comes with a template header. 9711 9712 For example: 9713 9714 template <class T> class C { 9715 class C *c1; // DECL_SELF_REFERENCE_P is true 9716 class D; 9717 }; 9718 template <class U> class C; // template_header_p is true 9719 template <class T> class C<T>::D { 9720 class C *c2; // DECL_SELF_REFERENCE_P is true 9721 }; */ 9722 9723 t = check_elaborated_type_specifier (tag_code, 9724 decl, 9725 template_header_p 9726 | DECL_SELF_REFERENCE_P (decl)); 9727 return t; 9728 } 9729 else 9730 return NULL_TREE; 9731} 9732 9733/* Get the struct, enum or union (TAG_CODE says which) with tag NAME. 9734 Define the tag as a forward-reference if it is not defined. 9735 9736 If a declaration is given, process it here, and report an error if 9737 multiple declarations are not identical. 9738 9739 SCOPE is TS_CURRENT when this is also a definition. Only look in 9740 the current frame for the name (since C++ allows new names in any 9741 scope.) It is TS_WITHIN_ENCLOSING_NON_CLASS if this is a friend 9742 declaration. Only look beginning from the current scope outward up 9743 till the nearest non-class scope. Otherwise it is TS_GLOBAL. 9744 9745 TEMPLATE_HEADER_P is true when this declaration is preceded by 9746 a set of template parameters. */ 9747 9748tree 9749xref_tag (enum tag_types tag_code, tree name, 9750 tag_scope scope, bool template_header_p) 9751{ 9752 enum tree_code code; 9753 tree t; 9754 tree context = NULL_TREE; 9755 9756 timevar_push (TV_NAME_LOOKUP); 9757 9758 gcc_assert (TREE_CODE (name) == IDENTIFIER_NODE); 9759 9760 switch (tag_code) 9761 { 9762 case record_type: 9763 case class_type: 9764 code = RECORD_TYPE; 9765 break; 9766 case union_type: 9767 code = UNION_TYPE; 9768 break; 9769 case enum_type: 9770 code = ENUMERAL_TYPE; 9771 break; 9772 default: 9773 gcc_unreachable (); 9774 } 9775 9776 /* In case of anonymous name, xref_tag is only called to 9777 make type node and push name. Name lookup is not required. */ 9778 if (ANON_AGGRNAME_P (name)) 9779 t = NULL_TREE; 9780 else 9781 t = lookup_and_check_tag (tag_code, name, 9782 scope, template_header_p); 9783 9784 if (t == error_mark_node) 9785 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, error_mark_node); 9786 9787 if (scope != ts_current && t && current_class_type 9788 && template_class_depth (current_class_type) 9789 && template_header_p) 9790 { 9791 /* Since SCOPE is not TS_CURRENT, we are not looking at a 9792 definition of this tag. Since, in addition, we are currently 9793 processing a (member) template declaration of a template 9794 class, we must be very careful; consider: 9795 9796 template <class X> 9797 struct S1 9798 9799 template <class U> 9800 struct S2 9801 { template <class V> 9802 friend struct S1; }; 9803 9804 Here, the S2::S1 declaration should not be confused with the 9805 outer declaration. In particular, the inner version should 9806 have a template parameter of level 2, not level 1. This 9807 would be particularly important if the member declaration 9808 were instead: 9809 9810 template <class V = U> friend struct S1; 9811 9812 say, when we should tsubst into `U' when instantiating 9813 S2. On the other hand, when presented with: 9814 9815 template <class T> 9816 struct S1 { 9817 template <class U> 9818 struct S2 {}; 9819 template <class U> 9820 friend struct S2; 9821 }; 9822 9823 we must find the inner binding eventually. We 9824 accomplish this by making sure that the new type we 9825 create to represent this declaration has the right 9826 TYPE_CONTEXT. */ 9827 context = TYPE_CONTEXT (t); 9828 t = NULL_TREE; 9829 } 9830 9831 if (! t) 9832 { 9833 /* If no such tag is yet defined, create a forward-reference node 9834 and record it as the "definition". 9835 When a real declaration of this type is found, 9836 the forward-reference will be altered into a real type. */ 9837 if (code == ENUMERAL_TYPE) 9838 { 9839 error ("use of enum %q#D without previous declaration", name); 9840 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, error_mark_node); 9841 } 9842 else 9843 { 9844 t = make_aggr_type (code); 9845 TYPE_CONTEXT (t) = context; 9846 t = pushtag (name, t, scope); 9847 } 9848 } 9849 else 9850 { 9851 if (template_header_p && IS_AGGR_TYPE (t)) 9852 { 9853 if (!redeclare_class_template (t, current_template_parms)) 9854 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, error_mark_node); 9855 } 9856 else if (!processing_template_decl 9857 && CLASS_TYPE_P (t) 9858 && CLASSTYPE_IS_TEMPLATE (t)) 9859 { 9860 error ("redeclaration of %qT as a non-template", t); 9861 error ("previous declaration %q+D", t); 9862 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, error_mark_node); 9863 } 9864 9865 /* Make injected friend class visible. */ 9866 if (scope != ts_within_enclosing_non_class 9867 && hidden_name_p (TYPE_NAME (t))) 9868 { 9869 DECL_ANTICIPATED (TYPE_NAME (t)) = 0; 9870 DECL_FRIEND_P (TYPE_NAME (t)) = 0; 9871 9872 if (TYPE_TEMPLATE_INFO (t)) 9873 { 9874 DECL_ANTICIPATED (TYPE_TI_TEMPLATE (t)) = 0; 9875 DECL_FRIEND_P (TYPE_TI_TEMPLATE (t)) = 0; 9876 } 9877 } 9878 } 9879 9880 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, t); 9881} 9882 9883tree 9884xref_tag_from_type (tree old, tree id, tag_scope scope) 9885{ 9886 enum tag_types tag_kind; 9887 9888 if (TREE_CODE (old) == RECORD_TYPE) 9889 tag_kind = (CLASSTYPE_DECLARED_CLASS (old) ? class_type : record_type); 9890 else 9891 tag_kind = union_type; 9892 9893 if (id == NULL_TREE) 9894 id = TYPE_IDENTIFIER (old); 9895 9896 return xref_tag (tag_kind, id, scope, false); 9897} 9898 9899/* Create the binfo hierarchy for REF with (possibly NULL) base list 9900 BASE_LIST. For each element on BASE_LIST the TREE_PURPOSE is an 9901 access_* node, and the TREE_VALUE is the type of the base-class. 9902 Non-NULL TREE_TYPE indicates virtual inheritance. 9903 9904 Returns true if the binfo heirarchy was successfully created, 9905 false if an error was detected. */ 9906 9907bool 9908xref_basetypes (tree ref, tree base_list) 9909{ 9910 tree *basep; 9911 tree binfo, base_binfo; 9912 unsigned max_vbases = 0; /* Maximum direct & indirect virtual bases. */ 9913 unsigned max_bases = 0; /* Maximum direct bases. */ 9914 int i; 9915 tree default_access; 9916 tree igo_prev; /* Track Inheritance Graph Order. */ 9917 9918 if (ref == error_mark_node) 9919 return false; 9920 9921 /* The base of a derived class is private by default, all others are 9922 public. */ 9923 default_access = (TREE_CODE (ref) == RECORD_TYPE 9924 && CLASSTYPE_DECLARED_CLASS (ref) 9925 ? access_private_node : access_public_node); 9926 9927 /* First, make sure that any templates in base-classes are 9928 instantiated. This ensures that if we call ourselves recursively 9929 we do not get confused about which classes are marked and which 9930 are not. */ 9931 basep = &base_list; 9932 while (*basep) 9933 { 9934 tree basetype = TREE_VALUE (*basep); 9935 9936 if (!(processing_template_decl && uses_template_parms (basetype)) 9937 && !complete_type_or_else (basetype, NULL)) 9938 /* An incomplete type. Remove it from the list. */ 9939 *basep = TREE_CHAIN (*basep); 9940 else 9941 { 9942 max_bases++; 9943 if (TREE_TYPE (*basep)) 9944 max_vbases++; 9945 if (CLASS_TYPE_P (basetype)) 9946 max_vbases += VEC_length (tree, CLASSTYPE_VBASECLASSES (basetype)); 9947 basep = &TREE_CHAIN (*basep); 9948 } 9949 } 9950 9951 TYPE_MARKED_P (ref) = 1; 9952 9953 /* The binfo slot should be empty, unless this is an (ill-formed) 9954 redefinition. */ 9955 gcc_assert (!TYPE_BINFO (ref) || TYPE_SIZE (ref)); 9956 gcc_assert (TYPE_MAIN_VARIANT (ref) == ref); 9957 9958 binfo = make_tree_binfo (max_bases); 9959 9960 TYPE_BINFO (ref) = binfo; 9961 BINFO_OFFSET (binfo) = size_zero_node; 9962 BINFO_TYPE (binfo) = ref; 9963 9964 if (max_bases) 9965 { 9966 BINFO_BASE_ACCESSES (binfo) = VEC_alloc (tree, gc, max_bases); 9967 /* An aggregate cannot have baseclasses. */ 9968 CLASSTYPE_NON_AGGREGATE (ref) = 1; 9969 9970 if (TREE_CODE (ref) == UNION_TYPE) 9971 { 9972 error ("derived union %qT invalid", ref); 9973 return false; 9974 } 9975 } 9976 9977 if (max_bases > 1) 9978 { 9979 if (TYPE_FOR_JAVA (ref)) 9980 { 9981 error ("Java class %qT cannot have multiple bases", ref); 9982 return false; 9983 } 9984 } 9985 9986 if (max_vbases) 9987 { 9988 CLASSTYPE_VBASECLASSES (ref) = VEC_alloc (tree, gc, max_vbases); 9989 9990 if (TYPE_FOR_JAVA (ref)) 9991 { 9992 error ("Java class %qT cannot have virtual bases", ref); 9993 return false; 9994 } 9995 } 9996 9997 for (igo_prev = binfo; base_list; base_list = TREE_CHAIN (base_list)) 9998 { 9999 tree access = TREE_PURPOSE (base_list); 10000 int via_virtual = TREE_TYPE (base_list) != NULL_TREE; 10001 tree basetype = TREE_VALUE (base_list); 10002 10003 if (access == access_default_node) 10004 access = default_access; 10005 10006 if (TREE_CODE (basetype) == TYPE_DECL) 10007 basetype = TREE_TYPE (basetype); 10008 if (TREE_CODE (basetype) != RECORD_TYPE 10009 && TREE_CODE (basetype) != TYPENAME_TYPE 10010 && TREE_CODE (basetype) != TEMPLATE_TYPE_PARM 10011 && TREE_CODE (basetype) != BOUND_TEMPLATE_TEMPLATE_PARM) 10012 { 10013 error ("base type %qT fails to be a struct or class type", 10014 basetype); 10015 return false; 10016 } 10017 10018 if (TYPE_FOR_JAVA (basetype) && (current_lang_depth () == 0)) 10019 TYPE_FOR_JAVA (ref) = 1; 10020 10021 base_binfo = NULL_TREE; 10022 if (CLASS_TYPE_P (basetype) && !dependent_type_p (basetype)) 10023 { 10024 base_binfo = TYPE_BINFO (basetype); 10025 /* The original basetype could have been a typedef'd type. */ 10026 basetype = BINFO_TYPE (base_binfo); 10027 10028 /* Inherit flags from the base. */ 10029 TYPE_HAS_NEW_OPERATOR (ref) 10030 |= TYPE_HAS_NEW_OPERATOR (basetype); 10031 TYPE_HAS_ARRAY_NEW_OPERATOR (ref) 10032 |= TYPE_HAS_ARRAY_NEW_OPERATOR (basetype); 10033 TYPE_GETS_DELETE (ref) |= TYPE_GETS_DELETE (basetype); 10034 TYPE_HAS_CONVERSION (ref) |= TYPE_HAS_CONVERSION (basetype); 10035 CLASSTYPE_DIAMOND_SHAPED_P (ref) 10036 |= CLASSTYPE_DIAMOND_SHAPED_P (basetype); 10037 CLASSTYPE_REPEATED_BASE_P (ref) 10038 |= CLASSTYPE_REPEATED_BASE_P (basetype); 10039 } 10040 10041 /* We must do this test after we've seen through a typedef 10042 type. */ 10043 if (TYPE_MARKED_P (basetype)) 10044 { 10045 if (basetype == ref) 10046 error ("recursive type %qT undefined", basetype); 10047 else 10048 error ("duplicate base type %qT invalid", basetype); 10049 return false; 10050 } 10051 TYPE_MARKED_P (basetype) = 1; 10052 10053 base_binfo = copy_binfo (base_binfo, basetype, ref, 10054 &igo_prev, via_virtual); 10055 if (!BINFO_INHERITANCE_CHAIN (base_binfo)) 10056 BINFO_INHERITANCE_CHAIN (base_binfo) = binfo; 10057 10058 BINFO_BASE_APPEND (binfo, base_binfo); 10059 BINFO_BASE_ACCESS_APPEND (binfo, access); 10060 } 10061 10062 if (VEC_space (tree, CLASSTYPE_VBASECLASSES (ref), 1)) 10063 /* If we have space in the vbase vector, we must have shared at 10064 least one of them, and are therefore diamond shaped. */ 10065 CLASSTYPE_DIAMOND_SHAPED_P (ref) = 1; 10066 10067 /* Unmark all the types. */ 10068 for (i = 0; BINFO_BASE_ITERATE (binfo, i, base_binfo); i++) 10069 TYPE_MARKED_P (BINFO_TYPE (base_binfo)) = 0; 10070 TYPE_MARKED_P (ref) = 0; 10071 10072 /* Now see if we have a repeated base type. */ 10073 if (!CLASSTYPE_REPEATED_BASE_P (ref)) 10074 { 10075 for (base_binfo = binfo; base_binfo; 10076 base_binfo = TREE_CHAIN (base_binfo)) 10077 { 10078 if (TYPE_MARKED_P (BINFO_TYPE (base_binfo))) 10079 { 10080 CLASSTYPE_REPEATED_BASE_P (ref) = 1; 10081 break; 10082 } 10083 TYPE_MARKED_P (BINFO_TYPE (base_binfo)) = 1; 10084 } 10085 for (base_binfo = binfo; base_binfo; 10086 base_binfo = TREE_CHAIN (base_binfo)) 10087 if (TYPE_MARKED_P (BINFO_TYPE (base_binfo))) 10088 TYPE_MARKED_P (BINFO_TYPE (base_binfo)) = 0; 10089 else 10090 break; 10091 } 10092 10093 return true; 10094} 10095 10096 10097/* Begin compiling the definition of an enumeration type. 10098 NAME is its name. 10099 Returns the type object, as yet incomplete. 10100 Also records info about it so that build_enumerator 10101 may be used to declare the individual values as they are read. */ 10102 10103tree 10104start_enum (tree name) 10105{ 10106 tree enumtype; 10107 10108 gcc_assert (TREE_CODE (name) == IDENTIFIER_NODE); 10109 10110 /* If this is the real definition for a previous forward reference, 10111 fill in the contents in the same object that used to be the 10112 forward reference. */ 10113 10114 enumtype = lookup_and_check_tag (enum_type, name, 10115 /*tag_scope=*/ts_current, 10116 /*template_header_p=*/false); 10117 10118 if (enumtype != NULL_TREE && TREE_CODE (enumtype) == ENUMERAL_TYPE) 10119 { 10120 error ("multiple definition of %q#T", enumtype); 10121 error ("%Jprevious definition here", TYPE_MAIN_DECL (enumtype)); 10122 /* Clear out TYPE_VALUES, and start again. */ 10123 TYPE_VALUES (enumtype) = NULL_TREE; 10124 } 10125 else 10126 { 10127 /* In case of error, make a dummy enum to allow parsing to 10128 continue. */ 10129 if (enumtype == error_mark_node) 10130 name = make_anon_name (); 10131 10132 enumtype = make_node (ENUMERAL_TYPE); 10133 enumtype = pushtag (name, enumtype, /*tag_scope=*/ts_current); 10134 } 10135 10136 return enumtype; 10137} 10138 10139/* After processing and defining all the values of an enumeration type, 10140 install their decls in the enumeration type and finish it off. 10141 ENUMTYPE is the type object and VALUES a list of name-value pairs. */ 10142 10143void 10144finish_enum (tree enumtype) 10145{ 10146 tree values; 10147 tree decl; 10148 tree value; 10149 tree minnode; 10150 tree maxnode; 10151 tree t; 10152 bool unsignedp; 10153 bool use_short_enum; 10154 int lowprec; 10155 int highprec; 10156 int precision; 10157 integer_type_kind itk; 10158 tree underlying_type = NULL_TREE; 10159 10160 /* We built up the VALUES in reverse order. */ 10161 TYPE_VALUES (enumtype) = nreverse (TYPE_VALUES (enumtype)); 10162 10163 /* For an enum defined in a template, just set the type of the values; 10164 all further processing is postponed until the template is 10165 instantiated. We need to set the type so that tsubst of a CONST_DECL 10166 works. */ 10167 if (processing_template_decl) 10168 { 10169 for (values = TYPE_VALUES (enumtype); 10170 values; 10171 values = TREE_CHAIN (values)) 10172 TREE_TYPE (TREE_VALUE (values)) = enumtype; 10173 if (at_function_scope_p ()) 10174 add_stmt (build_min (TAG_DEFN, enumtype)); 10175 return; 10176 } 10177 10178 /* Determine the minimum and maximum values of the enumerators. */ 10179 if (TYPE_VALUES (enumtype)) 10180 { 10181 minnode = maxnode = NULL_TREE; 10182 10183 for (values = TYPE_VALUES (enumtype); 10184 values; 10185 values = TREE_CHAIN (values)) 10186 { 10187 decl = TREE_VALUE (values); 10188 10189 /* [dcl.enum]: Following the closing brace of an enum-specifier, 10190 each enumerator has the type of its enumeration. Prior to the 10191 closing brace, the type of each enumerator is the type of its 10192 initializing value. */ 10193 TREE_TYPE (decl) = enumtype; 10194 10195 /* Update the minimum and maximum values, if appropriate. */ 10196 value = DECL_INITIAL (decl); 10197 if (value == error_mark_node) 10198 value = integer_zero_node; 10199 /* Figure out what the minimum and maximum values of the 10200 enumerators are. */ 10201 if (!minnode) 10202 minnode = maxnode = value; 10203 else if (tree_int_cst_lt (maxnode, value)) 10204 maxnode = value; 10205 else if (tree_int_cst_lt (value, minnode)) 10206 minnode = value; 10207 } 10208 } 10209 else 10210 /* [dcl.enum] 10211 10212 If the enumerator-list is empty, the underlying type is as if 10213 the enumeration had a single enumerator with value 0. */ 10214 minnode = maxnode = integer_zero_node; 10215 10216 /* Compute the number of bits require to represent all values of the 10217 enumeration. We must do this before the type of MINNODE and 10218 MAXNODE are transformed, since min_precision relies on the 10219 TREE_TYPE of the value it is passed. */ 10220 unsignedp = tree_int_cst_sgn (minnode) >= 0; 10221 lowprec = min_precision (minnode, unsignedp); 10222 highprec = min_precision (maxnode, unsignedp); 10223 precision = MAX (lowprec, highprec); 10224 10225 /* Determine the underlying type of the enumeration. 10226 10227 [dcl.enum] 10228 10229 The underlying type of an enumeration is an integral type that 10230 can represent all the enumerator values defined in the 10231 enumeration. It is implementation-defined which integral type is 10232 used as the underlying type for an enumeration except that the 10233 underlying type shall not be larger than int unless the value of 10234 an enumerator cannot fit in an int or unsigned int. 10235 10236 We use "int" or an "unsigned int" as the underlying type, even if 10237 a smaller integral type would work, unless the user has 10238 explicitly requested that we use the smallest possible type. The 10239 user can request that for all enumerations with a command line 10240 flag, or for just one enumeration with an attribute. */ 10241 10242 use_short_enum = flag_short_enums 10243 || lookup_attribute ("packed", TYPE_ATTRIBUTES (enumtype)); 10244 10245 for (itk = (use_short_enum ? itk_char : itk_int); 10246 itk != itk_none; 10247 itk++) 10248 { 10249 underlying_type = integer_types[itk]; 10250 if (TYPE_PRECISION (underlying_type) >= precision 10251 && TYPE_UNSIGNED (underlying_type) == unsignedp) 10252 break; 10253 } 10254 if (itk == itk_none) 10255 { 10256 /* DR 377 10257 10258 IF no integral type can represent all the enumerator values, the 10259 enumeration is ill-formed. */ 10260 error ("no integral type can represent all of the enumerator values " 10261 "for %qT", enumtype); 10262 precision = TYPE_PRECISION (long_long_integer_type_node); 10263 underlying_type = integer_types[itk_unsigned_long_long]; 10264 } 10265 10266 /* Compute the minium and maximum values for the type. 10267 10268 [dcl.enum] 10269 10270 For an enumeration where emin is the smallest enumerator and emax 10271 is the largest, the values of the enumeration are the values of the 10272 underlying type in the range bmin to bmax, where bmin and bmax are, 10273 respectively, the smallest and largest values of the smallest bit- 10274 field that can store emin and emax. */ 10275 10276 /* The middle-end currently assumes that types with TYPE_PRECISION 10277 narrower than their underlying type are suitably zero or sign 10278 extended to fill their mode. g++ doesn't make these guarantees. 10279 Until the middle-end can represent such paradoxical types, we 10280 set the TYPE_PRECISION to the width of the underlying type. */ 10281 TYPE_PRECISION (enumtype) = TYPE_PRECISION (underlying_type); 10282 10283 set_min_and_max_values_for_integral_type (enumtype, precision, unsignedp); 10284 10285 /* [dcl.enum] 10286 10287 The value of sizeof() applied to an enumeration type, an object 10288 of an enumeration type, or an enumerator, is the value of sizeof() 10289 applied to the underlying type. */ 10290 TYPE_SIZE (enumtype) = TYPE_SIZE (underlying_type); 10291 TYPE_SIZE_UNIT (enumtype) = TYPE_SIZE_UNIT (underlying_type); 10292 TYPE_MODE (enumtype) = TYPE_MODE (underlying_type); 10293 TYPE_ALIGN (enumtype) = TYPE_ALIGN (underlying_type); 10294 TYPE_USER_ALIGN (enumtype) = TYPE_USER_ALIGN (underlying_type); 10295 TYPE_UNSIGNED (enumtype) = TYPE_UNSIGNED (underlying_type); 10296 10297 /* Convert each of the enumerators to the type of the underlying 10298 type of the enumeration. */ 10299 for (values = TYPE_VALUES (enumtype); values; values = TREE_CHAIN (values)) 10300 { 10301 location_t saved_location; 10302 10303 decl = TREE_VALUE (values); 10304 saved_location = input_location; 10305 input_location = DECL_SOURCE_LOCATION (decl); 10306 value = perform_implicit_conversion (underlying_type, 10307 DECL_INITIAL (decl)); 10308 input_location = saved_location; 10309 10310 /* Do not clobber shared ints. */ 10311 value = copy_node (value); 10312 10313 TREE_TYPE (value) = enumtype; 10314 DECL_INITIAL (decl) = value; 10315 TREE_VALUE (values) = value; 10316 } 10317 10318 /* Fix up all variant types of this enum type. */ 10319 for (t = TYPE_MAIN_VARIANT (enumtype); t; t = TYPE_NEXT_VARIANT (t)) 10320 { 10321 TYPE_VALUES (t) = TYPE_VALUES (enumtype); 10322 TYPE_MIN_VALUE (t) = TYPE_MIN_VALUE (enumtype); 10323 TYPE_MAX_VALUE (t) = TYPE_MAX_VALUE (enumtype); 10324 TYPE_SIZE (t) = TYPE_SIZE (enumtype); 10325 TYPE_SIZE_UNIT (t) = TYPE_SIZE_UNIT (enumtype); 10326 TYPE_MODE (t) = TYPE_MODE (enumtype); 10327 TYPE_PRECISION (t) = TYPE_PRECISION (enumtype); 10328 TYPE_ALIGN (t) = TYPE_ALIGN (enumtype); 10329 TYPE_USER_ALIGN (t) = TYPE_USER_ALIGN (enumtype); 10330 TYPE_UNSIGNED (t) = TYPE_UNSIGNED (enumtype); 10331 } 10332 10333 /* Finish debugging output for this type. */ 10334 rest_of_type_compilation (enumtype, namespace_bindings_p ()); 10335} 10336 10337/* Build and install a CONST_DECL for an enumeration constant of the 10338 enumeration type ENUMTYPE whose NAME and VALUE (if any) are provided. 10339 Assignment of sequential values by default is handled here. */ 10340 10341void 10342build_enumerator (tree name, tree value, tree enumtype) 10343{ 10344 tree decl; 10345 tree context; 10346 tree type; 10347 10348 /* If the VALUE was erroneous, pretend it wasn't there; that will 10349 result in the enum being assigned the next value in sequence. */ 10350 if (value == error_mark_node) 10351 value = NULL_TREE; 10352 10353 /* Remove no-op casts from the value. */ 10354 if (value) 10355 STRIP_TYPE_NOPS (value); 10356 10357 if (! processing_template_decl) 10358 { 10359 /* Validate and default VALUE. */ 10360 if (value != NULL_TREE) 10361 { 10362 value = integral_constant_value (value); 10363 10364 if (TREE_CODE (value) == INTEGER_CST) 10365 { 10366 value = perform_integral_promotions (value); 10367 constant_expression_warning (value); 10368 } 10369 else 10370 { 10371 error ("enumerator value for %qD not integer constant", name); 10372 value = NULL_TREE; 10373 } 10374 } 10375 10376 /* Default based on previous value. */ 10377 if (value == NULL_TREE) 10378 { 10379 if (TYPE_VALUES (enumtype)) 10380 { 10381 HOST_WIDE_INT hi; 10382 unsigned HOST_WIDE_INT lo; 10383 tree prev_value; 10384 bool overflowed; 10385 10386 /* The next value is the previous value plus one. We can 10387 safely assume that the previous value is an INTEGER_CST. 10388 add_double doesn't know the type of the target expression, 10389 so we must check with int_fits_type_p as well. */ 10390 prev_value = DECL_INITIAL (TREE_VALUE (TYPE_VALUES (enumtype))); 10391 overflowed = add_double (TREE_INT_CST_LOW (prev_value), 10392 TREE_INT_CST_HIGH (prev_value), 10393 1, 0, &lo, &hi); 10394 value = build_int_cst_wide (TREE_TYPE (prev_value), lo, hi); 10395 overflowed |= !int_fits_type_p (value, TREE_TYPE (prev_value)); 10396 10397 if (overflowed) 10398 { 10399 error ("overflow in enumeration values at %qD", name); 10400 value = error_mark_node; 10401 } 10402 } 10403 else 10404 value = integer_zero_node; 10405 } 10406 10407 /* Remove no-op casts from the value. */ 10408 STRIP_TYPE_NOPS (value); 10409 } 10410 10411 /* C++ associates enums with global, function, or class declarations. */ 10412 context = current_scope (); 10413 10414 /* Build the actual enumeration constant. Note that the enumeration 10415 constants have the type of their initializers until the 10416 enumeration is complete: 10417 10418 [ dcl.enum ] 10419 10420 Following the closing brace of an enum-specifier, each enumer- 10421 ator has the type of its enumeration. Prior to the closing 10422 brace, the type of each enumerator is the type of its 10423 initializing value. 10424 10425 In finish_enum we will reset the type. Of course, if we're 10426 processing a template, there may be no value. */ 10427 type = value ? TREE_TYPE (value) : NULL_TREE; 10428 10429 if (context && context == current_class_type) 10430 /* This enum declaration is local to the class. We need the full 10431 lang_decl so that we can record DECL_CLASS_CONTEXT, for example. */ 10432 decl = build_lang_decl (CONST_DECL, name, type); 10433 else 10434 /* It's a global enum, or it's local to a function. (Note local to 10435 a function could mean local to a class method. */ 10436 decl = build_decl (CONST_DECL, name, type); 10437 10438 DECL_CONTEXT (decl) = FROB_CONTEXT (context); 10439 TREE_CONSTANT (decl) = 1; 10440 TREE_INVARIANT (decl) = 1; 10441 TREE_READONLY (decl) = 1; 10442 DECL_INITIAL (decl) = value; 10443 10444 if (context && context == current_class_type) 10445 /* In something like `struct S { enum E { i = 7 }; };' we put `i' 10446 on the TYPE_FIELDS list for `S'. (That's so that you can say 10447 things like `S::i' later.) */ 10448 finish_member_declaration (decl); 10449 else 10450 pushdecl (decl); 10451 10452 /* Add this enumeration constant to the list for this type. */ 10453 TYPE_VALUES (enumtype) = tree_cons (name, decl, TYPE_VALUES (enumtype)); 10454} 10455 10456 10457/* We're defining DECL. Make sure that it's type is OK. */ 10458 10459static void 10460check_function_type (tree decl, tree current_function_parms) 10461{ 10462 tree fntype = TREE_TYPE (decl); 10463 tree return_type = complete_type (TREE_TYPE (fntype)); 10464 10465 /* In a function definition, arg types must be complete. */ 10466 require_complete_types_for_parms (current_function_parms); 10467 10468 if (dependent_type_p (return_type)) 10469 return; 10470 if (!COMPLETE_OR_VOID_TYPE_P (return_type)) 10471 { 10472 tree args = TYPE_ARG_TYPES (fntype); 10473 10474 error ("return type %q#T is incomplete", return_type); 10475 10476 /* Make it return void instead. */ 10477 if (TREE_CODE (fntype) == METHOD_TYPE) 10478 fntype = build_method_type_directly (TREE_TYPE (TREE_VALUE (args)), 10479 void_type_node, 10480 TREE_CHAIN (args)); 10481 else 10482 fntype = build_function_type (void_type_node, args); 10483 TREE_TYPE (decl) 10484 = build_exception_variant (fntype, 10485 TYPE_RAISES_EXCEPTIONS (TREE_TYPE (decl))); 10486 } 10487 else 10488 abstract_virtuals_error (decl, TREE_TYPE (fntype)); 10489} 10490 10491/* Create the FUNCTION_DECL for a function definition. 10492 DECLSPECS and DECLARATOR are the parts of the declaration; 10493 they describe the function's name and the type it returns, 10494 but twisted together in a fashion that parallels the syntax of C. 10495 10496 FLAGS is a bitwise or of SF_PRE_PARSED (indicating that the 10497 DECLARATOR is really the DECL for the function we are about to 10498 process and that DECLSPECS should be ignored), SF_INCLASS_INLINE 10499 indicating that the function is an inline defined in-class. 10500 10501 This function creates a binding context for the function body 10502 as well as setting up the FUNCTION_DECL in current_function_decl. 10503 10504 For C++, we must first check whether that datum makes any sense. 10505 For example, "class A local_a(1,2);" means that variable local_a 10506 is an aggregate of type A, which should have a constructor 10507 applied to it with the argument list [1, 2]. */ 10508 10509void 10510start_preparsed_function (tree decl1, tree attrs, int flags) 10511{ 10512 tree ctype = NULL_TREE; 10513 tree fntype; 10514 tree restype; 10515 int doing_friend = 0; 10516 struct cp_binding_level *bl; 10517 tree current_function_parms; 10518 struct c_fileinfo *finfo 10519 = get_fileinfo (LOCATION_FILE (DECL_SOURCE_LOCATION (decl1))); 10520 bool honor_interface; 10521 10522 /* Sanity check. */ 10523 gcc_assert (TREE_CODE (TREE_VALUE (void_list_node)) == VOID_TYPE); 10524 gcc_assert (TREE_CHAIN (void_list_node) == NULL_TREE); 10525 10526 fntype = TREE_TYPE (decl1); 10527 if (TREE_CODE (fntype) == METHOD_TYPE) 10528 ctype = TYPE_METHOD_BASETYPE (fntype); 10529 10530 /* ISO C++ 11.4/5. A friend function defined in a class is in 10531 the (lexical) scope of the class in which it is defined. */ 10532 if (!ctype && DECL_FRIEND_P (decl1)) 10533 { 10534 ctype = DECL_FRIEND_CONTEXT (decl1); 10535 10536 /* CTYPE could be null here if we're dealing with a template; 10537 for example, `inline friend float foo()' inside a template 10538 will have no CTYPE set. */ 10539 if (ctype && TREE_CODE (ctype) != RECORD_TYPE) 10540 ctype = NULL_TREE; 10541 else 10542 doing_friend = 1; 10543 } 10544 10545 if (DECL_DECLARED_INLINE_P (decl1) 10546 && lookup_attribute ("noinline", attrs)) 10547 warning (0, "inline function %q+D given attribute noinline", decl1); 10548 10549 if (DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (decl1)) 10550 /* This is a constructor, we must ensure that any default args 10551 introduced by this definition are propagated to the clones 10552 now. The clones are used directly in overload resolution. */ 10553 adjust_clone_args (decl1); 10554 10555 /* Sometimes we don't notice that a function is a static member, and 10556 build a METHOD_TYPE for it. Fix that up now. */ 10557 if (ctype != NULL_TREE && DECL_STATIC_FUNCTION_P (decl1) 10558 && TREE_CODE (TREE_TYPE (decl1)) == METHOD_TYPE) 10559 { 10560 revert_static_member_fn (decl1); 10561 ctype = NULL_TREE; 10562 } 10563 10564 /* Set up current_class_type, and enter the scope of the class, if 10565 appropriate. */ 10566 if (ctype) 10567 push_nested_class (ctype); 10568 else if (DECL_STATIC_FUNCTION_P (decl1)) 10569 push_nested_class (DECL_CONTEXT (decl1)); 10570 10571 /* Now that we have entered the scope of the class, we must restore 10572 the bindings for any template parameters surrounding DECL1, if it 10573 is an inline member template. (Order is important; consider the 10574 case where a template parameter has the same name as a field of 10575 the class.) It is not until after this point that 10576 PROCESSING_TEMPLATE_DECL is guaranteed to be set up correctly. */ 10577 if (flags & SF_INCLASS_INLINE) 10578 maybe_begin_member_template_processing (decl1); 10579 10580 /* Effective C++ rule 15. */ 10581 if (warn_ecpp 10582 && DECL_OVERLOADED_OPERATOR_P (decl1) == NOP_EXPR 10583 && TREE_CODE (TREE_TYPE (fntype)) == VOID_TYPE) 10584 warning (OPT_Weffc__, "%<operator=%> should return a reference to %<*this%>"); 10585 10586 /* Make the init_value nonzero so pushdecl knows this is not tentative. 10587 error_mark_node is replaced below (in poplevel) with the BLOCK. */ 10588 if (!DECL_INITIAL (decl1)) 10589 DECL_INITIAL (decl1) = error_mark_node; 10590 10591 /* This function exists in static storage. 10592 (This does not mean `static' in the C sense!) */ 10593 TREE_STATIC (decl1) = 1; 10594 10595 /* We must call push_template_decl after current_class_type is set 10596 up. (If we are processing inline definitions after exiting a 10597 class scope, current_class_type will be NULL_TREE until set above 10598 by push_nested_class.) */ 10599 if (processing_template_decl) 10600 { 10601 /* FIXME: Handle error_mark_node more gracefully. */ 10602 tree newdecl1 = push_template_decl (decl1); 10603 if (newdecl1 != error_mark_node) 10604 decl1 = newdecl1; 10605 } 10606 10607 /* We are now in the scope of the function being defined. */ 10608 current_function_decl = decl1; 10609 10610 /* Save the parm names or decls from this function's declarator 10611 where store_parm_decls will find them. */ 10612 current_function_parms = DECL_ARGUMENTS (decl1); 10613 10614 /* Make sure the parameter and return types are reasonable. When 10615 you declare a function, these types can be incomplete, but they 10616 must be complete when you define the function. */ 10617 check_function_type (decl1, current_function_parms); 10618 10619 /* Build the return declaration for the function. */ 10620 restype = TREE_TYPE (fntype); 10621 /* Promote the value to int before returning it. */ 10622 if (c_promoting_integer_type_p (restype)) 10623 restype = type_promotes_to (restype); 10624 if (DECL_RESULT (decl1) == NULL_TREE) 10625 { 10626 tree resdecl; 10627 10628 resdecl = build_decl (RESULT_DECL, 0, TYPE_MAIN_VARIANT (restype)); 10629 DECL_ARTIFICIAL (resdecl) = 1; 10630 DECL_IGNORED_P (resdecl) = 1; 10631 DECL_RESULT (decl1) = resdecl; 10632 10633 cp_apply_type_quals_to_decl (cp_type_quals (restype), resdecl); 10634 } 10635 10636 /* Initialize RTL machinery. We cannot do this until 10637 CURRENT_FUNCTION_DECL and DECL_RESULT are set up. We do this 10638 even when processing a template; this is how we get 10639 CFUN set up, and our per-function variables initialized. 10640 FIXME factor out the non-RTL stuff. */ 10641 bl = current_binding_level; 10642 allocate_struct_function (decl1); 10643 current_binding_level = bl; 10644 10645 /* Even though we're inside a function body, we still don't want to 10646 call expand_expr to calculate the size of a variable-sized array. 10647 We haven't necessarily assigned RTL to all variables yet, so it's 10648 not safe to try to expand expressions involving them. */ 10649 cfun->x_dont_save_pending_sizes_p = 1; 10650 10651 /* Start the statement-tree, start the tree now. */ 10652 DECL_SAVED_TREE (decl1) = push_stmt_list (); 10653 10654 /* Let the user know we're compiling this function. */ 10655 announce_function (decl1); 10656 10657 /* Record the decl so that the function name is defined. 10658 If we already have a decl for this name, and it is a FUNCTION_DECL, 10659 use the old decl. */ 10660 if (!processing_template_decl && !(flags & SF_PRE_PARSED)) 10661 { 10662 /* A specialization is not used to guide overload resolution. */ 10663 if (!DECL_FUNCTION_MEMBER_P (decl1) 10664 && !(DECL_USE_TEMPLATE (decl1) && 10665 PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (decl1)))) 10666 { 10667 tree olddecl = pushdecl (decl1); 10668 10669 if (olddecl == error_mark_node) 10670 /* If something went wrong when registering the declaration, 10671 use DECL1; we have to have a FUNCTION_DECL to use when 10672 parsing the body of the function. */ 10673 ; 10674 else 10675 /* Otherwise, OLDDECL is either a previous declaration of 10676 the same function or DECL1 itself. */ 10677 decl1 = olddecl; 10678 } 10679 else 10680 { 10681 /* We need to set the DECL_CONTEXT. */ 10682 if (!DECL_CONTEXT (decl1) && DECL_TEMPLATE_INFO (decl1)) 10683 DECL_CONTEXT (decl1) = DECL_CONTEXT (DECL_TI_TEMPLATE (decl1)); 10684 } 10685 fntype = TREE_TYPE (decl1); 10686 10687 /* If #pragma weak applies, mark the decl appropriately now. 10688 The pragma only applies to global functions. Because 10689 determining whether or not the #pragma applies involves 10690 computing the mangled name for the declaration, we cannot 10691 apply the pragma until after we have merged this declaration 10692 with any previous declarations; if the original declaration 10693 has a linkage specification, that specification applies to 10694 the definition as well, and may affect the mangled name. */ 10695 if (!DECL_CONTEXT (decl1)) 10696 maybe_apply_pragma_weak (decl1); 10697 } 10698 10699 /* Reset these in case the call to pushdecl changed them. */ 10700 current_function_decl = decl1; 10701 cfun->decl = decl1; 10702 10703 /* If we are (erroneously) defining a function that we have already 10704 defined before, wipe out what we knew before. */ 10705 if (!DECL_PENDING_INLINE_P (decl1)) 10706 DECL_SAVED_FUNCTION_DATA (decl1) = NULL; 10707 10708 if (ctype && !doing_friend && !DECL_STATIC_FUNCTION_P (decl1)) 10709 { 10710 /* We know that this was set up by `grokclassfn'. We do not 10711 wait until `store_parm_decls', since evil parse errors may 10712 never get us to that point. Here we keep the consistency 10713 between `current_class_type' and `current_class_ptr'. */ 10714 tree t = DECL_ARGUMENTS (decl1); 10715 10716 gcc_assert (t != NULL_TREE && TREE_CODE (t) == PARM_DECL); 10717 gcc_assert (TREE_CODE (TREE_TYPE (t)) == POINTER_TYPE); 10718 10719 cp_function_chain->x_current_class_ref 10720 = build_indirect_ref (t, NULL); 10721 cp_function_chain->x_current_class_ptr = t; 10722 10723 /* Constructors and destructors need to know whether they're "in 10724 charge" of initializing virtual base classes. */ 10725 t = TREE_CHAIN (t); 10726 if (DECL_HAS_IN_CHARGE_PARM_P (decl1)) 10727 { 10728 current_in_charge_parm = t; 10729 t = TREE_CHAIN (t); 10730 } 10731 if (DECL_HAS_VTT_PARM_P (decl1)) 10732 { 10733 gcc_assert (DECL_NAME (t) == vtt_parm_identifier); 10734 current_vtt_parm = t; 10735 } 10736 } 10737 10738 honor_interface = (!DECL_TEMPLATE_INSTANTIATION (decl1) 10739 /* Implicitly-defined methods (like the 10740 destructor for a class in which no destructor 10741 is explicitly declared) must not be defined 10742 until their definition is needed. So, we 10743 ignore interface specifications for 10744 compiler-generated functions. */ 10745 && !DECL_ARTIFICIAL (decl1)); 10746 10747 if (DECL_INTERFACE_KNOWN (decl1)) 10748 { 10749 tree ctx = decl_function_context (decl1); 10750 10751 if (DECL_NOT_REALLY_EXTERN (decl1)) 10752 DECL_EXTERNAL (decl1) = 0; 10753 10754 if (ctx != NULL_TREE && DECL_DECLARED_INLINE_P (ctx) 10755 && TREE_PUBLIC (ctx)) 10756 /* This is a function in a local class in an extern inline 10757 function. */ 10758 comdat_linkage (decl1); 10759 } 10760 /* If this function belongs to an interface, it is public. 10761 If it belongs to someone else's interface, it is also external. 10762 This only affects inlines and template instantiations. */ 10763 else if (!finfo->interface_unknown && honor_interface) 10764 { 10765 if (DECL_DECLARED_INLINE_P (decl1) 10766 || DECL_TEMPLATE_INSTANTIATION (decl1) 10767 || processing_template_decl) 10768 { 10769 DECL_EXTERNAL (decl1) 10770 = (finfo->interface_only 10771 || (DECL_DECLARED_INLINE_P (decl1) 10772 && ! flag_implement_inlines 10773 && !DECL_VINDEX (decl1))); 10774 10775 /* For WIN32 we also want to put these in linkonce sections. */ 10776 maybe_make_one_only (decl1); 10777 } 10778 else 10779 DECL_EXTERNAL (decl1) = 0; 10780 DECL_INTERFACE_KNOWN (decl1) = 1; 10781 /* If this function is in an interface implemented in this file, 10782 make sure that the backend knows to emit this function 10783 here. */ 10784 if (!DECL_EXTERNAL (decl1)) 10785 mark_needed (decl1); 10786 } 10787 else if (finfo->interface_unknown && finfo->interface_only 10788 && honor_interface) 10789 { 10790 /* If MULTIPLE_SYMBOL_SPACES is defined and we saw a #pragma 10791 interface, we will have both finfo->interface_unknown and 10792 finfo->interface_only set. In that case, we don't want to 10793 use the normal heuristics because someone will supply a 10794 #pragma implementation elsewhere, and deducing it here would 10795 produce a conflict. */ 10796 comdat_linkage (decl1); 10797 DECL_EXTERNAL (decl1) = 0; 10798 DECL_INTERFACE_KNOWN (decl1) = 1; 10799 DECL_DEFER_OUTPUT (decl1) = 1; 10800 } 10801 else 10802 { 10803 /* This is a definition, not a reference. 10804 So clear DECL_EXTERNAL. */ 10805 DECL_EXTERNAL (decl1) = 0; 10806 10807 if ((DECL_DECLARED_INLINE_P (decl1) 10808 || DECL_TEMPLATE_INSTANTIATION (decl1)) 10809 && ! DECL_INTERFACE_KNOWN (decl1) 10810 /* Don't try to defer nested functions for now. */ 10811 && ! decl_function_context (decl1)) 10812 DECL_DEFER_OUTPUT (decl1) = 1; 10813 else 10814 DECL_INTERFACE_KNOWN (decl1) = 1; 10815 } 10816 10817 /* Determine the ELF visibility attribute for the function. We must not 10818 do this before calling "pushdecl", as we must allow "duplicate_decls" 10819 to merge any attributes appropriately. We also need to wait until 10820 linkage is set. */ 10821 if (!DECL_CLONED_FUNCTION_P (decl1)) 10822 determine_visibility (decl1); 10823 10824 begin_scope (sk_function_parms, decl1); 10825 10826 ++function_depth; 10827 10828 if (DECL_DESTRUCTOR_P (decl1) 10829 || (DECL_CONSTRUCTOR_P (decl1) 10830 && targetm.cxx.cdtor_returns_this ())) 10831 { 10832 cdtor_label = build_decl (LABEL_DECL, NULL_TREE, NULL_TREE); 10833 DECL_CONTEXT (cdtor_label) = current_function_decl; 10834 } 10835 10836 start_fname_decls (); 10837 10838 store_parm_decls (current_function_parms); 10839} 10840 10841 10842/* Like start_preparsed_function, except that instead of a 10843 FUNCTION_DECL, this function takes DECLSPECS and DECLARATOR. 10844 10845 Returns 1 on success. If the DECLARATOR is not suitable for a function 10846 (it defines a datum instead), we return 0, which tells 10847 yyparse to report a parse error. */ 10848 10849int 10850start_function (cp_decl_specifier_seq *declspecs, 10851 const cp_declarator *declarator, 10852 tree attrs) 10853{ 10854 tree decl1; 10855 10856 decl1 = grokdeclarator (declarator, declspecs, FUNCDEF, 1, &attrs); 10857 /* If the declarator is not suitable for a function definition, 10858 cause a syntax error. */ 10859 if (decl1 == NULL_TREE || TREE_CODE (decl1) != FUNCTION_DECL) 10860 return 0; 10861 10862 if (DECL_MAIN_P (decl1)) 10863 /* main must return int. grokfndecl should have corrected it 10864 (and issued a diagnostic) if the user got it wrong. */ 10865 gcc_assert (same_type_p (TREE_TYPE (TREE_TYPE (decl1)), 10866 integer_type_node)); 10867 10868 start_preparsed_function (decl1, attrs, /*flags=*/SF_DEFAULT); 10869 10870 return 1; 10871} 10872 10873/* Returns true iff an EH_SPEC_BLOCK should be created in the body of 10874 FN. */ 10875 10876static bool 10877use_eh_spec_block (tree fn) 10878{ 10879 return (flag_exceptions && flag_enforce_eh_specs 10880 && !processing_template_decl 10881 && TYPE_RAISES_EXCEPTIONS (TREE_TYPE (fn)) 10882 /* We insert the EH_SPEC_BLOCK only in the original 10883 function; then, it is copied automatically to the 10884 clones. */ 10885 && !DECL_CLONED_FUNCTION_P (fn) 10886 /* Implicitly-generated constructors and destructors have 10887 exception specifications. However, those specifications 10888 are the union of the possible exceptions specified by the 10889 constructors/destructors for bases and members, so no 10890 unallowed exception will ever reach this function. By 10891 not creating the EH_SPEC_BLOCK we save a little memory, 10892 and we avoid spurious warnings about unreachable 10893 code. */ 10894 && !DECL_ARTIFICIAL (fn)); 10895} 10896 10897/* Store the parameter declarations into the current function declaration. 10898 This is called after parsing the parameter declarations, before 10899 digesting the body of the function. 10900 10901 Also install to binding contour return value identifier, if any. */ 10902 10903static void 10904store_parm_decls (tree current_function_parms) 10905{ 10906 tree fndecl = current_function_decl; 10907 tree parm; 10908 10909 /* This is a chain of any other decls that came in among the parm 10910 declarations. If a parm is declared with enum {foo, bar} x; 10911 then CONST_DECLs for foo and bar are put here. */ 10912 tree nonparms = NULL_TREE; 10913 10914 if (current_function_parms) 10915 { 10916 /* This case is when the function was defined with an ANSI prototype. 10917 The parms already have decls, so we need not do anything here 10918 except record them as in effect 10919 and complain if any redundant old-style parm decls were written. */ 10920 10921 tree specparms = current_function_parms; 10922 tree next; 10923 10924 /* Must clear this because it might contain TYPE_DECLs declared 10925 at class level. */ 10926 current_binding_level->names = NULL; 10927 10928 /* If we're doing semantic analysis, then we'll call pushdecl 10929 for each of these. We must do them in reverse order so that 10930 they end in the correct forward order. */ 10931 specparms = nreverse (specparms); 10932 10933 for (parm = specparms; parm; parm = next) 10934 { 10935 next = TREE_CHAIN (parm); 10936 if (TREE_CODE (parm) == PARM_DECL) 10937 { 10938 if (DECL_NAME (parm) == NULL_TREE 10939 || TREE_CODE (parm) != VOID_TYPE) 10940 pushdecl (parm); 10941 else 10942 error ("parameter %qD declared void", parm); 10943 } 10944 else 10945 { 10946 /* If we find an enum constant or a type tag, 10947 put it aside for the moment. */ 10948 TREE_CHAIN (parm) = NULL_TREE; 10949 nonparms = chainon (nonparms, parm); 10950 } 10951 } 10952 10953 /* Get the decls in their original chain order and record in the 10954 function. This is all and only the PARM_DECLs that were 10955 pushed into scope by the loop above. */ 10956 DECL_ARGUMENTS (fndecl) = getdecls (); 10957 } 10958 else 10959 DECL_ARGUMENTS (fndecl) = NULL_TREE; 10960 10961 /* Now store the final chain of decls for the arguments 10962 as the decl-chain of the current lexical scope. 10963 Put the enumerators in as well, at the front so that 10964 DECL_ARGUMENTS is not modified. */ 10965 current_binding_level->names = chainon (nonparms, DECL_ARGUMENTS (fndecl)); 10966 10967 if (use_eh_spec_block (current_function_decl)) 10968 current_eh_spec_block = begin_eh_spec_block (); 10969} 10970 10971 10972/* We have finished doing semantic analysis on DECL, but have not yet 10973 generated RTL for its body. Save away our current state, so that 10974 when we want to generate RTL later we know what to do. */ 10975 10976static void 10977save_function_data (tree decl) 10978{ 10979 struct language_function *f; 10980 10981 /* Save the language-specific per-function data so that we can 10982 get it back when we really expand this function. */ 10983 gcc_assert (!DECL_PENDING_INLINE_P (decl)); 10984 10985 /* Make a copy. */ 10986 f = GGC_NEW (struct language_function); 10987 memcpy (f, cp_function_chain, sizeof (struct language_function)); 10988 DECL_SAVED_FUNCTION_DATA (decl) = f; 10989 10990 /* Clear out the bits we don't need. */ 10991 f->base.x_stmt_tree.x_cur_stmt_list = NULL_TREE; 10992 f->bindings = NULL; 10993 f->x_local_names = NULL; 10994} 10995 10996 10997/* Set the return value of the constructor (if present). */ 10998 10999static void 11000finish_constructor_body (void) 11001{ 11002 tree val; 11003 tree exprstmt; 11004 11005 if (targetm.cxx.cdtor_returns_this ()) 11006 { 11007 /* Any return from a constructor will end up here. */ 11008 add_stmt (build_stmt (LABEL_EXPR, cdtor_label)); 11009 11010 val = DECL_ARGUMENTS (current_function_decl); 11011 val = build2 (MODIFY_EXPR, TREE_TYPE (val), 11012 DECL_RESULT (current_function_decl), val); 11013 /* Return the address of the object. */ 11014 exprstmt = build_stmt (RETURN_EXPR, val); 11015 add_stmt (exprstmt); 11016 } 11017} 11018 11019/* Do all the processing for the beginning of a destructor; set up the 11020 vtable pointers and cleanups for bases and members. */ 11021 11022static void 11023begin_destructor_body (void) 11024{ 11025 tree compound_stmt; 11026 11027 /* If the CURRENT_CLASS_TYPE is incomplete, we will have already 11028 issued an error message. We still want to try to process the 11029 body of the function, but initialize_vtbl_ptrs will crash if 11030 TYPE_BINFO is NULL. */ 11031 if (COMPLETE_TYPE_P (current_class_type)) 11032 { 11033 compound_stmt = begin_compound_stmt (0); 11034 /* Make all virtual function table pointers in non-virtual base 11035 classes point to CURRENT_CLASS_TYPE's virtual function 11036 tables. */ 11037 initialize_vtbl_ptrs (current_class_ptr); 11038 finish_compound_stmt (compound_stmt); 11039 11040 /* And insert cleanups for our bases and members so that they 11041 will be properly destroyed if we throw. */ 11042 push_base_cleanups (); 11043 } 11044} 11045 11046/* At the end of every destructor we generate code to delete the object if 11047 necessary. Do that now. */ 11048 11049static void 11050finish_destructor_body (void) 11051{ 11052 tree exprstmt; 11053 11054 /* Any return from a destructor will end up here; that way all base 11055 and member cleanups will be run when the function returns. */ 11056 add_stmt (build_stmt (LABEL_EXPR, cdtor_label)); 11057 11058 /* In a virtual destructor, we must call delete. */ 11059 if (DECL_VIRTUAL_P (current_function_decl)) 11060 { 11061 tree if_stmt; 11062 tree virtual_size = cxx_sizeof (current_class_type); 11063 11064 /* [class.dtor] 11065 11066 At the point of definition of a virtual destructor (including 11067 an implicit definition), non-placement operator delete shall 11068 be looked up in the scope of the destructor's class and if 11069 found shall be accessible and unambiguous. */ 11070 exprstmt = build_op_delete_call(DELETE_EXPR, current_class_ptr, 11071 virtual_size, 11072 /*global_p=*/false, 11073 /*placement=*/NULL_TREE, 11074 /*alloc_fn=*/NULL_TREE); 11075 11076 if_stmt = begin_if_stmt (); 11077 finish_if_stmt_cond (build2 (BIT_AND_EXPR, integer_type_node, 11078 current_in_charge_parm, 11079 integer_one_node), 11080 if_stmt); 11081 finish_expr_stmt (exprstmt); 11082 finish_then_clause (if_stmt); 11083 finish_if_stmt (if_stmt); 11084 } 11085 11086 if (targetm.cxx.cdtor_returns_this ()) 11087 { 11088 tree val; 11089 11090 val = DECL_ARGUMENTS (current_function_decl); 11091 val = build2 (MODIFY_EXPR, TREE_TYPE (val), 11092 DECL_RESULT (current_function_decl), val); 11093 /* Return the address of the object. */ 11094 exprstmt = build_stmt (RETURN_EXPR, val); 11095 add_stmt (exprstmt); 11096 } 11097} 11098 11099/* Do the necessary processing for the beginning of a function body, which 11100 in this case includes member-initializers, but not the catch clauses of 11101 a function-try-block. Currently, this means opening a binding level 11102 for the member-initializers (in a ctor) and member cleanups (in a dtor). */ 11103 11104tree 11105begin_function_body (void) 11106{ 11107 tree stmt; 11108 11109 if (! FUNCTION_NEEDS_BODY_BLOCK (current_function_decl)) 11110 return NULL_TREE; 11111 11112 if (processing_template_decl) 11113 /* Do nothing now. */; 11114 else 11115 /* Always keep the BLOCK node associated with the outermost pair of 11116 curly braces of a function. These are needed for correct 11117 operation of dwarfout.c. */ 11118 keep_next_level (true); 11119 11120 stmt = begin_compound_stmt (BCS_FN_BODY); 11121 11122 if (processing_template_decl) 11123 /* Do nothing now. */; 11124 else if (DECL_DESTRUCTOR_P (current_function_decl)) 11125 begin_destructor_body (); 11126 11127 return stmt; 11128} 11129 11130/* Do the processing for the end of a function body. Currently, this means 11131 closing out the cleanups for fully-constructed bases and members, and in 11132 the case of the destructor, deleting the object if desired. Again, this 11133 is only meaningful for [cd]tors, since they are the only functions where 11134 there is a significant distinction between the main body and any 11135 function catch clauses. Handling, say, main() return semantics here 11136 would be wrong, as flowing off the end of a function catch clause for 11137 main() would also need to return 0. */ 11138 11139void 11140finish_function_body (tree compstmt) 11141{ 11142 if (compstmt == NULL_TREE) 11143 return; 11144 11145 /* Close the block. */ 11146 finish_compound_stmt (compstmt); 11147 11148 if (processing_template_decl) 11149 /* Do nothing now. */; 11150 else if (DECL_CONSTRUCTOR_P (current_function_decl)) 11151 finish_constructor_body (); 11152 else if (DECL_DESTRUCTOR_P (current_function_decl)) 11153 finish_destructor_body (); 11154} 11155 11156/* Given a function, returns the BLOCK corresponding to the outermost level 11157 of curly braces, skipping the artificial block created for constructor 11158 initializers. */ 11159 11160static tree 11161outer_curly_brace_block (tree fndecl) 11162{ 11163 tree block = BLOCK_SUBBLOCKS (DECL_INITIAL (fndecl)); 11164 if (FUNCTION_NEEDS_BODY_BLOCK (current_function_decl)) 11165 /* Skip the artificial function body block. */ 11166 block = BLOCK_SUBBLOCKS (block); 11167 return block; 11168} 11169 11170/* Finish up a function declaration and compile that function 11171 all the way to assembler language output. The free the storage 11172 for the function definition. 11173 11174 FLAGS is a bitwise or of the following values: 11175 2 - INCLASS_INLINE 11176 We just finished processing the body of an in-class inline 11177 function definition. (This processing will have taken place 11178 after the class definition is complete.) */ 11179 11180tree 11181finish_function (int flags) 11182{ 11183 tree fndecl = current_function_decl; 11184 tree fntype, ctype = NULL_TREE; 11185 int inclass_inline = (flags & 2) != 0; 11186 int nested; 11187 11188 /* When we get some parse errors, we can end up without a 11189 current_function_decl, so cope. */ 11190 if (fndecl == NULL_TREE) 11191 return error_mark_node; 11192 11193 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fndecl) 11194 && DECL_VIRTUAL_P (fndecl) 11195 && !processing_template_decl) 11196 { 11197 tree fnclass = DECL_CONTEXT (fndecl); 11198 if (fndecl == CLASSTYPE_KEY_METHOD (fnclass)) 11199 keyed_classes = tree_cons (NULL_TREE, fnclass, keyed_classes); 11200 } 11201 11202 nested = function_depth > 1; 11203 fntype = TREE_TYPE (fndecl); 11204 11205 /* TREE_READONLY (fndecl) = 1; 11206 This caused &foo to be of type ptr-to-const-function 11207 which then got a warning when stored in a ptr-to-function variable. */ 11208 11209 gcc_assert (building_stmt_tree ()); 11210 11211 /* For a cloned function, we've already got all the code we need; 11212 there's no need to add any extra bits. */ 11213 if (!DECL_CLONED_FUNCTION_P (fndecl)) 11214 { 11215 if (DECL_MAIN_P (current_function_decl)) 11216 { 11217 tree stmt; 11218 11219 /* Make it so that `main' always returns 0 by default (or 11220 1 for VMS). */ 11221#if VMS_TARGET 11222 stmt = finish_return_stmt (integer_one_node); 11223#else 11224 stmt = finish_return_stmt (integer_zero_node); 11225#endif 11226 /* Hack. We don't want the middle-end to warn that this 11227 return is unreachable, so put the statement on the 11228 special line 0. */ 11229#ifdef USE_MAPPED_LOCATION 11230 SET_EXPR_LOCATION (stmt, UNKNOWN_LOCATION); 11231#else 11232 annotate_with_file_line (stmt, input_filename, 0); 11233#endif 11234 } 11235 11236 if (use_eh_spec_block (current_function_decl)) 11237 finish_eh_spec_block (TYPE_RAISES_EXCEPTIONS 11238 (TREE_TYPE (current_function_decl)), 11239 current_eh_spec_block); 11240 } 11241 11242 /* If we're saving up tree structure, tie off the function now. */ 11243 DECL_SAVED_TREE (fndecl) = pop_stmt_list (DECL_SAVED_TREE (fndecl)); 11244 11245 finish_fname_decls (); 11246 11247 /* If this function can't throw any exceptions, remember that. */ 11248 if (!processing_template_decl 11249 && !cp_function_chain->can_throw 11250 && !flag_non_call_exceptions 11251 && !DECL_REPLACEABLE_P (fndecl)) 11252 TREE_NOTHROW (fndecl) = 1; 11253 11254 /* This must come after expand_function_end because cleanups might 11255 have declarations (from inline functions) that need to go into 11256 this function's blocks. */ 11257 11258 /* If the current binding level isn't the outermost binding level 11259 for this function, either there is a bug, or we have experienced 11260 syntax errors and the statement tree is malformed. */ 11261 if (current_binding_level->kind != sk_function_parms) 11262 { 11263 /* Make sure we have already experienced errors. */ 11264 gcc_assert (errorcount); 11265 11266 /* Throw away the broken statement tree and extra binding 11267 levels. */ 11268 DECL_SAVED_TREE (fndecl) = alloc_stmt_list (); 11269 11270 while (current_binding_level->kind != sk_function_parms) 11271 { 11272 if (current_binding_level->kind == sk_class) 11273 pop_nested_class (); 11274 else 11275 poplevel (0, 0, 0); 11276 } 11277 } 11278 poplevel (1, 0, 1); 11279 11280 /* Statements should always be full-expressions at the outermost set 11281 of curly braces for a function. */ 11282 gcc_assert (stmts_are_full_exprs_p ()); 11283 11284 /* Set up the named return value optimization, if we can. Candidate 11285 variables are selected in check_return_expr. */ 11286 if (current_function_return_value) 11287 { 11288 tree r = current_function_return_value; 11289 tree outer; 11290 11291 if (r != error_mark_node 11292 /* This is only worth doing for fns that return in memory--and 11293 simpler, since we don't have to worry about promoted modes. */ 11294 && aggregate_value_p (TREE_TYPE (TREE_TYPE (fndecl)), fndecl) 11295 /* Only allow this for variables declared in the outer scope of 11296 the function so we know that their lifetime always ends with a 11297 return; see g++.dg/opt/nrv6.C. We could be more flexible if 11298 we were to do this optimization in tree-ssa. */ 11299 && (outer = outer_curly_brace_block (fndecl)) 11300 && chain_member (r, BLOCK_VARS (outer))) 11301 finalize_nrv (&DECL_SAVED_TREE (fndecl), r, DECL_RESULT (fndecl)); 11302 11303 current_function_return_value = NULL_TREE; 11304 } 11305 11306 /* Remember that we were in class scope. */ 11307 if (current_class_name) 11308 ctype = current_class_type; 11309 11310 /* Must mark the RESULT_DECL as being in this function. */ 11311 DECL_CONTEXT (DECL_RESULT (fndecl)) = fndecl; 11312 11313 /* Set the BLOCK_SUPERCONTEXT of the outermost function scope to point 11314 to the FUNCTION_DECL node itself. */ 11315 BLOCK_SUPERCONTEXT (DECL_INITIAL (fndecl)) = fndecl; 11316 11317 /* Save away current state, if appropriate. */ 11318 if (!processing_template_decl) 11319 save_function_data (fndecl); 11320 11321 /* Complain if there's just no return statement. */ 11322 if (warn_return_type 11323 && TREE_CODE (TREE_TYPE (fntype)) != VOID_TYPE 11324 && !dependent_type_p (TREE_TYPE (fntype)) 11325 && !current_function_returns_value && !current_function_returns_null 11326 /* Don't complain if we abort or throw. */ 11327 && !current_function_returns_abnormally 11328 && !DECL_NAME (DECL_RESULT (fndecl)) 11329 /* Normally, with -Wreturn-type, flow will complain. Unless we're an 11330 inline function, as we might never be compiled separately. */ 11331 && (DECL_INLINE (fndecl) || processing_template_decl) 11332 /* Structor return values (if any) are set by the compiler. */ 11333 && !DECL_CONSTRUCTOR_P (fndecl) 11334 && !DECL_DESTRUCTOR_P (fndecl)) 11335 warning (OPT_Wreturn_type, "no return statement in function returning non-void"); 11336 11337 /* Store the end of the function, so that we get good line number 11338 info for the epilogue. */ 11339 cfun->function_end_locus = input_location; 11340 11341 /* Genericize before inlining. */ 11342 if (!processing_template_decl) 11343 { 11344 struct language_function *f = DECL_SAVED_FUNCTION_DATA (fndecl); 11345 cp_genericize (fndecl); 11346 /* Clear out the bits we don't need. */ 11347 f->x_current_class_ptr = NULL; 11348 f->x_current_class_ref = NULL; 11349 f->x_eh_spec_block = NULL; 11350 f->x_in_charge_parm = NULL; 11351 f->x_vtt_parm = NULL; 11352 f->x_return_value = NULL; 11353 f->bindings = NULL; 11354 f->extern_decl_map = NULL; 11355 11356 /* Handle attribute((warn_unused_result)). Relies on gimple input. */ 11357 c_warn_unused_result (&DECL_SAVED_TREE (fndecl)); 11358 } 11359 /* Clear out the bits we don't need. */ 11360 local_names = NULL; 11361 11362 /* We're leaving the context of this function, so zap cfun. It's still in 11363 DECL_STRUCT_FUNCTION, and we'll restore it in tree_rest_of_compilation. */ 11364 cfun = NULL; 11365 current_function_decl = NULL; 11366 11367 /* If this is an in-class inline definition, we may have to pop the 11368 bindings for the template parameters that we added in 11369 maybe_begin_member_template_processing when start_function was 11370 called. */ 11371 if (inclass_inline) 11372 maybe_end_member_template_processing (); 11373 11374 /* Leave the scope of the class. */ 11375 if (ctype) 11376 pop_nested_class (); 11377 11378 --function_depth; 11379 11380 /* Clean up. */ 11381 if (! nested) 11382 /* Let the error reporting routines know that we're outside a 11383 function. For a nested function, this value is used in 11384 cxx_pop_function_context and then reset via pop_function_context. */ 11385 current_function_decl = NULL_TREE; 11386 11387 return fndecl; 11388} 11389 11390/* Create the FUNCTION_DECL for a function definition. 11391 DECLSPECS and DECLARATOR are the parts of the declaration; 11392 they describe the return type and the name of the function, 11393 but twisted together in a fashion that parallels the syntax of C. 11394 11395 This function creates a binding context for the function body 11396 as well as setting up the FUNCTION_DECL in current_function_decl. 11397 11398 Returns a FUNCTION_DECL on success. 11399 11400 If the DECLARATOR is not suitable for a function (it defines a datum 11401 instead), we return 0, which tells yyparse to report a parse error. 11402 11403 May return void_type_node indicating that this method is actually 11404 a friend. See grokfield for more details. 11405 11406 Came here with a `.pushlevel' . 11407 11408 DO NOT MAKE ANY CHANGES TO THIS CODE WITHOUT MAKING CORRESPONDING 11409 CHANGES TO CODE IN `grokfield'. */ 11410 11411tree 11412start_method (cp_decl_specifier_seq *declspecs, 11413 const cp_declarator *declarator, tree attrlist) 11414{ 11415 tree fndecl = grokdeclarator (declarator, declspecs, MEMFUNCDEF, 0, 11416 &attrlist); 11417 11418 if (fndecl == error_mark_node) 11419 return error_mark_node; 11420 11421 if (fndecl == NULL || TREE_CODE (fndecl) != FUNCTION_DECL) 11422 { 11423 error ("invalid member function declaration"); 11424 return error_mark_node; 11425 } 11426 11427 if (attrlist) 11428 cplus_decl_attributes (&fndecl, attrlist, 0); 11429 11430 /* Pass friends other than inline friend functions back. */ 11431 if (fndecl == void_type_node) 11432 return fndecl; 11433 11434 if (DECL_IN_AGGR_P (fndecl)) 11435 { 11436 if (DECL_CONTEXT (fndecl) 11437 && TREE_CODE (DECL_CONTEXT (fndecl)) != NAMESPACE_DECL) 11438 error ("%qD is already defined in class %qT", fndecl, 11439 DECL_CONTEXT (fndecl)); 11440 return error_mark_node; 11441 } 11442 11443 check_template_shadow (fndecl); 11444 11445 DECL_DECLARED_INLINE_P (fndecl) = 1; 11446 if (flag_default_inline) 11447 DECL_INLINE (fndecl) = 1; 11448 11449 /* We process method specializations in finish_struct_1. */ 11450 if (processing_template_decl && !DECL_TEMPLATE_SPECIALIZATION (fndecl)) 11451 { 11452 fndecl = push_template_decl (fndecl); 11453 if (fndecl == error_mark_node) 11454 return fndecl; 11455 } 11456 11457 if (! DECL_FRIEND_P (fndecl)) 11458 { 11459 if (TREE_CHAIN (fndecl)) 11460 { 11461 fndecl = copy_node (fndecl); 11462 TREE_CHAIN (fndecl) = NULL_TREE; 11463 } 11464 } 11465 11466 finish_decl (fndecl, NULL_TREE, NULL_TREE); 11467 11468 /* Make a place for the parms. */ 11469 begin_scope (sk_function_parms, fndecl); 11470 11471 DECL_IN_AGGR_P (fndecl) = 1; 11472 return fndecl; 11473} 11474 11475/* Go through the motions of finishing a function definition. 11476 We don't compile this method until after the whole class has 11477 been processed. 11478 11479 FINISH_METHOD must return something that looks as though it 11480 came from GROKFIELD (since we are defining a method, after all). 11481 11482 This is called after parsing the body of the function definition. 11483 STMTS is the chain of statements that makes up the function body. 11484 11485 DECL is the ..._DECL that `start_method' provided. */ 11486 11487tree 11488finish_method (tree decl) 11489{ 11490 tree fndecl = decl; 11491 tree old_initial; 11492 11493 tree link; 11494 11495 if (decl == void_type_node) 11496 return decl; 11497 11498 old_initial = DECL_INITIAL (fndecl); 11499 11500 /* Undo the level for the parms (from start_method). 11501 This is like poplevel, but it causes nothing to be 11502 saved. Saving information here confuses symbol-table 11503 output routines. Besides, this information will 11504 be correctly output when this method is actually 11505 compiled. */ 11506 11507 /* Clear out the meanings of the local variables of this level; 11508 also record in each decl which block it belongs to. */ 11509 11510 for (link = current_binding_level->names; link; link = TREE_CHAIN (link)) 11511 { 11512 if (DECL_NAME (link) != NULL_TREE) 11513 pop_binding (DECL_NAME (link), link); 11514 gcc_assert (TREE_CODE (link) != FUNCTION_DECL); 11515 DECL_CONTEXT (link) = NULL_TREE; 11516 } 11517 11518 poplevel (0, 0, 0); 11519 11520 DECL_INITIAL (fndecl) = old_initial; 11521 11522 /* We used to check if the context of FNDECL was different from 11523 current_class_type as another way to get inside here. This didn't work 11524 for String.cc in libg++. */ 11525 if (DECL_FRIEND_P (fndecl)) 11526 { 11527 VEC_safe_push (tree, gc, CLASSTYPE_INLINE_FRIENDS (current_class_type), 11528 fndecl); 11529 decl = void_type_node; 11530 } 11531 11532 return decl; 11533} 11534 11535 11536/* VAR is a VAR_DECL. If its type is incomplete, remember VAR so that 11537 we can lay it out later, when and if its type becomes complete. */ 11538 11539void 11540maybe_register_incomplete_var (tree var) 11541{ 11542 gcc_assert (TREE_CODE (var) == VAR_DECL); 11543 11544 /* Keep track of variables with incomplete types. */ 11545 if (!processing_template_decl && TREE_TYPE (var) != error_mark_node 11546 && DECL_EXTERNAL (var)) 11547 { 11548 tree inner_type = TREE_TYPE (var); 11549 11550 while (TREE_CODE (inner_type) == ARRAY_TYPE) 11551 inner_type = TREE_TYPE (inner_type); 11552 inner_type = TYPE_MAIN_VARIANT (inner_type); 11553 11554 if ((!COMPLETE_TYPE_P (inner_type) && CLASS_TYPE_P (inner_type)) 11555 /* RTTI TD entries are created while defining the type_info. */ 11556 || (TYPE_LANG_SPECIFIC (inner_type) 11557 && TYPE_BEING_DEFINED (inner_type))) 11558 incomplete_vars = tree_cons (inner_type, var, incomplete_vars); 11559 } 11560} 11561 11562/* Called when a class type (given by TYPE) is defined. If there are 11563 any existing VAR_DECLs whose type hsa been completed by this 11564 declaration, update them now. */ 11565 11566void 11567complete_vars (tree type) 11568{ 11569 tree *list = &incomplete_vars; 11570 11571 gcc_assert (CLASS_TYPE_P (type)); 11572 while (*list) 11573 { 11574 if (same_type_p (type, TREE_PURPOSE (*list))) 11575 { 11576 tree var = TREE_VALUE (*list); 11577 tree type = TREE_TYPE (var); 11578 /* Complete the type of the variable. The VAR_DECL itself 11579 will be laid out in expand_expr. */ 11580 complete_type (type); 11581 cp_apply_type_quals_to_decl (cp_type_quals (type), var); 11582 /* Remove this entry from the list. */ 11583 *list = TREE_CHAIN (*list); 11584 } 11585 else 11586 list = &TREE_CHAIN (*list); 11587 } 11588 11589 /* Check for pending declarations which may have abstract type. */ 11590 complete_type_check_abstract (type); 11591} 11592 11593/* If DECL is of a type which needs a cleanup, build that cleanup 11594 here. */ 11595 11596tree 11597cxx_maybe_build_cleanup (tree decl) 11598{ 11599 tree type = TREE_TYPE (decl); 11600 11601 if (type != error_mark_node && TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type)) 11602 { 11603 int flags = LOOKUP_NORMAL|LOOKUP_DESTRUCTOR; 11604 tree rval; 11605 bool has_vbases = (TREE_CODE (type) == RECORD_TYPE 11606 && CLASSTYPE_VBASECLASSES (type)); 11607 11608 if (TREE_CODE (type) == ARRAY_TYPE) 11609 rval = decl; 11610 else 11611 { 11612 cxx_mark_addressable (decl); 11613 rval = build_unary_op (ADDR_EXPR, decl, 0); 11614 } 11615 11616 /* Optimize for space over speed here. */ 11617 if (!has_vbases || flag_expensive_optimizations) 11618 flags |= LOOKUP_NONVIRTUAL; 11619 11620 rval = build_delete (TREE_TYPE (rval), rval, 11621 sfk_complete_destructor, flags, 0); 11622 11623 return rval; 11624 } 11625 return NULL_TREE; 11626} 11627 11628/* When a stmt has been parsed, this function is called. */ 11629 11630void 11631finish_stmt (void) 11632{ 11633} 11634 11635/* DECL was originally constructed as a non-static member function, 11636 but turned out to be static. Update it accordingly. */ 11637 11638void 11639revert_static_member_fn (tree decl) 11640{ 11641 tree tmp; 11642 tree function = TREE_TYPE (decl); 11643 tree args = TYPE_ARG_TYPES (function); 11644 11645 if (cp_type_quals (TREE_TYPE (TREE_VALUE (args))) 11646 != TYPE_UNQUALIFIED) 11647 error ("static member function %q#D declared with type qualifiers", decl); 11648 11649 args = TREE_CHAIN (args); 11650 tmp = build_function_type (TREE_TYPE (function), args); 11651 tmp = build_qualified_type (tmp, cp_type_quals (function)); 11652 tmp = build_exception_variant (tmp, 11653 TYPE_RAISES_EXCEPTIONS (function)); 11654 TREE_TYPE (decl) = tmp; 11655 if (DECL_ARGUMENTS (decl)) 11656 DECL_ARGUMENTS (decl) = TREE_CHAIN (DECL_ARGUMENTS (decl)); 11657 DECL_STATIC_FUNCTION_P (decl) = 1; 11658} 11659 11660/* Initialize the variables used during compilation of a C++ 11661 function. */ 11662 11663void 11664cxx_push_function_context (struct function * f) 11665{ 11666 struct language_function *p = GGC_CNEW (struct language_function); 11667 f->language = p; 11668 11669 /* Whenever we start a new function, we destroy temporaries in the 11670 usual way. */ 11671 current_stmt_tree ()->stmts_are_full_exprs_p = 1; 11672 11673 if (f->decl) 11674 { 11675 tree fn = f->decl; 11676 11677 if (DECL_SAVED_FUNCTION_DATA (fn)) 11678 { 11679 /* If we already parsed this function, and we're just expanding it 11680 now, restore saved state. */ 11681 *cp_function_chain = *DECL_SAVED_FUNCTION_DATA (fn); 11682 11683 /* We don't need the saved data anymore. Unless this is an inline 11684 function; we need the named return value info for 11685 declare_return_variable. */ 11686 if (! DECL_INLINE (fn)) 11687 DECL_SAVED_FUNCTION_DATA (fn) = NULL; 11688 } 11689 } 11690} 11691 11692/* Free the language-specific parts of F, now that we've finished 11693 compiling the function. */ 11694 11695void 11696cxx_pop_function_context (struct function * f) 11697{ 11698 f->language = 0; 11699} 11700 11701/* Return which tree structure is used by T, or TS_CP_GENERIC if T is 11702 one of the language-independent trees. */ 11703 11704enum cp_tree_node_structure_enum 11705cp_tree_node_structure (union lang_tree_node * t) 11706{ 11707 switch (TREE_CODE (&t->generic)) 11708 { 11709 case DEFAULT_ARG: return TS_CP_DEFAULT_ARG; 11710 case IDENTIFIER_NODE: return TS_CP_IDENTIFIER; 11711 case OVERLOAD: return TS_CP_OVERLOAD; 11712 case TEMPLATE_PARM_INDEX: return TS_CP_TPI; 11713 case TINST_LEVEL: return TS_CP_TINST_LEVEL; 11714 case PTRMEM_CST: return TS_CP_PTRMEM; 11715 case BASELINK: return TS_CP_BASELINK; 11716 default: return TS_CP_GENERIC; 11717 } 11718} 11719 11720/* Build the void_list_node (void_type_node having been created). */ 11721tree 11722build_void_list_node (void) 11723{ 11724 tree t = build_tree_list (NULL_TREE, void_type_node); 11725 return t; 11726} 11727 11728bool 11729cp_missing_noreturn_ok_p (tree decl) 11730{ 11731 /* A missing noreturn is ok for the `main' function. */ 11732 return DECL_MAIN_P (decl); 11733} 11734 11735/* Return the COMDAT group into which DECL should be placed. */ 11736 11737const char * 11738cxx_comdat_group (tree decl) 11739{ 11740 tree name; 11741 11742 /* Virtual tables, construction virtual tables, and virtual table 11743 tables all go in a single COMDAT group, named after the primary 11744 virtual table. */ 11745 if (TREE_CODE (decl) == VAR_DECL && DECL_VTABLE_OR_VTT_P (decl)) 11746 name = DECL_ASSEMBLER_NAME (CLASSTYPE_VTABLES (DECL_CONTEXT (decl))); 11747 /* For all other DECLs, the COMDAT group is the mangled name of the 11748 declaration itself. */ 11749 else 11750 { 11751 while (DECL_THUNK_P (decl)) 11752 { 11753 /* If TARGET_USE_LOCAL_THUNK_ALIAS_P, use_thunk puts the thunk 11754 into the same section as the target function. In that case 11755 we must return target's name. */ 11756 tree target = THUNK_TARGET (decl); 11757 if (TARGET_USE_LOCAL_THUNK_ALIAS_P (target) 11758 && DECL_SECTION_NAME (target) != NULL 11759 && DECL_ONE_ONLY (target)) 11760 decl = target; 11761 else 11762 break; 11763 } 11764 name = DECL_ASSEMBLER_NAME (decl); 11765 } 11766 11767 return IDENTIFIER_POINTER (name); 11768} 11769 11770#include "gt-cp-decl.h" 11771