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