1 /* Process declarations and variables for C compiler.
2 Copyright (C) 1988, 1992 Free Software Foundation, Inc.
4 This file is part of GNU CC.
6 GNU CC is free software; you can redistribute it and/or modify
7 it under the terms of the GNU General Public License as published by
8 the Free Software Foundation; either version 2, or (at your option)
11 GNU CC is distributed in the hope that it will be useful,
12 but WITHOUT ANY WARRANTY; without even the implied warranty of
13 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 GNU General Public License for more details.
16 You should have received a copy of the GNU General Public License
17 along with GNU CC; see the file COPYING. If not, write to
18 the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */
21 /* Process declarations and symbol lookup for C front end.
22 Also constructs types; the standard scalar types at initialization,
23 and structure, union, array and enum types when they are declared. */
25 /* ??? not all decl nodes are given the most useful possible
26 line numbers. For example, the CONST_DECLs for enum values. */
35 /* In grokdeclarator, distinguish syntactic contexts of declarators. */
37 { NORMAL, /* Ordinary declaration */
38 FUNCDEF, /* Function definition */
39 PARM, /* Declaration of parm before function body */
40 FIELD, /* Declaration inside struct or union */
41 BITFIELD, /* Likewise but with specified width */
42 TYPENAME}; /* Typename (inside cast or sizeof) */
44 #ifndef CHAR_TYPE_SIZE
45 #define CHAR_TYPE_SIZE BITS_PER_UNIT
48 #ifndef SHORT_TYPE_SIZE
49 #define SHORT_TYPE_SIZE (BITS_PER_UNIT * MIN ((UNITS_PER_WORD + 1) / 2, 2))
53 #define INT_TYPE_SIZE BITS_PER_WORD
56 #ifndef LONG_TYPE_SIZE
57 #define LONG_TYPE_SIZE BITS_PER_WORD
60 #ifndef LONG_LONG_TYPE_SIZE
61 #define LONG_LONG_TYPE_SIZE (BITS_PER_WORD * 2)
64 #ifndef WCHAR_UNSIGNED
65 #define WCHAR_UNSIGNED 0
68 #ifndef FLOAT_TYPE_SIZE
69 #define FLOAT_TYPE_SIZE BITS_PER_WORD
72 #ifndef DOUBLE_TYPE_SIZE
73 #define DOUBLE_TYPE_SIZE (BITS_PER_WORD * 2)
76 #ifndef LONG_DOUBLE_TYPE_SIZE
77 #define LONG_DOUBLE_TYPE_SIZE (BITS_PER_WORD * 2)
80 /* We let tm.h override the types used here, to handle trivial differences
81 such as the choice of unsigned int or long unsigned int for size_t.
82 When machines start needing nontrivial differences in the size type,
83 it would be best to do something here to figure out automatically
84 from other information what type to use. */
87 #define SIZE_TYPE "long unsigned int"
91 #define PTRDIFF_TYPE "long int"
95 #define WCHAR_TYPE "int"
98 /* a node which has tree code ERROR_MARK, and whose type is itself.
99 All erroneous expressions are replaced with this node. All functions
100 that accept nodes as arguments should avoid generating error messages
101 if this node is one of the arguments, since it is undesirable to get
102 multiple error messages from one error in the input. */
104 tree error_mark_node;
106 /* INTEGER_TYPE and REAL_TYPE nodes for the standard data types */
108 tree short_integer_type_node;
109 tree integer_type_node;
110 tree long_integer_type_node;
111 tree long_long_integer_type_node;
113 tree short_unsigned_type_node;
114 tree unsigned_type_node;
115 tree long_unsigned_type_node;
116 tree long_long_unsigned_type_node;
118 tree ptrdiff_type_node;
120 tree unsigned_char_type_node;
121 tree signed_char_type_node;
123 tree wchar_type_node;
124 tree signed_wchar_type_node;
125 tree unsigned_wchar_type_node;
127 tree float_type_node;
128 tree double_type_node;
129 tree long_double_type_node;
131 tree complex_integer_type_node;
132 tree complex_float_type_node;
133 tree complex_double_type_node;
134 tree complex_long_double_type_node;
136 tree intQI_type_node;
137 tree intHI_type_node;
138 tree intSI_type_node;
139 tree intDI_type_node;
141 tree unsigned_intQI_type_node;
142 tree unsigned_intHI_type_node;
143 tree unsigned_intSI_type_node;
144 tree unsigned_intDI_type_node;
146 /* a VOID_TYPE node. */
150 /* Nodes for types `void *' and `const void *'. */
152 tree ptr_type_node, const_ptr_type_node;
154 /* Nodes for types `char *' and `const char *'. */
156 tree string_type_node, const_string_type_node;
158 /* Type `char[SOMENUMBER]'.
159 Used when an array of char is needed and the size is irrelevant. */
161 tree char_array_type_node;
163 /* Type `int[SOMENUMBER]' or something like it.
164 Used when an array of int needed and the size is irrelevant. */
166 tree int_array_type_node;
168 /* Type `wchar_t[SOMENUMBER]' or something like it.
169 Used when a wide string literal is created. */
171 tree wchar_array_type_node;
173 /* type `int ()' -- used for implicit declaration of functions. */
175 tree default_function_type;
177 /* function types `double (double)' and `double (double, double)', etc. */
179 tree double_ftype_double, double_ftype_double_double;
180 tree int_ftype_int, long_ftype_long;
182 /* Function type `void (void *, void *, int)' and similar ones */
184 tree void_ftype_ptr_ptr_int, int_ftype_ptr_ptr_int, void_ftype_ptr_int_int;
186 /* Function type `char *(char *, char *)' and similar ones */
187 tree string_ftype_ptr_ptr, int_ftype_string_string;
189 /* Function type `int (const void *, const void *, size_t)' */
190 tree int_ftype_cptr_cptr_sizet;
192 /* Two expressions that are constants with value zero.
193 The first is of type `int', the second of type `void *'. */
195 tree integer_zero_node;
196 tree null_pointer_node;
198 /* A node for the integer constant 1. */
200 tree integer_one_node;
202 /* Nonzero if we have seen an invalid cross reference
203 to a struct, union, or enum, but not yet printed the message. */
205 tree pending_invalid_xref;
206 /* File and line to appear in the eventual error message. */
207 char *pending_invalid_xref_file;
208 int pending_invalid_xref_line;
210 /* While defining an enum type, this is 1 plus the last enumerator
213 static tree enum_next_value;
215 /* Nonzero means that there was overflow computing enum_next_value. */
217 static int enum_overflow;
219 /* Parsing a function declarator leaves a list of parameter names
220 or a chain or parameter decls here. */
222 static tree last_function_parms;
224 /* Parsing a function declarator leaves here a chain of structure
225 and enum types declared in the parmlist. */
227 static tree last_function_parm_tags;
229 /* After parsing the declarator that starts a function definition,
230 `start_function' puts here the list of parameter names or chain of decls.
231 `store_parm_decls' finds it here. */
233 static tree current_function_parms;
235 /* Similar, for last_function_parm_tags. */
236 static tree current_function_parm_tags;
238 /* Similar, for the file and line that the prototype came from if this is
239 an old-style definition. */
240 static char *current_function_prototype_file;
241 static int current_function_prototype_line;
243 /* A list (chain of TREE_LIST nodes) of all LABEL_DECLs in the function
244 that have names. Here so we can clear out their names' definitions
245 at the end of the function. */
247 static tree named_labels;
249 /* A list of LABEL_DECLs from outer contexts that are currently shadowed. */
251 static tree shadowed_labels;
253 /* Nonzero when store_parm_decls is called indicates a varargs function.
254 Value not meaningful after store_parm_decls. */
256 static int c_function_varargs;
258 /* The FUNCTION_DECL for the function currently being compiled,
259 or 0 if between functions. */
260 tree current_function_decl;
262 /* Set to 0 at beginning of a function definition, set to 1 if
263 a return statement that specifies a return value is seen. */
265 int current_function_returns_value;
267 /* Set to 0 at beginning of a function definition, set to 1 if
268 a return statement with no argument is seen. */
270 int current_function_returns_null;
272 /* Set to nonzero by `grokdeclarator' for a function
273 whose return type is defaulted, if warnings for this are desired. */
275 static int warn_about_return_type;
277 /* Nonzero when starting a function declared `extern inline'. */
279 static int current_extern_inline;
281 /* For each binding contour we allocate a binding_level structure
282 * which records the names defined in that contour.
285 * 1) one for each function definition,
286 * where internal declarations of the parameters appear.
287 * 2) one for each compound statement,
288 * to record its declarations.
290 * The current meaning of a name can be found by searching the levels from
291 * the current one out to the global one.
294 /* Note that the information in the `names' component of the global contour
295 is duplicated in the IDENTIFIER_GLOBAL_VALUEs of all identifiers. */
299 /* A chain of _DECL nodes for all variables, constants, functions,
300 and typedef types. These are in the reverse of the order supplied.
304 /* A list of structure, union and enum definitions,
305 * for looking up tag names.
306 * It is a chain of TREE_LIST nodes, each of whose TREE_PURPOSE is a name,
307 * or NULL_TREE; and whose TREE_VALUE is a RECORD_TYPE, UNION_TYPE,
308 * or ENUMERAL_TYPE node.
312 /* For each level, a list of shadowed outer-level local definitions
313 to be restored when this level is popped.
314 Each link is a TREE_LIST whose TREE_PURPOSE is an identifier and
315 whose TREE_VALUE is its old definition (a kind of ..._DECL node). */
318 /* For each level (except not the global one),
319 a chain of BLOCK nodes for all the levels
320 that were entered and exited one level down. */
323 /* The BLOCK node for this level, if one has been preallocated.
324 If 0, the BLOCK is allocated (if needed) when the level is popped. */
327 /* The binding level which this one is contained in (inherits from). */
328 struct binding_level *level_chain;
330 /* Nonzero for the level that holds the parameters of a function. */
333 /* Nonzero if this level "doesn't exist" for tags. */
334 char tag_transparent;
336 /* Nonzero if sublevels of this level "don't exist" for tags.
337 This is set in the parm level of a function definition
338 while reading the function body, so that the outermost block
339 of the function body will be tag-transparent. */
340 char subblocks_tag_transparent;
342 /* Nonzero means make a BLOCK for this level regardless of all else. */
345 /* Nonzero means make a BLOCK if this level has any subblocks. */
346 char keep_if_subblocks;
348 /* Number of decls in `names' that have incomplete
349 structure or union types. */
352 /* A list of decls giving the (reversed) specified order of parms,
353 not including any forward-decls in the parmlist.
354 This is so we can put the parms in proper order for assign_parms. */
358 #define NULL_BINDING_LEVEL (struct binding_level *) NULL
360 /* The binding level currently in effect. */
362 static struct binding_level *current_binding_level;
364 /* A chain of binding_level structures awaiting reuse. */
366 static struct binding_level *free_binding_level;
368 /* The outermost binding level, for names of file scope.
369 This is created when the compiler is started and exists
370 through the entire run. */
372 static struct binding_level *global_binding_level;
374 /* Binding level structures are initialized by copying this one. */
376 static struct binding_level clear_binding_level
377 = {NULL, NULL, NULL, NULL, NULL, NULL, 0, 0, 0};
379 /* Nonzero means unconditionally make a BLOCK for the next level pushed. */
381 static int keep_next_level_flag;
383 /* Nonzero means make a BLOCK for the next level pushed
384 if it has subblocks. */
386 static int keep_next_if_subblocks;
388 /* The chain of outer levels of label scopes.
389 This uses the same data structure used for binding levels,
390 but it works differently: each link in the chain records
391 saved values of named_labels and shadowed_labels for
392 a label binding level outside the current one. */
394 static struct binding_level *label_level_chain;
396 /* Forward declarations. */
398 static tree grokparms (), grokdeclarator ();
400 tree builtin_function ();
401 void shadow_tag_warned ();
403 static tree lookup_tag ();
404 static tree lookup_tag_reverse ();
405 static tree lookup_name_current_level ();
406 static char *redeclaration_error_message ();
407 static void layout_array_type ();
409 /* C-specific option variables. */
411 /* Nonzero means allow type mismatches in conditional expressions;
412 just make their values `void'. */
414 int flag_cond_mismatch;
416 /* Nonzero means give `double' the same size as `float'. */
418 int flag_short_double;
420 /* Nonzero means don't recognize the keyword `asm'. */
424 /* Nonzero means don't recognize any builtin functions. */
428 /* Nonzero means don't recognize the non-ANSI builtin functions.
431 int flag_no_nonansi_builtin;
433 /* Nonzero means do some things the same way PCC does. */
435 int flag_traditional;
437 /* Nonzero means to treat bitfields as signed unless they say `unsigned'. */
439 int flag_signed_bitfields = 1;
440 int explicit_flag_signed_bitfields = 0;
442 /* Nonzero means handle `#ident' directives. 0 means ignore them. */
444 int flag_no_ident = 0;
446 /* Nonzero means warn about implicit declarations. */
450 /* Nonzero means give string constants the type `const char *'
451 to get extra warnings from them. These warnings will be too numerous
452 to be useful, except in thoroughly ANSIfied programs. */
454 int warn_write_strings;
456 /* Nonzero means warn about pointer casts that can drop a type qualifier
457 from the pointer target type. */
461 /* Warn about traditional constructs whose meanings changed in ANSI C. */
463 int warn_traditional;
465 /* Nonzero means warn about sizeof(function) or addition/subtraction
466 of function pointers. */
468 int warn_pointer_arith;
470 /* Nonzero means warn for non-prototype function decls
471 or non-prototyped defs without previous prototype. */
473 int warn_strict_prototypes;
475 /* Nonzero means warn for any global function def
476 without separate previous prototype decl. */
478 int warn_missing_prototypes;
480 /* Nonzero means warn about multiple (redundant) decls for the same single
481 variable or function. */
483 int warn_redundant_decls = 0;
485 /* Nonzero means warn about extern declarations of objects not at
486 file-scope level and about *all* declarations of functions (whether
487 extern or static) not at file-scope level. Note that we exclude
488 implicit function declarations. To get warnings about those, use
491 int warn_nested_externs = 0;
493 /* Warn about *printf or *scanf format/argument anomalies. */
497 /* Warn about a subscript that has type char. */
499 int warn_char_subscripts = 0;
501 /* Warn if a type conversion is done that might have confusing results. */
505 /* Warn if adding () is suggested. */
507 int warn_parentheses;
509 /* Warn if initializer is not completely bracketed. */
511 int warn_missing_braces;
513 /* Nonzero means `$' can be in an identifier.
514 See cccp.c for reasons why this breaks some obscure ANSI C programs. */
516 #ifndef DOLLARS_IN_IDENTIFIERS
517 #define DOLLARS_IN_IDENTIFIERS 1
519 int dollars_in_ident = DOLLARS_IN_IDENTIFIERS > 1;
521 /* Decode the string P as a language-specific option for C.
522 Return 1 if it is recognized (and handle it);
523 return 0 if not recognized. */
529 if (!strcmp (p, "-ftraditional") || !strcmp (p, "-traditional"))
531 flag_traditional = 1;
532 flag_writable_strings = 1;
533 #if DOLLARS_IN_IDENTIFIERS > 0
534 dollars_in_ident = 1;
537 else if (!strcmp (p, "-fnotraditional") || !strcmp (p, "-fno-traditional"))
539 flag_traditional = 0;
540 flag_writable_strings = 0;
541 dollars_in_ident = DOLLARS_IN_IDENTIFIERS > 1;
543 else if (!strcmp (p, "-fsigned-char"))
544 flag_signed_char = 1;
545 else if (!strcmp (p, "-funsigned-char"))
546 flag_signed_char = 0;
547 else if (!strcmp (p, "-fno-signed-char"))
548 flag_signed_char = 0;
549 else if (!strcmp (p, "-fno-unsigned-char"))
550 flag_signed_char = 1;
551 else if (!strcmp (p, "-fsigned-bitfields")
552 || !strcmp (p, "-fno-unsigned-bitfields"))
554 flag_signed_bitfields = 1;
555 explicit_flag_signed_bitfields = 1;
557 else if (!strcmp (p, "-funsigned-bitfields")
558 || !strcmp (p, "-fno-signed-bitfields"))
560 flag_signed_bitfields = 0;
561 explicit_flag_signed_bitfields = 1;
563 else if (!strcmp (p, "-fshort-enums"))
564 flag_short_enums = 1;
565 else if (!strcmp (p, "-fno-short-enums"))
566 flag_short_enums = 0;
567 else if (!strcmp (p, "-fcond-mismatch"))
568 flag_cond_mismatch = 1;
569 else if (!strcmp (p, "-fno-cond-mismatch"))
570 flag_cond_mismatch = 0;
571 else if (!strcmp (p, "-fshort-double"))
572 flag_short_double = 1;
573 else if (!strcmp (p, "-fno-short-double"))
574 flag_short_double = 0;
575 else if (!strcmp (p, "-fasm"))
577 else if (!strcmp (p, "-fno-asm"))
579 else if (!strcmp (p, "-fbuiltin"))
581 else if (!strcmp (p, "-fno-builtin"))
583 else if (!strcmp (p, "-fno-ident"))
585 else if (!strcmp (p, "-fident"))
587 else if (!strcmp (p, "-ansi"))
588 flag_no_asm = 1, flag_no_nonansi_builtin = 1, dollars_in_ident = 0;
589 else if (!strcmp (p, "-Wimplicit"))
591 else if (!strcmp (p, "-Wno-implicit"))
593 else if (!strcmp (p, "-Wwrite-strings"))
594 warn_write_strings = 1;
595 else if (!strcmp (p, "-Wno-write-strings"))
596 warn_write_strings = 0;
597 else if (!strcmp (p, "-Wcast-qual"))
599 else if (!strcmp (p, "-Wno-cast-qual"))
601 else if (!strcmp (p, "-Wpointer-arith"))
602 warn_pointer_arith = 1;
603 else if (!strcmp (p, "-Wno-pointer-arith"))
604 warn_pointer_arith = 0;
605 else if (!strcmp (p, "-Wstrict-prototypes"))
606 warn_strict_prototypes = 1;
607 else if (!strcmp (p, "-Wno-strict-prototypes"))
608 warn_strict_prototypes = 0;
609 else if (!strcmp (p, "-Wmissing-prototypes"))
610 warn_missing_prototypes = 1;
611 else if (!strcmp (p, "-Wno-missing-prototypes"))
612 warn_missing_prototypes = 0;
613 else if (!strcmp (p, "-Wredundant-decls"))
614 warn_redundant_decls = 1;
615 else if (!strcmp (p, "-Wno-redundant-decls"))
616 warn_redundant_decls = 0;
617 else if (!strcmp (p, "-Wnested-externs"))
618 warn_nested_externs = 1;
619 else if (!strcmp (p, "-Wno-nested-externs"))
620 warn_nested_externs = 0;
621 else if (!strcmp (p, "-Wtraditional"))
622 warn_traditional = 1;
623 else if (!strcmp (p, "-Wno-traditional"))
624 warn_traditional = 0;
625 else if (!strcmp (p, "-Wformat"))
627 else if (!strcmp (p, "-Wno-format"))
629 else if (!strcmp (p, "-Wchar-subscripts"))
630 warn_char_subscripts = 1;
631 else if (!strcmp (p, "-Wno-char-subscripts"))
632 warn_char_subscripts = 0;
633 else if (!strcmp (p, "-Wconversion"))
635 else if (!strcmp (p, "-Wno-conversion"))
637 else if (!strcmp (p, "-Wparentheses"))
638 warn_parentheses = 1;
639 else if (!strcmp (p, "-Wno-parentheses"))
640 warn_parentheses = 0;
641 else if (!strcmp (p, "-Wreturn-type"))
642 warn_return_type = 1;
643 else if (!strcmp (p, "-Wno-return-type"))
644 warn_return_type = 0;
645 else if (!strcmp (p, "-Wcomment"))
646 ; /* cpp handles this one. */
647 else if (!strcmp (p, "-Wno-comment"))
648 ; /* cpp handles this one. */
649 else if (!strcmp (p, "-Wcomments"))
650 ; /* cpp handles this one. */
651 else if (!strcmp (p, "-Wno-comments"))
652 ; /* cpp handles this one. */
653 else if (!strcmp (p, "-Wtrigraphs"))
654 ; /* cpp handles this one. */
655 else if (!strcmp (p, "-Wno-trigraphs"))
656 ; /* cpp handles this one. */
657 else if (!strcmp (p, "-Wimport"))
658 ; /* cpp handles this one. */
659 else if (!strcmp (p, "-Wno-import"))
660 ; /* cpp handles this one. */
661 else if (!strcmp (p, "-Wmissing-braces"))
662 warn_missing_braces = 1;
663 else if (!strcmp (p, "-Wno-missing-braces"))
664 warn_missing_braces = 0;
665 else if (!strcmp (p, "-Wall"))
668 /* We save the value of warn_uninitialized, since if they put
669 -Wuninitialized on the command line, we need to generate a
670 warning about not using it without also specifying -O. */
671 if (warn_uninitialized != 1)
672 warn_uninitialized = 2;
674 warn_return_type = 1;
678 warn_char_subscripts = 1;
679 warn_parentheses = 1;
680 warn_missing_braces = 1;
688 /* Hooks for print_node. */
701 print_lang_identifier (file, node, indent)
706 print_node (file, "global", IDENTIFIER_GLOBAL_VALUE (node), indent + 4);
707 print_node (file, "local", IDENTIFIER_LOCAL_VALUE (node), indent + 4);
708 print_node (file, "label", IDENTIFIER_LABEL_VALUE (node), indent + 4);
709 print_node (file, "implicit", IDENTIFIER_IMPLICIT_DECL (node), indent + 4);
710 print_node (file, "error locus", IDENTIFIER_ERROR_LOCUS (node), indent + 4);
711 print_node (file, "limbo value", IDENTIFIER_LIMBO_VALUE (node), indent + 4);
714 /* Create a new `struct binding_level'. */
717 struct binding_level *
718 make_binding_level ()
721 return (struct binding_level *) xmalloc (sizeof (struct binding_level));
724 /* Nonzero if we are currently in the global binding level. */
729 return current_binding_level == global_binding_level;
735 keep_next_level_flag = 1;
738 /* Nonzero if the current level needs to have a BLOCK made. */
743 return ((current_binding_level->keep_if_subblocks
744 && current_binding_level->blocks != 0)
745 || current_binding_level->keep
746 || current_binding_level->names != 0
747 || (current_binding_level->tags != 0
748 && !current_binding_level->tag_transparent));
751 /* Identify this binding level as a level of parameters.
752 DEFINITION_FLAG is 1 for a definition, 0 for a declaration.
753 But it turns out there is no way to pass the right value for
754 DEFINITION_FLAG, so we ignore it. */
757 declare_parm_level (definition_flag)
760 current_binding_level->parm_flag = 1;
763 /* Nonzero if currently making parm declarations. */
768 return current_binding_level->parm_flag;
771 /* Enter a new binding level.
772 If TAG_TRANSPARENT is nonzero, do so only for the name space of variables,
773 not for that of tags. */
776 pushlevel (tag_transparent)
779 register struct binding_level *newlevel = NULL_BINDING_LEVEL;
781 /* If this is the top level of a function,
782 just make sure that NAMED_LABELS is 0. */
784 if (current_binding_level == global_binding_level)
789 /* Reuse or create a struct for this binding level. */
791 if (free_binding_level)
793 newlevel = free_binding_level;
794 free_binding_level = free_binding_level->level_chain;
798 newlevel = make_binding_level ();
801 /* Add this level to the front of the chain (stack) of levels that
804 *newlevel = clear_binding_level;
805 newlevel->tag_transparent
807 || (current_binding_level
808 ? current_binding_level->subblocks_tag_transparent
810 newlevel->level_chain = current_binding_level;
811 current_binding_level = newlevel;
812 newlevel->keep = keep_next_level_flag;
813 keep_next_level_flag = 0;
814 newlevel->keep_if_subblocks = keep_next_if_subblocks;
815 keep_next_if_subblocks = 0;
818 /* Exit a binding level.
819 Pop the level off, and restore the state of the identifier-decl mappings
820 that were in effect when this level was entered.
822 If KEEP is nonzero, this level had explicit declarations, so
823 and create a "block" (a BLOCK node) for the level
824 to record its declarations and subblocks for symbol table output.
826 If FUNCTIONBODY is nonzero, this level is the body of a function,
827 so create a block as if KEEP were set and also clear out all
830 If REVERSE is nonzero, reverse the order of decls before putting
831 them into the BLOCK. */
834 poplevel (keep, reverse, functionbody)
840 /* The chain of decls was accumulated in reverse order.
841 Put it into forward order, just for cleanliness. */
843 tree tags = current_binding_level->tags;
844 tree subblocks = current_binding_level->blocks;
847 int block_previously_created;
849 keep |= current_binding_level->keep;
851 /* This warning is turned off because it causes warnings for
852 declarations like `extern struct foo *x'. */
854 /* Warn about incomplete structure types in this level. */
855 for (link = tags; link; link = TREE_CHAIN (link))
856 if (TYPE_SIZE (TREE_VALUE (link)) == 0)
858 tree type = TREE_VALUE (link);
860 switch (TREE_CODE (type))
863 errmsg = "`struct %s' incomplete in scope ending here";
866 errmsg = "`union %s' incomplete in scope ending here";
869 errmsg = "`enum %s' incomplete in scope ending here";
872 if (TREE_CODE (TYPE_NAME (type)) == IDENTIFIER_NODE)
873 error (errmsg, IDENTIFIER_POINTER (TYPE_NAME (type)));
875 /* If this type has a typedef-name, the TYPE_NAME is a TYPE_DECL. */
876 error (errmsg, IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (type))));
880 /* Get the decls in the order they were written.
881 Usually current_binding_level->names is in reverse order.
882 But parameter decls were previously put in forward order. */
885 current_binding_level->names
886 = decls = nreverse (current_binding_level->names);
888 decls = current_binding_level->names;
890 /* Output any nested inline functions within this block
891 if they weren't already output. */
893 for (decl = decls; decl; decl = TREE_CHAIN (decl))
894 if (TREE_CODE (decl) == FUNCTION_DECL
895 && ! TREE_ASM_WRITTEN (decl)
896 && DECL_INITIAL (decl) != 0
897 && TREE_ADDRESSABLE (decl))
899 /* If this decl was copied from a file-scope decl
900 on account of a block-scope extern decl,
901 propagate TREE_ADDRESSABLE to the file-scope decl. */
902 if (DECL_ABSTRACT_ORIGIN (decl) != 0)
903 TREE_ADDRESSABLE (DECL_ABSTRACT_ORIGIN (decl)) = 1;
905 output_inline_function (decl);
908 /* If there were any declarations or structure tags in that level,
909 or if this level is a function body,
910 create a BLOCK to record them for the life of this function. */
913 block_previously_created = (current_binding_level->this_block != 0);
914 if (block_previously_created)
915 block = current_binding_level->this_block;
916 else if (keep || functionbody
917 || (current_binding_level->keep_if_subblocks && subblocks != 0))
918 block = make_node (BLOCK);
921 BLOCK_VARS (block) = decls;
922 BLOCK_TYPE_TAGS (block) = tags;
923 BLOCK_SUBBLOCKS (block) = subblocks;
924 remember_end_note (block);
927 /* In each subblock, record that this is its superior. */
929 for (link = subblocks; link; link = TREE_CHAIN (link))
930 BLOCK_SUPERCONTEXT (link) = block;
932 /* Clear out the meanings of the local variables of this level. */
934 for (link = decls; link; link = TREE_CHAIN (link))
936 if (DECL_NAME (link) != 0)
938 /* If the ident. was used or addressed via a local extern decl,
939 don't forget that fact. */
940 if (DECL_EXTERNAL (link))
942 if (TREE_USED (link))
943 TREE_USED (DECL_NAME (link)) = 1;
944 if (TREE_ADDRESSABLE (link))
945 TREE_ADDRESSABLE (DECL_ASSEMBLER_NAME (link)) = 1;
947 IDENTIFIER_LOCAL_VALUE (DECL_NAME (link)) = 0;
951 /* Restore all name-meanings of the outer levels
952 that were shadowed by this level. */
954 for (link = current_binding_level->shadowed; link; link = TREE_CHAIN (link))
955 IDENTIFIER_LOCAL_VALUE (TREE_PURPOSE (link)) = TREE_VALUE (link);
957 /* If the level being exited is the top level of a function,
958 check over all the labels, and clear out the current
959 (function local) meanings of their names. */
963 /* If this is the top level block of a function,
964 the vars are the function's parameters.
965 Don't leave them in the BLOCK because they are
966 found in the FUNCTION_DECL instead. */
968 BLOCK_VARS (block) = 0;
970 /* Clear out the definitions of all label names,
971 since their scopes end here,
972 and add them to BLOCK_VARS. */
974 for (link = named_labels; link; link = TREE_CHAIN (link))
976 register tree label = TREE_VALUE (link);
978 if (DECL_INITIAL (label) == 0)
980 error_with_decl (label, "label `%s' used but not defined");
981 /* Avoid crashing later. */
982 define_label (input_filename, lineno,
985 else if (warn_unused && !TREE_USED (label))
986 warning_with_decl (label, "label `%s' defined but not used");
987 IDENTIFIER_LABEL_VALUE (DECL_NAME (label)) = 0;
989 /* Put the labels into the "variables" of the
990 top-level block, so debugger can see them. */
991 TREE_CHAIN (label) = BLOCK_VARS (block);
992 BLOCK_VARS (block) = label;
996 /* Pop the current level, and free the structure for reuse. */
999 register struct binding_level *level = current_binding_level;
1000 current_binding_level = current_binding_level->level_chain;
1002 level->level_chain = free_binding_level;
1003 free_binding_level = level;
1006 /* Dispose of the block that we just made inside some higher level. */
1008 DECL_INITIAL (current_function_decl) = block;
1011 if (!block_previously_created)
1012 current_binding_level->blocks
1013 = chainon (current_binding_level->blocks, block);
1015 /* If we did not make a block for the level just exited,
1016 any blocks made for inner levels
1017 (since they cannot be recorded as subblocks in that level)
1018 must be carried forward so they will later become subblocks
1019 of something else. */
1021 current_binding_level->blocks
1022 = chainon (current_binding_level->blocks, subblocks);
1024 /* Set the TYPE_CONTEXTs for all of the tagged types belonging to this
1025 binding contour so that they point to the appropriate construct, i.e.
1026 either to the current FUNCTION_DECL node, or else to the BLOCK node
1027 we just constructed.
1029 Note that for tagged types whose scope is just the formal parameter
1030 list for some function type specification, we can't properly set
1031 their TYPE_CONTEXTs here, because we don't have a pointer to the
1032 appropriate FUNCTION_TYPE node readily available to us. For those
1033 cases, the TYPE_CONTEXTs of the relevant tagged type nodes get set
1034 in `grokdeclarator' as soon as we have created the FUNCTION_TYPE
1035 node which will represent the "scope" for these "parameter list local"
1040 for (link = tags; link; link = TREE_CHAIN (link))
1041 TYPE_CONTEXT (TREE_VALUE (link)) = current_function_decl;
1043 for (link = tags; link; link = TREE_CHAIN (link))
1044 TYPE_CONTEXT (TREE_VALUE (link)) = block;
1047 TREE_USED (block) = 1;
1051 /* Delete the node BLOCK from the current binding level.
1052 This is used for the block inside a stmt expr ({...})
1053 so that the block can be reinserted where appropriate. */
1056 delete_block (block)
1060 if (current_binding_level->blocks == block)
1061 current_binding_level->blocks = TREE_CHAIN (block);
1062 for (t = current_binding_level->blocks; t;)
1064 if (TREE_CHAIN (t) == block)
1065 TREE_CHAIN (t) = TREE_CHAIN (block);
1069 TREE_CHAIN (block) = NULL;
1070 /* Clear TREE_USED which is always set by poplevel.
1071 The flag is set again if insert_block is called. */
1072 TREE_USED (block) = 0;
1075 /* Insert BLOCK at the end of the list of subblocks of the
1076 current binding level. This is used when a BIND_EXPR is expanded,
1077 to handle the BLOCK node inside teh BIND_EXPR. */
1080 insert_block (block)
1083 TREE_USED (block) = 1;
1084 current_binding_level->blocks
1085 = chainon (current_binding_level->blocks, block);
1088 /* Set the BLOCK node for the innermost scope
1089 (the one we are currently in). */
1093 register tree block;
1095 current_binding_level->this_block = block;
1101 register struct binding_level *newlevel;
1103 /* Reuse or create a struct for this binding level. */
1105 if (free_binding_level)
1107 newlevel = free_binding_level;
1108 free_binding_level = free_binding_level->level_chain;
1112 newlevel = make_binding_level ();
1115 /* Add this level to the front of the chain (stack) of label levels. */
1117 newlevel->level_chain = label_level_chain;
1118 label_level_chain = newlevel;
1120 newlevel->names = named_labels;
1121 newlevel->shadowed = shadowed_labels;
1123 shadowed_labels = 0;
1129 register struct binding_level *level = label_level_chain;
1132 /* Clear out the definitions of the declared labels in this level.
1133 Leave in the list any ordinary, non-declared labels. */
1134 for (link = named_labels, prev = 0; link;)
1136 if (C_DECLARED_LABEL_FLAG (TREE_VALUE (link)))
1138 if (DECL_SOURCE_LINE (TREE_VALUE (link)) == 0)
1140 error_with_decl ("label `%s' used but not defined",
1142 /* Avoid crashing later. */
1143 define_label (input_filename, lineno,
1144 DECL_NAME (TREE_VALUE (link)));
1146 else if (warn_unused && !TREE_USED (TREE_VALUE (link)))
1147 warning_with_decl (TREE_VALUE (link),
1148 "label `%s' defined but not used");
1149 IDENTIFIER_LABEL_VALUE (DECL_NAME (TREE_VALUE (link))) = 0;
1151 /* Delete this element from the list. */
1152 link = TREE_CHAIN (link);
1154 TREE_CHAIN (prev) = link;
1156 named_labels = link;
1161 link = TREE_CHAIN (link);
1165 /* Bring back all the labels that were shadowed. */
1166 for (link = shadowed_labels; link; link = TREE_CHAIN (link))
1167 if (DECL_NAME (TREE_VALUE (link)) != 0)
1168 IDENTIFIER_LABEL_VALUE (DECL_NAME (TREE_VALUE (link)))
1169 = TREE_VALUE (link);
1171 named_labels = chainon (named_labels, level->names);
1172 shadowed_labels = level->shadowed;
1174 /* Pop the current level, and free the structure for reuse. */
1175 label_level_chain = label_level_chain->level_chain;
1176 level->level_chain = free_binding_level;
1177 free_binding_level = level;
1180 /* Push a definition or a declaration of struct, union or enum tag "name".
1181 "type" should be the type node.
1182 We assume that the tag "name" is not already defined.
1184 Note that the definition may really be just a forward reference.
1185 In that case, the TYPE_SIZE will be zero. */
1188 pushtag (name, type)
1191 register struct binding_level *b;
1193 /* Find the proper binding level for this type tag. */
1195 for (b = current_binding_level; b->tag_transparent; b = b->level_chain)
1200 /* Record the identifier as the type's name if it has none. */
1202 if (TYPE_NAME (type) == 0)
1203 TYPE_NAME (type) = name;
1206 if (b == global_binding_level)
1207 b->tags = perm_tree_cons (name, type, b->tags);
1209 b->tags = saveable_tree_cons (name, type, b->tags);
1211 /* Create a fake NULL-named TYPE_DECL node whose TREE_TYPE will be the
1212 tagged type we just added to the current binding level. This fake
1213 NULL-named TYPE_DECL node helps dwarfout.c to know when it needs
1214 to output a representation of a tagged type, and it also gives
1215 us a convenient place to record the "scope start" address for the
1218 TYPE_STUB_DECL (type) = pushdecl (build_decl (TYPE_DECL, NULL_TREE, type));
1221 /* Handle when a new declaration NEWDECL
1222 has the same name as an old one OLDDECL
1223 in the same binding contour.
1224 Prints an error message if appropriate.
1226 If safely possible, alter OLDDECL to look like NEWDECL, and return 1.
1227 Otherwise, return 0. */
1230 duplicate_decls (newdecl, olddecl)
1231 register tree newdecl, olddecl;
1233 int types_match = comptypes (TREE_TYPE (newdecl), TREE_TYPE (olddecl));
1234 int new_is_definition = (TREE_CODE (newdecl) == FUNCTION_DECL
1235 && DECL_INITIAL (newdecl) != 0);
1236 tree oldtype = TREE_TYPE (olddecl);
1237 tree newtype = TREE_TYPE (newdecl);
1239 if (TREE_CODE (newtype) == ERROR_MARK
1240 || TREE_CODE (oldtype) == ERROR_MARK)
1243 /* New decl is completely inconsistent with the old one =>
1244 tell caller to replace the old one.
1245 This is always an error except in the case of shadowing a builtin. */
1246 if (TREE_CODE (olddecl) != TREE_CODE (newdecl))
1248 if (TREE_CODE (olddecl) == FUNCTION_DECL
1249 && DECL_BUILT_IN (olddecl))
1251 /* If you declare a built-in function name as static, the
1252 built-in definition is overridden,
1253 but optionally warn this was a bad choice of name. */
1254 if (!TREE_PUBLIC (newdecl))
1257 warning_with_decl (newdecl, "shadowing built-in function `%s'");
1259 /* Likewise, if the built-in is not ansi, then programs can
1260 override it even globally without an error. */
1261 else if (DECL_BUILT_IN_NONANSI (olddecl))
1262 warning_with_decl (newdecl,
1263 "built-in function `%s' declared as non-function");
1265 error_with_decl (newdecl,
1266 "built-in function `%s' declared as non-function");
1268 else if (TREE_CODE (olddecl) == FUNCTION_DECL
1269 && DECL_BUILT_IN_NONANSI (olddecl))
1271 /* If overriding decl is static,
1272 optionally warn this was a bad choice of name. */
1273 if (!TREE_PUBLIC (newdecl))
1276 warning_with_decl (newdecl, "shadowing library function `%s'");
1278 /* Otherwise, always warn. */
1280 warning_with_decl (newdecl,
1281 "library function `%s' declared as non-function");
1285 error_with_decl (newdecl, "`%s' redeclared as different kind of symbol");
1286 error_with_decl (olddecl, "previous declaration of `%s'");
1292 /* For real parm decl following a forward decl,
1293 return 1 so old decl will be reused. */
1294 if (types_match && TREE_CODE (newdecl) == PARM_DECL
1295 && TREE_ASM_WRITTEN (olddecl) && ! TREE_ASM_WRITTEN (newdecl))
1298 /* The new declaration is the same kind of object as the old one.
1299 The declarations may partially match. Print warnings if they don't
1300 match enough. Ultimately, copy most of the information from the new
1301 decl to the old one, and keep using the old one. */
1303 if (flag_traditional && TREE_CODE (newdecl) == FUNCTION_DECL
1304 && IDENTIFIER_IMPLICIT_DECL (DECL_NAME (newdecl)) == olddecl
1305 && DECL_INITIAL (olddecl) == 0)
1306 /* If -traditional, avoid error for redeclaring fcn
1307 after implicit decl. */
1309 else if (TREE_CODE (olddecl) == FUNCTION_DECL
1310 && DECL_BUILT_IN (olddecl))
1312 /* A function declaration for a built-in function. */
1313 if (!TREE_PUBLIC (newdecl))
1315 /* If you declare a built-in function name as static, the
1316 built-in definition is overridden,
1317 but optionally warn this was a bad choice of name. */
1319 warning_with_decl (newdecl, "shadowing built-in function `%s'");
1320 /* Discard the old built-in function. */
1323 else if (!types_match)
1325 /* Accept the return type of the new declaration if same modes. */
1326 tree oldreturntype = TREE_TYPE (TREE_TYPE (olddecl));
1327 tree newreturntype = TREE_TYPE (TREE_TYPE (newdecl));
1328 if (TYPE_MODE (oldreturntype) == TYPE_MODE (newreturntype))
1330 /* Function types may be shared, so we can't just modify
1331 the return type of olddecl's function type. */
1333 = build_function_type (newreturntype,
1334 TYPE_ARG_TYPES (TREE_TYPE (olddecl)));
1336 types_match = comptypes (TREE_TYPE (newdecl), newtype);
1338 TREE_TYPE (olddecl) = newtype;
1340 /* Accept harmless mismatch in first argument type also.
1342 if (TYPE_ARG_TYPES (TREE_TYPE (newdecl)) != 0
1343 && TYPE_ARG_TYPES (TREE_TYPE (olddecl)) != 0
1344 && TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (newdecl))) != 0
1345 && TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (olddecl))) != 0
1346 && (TYPE_MODE (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (newdecl))))
1348 TYPE_MODE (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (olddecl))))))
1350 /* Function types may be shared, so we can't just modify
1351 the return type of olddecl's function type. */
1353 = build_function_type (TREE_TYPE (TREE_TYPE (olddecl)),
1354 tree_cons (NULL_TREE,
1355 TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (newdecl))),
1356 TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (olddecl)))));
1358 types_match = comptypes (TREE_TYPE (newdecl), newtype);
1360 TREE_TYPE (olddecl) = newtype;
1365 /* If types don't match for a built-in, throw away the built-in. */
1366 warning_with_decl (newdecl, "conflicting types for built-in function `%s'");
1370 else if (TREE_CODE (olddecl) == FUNCTION_DECL
1371 && DECL_SOURCE_LINE (olddecl) == 0)
1373 /* A function declaration for a predeclared function
1374 that isn't actually built in. */
1375 if (!TREE_PUBLIC (newdecl))
1377 /* If you declare it as static, the
1378 default definition is overridden. */
1381 else if (!types_match)
1383 /* If the types don't match, preserve volatility indication.
1384 Later on, we will discard everything else about the
1385 default declaration. */
1386 TREE_THIS_VOLATILE (newdecl) |= TREE_THIS_VOLATILE (olddecl);
1389 /* Permit char *foo () to match void *foo (...) if not pedantic,
1390 if one of them came from a system header file. */
1391 else if (!types_match
1392 && TREE_CODE (olddecl) == FUNCTION_DECL
1393 && TREE_CODE (newdecl) == FUNCTION_DECL
1394 && TREE_CODE (TREE_TYPE (oldtype)) == POINTER_TYPE
1395 && TREE_CODE (TREE_TYPE (newtype)) == POINTER_TYPE
1396 && (DECL_IN_SYSTEM_HEADER (olddecl)
1397 || DECL_IN_SYSTEM_HEADER (newdecl))
1398 && ((TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (newtype))) == void_type_node
1399 && TYPE_ARG_TYPES (oldtype) == 0
1400 && self_promoting_args_p (TYPE_ARG_TYPES (newtype))
1401 && TREE_TYPE (TREE_TYPE (oldtype)) == char_type_node)
1403 (TREE_TYPE (TREE_TYPE (newtype)) == char_type_node
1404 && TYPE_ARG_TYPES (newtype) == 0
1405 && self_promoting_args_p (TYPE_ARG_TYPES (oldtype))
1406 && TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (oldtype))) == void_type_node)))
1409 pedwarn_with_decl (newdecl, "conflicting types for `%s'");
1410 /* Make sure we keep void * as ret type, not char *. */
1411 if (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (oldtype))) == void_type_node)
1412 TREE_TYPE (newdecl) = newtype = oldtype;
1414 else if (!types_match
1415 /* Permit char *foo (int, ...); followed by char *foo ();
1417 && ! (TREE_CODE (olddecl) == FUNCTION_DECL
1419 /* Return types must still match. */
1420 && comptypes (TREE_TYPE (oldtype),
1421 TREE_TYPE (newtype))
1422 && TYPE_ARG_TYPES (newtype) == 0))
1424 error_with_decl (newdecl, "conflicting types for `%s'");
1425 /* Check for function type mismatch
1426 involving an empty arglist vs a nonempty one. */
1427 if (TREE_CODE (olddecl) == FUNCTION_DECL
1428 && comptypes (TREE_TYPE (oldtype),
1429 TREE_TYPE (newtype))
1430 && ((TYPE_ARG_TYPES (oldtype) == 0
1431 && DECL_INITIAL (olddecl) == 0)
1433 (TYPE_ARG_TYPES (newtype) == 0
1434 && DECL_INITIAL (newdecl) == 0)))
1436 /* Classify the problem further. */
1437 register tree t = TYPE_ARG_TYPES (oldtype);
1439 t = TYPE_ARG_TYPES (newtype);
1440 for (; t; t = TREE_CHAIN (t))
1442 register tree type = TREE_VALUE (t);
1444 if (TREE_CHAIN (t) == 0
1445 && TYPE_MAIN_VARIANT (type) != void_type_node)
1447 error ("A parameter list with an ellipsis can't match");
1448 error ("an empty parameter name list declaration.");
1452 if (TYPE_MAIN_VARIANT (type) == float_type_node
1453 || C_PROMOTING_INTEGER_TYPE_P (type))
1455 error ("An argument type that has a default promotion");
1456 error ("can't match an empty parameter name list declaration.");
1461 error_with_decl (olddecl, "previous declaration of `%s'");
1465 char *errmsg = redeclaration_error_message (newdecl, olddecl);
1468 error_with_decl (newdecl, errmsg);
1469 error_with_decl (olddecl,
1470 ((DECL_INITIAL (olddecl)
1471 && current_binding_level == global_binding_level)
1472 ? "`%s' previously defined here"
1473 : "`%s' previously declared here"));
1475 else if (TREE_CODE (olddecl) == FUNCTION_DECL
1476 && DECL_INITIAL (olddecl) != 0
1477 && TYPE_ARG_TYPES (oldtype) == 0
1478 && TYPE_ARG_TYPES (newtype) != 0)
1480 register tree type, parm;
1482 /* Prototype decl follows defn w/o prototype. */
1484 for (parm = TYPE_ACTUAL_ARG_TYPES (oldtype),
1485 type = TYPE_ARG_TYPES (newtype),
1487 (TYPE_MAIN_VARIANT (TREE_VALUE (parm)) != void_type_node
1488 || TYPE_MAIN_VARIANT (TREE_VALUE (type)) != void_type_node);
1489 parm = TREE_CHAIN (parm), type = TREE_CHAIN (type), nargs++)
1491 if (TYPE_MAIN_VARIANT (TREE_VALUE (parm)) == void_type_node
1492 || TYPE_MAIN_VARIANT (TREE_VALUE (type)) == void_type_node)
1494 errmsg = "prototype for `%s' follows and number of arguments";
1497 /* Type for passing arg must be consistent
1498 with that declared for the arg. */
1499 if (! comptypes (TREE_VALUE (parm), TREE_VALUE (type))
1500 /* If -traditional, allow `unsigned int' instead of `int'
1501 in the prototype. */
1502 && (! (flag_traditional
1503 && TYPE_MAIN_VARIANT (TREE_VALUE (parm)) == integer_type_node
1504 && TYPE_MAIN_VARIANT (TREE_VALUE (type)) == unsigned_type_node)))
1506 errmsg = "prototype for `%s' follows and argument %d";
1512 error_with_decl (newdecl, errmsg, nargs);
1513 error_with_decl (olddecl,
1514 "doesn't match non-prototype definition here");
1518 warning_with_decl (newdecl, "prototype for `%s' follows");
1519 warning_with_decl (olddecl, "non-prototype definition here");
1522 /* Warn about mismatches in various flags. */
1525 /* Warn if function is now inline
1526 but was previously declared not inline and has been called. */
1527 if (TREE_CODE (olddecl) == FUNCTION_DECL
1528 && ! DECL_INLINE (olddecl) && DECL_INLINE (newdecl)
1529 && TREE_USED (olddecl))
1530 warning_with_decl (newdecl,
1531 "`%s' declared inline after being called");
1532 if (TREE_CODE (olddecl) == FUNCTION_DECL
1533 && ! DECL_INLINE (olddecl) && DECL_INLINE (newdecl)
1534 && DECL_INITIAL (olddecl) != 0)
1535 warning_with_decl (newdecl,
1536 "`%s' declared inline after its definition");
1537 /* It is nice to warn when a function is declared
1538 global first and then static. */
1539 if (TREE_CODE (olddecl) == FUNCTION_DECL
1540 && TREE_PUBLIC (olddecl)
1541 && !TREE_PUBLIC (newdecl))
1542 warning_with_decl (newdecl, "static declaration for `%s' follows non-static");
1544 /* These bits are logically part of the type, for variables.
1545 But not for functions
1546 (where qualifiers are not valid ANSI anyway). */
1547 if (pedantic && TREE_CODE (olddecl) != FUNCTION_DECL
1548 && (TREE_READONLY (newdecl) != TREE_READONLY (olddecl)
1549 || TREE_THIS_VOLATILE (newdecl) != TREE_THIS_VOLATILE (olddecl)))
1550 pedwarn_with_decl (newdecl, "type qualifiers for `%s' conflict with previous decl");
1554 /* Optionally warn about more than one declaration for the same name. */
1555 if (warn_redundant_decls && DECL_SOURCE_LINE (olddecl) != 0
1556 /* Dont warn about a function declaration
1557 followed by a definition. */
1558 && !(TREE_CODE (newdecl) == FUNCTION_DECL && DECL_INITIAL (newdecl) != 0
1559 && DECL_INITIAL (olddecl) == 0))
1561 warning_with_decl (newdecl, "redundant redeclaration of `%s' in same scope");
1562 warning_with_decl (olddecl, "previous declaration of `%s'");
1565 /* Copy all the DECL_... slots specified in the new decl
1566 except for any that we copy here from the old type.
1568 Past this point, we don't change OLDTYPE and NEWTYPE
1569 even if we change the types of NEWDECL and OLDDECL. */
1573 /* Merge the data types specified in the two decls. */
1574 if (TREE_CODE (newdecl) != FUNCTION_DECL || !DECL_BUILT_IN (olddecl))
1576 = TREE_TYPE (olddecl)
1577 = common_type (newtype, oldtype);
1579 /* Lay the type out, unless already done. */
1580 if (oldtype != TREE_TYPE (newdecl))
1582 if (TREE_TYPE (newdecl) != error_mark_node)
1583 layout_type (TREE_TYPE (newdecl));
1584 if (TREE_CODE (newdecl) != FUNCTION_DECL
1585 && TREE_CODE (newdecl) != TYPE_DECL
1586 && TREE_CODE (newdecl) != CONST_DECL)
1587 layout_decl (newdecl, 0);
1591 /* Since the type is OLDDECL's, make OLDDECL's size go with. */
1592 DECL_SIZE (newdecl) = DECL_SIZE (olddecl);
1593 if (TREE_CODE (olddecl) != FUNCTION_DECL)
1594 if (DECL_ALIGN (olddecl) > DECL_ALIGN (newdecl))
1595 DECL_ALIGN (newdecl) = DECL_ALIGN (olddecl);
1598 /* Keep the old rtl since we can safely use it. */
1599 DECL_RTL (newdecl) = DECL_RTL (olddecl);
1601 /* Merge the type qualifiers. */
1602 if (DECL_BUILT_IN_NONANSI (olddecl) && TREE_THIS_VOLATILE (olddecl)
1603 && !TREE_THIS_VOLATILE (newdecl))
1604 TREE_THIS_VOLATILE (olddecl) = 0;
1605 if (TREE_READONLY (newdecl))
1606 TREE_READONLY (olddecl) = 1;
1607 if (TREE_THIS_VOLATILE (newdecl))
1609 TREE_THIS_VOLATILE (olddecl) = 1;
1610 if (TREE_CODE (newdecl) == VAR_DECL)
1611 make_var_volatile (newdecl);
1614 /* Keep source location of definition rather than declaration. */
1615 if (DECL_INITIAL (newdecl) == 0 && DECL_INITIAL (olddecl) != 0)
1617 DECL_SOURCE_LINE (newdecl) = DECL_SOURCE_LINE (olddecl);
1618 DECL_SOURCE_FILE (newdecl) = DECL_SOURCE_FILE (olddecl);
1621 /* Merge the unused-warning information. */
1622 if (DECL_IN_SYSTEM_HEADER (olddecl))
1623 DECL_IN_SYSTEM_HEADER (newdecl) = 1;
1624 else if (DECL_IN_SYSTEM_HEADER (newdecl))
1625 DECL_IN_SYSTEM_HEADER (olddecl) = 1;
1627 /* Merge the initialization information. */
1628 if (DECL_INITIAL (newdecl) == 0)
1629 DECL_INITIAL (newdecl) = DECL_INITIAL (olddecl);
1631 /* If cannot merge, then use the new type and qualifiers,
1632 and don't preserve the old rtl. */
1635 TREE_TYPE (olddecl) = TREE_TYPE (newdecl);
1636 TREE_READONLY (olddecl) = TREE_READONLY (newdecl);
1637 TREE_THIS_VOLATILE (olddecl) = TREE_THIS_VOLATILE (newdecl);
1638 TREE_SIDE_EFFECTS (olddecl) = TREE_SIDE_EFFECTS (newdecl);
1641 /* Merge the storage class information. */
1642 /* For functions, static overrides non-static. */
1643 if (TREE_CODE (newdecl) == FUNCTION_DECL)
1645 TREE_PUBLIC (newdecl) &= TREE_PUBLIC (olddecl);
1646 /* This is since we don't automatically
1647 copy the attributes of NEWDECL into OLDDECL. */
1648 TREE_PUBLIC (olddecl) = TREE_PUBLIC (newdecl);
1649 /* If this clears `static', clear it in the identifier too. */
1650 if (! TREE_PUBLIC (olddecl))
1651 TREE_PUBLIC (DECL_NAME (olddecl)) = 0;
1653 if (DECL_EXTERNAL (newdecl))
1655 TREE_STATIC (newdecl) = TREE_STATIC (olddecl);
1656 DECL_EXTERNAL (newdecl) = DECL_EXTERNAL (olddecl);
1657 /* An extern decl does not override previous storage class. */
1658 TREE_PUBLIC (newdecl) = TREE_PUBLIC (olddecl);
1662 TREE_STATIC (olddecl) = TREE_STATIC (newdecl);
1663 TREE_PUBLIC (olddecl) = TREE_PUBLIC (newdecl);
1666 /* If either decl says `inline', this fn is inline,
1667 unless its definition was passed already. */
1668 if (DECL_INLINE (newdecl) && DECL_INITIAL (olddecl) == 0)
1669 DECL_INLINE (olddecl) = 1;
1670 DECL_INLINE (newdecl) = DECL_INLINE (olddecl);
1672 /* Get rid of any built-in function if new arg types don't match it
1673 or if we have a function definition. */
1674 if (TREE_CODE (newdecl) == FUNCTION_DECL
1675 && DECL_BUILT_IN (olddecl)
1676 && (!types_match || new_is_definition))
1678 TREE_TYPE (olddecl) = TREE_TYPE (newdecl);
1679 DECL_BUILT_IN (olddecl) = 0;
1682 /* If redeclaring a builtin function, and not a definition,
1684 Also preserve various other info from the definition. */
1685 if (TREE_CODE (newdecl) == FUNCTION_DECL && !new_is_definition)
1687 if (DECL_BUILT_IN (olddecl))
1689 DECL_BUILT_IN (newdecl) = 1;
1690 DECL_SET_FUNCTION_CODE (newdecl, DECL_FUNCTION_CODE (olddecl));
1693 DECL_FRAME_SIZE (newdecl) = DECL_FRAME_SIZE (olddecl);
1695 DECL_RESULT (newdecl) = DECL_RESULT (olddecl);
1696 DECL_INITIAL (newdecl) = DECL_INITIAL (olddecl);
1697 DECL_SAVED_INSNS (newdecl) = DECL_SAVED_INSNS (olddecl);
1698 DECL_ARGUMENTS (newdecl) = DECL_ARGUMENTS (olddecl);
1701 /* Copy most of the decl-specific fields of NEWDECL into OLDDECL.
1702 But preserve OLDdECL's DECL_UID. */
1704 register unsigned olddecl_uid = DECL_UID (olddecl);
1706 bcopy ((char *) newdecl + sizeof (struct tree_common),
1707 (char *) olddecl + sizeof (struct tree_common),
1708 sizeof (struct tree_decl) - sizeof (struct tree_common));
1709 DECL_UID (olddecl) = olddecl_uid;
1715 /* Record a decl-node X as belonging to the current lexical scope.
1716 Check for errors (such as an incompatible declaration for the same
1717 name already seen in the same scope).
1719 Returns either X or an old decl for the same name.
1720 If an old decl is returned, it may have been smashed
1721 to agree with what X says. */
1728 register tree name = DECL_NAME (x);
1729 register struct binding_level *b = current_binding_level;
1731 DECL_CONTEXT (x) = current_function_decl;
1732 /* A local extern declaration for a function doesn't constitute nesting.
1733 A local auto declaration does, since it's a forward decl
1734 for a nested function coming later. */
1735 if (TREE_CODE (x) == FUNCTION_DECL && DECL_INITIAL (x) == 0
1736 && DECL_EXTERNAL (x))
1737 DECL_CONTEXT (x) = 0;
1739 if (warn_nested_externs && DECL_EXTERNAL (x) && b != global_binding_level
1740 && x != IDENTIFIER_IMPLICIT_DECL (name))
1741 warning ("nested extern declaration of `%s'", IDENTIFIER_POINTER (name));
1748 t = lookup_name_current_level (name);
1749 if (t != 0 && t == error_mark_node)
1750 /* error_mark_node is 0 for a while during initialization! */
1753 error_with_decl (x, "`%s' used prior to declaration");
1758 file = DECL_SOURCE_FILE (t);
1759 line = DECL_SOURCE_LINE (t);
1762 if (t != 0 && duplicate_decls (x, t))
1764 if (TREE_CODE (t) == PARM_DECL)
1766 /* Don't allow more than one "real" duplicate
1767 of a forward parm decl. */
1768 TREE_ASM_WRITTEN (t) = TREE_ASM_WRITTEN (x);
1771 /* If this decl is `static' and an implicit decl was seen previously,
1772 warn. But don't complain if -traditional,
1773 since traditional compilers don't complain. */
1774 if (!flag_traditional && TREE_PUBLIC (name)
1775 && ! TREE_PUBLIC (x) && ! DECL_EXTERNAL (x)
1776 /* We used to warn also for explicit extern followed by static,
1777 but sometimes you need to do it that way. */
1778 && IDENTIFIER_IMPLICIT_DECL (name) != 0)
1780 pedwarn ("`%s' was declared implicitly `extern' and later `static'",
1781 IDENTIFIER_POINTER (name));
1782 pedwarn_with_file_and_line (file, line,
1783 "previous declaration of `%s'",
1784 IDENTIFIER_POINTER (name));
1790 /* If we are processing a typedef statement, generate a whole new
1791 ..._TYPE node (which will be just an variant of the existing
1792 ..._TYPE node with identical properties) and then install the
1793 TYPE_DECL node generated to represent the typedef name as the
1794 TYPE_NAME of this brand new (duplicate) ..._TYPE node.
1796 The whole point here is to end up with a situation where each
1797 and every ..._TYPE node the compiler creates will be uniquely
1798 associated with AT MOST one node representing a typedef name.
1799 This way, even though the compiler substitutes corresponding
1800 ..._TYPE nodes for TYPE_DECL (i.e. "typedef name") nodes very
1801 early on, later parts of the compiler can always do the reverse
1802 translation and get back the corresponding typedef name. For
1805 typedef struct S MY_TYPE;
1808 Later parts of the compiler might only know that `object' was of
1809 type `struct S' if if were not for code just below. With this
1810 code however, later parts of the compiler see something like:
1812 struct S' == struct S
1813 typedef struct S' MY_TYPE;
1816 And they can then deduce (from the node for type struct S') that
1817 the original object declaration was:
1821 Being able to do this is important for proper support of protoize,
1822 and also for generating precise symbolic debugging information
1823 which takes full account of the programmer's (typedef) vocabulary.
1825 Obviously, we don't want to generate a duplicate ..._TYPE node if
1826 the TYPE_DECL node that we are now processing really represents a
1827 standard built-in type.
1829 Since all standard types are effectively declared at line zero
1830 in the source file, we can easily check to see if we are working
1831 on a standard type by checking the current value of lineno. */
1833 if (TREE_CODE (x) == TYPE_DECL)
1835 if (DECL_SOURCE_LINE (x) == 0)
1837 if (TYPE_NAME (TREE_TYPE (x)) == 0)
1838 TYPE_NAME (TREE_TYPE (x)) = x;
1842 tree tt = TREE_TYPE (x);
1844 tt = build_type_copy (tt);
1850 /* Multiple external decls of the same identifier ought to match.
1851 Check against both global declarations and out of scope (limbo) block
1854 We get warnings about inline functions where they are defined.
1855 Avoid duplicate warnings where they are used. */
1856 if (TREE_PUBLIC (x) && ! DECL_INLINE (x))
1860 if (IDENTIFIER_GLOBAL_VALUE (name) != 0
1861 && (DECL_EXTERNAL (IDENTIFIER_GLOBAL_VALUE (name))
1862 || TREE_PUBLIC (IDENTIFIER_GLOBAL_VALUE (name))))
1863 decl = IDENTIFIER_GLOBAL_VALUE (name);
1864 else if (IDENTIFIER_LIMBO_VALUE (name) != 0)
1865 /* Decls in limbo are always extern, so no need to check that. */
1866 decl = IDENTIFIER_LIMBO_VALUE (name);
1870 if (decl && ! comptypes (TREE_TYPE (x), TREE_TYPE (decl))
1871 /* If old decl is built-in, we already warned if we should. */
1872 && !DECL_BUILT_IN (decl))
1874 pedwarn_with_decl (x,
1875 "type mismatch with previous external decl");
1876 pedwarn_with_decl (decl, "previous external decl of `%s'");
1880 /* If a function has had an implicit declaration, and then is defined,
1881 make sure they are compatible. */
1883 if (IDENTIFIER_IMPLICIT_DECL (name) != 0
1884 && IDENTIFIER_GLOBAL_VALUE (name) == 0
1885 && TREE_CODE (x) == FUNCTION_DECL
1886 && ! comptypes (TREE_TYPE (x),
1887 TREE_TYPE (IDENTIFIER_IMPLICIT_DECL (name))))
1889 warning_with_decl (x, "type mismatch with previous implicit declaration");
1890 warning_with_decl (IDENTIFIER_IMPLICIT_DECL (name),
1891 "previous implicit declaration of `%s'");
1894 /* In PCC-compatibility mode, extern decls of vars with no current decl
1895 take effect at top level no matter where they are. */
1896 if (flag_traditional && DECL_EXTERNAL (x)
1897 && lookup_name (name) == 0)
1899 tree type = TREE_TYPE (x);
1901 /* But don't do this if the type contains temporary nodes. */
1904 if (type == error_mark_node)
1906 if (! TREE_PERMANENT (type))
1908 warning_with_decl (x, "type of external `%s' is not global");
1909 /* By exiting the loop early, we leave TYPE nonzero,
1910 and thus prevent globalization of the decl. */
1913 else if (TREE_CODE (type) == FUNCTION_TYPE
1914 && TYPE_ARG_TYPES (type) != 0)
1915 /* The types might not be truly local,
1916 but the list of arg types certainly is temporary.
1917 Since prototypes are nontraditional,
1918 ok not to do the traditional thing. */
1920 type = TREE_TYPE (type);
1924 b = global_binding_level;
1927 /* This name is new in its binding level.
1928 Install the new declaration and return it. */
1929 if (b == global_binding_level)
1931 /* Install a global value. */
1933 /* If the first global decl has external linkage,
1934 warn if we later see static one. */
1935 if (IDENTIFIER_GLOBAL_VALUE (name) == 0 && TREE_PUBLIC (x))
1936 TREE_PUBLIC (name) = 1;
1938 IDENTIFIER_GLOBAL_VALUE (name) = x;
1940 /* We no longer care about any previous block level declarations. */
1941 IDENTIFIER_LIMBO_VALUE (name) = 0;
1943 /* Don't forget if the function was used via an implicit decl. */
1944 if (IDENTIFIER_IMPLICIT_DECL (name)
1945 && TREE_USED (IDENTIFIER_IMPLICIT_DECL (name)))
1946 TREE_USED (x) = 1, TREE_USED (name) = 1;
1948 /* Don't forget if its address was taken in that way. */
1949 if (IDENTIFIER_IMPLICIT_DECL (name)
1950 && TREE_ADDRESSABLE (IDENTIFIER_IMPLICIT_DECL (name)))
1951 TREE_ADDRESSABLE (x) = 1;
1953 /* Warn about mismatches against previous implicit decl. */
1954 if (IDENTIFIER_IMPLICIT_DECL (name) != 0
1955 /* If this real decl matches the implicit, don't complain. */
1956 && ! (TREE_CODE (x) == FUNCTION_DECL
1957 && (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (x)))
1958 == integer_type_node)))
1959 pedwarn ("`%s' was previously implicitly declared to return `int'",
1960 IDENTIFIER_POINTER (name));
1962 /* If this decl is `static' and an `extern' was seen previously,
1963 that is erroneous. */
1964 if (TREE_PUBLIC (name)
1965 && ! TREE_PUBLIC (x) && ! DECL_EXTERNAL (x))
1967 /* Okay to redeclare an ANSI built-in as static. */
1968 if (t != 0 && DECL_BUILT_IN (t))
1970 /* Okay to declare a non-ANSI built-in as anything. */
1971 else if (t != 0 && DECL_BUILT_IN_NONANSI (t))
1973 else if (IDENTIFIER_IMPLICIT_DECL (name))
1974 pedwarn ("`%s' was declared implicitly `extern' and later `static'",
1975 IDENTIFIER_POINTER (name));
1977 pedwarn ("`%s' was declared `extern' and later `static'",
1978 IDENTIFIER_POINTER (name));
1983 /* Here to install a non-global value. */
1984 tree oldlocal = IDENTIFIER_LOCAL_VALUE (name);
1985 tree oldglobal = IDENTIFIER_GLOBAL_VALUE (name);
1986 IDENTIFIER_LOCAL_VALUE (name) = x;
1988 /* If this is an extern function declaration, see if we
1989 have a global definition or declaration for the function. */
1991 && DECL_EXTERNAL (x) && !DECL_INLINE (x)
1993 && TREE_CODE (x) == FUNCTION_DECL
1994 && TREE_CODE (oldglobal) == FUNCTION_DECL)
1996 /* We have one. Their types must agree. */
1997 if (! comptypes (TREE_TYPE (x),
1998 TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (name))))
1999 pedwarn_with_decl (x, "extern declaration of `%s' doesn't match global one");
2002 /* Inner extern decl is inline if global one is.
2003 Copy enough to really inline it. */
2004 if (DECL_INLINE (oldglobal))
2006 DECL_INLINE (x) = DECL_INLINE (oldglobal);
2007 DECL_INITIAL (x) = (current_function_decl == oldglobal
2008 ? 0 : DECL_INITIAL (oldglobal));
2009 DECL_SAVED_INSNS (x) = DECL_SAVED_INSNS (oldglobal);
2010 DECL_ARGUMENTS (x) = DECL_ARGUMENTS (oldglobal);
2011 DECL_RESULT (x) = DECL_RESULT (oldglobal);
2012 TREE_ASM_WRITTEN (x) = TREE_ASM_WRITTEN (oldglobal);
2013 DECL_ABSTRACT_ORIGIN (x) = oldglobal;
2015 /* Inner extern decl is built-in if global one is. */
2016 if (DECL_BUILT_IN (oldglobal))
2018 DECL_BUILT_IN (x) = DECL_BUILT_IN (oldglobal);
2019 DECL_SET_FUNCTION_CODE (x, DECL_FUNCTION_CODE (oldglobal));
2021 /* Keep the arg types from a file-scope fcn defn. */
2022 if (TYPE_ARG_TYPES (TREE_TYPE (oldglobal)) != 0
2023 && DECL_INITIAL (oldglobal)
2024 && TYPE_ARG_TYPES (TREE_TYPE (x)) == 0)
2025 TREE_TYPE (x) = TREE_TYPE (oldglobal);
2029 #if 0 /* This case is probably sometimes the right thing to do. */
2030 /* If we have a local external declaration,
2031 then any file-scope declaration should not
2032 have been static. */
2033 if (oldlocal == 0 && oldglobal != 0
2034 && !TREE_PUBLIC (oldglobal)
2035 && DECL_EXTERNAL (x) && TREE_PUBLIC (x))
2036 warning ("`%s' locally external but globally static",
2037 IDENTIFIER_POINTER (name));
2040 /* If we have a local external declaration,
2041 and no file-scope declaration has yet been seen,
2042 then if we later have a file-scope decl it must not be static. */
2045 && DECL_EXTERNAL (x)
2048 TREE_PUBLIC (name) = 1;
2050 /* Save this decl, so that we can do type checking against
2051 other decls after it falls out of scope.
2053 Only save it once. This prevents temporary decls created in
2054 expand_inline_function from being used here, since this
2055 will have been set when the inline function was parsed.
2056 It also helps give slightly better warnings. */
2057 if (IDENTIFIER_LIMBO_VALUE (name) == 0)
2058 IDENTIFIER_LIMBO_VALUE (name) = x;
2061 /* Warn if shadowing an argument at the top level of the body. */
2062 if (oldlocal != 0 && !DECL_EXTERNAL (x)
2063 /* This warning doesn't apply to the parms of a nested fcn. */
2064 && ! current_binding_level->parm_flag
2065 /* Check that this is one level down from the parms. */
2066 && current_binding_level->level_chain->parm_flag
2067 /* Check that the decl being shadowed
2068 comes from the parm level, one level up. */
2069 && chain_member (oldlocal, current_binding_level->level_chain->names))
2071 if (TREE_CODE (oldlocal) == PARM_DECL)
2072 pedwarn ("declaration of `%s' shadows a parameter",
2073 IDENTIFIER_POINTER (name));
2075 pedwarn ("declaration of `%s' shadows a symbol from the parameter list",
2076 IDENTIFIER_POINTER (name));
2079 /* Maybe warn if shadowing something else. */
2080 else if (warn_shadow && !DECL_EXTERNAL (x)
2081 /* No shadow warnings for internally generated vars. */
2082 && DECL_SOURCE_LINE (x) != 0
2083 /* No shadow warnings for vars made for inlining. */
2084 && ! DECL_FROM_INLINE (x))
2086 char *warnstring = 0;
2088 if (TREE_CODE (x) == PARM_DECL
2089 && current_binding_level->level_chain->parm_flag)
2090 /* Don't warn about the parm names in function declarator
2091 within a function declarator.
2092 It would be nice to avoid warning in any function
2093 declarator in a declaration, as opposed to a definition,
2094 but there is no way to tell it's not a definition. */
2096 else if (oldlocal != 0 && TREE_CODE (oldlocal) == PARM_DECL)
2097 warnstring = "declaration of `%s' shadows a parameter";
2098 else if (oldlocal != 0)
2099 warnstring = "declaration of `%s' shadows previous local";
2100 else if (IDENTIFIER_GLOBAL_VALUE (name) != 0
2101 && IDENTIFIER_GLOBAL_VALUE (name) != error_mark_node)
2102 warnstring = "declaration of `%s' shadows global declaration";
2105 warning (warnstring, IDENTIFIER_POINTER (name));
2108 /* If storing a local value, there may already be one (inherited).
2109 If so, record it for restoration when this binding level ends. */
2111 b->shadowed = tree_cons (name, oldlocal, b->shadowed);
2114 /* Keep count of variables in this level with incomplete type. */
2115 if (TYPE_SIZE (TREE_TYPE (x)) == 0)
2119 /* Put decls on list in reverse order.
2120 We will reverse them later if necessary. */
2121 TREE_CHAIN (x) = b->names;
2127 /* Like pushdecl, only it places X in GLOBAL_BINDING_LEVEL, if appropriate. */
2130 pushdecl_top_level (x)
2134 register struct binding_level *b = current_binding_level;
2136 current_binding_level = global_binding_level;
2138 current_binding_level = b;
2142 /* Generate an implicit declaration for identifier FUNCTIONID
2143 as a function of type int (). Print a warning if appropriate. */
2146 implicitly_declare (functionid)
2150 int traditional_warning = 0;
2151 /* Only one "implicit declaration" warning per identifier. */
2152 int implicit_warning;
2154 /* Save the decl permanently so we can warn if definition follows. */
2155 push_obstacks_nochange ();
2156 end_temporary_allocation ();
2158 /* We used to reuse an old implicit decl here,
2159 but this loses with inline functions because it can clobber
2160 the saved decl chains. */
2161 /* if (IDENTIFIER_IMPLICIT_DECL (functionid) != 0)
2162 decl = IDENTIFIER_IMPLICIT_DECL (functionid);
2164 decl = build_decl (FUNCTION_DECL, functionid, default_function_type);
2166 /* Warn of implicit decl following explicit local extern decl.
2167 This is probably a program designed for traditional C. */
2168 if (TREE_PUBLIC (functionid) && IDENTIFIER_GLOBAL_VALUE (functionid) == 0)
2169 traditional_warning = 1;
2171 /* Warn once of an implicit declaration. */
2172 implicit_warning = (IDENTIFIER_IMPLICIT_DECL (functionid) == 0);
2174 DECL_EXTERNAL (decl) = 1;
2175 TREE_PUBLIC (decl) = 1;
2177 /* Record that we have an implicit decl and this is it. */
2178 IDENTIFIER_IMPLICIT_DECL (functionid) = decl;
2180 /* ANSI standard says implicit declarations are in the innermost block.
2181 So we record the decl in the standard fashion.
2182 If flag_traditional is set, pushdecl does it top-level. */
2185 /* This is a no-op in c-lang.c or something real in objc-actions.c. */
2186 maybe_objc_check_decl (decl);
2188 rest_of_decl_compilation (decl, NULL_PTR, 0, 0);
2190 if (warn_implicit && implicit_warning)
2191 warning ("implicit declaration of function `%s'",
2192 IDENTIFIER_POINTER (functionid));
2193 else if (warn_traditional && traditional_warning)
2194 warning ("function `%s' was previously declared within a block",
2195 IDENTIFIER_POINTER (functionid));
2197 /* Write a record describing this implicit function declaration to the
2198 prototypes file (if requested). */
2200 gen_aux_info_record (decl, 0, 1, 0);
2207 /* Return zero if the declaration NEWDECL is valid
2208 when the declaration OLDDECL (assumed to be for the same name)
2209 has already been seen.
2210 Otherwise return an error message format string with a %s
2211 where the identifier should go. */
2214 redeclaration_error_message (newdecl, olddecl)
2215 tree newdecl, olddecl;
2217 if (TREE_CODE (newdecl) == TYPE_DECL)
2219 if (flag_traditional && TREE_TYPE (newdecl) == TREE_TYPE (olddecl))
2221 return "redefinition of `%s'";
2223 else if (TREE_CODE (newdecl) == FUNCTION_DECL)
2225 /* Declarations of functions can insist on internal linkage
2226 but they can't be inconsistent with internal linkage,
2227 so there can be no error on that account.
2228 However defining the same name twice is no good. */
2229 if (DECL_INITIAL (olddecl) != 0 && DECL_INITIAL (newdecl) != 0
2230 /* However, defining once as extern inline and a second
2231 time in another way is ok. */
2232 && !(DECL_INLINE (olddecl) && DECL_EXTERNAL (olddecl)
2233 && !(DECL_INLINE (newdecl) && DECL_EXTERNAL (newdecl))))
2234 return "redefinition of `%s'";
2237 else if (current_binding_level == global_binding_level)
2239 /* Objects declared at top level: */
2240 /* If at least one is a reference, it's ok. */
2241 if (DECL_EXTERNAL (newdecl) || DECL_EXTERNAL (olddecl))
2243 /* Reject two definitions. */
2244 if (DECL_INITIAL (olddecl) != 0 && DECL_INITIAL (newdecl) != 0)
2245 return "redefinition of `%s'";
2246 /* Now we have two tentative defs, or one tentative and one real def. */
2247 /* Insist that the linkage match. */
2248 if (TREE_PUBLIC (olddecl) != TREE_PUBLIC (newdecl))
2249 return "conflicting declarations of `%s'";
2252 else if (current_binding_level->parm_flag
2253 && TREE_ASM_WRITTEN (olddecl) && !TREE_ASM_WRITTEN (newdecl))
2257 /* Objects declared with block scope: */
2258 /* Reject two definitions, and reject a definition
2259 together with an external reference. */
2260 if (!(DECL_EXTERNAL (newdecl) && DECL_EXTERNAL (olddecl)))
2261 return "redeclaration of `%s'";
2266 /* Get the LABEL_DECL corresponding to identifier ID as a label.
2267 Create one if none exists so far for the current function.
2268 This function is called for both label definitions and label references. */
2274 register tree decl = IDENTIFIER_LABEL_VALUE (id);
2276 if (current_function_decl == 0)
2278 error ("label %s referenced outside of any function",
2279 IDENTIFIER_POINTER (id));
2283 /* Use a label already defined or ref'd with this name. */
2286 /* But not if it is inherited and wasn't declared to be inheritable. */
2287 if (DECL_CONTEXT (decl) != current_function_decl
2288 && ! C_DECLARED_LABEL_FLAG (decl))
2289 return shadow_label (id);
2293 decl = build_decl (LABEL_DECL, id, void_type_node);
2295 /* Make sure every label has an rtx. */
2298 /* A label not explicitly declared must be local to where it's ref'd. */
2299 DECL_CONTEXT (decl) = current_function_decl;
2301 DECL_MODE (decl) = VOIDmode;
2303 /* Say where one reference is to the label,
2304 for the sake of the error if it is not defined. */
2305 DECL_SOURCE_LINE (decl) = lineno;
2306 DECL_SOURCE_FILE (decl) = input_filename;
2308 IDENTIFIER_LABEL_VALUE (id) = decl;
2310 named_labels = tree_cons (NULL_TREE, decl, named_labels);
2315 /* Make a label named NAME in the current function,
2316 shadowing silently any that may be inherited from containing functions
2317 or containing scopes.
2319 Note that valid use, if the label being shadowed
2320 comes from another scope in the same function,
2321 requires calling declare_nonlocal_label right away. */
2327 register tree decl = IDENTIFIER_LABEL_VALUE (name);
2331 shadowed_labels = tree_cons (NULL_TREE, decl, shadowed_labels);
2332 IDENTIFIER_LABEL_VALUE (name) = decl = 0;
2335 return lookup_label (name);
2338 /* Define a label, specifying the location in the source file.
2339 Return the LABEL_DECL node for the label, if the definition is valid.
2340 Otherwise return 0. */
2343 define_label (filename, line, name)
2348 tree decl = lookup_label (name);
2350 /* If label with this name is known from an outer context, shadow it. */
2351 if (decl != 0 && DECL_CONTEXT (decl) != current_function_decl)
2353 shadowed_labels = tree_cons (NULL_TREE, decl, shadowed_labels);
2354 IDENTIFIER_LABEL_VALUE (name) = 0;
2355 decl = lookup_label (name);
2358 if (DECL_INITIAL (decl) != 0)
2360 error ("duplicate label `%s'", IDENTIFIER_POINTER (name));
2365 /* Mark label as having been defined. */
2366 DECL_INITIAL (decl) = error_mark_node;
2367 /* Say where in the source. */
2368 DECL_SOURCE_FILE (decl) = filename;
2369 DECL_SOURCE_LINE (decl) = line;
2374 /* Return the list of declarations of the current level.
2375 Note that this list is in reverse order unless/until
2376 you nreverse it; and when you do nreverse it, you must
2377 store the result back using `storedecls' or you will lose. */
2382 return current_binding_level->names;
2385 /* Return the list of type-tags (for structs, etc) of the current level. */
2390 return current_binding_level->tags;
2393 /* Store the list of declarations of the current level.
2394 This is done for the parameter declarations of a function being defined,
2395 after they are modified in the light of any missing parameters. */
2401 current_binding_level->names = decls;
2404 /* Similarly, store the list of tags of the current level. */
2410 current_binding_level->tags = tags;
2413 /* Given NAME, an IDENTIFIER_NODE,
2414 return the structure (or union or enum) definition for that name.
2415 Searches binding levels from BINDING_LEVEL up to the global level.
2416 If THISLEVEL_ONLY is nonzero, searches only the specified context
2417 (but skips any tag-transparent contexts to find one that is
2418 meaningful for tags).
2419 CODE says which kind of type the caller wants;
2420 it is RECORD_TYPE or UNION_TYPE or ENUMERAL_TYPE.
2421 If the wrong kind of type is found, an error is reported. */
2424 lookup_tag (code, name, binding_level, thislevel_only)
2425 enum tree_code code;
2426 struct binding_level *binding_level;
2430 register struct binding_level *level;
2432 for (level = binding_level; level; level = level->level_chain)
2435 for (tail = level->tags; tail; tail = TREE_CHAIN (tail))
2437 if (TREE_PURPOSE (tail) == name)
2439 if (TREE_CODE (TREE_VALUE (tail)) != code)
2441 /* Definition isn't the kind we were looking for. */
2442 pending_invalid_xref = name;
2443 pending_invalid_xref_file = input_filename;
2444 pending_invalid_xref_line = lineno;
2446 return TREE_VALUE (tail);
2449 if (thislevel_only && ! level->tag_transparent)
2455 /* Print an error message now
2456 for a recent invalid struct, union or enum cross reference.
2457 We don't print them immediately because they are not invalid
2458 when used in the `struct foo;' construct for shadowing. */
2461 pending_xref_error ()
2463 if (pending_invalid_xref != 0)
2464 error_with_file_and_line (pending_invalid_xref_file,
2465 pending_invalid_xref_line,
2466 "`%s' defined as wrong kind of tag",
2467 IDENTIFIER_POINTER (pending_invalid_xref));
2468 pending_invalid_xref = 0;
2471 /* Given a type, find the tag that was defined for it and return the tag name.
2472 Otherwise return 0. */
2475 lookup_tag_reverse (type)
2478 register struct binding_level *level;
2480 for (level = current_binding_level; level; level = level->level_chain)
2483 for (tail = level->tags; tail; tail = TREE_CHAIN (tail))
2485 if (TREE_VALUE (tail) == type)
2486 return TREE_PURPOSE (tail);
2492 /* Look up NAME in the current binding level and its superiors
2493 in the namespace of variables, functions and typedefs.
2494 Return a ..._DECL node of some kind representing its definition,
2495 or return 0 if it is undefined. */
2502 if (current_binding_level != global_binding_level
2503 && IDENTIFIER_LOCAL_VALUE (name))
2504 val = IDENTIFIER_LOCAL_VALUE (name);
2506 val = IDENTIFIER_GLOBAL_VALUE (name);
2510 /* Similar to `lookup_name' but look only at current binding level. */
2513 lookup_name_current_level (name)
2518 if (current_binding_level == global_binding_level)
2519 return IDENTIFIER_GLOBAL_VALUE (name);
2521 if (IDENTIFIER_LOCAL_VALUE (name) == 0)
2524 for (t = current_binding_level->names; t; t = TREE_CHAIN (t))
2525 if (DECL_NAME (t) == name)
2531 /* Create the predefined scalar types of C,
2532 and some nodes representing standard constants (0, 1, (void *)0).
2533 Initialize the global binding level.
2534 Make definitions for built-in primitive functions. */
2537 init_decl_processing ()
2539 register tree endlink;
2540 /* Either char* or void*. */
2541 tree traditional_ptr_type_node;
2542 /* Data types of memcpy and strlen. */
2543 tree memcpy_ftype, strlen_ftype;
2544 tree void_ftype_any;
2545 int wchar_type_size;
2547 tree array_domain_type;
2549 current_function_decl = NULL;
2550 named_labels = NULL;
2551 current_binding_level = NULL_BINDING_LEVEL;
2552 free_binding_level = NULL_BINDING_LEVEL;
2553 pushlevel (0); /* make the binding_level structure for global names */
2554 global_binding_level = current_binding_level;
2556 /* Define `int' and `char' first so that dbx will output them first. */
2558 integer_type_node = make_signed_type (INT_TYPE_SIZE);
2559 pushdecl (build_decl (TYPE_DECL, ridpointers[(int) RID_INT],
2560 integer_type_node));
2562 /* Define `char', which is like either `signed char' or `unsigned char'
2563 but not the same as either. */
2567 ? make_signed_type (CHAR_TYPE_SIZE)
2568 : make_unsigned_type (CHAR_TYPE_SIZE));
2569 pushdecl (build_decl (TYPE_DECL, get_identifier ("char"),
2572 long_integer_type_node = make_signed_type (LONG_TYPE_SIZE);
2573 pushdecl (build_decl (TYPE_DECL, get_identifier ("long int"),
2574 long_integer_type_node));
2576 unsigned_type_node = make_unsigned_type (INT_TYPE_SIZE);
2577 pushdecl (build_decl (TYPE_DECL, get_identifier ("unsigned int"),
2578 unsigned_type_node));
2580 long_unsigned_type_node = make_unsigned_type (LONG_TYPE_SIZE);
2581 pushdecl (build_decl (TYPE_DECL, get_identifier ("long unsigned int"),
2582 long_unsigned_type_node));
2584 /* `unsigned long' is the standard type for sizeof.
2585 Traditionally, use a signed type.
2586 Note that stddef.h uses `unsigned long',
2587 and this must agree, even of long and int are the same size. */
2588 if (flag_traditional)
2589 sizetype = long_integer_type_node;
2592 = TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (get_identifier (SIZE_TYPE)));
2595 = TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (get_identifier (PTRDIFF_TYPE)));
2597 TREE_TYPE (TYPE_SIZE (integer_type_node)) = sizetype;
2598 TREE_TYPE (TYPE_SIZE (char_type_node)) = sizetype;
2599 TREE_TYPE (TYPE_SIZE (unsigned_type_node)) = sizetype;
2600 TREE_TYPE (TYPE_SIZE (long_unsigned_type_node)) = sizetype;
2601 TREE_TYPE (TYPE_SIZE (long_integer_type_node)) = sizetype;
2603 error_mark_node = make_node (ERROR_MARK);
2604 TREE_TYPE (error_mark_node) = error_mark_node;
2606 short_integer_type_node = make_signed_type (SHORT_TYPE_SIZE);
2607 pushdecl (build_decl (TYPE_DECL, get_identifier ("short int"),
2608 short_integer_type_node));
2610 long_long_integer_type_node = make_signed_type (LONG_LONG_TYPE_SIZE);
2611 pushdecl (build_decl (TYPE_DECL, get_identifier ("long long int"),
2612 long_long_integer_type_node));
2614 short_unsigned_type_node = make_unsigned_type (SHORT_TYPE_SIZE);
2615 pushdecl (build_decl (TYPE_DECL, get_identifier ("short unsigned int"),
2616 short_unsigned_type_node));
2618 long_long_unsigned_type_node = make_unsigned_type (LONG_LONG_TYPE_SIZE);
2619 pushdecl (build_decl (TYPE_DECL, get_identifier ("long long unsigned int"),
2620 long_long_unsigned_type_node));
2622 /* Define both `signed char' and `unsigned char'. */
2623 signed_char_type_node = make_signed_type (CHAR_TYPE_SIZE);
2624 pushdecl (build_decl (TYPE_DECL, get_identifier ("signed char"),
2625 signed_char_type_node));
2627 unsigned_char_type_node = make_unsigned_type (CHAR_TYPE_SIZE);
2628 pushdecl (build_decl (TYPE_DECL, get_identifier ("unsigned char"),
2629 unsigned_char_type_node));
2631 intQI_type_node = make_signed_type (GET_MODE_BITSIZE (QImode));
2632 pushdecl (build_decl (TYPE_DECL, NULL_TREE, intQI_type_node));
2634 intHI_type_node = make_signed_type (GET_MODE_BITSIZE (HImode));
2635 pushdecl (build_decl (TYPE_DECL, NULL_TREE, intHI_type_node));
2637 intSI_type_node = make_signed_type (GET_MODE_BITSIZE (SImode));
2638 pushdecl (build_decl (TYPE_DECL, NULL_TREE, intSI_type_node));
2640 intDI_type_node = make_signed_type (GET_MODE_BITSIZE (DImode));
2641 pushdecl (build_decl (TYPE_DECL, NULL_TREE, intDI_type_node));
2643 unsigned_intQI_type_node = make_unsigned_type (GET_MODE_BITSIZE (QImode));
2644 pushdecl (build_decl (TYPE_DECL, NULL_TREE, unsigned_intQI_type_node));
2646 unsigned_intHI_type_node = make_unsigned_type (GET_MODE_BITSIZE (HImode));
2647 pushdecl (build_decl (TYPE_DECL, NULL_TREE, unsigned_intHI_type_node));
2649 unsigned_intSI_type_node = make_unsigned_type (GET_MODE_BITSIZE (SImode));
2650 pushdecl (build_decl (TYPE_DECL, NULL_TREE, unsigned_intSI_type_node));
2652 unsigned_intDI_type_node = make_unsigned_type (GET_MODE_BITSIZE (DImode));
2653 pushdecl (build_decl (TYPE_DECL, NULL_TREE, unsigned_intDI_type_node));
2655 float_type_node = make_node (REAL_TYPE);
2656 TYPE_PRECISION (float_type_node) = FLOAT_TYPE_SIZE;
2657 pushdecl (build_decl (TYPE_DECL, ridpointers[(int) RID_FLOAT],
2659 layout_type (float_type_node);
2661 double_type_node = make_node (REAL_TYPE);
2662 if (flag_short_double)
2663 TYPE_PRECISION (double_type_node) = FLOAT_TYPE_SIZE;
2665 TYPE_PRECISION (double_type_node) = DOUBLE_TYPE_SIZE;
2666 pushdecl (build_decl (TYPE_DECL, ridpointers[(int) RID_DOUBLE],
2668 layout_type (double_type_node);
2670 long_double_type_node = make_node (REAL_TYPE);
2671 TYPE_PRECISION (long_double_type_node) = LONG_DOUBLE_TYPE_SIZE;
2672 pushdecl (build_decl (TYPE_DECL, get_identifier ("long double"),
2673 long_double_type_node));
2674 layout_type (long_double_type_node);
2676 complex_integer_type_node = make_node (COMPLEX_TYPE);
2677 pushdecl (build_decl (TYPE_DECL, get_identifier ("complex int"),
2678 complex_integer_type_node));
2679 TREE_TYPE (complex_integer_type_node) = integer_type_node;
2680 layout_type (complex_integer_type_node);
2682 complex_float_type_node = make_node (COMPLEX_TYPE);
2683 pushdecl (build_decl (TYPE_DECL, get_identifier ("complex float"),
2684 complex_float_type_node));
2685 TREE_TYPE (complex_float_type_node) = float_type_node;
2686 layout_type (complex_float_type_node);
2688 complex_double_type_node = make_node (COMPLEX_TYPE);
2689 pushdecl (build_decl (TYPE_DECL, get_identifier ("complex double"),
2690 complex_double_type_node));
2691 TREE_TYPE (complex_double_type_node) = double_type_node;
2692 layout_type (complex_double_type_node);
2694 complex_long_double_type_node = make_node (COMPLEX_TYPE);
2695 pushdecl (build_decl (TYPE_DECL, get_identifier ("complex long double"),
2696 complex_long_double_type_node));
2697 TREE_TYPE (complex_long_double_type_node) = long_double_type_node;
2698 layout_type (complex_long_double_type_node);
2701 = TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (get_identifier (WCHAR_TYPE)));
2702 wchar_type_size = TYPE_PRECISION (wchar_type_node);
2703 signed_wchar_type_node = type_for_size (wchar_type_size, 0);
2704 unsigned_wchar_type_node = type_for_size (wchar_type_size, 1);
2706 integer_zero_node = build_int_2 (0, 0);
2707 TREE_TYPE (integer_zero_node) = integer_type_node;
2708 integer_one_node = build_int_2 (1, 0);
2709 TREE_TYPE (integer_one_node) = integer_type_node;
2711 size_zero_node = build_int_2 (0, 0);
2712 TREE_TYPE (size_zero_node) = sizetype;
2713 size_one_node = build_int_2 (1, 0);
2714 TREE_TYPE (size_one_node) = sizetype;
2716 void_type_node = make_node (VOID_TYPE);
2717 pushdecl (build_decl (TYPE_DECL,
2718 ridpointers[(int) RID_VOID], void_type_node));
2719 layout_type (void_type_node); /* Uses integer_zero_node */
2720 /* We are not going to have real types in C with less than byte alignment,
2721 so we might as well not have any types that claim to have it. */
2722 TYPE_ALIGN (void_type_node) = BITS_PER_UNIT;
2724 null_pointer_node = build_int_2 (0, 0);
2725 TREE_TYPE (null_pointer_node) = build_pointer_type (void_type_node);
2726 layout_type (TREE_TYPE (null_pointer_node));
2728 string_type_node = build_pointer_type (char_type_node);
2729 const_string_type_node
2730 = build_pointer_type (build_type_variant (char_type_node, 1, 0));
2732 /* Make a type to be the domain of a few array types
2733 whose domains don't really matter.
2734 200 is small enough that it always fits in size_t
2735 and large enough that it can hold most function names for the
2736 initializations of __FUNCTION__ and __PRETTY_FUNCTION__. */
2737 array_domain_type = build_index_type (build_int_2 (200, 0));
2739 /* make a type for arrays of characters.
2740 With luck nothing will ever really depend on the length of this
2742 char_array_type_node
2743 = build_array_type (char_type_node, array_domain_type);
2744 /* Likewise for arrays of ints. */
2746 = build_array_type (integer_type_node, array_domain_type);
2747 /* This is for wide string constants. */
2748 wchar_array_type_node
2749 = build_array_type (wchar_type_node, array_domain_type);
2751 default_function_type
2752 = build_function_type (integer_type_node, NULL_TREE);
2754 ptr_type_node = build_pointer_type (void_type_node);
2756 = build_pointer_type (build_type_variant (void_type_node, 1, 0));
2758 endlink = tree_cons (NULL_TREE, void_type_node, NULL_TREE);
2761 = build_function_type (void_type_node, NULL_TREE);
2764 = build_function_type (double_type_node,
2765 tree_cons (NULL_TREE, double_type_node, endlink));
2767 double_ftype_double_double
2768 = build_function_type (double_type_node,
2769 tree_cons (NULL_TREE, double_type_node,
2770 tree_cons (NULL_TREE,
2771 double_type_node, endlink)));
2774 = build_function_type (integer_type_node,
2775 tree_cons (NULL_TREE, integer_type_node, endlink));
2778 = build_function_type (long_integer_type_node,
2779 tree_cons (NULL_TREE,
2780 long_integer_type_node, endlink));
2782 void_ftype_ptr_ptr_int
2783 = build_function_type (void_type_node,
2784 tree_cons (NULL_TREE, ptr_type_node,
2785 tree_cons (NULL_TREE, ptr_type_node,
2786 tree_cons (NULL_TREE,
2790 int_ftype_cptr_cptr_sizet
2791 = build_function_type (integer_type_node,
2792 tree_cons (NULL_TREE, const_ptr_type_node,
2793 tree_cons (NULL_TREE, const_ptr_type_node,
2794 tree_cons (NULL_TREE,
2798 void_ftype_ptr_int_int
2799 = build_function_type (void_type_node,
2800 tree_cons (NULL_TREE, ptr_type_node,
2801 tree_cons (NULL_TREE, integer_type_node,
2802 tree_cons (NULL_TREE,
2806 string_ftype_ptr_ptr /* strcpy prototype */
2807 = build_function_type (string_type_node,
2808 tree_cons (NULL_TREE, string_type_node,
2809 tree_cons (NULL_TREE,
2810 const_string_type_node,
2813 int_ftype_string_string /* strcmp prototype */
2814 = build_function_type (integer_type_node,
2815 tree_cons (NULL_TREE, const_string_type_node,
2816 tree_cons (NULL_TREE,
2817 const_string_type_node,
2820 strlen_ftype /* strlen prototype */
2821 = build_function_type (flag_traditional ? integer_type_node : sizetype,
2822 tree_cons (NULL_TREE, const_string_type_node,
2825 traditional_ptr_type_node
2826 = (flag_traditional ? string_type_node : ptr_type_node);
2828 memcpy_ftype /* memcpy prototype */
2829 = build_function_type (traditional_ptr_type_node,
2830 tree_cons (NULL_TREE, ptr_type_node,
2831 tree_cons (NULL_TREE, const_ptr_type_node,
2832 tree_cons (NULL_TREE,
2836 builtin_function ("__builtin_constant_p", int_ftype_int,
2837 BUILT_IN_CONSTANT_P, NULL_PTR);
2839 builtin_function ("__builtin_return_address",
2840 build_function_type (ptr_type_node,
2841 tree_cons (NULL_TREE,
2844 BUILT_IN_RETURN_ADDRESS, NULL_PTR);
2846 builtin_function ("__builtin_frame_address",
2847 build_function_type (ptr_type_node,
2848 tree_cons (NULL_TREE,
2851 BUILT_IN_FRAME_ADDRESS, NULL_PTR);
2853 builtin_function ("__builtin_alloca",
2854 build_function_type (ptr_type_node,
2855 tree_cons (NULL_TREE,
2858 BUILT_IN_ALLOCA, "alloca");
2859 builtin_function ("__builtin_ffs", int_ftype_int, BUILT_IN_FFS, NULL_PTR);
2860 /* Define alloca, ffs as builtins.
2861 Declare _exit just to mark it as volatile. */
2862 if (! flag_no_builtin && !flag_no_nonansi_builtin)
2864 temp = builtin_function ("alloca",
2865 build_function_type (ptr_type_node,
2866 tree_cons (NULL_TREE,
2869 BUILT_IN_ALLOCA, NULL_PTR);
2870 /* Suppress error if redefined as a non-function. */
2871 DECL_BUILT_IN_NONANSI (temp) = 1;
2872 temp = builtin_function ("ffs", int_ftype_int, BUILT_IN_FFS, NULL_PTR);
2873 /* Suppress error if redefined as a non-function. */
2874 DECL_BUILT_IN_NONANSI (temp) = 1;
2875 temp = builtin_function ("_exit", void_ftype_any, NOT_BUILT_IN,
2877 TREE_THIS_VOLATILE (temp) = 1;
2878 TREE_SIDE_EFFECTS (temp) = 1;
2879 /* Suppress error if redefined as a non-function. */
2880 DECL_BUILT_IN_NONANSI (temp) = 1;
2883 builtin_function ("__builtin_abs", int_ftype_int, BUILT_IN_ABS, NULL_PTR);
2884 builtin_function ("__builtin_fabs", double_ftype_double, BUILT_IN_FABS,
2886 builtin_function ("__builtin_labs", long_ftype_long, BUILT_IN_LABS,
2888 builtin_function ("__builtin_saveregs",
2889 build_function_type (ptr_type_node, NULL_TREE),
2890 BUILT_IN_SAVEREGS, NULL_PTR);
2891 /* EXPAND_BUILTIN_VARARGS is obsolete. */
2893 builtin_function ("__builtin_varargs",
2894 build_function_type (ptr_type_node,
2895 tree_cons (NULL_TREE,
2898 BUILT_IN_VARARGS, NULL_PTR);
2900 builtin_function ("__builtin_classify_type", default_function_type,
2901 BUILT_IN_CLASSIFY_TYPE, NULL_PTR);
2902 builtin_function ("__builtin_next_arg",
2903 build_function_type (ptr_type_node, endlink),
2904 BUILT_IN_NEXT_ARG, NULL_PTR);
2905 builtin_function ("__builtin_args_info",
2906 build_function_type (integer_type_node,
2907 tree_cons (NULL_TREE,
2910 BUILT_IN_ARGS_INFO, NULL_PTR);
2912 /* Currently under experimentation. */
2913 builtin_function ("__builtin_memcpy", memcpy_ftype,
2914 BUILT_IN_MEMCPY, "memcpy");
2915 builtin_function ("__builtin_memcmp", int_ftype_cptr_cptr_sizet,
2916 BUILT_IN_MEMCMP, "memcmp");
2917 builtin_function ("__builtin_strcmp", int_ftype_string_string,
2918 BUILT_IN_STRCMP, "strcmp");
2919 builtin_function ("__builtin_strcpy", string_ftype_ptr_ptr,
2920 BUILT_IN_STRCPY, "strcpy");
2921 builtin_function ("__builtin_strlen", strlen_ftype,
2922 BUILT_IN_STRLEN, "strlen");
2923 builtin_function ("__builtin_fsqrt", double_ftype_double,
2924 BUILT_IN_FSQRT, "sqrt");
2925 builtin_function ("__builtin_sin", double_ftype_double,
2926 BUILT_IN_SIN, "sin");
2927 builtin_function ("__builtin_cos", double_ftype_double,
2928 BUILT_IN_COS, "cos");
2930 /* In an ANSI C program, it is okay to supply built-in meanings
2931 for these functions, since applications cannot validly use them
2932 with any other meaning.
2933 However, honor the -fno-builtin option. */
2934 if (!flag_no_builtin)
2936 builtin_function ("abs", int_ftype_int, BUILT_IN_ABS, NULL_PTR);
2937 builtin_function ("fabs", double_ftype_double, BUILT_IN_FABS, NULL_PTR);
2938 builtin_function ("labs", long_ftype_long, BUILT_IN_LABS, NULL_PTR);
2939 builtin_function ("memcpy", memcpy_ftype, BUILT_IN_MEMCPY, NULL_PTR);
2940 builtin_function ("memcmp", int_ftype_cptr_cptr_sizet, BUILT_IN_MEMCMP,
2942 builtin_function ("strcmp", int_ftype_string_string, BUILT_IN_STRCMP,
2944 builtin_function ("strcpy", string_ftype_ptr_ptr, BUILT_IN_STRCPY,
2946 builtin_function ("strlen", strlen_ftype, BUILT_IN_STRLEN, NULL_PTR);
2947 builtin_function ("sqrt", double_ftype_double, BUILT_IN_FSQRT, NULL_PTR);
2948 builtin_function ("sin", double_ftype_double, BUILT_IN_SIN, NULL_PTR);
2949 builtin_function ("cos", double_ftype_double, BUILT_IN_COS, NULL_PTR);
2951 /* Declare these functions volatile
2952 to avoid spurious "control drops through" warnings. */
2953 /* Don't specify the argument types, to avoid errors
2954 from certain code which isn't valid in ANSI but which exists. */
2955 temp = builtin_function ("abort", void_ftype_any, NOT_BUILT_IN,
2957 TREE_THIS_VOLATILE (temp) = 1;
2958 TREE_SIDE_EFFECTS (temp) = 1;
2959 temp = builtin_function ("exit", void_ftype_any, NOT_BUILT_IN, NULL_PTR);
2960 TREE_THIS_VOLATILE (temp) = 1;
2961 TREE_SIDE_EFFECTS (temp) = 1;
2965 /* Support for these has not been written in either expand_builtin
2966 or build_function_call. */
2967 builtin_function ("__builtin_div", default_ftype, BUILT_IN_DIV, NULL_PTR);
2968 builtin_function ("__builtin_ldiv", default_ftype, BUILT_IN_LDIV, NULL_PTR);
2969 builtin_function ("__builtin_ffloor", double_ftype_double, BUILT_IN_FFLOOR,
2971 builtin_function ("__builtin_fceil", double_ftype_double, BUILT_IN_FCEIL,
2973 builtin_function ("__builtin_fmod", double_ftype_double_double,
2974 BUILT_IN_FMOD, NULL_PTR);
2975 builtin_function ("__builtin_frem", double_ftype_double_double,
2976 BUILT_IN_FREM, NULL_PTR);
2977 builtin_function ("__builtin_memset", ptr_ftype_ptr_int_int,
2978 BUILT_IN_MEMSET, NULL_PTR);
2979 builtin_function ("__builtin_getexp", double_ftype_double, BUILT_IN_GETEXP,
2981 builtin_function ("__builtin_getman", double_ftype_double, BUILT_IN_GETMAN,
2985 /* Create the global bindings for __FUNCTION__ and __PRETTY_FUNCTION__. */
2986 declare_function_name ();
2988 start_identifier_warnings ();
2990 init_format_info_table ();
2995 /* Return a definition for a builtin function named NAME and whose data type
2996 is TYPE. TYPE should be a function type with argument types.
2997 FUNCTION_CODE tells later passes how to compile calls to this function.
2998 See tree.h for its possible values.
3000 If LIBRARY_NAME is nonzero, use that for DECL_ASSEMBLER_NAME,
3001 the name to be called if we can't opencode the function. */
3004 builtin_function (name, type, function_code, library_name)
3007 enum built_in_function function_code;
3010 tree decl = build_decl (FUNCTION_DECL, get_identifier (name), type);
3011 DECL_EXTERNAL (decl) = 1;
3012 TREE_PUBLIC (decl) = 1;
3013 /* If -traditional, permit redefining a builtin function any way you like.
3014 (Though really, if the program redefines these functions,
3015 it probably won't work right unless compiled with -fno-builtin.) */
3016 if (flag_traditional && name[0] != '_')
3017 DECL_BUILT_IN_NONANSI (decl) = 1;
3019 DECL_ASSEMBLER_NAME (decl) = get_identifier (library_name);
3020 make_decl_rtl (decl, NULL_PTR, 1);
3022 if (function_code != NOT_BUILT_IN)
3024 DECL_BUILT_IN (decl) = 1;
3025 DECL_SET_FUNCTION_CODE (decl, function_code);
3027 /* Warn if a function in the namespace for users
3028 is used without an occasion to consider it declared. */
3029 if (name[0] != '_' || name[1] != '_')
3030 C_DECL_ANTICIPATED (decl) = 1;
3035 /* Called when a declaration is seen that contains no names to declare.
3036 If its type is a reference to a structure, union or enum inherited
3037 from a containing scope, shadow that tag name for the current scope
3038 with a forward reference.
3039 If its type defines a new named structure or union
3040 or defines an enum, it is valid but we need not do anything here.
3041 Otherwise, it is an error. */
3044 shadow_tag (declspecs)
3047 shadow_tag_warned (declspecs, 0);
3051 shadow_tag_warned (declspecs, warned)
3058 pending_invalid_xref = 0;
3060 for (link = declspecs; link; link = TREE_CHAIN (link))
3062 register tree value = TREE_VALUE (link);
3063 register enum tree_code code = TREE_CODE (value);
3065 if (code == RECORD_TYPE || code == UNION_TYPE || code == ENUMERAL_TYPE)
3066 /* Used to test also that TYPE_SIZE (value) != 0.
3067 That caused warning for `struct foo;' at top level in the file. */
3069 register tree name = lookup_tag_reverse (value);
3076 if (!warned && code != ENUMERAL_TYPE) /* Empty unnamed enum OK */
3078 pedwarn ("unnamed struct/union that defines no instances");
3084 t = lookup_tag (code, name, current_binding_level, 1);
3088 t = make_node (code);
3096 pedwarn ("useless keyword or type name in empty declaration");
3104 error ("two types specified in one empty declaration");
3106 pedwarn ("empty declaration");
3110 /* Decode a "typename", such as "int **", returning a ..._TYPE node. */
3113 groktypename (typename)
3116 if (TREE_CODE (typename) != TREE_LIST)
3118 return grokdeclarator (TREE_VALUE (typename),
3119 TREE_PURPOSE (typename),
3123 /* Return a PARM_DECL node for a given pair of specs and declarator. */
3126 groktypename_in_parm_context (typename)
3129 if (TREE_CODE (typename) != TREE_LIST)
3131 return grokdeclarator (TREE_VALUE (typename),
3132 TREE_PURPOSE (typename),
3136 /* Decode a declarator in an ordinary declaration or data definition.
3137 This is called as soon as the type information and variable name
3138 have been parsed, before parsing the initializer if any.
3139 Here we create the ..._DECL node, fill in its type,
3140 and put it on the list of decls for the current context.
3141 The ..._DECL node is returned as the value.
3143 Exception: for arrays where the length is not specified,
3144 the type is left null, to be filled in by `finish_decl'.
3146 Function definitions do not come here; they go to start_function
3147 instead. However, external and forward declarations of functions
3148 do go through here. Structure field declarations are done by
3149 grokfield and not through here. */
3151 /* Set this to zero to debug not using the temporary obstack
3152 to parse initializers. */
3153 int debug_temp_inits = 1;
3156 start_decl (declarator, declspecs, initialized)
3157 tree declarator, declspecs;
3160 register tree decl = grokdeclarator (declarator, declspecs,
3161 NORMAL, initialized);
3163 int init_written = initialized;
3165 /* The corresponding pop_obstacks is in finish_decl. */
3166 push_obstacks_nochange ();
3169 /* Is it valid for this decl to have an initializer at all?
3170 If not, set INITIALIZED to zero, which will indirectly
3171 tell `finish_decl' to ignore the initializer once it is parsed. */
3172 switch (TREE_CODE (decl))
3175 /* typedef foo = bar means give foo the same type as bar.
3176 We haven't parsed bar yet, so `finish_decl' will fix that up.
3177 Any other case of an initialization in a TYPE_DECL is an error. */
3178 if (pedantic || list_length (declspecs) > 1)
3180 error ("typedef `%s' is initialized",
3181 IDENTIFIER_POINTER (DECL_NAME (decl)));
3187 error ("function `%s' is initialized like a variable",
3188 IDENTIFIER_POINTER (DECL_NAME (decl)));
3193 /* DECL_INITIAL in a PARM_DECL is really DECL_ARG_TYPE. */
3194 error ("parameter `%s' is initialized",
3195 IDENTIFIER_POINTER (DECL_NAME (decl)));
3200 /* Don't allow initializations for incomplete types
3201 except for arrays which might be completed by the initialization. */
3202 if (TYPE_SIZE (TREE_TYPE (decl)) != 0)
3204 /* A complete type is ok if size is fixed. */
3206 if (TREE_CODE (TYPE_SIZE (TREE_TYPE (decl))) != INTEGER_CST
3207 || C_DECL_VARIABLE_SIZE (decl))
3209 error ("variable-sized object may not be initialized");
3213 else if (TREE_CODE (TREE_TYPE (decl)) != ARRAY_TYPE)
3215 error ("variable `%s' has initializer but incomplete type",
3216 IDENTIFIER_POINTER (DECL_NAME (decl)));
3219 else if (TYPE_SIZE (TREE_TYPE (TREE_TYPE (decl))) == 0)
3221 error ("elements of array `%s' have incomplete type",
3222 IDENTIFIER_POINTER (DECL_NAME (decl)));
3229 #if 0 /* Seems redundant with grokdeclarator. */
3230 if (current_binding_level != global_binding_level
3231 && DECL_EXTERNAL (decl)
3232 && TREE_CODE (decl) != FUNCTION_DECL)
3233 warning ("declaration of `%s' has `extern' and is initialized",
3234 IDENTIFIER_POINTER (DECL_NAME (decl)));
3236 DECL_EXTERNAL (decl) = 0;
3237 if (current_binding_level == global_binding_level)
3238 TREE_STATIC (decl) = 1;
3240 /* Tell `pushdecl' this is an initialized decl
3241 even though we don't yet have the initializer expression.
3242 Also tell `finish_decl' it may store the real initializer. */
3243 DECL_INITIAL (decl) = error_mark_node;
3246 /* If this is a function declaration, write a record describing it to the
3247 prototypes file (if requested). */
3249 if (TREE_CODE (decl) == FUNCTION_DECL)
3250 gen_aux_info_record (decl, 0, 0, TYPE_ARG_TYPES (TREE_TYPE (decl)) != 0);
3252 /* Add this decl to the current binding level.
3253 TEM may equal DECL or it may be a previous decl of the same name. */
3254 tem = pushdecl (decl);
3256 /* For a local variable, define the RTL now. */
3257 if (current_binding_level != global_binding_level
3258 /* But not if this is a duplicate decl
3259 and we preserved the rtl from the previous one
3260 (which may or may not happen). */
3261 && DECL_RTL (tem) == 0)
3263 if (TYPE_SIZE (TREE_TYPE (tem)) != 0)
3265 else if (TREE_CODE (TREE_TYPE (tem)) == ARRAY_TYPE
3266 && DECL_INITIAL (tem) != 0)
3272 /* When parsing and digesting the initializer,
3273 use temporary storage. Do this even if we will ignore the value. */
3274 if (current_binding_level == global_binding_level && debug_temp_inits)
3275 temporary_allocation ();
3281 /* Finish processing of a declaration;
3282 install its initial value.
3283 If the length of an array type is not known before,
3284 it must be determined now, from the initial value, or it is an error. */
3287 finish_decl (decl, init, asmspec_tree)
3291 register tree type = TREE_TYPE (decl);
3292 int was_incomplete = (DECL_SIZE (decl) == 0);
3293 int temporary = allocation_temporary_p ();
3297 asmspec = TREE_STRING_POINTER (asmspec_tree);
3299 /* If `start_decl' didn't like having an initialization, ignore it now. */
3301 if (init != 0 && DECL_INITIAL (decl) == 0)
3303 /* Don't crash if parm is initialized. */
3304 if (TREE_CODE (decl) == PARM_DECL)
3307 if (ITERATOR_P (decl))
3310 error_with_decl (decl, "iterator has no initial value");
3312 init = save_expr (init);
3317 if (TREE_CODE (decl) != TYPE_DECL)
3318 store_init_value (decl, init);
3321 /* typedef foo = bar; store the type of bar as the type of foo. */
3322 TREE_TYPE (decl) = TREE_TYPE (init);
3323 DECL_INITIAL (decl) = init = 0;
3327 /* Pop back to the obstack that is current for this binding level.
3328 This is because MAXINDEX, rtl, etc. to be made below
3329 must go in the permanent obstack. But don't discard the
3330 temporary data yet. */
3332 #if 0 /* pop_obstacks was near the end; this is what was here. */
3333 if (current_binding_level == global_binding_level && temporary)
3334 end_temporary_allocation ();
3337 /* Deduce size of array from initialization, if not already known */
3339 if (TREE_CODE (type) == ARRAY_TYPE
3340 && TYPE_DOMAIN (type) == 0
3341 && TREE_CODE (decl) != TYPE_DECL)
3344 = (TREE_STATIC (decl)
3345 /* Even if pedantic, an external linkage array
3346 may have incomplete type at first. */
3347 ? pedantic && !TREE_PUBLIC (decl)
3348 : !DECL_EXTERNAL (decl));
3350 = complete_array_type (type, DECL_INITIAL (decl), do_default);
3352 /* Get the completed type made by complete_array_type. */
3353 type = TREE_TYPE (decl);
3356 error_with_decl (decl, "initializer fails to determine size of `%s'");
3361 error_with_decl (decl, "array size missing in `%s'");
3362 else if (!pedantic && TREE_STATIC (decl))
3363 /* ??? Perhaps should set TREE_PUBLIC here? */
3364 DECL_EXTERNAL (decl) = 1;
3367 if (pedantic && TYPE_DOMAIN (type) != 0
3368 && tree_int_cst_lt (TYPE_MAX_VALUE (TYPE_DOMAIN (type)),
3370 error_with_decl (decl, "zero-size array `%s'");
3372 layout_decl (decl, 0);
3375 if (TREE_CODE (decl) == VAR_DECL)
3377 if (DECL_SIZE (decl) == 0
3378 && (TREE_STATIC (decl)
3380 /* A static variable with an incomplete type
3381 is an error if it is initialized or `static'.
3382 Otherwise, let it through, but if it is not `extern'
3383 then it may cause an error message later. */
3384 !TREE_PUBLIC (decl) || DECL_INITIAL (decl)
3386 /* An automatic variable with an incomplete type
3388 !DECL_EXTERNAL (decl)))
3390 error_with_decl (decl, "storage size of `%s' isn't known");
3391 TREE_TYPE (decl) = error_mark_node;
3394 if ((DECL_EXTERNAL (decl) || TREE_STATIC (decl))
3395 && DECL_SIZE (decl) != 0)
3397 if (TREE_CODE (DECL_SIZE (decl)) == INTEGER_CST)
3398 constant_expression_warning (DECL_SIZE (decl));
3400 error_with_decl (decl, "storage size of `%s' isn't constant");
3404 /* Output the assembler code and/or RTL code for variables and functions,
3405 unless the type is an undefined structure or union.
3406 If not, it will get done when the type is completed. */
3408 if (TREE_CODE (decl) == VAR_DECL || TREE_CODE (decl) == FUNCTION_DECL)
3410 if (flag_traditional && allocation_temporary_p ())
3412 push_obstacks_nochange ();
3413 end_temporary_allocation ();
3414 /* This is a no-op in c-lang.c or something real in objc-actions.c. */
3415 maybe_objc_check_decl (decl);
3416 rest_of_decl_compilation (decl, asmspec,
3417 current_binding_level == global_binding_level,
3423 /* This is a no-op in c-lang.c or something real in objc-actions.c. */
3424 maybe_objc_check_decl (decl);
3425 rest_of_decl_compilation (decl, asmspec,
3426 current_binding_level == global_binding_level,
3429 if (current_binding_level != global_binding_level)
3431 /* Recompute the RTL of a local array now
3432 if it used to be an incomplete type. */
3434 && ! TREE_STATIC (decl) && ! DECL_EXTERNAL (decl))
3436 /* If we used it already as memory, it must stay in memory. */
3437 TREE_ADDRESSABLE (decl) = TREE_USED (decl);
3438 /* If it's still incomplete now, no init will save it. */
3439 if (DECL_SIZE (decl) == 0)
3440 DECL_INITIAL (decl) = 0;
3443 /* Compute and store the initial value. */
3444 if (TREE_CODE (decl) != FUNCTION_DECL)
3445 expand_decl_init (decl);
3449 if (TREE_CODE (decl) == TYPE_DECL)
3451 /* This is a no-op in c-lang.c or something real in objc-actions.c. */
3452 maybe_objc_check_decl (decl);
3453 rest_of_decl_compilation (decl, NULL_PTR,
3454 current_binding_level == global_binding_level,
3458 /* ??? After 2.3, test (init != 0) instead of TREE_CODE. */
3459 if (!(TREE_CODE (decl) == FUNCTION_DECL && DECL_INLINE (decl))
3460 && temporary && TREE_PERMANENT (decl))
3462 /* We need to remember that this array HAD an initialization,
3463 but discard the actual temporary nodes,
3464 since we can't have a permanent node keep pointing to them. */
3465 /* We make an exception for inline functions, since it's
3466 normal for a local extern redeclaration of an inline function
3467 to have a copy of the top-level decl's DECL_INLINE. */
3468 if (DECL_INITIAL (decl) != 0)
3469 DECL_INITIAL (decl) = error_mark_node;
3473 /* Resume permanent allocation, if not within a function. */
3474 /* The corresponding push_obstacks_nochange is in start_decl,
3475 and in push_parm_decl and in grokfield. */
3479 /* If we have gone back from temporary to permanent allocation,
3480 actually free the temporary space that we no longer need. */
3481 if (temporary && !allocation_temporary_p ())
3482 permanent_allocation ();
3484 /* At the end of a declaration, throw away any variable type sizes
3485 of types defined inside that declaration. There is no use
3486 computing them in the following function definition. */
3487 if (current_binding_level == global_binding_level)
3488 get_pending_sizes ();
3491 /* If DECL has a cleanup, build and return that cleanup here.
3492 This is a callback called by expand_expr. */
3495 maybe_build_cleanup (decl)
3498 /* There are no cleanups in C. */
3502 /* Given a parsed parameter declaration,
3503 decode it into a PARM_DECL and push that on the current binding level.
3504 Also, for the sake of forward parm decls,
3505 record the given order of parms in `parm_order'. */
3508 push_parm_decl (parm)
3512 int old_immediate_size_expand = immediate_size_expand;
3513 /* Don't try computing parm sizes now -- wait till fn is called. */
3514 immediate_size_expand = 0;
3516 /* The corresponding pop_obstacks is in finish_decl. */
3517 push_obstacks_nochange ();
3519 decl = grokdeclarator (TREE_VALUE (parm), TREE_PURPOSE (parm), PARM, 0);
3520 if (DECL_NAME (decl))
3522 olddecl = lookup_name (DECL_NAME (decl));
3523 if (pedantic && olddecl != 0 && TREE_CODE (olddecl) == TYPE_DECL)
3524 pedwarn_with_decl (decl, "ANSI C forbids parameter `%s' shadowing typedef");
3526 decl = pushdecl (decl);
3528 immediate_size_expand = old_immediate_size_expand;
3530 current_binding_level->parm_order
3531 = tree_cons (NULL_TREE, decl, current_binding_level->parm_order);
3533 /* Add this decl to the current binding level. */
3534 finish_decl (decl, NULL_TREE, NULL_TREE);
3537 /* Clear the given order of parms in `parm_order'.
3538 Used at start of parm list,
3539 and also at semicolon terminating forward decls. */
3544 current_binding_level->parm_order = NULL_TREE;
3547 /* Make TYPE a complete type based on INITIAL_VALUE.
3548 Return 0 if successful, 1 if INITIAL_VALUE can't be deciphered,
3549 2 if there was no information (in which case assume 1 if DO_DEFAULT). */
3552 complete_array_type (type, initial_value, do_default)
3557 register tree maxindex = NULL_TREE;
3562 /* Note MAXINDEX is really the maximum index,
3563 one less than the size. */
3564 if (TREE_CODE (initial_value) == STRING_CST)
3567 = int_size_in_bytes (TREE_TYPE (TREE_TYPE (initial_value)));
3568 maxindex = build_int_2 (TREE_STRING_LENGTH (initial_value) / eltsize - 1, 0);
3570 else if (TREE_CODE (initial_value) == CONSTRUCTOR)
3573 = list_length (CONSTRUCTOR_ELTS (initial_value));
3574 maxindex = build_int_2 (nelts - 1, 0);
3578 /* Make an error message unless that happened already. */
3579 if (initial_value != error_mark_node)
3582 /* Prevent further error messages. */
3583 maxindex = build_int_2 (1, 0);
3590 maxindex = build_int_2 (1, 0);
3596 TYPE_DOMAIN (type) = build_index_type (maxindex);
3597 if (!TREE_TYPE (maxindex))
3598 TREE_TYPE (maxindex) = TYPE_DOMAIN (type);
3601 /* Lay out the type now that we can get the real answer. */
3608 /* Given declspecs and a declarator,
3609 determine the name and type of the object declared
3610 and construct a ..._DECL node for it.
3611 (In one case we can return a ..._TYPE node instead.
3612 For invalid input we sometimes return 0.)
3614 DECLSPECS is a chain of tree_list nodes whose value fields
3615 are the storage classes and type specifiers.
3617 DECL_CONTEXT says which syntactic context this declaration is in:
3618 NORMAL for most contexts. Make a VAR_DECL or FUNCTION_DECL or TYPE_DECL.
3619 FUNCDEF for a function definition. Like NORMAL but a few different
3620 error messages in each case. Return value may be zero meaning
3621 this definition is too screwy to try to parse.
3622 PARM for a parameter declaration (either within a function prototype
3623 or before a function body). Make a PARM_DECL, or return void_type_node.
3624 TYPENAME if for a typename (in a cast or sizeof).
3625 Don't make a DECL node; just return the ..._TYPE node.
3626 FIELD for a struct or union field; make a FIELD_DECL.
3627 BITFIELD for a field with specified width.
3628 INITIALIZED is 1 if the decl has an initializer.
3630 In the TYPENAME case, DECLARATOR is really an absolute declarator.
3631 It may also be so in the PARM case, for a prototype where the
3632 argument type is specified but not the name.
3634 This function is where the complicated C meanings of `static'
3635 and `extern' are interpreted. */
3638 grokdeclarator (declarator, declspecs, decl_context, initialized)
3641 enum decl_context decl_context;
3646 tree type = NULL_TREE;
3651 int explicit_int = 0;
3652 int explicit_char = 0;
3653 int defaulted_int = 0;
3654 tree typedef_decl = 0;
3656 tree typedef_type = 0;
3657 int funcdef_flag = 0;
3658 enum tree_code innermost_code = ERROR_MARK;
3660 int size_varies = 0;
3662 if (decl_context == BITFIELD)
3663 bitfield = 1, decl_context = FIELD;
3665 if (decl_context == FUNCDEF)
3666 funcdef_flag = 1, decl_context = NORMAL;
3668 push_obstacks_nochange ();
3670 if (flag_traditional && allocation_temporary_p ())
3671 end_temporary_allocation ();
3673 /* Look inside a declarator for the name being declared
3674 and get it as a string, for an error message. */
3676 register tree decl = declarator;
3680 switch (TREE_CODE (decl))
3685 innermost_code = TREE_CODE (decl);
3686 decl = TREE_OPERAND (decl, 0);
3689 case IDENTIFIER_NODE:
3690 name = IDENTIFIER_POINTER (decl);
3701 /* A function definition's declarator must have the form of
3702 a function declarator. */
3704 if (funcdef_flag && innermost_code != CALL_EXPR)
3707 /* Anything declared one level down from the top level
3708 must be one of the parameters of a function
3709 (because the body is at least two levels down). */
3711 /* If this looks like a function definition, make it one,
3712 even if it occurs where parms are expected.
3713 Then store_parm_decls will reject it and not use it as a parm. */
3714 if (decl_context == NORMAL && !funcdef_flag
3715 && current_binding_level->level_chain == global_binding_level)
3716 decl_context = PARM;
3718 /* Look through the decl specs and record which ones appear.
3719 Some typespecs are defined as built-in typenames.
3720 Others, the ones that are modifiers of other types,
3721 are represented by bits in SPECBITS: set the bits for
3722 the modifiers that appear. Storage class keywords are also in SPECBITS.
3724 If there is a typedef name or a type, store the type in TYPE.
3725 This includes builtin typedefs such as `int'.
3727 Set EXPLICIT_INT or EXPLICIT_CHAR if the type is `int' or `char'
3728 and did not come from a user typedef.
3730 Set LONGLONG if `long' is mentioned twice. */
3732 for (spec = declspecs; spec; spec = TREE_CHAIN (spec))
3735 register tree id = TREE_VALUE (spec);
3737 if (id == ridpointers[(int) RID_INT])
3739 if (id == ridpointers[(int) RID_CHAR])
3742 if (TREE_CODE (id) == IDENTIFIER_NODE)
3743 for (i = (int) RID_FIRST_MODIFIER; i < (int) RID_MAX; i++)
3745 if (ridpointers[i] == id)
3747 if (i == (int) RID_LONG && specbits & (1<<i))
3750 error ("`long long long' is too long for GCC");
3754 pedwarn ("ANSI C does not support `long long'");
3758 else if (specbits & (1 << i))
3759 pedwarn ("duplicate `%s'", IDENTIFIER_POINTER (id));
3765 error ("two or more data types in declaration of `%s'", name);
3766 /* Actual typedefs come to us as TYPE_DECL nodes. */
3767 else if (TREE_CODE (id) == TYPE_DECL)
3769 type = TREE_TYPE (id);
3772 /* Built-in types come as identifiers. */
3773 else if (TREE_CODE (id) == IDENTIFIER_NODE)
3775 register tree t = lookup_name (id);
3776 if (TREE_TYPE (t) == error_mark_node)
3778 else if (!t || TREE_CODE (t) != TYPE_DECL)
3779 error ("`%s' fails to be a typedef or built in type",
3780 IDENTIFIER_POINTER (id));
3783 type = TREE_TYPE (t);
3787 else if (TREE_CODE (id) != ERROR_MARK)
3793 typedef_type = type;
3795 size_varies = C_TYPE_VARIABLE_SIZE (type);
3797 /* No type at all: default to `int', and set DEFAULTED_INT
3798 because it was not a user-defined typedef. */
3802 if (funcdef_flag && warn_return_type
3803 && ! (specbits & ((1 << (int) RID_LONG) | (1 << (int) RID_SHORT)
3804 | (1 << (int) RID_SIGNED) | (1 << (int) RID_UNSIGNED))))
3805 warn_about_return_type = 1;
3807 type = integer_type_node;
3810 /* Now process the modifiers that were specified
3811 and check for invalid combinations. */
3813 /* Long double is a special combination. */
3815 if ((specbits & 1 << (int) RID_LONG)
3816 && TYPE_MAIN_VARIANT (type) == double_type_node)
3818 specbits &= ~ (1 << (int) RID_LONG);
3819 type = long_double_type_node;
3822 /* Check all other uses of type modifiers. */
3824 if (specbits & ((1 << (int) RID_LONG) | (1 << (int) RID_SHORT)
3825 | (1 << (int) RID_UNSIGNED) | (1 << (int) RID_SIGNED)))
3829 if (TREE_CODE (type) != INTEGER_TYPE)
3830 error ("long, short, signed or unsigned invalid for `%s'", name);
3831 else if ((specbits & 1 << (int) RID_LONG)
3832 && (specbits & 1 << (int) RID_SHORT))
3833 error ("long and short specified together for `%s'", name);
3834 else if (((specbits & 1 << (int) RID_LONG)
3835 || (specbits & 1 << (int) RID_SHORT))
3837 error ("long or short specified with char for `%s'", name);
3838 else if (((specbits & 1 << (int) RID_LONG)
3839 || (specbits & 1 << (int) RID_SHORT))
3840 && TREE_CODE (type) == REAL_TYPE)
3841 error ("long or short specified with floating type for `%s'", name);
3842 else if ((specbits & 1 << (int) RID_SIGNED)
3843 && (specbits & 1 << (int) RID_UNSIGNED))
3844 error ("signed and unsigned given together for `%s'", name);
3848 if (!explicit_int && !defaulted_int && !explicit_char && pedantic)
3850 pedwarn ("long, short, signed or unsigned used invalidly for `%s'",
3852 if (flag_pedantic_errors)
3857 /* Discard the type modifiers if they are invalid. */
3860 specbits &= ~((1 << (int) RID_LONG) | (1 << (int) RID_SHORT)
3861 | (1 << (int) RID_UNSIGNED) | (1 << (int) RID_SIGNED));
3866 /* Decide whether an integer type is signed or not.
3867 Optionally treat bitfields as signed by default. */
3868 if (specbits & 1 << (int) RID_UNSIGNED
3869 /* Traditionally, all bitfields are unsigned. */
3870 || (bitfield && flag_traditional
3871 && (! explicit_flag_signed_bitfields || !flag_signed_bitfields))
3872 || (bitfield && ! flag_signed_bitfields
3873 && (explicit_int || defaulted_int || explicit_char
3874 /* A typedef for plain `int' without `signed'
3875 can be controlled just like plain `int'. */
3876 || ! (typedef_decl != 0
3877 && C_TYPEDEF_EXPLICITLY_SIGNED (typedef_decl)))
3878 && TREE_CODE (type) != ENUMERAL_TYPE
3879 && !(specbits & 1 << (int) RID_SIGNED)))
3882 type = long_long_unsigned_type_node;
3883 else if (specbits & 1 << (int) RID_LONG)
3884 type = long_unsigned_type_node;
3885 else if (specbits & 1 << (int) RID_SHORT)
3886 type = short_unsigned_type_node;
3887 else if (type == char_type_node)
3888 type = unsigned_char_type_node;
3889 else if (typedef_decl)
3890 type = unsigned_type (type);
3892 type = unsigned_type_node;
3894 else if ((specbits & 1 << (int) RID_SIGNED)
3895 && type == char_type_node)
3896 type = signed_char_type_node;
3898 type = long_long_integer_type_node;
3899 else if (specbits & 1 << (int) RID_LONG)
3900 type = long_integer_type_node;
3901 else if (specbits & 1 << (int) RID_SHORT)
3902 type = short_integer_type_node;
3903 else if (specbits & 1 << (int) RID_COMPLEX)
3906 type = complex_double_type_node;
3907 else if (type == integer_type_node)
3908 type = complex_integer_type_node;
3909 else if (type == float_type_node)
3910 type = complex_float_type_node;
3911 else if (type == double_type_node)
3912 type = complex_double_type_node;
3913 else if (type == long_double_type_node)
3914 type = complex_long_double_type_node;
3916 error ("invalid complex type");
3919 /* Set CONSTP if this declaration is `const', whether by
3920 explicit specification or via a typedef.
3921 Likewise for VOLATILEP. */
3923 constp = !! (specbits & 1 << (int) RID_CONST) + TYPE_READONLY (type);
3924 volatilep = !! (specbits & 1 << (int) RID_VOLATILE) + TYPE_VOLATILE (type);
3925 inlinep = !! (specbits & (1 << (int) RID_INLINE));
3927 pedwarn ("duplicate `const'");
3929 pedwarn ("duplicate `volatile'");
3930 if (! flag_gen_aux_info && (TYPE_READONLY (type) || TYPE_VOLATILE (type)))
3931 type = TYPE_MAIN_VARIANT (type);
3933 /* Warn if two storage classes are given. Default to `auto'. */
3938 if (specbits & 1 << (int) RID_AUTO) nclasses++;
3939 if (specbits & 1 << (int) RID_STATIC) nclasses++;
3940 if (specbits & 1 << (int) RID_EXTERN) nclasses++;
3941 if (specbits & 1 << (int) RID_REGISTER) nclasses++;
3942 if (specbits & 1 << (int) RID_TYPEDEF) nclasses++;
3943 if (specbits & 1 << (int) RID_ITERATOR) nclasses++;
3945 /* Warn about storage classes that are invalid for certain
3946 kinds of declarations (parameters, typenames, etc.). */
3949 error ("multiple storage classes in declaration of `%s'", name);
3950 else if (funcdef_flag
3952 & ((1 << (int) RID_REGISTER)
3953 | (1 << (int) RID_AUTO)
3954 | (1 << (int) RID_TYPEDEF))))
3956 if (specbits & 1 << (int) RID_AUTO
3957 && (pedantic || current_binding_level == global_binding_level))
3958 pedwarn ("function definition declared `auto'");
3959 if (specbits & 1 << (int) RID_REGISTER)
3960 error ("function definition declared `register'");
3961 if (specbits & 1 << (int) RID_TYPEDEF)
3962 error ("function definition declared `typedef'");
3963 specbits &= ~ ((1 << (int) RID_TYPEDEF) | (1 << (int) RID_REGISTER)
3964 | (1 << (int) RID_AUTO));
3966 else if (decl_context != NORMAL && nclasses > 0)
3968 if (decl_context == PARM && specbits & 1 << (int) RID_REGISTER)
3972 error ((decl_context == FIELD
3973 ? "storage class specified for structure field `%s'"
3974 : (decl_context == PARM
3975 ? "storage class specified for parameter `%s'"
3976 : "storage class specified for typename")),
3978 specbits &= ~ ((1 << (int) RID_TYPEDEF) | (1 << (int) RID_REGISTER)
3979 | (1 << (int) RID_AUTO) | (1 << (int) RID_STATIC)
3980 | (1 << (int) RID_EXTERN));
3983 else if (specbits & 1 << (int) RID_EXTERN && initialized && ! funcdef_flag)
3985 /* `extern' with initialization is invalid if not at top level. */
3986 if (current_binding_level == global_binding_level)
3987 warning ("`%s' initialized and declared `extern'", name);
3989 error ("`%s' has both `extern' and initializer", name);
3991 else if (specbits & 1 << (int) RID_EXTERN && funcdef_flag
3992 && current_binding_level != global_binding_level)
3993 error ("nested function `%s' declared `extern'", name);
3994 else if (current_binding_level == global_binding_level
3995 && specbits & (1 << (int) RID_AUTO))
3996 error ("top-level declaration of `%s' specifies `auto'", name);
3997 else if ((specbits & 1 << (int) RID_ITERATOR)
3998 && TREE_CODE (declarator) != IDENTIFIER_NODE)
4000 error ("iterator `%s' has derived type", name);
4001 type = error_mark_node;
4003 else if ((specbits & 1 << (int) RID_ITERATOR)
4004 && TREE_CODE (type) != INTEGER_TYPE)
4006 error ("iterator `%s' has noninteger type", name);
4007 type = error_mark_node;
4011 /* Now figure out the structure of the declarator proper.
4012 Descend through it, creating more complex types, until we reach
4013 the declared identifier (or NULL_TREE, in an absolute declarator). */
4015 while (declarator && TREE_CODE (declarator) != IDENTIFIER_NODE)
4017 if (type == error_mark_node)
4019 declarator = TREE_OPERAND (declarator, 0);
4023 /* Each level of DECLARATOR is either an ARRAY_REF (for ...[..]),
4024 an INDIRECT_REF (for *...),
4025 a CALL_EXPR (for ...(...)),
4026 an identifier (for the name being declared)
4027 or a null pointer (for the place in an absolute declarator
4028 where the name was omitted).
4029 For the last two cases, we have just exited the loop.
4031 At this point, TYPE is the type of elements of an array,
4032 or for a function to return, or for a pointer to point to.
4033 After this sequence of ifs, TYPE is the type of the
4034 array or function or pointer, and DECLARATOR has had its
4035 outermost layer removed. */
4037 if (TREE_CODE (declarator) == ARRAY_REF)
4039 register tree itype = NULL_TREE;
4040 register tree size = TREE_OPERAND (declarator, 1);
4041 /* An uninitialized decl with `extern' is a reference. */
4042 int extern_ref = !initialized && (specbits & (1 << (int) RID_EXTERN));
4044 declarator = TREE_OPERAND (declarator, 0);
4046 /* Check for some types that there cannot be arrays of. */
4048 if (TYPE_MAIN_VARIANT (type) == void_type_node)
4050 error ("declaration of `%s' as array of voids", name);
4051 type = error_mark_node;
4054 if (TREE_CODE (type) == FUNCTION_TYPE)
4056 error ("declaration of `%s' as array of functions", name);
4057 type = error_mark_node;
4060 if (size == error_mark_node)
4061 type = error_mark_node;
4063 if (type == error_mark_node)
4066 /* If this is a block level extern, it must live past the end
4067 of the function so that we can check it against other extern
4068 declarations (IDENTIFIER_LIMBO_VALUE). */
4069 if (extern_ref && allocation_temporary_p ())
4070 end_temporary_allocation ();
4072 /* If size was specified, set ITYPE to a range-type for that size.
4073 Otherwise, ITYPE remains null. finish_decl may figure it out
4074 from an initial value. */
4078 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
4079 STRIP_TYPE_NOPS (size);
4081 if (TREE_CODE (TREE_TYPE (size)) != INTEGER_TYPE
4082 && TREE_CODE (TREE_TYPE (size)) != ENUMERAL_TYPE)
4084 error ("size of array `%s' has non-integer type", name);
4085 size = integer_one_node;
4087 if (pedantic && integer_zerop (size))
4088 pedwarn ("ANSI C forbids zero-size array `%s'", name);
4089 if (TREE_CODE (size) == INTEGER_CST)
4091 constant_expression_warning (size);
4092 if (INT_CST_LT (size, integer_zero_node))
4094 error ("size of array `%s' is negative", name);
4095 size = integer_one_node;
4097 itype = build_index_type (size_binop (MINUS_EXPR, size,
4104 if (TREE_CONSTANT (size))
4105 pedwarn ("ANSI C forbids array `%s' whose size can't be evaluated", name);
4107 pedwarn ("ANSI C forbids variable-size array `%s'", name);
4109 itype = build_binary_op (MINUS_EXPR, size, integer_one_node,
4111 /* Make sure the array size remains visibly nonconstant
4112 even if it is (eg) a const variable with known value. */
4114 itype = variable_size (itype);
4115 itype = build_index_type (itype);
4119 #if 0 /* This had bad results for pointers to arrays, as in
4120 union incomplete (*foo)[4]; */
4121 /* Complain about arrays of incomplete types, except in typedefs. */
4123 if (TYPE_SIZE (type) == 0
4124 /* Avoid multiple warnings for nested array types. */
4125 && TREE_CODE (type) != ARRAY_TYPE
4126 && !(specbits & (1 << (int) RID_TYPEDEF))
4127 && !C_TYPE_BEING_DEFINED (type))
4128 warning ("array type has incomplete element type");
4131 /* Build the array type itself.
4132 Merge any constancy or volatility into the target type. */
4134 #if 0 /* We shouldn't have a function type here at all!
4135 Functions aren't allowed as array elements. */
4136 if (pedantic && TREE_CODE (type) == FUNCTION_TYPE
4137 && (constp || volatilep))
4138 pedwarn ("ANSI C forbids const or volatile function types");
4140 if (constp || volatilep)
4141 type = c_build_type_variant (type, constp, volatilep);
4143 #if 0 /* don't clear these; leave them set so that the array type
4144 or the variable is itself const or volatile. */
4149 type = build_array_type (type, itype);
4151 C_TYPE_VARIABLE_SIZE (type) = 1;
4153 else if (TREE_CODE (declarator) == CALL_EXPR)
4155 int extern_ref = (!(specbits & (1 << (int) RID_AUTO))
4156 || current_binding_level == global_binding_level);
4159 /* Declaring a function type.
4160 Make sure we have a valid type for the function to return. */
4161 if (type == error_mark_node)
4166 /* Warn about some types functions can't return. */
4168 if (TREE_CODE (type) == FUNCTION_TYPE)
4170 error ("`%s' declared as function returning a function", name);
4171 type = integer_type_node;
4173 if (TREE_CODE (type) == ARRAY_TYPE)
4175 error ("`%s' declared as function returning an array", name);
4176 type = integer_type_node;
4179 #ifndef TRADITIONAL_RETURN_FLOAT
4180 /* Traditionally, declaring return type float means double. */
4182 if (flag_traditional && TYPE_MAIN_VARIANT (type) == float_type_node)
4183 type = double_type_node;
4184 #endif /* TRADITIONAL_RETURN_FLOAT */
4186 /* If this is a block level extern, it must live past the end
4187 of the function so that we can check it against other extern
4188 declarations (IDENTIFIER_LIMBO_VALUE). */
4189 if (extern_ref && allocation_temporary_p ())
4190 end_temporary_allocation ();
4192 /* Construct the function type and go to the next
4193 inner layer of declarator. */
4195 arg_types = grokparms (TREE_OPERAND (declarator, 1),
4197 /* Say it's a definition
4198 only for the CALL_EXPR
4199 closest to the identifier. */
4200 && TREE_CODE (TREE_OPERAND (declarator, 0)) == IDENTIFIER_NODE);
4201 #if 0 /* This seems to be false. We turn off temporary allocation
4202 above in this function if -traditional.
4203 And this code caused inconsistent results with prototypes:
4204 callers would ignore them, and pass arguments wrong. */
4206 /* Omit the arg types if -traditional, since the arg types
4207 and the list links might not be permanent. */
4208 type = build_function_type (type,
4210 ? NULL_TREE : arg_types);
4212 type = build_function_type (type, arg_types);
4213 declarator = TREE_OPERAND (declarator, 0);
4215 /* Set the TYPE_CONTEXTs for each tagged type which is local to
4216 the formal parameter list of this FUNCTION_TYPE to point to
4217 the FUNCTION_TYPE node itself. */
4222 for (link = current_function_parm_tags;
4224 link = TREE_CHAIN (link))
4225 TYPE_CONTEXT (TREE_VALUE (link)) = type;
4228 else if (TREE_CODE (declarator) == INDIRECT_REF)
4230 /* Merge any constancy or volatility into the target type
4233 if (pedantic && TREE_CODE (type) == FUNCTION_TYPE
4234 && (constp || volatilep))
4235 pedwarn ("ANSI C forbids const or volatile function types");
4236 if (constp || volatilep)
4237 type = c_build_type_variant (type, constp, volatilep);
4242 type = build_pointer_type (type);
4244 /* Process a list of type modifier keywords
4245 (such as const or volatile) that were given inside the `*'. */
4247 if (TREE_TYPE (declarator))
4249 register tree typemodlist;
4251 for (typemodlist = TREE_TYPE (declarator); typemodlist;
4252 typemodlist = TREE_CHAIN (typemodlist))
4254 if (TREE_VALUE (typemodlist) == ridpointers[(int) RID_CONST])
4256 else if (TREE_VALUE (typemodlist) == ridpointers[(int) RID_VOLATILE])
4261 error ("invalid type modifier within pointer declarator");
4265 pedwarn ("duplicate `const'");
4267 pedwarn ("duplicate `volatile'");
4270 declarator = TREE_OPERAND (declarator, 0);
4277 /* Now TYPE has the actual type. */
4279 /* If this is declaring a typedef name, return a TYPE_DECL. */
4281 if (specbits & (1 << (int) RID_TYPEDEF))
4284 /* Note that the grammar rejects storage classes
4285 in typenames, fields or parameters */
4286 if (pedantic && TREE_CODE (type) == FUNCTION_TYPE
4287 && (constp || volatilep))
4288 pedwarn ("ANSI C forbids const or volatile function types");
4289 if (constp || volatilep)
4290 type = c_build_type_variant (type, constp, volatilep);
4292 decl = build_decl (TYPE_DECL, declarator, type);
4293 if ((specbits & (1 << (int) RID_SIGNED))
4294 || (typedef_decl && C_TYPEDEF_EXPLICITLY_SIGNED (typedef_decl)))
4295 C_TYPEDEF_EXPLICITLY_SIGNED (decl) = 1;
4299 /* Detect the case of an array type of unspecified size
4300 which came, as such, direct from a typedef name.
4301 We must copy the type, so that each identifier gets
4302 a distinct type, so that each identifier's size can be
4303 controlled separately by its own initializer. */
4305 if (type != 0 && typedef_type != 0
4306 && TYPE_MAIN_VARIANT (type) == TYPE_MAIN_VARIANT (typedef_type)
4307 && TREE_CODE (type) == ARRAY_TYPE && TYPE_DOMAIN (type) == 0)
4309 type = build_array_type (TREE_TYPE (type), 0);
4311 C_TYPE_VARIABLE_SIZE (type) = 1;
4314 /* If this is a type name (such as, in a cast or sizeof),
4315 compute the type and return it now. */
4317 if (decl_context == TYPENAME)
4319 /* Note that the grammar rejects storage classes
4320 in typenames, fields or parameters */
4321 if (pedantic && TREE_CODE (type) == FUNCTION_TYPE
4322 && (constp || volatilep))
4323 pedwarn ("ANSI C forbids const or volatile function types");
4324 if (constp || volatilep)
4325 type = c_build_type_variant (type, constp, volatilep);
4330 /* `void' at top level (not within pointer)
4331 is allowed only in typedefs or type names.
4332 We don't complain about parms either, but that is because
4333 a better error message can be made later. */
4335 if (TYPE_MAIN_VARIANT (type) == void_type_node && decl_context != PARM)
4337 error ("variable or field `%s' declared void",
4338 IDENTIFIER_POINTER (declarator));
4339 type = integer_type_node;
4342 /* Now create the decl, which may be a VAR_DECL, a PARM_DECL
4343 or a FUNCTION_DECL, depending on DECL_CONTEXT and TYPE. */
4348 if (decl_context == PARM)
4350 tree type_as_written = type;
4353 /* A parameter declared as an array of T is really a pointer to T.
4354 One declared as a function is really a pointer to a function. */
4356 if (TREE_CODE (type) == ARRAY_TYPE)
4358 /* Transfer const-ness of array into that of type pointed to. */
4359 type = build_pointer_type
4360 (c_build_type_variant (TREE_TYPE (type), constp, volatilep));
4361 volatilep = constp = 0;
4364 else if (TREE_CODE (type) == FUNCTION_TYPE)
4366 if (pedantic && (constp || volatilep))
4367 pedwarn ("ANSI C forbids const or volatile function types");
4368 type = build_pointer_type (c_build_type_variant (type, constp, volatilep));
4369 volatilep = constp = 0;
4372 decl = build_decl (PARM_DECL, declarator, type);
4374 C_DECL_VARIABLE_SIZE (decl) = 1;
4376 /* Compute the type actually passed in the parmlist,
4377 for the case where there is no prototype.
4378 (For example, shorts and chars are passed as ints.)
4379 When there is a prototype, this is overridden later. */
4381 DECL_ARG_TYPE (decl) = type;
4382 main_type = TYPE_MAIN_VARIANT (type);
4383 if (main_type == float_type_node)
4384 DECL_ARG_TYPE (decl) = double_type_node;
4385 /* Don't use TYPE_PRECISION to decide whether to promote,
4386 because we should convert short if it's the same size as int,
4387 but we should not convert long if it's the same size as int. */
4388 else if (C_PROMOTING_INTEGER_TYPE_P (main_type))
4390 if (TYPE_PRECISION (type) == TYPE_PRECISION (integer_type_node)
4391 && TREE_UNSIGNED (type))
4392 DECL_ARG_TYPE (decl) = unsigned_type_node;
4394 DECL_ARG_TYPE (decl) = integer_type_node;
4397 DECL_ARG_TYPE_AS_WRITTEN (decl) = type_as_written;
4399 else if (decl_context == FIELD)
4401 /* Structure field. It may not be a function. */
4403 if (TREE_CODE (type) == FUNCTION_TYPE)
4405 error ("field `%s' declared as a function",
4406 IDENTIFIER_POINTER (declarator));
4407 type = build_pointer_type (type);
4409 else if (TREE_CODE (type) != ERROR_MARK && TYPE_SIZE (type) == 0)
4411 error ("field `%s' has incomplete type",
4412 IDENTIFIER_POINTER (declarator));
4413 type = error_mark_node;
4415 /* Move type qualifiers down to element of an array. */
4416 if (TREE_CODE (type) == ARRAY_TYPE && (constp || volatilep))
4418 type = build_array_type (c_build_type_variant (TREE_TYPE (type),
4420 TYPE_DOMAIN (type));
4421 #if 0 /* Leave the field const or volatile as well. */
4422 constp = volatilep = 0;
4425 decl = build_decl (FIELD_DECL, declarator, type);
4427 C_DECL_VARIABLE_SIZE (decl) = 1;
4429 else if (TREE_CODE (type) == FUNCTION_TYPE)
4431 /* Every function declaration is "external"
4432 except for those which are inside a function body
4433 in which `auto' is used.
4434 That is a case not specified by ANSI C,
4435 and we use it for forward declarations for nested functions. */
4436 int extern_ref = (!(specbits & (1 << (int) RID_AUTO))
4437 || current_binding_level == global_binding_level);
4439 if (specbits & (1 << (int) RID_AUTO)
4440 && (pedantic || current_binding_level == global_binding_level))
4441 pedwarn ("invalid storage class for function `%s'",
4442 IDENTIFIER_POINTER (declarator));
4443 if (specbits & (1 << (int) RID_REGISTER))
4444 error ("invalid storage class for function `%s'",
4445 IDENTIFIER_POINTER (declarator));
4446 /* Function declaration not at top level.
4447 Storage classes other than `extern' are not allowed
4448 and `extern' makes no difference. */
4449 if (current_binding_level != global_binding_level
4450 && (specbits & ((1 << (int) RID_STATIC) | (1 << (int) RID_INLINE)))
4452 pedwarn ("invalid storage class for function `%s'",
4453 IDENTIFIER_POINTER (declarator));
4455 /* If this is a block level extern, it must live past the end
4456 of the function so that we can check it against other
4457 extern declarations (IDENTIFIER_LIMBO_VALUE). */
4458 if (extern_ref && allocation_temporary_p ())
4459 end_temporary_allocation ();
4461 decl = build_decl (FUNCTION_DECL, declarator, type);
4463 if (pedantic && (constp || volatilep)
4464 && ! DECL_IN_SYSTEM_HEADER (decl))
4465 pedwarn ("ANSI C forbids const or volatile functions");
4468 DECL_EXTERNAL (decl) = 1;
4469 /* Record absence of global scope for `static' or `auto'. */
4471 = !(specbits & ((1 << (int) RID_STATIC) | (1 << (int) RID_AUTO)));
4472 /* Record presence of `inline', if it is reasonable. */
4475 tree last = tree_last (TYPE_ARG_TYPES (type));
4477 if (! strcmp (IDENTIFIER_POINTER (declarator), "main"))
4478 warning ("cannot inline function `main'");
4479 else if (last && (TYPE_MAIN_VARIANT (TREE_VALUE (last))
4481 warning ("inline declaration ignored for function with `...'");
4483 /* Assume that otherwise the function can be inlined. */
4484 DECL_INLINE (decl) = 1;
4486 if (specbits & (1 << (int) RID_EXTERN))
4487 current_extern_inline = 1;
4492 /* It's a variable. */
4493 /* An uninitialized decl with `extern' is a reference. */
4494 int extern_ref = !initialized && (specbits & (1 << (int) RID_EXTERN));
4496 /* Move type qualifiers down to element of an array. */
4497 if (TREE_CODE (type) == ARRAY_TYPE && (constp || volatilep))
4499 type = build_array_type (c_build_type_variant (TREE_TYPE (type),
4501 TYPE_DOMAIN (type));
4502 #if 0 /* Leave the variable const or volatile as well. */
4503 constp = volatilep = 0;
4507 /* If this is a block level extern, it must live past the end
4508 of the function so that we can check it against other
4509 extern declarations (IDENTIFIER_LIMBO_VALUE). */
4510 if (extern_ref && allocation_temporary_p ())
4511 end_temporary_allocation ();
4513 decl = build_decl (VAR_DECL, declarator, type);
4515 C_DECL_VARIABLE_SIZE (decl) = 1;
4518 pedwarn_with_decl (decl, "variable `%s' declared `inline'");
4520 DECL_EXTERNAL (decl) = extern_ref;
4521 /* At top level, the presence of a `static' or `register' storage
4522 class specifier, or the absence of all storage class specifiers
4523 makes this declaration a definition (perhaps tentative). Also,
4524 the absence of both `static' and `register' makes it public. */
4525 if (current_binding_level == global_binding_level)
4529 & ((1 << (int) RID_STATIC) | (1 << (int) RID_REGISTER)));
4530 TREE_STATIC (decl) = ! DECL_EXTERNAL (decl);
4532 /* Not at top level, only `static' makes a static definition. */
4535 TREE_STATIC (decl) = (specbits & (1 << (int) RID_STATIC)) != 0;
4536 TREE_PUBLIC (decl) = DECL_EXTERNAL (decl);
4539 if (specbits & 1 << (int) RID_ITERATOR)
4540 ITERATOR_P (decl) = 1;
4543 /* Record `register' declaration for warnings on &
4544 and in case doing stupid register allocation. */
4546 if (specbits & (1 << (int) RID_REGISTER))
4547 DECL_REGISTER (decl) = 1;
4549 /* Record constancy and volatility. */
4552 TREE_READONLY (decl) = 1;
4555 TREE_SIDE_EFFECTS (decl) = 1;
4556 TREE_THIS_VOLATILE (decl) = 1;
4558 /* If a type has volatile components, it should be stored in memory.
4559 Otherwise, the fact that those components are volatile
4560 will be ignored, and would even crash the compiler. */
4561 if (C_TYPE_FIELDS_VOLATILE (TREE_TYPE (decl)))
4562 mark_addressable (decl);
4570 /* Decode the parameter-list info for a function type or function definition.
4571 The argument is the value returned by `get_parm_info' (or made in parse.y
4572 if there is an identifier list instead of a parameter decl list).
4573 These two functions are separate because when a function returns
4574 or receives functions then each is called multiple times but the order
4575 of calls is different. The last call to `grokparms' is always the one
4576 that contains the formal parameter names of a function definition.
4578 Store in `last_function_parms' a chain of the decls of parms.
4579 Also store in `last_function_parm_tags' a chain of the struct, union,
4580 and enum tags declared among the parms.
4582 Return a list of arg types to use in the FUNCTION_TYPE for this function.
4584 FUNCDEF_FLAG is nonzero for a function definition, 0 for
4585 a mere declaration. A nonempty identifier-list gets an error message
4586 when FUNCDEF_FLAG is zero. */
4589 grokparms (parms_info, funcdef_flag)
4593 tree first_parm = TREE_CHAIN (parms_info);
4595 last_function_parms = TREE_PURPOSE (parms_info);
4596 last_function_parm_tags = TREE_VALUE (parms_info);
4598 if (warn_strict_prototypes && first_parm == 0 && !funcdef_flag
4599 && !in_system_header)
4600 warning ("function declaration isn't a prototype");
4603 && TREE_CODE (TREE_VALUE (first_parm)) == IDENTIFIER_NODE)
4606 pedwarn ("parameter names (without types) in function declaration");
4608 last_function_parms = first_parm;
4615 /* We no longer test FUNCDEF_FLAG.
4616 If the arg types are incomplete in a declaration,
4617 they must include undefined tags.
4618 These tags can never be defined in the scope of the declaration,
4619 so the types can never be completed,
4620 and no call can be compiled successfully. */
4622 /* In a fcn definition, arg types must be complete. */
4625 for (parm = last_function_parms, typelt = first_parm;
4627 parm = TREE_CHAIN (parm))
4628 /* Skip over any enumeration constants declared here. */
4629 if (TREE_CODE (parm) == PARM_DECL)
4631 /* Barf if the parameter itself has an incomplete type. */
4632 tree type = TREE_VALUE (typelt);
4633 if (TYPE_SIZE (type) == 0)
4635 if (funcdef_flag && DECL_NAME (parm) != 0)
4636 error ("parameter `%s' has incomplete type",
4637 IDENTIFIER_POINTER (DECL_NAME (parm)));
4639 warning ("parameter has incomplete type");
4642 TREE_VALUE (typelt) = error_mark_node;
4643 TREE_TYPE (parm) = error_mark_node;
4646 #if 0 /* This has been replaced by parm_tags_warning
4647 which uses a more accurate criterion for what to warn about. */
4650 /* Now warn if is a pointer to an incomplete type. */
4651 while (TREE_CODE (type) == POINTER_TYPE
4652 || TREE_CODE (type) == REFERENCE_TYPE)
4653 type = TREE_TYPE (type);
4654 type = TYPE_MAIN_VARIANT (type);
4655 if (TYPE_SIZE (type) == 0)
4657 if (DECL_NAME (parm) != 0)
4658 warning ("parameter `%s' points to incomplete type",
4659 IDENTIFIER_POINTER (DECL_NAME (parm)));
4661 warning ("parameter points to incomplete type");
4665 typelt = TREE_CHAIN (typelt);
4668 /* Allocate the list of types the way we allocate a type. */
4669 if (first_parm && ! TREE_PERMANENT (first_parm))
4671 /* Construct a copy of the list of types
4672 on the saveable obstack. */
4674 for (typelt = first_parm; typelt; typelt = TREE_CHAIN (typelt))
4675 result = saveable_tree_cons (NULL_TREE, TREE_VALUE (typelt),
4677 return nreverse (result);
4680 /* The list we have is permanent already. */
4686 /* Return a tree_list node with info on a parameter list just parsed.
4687 The TREE_PURPOSE is a chain of decls of those parms.
4688 The TREE_VALUE is a list of structure, union and enum tags defined.
4689 The TREE_CHAIN is a list of argument types to go in the FUNCTION_TYPE.
4690 This tree_list node is later fed to `grokparms'.
4692 VOID_AT_END nonzero means append `void' to the end of the type-list.
4693 Zero means the parmlist ended with an ellipsis so don't append `void'. */
4696 get_parm_info (void_at_end)
4699 register tree decl, t;
4700 register tree types = 0;
4702 tree tags = gettags ();
4703 tree parms = getdecls ();
4705 tree order = current_binding_level->parm_order;
4707 /* Just `void' (and no ellipsis) is special. There are really no parms. */
4708 if (void_at_end && parms != 0
4709 && TREE_CHAIN (parms) == 0
4710 && TYPE_MAIN_VARIANT (TREE_TYPE (parms)) == void_type_node
4711 && DECL_NAME (parms) == 0)
4714 storedecls (NULL_TREE);
4715 return saveable_tree_cons (NULL_TREE, NULL_TREE,
4716 saveable_tree_cons (NULL_TREE, void_type_node, NULL_TREE));
4719 /* Extract enumerator values and other non-parms declared with the parms.
4720 Likewise any forward parm decls that didn't have real parm decls. */
4721 for (decl = parms; decl; )
4723 tree next = TREE_CHAIN (decl);
4725 if (TREE_CODE (decl) != PARM_DECL)
4727 TREE_CHAIN (decl) = new_parms;
4730 else if (TREE_ASM_WRITTEN (decl))
4732 error_with_decl (decl, "parameter `%s' has just a forward declaration");
4733 TREE_CHAIN (decl) = new_parms;
4739 /* Put the parm decls back in the order they were in in the parm list. */
4740 for (t = order; t; t = TREE_CHAIN (t))
4743 TREE_CHAIN (TREE_VALUE (t)) = TREE_VALUE (TREE_CHAIN (t));
4745 TREE_CHAIN (TREE_VALUE (t)) = 0;
4748 new_parms = chainon (order ? nreverse (TREE_VALUE (order)) : 0,
4751 /* Store the parmlist in the binding level since the old one
4752 is no longer a valid list. (We have changed the chain pointers.) */
4753 storedecls (new_parms);
4755 for (decl = new_parms; decl; decl = TREE_CHAIN (decl))
4756 /* There may also be declarations for enumerators if an enumeration
4757 type is declared among the parms. Ignore them here. */
4758 if (TREE_CODE (decl) == PARM_DECL)
4760 /* Since there is a prototype,
4761 args are passed in their declared types. */
4762 tree type = TREE_TYPE (decl);
4763 DECL_ARG_TYPE (decl) = type;
4764 #ifdef PROMOTE_PROTOTYPES
4765 if (TREE_CODE (type) == INTEGER_TYPE
4766 && TYPE_PRECISION (type) < TYPE_PRECISION (integer_type_node))
4767 DECL_ARG_TYPE (decl) = integer_type_node;
4770 types = saveable_tree_cons (NULL_TREE, TREE_TYPE (decl), types);
4771 if (TYPE_MAIN_VARIANT (TREE_VALUE (types)) == void_type_node && ! erred
4772 && DECL_NAME (decl) == 0)
4774 error ("`void' in parameter list must be the entire list");
4780 return saveable_tree_cons (new_parms, tags,
4781 nreverse (saveable_tree_cons (NULL_TREE, void_type_node, types)));
4783 return saveable_tree_cons (new_parms, tags, nreverse (types));
4786 /* At end of parameter list, warn about any struct, union or enum tags
4787 defined within. Do so because these types cannot ever become complete. */
4790 parmlist_tags_warning ()
4795 for (elt = current_binding_level->tags; elt; elt = TREE_CHAIN (elt))
4797 enum tree_code code = TREE_CODE (TREE_VALUE (elt));
4798 /* An anonymous union parm type is meaningful as a GNU extension.
4799 So don't warn for that. */
4800 if (code == UNION_TYPE && !pedantic)
4802 if (TREE_PURPOSE (elt) != 0)
4803 warning ("`%s %s' declared inside parameter list",
4804 (code == RECORD_TYPE ? "struct"
4805 : code == UNION_TYPE ? "union"
4807 IDENTIFIER_POINTER (TREE_PURPOSE (elt)));
4809 warning ("anonymous %s declared inside parameter list",
4810 (code == RECORD_TYPE ? "struct"
4811 : code == UNION_TYPE ? "union"
4816 warning ("its scope is only this definition or declaration,");
4817 warning ("which is probably not what you want.");
4823 /* Get the struct, enum or union (CODE says which) with tag NAME.
4824 Define the tag as a forward-reference if it is not defined. */
4827 xref_tag (code, name)
4828 enum tree_code code;
4831 int temporary = allocation_temporary_p ();
4833 /* If a cross reference is requested, look up the type
4834 already defined for this tag and return it. */
4836 register tree ref = lookup_tag (code, name, current_binding_level, 0);
4837 /* Even if this is the wrong type of tag, return what we found.
4838 There will be an error message anyway, from pending_xref_error.
4839 If we create an empty xref just for an invalid use of the type,
4840 the main result is to create lots of superfluous error messages. */
4844 push_obstacks_nochange ();
4846 if (current_binding_level == global_binding_level && temporary)
4847 end_temporary_allocation ();
4849 /* If no such tag is yet defined, create a forward-reference node
4850 and record it as the "definition".
4851 When a real declaration of this type is found,
4852 the forward-reference will be altered into a real type. */
4854 ref = make_node (code);
4855 if (code == ENUMERAL_TYPE)
4857 /* (In ANSI, Enums can be referred to only if already defined.) */
4859 pedwarn ("ANSI C forbids forward references to `enum' types");
4860 /* Give the type a default layout like unsigned int
4861 to avoid crashing if it does not get defined. */
4862 TYPE_MODE (ref) = TYPE_MODE (unsigned_type_node);
4863 TYPE_ALIGN (ref) = TYPE_ALIGN (unsigned_type_node);
4864 TREE_UNSIGNED (ref) = 1;
4865 TYPE_PRECISION (ref) = TYPE_PRECISION (unsigned_type_node);
4866 TYPE_MIN_VALUE (ref) = TYPE_MIN_VALUE (unsigned_type_node);
4867 TYPE_MAX_VALUE (ref) = TYPE_MAX_VALUE (unsigned_type_node);
4870 pushtag (name, ref);
4877 /* Make sure that the tag NAME is defined *in the current binding level*
4878 at least as a forward reference.
4879 CODE says which kind of tag NAME ought to be.
4881 We also do a push_obstacks_nochange
4882 whose matching pop is in finish_struct. */
4885 start_struct (code, name)
4886 enum tree_code code;
4889 /* If there is already a tag defined at this binding level
4890 (as a forward reference), just return it. */
4892 register tree ref = 0;
4894 push_obstacks_nochange ();
4895 if (current_binding_level == global_binding_level)
4896 end_temporary_allocation ();
4899 ref = lookup_tag (code, name, current_binding_level, 1);
4900 if (ref && TREE_CODE (ref) == code)
4902 C_TYPE_BEING_DEFINED (ref) = 1;
4903 if (TYPE_FIELDS (ref))
4904 error ((code == UNION_TYPE ? "redefinition of `union %s'"
4905 : "redefinition of `struct %s'"),
4906 IDENTIFIER_POINTER (name));
4911 /* Otherwise create a forward-reference just so the tag is in scope. */
4913 ref = make_node (code);
4914 pushtag (name, ref);
4915 C_TYPE_BEING_DEFINED (ref) = 1;
4919 /* Process the specs, declarator (NULL if omitted) and width (NULL if omitted)
4920 of a structure component, returning a FIELD_DECL node.
4921 WIDTH is non-NULL for bit fields only, and is an INTEGER_CST node.
4923 This is done during the parsing of the struct declaration.
4924 The FIELD_DECL nodes are chained together and the lot of them
4925 are ultimately passed to `build_struct' to make the RECORD_TYPE node. */
4928 grokfield (filename, line, declarator, declspecs, width)
4931 tree declarator, declspecs, width;
4935 /* The corresponding pop_obstacks is in finish_decl. */
4936 push_obstacks_nochange ();
4938 value = grokdeclarator (declarator, declspecs, width ? BITFIELD : FIELD, 0);
4940 finish_decl (value, NULL_TREE, NULL_TREE);
4941 DECL_INITIAL (value) = width;
4946 /* Function to help qsort sort FIELD_DECLs by name order. */
4949 field_decl_cmp (x, y)
4952 return (long)DECL_NAME (*x) - (long)DECL_NAME (*y);
4955 /* Fill in the fields of a RECORD_TYPE or UNION_TYPE node, T.
4956 FIELDLIST is a chain of FIELD_DECL nodes for the fields.
4958 We also do a pop_obstacks to match the push in start_struct. */
4961 finish_struct (t, fieldlist)
4962 register tree t, fieldlist;
4966 int toplevel = global_binding_level == current_binding_level;
4968 /* If this type was previously laid out as a forward reference,
4969 make sure we lay it out again. */
4973 /* Nameless union parm types are useful as GCC extension. */
4974 if (! (TREE_CODE (t) == UNION_TYPE && TYPE_NAME (t) == 0) && !pedantic)
4975 /* Otherwise, warn about any struct or union def. in parmlist. */
4976 if (in_parm_level_p ())
4979 pedwarn ((TREE_CODE (t) == UNION_TYPE ? "union defined inside parms"
4980 : "structure defined inside parms"));
4981 else if (! flag_traditional)
4982 warning ((TREE_CODE (t) == UNION_TYPE ? "union defined inside parms"
4983 : "structure defined inside parms"));
4986 old_momentary = suspend_momentary ();
4988 if (fieldlist == 0 && pedantic)
4989 pedwarn ((TREE_CODE (t) == UNION_TYPE ? "union has no members"
4990 : "structure has no members"));
4992 /* Install struct as DECL_CONTEXT of each field decl.
4993 Also process specified field sizes.
4994 Set DECL_FIELD_SIZE to the specified size, or 0 if none specified.
4995 The specified size is found in the DECL_INITIAL.
4996 Store 0 there, except for ": 0" fields (so we can find them
4997 and delete them, below). */
4999 for (x = fieldlist; x; x = TREE_CHAIN (x))
5001 DECL_CONTEXT (x) = t;
5002 DECL_FIELD_SIZE (x) = 0;
5004 /* If any field is const, the structure type is pseudo-const. */
5005 if (TREE_READONLY (x))
5006 C_TYPE_FIELDS_READONLY (t) = 1;
5009 /* A field that is pseudo-const makes the structure likewise. */
5010 tree t1 = TREE_TYPE (x);
5011 while (TREE_CODE (t1) == ARRAY_TYPE)
5012 t1 = TREE_TYPE (t1);
5013 if ((TREE_CODE (t1) == RECORD_TYPE || TREE_CODE (t1) == UNION_TYPE)
5014 && C_TYPE_FIELDS_READONLY (t1))
5015 C_TYPE_FIELDS_READONLY (t) = 1;
5018 /* Any field that is volatile means variables of this type must be
5019 treated in some ways as volatile. */
5020 if (TREE_THIS_VOLATILE (x))
5021 C_TYPE_FIELDS_VOLATILE (t) = 1;
5023 /* Any field of nominal variable size implies structure is too. */
5024 if (C_DECL_VARIABLE_SIZE (x))
5025 C_TYPE_VARIABLE_SIZE (t) = 1;
5027 /* Detect invalid nested redefinition. */
5028 if (TREE_TYPE (x) == t)
5029 error ("nested redefinition of `%s'",
5030 IDENTIFIER_POINTER (TYPE_NAME (t)));
5032 /* Detect invalid bit-field size. */
5033 if (DECL_INITIAL (x))
5034 STRIP_NOPS (DECL_INITIAL (x));
5035 if (DECL_INITIAL (x))
5037 if (TREE_CODE (DECL_INITIAL (x)) == INTEGER_CST)
5038 constant_expression_warning (DECL_INITIAL (x));
5041 error_with_decl (x, "bit-field `%s' width not an integer constant");
5042 DECL_INITIAL (x) = NULL;
5046 /* Detect invalid bit-field type. */
5047 if (DECL_INITIAL (x)
5048 && TREE_CODE (TREE_TYPE (x)) != INTEGER_TYPE
5049 && TREE_CODE (TREE_TYPE (x)) != ENUMERAL_TYPE)
5051 error_with_decl (x, "bit-field `%s' has invalid type");
5052 DECL_INITIAL (x) = NULL;
5054 if (DECL_INITIAL (x) && pedantic
5055 && TYPE_MAIN_VARIANT (TREE_TYPE (x)) != integer_type_node
5056 && TYPE_MAIN_VARIANT (TREE_TYPE (x)) != unsigned_type_node)
5057 pedwarn_with_decl (x, "bit-field `%s' type invalid in ANSI C");
5059 /* Detect and ignore out of range field width. */
5060 if (DECL_INITIAL (x))
5062 unsigned HOST_WIDE_INT width = TREE_INT_CST_LOW (DECL_INITIAL (x));
5064 if (tree_int_cst_lt (DECL_INITIAL (x), integer_zero_node))
5066 DECL_INITIAL (x) = NULL;
5067 error_with_decl (x, "negative width in bit-field `%s'");
5069 else if (TREE_INT_CST_HIGH (DECL_INITIAL (x)) != 0
5070 || width > TYPE_PRECISION (TREE_TYPE (x)))
5072 DECL_INITIAL (x) = NULL;
5073 pedwarn_with_decl (x, "width of `%s' exceeds its type");
5075 else if (width == 0 && DECL_NAME (x) != 0)
5077 error_with_decl (x, "zero width for bit-field `%s'");
5078 DECL_INITIAL (x) = NULL;
5082 /* Process valid field width. */
5083 if (DECL_INITIAL (x))
5085 register int width = TREE_INT_CST_LOW (DECL_INITIAL (x));
5087 DECL_FIELD_SIZE (x) = width;
5088 DECL_BIT_FIELD (x) = 1;
5089 DECL_INITIAL (x) = NULL;
5093 /* field size 0 => force desired amount of alignment. */
5094 #ifdef EMPTY_FIELD_BOUNDARY
5095 DECL_ALIGN (x) = MAX (DECL_ALIGN (x), EMPTY_FIELD_BOUNDARY);
5097 #ifdef PCC_BITFIELD_TYPE_MATTERS
5098 DECL_ALIGN (x) = MAX (DECL_ALIGN (x),
5099 TYPE_ALIGN (TREE_TYPE (x)));
5105 int min_align = (DECL_PACKED (x) ? BITS_PER_UNIT
5106 : TYPE_ALIGN (TREE_TYPE (x)));
5107 /* Non-bit-fields are aligned for their type, except packed
5108 fields which require only BITS_PER_UNIT alignment. */
5109 DECL_ALIGN (x) = MAX (DECL_ALIGN (x), min_align);
5113 /* Now DECL_INITIAL is null on all members. */
5115 /* Delete all duplicate fields from the fieldlist */
5116 for (x = fieldlist; x && TREE_CHAIN (x);)
5117 /* Anonymous fields aren't duplicates. */
5118 if (DECL_NAME (TREE_CHAIN (x)) == 0)
5122 register tree y = fieldlist;
5126 if (DECL_NAME (y) == DECL_NAME (TREE_CHAIN (x)))
5132 if (DECL_NAME (y) == DECL_NAME (TREE_CHAIN (x)))
5134 error_with_decl (TREE_CHAIN (x), "duplicate member `%s'");
5135 TREE_CHAIN (x) = TREE_CHAIN (TREE_CHAIN (x));
5137 else x = TREE_CHAIN (x);
5140 /* Now we have the nearly final fieldlist. Record it,
5141 then lay out the structure or union (including the fields). */
5143 TYPE_FIELDS (t) = fieldlist;
5147 /* Delete all zero-width bit-fields from the front of the fieldlist */
5149 && DECL_INITIAL (fieldlist))
5150 fieldlist = TREE_CHAIN (fieldlist);
5151 /* Delete all such members from the rest of the fieldlist */
5152 for (x = fieldlist; x;)
5154 if (TREE_CHAIN (x) && DECL_INITIAL (TREE_CHAIN (x)))
5155 TREE_CHAIN (x) = TREE_CHAIN (TREE_CHAIN (x));
5156 else x = TREE_CHAIN (x);
5159 /* Now we have the truly final field list.
5160 Store it in this type and in the variants. */
5162 TYPE_FIELDS (t) = fieldlist;
5164 /* If there are lots of fields, sort so we can look through them fast.
5165 We arbitrarily consider 16 or more elts to be "a lot". */
5169 for (x = fieldlist; x; x = TREE_CHAIN (x))
5180 len += list_length (x);
5181 /* Use the same allocation policy here that make_node uses, to
5182 ensure that this lives as long as the rest of the struct decl.
5183 All decls in an inline function need to be saved. */
5184 if (allocation_temporary_p ())
5185 space = savealloc (sizeof (struct lang_type) + len * sizeof (tree));
5187 space = oballoc (sizeof (struct lang_type) + len * sizeof (tree));
5189 TYPE_LANG_SPECIFIC (t) = (struct lang_type *) space;
5190 TYPE_LANG_SPECIFIC (t)->len = len;
5192 field_array = &TYPE_LANG_SPECIFIC (t)->elts[0];
5194 for (x = fieldlist; x; x = TREE_CHAIN (x))
5195 field_array[len++] = x;
5197 qsort (field_array, len, sizeof (tree), field_decl_cmp);
5201 for (x = TYPE_MAIN_VARIANT (t); x; x = TYPE_NEXT_VARIANT (x))
5203 TYPE_FIELDS (x) = TYPE_FIELDS (t);
5204 TYPE_LANG_SPECIFIC (x) = TYPE_LANG_SPECIFIC (t);
5205 TYPE_ALIGN (x) = TYPE_ALIGN (t);
5208 /* Promote each bit-field's type to int if it is narrower than that. */
5209 for (x = fieldlist; x; x = TREE_CHAIN (x))
5210 if (DECL_BIT_FIELD (x)
5211 && C_PROMOTING_INTEGER_TYPE_P (TREE_TYPE (x)))
5213 tree type = TREE_TYPE (x);
5215 /* Preserve unsignedness if traditional or if not really any wider. */
5216 if (TREE_UNSIGNED (type)
5217 && (flag_traditional
5218 || (TYPE_PRECISION (type)
5219 == TYPE_PRECISION (integer_type_node))))
5220 TREE_TYPE (x) = unsigned_type_node;
5222 TREE_TYPE (x) = integer_type_node;
5225 /* If this structure or union completes the type of any previous
5226 variable declaration, lay it out and output its rtl. */
5228 if (current_binding_level->n_incomplete != 0)
5231 for (decl = current_binding_level->names; decl; decl = TREE_CHAIN (decl))
5233 if (TREE_TYPE (decl) == t
5234 && TREE_CODE (decl) != TYPE_DECL)
5236 layout_decl (decl, 0);
5237 /* This is a no-op in c-lang.c or something real in objc-actions.c. */
5238 maybe_objc_check_decl (decl);
5239 rest_of_decl_compilation (decl, NULL_PTR, toplevel, 0);
5242 --current_binding_level->n_incomplete;
5244 else if (TYPE_SIZE (TREE_TYPE (decl)) == 0
5245 && TREE_CODE (TREE_TYPE (decl)) == ARRAY_TYPE)
5247 tree element = TREE_TYPE (decl);
5248 while (TREE_CODE (element) == ARRAY_TYPE)
5249 element = TREE_TYPE (element);
5251 layout_array_type (TREE_TYPE (decl));
5256 resume_momentary (old_momentary);
5258 /* Finish debugging output for this type. */
5259 rest_of_type_compilation (t, toplevel);
5261 /* The matching push is in start_struct. */
5267 /* Lay out the type T, and its element type, and so on. */
5270 layout_array_type (t)
5273 if (TREE_CODE (TREE_TYPE (t)) == ARRAY_TYPE)
5274 layout_array_type (TREE_TYPE (t));
5278 /* Begin compiling the definition of an enumeration type.
5279 NAME is its name (or null if anonymous).
5280 Returns the type object, as yet incomplete.
5281 Also records info about it so that build_enumerator
5282 may be used to declare the individual values as they are read. */
5288 register tree enumtype = 0;
5290 /* If this is the real definition for a previous forward reference,
5291 fill in the contents in the same object that used to be the
5292 forward reference. */
5295 enumtype = lookup_tag (ENUMERAL_TYPE, name, current_binding_level, 1);
5297 /* The corresponding pop_obstacks is in finish_enum. */
5298 push_obstacks_nochange ();
5299 /* If these symbols and types are global, make them permanent. */
5300 if (current_binding_level == global_binding_level)
5301 end_temporary_allocation ();
5303 if (enumtype == 0 || TREE_CODE (enumtype) != ENUMERAL_TYPE)
5305 enumtype = make_node (ENUMERAL_TYPE);
5306 pushtag (name, enumtype);
5309 C_TYPE_BEING_DEFINED (enumtype) = 1;
5311 if (TYPE_VALUES (enumtype) != 0)
5313 /* This enum is a named one that has been declared already. */
5314 error ("redeclaration of `enum %s'", IDENTIFIER_POINTER (name));
5316 /* Completely replace its old definition.
5317 The old enumerators remain defined, however. */
5318 TYPE_VALUES (enumtype) = 0;
5321 enum_next_value = integer_zero_node;
5327 /* After processing and defining all the values of an enumeration type,
5328 install their decls in the enumeration type and finish it off.
5329 ENUMTYPE is the type object and VALUES a list of decl-value pairs.
5330 Returns ENUMTYPE. */
5333 finish_enum (enumtype, values)
5334 register tree enumtype, values;
5337 tree minnode = 0, maxnode = 0;
5338 register HOST_WIDE_INT maxvalue = 0;
5339 register HOST_WIDE_INT minvalue = 0;
5341 unsigned precision = 0;
5342 int toplevel = global_binding_level == current_binding_level;
5343 int temporary = allocation_temporary_p ();
5345 if (in_parm_level_p ())
5346 warning ("enum defined inside parms");
5348 /* Calculate the maximum value of any enumerator in this type. */
5350 for (pair = values; pair; pair = TREE_CHAIN (pair))
5352 tree value = TREE_VALUE (pair);
5354 minnode = maxnode = TREE_VALUE (pair);
5357 if (tree_int_cst_lt (maxnode, value))
5359 if (tree_int_cst_lt (value, minnode))
5364 TYPE_MIN_VALUE (enumtype) = minnode;
5365 TYPE_MAX_VALUE (enumtype) = maxnode;
5367 /* Determine the precision this type needs. */
5369 if (TREE_INT_CST_HIGH (minnode) >= 0
5370 ? tree_int_cst_lt (TYPE_MAX_VALUE (unsigned_type_node), maxnode)
5371 : (tree_int_cst_lt (minnode, TYPE_MIN_VALUE (integer_type_node))
5372 || tree_int_cst_lt (TYPE_MAX_VALUE (integer_type_node), maxnode)))
5373 precision = TYPE_PRECISION (long_long_integer_type_node);
5376 maxvalue = TREE_INT_CST_LOW (maxnode);
5377 minvalue = TREE_INT_CST_LOW (minnode);
5380 precision = floor_log2 (maxvalue) + 1;
5383 /* Compute number of bits to represent magnitude of a negative value.
5384 Add one to MINVALUE since range of negative numbers
5385 includes the power of two. */
5386 unsigned negprecision = floor_log2 (-minvalue - 1) + 1;
5387 if (negprecision > precision)
5388 precision = negprecision;
5389 precision += 1; /* room for sign bit */
5396 if (flag_short_enums || precision > TYPE_PRECISION (integer_type_node))
5397 /* Use the width of the narrowest normal C type which is wide enough. */
5398 TYPE_PRECISION (enumtype) = TYPE_PRECISION (type_for_size (precision, 1));
5400 TYPE_PRECISION (enumtype) = TYPE_PRECISION (integer_type_node);
5402 TYPE_SIZE (enumtype) = 0;
5403 layout_type (enumtype);
5405 /* An enum can have some negative values; then it is signed. */
5406 TREE_UNSIGNED (enumtype) = ! tree_int_cst_lt (minnode, integer_zero_node);
5408 /* If the enumerators might not fit in an int, change their type now. */
5409 /* It seems more useful in the debugger to leave these as int
5410 unless the enumerator is wider than int. */
5411 if (TYPE_PRECISION (enumtype) <= TYPE_PRECISION (integer_type_node))
5412 for (pair = values; pair; pair = TREE_CHAIN (pair))
5414 TREE_TYPE (TREE_PURPOSE (pair)) = enumtype;
5415 DECL_SIZE (TREE_PURPOSE (pair)) = TYPE_SIZE (enumtype);
5416 if (TREE_CODE (TREE_PURPOSE (pair)) != FUNCTION_DECL)
5417 DECL_ALIGN (TREE_PURPOSE (pair)) = TYPE_ALIGN (enumtype);
5420 /* Replace the decl nodes in VALUES with their names. */
5421 for (pair = values; pair; pair = TREE_CHAIN (pair))
5422 TREE_PURPOSE (pair) = DECL_NAME (TREE_PURPOSE (pair));
5424 TYPE_VALUES (enumtype) = values;
5426 /* Finish debugging output for this type. */
5427 rest_of_type_compilation (enumtype, toplevel);
5429 /* This matches a push in start_enum. */
5435 /* Build and install a CONST_DECL for one value of the
5436 current enumeration type (one that was begun with start_enum).
5437 Return a tree-list containing the CONST_DECL and its value.
5438 Assignment of sequential values by default is handled here. */
5441 build_enumerator (name, value)
5446 /* Validate and default VALUE. */
5448 /* Remove no-op casts from the value. */
5450 STRIP_TYPE_NOPS (value);
5454 if (TREE_CODE (value) == INTEGER_CST)
5455 constant_expression_warning (value);
5458 error ("enumerator value for `%s' not integer constant",
5459 IDENTIFIER_POINTER (name));
5464 /* Default based on previous value. */
5465 /* It should no longer be possible to have NON_LVALUE_EXPR
5469 value = enum_next_value;
5471 error ("overflow in enumeration values");
5474 if (pedantic && ! int_fits_type_p (value, integer_type_node))
5476 pedwarn ("ANSI C restricts enumerator values to range of `int'");
5477 value = integer_zero_node;
5480 /* Set basis for default for next value. */
5481 enum_next_value = build_binary_op (PLUS_EXPR, value, integer_one_node, 0);
5482 enum_overflow = tree_int_cst_lt (enum_next_value, value);
5484 /* Now create a declaration for the enum value name. */
5486 decl = build_decl (CONST_DECL, name, integer_type_node);
5487 DECL_INITIAL (decl) = value;
5488 TREE_TYPE (value) = integer_type_node;
5491 return saveable_tree_cons (decl, value, NULL_TREE);
5494 /* Create the FUNCTION_DECL for a function definition.
5495 DECLSPECS and DECLARATOR are the parts of the declaration;
5496 they describe the function's name and the type it returns,
5497 but twisted together in a fashion that parallels the syntax of C.
5499 This function creates a binding context for the function body
5500 as well as setting up the FUNCTION_DECL in current_function_decl.
5502 Returns 1 on success. If the DECLARATOR is not suitable for a function
5503 (it defines a datum instead), we return 0, which tells
5504 yyparse to report a parse error.
5506 NESTED is nonzero for a function nested within another function. */
5509 start_function (declspecs, declarator, nested)
5510 tree declarator, declspecs;
5513 tree decl1, old_decl;
5516 current_function_returns_value = 0; /* Assume, until we see it does. */
5517 current_function_returns_null = 0;
5518 warn_about_return_type = 0;
5519 current_extern_inline = 0;
5520 c_function_varargs = 0;
5522 shadowed_labels = 0;
5524 decl1 = grokdeclarator (declarator, declspecs, FUNCDEF, 1);
5526 /* If the declarator is not suitable for a function definition,
5527 cause a syntax error. */
5531 announce_function (decl1);
5533 if (TYPE_SIZE (TREE_TYPE (TREE_TYPE (decl1))) == 0)
5535 error ("return-type is an incomplete type");
5536 /* Make it return void instead. */
5538 = build_function_type (void_type_node,
5539 TYPE_ARG_TYPES (TREE_TYPE (decl1)));
5542 if (warn_about_return_type)
5543 warning ("return-type defaults to `int'");
5545 /* Save the parm names or decls from this function's declarator
5546 where store_parm_decls will find them. */
5547 current_function_parms = last_function_parms;
5548 current_function_parm_tags = last_function_parm_tags;
5550 /* Make the init_value nonzero so pushdecl knows this is not tentative.
5551 error_mark_node is replaced below (in poplevel) with the BLOCK. */
5552 DECL_INITIAL (decl1) = error_mark_node;
5554 /* If this definition isn't a prototype and we had a prototype declaration
5555 before, copy the arg type info from that prototype.
5556 But not if what we had before was a builtin function. */
5557 old_decl = lookup_name_current_level (DECL_NAME (decl1));
5558 if (old_decl != 0 && TREE_CODE (TREE_TYPE (old_decl)) == FUNCTION_TYPE
5559 && !DECL_BUILT_IN (old_decl)
5560 && (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (decl1)))
5561 == TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (old_decl))))
5562 && TYPE_ARG_TYPES (TREE_TYPE (decl1)) == 0)
5564 TREE_TYPE (decl1) = TREE_TYPE (old_decl);
5565 current_function_prototype_file = DECL_SOURCE_FILE (old_decl);
5566 current_function_prototype_line = DECL_SOURCE_LINE (old_decl);
5569 /* Optionally warn of old-fashioned def with no previous prototype. */
5570 if (warn_strict_prototypes
5571 && TYPE_ARG_TYPES (TREE_TYPE (decl1)) == 0
5572 && !(old_decl != 0 && TYPE_ARG_TYPES (TREE_TYPE (old_decl)) != 0))
5573 warning ("function declaration isn't a prototype");
5574 /* Optionally warn of any global def with no previous prototype. */
5575 else if (warn_missing_prototypes
5576 && TREE_PUBLIC (decl1)
5577 && !(old_decl != 0 && TYPE_ARG_TYPES (TREE_TYPE (old_decl)) != 0))
5578 warning_with_decl (decl1, "no previous prototype for `%s'");
5579 /* Optionally warn of any def with no previous prototype
5580 if the function has already been used. */
5581 else if (warn_missing_prototypes
5582 && old_decl != 0 && TREE_USED (old_decl)
5583 && !(old_decl != 0 && TYPE_ARG_TYPES (TREE_TYPE (old_decl)) != 0))
5584 warning_with_decl (decl1, "`%s' was used with no prototype before its definition");
5586 /* This is a definition, not a reference.
5587 So normally clear DECL_EXTERNAL.
5588 However, `extern inline' acts like a declaration
5589 except for defining how to inline. So set DECL_EXTERNAL in that case. */
5590 DECL_EXTERNAL (decl1) = current_extern_inline;
5592 /* This function exists in static storage.
5593 (This does not mean `static' in the C sense!) */
5594 TREE_STATIC (decl1) = 1;
5596 /* A nested function is not global. */
5597 if (current_function_decl != 0)
5598 TREE_PUBLIC (decl1) = 0;
5600 /* Record the decl so that the function name is defined.
5601 If we already have a decl for this name, and it is a FUNCTION_DECL,
5602 use the old decl. */
5604 current_function_decl = pushdecl (decl1);
5607 declare_parm_level (1);
5608 current_binding_level->subblocks_tag_transparent = 1;
5610 make_function_rtl (current_function_decl);
5612 restype = TREE_TYPE (TREE_TYPE (current_function_decl));
5613 /* Promote the value to int before returning it. */
5614 if (C_PROMOTING_INTEGER_TYPE_P (restype))
5616 /* It retains unsignedness if traditional
5617 or if not really getting wider. */
5618 if (TREE_UNSIGNED (restype)
5619 && (flag_traditional
5620 || (TYPE_PRECISION (restype)
5621 == TYPE_PRECISION (integer_type_node))))
5622 restype = unsigned_type_node;
5624 restype = integer_type_node;
5626 DECL_RESULT (current_function_decl)
5627 = build_decl (RESULT_DECL, NULL_TREE, restype);
5630 /* Allocate further tree nodes temporarily during compilation
5631 of this function only. */
5632 temporary_allocation ();
5634 /* If this fcn was already referenced via a block-scope `extern' decl
5635 (or an implicit decl), propagate certain information about the usage. */
5636 if (TREE_ADDRESSABLE (DECL_ASSEMBLER_NAME (current_function_decl)))
5637 TREE_ADDRESSABLE (current_function_decl) = 1;
5642 /* Record that this function is going to be a varargs function.
5643 This is called before store_parm_decls, which is too early
5644 to call mark_varargs directly. */
5649 c_function_varargs = 1;
5652 /* Store the parameter declarations into the current function declaration.
5653 This is called after parsing the parameter declarations, before
5654 digesting the body of the function.
5656 For an old-style definition, modify the function's type
5657 to specify at least the number of arguments. */
5662 register tree fndecl = current_function_decl;
5665 /* This is either a chain of PARM_DECLs (if a prototype was used)
5666 or a list of IDENTIFIER_NODEs (for an old-fashioned C definition). */
5667 tree specparms = current_function_parms;
5669 /* This is a list of types declared among parms in a prototype. */
5670 tree parmtags = current_function_parm_tags;
5672 /* This is a chain of PARM_DECLs from old-style parm declarations. */
5673 register tree parmdecls = getdecls ();
5675 /* This is a chain of any other decls that came in among the parm
5676 declarations. If a parm is declared with enum {foo, bar} x;
5677 then CONST_DECLs for foo and bar are put here. */
5680 /* Nonzero if this definition is written with a prototype. */
5683 if (specparms != 0 && TREE_CODE (specparms) != TREE_LIST)
5685 /* This case is when the function was defined with an ANSI prototype.
5686 The parms already have decls, so we need not do anything here
5687 except record them as in effect
5688 and complain if any redundant old-style parm decls were written. */
5699 error_with_decl (fndecl,
5700 "parm types given both in parmlist and separately");
5701 /* Get rid of the erroneous decls; don't keep them on
5702 the list of parms, since they might not be PARM_DECLs. */
5703 for (decl = current_binding_level->names;
5704 decl; decl = TREE_CHAIN (decl))
5705 if (DECL_NAME (decl))
5706 IDENTIFIER_LOCAL_VALUE (DECL_NAME (decl)) = 0;
5707 for (link = current_binding_level->shadowed;
5708 link; link = TREE_CHAIN (link))
5709 IDENTIFIER_LOCAL_VALUE (TREE_PURPOSE (link)) = TREE_VALUE (link);
5710 current_binding_level->names = 0;
5711 current_binding_level->shadowed = 0;
5714 specparms = nreverse (specparms);
5715 for (parm = specparms; parm; parm = next)
5717 next = TREE_CHAIN (parm);
5718 if (TREE_CODE (parm) == PARM_DECL)
5720 if (DECL_NAME (parm) == 0)
5721 error_with_decl (parm, "parameter name omitted");
5722 else if (TYPE_MAIN_VARIANT (TREE_TYPE (parm)) == void_type_node)
5724 error_with_decl (parm, "parameter `%s' declared void");
5725 /* Change the type to error_mark_node so this parameter
5726 will be ignored by assign_parms. */
5727 TREE_TYPE (parm) = error_mark_node;
5733 /* If we find an enum constant or a type tag,
5734 put it aside for the moment. */
5735 TREE_CHAIN (parm) = 0;
5736 others = chainon (others, parm);
5740 /* Get the decls in their original chain order
5741 and record in the function. */
5742 DECL_ARGUMENTS (fndecl) = getdecls ();
5745 /* If this function takes a variable number of arguments,
5746 add a phony parameter to the end of the parm list,
5747 to represent the position of the first unnamed argument. */
5748 if (TREE_VALUE (tree_last (TYPE_ARG_TYPES (TREE_TYPE (fndecl))))
5751 tree dummy = build_decl (PARM_DECL, NULL_TREE, void_type_node);
5752 /* Let's hope the address of the unnamed parm
5753 won't depend on its type. */
5754 TREE_TYPE (dummy) = integer_type_node;
5755 DECL_ARG_TYPE (dummy) = integer_type_node;
5756 DECL_ARGUMENTS (fndecl)
5757 = chainon (DECL_ARGUMENTS (fndecl), dummy);
5761 /* Now pushdecl the enum constants. */
5762 for (parm = others; parm; parm = next)
5764 next = TREE_CHAIN (parm);
5765 if (DECL_NAME (parm) == 0)
5767 else if (TYPE_MAIN_VARIANT (TREE_TYPE (parm)) == void_type_node)
5769 else if (TREE_CODE (parm) != PARM_DECL)
5773 storetags (chainon (parmtags, gettags ()));
5777 /* SPECPARMS is an identifier list--a chain of TREE_LIST nodes
5778 each with a parm name as the TREE_VALUE.
5780 PARMDECLS is a chain of declarations for parameters.
5781 Warning! It can also contain CONST_DECLs which are not parameters
5782 but are names of enumerators of any enum types
5783 declared among the parameters.
5785 First match each formal parameter name with its declaration.
5786 Associate decls with the names and store the decls
5787 into the TREE_PURPOSE slots. */
5789 for (parm = parmdecls; parm; parm = TREE_CHAIN (parm))
5790 DECL_RESULT (parm) = 0;
5792 for (parm = specparms; parm; parm = TREE_CHAIN (parm))
5794 register tree tail, found = NULL;
5796 if (TREE_VALUE (parm) == 0)
5798 error_with_decl (fndecl, "parameter name missing from parameter list");
5799 TREE_PURPOSE (parm) = 0;
5803 /* See if any of the parmdecls specifies this parm by name.
5804 Ignore any enumerator decls. */
5805 for (tail = parmdecls; tail; tail = TREE_CHAIN (tail))
5806 if (DECL_NAME (tail) == TREE_VALUE (parm)
5807 && TREE_CODE (tail) == PARM_DECL)
5813 /* If declaration already marked, we have a duplicate name.
5814 Complain, and don't use this decl twice. */
5815 if (found && DECL_RESULT (found) != 0)
5817 error_with_decl (found, "multiple parameters named `%s'");
5821 /* If the declaration says "void", complain and ignore it. */
5822 if (found && TYPE_MAIN_VARIANT (TREE_TYPE (found)) == void_type_node)
5824 error_with_decl (found, "parameter `%s' declared void");
5825 TREE_TYPE (found) = integer_type_node;
5826 DECL_ARG_TYPE (found) = integer_type_node;
5827 layout_decl (found, 0);
5830 /* Traditionally, a parm declared float is actually a double. */
5831 if (found && flag_traditional
5832 && TYPE_MAIN_VARIANT (TREE_TYPE (found)) == float_type_node)
5834 TREE_TYPE (found) = double_type_node;
5835 DECL_ARG_TYPE (found) = double_type_node;
5836 layout_decl (found, 0);
5839 /* If no declaration found, default to int. */
5842 found = build_decl (PARM_DECL, TREE_VALUE (parm),
5844 DECL_ARG_TYPE (found) = TREE_TYPE (found);
5845 DECL_SOURCE_LINE (found) = DECL_SOURCE_LINE (fndecl);
5846 DECL_SOURCE_FILE (found) = DECL_SOURCE_FILE (fndecl);
5848 warning_with_decl (found, "type of `%s' defaults to `int'");
5852 TREE_PURPOSE (parm) = found;
5854 /* Mark this decl as "already found" -- see test, above.
5855 It is safe to use DECL_RESULT for this
5856 since it is not used in PARM_DECLs or CONST_DECLs. */
5857 DECL_RESULT (found) = error_mark_node;
5860 /* Put anything which is on the parmdecls chain and which is
5861 not a PARM_DECL onto the list NONPARMS. (The types of
5862 non-parm things which might appear on the list include
5863 enumerators and NULL-named TYPE_DECL nodes.) Complain about
5864 any actual PARM_DECLs not matched with any names. */
5867 for (parm = parmdecls; parm; )
5869 tree next = TREE_CHAIN (parm);
5870 TREE_CHAIN (parm) = 0;
5872 if (TREE_CODE (parm) != PARM_DECL)
5873 nonparms = chainon (nonparms, parm);
5876 /* Complain about args with incomplete types. */
5877 if (TYPE_SIZE (TREE_TYPE (parm)) == 0)
5879 error_with_decl (parm, "parameter `%s' has incomplete type");
5880 TREE_TYPE (parm) = error_mark_node;
5883 if (DECL_RESULT (parm) == 0)
5885 error_with_decl (parm,
5886 "declaration for parameter `%s' but no such parameter");
5887 /* Pretend the parameter was not missing.
5888 This gets us to a standard state and minimizes
5889 further error messages. */
5891 = chainon (specparms,
5892 tree_cons (parm, NULL_TREE, NULL_TREE));
5899 /* Chain the declarations together in the order of the list of names. */
5900 /* Store that chain in the function decl, replacing the list of names. */
5902 DECL_ARGUMENTS (fndecl) = 0;
5905 for (last = 0; parm; parm = TREE_CHAIN (parm))
5906 if (TREE_PURPOSE (parm))
5909 DECL_ARGUMENTS (fndecl) = TREE_PURPOSE (parm);
5911 TREE_CHAIN (last) = TREE_PURPOSE (parm);
5912 last = TREE_PURPOSE (parm);
5913 TREE_CHAIN (last) = 0;
5917 /* If there was a previous prototype,
5918 set the DECL_ARG_TYPE of each argument according to
5919 the type previously specified, and report any mismatches. */
5921 if (TYPE_ARG_TYPES (TREE_TYPE (fndecl)))
5924 for (parm = DECL_ARGUMENTS (fndecl),
5925 type = TYPE_ARG_TYPES (TREE_TYPE (fndecl));
5926 parm || (type && (TYPE_MAIN_VARIANT (TREE_VALUE (type))
5927 != void_type_node));
5928 parm = TREE_CHAIN (parm), type = TREE_CHAIN (type))
5930 if (parm == 0 || type == 0
5931 || TYPE_MAIN_VARIANT (TREE_VALUE (type)) == void_type_node)
5933 error ("number of arguments doesn't match prototype");
5934 error_with_file_and_line (current_function_prototype_file,
5935 current_function_prototype_line,
5936 "prototype declaration");
5939 /* Type for passing arg must be consistent
5940 with that declared for the arg. */
5941 if (! comptypes (DECL_ARG_TYPE (parm), TREE_VALUE (type)))
5943 if (TYPE_MAIN_VARIANT (TREE_TYPE (parm))
5944 == TYPE_MAIN_VARIANT (TREE_VALUE (type)))
5946 /* Adjust argument to match prototype. E.g. a previous
5947 `int foo(float);' prototype causes
5948 `int foo(x) float x; {...}' to be treated like
5949 `int foo(float x) {...}'. This is particularly
5950 useful for argument types like uid_t. */
5951 DECL_ARG_TYPE (parm) = TREE_TYPE (parm);
5952 #ifdef PROMOTE_PROTOTYPES
5953 if (TREE_CODE (TREE_TYPE (parm)) == INTEGER_TYPE
5954 && TYPE_PRECISION (TREE_TYPE (parm))
5955 < TYPE_PRECISION (integer_type_node))
5956 DECL_ARG_TYPE (parm) = integer_type_node;
5960 warning ("promoted argument `%s' doesn't match prototype",
5961 IDENTIFIER_POINTER (DECL_NAME (parm)));
5962 warning_with_file_and_line
5963 (current_function_prototype_file,
5964 current_function_prototype_line,
5965 "prototype declaration");
5968 /* If -traditional, allow `int' argument to match
5969 `unsigned' prototype. */
5970 else if (! (flag_traditional
5971 && TYPE_MAIN_VARIANT (TREE_TYPE (parm)) == integer_type_node
5972 && TYPE_MAIN_VARIANT (TREE_VALUE (type)) == unsigned_type_node))
5974 error ("argument `%s' doesn't match prototype",
5975 IDENTIFIER_POINTER (DECL_NAME (parm)));
5976 error_with_file_and_line (current_function_prototype_file,
5977 current_function_prototype_line,
5978 "prototype declaration");
5982 TYPE_ACTUAL_ARG_TYPES (TREE_TYPE (fndecl)) = 0;
5985 /* Otherwise, create a prototype that would match. */
5989 register tree actual, type;
5990 register tree last = 0;
5992 for (parm = DECL_ARGUMENTS (fndecl); parm; parm = TREE_CHAIN (parm))
5994 type = perm_tree_cons (NULL_TREE, DECL_ARG_TYPE (parm),
5997 TREE_CHAIN (last) = type;
6002 type = perm_tree_cons (NULL_TREE, void_type_node, NULL_TREE);
6004 TREE_CHAIN (last) = type;
6008 /* We are going to assign a new value for the TYPE_ACTUAL_ARG_TYPES
6009 of the type of this function, but we need to avoid having this
6010 affect the types of other similarly-typed functions, so we must
6011 first force the generation of an identical (but separate) type
6012 node for the relevant function type. The new node we create
6013 will be a variant of the main variant of the original function
6016 TREE_TYPE (fndecl) = build_type_copy (TREE_TYPE (fndecl));
6018 TYPE_ACTUAL_ARG_TYPES (TREE_TYPE (fndecl)) = actual;
6021 /* Now store the final chain of decls for the arguments
6022 as the decl-chain of the current lexical scope.
6023 Put the enumerators in as well, at the front so that
6024 DECL_ARGUMENTS is not modified. */
6026 storedecls (chainon (nonparms, DECL_ARGUMENTS (fndecl)));
6029 /* Make sure the binding level for the top of the function body
6030 gets a BLOCK if there are any in the function.
6031 Otherwise, the dbx output is wrong. */
6033 keep_next_if_subblocks = 1;
6035 /* ??? This might be an improvement,
6036 but needs to be thought about some more. */
6038 keep_next_level_flag = 1;
6041 /* Write a record describing this function definition to the prototypes
6042 file (if requested). */
6044 gen_aux_info_record (fndecl, 1, 0, prototype);
6046 /* Initialize the RTL code for the function. */
6048 init_function_start (fndecl, input_filename, lineno);
6050 /* If this is a varargs function, inform function.c. */
6052 if (c_function_varargs)
6055 /* Declare __FUNCTION__ and __PRETTY_FUNCTION__ for this function. */
6057 declare_function_name ();
6059 /* Set up parameters and prepare for return, for the function. */
6061 expand_function_start (fndecl, 0);
6063 /* If this function is `main', emit a call to `__main'
6064 to run global initializers, etc. */
6065 if (DECL_NAME (fndecl)
6066 && strcmp (IDENTIFIER_POINTER (DECL_NAME (fndecl)), "main") == 0
6067 && DECL_CONTEXT (fndecl) == NULL_TREE)
6068 expand_main_function ();
6071 /* SPECPARMS is an identifier list--a chain of TREE_LIST nodes
6072 each with a parm name as the TREE_VALUE. A null pointer as TREE_VALUE
6073 stands for an ellipsis in the identifier list.
6075 PARMLIST is the data returned by get_parm_info for the
6076 parmlist that follows the semicolon.
6078 We return a value of the same sort that get_parm_info returns,
6079 except that it describes the combination of identifiers and parmlist. */
6082 combine_parm_decls (specparms, parmlist, void_at_end)
6083 tree specparms, parmlist;
6086 register tree fndecl = current_function_decl;
6089 tree parmdecls = TREE_PURPOSE (parmlist);
6091 /* This is a chain of any other decls that came in among the parm
6092 declarations. They were separated already by get_parm_info,
6093 so we just need to keep them separate. */
6094 tree nonparms = TREE_VALUE (parmlist);
6098 for (parm = parmdecls; parm; parm = TREE_CHAIN (parm))
6099 DECL_RESULT (parm) = 0;
6101 for (parm = specparms; parm; parm = TREE_CHAIN (parm))
6103 register tree tail, found = NULL;
6105 /* See if any of the parmdecls specifies this parm by name. */
6106 for (tail = parmdecls; tail; tail = TREE_CHAIN (tail))
6107 if (DECL_NAME (tail) == TREE_VALUE (parm))
6113 /* If declaration already marked, we have a duplicate name.
6114 Complain, and don't use this decl twice. */
6115 if (found && DECL_RESULT (found) != 0)
6117 error_with_decl (found, "multiple parameters named `%s'");
6121 /* If the declaration says "void", complain and ignore it. */
6122 if (found && TYPE_MAIN_VARIANT (TREE_TYPE (found)) == void_type_node)
6124 error_with_decl (found, "parameter `%s' declared void");
6125 TREE_TYPE (found) = integer_type_node;
6126 DECL_ARG_TYPE (found) = integer_type_node;
6127 layout_decl (found, 0);
6130 /* Traditionally, a parm declared float is actually a double. */
6131 if (found && flag_traditional
6132 && TYPE_MAIN_VARIANT (TREE_TYPE (found)) == float_type_node)
6134 TREE_TYPE (found) = double_type_node;
6135 DECL_ARG_TYPE (found) = double_type_node;
6136 layout_decl (found, 0);
6139 /* If no declaration found, default to int. */
6142 found = build_decl (PARM_DECL, TREE_VALUE (parm),
6144 DECL_ARG_TYPE (found) = TREE_TYPE (found);
6145 DECL_SOURCE_LINE (found) = DECL_SOURCE_LINE (fndecl);
6146 DECL_SOURCE_FILE (found) = DECL_SOURCE_FILE (fndecl);
6147 error (found, "type of parameter `%s' is not declared");
6151 TREE_PURPOSE (parm) = found;
6153 /* Mark this decl as "already found" -- see test, above.
6154 It is safe to use DECL_RESULT for this
6155 since it is not used in PARM_DECLs or CONST_DECLs. */
6156 DECL_RESULT (found) = error_mark_node;
6159 /* Complain about any actual PARM_DECLs not matched with any names. */
6161 for (parm = parmdecls; parm; )
6163 tree next = TREE_CHAIN (parm);
6164 TREE_CHAIN (parm) = 0;
6166 /* Complain about args with incomplete types. */
6167 if (TYPE_SIZE (TREE_TYPE (parm)) == 0)
6169 error_with_decl (parm, "parameter `%s' has incomplete type");
6170 TREE_TYPE (parm) = error_mark_node;
6173 if (DECL_RESULT (parm) == 0)
6175 error_with_decl (parm,
6176 "declaration for parameter `%s' but no such parameter");
6177 /* Pretend the parameter was not missing.
6178 This gets us to a standard state and minimizes
6179 further error messages. */
6181 = chainon (specparms,
6182 tree_cons (parm, NULL_TREE, NULL_TREE));
6188 /* Chain the declarations together in the order of the list of names.
6189 At the same time, build up a list of their types, in reverse order. */
6195 for (last = 0; parm; parm = TREE_CHAIN (parm))
6196 if (TREE_PURPOSE (parm))
6199 parmdecls = TREE_PURPOSE (parm);
6201 TREE_CHAIN (last) = TREE_PURPOSE (parm);
6202 last = TREE_PURPOSE (parm);
6203 TREE_CHAIN (last) = 0;
6205 types = saveable_tree_cons (NULL_TREE, TREE_TYPE (parm), types);
6210 return saveable_tree_cons (parmdecls, nonparms,
6211 nreverse (saveable_tree_cons (NULL_TREE, void_type_node, types)));
6213 return saveable_tree_cons (parmdecls, nonparms, nreverse (types));
6216 /* Finish up a function declaration and compile that function
6217 all the way to assembler language output. The free the storage
6218 for the function definition.
6220 This is called after parsing the body of the function definition.
6222 NESTED is nonzero if the function being finished is nested in another. */
6225 finish_function (nested)
6228 register tree fndecl = current_function_decl;
6230 /* TREE_READONLY (fndecl) = 1;
6231 This caused &foo to be of type ptr-to-const-function
6232 which then got a warning when stored in a ptr-to-function variable. */
6235 BLOCK_SUPERCONTEXT (DECL_INITIAL (fndecl)) = fndecl;
6237 /* Must mark the RESULT_DECL as being in this function. */
6239 DECL_CONTEXT (DECL_RESULT (fndecl)) = fndecl;
6241 /* Obey `register' declarations if `setjmp' is called in this fn. */
6242 if (flag_traditional && current_function_calls_setjmp)
6244 setjmp_protect (DECL_INITIAL (fndecl));
6245 setjmp_protect_args ();
6248 #ifdef DEFAULT_MAIN_RETURN
6249 if (! strcmp (IDENTIFIER_POINTER (DECL_NAME (fndecl)), "main"))
6251 if (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (fndecl)))
6252 != integer_type_node)
6253 warning_with_decl (fndecl, "return type of `%s' is not `int'");
6256 /* Make it so that `main' always returns success by default. */
6257 DEFAULT_MAIN_RETURN;
6262 /* Generate rtl for function exit. */
6263 expand_function_end (input_filename, lineno);
6265 /* So we can tell if jump_optimize sets it to 1. */
6268 /* Run the optimizers and output the assembler code for this function. */
6269 rest_of_compilation (fndecl);
6271 current_function_returns_null |= can_reach_end;
6273 if (TREE_THIS_VOLATILE (fndecl) && current_function_returns_null)
6274 warning ("`volatile' function does return");
6275 else if (warn_return_type && can_reach_end
6276 && TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (fndecl))) != void_type_node)
6277 /* If this function returns non-void and control can drop through,
6279 warning ("control reaches end of non-void function");
6280 /* With just -W, complain only if function returns both with
6281 and without a value. */
6282 else if (extra_warnings
6283 && current_function_returns_value && current_function_returns_null)
6284 warning ("this function may return with or without a value");
6286 /* Free all the tree nodes making up this function. */
6287 /* Switch back to allocating nodes permanently
6288 until we start another function. */
6290 permanent_allocation ();
6292 if (DECL_SAVED_INSNS (fndecl) == 0 && ! nested)
6294 /* Stop pointing to the local nodes about to be freed. */
6295 /* But DECL_INITIAL must remain nonzero so we know this
6296 was an actual function definition. */
6297 /* For a nested function, this is done in pop_c_function_context. */
6298 DECL_INITIAL (fndecl) = error_mark_node;
6299 DECL_ARGUMENTS (fndecl) = 0;
6304 /* Let the error reporting routines know that we're outside a
6305 function. For a nested function, this value is used in
6306 pop_c_function_context and then reset via pop_function_context. */
6307 current_function_decl = NULL;
6311 /* Save and restore the variables in this file and elsewhere
6312 that keep track of the progress of compilation of the current function.
6313 Used for nested functions. */
6317 struct c_function *next;
6318 tree enum_next_value;
6320 tree shadowed_labels;
6323 int warn_about_return_type;
6325 struct binding_level *binding_level;
6328 struct c_function *c_function_chain;
6330 /* Save and reinitialize the variables
6331 used during compilation of a C function. */
6334 push_c_function_context ()
6336 struct c_function *p
6337 = (struct c_function *) xmalloc (sizeof (struct c_function));
6340 pedwarn ("ANSI C forbids nested functions");
6342 push_function_context ();
6344 p->next = c_function_chain;
6345 c_function_chain = p;
6347 p->enum_next_value = enum_next_value;
6348 p->named_labels = named_labels;
6349 p->shadowed_labels = shadowed_labels;
6350 p->returns_value = current_function_returns_value;
6351 p->returns_null = current_function_returns_null;
6352 p->warn_about_return_type = warn_about_return_type;
6353 p->extern_inline = current_extern_inline;
6354 p->binding_level = current_binding_level;
6357 /* Restore the variables used during compilation of a C function. */
6360 pop_c_function_context ()
6362 struct c_function *p = c_function_chain;
6365 /* Bring back all the labels that were shadowed. */
6366 for (link = shadowed_labels; link; link = TREE_CHAIN (link))
6367 if (DECL_NAME (TREE_VALUE (link)) != 0)
6368 IDENTIFIER_LABEL_VALUE (DECL_NAME (TREE_VALUE (link)))
6369 = TREE_VALUE (link);
6371 if (DECL_SAVED_INSNS (current_function_decl) == 0)
6373 /* Stop pointing to the local nodes about to be freed. */
6374 /* But DECL_INITIAL must remain nonzero so we know this
6375 was an actual function definition. */
6376 DECL_INITIAL (current_function_decl) = error_mark_node;
6377 DECL_ARGUMENTS (current_function_decl) = 0;
6380 pop_function_context ();
6382 c_function_chain = p->next;
6384 enum_next_value = p->enum_next_value;
6385 named_labels = p->named_labels;
6386 shadowed_labels = p->shadowed_labels;
6387 current_function_returns_value = p->returns_value;
6388 current_function_returns_null = p->returns_null;
6389 warn_about_return_type = p->warn_about_return_type;
6390 current_extern_inline = p->extern_inline;
6391 current_binding_level = p->binding_level;