c-decl.c revision 104761
11590Srgrimes/* Process declarations and variables for C compiler. 21590Srgrimes Copyright (C) 1988, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000, 31590Srgrimes 2001, 2002 Free Software Foundation, Inc. 41590Srgrimes 51590SrgrimesThis file is part of GCC. 61590Srgrimes 71590SrgrimesGCC is free software; you can redistribute it and/or modify it under 81590Srgrimesthe terms of the GNU General Public License as published by the Free 91590SrgrimesSoftware Foundation; either version 2, or (at your option) any later 101590Srgrimesversion. 111590Srgrimes 121590SrgrimesGCC is distributed in the hope that it will be useful, but WITHOUT ANY 131590SrgrimesWARRANTY; without even the implied warranty of MERCHANTABILITY or 141590SrgrimesFITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License 151590Srgrimesfor more details. 161590Srgrimes 171590SrgrimesYou should have received a copy of the GNU General Public License 181590Srgrimesalong with GCC; see the file COPYING. If not, write to the Free 191590SrgrimesSoftware Foundation, 59 Temple Place - Suite 330, Boston, MA 201590Srgrimes02111-1307, USA. */ 211590Srgrimes 221590Srgrimes/* $FreeBSD: head/contrib/gcc/c-decl.c 104761 2002-10-10 04:46:44Z kan $ */ 231590Srgrimes 241590Srgrimes/* Process declarations and symbol lookup for C front end. 251590Srgrimes Also constructs types; the standard scalar types at initialization, 261590Srgrimes and structure, union, array and enum types when they are declared. */ 271590Srgrimes 281590Srgrimes/* ??? not all decl nodes are given the most useful possible 291590Srgrimes line numbers. For example, the CONST_DECLs for enum values. */ 301590Srgrimes 311590Srgrimes#include "config.h" 321590Srgrimes#include "system.h" 331590Srgrimes#include "intl.h" 341590Srgrimes#include "tree.h" 3527315Scharnier#include "tree-inline.h" 3623693Speter#include "rtl.h" 3727315Scharnier#include "flags.h" 3827315Scharnier#include "function.h" 3927315Scharnier#include "output.h" 401590Srgrimes#include "expr.h" 411590Srgrimes#include "c-tree.h" 421590Srgrimes#include "c-lex.h" 431590Srgrimes#include "toplev.h" 4427315Scharnier#include "ggc.h" 451590Srgrimes#include "tm_p.h" 461590Srgrimes#include "cpplib.h" 471590Srgrimes#include "target.h" 4823693Speter#include "debug.h" 4923693Speter#include "timevar.h" 501590Srgrimes#include "c-common.h" 511590Srgrimes#include "c-pragma.h" 521590Srgrimes 531590Srgrimes/* In grokdeclarator, distinguish syntactic contexts of declarators. */ 541590Srgrimesenum decl_context 551590Srgrimes{ NORMAL, /* Ordinary declaration */ 561590Srgrimes FUNCDEF, /* Function definition */ 571590Srgrimes PARM, /* Declaration of parm before function body */ 581590Srgrimes FIELD, /* Declaration inside struct or union */ 591590Srgrimes BITFIELD, /* Likewise but with specified width */ 601590Srgrimes TYPENAME}; /* Typename (inside cast or sizeof) */ 611590Srgrimes 621590Srgrimes 631590Srgrimes/* Nonzero if we have seen an invalid cross reference 641590Srgrimes to a struct, union, or enum, but not yet printed the message. */ 651590Srgrimes 6618550Sjoergtree pending_invalid_xref; 6718550Sjoerg/* File and line to appear in the eventual error message. */ 6818550Sjoergconst char *pending_invalid_xref_file; 6918550Sjoergint pending_invalid_xref_line; 7018693Speter 7118550Sjoerg/* While defining an enum type, this is 1 plus the last enumerator 7218550Sjoerg constant value. Note that will do not have to save this or `enum_overflow' 7324360Simp around nested function definition since such a definition could only 741590Srgrimes occur in an enum value expression and we don't use these variables in 751590Srgrimes that case. */ 761590Srgrimes 771590Srgrimesstatic tree enum_next_value; 781590Srgrimes 791590Srgrimes/* Nonzero means that there was overflow computing enum_next_value. */ 801590Srgrimes 811590Srgrimesstatic int enum_overflow; 821590Srgrimes 8318325Sphk/* Parsing a function declarator leaves a list of parameter names 8418325Sphk or a chain or parameter decls here. */ 8518693Speter 8618550Sjoergstatic tree last_function_parms; 8718325Sphk 881590Srgrimes/* Parsing a function declarator leaves here a chain of structure 891590Srgrimes and enum types declared in the parmlist. */ 901590Srgrimes 911590Srgrimesstatic tree last_function_parm_tags; 921590Srgrimes 931590Srgrimes/* After parsing the declarator that starts a function definition, 941590Srgrimes `start_function' puts here the list of parameter names or chain of decls. 951590Srgrimes `store_parm_decls' finds it here. */ 961590Srgrimes 971590Srgrimesstatic tree current_function_parms; 981590Srgrimes 991590Srgrimes/* Similar, for last_function_parm_tags. */ 10027315Scharnierstatic tree current_function_parm_tags; 1011590Srgrimes 1021590Srgrimes/* Similar, for the file and line that the prototype came from if this is 1031590Srgrimes an old-style definition. */ 1041590Srgrimesstatic const char *current_function_prototype_file; 1051590Srgrimesstatic int current_function_prototype_line; 1061590Srgrimes 1071590Srgrimes/* The current statement tree. */ 10827315Scharnier 1091590Srgrimesstatic struct stmt_tree_s c_stmt_tree; 1101590Srgrimes 1111590Srgrimes/* The current scope statement stack. */ 1121590Srgrimes 1131590Srgrimesstatic tree c_scope_stmt_stack; 1141590Srgrimes 1151590Srgrimes/* A list (chain of TREE_LIST nodes) of all LABEL_DECLs in the function 1161590Srgrimes that have names. Here so we can clear out their names' definitions 1171590Srgrimes at the end of the function. */ 1181590Srgrimes 1191590Srgrimesstatic tree named_labels; 1201590Srgrimes 1211590Srgrimes/* A list of LABEL_DECLs from outer contexts that are currently shadowed. */ 1221590Srgrimes 1231590Srgrimesstatic tree shadowed_labels; 1241590Srgrimes 1251590Srgrimes/* Nonzero when store_parm_decls is called indicates a varargs function. 1261590Srgrimes Value not meaningful after store_parm_decls. */ 1271590Srgrimes 1281590Srgrimesstatic int c_function_varargs; 1291590Srgrimes 1301590Srgrimes/* Set to 0 at beginning of a function definition, set to 1 if 1311590Srgrimes a return statement that specifies a return value is seen. */ 1321590Srgrimes 1331590Srgrimesint current_function_returns_value; 1341590Srgrimes 1351590Srgrimes/* Set to 0 at beginning of a function definition, set to 1 if 1361590Srgrimes a return statement with no argument is seen. */ 1371590Srgrimes 1381590Srgrimesint current_function_returns_null; 1391590Srgrimes 1401590Srgrimes/* Set to 0 at beginning of a function definition, set to 1 if 1411590Srgrimes a call to a noreturn function is seen. */ 1421590Srgrimes 14327315Scharnierint current_function_returns_abnormally; 14427315Scharnier 14527315Scharnier/* Set to nonzero by `grokdeclarator' for a function 14627315Scharnier whose return type is defaulted, if warnings for this are desired. */ 14727315Scharnier 1481590Srgrimesstatic int warn_about_return_type; 1491590Srgrimes 150/* Nonzero when starting a function declared `extern inline'. */ 151 152static int current_extern_inline; 153 154/* For each binding contour we allocate a binding_level structure 155 * which records the names defined in that contour. 156 * Contours include: 157 * 0) the global one 158 * 1) one for each function definition, 159 * where internal declarations of the parameters appear. 160 * 2) one for each compound statement, 161 * to record its declarations. 162 * 163 * The current meaning of a name can be found by searching the levels from 164 * the current one out to the global one. 165 */ 166 167/* Note that the information in the `names' component of the global contour 168 is duplicated in the IDENTIFIER_GLOBAL_VALUEs of all identifiers. */ 169 170struct binding_level 171 { 172 /* A chain of _DECL nodes for all variables, constants, functions, 173 and typedef types. These are in the reverse of the order supplied. 174 */ 175 tree names; 176 177 /* A list of structure, union and enum definitions, 178 * for looking up tag names. 179 * It is a chain of TREE_LIST nodes, each of whose TREE_PURPOSE is a name, 180 * or NULL_TREE; and whose TREE_VALUE is a RECORD_TYPE, UNION_TYPE, 181 * or ENUMERAL_TYPE node. 182 */ 183 tree tags; 184 185 /* For each level, a list of shadowed outer-level local definitions 186 to be restored when this level is popped. 187 Each link is a TREE_LIST whose TREE_PURPOSE is an identifier and 188 whose TREE_VALUE is its old definition (a kind of ..._DECL node). */ 189 tree shadowed; 190 191 /* For each level (except not the global one), 192 a chain of BLOCK nodes for all the levels 193 that were entered and exited one level down. */ 194 tree blocks; 195 196 /* The BLOCK node for this level, if one has been preallocated. 197 If 0, the BLOCK is allocated (if needed) when the level is popped. */ 198 tree this_block; 199 200 /* The binding level which this one is contained in (inherits from). */ 201 struct binding_level *level_chain; 202 203 /* Nonzero for the level that holds the parameters of a function. */ 204 char parm_flag; 205 206 /* Nonzero if this level "doesn't exist" for tags. */ 207 char tag_transparent; 208 209 /* Nonzero if sublevels of this level "don't exist" for tags. 210 This is set in the parm level of a function definition 211 while reading the function body, so that the outermost block 212 of the function body will be tag-transparent. */ 213 char subblocks_tag_transparent; 214 215 /* Nonzero means make a BLOCK for this level regardless of all else. */ 216 char keep; 217 218 /* Nonzero means make a BLOCK if this level has any subblocks. */ 219 char keep_if_subblocks; 220 221 /* Number of decls in `names' that have incomplete 222 structure or union types. */ 223 int n_incomplete; 224 225 /* A list of decls giving the (reversed) specified order of parms, 226 not including any forward-decls in the parmlist. 227 This is so we can put the parms in proper order for assign_parms. */ 228 tree parm_order; 229 }; 230 231#define NULL_BINDING_LEVEL (struct binding_level *) NULL 232 233/* The binding level currently in effect. */ 234 235static struct binding_level *current_binding_level; 236 237/* A chain of binding_level structures awaiting reuse. */ 238 239static struct binding_level *free_binding_level; 240 241/* The outermost binding level, for names of file scope. 242 This is created when the compiler is started and exists 243 through the entire run. */ 244 245static struct binding_level *global_binding_level; 246 247/* Binding level structures are initialized by copying this one. */ 248 249static struct binding_level clear_binding_level 250 = {NULL, NULL, NULL, NULL, NULL, NULL_BINDING_LEVEL, 0, 0, 0, 0, 0, 0, 251 NULL}; 252 253/* Nonzero means unconditionally make a BLOCK for the next level pushed. */ 254 255static int keep_next_level_flag; 256 257/* Nonzero means make a BLOCK for the next level pushed 258 if it has subblocks. */ 259 260static int keep_next_if_subblocks; 261 262/* The chain of outer levels of label scopes. 263 This uses the same data structure used for binding levels, 264 but it works differently: each link in the chain records 265 saved values of named_labels and shadowed_labels for 266 a label binding level outside the current one. */ 267 268static struct binding_level *label_level_chain; 269 270/* Functions called automatically at the beginning and end of execution. */ 271 272tree static_ctors, static_dtors; 273 274/* Forward declarations. */ 275 276static struct binding_level * make_binding_level PARAMS ((void)); 277static void mark_binding_level PARAMS ((void *)); 278static void clear_limbo_values PARAMS ((tree)); 279static int duplicate_decls PARAMS ((tree, tree, int)); 280static int redeclaration_error_message PARAMS ((tree, tree)); 281static void storedecls PARAMS ((tree)); 282static void storetags PARAMS ((tree)); 283static tree lookup_tag PARAMS ((enum tree_code, tree, 284 struct binding_level *, int)); 285static tree lookup_tag_reverse PARAMS ((tree)); 286static tree grokdeclarator PARAMS ((tree, tree, enum decl_context, 287 int)); 288static tree grokparms PARAMS ((tree, int)); 289static void layout_array_type PARAMS ((tree)); 290static tree c_make_fname_decl PARAMS ((tree, int)); 291static void c_expand_body PARAMS ((tree, int, int)); 292static void warn_if_shadowing PARAMS ((tree, tree)); 293 294/* C-specific option variables. */ 295 296/* Nonzero means allow type mismatches in conditional expressions; 297 just make their values `void'. */ 298 299int flag_cond_mismatch; 300 301/* Nonzero means don't recognize the keyword `asm'. */ 302 303int flag_no_asm; 304 305/* Nonzero means do some things the same way PCC does. */ 306 307int flag_traditional; 308 309/* Nonzero means enable C89 Amendment 1 features. */ 310 311int flag_isoc94 = 0; 312 313/* Nonzero means use the ISO C99 dialect of C. */ 314 315int flag_isoc99 = 0; 316 317/* Nonzero means allow the BSD kernel printf enhancments. */ 318 319int flag_bsd_format = 0; 320 321/* Nonzero means that we have builtin functions, and main is an int */ 322 323int flag_hosted = 1; 324 325/* Nonzero means add default format_arg attributes for functions not 326 in ISO C. */ 327 328int flag_noniso_default_format_attributes = 1; 329 330/* Nonzero means to allow single precision math even if we're generally 331 being traditional. */ 332int flag_allow_single_precision = 0; 333 334/* Nonzero means to treat bitfields as signed unless they say `unsigned'. */ 335 336int flag_signed_bitfields = 1; 337int explicit_flag_signed_bitfields = 0; 338 339/* Nonzero means warn about use of implicit int. */ 340 341int warn_implicit_int; 342 343/* Nonzero means warn about usage of long long when `-pedantic'. */ 344 345int warn_long_long = 1; 346 347/* Nonzero means message about use of implicit function declarations; 348 1 means warning; 2 means error. */ 349 350int mesg_implicit_function_declaration = -1; 351 352/* Nonzero means give string constants the type `const char *' 353 to get extra warnings from them. These warnings will be too numerous 354 to be useful, except in thoroughly ANSIfied programs. */ 355 356int flag_const_strings; 357 358/* Nonzero means warn about pointer casts that can drop a type qualifier 359 from the pointer target type. */ 360 361int warn_cast_qual; 362 363/* Nonzero means warn when casting a function call to a type that does 364 not match the return type (e.g. (float)sqrt() or (anything*)malloc() 365 when there is no previous declaration of sqrt or malloc. */ 366 367int warn_bad_function_cast; 368 369/* Warn about functions which might be candidates for format attributes. */ 370 371int warn_missing_format_attribute; 372 373/* Warn about traditional constructs whose meanings changed in ANSI C. */ 374 375int warn_traditional; 376 377/* Nonzero means warn about sizeof(function) or addition/subtraction 378 of function pointers. */ 379 380int warn_pointer_arith; 381 382 383/* Nonzero means do not warn that K&R style main() is not a function prototype. */ 384 385int flag_bsd_no_warn_kr_main; 386 387/* Nonzero means warn for non-prototype function decls 388 or non-prototyped defs without previous prototype. */ 389 390int warn_strict_prototypes; 391 392/* Nonzero means warn for any global function def 393 without separate previous prototype decl. */ 394 395int warn_missing_prototypes; 396 397/* Nonzero means warn for any global function def 398 without separate previous decl. */ 399 400int warn_missing_declarations; 401 402/* Nonzero means warn about multiple (redundant) decls for the same single 403 variable or function. */ 404 405int warn_redundant_decls = 0; 406 407/* Nonzero means warn about extern declarations of objects not at 408 file-scope level and about *all* declarations of functions (whether 409 extern or static) not at file-scope level. Note that we exclude 410 implicit function declarations. To get warnings about those, use 411 -Wimplicit. */ 412 413int warn_nested_externs = 0; 414 415/* Warn about a subscript that has type char. */ 416 417int warn_char_subscripts = 0; 418 419/* Warn if a type conversion is done that might have confusing results. */ 420 421int warn_conversion; 422 423/* Warn if adding () is suggested. */ 424 425int warn_parentheses; 426 427/* Warn if initializer is not completely bracketed. */ 428 429int warn_missing_braces; 430 431/* Warn if main is suspicious. */ 432 433int warn_main; 434 435/* Warn about #pragma directives that are not recognised. */ 436 437int warn_unknown_pragmas = 0; /* Tri state variable. */ 438 439/* Warn about comparison of signed and unsigned values. 440 If -1, neither -Wsign-compare nor -Wno-sign-compare has been specified. */ 441 442int warn_sign_compare = -1; 443 444/* Warn about testing equality of floating point numbers. */ 445 446int warn_float_equal = 0; 447 448/* Nonzero means warn about use of multicharacter literals. */ 449 450int warn_multichar = 1; 451 452/* Nonzero means `$' can be in an identifier. */ 453 454#ifndef DOLLARS_IN_IDENTIFIERS 455#define DOLLARS_IN_IDENTIFIERS 1 456#endif 457int dollars_in_ident = DOLLARS_IN_IDENTIFIERS; 458 459/* States indicating how grokdeclarator() should handle declspecs marked 460 with __attribute__((deprecated)). An object declared as 461 __attribute__((deprecated)) suppresses warnings of uses of other 462 deprecated items. */ 463 464enum deprecated_states { 465 DEPRECATED_NORMAL, 466 DEPRECATED_SUPPRESS 467}; 468 469static enum deprecated_states deprecated_state = DEPRECATED_NORMAL; 470 471/* Decode the string P as a language-specific option for C. 472 Return the number of strings consumed. Should not complain 473 if it does not recognise the option. */ 474 475int 476c_decode_option (argc, argv) 477 int argc ATTRIBUTE_UNUSED; 478 char **argv; 479{ 480 int strings_processed; 481 char *p = argv[0]; 482 483 strings_processed = cpp_handle_option (parse_in, argc, argv, 0); 484 485 if (!strcmp (p, "-ftraditional") || !strcmp (p, "-traditional")) 486 { 487 warning ("-traditional is deprecated and may be removed"); 488 flag_traditional = 1; 489 flag_writable_strings = 1; 490 } 491 else if (!strcmp (p, "-fallow-single-precision")) 492 flag_allow_single_precision = 1; 493 else if (!strcmp (p, "-fhosted") || !strcmp (p, "-fno-freestanding")) 494 { 495 flag_hosted = 1; 496 flag_no_builtin = 0; 497 } 498 else if (!strcmp (p, "-ffreestanding") || !strcmp (p, "-fno-hosted")) 499 { 500 flag_hosted = 0; 501 flag_no_builtin = 1; 502 /* warn_main will be 2 if set by -Wall, 1 if set by -Wmain */ 503 if (warn_main == 2) 504 warn_main = 0; 505 } 506 else if (!strcmp (p, "-fnotraditional") || !strcmp (p, "-fno-traditional")) 507 { 508 flag_traditional = 0; 509 flag_writable_strings = 0; 510 } 511 else if (!strncmp (p, "-std=", 5)) 512 { 513 /* Select the appropriate language standard. We currently 514 recognize: 515 -std=iso9899:1990 same as -ansi 516 -std=iso9899:199409 ISO C as modified in amend. 1 517 -std=iso9899:1999 ISO C 99 518 -std=c89 same as -std=iso9899:1990 519 -std=c99 same as -std=iso9899:1999 520 -std=gnu89 default, iso9899:1990 + gnu extensions 521 -std=gnu99 iso9899:1999 + gnu extensions 522 -std=bsd iso9899:1999 + BSD kernel printf extensions 523 */ 524 const char *const argstart = &p[5]; 525 526 if (!strcmp (argstart, "iso9899:1990") 527 || !strcmp (argstart, "c89")) 528 { 529 iso_1990: 530 flag_isoc94 = 0; 531 iso_1994: 532 flag_traditional = 0; 533 flag_writable_strings = 0; 534 flag_no_asm = 1; 535 flag_no_nonansi_builtin = 1; 536 flag_noniso_default_format_attributes = 0; 537 flag_isoc99 = 0; 538 flag_bsd_format = 0; 539 flag_bsd_no_warn_kr_main = 0; 540 } 541 else if (!strcmp (argstart, "iso9899:199409")) 542 { 543 flag_isoc94 = 1; 544 goto iso_1994; 545 } 546 else if (!strcmp (argstart, "iso9899:199x") 547 || !strcmp (argstart, "iso9899:1999") 548 || !strcmp (argstart, "c9x") 549 || !strcmp (argstart, "c99")) 550 { 551 flag_traditional = 0; 552 flag_writable_strings = 0; 553 flag_no_asm = 1; 554 flag_no_nonansi_builtin = 1; 555 flag_noniso_default_format_attributes = 0; 556 flag_isoc99 = 1; 557 flag_isoc94 = 1; 558 flag_bsd_format = 0; 559 flag_bsd_no_warn_kr_main = 0; 560 } 561 else if (!strcmp (argstart, "gnu89")) 562 { 563 flag_traditional = 0; 564 flag_writable_strings = 0; 565 flag_no_asm = 0; 566 flag_no_nonansi_builtin = 0; 567 flag_noniso_default_format_attributes = 1; 568 flag_isoc99 = 0; 569 flag_isoc94 = 0; 570 flag_bsd_format = 0; 571 flag_bsd_no_warn_kr_main = 0; 572 } 573 else if (!strcmp (argstart, "gnu9x") || !strcmp (argstart, "gnu99")) 574 { 575 flag_traditional = 0; 576 flag_writable_strings = 0; 577 flag_no_asm = 0; 578 flag_no_nonansi_builtin = 0; 579 flag_noniso_default_format_attributes = 1; 580 flag_isoc99 = 1; 581 flag_isoc94 = 1; 582 flag_bsd_format = 0; 583 flag_bsd_no_warn_kr_main = 0; 584 } 585 else if (!strcmp (argstart, "bsd")) 586 { 587 flag_traditional = 0; 588 flag_writable_strings = 0; 589 flag_no_asm = 0; 590 flag_no_nonansi_builtin = 0; 591 flag_noniso_default_format_attributes = 1; 592 flag_isoc99 = 0; 593 flag_isoc94 = 0; 594 flag_isoc94 = 0; 595 flag_bsd_format = 1; 596 flag_bsd_no_warn_kr_main = 1; 597 } 598 else 599 error ("unknown C standard `%s'", argstart); 600 } 601 else if (!strcmp (p, "-fdollars-in-identifiers")) 602 dollars_in_ident = 1; 603 else if (!strcmp (p, "-fno-dollars-in-identifiers")) 604 dollars_in_ident = 0; 605 else if (!strcmp (p, "-fsigned-char")) 606 flag_signed_char = 1; 607 else if (!strcmp (p, "-funsigned-char")) 608 flag_signed_char = 0; 609 else if (!strcmp (p, "-fno-signed-char")) 610 flag_signed_char = 0; 611 else if (!strcmp (p, "-fno-unsigned-char")) 612 flag_signed_char = 1; 613 else if (!strcmp (p, "-fsigned-bitfields") 614 || !strcmp (p, "-fno-unsigned-bitfields")) 615 { 616 flag_signed_bitfields = 1; 617 explicit_flag_signed_bitfields = 1; 618 } 619 else if (!strcmp (p, "-funsigned-bitfields") 620 || !strcmp (p, "-fno-signed-bitfields")) 621 { 622 flag_signed_bitfields = 0; 623 explicit_flag_signed_bitfields = 1; 624 } 625 else if (!strcmp (p, "-fshort-enums")) 626 flag_short_enums = 1; 627 else if (!strcmp (p, "-fno-short-enums")) 628 flag_short_enums = 0; 629 else if (!strcmp (p, "-fshort-wchar")) 630 flag_short_wchar = 1; 631 else if (!strcmp (p, "-fno-short-wchar")) 632 flag_short_wchar = 0; 633 else if (!strcmp (p, "-fcond-mismatch")) 634 flag_cond_mismatch = 1; 635 else if (!strcmp (p, "-fno-cond-mismatch")) 636 flag_cond_mismatch = 0; 637 else if (!strcmp (p, "-fshort-double")) 638 flag_short_double = 1; 639 else if (!strcmp (p, "-fno-short-double")) 640 flag_short_double = 0; 641 else if (!strcmp (p, "-fasm")) 642 flag_no_asm = 0; 643 else if (!strcmp (p, "-fno-asm")) 644 flag_no_asm = 1; 645 else if (!strcmp (p, "-fbuiltin")) 646 flag_no_builtin = 0; 647 else if (!strcmp (p, "-fno-builtin")) 648 flag_no_builtin = 1; 649 else if (!strncmp (p, "-fno-builtin-", strlen ("-fno-builtin-"))) 650 disable_builtin_function (p + strlen ("-fno-builtin-")); 651 else if (p[0] == '-' && p[1] == 'f' && dump_switch_p (p + 2)) 652 ; 653 else if (!strcmp (p, "-ansi")) 654 goto iso_1990; 655 else if (!strcmp (p, "-Werror-implicit-function-declaration")) 656 mesg_implicit_function_declaration = 2; 657 else if (!strcmp (p, "-Wimplicit-function-declaration")) 658 mesg_implicit_function_declaration = 1; 659 else if (!strcmp (p, "-Wno-implicit-function-declaration")) 660 mesg_implicit_function_declaration = 0; 661 else if (!strcmp (p, "-Wimplicit-int")) 662 warn_implicit_int = 1; 663 else if (!strcmp (p, "-Wno-implicit-int")) 664 warn_implicit_int = 0; 665 else if (!strcmp (p, "-Wimplicit")) 666 { 667 warn_implicit_int = 1; 668 if (mesg_implicit_function_declaration != 2) 669 mesg_implicit_function_declaration = 1; 670 } 671 else if (!strcmp (p, "-Wno-implicit")) 672 warn_implicit_int = 0, mesg_implicit_function_declaration = 0; 673 else if (!strcmp (p, "-Wlong-long")) 674 warn_long_long = 1; 675 else if (!strcmp (p, "-Wno-long-long")) 676 warn_long_long = 0; 677 else if (!strcmp (p, "-Wwrite-strings")) 678 flag_const_strings = 1; 679 else if (!strcmp (p, "-Wno-write-strings")) 680 flag_const_strings = 0; 681 else if (!strcmp (p, "-Wcast-qual")) 682 warn_cast_qual = 1; 683 else if (!strcmp (p, "-Wno-cast-qual")) 684 warn_cast_qual = 0; 685 else if (!strcmp (p, "-Wbad-function-cast")) 686 warn_bad_function_cast = 1; 687 else if (!strcmp (p, "-Wno-bad-function-cast")) 688 warn_bad_function_cast = 0; 689 else if (!strcmp (p, "-Wno-missing-noreturn")) 690 warn_missing_noreturn = 0; 691 else if (!strcmp (p, "-Wmissing-format-attribute")) 692 warn_missing_format_attribute = 1; 693 else if (!strcmp (p, "-Wno-missing-format-attribute")) 694 warn_missing_format_attribute = 0; 695 else if (!strcmp (p, "-Wpointer-arith")) 696 warn_pointer_arith = 1; 697 else if (!strcmp (p, "-Wno-pointer-arith")) 698 warn_pointer_arith = 0; 699 else if (!strcmp (p, "-Wstrict-prototypes")) 700 warn_strict_prototypes = 1; 701 else if (!strcmp (p, "-Wno-strict-prototypes")) 702 warn_strict_prototypes = 0; 703 else if (!strcmp (p, "-Wmissing-prototypes")) 704 warn_missing_prototypes = 1; 705 else if (!strcmp (p, "-Wno-missing-prototypes")) 706 warn_missing_prototypes = 0; 707 else if (!strcmp (p, "-Wmissing-declarations")) 708 warn_missing_declarations = 1; 709 else if (!strcmp (p, "-Wno-missing-declarations")) 710 warn_missing_declarations = 0; 711 else if (!strcmp (p, "-Wredundant-decls")) 712 warn_redundant_decls = 1; 713 else if (!strcmp (p, "-Wno-redundant-decls")) 714 warn_redundant_decls = 0; 715 else if (!strcmp (p, "-Wnested-externs")) 716 warn_nested_externs = 1; 717 else if (!strcmp (p, "-Wno-nested-externs")) 718 warn_nested_externs = 0; 719 else if (!strcmp (p, "-Wtraditional")) 720 warn_traditional = 1; 721 else if (!strcmp (p, "-Wno-traditional")) 722 warn_traditional = 0; 723 else if (!strncmp (p, "-Wformat=", 9)) 724 set_Wformat (atoi (p + 9)); 725 else if (!strcmp (p, "-Wformat")) 726 set_Wformat (1); 727 else if (!strcmp (p, "-Wno-format")) 728 set_Wformat (0); 729 else if (!strcmp (p, "-Wformat-y2k")) 730 warn_format_y2k = 1; 731 else if (!strcmp (p, "-Wno-format-y2k")) 732 warn_format_y2k = 0; 733 else if (!strcmp (p, "-Wformat-extra-args")) 734 warn_format_extra_args = 1; 735 else if (!strcmp (p, "-Wno-format-extra-args")) 736 warn_format_extra_args = 0; 737 else if (!strcmp (p, "-Wformat-nonliteral")) 738 warn_format_nonliteral = 1; 739 else if (!strcmp (p, "-Wno-format-nonliteral")) 740 warn_format_nonliteral = 0; 741 else if (!strcmp (p, "-Wformat-security")) 742 warn_format_security = 1; 743 else if (!strcmp (p, "-Wno-format-security")) 744 warn_format_security = 0; 745 else if (!strcmp (p, "-Wchar-subscripts")) 746 warn_char_subscripts = 1; 747 else if (!strcmp (p, "-Wno-char-subscripts")) 748 warn_char_subscripts = 0; 749 else if (!strcmp (p, "-Wconversion")) 750 warn_conversion = 1; 751 else if (!strcmp (p, "-Wno-conversion")) 752 warn_conversion = 0; 753 else if (!strcmp (p, "-Wparentheses")) 754 warn_parentheses = 1; 755 else if (!strcmp (p, "-Wno-parentheses")) 756 warn_parentheses = 0; 757 else if (!strcmp (p, "-Wreturn-type")) 758 warn_return_type = 1; 759 else if (!strcmp (p, "-Wno-return-type")) 760 warn_return_type = 0; 761 else if (!strcmp (p, "-Wsequence-point")) 762 warn_sequence_point = 1; 763 else if (!strcmp (p, "-Wno-sequence-point")) 764 warn_sequence_point = 0; 765 else if (!strcmp (p, "-Wcomment")) 766 ; /* cpp handles this one. */ 767 else if (!strcmp (p, "-Wno-comment")) 768 ; /* cpp handles this one. */ 769 else if (!strcmp (p, "-Wcomments")) 770 ; /* cpp handles this one. */ 771 else if (!strcmp (p, "-Wno-comments")) 772 ; /* cpp handles this one. */ 773 else if (!strcmp (p, "-Wtrigraphs")) 774 ; /* cpp handles this one. */ 775 else if (!strcmp (p, "-Wno-trigraphs")) 776 ; /* cpp handles this one. */ 777 else if (!strcmp (p, "-Wundef")) 778 ; /* cpp handles this one. */ 779 else if (!strcmp (p, "-Wno-undef")) 780 ; /* cpp handles this one. */ 781 else if (!strcmp (p, "-Wimport")) 782 ; /* cpp handles this one. */ 783 else if (!strcmp (p, "-Wno-import")) 784 ; /* cpp handles this one. */ 785 else if (!strcmp (p, "-Wmissing-braces")) 786 warn_missing_braces = 1; 787 else if (!strcmp (p, "-Wno-missing-braces")) 788 warn_missing_braces = 0; 789 else if (!strcmp (p, "-Wmain")) 790 warn_main = 1; 791 else if (!strcmp (p, "-Wno-main")) 792 warn_main = -1; 793 else if (!strcmp (p, "-Wsign-compare")) 794 warn_sign_compare = 1; 795 else if (!strcmp (p, "-Wno-sign-compare")) 796 warn_sign_compare = 0; 797 else if (!strcmp (p, "-Wfloat-equal")) 798 warn_float_equal = 1; 799 else if (!strcmp (p, "-Wno-float-equal")) 800 warn_float_equal = 0; 801 else if (!strcmp (p, "-Wmultichar")) 802 warn_multichar = 1; 803 else if (!strcmp (p, "-Wno-multichar")) 804 warn_multichar = 0; 805 else if (!strcmp (p, "-Wdiv-by-zero")) 806 warn_div_by_zero = 1; 807 else if (!strcmp (p, "-Wno-div-by-zero")) 808 warn_div_by_zero = 0; 809 else if (!strcmp (p, "-Wunknown-pragmas")) 810 /* Set to greater than 1, so that even unknown pragmas in system 811 headers will be warned about. */ 812 warn_unknown_pragmas = 2; 813 else if (!strcmp (p, "-Wno-unknown-pragmas")) 814 warn_unknown_pragmas = 0; 815 else if (!strcmp (p, "-Wall")) 816 { 817 /* We save the value of warn_uninitialized, since if they put 818 -Wuninitialized on the command line, we need to generate a 819 warning about not using it without also specifying -O. */ 820 if (warn_uninitialized != 1) 821 warn_uninitialized = 2; 822 warn_implicit_int = 1; 823 mesg_implicit_function_declaration = 1; 824 warn_return_type = 1; 825 set_Wunused (1); 826 warn_switch = 1; 827 set_Wformat (1); 828 warn_char_subscripts = 1; 829 warn_parentheses = 1; 830 warn_sequence_point = 1; 831 warn_missing_braces = 1; 832 /* We set this to 2 here, but 1 in -Wmain, so -ffreestanding can turn 833 it off only if it's not explicit. */ 834 warn_main = 2; 835 /* Only warn about unknown pragmas that are not in system headers. */ 836 warn_unknown_pragmas = 1; 837 } 838 else 839 return strings_processed; 840 841 return 1; 842} 843 844void 845c_print_identifier (file, node, indent) 846 FILE *file; 847 tree node; 848 int indent; 849{ 850 print_node (file, "global", IDENTIFIER_GLOBAL_VALUE (node), indent + 4); 851 print_node (file, "local", IDENTIFIER_LOCAL_VALUE (node), indent + 4); 852 print_node (file, "label", IDENTIFIER_LABEL_VALUE (node), indent + 4); 853 print_node (file, "implicit", IDENTIFIER_IMPLICIT_DECL (node), indent + 4); 854 print_node (file, "error locus", IDENTIFIER_ERROR_LOCUS (node), indent + 4); 855 print_node (file, "limbo value", IDENTIFIER_LIMBO_VALUE (node), indent + 4); 856 if (C_IS_RESERVED_WORD (node)) 857 { 858 tree rid = ridpointers[C_RID_CODE (node)]; 859 indent_to (file, indent + 4); 860 fprintf (file, "rid "); 861 fprintf (file, HOST_PTR_PRINTF, (void *)rid); 862 fprintf (file, " \"%s\"", IDENTIFIER_POINTER (rid)); 863 } 864} 865 866/* Hook called at end of compilation to assume 1 elt 867 for a top-level tentative array defn that wasn't complete before. */ 868 869void 870finish_incomplete_decl (decl) 871 tree decl; 872{ 873 if (TREE_CODE (decl) == VAR_DECL) 874 { 875 tree type = TREE_TYPE (decl); 876 if (type != error_mark_node 877 && TREE_CODE (type) == ARRAY_TYPE 878 && ! DECL_EXTERNAL (decl) 879 && TYPE_DOMAIN (type) == 0) 880 { 881 warning_with_decl (decl, "array `%s' assumed to have one element"); 882 883 complete_array_type (type, NULL_TREE, 1); 884 885 layout_decl (decl, 0); 886 } 887 } 888} 889 890/* Create a new `struct binding_level'. */ 891 892static struct binding_level * 893make_binding_level () 894{ 895 /* NOSTRICT */ 896 return (struct binding_level *) xmalloc (sizeof (struct binding_level)); 897} 898 899/* Nonzero if we are currently in the global binding level. */ 900 901int 902global_bindings_p () 903{ 904 return current_binding_level == global_binding_level; 905} 906 907void 908keep_next_level () 909{ 910 keep_next_level_flag = 1; 911} 912 913/* Nonzero if the current level needs to have a BLOCK made. */ 914 915int 916kept_level_p () 917{ 918 return ((current_binding_level->keep_if_subblocks 919 && current_binding_level->blocks != 0) 920 || current_binding_level->keep 921 || current_binding_level->names != 0 922 || (current_binding_level->tags != 0 923 && !current_binding_level->tag_transparent)); 924} 925 926/* Identify this binding level as a level of parameters. 927 DEFINITION_FLAG is 1 for a definition, 0 for a declaration. 928 But it turns out there is no way to pass the right value for 929 DEFINITION_FLAG, so we ignore it. */ 930 931void 932declare_parm_level (definition_flag) 933 int definition_flag ATTRIBUTE_UNUSED; 934{ 935 current_binding_level->parm_flag = 1; 936} 937 938/* Nonzero if currently making parm declarations. */ 939 940int 941in_parm_level_p () 942{ 943 return current_binding_level->parm_flag; 944} 945 946/* Enter a new binding level. 947 If TAG_TRANSPARENT is nonzero, do so only for the name space of variables, 948 not for that of tags. */ 949 950void 951pushlevel (tag_transparent) 952 int tag_transparent; 953{ 954 struct binding_level *newlevel = NULL_BINDING_LEVEL; 955 956 /* If this is the top level of a function, 957 just make sure that NAMED_LABELS is 0. */ 958 959 if (current_binding_level == global_binding_level) 960 { 961 named_labels = 0; 962 } 963 964 /* Reuse or create a struct for this binding level. */ 965 966 if (free_binding_level) 967 { 968 newlevel = free_binding_level; 969 free_binding_level = free_binding_level->level_chain; 970 } 971 else 972 { 973 newlevel = make_binding_level (); 974 } 975 976 /* Add this level to the front of the chain (stack) of levels that 977 are active. */ 978 979 *newlevel = clear_binding_level; 980 newlevel->tag_transparent 981 = (tag_transparent 982 || (current_binding_level 983 ? current_binding_level->subblocks_tag_transparent 984 : 0)); 985 newlevel->level_chain = current_binding_level; 986 current_binding_level = newlevel; 987 newlevel->keep = keep_next_level_flag; 988 keep_next_level_flag = 0; 989 newlevel->keep_if_subblocks = keep_next_if_subblocks; 990 keep_next_if_subblocks = 0; 991} 992 993/* Clear the limbo values of all identifiers defined in BLOCK or a subblock. */ 994 995static void 996clear_limbo_values (block) 997 tree block; 998{ 999 tree tem; 1000 1001 for (tem = BLOCK_VARS (block); tem; tem = TREE_CHAIN (tem)) 1002 if (DECL_NAME (tem) != 0) 1003 IDENTIFIER_LIMBO_VALUE (DECL_NAME (tem)) = 0; 1004 1005 for (tem = BLOCK_SUBBLOCKS (block); tem; tem = TREE_CHAIN (tem)) 1006 clear_limbo_values (tem); 1007} 1008 1009/* Exit a binding level. 1010 Pop the level off, and restore the state of the identifier-decl mappings 1011 that were in effect when this level was entered. 1012 1013 If KEEP is nonzero, this level had explicit declarations, so 1014 and create a "block" (a BLOCK node) for the level 1015 to record its declarations and subblocks for symbol table output. 1016 1017 If FUNCTIONBODY is nonzero, this level is the body of a function, 1018 so create a block as if KEEP were set and also clear out all 1019 label names. 1020 1021 If REVERSE is nonzero, reverse the order of decls before putting 1022 them into the BLOCK. */ 1023 1024tree 1025poplevel (keep, reverse, functionbody) 1026 int keep; 1027 int reverse; 1028 int functionbody; 1029{ 1030 tree link; 1031 /* The chain of decls was accumulated in reverse order. 1032 Put it into forward order, just for cleanliness. */ 1033 tree decls; 1034 tree tags = current_binding_level->tags; 1035 tree subblocks = current_binding_level->blocks; 1036 tree block = 0; 1037 tree decl; 1038 int block_previously_created; 1039 1040 keep |= current_binding_level->keep; 1041 1042 /* This warning is turned off because it causes warnings for 1043 declarations like `extern struct foo *x'. */ 1044#if 0 1045 /* Warn about incomplete structure types in this level. */ 1046 for (link = tags; link; link = TREE_CHAIN (link)) 1047 if (!COMPLETE_TYPE_P (TREE_VALUE (link))) 1048 { 1049 tree type = TREE_VALUE (link); 1050 tree type_name = TYPE_NAME (type); 1051 char *id = IDENTIFIER_POINTER (TREE_CODE (type_name) == IDENTIFIER_NODE 1052 ? type_name 1053 : DECL_NAME (type_name)); 1054 switch (TREE_CODE (type)) 1055 { 1056 case RECORD_TYPE: 1057 error ("`struct %s' incomplete in scope ending here", id); 1058 break; 1059 case UNION_TYPE: 1060 error ("`union %s' incomplete in scope ending here", id); 1061 break; 1062 case ENUMERAL_TYPE: 1063 error ("`enum %s' incomplete in scope ending here", id); 1064 break; 1065 } 1066 } 1067#endif /* 0 */ 1068 1069 /* Get the decls in the order they were written. 1070 Usually current_binding_level->names is in reverse order. 1071 But parameter decls were previously put in forward order. */ 1072 1073 if (reverse) 1074 current_binding_level->names 1075 = decls = nreverse (current_binding_level->names); 1076 else 1077 decls = current_binding_level->names; 1078 1079 /* Output any nested inline functions within this block 1080 if they weren't already output. */ 1081 1082 for (decl = decls; decl; decl = TREE_CHAIN (decl)) 1083 if (TREE_CODE (decl) == FUNCTION_DECL 1084 && ! TREE_ASM_WRITTEN (decl) 1085 && DECL_INITIAL (decl) != 0 1086 && TREE_ADDRESSABLE (decl)) 1087 { 1088 /* If this decl was copied from a file-scope decl 1089 on account of a block-scope extern decl, 1090 propagate TREE_ADDRESSABLE to the file-scope decl. 1091 1092 DECL_ABSTRACT_ORIGIN can be set to itself if warn_return_type is 1093 true, since then the decl goes through save_for_inline_copying. */ 1094 if (DECL_ABSTRACT_ORIGIN (decl) != 0 1095 && DECL_ABSTRACT_ORIGIN (decl) != decl) 1096 TREE_ADDRESSABLE (DECL_ABSTRACT_ORIGIN (decl)) = 1; 1097 } 1098 1099 /* We used to warn about unused variables in expand_end_bindings, 1100 i.e. while generating RTL. But in function-at-a-time mode we may 1101 choose to never expand a function at all (e.g. auto inlining), so 1102 we do this explicitly now. */ 1103 warn_about_unused_variables (getdecls ()); 1104 1105 /* If there were any declarations or structure tags in that level, 1106 or if this level is a function body, 1107 create a BLOCK to record them for the life of this function. */ 1108 1109 block = 0; 1110 block_previously_created = (current_binding_level->this_block != 0); 1111 if (block_previously_created) 1112 block = current_binding_level->this_block; 1113 else if (keep || functionbody 1114 || (current_binding_level->keep_if_subblocks && subblocks != 0)) 1115 block = make_node (BLOCK); 1116 if (block != 0) 1117 { 1118 BLOCK_VARS (block) = decls; 1119 BLOCK_SUBBLOCKS (block) = subblocks; 1120 } 1121 1122 /* In each subblock, record that this is its superior. */ 1123 1124 for (link = subblocks; link; link = TREE_CHAIN (link)) 1125 BLOCK_SUPERCONTEXT (link) = block; 1126 1127 /* Clear out the meanings of the local variables of this level. */ 1128 1129 for (link = decls; link; link = TREE_CHAIN (link)) 1130 { 1131 if (DECL_NAME (link) != 0) 1132 { 1133 /* If the ident. was used or addressed via a local extern decl, 1134 don't forget that fact. */ 1135 if (DECL_EXTERNAL (link)) 1136 { 1137 if (TREE_USED (link)) 1138 TREE_USED (DECL_NAME (link)) = 1; 1139 if (TREE_ADDRESSABLE (link)) 1140 TREE_ADDRESSABLE (DECL_ASSEMBLER_NAME (link)) = 1; 1141 } 1142 IDENTIFIER_LOCAL_VALUE (DECL_NAME (link)) = 0; 1143 } 1144 } 1145 1146 /* Restore all name-meanings of the outer levels 1147 that were shadowed by this level. */ 1148 1149 for (link = current_binding_level->shadowed; link; link = TREE_CHAIN (link)) 1150 IDENTIFIER_LOCAL_VALUE (TREE_PURPOSE (link)) = TREE_VALUE (link); 1151 1152 /* If the level being exited is the top level of a function, 1153 check over all the labels, and clear out the current 1154 (function local) meanings of their names. */ 1155 1156 if (functionbody) 1157 { 1158 clear_limbo_values (block); 1159 1160 /* If this is the top level block of a function, 1161 the vars are the function's parameters. 1162 Don't leave them in the BLOCK because they are 1163 found in the FUNCTION_DECL instead. */ 1164 1165 BLOCK_VARS (block) = 0; 1166 1167 /* Clear out the definitions of all label names, 1168 since their scopes end here, 1169 and add them to BLOCK_VARS. */ 1170 1171 for (link = named_labels; link; link = TREE_CHAIN (link)) 1172 { 1173 tree label = TREE_VALUE (link); 1174 1175 if (DECL_INITIAL (label) == 0) 1176 { 1177 error_with_decl (label, "label `%s' used but not defined"); 1178 /* Avoid crashing later. */ 1179 define_label (input_filename, lineno, 1180 DECL_NAME (label)); 1181 } 1182 else if (warn_unused_label && !TREE_USED (label)) 1183 warning_with_decl (label, "label `%s' defined but not used"); 1184 IDENTIFIER_LABEL_VALUE (DECL_NAME (label)) = 0; 1185 1186 /* Put the labels into the "variables" of the 1187 top-level block, so debugger can see them. */ 1188 TREE_CHAIN (label) = BLOCK_VARS (block); 1189 BLOCK_VARS (block) = label; 1190 } 1191 } 1192 1193 /* Pop the current level, and free the structure for reuse. */ 1194 1195 { 1196 struct binding_level *level = current_binding_level; 1197 current_binding_level = current_binding_level->level_chain; 1198 1199 level->level_chain = free_binding_level; 1200 free_binding_level = level; 1201 } 1202 1203 /* Dispose of the block that we just made inside some higher level. */ 1204 if (functionbody) 1205 DECL_INITIAL (current_function_decl) = block; 1206 else if (block) 1207 { 1208 if (!block_previously_created) 1209 current_binding_level->blocks 1210 = chainon (current_binding_level->blocks, block); 1211 } 1212 /* If we did not make a block for the level just exited, 1213 any blocks made for inner levels 1214 (since they cannot be recorded as subblocks in that level) 1215 must be carried forward so they will later become subblocks 1216 of something else. */ 1217 else if (subblocks) 1218 current_binding_level->blocks 1219 = chainon (current_binding_level->blocks, subblocks); 1220 1221 /* Set the TYPE_CONTEXTs for all of the tagged types belonging to this 1222 binding contour so that they point to the appropriate construct, i.e. 1223 either to the current FUNCTION_DECL node, or else to the BLOCK node 1224 we just constructed. 1225 1226 Note that for tagged types whose scope is just the formal parameter 1227 list for some function type specification, we can't properly set 1228 their TYPE_CONTEXTs here, because we don't have a pointer to the 1229 appropriate FUNCTION_TYPE node readily available to us. For those 1230 cases, the TYPE_CONTEXTs of the relevant tagged type nodes get set 1231 in `grokdeclarator' as soon as we have created the FUNCTION_TYPE 1232 node which will represent the "scope" for these "parameter list local" 1233 tagged types. */ 1234 1235 if (functionbody) 1236 for (link = tags; link; link = TREE_CHAIN (link)) 1237 TYPE_CONTEXT (TREE_VALUE (link)) = current_function_decl; 1238 else if (block) 1239 for (link = tags; link; link = TREE_CHAIN (link)) 1240 TYPE_CONTEXT (TREE_VALUE (link)) = block; 1241 1242 if (block) 1243 TREE_USED (block) = 1; 1244 1245 return block; 1246} 1247 1248/* Insert BLOCK at the end of the list of subblocks of the 1249 current binding level. This is used when a BIND_EXPR is expanded, 1250 to handle the BLOCK node inside the BIND_EXPR. */ 1251 1252void 1253insert_block (block) 1254 tree block; 1255{ 1256 TREE_USED (block) = 1; 1257 current_binding_level->blocks 1258 = chainon (current_binding_level->blocks, block); 1259} 1260 1261/* Set the BLOCK node for the innermost scope 1262 (the one we are currently in). */ 1263 1264void 1265set_block (block) 1266 tree block; 1267{ 1268 current_binding_level->this_block = block; 1269 current_binding_level->names = chainon (current_binding_level->names, 1270 BLOCK_VARS (block)); 1271 current_binding_level->blocks = chainon (current_binding_level->blocks, 1272 BLOCK_SUBBLOCKS (block)); 1273} 1274 1275void 1276push_label_level () 1277{ 1278 struct binding_level *newlevel; 1279 1280 /* Reuse or create a struct for this binding level. */ 1281 1282 if (free_binding_level) 1283 { 1284 newlevel = free_binding_level; 1285 free_binding_level = free_binding_level->level_chain; 1286 } 1287 else 1288 { 1289 newlevel = make_binding_level (); 1290 } 1291 1292 /* Add this level to the front of the chain (stack) of label levels. */ 1293 1294 newlevel->level_chain = label_level_chain; 1295 label_level_chain = newlevel; 1296 1297 newlevel->names = named_labels; 1298 newlevel->shadowed = shadowed_labels; 1299 named_labels = 0; 1300 shadowed_labels = 0; 1301} 1302 1303void 1304pop_label_level () 1305{ 1306 struct binding_level *level = label_level_chain; 1307 tree link, prev; 1308 1309 /* Clear out the definitions of the declared labels in this level. 1310 Leave in the list any ordinary, non-declared labels. */ 1311 for (link = named_labels, prev = 0; link;) 1312 { 1313 if (C_DECLARED_LABEL_FLAG (TREE_VALUE (link))) 1314 { 1315 if (DECL_SOURCE_LINE (TREE_VALUE (link)) == 0) 1316 { 1317 error_with_decl (TREE_VALUE (link), 1318 "label `%s' used but not defined"); 1319 /* Avoid crashing later. */ 1320 define_label (input_filename, lineno, 1321 DECL_NAME (TREE_VALUE (link))); 1322 } 1323 else if (warn_unused_label && !TREE_USED (TREE_VALUE (link))) 1324 warning_with_decl (TREE_VALUE (link), 1325 "label `%s' defined but not used"); 1326 IDENTIFIER_LABEL_VALUE (DECL_NAME (TREE_VALUE (link))) = 0; 1327 1328 /* Delete this element from the list. */ 1329 link = TREE_CHAIN (link); 1330 if (prev) 1331 TREE_CHAIN (prev) = link; 1332 else 1333 named_labels = link; 1334 } 1335 else 1336 { 1337 prev = link; 1338 link = TREE_CHAIN (link); 1339 } 1340 } 1341 1342 /* Bring back all the labels that were shadowed. */ 1343 for (link = shadowed_labels; link; link = TREE_CHAIN (link)) 1344 if (DECL_NAME (TREE_VALUE (link)) != 0) 1345 IDENTIFIER_LABEL_VALUE (DECL_NAME (TREE_VALUE (link))) 1346 = TREE_VALUE (link); 1347 1348 named_labels = chainon (named_labels, level->names); 1349 shadowed_labels = level->shadowed; 1350 1351 /* Pop the current level, and free the structure for reuse. */ 1352 label_level_chain = label_level_chain->level_chain; 1353 level->level_chain = free_binding_level; 1354 free_binding_level = level; 1355} 1356 1357/* Push a definition or a declaration of struct, union or enum tag "name". 1358 "type" should be the type node. 1359 We assume that the tag "name" is not already defined. 1360 1361 Note that the definition may really be just a forward reference. 1362 In that case, the TYPE_SIZE will be zero. */ 1363 1364void 1365pushtag (name, type) 1366 tree name, type; 1367{ 1368 struct binding_level *b; 1369 1370 /* Find the proper binding level for this type tag. */ 1371 1372 for (b = current_binding_level; b->tag_transparent; b = b->level_chain) 1373 continue; 1374 1375 if (name) 1376 { 1377 /* Record the identifier as the type's name if it has none. */ 1378 1379 if (TYPE_NAME (type) == 0) 1380 TYPE_NAME (type) = name; 1381 } 1382 1383 b->tags = tree_cons (name, type, b->tags); 1384 1385 /* Create a fake NULL-named TYPE_DECL node whose TREE_TYPE will be the 1386 tagged type we just added to the current binding level. This fake 1387 NULL-named TYPE_DECL node helps dwarfout.c to know when it needs 1388 to output a representation of a tagged type, and it also gives 1389 us a convenient place to record the "scope start" address for the 1390 tagged type. */ 1391 1392 TYPE_STUB_DECL (type) = pushdecl (build_decl (TYPE_DECL, NULL_TREE, type)); 1393 1394 /* An approximation for now, so we can tell this is a function-scope tag. 1395 This will be updated in poplevel. */ 1396 TYPE_CONTEXT (type) = DECL_CONTEXT (TYPE_STUB_DECL (type)); 1397} 1398 1399/* Handle when a new declaration NEWDECL 1400 has the same name as an old one OLDDECL 1401 in the same binding contour. 1402 Prints an error message if appropriate. 1403 1404 If safely possible, alter OLDDECL to look like NEWDECL, and return 1. 1405 Otherwise, return 0. 1406 1407 When DIFFERENT_BINDING_LEVEL is true, NEWDECL is an external declaration, 1408 and OLDDECL is in an outer binding level and should thus not be changed. */ 1409 1410static int 1411duplicate_decls (newdecl, olddecl, different_binding_level) 1412 tree newdecl, olddecl; 1413 int different_binding_level; 1414{ 1415 int types_match = comptypes (TREE_TYPE (newdecl), TREE_TYPE (olddecl)); 1416 int new_is_definition = (TREE_CODE (newdecl) == FUNCTION_DECL 1417 && DECL_INITIAL (newdecl) != 0); 1418 tree oldtype = TREE_TYPE (olddecl); 1419 tree newtype = TREE_TYPE (newdecl); 1420 int errmsg = 0; 1421 1422 if (DECL_P (olddecl)) 1423 { 1424 if (TREE_CODE (newdecl) == FUNCTION_DECL 1425 && TREE_CODE (olddecl) == FUNCTION_DECL 1426 && (DECL_UNINLINABLE (newdecl) || DECL_UNINLINABLE (olddecl))) 1427 { 1428 if (DECL_DECLARED_INLINE_P (newdecl) 1429 && DECL_UNINLINABLE (newdecl) 1430 && lookup_attribute ("noinline", DECL_ATTRIBUTES (newdecl))) 1431 /* Already warned elsewhere. */; 1432 else if (DECL_DECLARED_INLINE_P (olddecl) 1433 && DECL_UNINLINABLE (olddecl) 1434 && lookup_attribute ("noinline", DECL_ATTRIBUTES (olddecl))) 1435 /* Already warned. */; 1436 else if (DECL_DECLARED_INLINE_P (newdecl) 1437 && ! DECL_DECLARED_INLINE_P (olddecl) 1438 && DECL_UNINLINABLE (olddecl) 1439 && lookup_attribute ("noinline", DECL_ATTRIBUTES (olddecl))) 1440 { 1441 warning_with_decl (newdecl, 1442 "function `%s' redeclared as inline"); 1443 warning_with_decl (olddecl, 1444 "previous declaration of function `%s' with attribute noinline"); 1445 } 1446 else if (DECL_DECLARED_INLINE_P (olddecl) 1447 && DECL_UNINLINABLE (newdecl) 1448 && lookup_attribute ("noinline", DECL_ATTRIBUTES (newdecl))) 1449 { 1450 warning_with_decl (newdecl, 1451 "function `%s' redeclared with attribute noinline"); 1452 warning_with_decl (olddecl, 1453 "previous declaration of function `%s' was inline"); 1454 } 1455 } 1456 1457 DECL_ATTRIBUTES (newdecl) 1458 = (*targetm.merge_decl_attributes) (olddecl, newdecl); 1459 } 1460 1461 if (TREE_CODE (newtype) == ERROR_MARK 1462 || TREE_CODE (oldtype) == ERROR_MARK) 1463 types_match = 0; 1464 1465 /* New decl is completely inconsistent with the old one => 1466 tell caller to replace the old one. 1467 This is always an error except in the case of shadowing a builtin. */ 1468 if (TREE_CODE (olddecl) != TREE_CODE (newdecl)) 1469 { 1470 if (TREE_CODE (olddecl) == FUNCTION_DECL 1471 && (DECL_BUILT_IN (olddecl) 1472 || DECL_BUILT_IN_NONANSI (olddecl))) 1473 { 1474 /* If you declare a built-in or predefined function name as static, 1475 the old definition is overridden, 1476 but optionally warn this was a bad choice of name. */ 1477 if (!TREE_PUBLIC (newdecl)) 1478 { 1479 if (!warn_shadow) 1480 ; 1481 else if (DECL_BUILT_IN (olddecl)) 1482 warning_with_decl (newdecl, "shadowing built-in function `%s'"); 1483 else 1484 warning_with_decl (newdecl, "shadowing library function `%s'"); 1485 } 1486 /* Likewise, if the built-in is not ansi, then programs can 1487 override it even globally without an error. */ 1488 else if (! DECL_BUILT_IN (olddecl)) 1489 warning_with_decl (newdecl, 1490 "library function `%s' declared as non-function"); 1491 1492 else if (DECL_BUILT_IN_NONANSI (olddecl)) 1493 warning_with_decl (newdecl, 1494 "built-in function `%s' declared as non-function"); 1495 else 1496 warning_with_decl (newdecl, 1497 "built-in function `%s' declared as non-function"); 1498 } 1499 else 1500 { 1501 error_with_decl (newdecl, "`%s' redeclared as different kind of symbol"); 1502 error_with_decl (olddecl, "previous declaration of `%s'"); 1503 } 1504 1505 return 0; 1506 } 1507 1508 /* For real parm decl following a forward decl, 1509 return 1 so old decl will be reused. */ 1510 if (types_match && TREE_CODE (newdecl) == PARM_DECL 1511 && TREE_ASM_WRITTEN (olddecl) && ! TREE_ASM_WRITTEN (newdecl)) 1512 return 1; 1513 1514 /* The new declaration is the same kind of object as the old one. 1515 The declarations may partially match. Print warnings if they don't 1516 match enough. Ultimately, copy most of the information from the new 1517 decl to the old one, and keep using the old one. */ 1518 1519 if (flag_traditional && TREE_CODE (newdecl) == FUNCTION_DECL 1520 && IDENTIFIER_IMPLICIT_DECL (DECL_NAME (newdecl)) == olddecl 1521 && DECL_INITIAL (olddecl) == 0) 1522 /* If -traditional, avoid error for redeclaring fcn 1523 after implicit decl. */ 1524 ; 1525 else if (TREE_CODE (olddecl) == FUNCTION_DECL 1526 && DECL_BUILT_IN (olddecl)) 1527 { 1528 /* A function declaration for a built-in function. */ 1529 if (!TREE_PUBLIC (newdecl)) 1530 { 1531 /* If you declare a built-in function name as static, the 1532 built-in definition is overridden, 1533 but optionally warn this was a bad choice of name. */ 1534 if (warn_shadow) 1535 warning_with_decl (newdecl, "shadowing built-in function `%s'"); 1536 /* Discard the old built-in function. */ 1537 return 0; 1538 } 1539 else if (!types_match) 1540 { 1541 /* Accept the return type of the new declaration if same modes. */ 1542 tree oldreturntype = TREE_TYPE (oldtype); 1543 tree newreturntype = TREE_TYPE (newtype); 1544 1545 if (TYPE_MODE (oldreturntype) == TYPE_MODE (newreturntype)) 1546 { 1547 /* Function types may be shared, so we can't just modify 1548 the return type of olddecl's function type. */ 1549 tree trytype 1550 = build_function_type (newreturntype, 1551 TYPE_ARG_TYPES (oldtype)); 1552 trytype = build_type_attribute_variant (trytype, 1553 TYPE_ATTRIBUTES (oldtype)); 1554 1555 types_match = comptypes (newtype, trytype); 1556 if (types_match) 1557 oldtype = trytype; 1558 } 1559 /* Accept harmless mismatch in first argument type also. 1560 This is for the ffs and fprintf builtins. */ 1561 if (TYPE_ARG_TYPES (TREE_TYPE (newdecl)) != 0 1562 && TYPE_ARG_TYPES (oldtype) != 0 1563 && TREE_VALUE (TYPE_ARG_TYPES (newtype)) != 0 1564 && TREE_VALUE (TYPE_ARG_TYPES (oldtype)) != 0 1565 && (TYPE_MODE (TREE_VALUE (TYPE_ARG_TYPES (newtype))) 1566 == TYPE_MODE (TREE_VALUE (TYPE_ARG_TYPES (oldtype))))) 1567 { 1568 /* Function types may be shared, so we can't just modify 1569 the return type of olddecl's function type. */ 1570 tree trytype 1571 = build_function_type (TREE_TYPE (oldtype), 1572 tree_cons (NULL_TREE, 1573 TREE_VALUE (TYPE_ARG_TYPES (newtype)), 1574 TREE_CHAIN (TYPE_ARG_TYPES (oldtype)))); 1575 trytype = build_type_attribute_variant (trytype, 1576 TYPE_ATTRIBUTES (oldtype)); 1577 1578 types_match = comptypes (newtype, trytype); 1579 if (types_match) 1580 oldtype = trytype; 1581 } 1582 if (! different_binding_level) 1583 TREE_TYPE (olddecl) = oldtype; 1584 } 1585 else if (TYPE_ARG_TYPES (oldtype) == NULL 1586 && TYPE_ARG_TYPES (newtype) != NULL) 1587 { 1588 /* For bcmp, bzero, fputs the builtin type has arguments not 1589 specified. Use the ones from the prototype so that type checking 1590 is done for them. */ 1591 tree trytype 1592 = build_function_type (TREE_TYPE (oldtype), 1593 TYPE_ARG_TYPES (newtype)); 1594 trytype = build_type_attribute_variant (trytype, 1595 TYPE_ATTRIBUTES (oldtype)); 1596 1597 oldtype = trytype; 1598 if (! different_binding_level) 1599 TREE_TYPE (olddecl) = oldtype; 1600 } 1601 if (!types_match) 1602 { 1603 /* If types don't match for a built-in, throw away the built-in. */ 1604 warning_with_decl (newdecl, "conflicting types for built-in function `%s'"); 1605 return 0; 1606 } 1607 } 1608 else if (TREE_CODE (olddecl) == FUNCTION_DECL 1609 && DECL_SOURCE_LINE (olddecl) == 0) 1610 { 1611 /* A function declaration for a predeclared function 1612 that isn't actually built in. */ 1613 if (!TREE_PUBLIC (newdecl)) 1614 { 1615 /* If you declare it as static, the 1616 default definition is overridden. */ 1617 return 0; 1618 } 1619 else if (!types_match) 1620 { 1621 /* If the types don't match, preserve volatility indication. 1622 Later on, we will discard everything else about the 1623 default declaration. */ 1624 TREE_THIS_VOLATILE (newdecl) |= TREE_THIS_VOLATILE (olddecl); 1625 } 1626 } 1627 /* Permit char *foo () to match void *foo (...) if not pedantic, 1628 if one of them came from a system header file. */ 1629 else if (!types_match 1630 && TREE_CODE (olddecl) == FUNCTION_DECL 1631 && TREE_CODE (newdecl) == FUNCTION_DECL 1632 && TREE_CODE (TREE_TYPE (oldtype)) == POINTER_TYPE 1633 && TREE_CODE (TREE_TYPE (newtype)) == POINTER_TYPE 1634 && (DECL_IN_SYSTEM_HEADER (olddecl) 1635 || DECL_IN_SYSTEM_HEADER (newdecl)) 1636 && ((TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (newtype))) == void_type_node 1637 && TYPE_ARG_TYPES (oldtype) == 0 1638 && self_promoting_args_p (TYPE_ARG_TYPES (newtype)) 1639 && TREE_TYPE (TREE_TYPE (oldtype)) == char_type_node) 1640 || 1641 (TREE_TYPE (TREE_TYPE (newtype)) == char_type_node 1642 && TYPE_ARG_TYPES (newtype) == 0 1643 && self_promoting_args_p (TYPE_ARG_TYPES (oldtype)) 1644 && TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (oldtype))) == void_type_node))) 1645 { 1646 if (pedantic) 1647 pedwarn_with_decl (newdecl, "conflicting types for `%s'"); 1648 /* Make sure we keep void * as ret type, not char *. */ 1649 if (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (oldtype))) == void_type_node) 1650 TREE_TYPE (newdecl) = newtype = oldtype; 1651 1652 /* Set DECL_IN_SYSTEM_HEADER, so that if we see another declaration 1653 we will come back here again. */ 1654 DECL_IN_SYSTEM_HEADER (newdecl) = 1; 1655 } 1656 else if (!types_match 1657 /* Permit char *foo (int, ...); followed by char *foo (); 1658 if not pedantic. */ 1659 && ! (TREE_CODE (olddecl) == FUNCTION_DECL 1660 && ! pedantic 1661 /* Return types must still match. */ 1662 && comptypes (TREE_TYPE (oldtype), 1663 TREE_TYPE (newtype)) 1664 && TYPE_ARG_TYPES (newtype) == 0)) 1665 { 1666 error_with_decl (newdecl, "conflicting types for `%s'"); 1667 /* Check for function type mismatch 1668 involving an empty arglist vs a nonempty one. */ 1669 if (TREE_CODE (olddecl) == FUNCTION_DECL 1670 && comptypes (TREE_TYPE (oldtype), 1671 TREE_TYPE (newtype)) 1672 && ((TYPE_ARG_TYPES (oldtype) == 0 1673 && DECL_INITIAL (olddecl) == 0) 1674 || 1675 (TYPE_ARG_TYPES (newtype) == 0 1676 && DECL_INITIAL (newdecl) == 0))) 1677 { 1678 /* Classify the problem further. */ 1679 tree t = TYPE_ARG_TYPES (oldtype); 1680 if (t == 0) 1681 t = TYPE_ARG_TYPES (newtype); 1682 for (; t; t = TREE_CHAIN (t)) 1683 { 1684 tree type = TREE_VALUE (t); 1685 1686 if (TREE_CHAIN (t) == 0 1687 && TYPE_MAIN_VARIANT (type) != void_type_node) 1688 { 1689 error ("a parameter list with an ellipsis can't match an empty parameter name list declaration"); 1690 break; 1691 } 1692 1693 if (simple_type_promotes_to (type) != NULL_TREE) 1694 { 1695 error ("an argument type that has a default promotion can't match an empty parameter name list declaration"); 1696 break; 1697 } 1698 } 1699 } 1700 error_with_decl (olddecl, "previous declaration of `%s'"); 1701 } 1702 else 1703 { 1704 errmsg = redeclaration_error_message (newdecl, olddecl); 1705 if (errmsg) 1706 { 1707 switch (errmsg) 1708 { 1709 case 1: 1710 error_with_decl (newdecl, "redefinition of `%s'"); 1711 break; 1712 case 2: 1713 error_with_decl (newdecl, "redeclaration of `%s'"); 1714 break; 1715 case 3: 1716 error_with_decl (newdecl, "conflicting declarations of `%s'"); 1717 break; 1718 default: 1719 abort (); 1720 } 1721 1722 error_with_decl (olddecl, 1723 ((DECL_INITIAL (olddecl) 1724 && current_binding_level == global_binding_level) 1725 ? "`%s' previously defined here" 1726 : "`%s' previously declared here")); 1727 return 0; 1728 } 1729 else if (TREE_CODE (newdecl) == TYPE_DECL 1730 && (DECL_IN_SYSTEM_HEADER (olddecl) 1731 || DECL_IN_SYSTEM_HEADER (newdecl))) 1732 { 1733 warning_with_decl (newdecl, "redefinition of `%s'"); 1734 warning_with_decl 1735 (olddecl, 1736 ((DECL_INITIAL (olddecl) 1737 && current_binding_level == global_binding_level) 1738 ? "`%s' previously defined here" 1739 : "`%s' previously declared here")); 1740 } 1741 else if (TREE_CODE (olddecl) == FUNCTION_DECL 1742 && DECL_INITIAL (olddecl) != 0 1743 && TYPE_ARG_TYPES (oldtype) == 0 1744 && TYPE_ARG_TYPES (newtype) != 0 1745 && TYPE_ACTUAL_ARG_TYPES (oldtype) != 0) 1746 { 1747 tree type, parm; 1748 int nargs; 1749 /* Prototype decl follows defn w/o prototype. */ 1750 1751 for (parm = TYPE_ACTUAL_ARG_TYPES (oldtype), 1752 type = TYPE_ARG_TYPES (newtype), 1753 nargs = 1; 1754 ; 1755 parm = TREE_CHAIN (parm), type = TREE_CHAIN (type), nargs++) 1756 { 1757 if (TYPE_MAIN_VARIANT (TREE_VALUE (parm)) == void_type_node 1758 && TYPE_MAIN_VARIANT (TREE_VALUE (type)) == void_type_node) 1759 { 1760 warning_with_decl (newdecl, "prototype for `%s' follows"); 1761 warning_with_decl (olddecl, "non-prototype definition here"); 1762 break; 1763 } 1764 if (TYPE_MAIN_VARIANT (TREE_VALUE (parm)) == void_type_node 1765 || TYPE_MAIN_VARIANT (TREE_VALUE (type)) == void_type_node) 1766 { 1767 error_with_decl (newdecl, 1768 "prototype for `%s' follows and number of arguments doesn't match"); 1769 error_with_decl (olddecl, "non-prototype definition here"); 1770 errmsg = 1; 1771 break; 1772 } 1773 /* Type for passing arg must be consistent 1774 with that declared for the arg. */ 1775 if (! comptypes (TREE_VALUE (parm), TREE_VALUE (type)) 1776 /* If -traditional, allow `unsigned int' instead of `int' 1777 in the prototype. */ 1778 && (! (flag_traditional 1779 && TYPE_MAIN_VARIANT (TREE_VALUE (parm)) == integer_type_node 1780 && TYPE_MAIN_VARIANT (TREE_VALUE (type)) == unsigned_type_node))) 1781 { 1782 error_with_decl (newdecl, 1783 "prototype for `%s' follows and argument %d doesn't match", 1784 nargs); 1785 error_with_decl (olddecl, "non-prototype definition here"); 1786 errmsg = 1; 1787 break; 1788 } 1789 } 1790 } 1791 /* Warn about mismatches in various flags. */ 1792 else 1793 { 1794 /* Warn if function is now inline 1795 but was previously declared not inline and has been called. */ 1796 if (TREE_CODE (olddecl) == FUNCTION_DECL 1797 && ! DECL_DECLARED_INLINE_P (olddecl) 1798 && DECL_DECLARED_INLINE_P (newdecl) 1799 && TREE_USED (olddecl)) 1800 warning_with_decl (newdecl, 1801 "`%s' declared inline after being called"); 1802 if (TREE_CODE (olddecl) == FUNCTION_DECL 1803 && ! DECL_DECLARED_INLINE_P (olddecl) 1804 && DECL_DECLARED_INLINE_P (newdecl) 1805 && DECL_INITIAL (olddecl) != 0) 1806 warning_with_decl (newdecl, 1807 "`%s' declared inline after its definition"); 1808 1809 /* If pedantic, warn when static declaration follows a non-static 1810 declaration. Otherwise, do so only for functions. */ 1811 if ((pedantic || TREE_CODE (olddecl) == FUNCTION_DECL) 1812 && TREE_PUBLIC (olddecl) 1813 && !TREE_PUBLIC (newdecl)) 1814 warning_with_decl (newdecl, "static declaration for `%s' follows non-static"); 1815 1816 /* If warn_traditional, warn when a non-static function 1817 declaration follows a static one. */ 1818 if (warn_traditional && !in_system_header 1819 && TREE_CODE (olddecl) == FUNCTION_DECL 1820 && !TREE_PUBLIC (olddecl) 1821 && TREE_PUBLIC (newdecl)) 1822 warning_with_decl (newdecl, "non-static declaration for `%s' follows static"); 1823 1824 /* Warn when const declaration follows a non-const 1825 declaration, but not for functions. */ 1826 if (TREE_CODE (olddecl) != FUNCTION_DECL 1827 && !TREE_READONLY (olddecl) 1828 && TREE_READONLY (newdecl)) 1829 warning_with_decl (newdecl, "const declaration for `%s' follows non-const"); 1830 /* These bits are logically part of the type, for variables. 1831 But not for functions 1832 (where qualifiers are not valid ANSI anyway). */ 1833 else if (pedantic && TREE_CODE (olddecl) != FUNCTION_DECL 1834 && (TREE_READONLY (newdecl) != TREE_READONLY (olddecl) 1835 || TREE_THIS_VOLATILE (newdecl) != TREE_THIS_VOLATILE (olddecl))) 1836 pedwarn_with_decl (newdecl, "type qualifiers for `%s' conflict with previous decl"); 1837 } 1838 } 1839 1840 /* Optionally warn about more than one declaration for the same name. */ 1841 if (errmsg == 0 && warn_redundant_decls && DECL_SOURCE_LINE (olddecl) != 0 1842 /* Don't warn about a function declaration 1843 followed by a definition. */ 1844 && !(TREE_CODE (newdecl) == FUNCTION_DECL && DECL_INITIAL (newdecl) != 0 1845 && DECL_INITIAL (olddecl) == 0) 1846 /* Don't warn about extern decl followed by (tentative) definition. */ 1847 && !(DECL_EXTERNAL (olddecl) && ! DECL_EXTERNAL (newdecl))) 1848 { 1849 warning_with_decl (newdecl, "redundant redeclaration of `%s' in same scope"); 1850 warning_with_decl (olddecl, "previous declaration of `%s'"); 1851 } 1852 1853 /* Copy all the DECL_... slots specified in the new decl 1854 except for any that we copy here from the old type. 1855 1856 Past this point, we don't change OLDTYPE and NEWTYPE 1857 even if we change the types of NEWDECL and OLDDECL. */ 1858 1859 if (types_match) 1860 { 1861 /* When copying info to olddecl, we store into write_olddecl 1862 instead. This allows us to avoid modifying olddecl when 1863 different_binding_level is true. */ 1864 tree write_olddecl = different_binding_level ? newdecl : olddecl; 1865 1866 /* Merge the data types specified in the two decls. */ 1867 if (TREE_CODE (newdecl) != FUNCTION_DECL || !DECL_BUILT_IN (olddecl)) 1868 { 1869 if (different_binding_level) 1870 { 1871 if (TYPE_ARG_TYPES (oldtype) != 0 1872 && TYPE_ARG_TYPES (newtype) == 0) 1873 TREE_TYPE (newdecl) = common_type (newtype, oldtype); 1874 else 1875 TREE_TYPE (newdecl) 1876 = build_type_attribute_variant 1877 (newtype, 1878 merge_attributes (TYPE_ATTRIBUTES (newtype), 1879 TYPE_ATTRIBUTES (oldtype))); 1880 } 1881 else 1882 TREE_TYPE (newdecl) 1883 = TREE_TYPE (olddecl) 1884 = common_type (newtype, oldtype); 1885 } 1886 1887 /* Lay the type out, unless already done. */ 1888 if (oldtype != TREE_TYPE (newdecl)) 1889 { 1890 if (TREE_TYPE (newdecl) != error_mark_node) 1891 layout_type (TREE_TYPE (newdecl)); 1892 if (TREE_CODE (newdecl) != FUNCTION_DECL 1893 && TREE_CODE (newdecl) != TYPE_DECL 1894 && TREE_CODE (newdecl) != CONST_DECL) 1895 layout_decl (newdecl, 0); 1896 } 1897 else 1898 { 1899 /* Since the type is OLDDECL's, make OLDDECL's size go with. */ 1900 DECL_SIZE (newdecl) = DECL_SIZE (olddecl); 1901 DECL_SIZE_UNIT (newdecl) = DECL_SIZE_UNIT (olddecl); 1902 DECL_MODE (newdecl) = DECL_MODE (olddecl); 1903 if (TREE_CODE (olddecl) != FUNCTION_DECL) 1904 if (DECL_ALIGN (olddecl) > DECL_ALIGN (newdecl)) 1905 { 1906 DECL_ALIGN (newdecl) = DECL_ALIGN (olddecl); 1907 DECL_USER_ALIGN (newdecl) |= DECL_ALIGN (olddecl); 1908 } 1909 } 1910 1911 /* Keep the old rtl since we can safely use it. */ 1912 COPY_DECL_RTL (olddecl, newdecl); 1913 1914 /* Merge the type qualifiers. */ 1915 if (TREE_CODE (olddecl) == FUNCTION_DECL 1916 && DECL_BUILT_IN_NONANSI (olddecl) && TREE_THIS_VOLATILE (olddecl) 1917 && ! TREE_THIS_VOLATILE (newdecl)) 1918 TREE_THIS_VOLATILE (write_olddecl) = 0; 1919 1920 if (TREE_READONLY (newdecl)) 1921 TREE_READONLY (write_olddecl) = 1; 1922 1923 if (TREE_THIS_VOLATILE (newdecl)) 1924 { 1925 TREE_THIS_VOLATILE (write_olddecl) = 1; 1926 if (TREE_CODE (newdecl) == VAR_DECL 1927 /* If an automatic variable is re-declared in the same 1928 function scope, but the old declaration was not 1929 volatile, make_var_volatile() would crash because the 1930 variable would have been assigned to a pseudo, not a 1931 MEM. Since this duplicate declaration is invalid 1932 anyway, we just skip the call. */ 1933 && errmsg == 0) 1934 make_var_volatile (newdecl); 1935 } 1936 1937 /* Keep source location of definition rather than declaration. */ 1938 /* When called with different_binding_level set, keep the old 1939 information so that meaningful diagnostics can be given. */ 1940 if (DECL_INITIAL (newdecl) == 0 && DECL_INITIAL (olddecl) != 0 1941 && ! different_binding_level) 1942 { 1943 DECL_SOURCE_LINE (newdecl) = DECL_SOURCE_LINE (olddecl); 1944 DECL_SOURCE_FILE (newdecl) = DECL_SOURCE_FILE (olddecl); 1945 } 1946 1947 /* Merge the unused-warning information. */ 1948 if (DECL_IN_SYSTEM_HEADER (olddecl)) 1949 DECL_IN_SYSTEM_HEADER (newdecl) = 1; 1950 else if (DECL_IN_SYSTEM_HEADER (newdecl)) 1951 DECL_IN_SYSTEM_HEADER (write_olddecl) = 1; 1952 1953 /* Merge the initialization information. */ 1954 /* When called with different_binding_level set, don't copy over 1955 DECL_INITIAL, so that we don't accidentally change function 1956 declarations into function definitions. */ 1957 if (DECL_INITIAL (newdecl) == 0 && ! different_binding_level) 1958 DECL_INITIAL (newdecl) = DECL_INITIAL (olddecl); 1959 1960 /* Merge the section attribute. 1961 We want to issue an error if the sections conflict but that must be 1962 done later in decl_attributes since we are called before attributes 1963 are assigned. */ 1964 if (DECL_SECTION_NAME (newdecl) == NULL_TREE) 1965 DECL_SECTION_NAME (newdecl) = DECL_SECTION_NAME (olddecl); 1966 1967 /* Copy the assembler name. 1968 Currently, it can only be defined in the prototype. */ 1969 COPY_DECL_ASSEMBLER_NAME (olddecl, newdecl); 1970 1971 if (TREE_CODE (newdecl) == FUNCTION_DECL) 1972 { 1973 DECL_STATIC_CONSTRUCTOR(newdecl) |= DECL_STATIC_CONSTRUCTOR(olddecl); 1974 DECL_STATIC_DESTRUCTOR (newdecl) |= DECL_STATIC_DESTRUCTOR (olddecl); 1975 DECL_NO_LIMIT_STACK (newdecl) |= DECL_NO_LIMIT_STACK (olddecl); 1976 DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (newdecl) 1977 |= DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (olddecl); 1978 } 1979 } 1980 /* If cannot merge, then use the new type and qualifiers, 1981 and don't preserve the old rtl. */ 1982 else if (! different_binding_level) 1983 { 1984 TREE_TYPE (olddecl) = TREE_TYPE (newdecl); 1985 TREE_READONLY (olddecl) = TREE_READONLY (newdecl); 1986 TREE_THIS_VOLATILE (olddecl) = TREE_THIS_VOLATILE (newdecl); 1987 TREE_SIDE_EFFECTS (olddecl) = TREE_SIDE_EFFECTS (newdecl); 1988 } 1989 1990 /* Merge the storage class information. */ 1991 merge_weak (newdecl, olddecl); 1992 1993 /* For functions, static overrides non-static. */ 1994 if (TREE_CODE (newdecl) == FUNCTION_DECL) 1995 { 1996 TREE_PUBLIC (newdecl) &= TREE_PUBLIC (olddecl); 1997 /* This is since we don't automatically 1998 copy the attributes of NEWDECL into OLDDECL. */ 1999 /* No need to worry about different_binding_level here because 2000 then TREE_PUBLIC (newdecl) was true. */ 2001 TREE_PUBLIC (olddecl) = TREE_PUBLIC (newdecl); 2002 /* If this clears `static', clear it in the identifier too. */ 2003 if (! TREE_PUBLIC (olddecl)) 2004 TREE_PUBLIC (DECL_NAME (olddecl)) = 0; 2005 } 2006 if (DECL_EXTERNAL (newdecl)) 2007 { 2008 if (! different_binding_level) 2009 { 2010 /* Don't mess with these flags on local externs; they remain 2011 external even if there's a declaration at file scope which 2012 isn't. */ 2013 TREE_STATIC (newdecl) = TREE_STATIC (olddecl); 2014 DECL_EXTERNAL (newdecl) = DECL_EXTERNAL (olddecl); 2015 } 2016 /* An extern decl does not override previous storage class. */ 2017 TREE_PUBLIC (newdecl) = TREE_PUBLIC (olddecl); 2018 if (! DECL_EXTERNAL (newdecl)) 2019 DECL_CONTEXT (newdecl) = DECL_CONTEXT (olddecl); 2020 } 2021 else 2022 { 2023 TREE_STATIC (olddecl) = TREE_STATIC (newdecl); 2024 TREE_PUBLIC (olddecl) = TREE_PUBLIC (newdecl); 2025 } 2026 2027 if (TREE_CODE (newdecl) == FUNCTION_DECL) 2028 { 2029 /* If we're redefining a function previously defined as extern 2030 inline, make sure we emit debug info for the inline before we 2031 throw it away, in case it was inlined into a function that hasn't 2032 been written out yet. */ 2033 if (new_is_definition && DECL_INITIAL (olddecl) && TREE_USED (olddecl)) 2034 { 2035 (*debug_hooks->outlining_inline_function) (olddecl); 2036 2037 /* The new defn must not be inline. */ 2038 DECL_INLINE (newdecl) = 0; 2039 DECL_UNINLINABLE (newdecl) = 1; 2040 } 2041 else 2042 { 2043 /* If either decl says `inline', this fn is inline, 2044 unless its definition was passed already. */ 2045 if (DECL_DECLARED_INLINE_P (newdecl) 2046 || DECL_DECLARED_INLINE_P (olddecl)) 2047 DECL_DECLARED_INLINE_P (newdecl) = 1; 2048 2049 DECL_UNINLINABLE (newdecl) = DECL_UNINLINABLE (olddecl) 2050 = (DECL_UNINLINABLE (newdecl) || DECL_UNINLINABLE (olddecl)); 2051 } 2052 2053 if (DECL_BUILT_IN (olddecl)) 2054 { 2055 /* Get rid of any built-in function if new arg types don't match it 2056 or if we have a function definition. */ 2057 if (! types_match || new_is_definition) 2058 { 2059 if (! different_binding_level) 2060 { 2061 TREE_TYPE (olddecl) = TREE_TYPE (newdecl); 2062 DECL_BUILT_IN_CLASS (olddecl) = NOT_BUILT_IN; 2063 } 2064 } 2065 else 2066 { 2067 /* If redeclaring a builtin function, and not a definition, 2068 it stays built in. */ 2069 DECL_BUILT_IN_CLASS (newdecl) = DECL_BUILT_IN_CLASS (olddecl); 2070 DECL_FUNCTION_CODE (newdecl) = DECL_FUNCTION_CODE (olddecl); 2071 } 2072 } 2073 2074 /* Also preserve various other info from the definition. */ 2075 if (! new_is_definition) 2076 { 2077 DECL_RESULT (newdecl) = DECL_RESULT (olddecl); 2078 /* When called with different_binding_level set, don't copy over 2079 DECL_INITIAL, so that we don't accidentally change function 2080 declarations into function definitions. */ 2081 if (! different_binding_level) 2082 DECL_INITIAL (newdecl) = DECL_INITIAL (olddecl); 2083 DECL_SAVED_INSNS (newdecl) = DECL_SAVED_INSNS (olddecl); 2084 DECL_SAVED_TREE (newdecl) = DECL_SAVED_TREE (olddecl); 2085 DECL_NUM_STMTS (newdecl) = DECL_NUM_STMTS (olddecl); 2086 DECL_ARGUMENTS (newdecl) = DECL_ARGUMENTS (olddecl); 2087 2088 /* Set DECL_INLINE on the declaration if we've got a body 2089 from which to instantiate. */ 2090 if (DECL_INLINE (olddecl) && ! DECL_UNINLINABLE (newdecl)) 2091 { 2092 DECL_INLINE (newdecl) = 1; 2093 DECL_ABSTRACT_ORIGIN (newdecl) 2094 = (different_binding_level 2095 ? DECL_ORIGIN (olddecl) 2096 : DECL_ABSTRACT_ORIGIN (olddecl)); 2097 } 2098 } 2099 else 2100 { 2101 /* If a previous declaration said inline, mark the 2102 definition as inlinable. */ 2103 if (DECL_DECLARED_INLINE_P (newdecl) 2104 && ! DECL_UNINLINABLE (newdecl)) 2105 DECL_INLINE (newdecl) = 1; 2106 } 2107 } 2108 if (different_binding_level) 2109 return 0; 2110 2111 /* Copy most of the decl-specific fields of NEWDECL into OLDDECL. 2112 But preserve OLDDECL's DECL_UID. */ 2113 { 2114 unsigned olddecl_uid = DECL_UID (olddecl); 2115 2116 memcpy ((char *) olddecl + sizeof (struct tree_common), 2117 (char *) newdecl + sizeof (struct tree_common), 2118 sizeof (struct tree_decl) - sizeof (struct tree_common)); 2119 DECL_UID (olddecl) = olddecl_uid; 2120 } 2121 2122 /* NEWDECL contains the merged attribute lists. 2123 Update OLDDECL to be the same. */ 2124 DECL_ATTRIBUTES (olddecl) = DECL_ATTRIBUTES (newdecl); 2125 2126 return 1; 2127} 2128 2129/* Check whether decl-node X shadows an existing declaration. 2130 OLDLOCAL is the old IDENTIFIER_LOCAL_VALUE of the DECL_NAME of X, 2131 which might be a NULL_TREE. */ 2132static void 2133warn_if_shadowing (x, oldlocal) 2134 tree x, oldlocal; 2135{ 2136 tree name; 2137 2138 if (DECL_EXTERNAL (x)) 2139 return; 2140 2141 name = DECL_NAME (x); 2142 2143 /* Warn if shadowing an argument at the top level of the body. */ 2144 if (oldlocal != 0 2145 /* This warning doesn't apply to the parms of a nested fcn. */ 2146 && ! current_binding_level->parm_flag 2147 /* Check that this is one level down from the parms. */ 2148 && current_binding_level->level_chain->parm_flag 2149 /* Check that the decl being shadowed 2150 comes from the parm level, one level up. */ 2151 && chain_member (oldlocal, current_binding_level->level_chain->names)) 2152 { 2153 if (TREE_CODE (oldlocal) == PARM_DECL) 2154 pedwarn ("declaration of `%s' shadows a parameter", 2155 IDENTIFIER_POINTER (name)); 2156 else 2157 pedwarn ("declaration of `%s' shadows a symbol from the parameter list", 2158 IDENTIFIER_POINTER (name)); 2159 } 2160 /* Maybe warn if shadowing something else. */ 2161 else if (warn_shadow 2162 /* No shadow warnings for internally generated vars. */ 2163 && DECL_SOURCE_LINE (x) != 0 2164 /* No shadow warnings for vars made for inlining. */ 2165 && ! DECL_FROM_INLINE (x)) 2166 { 2167 if (TREE_CODE (x) == PARM_DECL 2168 && current_binding_level->level_chain->parm_flag) 2169 /* Don't warn about the parm names in function declarator 2170 within a function declarator. 2171 It would be nice to avoid warning in any function 2172 declarator in a declaration, as opposed to a definition, 2173 but there is no way to tell it's not a definition. */ 2174 ; 2175 else if (oldlocal) 2176 { 2177 if (TREE_CODE (oldlocal) == PARM_DECL) 2178 shadow_warning ("a parameter", name, oldlocal); 2179 else 2180 shadow_warning ("a previous local", name, oldlocal); 2181 } 2182 else if (IDENTIFIER_GLOBAL_VALUE (name) != 0 2183 && IDENTIFIER_GLOBAL_VALUE (name) != error_mark_node) 2184 shadow_warning ("a global declaration", name, 2185 IDENTIFIER_GLOBAL_VALUE (name)); 2186 } 2187} 2188 2189/* Record a decl-node X as belonging to the current lexical scope. 2190 Check for errors (such as an incompatible declaration for the same 2191 name already seen in the same scope). 2192 2193 Returns either X or an old decl for the same name. 2194 If an old decl is returned, it may have been smashed 2195 to agree with what X says. */ 2196 2197tree 2198pushdecl (x) 2199 tree x; 2200{ 2201 tree t; 2202 tree name = DECL_NAME (x); 2203 struct binding_level *b = current_binding_level; 2204 2205 /* Functions need the lang_decl data. */ 2206 if (TREE_CODE (x) == FUNCTION_DECL && ! DECL_LANG_SPECIFIC (x)) 2207 DECL_LANG_SPECIFIC (x) = (struct lang_decl *) 2208 ggc_alloc_cleared (sizeof (struct lang_decl)); 2209 2210 DECL_CONTEXT (x) = current_function_decl; 2211 /* A local extern declaration for a function doesn't constitute nesting. 2212 A local auto declaration does, since it's a forward decl 2213 for a nested function coming later. */ 2214 if ((TREE_CODE (x) == FUNCTION_DECL || TREE_CODE (x) == VAR_DECL) 2215 && DECL_INITIAL (x) == 0 && DECL_EXTERNAL (x)) 2216 DECL_CONTEXT (x) = 0; 2217 2218 if (name) 2219 { 2220 int different_binding_level = 0; 2221 2222 if (warn_nested_externs 2223 && DECL_EXTERNAL (x) 2224 && b != global_binding_level 2225 && x != IDENTIFIER_IMPLICIT_DECL (name) 2226 /* No error messages for __FUNCTION__ and __PRETTY_FUNCTION__. */ 2227 && !DECL_IN_SYSTEM_HEADER (x)) 2228 warning ("nested extern declaration of `%s'", 2229 IDENTIFIER_POINTER (name)); 2230 2231 t = lookup_name_current_level (name); 2232 /* Don't type check externs here when -traditional. This is so that 2233 code with conflicting declarations inside blocks will get warnings 2234 not errors. X11 for instance depends on this. */ 2235 if (! t && DECL_EXTERNAL (x) && TREE_PUBLIC (x) && ! flag_traditional) 2236 { 2237 t = IDENTIFIER_GLOBAL_VALUE (name); 2238 /* Type decls at global scope don't conflict with externs declared 2239 inside lexical blocks. */ 2240 if (! t || TREE_CODE (t) == TYPE_DECL) 2241 /* If there's no visible global declaration, try for an 2242 invisible one. */ 2243 t = IDENTIFIER_LIMBO_VALUE (name); 2244 different_binding_level = 1; 2245 } 2246 if (t != 0 && t == error_mark_node) 2247 /* error_mark_node is 0 for a while during initialization! */ 2248 { 2249 t = 0; 2250 error_with_decl (x, "`%s' used prior to declaration"); 2251 } 2252 2253 /* If this decl is `static' and an implicit decl was seen previously, 2254 warn. But don't complain if -traditional, 2255 since traditional compilers don't complain. */ 2256 if (! flag_traditional && TREE_PUBLIC (name) 2257 /* Don't test for DECL_EXTERNAL, because grokdeclarator 2258 sets this for all functions. */ 2259 && ! TREE_PUBLIC (x) 2260 && (TREE_CODE (x) == FUNCTION_DECL || b == global_binding_level) 2261 /* We used to warn also for explicit extern followed by static, 2262 but sometimes you need to do it that way. */ 2263 && IDENTIFIER_IMPLICIT_DECL (name) != 0) 2264 { 2265 pedwarn ("`%s' was declared implicitly `extern' and later `static'", 2266 IDENTIFIER_POINTER (name)); 2267 pedwarn_with_file_and_line 2268 (DECL_SOURCE_FILE (IDENTIFIER_IMPLICIT_DECL (name)), 2269 DECL_SOURCE_LINE (IDENTIFIER_IMPLICIT_DECL (name)), 2270 "previous declaration of `%s'", 2271 IDENTIFIER_POINTER (name)); 2272 TREE_THIS_VOLATILE (name) = 1; 2273 } 2274 2275 if (t != 0 && duplicate_decls (x, t, different_binding_level)) 2276 { 2277 if (TREE_CODE (t) == PARM_DECL) 2278 { 2279 /* Don't allow more than one "real" duplicate 2280 of a forward parm decl. */ 2281 TREE_ASM_WRITTEN (t) = TREE_ASM_WRITTEN (x); 2282 return t; 2283 } 2284 return t; 2285 } 2286 2287 /* If we are processing a typedef statement, generate a whole new 2288 ..._TYPE node (which will be just an variant of the existing 2289 ..._TYPE node with identical properties) and then install the 2290 TYPE_DECL node generated to represent the typedef name as the 2291 TYPE_NAME of this brand new (duplicate) ..._TYPE node. 2292 2293 The whole point here is to end up with a situation where each 2294 and every ..._TYPE node the compiler creates will be uniquely 2295 associated with AT MOST one node representing a typedef name. 2296 This way, even though the compiler substitutes corresponding 2297 ..._TYPE nodes for TYPE_DECL (i.e. "typedef name") nodes very 2298 early on, later parts of the compiler can always do the reverse 2299 translation and get back the corresponding typedef name. For 2300 example, given: 2301 2302 typedef struct S MY_TYPE; 2303 MY_TYPE object; 2304 2305 Later parts of the compiler might only know that `object' was of 2306 type `struct S' if it were not for code just below. With this 2307 code however, later parts of the compiler see something like: 2308 2309 struct S' == struct S 2310 typedef struct S' MY_TYPE; 2311 struct S' object; 2312 2313 And they can then deduce (from the node for type struct S') that 2314 the original object declaration was: 2315 2316 MY_TYPE object; 2317 2318 Being able to do this is important for proper support of protoize, 2319 and also for generating precise symbolic debugging information 2320 which takes full account of the programmer's (typedef) vocabulary. 2321 2322 Obviously, we don't want to generate a duplicate ..._TYPE node if 2323 the TYPE_DECL node that we are now processing really represents a 2324 standard built-in type. 2325 2326 Since all standard types are effectively declared at line zero 2327 in the source file, we can easily check to see if we are working 2328 on a standard type by checking the current value of lineno. */ 2329 2330 if (TREE_CODE (x) == TYPE_DECL) 2331 { 2332 if (DECL_SOURCE_LINE (x) == 0) 2333 { 2334 if (TYPE_NAME (TREE_TYPE (x)) == 0) 2335 TYPE_NAME (TREE_TYPE (x)) = x; 2336 } 2337 else if (TREE_TYPE (x) != error_mark_node 2338 && DECL_ORIGINAL_TYPE (x) == NULL_TREE) 2339 { 2340 tree tt = TREE_TYPE (x); 2341 DECL_ORIGINAL_TYPE (x) = tt; 2342 tt = build_type_copy (tt); 2343 TYPE_NAME (tt) = x; 2344 TREE_USED (tt) = TREE_USED (x); 2345 TREE_TYPE (x) = tt; 2346 } 2347 } 2348 2349 /* Multiple external decls of the same identifier ought to match. 2350 Check against both global declarations (when traditional) and out of 2351 scope (limbo) block level declarations. 2352 2353 We get warnings about inline functions where they are defined. 2354 Avoid duplicate warnings where they are used. */ 2355 if (TREE_PUBLIC (x) 2356 && ! (TREE_CODE (x) == FUNCTION_DECL && DECL_INLINE (x))) 2357 { 2358 tree decl; 2359 2360 if (flag_traditional && IDENTIFIER_GLOBAL_VALUE (name) != 0 2361 && (DECL_EXTERNAL (IDENTIFIER_GLOBAL_VALUE (name)) 2362 || TREE_PUBLIC (IDENTIFIER_GLOBAL_VALUE (name)))) 2363 decl = IDENTIFIER_GLOBAL_VALUE (name); 2364 else if (IDENTIFIER_LIMBO_VALUE (name) != 0) 2365 /* Decls in limbo are always extern, so no need to check that. */ 2366 decl = IDENTIFIER_LIMBO_VALUE (name); 2367 else 2368 decl = 0; 2369 2370 if (decl && ! comptypes (TREE_TYPE (x), TREE_TYPE (decl)) 2371 /* If old decl is built-in, we already warned if we should. */ 2372 && !DECL_BUILT_IN (decl)) 2373 { 2374 pedwarn_with_decl (x, 2375 "type mismatch with previous external decl"); 2376 pedwarn_with_decl (decl, "previous external decl of `%s'"); 2377 } 2378 } 2379 2380 /* If a function has had an implicit declaration, and then is defined, 2381 make sure they are compatible. */ 2382 2383 if (IDENTIFIER_IMPLICIT_DECL (name) != 0 2384 && IDENTIFIER_GLOBAL_VALUE (name) == 0 2385 && TREE_CODE (x) == FUNCTION_DECL 2386 && ! comptypes (TREE_TYPE (x), 2387 TREE_TYPE (IDENTIFIER_IMPLICIT_DECL (name)))) 2388 { 2389 warning_with_decl (x, "type mismatch with previous implicit declaration"); 2390 warning_with_decl (IDENTIFIER_IMPLICIT_DECL (name), 2391 "previous implicit declaration of `%s'"); 2392 } 2393 2394 /* In PCC-compatibility mode, extern decls of vars with no current decl 2395 take effect at top level no matter where they are. */ 2396 if (flag_traditional && DECL_EXTERNAL (x) 2397 && lookup_name (name) == 0) 2398 { 2399 tree type = TREE_TYPE (x); 2400 2401 /* But don't do this if the type contains temporary nodes. */ 2402 while (type) 2403 { 2404 if (type == error_mark_node) 2405 break; 2406 if (TYPE_CONTEXT (type)) 2407 { 2408 warning_with_decl (x, "type of external `%s' is not global"); 2409 /* By exiting the loop early, we leave TYPE nonzero, 2410 and thus prevent globalization of the decl. */ 2411 break; 2412 } 2413 else if (TREE_CODE (type) == FUNCTION_TYPE 2414 && TYPE_ARG_TYPES (type) != 0) 2415 /* The types might not be truly local, 2416 but the list of arg types certainly is temporary. 2417 Since prototypes are nontraditional, 2418 ok not to do the traditional thing. */ 2419 break; 2420 type = TREE_TYPE (type); 2421 } 2422 2423 if (type == 0) 2424 b = global_binding_level; 2425 } 2426 2427 /* This name is new in its binding level. 2428 Install the new declaration and return it. */ 2429 if (b == global_binding_level) 2430 { 2431 /* Install a global value. */ 2432 2433 /* If the first global decl has external linkage, 2434 warn if we later see static one. */ 2435 if (IDENTIFIER_GLOBAL_VALUE (name) == 0 && TREE_PUBLIC (x)) 2436 TREE_PUBLIC (name) = 1; 2437 2438 IDENTIFIER_GLOBAL_VALUE (name) = x; 2439 2440 /* We no longer care about any previous block level declarations. */ 2441 IDENTIFIER_LIMBO_VALUE (name) = 0; 2442 2443 /* Don't forget if the function was used via an implicit decl. */ 2444 if (IDENTIFIER_IMPLICIT_DECL (name) 2445 && TREE_USED (IDENTIFIER_IMPLICIT_DECL (name))) 2446 TREE_USED (x) = 1, TREE_USED (name) = 1; 2447 2448 /* Don't forget if its address was taken in that way. */ 2449 if (IDENTIFIER_IMPLICIT_DECL (name) 2450 && TREE_ADDRESSABLE (IDENTIFIER_IMPLICIT_DECL (name))) 2451 TREE_ADDRESSABLE (x) = 1; 2452 2453 /* Warn about mismatches against previous implicit decl. */ 2454 if (IDENTIFIER_IMPLICIT_DECL (name) != 0 2455 /* If this real decl matches the implicit, don't complain. */ 2456 && ! (TREE_CODE (x) == FUNCTION_DECL 2457 && (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (x))) 2458 == integer_type_node))) 2459 pedwarn ("`%s' was previously implicitly declared to return `int'", 2460 IDENTIFIER_POINTER (name)); 2461 2462 /* If this decl is `static' and an `extern' was seen previously, 2463 that is erroneous. */ 2464 if (TREE_PUBLIC (name) 2465 && ! TREE_PUBLIC (x) && ! DECL_EXTERNAL (x)) 2466 { 2467 /* Okay to redeclare an ANSI built-in as static. */ 2468 if (t != 0 && DECL_BUILT_IN (t)) 2469 ; 2470 /* Okay to declare a non-ANSI built-in as anything. */ 2471 else if (t != 0 && DECL_BUILT_IN_NONANSI (t)) 2472 ; 2473 /* Okay to have global type decl after an earlier extern 2474 declaration inside a lexical block. */ 2475 else if (TREE_CODE (x) == TYPE_DECL) 2476 ; 2477 else if (IDENTIFIER_IMPLICIT_DECL (name)) 2478 { 2479 if (! TREE_THIS_VOLATILE (name)) 2480 pedwarn ("`%s' was declared implicitly `extern' and later `static'", 2481 IDENTIFIER_POINTER (name)); 2482 } 2483 else 2484 pedwarn ("`%s' was declared `extern' and later `static'", 2485 IDENTIFIER_POINTER (name)); 2486 } 2487 } 2488 else 2489 { 2490 /* Here to install a non-global value. */ 2491 tree oldlocal = IDENTIFIER_LOCAL_VALUE (name); 2492 tree oldglobal = IDENTIFIER_GLOBAL_VALUE (name); 2493 2494 IDENTIFIER_LOCAL_VALUE (name) = x; 2495 2496 /* If this is an extern function declaration, see if we 2497 have a global definition or declaration for the function. */ 2498 if (oldlocal == 0 2499 && oldglobal != 0 2500 && TREE_CODE (x) == FUNCTION_DECL 2501 && TREE_CODE (oldglobal) == FUNCTION_DECL 2502 && DECL_EXTERNAL (x) 2503 && ! DECL_DECLARED_INLINE_P (x)) 2504 { 2505 /* We have one. Their types must agree. */ 2506 if (! comptypes (TREE_TYPE (x), 2507 TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (name)))) 2508 pedwarn_with_decl (x, "extern declaration of `%s' doesn't match global one"); 2509 else 2510 { 2511 /* Inner extern decl is inline if global one is. 2512 Copy enough to really inline it. */ 2513 if (DECL_DECLARED_INLINE_P (oldglobal)) 2514 { 2515 DECL_DECLARED_INLINE_P (x) 2516 = DECL_DECLARED_INLINE_P (oldglobal); 2517 DECL_INLINE (x) = DECL_INLINE (oldglobal); 2518 DECL_INITIAL (x) = (current_function_decl == oldglobal 2519 ? 0 : DECL_INITIAL (oldglobal)); 2520 DECL_SAVED_INSNS (x) = DECL_SAVED_INSNS (oldglobal); 2521 DECL_NUM_STMTS (x) = DECL_NUM_STMTS (oldglobal); 2522 DECL_ARGUMENTS (x) = DECL_ARGUMENTS (oldglobal); 2523 DECL_RESULT (x) = DECL_RESULT (oldglobal); 2524 TREE_ASM_WRITTEN (x) = TREE_ASM_WRITTEN (oldglobal); 2525 DECL_ABSTRACT_ORIGIN (x) 2526 = DECL_ABSTRACT_ORIGIN (oldglobal); 2527 } 2528 /* Inner extern decl is built-in if global one is. */ 2529 if (DECL_BUILT_IN (oldglobal)) 2530 { 2531 DECL_BUILT_IN_CLASS (x) = DECL_BUILT_IN_CLASS (oldglobal); 2532 DECL_FUNCTION_CODE (x) = DECL_FUNCTION_CODE (oldglobal); 2533 } 2534 /* Keep the arg types from a file-scope fcn defn. */ 2535 if (TYPE_ARG_TYPES (TREE_TYPE (oldglobal)) != 0 2536 && DECL_INITIAL (oldglobal) 2537 && TYPE_ARG_TYPES (TREE_TYPE (x)) == 0) 2538 TREE_TYPE (x) = TREE_TYPE (oldglobal); 2539 } 2540 } 2541 2542#if 0 2543 /* This case is probably sometimes the right thing to do. */ 2544 /* If we have a local external declaration, 2545 then any file-scope declaration should not 2546 have been static. */ 2547 if (oldlocal == 0 && oldglobal != 0 2548 && !TREE_PUBLIC (oldglobal) 2549 && DECL_EXTERNAL (x) && TREE_PUBLIC (x)) 2550 warning ("`%s' locally external but globally static", 2551 IDENTIFIER_POINTER (name)); 2552#endif 2553 2554 /* If we have a local external declaration, 2555 and no file-scope declaration has yet been seen, 2556 then if we later have a file-scope decl it must not be static. */ 2557 if (oldlocal == 0 2558 && DECL_EXTERNAL (x) 2559 && TREE_PUBLIC (x)) 2560 { 2561 if (oldglobal == 0) 2562 TREE_PUBLIC (name) = 1; 2563 2564 /* Save this decl, so that we can do type checking against 2565 other decls after it falls out of scope. 2566 2567 Only save it once. This prevents temporary decls created in 2568 expand_inline_function from being used here, since this 2569 will have been set when the inline function was parsed. 2570 It also helps give slightly better warnings. */ 2571 if (IDENTIFIER_LIMBO_VALUE (name) == 0) 2572 IDENTIFIER_LIMBO_VALUE (name) = x; 2573 } 2574 2575 warn_if_shadowing (x, oldlocal); 2576 2577 /* If storing a local value, there may already be one (inherited). 2578 If so, record it for restoration when this binding level ends. */ 2579 if (oldlocal != 0) 2580 b->shadowed = tree_cons (name, oldlocal, b->shadowed); 2581 } 2582 2583 /* Keep count of variables in this level with incomplete type. 2584 If the input is erroneous, we can have error_mark in the type 2585 slot (e.g. "f(void a, ...)") - that doesn't count as an 2586 incomplete type. */ 2587 if (TREE_TYPE (x) != error_mark_node 2588 && !COMPLETE_TYPE_P (TREE_TYPE (x))) 2589 { 2590 tree element = TREE_TYPE (x); 2591 2592 while (TREE_CODE (element) == ARRAY_TYPE) 2593 element = TREE_TYPE (element); 2594 if (TREE_CODE (element) == RECORD_TYPE 2595 || TREE_CODE (element) == UNION_TYPE) 2596 ++b->n_incomplete; 2597 } 2598 } 2599 2600 /* Put decls on list in reverse order. 2601 We will reverse them later if necessary. */ 2602 TREE_CHAIN (x) = b->names; 2603 b->names = x; 2604 2605 return x; 2606} 2607 2608/* Like pushdecl, only it places X in GLOBAL_BINDING_LEVEL, if appropriate. */ 2609 2610tree 2611pushdecl_top_level (x) 2612 tree x; 2613{ 2614 tree t; 2615 struct binding_level *b = current_binding_level; 2616 2617 current_binding_level = global_binding_level; 2618 t = pushdecl (x); 2619 current_binding_level = b; 2620 return t; 2621} 2622 2623/* Generate an implicit declaration for identifier FUNCTIONID 2624 as a function of type int (). Print a warning if appropriate. */ 2625 2626tree 2627implicitly_declare (functionid) 2628 tree functionid; 2629{ 2630 tree decl; 2631 int traditional_warning = 0; 2632 /* Only one "implicit declaration" warning per identifier. */ 2633 int implicit_warning; 2634 2635 /* We used to reuse an old implicit decl here, 2636 but this loses with inline functions because it can clobber 2637 the saved decl chains. */ 2638#if 0 2639 if (IDENTIFIER_IMPLICIT_DECL (functionid) != 0) 2640 decl = IDENTIFIER_IMPLICIT_DECL (functionid); 2641 else 2642#endif 2643 decl = build_decl (FUNCTION_DECL, functionid, default_function_type); 2644 2645 /* Warn of implicit decl following explicit local extern decl. 2646 This is probably a program designed for traditional C. */ 2647 if (TREE_PUBLIC (functionid) && IDENTIFIER_GLOBAL_VALUE (functionid) == 0) 2648 traditional_warning = 1; 2649 2650 /* Warn once of an implicit declaration. */ 2651 implicit_warning = (IDENTIFIER_IMPLICIT_DECL (functionid) == 0); 2652 2653 DECL_EXTERNAL (decl) = 1; 2654 TREE_PUBLIC (decl) = 1; 2655 2656 /* Record that we have an implicit decl and this is it. */ 2657 IDENTIFIER_IMPLICIT_DECL (functionid) = decl; 2658 2659 /* ANSI standard says implicit declarations are in the innermost block. 2660 So we record the decl in the standard fashion. 2661 If flag_traditional is set, pushdecl does it top-level. */ 2662 pushdecl (decl); 2663 2664 /* This is a no-op in c-lang.c or something real in objc-actions.c. */ 2665 maybe_objc_check_decl (decl); 2666 2667 rest_of_decl_compilation (decl, NULL, 0, 0); 2668 2669 if (implicit_warning) 2670 implicit_decl_warning (functionid); 2671 else if (warn_traditional && traditional_warning) 2672 warning ("function `%s' was previously declared within a block", 2673 IDENTIFIER_POINTER (functionid)); 2674 2675 /* Write a record describing this implicit function declaration to the 2676 prototypes file (if requested). */ 2677 2678 gen_aux_info_record (decl, 0, 1, 0); 2679 2680 /* Possibly apply some default attributes to this implicit declaration. */ 2681 decl_attributes (&decl, NULL_TREE, 0); 2682 2683 return decl; 2684} 2685 2686void 2687implicit_decl_warning (id) 2688 tree id; 2689{ 2690 const char *name = IDENTIFIER_POINTER (id); 2691 if (mesg_implicit_function_declaration == 2) 2692 error ("implicit declaration of function `%s'", name); 2693 else if (mesg_implicit_function_declaration == 1) 2694 warning ("implicit declaration of function `%s'", name); 2695} 2696 2697/* Return zero if the declaration NEWDECL is valid 2698 when the declaration OLDDECL (assumed to be for the same name) 2699 has already been seen. 2700 Otherwise return 1 if NEWDECL is a redefinition, 2 if it is a redeclaration, 2701 and 3 if it is a conflicting declaration. */ 2702 2703static int 2704redeclaration_error_message (newdecl, olddecl) 2705 tree newdecl, olddecl; 2706{ 2707 if (TREE_CODE (newdecl) == TYPE_DECL) 2708 { 2709 if (flag_traditional && TREE_TYPE (newdecl) == TREE_TYPE (olddecl)) 2710 return 0; 2711 /* pushdecl creates distinct types for TYPE_DECLs by calling 2712 build_type_copy, so the above comparison generally fails. We do 2713 another test against the TYPE_MAIN_VARIANT of the olddecl, which 2714 is equivalent to what this code used to do before the build_type_copy 2715 call. The variant type distinction should not matter for traditional 2716 code, because it doesn't have type qualifiers. */ 2717 if (flag_traditional 2718 && TYPE_MAIN_VARIANT (TREE_TYPE (olddecl)) == TREE_TYPE (newdecl)) 2719 return 0; 2720 if (DECL_IN_SYSTEM_HEADER (olddecl) || DECL_IN_SYSTEM_HEADER (newdecl)) 2721 return 0; 2722 return 1; 2723 } 2724 else if (TREE_CODE (newdecl) == FUNCTION_DECL) 2725 { 2726 /* Declarations of functions can insist on internal linkage 2727 but they can't be inconsistent with internal linkage, 2728 so there can be no error on that account. 2729 However defining the same name twice is no good. */ 2730 if (DECL_INITIAL (olddecl) != 0 && DECL_INITIAL (newdecl) != 0 2731 /* However, defining once as extern inline and a second 2732 time in another way is ok. */ 2733 && ! (DECL_DECLARED_INLINE_P (olddecl) && DECL_EXTERNAL (olddecl) 2734 && ! (DECL_DECLARED_INLINE_P (newdecl) 2735 && DECL_EXTERNAL (newdecl)))) 2736 return 1; 2737 return 0; 2738 } 2739 else if (DECL_CONTEXT (newdecl) == NULL_TREE) 2740 { 2741 /* Objects declared at top level: */ 2742 /* If at least one is a reference, it's ok. */ 2743 if (DECL_EXTERNAL (newdecl) || DECL_EXTERNAL (olddecl)) 2744 return 0; 2745 /* Reject two definitions. */ 2746 if (DECL_INITIAL (olddecl) != 0 && DECL_INITIAL (newdecl) != 0) 2747 return 1; 2748 /* Now we have two tentative defs, or one tentative and one real def. */ 2749 /* Insist that the linkage match. */ 2750 if (TREE_PUBLIC (olddecl) != TREE_PUBLIC (newdecl)) 2751 return 3; 2752 return 0; 2753 } 2754 else if (current_binding_level->parm_flag 2755 && TREE_ASM_WRITTEN (olddecl) && !TREE_ASM_WRITTEN (newdecl)) 2756 return 0; 2757 else 2758 { 2759 /* Newdecl has block scope. If olddecl has block scope also, then 2760 reject two definitions, and reject a definition together with an 2761 external reference. Otherwise, it is OK, because newdecl must 2762 be an extern reference to olddecl. */ 2763 if (!(DECL_EXTERNAL (newdecl) && DECL_EXTERNAL (olddecl)) 2764 && DECL_CONTEXT (newdecl) == DECL_CONTEXT (olddecl)) 2765 return 2; 2766 return 0; 2767 } 2768} 2769 2770/* Get the LABEL_DECL corresponding to identifier ID as a label. 2771 Create one if none exists so far for the current function. 2772 This function is called for both label definitions and label references. */ 2773 2774tree 2775lookup_label (id) 2776 tree id; 2777{ 2778 tree decl = IDENTIFIER_LABEL_VALUE (id); 2779 2780 if (current_function_decl == 0) 2781 { 2782 error ("label %s referenced outside of any function", 2783 IDENTIFIER_POINTER (id)); 2784 return 0; 2785 } 2786 2787 /* Use a label already defined or ref'd with this name. */ 2788 if (decl != 0) 2789 { 2790 /* But not if it is inherited and wasn't declared to be inheritable. */ 2791 if (DECL_CONTEXT (decl) != current_function_decl 2792 && ! C_DECLARED_LABEL_FLAG (decl)) 2793 return shadow_label (id); 2794 return decl; 2795 } 2796 2797 decl = build_decl (LABEL_DECL, id, void_type_node); 2798 2799 /* A label not explicitly declared must be local to where it's ref'd. */ 2800 DECL_CONTEXT (decl) = current_function_decl; 2801 2802 DECL_MODE (decl) = VOIDmode; 2803 2804 /* Say where one reference is to the label, 2805 for the sake of the error if it is not defined. */ 2806 DECL_SOURCE_LINE (decl) = lineno; 2807 DECL_SOURCE_FILE (decl) = input_filename; 2808 2809 IDENTIFIER_LABEL_VALUE (id) = decl; 2810 2811 named_labels = tree_cons (NULL_TREE, decl, named_labels); 2812 2813 return decl; 2814} 2815 2816/* Make a label named NAME in the current function, 2817 shadowing silently any that may be inherited from containing functions 2818 or containing scopes. 2819 2820 Note that valid use, if the label being shadowed 2821 comes from another scope in the same function, 2822 requires calling declare_nonlocal_label right away. */ 2823 2824tree 2825shadow_label (name) 2826 tree name; 2827{ 2828 tree decl = IDENTIFIER_LABEL_VALUE (name); 2829 2830 if (decl != 0) 2831 { 2832 tree dup; 2833 2834 /* Check to make sure that the label hasn't already been declared 2835 at this label scope */ 2836 for (dup = named_labels; dup; dup = TREE_CHAIN (dup)) 2837 if (TREE_VALUE (dup) == decl) 2838 { 2839 error ("duplicate label declaration `%s'", 2840 IDENTIFIER_POINTER (name)); 2841 error_with_decl (TREE_VALUE (dup), 2842 "this is a previous declaration"); 2843 /* Just use the previous declaration. */ 2844 return lookup_label (name); 2845 } 2846 2847 shadowed_labels = tree_cons (NULL_TREE, decl, shadowed_labels); 2848 IDENTIFIER_LABEL_VALUE (name) = decl = 0; 2849 } 2850 2851 return lookup_label (name); 2852} 2853 2854/* Define a label, specifying the location in the source file. 2855 Return the LABEL_DECL node for the label, if the definition is valid. 2856 Otherwise return 0. */ 2857 2858tree 2859define_label (filename, line, name) 2860 const char *filename; 2861 int line; 2862 tree name; 2863{ 2864 tree decl = lookup_label (name); 2865 2866 /* If label with this name is known from an outer context, shadow it. */ 2867 if (decl != 0 && DECL_CONTEXT (decl) != current_function_decl) 2868 { 2869 shadowed_labels = tree_cons (NULL_TREE, decl, shadowed_labels); 2870 IDENTIFIER_LABEL_VALUE (name) = 0; 2871 decl = lookup_label (name); 2872 } 2873 2874 if (warn_traditional && !in_system_header && lookup_name (name)) 2875 warning_with_file_and_line (filename, line, 2876 "traditional C lacks a separate namespace for labels, identifier `%s' conflicts", 2877 IDENTIFIER_POINTER (name)); 2878 2879 if (DECL_INITIAL (decl) != 0) 2880 { 2881 error_with_file_and_line (filename, line, "duplicate label `%s'", 2882 IDENTIFIER_POINTER (name)); 2883 return 0; 2884 } 2885 else 2886 { 2887 /* Mark label as having been defined. */ 2888 DECL_INITIAL (decl) = error_mark_node; 2889 /* Say where in the source. */ 2890 DECL_SOURCE_FILE (decl) = filename; 2891 DECL_SOURCE_LINE (decl) = line; 2892 return decl; 2893 } 2894} 2895 2896/* Return the list of declarations of the current level. 2897 Note that this list is in reverse order unless/until 2898 you nreverse it; and when you do nreverse it, you must 2899 store the result back using `storedecls' or you will lose. */ 2900 2901tree 2902getdecls () 2903{ 2904 return current_binding_level->names; 2905} 2906 2907/* Return the list of type-tags (for structs, etc) of the current level. */ 2908 2909tree 2910gettags () 2911{ 2912 return current_binding_level->tags; 2913} 2914 2915/* Store the list of declarations of the current level. 2916 This is done for the parameter declarations of a function being defined, 2917 after they are modified in the light of any missing parameters. */ 2918 2919static void 2920storedecls (decls) 2921 tree decls; 2922{ 2923 current_binding_level->names = decls; 2924} 2925 2926/* Similarly, store the list of tags of the current level. */ 2927 2928static void 2929storetags (tags) 2930 tree tags; 2931{ 2932 current_binding_level->tags = tags; 2933} 2934 2935/* Given NAME, an IDENTIFIER_NODE, 2936 return the structure (or union or enum) definition for that name. 2937 Searches binding levels from BINDING_LEVEL up to the global level. 2938 If THISLEVEL_ONLY is nonzero, searches only the specified context 2939 (but skips any tag-transparent contexts to find one that is 2940 meaningful for tags). 2941 CODE says which kind of type the caller wants; 2942 it is RECORD_TYPE or UNION_TYPE or ENUMERAL_TYPE. 2943 If the wrong kind of type is found, an error is reported. */ 2944 2945static tree 2946lookup_tag (code, name, binding_level, thislevel_only) 2947 enum tree_code code; 2948 struct binding_level *binding_level; 2949 tree name; 2950 int thislevel_only; 2951{ 2952 struct binding_level *level; 2953 int thislevel = 1; 2954 2955 for (level = binding_level; level; level = level->level_chain) 2956 { 2957 tree tail; 2958 for (tail = level->tags; tail; tail = TREE_CHAIN (tail)) 2959 { 2960 if (TREE_PURPOSE (tail) == name) 2961 { 2962 if (TREE_CODE (TREE_VALUE (tail)) != code) 2963 { 2964 /* Definition isn't the kind we were looking for. */ 2965 pending_invalid_xref = name; 2966 pending_invalid_xref_file = input_filename; 2967 pending_invalid_xref_line = lineno; 2968 /* If in the same binding level as a declaration as a tag 2969 of a different type, this must not be allowed to 2970 shadow that tag, so give the error immediately. 2971 (For example, "struct foo; union foo;" is invalid.) */ 2972 if (thislevel) 2973 pending_xref_error (); 2974 } 2975 return TREE_VALUE (tail); 2976 } 2977 } 2978 if (! level->tag_transparent) 2979 { 2980 if (thislevel_only) 2981 return NULL_TREE; 2982 thislevel = 0; 2983 } 2984 } 2985 return NULL_TREE; 2986} 2987 2988/* Print an error message now 2989 for a recent invalid struct, union or enum cross reference. 2990 We don't print them immediately because they are not invalid 2991 when used in the `struct foo;' construct for shadowing. */ 2992 2993void 2994pending_xref_error () 2995{ 2996 if (pending_invalid_xref != 0) 2997 error_with_file_and_line (pending_invalid_xref_file, 2998 pending_invalid_xref_line, 2999 "`%s' defined as wrong kind of tag", 3000 IDENTIFIER_POINTER (pending_invalid_xref)); 3001 pending_invalid_xref = 0; 3002} 3003 3004/* Given a type, find the tag that was defined for it and return the tag name. 3005 Otherwise return 0. */ 3006 3007static tree 3008lookup_tag_reverse (type) 3009 tree type; 3010{ 3011 struct binding_level *level; 3012 3013 for (level = current_binding_level; level; level = level->level_chain) 3014 { 3015 tree tail; 3016 for (tail = level->tags; tail; tail = TREE_CHAIN (tail)) 3017 { 3018 if (TREE_VALUE (tail) == type) 3019 return TREE_PURPOSE (tail); 3020 } 3021 } 3022 return NULL_TREE; 3023} 3024 3025/* Look up NAME in the current binding level and its superiors 3026 in the namespace of variables, functions and typedefs. 3027 Return a ..._DECL node of some kind representing its definition, 3028 or return 0 if it is undefined. */ 3029 3030tree 3031lookup_name (name) 3032 tree name; 3033{ 3034 tree val; 3035 3036 if (current_binding_level != global_binding_level 3037 && IDENTIFIER_LOCAL_VALUE (name)) 3038 val = IDENTIFIER_LOCAL_VALUE (name); 3039 else 3040 val = IDENTIFIER_GLOBAL_VALUE (name); 3041 return val; 3042} 3043 3044/* Similar to `lookup_name' but look only at current binding level. */ 3045 3046tree 3047lookup_name_current_level (name) 3048 tree name; 3049{ 3050 tree t; 3051 3052 if (current_binding_level == global_binding_level) 3053 return IDENTIFIER_GLOBAL_VALUE (name); 3054 3055 if (IDENTIFIER_LOCAL_VALUE (name) == 0) 3056 return 0; 3057 3058 for (t = current_binding_level->names; t; t = TREE_CHAIN (t)) 3059 if (DECL_NAME (t) == name) 3060 break; 3061 3062 return t; 3063} 3064 3065/* Mark ARG for GC. */ 3066 3067static void 3068mark_binding_level (arg) 3069 void *arg; 3070{ 3071 struct binding_level *level = *(struct binding_level **) arg; 3072 3073 for (; level != 0; level = level->level_chain) 3074 { 3075 ggc_mark_tree (level->names); 3076 ggc_mark_tree (level->tags); 3077 ggc_mark_tree (level->shadowed); 3078 ggc_mark_tree (level->blocks); 3079 ggc_mark_tree (level->this_block); 3080 ggc_mark_tree (level->parm_order); 3081 } 3082} 3083 3084/* Create the predefined scalar types of C, 3085 and some nodes representing standard constants (0, 1, (void *) 0). 3086 Initialize the global binding level. 3087 Make definitions for built-in primitive functions. */ 3088 3089void 3090c_init_decl_processing () 3091{ 3092 tree endlink; 3093 tree ptr_ftype_void, ptr_ftype_ptr; 3094 3095 /* Adds some ggc roots, and reserved words for c-parse.in. */ 3096 c_parse_init (); 3097 3098 current_function_decl = NULL; 3099 named_labels = NULL; 3100 current_binding_level = NULL_BINDING_LEVEL; 3101 free_binding_level = NULL_BINDING_LEVEL; 3102 3103 /* Make the binding_level structure for global names. */ 3104 pushlevel (0); 3105 global_binding_level = current_binding_level; 3106 3107 build_common_tree_nodes (flag_signed_char); 3108 3109 c_common_nodes_and_builtins (); 3110 3111 boolean_type_node = integer_type_node; 3112 boolean_true_node = integer_one_node; 3113 boolean_false_node = integer_zero_node; 3114 3115 c_bool_type_node = make_unsigned_type (BOOL_TYPE_SIZE); 3116 TREE_SET_CODE (c_bool_type_node, BOOLEAN_TYPE); 3117 TYPE_MAX_VALUE (c_bool_type_node) = build_int_2 (1, 0); 3118 TREE_TYPE (TYPE_MAX_VALUE (c_bool_type_node)) = c_bool_type_node; 3119 TYPE_PRECISION (c_bool_type_node) = 1; 3120 pushdecl (build_decl (TYPE_DECL, get_identifier ("_Bool"), 3121 c_bool_type_node)); 3122 c_bool_false_node = build_int_2 (0, 0); 3123 TREE_TYPE (c_bool_false_node) = c_bool_type_node; 3124 c_bool_true_node = build_int_2 (1, 0); 3125 TREE_TYPE (c_bool_true_node) = c_bool_type_node; 3126 3127 endlink = void_list_node; 3128 ptr_ftype_void = build_function_type (ptr_type_node, endlink); 3129 ptr_ftype_ptr 3130 = build_function_type (ptr_type_node, 3131 tree_cons (NULL_TREE, ptr_type_node, endlink)); 3132 3133 /* Types which are common to the fortran compiler and libf2c. When 3134 changing these, you also need to be concerned with f/com.h. */ 3135 3136 if (TYPE_PRECISION (float_type_node) 3137 == TYPE_PRECISION (long_integer_type_node)) 3138 { 3139 g77_integer_type_node = long_integer_type_node; 3140 g77_uinteger_type_node = long_unsigned_type_node; 3141 } 3142 else if (TYPE_PRECISION (float_type_node) 3143 == TYPE_PRECISION (integer_type_node)) 3144 { 3145 g77_integer_type_node = integer_type_node; 3146 g77_uinteger_type_node = unsigned_type_node; 3147 } 3148 else 3149 g77_integer_type_node = g77_uinteger_type_node = NULL_TREE; 3150 3151 if (g77_integer_type_node != NULL_TREE) 3152 { 3153 pushdecl (build_decl (TYPE_DECL, get_identifier ("__g77_integer"), 3154 g77_integer_type_node)); 3155 pushdecl (build_decl (TYPE_DECL, get_identifier ("__g77_uinteger"), 3156 g77_uinteger_type_node)); 3157 } 3158 3159 if (TYPE_PRECISION (float_type_node) * 2 3160 == TYPE_PRECISION (long_integer_type_node)) 3161 { 3162 g77_longint_type_node = long_integer_type_node; 3163 g77_ulongint_type_node = long_unsigned_type_node; 3164 } 3165 else if (TYPE_PRECISION (float_type_node) * 2 3166 == TYPE_PRECISION (long_long_integer_type_node)) 3167 { 3168 g77_longint_type_node = long_long_integer_type_node; 3169 g77_ulongint_type_node = long_long_unsigned_type_node; 3170 } 3171 else 3172 g77_longint_type_node = g77_ulongint_type_node = NULL_TREE; 3173 3174 if (g77_longint_type_node != NULL_TREE) 3175 { 3176 pushdecl (build_decl (TYPE_DECL, get_identifier ("__g77_longint"), 3177 g77_longint_type_node)); 3178 pushdecl (build_decl (TYPE_DECL, get_identifier ("__g77_ulongint"), 3179 g77_ulongint_type_node)); 3180 } 3181 3182 pedantic_lvalues = pedantic; 3183 3184 make_fname_decl = c_make_fname_decl; 3185 start_fname_decls (); 3186 3187 incomplete_decl_finalize_hook = finish_incomplete_decl; 3188 3189 /* Record our roots. */ 3190 3191 ggc_add_tree_root (c_global_trees, CTI_MAX); 3192 ggc_add_root (&c_stmt_tree, 1, sizeof c_stmt_tree, mark_stmt_tree); 3193 ggc_add_tree_root (&c_scope_stmt_stack, 1); 3194 ggc_add_tree_root (&named_labels, 1); 3195 ggc_add_tree_root (&shadowed_labels, 1); 3196 ggc_add_root (¤t_binding_level, 1, sizeof current_binding_level, 3197 mark_binding_level); 3198 ggc_add_root (&label_level_chain, 1, sizeof label_level_chain, 3199 mark_binding_level); 3200 ggc_add_tree_root (&static_ctors, 1); 3201 ggc_add_tree_root (&static_dtors, 1); 3202} 3203 3204/* Create the VAR_DECL for __FUNCTION__ etc. ID is the name to give the 3205 decl, NAME is the initialization string and TYPE_DEP indicates whether 3206 NAME depended on the type of the function. As we don't yet implement 3207 delayed emission of static data, we mark the decl as emitted 3208 so it is not placed in the output. Anything using it must therefore pull 3209 out the STRING_CST initializer directly. This does mean that these names 3210 are string merging candidates, which is wrong for C99's __func__. FIXME. */ 3211 3212static tree 3213c_make_fname_decl (id, type_dep) 3214 tree id; 3215 int type_dep; 3216{ 3217 const char *name = fname_as_string (type_dep); 3218 tree decl, type, init; 3219 size_t length = strlen (name); 3220 3221 type = build_array_type 3222 (build_qualified_type (char_type_node, TYPE_QUAL_CONST), 3223 build_index_type (size_int (length))); 3224 3225 decl = build_decl (VAR_DECL, id, type); 3226 /* We don't push the decl, so have to set its context here. */ 3227 DECL_CONTEXT (decl) = current_function_decl; 3228 3229 TREE_STATIC (decl) = 1; 3230 TREE_READONLY (decl) = 1; 3231 DECL_ARTIFICIAL (decl) = 1; 3232 3233 init = build_string (length + 1, name); 3234 TREE_TYPE (init) = type; 3235 DECL_INITIAL (decl) = init; 3236 3237 TREE_USED (decl) = 1; 3238 3239 finish_decl (decl, init, NULL_TREE); 3240 3241 return decl; 3242} 3243 3244/* Return a definition for a builtin function named NAME and whose data type 3245 is TYPE. TYPE should be a function type with argument types. 3246 FUNCTION_CODE tells later passes how to compile calls to this function. 3247 See tree.h for its possible values. 3248 3249 If LIBRARY_NAME is nonzero, use that for DECL_ASSEMBLER_NAME, 3250 the name to be called if we can't opencode the function. */ 3251 3252tree 3253builtin_function (name, type, function_code, class, library_name) 3254 const char *name; 3255 tree type; 3256 int function_code; 3257 enum built_in_class class; 3258 const char *library_name; 3259{ 3260 tree decl = build_decl (FUNCTION_DECL, get_identifier (name), type); 3261 DECL_EXTERNAL (decl) = 1; 3262 TREE_PUBLIC (decl) = 1; 3263 /* If -traditional, permit redefining a builtin function any way you like. 3264 (Though really, if the program redefines these functions, 3265 it probably won't work right unless compiled with -fno-builtin.) */ 3266 if (flag_traditional && name[0] != '_') 3267 DECL_BUILT_IN_NONANSI (decl) = 1; 3268 if (library_name) 3269 SET_DECL_ASSEMBLER_NAME (decl, get_identifier (library_name)); 3270 make_decl_rtl (decl, NULL); 3271 pushdecl (decl); 3272 DECL_BUILT_IN_CLASS (decl) = class; 3273 DECL_FUNCTION_CODE (decl) = function_code; 3274 3275 /* The return builtins leave the current function. */ 3276 if (function_code == BUILT_IN_RETURN || function_code == BUILT_IN_EH_RETURN) 3277 TREE_THIS_VOLATILE (decl) = 1; 3278 3279 /* Warn if a function in the namespace for users 3280 is used without an occasion to consider it declared. */ 3281 if (name[0] != '_' || name[1] != '_') 3282 C_DECL_ANTICIPATED (decl) = 1; 3283 3284 /* Possibly apply some default attributes to this built-in function. */ 3285 decl_attributes (&decl, NULL_TREE, 0); 3286 3287 return decl; 3288} 3289 3290/* Apply default attributes to a function, if a system function with default 3291 attributes. */ 3292 3293void 3294insert_default_attributes (decl) 3295 tree decl; 3296{ 3297 if (!TREE_PUBLIC (decl)) 3298 return; 3299 c_common_insert_default_attributes (decl); 3300} 3301 3302/* Called when a declaration is seen that contains no names to declare. 3303 If its type is a reference to a structure, union or enum inherited 3304 from a containing scope, shadow that tag name for the current scope 3305 with a forward reference. 3306 If its type defines a new named structure or union 3307 or defines an enum, it is valid but we need not do anything here. 3308 Otherwise, it is an error. */ 3309 3310void 3311shadow_tag (declspecs) 3312 tree declspecs; 3313{ 3314 shadow_tag_warned (declspecs, 0); 3315} 3316 3317void 3318shadow_tag_warned (declspecs, warned) 3319 tree declspecs; 3320 int warned; 3321 /* 1 => we have done a pedwarn. 2 => we have done a warning, but 3322 no pedwarn. */ 3323{ 3324 int found_tag = 0; 3325 tree link; 3326 tree specs, attrs; 3327 3328 pending_invalid_xref = 0; 3329 3330 /* Remove the attributes from declspecs, since they will confuse the 3331 following code. */ 3332 split_specs_attrs (declspecs, &specs, &attrs); 3333 3334 for (link = specs; link; link = TREE_CHAIN (link)) 3335 { 3336 tree value = TREE_VALUE (link); 3337 enum tree_code code = TREE_CODE (value); 3338 3339 if (code == RECORD_TYPE || code == UNION_TYPE || code == ENUMERAL_TYPE) 3340 /* Used to test also that TYPE_SIZE (value) != 0. 3341 That caused warning for `struct foo;' at top level in the file. */ 3342 { 3343 tree name = lookup_tag_reverse (value); 3344 tree t; 3345 3346 found_tag++; 3347 3348 if (name == 0) 3349 { 3350 if (warned != 1 && code != ENUMERAL_TYPE) 3351 /* Empty unnamed enum OK */ 3352 { 3353 pedwarn ("unnamed struct/union that defines no instances"); 3354 warned = 1; 3355 } 3356 } 3357 else 3358 { 3359 t = lookup_tag (code, name, current_binding_level, 1); 3360 3361 if (t == 0) 3362 { 3363 t = make_node (code); 3364 pushtag (name, t); 3365 } 3366 } 3367 } 3368 else 3369 { 3370 if (!warned && ! in_system_header) 3371 { 3372 warning ("useless keyword or type name in empty declaration"); 3373 warned = 2; 3374 } 3375 } 3376 } 3377 3378 if (found_tag > 1) 3379 error ("two types specified in one empty declaration"); 3380 3381 if (warned != 1) 3382 { 3383 if (found_tag == 0) 3384 pedwarn ("empty declaration"); 3385 } 3386} 3387 3388/* Construct an array declarator. EXPR is the expression inside [], or 3389 NULL_TREE. QUALS are the type qualifiers inside the [] (to be applied 3390 to the pointer to which a parameter array is converted). STATIC_P is 3391 non-zero if "static" is inside the [], zero otherwise. VLA_UNSPEC_P 3392 is non-zero is the array is [*], a VLA of unspecified length which is 3393 nevertheless a complete type (not currently implemented by GCC), 3394 zero otherwise. The declarator is constructed as an ARRAY_REF 3395 (to be decoded by grokdeclarator), whose operand 0 is what's on the 3396 left of the [] (filled by in set_array_declarator_type) and operand 1 3397 is the expression inside; whose TREE_TYPE is the type qualifiers and 3398 which has TREE_STATIC set if "static" is used. */ 3399 3400tree 3401build_array_declarator (expr, quals, static_p, vla_unspec_p) 3402 tree expr; 3403 tree quals; 3404 int static_p; 3405 int vla_unspec_p; 3406{ 3407 tree decl; 3408 decl = build_nt (ARRAY_REF, NULL_TREE, expr); 3409 TREE_TYPE (decl) = quals; 3410 TREE_STATIC (decl) = (static_p ? 1 : 0); 3411 if (pedantic && !flag_isoc99) 3412 { 3413 if (static_p || quals != NULL_TREE) 3414 pedwarn ("ISO C89 does not support `static' or type qualifiers in parameter array declarators"); 3415 if (vla_unspec_p) 3416 pedwarn ("ISO C89 does not support `[*]' array declarators"); 3417 } 3418 if (vla_unspec_p) 3419 warning ("GCC does not yet properly implement `[*]' array declarators"); 3420 return decl; 3421} 3422 3423/* Set the type of an array declarator. DECL is the declarator, as 3424 constructed by build_array_declarator; TYPE is what appears on the left 3425 of the [] and goes in operand 0. ABSTRACT_P is non-zero if it is an 3426 abstract declarator, zero otherwise; this is used to reject static and 3427 type qualifiers in abstract declarators, where they are not in the 3428 C99 grammar. */ 3429 3430tree 3431set_array_declarator_type (decl, type, abstract_p) 3432 tree decl; 3433 tree type; 3434 int abstract_p; 3435{ 3436 TREE_OPERAND (decl, 0) = type; 3437 if (abstract_p && (TREE_TYPE (decl) != NULL_TREE || TREE_STATIC (decl))) 3438 error ("static or type qualifiers in abstract declarator"); 3439 return decl; 3440} 3441 3442/* Decode a "typename", such as "int **", returning a ..._TYPE node. */ 3443 3444tree 3445groktypename (typename) 3446 tree typename; 3447{ 3448 tree specs, attrs; 3449 3450 if (TREE_CODE (typename) != TREE_LIST) 3451 return typename; 3452 3453 split_specs_attrs (TREE_PURPOSE (typename), &specs, &attrs); 3454 3455 typename = grokdeclarator (TREE_VALUE (typename), specs, TYPENAME, 0); 3456 3457 /* Apply attributes. */ 3458 decl_attributes (&typename, attrs, 0); 3459 3460 return typename; 3461} 3462 3463/* Return a PARM_DECL node for a given pair of specs and declarator. */ 3464 3465tree 3466groktypename_in_parm_context (typename) 3467 tree typename; 3468{ 3469 if (TREE_CODE (typename) != TREE_LIST) 3470 return typename; 3471 return grokdeclarator (TREE_VALUE (typename), 3472 TREE_PURPOSE (typename), 3473 PARM, 0); 3474} 3475 3476/* Decode a declarator in an ordinary declaration or data definition. 3477 This is called as soon as the type information and variable name 3478 have been parsed, before parsing the initializer if any. 3479 Here we create the ..._DECL node, fill in its type, 3480 and put it on the list of decls for the current context. 3481 The ..._DECL node is returned as the value. 3482 3483 Exception: for arrays where the length is not specified, 3484 the type is left null, to be filled in by `finish_decl'. 3485 3486 Function definitions do not come here; they go to start_function 3487 instead. However, external and forward declarations of functions 3488 do go through here. Structure field declarations are done by 3489 grokfield and not through here. */ 3490 3491tree 3492start_decl (declarator, declspecs, initialized, attributes) 3493 tree declarator, declspecs; 3494 int initialized; 3495 tree attributes; 3496{ 3497 tree decl; 3498 tree tem; 3499 3500 /* An object declared as __attribute__((deprecated)) suppresses 3501 warnings of uses of other deprecated items. */ 3502 if (lookup_attribute ("deprecated", attributes)) 3503 deprecated_state = DEPRECATED_SUPPRESS; 3504 3505 decl = grokdeclarator (declarator, declspecs, 3506 NORMAL, initialized); 3507 3508 deprecated_state = DEPRECATED_NORMAL; 3509 3510 if (warn_main > 0 && TREE_CODE (decl) != FUNCTION_DECL 3511 && MAIN_NAME_P (DECL_NAME (decl))) 3512 warning_with_decl (decl, "`%s' is usually a function"); 3513 3514 if (initialized) 3515 /* Is it valid for this decl to have an initializer at all? 3516 If not, set INITIALIZED to zero, which will indirectly 3517 tell `finish_decl' to ignore the initializer once it is parsed. */ 3518 switch (TREE_CODE (decl)) 3519 { 3520 case TYPE_DECL: 3521 error ("typedef `%s' is initialized", 3522 IDENTIFIER_POINTER (DECL_NAME (decl))); 3523 initialized = 0; 3524 break; 3525 3526 case FUNCTION_DECL: 3527 error ("function `%s' is initialized like a variable", 3528 IDENTIFIER_POINTER (DECL_NAME (decl))); 3529 initialized = 0; 3530 break; 3531 3532 case PARM_DECL: 3533 /* DECL_INITIAL in a PARM_DECL is really DECL_ARG_TYPE. */ 3534 error ("parameter `%s' is initialized", 3535 IDENTIFIER_POINTER (DECL_NAME (decl))); 3536 initialized = 0; 3537 break; 3538 3539 default: 3540 /* Don't allow initializations for incomplete types 3541 except for arrays which might be completed by the initialization. */ 3542 3543 /* This can happen if the array size is an undefined macro. We already 3544 gave a warning, so we don't need another one. */ 3545 if (TREE_TYPE (decl) == error_mark_node) 3546 initialized = 0; 3547 else if (COMPLETE_TYPE_P (TREE_TYPE (decl))) 3548 { 3549 /* A complete type is ok if size is fixed. */ 3550 3551 if (TREE_CODE (TYPE_SIZE (TREE_TYPE (decl))) != INTEGER_CST 3552 || C_DECL_VARIABLE_SIZE (decl)) 3553 { 3554 error ("variable-sized object may not be initialized"); 3555 initialized = 0; 3556 } 3557 } 3558 else if (TREE_CODE (TREE_TYPE (decl)) != ARRAY_TYPE) 3559 { 3560 error ("variable `%s' has initializer but incomplete type", 3561 IDENTIFIER_POINTER (DECL_NAME (decl))); 3562 initialized = 0; 3563 } 3564 else if (!COMPLETE_TYPE_P (TREE_TYPE (TREE_TYPE (decl)))) 3565 { 3566 error ("elements of array `%s' have incomplete type", 3567 IDENTIFIER_POINTER (DECL_NAME (decl))); 3568 initialized = 0; 3569 } 3570 } 3571 3572 if (initialized) 3573 { 3574#if 0 3575 /* Seems redundant with grokdeclarator. */ 3576 if (current_binding_level != global_binding_level 3577 && DECL_EXTERNAL (decl) 3578 && TREE_CODE (decl) != FUNCTION_DECL) 3579 warning ("declaration of `%s' has `extern' and is initialized", 3580 IDENTIFIER_POINTER (DECL_NAME (decl))); 3581#endif 3582 DECL_EXTERNAL (decl) = 0; 3583 if (current_binding_level == global_binding_level) 3584 TREE_STATIC (decl) = 1; 3585 3586 /* Tell `pushdecl' this is an initialized decl 3587 even though we don't yet have the initializer expression. 3588 Also tell `finish_decl' it may store the real initializer. */ 3589 DECL_INITIAL (decl) = error_mark_node; 3590 } 3591 3592 /* If this is a function declaration, write a record describing it to the 3593 prototypes file (if requested). */ 3594 3595 if (TREE_CODE (decl) == FUNCTION_DECL) 3596 gen_aux_info_record (decl, 0, 0, TYPE_ARG_TYPES (TREE_TYPE (decl)) != 0); 3597 3598 /* ANSI specifies that a tentative definition which is not merged with 3599 a non-tentative definition behaves exactly like a definition with an 3600 initializer equal to zero. (Section 3.7.2) 3601 -fno-common gives strict ANSI behavior. Usually you don't want it. 3602 This matters only for variables with external linkage. */ 3603 if (! flag_no_common || ! TREE_PUBLIC (decl)) 3604 DECL_COMMON (decl) = 1; 3605 3606 /* Set attributes here so if duplicate decl, will have proper attributes. */ 3607 decl_attributes (&decl, attributes, 0); 3608 3609 /* If #pragma weak was used, mark the decl weak now. */ 3610 if (current_binding_level == global_binding_level) 3611 maybe_apply_pragma_weak (decl); 3612 3613 if (TREE_CODE (decl) == FUNCTION_DECL 3614 && DECL_DECLARED_INLINE_P (decl) 3615 && DECL_UNINLINABLE (decl) 3616 && lookup_attribute ("noinline", DECL_ATTRIBUTES (decl))) 3617 warning_with_decl (decl, 3618 "inline function `%s' given attribute noinline"); 3619 3620 /* Add this decl to the current binding level. 3621 TEM may equal DECL or it may be a previous decl of the same name. */ 3622 tem = pushdecl (decl); 3623 3624 /* For a local variable, define the RTL now. */ 3625 if (current_binding_level != global_binding_level 3626 /* But not if this is a duplicate decl 3627 and we preserved the rtl from the previous one 3628 (which may or may not happen). */ 3629 && !DECL_RTL_SET_P (tem) 3630 && !DECL_CONTEXT (tem)) 3631 { 3632 if (TREE_TYPE (tem) != error_mark_node 3633 && COMPLETE_TYPE_P (TREE_TYPE (tem))) 3634 expand_decl (tem); 3635 else if (TREE_CODE (TREE_TYPE (tem)) == ARRAY_TYPE 3636 && DECL_INITIAL (tem) != 0) 3637 expand_decl (tem); 3638 } 3639 3640 return tem; 3641} 3642 3643/* Finish processing of a declaration; 3644 install its initial value. 3645 If the length of an array type is not known before, 3646 it must be determined now, from the initial value, or it is an error. */ 3647 3648void 3649finish_decl (decl, init, asmspec_tree) 3650 tree decl, init; 3651 tree asmspec_tree; 3652{ 3653 tree type = TREE_TYPE (decl); 3654 int was_incomplete = (DECL_SIZE (decl) == 0); 3655 const char *asmspec = 0; 3656 3657 /* If a name was specified, get the string. */ 3658 if (current_binding_level == global_binding_level) 3659 asmspec_tree = maybe_apply_renaming_pragma (decl, asmspec_tree); 3660 if (asmspec_tree) 3661 asmspec = TREE_STRING_POINTER (asmspec_tree); 3662 3663 /* If `start_decl' didn't like having an initialization, ignore it now. */ 3664 if (init != 0 && DECL_INITIAL (decl) == 0) 3665 init = 0; 3666 3667 /* Don't crash if parm is initialized. */ 3668 if (TREE_CODE (decl) == PARM_DECL) 3669 init = 0; 3670 3671 if (init) 3672 store_init_value (decl, init); 3673 3674 /* Deduce size of array from initialization, if not already known */ 3675 if (TREE_CODE (type) == ARRAY_TYPE 3676 && TYPE_DOMAIN (type) == 0 3677 && TREE_CODE (decl) != TYPE_DECL) 3678 { 3679 int do_default 3680 = (TREE_STATIC (decl) 3681 /* Even if pedantic, an external linkage array 3682 may have incomplete type at first. */ 3683 ? pedantic && !TREE_PUBLIC (decl) 3684 : !DECL_EXTERNAL (decl)); 3685 int failure 3686 = complete_array_type (type, DECL_INITIAL (decl), do_default); 3687 3688 /* Get the completed type made by complete_array_type. */ 3689 type = TREE_TYPE (decl); 3690 3691 if (failure == 1) 3692 error_with_decl (decl, "initializer fails to determine size of `%s'"); 3693 3694 else if (failure == 2) 3695 { 3696 if (do_default) 3697 error_with_decl (decl, "array size missing in `%s'"); 3698 /* If a `static' var's size isn't known, 3699 make it extern as well as static, so it does not get 3700 allocated. 3701 If it is not `static', then do not mark extern; 3702 finish_incomplete_decl will give it a default size 3703 and it will get allocated. */ 3704 else if (!pedantic && TREE_STATIC (decl) && ! TREE_PUBLIC (decl)) 3705 DECL_EXTERNAL (decl) = 1; 3706 } 3707 3708 /* TYPE_MAX_VALUE is always one less than the number of elements 3709 in the array, because we start counting at zero. Therefore, 3710 warn only if the value is less than zero. */ 3711 else if (pedantic && TYPE_DOMAIN (type) != 0 3712 && tree_int_cst_sgn (TYPE_MAX_VALUE (TYPE_DOMAIN (type))) < 0) 3713 error_with_decl (decl, "zero or negative size array `%s'"); 3714 3715 layout_decl (decl, 0); 3716 } 3717 3718 if (TREE_CODE (decl) == VAR_DECL) 3719 { 3720 if (DECL_SIZE (decl) == 0 && TREE_TYPE (decl) != error_mark_node 3721 && COMPLETE_TYPE_P (TREE_TYPE (decl))) 3722 layout_decl (decl, 0); 3723 3724 if (DECL_SIZE (decl) == 0 3725 /* Don't give an error if we already gave one earlier. */ 3726 && TREE_TYPE (decl) != error_mark_node 3727 && (TREE_STATIC (decl) 3728 ? 3729 /* A static variable with an incomplete type 3730 is an error if it is initialized. 3731 Also if it is not file scope. 3732 Otherwise, let it through, but if it is not `extern' 3733 then it may cause an error message later. */ 3734 (DECL_INITIAL (decl) != 0 3735 || DECL_CONTEXT (decl) != 0) 3736 : 3737 /* An automatic variable with an incomplete type 3738 is an error. */ 3739 !DECL_EXTERNAL (decl))) 3740 { 3741 error_with_decl (decl, "storage size of `%s' isn't known"); 3742 TREE_TYPE (decl) = error_mark_node; 3743 } 3744 3745 if ((DECL_EXTERNAL (decl) || TREE_STATIC (decl)) 3746 && DECL_SIZE (decl) != 0) 3747 { 3748 if (TREE_CODE (DECL_SIZE (decl)) == INTEGER_CST) 3749 constant_expression_warning (DECL_SIZE (decl)); 3750 else 3751 error_with_decl (decl, "storage size of `%s' isn't constant"); 3752 } 3753 3754 if (TREE_USED (type)) 3755 TREE_USED (decl) = 1; 3756 } 3757 3758 /* If this is a function and an assembler name is specified, it isn't 3759 builtin any more. Also reset DECL_RTL so we can give it its new 3760 name. */ 3761 if (TREE_CODE (decl) == FUNCTION_DECL && asmspec) 3762 { 3763 DECL_BUILT_IN_CLASS (decl) = NOT_BUILT_IN; 3764 SET_DECL_RTL (decl, NULL_RTX); 3765 SET_DECL_ASSEMBLER_NAME (decl, get_identifier (asmspec)); 3766 } 3767 3768 /* Output the assembler code and/or RTL code for variables and functions, 3769 unless the type is an undefined structure or union. 3770 If not, it will get done when the type is completed. */ 3771 3772 if (TREE_CODE (decl) == VAR_DECL || TREE_CODE (decl) == FUNCTION_DECL) 3773 { 3774 /* This is a no-op in c-lang.c or something real in objc-actions.c. */ 3775 maybe_objc_check_decl (decl); 3776 3777 if (!DECL_CONTEXT (decl)) 3778 { 3779 if (DECL_INITIAL (decl) == NULL_TREE 3780 || DECL_INITIAL (decl) == error_mark_node) 3781 /* Don't output anything 3782 when a tentative file-scope definition is seen. 3783 But at end of compilation, do output code for them. */ 3784 DECL_DEFER_OUTPUT (decl) = 1; 3785 rest_of_decl_compilation (decl, asmspec, 3786 (DECL_CONTEXT (decl) == 0 3787 || TREE_ASM_WRITTEN (decl)), 0); 3788 } 3789 else 3790 { 3791 /* This is a local variable. If there is an ASMSPEC, the 3792 user has requested that we handle it specially. */ 3793 if (asmspec) 3794 { 3795 /* In conjunction with an ASMSPEC, the `register' 3796 keyword indicates that we should place the variable 3797 in a particular register. */ 3798 if (DECL_REGISTER (decl)) 3799 DECL_C_HARD_REGISTER (decl) = 1; 3800 3801 /* If this is not a static variable, issue a warning. 3802 It doesn't make any sense to give an ASMSPEC for an 3803 ordinary, non-register local variable. Historically, 3804 GCC has accepted -- but ignored -- the ASMSPEC in 3805 this case. */ 3806 if (TREE_CODE (decl) == VAR_DECL 3807 && !DECL_REGISTER (decl) 3808 && !TREE_STATIC (decl)) 3809 warning_with_decl (decl, 3810 "ignoring asm-specifier for non-static local variable `%s'"); 3811 else 3812 SET_DECL_ASSEMBLER_NAME (decl, get_identifier (asmspec)); 3813 } 3814 3815 if (TREE_CODE (decl) != FUNCTION_DECL) 3816 add_decl_stmt (decl); 3817 } 3818 3819 if (DECL_CONTEXT (decl) != 0) 3820 { 3821 /* Recompute the RTL of a local array now 3822 if it used to be an incomplete type. */ 3823 if (was_incomplete 3824 && ! TREE_STATIC (decl) && ! DECL_EXTERNAL (decl)) 3825 { 3826 /* If we used it already as memory, it must stay in memory. */ 3827 TREE_ADDRESSABLE (decl) = TREE_USED (decl); 3828 /* If it's still incomplete now, no init will save it. */ 3829 if (DECL_SIZE (decl) == 0) 3830 DECL_INITIAL (decl) = 0; 3831 } 3832 } 3833 } 3834 3835 if (TREE_CODE (decl) == TYPE_DECL) 3836 { 3837 /* This is a no-op in c-lang.c or something real in objc-actions.c. */ 3838 maybe_objc_check_decl (decl); 3839 rest_of_decl_compilation (decl, NULL, DECL_CONTEXT (decl) == 0, 0); 3840 } 3841 3842 /* At the end of a declaration, throw away any variable type sizes 3843 of types defined inside that declaration. There is no use 3844 computing them in the following function definition. */ 3845 if (current_binding_level == global_binding_level) 3846 get_pending_sizes (); 3847} 3848 3849/* If DECL has a cleanup, build and return that cleanup here. 3850 This is a callback called by expand_expr. */ 3851 3852tree 3853maybe_build_cleanup (decl) 3854 tree decl ATTRIBUTE_UNUSED; 3855{ 3856 /* There are no cleanups in C. */ 3857 return NULL_TREE; 3858} 3859 3860/* Given a parsed parameter declaration, 3861 decode it into a PARM_DECL and push that on the current binding level. 3862 Also, for the sake of forward parm decls, 3863 record the given order of parms in `parm_order'. */ 3864 3865void 3866push_parm_decl (parm) 3867 tree parm; 3868{ 3869 tree decl; 3870 int old_immediate_size_expand = immediate_size_expand; 3871 /* Don't try computing parm sizes now -- wait till fn is called. */ 3872 immediate_size_expand = 0; 3873 3874 decl = grokdeclarator (TREE_VALUE (TREE_PURPOSE (parm)), 3875 TREE_PURPOSE (TREE_PURPOSE (parm)), PARM, 0); 3876 decl_attributes (&decl, TREE_VALUE (parm), 0); 3877 3878#if 0 3879 if (DECL_NAME (decl)) 3880 { 3881 tree olddecl; 3882 olddecl = lookup_name (DECL_NAME (decl)); 3883 if (pedantic && olddecl != 0 && TREE_CODE (olddecl) == TYPE_DECL) 3884 pedwarn_with_decl (decl, 3885 "ISO C forbids parameter `%s' shadowing typedef"); 3886 } 3887#endif 3888 3889 decl = pushdecl (decl); 3890 3891 immediate_size_expand = old_immediate_size_expand; 3892 3893 current_binding_level->parm_order 3894 = tree_cons (NULL_TREE, decl, current_binding_level->parm_order); 3895 3896 /* Add this decl to the current binding level. */ 3897 finish_decl (decl, NULL_TREE, NULL_TREE); 3898} 3899 3900/* Clear the given order of parms in `parm_order'. 3901 Used at start of parm list, 3902 and also at semicolon terminating forward decls. */ 3903 3904void 3905clear_parm_order () 3906{ 3907 current_binding_level->parm_order = NULL_TREE; 3908} 3909 3910/* Build a COMPOUND_LITERAL_EXPR. TYPE is the type given in the compound 3911 literal, which may be an incomplete array type completed by the 3912 initializer; INIT is a CONSTRUCTOR that initializes the compound 3913 literal. */ 3914 3915tree 3916build_compound_literal (type, init) 3917 tree type; 3918 tree init; 3919{ 3920 /* We do not use start_decl here because we have a type, not a declarator; 3921 and do not use finish_decl because the decl should be stored inside 3922 the COMPOUND_LITERAL_EXPR rather than added elsewhere as a DECL_STMT. */ 3923 tree decl = build_decl (VAR_DECL, NULL_TREE, type); 3924 tree complit; 3925 tree stmt; 3926 DECL_EXTERNAL (decl) = 0; 3927 TREE_PUBLIC (decl) = 0; 3928 TREE_STATIC (decl) = (current_binding_level == global_binding_level); 3929 DECL_CONTEXT (decl) = current_function_decl; 3930 TREE_USED (decl) = 1; 3931 TREE_TYPE (decl) = type; 3932 TREE_READONLY (decl) = TREE_READONLY (type); 3933 store_init_value (decl, init); 3934 3935 if (TREE_CODE (type) == ARRAY_TYPE && !COMPLETE_TYPE_P (type)) 3936 { 3937 int failure = complete_array_type (type, DECL_INITIAL (decl), 1); 3938 if (failure) 3939 abort (); 3940 } 3941 3942 type = TREE_TYPE (decl); 3943 if (type == error_mark_node || !COMPLETE_TYPE_P (type)) 3944 return error_mark_node; 3945 3946 stmt = build_stmt (DECL_STMT, decl); 3947 complit = build1 (COMPOUND_LITERAL_EXPR, TREE_TYPE (decl), stmt); 3948 TREE_SIDE_EFFECTS (complit) = 1; 3949 3950 layout_decl (decl, 0); 3951 3952 if (TREE_STATIC (decl)) 3953 { 3954 /* This decl needs a name for the assembler output. We also need 3955 a unique suffix to be added to the name. */ 3956 char *name; 3957 extern int var_labelno; 3958 3959 ASM_FORMAT_PRIVATE_NAME (name, "__compound_literal", var_labelno); 3960 var_labelno++; 3961 DECL_NAME (decl) = get_identifier (name); 3962 DECL_DEFER_OUTPUT (decl) = 1; 3963 DECL_COMDAT (decl) = 1; 3964 DECL_ARTIFICIAL (decl) = 1; 3965 pushdecl (decl); 3966 rest_of_decl_compilation (decl, NULL, 1, 0); 3967 } 3968 3969 return complit; 3970} 3971 3972/* Make TYPE a complete type based on INITIAL_VALUE. 3973 Return 0 if successful, 1 if INITIAL_VALUE can't be deciphered, 3974 2 if there was no information (in which case assume 1 if DO_DEFAULT). */ 3975 3976int 3977complete_array_type (type, initial_value, do_default) 3978 tree type; 3979 tree initial_value; 3980 int do_default; 3981{ 3982 tree maxindex = NULL_TREE; 3983 int value = 0; 3984 3985 if (initial_value) 3986 { 3987 /* Note MAXINDEX is really the maximum index, 3988 one less than the size. */ 3989 if (TREE_CODE (initial_value) == STRING_CST) 3990 { 3991 int eltsize 3992 = int_size_in_bytes (TREE_TYPE (TREE_TYPE (initial_value))); 3993 maxindex = build_int_2 ((TREE_STRING_LENGTH (initial_value) 3994 / eltsize) - 1, 0); 3995 } 3996 else if (TREE_CODE (initial_value) == CONSTRUCTOR) 3997 { 3998 tree elts = CONSTRUCTOR_ELTS (initial_value); 3999 maxindex = build_int_2 (-1, -1); 4000 for (; elts; elts = TREE_CHAIN (elts)) 4001 { 4002 if (TREE_PURPOSE (elts)) 4003 maxindex = TREE_PURPOSE (elts); 4004 else 4005 maxindex = fold (build (PLUS_EXPR, integer_type_node, 4006 maxindex, integer_one_node)); 4007 } 4008 maxindex = copy_node (maxindex); 4009 } 4010 else 4011 { 4012 /* Make an error message unless that happened already. */ 4013 if (initial_value != error_mark_node) 4014 value = 1; 4015 4016 /* Prevent further error messages. */ 4017 maxindex = build_int_2 (0, 0); 4018 } 4019 } 4020 4021 if (!maxindex) 4022 { 4023 if (do_default) 4024 maxindex = build_int_2 (0, 0); 4025 value = 2; 4026 } 4027 4028 if (maxindex) 4029 { 4030 TYPE_DOMAIN (type) = build_index_type (maxindex); 4031 if (!TREE_TYPE (maxindex)) 4032 TREE_TYPE (maxindex) = TYPE_DOMAIN (type); 4033 } 4034 4035 /* Lay out the type now that we can get the real answer. */ 4036 4037 layout_type (type); 4038 4039 return value; 4040} 4041 4042/* Given declspecs and a declarator, 4043 determine the name and type of the object declared 4044 and construct a ..._DECL node for it. 4045 (In one case we can return a ..._TYPE node instead. 4046 For invalid input we sometimes return 0.) 4047 4048 DECLSPECS is a chain of tree_list nodes whose value fields 4049 are the storage classes and type specifiers. 4050 4051 DECL_CONTEXT says which syntactic context this declaration is in: 4052 NORMAL for most contexts. Make a VAR_DECL or FUNCTION_DECL or TYPE_DECL. 4053 FUNCDEF for a function definition. Like NORMAL but a few different 4054 error messages in each case. Return value may be zero meaning 4055 this definition is too screwy to try to parse. 4056 PARM for a parameter declaration (either within a function prototype 4057 or before a function body). Make a PARM_DECL, or return void_type_node. 4058 TYPENAME if for a typename (in a cast or sizeof). 4059 Don't make a DECL node; just return the ..._TYPE node. 4060 FIELD for a struct or union field; make a FIELD_DECL. 4061 BITFIELD for a field with specified width. 4062 INITIALIZED is 1 if the decl has an initializer. 4063 4064 In the TYPENAME case, DECLARATOR is really an absolute declarator. 4065 It may also be so in the PARM case, for a prototype where the 4066 argument type is specified but not the name. 4067 4068 This function is where the complicated C meanings of `static' 4069 and `extern' are interpreted. */ 4070 4071static tree 4072grokdeclarator (declarator, declspecs, decl_context, initialized) 4073 tree declspecs; 4074 tree declarator; 4075 enum decl_context decl_context; 4076 int initialized; 4077{ 4078 int specbits = 0; 4079 tree spec; 4080 tree type = NULL_TREE; 4081 int longlong = 0; 4082 int constp; 4083 int restrictp; 4084 int volatilep; 4085 int type_quals = TYPE_UNQUALIFIED; 4086 int inlinep; 4087 int explicit_int = 0; 4088 int explicit_char = 0; 4089 int defaulted_int = 0; 4090 tree typedef_decl = 0; 4091 const char *name; 4092 tree typedef_type = 0; 4093 int funcdef_flag = 0; 4094 enum tree_code innermost_code = ERROR_MARK; 4095 int bitfield = 0; 4096 int size_varies = 0; 4097 tree decl_attr = NULL_TREE; 4098 tree array_ptr_quals = NULL_TREE; 4099 int array_parm_static = 0; 4100 tree returned_attrs = NULL_TREE; 4101 4102 if (decl_context == BITFIELD) 4103 bitfield = 1, decl_context = FIELD; 4104 4105 if (decl_context == FUNCDEF) 4106 funcdef_flag = 1, decl_context = NORMAL; 4107 4108 /* Look inside a declarator for the name being declared 4109 and get it as a string, for an error message. */ 4110 { 4111 tree decl = declarator; 4112 name = 0; 4113 4114 while (decl) 4115 switch (TREE_CODE (decl)) 4116 { 4117 case ARRAY_REF: 4118 case INDIRECT_REF: 4119 case CALL_EXPR: 4120 innermost_code = TREE_CODE (decl); 4121 decl = TREE_OPERAND (decl, 0); 4122 break; 4123 4124 case TREE_LIST: 4125 decl = TREE_VALUE (decl); 4126 break; 4127 4128 case IDENTIFIER_NODE: 4129 name = IDENTIFIER_POINTER (decl); 4130 decl = 0; 4131 break; 4132 4133 default: 4134 abort (); 4135 } 4136 if (name == 0) 4137 name = "type name"; 4138 } 4139 4140 /* A function definition's declarator must have the form of 4141 a function declarator. */ 4142 4143 if (funcdef_flag && innermost_code != CALL_EXPR) 4144 return 0; 4145 4146 /* Anything declared one level down from the top level 4147 must be one of the parameters of a function 4148 (because the body is at least two levels down). */ 4149 4150 /* If this looks like a function definition, make it one, 4151 even if it occurs where parms are expected. 4152 Then store_parm_decls will reject it and not use it as a parm. */ 4153 if (decl_context == NORMAL && !funcdef_flag 4154 && current_binding_level->parm_flag) 4155 decl_context = PARM; 4156 4157 /* Look through the decl specs and record which ones appear. 4158 Some typespecs are defined as built-in typenames. 4159 Others, the ones that are modifiers of other types, 4160 are represented by bits in SPECBITS: set the bits for 4161 the modifiers that appear. Storage class keywords are also in SPECBITS. 4162 4163 If there is a typedef name or a type, store the type in TYPE. 4164 This includes builtin typedefs such as `int'. 4165 4166 Set EXPLICIT_INT or EXPLICIT_CHAR if the type is `int' or `char' 4167 and did not come from a user typedef. 4168 4169 Set LONGLONG if `long' is mentioned twice. */ 4170 4171 for (spec = declspecs; spec; spec = TREE_CHAIN (spec)) 4172 { 4173 tree id = TREE_VALUE (spec); 4174 4175 /* If the entire declaration is itself tagged as deprecated then 4176 suppress reports of deprecated items. */ 4177 if (id && TREE_DEPRECATED (id)) 4178 { 4179 if (deprecated_state != DEPRECATED_SUPPRESS) 4180 warn_deprecated_use (id); 4181 } 4182 4183 if (id == ridpointers[(int) RID_INT]) 4184 explicit_int = 1; 4185 if (id == ridpointers[(int) RID_CHAR]) 4186 explicit_char = 1; 4187 4188 if (TREE_CODE (id) == IDENTIFIER_NODE && C_IS_RESERVED_WORD (id)) 4189 { 4190 enum rid i = C_RID_CODE (id); 4191 if ((int) i <= (int) RID_LAST_MODIFIER) 4192 { 4193 if (i == RID_LONG && (specbits & (1 << (int) i))) 4194 { 4195 if (longlong) 4196 error ("`long long long' is too long for GCC"); 4197 else 4198 { 4199 if (pedantic && !flag_isoc99 && ! in_system_header 4200 && warn_long_long) 4201 pedwarn ("ISO C89 does not support `long long'"); 4202 longlong = 1; 4203 } 4204 } 4205 else if (specbits & (1 << (int) i)) 4206 pedwarn ("duplicate `%s'", IDENTIFIER_POINTER (id)); 4207 specbits |= 1 << (int) i; 4208 goto found; 4209 } 4210 } 4211 if (type) 4212 error ("two or more data types in declaration of `%s'", name); 4213 /* Actual typedefs come to us as TYPE_DECL nodes. */ 4214 else if (TREE_CODE (id) == TYPE_DECL) 4215 { 4216 if (TREE_TYPE (id) == error_mark_node) 4217 ; /* Allow the type to default to int to avoid cascading errors. */ 4218 else 4219 { 4220 type = TREE_TYPE (id); 4221 decl_attr = DECL_ATTRIBUTES (id); 4222 typedef_decl = id; 4223 } 4224 } 4225 /* Built-in types come as identifiers. */ 4226 else if (TREE_CODE (id) == IDENTIFIER_NODE) 4227 { 4228 tree t = lookup_name (id); 4229 if (TREE_TYPE (t) == error_mark_node) 4230 ; 4231 else if (!t || TREE_CODE (t) != TYPE_DECL) 4232 error ("`%s' fails to be a typedef or built in type", 4233 IDENTIFIER_POINTER (id)); 4234 else 4235 { 4236 type = TREE_TYPE (t); 4237 typedef_decl = t; 4238 } 4239 } 4240 else if (TREE_CODE (id) != ERROR_MARK) 4241 type = id; 4242 4243 found: 4244 ; 4245 } 4246 4247 typedef_type = type; 4248 if (type) 4249 size_varies = C_TYPE_VARIABLE_SIZE (type); 4250 4251 /* No type at all: default to `int', and set DEFAULTED_INT 4252 because it was not a user-defined typedef. */ 4253 4254 if (type == 0) 4255 { 4256 if ((! (specbits & ((1 << (int) RID_LONG) | (1 << (int) RID_SHORT) 4257 | (1 << (int) RID_SIGNED) 4258 | (1 << (int) RID_UNSIGNED) 4259 | (1 << (int) RID_COMPLEX)))) 4260 /* Don't warn about typedef foo = bar. */ 4261 && ! (specbits & (1 << (int) RID_TYPEDEF) && initialized) 4262 && ! in_system_header) 4263 { 4264 /* Issue a warning if this is an ISO C 99 program or if -Wreturn-type 4265 and this is a function, or if -Wimplicit; prefer the former 4266 warning since it is more explicit. */ 4267 if ((warn_implicit_int || warn_return_type || flag_isoc99) 4268 && funcdef_flag) 4269 warn_about_return_type = 1; 4270 else if (warn_implicit_int || flag_isoc99) 4271 pedwarn_c99 ("type defaults to `int' in declaration of `%s'", 4272 name); 4273 } 4274 4275 defaulted_int = 1; 4276 type = integer_type_node; 4277 } 4278 4279 /* Now process the modifiers that were specified 4280 and check for invalid combinations. */ 4281 4282 /* Long double is a special combination. */ 4283 4284 if ((specbits & 1 << (int) RID_LONG) && ! longlong 4285 && TYPE_MAIN_VARIANT (type) == double_type_node) 4286 { 4287 specbits &= ~(1 << (int) RID_LONG); 4288 type = long_double_type_node; 4289 } 4290 4291 /* Check all other uses of type modifiers. */ 4292 4293 if (specbits & ((1 << (int) RID_LONG) | (1 << (int) RID_SHORT) 4294 | (1 << (int) RID_UNSIGNED) | (1 << (int) RID_SIGNED))) 4295 { 4296 int ok = 0; 4297 4298 if ((specbits & 1 << (int) RID_LONG) 4299 && (specbits & 1 << (int) RID_SHORT)) 4300 error ("both long and short specified for `%s'", name); 4301 else if (((specbits & 1 << (int) RID_LONG) 4302 || (specbits & 1 << (int) RID_SHORT)) 4303 && explicit_char) 4304 error ("long or short specified with char for `%s'", name); 4305 else if (((specbits & 1 << (int) RID_LONG) 4306 || (specbits & 1 << (int) RID_SHORT)) 4307 && TREE_CODE (type) == REAL_TYPE) 4308 { 4309 static int already = 0; 4310 4311 error ("long or short specified with floating type for `%s'", name); 4312 if (! already && ! pedantic) 4313 { 4314 error ("the only valid combination is `long double'"); 4315 already = 1; 4316 } 4317 } 4318 else if ((specbits & 1 << (int) RID_SIGNED) 4319 && (specbits & 1 << (int) RID_UNSIGNED)) 4320 error ("both signed and unsigned specified for `%s'", name); 4321 else if (TREE_CODE (type) != INTEGER_TYPE) 4322 error ("long, short, signed or unsigned invalid for `%s'", name); 4323 else 4324 { 4325 ok = 1; 4326 if (!explicit_int && !defaulted_int && !explicit_char && pedantic) 4327 { 4328 pedwarn ("long, short, signed or unsigned used invalidly for `%s'", 4329 name); 4330 if (flag_pedantic_errors) 4331 ok = 0; 4332 } 4333 } 4334 4335 /* Discard the type modifiers if they are invalid. */ 4336 if (! ok) 4337 { 4338 specbits &= ~((1 << (int) RID_LONG) | (1 << (int) RID_SHORT) 4339 | (1 << (int) RID_UNSIGNED) | (1 << (int) RID_SIGNED)); 4340 longlong = 0; 4341 } 4342 } 4343 4344 if ((specbits & (1 << (int) RID_COMPLEX)) 4345 && TREE_CODE (type) != INTEGER_TYPE && TREE_CODE (type) != REAL_TYPE) 4346 { 4347 error ("complex invalid for `%s'", name); 4348 specbits &= ~(1 << (int) RID_COMPLEX); 4349 } 4350 4351 /* Decide whether an integer type is signed or not. 4352 Optionally treat bitfields as signed by default. */ 4353 if (specbits & 1 << (int) RID_UNSIGNED 4354 /* Traditionally, all bitfields are unsigned. */ 4355 || (bitfield && flag_traditional 4356 && (! explicit_flag_signed_bitfields || !flag_signed_bitfields)) 4357 || (bitfield && ! flag_signed_bitfields 4358 && (explicit_int || defaulted_int || explicit_char 4359 /* A typedef for plain `int' without `signed' 4360 can be controlled just like plain `int'. */ 4361 || ! (typedef_decl != 0 4362 && C_TYPEDEF_EXPLICITLY_SIGNED (typedef_decl))) 4363 && TREE_CODE (type) != ENUMERAL_TYPE 4364 && !(specbits & 1 << (int) RID_SIGNED))) 4365 { 4366 if (longlong) 4367 type = long_long_unsigned_type_node; 4368 else if (specbits & 1 << (int) RID_LONG) 4369 type = long_unsigned_type_node; 4370 else if (specbits & 1 << (int) RID_SHORT) 4371 type = short_unsigned_type_node; 4372 else if (type == char_type_node) 4373 type = unsigned_char_type_node; 4374 else if (typedef_decl) 4375 type = unsigned_type (type); 4376 else 4377 type = unsigned_type_node; 4378 } 4379 else if ((specbits & 1 << (int) RID_SIGNED) 4380 && type == char_type_node) 4381 type = signed_char_type_node; 4382 else if (longlong) 4383 type = long_long_integer_type_node; 4384 else if (specbits & 1 << (int) RID_LONG) 4385 type = long_integer_type_node; 4386 else if (specbits & 1 << (int) RID_SHORT) 4387 type = short_integer_type_node; 4388 4389 if (specbits & 1 << (int) RID_COMPLEX) 4390 { 4391 if (pedantic && !flag_isoc99) 4392 pedwarn ("ISO C89 does not support complex types"); 4393 /* If we just have "complex", it is equivalent to 4394 "complex double", but if any modifiers at all are specified it is 4395 the complex form of TYPE. E.g, "complex short" is 4396 "complex short int". */ 4397 4398 if (defaulted_int && ! longlong 4399 && ! (specbits & ((1 << (int) RID_LONG) | (1 << (int) RID_SHORT) 4400 | (1 << (int) RID_SIGNED) 4401 | (1 << (int) RID_UNSIGNED)))) 4402 { 4403 if (pedantic) 4404 pedwarn ("ISO C does not support plain `complex' meaning `double complex'"); 4405 type = complex_double_type_node; 4406 } 4407 else if (type == integer_type_node) 4408 { 4409 if (pedantic) 4410 pedwarn ("ISO C does not support complex integer types"); 4411 type = complex_integer_type_node; 4412 } 4413 else if (type == float_type_node) 4414 type = complex_float_type_node; 4415 else if (type == double_type_node) 4416 type = complex_double_type_node; 4417 else if (type == long_double_type_node) 4418 type = complex_long_double_type_node; 4419 else 4420 { 4421 if (pedantic) 4422 pedwarn ("ISO C does not support complex integer types"); 4423 type = build_complex_type (type); 4424 } 4425 } 4426 4427 /* Figure out the type qualifiers for the declaration. There are 4428 two ways a declaration can become qualified. One is something 4429 like `const int i' where the `const' is explicit. Another is 4430 something like `typedef const int CI; CI i' where the type of the 4431 declaration contains the `const'. */ 4432 constp = !! (specbits & 1 << (int) RID_CONST) + TYPE_READONLY (type); 4433 restrictp = !! (specbits & 1 << (int) RID_RESTRICT) + TYPE_RESTRICT (type); 4434 volatilep = !! (specbits & 1 << (int) RID_VOLATILE) + TYPE_VOLATILE (type); 4435 inlinep = !! (specbits & (1 << (int) RID_INLINE)); 4436 if (constp > 1 && ! flag_isoc99) 4437 pedwarn ("duplicate `const'"); 4438 if (restrictp > 1 && ! flag_isoc99) 4439 pedwarn ("duplicate `restrict'"); 4440 if (volatilep > 1 && ! flag_isoc99) 4441 pedwarn ("duplicate `volatile'"); 4442 if (! flag_gen_aux_info && (TYPE_QUALS (type))) 4443 type = TYPE_MAIN_VARIANT (type); 4444 type_quals = ((constp ? TYPE_QUAL_CONST : 0) 4445 | (restrictp ? TYPE_QUAL_RESTRICT : 0) 4446 | (volatilep ? TYPE_QUAL_VOLATILE : 0)); 4447 4448 /* Warn if two storage classes are given. Default to `auto'. */ 4449 4450 { 4451 int nclasses = 0; 4452 4453 if (specbits & 1 << (int) RID_AUTO) nclasses++; 4454 if (specbits & 1 << (int) RID_STATIC) nclasses++; 4455 if (specbits & 1 << (int) RID_EXTERN) nclasses++; 4456 if (specbits & 1 << (int) RID_REGISTER) nclasses++; 4457 if (specbits & 1 << (int) RID_TYPEDEF) nclasses++; 4458 4459 /* Warn about storage classes that are invalid for certain 4460 kinds of declarations (parameters, typenames, etc.). */ 4461 4462 if (nclasses > 1) 4463 error ("multiple storage classes in declaration of `%s'", name); 4464 else if (funcdef_flag 4465 && (specbits 4466 & ((1 << (int) RID_REGISTER) 4467 | (1 << (int) RID_AUTO) 4468 | (1 << (int) RID_TYPEDEF)))) 4469 { 4470 if (specbits & 1 << (int) RID_AUTO 4471 && (pedantic || current_binding_level == global_binding_level)) 4472 pedwarn ("function definition declared `auto'"); 4473 if (specbits & 1 << (int) RID_REGISTER) 4474 error ("function definition declared `register'"); 4475 if (specbits & 1 << (int) RID_TYPEDEF) 4476 error ("function definition declared `typedef'"); 4477 specbits &= ~((1 << (int) RID_TYPEDEF) | (1 << (int) RID_REGISTER) 4478 | (1 << (int) RID_AUTO)); 4479 } 4480 else if (decl_context != NORMAL && nclasses > 0) 4481 { 4482 if (decl_context == PARM && specbits & 1 << (int) RID_REGISTER) 4483 ; 4484 else 4485 { 4486 switch (decl_context) 4487 { 4488 case FIELD: 4489 error ("storage class specified for structure field `%s'", 4490 name); 4491 break; 4492 case PARM: 4493 error ("storage class specified for parameter `%s'", name); 4494 break; 4495 default: 4496 error ("storage class specified for typename"); 4497 break; 4498 } 4499 specbits &= ~((1 << (int) RID_TYPEDEF) | (1 << (int) RID_REGISTER) 4500 | (1 << (int) RID_AUTO) | (1 << (int) RID_STATIC) 4501 | (1 << (int) RID_EXTERN)); 4502 } 4503 } 4504 else if (specbits & 1 << (int) RID_EXTERN && initialized && ! funcdef_flag) 4505 { 4506 /* `extern' with initialization is invalid if not at top level. */ 4507 if (current_binding_level == global_binding_level) 4508 warning ("`%s' initialized and declared `extern'", name); 4509 else 4510 error ("`%s' has both `extern' and initializer", name); 4511 } 4512 else if (specbits & 1 << (int) RID_EXTERN && funcdef_flag 4513 && current_binding_level != global_binding_level) 4514 error ("nested function `%s' declared `extern'", name); 4515 else if (current_binding_level == global_binding_level 4516 && specbits & (1 << (int) RID_AUTO)) 4517 error ("top-level declaration of `%s' specifies `auto'", name); 4518 } 4519 4520 /* Now figure out the structure of the declarator proper. 4521 Descend through it, creating more complex types, until we reach 4522 the declared identifier (or NULL_TREE, in an absolute declarator). */ 4523 4524 while (declarator && TREE_CODE (declarator) != IDENTIFIER_NODE) 4525 { 4526 if (type == error_mark_node) 4527 { 4528 declarator = TREE_OPERAND (declarator, 0); 4529 continue; 4530 } 4531 4532 /* Each level of DECLARATOR is either an ARRAY_REF (for ...[..]), 4533 an INDIRECT_REF (for *...), 4534 a CALL_EXPR (for ...(...)), 4535 a TREE_LIST (for nested attributes), 4536 an identifier (for the name being declared) 4537 or a null pointer (for the place in an absolute declarator 4538 where the name was omitted). 4539 For the last two cases, we have just exited the loop. 4540 4541 At this point, TYPE is the type of elements of an array, 4542 or for a function to return, or for a pointer to point to. 4543 After this sequence of ifs, TYPE is the type of the 4544 array or function or pointer, and DECLARATOR has had its 4545 outermost layer removed. */ 4546 4547 if (array_ptr_quals != NULL_TREE || array_parm_static) 4548 { 4549 /* Only the innermost declarator (making a parameter be of 4550 array type which is converted to pointer type) 4551 may have static or type qualifiers. */ 4552 error ("static or type qualifiers in non-parameter array declarator"); 4553 array_ptr_quals = NULL_TREE; 4554 array_parm_static = 0; 4555 } 4556 4557 if (TREE_CODE (declarator) == TREE_LIST) 4558 { 4559 /* We encode a declarator with embedded attributes using 4560 a TREE_LIST. */ 4561 tree attrs = TREE_PURPOSE (declarator); 4562 tree inner_decl; 4563 int attr_flags = 0; 4564 declarator = TREE_VALUE (declarator); 4565 inner_decl = declarator; 4566 while (inner_decl != NULL_TREE 4567 && TREE_CODE (inner_decl) == TREE_LIST) 4568 inner_decl = TREE_VALUE (inner_decl); 4569 if (inner_decl == NULL_TREE 4570 || TREE_CODE (inner_decl) == IDENTIFIER_NODE) 4571 attr_flags |= (int) ATTR_FLAG_DECL_NEXT; 4572 else if (TREE_CODE (inner_decl) == CALL_EXPR) 4573 attr_flags |= (int) ATTR_FLAG_FUNCTION_NEXT; 4574 else if (TREE_CODE (inner_decl) == ARRAY_REF) 4575 attr_flags |= (int) ATTR_FLAG_ARRAY_NEXT; 4576 returned_attrs = decl_attributes (&type, 4577 chainon (returned_attrs, attrs), 4578 attr_flags); 4579 } 4580 else if (TREE_CODE (declarator) == ARRAY_REF) 4581 { 4582 tree itype = NULL_TREE; 4583 tree size = TREE_OPERAND (declarator, 1); 4584 /* The index is a signed object `sizetype' bits wide. */ 4585 tree index_type = signed_type (sizetype); 4586 4587 array_ptr_quals = TREE_TYPE (declarator); 4588 array_parm_static = TREE_STATIC (declarator); 4589 4590 declarator = TREE_OPERAND (declarator, 0); 4591 4592 /* Check for some types that there cannot be arrays of. */ 4593 4594 if (VOID_TYPE_P (type)) 4595 { 4596 error ("declaration of `%s' as array of voids", name); 4597 type = error_mark_node; 4598 } 4599 4600 if (TREE_CODE (type) == FUNCTION_TYPE) 4601 { 4602 error ("declaration of `%s' as array of functions", name); 4603 type = error_mark_node; 4604 } 4605 4606 if (size == error_mark_node) 4607 type = error_mark_node; 4608 4609 if (type == error_mark_node) 4610 continue; 4611 4612 /* If size was specified, set ITYPE to a range-type for that size. 4613 Otherwise, ITYPE remains null. finish_decl may figure it out 4614 from an initial value. */ 4615 4616 if (size) 4617 { 4618 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */ 4619 STRIP_TYPE_NOPS (size); 4620 4621 if (! INTEGRAL_TYPE_P (TREE_TYPE (size))) 4622 { 4623 error ("size of array `%s' has non-integer type", name); 4624 size = integer_one_node; 4625 } 4626 4627 if (pedantic && integer_zerop (size)) 4628 pedwarn ("ISO C forbids zero-size array `%s'", name); 4629 4630 if (TREE_CODE (size) == INTEGER_CST) 4631 { 4632 constant_expression_warning (size); 4633 if (tree_int_cst_sgn (size) < 0) 4634 { 4635 error ("size of array `%s' is negative", name); 4636 size = integer_one_node; 4637 } 4638 } 4639 else 4640 { 4641 /* Make sure the array size remains visibly nonconstant 4642 even if it is (eg) a const variable with known value. */ 4643 size_varies = 1; 4644 4645 if (!flag_isoc99 && pedantic) 4646 { 4647 if (TREE_CONSTANT (size)) 4648 pedwarn ("ISO C89 forbids array `%s' whose size can't be evaluated", 4649 name); 4650 else 4651 pedwarn ("ISO C89 forbids variable-size array `%s'", 4652 name); 4653 } 4654 } 4655 4656 if (integer_zerop (size)) 4657 { 4658 /* A zero-length array cannot be represented with an 4659 unsigned index type, which is what we'll get with 4660 build_index_type. Create an open-ended range instead. */ 4661 itype = build_range_type (sizetype, size, NULL_TREE); 4662 } 4663 else 4664 { 4665 /* Compute the maximum valid index, that is, size - 1. 4666 Do the calculation in index_type, so that if it is 4667 a variable the computations will be done in the 4668 proper mode. */ 4669 itype = fold (build (MINUS_EXPR, index_type, 4670 convert (index_type, size), 4671 convert (index_type, size_one_node))); 4672 4673 /* If that overflowed, the array is too big. 4674 ??? While a size of INT_MAX+1 technically shouldn't 4675 cause an overflow (because we subtract 1), the overflow 4676 is recorded during the conversion to index_type, before 4677 the subtraction. Handling this case seems like an 4678 unnecessary complication. */ 4679 if (TREE_OVERFLOW (itype)) 4680 { 4681 error ("size of array `%s' is too large", name); 4682 type = error_mark_node; 4683 continue; 4684 } 4685 4686 if (size_varies) 4687 itype = variable_size (itype); 4688 itype = build_index_type (itype); 4689 } 4690 } 4691 else if (decl_context == FIELD) 4692 { 4693 if (pedantic && !flag_isoc99 && !in_system_header) 4694 pedwarn ("ISO C89 does not support flexible array members"); 4695 4696 /* ISO C99 Flexible array members are effectively identical 4697 to GCC's zero-length array extension. */ 4698 itype = build_range_type (sizetype, size_zero_node, NULL_TREE); 4699 } 4700 4701 /* If pedantic, complain about arrays of incomplete types. */ 4702 4703 if (pedantic && !COMPLETE_TYPE_P (type)) 4704 pedwarn ("array type has incomplete element type"); 4705 4706#if 0 4707 /* We shouldn't have a function type here at all! 4708 Functions aren't allowed as array elements. */ 4709 if (pedantic && TREE_CODE (type) == FUNCTION_TYPE 4710 && (constp || volatilep)) 4711 pedwarn ("ISO C forbids const or volatile function types"); 4712#endif 4713 4714 /* Build the array type itself, then merge any constancy or 4715 volatility into the target type. We must do it in this order 4716 to ensure that the TYPE_MAIN_VARIANT field of the array type 4717 is set correctly. */ 4718 4719 type = build_array_type (type, itype); 4720 if (type_quals) 4721 type = c_build_qualified_type (type, type_quals); 4722 4723 if (size_varies) 4724 C_TYPE_VARIABLE_SIZE (type) = 1; 4725 4726 /* The GCC extension for zero-length arrays differs from 4727 ISO flexible array members in that sizeof yields zero. */ 4728 if (size && integer_zerop (size)) 4729 { 4730 layout_type (type); 4731 TYPE_SIZE (type) = bitsize_zero_node; 4732 TYPE_SIZE_UNIT (type) = size_zero_node; 4733 } 4734 if (decl_context != PARM 4735 && (array_ptr_quals != NULL_TREE || array_parm_static)) 4736 { 4737 error ("static or type qualifiers in non-parameter array declarator"); 4738 array_ptr_quals = NULL_TREE; 4739 array_parm_static = 0; 4740 } 4741 } 4742 else if (TREE_CODE (declarator) == CALL_EXPR) 4743 { 4744 tree arg_types; 4745 4746 /* Declaring a function type. 4747 Make sure we have a valid type for the function to return. */ 4748 if (type == error_mark_node) 4749 continue; 4750 4751 size_varies = 0; 4752 4753 /* Warn about some types functions can't return. */ 4754 4755 if (TREE_CODE (type) == FUNCTION_TYPE) 4756 { 4757 error ("`%s' declared as function returning a function", name); 4758 type = integer_type_node; 4759 } 4760 if (TREE_CODE (type) == ARRAY_TYPE) 4761 { 4762 error ("`%s' declared as function returning an array", name); 4763 type = integer_type_node; 4764 } 4765 4766#ifndef TRADITIONAL_RETURN_FLOAT 4767 /* Traditionally, declaring return type float means double. */ 4768 4769 if (flag_traditional && TYPE_MAIN_VARIANT (type) == float_type_node) 4770 type = double_type_node; 4771#endif /* TRADITIONAL_RETURN_FLOAT */ 4772 4773 /* Construct the function type and go to the next 4774 inner layer of declarator. */ 4775 4776 arg_types = grokparms (TREE_OPERAND (declarator, 1), 4777 funcdef_flag 4778 /* Say it's a definition 4779 only for the CALL_EXPR 4780 closest to the identifier. */ 4781 && TREE_CODE (TREE_OPERAND (declarator, 0)) == IDENTIFIER_NODE); 4782 /* Type qualifiers before the return type of the function 4783 qualify the return type, not the function type. */ 4784 if (type_quals) 4785 { 4786 /* Type qualifiers on a function return type are normally 4787 permitted by the standard but have no effect, so give a 4788 warning at -W. Qualifiers on a void return type have 4789 meaning as a GNU extension, and are banned on function 4790 definitions in ISO C. FIXME: strictly we shouldn't 4791 pedwarn for qualified void return types except on function 4792 definitions, but not doing so could lead to the undesirable 4793 state of a "volatile void" function return type not being 4794 warned about, and a use of the function being compiled 4795 with GNU semantics, with no diagnostics under -pedantic. */ 4796 if (VOID_TYPE_P (type) && pedantic && !in_system_header) 4797 pedwarn ("ISO C forbids qualified void function return type"); 4798 else if (extra_warnings 4799 && !(VOID_TYPE_P (type) 4800 && type_quals == TYPE_QUAL_VOLATILE)) 4801 warning ("type qualifiers ignored on function return type"); 4802 4803 type = c_build_qualified_type (type, type_quals); 4804 } 4805 type_quals = TYPE_UNQUALIFIED; 4806 4807 type = build_function_type (type, arg_types); 4808 declarator = TREE_OPERAND (declarator, 0); 4809 4810 /* Set the TYPE_CONTEXTs for each tagged type which is local to 4811 the formal parameter list of this FUNCTION_TYPE to point to 4812 the FUNCTION_TYPE node itself. */ 4813 4814 { 4815 tree link; 4816 4817 for (link = last_function_parm_tags; 4818 link; 4819 link = TREE_CHAIN (link)) 4820 TYPE_CONTEXT (TREE_VALUE (link)) = type; 4821 } 4822 } 4823 else if (TREE_CODE (declarator) == INDIRECT_REF) 4824 { 4825 /* Merge any constancy or volatility into the target type 4826 for the pointer. */ 4827 4828 if (pedantic && TREE_CODE (type) == FUNCTION_TYPE 4829 && type_quals) 4830 pedwarn ("ISO C forbids qualified function types"); 4831 if (type_quals) 4832 type = c_build_qualified_type (type, type_quals); 4833 type_quals = TYPE_UNQUALIFIED; 4834 size_varies = 0; 4835 4836 type = build_pointer_type (type); 4837 4838 /* Process a list of type modifier keywords 4839 (such as const or volatile) that were given inside the `*'. */ 4840 4841 if (TREE_TYPE (declarator)) 4842 { 4843 tree typemodlist; 4844 int erred = 0; 4845 4846 constp = 0; 4847 volatilep = 0; 4848 restrictp = 0; 4849 for (typemodlist = TREE_TYPE (declarator); typemodlist; 4850 typemodlist = TREE_CHAIN (typemodlist)) 4851 { 4852 tree qualifier = TREE_VALUE (typemodlist); 4853 4854 if (C_IS_RESERVED_WORD (qualifier)) 4855 { 4856 if (C_RID_CODE (qualifier) == RID_CONST) 4857 constp++; 4858 else if (C_RID_CODE (qualifier) == RID_VOLATILE) 4859 volatilep++; 4860 else if (C_RID_CODE (qualifier) == RID_RESTRICT) 4861 restrictp++; 4862 else 4863 erred++; 4864 } 4865 else 4866 erred++; 4867 } 4868 4869 if (erred) 4870 error ("invalid type modifier within pointer declarator"); 4871 if (constp > 1 && ! flag_isoc99) 4872 pedwarn ("duplicate `const'"); 4873 if (volatilep > 1 && ! flag_isoc99) 4874 pedwarn ("duplicate `volatile'"); 4875 if (restrictp > 1 && ! flag_isoc99) 4876 pedwarn ("duplicate `restrict'"); 4877 4878 type_quals = ((constp ? TYPE_QUAL_CONST : 0) 4879 | (restrictp ? TYPE_QUAL_RESTRICT : 0) 4880 | (volatilep ? TYPE_QUAL_VOLATILE : 0)); 4881 } 4882 4883 declarator = TREE_OPERAND (declarator, 0); 4884 } 4885 else 4886 abort (); 4887 4888 } 4889 4890 /* Now TYPE has the actual type. */ 4891 4892 /* Did array size calculations overflow? */ 4893 4894 if (TREE_CODE (type) == ARRAY_TYPE 4895 && COMPLETE_TYPE_P (type) 4896 && TREE_OVERFLOW (TYPE_SIZE (type))) 4897 { 4898 error ("size of array `%s' is too large", name); 4899 /* If we proceed with the array type as it is, we'll eventually 4900 crash in tree_low_cst(). */ 4901 type = error_mark_node; 4902 } 4903 4904 /* If this is declaring a typedef name, return a TYPE_DECL. */ 4905 4906 if (specbits & (1 << (int) RID_TYPEDEF)) 4907 { 4908 tree decl; 4909 /* Note that the grammar rejects storage classes 4910 in typenames, fields or parameters */ 4911 if (pedantic && TREE_CODE (type) == FUNCTION_TYPE 4912 && type_quals) 4913 pedwarn ("ISO C forbids qualified function types"); 4914 if (type_quals) 4915 type = c_build_qualified_type (type, type_quals); 4916 decl = build_decl (TYPE_DECL, declarator, type); 4917 if ((specbits & (1 << (int) RID_SIGNED)) 4918 || (typedef_decl && C_TYPEDEF_EXPLICITLY_SIGNED (typedef_decl))) 4919 C_TYPEDEF_EXPLICITLY_SIGNED (decl) = 1; 4920 decl_attributes (&decl, returned_attrs, 0); 4921 return decl; 4922 } 4923 4924 /* Detect the case of an array type of unspecified size 4925 which came, as such, direct from a typedef name. 4926 We must copy the type, so that each identifier gets 4927 a distinct type, so that each identifier's size can be 4928 controlled separately by its own initializer. */ 4929 4930 if (type != 0 && typedef_type != 0 4931 && TREE_CODE (type) == ARRAY_TYPE && TYPE_DOMAIN (type) == 0 4932 && TYPE_MAIN_VARIANT (type) == TYPE_MAIN_VARIANT (typedef_type)) 4933 { 4934 type = build_array_type (TREE_TYPE (type), 0); 4935 if (size_varies) 4936 C_TYPE_VARIABLE_SIZE (type) = 1; 4937 } 4938 4939 /* If this is a type name (such as, in a cast or sizeof), 4940 compute the type and return it now. */ 4941 4942 if (decl_context == TYPENAME) 4943 { 4944 /* Note that the grammar rejects storage classes 4945 in typenames, fields or parameters */ 4946 if (pedantic && TREE_CODE (type) == FUNCTION_TYPE 4947 && type_quals) 4948 pedwarn ("ISO C forbids const or volatile function types"); 4949 if (type_quals) 4950 type = c_build_qualified_type (type, type_quals); 4951 decl_attributes (&type, returned_attrs, 0); 4952 return type; 4953 } 4954 4955 /* Aside from typedefs and type names (handle above), 4956 `void' at top level (not within pointer) 4957 is allowed only in public variables. 4958 We don't complain about parms either, but that is because 4959 a better error message can be made later. */ 4960 4961 if (VOID_TYPE_P (type) && decl_context != PARM 4962 && ! ((decl_context != FIELD && TREE_CODE (type) != FUNCTION_TYPE) 4963 && ((specbits & (1 << (int) RID_EXTERN)) 4964 || (current_binding_level == global_binding_level 4965 && !(specbits 4966 & ((1 << (int) RID_STATIC) | (1 << (int) RID_REGISTER))))))) 4967 { 4968 error ("variable or field `%s' declared void", name); 4969 type = integer_type_node; 4970 } 4971 4972 /* Now create the decl, which may be a VAR_DECL, a PARM_DECL 4973 or a FUNCTION_DECL, depending on DECL_CONTEXT and TYPE. */ 4974 4975 { 4976 tree decl; 4977 4978 if (decl_context == PARM) 4979 { 4980 tree type_as_written; 4981 tree promoted_type; 4982 4983 /* A parameter declared as an array of T is really a pointer to T. 4984 One declared as a function is really a pointer to a function. */ 4985 4986 if (TREE_CODE (type) == ARRAY_TYPE) 4987 { 4988 /* Transfer const-ness of array into that of type pointed to. */ 4989 type = TREE_TYPE (type); 4990 if (type_quals) 4991 type = c_build_qualified_type (type, type_quals); 4992 type = build_pointer_type (type); 4993 type_quals = TYPE_UNQUALIFIED; 4994 if (array_ptr_quals) 4995 { 4996 tree new_ptr_quals, new_ptr_attrs; 4997 int erred = 0; 4998 split_specs_attrs (array_ptr_quals, &new_ptr_quals, &new_ptr_attrs); 4999 /* We don't yet implement attributes in this context. */ 5000 if (new_ptr_attrs != NULL_TREE) 5001 warning ("attributes in parameter array declarator ignored"); 5002 5003 constp = 0; 5004 volatilep = 0; 5005 restrictp = 0; 5006 for (; new_ptr_quals; new_ptr_quals = TREE_CHAIN (new_ptr_quals)) 5007 { 5008 tree qualifier = TREE_VALUE (new_ptr_quals); 5009 5010 if (C_IS_RESERVED_WORD (qualifier)) 5011 { 5012 if (C_RID_CODE (qualifier) == RID_CONST) 5013 constp++; 5014 else if (C_RID_CODE (qualifier) == RID_VOLATILE) 5015 volatilep++; 5016 else if (C_RID_CODE (qualifier) == RID_RESTRICT) 5017 restrictp++; 5018 else 5019 erred++; 5020 } 5021 else 5022 erred++; 5023 } 5024 5025 if (erred) 5026 error ("invalid type modifier within array declarator"); 5027 5028 type_quals = ((constp ? TYPE_QUAL_CONST : 0) 5029 | (restrictp ? TYPE_QUAL_RESTRICT : 0) 5030 | (volatilep ? TYPE_QUAL_VOLATILE : 0)); 5031 } 5032 size_varies = 0; 5033 } 5034 else if (TREE_CODE (type) == FUNCTION_TYPE) 5035 { 5036 if (pedantic && type_quals) 5037 pedwarn ("ISO C forbids qualified function types"); 5038 if (type_quals) 5039 type = c_build_qualified_type (type, type_quals); 5040 type = build_pointer_type (type); 5041 type_quals = TYPE_UNQUALIFIED; 5042 } 5043 else if (type_quals) 5044 type = c_build_qualified_type (type, type_quals); 5045 5046 type_as_written = type; 5047 5048 decl = build_decl (PARM_DECL, declarator, type); 5049 if (size_varies) 5050 C_DECL_VARIABLE_SIZE (decl) = 1; 5051 5052 /* Compute the type actually passed in the parmlist, 5053 for the case where there is no prototype. 5054 (For example, shorts and chars are passed as ints.) 5055 When there is a prototype, this is overridden later. */ 5056 5057 if (type == error_mark_node) 5058 promoted_type = type; 5059 else 5060 { 5061 promoted_type = simple_type_promotes_to (type); 5062 if (! promoted_type) 5063 promoted_type = type; 5064 } 5065 5066 DECL_ARG_TYPE (decl) = promoted_type; 5067 DECL_ARG_TYPE_AS_WRITTEN (decl) = type_as_written; 5068 } 5069 else if (decl_context == FIELD) 5070 { 5071 /* Structure field. It may not be a function. */ 5072 5073 if (TREE_CODE (type) == FUNCTION_TYPE) 5074 { 5075 error ("field `%s' declared as a function", name); 5076 type = build_pointer_type (type); 5077 } 5078 else if (TREE_CODE (type) != ERROR_MARK 5079 && !COMPLETE_OR_UNBOUND_ARRAY_TYPE_P (type)) 5080 { 5081 error ("field `%s' has incomplete type", name); 5082 type = error_mark_node; 5083 } 5084 /* Move type qualifiers down to element of an array. */ 5085 if (TREE_CODE (type) == ARRAY_TYPE && type_quals) 5086 { 5087 type = build_array_type (c_build_qualified_type (TREE_TYPE (type), 5088 type_quals), 5089 TYPE_DOMAIN (type)); 5090#if 0 5091 /* Leave the field const or volatile as well. */ 5092 type_quals = TYPE_UNQUALIFIED; 5093#endif 5094 } 5095 decl = build_decl (FIELD_DECL, declarator, type); 5096 DECL_NONADDRESSABLE_P (decl) = bitfield; 5097 5098 if (size_varies) 5099 C_DECL_VARIABLE_SIZE (decl) = 1; 5100 } 5101 else if (TREE_CODE (type) == FUNCTION_TYPE) 5102 { 5103 /* Every function declaration is "external" 5104 except for those which are inside a function body 5105 in which `auto' is used. 5106 That is a case not specified by ANSI C, 5107 and we use it for forward declarations for nested functions. */ 5108 int extern_ref = (!(specbits & (1 << (int) RID_AUTO)) 5109 || current_binding_level == global_binding_level); 5110 5111 if (specbits & (1 << (int) RID_AUTO) 5112 && (pedantic || current_binding_level == global_binding_level)) 5113 pedwarn ("invalid storage class for function `%s'", name); 5114 if (specbits & (1 << (int) RID_REGISTER)) 5115 error ("invalid storage class for function `%s'", name); 5116 /* Function declaration not at top level. 5117 Storage classes other than `extern' are not allowed 5118 and `extern' makes no difference. */ 5119 if (current_binding_level != global_binding_level 5120 && (specbits & ((1 << (int) RID_STATIC) | (1 << (int) RID_INLINE))) 5121 && pedantic) 5122 pedwarn ("invalid storage class for function `%s'", name); 5123 5124 decl = build_decl (FUNCTION_DECL, declarator, type); 5125 decl = build_decl_attribute_variant (decl, decl_attr); 5126 5127 DECL_LANG_SPECIFIC (decl) = (struct lang_decl *) 5128 ggc_alloc_cleared (sizeof (struct lang_decl)); 5129 5130 if (pedantic && type_quals && ! DECL_IN_SYSTEM_HEADER (decl)) 5131 pedwarn ("ISO C forbids qualified function types"); 5132 5133 /* GNU C interprets a `volatile void' return type to indicate 5134 that the function does not return. */ 5135 if ((type_quals & TYPE_QUAL_VOLATILE) 5136 && !VOID_TYPE_P (TREE_TYPE (TREE_TYPE (decl)))) 5137 warning ("`noreturn' function returns non-void value"); 5138 5139 if (extern_ref) 5140 DECL_EXTERNAL (decl) = 1; 5141 /* Record absence of global scope for `static' or `auto'. */ 5142 TREE_PUBLIC (decl) 5143 = !(specbits & ((1 << (int) RID_STATIC) | (1 << (int) RID_AUTO))); 5144 5145 if (defaulted_int) 5146 C_FUNCTION_IMPLICIT_INT (decl) = 1; 5147 5148 /* Record presence of `inline', if it is reasonable. */ 5149 if (MAIN_NAME_P (declarator)) 5150 { 5151 if (inlinep) 5152 warning ("cannot inline function `main'"); 5153 } 5154 else if (inlinep) 5155 { 5156 /* Assume that otherwise the function can be inlined. */ 5157 DECL_DECLARED_INLINE_P (decl) = 1; 5158 5159 /* Do not mark bare declarations as DECL_INLINE. Doing so 5160 in the presence of multiple declarations can result in 5161 the abstract origin pointing between the declarations, 5162 which will confuse dwarf2out. */ 5163 if (initialized) 5164 { 5165 DECL_INLINE (decl) = 1; 5166 if (specbits & (1 << (int) RID_EXTERN)) 5167 current_extern_inline = 1; 5168 } 5169 } 5170 /* If -finline-functions, assume it can be inlined. This does 5171 two things: let the function be deferred until it is actually 5172 needed, and let dwarf2 know that the function is inlinable. */ 5173 else if (flag_inline_trees == 2 && initialized) 5174 { 5175 DECL_INLINE (decl) = 1; 5176 DECL_DECLARED_INLINE_P (decl) = 0; 5177 } 5178 } 5179 else 5180 { 5181 /* It's a variable. */ 5182 /* An uninitialized decl with `extern' is a reference. */ 5183 int extern_ref = !initialized && (specbits & (1 << (int) RID_EXTERN)); 5184 5185 /* Move type qualifiers down to element of an array. */ 5186 if (TREE_CODE (type) == ARRAY_TYPE && type_quals) 5187 { 5188 int saved_align = TYPE_ALIGN(type); 5189 type = build_array_type (c_build_qualified_type (TREE_TYPE (type), 5190 type_quals), 5191 TYPE_DOMAIN (type)); 5192 TYPE_ALIGN (type) = saved_align; 5193#if 0 /* Leave the variable const or volatile as well. */ 5194 type_quals = TYPE_UNQUALIFIED; 5195#endif 5196 } 5197 else if (type_quals) 5198 type = c_build_qualified_type (type, type_quals); 5199 5200 decl = build_decl (VAR_DECL, declarator, type); 5201 if (size_varies) 5202 C_DECL_VARIABLE_SIZE (decl) = 1; 5203 5204 if (inlinep) 5205 pedwarn_with_decl (decl, "variable `%s' declared `inline'"); 5206 5207 DECL_EXTERNAL (decl) = extern_ref; 5208 /* At top level, the presence of a `static' or `register' storage 5209 class specifier, or the absence of all storage class specifiers 5210 makes this declaration a definition (perhaps tentative). Also, 5211 the absence of both `static' and `register' makes it public. */ 5212 if (current_binding_level == global_binding_level) 5213 { 5214 TREE_PUBLIC (decl) 5215 = !(specbits 5216 & ((1 << (int) RID_STATIC) | (1 << (int) RID_REGISTER))); 5217 TREE_STATIC (decl) = ! DECL_EXTERNAL (decl); 5218 } 5219 /* Not at top level, only `static' makes a static definition. */ 5220 else 5221 { 5222 TREE_STATIC (decl) = (specbits & (1 << (int) RID_STATIC)) != 0; 5223 TREE_PUBLIC (decl) = DECL_EXTERNAL (decl); 5224 } 5225 } 5226 5227 /* Record `register' declaration for warnings on & 5228 and in case doing stupid register allocation. */ 5229 5230 if (specbits & (1 << (int) RID_REGISTER)) 5231 DECL_REGISTER (decl) = 1; 5232 5233 /* Record constancy and volatility. */ 5234 c_apply_type_quals_to_decl (type_quals, decl); 5235 5236 /* If a type has volatile components, it should be stored in memory. 5237 Otherwise, the fact that those components are volatile 5238 will be ignored, and would even crash the compiler. */ 5239 if (C_TYPE_FIELDS_VOLATILE (TREE_TYPE (decl))) 5240 mark_addressable (decl); 5241 5242 decl_attributes (&decl, returned_attrs, 0); 5243 5244 return decl; 5245 } 5246} 5247 5248/* Decode the parameter-list info for a function type or function definition. 5249 The argument is the value returned by `get_parm_info' (or made in parse.y 5250 if there is an identifier list instead of a parameter decl list). 5251 These two functions are separate because when a function returns 5252 or receives functions then each is called multiple times but the order 5253 of calls is different. The last call to `grokparms' is always the one 5254 that contains the formal parameter names of a function definition. 5255 5256 Store in `last_function_parms' a chain of the decls of parms. 5257 Also store in `last_function_parm_tags' a chain of the struct, union, 5258 and enum tags declared among the parms. 5259 5260 Return a list of arg types to use in the FUNCTION_TYPE for this function. 5261 5262 FUNCDEF_FLAG is nonzero for a function definition, 0 for 5263 a mere declaration. A nonempty identifier-list gets an error message 5264 when FUNCDEF_FLAG is zero. */ 5265 5266static tree 5267grokparms (parms_info, funcdef_flag) 5268 tree parms_info; 5269 int funcdef_flag; 5270{ 5271 tree first_parm = TREE_CHAIN (parms_info); 5272 5273 last_function_parms = TREE_PURPOSE (parms_info); 5274 last_function_parm_tags = TREE_VALUE (parms_info); 5275 5276 if (warn_strict_prototypes && first_parm == 0 && !funcdef_flag 5277 && !in_system_header) 5278 warning ("function declaration isn't a prototype"); 5279 5280 if (first_parm != 0 5281 && TREE_CODE (TREE_VALUE (first_parm)) == IDENTIFIER_NODE) 5282 { 5283 if (! funcdef_flag) 5284 pedwarn ("parameter names (without types) in function declaration"); 5285 5286 last_function_parms = first_parm; 5287 return 0; 5288 } 5289 else 5290 { 5291 tree parm; 5292 tree typelt; 5293 /* We no longer test FUNCDEF_FLAG. 5294 If the arg types are incomplete in a declaration, 5295 they must include undefined tags. 5296 These tags can never be defined in the scope of the declaration, 5297 so the types can never be completed, 5298 and no call can be compiled successfully. */ 5299#if 0 5300 /* In a fcn definition, arg types must be complete. */ 5301 if (funcdef_flag) 5302#endif 5303 for (parm = last_function_parms, typelt = first_parm; 5304 parm; 5305 parm = TREE_CHAIN (parm)) 5306 /* Skip over any enumeration constants declared here. */ 5307 if (TREE_CODE (parm) == PARM_DECL) 5308 { 5309 /* Barf if the parameter itself has an incomplete type. */ 5310 tree type = TREE_VALUE (typelt); 5311 if (type == error_mark_node) 5312 continue; 5313 if (!COMPLETE_TYPE_P (type)) 5314 { 5315 if (funcdef_flag && DECL_NAME (parm) != 0) 5316 error ("parameter `%s' has incomplete type", 5317 IDENTIFIER_POINTER (DECL_NAME (parm))); 5318 else 5319 warning ("parameter has incomplete type"); 5320 if (funcdef_flag) 5321 { 5322 TREE_VALUE (typelt) = error_mark_node; 5323 TREE_TYPE (parm) = error_mark_node; 5324 } 5325 } 5326#if 0 5327 /* This has been replaced by parm_tags_warning, which 5328 uses a more accurate criterion for what to warn 5329 about. */ 5330 else 5331 { 5332 /* Now warn if is a pointer to an incomplete type. */ 5333 while (TREE_CODE (type) == POINTER_TYPE 5334 || TREE_CODE (type) == REFERENCE_TYPE) 5335 type = TREE_TYPE (type); 5336 type = TYPE_MAIN_VARIANT (type); 5337 if (!COMPLETE_TYPE_P (type)) 5338 { 5339 if (DECL_NAME (parm) != 0) 5340 warning ("parameter `%s' points to incomplete type", 5341 IDENTIFIER_POINTER (DECL_NAME (parm))); 5342 else 5343 warning ("parameter points to incomplete type"); 5344 } 5345 } 5346#endif 5347 typelt = TREE_CHAIN (typelt); 5348 } 5349 5350 return first_parm; 5351 } 5352} 5353 5354/* Return a tree_list node with info on a parameter list just parsed. 5355 The TREE_PURPOSE is a chain of decls of those parms. 5356 The TREE_VALUE is a list of structure, union and enum tags defined. 5357 The TREE_CHAIN is a list of argument types to go in the FUNCTION_TYPE. 5358 This tree_list node is later fed to `grokparms'. 5359 5360 VOID_AT_END nonzero means append `void' to the end of the type-list. 5361 Zero means the parmlist ended with an ellipsis so don't append `void'. */ 5362 5363tree 5364get_parm_info (void_at_end) 5365 int void_at_end; 5366{ 5367 tree decl, t; 5368 tree types = 0; 5369 int erred = 0; 5370 tree tags = gettags (); 5371 tree parms = getdecls (); 5372 tree new_parms = 0; 5373 tree order = current_binding_level->parm_order; 5374 5375 /* Just `void' (and no ellipsis) is special. There are really no parms. 5376 But if the `void' is qualified (by `const' or `volatile') or has a 5377 storage class specifier (`register'), then the behavior is undefined; 5378 by not counting it as the special case of `void' we will cause an 5379 error later. Typedefs for `void' are OK (see DR#157). */ 5380 if (void_at_end && parms != 0 5381 && TREE_CHAIN (parms) == 0 5382 && VOID_TYPE_P (TREE_TYPE (parms)) 5383 && ! TREE_THIS_VOLATILE (parms) 5384 && ! TREE_READONLY (parms) 5385 && ! DECL_REGISTER (parms) 5386 && DECL_NAME (parms) == 0) 5387 { 5388 parms = NULL_TREE; 5389 storedecls (NULL_TREE); 5390 return tree_cons (NULL_TREE, NULL_TREE, 5391 tree_cons (NULL_TREE, void_type_node, NULL_TREE)); 5392 } 5393 5394 /* Extract enumerator values and other non-parms declared with the parms. 5395 Likewise any forward parm decls that didn't have real parm decls. */ 5396 for (decl = parms; decl;) 5397 { 5398 tree next = TREE_CHAIN (decl); 5399 5400 if (TREE_CODE (decl) != PARM_DECL) 5401 { 5402 TREE_CHAIN (decl) = new_parms; 5403 new_parms = decl; 5404 } 5405 else if (TREE_ASM_WRITTEN (decl)) 5406 { 5407 error_with_decl (decl, 5408 "parameter `%s' has just a forward declaration"); 5409 TREE_CHAIN (decl) = new_parms; 5410 new_parms = decl; 5411 } 5412 decl = next; 5413 } 5414 5415 /* Put the parm decls back in the order they were in in the parm list. */ 5416 for (t = order; t; t = TREE_CHAIN (t)) 5417 { 5418 if (TREE_CHAIN (t)) 5419 TREE_CHAIN (TREE_VALUE (t)) = TREE_VALUE (TREE_CHAIN (t)); 5420 else 5421 TREE_CHAIN (TREE_VALUE (t)) = 0; 5422 } 5423 5424 new_parms = chainon (order ? nreverse (TREE_VALUE (order)) : 0, 5425 new_parms); 5426 5427 /* Store the parmlist in the binding level since the old one 5428 is no longer a valid list. (We have changed the chain pointers.) */ 5429 storedecls (new_parms); 5430 5431 for (decl = new_parms; decl; decl = TREE_CHAIN (decl)) 5432 /* There may also be declarations for enumerators if an enumeration 5433 type is declared among the parms. Ignore them here. */ 5434 if (TREE_CODE (decl) == PARM_DECL) 5435 { 5436 /* Since there is a prototype, 5437 args are passed in their declared types. */ 5438 tree type = TREE_TYPE (decl); 5439 DECL_ARG_TYPE (decl) = type; 5440 if (PROMOTE_PROTOTYPES 5441 && INTEGRAL_TYPE_P (type) 5442 && TYPE_PRECISION (type) < TYPE_PRECISION (integer_type_node)) 5443 DECL_ARG_TYPE (decl) = integer_type_node; 5444 5445 types = tree_cons (NULL_TREE, TREE_TYPE (decl), types); 5446 if (VOID_TYPE_P (TREE_VALUE (types)) && ! erred 5447 && DECL_NAME (decl) == 0) 5448 { 5449 error ("`void' in parameter list must be the entire list"); 5450 erred = 1; 5451 } 5452 } 5453 5454 if (void_at_end) 5455 return tree_cons (new_parms, tags, 5456 nreverse (tree_cons (NULL_TREE, void_type_node, types))); 5457 5458 return tree_cons (new_parms, tags, nreverse (types)); 5459} 5460 5461/* At end of parameter list, warn about any struct, union or enum tags 5462 defined within. Do so because these types cannot ever become complete. */ 5463 5464void 5465parmlist_tags_warning () 5466{ 5467 tree elt; 5468 static int already; 5469 5470 for (elt = current_binding_level->tags; elt; elt = TREE_CHAIN (elt)) 5471 { 5472 enum tree_code code = TREE_CODE (TREE_VALUE (elt)); 5473 /* An anonymous union parm type is meaningful as a GNU extension. 5474 So don't warn for that. */ 5475 if (code == UNION_TYPE && TREE_PURPOSE (elt) == 0 && !pedantic) 5476 continue; 5477 if (TREE_PURPOSE (elt) != 0) 5478 { 5479 if (code == RECORD_TYPE) 5480 warning ("`struct %s' declared inside parameter list", 5481 IDENTIFIER_POINTER (TREE_PURPOSE (elt))); 5482 else if (code == UNION_TYPE) 5483 warning ("`union %s' declared inside parameter list", 5484 IDENTIFIER_POINTER (TREE_PURPOSE (elt))); 5485 else 5486 warning ("`enum %s' declared inside parameter list", 5487 IDENTIFIER_POINTER (TREE_PURPOSE (elt))); 5488 } 5489 else 5490 { 5491 /* For translation these need to be separate warnings */ 5492 if (code == RECORD_TYPE) 5493 warning ("anonymous struct declared inside parameter list"); 5494 else if (code == UNION_TYPE) 5495 warning ("anonymous union declared inside parameter list"); 5496 else 5497 warning ("anonymous enum declared inside parameter list"); 5498 } 5499 if (! already) 5500 { 5501 warning ("its scope is only this definition or declaration, which is probably not what you want"); 5502 already = 1; 5503 } 5504 } 5505} 5506 5507/* Get the struct, enum or union (CODE says which) with tag NAME. 5508 Define the tag as a forward-reference if it is not defined. */ 5509 5510tree 5511xref_tag (code, name) 5512 enum tree_code code; 5513 tree name; 5514{ 5515 /* If a cross reference is requested, look up the type 5516 already defined for this tag and return it. */ 5517 5518 tree ref = lookup_tag (code, name, current_binding_level, 0); 5519 /* If this is the right type of tag, return what we found. 5520 (This reference will be shadowed by shadow_tag later if appropriate.) 5521 If this is the wrong type of tag, do not return it. If it was the 5522 wrong type in the same binding level, we will have had an error 5523 message already; if in a different binding level and declaring 5524 a name, pending_xref_error will give an error message; but if in a 5525 different binding level and not declaring a name, this tag should 5526 shadow the previous declaration of a different type of tag, and 5527 this would not work properly if we return the reference found. 5528 (For example, with "struct foo" in an outer scope, "union foo;" 5529 must shadow that tag with a new one of union type.) */ 5530 if (ref && TREE_CODE (ref) == code) 5531 return ref; 5532 5533 /* If no such tag is yet defined, create a forward-reference node 5534 and record it as the "definition". 5535 When a real declaration of this type is found, 5536 the forward-reference will be altered into a real type. */ 5537 5538 ref = make_node (code); 5539 if (code == ENUMERAL_TYPE) 5540 { 5541 /* Give the type a default layout like unsigned int 5542 to avoid crashing if it does not get defined. */ 5543 TYPE_MODE (ref) = TYPE_MODE (unsigned_type_node); 5544 TYPE_ALIGN (ref) = TYPE_ALIGN (unsigned_type_node); 5545 TYPE_USER_ALIGN (ref) = 0; 5546 TREE_UNSIGNED (ref) = 1; 5547 TYPE_PRECISION (ref) = TYPE_PRECISION (unsigned_type_node); 5548 TYPE_MIN_VALUE (ref) = TYPE_MIN_VALUE (unsigned_type_node); 5549 TYPE_MAX_VALUE (ref) = TYPE_MAX_VALUE (unsigned_type_node); 5550 } 5551 5552 pushtag (name, ref); 5553 5554 return ref; 5555} 5556 5557/* Make sure that the tag NAME is defined *in the current binding level* 5558 at least as a forward reference. 5559 CODE says which kind of tag NAME ought to be. */ 5560 5561tree 5562start_struct (code, name) 5563 enum tree_code code; 5564 tree name; 5565{ 5566 /* If there is already a tag defined at this binding level 5567 (as a forward reference), just return it. */ 5568 5569 tree ref = 0; 5570 5571 if (name != 0) 5572 ref = lookup_tag (code, name, current_binding_level, 1); 5573 if (ref && TREE_CODE (ref) == code) 5574 { 5575 C_TYPE_BEING_DEFINED (ref) = 1; 5576 TYPE_PACKED (ref) = flag_pack_struct; 5577 if (TYPE_FIELDS (ref)) 5578 { 5579 if (code == UNION_TYPE) 5580 error ("redefinition of `union %s'", 5581 IDENTIFIER_POINTER (name)); 5582 else 5583 error ("redefinition of `struct %s'", 5584 IDENTIFIER_POINTER (name)); 5585 } 5586 5587 return ref; 5588 } 5589 5590 /* Otherwise create a forward-reference just so the tag is in scope. */ 5591 5592 ref = make_node (code); 5593 pushtag (name, ref); 5594 C_TYPE_BEING_DEFINED (ref) = 1; 5595 TYPE_PACKED (ref) = flag_pack_struct; 5596 return ref; 5597} 5598 5599/* Process the specs, declarator (NULL if omitted) and width (NULL if omitted) 5600 of a structure component, returning a FIELD_DECL node. 5601 WIDTH is non-NULL for bit fields only, and is an INTEGER_CST node. 5602 5603 This is done during the parsing of the struct declaration. 5604 The FIELD_DECL nodes are chained together and the lot of them 5605 are ultimately passed to `build_struct' to make the RECORD_TYPE node. */ 5606 5607tree 5608grokfield (filename, line, declarator, declspecs, width) 5609 const char *filename ATTRIBUTE_UNUSED; 5610 int line ATTRIBUTE_UNUSED; 5611 tree declarator, declspecs, width; 5612{ 5613 tree value; 5614 5615 if (declarator == NULL_TREE && width == NULL_TREE) 5616 { 5617 /* This is an unnamed decl. We only support unnamed 5618 structs/unions, so check for other things and refuse them. */ 5619 tree type = TREE_VALUE (declspecs); 5620 5621 if (TREE_CODE (type) == TYPE_DECL) 5622 type = TREE_TYPE (type); 5623 if (TREE_CODE (type) != RECORD_TYPE && TREE_CODE (type) != UNION_TYPE) 5624 { 5625 error ("unnamed fields of type other than struct or union are not allowed"); 5626 return NULL_TREE; 5627 } 5628 } 5629 5630 value = grokdeclarator (declarator, declspecs, width ? BITFIELD : FIELD, 0); 5631 5632 finish_decl (value, NULL_TREE, NULL_TREE); 5633 DECL_INITIAL (value) = width; 5634 5635 maybe_objc_check_decl (value); 5636 return value; 5637} 5638 5639/* Fill in the fields of a RECORD_TYPE or UNION_TYPE node, T. 5640 FIELDLIST is a chain of FIELD_DECL nodes for the fields. 5641 ATTRIBUTES are attributes to be applied to the structure. */ 5642 5643tree 5644finish_struct (t, fieldlist, attributes) 5645 tree t; 5646 tree fieldlist; 5647 tree attributes; 5648{ 5649 tree x; 5650 int toplevel = global_binding_level == current_binding_level; 5651 int saw_named_field; 5652 5653 /* If this type was previously laid out as a forward reference, 5654 make sure we lay it out again. */ 5655 5656 TYPE_SIZE (t) = 0; 5657 5658 decl_attributes (&t, attributes, (int) ATTR_FLAG_TYPE_IN_PLACE); 5659 5660 /* Nameless union parm types are useful as GCC extension. */ 5661 if (! (TREE_CODE (t) == UNION_TYPE && TYPE_NAME (t) == 0) && !pedantic) 5662 /* Otherwise, warn about any struct or union def. in parmlist. */ 5663 if (in_parm_level_p ()) 5664 { 5665 if (pedantic) 5666 pedwarn ("%s defined inside parms", 5667 TREE_CODE (t) == UNION_TYPE ? _("union") : _("structure")); 5668 else if (! flag_traditional) 5669 warning ("%s defined inside parms", 5670 TREE_CODE (t) == UNION_TYPE ? _("union") : _("structure")); 5671 } 5672 5673 if (pedantic) 5674 { 5675 for (x = fieldlist; x; x = TREE_CHAIN (x)) 5676 if (DECL_NAME (x) != 0) 5677 break; 5678 5679 if (x == 0) 5680 pedwarn ("%s has no %s", 5681 TREE_CODE (t) == UNION_TYPE ? _("union") : _("struct"), 5682 fieldlist ? _("named members") : _("members")); 5683 } 5684 5685 /* Install struct as DECL_CONTEXT of each field decl. 5686 Also process specified field sizes,m which is found in the DECL_INITIAL. 5687 Store 0 there, except for ": 0" fields (so we can find them 5688 and delete them, below). */ 5689 5690 saw_named_field = 0; 5691 for (x = fieldlist; x; x = TREE_CHAIN (x)) 5692 { 5693 DECL_CONTEXT (x) = t; 5694 DECL_PACKED (x) |= TYPE_PACKED (t); 5695 5696 /* If any field is const, the structure type is pseudo-const. */ 5697 if (TREE_READONLY (x)) 5698 C_TYPE_FIELDS_READONLY (t) = 1; 5699 else 5700 { 5701 /* A field that is pseudo-const makes the structure likewise. */ 5702 tree t1 = TREE_TYPE (x); 5703 while (TREE_CODE (t1) == ARRAY_TYPE) 5704 t1 = TREE_TYPE (t1); 5705 if ((TREE_CODE (t1) == RECORD_TYPE || TREE_CODE (t1) == UNION_TYPE) 5706 && C_TYPE_FIELDS_READONLY (t1)) 5707 C_TYPE_FIELDS_READONLY (t) = 1; 5708 } 5709 5710 /* Any field that is volatile means variables of this type must be 5711 treated in some ways as volatile. */ 5712 if (TREE_THIS_VOLATILE (x)) 5713 C_TYPE_FIELDS_VOLATILE (t) = 1; 5714 5715 /* Any field of nominal variable size implies structure is too. */ 5716 if (C_DECL_VARIABLE_SIZE (x)) 5717 C_TYPE_VARIABLE_SIZE (t) = 1; 5718 5719 /* Detect invalid nested redefinition. */ 5720 if (TREE_TYPE (x) == t) 5721 error ("nested redefinition of `%s'", 5722 IDENTIFIER_POINTER (TYPE_NAME (t))); 5723 5724 /* Detect invalid bit-field size. */ 5725 if (DECL_INITIAL (x)) 5726 STRIP_NOPS (DECL_INITIAL (x)); 5727 if (DECL_INITIAL (x)) 5728 { 5729 if (TREE_CODE (DECL_INITIAL (x)) == INTEGER_CST) 5730 constant_expression_warning (DECL_INITIAL (x)); 5731 else 5732 { 5733 error_with_decl (x, 5734 "bit-field `%s' width not an integer constant"); 5735 DECL_INITIAL (x) = NULL; 5736 } 5737 } 5738 5739 /* Detect invalid bit-field type. */ 5740 if (DECL_INITIAL (x) 5741 && TREE_CODE (TREE_TYPE (x)) != INTEGER_TYPE 5742 && TREE_CODE (TREE_TYPE (x)) != BOOLEAN_TYPE 5743 && TREE_CODE (TREE_TYPE (x)) != ENUMERAL_TYPE) 5744 { 5745 error_with_decl (x, "bit-field `%s' has invalid type"); 5746 DECL_INITIAL (x) = NULL; 5747 } 5748 5749 if (DECL_INITIAL (x) && pedantic 5750 && TYPE_MAIN_VARIANT (TREE_TYPE (x)) != integer_type_node 5751 && TYPE_MAIN_VARIANT (TREE_TYPE (x)) != unsigned_type_node 5752 && TYPE_MAIN_VARIANT (TREE_TYPE (x)) != c_bool_type_node 5753 /* Accept an enum that's equivalent to int or unsigned int. */ 5754 && !(TREE_CODE (TREE_TYPE (x)) == ENUMERAL_TYPE 5755 && (TYPE_PRECISION (TREE_TYPE (x)) 5756 == TYPE_PRECISION (integer_type_node)))) 5757 pedwarn_with_decl (x, "bit-field `%s' type invalid in ISO C"); 5758 5759 /* Detect and ignore out of range field width and process valid 5760 field widths. */ 5761 if (DECL_INITIAL (x)) 5762 { 5763 int max_width 5764 = (TYPE_MAIN_VARIANT (TREE_TYPE (x)) == c_bool_type_node 5765 ? CHAR_TYPE_SIZE : TYPE_PRECISION (TREE_TYPE (x))); 5766 5767 if (tree_int_cst_sgn (DECL_INITIAL (x)) < 0) 5768 error_with_decl (x, "negative width in bit-field `%s'"); 5769 else if (0 < compare_tree_int (DECL_INITIAL (x), max_width)) 5770 pedwarn_with_decl (x, "width of `%s' exceeds its type"); 5771 else if (integer_zerop (DECL_INITIAL (x)) && DECL_NAME (x) != 0) 5772 error_with_decl (x, "zero width for bit-field `%s'"); 5773 else 5774 { 5775 /* The test above has assured us that TREE_INT_CST_HIGH is 0. */ 5776 unsigned HOST_WIDE_INT width 5777 = tree_low_cst (DECL_INITIAL (x), 1); 5778 5779 if (TREE_CODE (TREE_TYPE (x)) == ENUMERAL_TYPE 5780 && (width < min_precision (TYPE_MIN_VALUE (TREE_TYPE (x)), 5781 TREE_UNSIGNED (TREE_TYPE (x))) 5782 || (width 5783 < min_precision (TYPE_MAX_VALUE (TREE_TYPE (x)), 5784 TREE_UNSIGNED (TREE_TYPE (x)))))) 5785 warning_with_decl (x, 5786 "`%s' is narrower than values of its type"); 5787 5788 DECL_SIZE (x) = bitsize_int (width); 5789 DECL_BIT_FIELD (x) = 1; 5790 SET_DECL_C_BIT_FIELD (x); 5791 5792 if (width == 0 5793 && ! (* targetm.ms_bitfield_layout_p) (t)) 5794 { 5795 /* field size 0 => force desired amount of alignment. */ 5796#ifdef EMPTY_FIELD_BOUNDARY 5797 DECL_ALIGN (x) = MAX (DECL_ALIGN (x), EMPTY_FIELD_BOUNDARY); 5798#endif 5799#ifdef PCC_BITFIELD_TYPE_MATTERS 5800 if (PCC_BITFIELD_TYPE_MATTERS) 5801 { 5802 DECL_ALIGN (x) = MAX (DECL_ALIGN (x), 5803 TYPE_ALIGN (TREE_TYPE (x))); 5804 DECL_USER_ALIGN (x) |= TYPE_USER_ALIGN (TREE_TYPE (x)); 5805 } 5806#endif 5807 } 5808 } 5809 } 5810 5811 else if (TREE_TYPE (x) != error_mark_node) 5812 { 5813 unsigned int min_align = (DECL_PACKED (x) ? BITS_PER_UNIT 5814 : TYPE_ALIGN (TREE_TYPE (x))); 5815 5816 /* Non-bit-fields are aligned for their type, except packed 5817 fields which require only BITS_PER_UNIT alignment. */ 5818 DECL_ALIGN (x) = MAX (DECL_ALIGN (x), min_align); 5819 if (! DECL_PACKED (x)) 5820 DECL_USER_ALIGN (x) |= TYPE_USER_ALIGN (TREE_TYPE (x)); 5821 } 5822 5823 DECL_INITIAL (x) = 0; 5824 5825 /* Detect flexible array member in an invalid context. */ 5826 if (TREE_CODE (TREE_TYPE (x)) == ARRAY_TYPE 5827 && TYPE_SIZE (TREE_TYPE (x)) == NULL_TREE 5828 && TYPE_DOMAIN (TREE_TYPE (x)) != NULL_TREE 5829 && TYPE_MAX_VALUE (TYPE_DOMAIN (TREE_TYPE (x))) == NULL_TREE) 5830 { 5831 if (TREE_CODE (t) == UNION_TYPE) 5832 error_with_decl (x, "flexible array member in union"); 5833 else if (TREE_CHAIN (x) != NULL_TREE) 5834 error_with_decl (x, "flexible array member not at end of struct"); 5835 else if (! saw_named_field) 5836 error_with_decl (x, "flexible array member in otherwise empty struct"); 5837 } 5838 if (DECL_NAME (x)) 5839 saw_named_field = 1; 5840 } 5841 5842 /* Delete all duplicate fields from the fieldlist */ 5843 for (x = fieldlist; x && TREE_CHAIN (x);) 5844 /* Anonymous fields aren't duplicates. */ 5845 if (DECL_NAME (TREE_CHAIN (x)) == 0) 5846 x = TREE_CHAIN (x); 5847 else 5848 { 5849 tree y = fieldlist; 5850 5851 while (1) 5852 { 5853 if (DECL_NAME (y) == DECL_NAME (TREE_CHAIN (x))) 5854 break; 5855 if (y == x) 5856 break; 5857 y = TREE_CHAIN (y); 5858 } 5859 if (DECL_NAME (y) == DECL_NAME (TREE_CHAIN (x))) 5860 { 5861 error_with_decl (TREE_CHAIN (x), "duplicate member `%s'"); 5862 TREE_CHAIN (x) = TREE_CHAIN (TREE_CHAIN (x)); 5863 } 5864 else 5865 x = TREE_CHAIN (x); 5866 } 5867 5868 /* Now we have the nearly final fieldlist. Record it, 5869 then lay out the structure or union (including the fields). */ 5870 5871 TYPE_FIELDS (t) = fieldlist; 5872 5873 layout_type (t); 5874 5875 /* Delete all zero-width bit-fields from the fieldlist */ 5876 { 5877 tree *fieldlistp = &fieldlist; 5878 while (*fieldlistp) 5879 if (TREE_CODE (*fieldlistp) == FIELD_DECL && DECL_INITIAL (*fieldlistp)) 5880 *fieldlistp = TREE_CHAIN (*fieldlistp); 5881 else 5882 fieldlistp = &TREE_CHAIN (*fieldlistp); 5883 } 5884 5885 /* Now we have the truly final field list. 5886 Store it in this type and in the variants. */ 5887 5888 TYPE_FIELDS (t) = fieldlist; 5889 5890 for (x = TYPE_MAIN_VARIANT (t); x; x = TYPE_NEXT_VARIANT (x)) 5891 { 5892 TYPE_FIELDS (x) = TYPE_FIELDS (t); 5893 TYPE_LANG_SPECIFIC (x) = TYPE_LANG_SPECIFIC (t); 5894 TYPE_ALIGN (x) = TYPE_ALIGN (t); 5895 TYPE_USER_ALIGN (x) = TYPE_USER_ALIGN (t); 5896 } 5897 5898 /* If this was supposed to be a transparent union, but we can't 5899 make it one, warn and turn off the flag. */ 5900 if (TREE_CODE (t) == UNION_TYPE 5901 && TYPE_TRANSPARENT_UNION (t) 5902 && TYPE_MODE (t) != DECL_MODE (TYPE_FIELDS (t))) 5903 { 5904 TYPE_TRANSPARENT_UNION (t) = 0; 5905 warning ("union cannot be made transparent"); 5906 } 5907 5908 /* If this structure or union completes the type of any previous 5909 variable declaration, lay it out and output its rtl. */ 5910 5911 if (current_binding_level->n_incomplete != 0) 5912 { 5913 tree decl; 5914 for (decl = current_binding_level->names; decl; decl = TREE_CHAIN (decl)) 5915 { 5916 if (TYPE_MAIN_VARIANT (TREE_TYPE (decl)) == TYPE_MAIN_VARIANT (t) 5917 && TREE_CODE (decl) != TYPE_DECL) 5918 { 5919 layout_decl (decl, 0); 5920 /* This is a no-op in c-lang.c or something real in objc-actions.c. */ 5921 maybe_objc_check_decl (decl); 5922 rest_of_decl_compilation (decl, NULL, toplevel, 0); 5923 if (! toplevel) 5924 expand_decl (decl); 5925 if (--current_binding_level->n_incomplete == 0) 5926 break; 5927 } 5928 else if (!COMPLETE_TYPE_P (TREE_TYPE (decl)) 5929 && TREE_CODE (TREE_TYPE (decl)) == ARRAY_TYPE) 5930 { 5931 tree element = TREE_TYPE (decl); 5932 while (TREE_CODE (element) == ARRAY_TYPE) 5933 element = TREE_TYPE (element); 5934 if (element == t) 5935 { 5936 layout_array_type (TREE_TYPE (decl)); 5937 if (TREE_CODE (decl) != TYPE_DECL) 5938 { 5939 layout_decl (decl, 0); 5940 maybe_objc_check_decl (decl); 5941 rest_of_decl_compilation (decl, NULL, toplevel, 0); 5942 if (! toplevel) 5943 expand_decl (decl); 5944 } 5945 if (--current_binding_level->n_incomplete == 0) 5946 break; 5947 } 5948 } 5949 } 5950 } 5951 5952 /* Finish debugging output for this type. */ 5953 rest_of_type_compilation (t, toplevel); 5954 5955 return t; 5956} 5957 5958/* Lay out the type T, and its element type, and so on. */ 5959 5960static void 5961layout_array_type (t) 5962 tree t; 5963{ 5964 if (TREE_CODE (TREE_TYPE (t)) == ARRAY_TYPE) 5965 layout_array_type (TREE_TYPE (t)); 5966 layout_type (t); 5967} 5968 5969/* Begin compiling the definition of an enumeration type. 5970 NAME is its name (or null if anonymous). 5971 Returns the type object, as yet incomplete. 5972 Also records info about it so that build_enumerator 5973 may be used to declare the individual values as they are read. */ 5974 5975tree 5976start_enum (name) 5977 tree name; 5978{ 5979 tree enumtype = 0; 5980 5981 /* If this is the real definition for a previous forward reference, 5982 fill in the contents in the same object that used to be the 5983 forward reference. */ 5984 5985 if (name != 0) 5986 enumtype = lookup_tag (ENUMERAL_TYPE, name, current_binding_level, 1); 5987 5988 if (enumtype == 0 || TREE_CODE (enumtype) != ENUMERAL_TYPE) 5989 { 5990 enumtype = make_node (ENUMERAL_TYPE); 5991 pushtag (name, enumtype); 5992 } 5993 5994 C_TYPE_BEING_DEFINED (enumtype) = 1; 5995 5996 if (TYPE_VALUES (enumtype) != 0) 5997 { 5998 /* This enum is a named one that has been declared already. */ 5999 error ("redeclaration of `enum %s'", IDENTIFIER_POINTER (name)); 6000 6001 /* Completely replace its old definition. 6002 The old enumerators remain defined, however. */ 6003 TYPE_VALUES (enumtype) = 0; 6004 } 6005 6006 enum_next_value = integer_zero_node; 6007 enum_overflow = 0; 6008 6009 if (flag_short_enums) 6010 TYPE_PACKED (enumtype) = 1; 6011 6012 return enumtype; 6013} 6014 6015/* After processing and defining all the values of an enumeration type, 6016 install their decls in the enumeration type and finish it off. 6017 ENUMTYPE is the type object, VALUES a list of decl-value pairs, 6018 and ATTRIBUTES are the specified attributes. 6019 Returns ENUMTYPE. */ 6020 6021tree 6022finish_enum (enumtype, values, attributes) 6023 tree enumtype; 6024 tree values; 6025 tree attributes; 6026{ 6027 tree pair, tem; 6028 tree minnode = 0, maxnode = 0, enum_value_type; 6029 int precision, unsign; 6030 int toplevel = (global_binding_level == current_binding_level); 6031 6032 if (in_parm_level_p ()) 6033 warning ("enum defined inside parms"); 6034 6035 decl_attributes (&enumtype, attributes, (int) ATTR_FLAG_TYPE_IN_PLACE); 6036 6037 /* Calculate the maximum value of any enumerator in this type. */ 6038 6039 if (values == error_mark_node) 6040 minnode = maxnode = integer_zero_node; 6041 else 6042 { 6043 minnode = maxnode = TREE_VALUE (values); 6044 for (pair = TREE_CHAIN (values); pair; pair = TREE_CHAIN (pair)) 6045 { 6046 tree value = TREE_VALUE (pair); 6047 if (tree_int_cst_lt (maxnode, value)) 6048 maxnode = value; 6049 if (tree_int_cst_lt (value, minnode)) 6050 minnode = value; 6051 } 6052 } 6053 6054 /* Construct the final type of this enumeration. It is the same 6055 as one of the integral types - the narrowest one that fits, except 6056 that normally we only go as narrow as int - and signed iff any of 6057 the values are negative. */ 6058 unsign = (tree_int_cst_sgn (minnode) >= 0); 6059 precision = MAX (min_precision (minnode, unsign), 6060 min_precision (maxnode, unsign)); 6061 if (TYPE_PACKED (enumtype) || precision > TYPE_PRECISION (integer_type_node)) 6062 { 6063 tree narrowest = type_for_size (precision, unsign); 6064 if (narrowest == 0) 6065 { 6066 warning ("enumeration values exceed range of largest integer"); 6067 narrowest = long_long_integer_type_node; 6068 } 6069 6070 precision = TYPE_PRECISION (narrowest); 6071 } 6072 else 6073 precision = TYPE_PRECISION (integer_type_node); 6074 6075 if (precision == TYPE_PRECISION (integer_type_node)) 6076 enum_value_type = type_for_size (precision, 0); 6077 else 6078 enum_value_type = enumtype; 6079 6080 TYPE_MIN_VALUE (enumtype) = minnode; 6081 TYPE_MAX_VALUE (enumtype) = maxnode; 6082 TYPE_PRECISION (enumtype) = precision; 6083 TREE_UNSIGNED (enumtype) = unsign; 6084 TYPE_SIZE (enumtype) = 0; 6085 layout_type (enumtype); 6086 6087 if (values != error_mark_node) 6088 { 6089 /* Change the type of the enumerators to be the enum type. We 6090 need to do this irrespective of the size of the enum, for 6091 proper type checking. Replace the DECL_INITIALs of the 6092 enumerators, and the value slots of the list, with copies 6093 that have the enum type; they cannot be modified in place 6094 because they may be shared (e.g. integer_zero_node) Finally, 6095 change the purpose slots to point to the names of the decls. */ 6096 for (pair = values; pair; pair = TREE_CHAIN (pair)) 6097 { 6098 tree enu = TREE_PURPOSE (pair); 6099 6100 TREE_TYPE (enu) = enumtype; 6101 DECL_SIZE (enu) = TYPE_SIZE (enumtype); 6102 DECL_SIZE_UNIT (enu) = TYPE_SIZE_UNIT (enumtype); 6103 DECL_ALIGN (enu) = TYPE_ALIGN (enumtype); 6104 DECL_USER_ALIGN (enu) = TYPE_USER_ALIGN (enumtype); 6105 DECL_MODE (enu) = TYPE_MODE (enumtype); 6106 6107 /* The ISO C Standard mandates enumerators to have type int, 6108 even though the underlying type of an enum type is 6109 unspecified. Here we convert any enumerators that fit in 6110 an int to type int, to avoid promotions to unsigned types 6111 when comparing integers with enumerators that fit in the 6112 int range. When -pedantic is given, build_enumerator() 6113 would have already taken care of those that don't fit. */ 6114 if (int_fits_type_p (DECL_INITIAL (enu), enum_value_type)) 6115 DECL_INITIAL (enu) = convert (enum_value_type, DECL_INITIAL (enu)); 6116 else 6117 DECL_INITIAL (enu) = convert (enumtype, DECL_INITIAL (enu)); 6118 6119 TREE_PURPOSE (pair) = DECL_NAME (enu); 6120 TREE_VALUE (pair) = DECL_INITIAL (enu); 6121 } 6122 6123 TYPE_VALUES (enumtype) = values; 6124 } 6125 6126 /* Fix up all variant types of this enum type. */ 6127 for (tem = TYPE_MAIN_VARIANT (enumtype); tem; tem = TYPE_NEXT_VARIANT (tem)) 6128 { 6129 if (tem == enumtype) 6130 continue; 6131 TYPE_VALUES (tem) = TYPE_VALUES (enumtype); 6132 TYPE_MIN_VALUE (tem) = TYPE_MIN_VALUE (enumtype); 6133 TYPE_MAX_VALUE (tem) = TYPE_MAX_VALUE (enumtype); 6134 TYPE_SIZE (tem) = TYPE_SIZE (enumtype); 6135 TYPE_SIZE_UNIT (tem) = TYPE_SIZE_UNIT (enumtype); 6136 TYPE_MODE (tem) = TYPE_MODE (enumtype); 6137 TYPE_PRECISION (tem) = TYPE_PRECISION (enumtype); 6138 TYPE_ALIGN (tem) = TYPE_ALIGN (enumtype); 6139 TYPE_USER_ALIGN (tem) = TYPE_USER_ALIGN (enumtype); 6140 TREE_UNSIGNED (tem) = TREE_UNSIGNED (enumtype); 6141 } 6142 6143 /* Finish debugging output for this type. */ 6144 rest_of_type_compilation (enumtype, toplevel); 6145 6146 return enumtype; 6147} 6148 6149/* Build and install a CONST_DECL for one value of the 6150 current enumeration type (one that was begun with start_enum). 6151 Return a tree-list containing the CONST_DECL and its value. 6152 Assignment of sequential values by default is handled here. */ 6153 6154tree 6155build_enumerator (name, value) 6156 tree name, value; 6157{ 6158 tree decl, type; 6159 6160 /* Validate and default VALUE. */ 6161 6162 /* Remove no-op casts from the value. */ 6163 if (value) 6164 STRIP_TYPE_NOPS (value); 6165 6166 if (value != 0) 6167 { 6168 if (TREE_CODE (value) == INTEGER_CST) 6169 { 6170 value = default_conversion (value); 6171 constant_expression_warning (value); 6172 } 6173 else 6174 { 6175 error ("enumerator value for `%s' not integer constant", 6176 IDENTIFIER_POINTER (name)); 6177 value = 0; 6178 } 6179 } 6180 6181 /* Default based on previous value. */ 6182 /* It should no longer be possible to have NON_LVALUE_EXPR 6183 in the default. */ 6184 if (value == 0) 6185 { 6186 value = enum_next_value; 6187 if (enum_overflow) 6188 error ("overflow in enumeration values"); 6189 } 6190 6191 if (pedantic && ! int_fits_type_p (value, integer_type_node)) 6192 { 6193 pedwarn ("ISO C restricts enumerator values to range of `int'"); 6194 value = convert (integer_type_node, value); 6195 } 6196 6197 /* Set basis for default for next value. */ 6198 enum_next_value = build_binary_op (PLUS_EXPR, value, integer_one_node, 0); 6199 enum_overflow = tree_int_cst_lt (enum_next_value, value); 6200 6201 /* Now create a declaration for the enum value name. */ 6202 6203 type = TREE_TYPE (value); 6204 type = type_for_size (MAX (TYPE_PRECISION (type), 6205 TYPE_PRECISION (integer_type_node)), 6206 ((flag_traditional 6207 || TYPE_PRECISION (type) >= TYPE_PRECISION (integer_type_node)) 6208 && TREE_UNSIGNED (type))); 6209 6210 decl = build_decl (CONST_DECL, name, type); 6211 DECL_INITIAL (decl) = convert (type, value); 6212 pushdecl (decl); 6213 6214 return tree_cons (decl, value, NULL_TREE); 6215} 6216 6217 6218/* Create the FUNCTION_DECL for a function definition. 6219 DECLSPECS, DECLARATOR and ATTRIBUTES are the parts of 6220 the declaration; they describe the function's name and the type it returns, 6221 but twisted together in a fashion that parallels the syntax of C. 6222 6223 This function creates a binding context for the function body 6224 as well as setting up the FUNCTION_DECL in current_function_decl. 6225 6226 Returns 1 on success. If the DECLARATOR is not suitable for a function 6227 (it defines a datum instead), we return 0, which tells 6228 yyparse to report a parse error. */ 6229 6230int 6231start_function (declspecs, declarator, attributes) 6232 tree declarator, declspecs, attributes; 6233{ 6234 tree decl1, old_decl; 6235 tree restype; 6236 int old_immediate_size_expand = immediate_size_expand; 6237 6238 current_function_returns_value = 0; /* Assume, until we see it does. */ 6239 current_function_returns_null = 0; 6240 current_function_returns_abnormally = 0; 6241 warn_about_return_type = 0; 6242 current_extern_inline = 0; 6243 c_function_varargs = 0; 6244 named_labels = 0; 6245 shadowed_labels = 0; 6246 6247 /* Don't expand any sizes in the return type of the function. */ 6248 immediate_size_expand = 0; 6249 6250 decl1 = grokdeclarator (declarator, declspecs, FUNCDEF, 1); 6251 6252 /* If the declarator is not suitable for a function definition, 6253 cause a syntax error. */ 6254 if (decl1 == 0) 6255 { 6256 immediate_size_expand = old_immediate_size_expand; 6257 return 0; 6258 } 6259 6260 decl_attributes (&decl1, attributes, 0); 6261 6262 /* If #pragma weak was used, mark the decl weak now. */ 6263 if (current_binding_level == global_binding_level) 6264 maybe_apply_pragma_weak (decl1); 6265 6266 if (DECL_DECLARED_INLINE_P (decl1) 6267 && DECL_UNINLINABLE (decl1) 6268 && lookup_attribute ("noinline", DECL_ATTRIBUTES (decl1))) 6269 warning_with_decl (decl1, 6270 "inline function `%s' given attribute noinline"); 6271 6272 announce_function (decl1); 6273 6274 if (!COMPLETE_OR_VOID_TYPE_P (TREE_TYPE (TREE_TYPE (decl1)))) 6275 { 6276 error ("return type is an incomplete type"); 6277 /* Make it return void instead. */ 6278 TREE_TYPE (decl1) 6279 = build_function_type (void_type_node, 6280 TYPE_ARG_TYPES (TREE_TYPE (decl1))); 6281 } 6282 6283 if (warn_about_return_type) 6284 pedwarn_c99 ("return type defaults to `int'"); 6285 6286 /* Save the parm names or decls from this function's declarator 6287 where store_parm_decls will find them. */ 6288 current_function_parms = last_function_parms; 6289 current_function_parm_tags = last_function_parm_tags; 6290 6291 /* Make the init_value nonzero so pushdecl knows this is not tentative. 6292 error_mark_node is replaced below (in poplevel) with the BLOCK. */ 6293 DECL_INITIAL (decl1) = error_mark_node; 6294 6295 /* If this definition isn't a prototype and we had a prototype declaration 6296 before, copy the arg type info from that prototype. 6297 But not if what we had before was a builtin function. */ 6298 old_decl = lookup_name_current_level (DECL_NAME (decl1)); 6299 if (old_decl != 0 && TREE_CODE (TREE_TYPE (old_decl)) == FUNCTION_TYPE 6300 && !DECL_BUILT_IN (old_decl) 6301 && (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (decl1))) 6302 == TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (old_decl)))) 6303 && TYPE_ARG_TYPES (TREE_TYPE (decl1)) == 0) 6304 { 6305 TREE_TYPE (decl1) = TREE_TYPE (old_decl); 6306 current_function_prototype_file = DECL_SOURCE_FILE (old_decl); 6307 current_function_prototype_line = DECL_SOURCE_LINE (old_decl); 6308 } 6309 6310 /* If there is no explicit declaration, look for any out-of-scope implicit 6311 declarations. */ 6312 if (old_decl == 0) 6313 old_decl = IDENTIFIER_IMPLICIT_DECL (DECL_NAME (decl1)); 6314 6315 /* Optionally warn of old-fashioned def with no previous prototype. */ 6316 if (warn_strict_prototypes 6317 && TYPE_ARG_TYPES (TREE_TYPE (decl1)) == 0 6318 && !(old_decl != 0 6319 && (TYPE_ARG_TYPES (TREE_TYPE (old_decl)) != 0 6320 || (DECL_BUILT_IN (old_decl) 6321 && ! C_DECL_ANTICIPATED (old_decl)))) 6322 && !(flag_bsd_no_warn_kr_main && 0 == 6323 strcmp ("main", IDENTIFIER_POINTER (DECL_NAME (decl1))))) 6324 warning ("function declaration isn't a prototype"); 6325 /* Optionally warn of any global def with no previous prototype. */ 6326 else if (warn_missing_prototypes 6327 && TREE_PUBLIC (decl1) 6328 && !(old_decl != 0 6329 && (TYPE_ARG_TYPES (TREE_TYPE (old_decl)) != 0 6330 || (DECL_BUILT_IN (old_decl) 6331 && ! C_DECL_ANTICIPATED (old_decl)))) 6332 && ! MAIN_NAME_P (DECL_NAME (decl1))) 6333 warning_with_decl (decl1, "no previous prototype for `%s'"); 6334 /* Optionally warn of any def with no previous prototype 6335 if the function has already been used. */ 6336 else if (warn_missing_prototypes 6337 && old_decl != 0 && TREE_USED (old_decl) 6338 && TYPE_ARG_TYPES (TREE_TYPE (old_decl)) == 0) 6339 warning_with_decl (decl1, 6340 "`%s' was used with no prototype before its definition"); 6341 /* Optionally warn of any global def with no previous declaration. */ 6342 else if (warn_missing_declarations 6343 && TREE_PUBLIC (decl1) 6344 && old_decl == 0 6345 && ! MAIN_NAME_P (DECL_NAME (decl1))) 6346 warning_with_decl (decl1, "no previous declaration for `%s'"); 6347 /* Optionally warn of any def with no previous declaration 6348 if the function has already been used. */ 6349 else if (warn_missing_declarations 6350 && old_decl != 0 && TREE_USED (old_decl) 6351 && old_decl == IDENTIFIER_IMPLICIT_DECL (DECL_NAME (decl1))) 6352 warning_with_decl (decl1, 6353 "`%s' was used with no declaration before its definition"); 6354 6355 /* This is a definition, not a reference. 6356 So normally clear DECL_EXTERNAL. 6357 However, `extern inline' acts like a declaration 6358 except for defining how to inline. So set DECL_EXTERNAL in that case. */ 6359 DECL_EXTERNAL (decl1) = current_extern_inline; 6360 6361 /* This function exists in static storage. 6362 (This does not mean `static' in the C sense!) */ 6363 TREE_STATIC (decl1) = 1; 6364 6365 /* A nested function is not global. */ 6366 if (current_function_decl != 0) 6367 TREE_PUBLIC (decl1) = 0; 6368 6369 /* Warn for unlikely, improbable, or stupid declarations of `main'. */ 6370 if (warn_main > 0 && MAIN_NAME_P (DECL_NAME (decl1))) 6371 { 6372 tree args; 6373 int argct = 0; 6374 6375 if (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (decl1))) 6376 != integer_type_node) 6377 pedwarn_with_decl (decl1, "return type of `%s' is not `int'"); 6378 6379 for (args = TYPE_ARG_TYPES (TREE_TYPE (decl1)); args; 6380 args = TREE_CHAIN (args)) 6381 { 6382 tree type = args ? TREE_VALUE (args) : 0; 6383 6384 if (type == void_type_node) 6385 break; 6386 6387 ++argct; 6388 switch (argct) 6389 { 6390 case 1: 6391 if (TYPE_MAIN_VARIANT (type) != integer_type_node) 6392 pedwarn_with_decl (decl1, 6393 "first argument of `%s' should be `int'"); 6394 break; 6395 6396 case 2: 6397 if (TREE_CODE (type) != POINTER_TYPE 6398 || TREE_CODE (TREE_TYPE (type)) != POINTER_TYPE 6399 || (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (type))) 6400 != char_type_node)) 6401 pedwarn_with_decl (decl1, 6402 "second argument of `%s' should be `char **'"); 6403 break; 6404 6405 case 3: 6406 if (TREE_CODE (type) != POINTER_TYPE 6407 || TREE_CODE (TREE_TYPE (type)) != POINTER_TYPE 6408 || (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (type))) 6409 != char_type_node)) 6410 pedwarn_with_decl (decl1, 6411 "third argument of `%s' should probably be `char **'"); 6412 break; 6413 } 6414 } 6415 6416 /* It is intentional that this message does not mention the third 6417 argument because it's only mentioned in an appendix of the 6418 standard. */ 6419 if (argct > 0 && (argct < 2 || argct > 3)) 6420 pedwarn_with_decl (decl1, "`%s' takes only zero or two arguments"); 6421 6422 if (! TREE_PUBLIC (decl1)) 6423 pedwarn_with_decl (decl1, "`%s' is normally a non-static function"); 6424 } 6425 6426 /* Record the decl so that the function name is defined. 6427 If we already have a decl for this name, and it is a FUNCTION_DECL, 6428 use the old decl. */ 6429 6430 current_function_decl = pushdecl (decl1); 6431 6432 pushlevel (0); 6433 declare_parm_level (1); 6434 current_binding_level->subblocks_tag_transparent = 1; 6435 6436 make_decl_rtl (current_function_decl, NULL); 6437 6438 restype = TREE_TYPE (TREE_TYPE (current_function_decl)); 6439 /* Promote the value to int before returning it. */ 6440 if (c_promoting_integer_type_p (restype)) 6441 { 6442 /* It retains unsignedness if traditional 6443 or if not really getting wider. */ 6444 if (TREE_UNSIGNED (restype) 6445 && (flag_traditional 6446 || (TYPE_PRECISION (restype) 6447 == TYPE_PRECISION (integer_type_node)))) 6448 restype = unsigned_type_node; 6449 else 6450 restype = integer_type_node; 6451 } 6452 DECL_RESULT (current_function_decl) 6453 = build_decl (RESULT_DECL, NULL_TREE, restype); 6454 6455 /* If this fcn was already referenced via a block-scope `extern' decl 6456 (or an implicit decl), propagate certain information about the usage. */ 6457 if (TREE_ADDRESSABLE (DECL_ASSEMBLER_NAME (current_function_decl))) 6458 TREE_ADDRESSABLE (current_function_decl) = 1; 6459 6460 immediate_size_expand = old_immediate_size_expand; 6461 6462 start_fname_decls (); 6463 6464 return 1; 6465} 6466 6467/* Record that this function is going to be a varargs function. 6468 This is called before store_parm_decls, which is too early 6469 to call mark_varargs directly. */ 6470 6471void 6472c_mark_varargs () 6473{ 6474 c_function_varargs = 1; 6475} 6476 6477/* Store the parameter declarations into the current function declaration. 6478 This is called after parsing the parameter declarations, before 6479 digesting the body of the function. 6480 6481 For an old-style definition, modify the function's type 6482 to specify at least the number of arguments. */ 6483 6484void 6485store_parm_decls () 6486{ 6487 tree fndecl = current_function_decl; 6488 tree parm; 6489 6490 /* This is either a chain of PARM_DECLs (if a prototype was used) 6491 or a list of IDENTIFIER_NODEs (for an old-fashioned C definition). */ 6492 tree specparms = current_function_parms; 6493 6494 /* This is a list of types declared among parms in a prototype. */ 6495 tree parmtags = current_function_parm_tags; 6496 6497 /* This is a chain of PARM_DECLs from old-style parm declarations. */ 6498 tree parmdecls = getdecls (); 6499 6500 /* This is a chain of any other decls that came in among the parm 6501 declarations. If a parm is declared with enum {foo, bar} x; 6502 then CONST_DECLs for foo and bar are put here. */ 6503 tree nonparms = 0; 6504 6505 /* The function containing FNDECL, if any. */ 6506 tree context = decl_function_context (fndecl); 6507 6508 /* Nonzero if this definition is written with a prototype. */ 6509 int prototype = 0; 6510 6511 int saved_warn_shadow = warn_shadow; 6512 6513 /* Don't re-emit shadow warnings. */ 6514 warn_shadow = 0; 6515 6516 if (specparms != 0 && TREE_CODE (specparms) != TREE_LIST) 6517 { 6518 /* This case is when the function was defined with an ANSI prototype. 6519 The parms already have decls, so we need not do anything here 6520 except record them as in effect 6521 and complain if any redundant old-style parm decls were written. */ 6522 6523 tree next; 6524 tree others = 0; 6525 6526 prototype = 1; 6527 6528 if (parmdecls != 0) 6529 { 6530 tree decl, link; 6531 6532 error_with_decl (fndecl, 6533 "parm types given both in parmlist and separately"); 6534 /* Get rid of the erroneous decls; don't keep them on 6535 the list of parms, since they might not be PARM_DECLs. */ 6536 for (decl = current_binding_level->names; 6537 decl; decl = TREE_CHAIN (decl)) 6538 if (DECL_NAME (decl)) 6539 IDENTIFIER_LOCAL_VALUE (DECL_NAME (decl)) = 0; 6540 for (link = current_binding_level->shadowed; 6541 link; link = TREE_CHAIN (link)) 6542 IDENTIFIER_LOCAL_VALUE (TREE_PURPOSE (link)) = TREE_VALUE (link); 6543 current_binding_level->names = 0; 6544 current_binding_level->shadowed = 0; 6545 } 6546 6547 specparms = nreverse (specparms); 6548 for (parm = specparms; parm; parm = next) 6549 { 6550 next = TREE_CHAIN (parm); 6551 if (TREE_CODE (parm) == PARM_DECL) 6552 { 6553 if (DECL_NAME (parm) == 0) 6554 error_with_decl (parm, "parameter name omitted"); 6555 else if (TREE_CODE (TREE_TYPE (parm)) != ERROR_MARK 6556 && VOID_TYPE_P (TREE_TYPE (parm))) 6557 { 6558 error_with_decl (parm, "parameter `%s' declared void"); 6559 /* Change the type to error_mark_node so this parameter 6560 will be ignored by assign_parms. */ 6561 TREE_TYPE (parm) = error_mark_node; 6562 } 6563 pushdecl (parm); 6564 } 6565 else 6566 { 6567 /* If we find an enum constant or a type tag, 6568 put it aside for the moment. */ 6569 TREE_CHAIN (parm) = 0; 6570 others = chainon (others, parm); 6571 } 6572 } 6573 6574 /* Get the decls in their original chain order 6575 and record in the function. */ 6576 DECL_ARGUMENTS (fndecl) = getdecls (); 6577 6578#if 0 6579 /* If this function takes a variable number of arguments, 6580 add a phony parameter to the end of the parm list, 6581 to represent the position of the first unnamed argument. */ 6582 if (TREE_VALUE (tree_last (TYPE_ARG_TYPES (TREE_TYPE (fndecl)))) 6583 != void_type_node) 6584 { 6585 tree dummy = build_decl (PARM_DECL, NULL_TREE, void_type_node); 6586 /* Let's hope the address of the unnamed parm 6587 won't depend on its type. */ 6588 TREE_TYPE (dummy) = integer_type_node; 6589 DECL_ARG_TYPE (dummy) = integer_type_node; 6590 DECL_ARGUMENTS (fndecl) = chainon (DECL_ARGUMENTS (fndecl), dummy); 6591 } 6592#endif 6593 6594 /* Now pushdecl the enum constants. */ 6595 for (parm = others; parm; parm = next) 6596 { 6597 next = TREE_CHAIN (parm); 6598 if (DECL_NAME (parm) == 0) 6599 ; 6600 else if (TYPE_MAIN_VARIANT (TREE_TYPE (parm)) == void_type_node) 6601 ; 6602 else if (TREE_CODE (parm) != PARM_DECL) 6603 pushdecl (parm); 6604 } 6605 6606 storetags (chainon (parmtags, gettags ())); 6607 } 6608 else 6609 { 6610 /* SPECPARMS is an identifier list--a chain of TREE_LIST nodes 6611 each with a parm name as the TREE_VALUE. 6612 6613 PARMDECLS is a chain of declarations for parameters. 6614 Warning! It can also contain CONST_DECLs which are not parameters 6615 but are names of enumerators of any enum types 6616 declared among the parameters. 6617 6618 First match each formal parameter name with its declaration. 6619 Associate decls with the names and store the decls 6620 into the TREE_PURPOSE slots. */ 6621 6622 /* We use DECL_WEAK as a flag to show which parameters have been 6623 seen already since it is not used on PARM_DECL or CONST_DECL. */ 6624 for (parm = parmdecls; parm; parm = TREE_CHAIN (parm)) 6625 DECL_WEAK (parm) = 0; 6626 6627 for (parm = specparms; parm; parm = TREE_CHAIN (parm)) 6628 { 6629 tree tail, found = NULL; 6630 6631 if (TREE_VALUE (parm) == 0) 6632 { 6633 error_with_decl (fndecl, 6634 "parameter name missing from parameter list"); 6635 TREE_PURPOSE (parm) = 0; 6636 continue; 6637 } 6638 6639 /* See if any of the parmdecls specifies this parm by name. 6640 Ignore any enumerator decls. */ 6641 for (tail = parmdecls; tail; tail = TREE_CHAIN (tail)) 6642 if (DECL_NAME (tail) == TREE_VALUE (parm) 6643 && TREE_CODE (tail) == PARM_DECL) 6644 { 6645 found = tail; 6646 break; 6647 } 6648 6649 /* If declaration already marked, we have a duplicate name. 6650 Complain, and don't use this decl twice. */ 6651 if (found && DECL_WEAK (found)) 6652 { 6653 error_with_decl (found, "multiple parameters named `%s'"); 6654 found = 0; 6655 } 6656 6657 /* If the declaration says "void", complain and ignore it. */ 6658 if (found && VOID_TYPE_P (TREE_TYPE (found))) 6659 { 6660 error_with_decl (found, "parameter `%s' declared void"); 6661 TREE_TYPE (found) = integer_type_node; 6662 DECL_ARG_TYPE (found) = integer_type_node; 6663 layout_decl (found, 0); 6664 } 6665 6666 /* Traditionally, a parm declared float is actually a double. */ 6667 if (found && flag_traditional 6668 && TYPE_MAIN_VARIANT (TREE_TYPE (found)) == float_type_node) 6669 { 6670 TREE_TYPE (found) = double_type_node; 6671 DECL_ARG_TYPE (found) = double_type_node; 6672 layout_decl (found, 0); 6673 } 6674 6675 /* If no declaration found, default to int. */ 6676 if (!found) 6677 { 6678 found = build_decl (PARM_DECL, TREE_VALUE (parm), 6679 integer_type_node); 6680 DECL_ARG_TYPE (found) = TREE_TYPE (found); 6681 DECL_SOURCE_LINE (found) = DECL_SOURCE_LINE (fndecl); 6682 DECL_SOURCE_FILE (found) = DECL_SOURCE_FILE (fndecl); 6683 if (flag_isoc99) 6684 pedwarn_with_decl (found, "type of `%s' defaults to `int'"); 6685 else if (extra_warnings) 6686 warning_with_decl (found, "type of `%s' defaults to `int'"); 6687 pushdecl (found); 6688 } 6689 6690 TREE_PURPOSE (parm) = found; 6691 6692 /* Mark this decl as "already found". */ 6693 DECL_WEAK (found) = 1; 6694 } 6695 6696 /* Put anything which is on the parmdecls chain and which is 6697 not a PARM_DECL onto the list NONPARMS. (The types of 6698 non-parm things which might appear on the list include 6699 enumerators and NULL-named TYPE_DECL nodes.) Complain about 6700 any actual PARM_DECLs not matched with any names. */ 6701 6702 nonparms = 0; 6703 for (parm = parmdecls; parm;) 6704 { 6705 tree next = TREE_CHAIN (parm); 6706 TREE_CHAIN (parm) = 0; 6707 6708 if (TREE_CODE (parm) != PARM_DECL) 6709 nonparms = chainon (nonparms, parm); 6710 else 6711 { 6712 /* Complain about args with incomplete types. */ 6713 if (!COMPLETE_TYPE_P (TREE_TYPE (parm))) 6714 { 6715 error_with_decl (parm, "parameter `%s' has incomplete type"); 6716 TREE_TYPE (parm) = error_mark_node; 6717 } 6718 6719 if (! DECL_WEAK (parm)) 6720 { 6721 error_with_decl (parm, 6722 "declaration for parameter `%s' but no such parameter"); 6723 /* Pretend the parameter was not missing. 6724 This gets us to a standard state and minimizes 6725 further error messages. */ 6726 specparms 6727 = chainon (specparms, 6728 tree_cons (parm, NULL_TREE, NULL_TREE)); 6729 } 6730 } 6731 6732 parm = next; 6733 } 6734 6735 /* Chain the declarations together in the order of the list of 6736 names. Store that chain in the function decl, replacing the 6737 list of names. */ 6738 parm = specparms; 6739 DECL_ARGUMENTS (fndecl) = 0; 6740 { 6741 tree last; 6742 for (last = 0; parm; parm = TREE_CHAIN (parm)) 6743 if (TREE_PURPOSE (parm)) 6744 { 6745 if (last == 0) 6746 DECL_ARGUMENTS (fndecl) = TREE_PURPOSE (parm); 6747 else 6748 TREE_CHAIN (last) = TREE_PURPOSE (parm); 6749 last = TREE_PURPOSE (parm); 6750 TREE_CHAIN (last) = 0; 6751 } 6752 } 6753 6754 /* If there was a previous prototype, 6755 set the DECL_ARG_TYPE of each argument according to 6756 the type previously specified, and report any mismatches. */ 6757 6758 if (TYPE_ARG_TYPES (TREE_TYPE (fndecl))) 6759 { 6760 tree type; 6761 for (parm = DECL_ARGUMENTS (fndecl), 6762 type = TYPE_ARG_TYPES (TREE_TYPE (fndecl)); 6763 parm || (type && (TYPE_MAIN_VARIANT (TREE_VALUE (type)) 6764 != void_type_node)); 6765 parm = TREE_CHAIN (parm), type = TREE_CHAIN (type)) 6766 { 6767 if (parm == 0 || type == 0 6768 || TYPE_MAIN_VARIANT (TREE_VALUE (type)) == void_type_node) 6769 { 6770 error ("number of arguments doesn't match prototype"); 6771 error_with_file_and_line (current_function_prototype_file, 6772 current_function_prototype_line, 6773 "prototype declaration"); 6774 break; 6775 } 6776 /* Type for passing arg must be consistent with that 6777 declared for the arg. ISO C says we take the unqualified 6778 type for parameters declared with qualified type. */ 6779 if (! comptypes (TYPE_MAIN_VARIANT (DECL_ARG_TYPE (parm)), 6780 TYPE_MAIN_VARIANT (TREE_VALUE (type)))) 6781 { 6782 if (TYPE_MAIN_VARIANT (TREE_TYPE (parm)) 6783 == TYPE_MAIN_VARIANT (TREE_VALUE (type))) 6784 { 6785 /* Adjust argument to match prototype. E.g. a previous 6786 `int foo(float);' prototype causes 6787 `int foo(x) float x; {...}' to be treated like 6788 `int foo(float x) {...}'. This is particularly 6789 useful for argument types like uid_t. */ 6790 DECL_ARG_TYPE (parm) = TREE_TYPE (parm); 6791 6792 if (PROMOTE_PROTOTYPES 6793 && INTEGRAL_TYPE_P (TREE_TYPE (parm)) 6794 && TYPE_PRECISION (TREE_TYPE (parm)) 6795 < TYPE_PRECISION (integer_type_node)) 6796 DECL_ARG_TYPE (parm) = integer_type_node; 6797 6798 if (pedantic) 6799 { 6800 pedwarn ("promoted argument `%s' doesn't match prototype", 6801 IDENTIFIER_POINTER (DECL_NAME (parm))); 6802 warning_with_file_and_line 6803 (current_function_prototype_file, 6804 current_function_prototype_line, 6805 "prototype declaration"); 6806 } 6807 } 6808 /* If -traditional, allow `int' argument to match 6809 `unsigned' prototype. */ 6810 else if (! (flag_traditional 6811 && TYPE_MAIN_VARIANT (TREE_TYPE (parm)) == integer_type_node 6812 && TYPE_MAIN_VARIANT (TREE_VALUE (type)) == unsigned_type_node)) 6813 { 6814 error ("argument `%s' doesn't match prototype", 6815 IDENTIFIER_POINTER (DECL_NAME (parm))); 6816 error_with_file_and_line (current_function_prototype_file, 6817 current_function_prototype_line, 6818 "prototype declaration"); 6819 } 6820 } 6821 } 6822 TYPE_ACTUAL_ARG_TYPES (TREE_TYPE (fndecl)) = 0; 6823 } 6824 6825 /* Otherwise, create a prototype that would match. */ 6826 6827 else 6828 { 6829 tree actual = 0, last = 0, type; 6830 6831 for (parm = DECL_ARGUMENTS (fndecl); parm; parm = TREE_CHAIN (parm)) 6832 { 6833 type = tree_cons (NULL_TREE, DECL_ARG_TYPE (parm), NULL_TREE); 6834 if (last) 6835 TREE_CHAIN (last) = type; 6836 else 6837 actual = type; 6838 last = type; 6839 } 6840 type = tree_cons (NULL_TREE, void_type_node, NULL_TREE); 6841 if (last) 6842 TREE_CHAIN (last) = type; 6843 else 6844 actual = type; 6845 6846 /* We are going to assign a new value for the TYPE_ACTUAL_ARG_TYPES 6847 of the type of this function, but we need to avoid having this 6848 affect the types of other similarly-typed functions, so we must 6849 first force the generation of an identical (but separate) type 6850 node for the relevant function type. The new node we create 6851 will be a variant of the main variant of the original function 6852 type. */ 6853 6854 TREE_TYPE (fndecl) = build_type_copy (TREE_TYPE (fndecl)); 6855 6856 TYPE_ACTUAL_ARG_TYPES (TREE_TYPE (fndecl)) = actual; 6857 } 6858 6859 /* Now store the final chain of decls for the arguments 6860 as the decl-chain of the current lexical scope. 6861 Put the enumerators in as well, at the front so that 6862 DECL_ARGUMENTS is not modified. */ 6863 6864 storedecls (chainon (nonparms, DECL_ARGUMENTS (fndecl))); 6865 } 6866 6867 /* Make sure the binding level for the top of the function body 6868 gets a BLOCK if there are any in the function. 6869 Otherwise, the dbx output is wrong. */ 6870 6871 keep_next_if_subblocks = 1; 6872 6873 /* ??? This might be an improvement, 6874 but needs to be thought about some more. */ 6875#if 0 6876 keep_next_level_flag = 1; 6877#endif 6878 6879 /* Write a record describing this function definition to the prototypes 6880 file (if requested). */ 6881 6882 gen_aux_info_record (fndecl, 1, 0, prototype); 6883 6884 /* Initialize the RTL code for the function. */ 6885 init_function_start (fndecl, input_filename, lineno); 6886 6887 /* Begin the statement tree for this function. */ 6888 begin_stmt_tree (&DECL_SAVED_TREE (current_function_decl)); 6889 6890 /* If this is a nested function, save away the sizes of any 6891 variable-size types so that we can expand them when generating 6892 RTL. */ 6893 if (context) 6894 { 6895 tree t; 6896 6897 DECL_LANG_SPECIFIC (fndecl)->pending_sizes 6898 = nreverse (get_pending_sizes ()); 6899 for (t = DECL_LANG_SPECIFIC (fndecl)->pending_sizes; 6900 t; 6901 t = TREE_CHAIN (t)) 6902 SAVE_EXPR_CONTEXT (TREE_VALUE (t)) = context; 6903 } 6904 6905 /* This function is being processed in whole-function mode. */ 6906 cfun->x_whole_function_mode_p = 1; 6907 6908 /* Even though we're inside a function body, we still don't want to 6909 call expand_expr to calculate the size of a variable-sized array. 6910 We haven't necessarily assigned RTL to all variables yet, so it's 6911 not safe to try to expand expressions involving them. */ 6912 immediate_size_expand = 0; 6913 cfun->x_dont_save_pending_sizes_p = 1; 6914 6915 warn_shadow = saved_warn_shadow; 6916} 6917 6918/* Finish up a function declaration and compile that function 6919 all the way to assembler language output. The free the storage 6920 for the function definition. 6921 6922 This is called after parsing the body of the function definition. 6923 6924 NESTED is nonzero if the function being finished is nested in another. 6925 CAN_DEFER_P is nonzero if the function may be deferred. */ 6926 6927void 6928finish_function (nested, can_defer_p) 6929 int nested; 6930 int can_defer_p; 6931{ 6932 tree fndecl = current_function_decl; 6933 6934#if 0 6935 /* This caused &foo to be of type ptr-to-const-function which then 6936 got a warning when stored in a ptr-to-function variable. */ 6937 TREE_READONLY (fndecl) = 1; 6938#endif 6939 6940 poplevel (1, 0, 1); 6941 BLOCK_SUPERCONTEXT (DECL_INITIAL (fndecl)) = fndecl; 6942 6943 /* Must mark the RESULT_DECL as being in this function. */ 6944 6945 DECL_CONTEXT (DECL_RESULT (fndecl)) = fndecl; 6946 6947 /* Obey `register' declarations if `setjmp' is called in this fn. */ 6948 if (flag_traditional && current_function_calls_setjmp) 6949 { 6950 setjmp_protect (DECL_INITIAL (fndecl)); 6951 setjmp_protect_args (); 6952 } 6953 6954 if (MAIN_NAME_P (DECL_NAME (fndecl)) && flag_hosted) 6955 { 6956 if (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (fndecl))) 6957 != integer_type_node) 6958 { 6959 /* If warn_main is 1 (-Wmain) or 2 (-Wall), we have already warned. 6960 If warn_main is -1 (-Wno-main) we don't want to be warned. */ 6961 if (! warn_main) 6962 pedwarn_with_decl (fndecl, "return type of `%s' is not `int'"); 6963 } 6964 else 6965 { 6966#ifdef DEFAULT_MAIN_RETURN 6967 /* Make it so that `main' always returns success by default. */ 6968 DEFAULT_MAIN_RETURN; 6969#else 6970 if (flag_isoc99) 6971 c_expand_return (integer_zero_node); 6972#endif 6973 } 6974 } 6975 6976 finish_fname_decls (); 6977 6978 /* Tie off the statement tree for this function. */ 6979 finish_stmt_tree (&DECL_SAVED_TREE (fndecl)); 6980 6981 /* Complain if there's just no return statement. */ 6982 if (warn_return_type 6983 && TREE_CODE (TREE_TYPE (TREE_TYPE (fndecl))) != VOID_TYPE 6984 && !current_function_returns_value && !current_function_returns_null 6985 /* Don't complain if we abort. */ 6986 && !current_function_returns_abnormally 6987 /* Don't warn for main(). */ 6988 && !MAIN_NAME_P (DECL_NAME (fndecl)) 6989 /* Or if they didn't actually specify a return type. */ 6990 && !C_FUNCTION_IMPLICIT_INT (fndecl) 6991 /* Normally, with -Wreturn-type, flow will complain. Unless we're an 6992 inline function, as we might never be compiled separately. */ 6993 && DECL_INLINE (fndecl)) 6994 warning ("no return statement in function returning non-void"); 6995 6996 /* Clear out memory we no longer need. */ 6997 free_after_parsing (cfun); 6998 /* Since we never call rest_of_compilation, we never clear 6999 CFUN. Do so explicitly. */ 7000 free_after_compilation (cfun); 7001 cfun = NULL; 7002 7003 if (! nested) 7004 { 7005 /* Generate RTL for the body of this function. */ 7006 c_expand_body (fndecl, nested, can_defer_p); 7007 7008 /* Let the error reporting routines know that we're outside a 7009 function. For a nested function, this value is used in 7010 pop_c_function_context and then reset via pop_function_context. */ 7011 current_function_decl = NULL; 7012 } 7013} 7014 7015/* Generate the RTL for a deferred function FNDECL. */ 7016 7017void 7018c_expand_deferred_function (fndecl) 7019 tree fndecl; 7020{ 7021 /* DECL_INLINE or DECL_RESULT might got cleared after the inline 7022 function was deferred, e.g. in duplicate_decls. */ 7023 if (DECL_INLINE (fndecl) && DECL_RESULT (fndecl)) 7024 { 7025 c_expand_body (fndecl, 0, 0); 7026 current_function_decl = NULL; 7027 } 7028} 7029 7030/* Generate the RTL for the body of FNDECL. If NESTED_P is non-zero, 7031 then we are already in the process of generating RTL for another 7032 function. If can_defer_p is zero, we won't attempt to defer the 7033 generation of RTL. */ 7034 7035static void 7036c_expand_body (fndecl, nested_p, can_defer_p) 7037 tree fndecl; 7038 int nested_p, can_defer_p; 7039{ 7040 int uninlinable = 1; 7041 7042 /* There's no reason to do any of the work here if we're only doing 7043 semantic analysis; this code just generates RTL. */ 7044 if (flag_syntax_only) 7045 return; 7046 7047 if (flag_inline_trees) 7048 { 7049 /* First, cache whether the current function is inlinable. Some 7050 predicates depend on cfun and current_function_decl to 7051 function completely. */ 7052 timevar_push (TV_INTEGRATION); 7053 uninlinable = ! tree_inlinable_function_p (fndecl); 7054 7055 if (! uninlinable && can_defer_p 7056 /* Save function tree for inlining. Should return 0 if the 7057 language does not support function deferring or the 7058 function could not be deferred. */ 7059 && defer_fn (fndecl)) 7060 { 7061 /* Let the back-end know that this function exists. */ 7062 (*debug_hooks->deferred_inline_function) (fndecl); 7063 timevar_pop (TV_INTEGRATION); 7064 return; 7065 } 7066 7067 /* Then, inline any functions called in it. */ 7068 optimize_inline_calls (fndecl); 7069 timevar_pop (TV_INTEGRATION); 7070 } 7071 7072 timevar_push (TV_EXPAND); 7073 7074 if (nested_p) 7075 { 7076 /* Make sure that we will evaluate variable-sized types involved 7077 in our function's type. */ 7078 expand_pending_sizes (DECL_LANG_SPECIFIC (fndecl)->pending_sizes); 7079 /* Squirrel away our current state. */ 7080 push_function_context (); 7081 } 7082 7083 /* Initialize the RTL code for the function. */ 7084 current_function_decl = fndecl; 7085 input_filename = DECL_SOURCE_FILE (fndecl); 7086 init_function_start (fndecl, input_filename, DECL_SOURCE_LINE (fndecl)); 7087 7088 /* This function is being processed in whole-function mode. */ 7089 cfun->x_whole_function_mode_p = 1; 7090 7091 /* Even though we're inside a function body, we still don't want to 7092 call expand_expr to calculate the size of a variable-sized array. 7093 We haven't necessarily assigned RTL to all variables yet, so it's 7094 not safe to try to expand expressions involving them. */ 7095 immediate_size_expand = 0; 7096 cfun->x_dont_save_pending_sizes_p = 1; 7097 7098 /* If this is a varargs function, inform function.c. */ 7099 if (c_function_varargs) 7100 mark_varargs (); 7101 7102 /* Set up parameters and prepare for return, for the function. */ 7103 expand_function_start (fndecl, 0); 7104 7105 /* If this function is `main', emit a call to `__main' 7106 to run global initializers, etc. */ 7107 if (DECL_NAME (fndecl) 7108 && MAIN_NAME_P (DECL_NAME (fndecl)) 7109 && DECL_CONTEXT (fndecl) == NULL_TREE) 7110 expand_main_function (); 7111 7112 /* Generate the RTL for this function. */ 7113 expand_stmt (DECL_SAVED_TREE (fndecl)); 7114 if (uninlinable) 7115 { 7116 /* Allow the body of the function to be garbage collected. */ 7117 DECL_SAVED_TREE (fndecl) = NULL_TREE; 7118 } 7119 7120 /* We hard-wired immediate_size_expand to zero above. 7121 expand_function_end will decrement this variable. So, we set the 7122 variable to one here, so that after the decrement it will remain 7123 zero. */ 7124 immediate_size_expand = 1; 7125 7126 /* Allow language dialects to perform special processing. */ 7127 if (lang_expand_function_end) 7128 (*lang_expand_function_end) (); 7129 7130 /* Generate rtl for function exit. */ 7131 expand_function_end (input_filename, lineno, 0); 7132 7133 /* If this is a nested function, protect the local variables in the stack 7134 above us from being collected while we're compiling this function. */ 7135 if (nested_p) 7136 ggc_push_context (); 7137 7138 /* Run the optimizers and output the assembler code for this function. */ 7139 rest_of_compilation (fndecl); 7140 7141 /* Undo the GC context switch. */ 7142 if (nested_p) 7143 ggc_pop_context (); 7144 7145 /* With just -W, complain only if function returns both with 7146 and without a value. */ 7147 if (extra_warnings 7148 && current_function_returns_value 7149 && current_function_returns_null) 7150 warning ("this function may return with or without a value"); 7151 7152 /* If requested, warn about function definitions where the function will 7153 return a value (usually of some struct or union type) which itself will 7154 take up a lot of stack space. */ 7155 7156 if (warn_larger_than && !DECL_EXTERNAL (fndecl) && TREE_TYPE (fndecl)) 7157 { 7158 tree ret_type = TREE_TYPE (TREE_TYPE (fndecl)); 7159 7160 if (ret_type && TYPE_SIZE_UNIT (ret_type) 7161 && TREE_CODE (TYPE_SIZE_UNIT (ret_type)) == INTEGER_CST 7162 && 0 < compare_tree_int (TYPE_SIZE_UNIT (ret_type), 7163 larger_than_size)) 7164 { 7165 unsigned int size_as_int 7166 = TREE_INT_CST_LOW (TYPE_SIZE_UNIT (ret_type)); 7167 7168 if (compare_tree_int (TYPE_SIZE_UNIT (ret_type), size_as_int) == 0) 7169 warning_with_decl (fndecl, 7170 "size of return value of `%s' is %u bytes", 7171 size_as_int); 7172 else 7173 warning_with_decl (fndecl, 7174 "size of return value of `%s' is larger than %d bytes", 7175 larger_than_size); 7176 } 7177 } 7178 7179 if (DECL_SAVED_INSNS (fndecl) == 0 && ! nested_p 7180 && ! flag_inline_trees) 7181 { 7182 /* Stop pointing to the local nodes about to be freed. 7183 But DECL_INITIAL must remain nonzero so we know this 7184 was an actual function definition. 7185 For a nested function, this is done in pop_c_function_context. 7186 If rest_of_compilation set this to 0, leave it 0. */ 7187 if (DECL_INITIAL (fndecl) != 0) 7188 DECL_INITIAL (fndecl) = error_mark_node; 7189 7190 DECL_ARGUMENTS (fndecl) = 0; 7191 } 7192 7193 if (DECL_STATIC_CONSTRUCTOR (fndecl)) 7194 { 7195 if (targetm.have_ctors_dtors) 7196 (* targetm.asm_out.constructor) (XEXP (DECL_RTL (fndecl), 0), 7197 DEFAULT_INIT_PRIORITY); 7198 else 7199 static_ctors = tree_cons (NULL_TREE, fndecl, static_ctors); 7200 } 7201 7202 if (DECL_STATIC_DESTRUCTOR (fndecl)) 7203 { 7204 if (targetm.have_ctors_dtors) 7205 (* targetm.asm_out.destructor) (XEXP (DECL_RTL (fndecl), 0), 7206 DEFAULT_INIT_PRIORITY); 7207 else 7208 static_dtors = tree_cons (NULL_TREE, fndecl, static_dtors); 7209 } 7210 7211 if (nested_p) 7212 /* Return to the enclosing function. */ 7213 pop_function_context (); 7214 timevar_pop (TV_EXPAND); 7215} 7216 7217/* Check the declarations given in a for-loop for satisfying the C99 7218 constraints. */ 7219void 7220check_for_loop_decls () 7221{ 7222 tree t; 7223 7224 if (!flag_isoc99) 7225 { 7226 /* If we get here, declarations have been used in a for loop without 7227 the C99 for loop scope. This doesn't make much sense, so don't 7228 allow it. */ 7229 error ("`for' loop initial declaration used outside C99 mode"); 7230 return; 7231 } 7232 /* C99 subclause 6.8.5 paragraph 3: 7233 7234 [#3] The declaration part of a for statement shall only 7235 declare identifiers for objects having storage class auto or 7236 register. 7237 7238 It isn't clear whether, in this sentence, "identifiers" binds to 7239 "shall only declare" or to "objects" - that is, whether all identifiers 7240 declared must be identifiers for objects, or whether the restriction 7241 only applies to those that are. (A question on this in comp.std.c 7242 in November 2000 received no answer.) We implement the strictest 7243 interpretation, to avoid creating an extension which later causes 7244 problems. */ 7245 7246 for (t = gettags (); t; t = TREE_CHAIN (t)) 7247 { 7248 if (TREE_PURPOSE (t) != 0) 7249 { 7250 enum tree_code code = TREE_CODE (TREE_VALUE (t)); 7251 7252 if (code == RECORD_TYPE) 7253 error ("`struct %s' declared in `for' loop initial declaration", 7254 IDENTIFIER_POINTER (TREE_PURPOSE (t))); 7255 else if (code == UNION_TYPE) 7256 error ("`union %s' declared in `for' loop initial declaration", 7257 IDENTIFIER_POINTER (TREE_PURPOSE (t))); 7258 else 7259 error ("`enum %s' declared in `for' loop initial declaration", 7260 IDENTIFIER_POINTER (TREE_PURPOSE (t))); 7261 } 7262 } 7263 7264 for (t = getdecls (); t; t = TREE_CHAIN (t)) 7265 { 7266 if (TREE_CODE (t) != VAR_DECL && DECL_NAME (t)) 7267 error_with_decl (t, "declaration of non-variable `%s' in `for' loop initial declaration"); 7268 else if (TREE_STATIC (t)) 7269 error_with_decl (t, "declaration of static variable `%s' in `for' loop initial declaration"); 7270 else if (DECL_EXTERNAL (t)) 7271 error_with_decl (t, "declaration of `extern' variable `%s' in `for' loop initial declaration"); 7272 } 7273} 7274 7275/* Save and restore the variables in this file and elsewhere 7276 that keep track of the progress of compilation of the current function. 7277 Used for nested functions. */ 7278 7279struct c_language_function 7280{ 7281 struct language_function base; 7282 tree named_labels; 7283 tree shadowed_labels; 7284 int returns_value; 7285 int returns_null; 7286 int returns_abnormally; 7287 int warn_about_return_type; 7288 int extern_inline; 7289 struct binding_level *binding_level; 7290}; 7291 7292/* Save and reinitialize the variables 7293 used during compilation of a C function. */ 7294 7295void 7296push_c_function_context (f) 7297 struct function *f; 7298{ 7299 struct c_language_function *p; 7300 p = ((struct c_language_function *) 7301 xmalloc (sizeof (struct c_language_function))); 7302 f->language = (struct language_function *) p; 7303 7304 p->base.x_stmt_tree = c_stmt_tree; 7305 p->base.x_scope_stmt_stack = c_scope_stmt_stack; 7306 p->named_labels = named_labels; 7307 p->shadowed_labels = shadowed_labels; 7308 p->returns_value = current_function_returns_value; 7309 p->returns_null = current_function_returns_null; 7310 p->returns_abnormally = current_function_returns_abnormally; 7311 p->warn_about_return_type = warn_about_return_type; 7312 p->extern_inline = current_extern_inline; 7313 p->binding_level = current_binding_level; 7314} 7315 7316/* Restore the variables used during compilation of a C function. */ 7317 7318void 7319pop_c_function_context (f) 7320 struct function *f; 7321{ 7322 struct c_language_function *p 7323 = (struct c_language_function *) f->language; 7324 tree link; 7325 7326 /* Bring back all the labels that were shadowed. */ 7327 for (link = shadowed_labels; link; link = TREE_CHAIN (link)) 7328 if (DECL_NAME (TREE_VALUE (link)) != 0) 7329 IDENTIFIER_LABEL_VALUE (DECL_NAME (TREE_VALUE (link))) 7330 = TREE_VALUE (link); 7331 7332 if (DECL_SAVED_INSNS (current_function_decl) == 0 7333 && DECL_SAVED_TREE (current_function_decl) == NULL_TREE) 7334 { 7335 /* Stop pointing to the local nodes about to be freed. */ 7336 /* But DECL_INITIAL must remain nonzero so we know this 7337 was an actual function definition. */ 7338 DECL_INITIAL (current_function_decl) = error_mark_node; 7339 DECL_ARGUMENTS (current_function_decl) = 0; 7340 } 7341 7342 c_stmt_tree = p->base.x_stmt_tree; 7343 c_scope_stmt_stack = p->base.x_scope_stmt_stack; 7344 named_labels = p->named_labels; 7345 shadowed_labels = p->shadowed_labels; 7346 current_function_returns_value = p->returns_value; 7347 current_function_returns_null = p->returns_null; 7348 current_function_returns_abnormally = p->returns_abnormally; 7349 warn_about_return_type = p->warn_about_return_type; 7350 current_extern_inline = p->extern_inline; 7351 current_binding_level = p->binding_level; 7352 7353 free (p); 7354 f->language = 0; 7355} 7356 7357/* Mark the language specific parts of F for GC. */ 7358 7359void 7360mark_c_function_context (f) 7361 struct function *f; 7362{ 7363 struct c_language_function *p 7364 = (struct c_language_function *) f->language; 7365 7366 if (p == 0) 7367 return; 7368 7369 mark_c_language_function (&p->base); 7370 ggc_mark_tree (p->shadowed_labels); 7371 ggc_mark_tree (p->named_labels); 7372 mark_binding_level (&p->binding_level); 7373} 7374 7375/* Copy the DECL_LANG_SPECIFIC data associated with NODE. */ 7376 7377void 7378copy_lang_decl (decl) 7379 tree decl; 7380{ 7381 struct lang_decl *ld; 7382 7383 if (!DECL_LANG_SPECIFIC (decl)) 7384 return; 7385 7386 ld = (struct lang_decl *) ggc_alloc (sizeof (struct lang_decl)); 7387 memcpy ((char *) ld, (char *) DECL_LANG_SPECIFIC (decl), 7388 sizeof (struct lang_decl)); 7389 DECL_LANG_SPECIFIC (decl) = ld; 7390} 7391 7392/* Mark the language specific bits in T for GC. */ 7393 7394void 7395lang_mark_tree (t) 7396 tree t; 7397{ 7398 if (TREE_CODE (t) == IDENTIFIER_NODE) 7399 { 7400 struct lang_identifier *i = (struct lang_identifier *) t; 7401 ggc_mark_tree (i->global_value); 7402 ggc_mark_tree (i->local_value); 7403 ggc_mark_tree (i->label_value); 7404 ggc_mark_tree (i->implicit_decl); 7405 ggc_mark_tree (i->error_locus); 7406 ggc_mark_tree (i->limbo_value); 7407 } 7408 else if (TYPE_P (t) && TYPE_LANG_SPECIFIC (t)) 7409 ggc_mark (TYPE_LANG_SPECIFIC (t)); 7410 else if (DECL_P (t) && DECL_LANG_SPECIFIC (t)) 7411 { 7412 ggc_mark (DECL_LANG_SPECIFIC (t)); 7413 c_mark_lang_decl (&DECL_LANG_SPECIFIC (t)->base); 7414 ggc_mark_tree (DECL_LANG_SPECIFIC (t)->pending_sizes); 7415 } 7416} 7417 7418/* The functions below are required for functionality of doing 7419 function at once processing in the C front end. Currently these 7420 functions are not called from anywhere in the C front end, but as 7421 these changes continue, that will change. */ 7422 7423/* Returns non-zero if the current statement is a full expression, 7424 i.e. temporaries created during that statement should be destroyed 7425 at the end of the statement. */ 7426 7427int 7428stmts_are_full_exprs_p () 7429{ 7430 return 0; 7431} 7432 7433/* Returns the stmt_tree (if any) to which statements are currently 7434 being added. If there is no active statement-tree, NULL is 7435 returned. */ 7436 7437stmt_tree 7438current_stmt_tree () 7439{ 7440 return &c_stmt_tree; 7441} 7442 7443/* Returns the stack of SCOPE_STMTs for the current function. */ 7444 7445tree * 7446current_scope_stmt_stack () 7447{ 7448 return &c_scope_stmt_stack; 7449} 7450 7451/* Nonzero if TYPE is an anonymous union or struct type. Always 0 in 7452 C. */ 7453 7454int 7455anon_aggr_type_p (node) 7456 tree node ATTRIBUTE_UNUSED; 7457{ 7458 return 0; 7459} 7460 7461/* Dummy function in place of callback used by C++. */ 7462 7463void 7464extract_interface_info () 7465{ 7466} 7467 7468/* Return a new COMPOUND_STMT, after adding it to the current 7469 statement tree. */ 7470 7471tree 7472c_begin_compound_stmt () 7473{ 7474 tree stmt; 7475 7476 /* Create the COMPOUND_STMT. */ 7477 stmt = add_stmt (build_stmt (COMPOUND_STMT, NULL_TREE)); 7478 7479 return stmt; 7480} 7481 7482/* Expand T (a DECL_STMT) if it declares an entity not handled by the 7483 common code. */ 7484 7485void 7486c_expand_decl_stmt (t) 7487 tree t; 7488{ 7489 tree decl = DECL_STMT_DECL (t); 7490 7491 /* Expand nested functions. */ 7492 if (TREE_CODE (decl) == FUNCTION_DECL 7493 && DECL_CONTEXT (decl) == current_function_decl 7494 && DECL_SAVED_TREE (decl)) 7495 c_expand_body (decl, /*nested_p=*/1, /*can_defer_p=*/0); 7496} 7497 7498/* Return the IDENTIFIER_GLOBAL_VALUE of T, for use in common code, since 7499 the definition of IDENTIFIER_GLOBAL_VALUE is different for C and C++. */ 7500 7501tree 7502identifier_global_value (t) 7503 tree t; 7504{ 7505 return IDENTIFIER_GLOBAL_VALUE (t); 7506} 7507 7508/* Record a builtin type for C. If NAME is non-NULL, it is the name used; 7509 otherwise the name is found in ridpointers from RID_INDEX. */ 7510 7511void 7512record_builtin_type (rid_index, name, type) 7513 enum rid rid_index; 7514 const char *name; 7515 tree type; 7516{ 7517 tree id; 7518 if (name == 0) 7519 id = ridpointers[(int) rid_index]; 7520 else 7521 id = get_identifier (name); 7522 pushdecl (build_decl (TYPE_DECL, id, type)); 7523} 7524 7525/* Build the void_list_node (void_type_node having been created). */ 7526tree 7527build_void_list_node () 7528{ 7529 tree t = build_tree_list (NULL_TREE, void_type_node); 7530 return t; 7531} 7532