c-decl.c revision 110623
1/* Process declarations and variables for C compiler. 2 Copyright (C) 1988, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000, 3 2001, 2002 Free Software Foundation, Inc. 4 5This file is part of GCC. 6 7GCC is free software; you can redistribute it and/or modify it under 8the terms of the GNU General Public License as published by the Free 9Software Foundation; either version 2, or (at your option) any later 10version. 11 12GCC is distributed in the hope that it will be useful, but WITHOUT ANY 13WARRANTY; without even the implied warranty of MERCHANTABILITY or 14FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License 15for more details. 16 17You should have received a copy of the GNU General Public License 18along with GCC; see the file COPYING. If not, write to the Free 19Software Foundation, 59 Temple Place - Suite 330, Boston, MA 2002111-1307, USA. */ 21 22/* $FreeBSD: head/contrib/gcc/c-decl.c 110623 2003-02-10 05:59:19Z kan $ */ 23 24/* Process declarations and symbol lookup for C front end. 25 Also constructs types; the standard scalar types at initialization, 26 and structure, union, array and enum types when they are declared. */ 27 28/* ??? not all decl nodes are given the most useful possible 29 line numbers. For example, the CONST_DECLs for enum values. */ 30 31#include "config.h" 32#include "system.h" 33#include "intl.h" 34#include "tree.h" 35#include "tree-inline.h" 36#include "rtl.h" 37#include "flags.h" 38#include "function.h" 39#include "output.h" 40#include "expr.h" 41#include "c-tree.h" 42#include "c-lex.h" 43#include "toplev.h" 44#include "ggc.h" 45#include "tm_p.h" 46#include "cpplib.h" 47#include "target.h" 48#include "debug.h" 49#include "timevar.h" 50#include "c-common.h" 51#include "c-pragma.h" 52 53/* In grokdeclarator, distinguish syntactic contexts of declarators. */ 54enum decl_context 55{ NORMAL, /* Ordinary declaration */ 56 FUNCDEF, /* Function definition */ 57 PARM, /* Declaration of parm before function body */ 58 FIELD, /* Declaration inside struct or union */ 59 BITFIELD, /* Likewise but with specified width */ 60 TYPENAME}; /* Typename (inside cast or sizeof) */ 61 62 63/* Nonzero if we have seen an invalid cross reference 64 to a struct, union, or enum, but not yet printed the message. */ 65 66tree pending_invalid_xref; 67/* File and line to appear in the eventual error message. */ 68const char *pending_invalid_xref_file; 69int pending_invalid_xref_line; 70 71/* While defining an enum type, this is 1 plus the last enumerator 72 constant value. Note that will do not have to save this or `enum_overflow' 73 around nested function definition since such a definition could only 74 occur in an enum value expression and we don't use these variables in 75 that case. */ 76 77static tree enum_next_value; 78 79/* Nonzero means that there was overflow computing enum_next_value. */ 80 81static int enum_overflow; 82 83/* Parsing a function declarator leaves a list of parameter names 84 or a chain or parameter decls here. */ 85 86static tree last_function_parms; 87 88/* Parsing a function declarator leaves here a chain of structure 89 and enum types declared in the parmlist. */ 90 91static tree last_function_parm_tags; 92 93/* After parsing the declarator that starts a function definition, 94 `start_function' puts here the list of parameter names or chain of decls. 95 `store_parm_decls' finds it here. */ 96 97static tree current_function_parms; 98 99/* Similar, for last_function_parm_tags. */ 100static tree current_function_parm_tags; 101 102/* Similar, for the file and line that the prototype came from if this is 103 an old-style definition. */ 104static const char *current_function_prototype_file; 105static int current_function_prototype_line; 106 107/* The current statement tree. */ 108 109static struct stmt_tree_s c_stmt_tree; 110 111/* The current scope statement stack. */ 112 113static tree c_scope_stmt_stack; 114 115/* A list (chain of TREE_LIST nodes) of all LABEL_DECLs in the function 116 that have names. Here so we can clear out their names' definitions 117 at the end of the function. */ 118 119static tree named_labels; 120 121/* A list of LABEL_DECLs from outer contexts that are currently shadowed. */ 122 123static tree shadowed_labels; 124 125/* Nonzero when store_parm_decls is called indicates a varargs function. 126 Value not meaningful after store_parm_decls. */ 127 128static int c_function_varargs; 129 130/* Set to 0 at beginning of a function definition, set to 1 if 131 a return statement that specifies a return value is seen. */ 132 133int current_function_returns_value; 134 135/* Set to 0 at beginning of a function definition, set to 1 if 136 a return statement with no argument is seen. */ 137 138int current_function_returns_null; 139 140/* Set to 0 at beginning of a function definition, set to 1 if 141 a call to a noreturn function is seen. */ 142 143int current_function_returns_abnormally; 144 145/* Set to nonzero by `grokdeclarator' for a function 146 whose return type is defaulted, if warnings for this are desired. */ 147 148static int warn_about_return_type; 149 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)) 2034 { 2035 if (TREE_USED (olddecl)) 2036 (*debug_hooks->outlining_inline_function) (olddecl); 2037 2038 /* The new defn must not be inline. */ 2039 DECL_INLINE (newdecl) = 0; 2040 DECL_UNINLINABLE (newdecl) = 1; 2041 } 2042 else 2043 { 2044 /* If either decl says `inline', this fn is inline, 2045 unless its definition was passed already. */ 2046 if (DECL_DECLARED_INLINE_P (newdecl) 2047 || DECL_DECLARED_INLINE_P (olddecl)) 2048 DECL_DECLARED_INLINE_P (newdecl) = 1; 2049 2050 DECL_UNINLINABLE (newdecl) = DECL_UNINLINABLE (olddecl) 2051 = (DECL_UNINLINABLE (newdecl) || DECL_UNINLINABLE (olddecl)); 2052 } 2053 2054 if (DECL_BUILT_IN (olddecl)) 2055 { 2056 /* Get rid of any built-in function if new arg types don't match it 2057 or if we have a function definition. */ 2058 if (! types_match || new_is_definition) 2059 { 2060 if (! different_binding_level) 2061 { 2062 TREE_TYPE (olddecl) = TREE_TYPE (newdecl); 2063 DECL_BUILT_IN_CLASS (olddecl) = NOT_BUILT_IN; 2064 } 2065 } 2066 else 2067 { 2068 /* If redeclaring a builtin function, and not a definition, 2069 it stays built in. */ 2070 DECL_BUILT_IN_CLASS (newdecl) = DECL_BUILT_IN_CLASS (olddecl); 2071 DECL_FUNCTION_CODE (newdecl) = DECL_FUNCTION_CODE (olddecl); 2072 } 2073 } 2074 2075 /* Also preserve various other info from the definition. */ 2076 if (! new_is_definition) 2077 { 2078 DECL_RESULT (newdecl) = DECL_RESULT (olddecl); 2079 /* When called with different_binding_level set, don't copy over 2080 DECL_INITIAL, so that we don't accidentally change function 2081 declarations into function definitions. */ 2082 if (! different_binding_level) 2083 DECL_INITIAL (newdecl) = DECL_INITIAL (olddecl); 2084 DECL_SAVED_INSNS (newdecl) = DECL_SAVED_INSNS (olddecl); 2085 DECL_SAVED_TREE (newdecl) = DECL_SAVED_TREE (olddecl); 2086 DECL_NUM_STMTS (newdecl) = DECL_NUM_STMTS (olddecl); 2087 DECL_ARGUMENTS (newdecl) = DECL_ARGUMENTS (olddecl); 2088 2089 /* Set DECL_INLINE on the declaration if we've got a body 2090 from which to instantiate. */ 2091 if (DECL_INLINE (olddecl) && ! DECL_UNINLINABLE (newdecl)) 2092 { 2093 DECL_INLINE (newdecl) = 1; 2094 DECL_ABSTRACT_ORIGIN (newdecl) 2095 = (different_binding_level 2096 ? DECL_ORIGIN (olddecl) 2097 : DECL_ABSTRACT_ORIGIN (olddecl)); 2098 } 2099 } 2100 else 2101 { 2102 /* If a previous declaration said inline, mark the 2103 definition as inlinable. */ 2104 if (DECL_DECLARED_INLINE_P (newdecl) 2105 && ! DECL_UNINLINABLE (newdecl)) 2106 DECL_INLINE (newdecl) = 1; 2107 } 2108 } 2109 if (different_binding_level) 2110 return 0; 2111 2112 /* Copy most of the decl-specific fields of NEWDECL into OLDDECL. 2113 But preserve OLDDECL's DECL_UID. */ 2114 { 2115 unsigned olddecl_uid = DECL_UID (olddecl); 2116 2117 memcpy ((char *) olddecl + sizeof (struct tree_common), 2118 (char *) newdecl + sizeof (struct tree_common), 2119 sizeof (struct tree_decl) - sizeof (struct tree_common)); 2120 DECL_UID (olddecl) = olddecl_uid; 2121 } 2122 2123 /* NEWDECL contains the merged attribute lists. 2124 Update OLDDECL to be the same. */ 2125 DECL_ATTRIBUTES (olddecl) = DECL_ATTRIBUTES (newdecl); 2126 2127 return 1; 2128} 2129 2130/* Check whether decl-node X shadows an existing declaration. 2131 OLDLOCAL is the old IDENTIFIER_LOCAL_VALUE of the DECL_NAME of X, 2132 which might be a NULL_TREE. */ 2133static void 2134warn_if_shadowing (x, oldlocal) 2135 tree x, oldlocal; 2136{ 2137 tree name; 2138 2139 if (DECL_EXTERNAL (x)) 2140 return; 2141 2142 name = DECL_NAME (x); 2143 2144 /* Warn if shadowing an argument at the top level of the body. */ 2145 if (oldlocal != 0 2146 /* This warning doesn't apply to the parms of a nested fcn. */ 2147 && ! current_binding_level->parm_flag 2148 /* Check that this is one level down from the parms. */ 2149 && current_binding_level->level_chain->parm_flag 2150 /* Check that the decl being shadowed 2151 comes from the parm level, one level up. */ 2152 && chain_member (oldlocal, current_binding_level->level_chain->names)) 2153 { 2154 if (TREE_CODE (oldlocal) == PARM_DECL) 2155 pedwarn ("declaration of `%s' shadows a parameter", 2156 IDENTIFIER_POINTER (name)); 2157 else 2158 pedwarn ("declaration of `%s' shadows a symbol from the parameter list", 2159 IDENTIFIER_POINTER (name)); 2160 } 2161 /* Maybe warn if shadowing something else. */ 2162 else if (warn_shadow 2163 /* No shadow warnings for internally generated vars. */ 2164 && DECL_SOURCE_LINE (x) != 0 2165 /* No shadow warnings for vars made for inlining. */ 2166 && ! DECL_FROM_INLINE (x)) 2167 { 2168 if (TREE_CODE (x) == PARM_DECL 2169 && current_binding_level->level_chain->parm_flag) 2170 /* Don't warn about the parm names in function declarator 2171 within a function declarator. 2172 It would be nice to avoid warning in any function 2173 declarator in a declaration, as opposed to a definition, 2174 but there is no way to tell it's not a definition. */ 2175 ; 2176 else if (oldlocal) 2177 { 2178 if (TREE_CODE (oldlocal) == PARM_DECL) 2179 shadow_warning ("a parameter", name, oldlocal); 2180 else 2181 shadow_warning ("a previous local", name, oldlocal); 2182 } 2183 else if (IDENTIFIER_GLOBAL_VALUE (name) != 0 2184 && IDENTIFIER_GLOBAL_VALUE (name) != error_mark_node) 2185 shadow_warning ("a global declaration", name, 2186 IDENTIFIER_GLOBAL_VALUE (name)); 2187 } 2188} 2189 2190/* Record a decl-node X as belonging to the current lexical scope. 2191 Check for errors (such as an incompatible declaration for the same 2192 name already seen in the same scope). 2193 2194 Returns either X or an old decl for the same name. 2195 If an old decl is returned, it may have been smashed 2196 to agree with what X says. */ 2197 2198tree 2199pushdecl (x) 2200 tree x; 2201{ 2202 tree t; 2203 tree name = DECL_NAME (x); 2204 struct binding_level *b = current_binding_level; 2205 2206 /* Functions need the lang_decl data. */ 2207 if (TREE_CODE (x) == FUNCTION_DECL && ! DECL_LANG_SPECIFIC (x)) 2208 DECL_LANG_SPECIFIC (x) = (struct lang_decl *) 2209 ggc_alloc_cleared (sizeof (struct lang_decl)); 2210 2211 DECL_CONTEXT (x) = current_function_decl; 2212 /* A local extern declaration for a function doesn't constitute nesting. 2213 A local auto declaration does, since it's a forward decl 2214 for a nested function coming later. */ 2215 if ((TREE_CODE (x) == FUNCTION_DECL || TREE_CODE (x) == VAR_DECL) 2216 && DECL_INITIAL (x) == 0 && DECL_EXTERNAL (x)) 2217 DECL_CONTEXT (x) = 0; 2218 2219 if (name) 2220 { 2221 int different_binding_level = 0; 2222 2223 if (warn_nested_externs 2224 && DECL_EXTERNAL (x) 2225 && b != global_binding_level 2226 && x != IDENTIFIER_IMPLICIT_DECL (name) 2227 /* No error messages for __FUNCTION__ and __PRETTY_FUNCTION__. */ 2228 && !DECL_IN_SYSTEM_HEADER (x)) 2229 warning ("nested extern declaration of `%s'", 2230 IDENTIFIER_POINTER (name)); 2231 2232 t = lookup_name_current_level (name); 2233 /* Don't type check externs here when -traditional. This is so that 2234 code with conflicting declarations inside blocks will get warnings 2235 not errors. X11 for instance depends on this. */ 2236 if (! t && DECL_EXTERNAL (x) && TREE_PUBLIC (x) && ! flag_traditional) 2237 { 2238 t = IDENTIFIER_GLOBAL_VALUE (name); 2239 /* Type decls at global scope don't conflict with externs declared 2240 inside lexical blocks. */ 2241 if (! t || TREE_CODE (t) == TYPE_DECL) 2242 /* If there's no visible global declaration, try for an 2243 invisible one. */ 2244 t = IDENTIFIER_LIMBO_VALUE (name); 2245 different_binding_level = 1; 2246 } 2247 if (t != 0 && t == error_mark_node) 2248 /* error_mark_node is 0 for a while during initialization! */ 2249 { 2250 t = 0; 2251 error_with_decl (x, "`%s' used prior to declaration"); 2252 } 2253 2254 /* If this decl is `static' and an implicit decl was seen previously, 2255 warn. But don't complain if -traditional, 2256 since traditional compilers don't complain. */ 2257 if (! flag_traditional && TREE_PUBLIC (name) 2258 /* Don't test for DECL_EXTERNAL, because grokdeclarator 2259 sets this for all functions. */ 2260 && ! TREE_PUBLIC (x) 2261 && (TREE_CODE (x) == FUNCTION_DECL || b == global_binding_level) 2262 /* We used to warn also for explicit extern followed by static, 2263 but sometimes you need to do it that way. */ 2264 && IDENTIFIER_IMPLICIT_DECL (name) != 0) 2265 { 2266 pedwarn ("`%s' was declared implicitly `extern' and later `static'", 2267 IDENTIFIER_POINTER (name)); 2268 pedwarn_with_file_and_line 2269 (DECL_SOURCE_FILE (IDENTIFIER_IMPLICIT_DECL (name)), 2270 DECL_SOURCE_LINE (IDENTIFIER_IMPLICIT_DECL (name)), 2271 "previous declaration of `%s'", 2272 IDENTIFIER_POINTER (name)); 2273 TREE_THIS_VOLATILE (name) = 1; 2274 } 2275 2276 if (t != 0 && duplicate_decls (x, t, different_binding_level)) 2277 { 2278 if (TREE_CODE (t) == PARM_DECL) 2279 { 2280 /* Don't allow more than one "real" duplicate 2281 of a forward parm decl. */ 2282 TREE_ASM_WRITTEN (t) = TREE_ASM_WRITTEN (x); 2283 return t; 2284 } 2285 return t; 2286 } 2287 2288 /* If we are processing a typedef statement, generate a whole new 2289 ..._TYPE node (which will be just an variant of the existing 2290 ..._TYPE node with identical properties) and then install the 2291 TYPE_DECL node generated to represent the typedef name as the 2292 TYPE_NAME of this brand new (duplicate) ..._TYPE node. 2293 2294 The whole point here is to end up with a situation where each 2295 and every ..._TYPE node the compiler creates will be uniquely 2296 associated with AT MOST one node representing a typedef name. 2297 This way, even though the compiler substitutes corresponding 2298 ..._TYPE nodes for TYPE_DECL (i.e. "typedef name") nodes very 2299 early on, later parts of the compiler can always do the reverse 2300 translation and get back the corresponding typedef name. For 2301 example, given: 2302 2303 typedef struct S MY_TYPE; 2304 MY_TYPE object; 2305 2306 Later parts of the compiler might only know that `object' was of 2307 type `struct S' if it were not for code just below. With this 2308 code however, later parts of the compiler see something like: 2309 2310 struct S' == struct S 2311 typedef struct S' MY_TYPE; 2312 struct S' object; 2313 2314 And they can then deduce (from the node for type struct S') that 2315 the original object declaration was: 2316 2317 MY_TYPE object; 2318 2319 Being able to do this is important for proper support of protoize, 2320 and also for generating precise symbolic debugging information 2321 which takes full account of the programmer's (typedef) vocabulary. 2322 2323 Obviously, we don't want to generate a duplicate ..._TYPE node if 2324 the TYPE_DECL node that we are now processing really represents a 2325 standard built-in type. 2326 2327 Since all standard types are effectively declared at line zero 2328 in the source file, we can easily check to see if we are working 2329 on a standard type by checking the current value of lineno. */ 2330 2331 if (TREE_CODE (x) == TYPE_DECL) 2332 { 2333 if (DECL_SOURCE_LINE (x) == 0) 2334 { 2335 if (TYPE_NAME (TREE_TYPE (x)) == 0) 2336 TYPE_NAME (TREE_TYPE (x)) = x; 2337 } 2338 else if (TREE_TYPE (x) != error_mark_node 2339 && DECL_ORIGINAL_TYPE (x) == NULL_TREE) 2340 { 2341 tree tt = TREE_TYPE (x); 2342 DECL_ORIGINAL_TYPE (x) = tt; 2343 tt = build_type_copy (tt); 2344 TYPE_NAME (tt) = x; 2345 TREE_USED (tt) = TREE_USED (x); 2346 TREE_TYPE (x) = tt; 2347 } 2348 } 2349 2350 /* Multiple external decls of the same identifier ought to match. 2351 Check against both global declarations (when traditional) and out of 2352 scope (limbo) block level declarations. 2353 2354 We get warnings about inline functions where they are defined. 2355 Avoid duplicate warnings where they are used. */ 2356 if (TREE_PUBLIC (x) 2357 && ! (TREE_CODE (x) == FUNCTION_DECL && DECL_INLINE (x))) 2358 { 2359 tree decl; 2360 2361 if (flag_traditional && IDENTIFIER_GLOBAL_VALUE (name) != 0 2362 && (DECL_EXTERNAL (IDENTIFIER_GLOBAL_VALUE (name)) 2363 || TREE_PUBLIC (IDENTIFIER_GLOBAL_VALUE (name)))) 2364 decl = IDENTIFIER_GLOBAL_VALUE (name); 2365 else if (IDENTIFIER_LIMBO_VALUE (name) != 0) 2366 /* Decls in limbo are always extern, so no need to check that. */ 2367 decl = IDENTIFIER_LIMBO_VALUE (name); 2368 else 2369 decl = 0; 2370 2371 if (decl && ! comptypes (TREE_TYPE (x), TREE_TYPE (decl)) 2372 /* If old decl is built-in, we already warned if we should. */ 2373 && !DECL_BUILT_IN (decl)) 2374 { 2375 pedwarn_with_decl (x, 2376 "type mismatch with previous external decl"); 2377 pedwarn_with_decl (decl, "previous external decl of `%s'"); 2378 } 2379 } 2380 2381 /* If a function has had an implicit declaration, and then is defined, 2382 make sure they are compatible. */ 2383 2384 if (IDENTIFIER_IMPLICIT_DECL (name) != 0 2385 && IDENTIFIER_GLOBAL_VALUE (name) == 0 2386 && TREE_CODE (x) == FUNCTION_DECL 2387 && ! comptypes (TREE_TYPE (x), 2388 TREE_TYPE (IDENTIFIER_IMPLICIT_DECL (name)))) 2389 { 2390 warning_with_decl (x, "type mismatch with previous implicit declaration"); 2391 warning_with_decl (IDENTIFIER_IMPLICIT_DECL (name), 2392 "previous implicit declaration of `%s'"); 2393 } 2394 2395 /* In PCC-compatibility mode, extern decls of vars with no current decl 2396 take effect at top level no matter where they are. */ 2397 if (flag_traditional && DECL_EXTERNAL (x) 2398 && lookup_name (name) == 0) 2399 { 2400 tree type = TREE_TYPE (x); 2401 2402 /* But don't do this if the type contains temporary nodes. */ 2403 while (type) 2404 { 2405 if (type == error_mark_node) 2406 break; 2407 if (TYPE_CONTEXT (type)) 2408 { 2409 warning_with_decl (x, "type of external `%s' is not global"); 2410 /* By exiting the loop early, we leave TYPE nonzero, 2411 and thus prevent globalization of the decl. */ 2412 break; 2413 } 2414 else if (TREE_CODE (type) == FUNCTION_TYPE 2415 && TYPE_ARG_TYPES (type) != 0) 2416 /* The types might not be truly local, 2417 but the list of arg types certainly is temporary. 2418 Since prototypes are nontraditional, 2419 ok not to do the traditional thing. */ 2420 break; 2421 type = TREE_TYPE (type); 2422 } 2423 2424 if (type == 0) 2425 b = global_binding_level; 2426 } 2427 2428 /* This name is new in its binding level. 2429 Install the new declaration and return it. */ 2430 if (b == global_binding_level) 2431 { 2432 /* Install a global value. */ 2433 2434 /* If the first global decl has external linkage, 2435 warn if we later see static one. */ 2436 if (IDENTIFIER_GLOBAL_VALUE (name) == 0 && TREE_PUBLIC (x)) 2437 TREE_PUBLIC (name) = 1; 2438 2439 IDENTIFIER_GLOBAL_VALUE (name) = x; 2440 2441 /* We no longer care about any previous block level declarations. */ 2442 IDENTIFIER_LIMBO_VALUE (name) = 0; 2443 2444 /* Don't forget if the function was used via an implicit decl. */ 2445 if (IDENTIFIER_IMPLICIT_DECL (name) 2446 && TREE_USED (IDENTIFIER_IMPLICIT_DECL (name))) 2447 TREE_USED (x) = 1, TREE_USED (name) = 1; 2448 2449 /* Don't forget if its address was taken in that way. */ 2450 if (IDENTIFIER_IMPLICIT_DECL (name) 2451 && TREE_ADDRESSABLE (IDENTIFIER_IMPLICIT_DECL (name))) 2452 TREE_ADDRESSABLE (x) = 1; 2453 2454 /* Warn about mismatches against previous implicit decl. */ 2455 if (IDENTIFIER_IMPLICIT_DECL (name) != 0 2456 /* If this real decl matches the implicit, don't complain. */ 2457 && ! (TREE_CODE (x) == FUNCTION_DECL 2458 && (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (x))) 2459 == integer_type_node))) 2460 pedwarn ("`%s' was previously implicitly declared to return `int'", 2461 IDENTIFIER_POINTER (name)); 2462 2463 /* If this decl is `static' and an `extern' was seen previously, 2464 that is erroneous. */ 2465 if (TREE_PUBLIC (name) 2466 && ! TREE_PUBLIC (x) && ! DECL_EXTERNAL (x)) 2467 { 2468 /* Okay to redeclare an ANSI built-in as static. */ 2469 if (t != 0 && DECL_BUILT_IN (t)) 2470 ; 2471 /* Okay to declare a non-ANSI built-in as anything. */ 2472 else if (t != 0 && DECL_BUILT_IN_NONANSI (t)) 2473 ; 2474 /* Okay to have global type decl after an earlier extern 2475 declaration inside a lexical block. */ 2476 else if (TREE_CODE (x) == TYPE_DECL) 2477 ; 2478 else if (IDENTIFIER_IMPLICIT_DECL (name)) 2479 { 2480 if (! TREE_THIS_VOLATILE (name)) 2481 pedwarn ("`%s' was declared implicitly `extern' and later `static'", 2482 IDENTIFIER_POINTER (name)); 2483 } 2484 else 2485 pedwarn ("`%s' was declared `extern' and later `static'", 2486 IDENTIFIER_POINTER (name)); 2487 } 2488 } 2489 else 2490 { 2491 /* Here to install a non-global value. */ 2492 tree oldlocal = IDENTIFIER_LOCAL_VALUE (name); 2493 tree oldglobal = IDENTIFIER_GLOBAL_VALUE (name); 2494 2495 IDENTIFIER_LOCAL_VALUE (name) = x; 2496 2497 /* If this is an extern function declaration, see if we 2498 have a global definition or declaration for the function. */ 2499 if (oldlocal == 0 2500 && oldglobal != 0 2501 && TREE_CODE (x) == FUNCTION_DECL 2502 && TREE_CODE (oldglobal) == FUNCTION_DECL 2503 && DECL_EXTERNAL (x) 2504 && ! DECL_DECLARED_INLINE_P (x)) 2505 { 2506 /* We have one. Their types must agree. */ 2507 if (! comptypes (TREE_TYPE (x), 2508 TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (name)))) 2509 pedwarn_with_decl (x, "extern declaration of `%s' doesn't match global one"); 2510 else 2511 { 2512 /* Inner extern decl is inline if global one is. 2513 Copy enough to really inline it. */ 2514 if (DECL_DECLARED_INLINE_P (oldglobal)) 2515 { 2516 DECL_DECLARED_INLINE_P (x) 2517 = DECL_DECLARED_INLINE_P (oldglobal); 2518 DECL_INLINE (x) = DECL_INLINE (oldglobal); 2519 DECL_INITIAL (x) = (current_function_decl == oldglobal 2520 ? 0 : DECL_INITIAL (oldglobal)); 2521 DECL_SAVED_INSNS (x) = DECL_SAVED_INSNS (oldglobal); 2522 DECL_NUM_STMTS (x) = DECL_NUM_STMTS (oldglobal); 2523 DECL_ARGUMENTS (x) = DECL_ARGUMENTS (oldglobal); 2524 DECL_RESULT (x) = DECL_RESULT (oldglobal); 2525 TREE_ASM_WRITTEN (x) = TREE_ASM_WRITTEN (oldglobal); 2526 DECL_ABSTRACT_ORIGIN (x) 2527 = DECL_ABSTRACT_ORIGIN (oldglobal); 2528 } 2529 /* Inner extern decl is built-in if global one is. */ 2530 if (DECL_BUILT_IN (oldglobal)) 2531 { 2532 DECL_BUILT_IN_CLASS (x) = DECL_BUILT_IN_CLASS (oldglobal); 2533 DECL_FUNCTION_CODE (x) = DECL_FUNCTION_CODE (oldglobal); 2534 } 2535 /* Keep the arg types from a file-scope fcn defn. */ 2536 if (TYPE_ARG_TYPES (TREE_TYPE (oldglobal)) != 0 2537 && DECL_INITIAL (oldglobal) 2538 && TYPE_ARG_TYPES (TREE_TYPE (x)) == 0) 2539 TREE_TYPE (x) = TREE_TYPE (oldglobal); 2540 } 2541 } 2542 2543#if 0 2544 /* This case is probably sometimes the right thing to do. */ 2545 /* If we have a local external declaration, 2546 then any file-scope declaration should not 2547 have been static. */ 2548 if (oldlocal == 0 && oldglobal != 0 2549 && !TREE_PUBLIC (oldglobal) 2550 && DECL_EXTERNAL (x) && TREE_PUBLIC (x)) 2551 warning ("`%s' locally external but globally static", 2552 IDENTIFIER_POINTER (name)); 2553#endif 2554 2555 /* If we have a local external declaration, 2556 and no file-scope declaration has yet been seen, 2557 then if we later have a file-scope decl it must not be static. */ 2558 if (oldlocal == 0 2559 && DECL_EXTERNAL (x) 2560 && TREE_PUBLIC (x)) 2561 { 2562 if (oldglobal == 0) 2563 TREE_PUBLIC (name) = 1; 2564 2565 /* Save this decl, so that we can do type checking against 2566 other decls after it falls out of scope. 2567 2568 Only save it once. This prevents temporary decls created in 2569 expand_inline_function from being used here, since this 2570 will have been set when the inline function was parsed. 2571 It also helps give slightly better warnings. */ 2572 if (IDENTIFIER_LIMBO_VALUE (name) == 0) 2573 IDENTIFIER_LIMBO_VALUE (name) = x; 2574 } 2575 2576 warn_if_shadowing (x, oldlocal); 2577 2578 /* If storing a local value, there may already be one (inherited). 2579 If so, record it for restoration when this binding level ends. */ 2580 if (oldlocal != 0) 2581 b->shadowed = tree_cons (name, oldlocal, b->shadowed); 2582 } 2583 2584 /* Keep count of variables in this level with incomplete type. 2585 If the input is erroneous, we can have error_mark in the type 2586 slot (e.g. "f(void a, ...)") - that doesn't count as an 2587 incomplete type. */ 2588 if (TREE_TYPE (x) != error_mark_node 2589 && !COMPLETE_TYPE_P (TREE_TYPE (x))) 2590 { 2591 tree element = TREE_TYPE (x); 2592 2593 while (TREE_CODE (element) == ARRAY_TYPE) 2594 element = TREE_TYPE (element); 2595 if (TREE_CODE (element) == RECORD_TYPE 2596 || TREE_CODE (element) == UNION_TYPE) 2597 ++b->n_incomplete; 2598 } 2599 } 2600 2601 /* Put decls on list in reverse order. 2602 We will reverse them later if necessary. */ 2603 TREE_CHAIN (x) = b->names; 2604 b->names = x; 2605 2606 return x; 2607} 2608 2609/* Like pushdecl, only it places X in GLOBAL_BINDING_LEVEL, if appropriate. */ 2610 2611tree 2612pushdecl_top_level (x) 2613 tree x; 2614{ 2615 tree t; 2616 struct binding_level *b = current_binding_level; 2617 2618 current_binding_level = global_binding_level; 2619 t = pushdecl (x); 2620 current_binding_level = b; 2621 return t; 2622} 2623 2624/* Generate an implicit declaration for identifier FUNCTIONID 2625 as a function of type int (). Print a warning if appropriate. */ 2626 2627tree 2628implicitly_declare (functionid) 2629 tree functionid; 2630{ 2631 tree decl; 2632 int traditional_warning = 0; 2633 /* Only one "implicit declaration" warning per identifier. */ 2634 int implicit_warning; 2635 2636 /* We used to reuse an old implicit decl here, 2637 but this loses with inline functions because it can clobber 2638 the saved decl chains. */ 2639#if 0 2640 if (IDENTIFIER_IMPLICIT_DECL (functionid) != 0) 2641 decl = IDENTIFIER_IMPLICIT_DECL (functionid); 2642 else 2643#endif 2644 decl = build_decl (FUNCTION_DECL, functionid, default_function_type); 2645 2646 /* Warn of implicit decl following explicit local extern decl. 2647 This is probably a program designed for traditional C. */ 2648 if (TREE_PUBLIC (functionid) && IDENTIFIER_GLOBAL_VALUE (functionid) == 0) 2649 traditional_warning = 1; 2650 2651 /* Warn once of an implicit declaration. */ 2652 implicit_warning = (IDENTIFIER_IMPLICIT_DECL (functionid) == 0); 2653 2654 DECL_EXTERNAL (decl) = 1; 2655 TREE_PUBLIC (decl) = 1; 2656 2657 /* Record that we have an implicit decl and this is it. */ 2658 IDENTIFIER_IMPLICIT_DECL (functionid) = decl; 2659 2660 /* ANSI standard says implicit declarations are in the innermost block. 2661 So we record the decl in the standard fashion. 2662 If flag_traditional is set, pushdecl does it top-level. */ 2663 pushdecl (decl); 2664 2665 /* This is a no-op in c-lang.c or something real in objc-actions.c. */ 2666 maybe_objc_check_decl (decl); 2667 2668 rest_of_decl_compilation (decl, NULL, 0, 0); 2669 2670 if (implicit_warning) 2671 implicit_decl_warning (functionid); 2672 else if (warn_traditional && traditional_warning) 2673 warning ("function `%s' was previously declared within a block", 2674 IDENTIFIER_POINTER (functionid)); 2675 2676 /* Write a record describing this implicit function declaration to the 2677 prototypes file (if requested). */ 2678 2679 gen_aux_info_record (decl, 0, 1, 0); 2680 2681 /* Possibly apply some default attributes to this implicit declaration. */ 2682 decl_attributes (&decl, NULL_TREE, 0); 2683 2684 return decl; 2685} 2686 2687void 2688implicit_decl_warning (id) 2689 tree id; 2690{ 2691 const char *name = IDENTIFIER_POINTER (id); 2692 if (mesg_implicit_function_declaration == 2) 2693 error ("implicit declaration of function `%s'", name); 2694 else if (mesg_implicit_function_declaration == 1) 2695 warning ("implicit declaration of function `%s'", name); 2696} 2697 2698/* Return zero if the declaration NEWDECL is valid 2699 when the declaration OLDDECL (assumed to be for the same name) 2700 has already been seen. 2701 Otherwise return 1 if NEWDECL is a redefinition, 2 if it is a redeclaration, 2702 and 3 if it is a conflicting declaration. */ 2703 2704static int 2705redeclaration_error_message (newdecl, olddecl) 2706 tree newdecl, olddecl; 2707{ 2708 if (TREE_CODE (newdecl) == TYPE_DECL) 2709 { 2710 if (flag_traditional && TREE_TYPE (newdecl) == TREE_TYPE (olddecl)) 2711 return 0; 2712 /* pushdecl creates distinct types for TYPE_DECLs by calling 2713 build_type_copy, so the above comparison generally fails. We do 2714 another test against the TYPE_MAIN_VARIANT of the olddecl, which 2715 is equivalent to what this code used to do before the build_type_copy 2716 call. The variant type distinction should not matter for traditional 2717 code, because it doesn't have type qualifiers. */ 2718 if (flag_traditional 2719 && TYPE_MAIN_VARIANT (TREE_TYPE (olddecl)) == TREE_TYPE (newdecl)) 2720 return 0; 2721 if (DECL_IN_SYSTEM_HEADER (olddecl) || DECL_IN_SYSTEM_HEADER (newdecl)) 2722 return 0; 2723 return 1; 2724 } 2725 else if (TREE_CODE (newdecl) == FUNCTION_DECL) 2726 { 2727 /* Declarations of functions can insist on internal linkage 2728 but they can't be inconsistent with internal linkage, 2729 so there can be no error on that account. 2730 However defining the same name twice is no good. */ 2731 if (DECL_INITIAL (olddecl) != 0 && DECL_INITIAL (newdecl) != 0 2732 /* However, defining once as extern inline and a second 2733 time in another way is ok. */ 2734 && ! (DECL_DECLARED_INLINE_P (olddecl) && DECL_EXTERNAL (olddecl) 2735 && ! (DECL_DECLARED_INLINE_P (newdecl) 2736 && DECL_EXTERNAL (newdecl)))) 2737 return 1; 2738 return 0; 2739 } 2740 else if (DECL_CONTEXT (newdecl) == NULL_TREE) 2741 { 2742 /* Objects declared at top level: */ 2743 /* If at least one is a reference, it's ok. */ 2744 if (DECL_EXTERNAL (newdecl) || DECL_EXTERNAL (olddecl)) 2745 return 0; 2746 /* Reject two definitions. */ 2747 if (DECL_INITIAL (olddecl) != 0 && DECL_INITIAL (newdecl) != 0) 2748 return 1; 2749 /* Now we have two tentative defs, or one tentative and one real def. */ 2750 /* Insist that the linkage match. */ 2751 if (TREE_PUBLIC (olddecl) != TREE_PUBLIC (newdecl)) 2752 return 3; 2753 return 0; 2754 } 2755 else if (current_binding_level->parm_flag 2756 && TREE_ASM_WRITTEN (olddecl) && !TREE_ASM_WRITTEN (newdecl)) 2757 return 0; 2758 else 2759 { 2760 /* Newdecl has block scope. If olddecl has block scope also, then 2761 reject two definitions, and reject a definition together with an 2762 external reference. Otherwise, it is OK, because newdecl must 2763 be an extern reference to olddecl. */ 2764 if (!(DECL_EXTERNAL (newdecl) && DECL_EXTERNAL (olddecl)) 2765 && DECL_CONTEXT (newdecl) == DECL_CONTEXT (olddecl)) 2766 return 2; 2767 return 0; 2768 } 2769} 2770 2771/* Get the LABEL_DECL corresponding to identifier ID as a label. 2772 Create one if none exists so far for the current function. 2773 This function is called for both label definitions and label references. */ 2774 2775tree 2776lookup_label (id) 2777 tree id; 2778{ 2779 tree decl = IDENTIFIER_LABEL_VALUE (id); 2780 2781 if (current_function_decl == 0) 2782 { 2783 error ("label %s referenced outside of any function", 2784 IDENTIFIER_POINTER (id)); 2785 return 0; 2786 } 2787 2788 /* Use a label already defined or ref'd with this name. */ 2789 if (decl != 0) 2790 { 2791 /* But not if it is inherited and wasn't declared to be inheritable. */ 2792 if (DECL_CONTEXT (decl) != current_function_decl 2793 && ! C_DECLARED_LABEL_FLAG (decl)) 2794 return shadow_label (id); 2795 return decl; 2796 } 2797 2798 decl = build_decl (LABEL_DECL, id, void_type_node); 2799 2800 /* A label not explicitly declared must be local to where it's ref'd. */ 2801 DECL_CONTEXT (decl) = current_function_decl; 2802 2803 DECL_MODE (decl) = VOIDmode; 2804 2805 /* Say where one reference is to the label, 2806 for the sake of the error if it is not defined. */ 2807 DECL_SOURCE_LINE (decl) = lineno; 2808 DECL_SOURCE_FILE (decl) = input_filename; 2809 2810 IDENTIFIER_LABEL_VALUE (id) = decl; 2811 2812 named_labels = tree_cons (NULL_TREE, decl, named_labels); 2813 2814 return decl; 2815} 2816 2817/* Make a label named NAME in the current function, 2818 shadowing silently any that may be inherited from containing functions 2819 or containing scopes. 2820 2821 Note that valid use, if the label being shadowed 2822 comes from another scope in the same function, 2823 requires calling declare_nonlocal_label right away. */ 2824 2825tree 2826shadow_label (name) 2827 tree name; 2828{ 2829 tree decl = IDENTIFIER_LABEL_VALUE (name); 2830 2831 if (decl != 0) 2832 { 2833 tree dup; 2834 2835 /* Check to make sure that the label hasn't already been declared 2836 at this label scope */ 2837 for (dup = named_labels; dup; dup = TREE_CHAIN (dup)) 2838 if (TREE_VALUE (dup) == decl) 2839 { 2840 error ("duplicate label declaration `%s'", 2841 IDENTIFIER_POINTER (name)); 2842 error_with_decl (TREE_VALUE (dup), 2843 "this is a previous declaration"); 2844 /* Just use the previous declaration. */ 2845 return lookup_label (name); 2846 } 2847 2848 shadowed_labels = tree_cons (NULL_TREE, decl, shadowed_labels); 2849 IDENTIFIER_LABEL_VALUE (name) = decl = 0; 2850 } 2851 2852 return lookup_label (name); 2853} 2854 2855/* Define a label, specifying the location in the source file. 2856 Return the LABEL_DECL node for the label, if the definition is valid. 2857 Otherwise return 0. */ 2858 2859tree 2860define_label (filename, line, name) 2861 const char *filename; 2862 int line; 2863 tree name; 2864{ 2865 tree decl = lookup_label (name); 2866 2867 /* If label with this name is known from an outer context, shadow it. */ 2868 if (decl != 0 && DECL_CONTEXT (decl) != current_function_decl) 2869 { 2870 shadowed_labels = tree_cons (NULL_TREE, decl, shadowed_labels); 2871 IDENTIFIER_LABEL_VALUE (name) = 0; 2872 decl = lookup_label (name); 2873 } 2874 2875 if (warn_traditional && !in_system_header && lookup_name (name)) 2876 warning_with_file_and_line (filename, line, 2877 "traditional C lacks a separate namespace for labels, identifier `%s' conflicts", 2878 IDENTIFIER_POINTER (name)); 2879 2880 if (DECL_INITIAL (decl) != 0) 2881 { 2882 error_with_file_and_line (filename, line, "duplicate label `%s'", 2883 IDENTIFIER_POINTER (name)); 2884 return 0; 2885 } 2886 else 2887 { 2888 /* Mark label as having been defined. */ 2889 DECL_INITIAL (decl) = error_mark_node; 2890 /* Say where in the source. */ 2891 DECL_SOURCE_FILE (decl) = filename; 2892 DECL_SOURCE_LINE (decl) = line; 2893 return decl; 2894 } 2895} 2896 2897/* Return the list of declarations of the current level. 2898 Note that this list is in reverse order unless/until 2899 you nreverse it; and when you do nreverse it, you must 2900 store the result back using `storedecls' or you will lose. */ 2901 2902tree 2903getdecls () 2904{ 2905 return current_binding_level->names; 2906} 2907 2908/* Return the list of type-tags (for structs, etc) of the current level. */ 2909 2910tree 2911gettags () 2912{ 2913 return current_binding_level->tags; 2914} 2915 2916/* Store the list of declarations of the current level. 2917 This is done for the parameter declarations of a function being defined, 2918 after they are modified in the light of any missing parameters. */ 2919 2920static void 2921storedecls (decls) 2922 tree decls; 2923{ 2924 current_binding_level->names = decls; 2925} 2926 2927/* Similarly, store the list of tags of the current level. */ 2928 2929static void 2930storetags (tags) 2931 tree tags; 2932{ 2933 current_binding_level->tags = tags; 2934} 2935 2936/* Given NAME, an IDENTIFIER_NODE, 2937 return the structure (or union or enum) definition for that name. 2938 Searches binding levels from BINDING_LEVEL up to the global level. 2939 If THISLEVEL_ONLY is nonzero, searches only the specified context 2940 (but skips any tag-transparent contexts to find one that is 2941 meaningful for tags). 2942 CODE says which kind of type the caller wants; 2943 it is RECORD_TYPE or UNION_TYPE or ENUMERAL_TYPE. 2944 If the wrong kind of type is found, an error is reported. */ 2945 2946static tree 2947lookup_tag (code, name, binding_level, thislevel_only) 2948 enum tree_code code; 2949 struct binding_level *binding_level; 2950 tree name; 2951 int thislevel_only; 2952{ 2953 struct binding_level *level; 2954 int thislevel = 1; 2955 2956 for (level = binding_level; level; level = level->level_chain) 2957 { 2958 tree tail; 2959 for (tail = level->tags; tail; tail = TREE_CHAIN (tail)) 2960 { 2961 if (TREE_PURPOSE (tail) == name) 2962 { 2963 if (TREE_CODE (TREE_VALUE (tail)) != code) 2964 { 2965 /* Definition isn't the kind we were looking for. */ 2966 pending_invalid_xref = name; 2967 pending_invalid_xref_file = input_filename; 2968 pending_invalid_xref_line = lineno; 2969 /* If in the same binding level as a declaration as a tag 2970 of a different type, this must not be allowed to 2971 shadow that tag, so give the error immediately. 2972 (For example, "struct foo; union foo;" is invalid.) */ 2973 if (thislevel) 2974 pending_xref_error (); 2975 } 2976 return TREE_VALUE (tail); 2977 } 2978 } 2979 if (! level->tag_transparent) 2980 { 2981 if (thislevel_only) 2982 return NULL_TREE; 2983 thislevel = 0; 2984 } 2985 } 2986 return NULL_TREE; 2987} 2988 2989/* Print an error message now 2990 for a recent invalid struct, union or enum cross reference. 2991 We don't print them immediately because they are not invalid 2992 when used in the `struct foo;' construct for shadowing. */ 2993 2994void 2995pending_xref_error () 2996{ 2997 if (pending_invalid_xref != 0) 2998 error_with_file_and_line (pending_invalid_xref_file, 2999 pending_invalid_xref_line, 3000 "`%s' defined as wrong kind of tag", 3001 IDENTIFIER_POINTER (pending_invalid_xref)); 3002 pending_invalid_xref = 0; 3003} 3004 3005/* Given a type, find the tag that was defined for it and return the tag name. 3006 Otherwise return 0. */ 3007 3008static tree 3009lookup_tag_reverse (type) 3010 tree type; 3011{ 3012 struct binding_level *level; 3013 3014 for (level = current_binding_level; level; level = level->level_chain) 3015 { 3016 tree tail; 3017 for (tail = level->tags; tail; tail = TREE_CHAIN (tail)) 3018 { 3019 if (TREE_VALUE (tail) == type) 3020 return TREE_PURPOSE (tail); 3021 } 3022 } 3023 return NULL_TREE; 3024} 3025 3026/* Look up NAME in the current binding level and its superiors 3027 in the namespace of variables, functions and typedefs. 3028 Return a ..._DECL node of some kind representing its definition, 3029 or return 0 if it is undefined. */ 3030 3031tree 3032lookup_name (name) 3033 tree name; 3034{ 3035 tree val; 3036 3037 if (current_binding_level != global_binding_level 3038 && IDENTIFIER_LOCAL_VALUE (name)) 3039 val = IDENTIFIER_LOCAL_VALUE (name); 3040 else 3041 val = IDENTIFIER_GLOBAL_VALUE (name); 3042 return val; 3043} 3044 3045/* Similar to `lookup_name' but look only at current binding level. */ 3046 3047tree 3048lookup_name_current_level (name) 3049 tree name; 3050{ 3051 tree t; 3052 3053 if (current_binding_level == global_binding_level) 3054 return IDENTIFIER_GLOBAL_VALUE (name); 3055 3056 if (IDENTIFIER_LOCAL_VALUE (name) == 0) 3057 return 0; 3058 3059 for (t = current_binding_level->names; t; t = TREE_CHAIN (t)) 3060 if (DECL_NAME (t) == name) 3061 break; 3062 3063 return t; 3064} 3065 3066/* Mark ARG for GC. */ 3067 3068static void 3069mark_binding_level (arg) 3070 void *arg; 3071{ 3072 struct binding_level *level = *(struct binding_level **) arg; 3073 3074 for (; level != 0; level = level->level_chain) 3075 { 3076 ggc_mark_tree (level->names); 3077 ggc_mark_tree (level->tags); 3078 ggc_mark_tree (level->shadowed); 3079 ggc_mark_tree (level->blocks); 3080 ggc_mark_tree (level->this_block); 3081 ggc_mark_tree (level->parm_order); 3082 } 3083} 3084 3085/* Create the predefined scalar types of C, 3086 and some nodes representing standard constants (0, 1, (void *) 0). 3087 Initialize the global binding level. 3088 Make definitions for built-in primitive functions. */ 3089 3090void 3091c_init_decl_processing () 3092{ 3093 tree endlink; 3094 tree ptr_ftype_void, ptr_ftype_ptr; 3095 3096 /* Adds some ggc roots, and reserved words for c-parse.in. */ 3097 c_parse_init (); 3098 3099 current_function_decl = NULL; 3100 named_labels = NULL; 3101 current_binding_level = NULL_BINDING_LEVEL; 3102 free_binding_level = NULL_BINDING_LEVEL; 3103 3104 /* Make the binding_level structure for global names. */ 3105 pushlevel (0); 3106 global_binding_level = current_binding_level; 3107 3108 build_common_tree_nodes (flag_signed_char); 3109 3110 c_common_nodes_and_builtins (); 3111 3112 boolean_type_node = integer_type_node; 3113 boolean_true_node = integer_one_node; 3114 boolean_false_node = integer_zero_node; 3115 3116 c_bool_type_node = make_unsigned_type (BOOL_TYPE_SIZE); 3117 TREE_SET_CODE (c_bool_type_node, BOOLEAN_TYPE); 3118 TYPE_MAX_VALUE (c_bool_type_node) = build_int_2 (1, 0); 3119 TREE_TYPE (TYPE_MAX_VALUE (c_bool_type_node)) = c_bool_type_node; 3120 TYPE_PRECISION (c_bool_type_node) = 1; 3121 pushdecl (build_decl (TYPE_DECL, get_identifier ("_Bool"), 3122 c_bool_type_node)); 3123 c_bool_false_node = build_int_2 (0, 0); 3124 TREE_TYPE (c_bool_false_node) = c_bool_type_node; 3125 c_bool_true_node = build_int_2 (1, 0); 3126 TREE_TYPE (c_bool_true_node) = c_bool_type_node; 3127 3128 endlink = void_list_node; 3129 ptr_ftype_void = build_function_type (ptr_type_node, endlink); 3130 ptr_ftype_ptr 3131 = build_function_type (ptr_type_node, 3132 tree_cons (NULL_TREE, ptr_type_node, endlink)); 3133 3134 pedantic_lvalues = pedantic; 3135 3136 make_fname_decl = c_make_fname_decl; 3137 start_fname_decls (); 3138 3139 incomplete_decl_finalize_hook = finish_incomplete_decl; 3140 3141 /* Record our roots. */ 3142 3143 ggc_add_tree_root (c_global_trees, CTI_MAX); 3144 ggc_add_root (&c_stmt_tree, 1, sizeof c_stmt_tree, mark_stmt_tree); 3145 ggc_add_tree_root (&c_scope_stmt_stack, 1); 3146 ggc_add_tree_root (&named_labels, 1); 3147 ggc_add_tree_root (&shadowed_labels, 1); 3148 ggc_add_root (¤t_binding_level, 1, sizeof current_binding_level, 3149 mark_binding_level); 3150 ggc_add_root (&label_level_chain, 1, sizeof label_level_chain, 3151 mark_binding_level); 3152 ggc_add_tree_root (&static_ctors, 1); 3153 ggc_add_tree_root (&static_dtors, 1); 3154} 3155 3156/* Create the VAR_DECL for __FUNCTION__ etc. ID is the name to give the 3157 decl, NAME is the initialization string and TYPE_DEP indicates whether 3158 NAME depended on the type of the function. As we don't yet implement 3159 delayed emission of static data, we mark the decl as emitted 3160 so it is not placed in the output. Anything using it must therefore pull 3161 out the STRING_CST initializer directly. This does mean that these names 3162 are string merging candidates, which is wrong for C99's __func__. FIXME. */ 3163 3164static tree 3165c_make_fname_decl (id, type_dep) 3166 tree id; 3167 int type_dep; 3168{ 3169 const char *name = fname_as_string (type_dep); 3170 tree decl, type, init; 3171 size_t length = strlen (name); 3172 3173 type = build_array_type 3174 (build_qualified_type (char_type_node, TYPE_QUAL_CONST), 3175 build_index_type (size_int (length))); 3176 3177 decl = build_decl (VAR_DECL, id, type); 3178 /* We don't push the decl, so have to set its context here. */ 3179 DECL_CONTEXT (decl) = current_function_decl; 3180 3181 TREE_STATIC (decl) = 1; 3182 TREE_READONLY (decl) = 1; 3183 DECL_ARTIFICIAL (decl) = 1; 3184 3185 init = build_string (length + 1, name); 3186 TREE_TYPE (init) = type; 3187 DECL_INITIAL (decl) = init; 3188 3189 TREE_USED (decl) = 1; 3190 3191 finish_decl (decl, init, NULL_TREE); 3192 3193 return decl; 3194} 3195 3196/* Return a definition for a builtin function named NAME and whose data type 3197 is TYPE. TYPE should be a function type with argument types. 3198 FUNCTION_CODE tells later passes how to compile calls to this function. 3199 See tree.h for its possible values. 3200 3201 If LIBRARY_NAME is nonzero, use that for DECL_ASSEMBLER_NAME, 3202 the name to be called if we can't opencode the function. */ 3203 3204tree 3205builtin_function (name, type, function_code, class, library_name) 3206 const char *name; 3207 tree type; 3208 int function_code; 3209 enum built_in_class class; 3210 const char *library_name; 3211{ 3212 tree decl = build_decl (FUNCTION_DECL, get_identifier (name), type); 3213 DECL_EXTERNAL (decl) = 1; 3214 TREE_PUBLIC (decl) = 1; 3215 /* If -traditional, permit redefining a builtin function any way you like. 3216 (Though really, if the program redefines these functions, 3217 it probably won't work right unless compiled with -fno-builtin.) */ 3218 if (flag_traditional && name[0] != '_') 3219 DECL_BUILT_IN_NONANSI (decl) = 1; 3220 if (library_name) 3221 SET_DECL_ASSEMBLER_NAME (decl, get_identifier (library_name)); 3222 make_decl_rtl (decl, NULL); 3223 pushdecl (decl); 3224 DECL_BUILT_IN_CLASS (decl) = class; 3225 DECL_FUNCTION_CODE (decl) = function_code; 3226 3227 /* The return builtins leave the current function. */ 3228 if (function_code == BUILT_IN_RETURN || function_code == BUILT_IN_EH_RETURN) 3229 TREE_THIS_VOLATILE (decl) = 1; 3230 3231 /* Warn if a function in the namespace for users 3232 is used without an occasion to consider it declared. */ 3233 if (name[0] != '_' || name[1] != '_') 3234 C_DECL_ANTICIPATED (decl) = 1; 3235 3236 /* Possibly apply some default attributes to this built-in function. */ 3237 decl_attributes (&decl, NULL_TREE, 0); 3238 3239 return decl; 3240} 3241 3242/* Apply default attributes to a function, if a system function with default 3243 attributes. */ 3244 3245void 3246insert_default_attributes (decl) 3247 tree decl; 3248{ 3249 if (!TREE_PUBLIC (decl)) 3250 return; 3251 c_common_insert_default_attributes (decl); 3252} 3253 3254/* Called when a declaration is seen that contains no names to declare. 3255 If its type is a reference to a structure, union or enum inherited 3256 from a containing scope, shadow that tag name for the current scope 3257 with a forward reference. 3258 If its type defines a new named structure or union 3259 or defines an enum, it is valid but we need not do anything here. 3260 Otherwise, it is an error. */ 3261 3262void 3263shadow_tag (declspecs) 3264 tree declspecs; 3265{ 3266 shadow_tag_warned (declspecs, 0); 3267} 3268 3269void 3270shadow_tag_warned (declspecs, warned) 3271 tree declspecs; 3272 int warned; 3273 /* 1 => we have done a pedwarn. 2 => we have done a warning, but 3274 no pedwarn. */ 3275{ 3276 int found_tag = 0; 3277 tree link; 3278 tree specs, attrs; 3279 3280 pending_invalid_xref = 0; 3281 3282 /* Remove the attributes from declspecs, since they will confuse the 3283 following code. */ 3284 split_specs_attrs (declspecs, &specs, &attrs); 3285 3286 for (link = specs; link; link = TREE_CHAIN (link)) 3287 { 3288 tree value = TREE_VALUE (link); 3289 enum tree_code code = TREE_CODE (value); 3290 3291 if (code == RECORD_TYPE || code == UNION_TYPE || code == ENUMERAL_TYPE) 3292 /* Used to test also that TYPE_SIZE (value) != 0. 3293 That caused warning for `struct foo;' at top level in the file. */ 3294 { 3295 tree name = lookup_tag_reverse (value); 3296 tree t; 3297 3298 found_tag++; 3299 3300 if (name == 0) 3301 { 3302 if (warned != 1 && code != ENUMERAL_TYPE) 3303 /* Empty unnamed enum OK */ 3304 { 3305 pedwarn ("unnamed struct/union that defines no instances"); 3306 warned = 1; 3307 } 3308 } 3309 else 3310 { 3311 t = lookup_tag (code, name, current_binding_level, 1); 3312 3313 if (t == 0) 3314 { 3315 t = make_node (code); 3316 pushtag (name, t); 3317 } 3318 } 3319 } 3320 else 3321 { 3322 if (!warned && ! in_system_header) 3323 { 3324 warning ("useless keyword or type name in empty declaration"); 3325 warned = 2; 3326 } 3327 } 3328 } 3329 3330 if (found_tag > 1) 3331 error ("two types specified in one empty declaration"); 3332 3333 if (warned != 1) 3334 { 3335 if (found_tag == 0) 3336 pedwarn ("empty declaration"); 3337 } 3338} 3339 3340/* Construct an array declarator. EXPR is the expression inside [], or 3341 NULL_TREE. QUALS are the type qualifiers inside the [] (to be applied 3342 to the pointer to which a parameter array is converted). STATIC_P is 3343 non-zero if "static" is inside the [], zero otherwise. VLA_UNSPEC_P 3344 is non-zero is the array is [*], a VLA of unspecified length which is 3345 nevertheless a complete type (not currently implemented by GCC), 3346 zero otherwise. The declarator is constructed as an ARRAY_REF 3347 (to be decoded by grokdeclarator), whose operand 0 is what's on the 3348 left of the [] (filled by in set_array_declarator_type) and operand 1 3349 is the expression inside; whose TREE_TYPE is the type qualifiers and 3350 which has TREE_STATIC set if "static" is used. */ 3351 3352tree 3353build_array_declarator (expr, quals, static_p, vla_unspec_p) 3354 tree expr; 3355 tree quals; 3356 int static_p; 3357 int vla_unspec_p; 3358{ 3359 tree decl; 3360 decl = build_nt (ARRAY_REF, NULL_TREE, expr); 3361 TREE_TYPE (decl) = quals; 3362 TREE_STATIC (decl) = (static_p ? 1 : 0); 3363 if (pedantic && !flag_isoc99) 3364 { 3365 if (static_p || quals != NULL_TREE) 3366 pedwarn ("ISO C89 does not support `static' or type qualifiers in parameter array declarators"); 3367 if (vla_unspec_p) 3368 pedwarn ("ISO C89 does not support `[*]' array declarators"); 3369 } 3370 if (vla_unspec_p) 3371 warning ("GCC does not yet properly implement `[*]' array declarators"); 3372 return decl; 3373} 3374 3375/* Set the type of an array declarator. DECL is the declarator, as 3376 constructed by build_array_declarator; TYPE is what appears on the left 3377 of the [] and goes in operand 0. ABSTRACT_P is non-zero if it is an 3378 abstract declarator, zero otherwise; this is used to reject static and 3379 type qualifiers in abstract declarators, where they are not in the 3380 C99 grammar. */ 3381 3382tree 3383set_array_declarator_type (decl, type, abstract_p) 3384 tree decl; 3385 tree type; 3386 int abstract_p; 3387{ 3388 TREE_OPERAND (decl, 0) = type; 3389 if (abstract_p && (TREE_TYPE (decl) != NULL_TREE || TREE_STATIC (decl))) 3390 error ("static or type qualifiers in abstract declarator"); 3391 return decl; 3392} 3393 3394/* Decode a "typename", such as "int **", returning a ..._TYPE node. */ 3395 3396tree 3397groktypename (typename) 3398 tree typename; 3399{ 3400 tree specs, attrs; 3401 3402 if (TREE_CODE (typename) != TREE_LIST) 3403 return typename; 3404 3405 split_specs_attrs (TREE_PURPOSE (typename), &specs, &attrs); 3406 3407 typename = grokdeclarator (TREE_VALUE (typename), specs, TYPENAME, 0); 3408 3409 /* Apply attributes. */ 3410 decl_attributes (&typename, attrs, 0); 3411 3412 return typename; 3413} 3414 3415/* Return a PARM_DECL node for a given pair of specs and declarator. */ 3416 3417tree 3418groktypename_in_parm_context (typename) 3419 tree typename; 3420{ 3421 if (TREE_CODE (typename) != TREE_LIST) 3422 return typename; 3423 return grokdeclarator (TREE_VALUE (typename), 3424 TREE_PURPOSE (typename), 3425 PARM, 0); 3426} 3427 3428/* Decode a declarator in an ordinary declaration or data definition. 3429 This is called as soon as the type information and variable name 3430 have been parsed, before parsing the initializer if any. 3431 Here we create the ..._DECL node, fill in its type, 3432 and put it on the list of decls for the current context. 3433 The ..._DECL node is returned as the value. 3434 3435 Exception: for arrays where the length is not specified, 3436 the type is left null, to be filled in by `finish_decl'. 3437 3438 Function definitions do not come here; they go to start_function 3439 instead. However, external and forward declarations of functions 3440 do go through here. Structure field declarations are done by 3441 grokfield and not through here. */ 3442 3443tree 3444start_decl (declarator, declspecs, initialized, attributes) 3445 tree declarator, declspecs; 3446 int initialized; 3447 tree attributes; 3448{ 3449 tree decl; 3450 tree tem; 3451 3452 /* An object declared as __attribute__((deprecated)) suppresses 3453 warnings of uses of other deprecated items. */ 3454 if (lookup_attribute ("deprecated", attributes)) 3455 deprecated_state = DEPRECATED_SUPPRESS; 3456 3457 decl = grokdeclarator (declarator, declspecs, 3458 NORMAL, initialized); 3459 3460 deprecated_state = DEPRECATED_NORMAL; 3461 3462 if (warn_main > 0 && TREE_CODE (decl) != FUNCTION_DECL 3463 && MAIN_NAME_P (DECL_NAME (decl))) 3464 warning_with_decl (decl, "`%s' is usually a function"); 3465 3466 if (initialized) 3467 /* Is it valid for this decl to have an initializer at all? 3468 If not, set INITIALIZED to zero, which will indirectly 3469 tell `finish_decl' to ignore the initializer once it is parsed. */ 3470 switch (TREE_CODE (decl)) 3471 { 3472 case TYPE_DECL: 3473 error ("typedef `%s' is initialized (use __typeof__ instead)", 3474 IDENTIFIER_POINTER (DECL_NAME (decl))); 3475 initialized = 0; 3476 break; 3477 3478 case FUNCTION_DECL: 3479 error ("function `%s' is initialized like a variable", 3480 IDENTIFIER_POINTER (DECL_NAME (decl))); 3481 initialized = 0; 3482 break; 3483 3484 case PARM_DECL: 3485 /* DECL_INITIAL in a PARM_DECL is really DECL_ARG_TYPE. */ 3486 error ("parameter `%s' is initialized", 3487 IDENTIFIER_POINTER (DECL_NAME (decl))); 3488 initialized = 0; 3489 break; 3490 3491 default: 3492 /* Don't allow initializations for incomplete types 3493 except for arrays which might be completed by the initialization. */ 3494 3495 /* This can happen if the array size is an undefined macro. We already 3496 gave a warning, so we don't need another one. */ 3497 if (TREE_TYPE (decl) == error_mark_node) 3498 initialized = 0; 3499 else if (COMPLETE_TYPE_P (TREE_TYPE (decl))) 3500 { 3501 /* A complete type is ok if size is fixed. */ 3502 3503 if (TREE_CODE (TYPE_SIZE (TREE_TYPE (decl))) != INTEGER_CST 3504 || C_DECL_VARIABLE_SIZE (decl)) 3505 { 3506 error ("variable-sized object may not be initialized"); 3507 initialized = 0; 3508 } 3509 } 3510 else if (TREE_CODE (TREE_TYPE (decl)) != ARRAY_TYPE) 3511 { 3512 error ("variable `%s' has initializer but incomplete type", 3513 IDENTIFIER_POINTER (DECL_NAME (decl))); 3514 initialized = 0; 3515 } 3516 else if (!COMPLETE_TYPE_P (TREE_TYPE (TREE_TYPE (decl)))) 3517 { 3518 error ("elements of array `%s' have incomplete type", 3519 IDENTIFIER_POINTER (DECL_NAME (decl))); 3520 initialized = 0; 3521 } 3522 } 3523 3524 if (initialized) 3525 { 3526#if 0 3527 /* Seems redundant with grokdeclarator. */ 3528 if (current_binding_level != global_binding_level 3529 && DECL_EXTERNAL (decl) 3530 && TREE_CODE (decl) != FUNCTION_DECL) 3531 warning ("declaration of `%s' has `extern' and is initialized", 3532 IDENTIFIER_POINTER (DECL_NAME (decl))); 3533#endif 3534 DECL_EXTERNAL (decl) = 0; 3535 if (current_binding_level == global_binding_level) 3536 TREE_STATIC (decl) = 1; 3537 3538 /* Tell `pushdecl' this is an initialized decl 3539 even though we don't yet have the initializer expression. 3540 Also tell `finish_decl' it may store the real initializer. */ 3541 DECL_INITIAL (decl) = error_mark_node; 3542 } 3543 3544 /* If this is a function declaration, write a record describing it to the 3545 prototypes file (if requested). */ 3546 3547 if (TREE_CODE (decl) == FUNCTION_DECL) 3548 gen_aux_info_record (decl, 0, 0, TYPE_ARG_TYPES (TREE_TYPE (decl)) != 0); 3549 3550 /* ANSI specifies that a tentative definition which is not merged with 3551 a non-tentative definition behaves exactly like a definition with an 3552 initializer equal to zero. (Section 3.7.2) 3553 -fno-common gives strict ANSI behavior. Usually you don't want it. 3554 This matters only for variables with external linkage. */ 3555 if (! flag_no_common || ! TREE_PUBLIC (decl)) 3556 DECL_COMMON (decl) = 1; 3557 3558 /* Set attributes here so if duplicate decl, will have proper attributes. */ 3559 decl_attributes (&decl, attributes, 0); 3560 3561 /* If #pragma weak was used, mark the decl weak now. */ 3562 if (current_binding_level == global_binding_level) 3563 maybe_apply_pragma_weak (decl); 3564 3565 if (TREE_CODE (decl) == FUNCTION_DECL 3566 && DECL_DECLARED_INLINE_P (decl) 3567 && DECL_UNINLINABLE (decl) 3568 && lookup_attribute ("noinline", DECL_ATTRIBUTES (decl))) 3569 warning_with_decl (decl, 3570 "inline function `%s' given attribute noinline"); 3571 3572 /* Add this decl to the current binding level. 3573 TEM may equal DECL or it may be a previous decl of the same name. */ 3574 tem = pushdecl (decl); 3575 3576 /* For a local variable, define the RTL now. */ 3577 if (current_binding_level != global_binding_level 3578 /* But not if this is a duplicate decl 3579 and we preserved the rtl from the previous one 3580 (which may or may not happen). */ 3581 && !DECL_RTL_SET_P (tem) 3582 && !DECL_CONTEXT (tem)) 3583 { 3584 if (TREE_TYPE (tem) != error_mark_node 3585 && COMPLETE_TYPE_P (TREE_TYPE (tem))) 3586 expand_decl (tem); 3587 else if (TREE_CODE (TREE_TYPE (tem)) == ARRAY_TYPE 3588 && DECL_INITIAL (tem) != 0) 3589 expand_decl (tem); 3590 } 3591 3592 return tem; 3593} 3594 3595/* Finish processing of a declaration; 3596 install its initial value. 3597 If the length of an array type is not known before, 3598 it must be determined now, from the initial value, or it is an error. */ 3599 3600void 3601finish_decl (decl, init, asmspec_tree) 3602 tree decl, init; 3603 tree asmspec_tree; 3604{ 3605 tree type = TREE_TYPE (decl); 3606 int was_incomplete = (DECL_SIZE (decl) == 0); 3607 const char *asmspec = 0; 3608 3609 /* If a name was specified, get the string. */ 3610 if (current_binding_level == global_binding_level) 3611 asmspec_tree = maybe_apply_renaming_pragma (decl, asmspec_tree); 3612 if (asmspec_tree) 3613 asmspec = TREE_STRING_POINTER (asmspec_tree); 3614 3615 /* If `start_decl' didn't like having an initialization, ignore it now. */ 3616 if (init != 0 && DECL_INITIAL (decl) == 0) 3617 init = 0; 3618 3619 /* Don't crash if parm is initialized. */ 3620 if (TREE_CODE (decl) == PARM_DECL) 3621 init = 0; 3622 3623 if (init) 3624 store_init_value (decl, init); 3625 3626 /* Deduce size of array from initialization, if not already known */ 3627 if (TREE_CODE (type) == ARRAY_TYPE 3628 && TYPE_DOMAIN (type) == 0 3629 && TREE_CODE (decl) != TYPE_DECL) 3630 { 3631 int do_default 3632 = (TREE_STATIC (decl) 3633 /* Even if pedantic, an external linkage array 3634 may have incomplete type at first. */ 3635 ? pedantic && !TREE_PUBLIC (decl) 3636 : !DECL_EXTERNAL (decl)); 3637 int failure 3638 = complete_array_type (type, DECL_INITIAL (decl), do_default); 3639 3640 /* Get the completed type made by complete_array_type. */ 3641 type = TREE_TYPE (decl); 3642 3643 if (failure == 1) 3644 error_with_decl (decl, "initializer fails to determine size of `%s'"); 3645 3646 else if (failure == 2) 3647 { 3648 if (do_default) 3649 error_with_decl (decl, "array size missing in `%s'"); 3650 /* If a `static' var's size isn't known, 3651 make it extern as well as static, so it does not get 3652 allocated. 3653 If it is not `static', then do not mark extern; 3654 finish_incomplete_decl will give it a default size 3655 and it will get allocated. */ 3656 else if (!pedantic && TREE_STATIC (decl) && ! TREE_PUBLIC (decl)) 3657 DECL_EXTERNAL (decl) = 1; 3658 } 3659 3660 /* TYPE_MAX_VALUE is always one less than the number of elements 3661 in the array, because we start counting at zero. Therefore, 3662 warn only if the value is less than zero. */ 3663 else if (pedantic && TYPE_DOMAIN (type) != 0 3664 && tree_int_cst_sgn (TYPE_MAX_VALUE (TYPE_DOMAIN (type))) < 0) 3665 error_with_decl (decl, "zero or negative size array `%s'"); 3666 3667 layout_decl (decl, 0); 3668 } 3669 3670 if (TREE_CODE (decl) == VAR_DECL) 3671 { 3672 if (DECL_SIZE (decl) == 0 && TREE_TYPE (decl) != error_mark_node 3673 && COMPLETE_TYPE_P (TREE_TYPE (decl))) 3674 layout_decl (decl, 0); 3675 3676 if (DECL_SIZE (decl) == 0 3677 /* Don't give an error if we already gave one earlier. */ 3678 && TREE_TYPE (decl) != error_mark_node 3679 && (TREE_STATIC (decl) 3680 ? 3681 /* A static variable with an incomplete type 3682 is an error if it is initialized. 3683 Also if it is not file scope. 3684 Otherwise, let it through, but if it is not `extern' 3685 then it may cause an error message later. */ 3686 (DECL_INITIAL (decl) != 0 3687 || DECL_CONTEXT (decl) != 0) 3688 : 3689 /* An automatic variable with an incomplete type 3690 is an error. */ 3691 !DECL_EXTERNAL (decl))) 3692 { 3693 error_with_decl (decl, "storage size of `%s' isn't known"); 3694 TREE_TYPE (decl) = error_mark_node; 3695 } 3696 3697 if ((DECL_EXTERNAL (decl) || TREE_STATIC (decl)) 3698 && DECL_SIZE (decl) != 0) 3699 { 3700 if (TREE_CODE (DECL_SIZE (decl)) == INTEGER_CST) 3701 constant_expression_warning (DECL_SIZE (decl)); 3702 else 3703 error_with_decl (decl, "storage size of `%s' isn't constant"); 3704 } 3705 3706 if (TREE_USED (type)) 3707 TREE_USED (decl) = 1; 3708 } 3709 3710 /* If this is a function and an assembler name is specified, it isn't 3711 builtin any more. Also reset DECL_RTL so we can give it its new 3712 name. */ 3713 if (TREE_CODE (decl) == FUNCTION_DECL && asmspec) 3714 { 3715 DECL_BUILT_IN_CLASS (decl) = NOT_BUILT_IN; 3716 SET_DECL_RTL (decl, NULL_RTX); 3717 SET_DECL_ASSEMBLER_NAME (decl, get_identifier (asmspec)); 3718 } 3719 3720 /* Output the assembler code and/or RTL code for variables and functions, 3721 unless the type is an undefined structure or union. 3722 If not, it will get done when the type is completed. */ 3723 3724 if (TREE_CODE (decl) == VAR_DECL || TREE_CODE (decl) == FUNCTION_DECL) 3725 { 3726 /* This is a no-op in c-lang.c or something real in objc-actions.c. */ 3727 maybe_objc_check_decl (decl); 3728 3729 if (!DECL_CONTEXT (decl)) 3730 { 3731 if (DECL_INITIAL (decl) == NULL_TREE 3732 || DECL_INITIAL (decl) == error_mark_node) 3733 /* Don't output anything 3734 when a tentative file-scope definition is seen. 3735 But at end of compilation, do output code for them. */ 3736 DECL_DEFER_OUTPUT (decl) = 1; 3737 rest_of_decl_compilation (decl, asmspec, 3738 (DECL_CONTEXT (decl) == 0 3739 || TREE_ASM_WRITTEN (decl)), 0); 3740 } 3741 else 3742 { 3743 /* This is a local variable. If there is an ASMSPEC, the 3744 user has requested that we handle it specially. */ 3745 if (asmspec) 3746 { 3747 /* In conjunction with an ASMSPEC, the `register' 3748 keyword indicates that we should place the variable 3749 in a particular register. */ 3750 if (DECL_REGISTER (decl)) 3751 DECL_C_HARD_REGISTER (decl) = 1; 3752 3753 /* If this is not a static variable, issue a warning. 3754 It doesn't make any sense to give an ASMSPEC for an 3755 ordinary, non-register local variable. Historically, 3756 GCC has accepted -- but ignored -- the ASMSPEC in 3757 this case. */ 3758 if (TREE_CODE (decl) == VAR_DECL 3759 && !DECL_REGISTER (decl) 3760 && !TREE_STATIC (decl)) 3761 warning_with_decl (decl, 3762 "ignoring asm-specifier for non-static local variable `%s'"); 3763 else 3764 SET_DECL_ASSEMBLER_NAME (decl, get_identifier (asmspec)); 3765 } 3766 3767 if (TREE_CODE (decl) != FUNCTION_DECL) 3768 add_decl_stmt (decl); 3769 } 3770 3771 if (DECL_CONTEXT (decl) != 0) 3772 { 3773 /* Recompute the RTL of a local array now 3774 if it used to be an incomplete type. */ 3775 if (was_incomplete 3776 && ! TREE_STATIC (decl) && ! DECL_EXTERNAL (decl)) 3777 { 3778 /* If we used it already as memory, it must stay in memory. */ 3779 TREE_ADDRESSABLE (decl) = TREE_USED (decl); 3780 /* If it's still incomplete now, no init will save it. */ 3781 if (DECL_SIZE (decl) == 0) 3782 DECL_INITIAL (decl) = 0; 3783 } 3784 } 3785 } 3786 3787 if (TREE_CODE (decl) == TYPE_DECL) 3788 { 3789 /* This is a no-op in c-lang.c or something real in objc-actions.c. */ 3790 maybe_objc_check_decl (decl); 3791 rest_of_decl_compilation (decl, NULL, DECL_CONTEXT (decl) == 0, 0); 3792 } 3793 3794 /* At the end of a declaration, throw away any variable type sizes 3795 of types defined inside that declaration. There is no use 3796 computing them in the following function definition. */ 3797 if (current_binding_level == global_binding_level) 3798 get_pending_sizes (); 3799} 3800 3801/* If DECL has a cleanup, build and return that cleanup here. 3802 This is a callback called by expand_expr. */ 3803 3804tree 3805maybe_build_cleanup (decl) 3806 tree decl ATTRIBUTE_UNUSED; 3807{ 3808 /* There are no cleanups in C. */ 3809 return NULL_TREE; 3810} 3811 3812/* Given a parsed parameter declaration, 3813 decode it into a PARM_DECL and push that on the current binding level. 3814 Also, for the sake of forward parm decls, 3815 record the given order of parms in `parm_order'. */ 3816 3817void 3818push_parm_decl (parm) 3819 tree parm; 3820{ 3821 tree decl; 3822 int old_immediate_size_expand = immediate_size_expand; 3823 /* Don't try computing parm sizes now -- wait till fn is called. */ 3824 immediate_size_expand = 0; 3825 3826 decl = grokdeclarator (TREE_VALUE (TREE_PURPOSE (parm)), 3827 TREE_PURPOSE (TREE_PURPOSE (parm)), PARM, 0); 3828 decl_attributes (&decl, TREE_VALUE (parm), 0); 3829 3830#if 0 3831 if (DECL_NAME (decl)) 3832 { 3833 tree olddecl; 3834 olddecl = lookup_name (DECL_NAME (decl)); 3835 if (pedantic && olddecl != 0 && TREE_CODE (olddecl) == TYPE_DECL) 3836 pedwarn_with_decl (decl, 3837 "ISO C forbids parameter `%s' shadowing typedef"); 3838 } 3839#endif 3840 3841 decl = pushdecl (decl); 3842 3843 immediate_size_expand = old_immediate_size_expand; 3844 3845 current_binding_level->parm_order 3846 = tree_cons (NULL_TREE, decl, current_binding_level->parm_order); 3847 3848 /* Add this decl to the current binding level. */ 3849 finish_decl (decl, NULL_TREE, NULL_TREE); 3850} 3851 3852/* Clear the given order of parms in `parm_order'. 3853 Used at start of parm list, 3854 and also at semicolon terminating forward decls. */ 3855 3856void 3857clear_parm_order () 3858{ 3859 current_binding_level->parm_order = NULL_TREE; 3860} 3861 3862/* Build a COMPOUND_LITERAL_EXPR. TYPE is the type given in the compound 3863 literal, which may be an incomplete array type completed by the 3864 initializer; INIT is a CONSTRUCTOR that initializes the compound 3865 literal. */ 3866 3867tree 3868build_compound_literal (type, init) 3869 tree type; 3870 tree init; 3871{ 3872 /* We do not use start_decl here because we have a type, not a declarator; 3873 and do not use finish_decl because the decl should be stored inside 3874 the COMPOUND_LITERAL_EXPR rather than added elsewhere as a DECL_STMT. */ 3875 tree decl = build_decl (VAR_DECL, NULL_TREE, type); 3876 tree complit; 3877 tree stmt; 3878 DECL_EXTERNAL (decl) = 0; 3879 TREE_PUBLIC (decl) = 0; 3880 TREE_STATIC (decl) = (current_binding_level == global_binding_level); 3881 DECL_CONTEXT (decl) = current_function_decl; 3882 TREE_USED (decl) = 1; 3883 TREE_TYPE (decl) = type; 3884 TREE_READONLY (decl) = TREE_READONLY (type); 3885 store_init_value (decl, init); 3886 3887 if (TREE_CODE (type) == ARRAY_TYPE && !COMPLETE_TYPE_P (type)) 3888 { 3889 int failure = complete_array_type (type, DECL_INITIAL (decl), 1); 3890 if (failure) 3891 abort (); 3892 } 3893 3894 type = TREE_TYPE (decl); 3895 if (type == error_mark_node || !COMPLETE_TYPE_P (type)) 3896 return error_mark_node; 3897 3898 stmt = build_stmt (DECL_STMT, decl); 3899 complit = build1 (COMPOUND_LITERAL_EXPR, TREE_TYPE (decl), stmt); 3900 TREE_SIDE_EFFECTS (complit) = 1; 3901 3902 layout_decl (decl, 0); 3903 3904 if (TREE_STATIC (decl)) 3905 { 3906 /* This decl needs a name for the assembler output. We also need 3907 a unique suffix to be added to the name. */ 3908 char *name; 3909 extern int var_labelno; 3910 3911 ASM_FORMAT_PRIVATE_NAME (name, "__compound_literal", var_labelno); 3912 var_labelno++; 3913 DECL_NAME (decl) = get_identifier (name); 3914 DECL_DEFER_OUTPUT (decl) = 1; 3915 DECL_COMDAT (decl) = 1; 3916 DECL_ARTIFICIAL (decl) = 1; 3917 pushdecl (decl); 3918 rest_of_decl_compilation (decl, NULL, 1, 0); 3919 } 3920 3921 return complit; 3922} 3923 3924/* Make TYPE a complete type based on INITIAL_VALUE. 3925 Return 0 if successful, 1 if INITIAL_VALUE can't be deciphered, 3926 2 if there was no information (in which case assume 1 if DO_DEFAULT). */ 3927 3928int 3929complete_array_type (type, initial_value, do_default) 3930 tree type; 3931 tree initial_value; 3932 int do_default; 3933{ 3934 tree maxindex = NULL_TREE; 3935 int value = 0; 3936 3937 if (initial_value) 3938 { 3939 /* Note MAXINDEX is really the maximum index, 3940 one less than the size. */ 3941 if (TREE_CODE (initial_value) == STRING_CST) 3942 { 3943 int eltsize 3944 = int_size_in_bytes (TREE_TYPE (TREE_TYPE (initial_value))); 3945 maxindex = build_int_2 ((TREE_STRING_LENGTH (initial_value) 3946 / eltsize) - 1, 0); 3947 } 3948 else if (TREE_CODE (initial_value) == CONSTRUCTOR) 3949 { 3950 tree elts = CONSTRUCTOR_ELTS (initial_value); 3951 maxindex = build_int_2 (-1, -1); 3952 for (; elts; elts = TREE_CHAIN (elts)) 3953 { 3954 if (TREE_PURPOSE (elts)) 3955 maxindex = TREE_PURPOSE (elts); 3956 else 3957 maxindex = fold (build (PLUS_EXPR, integer_type_node, 3958 maxindex, integer_one_node)); 3959 } 3960 maxindex = copy_node (maxindex); 3961 } 3962 else 3963 { 3964 /* Make an error message unless that happened already. */ 3965 if (initial_value != error_mark_node) 3966 value = 1; 3967 3968 /* Prevent further error messages. */ 3969 maxindex = build_int_2 (0, 0); 3970 } 3971 } 3972 3973 if (!maxindex) 3974 { 3975 if (do_default) 3976 maxindex = build_int_2 (0, 0); 3977 value = 2; 3978 } 3979 3980 if (maxindex) 3981 { 3982 TYPE_DOMAIN (type) = build_index_type (maxindex); 3983 if (!TREE_TYPE (maxindex)) 3984 TREE_TYPE (maxindex) = TYPE_DOMAIN (type); 3985 } 3986 3987 /* Lay out the type now that we can get the real answer. */ 3988 3989 layout_type (type); 3990 3991 return value; 3992} 3993 3994/* Given declspecs and a declarator, 3995 determine the name and type of the object declared 3996 and construct a ..._DECL node for it. 3997 (In one case we can return a ..._TYPE node instead. 3998 For invalid input we sometimes return 0.) 3999 4000 DECLSPECS is a chain of tree_list nodes whose value fields 4001 are the storage classes and type specifiers. 4002 4003 DECL_CONTEXT says which syntactic context this declaration is in: 4004 NORMAL for most contexts. Make a VAR_DECL or FUNCTION_DECL or TYPE_DECL. 4005 FUNCDEF for a function definition. Like NORMAL but a few different 4006 error messages in each case. Return value may be zero meaning 4007 this definition is too screwy to try to parse. 4008 PARM for a parameter declaration (either within a function prototype 4009 or before a function body). Make a PARM_DECL, or return void_type_node. 4010 TYPENAME if for a typename (in a cast or sizeof). 4011 Don't make a DECL node; just return the ..._TYPE node. 4012 FIELD for a struct or union field; make a FIELD_DECL. 4013 BITFIELD for a field with specified width. 4014 INITIALIZED is 1 if the decl has an initializer. 4015 4016 In the TYPENAME case, DECLARATOR is really an absolute declarator. 4017 It may also be so in the PARM case, for a prototype where the 4018 argument type is specified but not the name. 4019 4020 This function is where the complicated C meanings of `static' 4021 and `extern' are interpreted. */ 4022 4023static tree 4024grokdeclarator (declarator, declspecs, decl_context, initialized) 4025 tree declspecs; 4026 tree declarator; 4027 enum decl_context decl_context; 4028 int initialized; 4029{ 4030 int specbits = 0; 4031 tree spec; 4032 tree type = NULL_TREE; 4033 int longlong = 0; 4034 int constp; 4035 int restrictp; 4036 int volatilep; 4037 int type_quals = TYPE_UNQUALIFIED; 4038 int inlinep; 4039 int explicit_int = 0; 4040 int explicit_char = 0; 4041 int defaulted_int = 0; 4042 tree typedef_decl = 0; 4043 const char *name; 4044 tree typedef_type = 0; 4045 int funcdef_flag = 0; 4046 enum tree_code innermost_code = ERROR_MARK; 4047 int bitfield = 0; 4048 int size_varies = 0; 4049 tree decl_attr = NULL_TREE; 4050 tree array_ptr_quals = NULL_TREE; 4051 int array_parm_static = 0; 4052 tree returned_attrs = NULL_TREE; 4053 4054 if (decl_context == BITFIELD) 4055 bitfield = 1, decl_context = FIELD; 4056 4057 if (decl_context == FUNCDEF) 4058 funcdef_flag = 1, decl_context = NORMAL; 4059 4060 /* Look inside a declarator for the name being declared 4061 and get it as a string, for an error message. */ 4062 { 4063 tree decl = declarator; 4064 name = 0; 4065 4066 while (decl) 4067 switch (TREE_CODE (decl)) 4068 { 4069 case ARRAY_REF: 4070 case INDIRECT_REF: 4071 case CALL_EXPR: 4072 innermost_code = TREE_CODE (decl); 4073 decl = TREE_OPERAND (decl, 0); 4074 break; 4075 4076 case TREE_LIST: 4077 decl = TREE_VALUE (decl); 4078 break; 4079 4080 case IDENTIFIER_NODE: 4081 name = IDENTIFIER_POINTER (decl); 4082 decl = 0; 4083 break; 4084 4085 default: 4086 abort (); 4087 } 4088 if (name == 0) 4089 name = "type name"; 4090 } 4091 4092 /* A function definition's declarator must have the form of 4093 a function declarator. */ 4094 4095 if (funcdef_flag && innermost_code != CALL_EXPR) 4096 return 0; 4097 4098 /* Anything declared one level down from the top level 4099 must be one of the parameters of a function 4100 (because the body is at least two levels down). */ 4101 4102 /* If this looks like a function definition, make it one, 4103 even if it occurs where parms are expected. 4104 Then store_parm_decls will reject it and not use it as a parm. */ 4105 if (decl_context == NORMAL && !funcdef_flag 4106 && current_binding_level->parm_flag) 4107 decl_context = PARM; 4108 4109 /* Look through the decl specs and record which ones appear. 4110 Some typespecs are defined as built-in typenames. 4111 Others, the ones that are modifiers of other types, 4112 are represented by bits in SPECBITS: set the bits for 4113 the modifiers that appear. Storage class keywords are also in SPECBITS. 4114 4115 If there is a typedef name or a type, store the type in TYPE. 4116 This includes builtin typedefs such as `int'. 4117 4118 Set EXPLICIT_INT or EXPLICIT_CHAR if the type is `int' or `char' 4119 and did not come from a user typedef. 4120 4121 Set LONGLONG if `long' is mentioned twice. */ 4122 4123 for (spec = declspecs; spec; spec = TREE_CHAIN (spec)) 4124 { 4125 tree id = TREE_VALUE (spec); 4126 4127 /* If the entire declaration is itself tagged as deprecated then 4128 suppress reports of deprecated items. */ 4129 if (id && TREE_DEPRECATED (id)) 4130 { 4131 if (deprecated_state != DEPRECATED_SUPPRESS) 4132 warn_deprecated_use (id); 4133 } 4134 4135 if (id == ridpointers[(int) RID_INT]) 4136 explicit_int = 1; 4137 if (id == ridpointers[(int) RID_CHAR]) 4138 explicit_char = 1; 4139 4140 if (TREE_CODE (id) == IDENTIFIER_NODE && C_IS_RESERVED_WORD (id)) 4141 { 4142 enum rid i = C_RID_CODE (id); 4143 if ((int) i <= (int) RID_LAST_MODIFIER) 4144 { 4145 if (i == RID_LONG && (specbits & (1 << (int) i))) 4146 { 4147 if (longlong) 4148 error ("`long long long' is too long for GCC"); 4149 else 4150 { 4151 if (pedantic && !flag_isoc99 && ! in_system_header 4152 && warn_long_long) 4153 pedwarn ("ISO C89 does not support `long long'"); 4154 longlong = 1; 4155 } 4156 } 4157 else if (specbits & (1 << (int) i)) 4158 pedwarn ("duplicate `%s'", IDENTIFIER_POINTER (id)); 4159 specbits |= 1 << (int) i; 4160 goto found; 4161 } 4162 } 4163 if (type) 4164 error ("two or more data types in declaration of `%s'", name); 4165 /* Actual typedefs come to us as TYPE_DECL nodes. */ 4166 else if (TREE_CODE (id) == TYPE_DECL) 4167 { 4168 if (TREE_TYPE (id) == error_mark_node) 4169 ; /* Allow the type to default to int to avoid cascading errors. */ 4170 else 4171 { 4172 type = TREE_TYPE (id); 4173 decl_attr = DECL_ATTRIBUTES (id); 4174 typedef_decl = id; 4175 } 4176 } 4177 /* Built-in types come as identifiers. */ 4178 else if (TREE_CODE (id) == IDENTIFIER_NODE) 4179 { 4180 tree t = lookup_name (id); 4181 if (TREE_TYPE (t) == error_mark_node) 4182 ; 4183 else if (!t || TREE_CODE (t) != TYPE_DECL) 4184 error ("`%s' fails to be a typedef or built in type", 4185 IDENTIFIER_POINTER (id)); 4186 else 4187 { 4188 type = TREE_TYPE (t); 4189 typedef_decl = t; 4190 } 4191 } 4192 else if (TREE_CODE (id) != ERROR_MARK) 4193 type = id; 4194 4195 found: 4196 ; 4197 } 4198 4199 typedef_type = type; 4200 if (type) 4201 size_varies = C_TYPE_VARIABLE_SIZE (type); 4202 4203 /* No type at all: default to `int', and set DEFAULTED_INT 4204 because it was not a user-defined typedef. */ 4205 4206 if (type == 0) 4207 { 4208 if ((! (specbits & ((1 << (int) RID_LONG) | (1 << (int) RID_SHORT) 4209 | (1 << (int) RID_SIGNED) 4210 | (1 << (int) RID_UNSIGNED) 4211 | (1 << (int) RID_COMPLEX)))) 4212 /* Don't warn about typedef foo = bar. */ 4213 && ! (specbits & (1 << (int) RID_TYPEDEF) && initialized) 4214 && ! in_system_header) 4215 { 4216 /* Issue a warning if this is an ISO C 99 program or if -Wreturn-type 4217 and this is a function, or if -Wimplicit; prefer the former 4218 warning since it is more explicit. */ 4219 if ((warn_implicit_int || warn_return_type || flag_isoc99) 4220 && funcdef_flag) 4221 warn_about_return_type = 1; 4222 else if (warn_implicit_int || flag_isoc99) 4223 pedwarn_c99 ("type defaults to `int' in declaration of `%s'", 4224 name); 4225 } 4226 4227 defaulted_int = 1; 4228 type = integer_type_node; 4229 } 4230 4231 /* Now process the modifiers that were specified 4232 and check for invalid combinations. */ 4233 4234 /* Long double is a special combination. */ 4235 4236 if ((specbits & 1 << (int) RID_LONG) && ! longlong 4237 && TYPE_MAIN_VARIANT (type) == double_type_node) 4238 { 4239 specbits &= ~(1 << (int) RID_LONG); 4240 type = long_double_type_node; 4241 } 4242 4243 /* Check all other uses of type modifiers. */ 4244 4245 if (specbits & ((1 << (int) RID_LONG) | (1 << (int) RID_SHORT) 4246 | (1 << (int) RID_UNSIGNED) | (1 << (int) RID_SIGNED))) 4247 { 4248 int ok = 0; 4249 4250 if ((specbits & 1 << (int) RID_LONG) 4251 && (specbits & 1 << (int) RID_SHORT)) 4252 error ("both long and short specified for `%s'", name); 4253 else if (((specbits & 1 << (int) RID_LONG) 4254 || (specbits & 1 << (int) RID_SHORT)) 4255 && explicit_char) 4256 error ("long or short specified with char for `%s'", name); 4257 else if (((specbits & 1 << (int) RID_LONG) 4258 || (specbits & 1 << (int) RID_SHORT)) 4259 && TREE_CODE (type) == REAL_TYPE) 4260 { 4261 static int already = 0; 4262 4263 error ("long or short specified with floating type for `%s'", name); 4264 if (! already && ! pedantic) 4265 { 4266 error ("the only valid combination is `long double'"); 4267 already = 1; 4268 } 4269 } 4270 else if ((specbits & 1 << (int) RID_SIGNED) 4271 && (specbits & 1 << (int) RID_UNSIGNED)) 4272 error ("both signed and unsigned specified for `%s'", name); 4273 else if (TREE_CODE (type) != INTEGER_TYPE) 4274 error ("long, short, signed or unsigned invalid for `%s'", name); 4275 else 4276 { 4277 ok = 1; 4278 if (!explicit_int && !defaulted_int && !explicit_char && pedantic) 4279 { 4280 pedwarn ("long, short, signed or unsigned used invalidly for `%s'", 4281 name); 4282 if (flag_pedantic_errors) 4283 ok = 0; 4284 } 4285 } 4286 4287 /* Discard the type modifiers if they are invalid. */ 4288 if (! ok) 4289 { 4290 specbits &= ~((1 << (int) RID_LONG) | (1 << (int) RID_SHORT) 4291 | (1 << (int) RID_UNSIGNED) | (1 << (int) RID_SIGNED)); 4292 longlong = 0; 4293 } 4294 } 4295 4296 if ((specbits & (1 << (int) RID_COMPLEX)) 4297 && TREE_CODE (type) != INTEGER_TYPE && TREE_CODE (type) != REAL_TYPE) 4298 { 4299 error ("complex invalid for `%s'", name); 4300 specbits &= ~(1 << (int) RID_COMPLEX); 4301 } 4302 4303 /* Decide whether an integer type is signed or not. 4304 Optionally treat bitfields as signed by default. */ 4305 if (specbits & 1 << (int) RID_UNSIGNED 4306 /* Traditionally, all bitfields are unsigned. */ 4307 || (bitfield && flag_traditional 4308 && (! explicit_flag_signed_bitfields || !flag_signed_bitfields)) 4309 || (bitfield && ! flag_signed_bitfields 4310 && (explicit_int || defaulted_int || explicit_char 4311 /* A typedef for plain `int' without `signed' 4312 can be controlled just like plain `int'. */ 4313 || ! (typedef_decl != 0 4314 && C_TYPEDEF_EXPLICITLY_SIGNED (typedef_decl))) 4315 && TREE_CODE (type) != ENUMERAL_TYPE 4316 && !(specbits & 1 << (int) RID_SIGNED))) 4317 { 4318 if (longlong) 4319 type = long_long_unsigned_type_node; 4320 else if (specbits & 1 << (int) RID_LONG) 4321 type = long_unsigned_type_node; 4322 else if (specbits & 1 << (int) RID_SHORT) 4323 type = short_unsigned_type_node; 4324 else if (type == char_type_node) 4325 type = unsigned_char_type_node; 4326 else if (typedef_decl) 4327 type = unsigned_type (type); 4328 else 4329 type = unsigned_type_node; 4330 } 4331 else if ((specbits & 1 << (int) RID_SIGNED) 4332 && type == char_type_node) 4333 type = signed_char_type_node; 4334 else if (longlong) 4335 type = long_long_integer_type_node; 4336 else if (specbits & 1 << (int) RID_LONG) 4337 type = long_integer_type_node; 4338 else if (specbits & 1 << (int) RID_SHORT) 4339 type = short_integer_type_node; 4340 4341 if (specbits & 1 << (int) RID_COMPLEX) 4342 { 4343 if (pedantic && !flag_isoc99) 4344 pedwarn ("ISO C89 does not support complex types"); 4345 /* If we just have "complex", it is equivalent to 4346 "complex double", but if any modifiers at all are specified it is 4347 the complex form of TYPE. E.g, "complex short" is 4348 "complex short int". */ 4349 4350 if (defaulted_int && ! longlong 4351 && ! (specbits & ((1 << (int) RID_LONG) | (1 << (int) RID_SHORT) 4352 | (1 << (int) RID_SIGNED) 4353 | (1 << (int) RID_UNSIGNED)))) 4354 { 4355 if (pedantic) 4356 pedwarn ("ISO C does not support plain `complex' meaning `double complex'"); 4357 type = complex_double_type_node; 4358 } 4359 else if (type == integer_type_node) 4360 { 4361 if (pedantic) 4362 pedwarn ("ISO C does not support complex integer types"); 4363 type = complex_integer_type_node; 4364 } 4365 else if (type == float_type_node) 4366 type = complex_float_type_node; 4367 else if (type == double_type_node) 4368 type = complex_double_type_node; 4369 else if (type == long_double_type_node) 4370 type = complex_long_double_type_node; 4371 else 4372 { 4373 if (pedantic) 4374 pedwarn ("ISO C does not support complex integer types"); 4375 type = build_complex_type (type); 4376 } 4377 } 4378 4379 /* Figure out the type qualifiers for the declaration. There are 4380 two ways a declaration can become qualified. One is something 4381 like `const int i' where the `const' is explicit. Another is 4382 something like `typedef const int CI; CI i' where the type of the 4383 declaration contains the `const'. */ 4384 constp = !! (specbits & 1 << (int) RID_CONST) + TYPE_READONLY (type); 4385 restrictp = !! (specbits & 1 << (int) RID_RESTRICT) + TYPE_RESTRICT (type); 4386 volatilep = !! (specbits & 1 << (int) RID_VOLATILE) + TYPE_VOLATILE (type); 4387 inlinep = !! (specbits & (1 << (int) RID_INLINE)); 4388 if (constp > 1 && ! flag_isoc99) 4389 pedwarn ("duplicate `const'"); 4390 if (restrictp > 1 && ! flag_isoc99) 4391 pedwarn ("duplicate `restrict'"); 4392 if (volatilep > 1 && ! flag_isoc99) 4393 pedwarn ("duplicate `volatile'"); 4394 if (! flag_gen_aux_info && (TYPE_QUALS (type))) 4395 type = TYPE_MAIN_VARIANT (type); 4396 type_quals = ((constp ? TYPE_QUAL_CONST : 0) 4397 | (restrictp ? TYPE_QUAL_RESTRICT : 0) 4398 | (volatilep ? TYPE_QUAL_VOLATILE : 0)); 4399 4400 /* Warn if two storage classes are given. Default to `auto'. */ 4401 4402 { 4403 int nclasses = 0; 4404 4405 if (specbits & 1 << (int) RID_AUTO) nclasses++; 4406 if (specbits & 1 << (int) RID_STATIC) nclasses++; 4407 if (specbits & 1 << (int) RID_EXTERN) nclasses++; 4408 if (specbits & 1 << (int) RID_REGISTER) nclasses++; 4409 if (specbits & 1 << (int) RID_TYPEDEF) nclasses++; 4410 4411 /* Warn about storage classes that are invalid for certain 4412 kinds of declarations (parameters, typenames, etc.). */ 4413 4414 if (nclasses > 1) 4415 error ("multiple storage classes in declaration of `%s'", name); 4416 else if (funcdef_flag 4417 && (specbits 4418 & ((1 << (int) RID_REGISTER) 4419 | (1 << (int) RID_AUTO) 4420 | (1 << (int) RID_TYPEDEF)))) 4421 { 4422 if (specbits & 1 << (int) RID_AUTO 4423 && (pedantic || current_binding_level == global_binding_level)) 4424 pedwarn ("function definition declared `auto'"); 4425 if (specbits & 1 << (int) RID_REGISTER) 4426 error ("function definition declared `register'"); 4427 if (specbits & 1 << (int) RID_TYPEDEF) 4428 error ("function definition declared `typedef'"); 4429 specbits &= ~((1 << (int) RID_TYPEDEF) | (1 << (int) RID_REGISTER) 4430 | (1 << (int) RID_AUTO)); 4431 } 4432 else if (decl_context != NORMAL && nclasses > 0) 4433 { 4434 if (decl_context == PARM && specbits & 1 << (int) RID_REGISTER) 4435 ; 4436 else 4437 { 4438 switch (decl_context) 4439 { 4440 case FIELD: 4441 error ("storage class specified for structure field `%s'", 4442 name); 4443 break; 4444 case PARM: 4445 error ("storage class specified for parameter `%s'", name); 4446 break; 4447 default: 4448 error ("storage class specified for typename"); 4449 break; 4450 } 4451 specbits &= ~((1 << (int) RID_TYPEDEF) | (1 << (int) RID_REGISTER) 4452 | (1 << (int) RID_AUTO) | (1 << (int) RID_STATIC) 4453 | (1 << (int) RID_EXTERN)); 4454 } 4455 } 4456 else if (specbits & 1 << (int) RID_EXTERN && initialized && ! funcdef_flag) 4457 { 4458 /* `extern' with initialization is invalid if not at top level. */ 4459 if (current_binding_level == global_binding_level) 4460 warning ("`%s' initialized and declared `extern'", name); 4461 else 4462 error ("`%s' has both `extern' and initializer", name); 4463 } 4464 else if (specbits & 1 << (int) RID_EXTERN && funcdef_flag 4465 && current_binding_level != global_binding_level) 4466 error ("nested function `%s' declared `extern'", name); 4467 else if (current_binding_level == global_binding_level 4468 && specbits & (1 << (int) RID_AUTO)) 4469 error ("top-level declaration of `%s' specifies `auto'", name); 4470 } 4471 4472 /* Now figure out the structure of the declarator proper. 4473 Descend through it, creating more complex types, until we reach 4474 the declared identifier (or NULL_TREE, in an absolute declarator). */ 4475 4476 while (declarator && TREE_CODE (declarator) != IDENTIFIER_NODE) 4477 { 4478 if (type == error_mark_node) 4479 { 4480 declarator = TREE_OPERAND (declarator, 0); 4481 continue; 4482 } 4483 4484 /* Each level of DECLARATOR is either an ARRAY_REF (for ...[..]), 4485 an INDIRECT_REF (for *...), 4486 a CALL_EXPR (for ...(...)), 4487 a TREE_LIST (for nested attributes), 4488 an identifier (for the name being declared) 4489 or a null pointer (for the place in an absolute declarator 4490 where the name was omitted). 4491 For the last two cases, we have just exited the loop. 4492 4493 At this point, TYPE is the type of elements of an array, 4494 or for a function to return, or for a pointer to point to. 4495 After this sequence of ifs, TYPE is the type of the 4496 array or function or pointer, and DECLARATOR has had its 4497 outermost layer removed. */ 4498 4499 if (array_ptr_quals != NULL_TREE || array_parm_static) 4500 { 4501 /* Only the innermost declarator (making a parameter be of 4502 array type which is converted to pointer type) 4503 may have static or type qualifiers. */ 4504 error ("static or type qualifiers in non-parameter array declarator"); 4505 array_ptr_quals = NULL_TREE; 4506 array_parm_static = 0; 4507 } 4508 4509 if (TREE_CODE (declarator) == TREE_LIST) 4510 { 4511 /* We encode a declarator with embedded attributes using 4512 a TREE_LIST. */ 4513 tree attrs = TREE_PURPOSE (declarator); 4514 tree inner_decl; 4515 int attr_flags = 0; 4516 declarator = TREE_VALUE (declarator); 4517 inner_decl = declarator; 4518 while (inner_decl != NULL_TREE 4519 && TREE_CODE (inner_decl) == TREE_LIST) 4520 inner_decl = TREE_VALUE (inner_decl); 4521 if (inner_decl == NULL_TREE 4522 || TREE_CODE (inner_decl) == IDENTIFIER_NODE) 4523 attr_flags |= (int) ATTR_FLAG_DECL_NEXT; 4524 else if (TREE_CODE (inner_decl) == CALL_EXPR) 4525 attr_flags |= (int) ATTR_FLAG_FUNCTION_NEXT; 4526 else if (TREE_CODE (inner_decl) == ARRAY_REF) 4527 attr_flags |= (int) ATTR_FLAG_ARRAY_NEXT; 4528 returned_attrs = decl_attributes (&type, 4529 chainon (returned_attrs, attrs), 4530 attr_flags); 4531 } 4532 else if (TREE_CODE (declarator) == ARRAY_REF) 4533 { 4534 tree itype = NULL_TREE; 4535 tree size = TREE_OPERAND (declarator, 1); 4536 /* The index is a signed object `sizetype' bits wide. */ 4537 tree index_type = signed_type (sizetype); 4538 4539 array_ptr_quals = TREE_TYPE (declarator); 4540 array_parm_static = TREE_STATIC (declarator); 4541 4542 declarator = TREE_OPERAND (declarator, 0); 4543 4544 /* Check for some types that there cannot be arrays of. */ 4545 4546 if (VOID_TYPE_P (type)) 4547 { 4548 error ("declaration of `%s' as array of voids", name); 4549 type = error_mark_node; 4550 } 4551 4552 if (TREE_CODE (type) == FUNCTION_TYPE) 4553 { 4554 error ("declaration of `%s' as array of functions", name); 4555 type = error_mark_node; 4556 } 4557 4558 if (size == error_mark_node) 4559 type = error_mark_node; 4560 4561 if (type == error_mark_node) 4562 continue; 4563 4564 /* If size was specified, set ITYPE to a range-type for that size. 4565 Otherwise, ITYPE remains null. finish_decl may figure it out 4566 from an initial value. */ 4567 4568 if (size) 4569 { 4570 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */ 4571 STRIP_TYPE_NOPS (size); 4572 4573 if (! INTEGRAL_TYPE_P (TREE_TYPE (size))) 4574 { 4575 error ("size of array `%s' has non-integer type", name); 4576 size = integer_one_node; 4577 } 4578 4579 if (pedantic && integer_zerop (size)) 4580 pedwarn ("ISO C forbids zero-size array `%s'", name); 4581 4582 if (TREE_CODE (size) == INTEGER_CST) 4583 { 4584 constant_expression_warning (size); 4585 if (tree_int_cst_sgn (size) < 0) 4586 { 4587 error ("size of array `%s' is negative", name); 4588 size = integer_one_node; 4589 } 4590 } 4591 else 4592 { 4593 /* Make sure the array size remains visibly nonconstant 4594 even if it is (eg) a const variable with known value. */ 4595 size_varies = 1; 4596 4597 if (!flag_isoc99 && pedantic) 4598 { 4599 if (TREE_CONSTANT (size)) 4600 pedwarn ("ISO C89 forbids array `%s' whose size can't be evaluated", 4601 name); 4602 else 4603 pedwarn ("ISO C89 forbids variable-size array `%s'", 4604 name); 4605 } 4606 } 4607 4608 if (integer_zerop (size)) 4609 { 4610 /* A zero-length array cannot be represented with an 4611 unsigned index type, which is what we'll get with 4612 build_index_type. Create an open-ended range instead. */ 4613 itype = build_range_type (sizetype, size, NULL_TREE); 4614 } 4615 else 4616 { 4617 /* Compute the maximum valid index, that is, size - 1. 4618 Do the calculation in index_type, so that if it is 4619 a variable the computations will be done in the 4620 proper mode. */ 4621 itype = fold (build (MINUS_EXPR, index_type, 4622 convert (index_type, size), 4623 convert (index_type, size_one_node))); 4624 4625 /* If that overflowed, the array is too big. 4626 ??? While a size of INT_MAX+1 technically shouldn't 4627 cause an overflow (because we subtract 1), the overflow 4628 is recorded during the conversion to index_type, before 4629 the subtraction. Handling this case seems like an 4630 unnecessary complication. */ 4631 if (TREE_OVERFLOW (itype)) 4632 { 4633 error ("size of array `%s' is too large", name); 4634 type = error_mark_node; 4635 continue; 4636 } 4637 4638 if (size_varies) 4639 itype = variable_size (itype); 4640 itype = build_index_type (itype); 4641 } 4642 } 4643 else if (decl_context == FIELD) 4644 { 4645 if (pedantic && !flag_isoc99 && !in_system_header) 4646 pedwarn ("ISO C89 does not support flexible array members"); 4647 4648 /* ISO C99 Flexible array members are effectively identical 4649 to GCC's zero-length array extension. */ 4650 itype = build_range_type (sizetype, size_zero_node, NULL_TREE); 4651 } 4652 4653 /* If pedantic, complain about arrays of incomplete types. */ 4654 4655 if (pedantic && !COMPLETE_TYPE_P (type)) 4656 pedwarn ("array type has incomplete element type"); 4657 4658#if 0 4659 /* We shouldn't have a function type here at all! 4660 Functions aren't allowed as array elements. */ 4661 if (pedantic && TREE_CODE (type) == FUNCTION_TYPE 4662 && (constp || volatilep)) 4663 pedwarn ("ISO C forbids const or volatile function types"); 4664#endif 4665 4666 /* Build the array type itself, then merge any constancy or 4667 volatility into the target type. We must do it in this order 4668 to ensure that the TYPE_MAIN_VARIANT field of the array type 4669 is set correctly. */ 4670 4671 type = build_array_type (type, itype); 4672 if (type_quals) 4673 type = c_build_qualified_type (type, type_quals); 4674 4675 if (size_varies) 4676 C_TYPE_VARIABLE_SIZE (type) = 1; 4677 4678 /* The GCC extension for zero-length arrays differs from 4679 ISO flexible array members in that sizeof yields zero. */ 4680 if (size && integer_zerop (size)) 4681 { 4682 layout_type (type); 4683 TYPE_SIZE (type) = bitsize_zero_node; 4684 TYPE_SIZE_UNIT (type) = size_zero_node; 4685 } 4686 if (decl_context != PARM 4687 && (array_ptr_quals != NULL_TREE || array_parm_static)) 4688 { 4689 error ("static or type qualifiers in non-parameter array declarator"); 4690 array_ptr_quals = NULL_TREE; 4691 array_parm_static = 0; 4692 } 4693 } 4694 else if (TREE_CODE (declarator) == CALL_EXPR) 4695 { 4696 tree arg_types; 4697 4698 /* Declaring a function type. 4699 Make sure we have a valid type for the function to return. */ 4700 if (type == error_mark_node) 4701 continue; 4702 4703 size_varies = 0; 4704 4705 /* Warn about some types functions can't return. */ 4706 4707 if (TREE_CODE (type) == FUNCTION_TYPE) 4708 { 4709 error ("`%s' declared as function returning a function", name); 4710 type = integer_type_node; 4711 } 4712 if (TREE_CODE (type) == ARRAY_TYPE) 4713 { 4714 error ("`%s' declared as function returning an array", name); 4715 type = integer_type_node; 4716 } 4717 4718#ifndef TRADITIONAL_RETURN_FLOAT 4719 /* Traditionally, declaring return type float means double. */ 4720 4721 if (flag_traditional && TYPE_MAIN_VARIANT (type) == float_type_node) 4722 type = double_type_node; 4723#endif /* TRADITIONAL_RETURN_FLOAT */ 4724 4725 /* Construct the function type and go to the next 4726 inner layer of declarator. */ 4727 4728 arg_types = grokparms (TREE_OPERAND (declarator, 1), 4729 funcdef_flag 4730 /* Say it's a definition 4731 only for the CALL_EXPR 4732 closest to the identifier. */ 4733 && TREE_CODE (TREE_OPERAND (declarator, 0)) == IDENTIFIER_NODE); 4734 /* Type qualifiers before the return type of the function 4735 qualify the return type, not the function type. */ 4736 if (type_quals) 4737 { 4738 /* Type qualifiers on a function return type are normally 4739 permitted by the standard but have no effect, so give a 4740 warning at -W. Qualifiers on a void return type have 4741 meaning as a GNU extension, and are banned on function 4742 definitions in ISO C. FIXME: strictly we shouldn't 4743 pedwarn for qualified void return types except on function 4744 definitions, but not doing so could lead to the undesirable 4745 state of a "volatile void" function return type not being 4746 warned about, and a use of the function being compiled 4747 with GNU semantics, with no diagnostics under -pedantic. */ 4748 if (VOID_TYPE_P (type) && pedantic && !in_system_header) 4749 pedwarn ("ISO C forbids qualified void function return type"); 4750 else if (extra_warnings 4751 && !(VOID_TYPE_P (type) 4752 && type_quals == TYPE_QUAL_VOLATILE)) 4753 warning ("type qualifiers ignored on function return type"); 4754 4755 type = c_build_qualified_type (type, type_quals); 4756 } 4757 type_quals = TYPE_UNQUALIFIED; 4758 4759 type = build_function_type (type, arg_types); 4760 declarator = TREE_OPERAND (declarator, 0); 4761 4762 /* Set the TYPE_CONTEXTs for each tagged type which is local to 4763 the formal parameter list of this FUNCTION_TYPE to point to 4764 the FUNCTION_TYPE node itself. */ 4765 4766 { 4767 tree link; 4768 4769 for (link = last_function_parm_tags; 4770 link; 4771 link = TREE_CHAIN (link)) 4772 TYPE_CONTEXT (TREE_VALUE (link)) = type; 4773 } 4774 } 4775 else if (TREE_CODE (declarator) == INDIRECT_REF) 4776 { 4777 /* Merge any constancy or volatility into the target type 4778 for the pointer. */ 4779 4780 if (pedantic && TREE_CODE (type) == FUNCTION_TYPE 4781 && type_quals) 4782 pedwarn ("ISO C forbids qualified function types"); 4783 if (type_quals) 4784 type = c_build_qualified_type (type, type_quals); 4785 type_quals = TYPE_UNQUALIFIED; 4786 size_varies = 0; 4787 4788 type = build_pointer_type (type); 4789 4790 /* Process a list of type modifier keywords 4791 (such as const or volatile) that were given inside the `*'. */ 4792 4793 if (TREE_TYPE (declarator)) 4794 { 4795 tree typemodlist; 4796 int erred = 0; 4797 4798 constp = 0; 4799 volatilep = 0; 4800 restrictp = 0; 4801 for (typemodlist = TREE_TYPE (declarator); typemodlist; 4802 typemodlist = TREE_CHAIN (typemodlist)) 4803 { 4804 tree qualifier = TREE_VALUE (typemodlist); 4805 4806 if (C_IS_RESERVED_WORD (qualifier)) 4807 { 4808 if (C_RID_CODE (qualifier) == RID_CONST) 4809 constp++; 4810 else if (C_RID_CODE (qualifier) == RID_VOLATILE) 4811 volatilep++; 4812 else if (C_RID_CODE (qualifier) == RID_RESTRICT) 4813 restrictp++; 4814 else 4815 erred++; 4816 } 4817 else 4818 erred++; 4819 } 4820 4821 if (erred) 4822 error ("invalid type modifier within pointer declarator"); 4823 if (constp > 1 && ! flag_isoc99) 4824 pedwarn ("duplicate `const'"); 4825 if (volatilep > 1 && ! flag_isoc99) 4826 pedwarn ("duplicate `volatile'"); 4827 if (restrictp > 1 && ! flag_isoc99) 4828 pedwarn ("duplicate `restrict'"); 4829 4830 type_quals = ((constp ? TYPE_QUAL_CONST : 0) 4831 | (restrictp ? TYPE_QUAL_RESTRICT : 0) 4832 | (volatilep ? TYPE_QUAL_VOLATILE : 0)); 4833 } 4834 4835 declarator = TREE_OPERAND (declarator, 0); 4836 } 4837 else 4838 abort (); 4839 4840 } 4841 4842 /* Now TYPE has the actual type. */ 4843 4844 /* Did array size calculations overflow? */ 4845 4846 if (TREE_CODE (type) == ARRAY_TYPE 4847 && COMPLETE_TYPE_P (type) 4848 && TREE_OVERFLOW (TYPE_SIZE (type))) 4849 { 4850 error ("size of array `%s' is too large", name); 4851 /* If we proceed with the array type as it is, we'll eventually 4852 crash in tree_low_cst(). */ 4853 type = error_mark_node; 4854 } 4855 4856 /* If this is declaring a typedef name, return a TYPE_DECL. */ 4857 4858 if (specbits & (1 << (int) RID_TYPEDEF)) 4859 { 4860 tree decl; 4861 /* Note that the grammar rejects storage classes 4862 in typenames, fields or parameters */ 4863 if (pedantic && TREE_CODE (type) == FUNCTION_TYPE 4864 && type_quals) 4865 pedwarn ("ISO C forbids qualified function types"); 4866 if (type_quals) 4867 type = c_build_qualified_type (type, type_quals); 4868 decl = build_decl (TYPE_DECL, declarator, type); 4869 if ((specbits & (1 << (int) RID_SIGNED)) 4870 || (typedef_decl && C_TYPEDEF_EXPLICITLY_SIGNED (typedef_decl))) 4871 C_TYPEDEF_EXPLICITLY_SIGNED (decl) = 1; 4872 decl_attributes (&decl, returned_attrs, 0); 4873 return decl; 4874 } 4875 4876 /* Detect the case of an array type of unspecified size 4877 which came, as such, direct from a typedef name. 4878 We must copy the type, so that each identifier gets 4879 a distinct type, so that each identifier's size can be 4880 controlled separately by its own initializer. */ 4881 4882 if (type != 0 && typedef_type != 0 4883 && TREE_CODE (type) == ARRAY_TYPE && TYPE_DOMAIN (type) == 0 4884 && TYPE_MAIN_VARIANT (type) == TYPE_MAIN_VARIANT (typedef_type)) 4885 { 4886 type = build_array_type (TREE_TYPE (type), 0); 4887 if (size_varies) 4888 C_TYPE_VARIABLE_SIZE (type) = 1; 4889 } 4890 4891 /* If this is a type name (such as, in a cast or sizeof), 4892 compute the type and return it now. */ 4893 4894 if (decl_context == TYPENAME) 4895 { 4896 /* Note that the grammar rejects storage classes 4897 in typenames, fields or parameters */ 4898 if (pedantic && TREE_CODE (type) == FUNCTION_TYPE 4899 && type_quals) 4900 pedwarn ("ISO C forbids const or volatile function types"); 4901 if (type_quals) 4902 type = c_build_qualified_type (type, type_quals); 4903 decl_attributes (&type, returned_attrs, 0); 4904 return type; 4905 } 4906 4907 /* Aside from typedefs and type names (handle above), 4908 `void' at top level (not within pointer) 4909 is allowed only in public variables. 4910 We don't complain about parms either, but that is because 4911 a better error message can be made later. */ 4912 4913 if (VOID_TYPE_P (type) && decl_context != PARM 4914 && ! ((decl_context != FIELD && TREE_CODE (type) != FUNCTION_TYPE) 4915 && ((specbits & (1 << (int) RID_EXTERN)) 4916 || (current_binding_level == global_binding_level 4917 && !(specbits 4918 & ((1 << (int) RID_STATIC) | (1 << (int) RID_REGISTER))))))) 4919 { 4920 error ("variable or field `%s' declared void", name); 4921 type = integer_type_node; 4922 } 4923 4924 /* Now create the decl, which may be a VAR_DECL, a PARM_DECL 4925 or a FUNCTION_DECL, depending on DECL_CONTEXT and TYPE. */ 4926 4927 { 4928 tree decl; 4929 4930 if (decl_context == PARM) 4931 { 4932 tree type_as_written; 4933 tree promoted_type; 4934 4935 /* A parameter declared as an array of T is really a pointer to T. 4936 One declared as a function is really a pointer to a function. */ 4937 4938 if (TREE_CODE (type) == ARRAY_TYPE) 4939 { 4940 /* Transfer const-ness of array into that of type pointed to. */ 4941 type = TREE_TYPE (type); 4942 if (type_quals) 4943 type = c_build_qualified_type (type, type_quals); 4944 type = build_pointer_type (type); 4945 type_quals = TYPE_UNQUALIFIED; 4946 if (array_ptr_quals) 4947 { 4948 tree new_ptr_quals, new_ptr_attrs; 4949 int erred = 0; 4950 split_specs_attrs (array_ptr_quals, &new_ptr_quals, &new_ptr_attrs); 4951 /* We don't yet implement attributes in this context. */ 4952 if (new_ptr_attrs != NULL_TREE) 4953 warning ("attributes in parameter array declarator ignored"); 4954 4955 constp = 0; 4956 volatilep = 0; 4957 restrictp = 0; 4958 for (; new_ptr_quals; new_ptr_quals = TREE_CHAIN (new_ptr_quals)) 4959 { 4960 tree qualifier = TREE_VALUE (new_ptr_quals); 4961 4962 if (C_IS_RESERVED_WORD (qualifier)) 4963 { 4964 if (C_RID_CODE (qualifier) == RID_CONST) 4965 constp++; 4966 else if (C_RID_CODE (qualifier) == RID_VOLATILE) 4967 volatilep++; 4968 else if (C_RID_CODE (qualifier) == RID_RESTRICT) 4969 restrictp++; 4970 else 4971 erred++; 4972 } 4973 else 4974 erred++; 4975 } 4976 4977 if (erred) 4978 error ("invalid type modifier within array declarator"); 4979 4980 type_quals = ((constp ? TYPE_QUAL_CONST : 0) 4981 | (restrictp ? TYPE_QUAL_RESTRICT : 0) 4982 | (volatilep ? TYPE_QUAL_VOLATILE : 0)); 4983 } 4984 size_varies = 0; 4985 } 4986 else if (TREE_CODE (type) == FUNCTION_TYPE) 4987 { 4988 if (pedantic && type_quals) 4989 pedwarn ("ISO C forbids qualified function types"); 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 } 4995 else if (type_quals) 4996 type = c_build_qualified_type (type, type_quals); 4997 4998 type_as_written = type; 4999 5000 decl = build_decl (PARM_DECL, declarator, type); 5001 if (size_varies) 5002 C_DECL_VARIABLE_SIZE (decl) = 1; 5003 5004 /* Compute the type actually passed in the parmlist, 5005 for the case where there is no prototype. 5006 (For example, shorts and chars are passed as ints.) 5007 When there is a prototype, this is overridden later. */ 5008 5009 if (type == error_mark_node) 5010 promoted_type = type; 5011 else 5012 { 5013 promoted_type = simple_type_promotes_to (type); 5014 if (! promoted_type) 5015 promoted_type = type; 5016 } 5017 5018 DECL_ARG_TYPE (decl) = promoted_type; 5019 DECL_ARG_TYPE_AS_WRITTEN (decl) = type_as_written; 5020 } 5021 else if (decl_context == FIELD) 5022 { 5023 /* Structure field. It may not be a function. */ 5024 5025 if (TREE_CODE (type) == FUNCTION_TYPE) 5026 { 5027 error ("field `%s' declared as a function", name); 5028 type = build_pointer_type (type); 5029 } 5030 else if (TREE_CODE (type) != ERROR_MARK 5031 && !COMPLETE_OR_UNBOUND_ARRAY_TYPE_P (type)) 5032 { 5033 error ("field `%s' has incomplete type", name); 5034 type = error_mark_node; 5035 } 5036 /* Move type qualifiers down to element of an array. */ 5037 if (TREE_CODE (type) == ARRAY_TYPE && type_quals) 5038 { 5039 type = build_array_type (c_build_qualified_type (TREE_TYPE (type), 5040 type_quals), 5041 TYPE_DOMAIN (type)); 5042#if 0 5043 /* Leave the field const or volatile as well. */ 5044 type_quals = TYPE_UNQUALIFIED; 5045#endif 5046 } 5047 decl = build_decl (FIELD_DECL, declarator, type); 5048 DECL_NONADDRESSABLE_P (decl) = bitfield; 5049 5050 if (size_varies) 5051 C_DECL_VARIABLE_SIZE (decl) = 1; 5052 } 5053 else if (TREE_CODE (type) == FUNCTION_TYPE) 5054 { 5055 /* Every function declaration is "external" 5056 except for those which are inside a function body 5057 in which `auto' is used. 5058 That is a case not specified by ANSI C, 5059 and we use it for forward declarations for nested functions. */ 5060 int extern_ref = (!(specbits & (1 << (int) RID_AUTO)) 5061 || current_binding_level == global_binding_level); 5062 5063 if (specbits & (1 << (int) RID_AUTO) 5064 && (pedantic || current_binding_level == global_binding_level)) 5065 pedwarn ("invalid storage class for function `%s'", name); 5066 if (specbits & (1 << (int) RID_REGISTER)) 5067 error ("invalid storage class for function `%s'", name); 5068 /* Function declaration not at top level. 5069 Storage classes other than `extern' are not allowed 5070 and `extern' makes no difference. */ 5071 if (current_binding_level != global_binding_level 5072 && (specbits & ((1 << (int) RID_STATIC) | (1 << (int) RID_INLINE))) 5073 && pedantic) 5074 pedwarn ("invalid storage class for function `%s'", name); 5075 5076 decl = build_decl (FUNCTION_DECL, declarator, type); 5077 decl = build_decl_attribute_variant (decl, decl_attr); 5078 5079 DECL_LANG_SPECIFIC (decl) = (struct lang_decl *) 5080 ggc_alloc_cleared (sizeof (struct lang_decl)); 5081 5082 if (pedantic && type_quals && ! DECL_IN_SYSTEM_HEADER (decl)) 5083 pedwarn ("ISO C forbids qualified function types"); 5084 5085 /* GNU C interprets a `volatile void' return type to indicate 5086 that the function does not return. */ 5087 if ((type_quals & TYPE_QUAL_VOLATILE) 5088 && !VOID_TYPE_P (TREE_TYPE (TREE_TYPE (decl)))) 5089 warning ("`noreturn' function returns non-void value"); 5090 5091 if (extern_ref) 5092 DECL_EXTERNAL (decl) = 1; 5093 /* Record absence of global scope for `static' or `auto'. */ 5094 TREE_PUBLIC (decl) 5095 = !(specbits & ((1 << (int) RID_STATIC) | (1 << (int) RID_AUTO))); 5096 5097 if (defaulted_int) 5098 C_FUNCTION_IMPLICIT_INT (decl) = 1; 5099 5100 /* Record presence of `inline', if it is reasonable. */ 5101 if (MAIN_NAME_P (declarator)) 5102 { 5103 if (inlinep) 5104 warning ("cannot inline function `main'"); 5105 } 5106 else if (inlinep) 5107 { 5108 /* Assume that otherwise the function can be inlined. */ 5109 DECL_DECLARED_INLINE_P (decl) = 1; 5110 5111 /* Do not mark bare declarations as DECL_INLINE. Doing so 5112 in the presence of multiple declarations can result in 5113 the abstract origin pointing between the declarations, 5114 which will confuse dwarf2out. */ 5115 if (initialized) 5116 { 5117 DECL_INLINE (decl) = 1; 5118 if (specbits & (1 << (int) RID_EXTERN)) 5119 current_extern_inline = 1; 5120 } 5121 } 5122 /* If -finline-functions, assume it can be inlined. This does 5123 two things: let the function be deferred until it is actually 5124 needed, and let dwarf2 know that the function is inlinable. */ 5125 else if (flag_inline_trees == 2 && initialized) 5126 { 5127 DECL_INLINE (decl) = 1; 5128 DECL_DECLARED_INLINE_P (decl) = 0; 5129 } 5130 } 5131 else 5132 { 5133 /* It's a variable. */ 5134 /* An uninitialized decl with `extern' is a reference. */ 5135 int extern_ref = !initialized && (specbits & (1 << (int) RID_EXTERN)); 5136 5137 /* Move type qualifiers down to element of an array. */ 5138 if (TREE_CODE (type) == ARRAY_TYPE && type_quals) 5139 { 5140 int saved_align = TYPE_ALIGN(type); 5141 type = build_array_type (c_build_qualified_type (TREE_TYPE (type), 5142 type_quals), 5143 TYPE_DOMAIN (type)); 5144 TYPE_ALIGN (type) = saved_align; 5145#if 0 /* Leave the variable const or volatile as well. */ 5146 type_quals = TYPE_UNQUALIFIED; 5147#endif 5148 } 5149 else if (type_quals) 5150 type = c_build_qualified_type (type, type_quals); 5151 5152 decl = build_decl (VAR_DECL, declarator, type); 5153 if (size_varies) 5154 C_DECL_VARIABLE_SIZE (decl) = 1; 5155 5156 if (inlinep) 5157 pedwarn_with_decl (decl, "variable `%s' declared `inline'"); 5158 5159 DECL_EXTERNAL (decl) = extern_ref; 5160 /* At top level, the presence of a `static' or `register' storage 5161 class specifier, or the absence of all storage class specifiers 5162 makes this declaration a definition (perhaps tentative). Also, 5163 the absence of both `static' and `register' makes it public. */ 5164 if (current_binding_level == global_binding_level) 5165 { 5166 TREE_PUBLIC (decl) 5167 = !(specbits 5168 & ((1 << (int) RID_STATIC) | (1 << (int) RID_REGISTER))); 5169 TREE_STATIC (decl) = ! DECL_EXTERNAL (decl); 5170 } 5171 /* Not at top level, only `static' makes a static definition. */ 5172 else 5173 { 5174 TREE_STATIC (decl) = (specbits & (1 << (int) RID_STATIC)) != 0; 5175 TREE_PUBLIC (decl) = DECL_EXTERNAL (decl); 5176 } 5177 } 5178 5179 /* Record `register' declaration for warnings on & 5180 and in case doing stupid register allocation. */ 5181 5182 if (specbits & (1 << (int) RID_REGISTER)) 5183 DECL_REGISTER (decl) = 1; 5184 5185 /* Record constancy and volatility. */ 5186 c_apply_type_quals_to_decl (type_quals, decl); 5187 5188 /* If a type has volatile components, it should be stored in memory. 5189 Otherwise, the fact that those components are volatile 5190 will be ignored, and would even crash the compiler. */ 5191 if (C_TYPE_FIELDS_VOLATILE (TREE_TYPE (decl))) 5192 mark_addressable (decl); 5193 5194 decl_attributes (&decl, returned_attrs, 0); 5195 5196 return decl; 5197 } 5198} 5199 5200/* Decode the parameter-list info for a function type or function definition. 5201 The argument is the value returned by `get_parm_info' (or made in parse.y 5202 if there is an identifier list instead of a parameter decl list). 5203 These two functions are separate because when a function returns 5204 or receives functions then each is called multiple times but the order 5205 of calls is different. The last call to `grokparms' is always the one 5206 that contains the formal parameter names of a function definition. 5207 5208 Store in `last_function_parms' a chain of the decls of parms. 5209 Also store in `last_function_parm_tags' a chain of the struct, union, 5210 and enum tags declared among the parms. 5211 5212 Return a list of arg types to use in the FUNCTION_TYPE for this function. 5213 5214 FUNCDEF_FLAG is nonzero for a function definition, 0 for 5215 a mere declaration. A nonempty identifier-list gets an error message 5216 when FUNCDEF_FLAG is zero. */ 5217 5218static tree 5219grokparms (parms_info, funcdef_flag) 5220 tree parms_info; 5221 int funcdef_flag; 5222{ 5223 tree first_parm = TREE_CHAIN (parms_info); 5224 5225 last_function_parms = TREE_PURPOSE (parms_info); 5226 last_function_parm_tags = TREE_VALUE (parms_info); 5227 5228 if (warn_strict_prototypes && first_parm == 0 && !funcdef_flag 5229 && !in_system_header) 5230 warning ("function declaration isn't a prototype"); 5231 5232 if (first_parm != 0 5233 && TREE_CODE (TREE_VALUE (first_parm)) == IDENTIFIER_NODE) 5234 { 5235 if (! funcdef_flag) 5236 pedwarn ("parameter names (without types) in function declaration"); 5237 5238 last_function_parms = first_parm; 5239 return 0; 5240 } 5241 else 5242 { 5243 tree parm; 5244 tree typelt; 5245 /* We no longer test FUNCDEF_FLAG. 5246 If the arg types are incomplete in a declaration, 5247 they must include undefined tags. 5248 These tags can never be defined in the scope of the declaration, 5249 so the types can never be completed, 5250 and no call can be compiled successfully. */ 5251#if 0 5252 /* In a fcn definition, arg types must be complete. */ 5253 if (funcdef_flag) 5254#endif 5255 for (parm = last_function_parms, typelt = first_parm; 5256 parm; 5257 parm = TREE_CHAIN (parm)) 5258 /* Skip over any enumeration constants declared here. */ 5259 if (TREE_CODE (parm) == PARM_DECL) 5260 { 5261 /* Barf if the parameter itself has an incomplete type. */ 5262 tree type = TREE_VALUE (typelt); 5263 if (type == error_mark_node) 5264 continue; 5265 if (!COMPLETE_TYPE_P (type)) 5266 { 5267 if (funcdef_flag && DECL_NAME (parm) != 0) 5268 error ("parameter `%s' has incomplete type", 5269 IDENTIFIER_POINTER (DECL_NAME (parm))); 5270 else 5271 warning ("parameter has incomplete type"); 5272 if (funcdef_flag) 5273 { 5274 TREE_VALUE (typelt) = error_mark_node; 5275 TREE_TYPE (parm) = error_mark_node; 5276 } 5277 } 5278#if 0 5279 /* This has been replaced by parm_tags_warning, which 5280 uses a more accurate criterion for what to warn 5281 about. */ 5282 else 5283 { 5284 /* Now warn if is a pointer to an incomplete type. */ 5285 while (TREE_CODE (type) == POINTER_TYPE 5286 || TREE_CODE (type) == REFERENCE_TYPE) 5287 type = TREE_TYPE (type); 5288 type = TYPE_MAIN_VARIANT (type); 5289 if (!COMPLETE_TYPE_P (type)) 5290 { 5291 if (DECL_NAME (parm) != 0) 5292 warning ("parameter `%s' points to incomplete type", 5293 IDENTIFIER_POINTER (DECL_NAME (parm))); 5294 else 5295 warning ("parameter points to incomplete type"); 5296 } 5297 } 5298#endif 5299 typelt = TREE_CHAIN (typelt); 5300 } 5301 5302 return first_parm; 5303 } 5304} 5305 5306/* Return a tree_list node with info on a parameter list just parsed. 5307 The TREE_PURPOSE is a chain of decls of those parms. 5308 The TREE_VALUE is a list of structure, union and enum tags defined. 5309 The TREE_CHAIN is a list of argument types to go in the FUNCTION_TYPE. 5310 This tree_list node is later fed to `grokparms'. 5311 5312 VOID_AT_END nonzero means append `void' to the end of the type-list. 5313 Zero means the parmlist ended with an ellipsis so don't append `void'. */ 5314 5315tree 5316get_parm_info (void_at_end) 5317 int void_at_end; 5318{ 5319 tree decl, t; 5320 tree types = 0; 5321 int erred = 0; 5322 tree tags = gettags (); 5323 tree parms = getdecls (); 5324 tree new_parms = 0; 5325 tree order = current_binding_level->parm_order; 5326 5327 /* Just `void' (and no ellipsis) is special. There are really no parms. 5328 But if the `void' is qualified (by `const' or `volatile') or has a 5329 storage class specifier (`register'), then the behavior is undefined; 5330 by not counting it as the special case of `void' we will cause an 5331 error later. Typedefs for `void' are OK (see DR#157). */ 5332 if (void_at_end && parms != 0 5333 && TREE_CHAIN (parms) == 0 5334 && VOID_TYPE_P (TREE_TYPE (parms)) 5335 && ! TREE_THIS_VOLATILE (parms) 5336 && ! TREE_READONLY (parms) 5337 && ! DECL_REGISTER (parms) 5338 && DECL_NAME (parms) == 0) 5339 { 5340 parms = NULL_TREE; 5341 storedecls (NULL_TREE); 5342 return tree_cons (NULL_TREE, NULL_TREE, 5343 tree_cons (NULL_TREE, void_type_node, NULL_TREE)); 5344 } 5345 5346 /* Extract enumerator values and other non-parms declared with the parms. 5347 Likewise any forward parm decls that didn't have real parm decls. */ 5348 for (decl = parms; decl;) 5349 { 5350 tree next = TREE_CHAIN (decl); 5351 5352 if (TREE_CODE (decl) != PARM_DECL) 5353 { 5354 TREE_CHAIN (decl) = new_parms; 5355 new_parms = decl; 5356 } 5357 else if (TREE_ASM_WRITTEN (decl)) 5358 { 5359 error_with_decl (decl, 5360 "parameter `%s' has just a forward declaration"); 5361 TREE_CHAIN (decl) = new_parms; 5362 new_parms = decl; 5363 } 5364 decl = next; 5365 } 5366 5367 /* Put the parm decls back in the order they were in in the parm list. */ 5368 for (t = order; t; t = TREE_CHAIN (t)) 5369 { 5370 if (TREE_CHAIN (t)) 5371 TREE_CHAIN (TREE_VALUE (t)) = TREE_VALUE (TREE_CHAIN (t)); 5372 else 5373 TREE_CHAIN (TREE_VALUE (t)) = 0; 5374 } 5375 5376 new_parms = chainon (order ? nreverse (TREE_VALUE (order)) : 0, 5377 new_parms); 5378 5379 /* Store the parmlist in the binding level since the old one 5380 is no longer a valid list. (We have changed the chain pointers.) */ 5381 storedecls (new_parms); 5382 5383 for (decl = new_parms; decl; decl = TREE_CHAIN (decl)) 5384 /* There may also be declarations for enumerators if an enumeration 5385 type is declared among the parms. Ignore them here. */ 5386 if (TREE_CODE (decl) == PARM_DECL) 5387 { 5388 /* Since there is a prototype, 5389 args are passed in their declared types. */ 5390 tree type = TREE_TYPE (decl); 5391 DECL_ARG_TYPE (decl) = type; 5392 if (PROMOTE_PROTOTYPES 5393 && INTEGRAL_TYPE_P (type) 5394 && TYPE_PRECISION (type) < TYPE_PRECISION (integer_type_node)) 5395 DECL_ARG_TYPE (decl) = integer_type_node; 5396 5397 types = tree_cons (NULL_TREE, TREE_TYPE (decl), types); 5398 if (VOID_TYPE_P (TREE_VALUE (types)) && ! erred 5399 && DECL_NAME (decl) == 0) 5400 { 5401 error ("`void' in parameter list must be the entire list"); 5402 erred = 1; 5403 } 5404 } 5405 5406 if (void_at_end) 5407 return tree_cons (new_parms, tags, 5408 nreverse (tree_cons (NULL_TREE, void_type_node, types))); 5409 5410 return tree_cons (new_parms, tags, nreverse (types)); 5411} 5412 5413/* At end of parameter list, warn about any struct, union or enum tags 5414 defined within. Do so because these types cannot ever become complete. */ 5415 5416void 5417parmlist_tags_warning () 5418{ 5419 tree elt; 5420 static int already; 5421 5422 for (elt = current_binding_level->tags; elt; elt = TREE_CHAIN (elt)) 5423 { 5424 enum tree_code code = TREE_CODE (TREE_VALUE (elt)); 5425 /* An anonymous union parm type is meaningful as a GNU extension. 5426 So don't warn for that. */ 5427 if (code == UNION_TYPE && TREE_PURPOSE (elt) == 0 && !pedantic) 5428 continue; 5429 if (TREE_PURPOSE (elt) != 0) 5430 { 5431 if (code == RECORD_TYPE) 5432 warning ("`struct %s' declared inside parameter list", 5433 IDENTIFIER_POINTER (TREE_PURPOSE (elt))); 5434 else if (code == UNION_TYPE) 5435 warning ("`union %s' declared inside parameter list", 5436 IDENTIFIER_POINTER (TREE_PURPOSE (elt))); 5437 else 5438 warning ("`enum %s' declared inside parameter list", 5439 IDENTIFIER_POINTER (TREE_PURPOSE (elt))); 5440 } 5441 else 5442 { 5443 /* For translation these need to be separate warnings */ 5444 if (code == RECORD_TYPE) 5445 warning ("anonymous struct declared inside parameter list"); 5446 else if (code == UNION_TYPE) 5447 warning ("anonymous union declared inside parameter list"); 5448 else 5449 warning ("anonymous enum declared inside parameter list"); 5450 } 5451 if (! already) 5452 { 5453 warning ("its scope is only this definition or declaration, which is probably not what you want"); 5454 already = 1; 5455 } 5456 } 5457} 5458 5459/* Get the struct, enum or union (CODE says which) with tag NAME. 5460 Define the tag as a forward-reference if it is not defined. */ 5461 5462tree 5463xref_tag (code, name) 5464 enum tree_code code; 5465 tree name; 5466{ 5467 /* If a cross reference is requested, look up the type 5468 already defined for this tag and return it. */ 5469 5470 tree ref = lookup_tag (code, name, current_binding_level, 0); 5471 /* If this is the right type of tag, return what we found. 5472 (This reference will be shadowed by shadow_tag later if appropriate.) 5473 If this is the wrong type of tag, do not return it. If it was the 5474 wrong type in the same binding level, we will have had an error 5475 message already; if in a different binding level and declaring 5476 a name, pending_xref_error will give an error message; but if in a 5477 different binding level and not declaring a name, this tag should 5478 shadow the previous declaration of a different type of tag, and 5479 this would not work properly if we return the reference found. 5480 (For example, with "struct foo" in an outer scope, "union foo;" 5481 must shadow that tag with a new one of union type.) */ 5482 if (ref && TREE_CODE (ref) == code) 5483 return ref; 5484 5485 /* If no such tag is yet defined, create a forward-reference node 5486 and record it as the "definition". 5487 When a real declaration of this type is found, 5488 the forward-reference will be altered into a real type. */ 5489 5490 ref = make_node (code); 5491 if (code == ENUMERAL_TYPE) 5492 { 5493 /* Give the type a default layout like unsigned int 5494 to avoid crashing if it does not get defined. */ 5495 TYPE_MODE (ref) = TYPE_MODE (unsigned_type_node); 5496 TYPE_ALIGN (ref) = TYPE_ALIGN (unsigned_type_node); 5497 TYPE_USER_ALIGN (ref) = 0; 5498 TREE_UNSIGNED (ref) = 1; 5499 TYPE_PRECISION (ref) = TYPE_PRECISION (unsigned_type_node); 5500 TYPE_MIN_VALUE (ref) = TYPE_MIN_VALUE (unsigned_type_node); 5501 TYPE_MAX_VALUE (ref) = TYPE_MAX_VALUE (unsigned_type_node); 5502 } 5503 5504 pushtag (name, ref); 5505 5506 return ref; 5507} 5508 5509/* Make sure that the tag NAME is defined *in the current binding level* 5510 at least as a forward reference. 5511 CODE says which kind of tag NAME ought to be. */ 5512 5513tree 5514start_struct (code, name) 5515 enum tree_code code; 5516 tree name; 5517{ 5518 /* If there is already a tag defined at this binding level 5519 (as a forward reference), just return it. */ 5520 5521 tree ref = 0; 5522 5523 if (name != 0) 5524 ref = lookup_tag (code, name, current_binding_level, 1); 5525 if (ref && TREE_CODE (ref) == code) 5526 { 5527 C_TYPE_BEING_DEFINED (ref) = 1; 5528 TYPE_PACKED (ref) = flag_pack_struct; 5529 if (TYPE_FIELDS (ref)) 5530 { 5531 if (code == UNION_TYPE) 5532 error ("redefinition of `union %s'", 5533 IDENTIFIER_POINTER (name)); 5534 else 5535 error ("redefinition of `struct %s'", 5536 IDENTIFIER_POINTER (name)); 5537 } 5538 5539 return ref; 5540 } 5541 5542 /* Otherwise create a forward-reference just so the tag is in scope. */ 5543 5544 ref = make_node (code); 5545 pushtag (name, ref); 5546 C_TYPE_BEING_DEFINED (ref) = 1; 5547 TYPE_PACKED (ref) = flag_pack_struct; 5548 return ref; 5549} 5550 5551/* Process the specs, declarator (NULL if omitted) and width (NULL if omitted) 5552 of a structure component, returning a FIELD_DECL node. 5553 WIDTH is non-NULL for bit fields only, and is an INTEGER_CST node. 5554 5555 This is done during the parsing of the struct declaration. 5556 The FIELD_DECL nodes are chained together and the lot of them 5557 are ultimately passed to `build_struct' to make the RECORD_TYPE node. */ 5558 5559tree 5560grokfield (filename, line, declarator, declspecs, width) 5561 const char *filename ATTRIBUTE_UNUSED; 5562 int line ATTRIBUTE_UNUSED; 5563 tree declarator, declspecs, width; 5564{ 5565 tree value; 5566 5567 if (declarator == NULL_TREE && width == NULL_TREE) 5568 { 5569 /* This is an unnamed decl. We only support unnamed 5570 structs/unions, so check for other things and refuse them. */ 5571 tree type = TREE_VALUE (declspecs); 5572 5573 if (TREE_CODE (type) == TYPE_DECL) 5574 type = TREE_TYPE (type); 5575 if (TREE_CODE (type) != RECORD_TYPE && TREE_CODE (type) != UNION_TYPE) 5576 { 5577 error ("unnamed fields of type other than struct or union are not allowed"); 5578 return NULL_TREE; 5579 } 5580 } 5581 5582 value = grokdeclarator (declarator, declspecs, width ? BITFIELD : FIELD, 0); 5583 5584 finish_decl (value, NULL_TREE, NULL_TREE); 5585 DECL_INITIAL (value) = width; 5586 5587 maybe_objc_check_decl (value); 5588 return value; 5589} 5590 5591/* Fill in the fields of a RECORD_TYPE or UNION_TYPE node, T. 5592 FIELDLIST is a chain of FIELD_DECL nodes for the fields. 5593 ATTRIBUTES are attributes to be applied to the structure. */ 5594 5595tree 5596finish_struct (t, fieldlist, attributes) 5597 tree t; 5598 tree fieldlist; 5599 tree attributes; 5600{ 5601 tree x; 5602 int toplevel = global_binding_level == current_binding_level; 5603 int saw_named_field; 5604 5605 /* If this type was previously laid out as a forward reference, 5606 make sure we lay it out again. */ 5607 5608 TYPE_SIZE (t) = 0; 5609 5610 decl_attributes (&t, attributes, (int) ATTR_FLAG_TYPE_IN_PLACE); 5611 5612 /* Nameless union parm types are useful as GCC extension. */ 5613 if (! (TREE_CODE (t) == UNION_TYPE && TYPE_NAME (t) == 0) && !pedantic) 5614 /* Otherwise, warn about any struct or union def. in parmlist. */ 5615 if (in_parm_level_p ()) 5616 { 5617 if (pedantic) 5618 pedwarn ("%s defined inside parms", 5619 TREE_CODE (t) == UNION_TYPE ? _("union") : _("structure")); 5620 else if (! flag_traditional) 5621 warning ("%s defined inside parms", 5622 TREE_CODE (t) == UNION_TYPE ? _("union") : _("structure")); 5623 } 5624 5625 if (pedantic) 5626 { 5627 for (x = fieldlist; x; x = TREE_CHAIN (x)) 5628 if (DECL_NAME (x) != 0) 5629 break; 5630 5631 if (x == 0) 5632 pedwarn ("%s has no %s", 5633 TREE_CODE (t) == UNION_TYPE ? _("union") : _("struct"), 5634 fieldlist ? _("named members") : _("members")); 5635 } 5636 5637 /* Install struct as DECL_CONTEXT of each field decl. 5638 Also process specified field sizes,m which is found in the DECL_INITIAL. 5639 Store 0 there, except for ": 0" fields (so we can find them 5640 and delete them, below). */ 5641 5642 saw_named_field = 0; 5643 for (x = fieldlist; x; x = TREE_CHAIN (x)) 5644 { 5645 DECL_CONTEXT (x) = t; 5646 DECL_PACKED (x) |= TYPE_PACKED (t); 5647 5648 /* If any field is const, the structure type is pseudo-const. */ 5649 if (TREE_READONLY (x)) 5650 C_TYPE_FIELDS_READONLY (t) = 1; 5651 else 5652 { 5653 /* A field that is pseudo-const makes the structure likewise. */ 5654 tree t1 = TREE_TYPE (x); 5655 while (TREE_CODE (t1) == ARRAY_TYPE) 5656 t1 = TREE_TYPE (t1); 5657 if ((TREE_CODE (t1) == RECORD_TYPE || TREE_CODE (t1) == UNION_TYPE) 5658 && C_TYPE_FIELDS_READONLY (t1)) 5659 C_TYPE_FIELDS_READONLY (t) = 1; 5660 } 5661 5662 /* Any field that is volatile means variables of this type must be 5663 treated in some ways as volatile. */ 5664 if (TREE_THIS_VOLATILE (x)) 5665 C_TYPE_FIELDS_VOLATILE (t) = 1; 5666 5667 /* Any field of nominal variable size implies structure is too. */ 5668 if (C_DECL_VARIABLE_SIZE (x)) 5669 C_TYPE_VARIABLE_SIZE (t) = 1; 5670 5671 /* Detect invalid nested redefinition. */ 5672 if (TREE_TYPE (x) == t) 5673 error ("nested redefinition of `%s'", 5674 IDENTIFIER_POINTER (TYPE_NAME (t))); 5675 5676 /* Detect invalid bit-field size. */ 5677 if (DECL_INITIAL (x)) 5678 STRIP_NOPS (DECL_INITIAL (x)); 5679 if (DECL_INITIAL (x)) 5680 { 5681 if (TREE_CODE (DECL_INITIAL (x)) == INTEGER_CST) 5682 constant_expression_warning (DECL_INITIAL (x)); 5683 else 5684 { 5685 error_with_decl (x, 5686 "bit-field `%s' width not an integer constant"); 5687 DECL_INITIAL (x) = NULL; 5688 } 5689 } 5690 5691 /* Detect invalid bit-field type. */ 5692 if (DECL_INITIAL (x) 5693 && TREE_CODE (TREE_TYPE (x)) != INTEGER_TYPE 5694 && TREE_CODE (TREE_TYPE (x)) != BOOLEAN_TYPE 5695 && TREE_CODE (TREE_TYPE (x)) != ENUMERAL_TYPE) 5696 { 5697 error_with_decl (x, "bit-field `%s' has invalid type"); 5698 DECL_INITIAL (x) = NULL; 5699 } 5700 5701 if (DECL_INITIAL (x) && pedantic 5702 && TYPE_MAIN_VARIANT (TREE_TYPE (x)) != integer_type_node 5703 && TYPE_MAIN_VARIANT (TREE_TYPE (x)) != unsigned_type_node 5704 && TYPE_MAIN_VARIANT (TREE_TYPE (x)) != c_bool_type_node 5705 /* Accept an enum that's equivalent to int or unsigned int. */ 5706 && !(TREE_CODE (TREE_TYPE (x)) == ENUMERAL_TYPE 5707 && (TYPE_PRECISION (TREE_TYPE (x)) 5708 == TYPE_PRECISION (integer_type_node)))) 5709 pedwarn_with_decl (x, "bit-field `%s' type invalid in ISO C"); 5710 5711 /* Detect and ignore out of range field width and process valid 5712 field widths. */ 5713 if (DECL_INITIAL (x)) 5714 { 5715 int max_width 5716 = (TYPE_MAIN_VARIANT (TREE_TYPE (x)) == c_bool_type_node 5717 ? CHAR_TYPE_SIZE : TYPE_PRECISION (TREE_TYPE (x))); 5718 5719 if (tree_int_cst_sgn (DECL_INITIAL (x)) < 0) 5720 error_with_decl (x, "negative width in bit-field `%s'"); 5721 else if (0 < compare_tree_int (DECL_INITIAL (x), max_width)) 5722 pedwarn_with_decl (x, "width of `%s' exceeds its type"); 5723 else if (integer_zerop (DECL_INITIAL (x)) && DECL_NAME (x) != 0) 5724 error_with_decl (x, "zero width for bit-field `%s'"); 5725 else 5726 { 5727 /* The test above has assured us that TREE_INT_CST_HIGH is 0. */ 5728 unsigned HOST_WIDE_INT width 5729 = tree_low_cst (DECL_INITIAL (x), 1); 5730 5731 if (TREE_CODE (TREE_TYPE (x)) == ENUMERAL_TYPE 5732 && (width < min_precision (TYPE_MIN_VALUE (TREE_TYPE (x)), 5733 TREE_UNSIGNED (TREE_TYPE (x))) 5734 || (width 5735 < min_precision (TYPE_MAX_VALUE (TREE_TYPE (x)), 5736 TREE_UNSIGNED (TREE_TYPE (x)))))) 5737 warning_with_decl (x, 5738 "`%s' is narrower than values of its type"); 5739 5740 DECL_SIZE (x) = bitsize_int (width); 5741 DECL_BIT_FIELD (x) = 1; 5742 SET_DECL_C_BIT_FIELD (x); 5743 5744 if (width == 0 5745 && ! (* targetm.ms_bitfield_layout_p) (t)) 5746 { 5747 /* field size 0 => force desired amount of alignment. */ 5748#ifdef EMPTY_FIELD_BOUNDARY 5749 DECL_ALIGN (x) = MAX (DECL_ALIGN (x), EMPTY_FIELD_BOUNDARY); 5750#endif 5751#ifdef PCC_BITFIELD_TYPE_MATTERS 5752 if (PCC_BITFIELD_TYPE_MATTERS) 5753 { 5754 DECL_ALIGN (x) = MAX (DECL_ALIGN (x), 5755 TYPE_ALIGN (TREE_TYPE (x))); 5756 DECL_USER_ALIGN (x) |= TYPE_USER_ALIGN (TREE_TYPE (x)); 5757 } 5758#endif 5759 } 5760 } 5761 } 5762 5763 else if (TREE_TYPE (x) != error_mark_node) 5764 { 5765 unsigned int min_align = (DECL_PACKED (x) ? BITS_PER_UNIT 5766 : TYPE_ALIGN (TREE_TYPE (x))); 5767 5768 /* Non-bit-fields are aligned for their type, except packed 5769 fields which require only BITS_PER_UNIT alignment. */ 5770 DECL_ALIGN (x) = MAX (DECL_ALIGN (x), min_align); 5771 if (! DECL_PACKED (x)) 5772 DECL_USER_ALIGN (x) |= TYPE_USER_ALIGN (TREE_TYPE (x)); 5773 } 5774 5775 DECL_INITIAL (x) = 0; 5776 5777 /* Detect flexible array member in an invalid context. */ 5778 if (TREE_CODE (TREE_TYPE (x)) == ARRAY_TYPE 5779 && TYPE_SIZE (TREE_TYPE (x)) == NULL_TREE 5780 && TYPE_DOMAIN (TREE_TYPE (x)) != NULL_TREE 5781 && TYPE_MAX_VALUE (TYPE_DOMAIN (TREE_TYPE (x))) == NULL_TREE) 5782 { 5783 if (TREE_CODE (t) == UNION_TYPE) 5784 error_with_decl (x, "flexible array member in union"); 5785 else if (TREE_CHAIN (x) != NULL_TREE) 5786 error_with_decl (x, "flexible array member not at end of struct"); 5787 else if (! saw_named_field) 5788 error_with_decl (x, "flexible array member in otherwise empty struct"); 5789 } 5790 if (DECL_NAME (x)) 5791 saw_named_field = 1; 5792 } 5793 5794 /* Delete all duplicate fields from the fieldlist */ 5795 for (x = fieldlist; x && TREE_CHAIN (x);) 5796 /* Anonymous fields aren't duplicates. */ 5797 if (DECL_NAME (TREE_CHAIN (x)) == 0) 5798 x = TREE_CHAIN (x); 5799 else 5800 { 5801 tree y = fieldlist; 5802 5803 while (1) 5804 { 5805 if (DECL_NAME (y) == DECL_NAME (TREE_CHAIN (x))) 5806 break; 5807 if (y == x) 5808 break; 5809 y = TREE_CHAIN (y); 5810 } 5811 if (DECL_NAME (y) == DECL_NAME (TREE_CHAIN (x))) 5812 { 5813 error_with_decl (TREE_CHAIN (x), "duplicate member `%s'"); 5814 TREE_CHAIN (x) = TREE_CHAIN (TREE_CHAIN (x)); 5815 } 5816 else 5817 x = TREE_CHAIN (x); 5818 } 5819 5820 /* Now we have the nearly final fieldlist. Record it, 5821 then lay out the structure or union (including the fields). */ 5822 5823 TYPE_FIELDS (t) = fieldlist; 5824 5825 layout_type (t); 5826 5827 /* Delete all zero-width bit-fields from the fieldlist */ 5828 { 5829 tree *fieldlistp = &fieldlist; 5830 while (*fieldlistp) 5831 if (TREE_CODE (*fieldlistp) == FIELD_DECL && DECL_INITIAL (*fieldlistp)) 5832 *fieldlistp = TREE_CHAIN (*fieldlistp); 5833 else 5834 fieldlistp = &TREE_CHAIN (*fieldlistp); 5835 } 5836 5837 /* Now we have the truly final field list. 5838 Store it in this type and in the variants. */ 5839 5840 TYPE_FIELDS (t) = fieldlist; 5841 5842 for (x = TYPE_MAIN_VARIANT (t); x; x = TYPE_NEXT_VARIANT (x)) 5843 { 5844 TYPE_FIELDS (x) = TYPE_FIELDS (t); 5845 TYPE_LANG_SPECIFIC (x) = TYPE_LANG_SPECIFIC (t); 5846 TYPE_ALIGN (x) = TYPE_ALIGN (t); 5847 TYPE_USER_ALIGN (x) = TYPE_USER_ALIGN (t); 5848 } 5849 5850 /* If this was supposed to be a transparent union, but we can't 5851 make it one, warn and turn off the flag. */ 5852 if (TREE_CODE (t) == UNION_TYPE 5853 && TYPE_TRANSPARENT_UNION (t) 5854 && TYPE_MODE (t) != DECL_MODE (TYPE_FIELDS (t))) 5855 { 5856 TYPE_TRANSPARENT_UNION (t) = 0; 5857 warning ("union cannot be made transparent"); 5858 } 5859 5860 /* If this structure or union completes the type of any previous 5861 variable declaration, lay it out and output its rtl. */ 5862 5863 if (current_binding_level->n_incomplete != 0) 5864 { 5865 tree decl; 5866 for (decl = current_binding_level->names; decl; decl = TREE_CHAIN (decl)) 5867 { 5868 if (TYPE_MAIN_VARIANT (TREE_TYPE (decl)) == TYPE_MAIN_VARIANT (t) 5869 && TREE_CODE (decl) != TYPE_DECL) 5870 { 5871 layout_decl (decl, 0); 5872 /* This is a no-op in c-lang.c or something real in objc-actions.c. */ 5873 maybe_objc_check_decl (decl); 5874 rest_of_decl_compilation (decl, NULL, toplevel, 0); 5875 if (! toplevel) 5876 expand_decl (decl); 5877 if (--current_binding_level->n_incomplete == 0) 5878 break; 5879 } 5880 else if (!COMPLETE_TYPE_P (TREE_TYPE (decl)) 5881 && TREE_CODE (TREE_TYPE (decl)) == ARRAY_TYPE) 5882 { 5883 tree element = TREE_TYPE (decl); 5884 while (TREE_CODE (element) == ARRAY_TYPE) 5885 element = TREE_TYPE (element); 5886 if (element == t) 5887 { 5888 layout_array_type (TREE_TYPE (decl)); 5889 if (TREE_CODE (decl) != TYPE_DECL) 5890 { 5891 layout_decl (decl, 0); 5892 maybe_objc_check_decl (decl); 5893 rest_of_decl_compilation (decl, NULL, toplevel, 0); 5894 if (! toplevel) 5895 expand_decl (decl); 5896 } 5897 if (--current_binding_level->n_incomplete == 0) 5898 break; 5899 } 5900 } 5901 } 5902 } 5903 5904 /* Finish debugging output for this type. */ 5905 rest_of_type_compilation (t, toplevel); 5906 5907 return t; 5908} 5909 5910/* Lay out the type T, and its element type, and so on. */ 5911 5912static void 5913layout_array_type (t) 5914 tree t; 5915{ 5916 if (TREE_CODE (TREE_TYPE (t)) == ARRAY_TYPE) 5917 layout_array_type (TREE_TYPE (t)); 5918 layout_type (t); 5919} 5920 5921/* Begin compiling the definition of an enumeration type. 5922 NAME is its name (or null if anonymous). 5923 Returns the type object, as yet incomplete. 5924 Also records info about it so that build_enumerator 5925 may be used to declare the individual values as they are read. */ 5926 5927tree 5928start_enum (name) 5929 tree name; 5930{ 5931 tree enumtype = 0; 5932 5933 /* If this is the real definition for a previous forward reference, 5934 fill in the contents in the same object that used to be the 5935 forward reference. */ 5936 5937 if (name != 0) 5938 enumtype = lookup_tag (ENUMERAL_TYPE, name, current_binding_level, 1); 5939 5940 if (enumtype == 0 || TREE_CODE (enumtype) != ENUMERAL_TYPE) 5941 { 5942 enumtype = make_node (ENUMERAL_TYPE); 5943 pushtag (name, enumtype); 5944 } 5945 5946 C_TYPE_BEING_DEFINED (enumtype) = 1; 5947 5948 if (TYPE_VALUES (enumtype) != 0) 5949 { 5950 /* This enum is a named one that has been declared already. */ 5951 error ("redeclaration of `enum %s'", IDENTIFIER_POINTER (name)); 5952 5953 /* Completely replace its old definition. 5954 The old enumerators remain defined, however. */ 5955 TYPE_VALUES (enumtype) = 0; 5956 } 5957 5958 enum_next_value = integer_zero_node; 5959 enum_overflow = 0; 5960 5961 if (flag_short_enums) 5962 TYPE_PACKED (enumtype) = 1; 5963 5964 return enumtype; 5965} 5966 5967/* After processing and defining all the values of an enumeration type, 5968 install their decls in the enumeration type and finish it off. 5969 ENUMTYPE is the type object, VALUES a list of decl-value pairs, 5970 and ATTRIBUTES are the specified attributes. 5971 Returns ENUMTYPE. */ 5972 5973tree 5974finish_enum (enumtype, values, attributes) 5975 tree enumtype; 5976 tree values; 5977 tree attributes; 5978{ 5979 tree pair, tem; 5980 tree minnode = 0, maxnode = 0, enum_value_type; 5981 int precision, unsign; 5982 int toplevel = (global_binding_level == current_binding_level); 5983 5984 if (in_parm_level_p ()) 5985 warning ("enum defined inside parms"); 5986 5987 decl_attributes (&enumtype, attributes, (int) ATTR_FLAG_TYPE_IN_PLACE); 5988 5989 /* Calculate the maximum value of any enumerator in this type. */ 5990 5991 if (values == error_mark_node) 5992 minnode = maxnode = integer_zero_node; 5993 else 5994 { 5995 minnode = maxnode = TREE_VALUE (values); 5996 for (pair = TREE_CHAIN (values); pair; pair = TREE_CHAIN (pair)) 5997 { 5998 tree value = TREE_VALUE (pair); 5999 if (tree_int_cst_lt (maxnode, value)) 6000 maxnode = value; 6001 if (tree_int_cst_lt (value, minnode)) 6002 minnode = value; 6003 } 6004 } 6005 6006 /* Construct the final type of this enumeration. It is the same 6007 as one of the integral types - the narrowest one that fits, except 6008 that normally we only go as narrow as int - and signed iff any of 6009 the values are negative. */ 6010 unsign = (tree_int_cst_sgn (minnode) >= 0); 6011 precision = MAX (min_precision (minnode, unsign), 6012 min_precision (maxnode, unsign)); 6013 if (TYPE_PACKED (enumtype) || precision > TYPE_PRECISION (integer_type_node)) 6014 { 6015 tree narrowest = type_for_size (precision, unsign); 6016 if (narrowest == 0) 6017 { 6018 warning ("enumeration values exceed range of largest integer"); 6019 narrowest = long_long_integer_type_node; 6020 } 6021 6022 precision = TYPE_PRECISION (narrowest); 6023 } 6024 else 6025 precision = TYPE_PRECISION (integer_type_node); 6026 6027 if (precision == TYPE_PRECISION (integer_type_node)) 6028 enum_value_type = type_for_size (precision, 0); 6029 else 6030 enum_value_type = enumtype; 6031 6032 TYPE_MIN_VALUE (enumtype) = minnode; 6033 TYPE_MAX_VALUE (enumtype) = maxnode; 6034 TYPE_PRECISION (enumtype) = precision; 6035 TREE_UNSIGNED (enumtype) = unsign; 6036 TYPE_SIZE (enumtype) = 0; 6037 layout_type (enumtype); 6038 6039 if (values != error_mark_node) 6040 { 6041 /* Change the type of the enumerators to be the enum type. We 6042 need to do this irrespective of the size of the enum, for 6043 proper type checking. Replace the DECL_INITIALs of the 6044 enumerators, and the value slots of the list, with copies 6045 that have the enum type; they cannot be modified in place 6046 because they may be shared (e.g. integer_zero_node) Finally, 6047 change the purpose slots to point to the names of the decls. */ 6048 for (pair = values; pair; pair = TREE_CHAIN (pair)) 6049 { 6050 tree enu = TREE_PURPOSE (pair); 6051 6052 TREE_TYPE (enu) = enumtype; 6053 DECL_SIZE (enu) = TYPE_SIZE (enumtype); 6054 DECL_SIZE_UNIT (enu) = TYPE_SIZE_UNIT (enumtype); 6055 DECL_ALIGN (enu) = TYPE_ALIGN (enumtype); 6056 DECL_USER_ALIGN (enu) = TYPE_USER_ALIGN (enumtype); 6057 DECL_MODE (enu) = TYPE_MODE (enumtype); 6058 6059 /* The ISO C Standard mandates enumerators to have type int, 6060 even though the underlying type of an enum type is 6061 unspecified. Here we convert any enumerators that fit in 6062 an int to type int, to avoid promotions to unsigned types 6063 when comparing integers with enumerators that fit in the 6064 int range. When -pedantic is given, build_enumerator() 6065 would have already taken care of those that don't fit. */ 6066 if (int_fits_type_p (DECL_INITIAL (enu), enum_value_type)) 6067 DECL_INITIAL (enu) = convert (enum_value_type, DECL_INITIAL (enu)); 6068 else 6069 DECL_INITIAL (enu) = convert (enumtype, DECL_INITIAL (enu)); 6070 6071 TREE_PURPOSE (pair) = DECL_NAME (enu); 6072 TREE_VALUE (pair) = DECL_INITIAL (enu); 6073 } 6074 6075 TYPE_VALUES (enumtype) = values; 6076 } 6077 6078 /* Fix up all variant types of this enum type. */ 6079 for (tem = TYPE_MAIN_VARIANT (enumtype); tem; tem = TYPE_NEXT_VARIANT (tem)) 6080 { 6081 if (tem == enumtype) 6082 continue; 6083 TYPE_VALUES (tem) = TYPE_VALUES (enumtype); 6084 TYPE_MIN_VALUE (tem) = TYPE_MIN_VALUE (enumtype); 6085 TYPE_MAX_VALUE (tem) = TYPE_MAX_VALUE (enumtype); 6086 TYPE_SIZE (tem) = TYPE_SIZE (enumtype); 6087 TYPE_SIZE_UNIT (tem) = TYPE_SIZE_UNIT (enumtype); 6088 TYPE_MODE (tem) = TYPE_MODE (enumtype); 6089 TYPE_PRECISION (tem) = TYPE_PRECISION (enumtype); 6090 TYPE_ALIGN (tem) = TYPE_ALIGN (enumtype); 6091 TYPE_USER_ALIGN (tem) = TYPE_USER_ALIGN (enumtype); 6092 TREE_UNSIGNED (tem) = TREE_UNSIGNED (enumtype); 6093 } 6094 6095 /* Finish debugging output for this type. */ 6096 rest_of_type_compilation (enumtype, toplevel); 6097 6098 return enumtype; 6099} 6100 6101/* Build and install a CONST_DECL for one value of the 6102 current enumeration type (one that was begun with start_enum). 6103 Return a tree-list containing the CONST_DECL and its value. 6104 Assignment of sequential values by default is handled here. */ 6105 6106tree 6107build_enumerator (name, value) 6108 tree name, value; 6109{ 6110 tree decl, type; 6111 6112 /* Validate and default VALUE. */ 6113 6114 /* Remove no-op casts from the value. */ 6115 if (value) 6116 STRIP_TYPE_NOPS (value); 6117 6118 if (value != 0) 6119 { 6120 if (TREE_CODE (value) == INTEGER_CST) 6121 { 6122 value = default_conversion (value); 6123 constant_expression_warning (value); 6124 } 6125 else 6126 { 6127 error ("enumerator value for `%s' not integer constant", 6128 IDENTIFIER_POINTER (name)); 6129 value = 0; 6130 } 6131 } 6132 6133 /* Default based on previous value. */ 6134 /* It should no longer be possible to have NON_LVALUE_EXPR 6135 in the default. */ 6136 if (value == 0) 6137 { 6138 value = enum_next_value; 6139 if (enum_overflow) 6140 error ("overflow in enumeration values"); 6141 } 6142 6143 if (pedantic && ! int_fits_type_p (value, integer_type_node)) 6144 { 6145 pedwarn ("ISO C restricts enumerator values to range of `int'"); 6146 value = convert (integer_type_node, value); 6147 } 6148 6149 /* Set basis for default for next value. */ 6150 enum_next_value = build_binary_op (PLUS_EXPR, value, integer_one_node, 0); 6151 enum_overflow = tree_int_cst_lt (enum_next_value, value); 6152 6153 /* Now create a declaration for the enum value name. */ 6154 6155 type = TREE_TYPE (value); 6156 type = type_for_size (MAX (TYPE_PRECISION (type), 6157 TYPE_PRECISION (integer_type_node)), 6158 ((flag_traditional 6159 || TYPE_PRECISION (type) >= TYPE_PRECISION (integer_type_node)) 6160 && TREE_UNSIGNED (type))); 6161 6162 decl = build_decl (CONST_DECL, name, type); 6163 DECL_INITIAL (decl) = convert (type, value); 6164 pushdecl (decl); 6165 6166 return tree_cons (decl, value, NULL_TREE); 6167} 6168 6169 6170/* Create the FUNCTION_DECL for a function definition. 6171 DECLSPECS, DECLARATOR and ATTRIBUTES are the parts of 6172 the declaration; they describe the function's name and the type it returns, 6173 but twisted together in a fashion that parallels the syntax of C. 6174 6175 This function creates a binding context for the function body 6176 as well as setting up the FUNCTION_DECL in current_function_decl. 6177 6178 Returns 1 on success. If the DECLARATOR is not suitable for a function 6179 (it defines a datum instead), we return 0, which tells 6180 yyparse to report a parse error. */ 6181 6182int 6183start_function (declspecs, declarator, attributes) 6184 tree declarator, declspecs, attributes; 6185{ 6186 tree decl1, old_decl; 6187 tree restype; 6188 int old_immediate_size_expand = immediate_size_expand; 6189 6190 current_function_returns_value = 0; /* Assume, until we see it does. */ 6191 current_function_returns_null = 0; 6192 current_function_returns_abnormally = 0; 6193 warn_about_return_type = 0; 6194 current_extern_inline = 0; 6195 c_function_varargs = 0; 6196 named_labels = 0; 6197 shadowed_labels = 0; 6198 6199 /* Don't expand any sizes in the return type of the function. */ 6200 immediate_size_expand = 0; 6201 6202 decl1 = grokdeclarator (declarator, declspecs, FUNCDEF, 1); 6203 6204 /* If the declarator is not suitable for a function definition, 6205 cause a syntax error. */ 6206 if (decl1 == 0) 6207 { 6208 immediate_size_expand = old_immediate_size_expand; 6209 return 0; 6210 } 6211 6212 decl_attributes (&decl1, attributes, 0); 6213 6214 /* If #pragma weak was used, mark the decl weak now. */ 6215 if (current_binding_level == global_binding_level) 6216 maybe_apply_pragma_weak (decl1); 6217 6218 if (DECL_DECLARED_INLINE_P (decl1) 6219 && DECL_UNINLINABLE (decl1) 6220 && lookup_attribute ("noinline", DECL_ATTRIBUTES (decl1))) 6221 warning_with_decl (decl1, 6222 "inline function `%s' given attribute noinline"); 6223 6224 announce_function (decl1); 6225 6226 if (!COMPLETE_OR_VOID_TYPE_P (TREE_TYPE (TREE_TYPE (decl1)))) 6227 { 6228 error ("return type is an incomplete type"); 6229 /* Make it return void instead. */ 6230 TREE_TYPE (decl1) 6231 = build_function_type (void_type_node, 6232 TYPE_ARG_TYPES (TREE_TYPE (decl1))); 6233 } 6234 6235 if (warn_about_return_type) 6236 pedwarn_c99 ("return type defaults to `int'"); 6237 6238 /* Save the parm names or decls from this function's declarator 6239 where store_parm_decls will find them. */ 6240 current_function_parms = last_function_parms; 6241 current_function_parm_tags = last_function_parm_tags; 6242 6243 /* Make the init_value nonzero so pushdecl knows this is not tentative. 6244 error_mark_node is replaced below (in poplevel) with the BLOCK. */ 6245 DECL_INITIAL (decl1) = error_mark_node; 6246 6247 /* If this definition isn't a prototype and we had a prototype declaration 6248 before, copy the arg type info from that prototype. 6249 But not if what we had before was a builtin function. */ 6250 old_decl = lookup_name_current_level (DECL_NAME (decl1)); 6251 if (old_decl != 0 && TREE_CODE (TREE_TYPE (old_decl)) == FUNCTION_TYPE 6252 && !DECL_BUILT_IN (old_decl) 6253 && (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (decl1))) 6254 == TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (old_decl)))) 6255 && TYPE_ARG_TYPES (TREE_TYPE (decl1)) == 0) 6256 { 6257 TREE_TYPE (decl1) = TREE_TYPE (old_decl); 6258 current_function_prototype_file = DECL_SOURCE_FILE (old_decl); 6259 current_function_prototype_line = DECL_SOURCE_LINE (old_decl); 6260 } 6261 6262 /* If there is no explicit declaration, look for any out-of-scope implicit 6263 declarations. */ 6264 if (old_decl == 0) 6265 old_decl = IDENTIFIER_IMPLICIT_DECL (DECL_NAME (decl1)); 6266 6267 /* Optionally warn of old-fashioned def with no previous prototype. */ 6268 if (warn_strict_prototypes 6269 && TYPE_ARG_TYPES (TREE_TYPE (decl1)) == 0 6270 && !(old_decl != 0 6271 && (TYPE_ARG_TYPES (TREE_TYPE (old_decl)) != 0 6272 || (DECL_BUILT_IN (old_decl) 6273 && ! C_DECL_ANTICIPATED (old_decl)))) 6274 && !(flag_bsd_no_warn_kr_main && 0 == 6275 strcmp ("main", IDENTIFIER_POINTER (DECL_NAME (decl1))))) 6276 warning ("function declaration isn't a prototype"); 6277 /* Optionally warn of any global def with no previous prototype. */ 6278 else if (warn_missing_prototypes 6279 && TREE_PUBLIC (decl1) 6280 && !(old_decl != 0 6281 && (TYPE_ARG_TYPES (TREE_TYPE (old_decl)) != 0 6282 || (DECL_BUILT_IN (old_decl) 6283 && ! C_DECL_ANTICIPATED (old_decl)))) 6284 && ! MAIN_NAME_P (DECL_NAME (decl1))) 6285 warning_with_decl (decl1, "no previous prototype for `%s'"); 6286 /* Optionally warn of any def with no previous prototype 6287 if the function has already been used. */ 6288 else if (warn_missing_prototypes 6289 && old_decl != 0 && TREE_USED (old_decl) 6290 && TYPE_ARG_TYPES (TREE_TYPE (old_decl)) == 0) 6291 warning_with_decl (decl1, 6292 "`%s' was used with no prototype before its definition"); 6293 /* Optionally warn of any global def with no previous declaration. */ 6294 else if (warn_missing_declarations 6295 && TREE_PUBLIC (decl1) 6296 && old_decl == 0 6297 && ! MAIN_NAME_P (DECL_NAME (decl1))) 6298 warning_with_decl (decl1, "no previous declaration for `%s'"); 6299 /* Optionally warn of any def with no previous declaration 6300 if the function has already been used. */ 6301 else if (warn_missing_declarations 6302 && old_decl != 0 && TREE_USED (old_decl) 6303 && old_decl == IDENTIFIER_IMPLICIT_DECL (DECL_NAME (decl1))) 6304 warning_with_decl (decl1, 6305 "`%s' was used with no declaration before its definition"); 6306 6307 /* This is a definition, not a reference. 6308 So normally clear DECL_EXTERNAL. 6309 However, `extern inline' acts like a declaration 6310 except for defining how to inline. So set DECL_EXTERNAL in that case. */ 6311 DECL_EXTERNAL (decl1) = current_extern_inline; 6312 6313 /* This function exists in static storage. 6314 (This does not mean `static' in the C sense!) */ 6315 TREE_STATIC (decl1) = 1; 6316 6317 /* A nested function is not global. */ 6318 if (current_function_decl != 0) 6319 TREE_PUBLIC (decl1) = 0; 6320 6321 /* Warn for unlikely, improbable, or stupid declarations of `main'. */ 6322 if (warn_main > 0 && MAIN_NAME_P (DECL_NAME (decl1))) 6323 { 6324 tree args; 6325 int argct = 0; 6326 6327 if (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (decl1))) 6328 != integer_type_node) 6329 pedwarn_with_decl (decl1, "return type of `%s' is not `int'"); 6330 6331 for (args = TYPE_ARG_TYPES (TREE_TYPE (decl1)); args; 6332 args = TREE_CHAIN (args)) 6333 { 6334 tree type = args ? TREE_VALUE (args) : 0; 6335 6336 if (type == void_type_node) 6337 break; 6338 6339 ++argct; 6340 switch (argct) 6341 { 6342 case 1: 6343 if (TYPE_MAIN_VARIANT (type) != integer_type_node) 6344 pedwarn_with_decl (decl1, 6345 "first argument of `%s' should be `int'"); 6346 break; 6347 6348 case 2: 6349 if (TREE_CODE (type) != POINTER_TYPE 6350 || TREE_CODE (TREE_TYPE (type)) != POINTER_TYPE 6351 || (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (type))) 6352 != char_type_node)) 6353 pedwarn_with_decl (decl1, 6354 "second argument of `%s' should be `char **'"); 6355 break; 6356 6357 case 3: 6358 if (TREE_CODE (type) != POINTER_TYPE 6359 || TREE_CODE (TREE_TYPE (type)) != POINTER_TYPE 6360 || (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (type))) 6361 != char_type_node)) 6362 pedwarn_with_decl (decl1, 6363 "third argument of `%s' should probably be `char **'"); 6364 break; 6365 } 6366 } 6367 6368 /* It is intentional that this message does not mention the third 6369 argument because it's only mentioned in an appendix of the 6370 standard. */ 6371 if (argct > 0 && (argct < 2 || argct > 3)) 6372 pedwarn_with_decl (decl1, "`%s' takes only zero or two arguments"); 6373 6374 if (! TREE_PUBLIC (decl1)) 6375 pedwarn_with_decl (decl1, "`%s' is normally a non-static function"); 6376 } 6377 6378 /* Record the decl so that the function name is defined. 6379 If we already have a decl for this name, and it is a FUNCTION_DECL, 6380 use the old decl. */ 6381 6382 current_function_decl = pushdecl (decl1); 6383 6384 pushlevel (0); 6385 declare_parm_level (1); 6386 current_binding_level->subblocks_tag_transparent = 1; 6387 6388 make_decl_rtl (current_function_decl, NULL); 6389 6390 restype = TREE_TYPE (TREE_TYPE (current_function_decl)); 6391 /* Promote the value to int before returning it. */ 6392 if (c_promoting_integer_type_p (restype)) 6393 { 6394 /* It retains unsignedness if traditional 6395 or if not really getting wider. */ 6396 if (TREE_UNSIGNED (restype) 6397 && (flag_traditional 6398 || (TYPE_PRECISION (restype) 6399 == TYPE_PRECISION (integer_type_node)))) 6400 restype = unsigned_type_node; 6401 else 6402 restype = integer_type_node; 6403 } 6404 DECL_RESULT (current_function_decl) 6405 = build_decl (RESULT_DECL, NULL_TREE, restype); 6406 6407 /* If this fcn was already referenced via a block-scope `extern' decl 6408 (or an implicit decl), propagate certain information about the usage. */ 6409 if (TREE_ADDRESSABLE (DECL_ASSEMBLER_NAME (current_function_decl))) 6410 TREE_ADDRESSABLE (current_function_decl) = 1; 6411 6412 immediate_size_expand = old_immediate_size_expand; 6413 6414 start_fname_decls (); 6415 6416 return 1; 6417} 6418 6419/* Record that this function is going to be a varargs function. 6420 This is called before store_parm_decls, which is too early 6421 to call mark_varargs directly. */ 6422 6423void 6424c_mark_varargs () 6425{ 6426 c_function_varargs = 1; 6427} 6428 6429/* Store the parameter declarations into the current function declaration. 6430 This is called after parsing the parameter declarations, before 6431 digesting the body of the function. 6432 6433 For an old-style definition, modify the function's type 6434 to specify at least the number of arguments. */ 6435 6436void 6437store_parm_decls () 6438{ 6439 tree fndecl = current_function_decl; 6440 tree parm; 6441 6442 /* This is either a chain of PARM_DECLs (if a prototype was used) 6443 or a list of IDENTIFIER_NODEs (for an old-fashioned C definition). */ 6444 tree specparms = current_function_parms; 6445 6446 /* This is a list of types declared among parms in a prototype. */ 6447 tree parmtags = current_function_parm_tags; 6448 6449 /* This is a chain of PARM_DECLs from old-style parm declarations. */ 6450 tree parmdecls = getdecls (); 6451 6452 /* This is a chain of any other decls that came in among the parm 6453 declarations. If a parm is declared with enum {foo, bar} x; 6454 then CONST_DECLs for foo and bar are put here. */ 6455 tree nonparms = 0; 6456 6457 /* The function containing FNDECL, if any. */ 6458 tree context = decl_function_context (fndecl); 6459 6460 /* Nonzero if this definition is written with a prototype. */ 6461 int prototype = 0; 6462 6463 int saved_warn_shadow = warn_shadow; 6464 6465 /* Don't re-emit shadow warnings. */ 6466 warn_shadow = 0; 6467 6468 if (specparms != 0 && TREE_CODE (specparms) != TREE_LIST) 6469 { 6470 /* This case is when the function was defined with an ANSI prototype. 6471 The parms already have decls, so we need not do anything here 6472 except record them as in effect 6473 and complain if any redundant old-style parm decls were written. */ 6474 6475 tree next; 6476 tree others = 0; 6477 6478 prototype = 1; 6479 6480 if (parmdecls != 0) 6481 { 6482 tree decl, link; 6483 6484 error_with_decl (fndecl, 6485 "parm types given both in parmlist and separately"); 6486 /* Get rid of the erroneous decls; don't keep them on 6487 the list of parms, since they might not be PARM_DECLs. */ 6488 for (decl = current_binding_level->names; 6489 decl; decl = TREE_CHAIN (decl)) 6490 if (DECL_NAME (decl)) 6491 IDENTIFIER_LOCAL_VALUE (DECL_NAME (decl)) = 0; 6492 for (link = current_binding_level->shadowed; 6493 link; link = TREE_CHAIN (link)) 6494 IDENTIFIER_LOCAL_VALUE (TREE_PURPOSE (link)) = TREE_VALUE (link); 6495 current_binding_level->names = 0; 6496 current_binding_level->shadowed = 0; 6497 } 6498 6499 specparms = nreverse (specparms); 6500 for (parm = specparms; parm; parm = next) 6501 { 6502 next = TREE_CHAIN (parm); 6503 if (TREE_CODE (parm) == PARM_DECL) 6504 { 6505 if (DECL_NAME (parm) == 0) 6506 error_with_decl (parm, "parameter name omitted"); 6507 else if (TREE_CODE (TREE_TYPE (parm)) != ERROR_MARK 6508 && VOID_TYPE_P (TREE_TYPE (parm))) 6509 { 6510 error_with_decl (parm, "parameter `%s' declared void"); 6511 /* Change the type to error_mark_node so this parameter 6512 will be ignored by assign_parms. */ 6513 TREE_TYPE (parm) = error_mark_node; 6514 } 6515 pushdecl (parm); 6516 } 6517 else 6518 { 6519 /* If we find an enum constant or a type tag, 6520 put it aside for the moment. */ 6521 TREE_CHAIN (parm) = 0; 6522 others = chainon (others, parm); 6523 } 6524 } 6525 6526 /* Get the decls in their original chain order 6527 and record in the function. */ 6528 DECL_ARGUMENTS (fndecl) = getdecls (); 6529 6530#if 0 6531 /* If this function takes a variable number of arguments, 6532 add a phony parameter to the end of the parm list, 6533 to represent the position of the first unnamed argument. */ 6534 if (TREE_VALUE (tree_last (TYPE_ARG_TYPES (TREE_TYPE (fndecl)))) 6535 != void_type_node) 6536 { 6537 tree dummy = build_decl (PARM_DECL, NULL_TREE, void_type_node); 6538 /* Let's hope the address of the unnamed parm 6539 won't depend on its type. */ 6540 TREE_TYPE (dummy) = integer_type_node; 6541 DECL_ARG_TYPE (dummy) = integer_type_node; 6542 DECL_ARGUMENTS (fndecl) = chainon (DECL_ARGUMENTS (fndecl), dummy); 6543 } 6544#endif 6545 6546 /* Now pushdecl the enum constants. */ 6547 for (parm = others; parm; parm = next) 6548 { 6549 next = TREE_CHAIN (parm); 6550 if (DECL_NAME (parm) == 0) 6551 ; 6552 else if (TYPE_MAIN_VARIANT (TREE_TYPE (parm)) == void_type_node) 6553 ; 6554 else if (TREE_CODE (parm) != PARM_DECL) 6555 pushdecl (parm); 6556 } 6557 6558 storetags (chainon (parmtags, gettags ())); 6559 } 6560 else 6561 { 6562 /* SPECPARMS is an identifier list--a chain of TREE_LIST nodes 6563 each with a parm name as the TREE_VALUE. 6564 6565 PARMDECLS is a chain of declarations for parameters. 6566 Warning! It can also contain CONST_DECLs which are not parameters 6567 but are names of enumerators of any enum types 6568 declared among the parameters. 6569 6570 First match each formal parameter name with its declaration. 6571 Associate decls with the names and store the decls 6572 into the TREE_PURPOSE slots. */ 6573 6574 /* We use DECL_WEAK as a flag to show which parameters have been 6575 seen already since it is not used on PARM_DECL or CONST_DECL. */ 6576 for (parm = parmdecls; parm; parm = TREE_CHAIN (parm)) 6577 DECL_WEAK (parm) = 0; 6578 6579 for (parm = specparms; parm; parm = TREE_CHAIN (parm)) 6580 { 6581 tree tail, found = NULL; 6582 6583 if (TREE_VALUE (parm) == 0) 6584 { 6585 error_with_decl (fndecl, 6586 "parameter name missing from parameter list"); 6587 TREE_PURPOSE (parm) = 0; 6588 continue; 6589 } 6590 6591 /* See if any of the parmdecls specifies this parm by name. 6592 Ignore any enumerator decls. */ 6593 for (tail = parmdecls; tail; tail = TREE_CHAIN (tail)) 6594 if (DECL_NAME (tail) == TREE_VALUE (parm) 6595 && TREE_CODE (tail) == PARM_DECL) 6596 { 6597 found = tail; 6598 break; 6599 } 6600 6601 /* If declaration already marked, we have a duplicate name. 6602 Complain, and don't use this decl twice. */ 6603 if (found && DECL_WEAK (found)) 6604 { 6605 error_with_decl (found, "multiple parameters named `%s'"); 6606 found = 0; 6607 } 6608 6609 /* If the declaration says "void", complain and ignore it. */ 6610 if (found && VOID_TYPE_P (TREE_TYPE (found))) 6611 { 6612 error_with_decl (found, "parameter `%s' declared void"); 6613 TREE_TYPE (found) = integer_type_node; 6614 DECL_ARG_TYPE (found) = integer_type_node; 6615 layout_decl (found, 0); 6616 } 6617 6618 /* Traditionally, a parm declared float is actually a double. */ 6619 if (found && flag_traditional 6620 && TYPE_MAIN_VARIANT (TREE_TYPE (found)) == float_type_node) 6621 { 6622 TREE_TYPE (found) = double_type_node; 6623 DECL_ARG_TYPE (found) = double_type_node; 6624 layout_decl (found, 0); 6625 } 6626 6627 /* If no declaration found, default to int. */ 6628 if (!found) 6629 { 6630 found = build_decl (PARM_DECL, TREE_VALUE (parm), 6631 integer_type_node); 6632 DECL_ARG_TYPE (found) = TREE_TYPE (found); 6633 DECL_SOURCE_LINE (found) = DECL_SOURCE_LINE (fndecl); 6634 DECL_SOURCE_FILE (found) = DECL_SOURCE_FILE (fndecl); 6635 if (flag_isoc99) 6636 pedwarn_with_decl (found, "type of `%s' defaults to `int'"); 6637 else if (extra_warnings) 6638 warning_with_decl (found, "type of `%s' defaults to `int'"); 6639 pushdecl (found); 6640 } 6641 6642 TREE_PURPOSE (parm) = found; 6643 6644 /* Mark this decl as "already found". */ 6645 DECL_WEAK (found) = 1; 6646 } 6647 6648 /* Put anything which is on the parmdecls chain and which is 6649 not a PARM_DECL onto the list NONPARMS. (The types of 6650 non-parm things which might appear on the list include 6651 enumerators and NULL-named TYPE_DECL nodes.) Complain about 6652 any actual PARM_DECLs not matched with any names. */ 6653 6654 nonparms = 0; 6655 for (parm = parmdecls; parm;) 6656 { 6657 tree next = TREE_CHAIN (parm); 6658 TREE_CHAIN (parm) = 0; 6659 6660 if (TREE_CODE (parm) != PARM_DECL) 6661 nonparms = chainon (nonparms, parm); 6662 else 6663 { 6664 /* Complain about args with incomplete types. */ 6665 if (!COMPLETE_TYPE_P (TREE_TYPE (parm))) 6666 { 6667 error_with_decl (parm, "parameter `%s' has incomplete type"); 6668 TREE_TYPE (parm) = error_mark_node; 6669 } 6670 6671 if (! DECL_WEAK (parm)) 6672 { 6673 error_with_decl (parm, 6674 "declaration for parameter `%s' but no such parameter"); 6675 /* Pretend the parameter was not missing. 6676 This gets us to a standard state and minimizes 6677 further error messages. */ 6678 specparms 6679 = chainon (specparms, 6680 tree_cons (parm, NULL_TREE, NULL_TREE)); 6681 } 6682 } 6683 6684 parm = next; 6685 } 6686 6687 /* Chain the declarations together in the order of the list of 6688 names. Store that chain in the function decl, replacing the 6689 list of names. */ 6690 parm = specparms; 6691 DECL_ARGUMENTS (fndecl) = 0; 6692 { 6693 tree last; 6694 for (last = 0; parm; parm = TREE_CHAIN (parm)) 6695 if (TREE_PURPOSE (parm)) 6696 { 6697 if (last == 0) 6698 DECL_ARGUMENTS (fndecl) = TREE_PURPOSE (parm); 6699 else 6700 TREE_CHAIN (last) = TREE_PURPOSE (parm); 6701 last = TREE_PURPOSE (parm); 6702 TREE_CHAIN (last) = 0; 6703 } 6704 } 6705 6706 /* If there was a previous prototype, 6707 set the DECL_ARG_TYPE of each argument according to 6708 the type previously specified, and report any mismatches. */ 6709 6710 if (TYPE_ARG_TYPES (TREE_TYPE (fndecl))) 6711 { 6712 tree type; 6713 for (parm = DECL_ARGUMENTS (fndecl), 6714 type = TYPE_ARG_TYPES (TREE_TYPE (fndecl)); 6715 parm || (type && (TYPE_MAIN_VARIANT (TREE_VALUE (type)) 6716 != void_type_node)); 6717 parm = TREE_CHAIN (parm), type = TREE_CHAIN (type)) 6718 { 6719 if (parm == 0 || type == 0 6720 || TYPE_MAIN_VARIANT (TREE_VALUE (type)) == void_type_node) 6721 { 6722 error ("number of arguments doesn't match prototype"); 6723 error_with_file_and_line (current_function_prototype_file, 6724 current_function_prototype_line, 6725 "prototype declaration"); 6726 break; 6727 } 6728 /* Type for passing arg must be consistent with that 6729 declared for the arg. ISO C says we take the unqualified 6730 type for parameters declared with qualified type. */ 6731 if (! comptypes (TYPE_MAIN_VARIANT (DECL_ARG_TYPE (parm)), 6732 TYPE_MAIN_VARIANT (TREE_VALUE (type)))) 6733 { 6734 if (TYPE_MAIN_VARIANT (TREE_TYPE (parm)) 6735 == TYPE_MAIN_VARIANT (TREE_VALUE (type))) 6736 { 6737 /* Adjust argument to match prototype. E.g. a previous 6738 `int foo(float);' prototype causes 6739 `int foo(x) float x; {...}' to be treated like 6740 `int foo(float x) {...}'. This is particularly 6741 useful for argument types like uid_t. */ 6742 DECL_ARG_TYPE (parm) = TREE_TYPE (parm); 6743 6744 if (PROMOTE_PROTOTYPES 6745 && INTEGRAL_TYPE_P (TREE_TYPE (parm)) 6746 && TYPE_PRECISION (TREE_TYPE (parm)) 6747 < TYPE_PRECISION (integer_type_node)) 6748 DECL_ARG_TYPE (parm) = integer_type_node; 6749 6750 if (pedantic) 6751 { 6752 pedwarn ("promoted argument `%s' doesn't match prototype", 6753 IDENTIFIER_POINTER (DECL_NAME (parm))); 6754 warning_with_file_and_line 6755 (current_function_prototype_file, 6756 current_function_prototype_line, 6757 "prototype declaration"); 6758 } 6759 } 6760 /* If -traditional, allow `int' argument to match 6761 `unsigned' prototype. */ 6762 else if (! (flag_traditional 6763 && TYPE_MAIN_VARIANT (TREE_TYPE (parm)) == integer_type_node 6764 && TYPE_MAIN_VARIANT (TREE_VALUE (type)) == unsigned_type_node)) 6765 { 6766 error ("argument `%s' doesn't match prototype", 6767 IDENTIFIER_POINTER (DECL_NAME (parm))); 6768 error_with_file_and_line (current_function_prototype_file, 6769 current_function_prototype_line, 6770 "prototype declaration"); 6771 } 6772 } 6773 } 6774 TYPE_ACTUAL_ARG_TYPES (TREE_TYPE (fndecl)) = 0; 6775 } 6776 6777 /* Otherwise, create a prototype that would match. */ 6778 6779 else 6780 { 6781 tree actual = 0, last = 0, type; 6782 6783 for (parm = DECL_ARGUMENTS (fndecl); parm; parm = TREE_CHAIN (parm)) 6784 { 6785 type = tree_cons (NULL_TREE, DECL_ARG_TYPE (parm), NULL_TREE); 6786 if (last) 6787 TREE_CHAIN (last) = type; 6788 else 6789 actual = type; 6790 last = type; 6791 } 6792 type = tree_cons (NULL_TREE, void_type_node, NULL_TREE); 6793 if (last) 6794 TREE_CHAIN (last) = type; 6795 else 6796 actual = type; 6797 6798 /* We are going to assign a new value for the TYPE_ACTUAL_ARG_TYPES 6799 of the type of this function, but we need to avoid having this 6800 affect the types of other similarly-typed functions, so we must 6801 first force the generation of an identical (but separate) type 6802 node for the relevant function type. The new node we create 6803 will be a variant of the main variant of the original function 6804 type. */ 6805 6806 TREE_TYPE (fndecl) = build_type_copy (TREE_TYPE (fndecl)); 6807 6808 TYPE_ACTUAL_ARG_TYPES (TREE_TYPE (fndecl)) = actual; 6809 } 6810 6811 /* Now store the final chain of decls for the arguments 6812 as the decl-chain of the current lexical scope. 6813 Put the enumerators in as well, at the front so that 6814 DECL_ARGUMENTS is not modified. */ 6815 6816 storedecls (chainon (nonparms, DECL_ARGUMENTS (fndecl))); 6817 } 6818 6819 /* Make sure the binding level for the top of the function body 6820 gets a BLOCK if there are any in the function. 6821 Otherwise, the dbx output is wrong. */ 6822 6823 keep_next_if_subblocks = 1; 6824 6825 /* ??? This might be an improvement, 6826 but needs to be thought about some more. */ 6827#if 0 6828 keep_next_level_flag = 1; 6829#endif 6830 6831 /* Write a record describing this function definition to the prototypes 6832 file (if requested). */ 6833 6834 gen_aux_info_record (fndecl, 1, 0, prototype); 6835 6836 /* Initialize the RTL code for the function. */ 6837 init_function_start (fndecl, input_filename, lineno); 6838 6839 /* Begin the statement tree for this function. */ 6840 begin_stmt_tree (&DECL_SAVED_TREE (current_function_decl)); 6841 6842 /* If this is a nested function, save away the sizes of any 6843 variable-size types so that we can expand them when generating 6844 RTL. */ 6845 if (context) 6846 { 6847 tree t; 6848 6849 DECL_LANG_SPECIFIC (fndecl)->pending_sizes 6850 = nreverse (get_pending_sizes ()); 6851 for (t = DECL_LANG_SPECIFIC (fndecl)->pending_sizes; 6852 t; 6853 t = TREE_CHAIN (t)) 6854 SAVE_EXPR_CONTEXT (TREE_VALUE (t)) = context; 6855 } 6856 6857 /* This function is being processed in whole-function mode. */ 6858 cfun->x_whole_function_mode_p = 1; 6859 6860 /* Even though we're inside a function body, we still don't want to 6861 call expand_expr to calculate the size of a variable-sized array. 6862 We haven't necessarily assigned RTL to all variables yet, so it's 6863 not safe to try to expand expressions involving them. */ 6864 immediate_size_expand = 0; 6865 cfun->x_dont_save_pending_sizes_p = 1; 6866 6867 warn_shadow = saved_warn_shadow; 6868} 6869 6870/* Finish up a function declaration and compile that function 6871 all the way to assembler language output. The free the storage 6872 for the function definition. 6873 6874 This is called after parsing the body of the function definition. 6875 6876 NESTED is nonzero if the function being finished is nested in another. 6877 CAN_DEFER_P is nonzero if the function may be deferred. */ 6878 6879void 6880finish_function (nested, can_defer_p) 6881 int nested; 6882 int can_defer_p; 6883{ 6884 tree fndecl = current_function_decl; 6885 6886#if 0 6887 /* This caused &foo to be of type ptr-to-const-function which then 6888 got a warning when stored in a ptr-to-function variable. */ 6889 TREE_READONLY (fndecl) = 1; 6890#endif 6891 6892 poplevel (1, 0, 1); 6893 BLOCK_SUPERCONTEXT (DECL_INITIAL (fndecl)) = fndecl; 6894 6895 /* Must mark the RESULT_DECL as being in this function. */ 6896 6897 DECL_CONTEXT (DECL_RESULT (fndecl)) = fndecl; 6898 6899 /* Obey `register' declarations if `setjmp' is called in this fn. */ 6900 if (flag_traditional && current_function_calls_setjmp) 6901 { 6902 setjmp_protect (DECL_INITIAL (fndecl)); 6903 setjmp_protect_args (); 6904 } 6905 6906 if (MAIN_NAME_P (DECL_NAME (fndecl)) && flag_hosted) 6907 { 6908 if (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (fndecl))) 6909 != integer_type_node) 6910 { 6911 /* If warn_main is 1 (-Wmain) or 2 (-Wall), we have already warned. 6912 If warn_main is -1 (-Wno-main) we don't want to be warned. */ 6913 if (! warn_main) 6914 pedwarn_with_decl (fndecl, "return type of `%s' is not `int'"); 6915 } 6916 else 6917 { 6918#ifdef DEFAULT_MAIN_RETURN 6919 /* Make it so that `main' always returns success by default. */ 6920 DEFAULT_MAIN_RETURN; 6921#else 6922 if (flag_isoc99) 6923 c_expand_return (integer_zero_node); 6924#endif 6925 } 6926 } 6927 6928 finish_fname_decls (); 6929 6930 /* Tie off the statement tree for this function. */ 6931 finish_stmt_tree (&DECL_SAVED_TREE (fndecl)); 6932 6933 /* Complain if there's just no return statement. */ 6934 if (warn_return_type 6935 && TREE_CODE (TREE_TYPE (TREE_TYPE (fndecl))) != VOID_TYPE 6936 && !current_function_returns_value && !current_function_returns_null 6937 /* Don't complain if we abort. */ 6938 && !current_function_returns_abnormally 6939 /* Don't warn for main(). */ 6940 && !MAIN_NAME_P (DECL_NAME (fndecl)) 6941 /* Or if they didn't actually specify a return type. */ 6942 && !C_FUNCTION_IMPLICIT_INT (fndecl) 6943 /* Normally, with -Wreturn-type, flow will complain. Unless we're an 6944 inline function, as we might never be compiled separately. */ 6945 && DECL_INLINE (fndecl)) 6946 warning ("no return statement in function returning non-void"); 6947 6948 /* Clear out memory we no longer need. */ 6949 free_after_parsing (cfun); 6950 /* Since we never call rest_of_compilation, we never clear 6951 CFUN. Do so explicitly. */ 6952 free_after_compilation (cfun); 6953 cfun = NULL; 6954 6955 if (! nested) 6956 { 6957 /* Generate RTL for the body of this function. */ 6958 c_expand_body (fndecl, nested, can_defer_p); 6959 6960 /* Let the error reporting routines know that we're outside a 6961 function. For a nested function, this value is used in 6962 pop_c_function_context and then reset via pop_function_context. */ 6963 current_function_decl = NULL; 6964 } 6965} 6966 6967/* Generate the RTL for a deferred function FNDECL. */ 6968 6969void 6970c_expand_deferred_function (fndecl) 6971 tree fndecl; 6972{ 6973 /* DECL_INLINE or DECL_RESULT might got cleared after the inline 6974 function was deferred, e.g. in duplicate_decls. */ 6975 if (DECL_INLINE (fndecl) && DECL_RESULT (fndecl)) 6976 { 6977 c_expand_body (fndecl, 0, 0); 6978 current_function_decl = NULL; 6979 } 6980} 6981 6982/* Generate the RTL for the body of FNDECL. If NESTED_P is non-zero, 6983 then we are already in the process of generating RTL for another 6984 function. If can_defer_p is zero, we won't attempt to defer the 6985 generation of RTL. */ 6986 6987static void 6988c_expand_body (fndecl, nested_p, can_defer_p) 6989 tree fndecl; 6990 int nested_p, can_defer_p; 6991{ 6992 int uninlinable = 1; 6993 6994 /* There's no reason to do any of the work here if we're only doing 6995 semantic analysis; this code just generates RTL. */ 6996 if (flag_syntax_only) 6997 return; 6998 6999 if (flag_inline_trees) 7000 { 7001 /* First, cache whether the current function is inlinable. Some 7002 predicates depend on cfun and current_function_decl to 7003 function completely. */ 7004 timevar_push (TV_INTEGRATION); 7005 uninlinable = ! tree_inlinable_function_p (fndecl); 7006 7007 if (! uninlinable && can_defer_p 7008 /* Save function tree for inlining. Should return 0 if the 7009 language does not support function deferring or the 7010 function could not be deferred. */ 7011 && defer_fn (fndecl)) 7012 { 7013 /* Let the back-end know that this function exists. */ 7014 (*debug_hooks->deferred_inline_function) (fndecl); 7015 timevar_pop (TV_INTEGRATION); 7016 return; 7017 } 7018 7019 /* Then, inline any functions called in it. */ 7020 optimize_inline_calls (fndecl); 7021 timevar_pop (TV_INTEGRATION); 7022 } 7023 7024 timevar_push (TV_EXPAND); 7025 7026 if (nested_p) 7027 { 7028 /* Make sure that we will evaluate variable-sized types involved 7029 in our function's type. */ 7030 expand_pending_sizes (DECL_LANG_SPECIFIC (fndecl)->pending_sizes); 7031 /* Squirrel away our current state. */ 7032 push_function_context (); 7033 } 7034 7035 /* Initialize the RTL code for the function. */ 7036 current_function_decl = fndecl; 7037 input_filename = DECL_SOURCE_FILE (fndecl); 7038 init_function_start (fndecl, input_filename, DECL_SOURCE_LINE (fndecl)); 7039 7040 /* This function is being processed in whole-function mode. */ 7041 cfun->x_whole_function_mode_p = 1; 7042 7043 /* Even though we're inside a function body, we still don't want to 7044 call expand_expr to calculate the size of a variable-sized array. 7045 We haven't necessarily assigned RTL to all variables yet, so it's 7046 not safe to try to expand expressions involving them. */ 7047 immediate_size_expand = 0; 7048 cfun->x_dont_save_pending_sizes_p = 1; 7049 7050 /* If this is a varargs function, inform function.c. */ 7051 if (c_function_varargs) 7052 mark_varargs (); 7053 7054 /* Set up parameters and prepare for return, for the function. */ 7055 expand_function_start (fndecl, 0); 7056 7057 /* If this function is `main', emit a call to `__main' 7058 to run global initializers, etc. */ 7059 if (DECL_NAME (fndecl) 7060 && MAIN_NAME_P (DECL_NAME (fndecl)) 7061 && DECL_CONTEXT (fndecl) == NULL_TREE) 7062 expand_main_function (); 7063 7064 /* Generate the RTL for this function. */ 7065 expand_stmt (DECL_SAVED_TREE (fndecl)); 7066 if (uninlinable) 7067 { 7068 /* Allow the body of the function to be garbage collected. */ 7069 DECL_SAVED_TREE (fndecl) = NULL_TREE; 7070 } 7071 7072 /* We hard-wired immediate_size_expand to zero above. 7073 expand_function_end will decrement this variable. So, we set the 7074 variable to one here, so that after the decrement it will remain 7075 zero. */ 7076 immediate_size_expand = 1; 7077 7078 /* Allow language dialects to perform special processing. */ 7079 if (lang_expand_function_end) 7080 (*lang_expand_function_end) (); 7081 7082 /* Generate rtl for function exit. */ 7083 expand_function_end (input_filename, lineno, 0); 7084 7085 /* If this is a nested function, protect the local variables in the stack 7086 above us from being collected while we're compiling this function. */ 7087 if (nested_p) 7088 ggc_push_context (); 7089 7090 /* Run the optimizers and output the assembler code for this function. */ 7091 rest_of_compilation (fndecl); 7092 7093 /* Undo the GC context switch. */ 7094 if (nested_p) 7095 ggc_pop_context (); 7096 7097 /* With just -W, complain only if function returns both with 7098 and without a value. */ 7099 if (extra_warnings 7100 && current_function_returns_value 7101 && current_function_returns_null) 7102 warning ("this function may return with or without a value"); 7103 7104 /* If requested, warn about function definitions where the function will 7105 return a value (usually of some struct or union type) which itself will 7106 take up a lot of stack space. */ 7107 7108 if (warn_larger_than && !DECL_EXTERNAL (fndecl) && TREE_TYPE (fndecl)) 7109 { 7110 tree ret_type = TREE_TYPE (TREE_TYPE (fndecl)); 7111 7112 if (ret_type && TYPE_SIZE_UNIT (ret_type) 7113 && TREE_CODE (TYPE_SIZE_UNIT (ret_type)) == INTEGER_CST 7114 && 0 < compare_tree_int (TYPE_SIZE_UNIT (ret_type), 7115 larger_than_size)) 7116 { 7117 unsigned int size_as_int 7118 = TREE_INT_CST_LOW (TYPE_SIZE_UNIT (ret_type)); 7119 7120 if (compare_tree_int (TYPE_SIZE_UNIT (ret_type), size_as_int) == 0) 7121 warning_with_decl (fndecl, 7122 "size of return value of `%s' is %u bytes", 7123 size_as_int); 7124 else 7125 warning_with_decl (fndecl, 7126 "size of return value of `%s' is larger than %d bytes", 7127 larger_than_size); 7128 } 7129 } 7130 7131 if (DECL_SAVED_INSNS (fndecl) == 0 && ! nested_p 7132 && ! flag_inline_trees) 7133 { 7134 /* Stop pointing to the local nodes about to be freed. 7135 But DECL_INITIAL must remain nonzero so we know this 7136 was an actual function definition. 7137 For a nested function, this is done in pop_c_function_context. 7138 If rest_of_compilation set this to 0, leave it 0. */ 7139 if (DECL_INITIAL (fndecl) != 0) 7140 DECL_INITIAL (fndecl) = error_mark_node; 7141 7142 DECL_ARGUMENTS (fndecl) = 0; 7143 } 7144 7145 if (DECL_STATIC_CONSTRUCTOR (fndecl)) 7146 { 7147 if (targetm.have_ctors_dtors) 7148 (* targetm.asm_out.constructor) (XEXP (DECL_RTL (fndecl), 0), 7149 DEFAULT_INIT_PRIORITY); 7150 else 7151 static_ctors = tree_cons (NULL_TREE, fndecl, static_ctors); 7152 } 7153 7154 if (DECL_STATIC_DESTRUCTOR (fndecl)) 7155 { 7156 if (targetm.have_ctors_dtors) 7157 (* targetm.asm_out.destructor) (XEXP (DECL_RTL (fndecl), 0), 7158 DEFAULT_INIT_PRIORITY); 7159 else 7160 static_dtors = tree_cons (NULL_TREE, fndecl, static_dtors); 7161 } 7162 7163 if (nested_p) 7164 /* Return to the enclosing function. */ 7165 pop_function_context (); 7166 timevar_pop (TV_EXPAND); 7167} 7168 7169/* Check the declarations given in a for-loop for satisfying the C99 7170 constraints. */ 7171void 7172check_for_loop_decls () 7173{ 7174 tree t; 7175 7176 if (!flag_isoc99) 7177 { 7178 /* If we get here, declarations have been used in a for loop without 7179 the C99 for loop scope. This doesn't make much sense, so don't 7180 allow it. */ 7181 error ("`for' loop initial declaration used outside C99 mode"); 7182 return; 7183 } 7184 /* C99 subclause 6.8.5 paragraph 3: 7185 7186 [#3] The declaration part of a for statement shall only 7187 declare identifiers for objects having storage class auto or 7188 register. 7189 7190 It isn't clear whether, in this sentence, "identifiers" binds to 7191 "shall only declare" or to "objects" - that is, whether all identifiers 7192 declared must be identifiers for objects, or whether the restriction 7193 only applies to those that are. (A question on this in comp.std.c 7194 in November 2000 received no answer.) We implement the strictest 7195 interpretation, to avoid creating an extension which later causes 7196 problems. */ 7197 7198 for (t = gettags (); t; t = TREE_CHAIN (t)) 7199 { 7200 if (TREE_PURPOSE (t) != 0) 7201 { 7202 enum tree_code code = TREE_CODE (TREE_VALUE (t)); 7203 7204 if (code == RECORD_TYPE) 7205 error ("`struct %s' declared in `for' loop initial declaration", 7206 IDENTIFIER_POINTER (TREE_PURPOSE (t))); 7207 else if (code == UNION_TYPE) 7208 error ("`union %s' declared in `for' loop initial declaration", 7209 IDENTIFIER_POINTER (TREE_PURPOSE (t))); 7210 else 7211 error ("`enum %s' declared in `for' loop initial declaration", 7212 IDENTIFIER_POINTER (TREE_PURPOSE (t))); 7213 } 7214 } 7215 7216 for (t = getdecls (); t; t = TREE_CHAIN (t)) 7217 { 7218 if (TREE_CODE (t) != VAR_DECL && DECL_NAME (t)) 7219 error_with_decl (t, "declaration of non-variable `%s' in `for' loop initial declaration"); 7220 else if (TREE_STATIC (t)) 7221 error_with_decl (t, "declaration of static variable `%s' in `for' loop initial declaration"); 7222 else if (DECL_EXTERNAL (t)) 7223 error_with_decl (t, "declaration of `extern' variable `%s' in `for' loop initial declaration"); 7224 } 7225} 7226 7227/* Save and restore the variables in this file and elsewhere 7228 that keep track of the progress of compilation of the current function. 7229 Used for nested functions. */ 7230 7231struct c_language_function 7232{ 7233 struct language_function base; 7234 tree named_labels; 7235 tree shadowed_labels; 7236 int returns_value; 7237 int returns_null; 7238 int returns_abnormally; 7239 int warn_about_return_type; 7240 int extern_inline; 7241 struct binding_level *binding_level; 7242}; 7243 7244/* Save and reinitialize the variables 7245 used during compilation of a C function. */ 7246 7247void 7248push_c_function_context (f) 7249 struct function *f; 7250{ 7251 struct c_language_function *p; 7252 p = ((struct c_language_function *) 7253 xmalloc (sizeof (struct c_language_function))); 7254 f->language = (struct language_function *) p; 7255 7256 p->base.x_stmt_tree = c_stmt_tree; 7257 p->base.x_scope_stmt_stack = c_scope_stmt_stack; 7258 p->named_labels = named_labels; 7259 p->shadowed_labels = shadowed_labels; 7260 p->returns_value = current_function_returns_value; 7261 p->returns_null = current_function_returns_null; 7262 p->returns_abnormally = current_function_returns_abnormally; 7263 p->warn_about_return_type = warn_about_return_type; 7264 p->extern_inline = current_extern_inline; 7265 p->binding_level = current_binding_level; 7266} 7267 7268/* Restore the variables used during compilation of a C function. */ 7269 7270void 7271pop_c_function_context (f) 7272 struct function *f; 7273{ 7274 struct c_language_function *p 7275 = (struct c_language_function *) f->language; 7276 tree link; 7277 7278 /* Bring back all the labels that were shadowed. */ 7279 for (link = shadowed_labels; link; link = TREE_CHAIN (link)) 7280 if (DECL_NAME (TREE_VALUE (link)) != 0) 7281 IDENTIFIER_LABEL_VALUE (DECL_NAME (TREE_VALUE (link))) 7282 = TREE_VALUE (link); 7283 7284 if (DECL_SAVED_INSNS (current_function_decl) == 0 7285 && DECL_SAVED_TREE (current_function_decl) == NULL_TREE) 7286 { 7287 /* Stop pointing to the local nodes about to be freed. */ 7288 /* But DECL_INITIAL must remain nonzero so we know this 7289 was an actual function definition. */ 7290 DECL_INITIAL (current_function_decl) = error_mark_node; 7291 DECL_ARGUMENTS (current_function_decl) = 0; 7292 } 7293 7294 c_stmt_tree = p->base.x_stmt_tree; 7295 c_scope_stmt_stack = p->base.x_scope_stmt_stack; 7296 named_labels = p->named_labels; 7297 shadowed_labels = p->shadowed_labels; 7298 current_function_returns_value = p->returns_value; 7299 current_function_returns_null = p->returns_null; 7300 current_function_returns_abnormally = p->returns_abnormally; 7301 warn_about_return_type = p->warn_about_return_type; 7302 current_extern_inline = p->extern_inline; 7303 current_binding_level = p->binding_level; 7304 7305 free (p); 7306 f->language = 0; 7307} 7308 7309/* Mark the language specific parts of F for GC. */ 7310 7311void 7312mark_c_function_context (f) 7313 struct function *f; 7314{ 7315 struct c_language_function *p 7316 = (struct c_language_function *) f->language; 7317 7318 if (p == 0) 7319 return; 7320 7321 mark_c_language_function (&p->base); 7322 ggc_mark_tree (p->shadowed_labels); 7323 ggc_mark_tree (p->named_labels); 7324 mark_binding_level (&p->binding_level); 7325} 7326 7327/* Copy the DECL_LANG_SPECIFIC data associated with NODE. */ 7328 7329void 7330copy_lang_decl (decl) 7331 tree decl; 7332{ 7333 struct lang_decl *ld; 7334 7335 if (!DECL_LANG_SPECIFIC (decl)) 7336 return; 7337 7338 ld = (struct lang_decl *) ggc_alloc (sizeof (struct lang_decl)); 7339 memcpy ((char *) ld, (char *) DECL_LANG_SPECIFIC (decl), 7340 sizeof (struct lang_decl)); 7341 DECL_LANG_SPECIFIC (decl) = ld; 7342} 7343 7344/* Mark the language specific bits in T for GC. */ 7345 7346void 7347lang_mark_tree (t) 7348 tree t; 7349{ 7350 if (TREE_CODE (t) == IDENTIFIER_NODE) 7351 { 7352 struct lang_identifier *i = (struct lang_identifier *) t; 7353 ggc_mark_tree (i->global_value); 7354 ggc_mark_tree (i->local_value); 7355 ggc_mark_tree (i->label_value); 7356 ggc_mark_tree (i->implicit_decl); 7357 ggc_mark_tree (i->error_locus); 7358 ggc_mark_tree (i->limbo_value); 7359 } 7360 else if (TYPE_P (t) && TYPE_LANG_SPECIFIC (t)) 7361 ggc_mark (TYPE_LANG_SPECIFIC (t)); 7362 else if (DECL_P (t) && DECL_LANG_SPECIFIC (t)) 7363 { 7364 ggc_mark (DECL_LANG_SPECIFIC (t)); 7365 c_mark_lang_decl (&DECL_LANG_SPECIFIC (t)->base); 7366 ggc_mark_tree (DECL_LANG_SPECIFIC (t)->pending_sizes); 7367 } 7368} 7369 7370/* The functions below are required for functionality of doing 7371 function at once processing in the C front end. Currently these 7372 functions are not called from anywhere in the C front end, but as 7373 these changes continue, that will change. */ 7374 7375/* Returns non-zero if the current statement is a full expression, 7376 i.e. temporaries created during that statement should be destroyed 7377 at the end of the statement. */ 7378 7379int 7380stmts_are_full_exprs_p () 7381{ 7382 return 0; 7383} 7384 7385/* Returns the stmt_tree (if any) to which statements are currently 7386 being added. If there is no active statement-tree, NULL is 7387 returned. */ 7388 7389stmt_tree 7390current_stmt_tree () 7391{ 7392 return &c_stmt_tree; 7393} 7394 7395/* Returns the stack of SCOPE_STMTs for the current function. */ 7396 7397tree * 7398current_scope_stmt_stack () 7399{ 7400 return &c_scope_stmt_stack; 7401} 7402 7403/* Nonzero if TYPE is an anonymous union or struct type. Always 0 in 7404 C. */ 7405 7406int 7407anon_aggr_type_p (node) 7408 tree node ATTRIBUTE_UNUSED; 7409{ 7410 return 0; 7411} 7412 7413/* Dummy function in place of callback used by C++. */ 7414 7415void 7416extract_interface_info () 7417{ 7418} 7419 7420/* Return a new COMPOUND_STMT, after adding it to the current 7421 statement tree. */ 7422 7423tree 7424c_begin_compound_stmt () 7425{ 7426 tree stmt; 7427 7428 /* Create the COMPOUND_STMT. */ 7429 stmt = add_stmt (build_stmt (COMPOUND_STMT, NULL_TREE)); 7430 7431 return stmt; 7432} 7433 7434/* Expand T (a DECL_STMT) if it declares an entity not handled by the 7435 common code. */ 7436 7437void 7438c_expand_decl_stmt (t) 7439 tree t; 7440{ 7441 tree decl = DECL_STMT_DECL (t); 7442 7443 /* Expand nested functions. */ 7444 if (TREE_CODE (decl) == FUNCTION_DECL 7445 && DECL_CONTEXT (decl) == current_function_decl 7446 && DECL_SAVED_TREE (decl)) 7447 c_expand_body (decl, /*nested_p=*/1, /*can_defer_p=*/0); 7448} 7449 7450/* Return the IDENTIFIER_GLOBAL_VALUE of T, for use in common code, since 7451 the definition of IDENTIFIER_GLOBAL_VALUE is different for C and C++. */ 7452 7453tree 7454identifier_global_value (t) 7455 tree t; 7456{ 7457 return IDENTIFIER_GLOBAL_VALUE (t); 7458} 7459 7460/* Record a builtin type for C. If NAME is non-NULL, it is the name used; 7461 otherwise the name is found in ridpointers from RID_INDEX. */ 7462 7463void 7464record_builtin_type (rid_index, name, type) 7465 enum rid rid_index; 7466 const char *name; 7467 tree type; 7468{ 7469 tree id; 7470 if (name == 0) 7471 id = ridpointers[(int) rid_index]; 7472 else 7473 id = get_identifier (name); 7474 pushdecl (build_decl (TYPE_DECL, id, type)); 7475} 7476 7477/* Build the void_list_node (void_type_node having been created). */ 7478tree 7479build_void_list_node () 7480{ 7481 tree t = build_tree_list (NULL_TREE, void_type_node); 7482 return t; 7483} 7484