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