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