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