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