]>
Commit | Line | Data |
---|---|---|
400fbf9f | 1 | /* Build expressions with type checking for C compiler. |
06ceef4e | 2 | Copyright (C) 1987, 1988, 1991, 1992, 1993, 1994, 1995, 1996, 1997, |
e6ecc89b | 3 | 1998, 1999, 2000, 2001, 2002 Free Software Foundation, Inc. |
400fbf9f | 4 | |
1322177d | 5 | This file is part of GCC. |
400fbf9f | 6 | |
1322177d LB |
7 | GCC is free software; you can redistribute it and/or modify it under |
8 | the terms of the GNU General Public License as published by the Free | |
9 | Software Foundation; either version 2, or (at your option) any later | |
10 | version. | |
400fbf9f | 11 | |
1322177d LB |
12 | GCC is distributed in the hope that it will be useful, but WITHOUT ANY |
13 | WARRANTY; without even the implied warranty of MERCHANTABILITY or | |
14 | FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License | |
15 | for more details. | |
400fbf9f JW |
16 | |
17 | You should have received a copy of the GNU General Public License | |
1322177d LB |
18 | along with GCC; see the file COPYING. If not, write to the Free |
19 | Software Foundation, 59 Temple Place - Suite 330, Boston, MA | |
20 | 02111-1307, USA. */ | |
400fbf9f JW |
21 | |
22 | ||
23 | /* This file is part of the C front end. | |
24 | It contains routines to build C expressions given their operands, | |
25 | including computing the types of the result, C-specific error checks, | |
26 | and some optimization. | |
27 | ||
28 | There are also routines to build RETURN_STMT nodes and CASE_STMT nodes, | |
29 | and to process initializations in declarations (since they work | |
30 | like a strange sort of assignment). */ | |
31 | ||
32 | #include "config.h" | |
670ee920 | 33 | #include "system.h" |
742b62e7 | 34 | #include "rtl.h" |
400fbf9f JW |
35 | #include "tree.h" |
36 | #include "c-tree.h" | |
6baf1cc8 | 37 | #include "tm_p.h" |
400fbf9f | 38 | #include "flags.h" |
e14417fa | 39 | #include "output.h" |
234042f4 | 40 | #include "expr.h" |
5f6da302 | 41 | #include "toplev.h" |
ab87f8c8 | 42 | #include "intl.h" |
4dd7201e | 43 | #include "ggc.h" |
672a6f42 | 44 | #include "target.h" |
400fbf9f | 45 | |
b71c7f8a | 46 | /* Nonzero if we've already printed a "missing braces around initializer" |
103b7b17 | 47 | message within this initializer. */ |
b71c7f8a | 48 | static int missing_braces_mentioned; |
103b7b17 | 49 | |
7e585d16 ZW |
50 | /* 1 if we explained undeclared var errors. */ |
51 | static int undeclared_variable_notice; | |
52 | ||
6e090c76 KG |
53 | static tree qualify_type PARAMS ((tree, tree)); |
54 | static int comp_target_types PARAMS ((tree, tree)); | |
55 | static int function_types_compatible_p PARAMS ((tree, tree)); | |
56 | static int type_lists_compatible_p PARAMS ((tree, tree)); | |
2f74f7e9 | 57 | static tree decl_constant_value_for_broken_optimization PARAMS ((tree)); |
207bf485 | 58 | static tree default_function_array_conversion PARAMS ((tree)); |
e9b2c823 | 59 | static tree lookup_field PARAMS ((tree, tree)); |
6e090c76 | 60 | static tree convert_arguments PARAMS ((tree, tree, tree, tree)); |
6e090c76 | 61 | static tree pointer_diff PARAMS ((tree, tree)); |
207bf485 | 62 | static tree unary_complex_lvalue PARAMS ((enum tree_code, tree, int)); |
6e090c76 KG |
63 | static void pedantic_lvalue_warning PARAMS ((enum tree_code)); |
64 | static tree internal_build_compound_expr PARAMS ((tree, int)); | |
65 | static tree convert_for_assignment PARAMS ((tree, tree, const char *, | |
66 | tree, tree, int)); | |
67 | static void warn_for_assignment PARAMS ((const char *, const char *, | |
68 | tree, int)); | |
69 | static tree valid_compound_expr_initializer PARAMS ((tree, tree)); | |
70 | static void push_string PARAMS ((const char *)); | |
71 | static void push_member_name PARAMS ((tree)); | |
72 | static void push_array_bounds PARAMS ((int)); | |
73 | static int spelling_length PARAMS ((void)); | |
74 | static char *print_spelling PARAMS ((char *)); | |
75 | static void warning_init PARAMS ((const char *)); | |
273cf2e4 | 76 | static tree digest_init PARAMS ((tree, tree, int)); |
6e090c76 KG |
77 | static void output_init_element PARAMS ((tree, tree, tree, int)); |
78 | static void output_pending_init_elements PARAMS ((int)); | |
8b6a5902 JJ |
79 | static int set_designator PARAMS ((int)); |
80 | static void push_range_stack PARAMS ((tree)); | |
6e090c76 | 81 | static void add_pending_init PARAMS ((tree, tree)); |
8b6a5902 JJ |
82 | static void set_nonincremental_init PARAMS ((void)); |
83 | static void set_nonincremental_init_from_string PARAMS ((tree)); | |
84 | static tree find_init_member PARAMS ((tree)); | |
400fbf9f JW |
85 | \f |
86 | /* Do `exp = require_complete_type (exp);' to make sure exp | |
87 | does not have an incomplete type. (That includes void types.) */ | |
88 | ||
89 | tree | |
90 | require_complete_type (value) | |
91 | tree value; | |
92 | { | |
93 | tree type = TREE_TYPE (value); | |
94 | ||
c3d5c3fa | 95 | if (value == error_mark_node || type == error_mark_node) |
ea0f786b CB |
96 | return error_mark_node; |
97 | ||
400fbf9f | 98 | /* First, detect a valid value with a complete type. */ |
d0f062fb | 99 | if (COMPLETE_TYPE_P (type)) |
400fbf9f JW |
100 | return value; |
101 | ||
7a228918 | 102 | c_incomplete_type_error (value, type); |
400fbf9f JW |
103 | return error_mark_node; |
104 | } | |
105 | ||
106 | /* Print an error message for invalid use of an incomplete type. | |
107 | VALUE is the expression that was used (or 0 if that isn't known) | |
108 | and TYPE is the type that was invalid. */ | |
109 | ||
110 | void | |
7a228918 | 111 | c_incomplete_type_error (value, type) |
400fbf9f JW |
112 | tree value; |
113 | tree type; | |
114 | { | |
5d5993dd | 115 | const char *type_code_string; |
400fbf9f JW |
116 | |
117 | /* Avoid duplicate error message. */ | |
118 | if (TREE_CODE (type) == ERROR_MARK) | |
119 | return; | |
120 | ||
121 | if (value != 0 && (TREE_CODE (value) == VAR_DECL | |
122 | || TREE_CODE (value) == PARM_DECL)) | |
123 | error ("`%s' has an incomplete type", | |
124 | IDENTIFIER_POINTER (DECL_NAME (value))); | |
125 | else | |
126 | { | |
127 | retry: | |
128 | /* We must print an error message. Be clever about what it says. */ | |
129 | ||
130 | switch (TREE_CODE (type)) | |
131 | { | |
132 | case RECORD_TYPE: | |
ab87f8c8 | 133 | type_code_string = "struct"; |
400fbf9f JW |
134 | break; |
135 | ||
136 | case UNION_TYPE: | |
ab87f8c8 | 137 | type_code_string = "union"; |
400fbf9f JW |
138 | break; |
139 | ||
140 | case ENUMERAL_TYPE: | |
ab87f8c8 | 141 | type_code_string = "enum"; |
400fbf9f JW |
142 | break; |
143 | ||
144 | case VOID_TYPE: | |
145 | error ("invalid use of void expression"); | |
146 | return; | |
147 | ||
148 | case ARRAY_TYPE: | |
149 | if (TYPE_DOMAIN (type)) | |
150 | { | |
fba78abb RH |
151 | if (TYPE_MAX_VALUE (TYPE_DOMAIN (type)) == NULL) |
152 | { | |
153 | error ("invalid use of flexible array member"); | |
154 | return; | |
155 | } | |
400fbf9f JW |
156 | type = TREE_TYPE (type); |
157 | goto retry; | |
158 | } | |
159 | error ("invalid use of array with unspecified bounds"); | |
160 | return; | |
161 | ||
162 | default: | |
163 | abort (); | |
164 | } | |
165 | ||
166 | if (TREE_CODE (TYPE_NAME (type)) == IDENTIFIER_NODE) | |
ab87f8c8 JL |
167 | error ("invalid use of undefined type `%s %s'", |
168 | type_code_string, IDENTIFIER_POINTER (TYPE_NAME (type))); | |
400fbf9f JW |
169 | else |
170 | /* If this type has a typedef-name, the TYPE_NAME is a TYPE_DECL. */ | |
171 | error ("invalid use of incomplete typedef `%s'", | |
172 | IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (type)))); | |
173 | } | |
174 | } | |
175 | ||
ab393bf1 NB |
176 | /* Given a type, apply default promotions wrt unnamed function |
177 | arguments and return the new type. */ | |
178 | ||
179 | tree | |
180 | c_type_promotes_to (type) | |
181 | tree type; | |
182 | { | |
183 | if (TYPE_MAIN_VARIANT (type) == float_type_node) | |
184 | return double_type_node; | |
185 | ||
186 | if (c_promoting_integer_type_p (type)) | |
187 | { | |
188 | /* Preserve unsignedness if not really getting any wider. */ | |
189 | if (TREE_UNSIGNED (type) | |
190 | && (TYPE_PRECISION (type) == TYPE_PRECISION (integer_type_node))) | |
191 | return unsigned_type_node; | |
192 | return integer_type_node; | |
193 | } | |
194 | ||
195 | return type; | |
196 | } | |
197 | ||
400fbf9f JW |
198 | /* Return a variant of TYPE which has all the type qualifiers of LIKE |
199 | as well as those of TYPE. */ | |
200 | ||
201 | static tree | |
202 | qualify_type (type, like) | |
203 | tree type, like; | |
204 | { | |
afbadaa7 MM |
205 | return c_build_qualified_type (type, |
206 | TYPE_QUALS (type) | TYPE_QUALS (like)); | |
400fbf9f JW |
207 | } |
208 | \f | |
209 | /* Return the common type of two types. | |
210 | We assume that comptypes has already been done and returned 1; | |
6cb72a7d RS |
211 | if that isn't so, this may crash. In particular, we assume that qualifiers |
212 | match. | |
400fbf9f JW |
213 | |
214 | This is the type for the result of most arithmetic operations | |
6cb72a7d | 215 | if the operands have the given two types. */ |
400fbf9f JW |
216 | |
217 | tree | |
218 | common_type (t1, t2) | |
219 | tree t1, t2; | |
220 | { | |
b3694847 SS |
221 | enum tree_code code1; |
222 | enum tree_code code2; | |
4b027d16 | 223 | tree attributes; |
400fbf9f JW |
224 | |
225 | /* Save time if the two types are the same. */ | |
226 | ||
227 | if (t1 == t2) return t1; | |
228 | ||
229 | /* If one type is nonsense, use the other. */ | |
230 | if (t1 == error_mark_node) | |
231 | return t2; | |
232 | if (t2 == error_mark_node) | |
233 | return t1; | |
234 | ||
d9525bec | 235 | /* Merge the attributes. */ |
f6897b10 | 236 | attributes = (*targetm.merge_type_attributes) (t1, t2); |
4b027d16 | 237 | |
400fbf9f JW |
238 | /* Treat an enum type as the unsigned integer type of the same width. */ |
239 | ||
240 | if (TREE_CODE (t1) == ENUMERAL_TYPE) | |
b0c48229 | 241 | t1 = c_common_type_for_size (TYPE_PRECISION (t1), 1); |
400fbf9f | 242 | if (TREE_CODE (t2) == ENUMERAL_TYPE) |
b0c48229 | 243 | t2 = c_common_type_for_size (TYPE_PRECISION (t2), 1); |
400fbf9f JW |
244 | |
245 | code1 = TREE_CODE (t1); | |
246 | code2 = TREE_CODE (t2); | |
247 | ||
75326e8c RK |
248 | /* If one type is complex, form the common type of the non-complex |
249 | components, then make that complex. Use T1 or T2 if it is the | |
250 | required type. */ | |
b6a10c9f RS |
251 | if (code1 == COMPLEX_TYPE || code2 == COMPLEX_TYPE) |
252 | { | |
75326e8c RK |
253 | tree subtype1 = code1 == COMPLEX_TYPE ? TREE_TYPE (t1) : t1; |
254 | tree subtype2 = code2 == COMPLEX_TYPE ? TREE_TYPE (t2) : t2; | |
255 | tree subtype = common_type (subtype1, subtype2); | |
256 | ||
257 | if (code1 == COMPLEX_TYPE && TREE_TYPE (t1) == subtype) | |
4b027d16 | 258 | return build_type_attribute_variant (t1, attributes); |
75326e8c | 259 | else if (code2 == COMPLEX_TYPE && TREE_TYPE (t2) == subtype) |
4b027d16 | 260 | return build_type_attribute_variant (t2, attributes); |
b6a10c9f | 261 | else |
4b027d16 RK |
262 | return build_type_attribute_variant (build_complex_type (subtype), |
263 | attributes); | |
b6a10c9f RS |
264 | } |
265 | ||
400fbf9f JW |
266 | switch (code1) |
267 | { | |
268 | case INTEGER_TYPE: | |
269 | case REAL_TYPE: | |
270 | /* If only one is real, use it as the result. */ | |
271 | ||
272 | if (code1 == REAL_TYPE && code2 != REAL_TYPE) | |
4b027d16 | 273 | return build_type_attribute_variant (t1, attributes); |
400fbf9f JW |
274 | |
275 | if (code2 == REAL_TYPE && code1 != REAL_TYPE) | |
4b027d16 | 276 | return build_type_attribute_variant (t2, attributes); |
400fbf9f JW |
277 | |
278 | /* Both real or both integers; use the one with greater precision. */ | |
279 | ||
280 | if (TYPE_PRECISION (t1) > TYPE_PRECISION (t2)) | |
4b027d16 | 281 | return build_type_attribute_variant (t1, attributes); |
400fbf9f | 282 | else if (TYPE_PRECISION (t2) > TYPE_PRECISION (t1)) |
4b027d16 | 283 | return build_type_attribute_variant (t2, attributes); |
400fbf9f JW |
284 | |
285 | /* Same precision. Prefer longs to ints even when same size. */ | |
286 | ||
36618528 RS |
287 | if (TYPE_MAIN_VARIANT (t1) == long_unsigned_type_node |
288 | || TYPE_MAIN_VARIANT (t2) == long_unsigned_type_node) | |
4b027d16 RK |
289 | return build_type_attribute_variant (long_unsigned_type_node, |
290 | attributes); | |
400fbf9f | 291 | |
36618528 RS |
292 | if (TYPE_MAIN_VARIANT (t1) == long_integer_type_node |
293 | || TYPE_MAIN_VARIANT (t2) == long_integer_type_node) | |
400fbf9f JW |
294 | { |
295 | /* But preserve unsignedness from the other type, | |
296 | since long cannot hold all the values of an unsigned int. */ | |
297 | if (TREE_UNSIGNED (t1) || TREE_UNSIGNED (t2)) | |
4b027d16 RK |
298 | t1 = long_unsigned_type_node; |
299 | else | |
300 | t1 = long_integer_type_node; | |
301 | return build_type_attribute_variant (t1, attributes); | |
400fbf9f JW |
302 | } |
303 | ||
e9a25f70 JL |
304 | /* Likewise, prefer long double to double even if same size. */ |
305 | if (TYPE_MAIN_VARIANT (t1) == long_double_type_node | |
306 | || TYPE_MAIN_VARIANT (t2) == long_double_type_node) | |
307 | return build_type_attribute_variant (long_double_type_node, | |
308 | attributes); | |
309 | ||
400fbf9f JW |
310 | /* Otherwise prefer the unsigned one. */ |
311 | ||
312 | if (TREE_UNSIGNED (t1)) | |
4b027d16 RK |
313 | return build_type_attribute_variant (t1, attributes); |
314 | else | |
315 | return build_type_attribute_variant (t2, attributes); | |
400fbf9f JW |
316 | |
317 | case POINTER_TYPE: | |
400fbf9f JW |
318 | /* For two pointers, do this recursively on the target type, |
319 | and combine the qualifiers of the two types' targets. */ | |
8706edbc RS |
320 | /* This code was turned off; I don't know why. |
321 | But ANSI C specifies doing this with the qualifiers. | |
322 | So I turned it on again. */ | |
400fbf9f | 323 | { |
3932261a MM |
324 | tree pointed_to_1 = TREE_TYPE (t1); |
325 | tree pointed_to_2 = TREE_TYPE (t2); | |
326 | tree target = common_type (TYPE_MAIN_VARIANT (pointed_to_1), | |
327 | TYPE_MAIN_VARIANT (pointed_to_2)); | |
328 | t1 = build_pointer_type (c_build_qualified_type | |
329 | (target, | |
330 | TYPE_QUALS (pointed_to_1) | | |
331 | TYPE_QUALS (pointed_to_2))); | |
4b027d16 | 332 | return build_type_attribute_variant (t1, attributes); |
400fbf9f | 333 | } |
8706edbc | 334 | #if 0 |
4b027d16 RK |
335 | t1 = build_pointer_type (common_type (TREE_TYPE (t1), TREE_TYPE (t2))); |
336 | return build_type_attribute_variant (t1, attributes); | |
8706edbc | 337 | #endif |
400fbf9f JW |
338 | |
339 | case ARRAY_TYPE: | |
340 | { | |
341 | tree elt = common_type (TREE_TYPE (t1), TREE_TYPE (t2)); | |
342 | /* Save space: see if the result is identical to one of the args. */ | |
343 | if (elt == TREE_TYPE (t1) && TYPE_DOMAIN (t1)) | |
4b027d16 | 344 | return build_type_attribute_variant (t1, attributes); |
400fbf9f | 345 | if (elt == TREE_TYPE (t2) && TYPE_DOMAIN (t2)) |
4b027d16 | 346 | return build_type_attribute_variant (t2, attributes); |
400fbf9f | 347 | /* Merge the element types, and have a size if either arg has one. */ |
4b027d16 RK |
348 | t1 = build_array_type (elt, TYPE_DOMAIN (TYPE_DOMAIN (t1) ? t1 : t2)); |
349 | return build_type_attribute_variant (t1, attributes); | |
400fbf9f JW |
350 | } |
351 | ||
352 | case FUNCTION_TYPE: | |
353 | /* Function types: prefer the one that specified arg types. | |
354 | If both do, merge the arg types. Also merge the return types. */ | |
355 | { | |
356 | tree valtype = common_type (TREE_TYPE (t1), TREE_TYPE (t2)); | |
357 | tree p1 = TYPE_ARG_TYPES (t1); | |
358 | tree p2 = TYPE_ARG_TYPES (t2); | |
359 | int len; | |
360 | tree newargs, n; | |
361 | int i; | |
362 | ||
363 | /* Save space: see if the result is identical to one of the args. */ | |
364 | if (valtype == TREE_TYPE (t1) && ! TYPE_ARG_TYPES (t2)) | |
4b027d16 | 365 | return build_type_attribute_variant (t1, attributes); |
400fbf9f | 366 | if (valtype == TREE_TYPE (t2) && ! TYPE_ARG_TYPES (t1)) |
4b027d16 | 367 | return build_type_attribute_variant (t2, attributes); |
400fbf9f JW |
368 | |
369 | /* Simple way if one arg fails to specify argument types. */ | |
370 | if (TYPE_ARG_TYPES (t1) == 0) | |
4b027d16 RK |
371 | { |
372 | t1 = build_function_type (valtype, TYPE_ARG_TYPES (t2)); | |
373 | return build_type_attribute_variant (t1, attributes); | |
374 | } | |
400fbf9f | 375 | if (TYPE_ARG_TYPES (t2) == 0) |
4b027d16 RK |
376 | { |
377 | t1 = build_function_type (valtype, TYPE_ARG_TYPES (t1)); | |
378 | return build_type_attribute_variant (t1, attributes); | |
379 | } | |
400fbf9f JW |
380 | |
381 | /* If both args specify argument types, we must merge the two | |
382 | lists, argument by argument. */ | |
383 | ||
2f4e8f2b JJ |
384 | pushlevel (0); |
385 | declare_parm_level (1); | |
386 | ||
400fbf9f JW |
387 | len = list_length (p1); |
388 | newargs = 0; | |
389 | ||
390 | for (i = 0; i < len; i++) | |
8d9bfdc5 | 391 | newargs = tree_cons (NULL_TREE, NULL_TREE, newargs); |
400fbf9f JW |
392 | |
393 | n = newargs; | |
394 | ||
395 | for (; p1; | |
396 | p1 = TREE_CHAIN (p1), p2 = TREE_CHAIN (p2), n = TREE_CHAIN (n)) | |
397 | { | |
398 | /* A null type means arg type is not specified. | |
399 | Take whatever the other function type has. */ | |
400 | if (TREE_VALUE (p1) == 0) | |
401 | { | |
402 | TREE_VALUE (n) = TREE_VALUE (p2); | |
403 | goto parm_done; | |
404 | } | |
405 | if (TREE_VALUE (p2) == 0) | |
406 | { | |
407 | TREE_VALUE (n) = TREE_VALUE (p1); | |
408 | goto parm_done; | |
409 | } | |
410 | ||
411 | /* Given wait (union {union wait *u; int *i} *) | |
412 | and wait (union wait *), | |
413 | prefer union wait * as type of parm. */ | |
414 | if (TREE_CODE (TREE_VALUE (p1)) == UNION_TYPE | |
415 | && TREE_VALUE (p1) != TREE_VALUE (p2)) | |
416 | { | |
417 | tree memb; | |
418 | for (memb = TYPE_FIELDS (TREE_VALUE (p1)); | |
419 | memb; memb = TREE_CHAIN (memb)) | |
420 | if (comptypes (TREE_TYPE (memb), TREE_VALUE (p2))) | |
421 | { | |
422 | TREE_VALUE (n) = TREE_VALUE (p2); | |
423 | if (pedantic) | |
89abf8d1 | 424 | pedwarn ("function types not truly compatible in ISO C"); |
400fbf9f JW |
425 | goto parm_done; |
426 | } | |
427 | } | |
428 | if (TREE_CODE (TREE_VALUE (p2)) == UNION_TYPE | |
429 | && TREE_VALUE (p2) != TREE_VALUE (p1)) | |
430 | { | |
431 | tree memb; | |
432 | for (memb = TYPE_FIELDS (TREE_VALUE (p2)); | |
433 | memb; memb = TREE_CHAIN (memb)) | |
434 | if (comptypes (TREE_TYPE (memb), TREE_VALUE (p1))) | |
435 | { | |
436 | TREE_VALUE (n) = TREE_VALUE (p1); | |
437 | if (pedantic) | |
89abf8d1 | 438 | pedwarn ("function types not truly compatible in ISO C"); |
400fbf9f JW |
439 | goto parm_done; |
440 | } | |
441 | } | |
442 | TREE_VALUE (n) = common_type (TREE_VALUE (p1), TREE_VALUE (p2)); | |
443 | parm_done: ; | |
444 | } | |
445 | ||
2f4e8f2b JJ |
446 | poplevel (0, 0, 0); |
447 | ||
4b027d16 | 448 | t1 = build_function_type (valtype, newargs); |
0f41302f | 449 | /* ... falls through ... */ |
400fbf9f JW |
450 | } |
451 | ||
452 | default: | |
4b027d16 | 453 | return build_type_attribute_variant (t1, attributes); |
400fbf9f JW |
454 | } |
455 | ||
456 | } | |
457 | \f | |
458 | /* Return 1 if TYPE1 and TYPE2 are compatible types for assignment | |
459 | or various other operations. Return 2 if they are compatible | |
460 | but a warning may be needed if you use them together. */ | |
461 | ||
462 | int | |
463 | comptypes (type1, type2) | |
464 | tree type1, type2; | |
465 | { | |
b3694847 SS |
466 | tree t1 = type1; |
467 | tree t2 = type2; | |
4b027d16 | 468 | int attrval, val; |
400fbf9f JW |
469 | |
470 | /* Suppress errors caused by previously reported errors. */ | |
471 | ||
8d47dfc5 RH |
472 | if (t1 == t2 || !t1 || !t2 |
473 | || TREE_CODE (t1) == ERROR_MARK || TREE_CODE (t2) == ERROR_MARK) | |
400fbf9f JW |
474 | return 1; |
475 | ||
21318741 RK |
476 | /* If either type is the internal version of sizetype, return the |
477 | language version. */ | |
478 | if (TREE_CODE (t1) == INTEGER_TYPE && TYPE_IS_SIZETYPE (t1) | |
479 | && TYPE_DOMAIN (t1) != 0) | |
480 | t1 = TYPE_DOMAIN (t1); | |
481 | ||
482 | if (TREE_CODE (t2) == INTEGER_TYPE && TYPE_IS_SIZETYPE (t2) | |
483 | && TYPE_DOMAIN (t2) != 0) | |
484 | t2 = TYPE_DOMAIN (t2); | |
485 | ||
b8c21346 RK |
486 | /* Treat an enum type as the integer type of the same width and |
487 | signedness. */ | |
400fbf9f JW |
488 | |
489 | if (TREE_CODE (t1) == ENUMERAL_TYPE) | |
b0c48229 | 490 | t1 = c_common_type_for_size (TYPE_PRECISION (t1), TREE_UNSIGNED (t1)); |
400fbf9f | 491 | if (TREE_CODE (t2) == ENUMERAL_TYPE) |
b0c48229 | 492 | t2 = c_common_type_for_size (TYPE_PRECISION (t2), TREE_UNSIGNED (t2)); |
400fbf9f JW |
493 | |
494 | if (t1 == t2) | |
495 | return 1; | |
496 | ||
497 | /* Different classes of types can't be compatible. */ | |
498 | ||
499 | if (TREE_CODE (t1) != TREE_CODE (t2)) return 0; | |
500 | ||
501 | /* Qualifiers must match. */ | |
502 | ||
3932261a | 503 | if (TYPE_QUALS (t1) != TYPE_QUALS (t2)) |
400fbf9f JW |
504 | return 0; |
505 | ||
08632da2 RS |
506 | /* Allow for two different type nodes which have essentially the same |
507 | definition. Note that we already checked for equality of the type | |
38e01259 | 508 | qualifiers (just above). */ |
400fbf9f JW |
509 | |
510 | if (TYPE_MAIN_VARIANT (t1) == TYPE_MAIN_VARIANT (t2)) | |
511 | return 1; | |
512 | ||
4b027d16 | 513 | /* 1 if no need for warning yet, 2 if warning cause has been seen. */ |
f6897b10 | 514 | if (! (attrval = (*targetm.comp_type_attributes) (t1, t2))) |
4b027d16 RK |
515 | return 0; |
516 | ||
517 | /* 1 if no need for warning yet, 2 if warning cause has been seen. */ | |
518 | val = 0; | |
519 | ||
400fbf9f JW |
520 | switch (TREE_CODE (t1)) |
521 | { | |
522 | case POINTER_TYPE: | |
4b027d16 | 523 | val = (TREE_TYPE (t1) == TREE_TYPE (t2) |
400fbf9f | 524 | ? 1 : comptypes (TREE_TYPE (t1), TREE_TYPE (t2))); |
4b027d16 | 525 | break; |
400fbf9f JW |
526 | |
527 | case FUNCTION_TYPE: | |
4b027d16 RK |
528 | val = function_types_compatible_p (t1, t2); |
529 | break; | |
400fbf9f JW |
530 | |
531 | case ARRAY_TYPE: | |
532 | { | |
400fbf9f JW |
533 | tree d1 = TYPE_DOMAIN (t1); |
534 | tree d2 = TYPE_DOMAIN (t2); | |
3f85558f RH |
535 | bool d1_variable, d2_variable; |
536 | bool d1_zero, d2_zero; | |
4b027d16 | 537 | val = 1; |
400fbf9f JW |
538 | |
539 | /* Target types must match incl. qualifiers. */ | |
540 | if (TREE_TYPE (t1) != TREE_TYPE (t2) | |
541 | && 0 == (val = comptypes (TREE_TYPE (t1), TREE_TYPE (t2)))) | |
542 | return 0; | |
543 | ||
544 | /* Sizes must match unless one is missing or variable. */ | |
3f85558f | 545 | if (d1 == 0 || d2 == 0 || d1 == d2) |
4b027d16 | 546 | break; |
400fbf9f | 547 | |
3f85558f RH |
548 | d1_zero = ! TYPE_MAX_VALUE (d1); |
549 | d2_zero = ! TYPE_MAX_VALUE (d2); | |
550 | ||
551 | d1_variable = (! d1_zero | |
552 | && (TREE_CODE (TYPE_MIN_VALUE (d1)) != INTEGER_CST | |
553 | || TREE_CODE (TYPE_MAX_VALUE (d1)) != INTEGER_CST)); | |
554 | d2_variable = (! d2_zero | |
555 | && (TREE_CODE (TYPE_MIN_VALUE (d2)) != INTEGER_CST | |
556 | || TREE_CODE (TYPE_MAX_VALUE (d2)) != INTEGER_CST)); | |
557 | ||
558 | if (d1_variable || d2_variable) | |
559 | break; | |
560 | if (d1_zero && d2_zero) | |
561 | break; | |
562 | if (d1_zero || d2_zero | |
563 | || ! tree_int_cst_equal (TYPE_MIN_VALUE (d1), TYPE_MIN_VALUE (d2)) | |
05bccae2 RK |
564 | || ! tree_int_cst_equal (TYPE_MAX_VALUE (d1), TYPE_MAX_VALUE (d2))) |
565 | val = 0; | |
566 | ||
4b027d16 | 567 | break; |
400fbf9f JW |
568 | } |
569 | ||
570 | case RECORD_TYPE: | |
392202b0 | 571 | if (maybe_objc_comptypes (t1, t2, 0) == 1) |
4b027d16 RK |
572 | val = 1; |
573 | break; | |
e9a25f70 JL |
574 | |
575 | default: | |
576 | break; | |
400fbf9f | 577 | } |
4b027d16 | 578 | return attrval == 2 && val == 1 ? 2 : val; |
400fbf9f JW |
579 | } |
580 | ||
581 | /* Return 1 if TTL and TTR are pointers to types that are equivalent, | |
582 | ignoring their qualifiers. */ | |
583 | ||
584 | static int | |
585 | comp_target_types (ttl, ttr) | |
586 | tree ttl, ttr; | |
587 | { | |
392202b0 | 588 | int val; |
8b40563c | 589 | |
392202b0 | 590 | /* Give maybe_objc_comptypes a crack at letting these types through. */ |
1d300e19 | 591 | if ((val = maybe_objc_comptypes (ttl, ttr, 1)) >= 0) |
392202b0 | 592 | return val; |
8b40563c | 593 | |
392202b0 TW |
594 | val = comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (ttl)), |
595 | TYPE_MAIN_VARIANT (TREE_TYPE (ttr))); | |
8b40563c | 596 | |
400fbf9f JW |
597 | if (val == 2 && pedantic) |
598 | pedwarn ("types are not quite compatible"); | |
599 | return val; | |
600 | } | |
601 | \f | |
602 | /* Subroutines of `comptypes'. */ | |
603 | ||
604 | /* Return 1 if two function types F1 and F2 are compatible. | |
605 | If either type specifies no argument types, | |
606 | the other must specify a fixed number of self-promoting arg types. | |
607 | Otherwise, if one type specifies only the number of arguments, | |
608 | the other must specify that number of self-promoting arg types. | |
609 | Otherwise, the argument types must match. */ | |
610 | ||
611 | static int | |
612 | function_types_compatible_p (f1, f2) | |
613 | tree f1, f2; | |
614 | { | |
615 | tree args1, args2; | |
616 | /* 1 if no need for warning yet, 2 if warning cause has been seen. */ | |
617 | int val = 1; | |
618 | int val1; | |
619 | ||
620 | if (!(TREE_TYPE (f1) == TREE_TYPE (f2) | |
621 | || (val = comptypes (TREE_TYPE (f1), TREE_TYPE (f2))))) | |
622 | return 0; | |
623 | ||
624 | args1 = TYPE_ARG_TYPES (f1); | |
625 | args2 = TYPE_ARG_TYPES (f2); | |
626 | ||
627 | /* An unspecified parmlist matches any specified parmlist | |
628 | whose argument types don't need default promotions. */ | |
629 | ||
630 | if (args1 == 0) | |
631 | { | |
632 | if (!self_promoting_args_p (args2)) | |
633 | return 0; | |
634 | /* If one of these types comes from a non-prototype fn definition, | |
635 | compare that with the other type's arglist. | |
636 | If they don't match, ask for a warning (but no error). */ | |
637 | if (TYPE_ACTUAL_ARG_TYPES (f1) | |
638 | && 1 != type_lists_compatible_p (args2, TYPE_ACTUAL_ARG_TYPES (f1))) | |
639 | val = 2; | |
640 | return val; | |
641 | } | |
642 | if (args2 == 0) | |
643 | { | |
644 | if (!self_promoting_args_p (args1)) | |
645 | return 0; | |
646 | if (TYPE_ACTUAL_ARG_TYPES (f2) | |
647 | && 1 != type_lists_compatible_p (args1, TYPE_ACTUAL_ARG_TYPES (f2))) | |
648 | val = 2; | |
649 | return val; | |
650 | } | |
651 | ||
652 | /* Both types have argument lists: compare them and propagate results. */ | |
653 | val1 = type_lists_compatible_p (args1, args2); | |
654 | return val1 != 1 ? val1 : val; | |
655 | } | |
656 | ||
657 | /* Check two lists of types for compatibility, | |
658 | returning 0 for incompatible, 1 for compatible, | |
659 | or 2 for compatible with warning. */ | |
660 | ||
661 | static int | |
662 | type_lists_compatible_p (args1, args2) | |
663 | tree args1, args2; | |
664 | { | |
665 | /* 1 if no need for warning yet, 2 if warning cause has been seen. */ | |
666 | int val = 1; | |
9d5f3e49 | 667 | int newval = 0; |
400fbf9f JW |
668 | |
669 | while (1) | |
670 | { | |
671 | if (args1 == 0 && args2 == 0) | |
672 | return val; | |
673 | /* If one list is shorter than the other, | |
674 | they fail to match. */ | |
675 | if (args1 == 0 || args2 == 0) | |
676 | return 0; | |
677 | /* A null pointer instead of a type | |
678 | means there is supposed to be an argument | |
679 | but nothing is specified about what type it has. | |
680 | So match anything that self-promotes. */ | |
681 | if (TREE_VALUE (args1) == 0) | |
682 | { | |
ab393bf1 | 683 | if (c_type_promotes_to (TREE_VALUE (args2)) != TREE_VALUE (args2)) |
400fbf9f JW |
684 | return 0; |
685 | } | |
686 | else if (TREE_VALUE (args2) == 0) | |
687 | { | |
ab393bf1 | 688 | if (c_type_promotes_to (TREE_VALUE (args1)) != TREE_VALUE (args1)) |
400fbf9f JW |
689 | return 0; |
690 | } | |
0f38b811 MM |
691 | else if (! (newval = comptypes (TYPE_MAIN_VARIANT (TREE_VALUE (args1)), |
692 | TYPE_MAIN_VARIANT (TREE_VALUE (args2))))) | |
400fbf9f JW |
693 | { |
694 | /* Allow wait (union {union wait *u; int *i} *) | |
695 | and wait (union wait *) to be compatible. */ | |
696 | if (TREE_CODE (TREE_VALUE (args1)) == UNION_TYPE | |
ea3373cd RK |
697 | && (TYPE_NAME (TREE_VALUE (args1)) == 0 |
698 | || TYPE_TRANSPARENT_UNION (TREE_VALUE (args1))) | |
400fbf9f JW |
699 | && TREE_CODE (TYPE_SIZE (TREE_VALUE (args1))) == INTEGER_CST |
700 | && tree_int_cst_equal (TYPE_SIZE (TREE_VALUE (args1)), | |
701 | TYPE_SIZE (TREE_VALUE (args2)))) | |
702 | { | |
703 | tree memb; | |
704 | for (memb = TYPE_FIELDS (TREE_VALUE (args1)); | |
705 | memb; memb = TREE_CHAIN (memb)) | |
706 | if (comptypes (TREE_TYPE (memb), TREE_VALUE (args2))) | |
707 | break; | |
708 | if (memb == 0) | |
709 | return 0; | |
710 | } | |
711 | else if (TREE_CODE (TREE_VALUE (args2)) == UNION_TYPE | |
ea3373cd RK |
712 | && (TYPE_NAME (TREE_VALUE (args2)) == 0 |
713 | || TYPE_TRANSPARENT_UNION (TREE_VALUE (args2))) | |
400fbf9f JW |
714 | && TREE_CODE (TYPE_SIZE (TREE_VALUE (args2))) == INTEGER_CST |
715 | && tree_int_cst_equal (TYPE_SIZE (TREE_VALUE (args2)), | |
716 | TYPE_SIZE (TREE_VALUE (args1)))) | |
717 | { | |
718 | tree memb; | |
719 | for (memb = TYPE_FIELDS (TREE_VALUE (args2)); | |
720 | memb; memb = TREE_CHAIN (memb)) | |
721 | if (comptypes (TREE_TYPE (memb), TREE_VALUE (args1))) | |
722 | break; | |
723 | if (memb == 0) | |
724 | return 0; | |
725 | } | |
726 | else | |
727 | return 0; | |
728 | } | |
729 | ||
730 | /* comptypes said ok, but record if it said to warn. */ | |
731 | if (newval > val) | |
732 | val = newval; | |
733 | ||
734 | args1 = TREE_CHAIN (args1); | |
735 | args2 = TREE_CHAIN (args2); | |
736 | } | |
737 | } | |
400fbf9f | 738 | \f |
400fbf9f JW |
739 | /* Compute the value of the `sizeof' operator. */ |
740 | ||
741 | tree | |
742 | c_sizeof (type) | |
743 | tree type; | |
744 | { | |
745 | enum tree_code code = TREE_CODE (type); | |
0caa3c8e | 746 | tree size; |
400fbf9f JW |
747 | |
748 | if (code == FUNCTION_TYPE) | |
749 | { | |
750 | if (pedantic || warn_pointer_arith) | |
751 | pedwarn ("sizeof applied to a function type"); | |
0caa3c8e | 752 | size = size_one_node; |
400fbf9f | 753 | } |
0caa3c8e | 754 | else if (code == VOID_TYPE) |
400fbf9f JW |
755 | { |
756 | if (pedantic || warn_pointer_arith) | |
757 | pedwarn ("sizeof applied to a void type"); | |
0caa3c8e | 758 | size = size_one_node; |
400fbf9f | 759 | } |
0caa3c8e RH |
760 | else if (code == ERROR_MARK) |
761 | size = size_one_node; | |
762 | else if (!COMPLETE_TYPE_P (type)) | |
400fbf9f JW |
763 | { |
764 | error ("sizeof applied to an incomplete type"); | |
0caa3c8e | 765 | size = size_zero_node; |
400fbf9f | 766 | } |
0caa3c8e RH |
767 | else |
768 | /* Convert in case a char is more than one unit. */ | |
769 | size = size_binop (CEIL_DIV_EXPR, TYPE_SIZE_UNIT (type), | |
770 | size_int (TYPE_PRECISION (char_type_node) | |
771 | / BITS_PER_UNIT)); | |
772 | ||
773 | /* SIZE will have an integer type with TYPE_IS_SIZETYPE set. | |
774 | TYPE_IS_SIZETYPE means that certain things (like overflow) will | |
775 | never happen. However, this node should really have type | |
776 | `size_t', which is just a typedef for an ordinary integer type. */ | |
777 | return fold (build1 (NOP_EXPR, c_size_type_node, size)); | |
400fbf9f JW |
778 | } |
779 | ||
780 | tree | |
781 | c_sizeof_nowarn (type) | |
782 | tree type; | |
783 | { | |
784 | enum tree_code code = TREE_CODE (type); | |
0caa3c8e | 785 | tree size; |
400fbf9f | 786 | |
fed3cef0 | 787 | if (code == FUNCTION_TYPE || code == VOID_TYPE || code == ERROR_MARK) |
0caa3c8e RH |
788 | size = size_one_node; |
789 | else if (!COMPLETE_TYPE_P (type)) | |
790 | size = size_zero_node; | |
791 | else | |
792 | /* Convert in case a char is more than one unit. */ | |
793 | size = size_binop (CEIL_DIV_EXPR, TYPE_SIZE_UNIT (type), | |
794 | size_int (TYPE_PRECISION (char_type_node) | |
795 | / BITS_PER_UNIT)); | |
796 | ||
797 | /* SIZE will have an integer type with TYPE_IS_SIZETYPE set. | |
798 | TYPE_IS_SIZETYPE means that certain things (like overflow) will | |
799 | never happen. However, this node should really have type | |
800 | `size_t', which is just a typedef for an ordinary integer type. */ | |
801 | return fold (build1 (NOP_EXPR, c_size_type_node, size)); | |
400fbf9f JW |
802 | } |
803 | ||
804 | /* Compute the size to increment a pointer by. */ | |
805 | ||
806 | tree | |
807 | c_size_in_bytes (type) | |
808 | tree type; | |
809 | { | |
810 | enum tree_code code = TREE_CODE (type); | |
811 | ||
fed3cef0 RK |
812 | if (code == FUNCTION_TYPE || code == VOID_TYPE || code == ERROR_MARK) |
813 | return size_one_node; | |
814 | ||
d0f062fb | 815 | if (!COMPLETE_OR_VOID_TYPE_P (type)) |
400fbf9f JW |
816 | { |
817 | error ("arithmetic on pointer to an incomplete type"); | |
fed3cef0 | 818 | return size_one_node; |
400fbf9f JW |
819 | } |
820 | ||
821 | /* Convert in case a char is more than one unit. */ | |
fed3cef0 RK |
822 | return size_binop (CEIL_DIV_EXPR, TYPE_SIZE_UNIT (type), |
823 | size_int (TYPE_PRECISION (char_type_node) | |
824 | / BITS_PER_UNIT)); | |
400fbf9f | 825 | } |
400fbf9f | 826 | \f |
400fbf9f JW |
827 | /* Return either DECL or its known constant value (if it has one). */ |
828 | ||
56cb9733 | 829 | tree |
400fbf9f JW |
830 | decl_constant_value (decl) |
831 | tree decl; | |
832 | { | |
a7c1916a | 833 | if (/* Don't change a variable array bound or initial value to a constant |
400fbf9f | 834 | in a place where a variable is invalid. */ |
a7c1916a | 835 | current_function_decl != 0 |
400fbf9f | 836 | && ! TREE_THIS_VOLATILE (decl) |
83bab8db | 837 | && TREE_READONLY (decl) |
400fbf9f JW |
838 | && DECL_INITIAL (decl) != 0 |
839 | && TREE_CODE (DECL_INITIAL (decl)) != ERROR_MARK | |
840 | /* This is invalid if initial value is not constant. | |
841 | If it has either a function call, a memory reference, | |
842 | or a variable, then re-evaluating it could give different results. */ | |
843 | && TREE_CONSTANT (DECL_INITIAL (decl)) | |
844 | /* Check for cases where this is sub-optimal, even though valid. */ | |
2f74f7e9 | 845 | && TREE_CODE (DECL_INITIAL (decl)) != CONSTRUCTOR) |
400fbf9f JW |
846 | return DECL_INITIAL (decl); |
847 | return decl; | |
848 | } | |
849 | ||
2f74f7e9 JM |
850 | /* Return either DECL or its known constant value (if it has one), but |
851 | return DECL if pedantic or DECL has mode BLKmode. This is for | |
852 | bug-compatibility with the old behavior of decl_constant_value | |
853 | (before GCC 3.0); every use of this function is a bug and it should | |
854 | be removed before GCC 3.1. It is not appropriate to use pedantic | |
855 | in a way that affects optimization, and BLKmode is probably not the | |
856 | right test for avoiding misoptimizations either. */ | |
857 | ||
858 | static tree | |
859 | decl_constant_value_for_broken_optimization (decl) | |
860 | tree decl; | |
861 | { | |
862 | if (pedantic || DECL_MODE (decl) == BLKmode) | |
863 | return decl; | |
864 | else | |
865 | return decl_constant_value (decl); | |
866 | } | |
867 | ||
207bf485 JM |
868 | |
869 | /* Perform the default conversion of arrays and functions to pointers. | |
870 | Return the result of converting EXP. For any other expression, just | |
871 | return EXP. */ | |
872 | ||
873 | static tree | |
874 | default_function_array_conversion (exp) | |
875 | tree exp; | |
876 | { | |
877 | tree orig_exp; | |
878 | tree type = TREE_TYPE (exp); | |
879 | enum tree_code code = TREE_CODE (type); | |
880 | int not_lvalue = 0; | |
881 | ||
882 | /* Strip NON_LVALUE_EXPRs and no-op conversions, since we aren't using as | |
883 | an lvalue. | |
884 | ||
885 | Do not use STRIP_NOPS here! It will remove conversions from pointer | |
886 | to integer and cause infinite recursion. */ | |
887 | orig_exp = exp; | |
888 | while (TREE_CODE (exp) == NON_LVALUE_EXPR | |
889 | || (TREE_CODE (exp) == NOP_EXPR | |
890 | && TREE_TYPE (TREE_OPERAND (exp, 0)) == TREE_TYPE (exp))) | |
891 | { | |
892 | if (TREE_CODE (exp) == NON_LVALUE_EXPR) | |
893 | not_lvalue = 1; | |
894 | exp = TREE_OPERAND (exp, 0); | |
895 | } | |
896 | ||
897 | /* Preserve the original expression code. */ | |
898 | if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (TREE_CODE (exp)))) | |
899 | C_SET_EXP_ORIGINAL_CODE (exp, C_EXP_ORIGINAL_CODE (orig_exp)); | |
900 | ||
901 | if (code == FUNCTION_TYPE) | |
902 | { | |
903 | return build_unary_op (ADDR_EXPR, exp, 0); | |
904 | } | |
905 | if (code == ARRAY_TYPE) | |
906 | { | |
907 | tree adr; | |
908 | tree restype = TREE_TYPE (type); | |
909 | tree ptrtype; | |
910 | int constp = 0; | |
911 | int volatilep = 0; | |
912 | int lvalue_array_p; | |
913 | ||
914 | if (TREE_CODE_CLASS (TREE_CODE (exp)) == 'r' || DECL_P (exp)) | |
915 | { | |
916 | constp = TREE_READONLY (exp); | |
917 | volatilep = TREE_THIS_VOLATILE (exp); | |
918 | } | |
919 | ||
920 | if (TYPE_QUALS (type) || constp || volatilep) | |
921 | restype | |
922 | = c_build_qualified_type (restype, | |
923 | TYPE_QUALS (type) | |
924 | | (constp * TYPE_QUAL_CONST) | |
925 | | (volatilep * TYPE_QUAL_VOLATILE)); | |
926 | ||
927 | if (TREE_CODE (exp) == INDIRECT_REF) | |
928 | return convert (TYPE_POINTER_TO (restype), | |
929 | TREE_OPERAND (exp, 0)); | |
930 | ||
931 | if (TREE_CODE (exp) == COMPOUND_EXPR) | |
932 | { | |
933 | tree op1 = default_conversion (TREE_OPERAND (exp, 1)); | |
934 | return build (COMPOUND_EXPR, TREE_TYPE (op1), | |
935 | TREE_OPERAND (exp, 0), op1); | |
936 | } | |
937 | ||
938 | lvalue_array_p = !not_lvalue && lvalue_p (exp); | |
db3acfa5 | 939 | if (!flag_isoc99 && !lvalue_array_p) |
207bf485 JM |
940 | { |
941 | /* Before C99, non-lvalue arrays do not decay to pointers. | |
942 | Normally, using such an array would be invalid; but it can | |
943 | be used correctly inside sizeof or as a statement expression. | |
944 | Thus, do not give an error here; an error will result later. */ | |
945 | return exp; | |
946 | } | |
947 | ||
948 | ptrtype = build_pointer_type (restype); | |
949 | ||
950 | if (TREE_CODE (exp) == VAR_DECL) | |
951 | { | |
952 | /* ??? This is not really quite correct | |
953 | in that the type of the operand of ADDR_EXPR | |
954 | is not the target type of the type of the ADDR_EXPR itself. | |
955 | Question is, can this lossage be avoided? */ | |
956 | adr = build1 (ADDR_EXPR, ptrtype, exp); | |
dffd7eb6 | 957 | if (!c_mark_addressable (exp)) |
207bf485 JM |
958 | return error_mark_node; |
959 | TREE_CONSTANT (adr) = staticp (exp); | |
960 | TREE_SIDE_EFFECTS (adr) = 0; /* Default would be, same as EXP. */ | |
961 | return adr; | |
962 | } | |
963 | /* This way is better for a COMPONENT_REF since it can | |
964 | simplify the offset for a component. */ | |
965 | adr = build_unary_op (ADDR_EXPR, exp, 1); | |
966 | return convert (ptrtype, adr); | |
967 | } | |
968 | return exp; | |
969 | } | |
970 | ||
400fbf9f JW |
971 | /* Perform default promotions for C data used in expressions. |
972 | Arrays and functions are converted to pointers; | |
973 | enumeral types or short or char, to int. | |
974 | In addition, manifest constants symbols are replaced by their values. */ | |
975 | ||
976 | tree | |
977 | default_conversion (exp) | |
978 | tree exp; | |
979 | { | |
157689c6 | 980 | tree orig_exp; |
b3694847 SS |
981 | tree type = TREE_TYPE (exp); |
982 | enum tree_code code = TREE_CODE (type); | |
400fbf9f | 983 | |
207bf485 JM |
984 | if (code == FUNCTION_TYPE || code == ARRAY_TYPE) |
985 | return default_function_array_conversion (exp); | |
986 | ||
400fbf9f JW |
987 | /* Constants can be used directly unless they're not loadable. */ |
988 | if (TREE_CODE (exp) == CONST_DECL) | |
989 | exp = DECL_INITIAL (exp); | |
d4424a75 RK |
990 | |
991 | /* Replace a nonvolatile const static variable with its value unless | |
992 | it is an array, in which case we must be sure that taking the | |
993 | address of the array produces consistent results. */ | |
994 | else if (optimize && TREE_CODE (exp) == VAR_DECL && code != ARRAY_TYPE) | |
400fbf9f | 995 | { |
2f74f7e9 | 996 | exp = decl_constant_value_for_broken_optimization (exp); |
400fbf9f JW |
997 | type = TREE_TYPE (exp); |
998 | } | |
999 | ||
a7d53fce | 1000 | /* Strip NON_LVALUE_EXPRs and no-op conversions, since we aren't using as |
05bccae2 RK |
1001 | an lvalue. |
1002 | ||
1003 | Do not use STRIP_NOPS here! It will remove conversions from pointer | |
a7d53fce | 1004 | to integer and cause infinite recursion. */ |
157689c6 | 1005 | orig_exp = exp; |
a7d53fce RS |
1006 | while (TREE_CODE (exp) == NON_LVALUE_EXPR |
1007 | || (TREE_CODE (exp) == NOP_EXPR | |
1008 | && TREE_TYPE (TREE_OPERAND (exp, 0)) == TREE_TYPE (exp))) | |
1009 | exp = TREE_OPERAND (exp, 0); | |
400fbf9f | 1010 | |
157689c6 NB |
1011 | /* Preserve the original expression code. */ |
1012 | if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (TREE_CODE (exp)))) | |
1013 | C_SET_EXP_ORIGINAL_CODE (exp, C_EXP_ORIGINAL_CODE (orig_exp)); | |
1014 | ||
400fbf9f JW |
1015 | /* Normally convert enums to int, |
1016 | but convert wide enums to something wider. */ | |
1017 | if (code == ENUMERAL_TYPE) | |
1018 | { | |
b0c48229 NB |
1019 | type = c_common_type_for_size (MAX (TYPE_PRECISION (type), |
1020 | TYPE_PRECISION (integer_type_node)), | |
1021 | ((TYPE_PRECISION (type) | |
1022 | >= TYPE_PRECISION (integer_type_node)) | |
1023 | && TREE_UNSIGNED (type))); | |
05bccae2 | 1024 | |
400fbf9f JW |
1025 | return convert (type, exp); |
1026 | } | |
1027 | ||
9753f113 | 1028 | if (TREE_CODE (exp) == COMPONENT_REF |
05bccae2 | 1029 | && DECL_C_BIT_FIELD (TREE_OPERAND (exp, 1)) |
cff9c407 | 1030 | /* If it's thinner than an int, promote it like a |
d72040f5 | 1031 | c_promoting_integer_type_p, otherwise leave it alone. */ |
05bccae2 RK |
1032 | && 0 > compare_tree_int (DECL_SIZE (TREE_OPERAND (exp, 1)), |
1033 | TYPE_PRECISION (integer_type_node))) | |
f458d1d5 | 1034 | return convert (integer_type_node, exp); |
9753f113 | 1035 | |
d72040f5 | 1036 | if (c_promoting_integer_type_p (type)) |
400fbf9f | 1037 | { |
f458d1d5 | 1038 | /* Preserve unsignedness if not really getting any wider. */ |
e83d45c4 | 1039 | if (TREE_UNSIGNED (type) |
f458d1d5 | 1040 | && TYPE_PRECISION (type) == TYPE_PRECISION (integer_type_node)) |
400fbf9f | 1041 | return convert (unsigned_type_node, exp); |
05bccae2 | 1042 | |
400fbf9f JW |
1043 | return convert (integer_type_node, exp); |
1044 | } | |
05bccae2 | 1045 | |
400fbf9f JW |
1046 | if (code == VOID_TYPE) |
1047 | { | |
1048 | error ("void value not ignored as it ought to be"); | |
1049 | return error_mark_node; | |
1050 | } | |
400fbf9f JW |
1051 | return exp; |
1052 | } | |
1053 | \f | |
e9b2c823 NB |
1054 | /* Look up COMPONENT in a structure or union DECL. |
1055 | ||
1056 | If the component name is not found, returns NULL_TREE. Otherwise, | |
1057 | the return value is a TREE_LIST, with each TREE_VALUE a FIELD_DECL | |
1058 | stepping down the chain to the component, which is in the last | |
1059 | TREE_VALUE of the list. Normally the list is of length one, but if | |
1060 | the component is embedded within (nested) anonymous structures or | |
1061 | unions, the list steps down the chain to the component. */ | |
2f2d13da DE |
1062 | |
1063 | static tree | |
e9b2c823 NB |
1064 | lookup_field (decl, component) |
1065 | tree decl, component; | |
2f2d13da | 1066 | { |
e9b2c823 | 1067 | tree type = TREE_TYPE (decl); |
2f2d13da DE |
1068 | tree field; |
1069 | ||
1070 | /* If TYPE_LANG_SPECIFIC is set, then it is a sorted array of pointers | |
1071 | to the field elements. Use a binary search on this array to quickly | |
1072 | find the element. Otherwise, do a linear search. TYPE_LANG_SPECIFIC | |
1073 | will always be set for structures which have many elements. */ | |
1074 | ||
1075 | if (TYPE_LANG_SPECIFIC (type)) | |
1076 | { | |
1077 | int bot, top, half; | |
1078 | tree *field_array = &TYPE_LANG_SPECIFIC (type)->elts[0]; | |
1079 | ||
1080 | field = TYPE_FIELDS (type); | |
1081 | bot = 0; | |
1082 | top = TYPE_LANG_SPECIFIC (type)->len; | |
1083 | while (top - bot > 1) | |
1084 | { | |
2f2d13da DE |
1085 | half = (top - bot + 1) >> 1; |
1086 | field = field_array[bot+half]; | |
1087 | ||
1088 | if (DECL_NAME (field) == NULL_TREE) | |
1089 | { | |
1090 | /* Step through all anon unions in linear fashion. */ | |
1091 | while (DECL_NAME (field_array[bot]) == NULL_TREE) | |
1092 | { | |
2f2d13da | 1093 | field = field_array[bot++]; |
a68b98cf RK |
1094 | if (TREE_CODE (TREE_TYPE (field)) == RECORD_TYPE |
1095 | || TREE_CODE (TREE_TYPE (field)) == UNION_TYPE) | |
19d76e60 | 1096 | { |
e9b2c823 NB |
1097 | tree anon = lookup_field (field, component); |
1098 | ||
1099 | if (anon) | |
1100 | return tree_cons (NULL_TREE, field, anon); | |
1101 | } | |
2f2d13da DE |
1102 | } |
1103 | ||
1104 | /* Entire record is only anon unions. */ | |
1105 | if (bot > top) | |
1106 | return NULL_TREE; | |
1107 | ||
1108 | /* Restart the binary search, with new lower bound. */ | |
1109 | continue; | |
1110 | } | |
1111 | ||
e8b87aac | 1112 | if (DECL_NAME (field) == component) |
2f2d13da | 1113 | break; |
e8b87aac | 1114 | if (DECL_NAME (field) < component) |
2f2d13da DE |
1115 | bot += half; |
1116 | else | |
1117 | top = bot + half; | |
1118 | } | |
1119 | ||
1120 | if (DECL_NAME (field_array[bot]) == component) | |
1121 | field = field_array[bot]; | |
1122 | else if (DECL_NAME (field) != component) | |
e9b2c823 | 1123 | return NULL_TREE; |
2f2d13da DE |
1124 | } |
1125 | else | |
1126 | { | |
1127 | for (field = TYPE_FIELDS (type); field; field = TREE_CHAIN (field)) | |
1128 | { | |
e9b2c823 NB |
1129 | if (DECL_NAME (field) == NULL_TREE |
1130 | && (TREE_CODE (TREE_TYPE (field)) == RECORD_TYPE | |
1131 | || TREE_CODE (TREE_TYPE (field)) == UNION_TYPE)) | |
2f2d13da | 1132 | { |
e9b2c823 | 1133 | tree anon = lookup_field (field, component); |
a68b98cf | 1134 | |
e9b2c823 NB |
1135 | if (anon) |
1136 | return tree_cons (NULL_TREE, field, anon); | |
2f2d13da DE |
1137 | } |
1138 | ||
1139 | if (DECL_NAME (field) == component) | |
1140 | break; | |
1141 | } | |
e9b2c823 NB |
1142 | |
1143 | if (field == NULL_TREE) | |
1144 | return NULL_TREE; | |
2f2d13da DE |
1145 | } |
1146 | ||
e9b2c823 | 1147 | return tree_cons (NULL_TREE, field, NULL_TREE); |
2f2d13da DE |
1148 | } |
1149 | ||
400fbf9f JW |
1150 | /* Make an expression to refer to the COMPONENT field of |
1151 | structure or union value DATUM. COMPONENT is an IDENTIFIER_NODE. */ | |
1152 | ||
1153 | tree | |
1154 | build_component_ref (datum, component) | |
1155 | tree datum, component; | |
1156 | { | |
b3694847 SS |
1157 | tree type = TREE_TYPE (datum); |
1158 | enum tree_code code = TREE_CODE (type); | |
1159 | tree field = NULL; | |
1160 | tree ref; | |
400fbf9f | 1161 | |
207bf485 JM |
1162 | /* If DATUM is a COMPOUND_EXPR, move our reference inside it. |
1163 | If pedantic ensure that the arguments are not lvalues; otherwise, | |
1164 | if the component is an array, it would wrongly decay to a pointer in | |
1165 | C89 mode. | |
1166 | We cannot do this with a COND_EXPR, because in a conditional expression | |
1167 | the default promotions are applied to both sides, and this would yield | |
1168 | the wrong type of the result; for example, if the components have | |
1169 | type "char". */ | |
400fbf9f JW |
1170 | switch (TREE_CODE (datum)) |
1171 | { | |
1172 | case COMPOUND_EXPR: | |
1173 | { | |
1174 | tree value = build_component_ref (TREE_OPERAND (datum, 1), component); | |
400fbf9f | 1175 | return build (COMPOUND_EXPR, TREE_TYPE (value), |
207bf485 | 1176 | TREE_OPERAND (datum, 0), pedantic_non_lvalue (value)); |
400fbf9f | 1177 | } |
e9a25f70 JL |
1178 | default: |
1179 | break; | |
400fbf9f JW |
1180 | } |
1181 | ||
1182 | /* See if there is a field or component with name COMPONENT. */ | |
1183 | ||
1184 | if (code == RECORD_TYPE || code == UNION_TYPE) | |
1185 | { | |
d0f062fb | 1186 | if (!COMPLETE_TYPE_P (type)) |
400fbf9f | 1187 | { |
7a228918 | 1188 | c_incomplete_type_error (NULL_TREE, type); |
400fbf9f JW |
1189 | return error_mark_node; |
1190 | } | |
1191 | ||
e9b2c823 | 1192 | field = lookup_field (datum, component); |
400fbf9f JW |
1193 | |
1194 | if (!field) | |
1195 | { | |
913d0833 KG |
1196 | error ("%s has no member named `%s'", |
1197 | code == RECORD_TYPE ? "structure" : "union", | |
400fbf9f JW |
1198 | IDENTIFIER_POINTER (component)); |
1199 | return error_mark_node; | |
1200 | } | |
400fbf9f | 1201 | |
e9b2c823 NB |
1202 | /* Chain the COMPONENT_REFs if necessary down to the FIELD. |
1203 | This might be better solved in future the way the C++ front | |
1204 | end does it - by giving the anonymous entities each a | |
1205 | separate name and type, and then have build_component_ref | |
1206 | recursively call itself. We can't do that here. */ | |
1207 | for (; field; field = TREE_CHAIN (field)) | |
19d76e60 | 1208 | { |
e9b2c823 NB |
1209 | tree subdatum = TREE_VALUE (field); |
1210 | ||
1211 | if (TREE_TYPE (subdatum) == error_mark_node) | |
1212 | return error_mark_node; | |
1213 | ||
1214 | ref = build (COMPONENT_REF, TREE_TYPE (subdatum), datum, subdatum); | |
1215 | if (TREE_READONLY (datum) || TREE_READONLY (subdatum)) | |
19d76e60 | 1216 | TREE_READONLY (ref) = 1; |
e9b2c823 | 1217 | if (TREE_THIS_VOLATILE (datum) || TREE_THIS_VOLATILE (subdatum)) |
19d76e60 | 1218 | TREE_THIS_VOLATILE (ref) = 1; |
e23bd218 IR |
1219 | |
1220 | if (TREE_DEPRECATED (subdatum)) | |
1221 | warn_deprecated_use (subdatum); | |
1222 | ||
19d76e60 RK |
1223 | datum = ref; |
1224 | } | |
1225 | ||
400fbf9f JW |
1226 | return ref; |
1227 | } | |
1228 | else if (code != ERROR_MARK) | |
1229 | error ("request for member `%s' in something not a structure or union", | |
1230 | IDENTIFIER_POINTER (component)); | |
1231 | ||
1232 | return error_mark_node; | |
1233 | } | |
1234 | \f | |
1235 | /* Given an expression PTR for a pointer, return an expression | |
1236 | for the value pointed to. | |
1237 | ERRORSTRING is the name of the operator to appear in error messages. */ | |
1238 | ||
1239 | tree | |
1240 | build_indirect_ref (ptr, errorstring) | |
1241 | tree ptr; | |
5d5993dd | 1242 | const char *errorstring; |
400fbf9f | 1243 | { |
b3694847 SS |
1244 | tree pointer = default_conversion (ptr); |
1245 | tree type = TREE_TYPE (pointer); | |
400fbf9f JW |
1246 | |
1247 | if (TREE_CODE (type) == POINTER_TYPE) | |
870cc33b RS |
1248 | { |
1249 | if (TREE_CODE (pointer) == ADDR_EXPR | |
1250 | && !flag_volatile | |
1251 | && (TREE_TYPE (TREE_OPERAND (pointer, 0)) | |
1252 | == TREE_TYPE (type))) | |
1253 | return TREE_OPERAND (pointer, 0); | |
1254 | else | |
1255 | { | |
1256 | tree t = TREE_TYPE (type); | |
b3694847 | 1257 | tree ref = build1 (INDIRECT_REF, TYPE_MAIN_VARIANT (t), pointer); |
400fbf9f | 1258 | |
baae9b65 | 1259 | if (!COMPLETE_OR_VOID_TYPE_P (t) && TREE_CODE (t) != ARRAY_TYPE) |
870cc33b RS |
1260 | { |
1261 | error ("dereferencing pointer to incomplete type"); | |
1262 | return error_mark_node; | |
1263 | } | |
baae9b65 | 1264 | if (VOID_TYPE_P (t) && skip_evaluation == 0) |
870cc33b RS |
1265 | warning ("dereferencing `void *' pointer"); |
1266 | ||
1267 | /* We *must* set TREE_READONLY when dereferencing a pointer to const, | |
1268 | so that we get the proper error message if the result is used | |
1269 | to assign to. Also, &* is supposed to be a no-op. | |
1270 | And ANSI C seems to specify that the type of the result | |
1271 | should be the const type. */ | |
1272 | /* A de-reference of a pointer to const is not a const. It is valid | |
1273 | to change it via some other pointer. */ | |
1274 | TREE_READONLY (ref) = TYPE_READONLY (t); | |
1275 | TREE_SIDE_EFFECTS (ref) | |
1276 | = TYPE_VOLATILE (t) || TREE_SIDE_EFFECTS (pointer) || flag_volatile; | |
493692cd | 1277 | TREE_THIS_VOLATILE (ref) = TYPE_VOLATILE (t); |
870cc33b RS |
1278 | return ref; |
1279 | } | |
1280 | } | |
400fbf9f JW |
1281 | else if (TREE_CODE (pointer) != ERROR_MARK) |
1282 | error ("invalid type argument of `%s'", errorstring); | |
1283 | return error_mark_node; | |
1284 | } | |
1285 | ||
1286 | /* This handles expressions of the form "a[i]", which denotes | |
1287 | an array reference. | |
1288 | ||
1289 | This is logically equivalent in C to *(a+i), but we may do it differently. | |
1290 | If A is a variable or a member, we generate a primitive ARRAY_REF. | |
1291 | This avoids forcing the array out of registers, and can work on | |
1292 | arrays that are not lvalues (for example, members of structures returned | |
1293 | by functions). */ | |
1294 | ||
1295 | tree | |
1296 | build_array_ref (array, index) | |
1297 | tree array, index; | |
1298 | { | |
1299 | if (index == 0) | |
1300 | { | |
1301 | error ("subscript missing in array reference"); | |
1302 | return error_mark_node; | |
1303 | } | |
1304 | ||
1305 | if (TREE_TYPE (array) == error_mark_node | |
1306 | || TREE_TYPE (index) == error_mark_node) | |
1307 | return error_mark_node; | |
1308 | ||
1309 | if (TREE_CODE (TREE_TYPE (array)) == ARRAY_TYPE | |
1310 | && TREE_CODE (array) != INDIRECT_REF) | |
1311 | { | |
1312 | tree rval, type; | |
1313 | ||
400fbf9f JW |
1314 | /* Subscripting with type char is likely to lose |
1315 | on a machine where chars are signed. | |
1316 | So warn on any machine, but optionally. | |
1317 | Don't warn for unsigned char since that type is safe. | |
1318 | Don't warn for signed char because anyone who uses that | |
1319 | must have done so deliberately. */ | |
1320 | if (warn_char_subscripts | |
1321 | && TYPE_MAIN_VARIANT (TREE_TYPE (index)) == char_type_node) | |
1322 | warning ("array subscript has type `char'"); | |
1323 | ||
0e51ef9b RS |
1324 | /* Apply default promotions *after* noticing character types. */ |
1325 | index = default_conversion (index); | |
1326 | ||
fdeefd49 RS |
1327 | /* Require integer *after* promotion, for sake of enums. */ |
1328 | if (TREE_CODE (TREE_TYPE (index)) != INTEGER_TYPE) | |
1329 | { | |
1330 | error ("array subscript is not an integer"); | |
1331 | return error_mark_node; | |
1332 | } | |
1333 | ||
400fbf9f JW |
1334 | /* An array that is indexed by a non-constant |
1335 | cannot be stored in a register; we must be able to do | |
1336 | address arithmetic on its address. | |
1337 | Likewise an array of elements of variable size. */ | |
1338 | if (TREE_CODE (index) != INTEGER_CST | |
d0f062fb | 1339 | || (COMPLETE_TYPE_P (TREE_TYPE (TREE_TYPE (array))) |
400fbf9f JW |
1340 | && TREE_CODE (TYPE_SIZE (TREE_TYPE (TREE_TYPE (array)))) != INTEGER_CST)) |
1341 | { | |
dffd7eb6 | 1342 | if (!c_mark_addressable (array)) |
400fbf9f JW |
1343 | return error_mark_node; |
1344 | } | |
e6d52559 JW |
1345 | /* An array that is indexed by a constant value which is not within |
1346 | the array bounds cannot be stored in a register either; because we | |
1347 | would get a crash in store_bit_field/extract_bit_field when trying | |
1348 | to access a non-existent part of the register. */ | |
1349 | if (TREE_CODE (index) == INTEGER_CST | |
1350 | && TYPE_VALUES (TREE_TYPE (array)) | |
1351 | && ! int_fits_type_p (index, TYPE_VALUES (TREE_TYPE (array)))) | |
1352 | { | |
dffd7eb6 | 1353 | if (!c_mark_addressable (array)) |
e6d52559 JW |
1354 | return error_mark_node; |
1355 | } | |
400fbf9f | 1356 | |
400fbf9f JW |
1357 | if (pedantic) |
1358 | { | |
1359 | tree foo = array; | |
1360 | while (TREE_CODE (foo) == COMPONENT_REF) | |
1361 | foo = TREE_OPERAND (foo, 0); | |
1394aabd | 1362 | if (TREE_CODE (foo) == VAR_DECL && DECL_REGISTER (foo)) |
05273f08 GK |
1363 | pedwarn ("ISO C forbids subscripting `register' array"); |
1364 | else if (! flag_isoc99 && ! lvalue_p (foo)) | |
89abf8d1 | 1365 | pedwarn ("ISO C89 forbids subscripting non-lvalue array"); |
400fbf9f JW |
1366 | } |
1367 | ||
1368 | type = TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (array))); | |
1369 | rval = build (ARRAY_REF, type, array, index); | |
1370 | /* Array ref is const/volatile if the array elements are | |
1371 | or if the array is. */ | |
1372 | TREE_READONLY (rval) | |
1373 | |= (TYPE_READONLY (TREE_TYPE (TREE_TYPE (array))) | |
1374 | | TREE_READONLY (array)); | |
1375 | TREE_SIDE_EFFECTS (rval) | |
1376 | |= (TYPE_VOLATILE (TREE_TYPE (TREE_TYPE (array))) | |
1377 | | TREE_SIDE_EFFECTS (array)); | |
1378 | TREE_THIS_VOLATILE (rval) | |
1379 | |= (TYPE_VOLATILE (TREE_TYPE (TREE_TYPE (array))) | |
1380 | /* This was added by rms on 16 Nov 91. | |
1381 | It fixes vol struct foo *a; a->elts[1] | |
1382 | in an inline function. | |
1383 | Hope it doesn't break something else. */ | |
1384 | | TREE_THIS_VOLATILE (array)); | |
1385 | return require_complete_type (fold (rval)); | |
1386 | } | |
1387 | ||
1388 | { | |
1389 | tree ar = default_conversion (array); | |
1390 | tree ind = default_conversion (index); | |
1391 | ||
aed11452 RK |
1392 | /* Do the same warning check as above, but only on the part that's |
1393 | syntactically the index and only if it is also semantically | |
1394 | the index. */ | |
1395 | if (warn_char_subscripts | |
1396 | && TREE_CODE (TREE_TYPE (index)) == INTEGER_TYPE | |
1397 | && TYPE_MAIN_VARIANT (TREE_TYPE (index)) == char_type_node) | |
1398 | warning ("subscript has type `char'"); | |
1399 | ||
400fbf9f JW |
1400 | /* Put the integer in IND to simplify error checking. */ |
1401 | if (TREE_CODE (TREE_TYPE (ar)) == INTEGER_TYPE) | |
1402 | { | |
1403 | tree temp = ar; | |
1404 | ar = ind; | |
1405 | ind = temp; | |
1406 | } | |
1407 | ||
1408 | if (ar == error_mark_node) | |
1409 | return ar; | |
1410 | ||
004252d7 RK |
1411 | if (TREE_CODE (TREE_TYPE (ar)) != POINTER_TYPE |
1412 | || TREE_CODE (TREE_TYPE (TREE_TYPE (ar))) == FUNCTION_TYPE) | |
400fbf9f JW |
1413 | { |
1414 | error ("subscripted value is neither array nor pointer"); | |
1415 | return error_mark_node; | |
1416 | } | |
1417 | if (TREE_CODE (TREE_TYPE (ind)) != INTEGER_TYPE) | |
1418 | { | |
1419 | error ("array subscript is not an integer"); | |
1420 | return error_mark_node; | |
1421 | } | |
1422 | ||
1423 | return build_indirect_ref (build_binary_op (PLUS_EXPR, ar, ind, 0), | |
1424 | "array indexing"); | |
1425 | } | |
1426 | } | |
1427 | \f | |
7e585d16 ZW |
1428 | /* Build an external reference to identifier ID. FUN indicates |
1429 | whether this will be used for a function call. */ | |
1430 | tree | |
1431 | build_external_ref (id, fun) | |
1432 | tree id; | |
1433 | int fun; | |
1434 | { | |
1435 | tree ref; | |
1436 | tree decl = lookup_name (id); | |
1437 | tree objc_ivar = lookup_objc_ivar (id); | |
1438 | ||
e23bd218 IR |
1439 | if (decl && TREE_DEPRECATED (decl)) |
1440 | warn_deprecated_use (decl); | |
1441 | ||
7e585d16 ZW |
1442 | if (!decl || decl == error_mark_node || C_DECL_ANTICIPATED (decl)) |
1443 | { | |
1444 | if (objc_ivar) | |
1445 | ref = objc_ivar; | |
1446 | else if (fun) | |
1447 | { | |
1448 | if (!decl || decl == error_mark_node) | |
1449 | /* Ordinary implicit function declaration. */ | |
1450 | ref = implicitly_declare (id); | |
1451 | else | |
1452 | { | |
1453 | /* Implicit declaration of built-in function. Don't | |
1454 | change the built-in declaration, but don't let this | |
1455 | go by silently, either. */ | |
111458f1 ZW |
1456 | implicit_decl_warning (id); |
1457 | ||
1458 | /* only issue this warning once */ | |
1459 | C_DECL_ANTICIPATED (decl) = 0; | |
7e585d16 ZW |
1460 | ref = decl; |
1461 | } | |
1462 | } | |
1463 | else | |
1464 | { | |
1465 | /* Reference to undeclared variable, including reference to | |
1466 | builtin outside of function-call context. */ | |
1467 | if (current_function_decl == 0) | |
1468 | error ("`%s' undeclared here (not in a function)", | |
1469 | IDENTIFIER_POINTER (id)); | |
1470 | else | |
1471 | { | |
1472 | if (IDENTIFIER_GLOBAL_VALUE (id) != error_mark_node | |
1473 | || IDENTIFIER_ERROR_LOCUS (id) != current_function_decl) | |
1474 | { | |
1475 | error ("`%s' undeclared (first use in this function)", | |
1476 | IDENTIFIER_POINTER (id)); | |
1477 | ||
1478 | if (! undeclared_variable_notice) | |
1479 | { | |
1480 | error ("(Each undeclared identifier is reported only once"); | |
1481 | error ("for each function it appears in.)"); | |
1482 | undeclared_variable_notice = 1; | |
1483 | } | |
1484 | } | |
1485 | IDENTIFIER_GLOBAL_VALUE (id) = error_mark_node; | |
1486 | IDENTIFIER_ERROR_LOCUS (id) = current_function_decl; | |
1487 | } | |
1488 | return error_mark_node; | |
1489 | } | |
1490 | } | |
1491 | else | |
1492 | { | |
1493 | /* Properly declared variable or function reference. */ | |
1494 | if (!objc_ivar) | |
1495 | ref = decl; | |
1496 | else if (decl != objc_ivar && IDENTIFIER_LOCAL_VALUE (id)) | |
1497 | { | |
1498 | warning ("local declaration of `%s' hides instance variable", | |
1499 | IDENTIFIER_POINTER (id)); | |
1500 | ref = decl; | |
1501 | } | |
1502 | else | |
1503 | ref = objc_ivar; | |
1504 | } | |
1505 | ||
1506 | if (TREE_TYPE (ref) == error_mark_node) | |
1507 | return error_mark_node; | |
1508 | ||
1509 | assemble_external (ref); | |
1510 | TREE_USED (ref) = 1; | |
1511 | ||
1512 | if (TREE_CODE (ref) == CONST_DECL) | |
1513 | { | |
1514 | ref = DECL_INITIAL (ref); | |
1515 | TREE_CONSTANT (ref) = 1; | |
1516 | } | |
1517 | ||
1518 | return ref; | |
1519 | } | |
1520 | ||
400fbf9f JW |
1521 | /* Build a function call to function FUNCTION with parameters PARAMS. |
1522 | PARAMS is a list--a chain of TREE_LIST nodes--in which the | |
1523 | TREE_VALUE of each node is a parameter-expression. | |
1524 | FUNCTION's data type may be a function type or a pointer-to-function. */ | |
1525 | ||
1526 | tree | |
1527 | build_function_call (function, params) | |
1528 | tree function, params; | |
1529 | { | |
b3694847 SS |
1530 | tree fntype, fundecl = 0; |
1531 | tree coerced_params; | |
1eb8759b | 1532 | tree name = NULL_TREE, assembler_name = NULL_TREE, result; |
400fbf9f | 1533 | |
fc76e425 | 1534 | /* Strip NON_LVALUE_EXPRs, etc., since we aren't using as an lvalue. */ |
a7d53fce | 1535 | STRIP_TYPE_NOPS (function); |
400fbf9f JW |
1536 | |
1537 | /* Convert anything with function type to a pointer-to-function. */ | |
1538 | if (TREE_CODE (function) == FUNCTION_DECL) | |
1539 | { | |
1540 | name = DECL_NAME (function); | |
19d76e60 RK |
1541 | assembler_name = DECL_ASSEMBLER_NAME (function); |
1542 | ||
400fbf9f JW |
1543 | /* Differs from default_conversion by not setting TREE_ADDRESSABLE |
1544 | (because calling an inline function does not mean the function | |
1545 | needs to be separately compiled). */ | |
1546 | fntype = build_type_variant (TREE_TYPE (function), | |
1547 | TREE_READONLY (function), | |
1548 | TREE_THIS_VOLATILE (function)); | |
9b7267b8 | 1549 | fundecl = function; |
400fbf9f JW |
1550 | function = build1 (ADDR_EXPR, build_pointer_type (fntype), function); |
1551 | } | |
1552 | else | |
1553 | function = default_conversion (function); | |
1554 | ||
1555 | fntype = TREE_TYPE (function); | |
1556 | ||
1557 | if (TREE_CODE (fntype) == ERROR_MARK) | |
1558 | return error_mark_node; | |
1559 | ||
1560 | if (!(TREE_CODE (fntype) == POINTER_TYPE | |
1561 | && TREE_CODE (TREE_TYPE (fntype)) == FUNCTION_TYPE)) | |
1562 | { | |
1563 | error ("called object is not a function"); | |
1564 | return error_mark_node; | |
1565 | } | |
1566 | ||
5ce89b2e JM |
1567 | if (fundecl && TREE_THIS_VOLATILE (fundecl)) |
1568 | current_function_returns_abnormally = 1; | |
1569 | ||
400fbf9f JW |
1570 | /* fntype now gets the type of function pointed to. */ |
1571 | fntype = TREE_TYPE (fntype); | |
1572 | ||
1573 | /* Convert the parameters to the types declared in the | |
1574 | function prototype, or apply default promotions. */ | |
1575 | ||
1576 | coerced_params | |
9b7267b8 | 1577 | = convert_arguments (TYPE_ARG_TYPES (fntype), params, name, fundecl); |
400fbf9f JW |
1578 | |
1579 | /* Check for errors in format strings. */ | |
400fbf9f | 1580 | |
80a497e4 JM |
1581 | if (warn_format) |
1582 | check_function_format (NULL, TYPE_ATTRIBUTES (fntype), coerced_params); | |
400fbf9f JW |
1583 | |
1584 | /* Recognize certain built-in functions so we can make tree-codes | |
1585 | other than CALL_EXPR. We do this when it enables fold-const.c | |
1586 | to do something useful. */ | |
1587 | ||
1588 | if (TREE_CODE (function) == ADDR_EXPR | |
1589 | && TREE_CODE (TREE_OPERAND (function, 0)) == FUNCTION_DECL | |
1eb8759b RH |
1590 | && DECL_BUILT_IN (TREE_OPERAND (function, 0))) |
1591 | { | |
1592 | result = expand_tree_builtin (TREE_OPERAND (function, 0), | |
1593 | params, coerced_params); | |
1594 | if (result) | |
1595 | return result; | |
1596 | } | |
400fbf9f | 1597 | |
1eb8759b RH |
1598 | result = build (CALL_EXPR, TREE_TYPE (fntype), |
1599 | function, coerced_params, NULL_TREE); | |
1eb8759b | 1600 | TREE_SIDE_EFFECTS (result) = 1; |
b0b3afb2 BS |
1601 | result = fold (result); |
1602 | ||
71653180 | 1603 | if (VOID_TYPE_P (TREE_TYPE (result))) |
1eb8759b RH |
1604 | return result; |
1605 | return require_complete_type (result); | |
400fbf9f JW |
1606 | } |
1607 | \f | |
1608 | /* Convert the argument expressions in the list VALUES | |
1609 | to the types in the list TYPELIST. The result is a list of converted | |
1610 | argument expressions. | |
1611 | ||
1612 | If TYPELIST is exhausted, or when an element has NULL as its type, | |
1613 | perform the default conversions. | |
1614 | ||
1615 | PARMLIST is the chain of parm decls for the function being called. | |
1616 | It may be 0, if that info is not available. | |
1617 | It is used only for generating error messages. | |
1618 | ||
1619 | NAME is an IDENTIFIER_NODE or 0. It is used only for error messages. | |
1620 | ||
1621 | This is also where warnings about wrong number of args are generated. | |
1622 | ||
1623 | Both VALUES and the returned value are chains of TREE_LIST nodes | |
1624 | with the elements of the list in the TREE_VALUE slots of those nodes. */ | |
1625 | ||
1626 | static tree | |
9b7267b8 RS |
1627 | convert_arguments (typelist, values, name, fundecl) |
1628 | tree typelist, values, name, fundecl; | |
400fbf9f | 1629 | { |
b3694847 SS |
1630 | tree typetail, valtail; |
1631 | tree result = NULL; | |
400fbf9f JW |
1632 | int parmnum; |
1633 | ||
1634 | /* Scan the given expressions and types, producing individual | |
1635 | converted arguments and pushing them on RESULT in reverse order. */ | |
1636 | ||
1637 | for (valtail = values, typetail = typelist, parmnum = 0; | |
1638 | valtail; | |
1639 | valtail = TREE_CHAIN (valtail), parmnum++) | |
1640 | { | |
b3694847 SS |
1641 | tree type = typetail ? TREE_VALUE (typetail) : 0; |
1642 | tree val = TREE_VALUE (valtail); | |
400fbf9f JW |
1643 | |
1644 | if (type == void_type_node) | |
1645 | { | |
1646 | if (name) | |
1647 | error ("too many arguments to function `%s'", | |
1648 | IDENTIFIER_POINTER (name)); | |
1649 | else | |
1650 | error ("too many arguments to function"); | |
1651 | break; | |
1652 | } | |
1653 | ||
1654 | /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */ | |
fc76e425 RS |
1655 | /* Do not use STRIP_NOPS here! We do not want an enumerator with value 0 |
1656 | to convert automatically to a pointer. */ | |
400fbf9f JW |
1657 | if (TREE_CODE (val) == NON_LVALUE_EXPR) |
1658 | val = TREE_OPERAND (val, 0); | |
1659 | ||
207bf485 | 1660 | val = default_function_array_conversion (val); |
400fbf9f JW |
1661 | |
1662 | val = require_complete_type (val); | |
1663 | ||
1664 | if (type != 0) | |
1665 | { | |
1666 | /* Formal parm type is specified by a function prototype. */ | |
1667 | tree parmval; | |
1668 | ||
d0f062fb | 1669 | if (!COMPLETE_TYPE_P (type)) |
400fbf9f JW |
1670 | { |
1671 | error ("type of formal parameter %d is incomplete", parmnum + 1); | |
1672 | parmval = val; | |
1673 | } | |
1674 | else | |
1675 | { | |
d45cf215 RS |
1676 | /* Optionally warn about conversions that |
1677 | differ from the default conversions. */ | |
03829ad2 | 1678 | if (warn_conversion || warn_traditional) |
400fbf9f JW |
1679 | { |
1680 | int formal_prec = TYPE_PRECISION (type); | |
400fbf9f | 1681 | |
aae43c5f | 1682 | if (INTEGRAL_TYPE_P (type) |
400fbf9f | 1683 | && TREE_CODE (TREE_TYPE (val)) == REAL_TYPE) |
754a4d82 | 1684 | warn_for_assignment ("%s as integer rather than floating due to prototype", (char *) 0, name, parmnum + 1); |
03829ad2 KG |
1685 | if (INTEGRAL_TYPE_P (type) |
1686 | && TREE_CODE (TREE_TYPE (val)) == COMPLEX_TYPE) | |
1687 | warn_for_assignment ("%s as integer rather than complex due to prototype", (char *) 0, name, parmnum + 1); | |
aae43c5f RK |
1688 | else if (TREE_CODE (type) == COMPLEX_TYPE |
1689 | && TREE_CODE (TREE_TYPE (val)) == REAL_TYPE) | |
1690 | warn_for_assignment ("%s as complex rather than floating due to prototype", (char *) 0, name, parmnum + 1); | |
400fbf9f | 1691 | else if (TREE_CODE (type) == REAL_TYPE |
aae43c5f | 1692 | && INTEGRAL_TYPE_P (TREE_TYPE (val))) |
754a4d82 | 1693 | warn_for_assignment ("%s as floating rather than integer due to prototype", (char *) 0, name, parmnum + 1); |
03829ad2 KG |
1694 | else if (TREE_CODE (type) == COMPLEX_TYPE |
1695 | && INTEGRAL_TYPE_P (TREE_TYPE (val))) | |
1696 | warn_for_assignment ("%s as complex rather than integer due to prototype", (char *) 0, name, parmnum + 1); | |
aae43c5f RK |
1697 | else if (TREE_CODE (type) == REAL_TYPE |
1698 | && TREE_CODE (TREE_TYPE (val)) == COMPLEX_TYPE) | |
1699 | warn_for_assignment ("%s as floating rather than complex due to prototype", (char *) 0, name, parmnum + 1); | |
1700 | /* ??? At some point, messages should be written about | |
1701 | conversions between complex types, but that's too messy | |
1702 | to do now. */ | |
d45cf215 RS |
1703 | else if (TREE_CODE (type) == REAL_TYPE |
1704 | && TREE_CODE (TREE_TYPE (val)) == REAL_TYPE) | |
1705 | { | |
1706 | /* Warn if any argument is passed as `float', | |
047de90b | 1707 | since without a prototype it would be `double'. */ |
d45cf215 | 1708 | if (formal_prec == TYPE_PRECISION (float_type_node)) |
754a4d82 | 1709 | warn_for_assignment ("%s as `float' rather than `double' due to prototype", (char *) 0, name, parmnum + 1); |
d45cf215 | 1710 | } |
3ed56f8a KG |
1711 | /* Detect integer changing in width or signedness. |
1712 | These warnings are only activated with | |
1713 | -Wconversion, not with -Wtraditional. */ | |
1714 | else if (warn_conversion && INTEGRAL_TYPE_P (type) | |
aae43c5f | 1715 | && INTEGRAL_TYPE_P (TREE_TYPE (val))) |
400fbf9f | 1716 | { |
d45cf215 RS |
1717 | tree would_have_been = default_conversion (val); |
1718 | tree type1 = TREE_TYPE (would_have_been); | |
1719 | ||
754a4d82 | 1720 | if (TREE_CODE (type) == ENUMERAL_TYPE |
a38b987a NB |
1721 | && (TYPE_MAIN_VARIANT (type) |
1722 | == TYPE_MAIN_VARIANT (TREE_TYPE (val)))) | |
754a4d82 RS |
1723 | /* No warning if function asks for enum |
1724 | and the actual arg is that enum type. */ | |
1725 | ; | |
1726 | else if (formal_prec != TYPE_PRECISION (type1)) | |
1727 | warn_for_assignment ("%s with different width due to prototype", (char *) 0, name, parmnum + 1); | |
d45cf215 RS |
1728 | else if (TREE_UNSIGNED (type) == TREE_UNSIGNED (type1)) |
1729 | ; | |
800cd3b9 RS |
1730 | /* Don't complain if the formal parameter type |
1731 | is an enum, because we can't tell now whether | |
1732 | the value was an enum--even the same enum. */ | |
1733 | else if (TREE_CODE (type) == ENUMERAL_TYPE) | |
1734 | ; | |
400fbf9f JW |
1735 | else if (TREE_CODE (val) == INTEGER_CST |
1736 | && int_fits_type_p (val, type)) | |
1737 | /* Change in signedness doesn't matter | |
1738 | if a constant value is unaffected. */ | |
1739 | ; | |
4bbbc5d9 RS |
1740 | /* Likewise for a constant in a NOP_EXPR. */ |
1741 | else if (TREE_CODE (val) == NOP_EXPR | |
1742 | && TREE_CODE (TREE_OPERAND (val, 0)) == INTEGER_CST | |
1743 | && int_fits_type_p (TREE_OPERAND (val, 0), type)) | |
1744 | ; | |
1745 | #if 0 /* We never get such tree structure here. */ | |
047de90b RS |
1746 | else if (TREE_CODE (TREE_TYPE (val)) == ENUMERAL_TYPE |
1747 | && int_fits_type_p (TYPE_MIN_VALUE (TREE_TYPE (val)), type) | |
1748 | && int_fits_type_p (TYPE_MAX_VALUE (TREE_TYPE (val)), type)) | |
1749 | /* Change in signedness doesn't matter | |
1750 | if an enum value is unaffected. */ | |
1751 | ; | |
4bbbc5d9 | 1752 | #endif |
ce9895ae RS |
1753 | /* If the value is extended from a narrower |
1754 | unsigned type, it doesn't matter whether we | |
1755 | pass it as signed or unsigned; the value | |
1756 | certainly is the same either way. */ | |
1757 | else if (TYPE_PRECISION (TREE_TYPE (val)) < TYPE_PRECISION (type) | |
1758 | && TREE_UNSIGNED (TREE_TYPE (val))) | |
1759 | ; | |
3ed56f8a KG |
1760 | else if (TREE_UNSIGNED (type)) |
1761 | warn_for_assignment ("%s as unsigned due to prototype", (char *) 0, name, parmnum + 1); | |
1762 | else | |
1763 | warn_for_assignment ("%s as signed due to prototype", (char *) 0, name, parmnum + 1); | |
400fbf9f JW |
1764 | } |
1765 | } | |
1766 | ||
1767 | parmval = convert_for_assignment (type, val, | |
0f41302f | 1768 | (char *) 0, /* arg passing */ |
9b7267b8 | 1769 | fundecl, name, parmnum + 1); |
400fbf9f | 1770 | |
7d473569 | 1771 | if (PROMOTE_PROTOTYPES |
b6d6aa84 | 1772 | && INTEGRAL_TYPE_P (type) |
400fbf9f JW |
1773 | && (TYPE_PRECISION (type) < TYPE_PRECISION (integer_type_node))) |
1774 | parmval = default_conversion (parmval); | |
400fbf9f | 1775 | } |
8d9bfdc5 | 1776 | result = tree_cons (NULL_TREE, parmval, result); |
400fbf9f JW |
1777 | } |
1778 | else if (TREE_CODE (TREE_TYPE (val)) == REAL_TYPE | |
1779 | && (TYPE_PRECISION (TREE_TYPE (val)) | |
1780 | < TYPE_PRECISION (double_type_node))) | |
1781 | /* Convert `float' to `double'. */ | |
1782 | result = tree_cons (NULL_TREE, convert (double_type_node, val), result); | |
1783 | else | |
1784 | /* Convert `short' and `char' to full-size `int'. */ | |
1785 | result = tree_cons (NULL_TREE, default_conversion (val), result); | |
1786 | ||
1787 | if (typetail) | |
1788 | typetail = TREE_CHAIN (typetail); | |
1789 | } | |
1790 | ||
1791 | if (typetail != 0 && TREE_VALUE (typetail) != void_type_node) | |
1792 | { | |
1793 | if (name) | |
1794 | error ("too few arguments to function `%s'", | |
1795 | IDENTIFIER_POINTER (name)); | |
1796 | else | |
1797 | error ("too few arguments to function"); | |
1798 | } | |
1799 | ||
1800 | return nreverse (result); | |
1801 | } | |
1802 | \f | |
1803 | /* This is the entry point used by the parser | |
1804 | for binary operators in the input. | |
1805 | In addition to constructing the expression, | |
1806 | we check for operands that were written with other binary operators | |
1807 | in a way that is likely to confuse the user. */ | |
edc7c4ec | 1808 | |
400fbf9f JW |
1809 | tree |
1810 | parser_build_binary_op (code, arg1, arg2) | |
1811 | enum tree_code code; | |
1812 | tree arg1, arg2; | |
1813 | { | |
1814 | tree result = build_binary_op (code, arg1, arg2, 1); | |
1815 | ||
1816 | char class; | |
1817 | char class1 = TREE_CODE_CLASS (TREE_CODE (arg1)); | |
1818 | char class2 = TREE_CODE_CLASS (TREE_CODE (arg2)); | |
1819 | enum tree_code code1 = ERROR_MARK; | |
1820 | enum tree_code code2 = ERROR_MARK; | |
1821 | ||
58bf601b HPN |
1822 | if (TREE_CODE (result) == ERROR_MARK) |
1823 | return error_mark_node; | |
1824 | ||
686deecb | 1825 | if (IS_EXPR_CODE_CLASS (class1)) |
400fbf9f | 1826 | code1 = C_EXP_ORIGINAL_CODE (arg1); |
686deecb | 1827 | if (IS_EXPR_CODE_CLASS (class2)) |
400fbf9f JW |
1828 | code2 = C_EXP_ORIGINAL_CODE (arg2); |
1829 | ||
1830 | /* Check for cases such as x+y<<z which users are likely | |
1831 | to misinterpret. If parens are used, C_EXP_ORIGINAL_CODE | |
1832 | is cleared to prevent these warnings. */ | |
1833 | if (warn_parentheses) | |
1834 | { | |
1835 | if (code == LSHIFT_EXPR || code == RSHIFT_EXPR) | |
1836 | { | |
1837 | if (code1 == PLUS_EXPR || code1 == MINUS_EXPR | |
1838 | || code2 == PLUS_EXPR || code2 == MINUS_EXPR) | |
1839 | warning ("suggest parentheses around + or - inside shift"); | |
1840 | } | |
1841 | ||
1842 | if (code == TRUTH_ORIF_EXPR) | |
1843 | { | |
1844 | if (code1 == TRUTH_ANDIF_EXPR | |
1845 | || code2 == TRUTH_ANDIF_EXPR) | |
1846 | warning ("suggest parentheses around && within ||"); | |
1847 | } | |
1848 | ||
1849 | if (code == BIT_IOR_EXPR) | |
1850 | { | |
1851 | if (code1 == BIT_AND_EXPR || code1 == BIT_XOR_EXPR | |
1852 | || code1 == PLUS_EXPR || code1 == MINUS_EXPR | |
1853 | || code2 == BIT_AND_EXPR || code2 == BIT_XOR_EXPR | |
1854 | || code2 == PLUS_EXPR || code2 == MINUS_EXPR) | |
1855 | warning ("suggest parentheses around arithmetic in operand of |"); | |
7e9d002a RK |
1856 | /* Check cases like x|y==z */ |
1857 | if (TREE_CODE_CLASS (code1) == '<' || TREE_CODE_CLASS (code2) == '<') | |
1858 | warning ("suggest parentheses around comparison in operand of |"); | |
400fbf9f JW |
1859 | } |
1860 | ||
1861 | if (code == BIT_XOR_EXPR) | |
1862 | { | |
1863 | if (code1 == BIT_AND_EXPR | |
1864 | || code1 == PLUS_EXPR || code1 == MINUS_EXPR | |
1865 | || code2 == BIT_AND_EXPR | |
1866 | || code2 == PLUS_EXPR || code2 == MINUS_EXPR) | |
1867 | warning ("suggest parentheses around arithmetic in operand of ^"); | |
7e9d002a RK |
1868 | /* Check cases like x^y==z */ |
1869 | if (TREE_CODE_CLASS (code1) == '<' || TREE_CODE_CLASS (code2) == '<') | |
1870 | warning ("suggest parentheses around comparison in operand of ^"); | |
400fbf9f JW |
1871 | } |
1872 | ||
1873 | if (code == BIT_AND_EXPR) | |
1874 | { | |
1875 | if (code1 == PLUS_EXPR || code1 == MINUS_EXPR | |
1876 | || code2 == PLUS_EXPR || code2 == MINUS_EXPR) | |
1877 | warning ("suggest parentheses around + or - in operand of &"); | |
7e9d002a RK |
1878 | /* Check cases like x&y==z */ |
1879 | if (TREE_CODE_CLASS (code1) == '<' || TREE_CODE_CLASS (code2) == '<') | |
1880 | warning ("suggest parentheses around comparison in operand of &"); | |
400fbf9f JW |
1881 | } |
1882 | } | |
1883 | ||
001af587 | 1884 | /* Similarly, check for cases like 1<=i<=10 that are probably errors. */ |
edc7c4ec | 1885 | if (TREE_CODE_CLASS (code) == '<' && extra_warnings |
001af587 RS |
1886 | && (TREE_CODE_CLASS (code1) == '<' || TREE_CODE_CLASS (code2) == '<')) |
1887 | warning ("comparisons like X<=Y<=Z do not have their mathematical meaning"); | |
1888 | ||
e58cd767 RS |
1889 | unsigned_conversion_warning (result, arg1); |
1890 | unsigned_conversion_warning (result, arg2); | |
1891 | overflow_warning (result); | |
1892 | ||
edc7c4ec RS |
1893 | class = TREE_CODE_CLASS (TREE_CODE (result)); |
1894 | ||
400fbf9f JW |
1895 | /* Record the code that was specified in the source, |
1896 | for the sake of warnings about confusing nesting. */ | |
686deecb | 1897 | if (IS_EXPR_CODE_CLASS (class)) |
400fbf9f JW |
1898 | C_SET_EXP_ORIGINAL_CODE (result, code); |
1899 | else | |
1900 | { | |
1901 | int flag = TREE_CONSTANT (result); | |
d11fdb45 RS |
1902 | /* We used to use NOP_EXPR rather than NON_LVALUE_EXPR |
1903 | so that convert_for_assignment wouldn't strip it. | |
1904 | That way, we got warnings for things like p = (1 - 1). | |
1905 | But it turns out we should not get those warnings. */ | |
1906 | result = build1 (NON_LVALUE_EXPR, TREE_TYPE (result), result); | |
400fbf9f JW |
1907 | C_SET_EXP_ORIGINAL_CODE (result, code); |
1908 | TREE_CONSTANT (result) = flag; | |
1909 | } | |
1910 | ||
1911 | return result; | |
1912 | } | |
1913 | ||
1914 | /* Build a binary-operation expression without default conversions. | |
1915 | CODE is the kind of expression to build. | |
1916 | This function differs from `build' in several ways: | |
1917 | the data type of the result is computed and recorded in it, | |
1918 | warnings are generated if arg data types are invalid, | |
1919 | special handling for addition and subtraction of pointers is known, | |
1920 | and some optimization is done (operations on narrow ints | |
1921 | are done in the narrower type when that gives the same result). | |
1922 | Constant folding is also done before the result is returned. | |
1923 | ||
1924 | Note that the operands will never have enumeral types, or function | |
1925 | or array types, because either they will have the default conversions | |
1926 | performed or they have both just been converted to some other type in which | |
1927 | the arithmetic is to be done. */ | |
1928 | ||
1929 | tree | |
1930 | build_binary_op (code, orig_op0, orig_op1, convert_p) | |
1931 | enum tree_code code; | |
1932 | tree orig_op0, orig_op1; | |
1933 | int convert_p; | |
1934 | { | |
1935 | tree type0, type1; | |
b3694847 | 1936 | enum tree_code code0, code1; |
400fbf9f JW |
1937 | tree op0, op1; |
1938 | ||
1939 | /* Expression code to give to the expression when it is built. | |
1940 | Normally this is CODE, which is what the caller asked for, | |
1941 | but in some special cases we change it. */ | |
b3694847 | 1942 | enum tree_code resultcode = code; |
400fbf9f JW |
1943 | |
1944 | /* Data type in which the computation is to be performed. | |
1945 | In the simplest cases this is the common type of the arguments. */ | |
b3694847 | 1946 | tree result_type = NULL; |
400fbf9f JW |
1947 | |
1948 | /* Nonzero means operands have already been type-converted | |
1949 | in whatever way is necessary. | |
1950 | Zero means they need to be converted to RESULT_TYPE. */ | |
1951 | int converted = 0; | |
1952 | ||
293c9fdd JM |
1953 | /* Nonzero means create the expression with this type, rather than |
1954 | RESULT_TYPE. */ | |
1955 | tree build_type = 0; | |
1956 | ||
400fbf9f | 1957 | /* Nonzero means after finally constructing the expression |
293c9fdd | 1958 | convert it to this type. */ |
400fbf9f JW |
1959 | tree final_type = 0; |
1960 | ||
1961 | /* Nonzero if this is an operation like MIN or MAX which can | |
1962 | safely be computed in short if both args are promoted shorts. | |
1963 | Also implies COMMON. | |
1964 | -1 indicates a bitwise operation; this makes a difference | |
1965 | in the exact conditions for when it is safe to do the operation | |
1966 | in a narrower mode. */ | |
1967 | int shorten = 0; | |
1968 | ||
1969 | /* Nonzero if this is a comparison operation; | |
1970 | if both args are promoted shorts, compare the original shorts. | |
1971 | Also implies COMMON. */ | |
1972 | int short_compare = 0; | |
1973 | ||
1974 | /* Nonzero if this is a right-shift operation, which can be computed on the | |
1975 | original short and then promoted if the operand is a promoted short. */ | |
1976 | int short_shift = 0; | |
1977 | ||
1978 | /* Nonzero means set RESULT_TYPE to the common type of the args. */ | |
1979 | int common = 0; | |
1980 | ||
1981 | if (convert_p) | |
1982 | { | |
1983 | op0 = default_conversion (orig_op0); | |
1984 | op1 = default_conversion (orig_op1); | |
1985 | } | |
1986 | else | |
1987 | { | |
1988 | op0 = orig_op0; | |
1989 | op1 = orig_op1; | |
1990 | } | |
1991 | ||
1992 | type0 = TREE_TYPE (op0); | |
1993 | type1 = TREE_TYPE (op1); | |
1994 | ||
1995 | /* The expression codes of the data types of the arguments tell us | |
1996 | whether the arguments are integers, floating, pointers, etc. */ | |
1997 | code0 = TREE_CODE (type0); | |
1998 | code1 = TREE_CODE (type1); | |
1999 | ||
fc76e425 | 2000 | /* Strip NON_LVALUE_EXPRs, etc., since we aren't using as an lvalue. */ |
a7d53fce RS |
2001 | STRIP_TYPE_NOPS (op0); |
2002 | STRIP_TYPE_NOPS (op1); | |
400fbf9f JW |
2003 | |
2004 | /* If an error was already reported for one of the arguments, | |
2005 | avoid reporting another error. */ | |
2006 | ||
2007 | if (code0 == ERROR_MARK || code1 == ERROR_MARK) | |
2008 | return error_mark_node; | |
2009 | ||
2010 | switch (code) | |
2011 | { | |
2012 | case PLUS_EXPR: | |
2013 | /* Handle the pointer + int case. */ | |
2014 | if (code0 == POINTER_TYPE && code1 == INTEGER_TYPE) | |
2015 | return pointer_int_sum (PLUS_EXPR, op0, op1); | |
2016 | else if (code1 == POINTER_TYPE && code0 == INTEGER_TYPE) | |
2017 | return pointer_int_sum (PLUS_EXPR, op1, op0); | |
2018 | else | |
2019 | common = 1; | |
2020 | break; | |
2021 | ||
2022 | case MINUS_EXPR: | |
2023 | /* Subtraction of two similar pointers. | |
2024 | We must subtract them as integers, then divide by object size. */ | |
2025 | if (code0 == POINTER_TYPE && code1 == POINTER_TYPE | |
2026 | && comp_target_types (type0, type1)) | |
2027 | return pointer_diff (op0, op1); | |
2028 | /* Handle pointer minus int. Just like pointer plus int. */ | |
2029 | else if (code0 == POINTER_TYPE && code1 == INTEGER_TYPE) | |
2030 | return pointer_int_sum (MINUS_EXPR, op0, op1); | |
2031 | else | |
2032 | common = 1; | |
2033 | break; | |
2034 | ||
2035 | case MULT_EXPR: | |
2036 | common = 1; | |
2037 | break; | |
2038 | ||
2039 | case TRUNC_DIV_EXPR: | |
2040 | case CEIL_DIV_EXPR: | |
2041 | case FLOOR_DIV_EXPR: | |
2042 | case ROUND_DIV_EXPR: | |
2043 | case EXACT_DIV_EXPR: | |
6c36d76b NB |
2044 | /* Floating point division by zero is a legitimate way to obtain |
2045 | infinities and NaNs. */ | |
2046 | if (warn_div_by_zero && skip_evaluation == 0 && integer_zerop (op1)) | |
2047 | warning ("division by zero"); | |
2048 | ||
b6a10c9f RS |
2049 | if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE |
2050 | || code0 == COMPLEX_TYPE) | |
2051 | && (code1 == INTEGER_TYPE || code1 == REAL_TYPE | |
2052 | || code1 == COMPLEX_TYPE)) | |
400fbf9f JW |
2053 | { |
2054 | if (!(code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)) | |
2055 | resultcode = RDIV_EXPR; | |
2056 | else | |
05bccae2 RK |
2057 | /* Although it would be tempting to shorten always here, that |
2058 | loses on some targets, since the modulo instruction is | |
2059 | undefined if the quotient can't be represented in the | |
2060 | computation mode. We shorten only if unsigned or if | |
2061 | dividing by something we know != -1. */ | |
2062 | shorten = (TREE_UNSIGNED (TREE_TYPE (orig_op0)) | |
2063 | || (TREE_CODE (op1) == INTEGER_CST | |
2064 | && ! integer_all_onesp (op1))); | |
400fbf9f JW |
2065 | common = 1; |
2066 | } | |
2067 | break; | |
2068 | ||
2069 | case BIT_AND_EXPR: | |
2070 | case BIT_ANDTC_EXPR: | |
2071 | case BIT_IOR_EXPR: | |
2072 | case BIT_XOR_EXPR: | |
2073 | if (code0 == INTEGER_TYPE && code1 == INTEGER_TYPE) | |
2074 | shorten = -1; | |
400fbf9f JW |
2075 | break; |
2076 | ||
2077 | case TRUNC_MOD_EXPR: | |
047de90b | 2078 | case FLOOR_MOD_EXPR: |
6c36d76b NB |
2079 | if (warn_div_by_zero && skip_evaluation == 0 && integer_zerop (op1)) |
2080 | warning ("division by zero"); | |
2081 | ||
400fbf9f | 2082 | if (code0 == INTEGER_TYPE && code1 == INTEGER_TYPE) |
03d5b1f5 RS |
2083 | { |
2084 | /* Although it would be tempting to shorten always here, that loses | |
2085 | on some targets, since the modulo instruction is undefined if the | |
2086 | quotient can't be represented in the computation mode. We shorten | |
2087 | only if unsigned or if dividing by something we know != -1. */ | |
96d8f1d8 | 2088 | shorten = (TREE_UNSIGNED (TREE_TYPE (orig_op0)) |
03d5b1f5 | 2089 | || (TREE_CODE (op1) == INTEGER_CST |
05bccae2 | 2090 | && ! integer_all_onesp (op1))); |
03d5b1f5 RS |
2091 | common = 1; |
2092 | } | |
400fbf9f JW |
2093 | break; |
2094 | ||
2095 | case TRUTH_ANDIF_EXPR: | |
2096 | case TRUTH_ORIF_EXPR: | |
2097 | case TRUTH_AND_EXPR: | |
2098 | case TRUTH_OR_EXPR: | |
1eca8b1e | 2099 | case TRUTH_XOR_EXPR: |
b6a10c9f RS |
2100 | if ((code0 == INTEGER_TYPE || code0 == POINTER_TYPE |
2101 | || code0 == REAL_TYPE || code0 == COMPLEX_TYPE) | |
2102 | && (code1 == INTEGER_TYPE || code1 == POINTER_TYPE | |
2103 | || code1 == REAL_TYPE || code1 == COMPLEX_TYPE)) | |
400fbf9f JW |
2104 | { |
2105 | /* Result of these operations is always an int, | |
2106 | but that does not mean the operands should be | |
2107 | converted to ints! */ | |
2108 | result_type = integer_type_node; | |
78ef5b89 NB |
2109 | op0 = c_common_truthvalue_conversion (op0); |
2110 | op1 = c_common_truthvalue_conversion (op1); | |
400fbf9f JW |
2111 | converted = 1; |
2112 | } | |
2113 | break; | |
2114 | ||
2115 | /* Shift operations: result has same type as first operand; | |
2116 | always convert second operand to int. | |
2117 | Also set SHORT_SHIFT if shifting rightward. */ | |
2118 | ||
2119 | case RSHIFT_EXPR: | |
2120 | if (code0 == INTEGER_TYPE && code1 == INTEGER_TYPE) | |
2121 | { | |
47ee6837 | 2122 | if (TREE_CODE (op1) == INTEGER_CST && skip_evaluation == 0) |
400fbf9f | 2123 | { |
ff3225e7 | 2124 | if (tree_int_cst_sgn (op1) < 0) |
315da535 | 2125 | warning ("right shift count is negative"); |
17651386 RS |
2126 | else |
2127 | { | |
05bccae2 | 2128 | if (! integer_zerop (op1)) |
17651386 | 2129 | short_shift = 1; |
05bccae2 RK |
2130 | |
2131 | if (compare_tree_int (op1, TYPE_PRECISION (type0)) >= 0) | |
315da535 | 2132 | warning ("right shift count >= width of type"); |
17651386 | 2133 | } |
400fbf9f | 2134 | } |
05bccae2 | 2135 | |
f458d1d5 | 2136 | /* Use the type of the value to be shifted. */ |
d45cf215 | 2137 | result_type = type0; |
f458d1d5 ZW |
2138 | /* Convert the shift-count to an integer, regardless of size |
2139 | of value being shifted. */ | |
2140 | if (TYPE_MAIN_VARIANT (TREE_TYPE (op1)) != integer_type_node) | |
2141 | op1 = convert (integer_type_node, op1); | |
2142 | /* Avoid converting op1 to result_type later. */ | |
2143 | converted = 1; | |
400fbf9f JW |
2144 | } |
2145 | break; | |
2146 | ||
2147 | case LSHIFT_EXPR: | |
2148 | if (code0 == INTEGER_TYPE && code1 == INTEGER_TYPE) | |
2149 | { | |
47ee6837 | 2150 | if (TREE_CODE (op1) == INTEGER_CST && skip_evaluation == 0) |
17651386 | 2151 | { |
ff3225e7 | 2152 | if (tree_int_cst_sgn (op1) < 0) |
315da535 | 2153 | warning ("left shift count is negative"); |
05bccae2 RK |
2154 | |
2155 | else if (compare_tree_int (op1, TYPE_PRECISION (type0)) >= 0) | |
315da535 | 2156 | warning ("left shift count >= width of type"); |
17651386 | 2157 | } |
05bccae2 | 2158 | |
f458d1d5 | 2159 | /* Use the type of the value to be shifted. */ |
d45cf215 | 2160 | result_type = type0; |
f458d1d5 ZW |
2161 | /* Convert the shift-count to an integer, regardless of size |
2162 | of value being shifted. */ | |
2163 | if (TYPE_MAIN_VARIANT (TREE_TYPE (op1)) != integer_type_node) | |
2164 | op1 = convert (integer_type_node, op1); | |
2165 | /* Avoid converting op1 to result_type later. */ | |
2166 | converted = 1; | |
400fbf9f JW |
2167 | } |
2168 | break; | |
2169 | ||
2170 | case RROTATE_EXPR: | |
2171 | case LROTATE_EXPR: | |
2172 | if (code0 == INTEGER_TYPE && code1 == INTEGER_TYPE) | |
2173 | { | |
47ee6837 | 2174 | if (TREE_CODE (op1) == INTEGER_CST && skip_evaluation == 0) |
17651386 | 2175 | { |
ff3225e7 | 2176 | if (tree_int_cst_sgn (op1) < 0) |
17651386 | 2177 | warning ("shift count is negative"); |
05bccae2 | 2178 | else if (compare_tree_int (op1, TYPE_PRECISION (type0)) >= 0) |
17651386 RS |
2179 | warning ("shift count >= width of type"); |
2180 | } | |
05bccae2 | 2181 | |
f458d1d5 | 2182 | /* Use the type of the value to be shifted. */ |
d45cf215 | 2183 | result_type = type0; |
f458d1d5 ZW |
2184 | /* Convert the shift-count to an integer, regardless of size |
2185 | of value being shifted. */ | |
2186 | if (TYPE_MAIN_VARIANT (TREE_TYPE (op1)) != integer_type_node) | |
2187 | op1 = convert (integer_type_node, op1); | |
2188 | /* Avoid converting op1 to result_type later. */ | |
2189 | converted = 1; | |
400fbf9f JW |
2190 | } |
2191 | break; | |
2192 | ||
2193 | case EQ_EXPR: | |
2194 | case NE_EXPR: | |
b843d210 DZ |
2195 | if (warn_float_equal && (code0 == REAL_TYPE || code1 == REAL_TYPE)) |
2196 | warning ("comparing floating point with == or != is unsafe"); | |
400fbf9f JW |
2197 | /* Result of comparison is always int, |
2198 | but don't convert the args to int! */ | |
293c9fdd | 2199 | build_type = integer_type_node; |
b6a10c9f RS |
2200 | if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE |
2201 | || code0 == COMPLEX_TYPE) | |
2202 | && (code1 == INTEGER_TYPE || code1 == REAL_TYPE | |
2203 | || code1 == COMPLEX_TYPE)) | |
400fbf9f JW |
2204 | short_compare = 1; |
2205 | else if (code0 == POINTER_TYPE && code1 == POINTER_TYPE) | |
2206 | { | |
b3694847 SS |
2207 | tree tt0 = TREE_TYPE (type0); |
2208 | tree tt1 = TREE_TYPE (type1); | |
400fbf9f | 2209 | /* Anything compares with void *. void * compares with anything. |
d11fdb45 RS |
2210 | Otherwise, the targets must be compatible |
2211 | and both must be object or both incomplete. */ | |
400fbf9f | 2212 | if (comp_target_types (type0, type1)) |
605a99f6 | 2213 | result_type = common_type (type0, type1); |
71653180 | 2214 | else if (VOID_TYPE_P (tt0)) |
400fbf9f | 2215 | { |
fd5d5b94 RS |
2216 | /* op0 != orig_op0 detects the case of something |
2217 | whose value is 0 but which isn't a valid null ptr const. */ | |
2218 | if (pedantic && (!integer_zerop (op0) || op0 != orig_op0) | |
400fbf9f | 2219 | && TREE_CODE (tt1) == FUNCTION_TYPE) |
89abf8d1 | 2220 | pedwarn ("ISO C forbids comparison of `void *' with function pointer"); |
400fbf9f | 2221 | } |
71653180 | 2222 | else if (VOID_TYPE_P (tt1)) |
400fbf9f | 2223 | { |
fd5d5b94 | 2224 | if (pedantic && (!integer_zerop (op1) || op1 != orig_op1) |
400fbf9f | 2225 | && TREE_CODE (tt0) == FUNCTION_TYPE) |
89abf8d1 | 2226 | pedwarn ("ISO C forbids comparison of `void *' with function pointer"); |
400fbf9f JW |
2227 | } |
2228 | else | |
2229 | pedwarn ("comparison of distinct pointer types lacks a cast"); | |
605a99f6 JM |
2230 | |
2231 | if (result_type == NULL_TREE) | |
2232 | result_type = ptr_type_node; | |
400fbf9f JW |
2233 | } |
2234 | else if (code0 == POINTER_TYPE && TREE_CODE (op1) == INTEGER_CST | |
2235 | && integer_zerop (op1)) | |
293c9fdd | 2236 | result_type = type0; |
400fbf9f JW |
2237 | else if (code1 == POINTER_TYPE && TREE_CODE (op0) == INTEGER_CST |
2238 | && integer_zerop (op0)) | |
293c9fdd | 2239 | result_type = type1; |
400fbf9f JW |
2240 | else if (code0 == POINTER_TYPE && code1 == INTEGER_TYPE) |
2241 | { | |
293c9fdd | 2242 | result_type = type0; |
f458d1d5 | 2243 | pedwarn ("comparison between pointer and integer"); |
400fbf9f JW |
2244 | } |
2245 | else if (code0 == INTEGER_TYPE && code1 == POINTER_TYPE) | |
2246 | { | |
293c9fdd | 2247 | result_type = type1; |
f458d1d5 | 2248 | pedwarn ("comparison between pointer and integer"); |
400fbf9f | 2249 | } |
400fbf9f JW |
2250 | break; |
2251 | ||
2252 | case MAX_EXPR: | |
2253 | case MIN_EXPR: | |
9db931af RS |
2254 | if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE) |
2255 | && (code1 == INTEGER_TYPE || code1 == REAL_TYPE)) | |
400fbf9f JW |
2256 | shorten = 1; |
2257 | else if (code0 == POINTER_TYPE && code1 == POINTER_TYPE) | |
2258 | { | |
605a99f6 JM |
2259 | if (comp_target_types (type0, type1)) |
2260 | { | |
2261 | result_type = common_type (type0, type1); | |
2262 | if (pedantic | |
2263 | && TREE_CODE (TREE_TYPE (type0)) == FUNCTION_TYPE) | |
89abf8d1 | 2264 | pedwarn ("ISO C forbids ordered comparisons of pointers to functions"); |
605a99f6 JM |
2265 | } |
2266 | else | |
2267 | { | |
2268 | result_type = ptr_type_node; | |
2269 | pedwarn ("comparison of distinct pointer types lacks a cast"); | |
2270 | } | |
400fbf9f JW |
2271 | } |
2272 | break; | |
2273 | ||
2274 | case LE_EXPR: | |
2275 | case GE_EXPR: | |
2276 | case LT_EXPR: | |
2277 | case GT_EXPR: | |
293c9fdd | 2278 | build_type = integer_type_node; |
9db931af RS |
2279 | if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE) |
2280 | && (code1 == INTEGER_TYPE || code1 == REAL_TYPE)) | |
400fbf9f JW |
2281 | short_compare = 1; |
2282 | else if (code0 == POINTER_TYPE && code1 == POINTER_TYPE) | |
2283 | { | |
605a99f6 JM |
2284 | if (comp_target_types (type0, type1)) |
2285 | { | |
2286 | result_type = common_type (type0, type1); | |
d0f062fb NS |
2287 | if (!COMPLETE_TYPE_P (TREE_TYPE (type0)) |
2288 | != !COMPLETE_TYPE_P (TREE_TYPE (type1))) | |
605a99f6 JM |
2289 | pedwarn ("comparison of complete and incomplete pointers"); |
2290 | else if (pedantic | |
2291 | && TREE_CODE (TREE_TYPE (type0)) == FUNCTION_TYPE) | |
89abf8d1 | 2292 | pedwarn ("ISO C forbids ordered comparisons of pointers to functions"); |
605a99f6 JM |
2293 | } |
2294 | else | |
2295 | { | |
2296 | result_type = ptr_type_node; | |
2297 | pedwarn ("comparison of distinct pointer types lacks a cast"); | |
2298 | } | |
400fbf9f JW |
2299 | } |
2300 | else if (code0 == POINTER_TYPE && TREE_CODE (op1) == INTEGER_CST | |
2301 | && integer_zerop (op1)) | |
2302 | { | |
293c9fdd | 2303 | result_type = type0; |
ddcf4abc | 2304 | if (pedantic || extra_warnings) |
400fbf9f JW |
2305 | pedwarn ("ordered comparison of pointer with integer zero"); |
2306 | } | |
2307 | else if (code1 == POINTER_TYPE && TREE_CODE (op0) == INTEGER_CST | |
2308 | && integer_zerop (op0)) | |
2309 | { | |
293c9fdd | 2310 | result_type = type1; |
400fbf9f JW |
2311 | if (pedantic) |
2312 | pedwarn ("ordered comparison of pointer with integer zero"); | |
2313 | } | |
2314 | else if (code0 == POINTER_TYPE && code1 == INTEGER_TYPE) | |
2315 | { | |
293c9fdd | 2316 | result_type = type0; |
f458d1d5 | 2317 | pedwarn ("comparison between pointer and integer"); |
400fbf9f JW |
2318 | } |
2319 | else if (code0 == INTEGER_TYPE && code1 == POINTER_TYPE) | |
2320 | { | |
293c9fdd | 2321 | result_type = type1; |
f458d1d5 | 2322 | pedwarn ("comparison between pointer and integer"); |
400fbf9f | 2323 | } |
400fbf9f | 2324 | break; |
1eb8759b RH |
2325 | |
2326 | case UNORDERED_EXPR: | |
2327 | case ORDERED_EXPR: | |
2328 | case UNLT_EXPR: | |
2329 | case UNLE_EXPR: | |
2330 | case UNGT_EXPR: | |
2331 | case UNGE_EXPR: | |
2332 | case UNEQ_EXPR: | |
1eb8759b RH |
2333 | build_type = integer_type_node; |
2334 | if (code0 != REAL_TYPE || code1 != REAL_TYPE) | |
2335 | { | |
2336 | error ("unordered comparison on non-floating point argument"); | |
2337 | return error_mark_node; | |
2338 | } | |
2339 | common = 1; | |
2340 | break; | |
2341 | ||
e9a25f70 JL |
2342 | default: |
2343 | break; | |
400fbf9f JW |
2344 | } |
2345 | ||
b6a10c9f RS |
2346 | if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE || code0 == COMPLEX_TYPE) |
2347 | && | |
2348 | (code1 == INTEGER_TYPE || code1 == REAL_TYPE || code1 == COMPLEX_TYPE)) | |
400fbf9f | 2349 | { |
b6a10c9f RS |
2350 | int none_complex = (code0 != COMPLEX_TYPE && code1 != COMPLEX_TYPE); |
2351 | ||
400fbf9f JW |
2352 | if (shorten || common || short_compare) |
2353 | result_type = common_type (type0, type1); | |
2354 | ||
2355 | /* For certain operations (which identify themselves by shorten != 0) | |
2356 | if both args were extended from the same smaller type, | |
2357 | do the arithmetic in that type and then extend. | |
2358 | ||
2359 | shorten !=0 and !=1 indicates a bitwise operation. | |
2360 | For them, this optimization is safe only if | |
2361 | both args are zero-extended or both are sign-extended. | |
2362 | Otherwise, we might change the result. | |
2363 | Eg, (short)-1 | (unsigned short)-1 is (int)-1 | |
2364 | but calculated in (unsigned short) it would be (unsigned short)-1. */ | |
2365 | ||
b6a10c9f | 2366 | if (shorten && none_complex) |
400fbf9f JW |
2367 | { |
2368 | int unsigned0, unsigned1; | |
2369 | tree arg0 = get_narrower (op0, &unsigned0); | |
2370 | tree arg1 = get_narrower (op1, &unsigned1); | |
2371 | /* UNS is 1 if the operation to be done is an unsigned one. */ | |
2372 | int uns = TREE_UNSIGNED (result_type); | |
2373 | tree type; | |
2374 | ||
2375 | final_type = result_type; | |
2376 | ||
e7951b3f | 2377 | /* Handle the case that OP0 (or OP1) does not *contain* a conversion |
400fbf9f JW |
2378 | but it *requires* conversion to FINAL_TYPE. */ |
2379 | ||
e7951b3f RS |
2380 | if ((TYPE_PRECISION (TREE_TYPE (op0)) |
2381 | == TYPE_PRECISION (TREE_TYPE (arg0))) | |
2382 | && TREE_TYPE (op0) != final_type) | |
400fbf9f | 2383 | unsigned0 = TREE_UNSIGNED (TREE_TYPE (op0)); |
e7951b3f RS |
2384 | if ((TYPE_PRECISION (TREE_TYPE (op1)) |
2385 | == TYPE_PRECISION (TREE_TYPE (arg1))) | |
2386 | && TREE_TYPE (op1) != final_type) | |
400fbf9f JW |
2387 | unsigned1 = TREE_UNSIGNED (TREE_TYPE (op1)); |
2388 | ||
2389 | /* Now UNSIGNED0 is 1 if ARG0 zero-extends to FINAL_TYPE. */ | |
2390 | ||
2391 | /* For bitwise operations, signedness of nominal type | |
2392 | does not matter. Consider only how operands were extended. */ | |
2393 | if (shorten == -1) | |
2394 | uns = unsigned0; | |
2395 | ||
2396 | /* Note that in all three cases below we refrain from optimizing | |
2397 | an unsigned operation on sign-extended args. | |
2398 | That would not be valid. */ | |
2399 | ||
2400 | /* Both args variable: if both extended in same way | |
2401 | from same width, do it in that width. | |
2402 | Do it unsigned if args were zero-extended. */ | |
2403 | if ((TYPE_PRECISION (TREE_TYPE (arg0)) | |
2404 | < TYPE_PRECISION (result_type)) | |
2405 | && (TYPE_PRECISION (TREE_TYPE (arg1)) | |
2406 | == TYPE_PRECISION (TREE_TYPE (arg0))) | |
2407 | && unsigned0 == unsigned1 | |
2408 | && (unsigned0 || !uns)) | |
2409 | result_type | |
ceef8ce4 NB |
2410 | = c_common_signed_or_unsigned_type |
2411 | (unsigned0, common_type (TREE_TYPE (arg0), TREE_TYPE (arg1))); | |
400fbf9f JW |
2412 | else if (TREE_CODE (arg0) == INTEGER_CST |
2413 | && (unsigned1 || !uns) | |
2414 | && (TYPE_PRECISION (TREE_TYPE (arg1)) | |
2415 | < TYPE_PRECISION (result_type)) | |
ceef8ce4 NB |
2416 | && (type |
2417 | = c_common_signed_or_unsigned_type (unsigned1, | |
2418 | TREE_TYPE (arg1)), | |
400fbf9f JW |
2419 | int_fits_type_p (arg0, type))) |
2420 | result_type = type; | |
2421 | else if (TREE_CODE (arg1) == INTEGER_CST | |
2422 | && (unsigned0 || !uns) | |
2423 | && (TYPE_PRECISION (TREE_TYPE (arg0)) | |
2424 | < TYPE_PRECISION (result_type)) | |
ceef8ce4 NB |
2425 | && (type |
2426 | = c_common_signed_or_unsigned_type (unsigned0, | |
2427 | TREE_TYPE (arg0)), | |
400fbf9f JW |
2428 | int_fits_type_p (arg1, type))) |
2429 | result_type = type; | |
2430 | } | |
2431 | ||
2432 | /* Shifts can be shortened if shifting right. */ | |
2433 | ||
2434 | if (short_shift) | |
2435 | { | |
2436 | int unsigned_arg; | |
2437 | tree arg0 = get_narrower (op0, &unsigned_arg); | |
2438 | ||
2439 | final_type = result_type; | |
2440 | ||
2441 | if (arg0 == op0 && final_type == TREE_TYPE (op0)) | |
2442 | unsigned_arg = TREE_UNSIGNED (TREE_TYPE (op0)); | |
2443 | ||
2444 | if (TYPE_PRECISION (TREE_TYPE (arg0)) < TYPE_PRECISION (result_type) | |
6cb70f0c JW |
2445 | /* We can shorten only if the shift count is less than the |
2446 | number of bits in the smaller type size. */ | |
05bccae2 | 2447 | && compare_tree_int (op1, TYPE_PRECISION (TREE_TYPE (arg0))) < 0 |
91a18fe0 RH |
2448 | /* We cannot drop an unsigned shift after sign-extension. */ |
2449 | && (!TREE_UNSIGNED (final_type) || unsigned_arg)) | |
400fbf9f JW |
2450 | { |
2451 | /* Do an unsigned shift if the operand was zero-extended. */ | |
2452 | result_type | |
ceef8ce4 NB |
2453 | = c_common_signed_or_unsigned_type (unsigned_arg, |
2454 | TREE_TYPE (arg0)); | |
400fbf9f JW |
2455 | /* Convert value-to-be-shifted to that type. */ |
2456 | if (TREE_TYPE (op0) != result_type) | |
2457 | op0 = convert (result_type, op0); | |
2458 | converted = 1; | |
2459 | } | |
2460 | } | |
2461 | ||
2462 | /* Comparison operations are shortened too but differently. | |
2463 | They identify themselves by setting short_compare = 1. */ | |
2464 | ||
75326e8c | 2465 | if (short_compare) |
400fbf9f JW |
2466 | { |
2467 | /* Don't write &op0, etc., because that would prevent op0 | |
2468 | from being kept in a register. | |
2469 | Instead, make copies of the our local variables and | |
2470 | pass the copies by reference, then copy them back afterward. */ | |
2471 | tree xop0 = op0, xop1 = op1, xresult_type = result_type; | |
2472 | enum tree_code xresultcode = resultcode; | |
2473 | tree val | |
2474 | = shorten_compare (&xop0, &xop1, &xresult_type, &xresultcode); | |
665f2503 | 2475 | |
400fbf9f JW |
2476 | if (val != 0) |
2477 | return val; | |
665f2503 | 2478 | |
293c9fdd JM |
2479 | op0 = xop0, op1 = xop1; |
2480 | converted = 1; | |
400fbf9f JW |
2481 | resultcode = xresultcode; |
2482 | ||
407cb092 PE |
2483 | if ((warn_sign_compare < 0 ? extra_warnings : warn_sign_compare != 0) |
2484 | && skip_evaluation == 0) | |
400fbf9f | 2485 | { |
d2d7ed3e JM |
2486 | int op0_signed = ! TREE_UNSIGNED (TREE_TYPE (orig_op0)); |
2487 | int op1_signed = ! TREE_UNSIGNED (TREE_TYPE (orig_op1)); | |
64c01f80 DE |
2488 | int unsignedp0, unsignedp1; |
2489 | tree primop0 = get_narrower (op0, &unsignedp0); | |
2490 | tree primop1 = get_narrower (op1, &unsignedp1); | |
2491 | ||
912b4fc3 JM |
2492 | xop0 = orig_op0; |
2493 | xop1 = orig_op1; | |
2494 | STRIP_TYPE_NOPS (xop0); | |
2495 | STRIP_TYPE_NOPS (xop1); | |
2496 | ||
400fbf9f | 2497 | /* Give warnings for comparisons between signed and unsigned |
665f2503 | 2498 | quantities that may fail. |
293c9fdd | 2499 | |
665f2503 RK |
2500 | Do the checking based on the original operand trees, so that |
2501 | casts will be considered, but default promotions won't be. | |
2502 | ||
2503 | Do not warn if the comparison is being done in a signed type, | |
293c9fdd JM |
2504 | since the signed type will only be chosen if it can represent |
2505 | all the values of the unsigned type. */ | |
2506 | if (! TREE_UNSIGNED (result_type)) | |
2507 | /* OK */; | |
cb3ca04e | 2508 | /* Do not warn if both operands are the same signedness. */ |
2e14370e JM |
2509 | else if (op0_signed == op1_signed) |
2510 | /* OK */; | |
293c9fdd | 2511 | else |
cb3ca04e ZW |
2512 | { |
2513 | tree sop, uop; | |
665f2503 | 2514 | |
cb3ca04e ZW |
2515 | if (op0_signed) |
2516 | sop = xop0, uop = xop1; | |
2517 | else | |
2518 | sop = xop1, uop = xop0; | |
2519 | ||
3facde26 KG |
2520 | /* Do not warn if the signed quantity is an |
2521 | unsuffixed integer literal (or some static | |
2522 | constant expression involving such literals or a | |
2523 | conditional expression involving such literals) | |
2524 | and it is non-negative. */ | |
2525 | if (tree_expr_nonnegative_p (sop)) | |
cb3ca04e ZW |
2526 | /* OK */; |
2527 | /* Do not warn if the comparison is an equality operation, | |
2528 | the unsigned quantity is an integral constant, and it | |
2529 | would fit in the result if the result were signed. */ | |
2530 | else if (TREE_CODE (uop) == INTEGER_CST | |
2531 | && (resultcode == EQ_EXPR || resultcode == NE_EXPR) | |
ceef8ce4 NB |
2532 | && int_fits_type_p |
2533 | (uop, c_common_signed_type (result_type))) | |
cb3ca04e ZW |
2534 | /* OK */; |
2535 | /* Do not warn if the unsigned quantity is an enumeration | |
2536 | constant and its maximum value would fit in the result | |
2537 | if the result were signed. */ | |
2538 | else if (TREE_CODE (uop) == INTEGER_CST | |
2539 | && TREE_CODE (TREE_TYPE (uop)) == ENUMERAL_TYPE | |
ceef8ce4 NB |
2540 | && int_fits_type_p |
2541 | (TYPE_MAX_VALUE (TREE_TYPE(uop)), | |
2542 | c_common_signed_type (result_type))) | |
cb3ca04e ZW |
2543 | /* OK */; |
2544 | else | |
2545 | warning ("comparison between signed and unsigned"); | |
2546 | } | |
64c01f80 DE |
2547 | |
2548 | /* Warn if two unsigned values are being compared in a size | |
2549 | larger than their original size, and one (and only one) is the | |
2550 | result of a `~' operator. This comparison will always fail. | |
2551 | ||
2552 | Also warn if one operand is a constant, and the constant | |
2553 | does not have all bits set that are set in the ~ operand | |
2554 | when it is extended. */ | |
2555 | ||
2556 | if ((TREE_CODE (primop0) == BIT_NOT_EXPR) | |
2557 | != (TREE_CODE (primop1) == BIT_NOT_EXPR)) | |
2558 | { | |
2559 | if (TREE_CODE (primop0) == BIT_NOT_EXPR) | |
2560 | primop0 = get_narrower (TREE_OPERAND (primop0, 0), | |
2561 | &unsignedp0); | |
2562 | else | |
2563 | primop1 = get_narrower (TREE_OPERAND (primop1, 0), | |
2564 | &unsignedp1); | |
2565 | ||
665f2503 | 2566 | if (host_integerp (primop0, 0) || host_integerp (primop1, 0)) |
64c01f80 DE |
2567 | { |
2568 | tree primop; | |
05bccae2 | 2569 | HOST_WIDE_INT constant, mask; |
64c01f80 DE |
2570 | int unsignedp, bits; |
2571 | ||
665f2503 | 2572 | if (host_integerp (primop0, 0)) |
64c01f80 DE |
2573 | { |
2574 | primop = primop1; | |
2575 | unsignedp = unsignedp1; | |
665f2503 | 2576 | constant = tree_low_cst (primop0, 0); |
64c01f80 DE |
2577 | } |
2578 | else | |
2579 | { | |
2580 | primop = primop0; | |
2581 | unsignedp = unsignedp0; | |
665f2503 | 2582 | constant = tree_low_cst (primop1, 0); |
64c01f80 DE |
2583 | } |
2584 | ||
2585 | bits = TYPE_PRECISION (TREE_TYPE (primop)); | |
2586 | if (bits < TYPE_PRECISION (result_type) | |
05bccae2 | 2587 | && bits < HOST_BITS_PER_WIDE_INT && unsignedp) |
64c01f80 | 2588 | { |
05bccae2 | 2589 | mask = (~ (HOST_WIDE_INT) 0) << bits; |
64c01f80 DE |
2590 | if ((mask & constant) != mask) |
2591 | warning ("comparison of promoted ~unsigned with constant"); | |
2592 | } | |
2593 | } | |
2594 | else if (unsignedp0 && unsignedp1 | |
2595 | && (TYPE_PRECISION (TREE_TYPE (primop0)) | |
2596 | < TYPE_PRECISION (result_type)) | |
2597 | && (TYPE_PRECISION (TREE_TYPE (primop1)) | |
2598 | < TYPE_PRECISION (result_type))) | |
2599 | warning ("comparison of promoted ~unsigned with unsigned"); | |
2600 | } | |
400fbf9f JW |
2601 | } |
2602 | } | |
2603 | } | |
2604 | ||
2605 | /* At this point, RESULT_TYPE must be nonzero to avoid an error message. | |
2606 | If CONVERTED is zero, both args will be converted to type RESULT_TYPE. | |
2607 | Then the expression will be built. | |
2608 | It will be given type FINAL_TYPE if that is nonzero; | |
2609 | otherwise, it will be given type RESULT_TYPE. */ | |
2610 | ||
2611 | if (!result_type) | |
2612 | { | |
2613 | binary_op_error (code); | |
2614 | return error_mark_node; | |
2615 | } | |
2616 | ||
2617 | if (! converted) | |
2618 | { | |
2619 | if (TREE_TYPE (op0) != result_type) | |
2620 | op0 = convert (result_type, op0); | |
2621 | if (TREE_TYPE (op1) != result_type) | |
2622 | op1 = convert (result_type, op1); | |
2623 | } | |
2624 | ||
293c9fdd JM |
2625 | if (build_type == NULL_TREE) |
2626 | build_type = result_type; | |
2627 | ||
400fbf9f | 2628 | { |
b3694847 SS |
2629 | tree result = build (resultcode, build_type, op0, op1); |
2630 | tree folded; | |
400fbf9f JW |
2631 | |
2632 | folded = fold (result); | |
2633 | if (folded == result) | |
2634 | TREE_CONSTANT (folded) = TREE_CONSTANT (op0) & TREE_CONSTANT (op1); | |
2635 | if (final_type != 0) | |
2636 | return convert (final_type, folded); | |
2637 | return folded; | |
2638 | } | |
2639 | } | |
2640 | \f | |
400fbf9f JW |
2641 | /* Return a tree for the difference of pointers OP0 and OP1. |
2642 | The resulting tree has type int. */ | |
2643 | ||
2644 | static tree | |
2645 | pointer_diff (op0, op1) | |
b3694847 | 2646 | tree op0, op1; |
400fbf9f | 2647 | { |
b3694847 | 2648 | tree result, folded; |
400fbf9f JW |
2649 | tree restype = ptrdiff_type_node; |
2650 | ||
2651 | tree target_type = TREE_TYPE (TREE_TYPE (op0)); | |
95602da1 R |
2652 | tree con0, con1, lit0, lit1; |
2653 | tree orig_op1 = op1; | |
400fbf9f JW |
2654 | |
2655 | if (pedantic || warn_pointer_arith) | |
2656 | { | |
2657 | if (TREE_CODE (target_type) == VOID_TYPE) | |
2658 | pedwarn ("pointer of type `void *' used in subtraction"); | |
2659 | if (TREE_CODE (target_type) == FUNCTION_TYPE) | |
2660 | pedwarn ("pointer to a function used in subtraction"); | |
2661 | } | |
2662 | ||
95602da1 R |
2663 | /* If the conversion to ptrdiff_type does anything like widening or |
2664 | converting a partial to an integral mode, we get a convert_expression | |
2665 | that is in the way to do any simplifications. | |
2666 | (fold-const.c doesn't know that the extra bits won't be needed. | |
2667 | split_tree uses STRIP_SIGN_NOPS, which leaves conversions to a | |
2668 | different mode in place.) | |
2669 | So first try to find a common term here 'by hand'; we want to cover | |
2670 | at least the cases that occur in legal static initializers. */ | |
2671 | con0 = TREE_CODE (op0) == NOP_EXPR ? TREE_OPERAND (op0, 0) : op0; | |
2672 | con1 = TREE_CODE (op1) == NOP_EXPR ? TREE_OPERAND (op1, 0) : op1; | |
2673 | ||
2674 | if (TREE_CODE (con0) == PLUS_EXPR) | |
2675 | { | |
2676 | lit0 = TREE_OPERAND (con0, 1); | |
2677 | con0 = TREE_OPERAND (con0, 0); | |
2678 | } | |
2679 | else | |
2680 | lit0 = integer_zero_node; | |
2681 | ||
2682 | if (TREE_CODE (con1) == PLUS_EXPR) | |
2683 | { | |
2684 | lit1 = TREE_OPERAND (con1, 1); | |
2685 | con1 = TREE_OPERAND (con1, 0); | |
2686 | } | |
2687 | else | |
2688 | lit1 = integer_zero_node; | |
2689 | ||
2690 | if (operand_equal_p (con0, con1, 0)) | |
2691 | { | |
2692 | op0 = lit0; | |
2693 | op1 = lit1; | |
2694 | } | |
2695 | ||
2696 | ||
400fbf9f | 2697 | /* First do the subtraction as integers; |
04044297 MM |
2698 | then drop through to build the divide operator. |
2699 | Do not do default conversions on the minus operator | |
2700 | in case restype is a short type. */ | |
400fbf9f JW |
2701 | |
2702 | op0 = build_binary_op (MINUS_EXPR, convert (restype, op0), | |
04044297 | 2703 | convert (restype, op1), 0); |
ea8dd784 | 2704 | /* This generates an error if op1 is pointer to incomplete type. */ |
95602da1 | 2705 | if (!COMPLETE_OR_VOID_TYPE_P (TREE_TYPE (TREE_TYPE (orig_op1)))) |
ea8dd784 | 2706 | error ("arithmetic on pointer to an incomplete type"); |
6946afd3 | 2707 | |
ea8dd784 | 2708 | /* This generates an error if op0 is pointer to incomplete type. */ |
400fbf9f JW |
2709 | op1 = c_size_in_bytes (target_type); |
2710 | ||
2711 | /* Divide by the size, in easiest possible way. */ | |
2712 | ||
6946afd3 | 2713 | result = build (EXACT_DIV_EXPR, restype, op0, convert (restype, op1)); |
400fbf9f JW |
2714 | |
2715 | folded = fold (result); | |
2716 | if (folded == result) | |
2717 | TREE_CONSTANT (folded) = TREE_CONSTANT (op0) & TREE_CONSTANT (op1); | |
2718 | return folded; | |
2719 | } | |
2720 | \f | |
2721 | /* Construct and perhaps optimize a tree representation | |
2722 | for a unary operation. CODE, a tree_code, specifies the operation | |
207bf485 JM |
2723 | and XARG is the operand. |
2724 | For any CODE other than ADDR_EXPR, FLAG nonzero suppresses | |
2725 | the default promotions (such as from short to int). | |
2726 | For ADDR_EXPR, the default promotions are not applied; FLAG nonzero | |
2727 | allows non-lvalues; this is only used to handle conversion of non-lvalue | |
2728 | arrays to pointers in C99. */ | |
400fbf9f JW |
2729 | |
2730 | tree | |
207bf485 | 2731 | build_unary_op (code, xarg, flag) |
400fbf9f JW |
2732 | enum tree_code code; |
2733 | tree xarg; | |
207bf485 | 2734 | int flag; |
400fbf9f JW |
2735 | { |
2736 | /* No default_conversion here. It causes trouble for ADDR_EXPR. */ | |
b3694847 SS |
2737 | tree arg = xarg; |
2738 | tree argtype = 0; | |
2739 | enum tree_code typecode = TREE_CODE (TREE_TYPE (arg)); | |
400fbf9f | 2740 | tree val; |
207bf485 | 2741 | int noconvert = flag; |
400fbf9f JW |
2742 | |
2743 | if (typecode == ERROR_MARK) | |
2744 | return error_mark_node; | |
19552aa5 | 2745 | if (typecode == ENUMERAL_TYPE || typecode == BOOLEAN_TYPE) |
400fbf9f JW |
2746 | typecode = INTEGER_TYPE; |
2747 | ||
2748 | switch (code) | |
2749 | { | |
2750 | case CONVERT_EXPR: | |
2751 | /* This is used for unary plus, because a CONVERT_EXPR | |
2752 | is enough to prevent anybody from looking inside for | |
2753 | associativity, but won't generate any code. */ | |
b6a10c9f RS |
2754 | if (!(typecode == INTEGER_TYPE || typecode == REAL_TYPE |
2755 | || typecode == COMPLEX_TYPE)) | |
ab87f8c8 JL |
2756 | { |
2757 | error ("wrong type argument to unary plus"); | |
2758 | return error_mark_node; | |
2759 | } | |
400fbf9f JW |
2760 | else if (!noconvert) |
2761 | arg = default_conversion (arg); | |
ae5d234e | 2762 | arg = non_lvalue (arg); |
400fbf9f JW |
2763 | break; |
2764 | ||
2765 | case NEGATE_EXPR: | |
b6a10c9f RS |
2766 | if (!(typecode == INTEGER_TYPE || typecode == REAL_TYPE |
2767 | || typecode == COMPLEX_TYPE)) | |
ab87f8c8 JL |
2768 | { |
2769 | error ("wrong type argument to unary minus"); | |
2770 | return error_mark_node; | |
2771 | } | |
400fbf9f JW |
2772 | else if (!noconvert) |
2773 | arg = default_conversion (arg); | |
2774 | break; | |
2775 | ||
2776 | case BIT_NOT_EXPR: | |
1c2a9b35 RS |
2777 | if (typecode == COMPLEX_TYPE) |
2778 | { | |
2779 | code = CONJ_EXPR; | |
60e9d01c JM |
2780 | if (pedantic) |
2781 | pedwarn ("ISO C does not support `~' for complex conjugation"); | |
1c2a9b35 RS |
2782 | if (!noconvert) |
2783 | arg = default_conversion (arg); | |
2784 | } | |
2785 | else if (typecode != INTEGER_TYPE) | |
ab87f8c8 JL |
2786 | { |
2787 | error ("wrong type argument to bit-complement"); | |
2788 | return error_mark_node; | |
2789 | } | |
400fbf9f JW |
2790 | else if (!noconvert) |
2791 | arg = default_conversion (arg); | |
2792 | break; | |
2793 | ||
2794 | case ABS_EXPR: | |
b6a10c9f RS |
2795 | if (!(typecode == INTEGER_TYPE || typecode == REAL_TYPE |
2796 | || typecode == COMPLEX_TYPE)) | |
ab87f8c8 JL |
2797 | { |
2798 | error ("wrong type argument to abs"); | |
2799 | return error_mark_node; | |
2800 | } | |
400fbf9f JW |
2801 | else if (!noconvert) |
2802 | arg = default_conversion (arg); | |
2803 | break; | |
2804 | ||
1c2a9b35 RS |
2805 | case CONJ_EXPR: |
2806 | /* Conjugating a real value is a no-op, but allow it anyway. */ | |
2807 | if (!(typecode == INTEGER_TYPE || typecode == REAL_TYPE | |
2808 | || typecode == COMPLEX_TYPE)) | |
ab87f8c8 JL |
2809 | { |
2810 | error ("wrong type argument to conjugation"); | |
2811 | return error_mark_node; | |
2812 | } | |
1c2a9b35 RS |
2813 | else if (!noconvert) |
2814 | arg = default_conversion (arg); | |
2815 | break; | |
2816 | ||
400fbf9f JW |
2817 | case TRUTH_NOT_EXPR: |
2818 | if (typecode != INTEGER_TYPE | |
2819 | && typecode != REAL_TYPE && typecode != POINTER_TYPE | |
b6a10c9f | 2820 | && typecode != COMPLEX_TYPE |
400fbf9f JW |
2821 | /* These will convert to a pointer. */ |
2822 | && typecode != ARRAY_TYPE && typecode != FUNCTION_TYPE) | |
2823 | { | |
ab87f8c8 JL |
2824 | error ("wrong type argument to unary exclamation mark"); |
2825 | return error_mark_node; | |
400fbf9f | 2826 | } |
78ef5b89 | 2827 | arg = c_common_truthvalue_conversion (arg); |
400fbf9f JW |
2828 | return invert_truthvalue (arg); |
2829 | ||
2830 | case NOP_EXPR: | |
2831 | break; | |
b6a10c9f RS |
2832 | |
2833 | case REALPART_EXPR: | |
2834 | if (TREE_CODE (arg) == COMPLEX_CST) | |
2835 | return TREE_REALPART (arg); | |
2836 | else if (TREE_CODE (TREE_TYPE (arg)) == COMPLEX_TYPE) | |
2837 | return fold (build1 (REALPART_EXPR, TREE_TYPE (TREE_TYPE (arg)), arg)); | |
2838 | else | |
2839 | return arg; | |
2840 | ||
2841 | case IMAGPART_EXPR: | |
2842 | if (TREE_CODE (arg) == COMPLEX_CST) | |
2843 | return TREE_IMAGPART (arg); | |
2844 | else if (TREE_CODE (TREE_TYPE (arg)) == COMPLEX_TYPE) | |
2845 | return fold (build1 (IMAGPART_EXPR, TREE_TYPE (TREE_TYPE (arg)), arg)); | |
2846 | else | |
2847 | return convert (TREE_TYPE (arg), integer_zero_node); | |
400fbf9f JW |
2848 | |
2849 | case PREINCREMENT_EXPR: | |
2850 | case POSTINCREMENT_EXPR: | |
2851 | case PREDECREMENT_EXPR: | |
2852 | case POSTDECREMENT_EXPR: | |
2853 | /* Handle complex lvalues (when permitted) | |
2854 | by reduction to simpler cases. */ | |
2855 | ||
207bf485 | 2856 | val = unary_complex_lvalue (code, arg, 0); |
400fbf9f JW |
2857 | if (val != 0) |
2858 | return val; | |
2859 | ||
b6a10c9f RS |
2860 | /* Increment or decrement the real part of the value, |
2861 | and don't change the imaginary part. */ | |
2862 | if (typecode == COMPLEX_TYPE) | |
2863 | { | |
2864 | tree real, imag; | |
2865 | ||
93cc1c69 JM |
2866 | if (pedantic) |
2867 | pedwarn ("ISO C does not support `++' and `--' on complex types"); | |
2868 | ||
b6a10c9f RS |
2869 | arg = stabilize_reference (arg); |
2870 | real = build_unary_op (REALPART_EXPR, arg, 1); | |
2871 | imag = build_unary_op (IMAGPART_EXPR, arg, 1); | |
2872 | return build (COMPLEX_EXPR, TREE_TYPE (arg), | |
2873 | build_unary_op (code, real, 1), imag); | |
2874 | } | |
2875 | ||
400fbf9f JW |
2876 | /* Report invalid types. */ |
2877 | ||
2878 | if (typecode != POINTER_TYPE | |
2879 | && typecode != INTEGER_TYPE && typecode != REAL_TYPE) | |
2880 | { | |
53fcdc76 PB |
2881 | if (code == PREINCREMENT_EXPR || code == POSTINCREMENT_EXPR) |
2882 | error ("wrong type argument to increment"); | |
2883 | else | |
2884 | error ("wrong type argument to decrement"); | |
2885 | ||
ab87f8c8 | 2886 | return error_mark_node; |
400fbf9f JW |
2887 | } |
2888 | ||
2889 | { | |
b3694847 | 2890 | tree inc; |
400fbf9f JW |
2891 | tree result_type = TREE_TYPE (arg); |
2892 | ||
2893 | arg = get_unwidened (arg, 0); | |
2894 | argtype = TREE_TYPE (arg); | |
2895 | ||
2896 | /* Compute the increment. */ | |
2897 | ||
2898 | if (typecode == POINTER_TYPE) | |
2899 | { | |
6bc4e3d0 RS |
2900 | /* If pointer target is an undefined struct, |
2901 | we just cannot know how to do the arithmetic. */ | |
d0f062fb | 2902 | if (!COMPLETE_OR_VOID_TYPE_P (TREE_TYPE (result_type))) |
53fcdc76 PB |
2903 | { |
2904 | if (code == PREINCREMENT_EXPR || code == POSTINCREMENT_EXPR) | |
2905 | error ("increment of pointer to unknown structure"); | |
2906 | else | |
2907 | error ("decrement of pointer to unknown structure"); | |
2908 | } | |
6bc4e3d0 RS |
2909 | else if ((pedantic || warn_pointer_arith) |
2910 | && (TREE_CODE (TREE_TYPE (result_type)) == FUNCTION_TYPE | |
2911 | || TREE_CODE (TREE_TYPE (result_type)) == VOID_TYPE)) | |
53fcdc76 PB |
2912 | { |
2913 | if (code == PREINCREMENT_EXPR || code == POSTINCREMENT_EXPR) | |
2914 | pedwarn ("wrong type argument to increment"); | |
2915 | else | |
2916 | pedwarn ("wrong type argument to decrement"); | |
2917 | } | |
2918 | ||
0e9cff7f | 2919 | inc = c_size_in_bytes (TREE_TYPE (result_type)); |
400fbf9f JW |
2920 | } |
2921 | else | |
2922 | inc = integer_one_node; | |
2923 | ||
2924 | inc = convert (argtype, inc); | |
2925 | ||
2926 | /* Handle incrementing a cast-expression. */ | |
2927 | ||
2928 | while (1) | |
2929 | switch (TREE_CODE (arg)) | |
2930 | { | |
2931 | case NOP_EXPR: | |
2932 | case CONVERT_EXPR: | |
2933 | case FLOAT_EXPR: | |
2934 | case FIX_TRUNC_EXPR: | |
2935 | case FIX_FLOOR_EXPR: | |
2936 | case FIX_ROUND_EXPR: | |
2937 | case FIX_CEIL_EXPR: | |
ee71df46 | 2938 | pedantic_lvalue_warning (CONVERT_EXPR); |
400fbf9f JW |
2939 | /* If the real type has the same machine representation |
2940 | as the type it is cast to, we can make better output | |
2941 | by adding directly to the inside of the cast. */ | |
2942 | if ((TREE_CODE (TREE_TYPE (arg)) | |
2943 | == TREE_CODE (TREE_TYPE (TREE_OPERAND (arg, 0)))) | |
2944 | && (TYPE_MODE (TREE_TYPE (arg)) | |
2945 | == TYPE_MODE (TREE_TYPE (TREE_OPERAND (arg, 0))))) | |
2946 | arg = TREE_OPERAND (arg, 0); | |
2947 | else | |
2948 | { | |
2949 | tree incremented, modify, value; | |
19552aa5 JM |
2950 | if (TREE_CODE (TREE_TYPE (arg)) == BOOLEAN_TYPE) |
2951 | value = boolean_increment (code, arg); | |
400fbf9f | 2952 | else |
19552aa5 JM |
2953 | { |
2954 | arg = stabilize_reference (arg); | |
2955 | if (code == PREINCREMENT_EXPR || code == PREDECREMENT_EXPR) | |
2956 | value = arg; | |
2957 | else | |
2958 | value = save_expr (arg); | |
2959 | incremented = build (((code == PREINCREMENT_EXPR | |
2960 | || code == POSTINCREMENT_EXPR) | |
2961 | ? PLUS_EXPR : MINUS_EXPR), | |
2962 | argtype, value, inc); | |
2963 | TREE_SIDE_EFFECTS (incremented) = 1; | |
2964 | modify = build_modify_expr (arg, NOP_EXPR, incremented); | |
2965 | value = build (COMPOUND_EXPR, TREE_TYPE (arg), modify, value); | |
2966 | } | |
400fbf9f JW |
2967 | TREE_USED (value) = 1; |
2968 | return value; | |
2969 | } | |
2970 | break; | |
2971 | ||
2972 | default: | |
2973 | goto give_up; | |
2974 | } | |
2975 | give_up: | |
2976 | ||
2977 | /* Complain about anything else that is not a true lvalue. */ | |
2978 | if (!lvalue_or_else (arg, ((code == PREINCREMENT_EXPR | |
2979 | || code == POSTINCREMENT_EXPR) | |
ab87f8c8 JL |
2980 | ? "invalid lvalue in increment" |
2981 | : "invalid lvalue in decrement"))) | |
400fbf9f JW |
2982 | return error_mark_node; |
2983 | ||
2984 | /* Report a read-only lvalue. */ | |
26b3c423 | 2985 | if (TREE_READONLY (arg)) |
400fbf9f JW |
2986 | readonly_warning (arg, |
2987 | ((code == PREINCREMENT_EXPR | |
2988 | || code == POSTINCREMENT_EXPR) | |
57771fe8 | 2989 | ? "increment" : "decrement")); |
400fbf9f | 2990 | |
19552aa5 JM |
2991 | if (TREE_CODE (TREE_TYPE (arg)) == BOOLEAN_TYPE) |
2992 | val = boolean_increment (code, arg); | |
2993 | else | |
2994 | val = build (code, TREE_TYPE (arg), arg, inc); | |
400fbf9f JW |
2995 | TREE_SIDE_EFFECTS (val) = 1; |
2996 | val = convert (result_type, val); | |
2997 | if (TREE_CODE (val) != code) | |
2998 | TREE_NO_UNUSED_WARNING (val) = 1; | |
2999 | return val; | |
3000 | } | |
3001 | ||
3002 | case ADDR_EXPR: | |
207bf485 | 3003 | /* Note that this operation never does default_conversion. */ |
400fbf9f JW |
3004 | |
3005 | /* Let &* cancel out to simplify resulting code. */ | |
3006 | if (TREE_CODE (arg) == INDIRECT_REF) | |
3007 | { | |
3008 | /* Don't let this be an lvalue. */ | |
3009 | if (lvalue_p (TREE_OPERAND (arg, 0))) | |
3010 | return non_lvalue (TREE_OPERAND (arg, 0)); | |
3011 | return TREE_OPERAND (arg, 0); | |
3012 | } | |
3013 | ||
3014 | /* For &x[y], return x+y */ | |
3015 | if (TREE_CODE (arg) == ARRAY_REF) | |
3016 | { | |
dffd7eb6 | 3017 | if (!c_mark_addressable (TREE_OPERAND (arg, 0))) |
400fbf9f JW |
3018 | return error_mark_node; |
3019 | return build_binary_op (PLUS_EXPR, TREE_OPERAND (arg, 0), | |
3020 | TREE_OPERAND (arg, 1), 1); | |
3021 | } | |
3022 | ||
3023 | /* Handle complex lvalues (when permitted) | |
3024 | by reduction to simpler cases. */ | |
207bf485 | 3025 | val = unary_complex_lvalue (code, arg, flag); |
400fbf9f JW |
3026 | if (val != 0) |
3027 | return val; | |
3028 | ||
3029 | #if 0 /* Turned off because inconsistent; | |
3030 | float f; *&(int)f = 3.4 stores in int format | |
3031 | whereas (int)f = 3.4 stores in float format. */ | |
3032 | /* Address of a cast is just a cast of the address | |
3033 | of the operand of the cast. */ | |
3034 | switch (TREE_CODE (arg)) | |
3035 | { | |
3036 | case NOP_EXPR: | |
3037 | case CONVERT_EXPR: | |
3038 | case FLOAT_EXPR: | |
3039 | case FIX_TRUNC_EXPR: | |
3040 | case FIX_FLOOR_EXPR: | |
3041 | case FIX_ROUND_EXPR: | |
3042 | case FIX_CEIL_EXPR: | |
3043 | if (pedantic) | |
89abf8d1 | 3044 | pedwarn ("ISO C forbids the address of a cast expression"); |
400fbf9f JW |
3045 | return convert (build_pointer_type (TREE_TYPE (arg)), |
3046 | build_unary_op (ADDR_EXPR, TREE_OPERAND (arg, 0), | |
3047 | 0)); | |
3048 | } | |
3049 | #endif | |
3050 | ||
400fbf9f | 3051 | /* Anything not already handled and not a true memory reference |
207bf485 JM |
3052 | or a non-lvalue array is an error. */ |
3053 | else if (typecode != FUNCTION_TYPE && !flag | |
ab87f8c8 | 3054 | && !lvalue_or_else (arg, "invalid lvalue in unary `&'")) |
400fbf9f JW |
3055 | return error_mark_node; |
3056 | ||
3057 | /* Ordinary case; arg is a COMPONENT_REF or a decl. */ | |
3058 | argtype = TREE_TYPE (arg); | |
770ae6cc | 3059 | |
3932261a MM |
3060 | /* If the lvalue is const or volatile, merge that into the type |
3061 | to which the address will point. Note that you can't get a | |
3062 | restricted pointer by taking the address of something, so we | |
3063 | only have to deal with `const' and `volatile' here. */ | |
770ae6cc RK |
3064 | if ((DECL_P (arg) || TREE_CODE_CLASS (TREE_CODE (arg)) == 'r') |
3065 | && (TREE_READONLY (arg) || TREE_THIS_VOLATILE (arg))) | |
3066 | argtype = c_build_type_variant (argtype, | |
3067 | TREE_READONLY (arg), | |
3068 | TREE_THIS_VOLATILE (arg)); | |
400fbf9f JW |
3069 | |
3070 | argtype = build_pointer_type (argtype); | |
3071 | ||
dffd7eb6 | 3072 | if (!c_mark_addressable (arg)) |
400fbf9f JW |
3073 | return error_mark_node; |
3074 | ||
3075 | { | |
3076 | tree addr; | |
3077 | ||
3078 | if (TREE_CODE (arg) == COMPONENT_REF) | |
3079 | { | |
3080 | tree field = TREE_OPERAND (arg, 1); | |
3081 | ||
207bf485 | 3082 | addr = build_unary_op (ADDR_EXPR, TREE_OPERAND (arg, 0), flag); |
400fbf9f | 3083 | |
ef86d2a6 | 3084 | if (DECL_C_BIT_FIELD (field)) |
400fbf9f JW |
3085 | { |
3086 | error ("attempt to take address of bit-field structure member `%s'", | |
3087 | IDENTIFIER_POINTER (DECL_NAME (field))); | |
3088 | return error_mark_node; | |
3089 | } | |
3090 | ||
770ae6cc RK |
3091 | addr = fold (build (PLUS_EXPR, argtype, |
3092 | convert (argtype, addr), | |
3093 | convert (argtype, byte_position (field)))); | |
400fbf9f JW |
3094 | } |
3095 | else | |
3096 | addr = build1 (code, argtype, arg); | |
3097 | ||
3098 | /* Address of a static or external variable or | |
8706edbc RS |
3099 | file-scope function counts as a constant. */ |
3100 | if (staticp (arg) | |
3101 | && ! (TREE_CODE (arg) == FUNCTION_DECL | |
3102 | && DECL_CONTEXT (arg) != 0)) | |
7d2d49af | 3103 | TREE_CONSTANT (addr) = 1; |
400fbf9f JW |
3104 | return addr; |
3105 | } | |
e9a25f70 JL |
3106 | |
3107 | default: | |
3108 | break; | |
400fbf9f JW |
3109 | } |
3110 | ||
ab87f8c8 JL |
3111 | if (argtype == 0) |
3112 | argtype = TREE_TYPE (arg); | |
3113 | return fold (build1 (code, argtype, arg)); | |
400fbf9f JW |
3114 | } |
3115 | ||
3116 | #if 0 | |
3117 | /* If CONVERSIONS is a conversion expression or a nested sequence of such, | |
3118 | convert ARG with the same conversions in the same order | |
3119 | and return the result. */ | |
3120 | ||
3121 | static tree | |
3122 | convert_sequence (conversions, arg) | |
3123 | tree conversions; | |
3124 | tree arg; | |
3125 | { | |
3126 | switch (TREE_CODE (conversions)) | |
3127 | { | |
3128 | case NOP_EXPR: | |
3129 | case CONVERT_EXPR: | |
3130 | case FLOAT_EXPR: | |
3131 | case FIX_TRUNC_EXPR: | |
3132 | case FIX_FLOOR_EXPR: | |
3133 | case FIX_ROUND_EXPR: | |
3134 | case FIX_CEIL_EXPR: | |
3135 | return convert (TREE_TYPE (conversions), | |
3136 | convert_sequence (TREE_OPERAND (conversions, 0), | |
3137 | arg)); | |
3138 | ||
3139 | default: | |
3140 | return arg; | |
3141 | } | |
3142 | } | |
3143 | #endif /* 0 */ | |
3144 | ||
3145 | /* Return nonzero if REF is an lvalue valid for this language. | |
3146 | Lvalues can be assigned, unless their type has TYPE_READONLY. | |
1394aabd | 3147 | Lvalues can have their address taken, unless they have DECL_REGISTER. */ |
400fbf9f JW |
3148 | |
3149 | int | |
3150 | lvalue_p (ref) | |
3151 | tree ref; | |
3152 | { | |
b3694847 | 3153 | enum tree_code code = TREE_CODE (ref); |
400fbf9f JW |
3154 | |
3155 | switch (code) | |
3156 | { | |
b6a10c9f RS |
3157 | case REALPART_EXPR: |
3158 | case IMAGPART_EXPR: | |
400fbf9f JW |
3159 | case COMPONENT_REF: |
3160 | return lvalue_p (TREE_OPERAND (ref, 0)); | |
3161 | ||
db3acfa5 | 3162 | case COMPOUND_LITERAL_EXPR: |
400fbf9f JW |
3163 | case STRING_CST: |
3164 | return 1; | |
3165 | ||
3166 | case INDIRECT_REF: | |
3167 | case ARRAY_REF: | |
3168 | case VAR_DECL: | |
3169 | case PARM_DECL: | |
3170 | case RESULT_DECL: | |
3171 | case ERROR_MARK: | |
e9a25f70 JL |
3172 | return (TREE_CODE (TREE_TYPE (ref)) != FUNCTION_TYPE |
3173 | && TREE_CODE (TREE_TYPE (ref)) != METHOD_TYPE); | |
cff9c407 RK |
3174 | |
3175 | case BIND_EXPR: | |
3176 | case RTL_EXPR: | |
e9a25f70 JL |
3177 | return TREE_CODE (TREE_TYPE (ref)) == ARRAY_TYPE; |
3178 | ||
3179 | default: | |
3180 | return 0; | |
400fbf9f | 3181 | } |
400fbf9f JW |
3182 | } |
3183 | ||
3184 | /* Return nonzero if REF is an lvalue valid for this language; | |
3185 | otherwise, print an error message and return zero. */ | |
3186 | ||
3187 | int | |
ab87f8c8 | 3188 | lvalue_or_else (ref, msgid) |
400fbf9f | 3189 | tree ref; |
5d5993dd | 3190 | const char *msgid; |
400fbf9f JW |
3191 | { |
3192 | int win = lvalue_p (ref); | |
c5c76735 | 3193 | |
400fbf9f | 3194 | if (! win) |
913d0833 | 3195 | error ("%s", msgid); |
c5c76735 | 3196 | |
400fbf9f JW |
3197 | return win; |
3198 | } | |
3199 | ||
3200 | /* Apply unary lvalue-demanding operator CODE to the expression ARG | |
3201 | for certain kinds of expressions which are not really lvalues | |
207bf485 JM |
3202 | but which we can accept as lvalues. If FLAG is nonzero, then |
3203 | non-lvalues are OK since we may be converting a non-lvalue array to | |
3204 | a pointer in C99. | |
400fbf9f JW |
3205 | |
3206 | If ARG is not a kind of expression we can handle, return zero. */ | |
3207 | ||
3208 | static tree | |
207bf485 | 3209 | unary_complex_lvalue (code, arg, flag) |
400fbf9f JW |
3210 | enum tree_code code; |
3211 | tree arg; | |
207bf485 | 3212 | int flag; |
400fbf9f JW |
3213 | { |
3214 | /* Handle (a, b) used as an "lvalue". */ | |
3215 | if (TREE_CODE (arg) == COMPOUND_EXPR) | |
3216 | { | |
3217 | tree real_result = build_unary_op (code, TREE_OPERAND (arg, 1), 0); | |
e9a25f70 JL |
3218 | |
3219 | /* If this returns a function type, it isn't really being used as | |
3220 | an lvalue, so don't issue a warning about it. */ | |
207bf485 | 3221 | if (TREE_CODE (TREE_TYPE (arg)) != FUNCTION_TYPE && !flag) |
e9a25f70 JL |
3222 | pedantic_lvalue_warning (COMPOUND_EXPR); |
3223 | ||
400fbf9f JW |
3224 | return build (COMPOUND_EXPR, TREE_TYPE (real_result), |
3225 | TREE_OPERAND (arg, 0), real_result); | |
3226 | } | |
3227 | ||
3228 | /* Handle (a ? b : c) used as an "lvalue". */ | |
3229 | if (TREE_CODE (arg) == COND_EXPR) | |
3230 | { | |
207bf485 JM |
3231 | if (!flag) |
3232 | pedantic_lvalue_warning (COND_EXPR); | |
3233 | if (TREE_CODE (TREE_TYPE (arg)) != FUNCTION_TYPE && !flag) | |
e9a25f70 JL |
3234 | pedantic_lvalue_warning (COMPOUND_EXPR); |
3235 | ||
400fbf9f JW |
3236 | return (build_conditional_expr |
3237 | (TREE_OPERAND (arg, 0), | |
207bf485 JM |
3238 | build_unary_op (code, TREE_OPERAND (arg, 1), flag), |
3239 | build_unary_op (code, TREE_OPERAND (arg, 2), flag))); | |
400fbf9f JW |
3240 | } |
3241 | ||
3242 | return 0; | |
3243 | } | |
3244 | ||
3245 | /* If pedantic, warn about improper lvalue. CODE is either COND_EXPR | |
3246 | COMPOUND_EXPR, or CONVERT_EXPR (for casts). */ | |
3247 | ||
3248 | static void | |
3249 | pedantic_lvalue_warning (code) | |
3250 | enum tree_code code; | |
3251 | { | |
3252 | if (pedantic) | |
913d0833 KG |
3253 | switch (code) |
3254 | { | |
3255 | case COND_EXPR: | |
89abf8d1 | 3256 | pedwarn ("ISO C forbids use of conditional expressions as lvalues"); |
913d0833 KG |
3257 | break; |
3258 | case COMPOUND_EXPR: | |
89abf8d1 | 3259 | pedwarn ("ISO C forbids use of compound expressions as lvalues"); |
913d0833 KG |
3260 | break; |
3261 | default: | |
89abf8d1 | 3262 | pedwarn ("ISO C forbids use of cast expressions as lvalues"); |
913d0833 KG |
3263 | break; |
3264 | } | |
400fbf9f JW |
3265 | } |
3266 | \f | |
3267 | /* Warn about storing in something that is `const'. */ | |
3268 | ||
3269 | void | |
ab87f8c8 | 3270 | readonly_warning (arg, msgid) |
400fbf9f | 3271 | tree arg; |
5d5993dd | 3272 | const char *msgid; |
400fbf9f | 3273 | { |
400fbf9f JW |
3274 | if (TREE_CODE (arg) == COMPONENT_REF) |
3275 | { | |
3276 | if (TYPE_READONLY (TREE_TYPE (TREE_OPERAND (arg, 0)))) | |
ab87f8c8 | 3277 | readonly_warning (TREE_OPERAND (arg, 0), msgid); |
400fbf9f | 3278 | else |
ab87f8c8 JL |
3279 | pedwarn ("%s of read-only member `%s'", _(msgid), |
3280 | IDENTIFIER_POINTER (DECL_NAME (TREE_OPERAND (arg, 1)))); | |
400fbf9f JW |
3281 | } |
3282 | else if (TREE_CODE (arg) == VAR_DECL) | |
ab87f8c8 JL |
3283 | pedwarn ("%s of read-only variable `%s'", _(msgid), |
3284 | IDENTIFIER_POINTER (DECL_NAME (arg))); | |
400fbf9f | 3285 | else |
ab87f8c8 | 3286 | pedwarn ("%s of read-only location", _(msgid)); |
400fbf9f JW |
3287 | } |
3288 | \f | |
3289 | /* Mark EXP saying that we need to be able to take the | |
3290 | address of it; it should not be allocated in a register. | |
dffd7eb6 | 3291 | Returns true if successful. */ |
400fbf9f | 3292 | |
dffd7eb6 NB |
3293 | bool |
3294 | c_mark_addressable (exp) | |
400fbf9f JW |
3295 | tree exp; |
3296 | { | |
b3694847 | 3297 | tree x = exp; |
dffd7eb6 | 3298 | |
400fbf9f JW |
3299 | while (1) |
3300 | switch (TREE_CODE (x)) | |
3301 | { | |
400fbf9f | 3302 | case COMPONENT_REF: |
1598f4da | 3303 | if (DECL_C_BIT_FIELD (TREE_OPERAND (x, 1))) |
36c336d1 | 3304 | { |
b0287a90 | 3305 | error ("cannot take address of bit-field `%s'", |
36c336d1 | 3306 | IDENTIFIER_POINTER (DECL_NAME (TREE_OPERAND (x, 1)))); |
dffd7eb6 | 3307 | return false; |
36c336d1 | 3308 | } |
1598f4da | 3309 | |
0f41302f | 3310 | /* ... fall through ... */ |
1598f4da RK |
3311 | |
3312 | case ADDR_EXPR: | |
400fbf9f | 3313 | case ARRAY_REF: |
ce95080d RS |
3314 | case REALPART_EXPR: |
3315 | case IMAGPART_EXPR: | |
400fbf9f JW |
3316 | x = TREE_OPERAND (x, 0); |
3317 | break; | |
3318 | ||
db3acfa5 | 3319 | case COMPOUND_LITERAL_EXPR: |
400fbf9f JW |
3320 | case CONSTRUCTOR: |
3321 | TREE_ADDRESSABLE (x) = 1; | |
dffd7eb6 | 3322 | return true; |
400fbf9f JW |
3323 | |
3324 | case VAR_DECL: | |
3325 | case CONST_DECL: | |
3326 | case PARM_DECL: | |
3327 | case RESULT_DECL: | |
1394aabd RS |
3328 | if (DECL_REGISTER (x) && !TREE_ADDRESSABLE (x) |
3329 | && DECL_NONLOCAL (x)) | |
4bb6d2f8 RS |
3330 | { |
3331 | if (TREE_PUBLIC (x)) | |
3332 | { | |
3333 | error ("global register variable `%s' used in nested function", | |
3334 | IDENTIFIER_POINTER (DECL_NAME (x))); | |
dffd7eb6 | 3335 | return false; |
4bb6d2f8 RS |
3336 | } |
3337 | pedwarn ("register variable `%s' used in nested function", | |
3338 | IDENTIFIER_POINTER (DECL_NAME (x))); | |
3339 | } | |
1394aabd | 3340 | else if (DECL_REGISTER (x) && !TREE_ADDRESSABLE (x)) |
400fbf9f JW |
3341 | { |
3342 | if (TREE_PUBLIC (x)) | |
3343 | { | |
3344 | error ("address of global register variable `%s' requested", | |
3345 | IDENTIFIER_POINTER (DECL_NAME (x))); | |
dffd7eb6 | 3346 | return false; |
400fbf9f | 3347 | } |
bbbd6700 RK |
3348 | |
3349 | /* If we are making this addressable due to its having | |
3350 | volatile components, give a different error message. Also | |
3351 | handle the case of an unnamed parameter by not trying | |
3352 | to give the name. */ | |
3353 | ||
3354 | else if (C_TYPE_FIELDS_VOLATILE (TREE_TYPE (x))) | |
3355 | { | |
3356 | error ("cannot put object with volatile field into register"); | |
dffd7eb6 | 3357 | return false; |
bbbd6700 RK |
3358 | } |
3359 | ||
400fbf9f JW |
3360 | pedwarn ("address of register variable `%s' requested", |
3361 | IDENTIFIER_POINTER (DECL_NAME (x))); | |
3362 | } | |
3363 | put_var_into_stack (x); | |
3364 | ||
3365 | /* drops in */ | |
3366 | case FUNCTION_DECL: | |
3367 | TREE_ADDRESSABLE (x) = 1; | |
3368 | #if 0 /* poplevel deals with this now. */ | |
3369 | if (DECL_CONTEXT (x) == 0) | |
3370 | TREE_ADDRESSABLE (DECL_ASSEMBLER_NAME (x)) = 1; | |
3371 | #endif | |
3372 | ||
3373 | default: | |
dffd7eb6 | 3374 | return true; |
400fbf9f JW |
3375 | } |
3376 | } | |
3377 | \f | |
3378 | /* Build and return a conditional expression IFEXP ? OP1 : OP2. */ | |
3379 | ||
3380 | tree | |
3381 | build_conditional_expr (ifexp, op1, op2) | |
3382 | tree ifexp, op1, op2; | |
3383 | { | |
b3694847 SS |
3384 | tree type1; |
3385 | tree type2; | |
3386 | enum tree_code code1; | |
3387 | enum tree_code code2; | |
3388 | tree result_type = NULL; | |
fd5d5b94 | 3389 | tree orig_op1 = op1, orig_op2 = op2; |
400fbf9f | 3390 | |
78ef5b89 | 3391 | ifexp = c_common_truthvalue_conversion (default_conversion (ifexp)); |
400fbf9f | 3392 | |
400fbf9f JW |
3393 | #if 0 /* Produces wrong result if within sizeof. */ |
3394 | /* Don't promote the operands separately if they promote | |
3395 | the same way. Return the unpromoted type and let the combined | |
3396 | value get promoted if necessary. */ | |
3397 | ||
3398 | if (TREE_TYPE (op1) == TREE_TYPE (op2) | |
3399 | && TREE_CODE (TREE_TYPE (op1)) != ARRAY_TYPE | |
3400 | && TREE_CODE (TREE_TYPE (op1)) != ENUMERAL_TYPE | |
3401 | && TREE_CODE (TREE_TYPE (op1)) != FUNCTION_TYPE) | |
3402 | { | |
3403 | if (TREE_CODE (ifexp) == INTEGER_CST) | |
a29f2ec1 | 3404 | return pedantic_non_lvalue (integer_zerop (ifexp) ? op2 : op1); |
400fbf9f JW |
3405 | |
3406 | return fold (build (COND_EXPR, TREE_TYPE (op1), ifexp, op1, op2)); | |
3407 | } | |
3408 | #endif | |
3409 | ||
e855c5ce | 3410 | /* Promote both alternatives. */ |
400fbf9f JW |
3411 | |
3412 | if (TREE_CODE (TREE_TYPE (op1)) != VOID_TYPE) | |
3413 | op1 = default_conversion (op1); | |
3414 | if (TREE_CODE (TREE_TYPE (op2)) != VOID_TYPE) | |
3415 | op2 = default_conversion (op2); | |
3416 | ||
e855c5ce RS |
3417 | if (TREE_CODE (ifexp) == ERROR_MARK |
3418 | || TREE_CODE (TREE_TYPE (op1)) == ERROR_MARK | |
3419 | || TREE_CODE (TREE_TYPE (op2)) == ERROR_MARK) | |
3420 | return error_mark_node; | |
3421 | ||
400fbf9f JW |
3422 | type1 = TREE_TYPE (op1); |
3423 | code1 = TREE_CODE (type1); | |
3424 | type2 = TREE_TYPE (op2); | |
3425 | code2 = TREE_CODE (type2); | |
3426 | ||
3427 | /* Quickly detect the usual case where op1 and op2 have the same type | |
3428 | after promotion. */ | |
1ad409d2 RS |
3429 | if (TYPE_MAIN_VARIANT (type1) == TYPE_MAIN_VARIANT (type2)) |
3430 | { | |
3431 | if (type1 == type2) | |
3432 | result_type = type1; | |
3433 | else | |
3434 | result_type = TYPE_MAIN_VARIANT (type1); | |
3435 | } | |
f519a452 GDR |
3436 | else if ((code1 == INTEGER_TYPE || code1 == REAL_TYPE |
3437 | || code1 == COMPLEX_TYPE) | |
3438 | && (code2 == INTEGER_TYPE || code2 == REAL_TYPE | |
3439 | || code2 == COMPLEX_TYPE)) | |
400fbf9f JW |
3440 | { |
3441 | result_type = common_type (type1, type2); | |
cb3ca04e ZW |
3442 | |
3443 | /* If -Wsign-compare, warn here if type1 and type2 have | |
3444 | different signedness. We'll promote the signed to unsigned | |
3445 | and later code won't know it used to be different. | |
3446 | Do this check on the original types, so that explicit casts | |
3447 | will be considered, but default promotions won't. */ | |
3448 | if ((warn_sign_compare < 0 ? extra_warnings : warn_sign_compare) | |
3449 | && !skip_evaluation) | |
3450 | { | |
3451 | int unsigned_op1 = TREE_UNSIGNED (TREE_TYPE (orig_op1)); | |
3452 | int unsigned_op2 = TREE_UNSIGNED (TREE_TYPE (orig_op2)); | |
3453 | ||
3454 | if (unsigned_op1 ^ unsigned_op2) | |
3455 | { | |
3456 | /* Do not warn if the result type is signed, since the | |
3457 | signed type will only be chosen if it can represent | |
3458 | all the values of the unsigned type. */ | |
3459 | if (! TREE_UNSIGNED (result_type)) | |
3460 | /* OK */; | |
3461 | /* Do not warn if the signed quantity is an unsuffixed | |
3462 | integer literal (or some static constant expression | |
3463 | involving such literals) and it is non-negative. */ | |
3facde26 KG |
3464 | else if ((unsigned_op2 && tree_expr_nonnegative_p (op1)) |
3465 | || (unsigned_op1 && tree_expr_nonnegative_p (op2))) | |
cb3ca04e ZW |
3466 | /* OK */; |
3467 | else | |
3468 | warning ("signed and unsigned type in conditional expression"); | |
3469 | } | |
3470 | } | |
400fbf9f JW |
3471 | } |
3472 | else if (code1 == VOID_TYPE || code2 == VOID_TYPE) | |
3473 | { | |
3474 | if (pedantic && (code1 != VOID_TYPE || code2 != VOID_TYPE)) | |
89abf8d1 | 3475 | pedwarn ("ISO C forbids conditional expr with only one void side"); |
400fbf9f JW |
3476 | result_type = void_type_node; |
3477 | } | |
3478 | else if (code1 == POINTER_TYPE && code2 == POINTER_TYPE) | |
3479 | { | |
3480 | if (comp_target_types (type1, type2)) | |
3481 | result_type = common_type (type1, type2); | |
fd5d5b94 RS |
3482 | else if (integer_zerop (op1) && TREE_TYPE (type1) == void_type_node |
3483 | && TREE_CODE (orig_op1) != NOP_EXPR) | |
400fbf9f | 3484 | result_type = qualify_type (type2, type1); |
fd5d5b94 RS |
3485 | else if (integer_zerop (op2) && TREE_TYPE (type2) == void_type_node |
3486 | && TREE_CODE (orig_op2) != NOP_EXPR) | |
400fbf9f | 3487 | result_type = qualify_type (type1, type2); |
71653180 | 3488 | else if (VOID_TYPE_P (TREE_TYPE (type1))) |
400fbf9f JW |
3489 | { |
3490 | if (pedantic && TREE_CODE (TREE_TYPE (type2)) == FUNCTION_TYPE) | |
89abf8d1 | 3491 | pedwarn ("ISO C forbids conditional expr between `void *' and function pointer"); |
1d7ff272 JM |
3492 | result_type = build_pointer_type (qualify_type (TREE_TYPE (type1), |
3493 | TREE_TYPE (type2))); | |
400fbf9f | 3494 | } |
71653180 | 3495 | else if (VOID_TYPE_P (TREE_TYPE (type2))) |
400fbf9f JW |
3496 | { |
3497 | if (pedantic && TREE_CODE (TREE_TYPE (type1)) == FUNCTION_TYPE) | |
89abf8d1 | 3498 | pedwarn ("ISO C forbids conditional expr between `void *' and function pointer"); |
1d7ff272 JM |
3499 | result_type = build_pointer_type (qualify_type (TREE_TYPE (type2), |
3500 | TREE_TYPE (type1))); | |
400fbf9f JW |
3501 | } |
3502 | else | |
3503 | { | |
3504 | pedwarn ("pointer type mismatch in conditional expression"); | |
3505 | result_type = build_pointer_type (void_type_node); | |
3506 | } | |
3507 | } | |
3508 | else if (code1 == POINTER_TYPE && code2 == INTEGER_TYPE) | |
3509 | { | |
3510 | if (! integer_zerop (op2)) | |
3511 | pedwarn ("pointer/integer type mismatch in conditional expression"); | |
3512 | else | |
3513 | { | |
3514 | op2 = null_pointer_node; | |
400fbf9f JW |
3515 | } |
3516 | result_type = type1; | |
3517 | } | |
3518 | else if (code2 == POINTER_TYPE && code1 == INTEGER_TYPE) | |
3519 | { | |
3520 | if (!integer_zerop (op1)) | |
3521 | pedwarn ("pointer/integer type mismatch in conditional expression"); | |
3522 | else | |
3523 | { | |
3524 | op1 = null_pointer_node; | |
400fbf9f JW |
3525 | } |
3526 | result_type = type2; | |
3527 | } | |
3528 | ||
3529 | if (!result_type) | |
3530 | { | |
3531 | if (flag_cond_mismatch) | |
3532 | result_type = void_type_node; | |
3533 | else | |
3534 | { | |
3535 | error ("type mismatch in conditional expression"); | |
3536 | return error_mark_node; | |
3537 | } | |
3538 | } | |
3539 | ||
1dfdf85d RS |
3540 | /* Merge const and volatile flags of the incoming types. */ |
3541 | result_type | |
3542 | = build_type_variant (result_type, | |
48c73063 RS |
3543 | TREE_READONLY (op1) || TREE_READONLY (op2), |
3544 | TREE_THIS_VOLATILE (op1) || TREE_THIS_VOLATILE (op2)); | |
e58cd767 | 3545 | |
400fbf9f | 3546 | if (result_type != TREE_TYPE (op1)) |
e58cd767 | 3547 | op1 = convert_and_check (result_type, op1); |
400fbf9f | 3548 | if (result_type != TREE_TYPE (op2)) |
e58cd767 | 3549 | op2 = convert_and_check (result_type, op2); |
400fbf9f | 3550 | |
5abb45f2 | 3551 | if (TREE_CODE (ifexp) == INTEGER_CST) |
a29f2ec1 | 3552 | return pedantic_non_lvalue (integer_zerop (ifexp) ? op2 : op1); |
400fbf9f | 3553 | |
400fbf9f JW |
3554 | return fold (build (COND_EXPR, result_type, ifexp, op1, op2)); |
3555 | } | |
3556 | \f | |
3557 | /* Given a list of expressions, return a compound expression | |
3558 | that performs them all and returns the value of the last of them. */ | |
3559 | ||
3560 | tree | |
3561 | build_compound_expr (list) | |
3562 | tree list; | |
82bde854 | 3563 | { |
43a5a542 | 3564 | return internal_build_compound_expr (list, TRUE); |
82bde854 MM |
3565 | } |
3566 | ||
3567 | static tree | |
3568 | internal_build_compound_expr (list, first_p) | |
3569 | tree list; | |
3570 | int first_p; | |
400fbf9f | 3571 | { |
b3694847 | 3572 | tree rest; |
400fbf9f JW |
3573 | |
3574 | if (TREE_CHAIN (list) == 0) | |
3575 | { | |
207bf485 JM |
3576 | /* Convert arrays and functions to pointers when there |
3577 | really is a comma operator. */ | |
3578 | if (!first_p) | |
3579 | TREE_VALUE (list) | |
3580 | = default_function_array_conversion (TREE_VALUE (list)); | |
714a0864 | 3581 | |
6dc42e49 | 3582 | #if 0 /* If something inside inhibited lvalueness, we should not override. */ |
400fbf9f JW |
3583 | /* Consider (x, y+0), which is not an lvalue since y+0 is not. */ |
3584 | ||
3585 | /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */ | |
3586 | if (TREE_CODE (list) == NON_LVALUE_EXPR) | |
3587 | list = TREE_OPERAND (list, 0); | |
3588 | #endif | |
3589 | ||
439f6027 | 3590 | /* Don't let (0, 0) be null pointer constant. */ |
82bde854 | 3591 | if (!first_p && integer_zerop (TREE_VALUE (list))) |
439f6027 RS |
3592 | return non_lvalue (TREE_VALUE (list)); |
3593 | return TREE_VALUE (list); | |
400fbf9f JW |
3594 | } |
3595 | ||
82bde854 | 3596 | rest = internal_build_compound_expr (TREE_CHAIN (list), FALSE); |
400fbf9f | 3597 | |
0e7c47fa RK |
3598 | if (! TREE_SIDE_EFFECTS (TREE_VALUE (list))) |
3599 | { | |
3600 | /* The left-hand operand of a comma expression is like an expression | |
3601 | statement: with -W or -Wunused, we should warn if it doesn't have | |
3602 | any side-effects, unless it was explicitly cast to (void). */ | |
078721e1 | 3603 | if ((extra_warnings || warn_unused_value) |
0e7c47fa | 3604 | && ! (TREE_CODE (TREE_VALUE (list)) == CONVERT_EXPR |
71653180 | 3605 | && VOID_TYPE_P (TREE_TYPE (TREE_VALUE (list))))) |
0e7c47fa RK |
3606 | warning ("left-hand operand of comma expression has no effect"); |
3607 | ||
3608 | /* When pedantic, a compound expression can be neither an lvalue | |
3609 | nor an integer constant expression. */ | |
3610 | if (! pedantic) | |
3611 | return rest; | |
3612 | } | |
3613 | ||
3614 | /* With -Wunused, we should also warn if the left-hand operand does have | |
3615 | side-effects, but computes a value which is not used. For example, in | |
3616 | `foo() + bar(), baz()' the result of the `+' operator is not used, | |
3617 | so we should issue a warning. */ | |
078721e1 | 3618 | else if (warn_unused_value) |
0e7c47fa | 3619 | warn_if_unused_value (TREE_VALUE (list)); |
400fbf9f JW |
3620 | |
3621 | return build (COMPOUND_EXPR, TREE_TYPE (rest), TREE_VALUE (list), rest); | |
3622 | } | |
3623 | ||
3624 | /* Build an expression representing a cast to type TYPE of expression EXPR. */ | |
3625 | ||
3626 | tree | |
3627 | build_c_cast (type, expr) | |
b3694847 | 3628 | tree type; |
400fbf9f JW |
3629 | tree expr; |
3630 | { | |
b3694847 | 3631 | tree value = expr; |
400fbf9f JW |
3632 | |
3633 | if (type == error_mark_node || expr == error_mark_node) | |
3634 | return error_mark_node; | |
3635 | type = TYPE_MAIN_VARIANT (type); | |
3636 | ||
3637 | #if 0 | |
3638 | /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */ | |
3639 | if (TREE_CODE (value) == NON_LVALUE_EXPR) | |
3640 | value = TREE_OPERAND (value, 0); | |
3641 | #endif | |
3642 | ||
3643 | if (TREE_CODE (type) == ARRAY_TYPE) | |
3644 | { | |
3645 | error ("cast specifies array type"); | |
3646 | return error_mark_node; | |
3647 | } | |
3648 | ||
3649 | if (TREE_CODE (type) == FUNCTION_TYPE) | |
3650 | { | |
3651 | error ("cast specifies function type"); | |
3652 | return error_mark_node; | |
3653 | } | |
3654 | ||
f375b7a7 | 3655 | if (type == TYPE_MAIN_VARIANT (TREE_TYPE (value))) |
400fbf9f JW |
3656 | { |
3657 | if (pedantic) | |
3658 | { | |
3659 | if (TREE_CODE (type) == RECORD_TYPE | |
3660 | || TREE_CODE (type) == UNION_TYPE) | |
89abf8d1 | 3661 | pedwarn ("ISO C forbids casting nonscalar to the same type"); |
400fbf9f JW |
3662 | } |
3663 | } | |
3664 | else if (TREE_CODE (type) == UNION_TYPE) | |
3665 | { | |
3666 | tree field; | |
207bf485 | 3667 | value = default_function_array_conversion (value); |
0c16ddf7 | 3668 | |
400fbf9f JW |
3669 | for (field = TYPE_FIELDS (type); field; field = TREE_CHAIN (field)) |
3670 | if (comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (field)), | |
3671 | TYPE_MAIN_VARIANT (TREE_TYPE (value)))) | |
3672 | break; | |
3673 | ||
3674 | if (field) | |
3675 | { | |
5d5993dd | 3676 | const char *name; |
281ec92f | 3677 | tree t; |
805f961c | 3678 | |
400fbf9f | 3679 | if (pedantic) |
89abf8d1 | 3680 | pedwarn ("ISO C forbids casts to union type"); |
805f961c RS |
3681 | if (TYPE_NAME (type) != 0) |
3682 | { | |
3683 | if (TREE_CODE (TYPE_NAME (type)) == IDENTIFIER_NODE) | |
3684 | name = IDENTIFIER_POINTER (TYPE_NAME (type)); | |
3685 | else | |
3686 | name = IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (type))); | |
3687 | } | |
3688 | else | |
3689 | name = ""; | |
281ec92f | 3690 | t = digest_init (type, build (CONSTRUCTOR, type, NULL_TREE, |
273cf2e4 | 3691 | build_tree_list (field, value)), 0); |
281ec92f RS |
3692 | TREE_CONSTANT (t) = TREE_CONSTANT (value); |
3693 | return t; | |
400fbf9f JW |
3694 | } |
3695 | error ("cast to union type from type not present in union"); | |
3696 | return error_mark_node; | |
3697 | } | |
3698 | else | |
3699 | { | |
10d5caec | 3700 | tree otype, ovalue; |
53b01f59 RS |
3701 | |
3702 | /* If casting to void, avoid the error that would come | |
3703 | from default_conversion in the case of a non-lvalue array. */ | |
3704 | if (type == void_type_node) | |
3705 | return build1 (CONVERT_EXPR, type, value); | |
3706 | ||
400fbf9f JW |
3707 | /* Convert functions and arrays to pointers, |
3708 | but don't convert any other types. */ | |
207bf485 | 3709 | value = default_function_array_conversion (value); |
400fbf9f JW |
3710 | otype = TREE_TYPE (value); |
3711 | ||
d45cf215 | 3712 | /* Optionally warn about potentially worrisome casts. */ |
400fbf9f JW |
3713 | |
3714 | if (warn_cast_qual | |
3715 | && TREE_CODE (type) == POINTER_TYPE | |
3716 | && TREE_CODE (otype) == POINTER_TYPE) | |
3717 | { | |
f5963e61 JL |
3718 | tree in_type = type; |
3719 | tree in_otype = otype; | |
af702de8 RS |
3720 | int added = 0; |
3721 | int discarded = 0; | |
f5963e61 | 3722 | |
cd6311ef ZW |
3723 | /* Check that the qualifiers on IN_TYPE are a superset of |
3724 | the qualifiers of IN_OTYPE. The outermost level of | |
3725 | POINTER_TYPE nodes is uninteresting and we stop as soon | |
3726 | as we hit a non-POINTER_TYPE node on either type. */ | |
3727 | do | |
3728 | { | |
3729 | in_otype = TREE_TYPE (in_otype); | |
3730 | in_type = TREE_TYPE (in_type); | |
af702de8 RS |
3731 | |
3732 | /* GNU C allows cv-qualified function types. 'const' | |
3733 | means the function is very pure, 'volatile' means it | |
3734 | can't return. We need to warn when such qualifiers | |
3735 | are added, not when they're taken away. */ | |
3736 | if (TREE_CODE (in_otype) == FUNCTION_TYPE | |
3737 | && TREE_CODE (in_type) == FUNCTION_TYPE) | |
3738 | added |= (TYPE_QUALS (in_type) & ~TYPE_QUALS (in_otype)); | |
3739 | else | |
3740 | discarded |= (TYPE_QUALS (in_otype) & ~TYPE_QUALS (in_type)); | |
cd6311ef ZW |
3741 | } |
3742 | while (TREE_CODE (in_type) == POINTER_TYPE | |
3743 | && TREE_CODE (in_otype) == POINTER_TYPE); | |
3744 | ||
af702de8 RS |
3745 | if (added) |
3746 | warning ("cast adds new qualifiers to function type"); | |
3747 | ||
3748 | if (discarded) | |
3932261a MM |
3749 | /* There are qualifiers present in IN_OTYPE that are not |
3750 | present in IN_TYPE. */ | |
6fffb55c | 3751 | warning ("cast discards qualifiers from pointer target type"); |
400fbf9f JW |
3752 | } |
3753 | ||
3754 | /* Warn about possible alignment problems. */ | |
d45cf215 | 3755 | if (STRICT_ALIGNMENT && warn_cast_align |
400fbf9f JW |
3756 | && TREE_CODE (type) == POINTER_TYPE |
3757 | && TREE_CODE (otype) == POINTER_TYPE | |
3758 | && TREE_CODE (TREE_TYPE (otype)) != VOID_TYPE | |
3759 | && TREE_CODE (TREE_TYPE (otype)) != FUNCTION_TYPE | |
ec9aa895 RK |
3760 | /* Don't warn about opaque types, where the actual alignment |
3761 | restriction is unknown. */ | |
3762 | && !((TREE_CODE (TREE_TYPE (otype)) == UNION_TYPE | |
3763 | || TREE_CODE (TREE_TYPE (otype)) == RECORD_TYPE) | |
3764 | && TYPE_MODE (TREE_TYPE (otype)) == VOIDmode) | |
400fbf9f JW |
3765 | && TYPE_ALIGN (TREE_TYPE (type)) > TYPE_ALIGN (TREE_TYPE (otype))) |
3766 | warning ("cast increases required alignment of target type"); | |
400fbf9f JW |
3767 | |
3768 | if (TREE_CODE (type) == INTEGER_TYPE | |
3769 | && TREE_CODE (otype) == POINTER_TYPE | |
c9b7f31c RS |
3770 | && TYPE_PRECISION (type) != TYPE_PRECISION (otype) |
3771 | && !TREE_CONSTANT (value)) | |
400fbf9f JW |
3772 | warning ("cast from pointer to integer of different size"); |
3773 | ||
796bb373 RK |
3774 | if (warn_bad_function_cast |
3775 | && TREE_CODE (value) == CALL_EXPR | |
3776 | && TREE_CODE (type) != TREE_CODE (otype)) | |
3777 | warning ("cast does not match function type"); | |
3778 | ||
400fbf9f JW |
3779 | if (TREE_CODE (type) == POINTER_TYPE |
3780 | && TREE_CODE (otype) == INTEGER_TYPE | |
2918ed3c | 3781 | && TYPE_PRECISION (type) != TYPE_PRECISION (otype) |
c9b7f31c RS |
3782 | /* Don't warn about converting any constant. */ |
3783 | && !TREE_CONSTANT (value)) | |
400fbf9f JW |
3784 | warning ("cast to pointer from integer of different size"); |
3785 | ||
10d5caec | 3786 | ovalue = value; |
400fbf9f | 3787 | value = convert (type, value); |
e58cd767 RS |
3788 | |
3789 | /* Ignore any integer overflow caused by the cast. */ | |
3790 | if (TREE_CODE (value) == INTEGER_CST) | |
10d5caec PE |
3791 | { |
3792 | TREE_OVERFLOW (value) = TREE_OVERFLOW (ovalue); | |
3793 | TREE_CONSTANT_OVERFLOW (value) = TREE_CONSTANT_OVERFLOW (ovalue); | |
3794 | } | |
400fbf9f JW |
3795 | } |
3796 | ||
684d9f3b | 3797 | /* Pedantically, don't let (void *) (FOO *) 0 be a null pointer constant. */ |
fd5d5b94 RS |
3798 | if (pedantic && TREE_CODE (value) == INTEGER_CST |
3799 | && TREE_CODE (expr) == INTEGER_CST | |
3800 | && TREE_CODE (TREE_TYPE (expr)) != INTEGER_TYPE) | |
3801 | value = non_lvalue (value); | |
3802 | ||
3803 | /* If pedantic, don't let a cast be an lvalue. */ | |
400fbf9f | 3804 | if (value == expr && pedantic) |
fd5d5b94 RS |
3805 | value = non_lvalue (value); |
3806 | ||
400fbf9f JW |
3807 | return value; |
3808 | } | |
15b732b2 NB |
3809 | |
3810 | /* Interpret a cast of expression EXPR to type TYPE. */ | |
3811 | tree | |
3812 | c_cast_expr (type, expr) | |
3813 | tree type, expr; | |
3814 | { | |
3815 | int saved_wsp = warn_strict_prototypes; | |
3816 | ||
3817 | /* This avoids warnings about unprototyped casts on | |
3818 | integers. E.g. "#define SIG_DFL (void(*)())0". */ | |
3819 | if (TREE_CODE (expr) == INTEGER_CST) | |
3820 | warn_strict_prototypes = 0; | |
3821 | type = groktypename (type); | |
3822 | warn_strict_prototypes = saved_wsp; | |
3823 | ||
3824 | return build_c_cast (type, expr); | |
3825 | } | |
3826 | ||
400fbf9f JW |
3827 | \f |
3828 | /* Build an assignment expression of lvalue LHS from value RHS. | |
3829 | MODIFYCODE is the code for a binary operator that we use | |
3830 | to combine the old value of LHS with RHS to get the new value. | |
3831 | Or else MODIFYCODE is NOP_EXPR meaning do a simple assignment. */ | |
3832 | ||
3833 | tree | |
3834 | build_modify_expr (lhs, modifycode, rhs) | |
3835 | tree lhs, rhs; | |
3836 | enum tree_code modifycode; | |
3837 | { | |
b3694847 | 3838 | tree result; |
400fbf9f JW |
3839 | tree newrhs; |
3840 | tree lhstype = TREE_TYPE (lhs); | |
3841 | tree olhstype = lhstype; | |
3842 | ||
3843 | /* Types that aren't fully specified cannot be used in assignments. */ | |
3844 | lhs = require_complete_type (lhs); | |
3845 | ||
3846 | /* Avoid duplicate error messages from operands that had errors. */ | |
3847 | if (TREE_CODE (lhs) == ERROR_MARK || TREE_CODE (rhs) == ERROR_MARK) | |
3848 | return error_mark_node; | |
3849 | ||
3850 | /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */ | |
fc76e425 RS |
3851 | /* Do not use STRIP_NOPS here. We do not want an enumerator |
3852 | whose value is 0 to count as a null pointer constant. */ | |
400fbf9f JW |
3853 | if (TREE_CODE (rhs) == NON_LVALUE_EXPR) |
3854 | rhs = TREE_OPERAND (rhs, 0); | |
3855 | ||
3856 | newrhs = rhs; | |
3857 | ||
3858 | /* Handle control structure constructs used as "lvalues". */ | |
3859 | ||
3860 | switch (TREE_CODE (lhs)) | |
3861 | { | |
3862 | /* Handle (a, b) used as an "lvalue". */ | |
3863 | case COMPOUND_EXPR: | |
3864 | pedantic_lvalue_warning (COMPOUND_EXPR); | |
c5c76735 | 3865 | newrhs = build_modify_expr (TREE_OPERAND (lhs, 1), modifycode, rhs); |
19d76e60 RK |
3866 | if (TREE_CODE (newrhs) == ERROR_MARK) |
3867 | return error_mark_node; | |
400fbf9f | 3868 | return build (COMPOUND_EXPR, lhstype, |
19d76e60 RK |
3869 | TREE_OPERAND (lhs, 0), newrhs); |
3870 | ||
400fbf9f JW |
3871 | /* Handle (a ? b : c) used as an "lvalue". */ |
3872 | case COND_EXPR: | |
3873 | pedantic_lvalue_warning (COND_EXPR); | |
3874 | rhs = save_expr (rhs); | |
3875 | { | |
3876 | /* Produce (a ? (b = rhs) : (c = rhs)) | |
3877 | except that the RHS goes through a save-expr | |
3878 | so the code to compute it is only emitted once. */ | |
3879 | tree cond | |
3880 | = build_conditional_expr (TREE_OPERAND (lhs, 0), | |
3881 | build_modify_expr (TREE_OPERAND (lhs, 1), | |
3882 | modifycode, rhs), | |
3883 | build_modify_expr (TREE_OPERAND (lhs, 2), | |
3884 | modifycode, rhs)); | |
19d76e60 RK |
3885 | if (TREE_CODE (cond) == ERROR_MARK) |
3886 | return cond; | |
400fbf9f JW |
3887 | /* Make sure the code to compute the rhs comes out |
3888 | before the split. */ | |
3889 | return build (COMPOUND_EXPR, TREE_TYPE (lhs), | |
3890 | /* But cast it to void to avoid an "unused" error. */ | |
3891 | convert (void_type_node, rhs), cond); | |
3892 | } | |
e9a25f70 JL |
3893 | default: |
3894 | break; | |
400fbf9f JW |
3895 | } |
3896 | ||
3897 | /* If a binary op has been requested, combine the old LHS value with the RHS | |
3898 | producing the value we should actually store into the LHS. */ | |
3899 | ||
3900 | if (modifycode != NOP_EXPR) | |
3901 | { | |
3902 | lhs = stabilize_reference (lhs); | |
3903 | newrhs = build_binary_op (modifycode, lhs, rhs, 1); | |
3904 | } | |
3905 | ||
3906 | /* Handle a cast used as an "lvalue". | |
3907 | We have already performed any binary operator using the value as cast. | |
3908 | Now convert the result to the cast type of the lhs, | |
3909 | and then true type of the lhs and store it there; | |
3910 | then convert result back to the cast type to be the value | |
3911 | of the assignment. */ | |
3912 | ||
3913 | switch (TREE_CODE (lhs)) | |
3914 | { | |
3915 | case NOP_EXPR: | |
3916 | case CONVERT_EXPR: | |
3917 | case FLOAT_EXPR: | |
3918 | case FIX_TRUNC_EXPR: | |
3919 | case FIX_FLOOR_EXPR: | |
3920 | case FIX_ROUND_EXPR: | |
3921 | case FIX_CEIL_EXPR: | |
207bf485 | 3922 | newrhs = default_function_array_conversion (newrhs); |
400fbf9f JW |
3923 | { |
3924 | tree inner_lhs = TREE_OPERAND (lhs, 0); | |
3925 | tree result; | |
3926 | result = build_modify_expr (inner_lhs, NOP_EXPR, | |
3927 | convert (TREE_TYPE (inner_lhs), | |
3928 | convert (lhstype, newrhs))); | |
19d76e60 RK |
3929 | if (TREE_CODE (result) == ERROR_MARK) |
3930 | return result; | |
400fbf9f JW |
3931 | pedantic_lvalue_warning (CONVERT_EXPR); |
3932 | return convert (TREE_TYPE (lhs), result); | |
3933 | } | |
e9a25f70 JL |
3934 | |
3935 | default: | |
3936 | break; | |
400fbf9f JW |
3937 | } |
3938 | ||
3939 | /* Now we have handled acceptable kinds of LHS that are not truly lvalues. | |
3940 | Reject anything strange now. */ | |
3941 | ||
ab87f8c8 | 3942 | if (!lvalue_or_else (lhs, "invalid lvalue in assignment")) |
400fbf9f JW |
3943 | return error_mark_node; |
3944 | ||
3945 | /* Warn about storing in something that is `const'. */ | |
3946 | ||
3947 | if (TREE_READONLY (lhs) || TYPE_READONLY (lhstype) | |
3948 | || ((TREE_CODE (lhstype) == RECORD_TYPE | |
3949 | || TREE_CODE (lhstype) == UNION_TYPE) | |
3950 | && C_TYPE_FIELDS_READONLY (lhstype))) | |
3951 | readonly_warning (lhs, "assignment"); | |
3952 | ||
3953 | /* If storing into a structure or union member, | |
3954 | it has probably been given type `int'. | |
3955 | Compute the type that would go with | |
3956 | the actual amount of storage the member occupies. */ | |
3957 | ||
3958 | if (TREE_CODE (lhs) == COMPONENT_REF | |
3959 | && (TREE_CODE (lhstype) == INTEGER_TYPE | |
19552aa5 | 3960 | || TREE_CODE (lhstype) == BOOLEAN_TYPE |
400fbf9f JW |
3961 | || TREE_CODE (lhstype) == REAL_TYPE |
3962 | || TREE_CODE (lhstype) == ENUMERAL_TYPE)) | |
3963 | lhstype = TREE_TYPE (get_unwidened (lhs, 0)); | |
3964 | ||
3965 | /* If storing in a field that is in actuality a short or narrower than one, | |
3966 | we must store in the field in its actual type. */ | |
3967 | ||
3968 | if (lhstype != TREE_TYPE (lhs)) | |
3969 | { | |
3970 | lhs = copy_node (lhs); | |
3971 | TREE_TYPE (lhs) = lhstype; | |
3972 | } | |
3973 | ||
3974 | /* Convert new value to destination type. */ | |
3975 | ||
ab87f8c8 | 3976 | newrhs = convert_for_assignment (lhstype, newrhs, _("assignment"), |
9b7267b8 | 3977 | NULL_TREE, NULL_TREE, 0); |
400fbf9f JW |
3978 | if (TREE_CODE (newrhs) == ERROR_MARK) |
3979 | return error_mark_node; | |
3980 | ||
bb58bec5 JM |
3981 | /* Scan operands */ |
3982 | ||
400fbf9f JW |
3983 | result = build (MODIFY_EXPR, lhstype, lhs, newrhs); |
3984 | TREE_SIDE_EFFECTS (result) = 1; | |
3985 | ||
3986 | /* If we got the LHS in a different type for storing in, | |
3987 | convert the result back to the nominal type of LHS | |
3988 | so that the value we return always has the same type | |
3989 | as the LHS argument. */ | |
3990 | ||
3991 | if (olhstype == TREE_TYPE (result)) | |
3992 | return result; | |
ab87f8c8 | 3993 | return convert_for_assignment (olhstype, result, _("assignment"), |
9b7267b8 | 3994 | NULL_TREE, NULL_TREE, 0); |
400fbf9f JW |
3995 | } |
3996 | \f | |
3997 | /* Convert value RHS to type TYPE as preparation for an assignment | |
3998 | to an lvalue of type TYPE. | |
3999 | The real work of conversion is done by `convert'. | |
4000 | The purpose of this function is to generate error messages | |
4001 | for assignments that are not allowed in C. | |
4002 | ERRTYPE is a string to use in error messages: | |
4003 | "assignment", "return", etc. If it is null, this is parameter passing | |
ab87f8c8 | 4004 | for a function call (and different error messages are output). |
400fbf9f JW |
4005 | |
4006 | FUNNAME is the name of the function being called, | |
4007 | as an IDENTIFIER_NODE, or null. | |
4008 | PARMNUM is the number of the argument, for printing in error messages. */ | |
4009 | ||
4010 | static tree | |
9b7267b8 | 4011 | convert_for_assignment (type, rhs, errtype, fundecl, funname, parmnum) |
400fbf9f | 4012 | tree type, rhs; |
5d5993dd | 4013 | const char *errtype; |
9b7267b8 | 4014 | tree fundecl, funname; |
400fbf9f JW |
4015 | int parmnum; |
4016 | { | |
b3694847 SS |
4017 | enum tree_code codel = TREE_CODE (type); |
4018 | tree rhstype; | |
4019 | enum tree_code coder; | |
400fbf9f JW |
4020 | |
4021 | /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */ | |
fc76e425 RS |
4022 | /* Do not use STRIP_NOPS here. We do not want an enumerator |
4023 | whose value is 0 to count as a null pointer constant. */ | |
400fbf9f JW |
4024 | if (TREE_CODE (rhs) == NON_LVALUE_EXPR) |
4025 | rhs = TREE_OPERAND (rhs, 0); | |
4026 | ||
4027 | if (TREE_CODE (TREE_TYPE (rhs)) == ARRAY_TYPE | |
4028 | || TREE_CODE (TREE_TYPE (rhs)) == FUNCTION_TYPE) | |
4029 | rhs = default_conversion (rhs); | |
8c3a6477 | 4030 | else if (optimize && TREE_CODE (rhs) == VAR_DECL) |
2f74f7e9 | 4031 | rhs = decl_constant_value_for_broken_optimization (rhs); |
400fbf9f JW |
4032 | |
4033 | rhstype = TREE_TYPE (rhs); | |
4034 | coder = TREE_CODE (rhstype); | |
4035 | ||
4036 | if (coder == ERROR_MARK) | |
4037 | return error_mark_node; | |
4038 | ||
4039 | if (TYPE_MAIN_VARIANT (type) == TYPE_MAIN_VARIANT (rhstype)) | |
e58cd767 RS |
4040 | { |
4041 | overflow_warning (rhs); | |
8b40563c TW |
4042 | /* Check for Objective-C protocols. This will issue a warning if |
4043 | there are protocol violations. No need to use the return value. */ | |
4044 | maybe_objc_comptypes (type, rhstype, 0); | |
e58cd767 RS |
4045 | return rhs; |
4046 | } | |
400fbf9f JW |
4047 | |
4048 | if (coder == VOID_TYPE) | |
4049 | { | |
4050 | error ("void value not ignored as it ought to be"); | |
4051 | return error_mark_node; | |
4052 | } | |
9f720c3e GK |
4053 | /* A type converts to a reference to it. |
4054 | This code doesn't fully support references, it's just for the | |
4055 | special case of va_start and va_copy. */ | |
4056 | if (codel == REFERENCE_TYPE | |
4057 | && comptypes (TREE_TYPE (type), TREE_TYPE (rhs)) == 1) | |
4058 | { | |
a1652cee JM |
4059 | if (!lvalue_p (rhs)) |
4060 | { | |
4061 | error ("cannot pass rvalue to reference parameter"); | |
4062 | return error_mark_node; | |
4063 | } | |
dffd7eb6 | 4064 | if (!c_mark_addressable (rhs)) |
9f720c3e GK |
4065 | return error_mark_node; |
4066 | rhs = build1 (ADDR_EXPR, build_pointer_type (TREE_TYPE (rhs)), rhs); | |
4067 | ||
4068 | /* We already know that these two types are compatible, but they | |
4069 | may not be exactly identical. In fact, `TREE_TYPE (type)' is | |
4070 | likely to be __builtin_va_list and `TREE_TYPE (rhs)' is | |
4071 | likely to be va_list, a typedef to __builtin_va_list, which | |
4072 | is different enough that it will cause problems later. */ | |
4073 | if (TREE_TYPE (TREE_TYPE (rhs)) != TREE_TYPE (type)) | |
4074 | rhs = build1 (NOP_EXPR, build_pointer_type (TREE_TYPE (type)), rhs); | |
4075 | ||
4076 | rhs = build1 (NOP_EXPR, type, rhs); | |
4077 | return rhs; | |
4078 | } | |
400fbf9f | 4079 | /* Arithmetic types all interconvert, and enum is treated like int. */ |
9f720c3e | 4080 | else if ((codel == INTEGER_TYPE || codel == REAL_TYPE |
19552aa5 JM |
4081 | || codel == ENUMERAL_TYPE || codel == COMPLEX_TYPE |
4082 | || codel == BOOLEAN_TYPE) | |
9f720c3e | 4083 | && (coder == INTEGER_TYPE || coder == REAL_TYPE |
19552aa5 JM |
4084 | || coder == ENUMERAL_TYPE || coder == COMPLEX_TYPE |
4085 | || coder == BOOLEAN_TYPE)) | |
da3c6115 | 4086 | return convert_and_check (type, rhs); |
61179109 | 4087 | |
7e842ef8 PE |
4088 | /* Conversion to a transparent union from its member types. |
4089 | This applies only to function arguments. */ | |
4090 | else if (codel == UNION_TYPE && TYPE_TRANSPARENT_UNION (type) && ! errtype) | |
4091 | { | |
4092 | tree memb_types; | |
4093 | tree marginal_memb_type = 0; | |
4094 | ||
4095 | for (memb_types = TYPE_FIELDS (type); memb_types; | |
4096 | memb_types = TREE_CHAIN (memb_types)) | |
4097 | { | |
4098 | tree memb_type = TREE_TYPE (memb_types); | |
4099 | ||
4100 | if (comptypes (TYPE_MAIN_VARIANT (memb_type), | |
4101 | TYPE_MAIN_VARIANT (rhstype))) | |
4102 | break; | |
4103 | ||
4104 | if (TREE_CODE (memb_type) != POINTER_TYPE) | |
4105 | continue; | |
4106 | ||
4107 | if (coder == POINTER_TYPE) | |
4108 | { | |
b3694847 SS |
4109 | tree ttl = TREE_TYPE (memb_type); |
4110 | tree ttr = TREE_TYPE (rhstype); | |
7e842ef8 PE |
4111 | |
4112 | /* Any non-function converts to a [const][volatile] void * | |
4113 | and vice versa; otherwise, targets must be the same. | |
4114 | Meanwhile, the lhs target must have all the qualifiers of | |
4115 | the rhs. */ | |
71653180 | 4116 | if (VOID_TYPE_P (ttl) || VOID_TYPE_P (ttr) |
7e842ef8 PE |
4117 | || comp_target_types (memb_type, rhstype)) |
4118 | { | |
4119 | /* If this type won't generate any warnings, use it. */ | |
3932261a MM |
4120 | if (TYPE_QUALS (ttl) == TYPE_QUALS (ttr) |
4121 | || ((TREE_CODE (ttr) == FUNCTION_TYPE | |
4122 | && TREE_CODE (ttl) == FUNCTION_TYPE) | |
4123 | ? ((TYPE_QUALS (ttl) | TYPE_QUALS (ttr)) | |
4124 | == TYPE_QUALS (ttr)) | |
b58c9a79 | 4125 | : ((TYPE_QUALS (ttl) | TYPE_QUALS (ttr)) |
3932261a | 4126 | == TYPE_QUALS (ttl)))) |
7e842ef8 PE |
4127 | break; |
4128 | ||
4129 | /* Keep looking for a better type, but remember this one. */ | |
4130 | if (! marginal_memb_type) | |
4131 | marginal_memb_type = memb_type; | |
4132 | } | |
4133 | } | |
4134 | ||
4135 | /* Can convert integer zero to any pointer type. */ | |
4136 | if (integer_zerop (rhs) | |
4137 | || (TREE_CODE (rhs) == NOP_EXPR | |
4138 | && integer_zerop (TREE_OPERAND (rhs, 0)))) | |
4139 | { | |
4140 | rhs = null_pointer_node; | |
4141 | break; | |
4142 | } | |
4143 | } | |
4144 | ||
4145 | if (memb_types || marginal_memb_type) | |
4146 | { | |
4147 | if (! memb_types) | |
4148 | { | |
4149 | /* We have only a marginally acceptable member type; | |
0f41302f | 4150 | it needs a warning. */ |
b3694847 SS |
4151 | tree ttl = TREE_TYPE (marginal_memb_type); |
4152 | tree ttr = TREE_TYPE (rhstype); | |
7e842ef8 PE |
4153 | |
4154 | /* Const and volatile mean something different for function | |
4155 | types, so the usual warnings are not appropriate. */ | |
4156 | if (TREE_CODE (ttr) == FUNCTION_TYPE | |
4157 | && TREE_CODE (ttl) == FUNCTION_TYPE) | |
4158 | { | |
4159 | /* Because const and volatile on functions are | |
4160 | restrictions that say the function will not do | |
4161 | certain things, it is okay to use a const or volatile | |
4162 | function where an ordinary one is wanted, but not | |
4163 | vice-versa. */ | |
3932261a MM |
4164 | if (TYPE_QUALS (ttl) & ~TYPE_QUALS (ttr)) |
4165 | warn_for_assignment ("%s makes qualified function pointer from unqualified", | |
ab87f8c8 | 4166 | errtype, funname, parmnum); |
7e842ef8 | 4167 | } |
3932261a MM |
4168 | else if (TYPE_QUALS (ttr) & ~TYPE_QUALS (ttl)) |
4169 | warn_for_assignment ("%s discards qualifiers from pointer target type", | |
ab87f8c8 | 4170 | errtype, funname, |
3932261a | 4171 | parmnum); |
7e842ef8 PE |
4172 | } |
4173 | ||
4174 | if (pedantic && ! DECL_IN_SYSTEM_HEADER (fundecl)) | |
89abf8d1 | 4175 | pedwarn ("ISO C prohibits argument conversion to union type"); |
7e842ef8 PE |
4176 | |
4177 | return build1 (NOP_EXPR, type, rhs); | |
4178 | } | |
4179 | } | |
4180 | ||
400fbf9f | 4181 | /* Conversions among pointers */ |
98d64f69 | 4182 | else if ((codel == POINTER_TYPE || codel == REFERENCE_TYPE) |
a1652cee | 4183 | && (coder == codel)) |
400fbf9f | 4184 | { |
b3694847 SS |
4185 | tree ttl = TREE_TYPE (type); |
4186 | tree ttr = TREE_TYPE (rhstype); | |
400fbf9f JW |
4187 | |
4188 | /* Any non-function converts to a [const][volatile] void * | |
4189 | and vice versa; otherwise, targets must be the same. | |
4190 | Meanwhile, the lhs target must have all the qualifiers of the rhs. */ | |
71653180 | 4191 | if (VOID_TYPE_P (ttl) || VOID_TYPE_P (ttr) |
790e9490 | 4192 | || comp_target_types (type, rhstype) |
ceef8ce4 NB |
4193 | || (c_common_unsigned_type (TYPE_MAIN_VARIANT (ttl)) |
4194 | == c_common_unsigned_type (TYPE_MAIN_VARIANT (ttr)))) | |
400fbf9f JW |
4195 | { |
4196 | if (pedantic | |
71653180 | 4197 | && ((VOID_TYPE_P (ttl) && TREE_CODE (ttr) == FUNCTION_TYPE) |
400fbf9f | 4198 | || |
71653180 | 4199 | (VOID_TYPE_P (ttr) |
fd5d5b94 RS |
4200 | /* Check TREE_CODE to catch cases like (void *) (char *) 0 |
4201 | which are not ANSI null ptr constants. */ | |
4202 | && (!integer_zerop (rhs) || TREE_CODE (rhs) == NOP_EXPR) | |
400fbf9f | 4203 | && TREE_CODE (ttl) == FUNCTION_TYPE))) |
89abf8d1 | 4204 | warn_for_assignment ("ISO C forbids %s between function pointer and `void *'", |
ab87f8c8 | 4205 | errtype, funname, parmnum); |
400fbf9f JW |
4206 | /* Const and volatile mean something different for function types, |
4207 | so the usual warnings are not appropriate. */ | |
4208 | else if (TREE_CODE (ttr) != FUNCTION_TYPE | |
caf2e8e4 | 4209 | && TREE_CODE (ttl) != FUNCTION_TYPE) |
400fbf9f | 4210 | { |
3932261a MM |
4211 | if (TYPE_QUALS (ttr) & ~TYPE_QUALS (ttl)) |
4212 | warn_for_assignment ("%s discards qualifiers from pointer target type", | |
ab87f8c8 | 4213 | errtype, funname, parmnum); |
790e9490 RS |
4214 | /* If this is not a case of ignoring a mismatch in signedness, |
4215 | no warning. */ | |
71653180 | 4216 | else if (VOID_TYPE_P (ttl) || VOID_TYPE_P (ttr) |
790e9490 RS |
4217 | || comp_target_types (type, rhstype)) |
4218 | ; | |
4219 | /* If there is a mismatch, do warn. */ | |
4220 | else if (pedantic) | |
4221 | warn_for_assignment ("pointer targets in %s differ in signedness", | |
ab87f8c8 | 4222 | errtype, funname, parmnum); |
400fbf9f | 4223 | } |
d949d5df RK |
4224 | else if (TREE_CODE (ttl) == FUNCTION_TYPE |
4225 | && TREE_CODE (ttr) == FUNCTION_TYPE) | |
400fbf9f JW |
4226 | { |
4227 | /* Because const and volatile on functions are restrictions | |
4228 | that say the function will not do certain things, | |
4229 | it is okay to use a const or volatile function | |
4230 | where an ordinary one is wanted, but not vice-versa. */ | |
3932261a MM |
4231 | if (TYPE_QUALS (ttl) & ~TYPE_QUALS (ttr)) |
4232 | warn_for_assignment ("%s makes qualified function pointer from unqualified", | |
ab87f8c8 | 4233 | errtype, funname, parmnum); |
400fbf9f JW |
4234 | } |
4235 | } | |
400fbf9f JW |
4236 | else |
4237 | warn_for_assignment ("%s from incompatible pointer type", | |
ab87f8c8 | 4238 | errtype, funname, parmnum); |
400fbf9f JW |
4239 | return convert (type, rhs); |
4240 | } | |
4241 | else if (codel == POINTER_TYPE && coder == INTEGER_TYPE) | |
4242 | { | |
2918ed3c | 4243 | /* An explicit constant 0 can convert to a pointer, |
f1a2b955 RS |
4244 | or one that results from arithmetic, even including |
4245 | a cast to integer type. */ | |
4246 | if (! (TREE_CODE (rhs) == INTEGER_CST && integer_zerop (rhs)) | |
4247 | && | |
4248 | ! (TREE_CODE (rhs) == NOP_EXPR | |
4249 | && TREE_CODE (TREE_TYPE (rhs)) == INTEGER_TYPE | |
4250 | && TREE_CODE (TREE_OPERAND (rhs, 0)) == INTEGER_CST | |
4251 | && integer_zerop (TREE_OPERAND (rhs, 0)))) | |
400fbf9f JW |
4252 | { |
4253 | warn_for_assignment ("%s makes pointer from integer without a cast", | |
ab87f8c8 | 4254 | errtype, funname, parmnum); |
400fbf9f JW |
4255 | return convert (type, rhs); |
4256 | } | |
4257 | return null_pointer_node; | |
4258 | } | |
4259 | else if (codel == INTEGER_TYPE && coder == POINTER_TYPE) | |
4260 | { | |
4261 | warn_for_assignment ("%s makes integer from pointer without a cast", | |
ab87f8c8 | 4262 | errtype, funname, parmnum); |
400fbf9f JW |
4263 | return convert (type, rhs); |
4264 | } | |
19552aa5 JM |
4265 | else if (codel == BOOLEAN_TYPE && coder == POINTER_TYPE) |
4266 | return convert (type, rhs); | |
400fbf9f JW |
4267 | |
4268 | if (!errtype) | |
4269 | { | |
4270 | if (funname) | |
8b40563c TW |
4271 | { |
4272 | tree selector = maybe_building_objc_message_expr (); | |
4273 | ||
4274 | if (selector && parmnum > 2) | |
4275 | error ("incompatible type for argument %d of `%s'", | |
4276 | parmnum - 2, IDENTIFIER_POINTER (selector)); | |
4277 | else | |
4278 | error ("incompatible type for argument %d of `%s'", | |
4279 | parmnum, IDENTIFIER_POINTER (funname)); | |
4280 | } | |
400fbf9f JW |
4281 | else |
4282 | error ("incompatible type for argument %d of indirect function call", | |
4283 | parmnum); | |
4284 | } | |
4285 | else | |
ab87f8c8 | 4286 | error ("incompatible types in %s", errtype); |
400fbf9f JW |
4287 | |
4288 | return error_mark_node; | |
4289 | } | |
4290 | ||
f735a153 JJ |
4291 | /* Convert VALUE for assignment into inlined parameter PARM. */ |
4292 | ||
4293 | tree | |
4294 | c_convert_parm_for_inlining (parm, value, fn) | |
4295 | tree parm, value, fn; | |
4296 | { | |
4297 | tree ret, type; | |
4298 | ||
4299 | /* If FN was prototyped, the value has been converted already | |
4300 | in convert_arguments. */ | |
4301 | if (! value || TYPE_ARG_TYPES (TREE_TYPE (fn))) | |
4302 | return value; | |
4303 | ||
4304 | type = TREE_TYPE (parm); | |
4305 | ret = convert_for_assignment (type, value, | |
4306 | (char *) 0 /* arg passing */, fn, | |
4307 | DECL_NAME (fn), 0); | |
4308 | if (PROMOTE_PROTOTYPES | |
4309 | && INTEGRAL_TYPE_P (type) | |
4310 | && (TYPE_PRECISION (type) < TYPE_PRECISION (integer_type_node))) | |
4311 | ret = default_conversion (ret); | |
4312 | return ret; | |
4313 | } | |
4314 | ||
ab87f8c8 | 4315 | /* Print a warning using MSGID. |
400fbf9f JW |
4316 | It gets OPNAME as its one parameter. |
4317 | If OPNAME is null, it is replaced by "passing arg ARGNUM of `FUNCTION'". | |
4318 | FUNCTION and ARGNUM are handled specially if we are building an | |
4319 | Objective-C selector. */ | |
4320 | ||
4321 | static void | |
ab87f8c8 | 4322 | warn_for_assignment (msgid, opname, function, argnum) |
5d5993dd KG |
4323 | const char *msgid; |
4324 | const char *opname; | |
400fbf9f JW |
4325 | tree function; |
4326 | int argnum; | |
4327 | { | |
400fbf9f JW |
4328 | if (opname == 0) |
4329 | { | |
4330 | tree selector = maybe_building_objc_message_expr (); | |
5d5993dd | 4331 | char * new_opname; |
400fbf9f JW |
4332 | |
4333 | if (selector && argnum > 2) | |
4334 | { | |
4335 | function = selector; | |
4336 | argnum -= 2; | |
4337 | } | |
4338 | if (function) | |
4339 | { | |
4340 | /* Function name is known; supply it. */ | |
27c38fbe | 4341 | const char *const argstring = _("passing arg %d of `%s'"); |
5d5993dd KG |
4342 | new_opname = (char *) alloca (IDENTIFIER_LENGTH (function) |
4343 | + strlen (argstring) + 1 + 25 | |
4344 | /*%d*/ + 1); | |
4345 | sprintf (new_opname, argstring, argnum, | |
4346 | IDENTIFIER_POINTER (function)); | |
400fbf9f JW |
4347 | } |
4348 | else | |
4349 | { | |
3ef42a0c | 4350 | /* Function name unknown (call through ptr); just give arg number. */ |
27c38fbe | 4351 | const char *const argnofun = _("passing arg %d of pointer to function"); |
5d5993dd KG |
4352 | new_opname = (char *) alloca (strlen (argnofun) + 1 + 25 /*%d*/ + 1); |
4353 | sprintf (new_opname, argnofun, argnum); | |
400fbf9f | 4354 | } |
5d5993dd | 4355 | opname = new_opname; |
400fbf9f | 4356 | } |
ab87f8c8 | 4357 | pedwarn (msgid, opname); |
400fbf9f JW |
4358 | } |
4359 | \f | |
d9fc6069 JW |
4360 | /* If VALUE is a compound expr all of whose expressions are constant, then |
4361 | return its value. Otherwise, return error_mark_node. | |
4362 | ||
4363 | This is for handling COMPOUND_EXPRs as initializer elements | |
4364 | which is allowed with a warning when -pedantic is specified. */ | |
4365 | ||
4366 | static tree | |
4367 | valid_compound_expr_initializer (value, endtype) | |
4368 | tree value; | |
4369 | tree endtype; | |
4370 | { | |
4371 | if (TREE_CODE (value) == COMPOUND_EXPR) | |
4372 | { | |
4373 | if (valid_compound_expr_initializer (TREE_OPERAND (value, 0), endtype) | |
4374 | == error_mark_node) | |
4375 | return error_mark_node; | |
4376 | return valid_compound_expr_initializer (TREE_OPERAND (value, 1), | |
4377 | endtype); | |
4378 | } | |
4379 | else if (! TREE_CONSTANT (value) | |
4380 | && ! initializer_constant_valid_p (value, endtype)) | |
4381 | return error_mark_node; | |
4382 | else | |
4383 | return value; | |
4384 | } | |
400fbf9f JW |
4385 | \f |
4386 | /* Perform appropriate conversions on the initial value of a variable, | |
4387 | store it in the declaration DECL, | |
4388 | and print any error messages that are appropriate. | |
4389 | If the init is invalid, store an ERROR_MARK. */ | |
4390 | ||
4391 | void | |
4392 | store_init_value (decl, init) | |
4393 | tree decl, init; | |
4394 | { | |
b3694847 | 4395 | tree value, type; |
400fbf9f JW |
4396 | |
4397 | /* If variable's type was invalidly declared, just ignore it. */ | |
4398 | ||
4399 | type = TREE_TYPE (decl); | |
4400 | if (TREE_CODE (type) == ERROR_MARK) | |
4401 | return; | |
4402 | ||
4403 | /* Digest the specified initializer into an expression. */ | |
4404 | ||
273cf2e4 | 4405 | value = digest_init (type, init, TREE_STATIC (decl)); |
400fbf9f JW |
4406 | |
4407 | /* Store the expression if valid; else report error. */ | |
4408 | ||
4409 | #if 0 | |
4410 | /* Note that this is the only place we can detect the error | |
4411 | in a case such as struct foo bar = (struct foo) { x, y }; | |
d45cf215 | 4412 | where there is one initial value which is a constructor expression. */ |
400fbf9f JW |
4413 | if (value == error_mark_node) |
4414 | ; | |
4415 | else if (TREE_STATIC (decl) && ! TREE_CONSTANT (value)) | |
4416 | { | |
4417 | error ("initializer for static variable is not constant"); | |
4418 | value = error_mark_node; | |
4419 | } | |
4420 | else if (TREE_STATIC (decl) | |
f0c70ef0 | 4421 | && initializer_constant_valid_p (value, TREE_TYPE (value)) == 0) |
400fbf9f JW |
4422 | { |
4423 | error ("initializer for static variable uses complicated arithmetic"); | |
4424 | value = error_mark_node; | |
4425 | } | |
4426 | else | |
4427 | { | |
4428 | if (pedantic && TREE_CODE (value) == CONSTRUCTOR) | |
4429 | { | |
4430 | if (! TREE_CONSTANT (value)) | |
4431 | pedwarn ("aggregate initializer is not constant"); | |
4432 | else if (! TREE_STATIC (value)) | |
4433 | pedwarn ("aggregate initializer uses complicated arithmetic"); | |
4434 | } | |
4435 | } | |
4436 | #endif | |
4437 | ||
cde6e684 | 4438 | if (warn_traditional && !in_system_header |
895ea614 KG |
4439 | && AGGREGATE_TYPE_P (TREE_TYPE (decl)) && ! TREE_STATIC (decl)) |
4440 | warning ("traditional C rejects automatic aggregate initialization"); | |
4441 | ||
10d5caec PE |
4442 | DECL_INITIAL (decl) = value; |
4443 | ||
26b3c423 | 4444 | /* ANSI wants warnings about out-of-range constant initializers. */ |
10d5caec | 4445 | STRIP_TYPE_NOPS (value); |
26b3c423 | 4446 | constant_expression_warning (value); |
ad47f1e5 JJ |
4447 | |
4448 | /* Check if we need to set array size from compound literal size. */ | |
4449 | if (TREE_CODE (type) == ARRAY_TYPE | |
4450 | && TYPE_DOMAIN (type) == 0 | |
4451 | && value != error_mark_node) | |
4452 | { | |
4453 | tree inside_init = init; | |
4454 | ||
4455 | if (TREE_CODE (init) == NON_LVALUE_EXPR) | |
4456 | inside_init = TREE_OPERAND (init, 0); | |
4457 | inside_init = fold (inside_init); | |
4458 | ||
4459 | if (TREE_CODE (inside_init) == COMPOUND_LITERAL_EXPR) | |
4460 | { | |
4461 | tree decl = COMPOUND_LITERAL_EXPR_DECL (inside_init); | |
4462 | ||
4463 | if (TYPE_DOMAIN (TREE_TYPE (decl))) | |
4464 | { | |
4465 | /* For int foo[] = (int [3]){1}; we need to set array size | |
4466 | now since later on array initializer will be just the | |
4467 | brace enclosed list of the compound literal. */ | |
4468 | TYPE_DOMAIN (type) = TYPE_DOMAIN (TREE_TYPE (decl)); | |
4469 | layout_type (type); | |
4470 | layout_decl (decl, 0); | |
4471 | } | |
4472 | } | |
4473 | } | |
400fbf9f JW |
4474 | } |
4475 | \f | |
075fc632 | 4476 | /* Methods for storing and printing names for error messages. */ |
d45cf215 RS |
4477 | |
4478 | /* Implement a spelling stack that allows components of a name to be pushed | |
4479 | and popped. Each element on the stack is this structure. */ | |
4480 | ||
4481 | struct spelling | |
4482 | { | |
4483 | int kind; | |
4484 | union | |
4485 | { | |
4486 | int i; | |
5d5993dd | 4487 | const char *s; |
d45cf215 RS |
4488 | } u; |
4489 | }; | |
4490 | ||
4491 | #define SPELLING_STRING 1 | |
4492 | #define SPELLING_MEMBER 2 | |
4493 | #define SPELLING_BOUNDS 3 | |
4494 | ||
4495 | static struct spelling *spelling; /* Next stack element (unused). */ | |
4496 | static struct spelling *spelling_base; /* Spelling stack base. */ | |
4497 | static int spelling_size; /* Size of the spelling stack. */ | |
4498 | ||
4499 | /* Macros to save and restore the spelling stack around push_... functions. | |
4500 | Alternative to SAVE_SPELLING_STACK. */ | |
4501 | ||
4502 | #define SPELLING_DEPTH() (spelling - spelling_base) | |
0f1e8126 | 4503 | #define RESTORE_SPELLING_DEPTH(DEPTH) (spelling = spelling_base + (DEPTH)) |
d45cf215 RS |
4504 | |
4505 | /* Save and restore the spelling stack around arbitrary C code. */ | |
4506 | ||
4507 | #define SAVE_SPELLING_DEPTH(code) \ | |
4508 | { \ | |
4509 | int __depth = SPELLING_DEPTH (); \ | |
4510 | code; \ | |
4511 | RESTORE_SPELLING_DEPTH (__depth); \ | |
4512 | } | |
4513 | ||
4514 | /* Push an element on the spelling stack with type KIND and assign VALUE | |
4515 | to MEMBER. */ | |
4516 | ||
4517 | #define PUSH_SPELLING(KIND, VALUE, MEMBER) \ | |
4518 | { \ | |
4519 | int depth = SPELLING_DEPTH (); \ | |
4520 | \ | |
4521 | if (depth >= spelling_size) \ | |
4522 | { \ | |
4523 | spelling_size += 10; \ | |
4524 | if (spelling_base == 0) \ | |
4525 | spelling_base \ | |
4526 | = (struct spelling *) xmalloc (spelling_size * sizeof (struct spelling)); \ | |
4527 | else \ | |
4528 | spelling_base \ | |
4529 | = (struct spelling *) xrealloc (spelling_base, \ | |
4530 | spelling_size * sizeof (struct spelling)); \ | |
4531 | RESTORE_SPELLING_DEPTH (depth); \ | |
4532 | } \ | |
4533 | \ | |
4534 | spelling->kind = (KIND); \ | |
4535 | spelling->MEMBER = (VALUE); \ | |
4536 | spelling++; \ | |
4537 | } | |
4538 | ||
4539 | /* Push STRING on the stack. Printed literally. */ | |
4540 | ||
4541 | static void | |
4542 | push_string (string) | |
5d5993dd | 4543 | const char *string; |
d45cf215 RS |
4544 | { |
4545 | PUSH_SPELLING (SPELLING_STRING, string, u.s); | |
4546 | } | |
4547 | ||
4548 | /* Push a member name on the stack. Printed as '.' STRING. */ | |
4549 | ||
4550 | static void | |
19d76e60 RK |
4551 | push_member_name (decl) |
4552 | tree decl; | |
4553 | ||
d45cf215 | 4554 | { |
83182544 | 4555 | const char *const string |
19d76e60 | 4556 | = DECL_NAME (decl) ? IDENTIFIER_POINTER (DECL_NAME (decl)) : "<anonymous>"; |
d45cf215 RS |
4557 | PUSH_SPELLING (SPELLING_MEMBER, string, u.s); |
4558 | } | |
4559 | ||
4560 | /* Push an array bounds on the stack. Printed as [BOUNDS]. */ | |
4561 | ||
4562 | static void | |
4563 | push_array_bounds (bounds) | |
4564 | int bounds; | |
4565 | { | |
4566 | PUSH_SPELLING (SPELLING_BOUNDS, bounds, u.i); | |
4567 | } | |
4568 | ||
4569 | /* Compute the maximum size in bytes of the printed spelling. */ | |
4570 | ||
4571 | static int | |
4572 | spelling_length () | |
4573 | { | |
b3694847 SS |
4574 | int size = 0; |
4575 | struct spelling *p; | |
d45cf215 RS |
4576 | |
4577 | for (p = spelling_base; p < spelling; p++) | |
4578 | { | |
4579 | if (p->kind == SPELLING_BOUNDS) | |
4580 | size += 25; | |
4581 | else | |
4582 | size += strlen (p->u.s) + 1; | |
4583 | } | |
4584 | ||
4585 | return size; | |
4586 | } | |
4587 | ||
4588 | /* Print the spelling to BUFFER and return it. */ | |
4589 | ||
4590 | static char * | |
4591 | print_spelling (buffer) | |
b3694847 | 4592 | char *buffer; |
d45cf215 | 4593 | { |
b3694847 SS |
4594 | char *d = buffer; |
4595 | struct spelling *p; | |
d45cf215 RS |
4596 | |
4597 | for (p = spelling_base; p < spelling; p++) | |
4598 | if (p->kind == SPELLING_BOUNDS) | |
4599 | { | |
4600 | sprintf (d, "[%d]", p->u.i); | |
4601 | d += strlen (d); | |
4602 | } | |
4603 | else | |
4604 | { | |
b3694847 | 4605 | const char *s; |
d45cf215 RS |
4606 | if (p->kind == SPELLING_MEMBER) |
4607 | *d++ = '.'; | |
1d300e19 | 4608 | for (s = p->u.s; (*d = *s++); d++) |
d45cf215 RS |
4609 | ; |
4610 | } | |
4611 | *d++ = '\0'; | |
4612 | return buffer; | |
4613 | } | |
4614 | ||
400fbf9f | 4615 | /* Issue an error message for a bad initializer component. |
ab87f8c8 JL |
4616 | MSGID identifies the message. |
4617 | The component name is taken from the spelling stack. */ | |
400fbf9f JW |
4618 | |
4619 | void | |
ab87f8c8 | 4620 | error_init (msgid) |
5d5993dd | 4621 | const char *msgid; |
400fbf9f | 4622 | { |
ab87f8c8 | 4623 | char *ofwhat; |
400fbf9f | 4624 | |
a094954e | 4625 | error ("%s", _(msgid)); |
ab87f8c8 | 4626 | ofwhat = print_spelling ((char *) alloca (spelling_length () + 1)); |
400fbf9f | 4627 | if (*ofwhat) |
ab87f8c8 | 4628 | error ("(near initialization for `%s')", ofwhat); |
400fbf9f JW |
4629 | } |
4630 | ||
4631 | /* Issue a pedantic warning for a bad initializer component. | |
ab87f8c8 JL |
4632 | MSGID identifies the message. |
4633 | The component name is taken from the spelling stack. */ | |
400fbf9f JW |
4634 | |
4635 | void | |
ab87f8c8 | 4636 | pedwarn_init (msgid) |
5d5993dd | 4637 | const char *msgid; |
400fbf9f | 4638 | { |
ab87f8c8 | 4639 | char *ofwhat; |
400fbf9f | 4640 | |
a094954e | 4641 | pedwarn ("%s", _(msgid)); |
ab87f8c8 | 4642 | ofwhat = print_spelling ((char *) alloca (spelling_length () + 1)); |
400fbf9f | 4643 | if (*ofwhat) |
ab87f8c8 | 4644 | pedwarn ("(near initialization for `%s')", ofwhat); |
400fbf9f | 4645 | } |
b71c7f8a RK |
4646 | |
4647 | /* Issue a warning for a bad initializer component. | |
ab87f8c8 JL |
4648 | MSGID identifies the message. |
4649 | The component name is taken from the spelling stack. */ | |
b71c7f8a RK |
4650 | |
4651 | static void | |
ab87f8c8 | 4652 | warning_init (msgid) |
5d5993dd | 4653 | const char *msgid; |
b71c7f8a | 4654 | { |
ab87f8c8 | 4655 | char *ofwhat; |
b71c7f8a | 4656 | |
a094954e | 4657 | warning ("%s", _(msgid)); |
ab87f8c8 | 4658 | ofwhat = print_spelling ((char *) alloca (spelling_length () + 1)); |
b71c7f8a | 4659 | if (*ofwhat) |
ab87f8c8 | 4660 | warning ("(near initialization for `%s')", ofwhat); |
b71c7f8a | 4661 | } |
400fbf9f JW |
4662 | \f |
4663 | /* Digest the parser output INIT as an initializer for type TYPE. | |
4664 | Return a C expression of type TYPE to represent the initial value. | |
4665 | ||
273cf2e4 ZW |
4666 | REQUIRE_CONSTANT requests an error if non-constant initializers or |
4667 | elements are seen. */ | |
400fbf9f | 4668 | |
b62acd60 | 4669 | static tree |
273cf2e4 | 4670 | digest_init (type, init, require_constant) |
790e9490 | 4671 | tree type, init; |
273cf2e4 | 4672 | int require_constant; |
400fbf9f JW |
4673 | { |
4674 | enum tree_code code = TREE_CODE (type); | |
047de90b | 4675 | tree inside_init = init; |
400fbf9f | 4676 | |
de9a3171 DA |
4677 | if (type == error_mark_node |
4678 | || init == error_mark_node | |
822baa84 | 4679 | || TREE_TYPE (init) == error_mark_node) |
21a427cc | 4680 | return error_mark_node; |
400fbf9f JW |
4681 | |
4682 | /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */ | |
fc76e425 RS |
4683 | /* Do not use STRIP_NOPS here. We do not want an enumerator |
4684 | whose value is 0 to count as a null pointer constant. */ | |
400fbf9f | 4685 | if (TREE_CODE (init) == NON_LVALUE_EXPR) |
047de90b | 4686 | inside_init = TREE_OPERAND (init, 0); |
400fbf9f | 4687 | |
b13aca19 AM |
4688 | inside_init = fold (inside_init); |
4689 | ||
400fbf9f JW |
4690 | /* Initialization of an array of chars from a string constant |
4691 | optionally enclosed in braces. */ | |
4692 | ||
4693 | if (code == ARRAY_TYPE) | |
4694 | { | |
4695 | tree typ1 = TYPE_MAIN_VARIANT (TREE_TYPE (type)); | |
4696 | if ((typ1 == char_type_node | |
4697 | || typ1 == signed_char_type_node | |
4698 | || typ1 == unsigned_char_type_node | |
4699 | || typ1 == unsigned_wchar_type_node | |
4700 | || typ1 == signed_wchar_type_node) | |
fd5d5b94 | 4701 | && ((inside_init && TREE_CODE (inside_init) == STRING_CST))) |
400fbf9f | 4702 | { |
4d65300e RS |
4703 | if (comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (inside_init)), |
4704 | TYPE_MAIN_VARIANT (type))) | |
fd5d5b94 | 4705 | return inside_init; |
d11fdb45 | 4706 | |
fd5d5b94 | 4707 | if ((TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (inside_init))) |
400fbf9f JW |
4708 | != char_type_node) |
4709 | && TYPE_PRECISION (typ1) == TYPE_PRECISION (char_type_node)) | |
4710 | { | |
ab87f8c8 | 4711 | error_init ("char-array initialized from wide string"); |
400fbf9f JW |
4712 | return error_mark_node; |
4713 | } | |
fd5d5b94 | 4714 | if ((TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (inside_init))) |
400fbf9f JW |
4715 | == char_type_node) |
4716 | && TYPE_PRECISION (typ1) != TYPE_PRECISION (char_type_node)) | |
4717 | { | |
ab87f8c8 | 4718 | error_init ("int-array initialized from non-wide string"); |
400fbf9f JW |
4719 | return error_mark_node; |
4720 | } | |
4721 | ||
fd5d5b94 | 4722 | TREE_TYPE (inside_init) = type; |
400fbf9f | 4723 | if (TYPE_DOMAIN (type) != 0 |
a63f73f8 | 4724 | && TYPE_SIZE (type) != 0 |
05bccae2 | 4725 | && TREE_CODE (TYPE_SIZE (type)) == INTEGER_CST |
fe9ef5d7 RS |
4726 | /* Subtract 1 (or sizeof (wchar_t)) |
4727 | because it's ok to ignore the terminating null char | |
400fbf9f | 4728 | that is counted in the length of the constant. */ |
05bccae2 RK |
4729 | && 0 > compare_tree_int (TYPE_SIZE_UNIT (type), |
4730 | TREE_STRING_LENGTH (inside_init) | |
4731 | - ((TYPE_PRECISION (typ1) | |
4732 | != TYPE_PRECISION (char_type_node)) | |
4733 | ? (TYPE_PRECISION (wchar_type_node) | |
4734 | / BITS_PER_UNIT) | |
4735 | : 1))) | |
4736 | pedwarn_init ("initializer-string for array of chars is too long"); | |
4737 | ||
fd5d5b94 | 4738 | return inside_init; |
400fbf9f JW |
4739 | } |
4740 | } | |
4741 | ||
de520661 RS |
4742 | /* Any type can be initialized |
4743 | from an expression of the same type, optionally with braces. */ | |
400fbf9f | 4744 | |
2726966d | 4745 | if (inside_init && TREE_TYPE (inside_init) != 0 |
5522c047 PB |
4746 | && (comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (inside_init)), |
4747 | TYPE_MAIN_VARIANT (type)) | |
2726966d | 4748 | || (code == ARRAY_TYPE |
3c3fa147 | 4749 | && comptypes (TREE_TYPE (inside_init), type)) |
e6834654 SS |
4750 | || (code == VECTOR_TYPE |
4751 | && comptypes (TREE_TYPE (inside_init), type)) | |
3c3fa147 | 4752 | || (code == POINTER_TYPE |
3c3fa147 RS |
4753 | && (TREE_CODE (TREE_TYPE (inside_init)) == ARRAY_TYPE |
4754 | || TREE_CODE (TREE_TYPE (inside_init)) == FUNCTION_TYPE) | |
4755 | && comptypes (TREE_TYPE (TREE_TYPE (inside_init)), | |
4756 | TREE_TYPE (type))))) | |
400fbf9f | 4757 | { |
207bf485 JM |
4758 | if (code == POINTER_TYPE) |
4759 | inside_init = default_function_array_conversion (inside_init); | |
59c83dbf JJ |
4760 | |
4761 | if (require_constant && !flag_isoc99 | |
4762 | && TREE_CODE (inside_init) == COMPOUND_LITERAL_EXPR) | |
4763 | { | |
4764 | /* As an extension, allow initializing objects with static storage | |
4765 | duration with compound literals (which are then treated just as | |
4766 | the brace enclosed list they contain). */ | |
4767 | tree decl = COMPOUND_LITERAL_EXPR_DECL (inside_init); | |
4768 | inside_init = DECL_INITIAL (decl); | |
4769 | } | |
4770 | ||
4771 | if (code == ARRAY_TYPE && TREE_CODE (inside_init) != STRING_CST | |
4772 | && TREE_CODE (inside_init) != CONSTRUCTOR) | |
400fbf9f | 4773 | { |
ab87f8c8 | 4774 | error_init ("array initialized from non-constant array expression"); |
400fbf9f JW |
4775 | return error_mark_node; |
4776 | } | |
4777 | ||
8c3a6477 | 4778 | if (optimize && TREE_CODE (inside_init) == VAR_DECL) |
2f74f7e9 | 4779 | inside_init = decl_constant_value_for_broken_optimization (inside_init); |
400fbf9f | 4780 | |
d9fc6069 JW |
4781 | /* Compound expressions can only occur here if -pedantic or |
4782 | -pedantic-errors is specified. In the later case, we always want | |
4783 | an error. In the former case, we simply want a warning. */ | |
4784 | if (require_constant && pedantic | |
4785 | && TREE_CODE (inside_init) == COMPOUND_EXPR) | |
4786 | { | |
4787 | inside_init | |
4788 | = valid_compound_expr_initializer (inside_init, | |
4789 | TREE_TYPE (inside_init)); | |
4790 | if (inside_init == error_mark_node) | |
ab87f8c8 | 4791 | error_init ("initializer element is not constant"); |
d9fc6069 | 4792 | else |
ab87f8c8 | 4793 | pedwarn_init ("initializer element is not constant"); |
d9fc6069 JW |
4794 | if (flag_pedantic_errors) |
4795 | inside_init = error_mark_node; | |
4796 | } | |
eb8543b3 MM |
4797 | else if (require_constant |
4798 | && (!TREE_CONSTANT (inside_init) | |
4799 | /* This test catches things like `7 / 0' which | |
4800 | result in an expression for which TREE_CONSTANT | |
4801 | is true, but which is not actually something | |
4802 | that is a legal constant. We really should not | |
4803 | be using this function, because it is a part of | |
4804 | the back-end. Instead, the expression should | |
4805 | already have been turned into ERROR_MARK_NODE. */ | |
4806 | || !initializer_constant_valid_p (inside_init, | |
4807 | TREE_TYPE (inside_init)))) | |
400fbf9f | 4808 | { |
ab87f8c8 | 4809 | error_init ("initializer element is not constant"); |
047de90b | 4810 | inside_init = error_mark_node; |
400fbf9f | 4811 | } |
400fbf9f | 4812 | |
047de90b | 4813 | return inside_init; |
400fbf9f JW |
4814 | } |
4815 | ||
400fbf9f JW |
4816 | /* Handle scalar types, including conversions. */ |
4817 | ||
4818 | if (code == INTEGER_TYPE || code == REAL_TYPE || code == POINTER_TYPE | |
47f8b473 | 4819 | || code == ENUMERAL_TYPE || code == BOOLEAN_TYPE || code == COMPLEX_TYPE) |
400fbf9f | 4820 | { |
e3a12f0c RS |
4821 | /* Note that convert_for_assignment calls default_conversion |
4822 | for arrays and functions. We must not call it in the | |
4823 | case where inside_init is a null pointer constant. */ | |
4824 | inside_init | |
ab87f8c8 | 4825 | = convert_for_assignment (type, init, _("initialization"), |
e3a12f0c | 4826 | NULL_TREE, NULL_TREE, 0); |
400fbf9f | 4827 | |
047de90b | 4828 | if (require_constant && ! TREE_CONSTANT (inside_init)) |
400fbf9f | 4829 | { |
ab87f8c8 | 4830 | error_init ("initializer element is not constant"); |
047de90b | 4831 | inside_init = error_mark_node; |
400fbf9f | 4832 | } |
f0c70ef0 RS |
4833 | else if (require_constant |
4834 | && initializer_constant_valid_p (inside_init, TREE_TYPE (inside_init)) == 0) | |
400fbf9f | 4835 | { |
ab87f8c8 | 4836 | error_init ("initializer element is not computable at load time"); |
047de90b | 4837 | inside_init = error_mark_node; |
400fbf9f JW |
4838 | } |
4839 | ||
047de90b | 4840 | return inside_init; |
400fbf9f JW |
4841 | } |
4842 | ||
4843 | /* Come here only for records and arrays. */ | |
4844 | ||
d0f062fb | 4845 | if (COMPLETE_TYPE_P (type) && TREE_CODE (TYPE_SIZE (type)) != INTEGER_CST) |
400fbf9f | 4846 | { |
ab87f8c8 | 4847 | error_init ("variable-sized object may not be initialized"); |
400fbf9f JW |
4848 | return error_mark_node; |
4849 | } | |
4850 | ||
ab87f8c8 | 4851 | error_init ("invalid initializer"); |
400fbf9f JW |
4852 | return error_mark_node; |
4853 | } | |
4854 | \f | |
de520661 | 4855 | /* Handle initializers that use braces. */ |
400fbf9f | 4856 | |
de520661 RS |
4857 | /* Type of object we are accumulating a constructor for. |
4858 | This type is always a RECORD_TYPE, UNION_TYPE or ARRAY_TYPE. */ | |
4859 | static tree constructor_type; | |
400fbf9f | 4860 | |
de520661 RS |
4861 | /* For a RECORD_TYPE or UNION_TYPE, this is the chain of fields |
4862 | left to fill. */ | |
4863 | static tree constructor_fields; | |
400fbf9f | 4864 | |
de520661 | 4865 | /* For an ARRAY_TYPE, this is the specified index |
665f2503 | 4866 | at which to store the next element we get. */ |
de520661 | 4867 | static tree constructor_index; |
400fbf9f | 4868 | |
de520661 RS |
4869 | /* For an ARRAY_TYPE, this is the maximum index. */ |
4870 | static tree constructor_max_index; | |
103b7b17 | 4871 | |
de520661 RS |
4872 | /* For a RECORD_TYPE, this is the first field not yet written out. */ |
4873 | static tree constructor_unfilled_fields; | |
400fbf9f | 4874 | |
de520661 | 4875 | /* For an ARRAY_TYPE, this is the index of the first element |
665f2503 | 4876 | not yet written out. */ |
de520661 RS |
4877 | static tree constructor_unfilled_index; |
4878 | ||
b62acd60 | 4879 | /* In a RECORD_TYPE, the byte index of the next consecutive field. |
665f2503 | 4880 | This is so we can generate gaps between fields, when appropriate. */ |
b62acd60 RS |
4881 | static tree constructor_bit_index; |
4882 | ||
de520661 RS |
4883 | /* If we are saving up the elements rather than allocating them, |
4884 | this is the list of elements so far (in reverse order, | |
4885 | most recent first). */ | |
4886 | static tree constructor_elements; | |
4887 | ||
8b6a5902 JJ |
4888 | /* 1 if constructor should be incrementally stored into a constructor chain, |
4889 | 0 if all the elements should be kept in AVL tree. */ | |
4890 | static int constructor_incremental; | |
4891 | ||
de520661 RS |
4892 | /* 1 if so far this constructor's elements are all compile-time constants. */ |
4893 | static int constructor_constant; | |
4894 | ||
4895 | /* 1 if so far this constructor's elements are all valid address constants. */ | |
4896 | static int constructor_simple; | |
4897 | ||
4898 | /* 1 if this constructor is erroneous so far. */ | |
4899 | static int constructor_erroneous; | |
4900 | ||
4901 | /* 1 if have called defer_addressed_constants. */ | |
4902 | static int constructor_subconstants_deferred; | |
4903 | ||
e5e809f4 JL |
4904 | /* Structure for managing pending initializer elements, organized as an |
4905 | AVL tree. */ | |
4906 | ||
4907 | struct init_node | |
4908 | { | |
4909 | struct init_node *left, *right; | |
4910 | struct init_node *parent; | |
4911 | int balance; | |
4912 | tree purpose; | |
4913 | tree value; | |
4914 | }; | |
4915 | ||
4916 | /* Tree of pending elements at this constructor level. | |
de520661 RS |
4917 | These are elements encountered out of order |
4918 | which belong at places we haven't reached yet in actually | |
4dd7201e ZW |
4919 | writing the output. |
4920 | Will never hold tree nodes across GC runs. */ | |
e5e809f4 | 4921 | static struct init_node *constructor_pending_elts; |
de520661 RS |
4922 | |
4923 | /* The SPELLING_DEPTH of this constructor. */ | |
4924 | static int constructor_depth; | |
4925 | ||
cc77d4d5 | 4926 | /* 0 if implicitly pushing constructor levels is allowed. */ |
0f41302f | 4927 | int constructor_no_implicit = 0; /* 0 for C; 1 for some other languages. */ |
cc77d4d5 | 4928 | |
de520661 RS |
4929 | static int require_constant_value; |
4930 | static int require_constant_elements; | |
4931 | ||
de520661 RS |
4932 | /* DECL node for which an initializer is being read. |
4933 | 0 means we are reading a constructor expression | |
4934 | such as (struct foo) {...}. */ | |
4935 | static tree constructor_decl; | |
4936 | ||
4937 | /* start_init saves the ASMSPEC arg here for really_start_incremental_init. */ | |
520a57c8 | 4938 | static const char *constructor_asmspec; |
de520661 RS |
4939 | |
4940 | /* Nonzero if this is an initializer for a top-level decl. */ | |
4941 | static int constructor_top_level; | |
4942 | ||
b621a4dd ZW |
4943 | /* Nonzero if there were any member designators in this initializer. */ |
4944 | static int constructor_designated; | |
4945 | ||
8b6a5902 JJ |
4946 | /* Nesting depth of designator list. */ |
4947 | static int designator_depth; | |
4948 | ||
4949 | /* Nonzero if there were diagnosed errors in this designator list. */ | |
4950 | static int designator_errorneous; | |
4951 | ||
b62acd60 RS |
4952 | \f |
4953 | /* This stack has a level for each implicit or explicit level of | |
4954 | structuring in the initializer, including the outermost one. It | |
4955 | saves the values of most of the variables above. */ | |
de520661 | 4956 | |
940ff66d JJ |
4957 | struct constructor_range_stack; |
4958 | ||
de520661 | 4959 | struct constructor_stack |
400fbf9f | 4960 | { |
de520661 RS |
4961 | struct constructor_stack *next; |
4962 | tree type; | |
4963 | tree fields; | |
4964 | tree index; | |
de520661 RS |
4965 | tree max_index; |
4966 | tree unfilled_index; | |
4967 | tree unfilled_fields; | |
b62acd60 | 4968 | tree bit_index; |
de520661 | 4969 | tree elements; |
e5e809f4 | 4970 | struct init_node *pending_elts; |
940ff66d | 4971 | int offset; |
de520661 | 4972 | int depth; |
790e9490 RS |
4973 | /* If nonzero, this value should replace the entire |
4974 | constructor at this level. */ | |
4975 | tree replacement_value; | |
940ff66d | 4976 | struct constructor_range_stack *range_stack; |
de520661 RS |
4977 | char constant; |
4978 | char simple; | |
4979 | char implicit; | |
de520661 RS |
4980 | char erroneous; |
4981 | char outer; | |
8b6a5902 | 4982 | char incremental; |
b621a4dd | 4983 | char designated; |
de520661 | 4984 | }; |
d45cf215 | 4985 | |
de520661 | 4986 | struct constructor_stack *constructor_stack; |
400fbf9f | 4987 | |
8b6a5902 JJ |
4988 | /* This stack represents designators from some range designator up to |
4989 | the last designator in the list. */ | |
4990 | ||
4991 | struct constructor_range_stack | |
4992 | { | |
4993 | struct constructor_range_stack *next, *prev; | |
4994 | struct constructor_stack *stack; | |
4995 | tree range_start; | |
4996 | tree index; | |
4997 | tree range_end; | |
4998 | tree fields; | |
4999 | }; | |
5000 | ||
5001 | struct constructor_range_stack *constructor_range_stack; | |
5002 | ||
de520661 RS |
5003 | /* This stack records separate initializers that are nested. |
5004 | Nested initializers can't happen in ANSI C, but GNU C allows them | |
5005 | in cases like { ... (struct foo) { ... } ... }. */ | |
400fbf9f | 5006 | |
de520661 RS |
5007 | struct initializer_stack |
5008 | { | |
5009 | struct initializer_stack *next; | |
5010 | tree decl; | |
520a57c8 | 5011 | const char *asmspec; |
de520661 | 5012 | struct constructor_stack *constructor_stack; |
8b6a5902 | 5013 | struct constructor_range_stack *constructor_range_stack; |
dea273df | 5014 | tree elements; |
de520661 RS |
5015 | struct spelling *spelling; |
5016 | struct spelling *spelling_base; | |
5017 | int spelling_size; | |
5018 | char top_level; | |
de520661 RS |
5019 | char require_constant_value; |
5020 | char require_constant_elements; | |
5021 | char deferred; | |
5022 | }; | |
5023 | ||
5024 | struct initializer_stack *initializer_stack; | |
5025 | \f | |
5026 | /* Prepare to parse and output the initializer for variable DECL. */ | |
5027 | ||
5028 | void | |
e28cae4f | 5029 | start_init (decl, asmspec_tree, top_level) |
de520661 | 5030 | tree decl; |
e28cae4f | 5031 | tree asmspec_tree; |
de520661 RS |
5032 | int top_level; |
5033 | { | |
5d5993dd | 5034 | const char *locus; |
de520661 RS |
5035 | struct initializer_stack *p |
5036 | = (struct initializer_stack *) xmalloc (sizeof (struct initializer_stack)); | |
520a57c8 | 5037 | const char *asmspec = 0; |
e28cae4f RS |
5038 | |
5039 | if (asmspec_tree) | |
5040 | asmspec = TREE_STRING_POINTER (asmspec_tree); | |
de520661 RS |
5041 | |
5042 | p->decl = constructor_decl; | |
5043 | p->asmspec = constructor_asmspec; | |
de520661 RS |
5044 | p->require_constant_value = require_constant_value; |
5045 | p->require_constant_elements = require_constant_elements; | |
5046 | p->constructor_stack = constructor_stack; | |
8b6a5902 | 5047 | p->constructor_range_stack = constructor_range_stack; |
dea273df | 5048 | p->elements = constructor_elements; |
de520661 RS |
5049 | p->spelling = spelling; |
5050 | p->spelling_base = spelling_base; | |
5051 | p->spelling_size = spelling_size; | |
5052 | p->deferred = constructor_subconstants_deferred; | |
5053 | p->top_level = constructor_top_level; | |
b62acd60 | 5054 | p->next = initializer_stack; |
de520661 RS |
5055 | initializer_stack = p; |
5056 | ||
5057 | constructor_decl = decl; | |
de520661 RS |
5058 | constructor_asmspec = asmspec; |
5059 | constructor_subconstants_deferred = 0; | |
b621a4dd | 5060 | constructor_designated = 0; |
de520661 RS |
5061 | constructor_top_level = top_level; |
5062 | ||
5063 | if (decl != 0) | |
3c3fa147 | 5064 | { |
de520661 | 5065 | require_constant_value = TREE_STATIC (decl); |
f1a2b955 | 5066 | require_constant_elements |
8b6a5902 | 5067 | = ((TREE_STATIC (decl) || (pedantic && !flag_isoc99)) |
f1a2b955 RS |
5068 | /* For a scalar, you can always use any value to initialize, |
5069 | even within braces. */ | |
5070 | && (TREE_CODE (TREE_TYPE (decl)) == ARRAY_TYPE | |
5071 | || TREE_CODE (TREE_TYPE (decl)) == RECORD_TYPE | |
5072 | || TREE_CODE (TREE_TYPE (decl)) == UNION_TYPE | |
5073 | || TREE_CODE (TREE_TYPE (decl)) == QUAL_UNION_TYPE)); | |
de520661 | 5074 | locus = IDENTIFIER_POINTER (DECL_NAME (decl)); |
3c3fa147 | 5075 | } |
400fbf9f | 5076 | else |
de520661 RS |
5077 | { |
5078 | require_constant_value = 0; | |
5079 | require_constant_elements = 0; | |
5080 | locus = "(anonymous)"; | |
5081 | } | |
400fbf9f | 5082 | |
de520661 | 5083 | constructor_stack = 0; |
8b6a5902 | 5084 | constructor_range_stack = 0; |
400fbf9f | 5085 | |
b71c7f8a RK |
5086 | missing_braces_mentioned = 0; |
5087 | ||
de520661 RS |
5088 | spelling_base = 0; |
5089 | spelling_size = 0; | |
5090 | RESTORE_SPELLING_DEPTH (0); | |
d45cf215 | 5091 | |
de520661 RS |
5092 | if (locus) |
5093 | push_string (locus); | |
5094 | } | |
400fbf9f | 5095 | |
de520661 RS |
5096 | void |
5097 | finish_init () | |
5098 | { | |
5099 | struct initializer_stack *p = initializer_stack; | |
400fbf9f | 5100 | |
de520661 RS |
5101 | /* Output subconstants (string constants, usually) |
5102 | that were referenced within this initializer and saved up. | |
5103 | Must do this if and only if we called defer_addressed_constants. */ | |
5104 | if (constructor_subconstants_deferred) | |
5105 | output_deferred_addressed_constants (); | |
4f77a31b | 5106 | |
de520661 RS |
5107 | /* Free the whole constructor stack of this initializer. */ |
5108 | while (constructor_stack) | |
5109 | { | |
5110 | struct constructor_stack *q = constructor_stack; | |
5111 | constructor_stack = q->next; | |
5112 | free (q); | |
5113 | } | |
400fbf9f | 5114 | |
8b6a5902 JJ |
5115 | if (constructor_range_stack) |
5116 | abort (); | |
5117 | ||
de520661 RS |
5118 | /* Pop back to the data of the outer initializer (if any). */ |
5119 | constructor_decl = p->decl; | |
5120 | constructor_asmspec = p->asmspec; | |
de520661 RS |
5121 | require_constant_value = p->require_constant_value; |
5122 | require_constant_elements = p->require_constant_elements; | |
5123 | constructor_stack = p->constructor_stack; | |
8b6a5902 | 5124 | constructor_range_stack = p->constructor_range_stack; |
dea273df | 5125 | constructor_elements = p->elements; |
de520661 RS |
5126 | spelling = p->spelling; |
5127 | spelling_base = p->spelling_base; | |
5128 | spelling_size = p->spelling_size; | |
5129 | constructor_subconstants_deferred = p->deferred; | |
5130 | constructor_top_level = p->top_level; | |
5131 | initializer_stack = p->next; | |
5132 | free (p); | |
5133 | } | |
5134 | \f | |
5135 | /* Call here when we see the initializer is surrounded by braces. | |
5136 | This is instead of a call to push_init_level; | |
5137 | it is matched by a call to pop_init_level. | |
400fbf9f | 5138 | |
de520661 RS |
5139 | TYPE is the type to initialize, for a constructor expression. |
5140 | For an initializer for a decl, TYPE is zero. */ | |
5a7ec9d9 | 5141 | |
de520661 RS |
5142 | void |
5143 | really_start_incremental_init (type) | |
5144 | tree type; | |
5145 | { | |
5146 | struct constructor_stack *p | |
5147 | = (struct constructor_stack *) xmalloc (sizeof (struct constructor_stack)); | |
5148 | ||
5149 | if (type == 0) | |
5150 | type = TREE_TYPE (constructor_decl); | |
5151 | ||
de520661 RS |
5152 | p->type = constructor_type; |
5153 | p->fields = constructor_fields; | |
5154 | p->index = constructor_index; | |
de520661 RS |
5155 | p->max_index = constructor_max_index; |
5156 | p->unfilled_index = constructor_unfilled_index; | |
5157 | p->unfilled_fields = constructor_unfilled_fields; | |
b62acd60 | 5158 | p->bit_index = constructor_bit_index; |
5cb7368c | 5159 | p->elements = constructor_elements; |
de520661 RS |
5160 | p->constant = constructor_constant; |
5161 | p->simple = constructor_simple; | |
5162 | p->erroneous = constructor_erroneous; | |
5163 | p->pending_elts = constructor_pending_elts; | |
5164 | p->depth = constructor_depth; | |
790e9490 | 5165 | p->replacement_value = 0; |
de520661 | 5166 | p->implicit = 0; |
940ff66d | 5167 | p->range_stack = 0; |
de520661 | 5168 | p->outer = 0; |
8b6a5902 | 5169 | p->incremental = constructor_incremental; |
b621a4dd | 5170 | p->designated = constructor_designated; |
de520661 RS |
5171 | p->next = 0; |
5172 | constructor_stack = p; | |
5173 | ||
5174 | constructor_constant = 1; | |
5175 | constructor_simple = 1; | |
5176 | constructor_depth = SPELLING_DEPTH (); | |
5177 | constructor_elements = 0; | |
5178 | constructor_pending_elts = 0; | |
5179 | constructor_type = type; | |
8b6a5902 | 5180 | constructor_incremental = 1; |
b621a4dd | 5181 | constructor_designated = 0; |
8b6a5902 JJ |
5182 | designator_depth = 0; |
5183 | designator_errorneous = 0; | |
de520661 RS |
5184 | |
5185 | if (TREE_CODE (constructor_type) == RECORD_TYPE | |
5186 | || TREE_CODE (constructor_type) == UNION_TYPE) | |
5187 | { | |
5188 | constructor_fields = TYPE_FIELDS (constructor_type); | |
abc95ed3 | 5189 | /* Skip any nameless bit fields at the beginning. */ |
ef86d2a6 | 5190 | while (constructor_fields != 0 && DECL_C_BIT_FIELD (constructor_fields) |
fc623854 RS |
5191 | && DECL_NAME (constructor_fields) == 0) |
5192 | constructor_fields = TREE_CHAIN (constructor_fields); | |
665f2503 | 5193 | |
de520661 | 5194 | constructor_unfilled_fields = constructor_fields; |
770ae6cc | 5195 | constructor_bit_index = bitsize_zero_node; |
de520661 RS |
5196 | } |
5197 | else if (TREE_CODE (constructor_type) == ARRAY_TYPE) | |
5198 | { | |
de520661 | 5199 | if (TYPE_DOMAIN (constructor_type)) |
2bede729 PB |
5200 | { |
5201 | constructor_max_index | |
5202 | = TYPE_MAX_VALUE (TYPE_DOMAIN (constructor_type)); | |
ffc5c6a9 RH |
5203 | |
5204 | /* Detect non-empty initializations of zero-length arrays. */ | |
e7b6a0ee DD |
5205 | if (constructor_max_index == NULL_TREE |
5206 | && TYPE_SIZE (constructor_type)) | |
ffc5c6a9 RH |
5207 | constructor_max_index = build_int_2 (-1, -1); |
5208 | ||
39bc99c2 JM |
5209 | /* constructor_max_index needs to be an INTEGER_CST. Attempts |
5210 | to initialize VLAs will cause an proper error; avoid tree | |
5211 | checking errors as well by setting a safe value. */ | |
5212 | if (constructor_max_index | |
5213 | && TREE_CODE (constructor_max_index) != INTEGER_CST) | |
5214 | constructor_max_index = build_int_2 (-1, -1); | |
5215 | ||
2bede729 | 5216 | constructor_index |
665f2503 RK |
5217 | = convert (bitsizetype, |
5218 | TYPE_MIN_VALUE (TYPE_DOMAIN (constructor_type))); | |
2bede729 PB |
5219 | } |
5220 | else | |
770ae6cc | 5221 | constructor_index = bitsize_zero_node; |
fed3cef0 | 5222 | |
665f2503 | 5223 | constructor_unfilled_index = constructor_index; |
de520661 | 5224 | } |
e6834654 SS |
5225 | else if (TREE_CODE (constructor_type) == VECTOR_TYPE) |
5226 | { | |
5227 | /* Vectors are like simple fixed-size arrays. */ | |
5228 | constructor_max_index = | |
5229 | build_int_2 (TYPE_VECTOR_SUBPARTS (constructor_type) - 1, 0); | |
b7997284 | 5230 | constructor_index = convert (bitsizetype, bitsize_zero_node); |
e6834654 SS |
5231 | constructor_unfilled_index = constructor_index; |
5232 | } | |
de520661 RS |
5233 | else |
5234 | { | |
5235 | /* Handle the case of int x = {5}; */ | |
5236 | constructor_fields = constructor_type; | |
5237 | constructor_unfilled_fields = constructor_type; | |
5238 | } | |
de520661 RS |
5239 | } |
5240 | \f | |
5241 | /* Push down into a subobject, for initialization. | |
5242 | If this is for an explicit set of braces, IMPLICIT is 0. | |
5243 | If it is because the next element belongs at a lower level, | |
8b6a5902 | 5244 | IMPLICIT is 1 (or 2 if the push is because of designator list). */ |
400fbf9f | 5245 | |
de520661 RS |
5246 | void |
5247 | push_init_level (implicit) | |
5248 | int implicit; | |
5249 | { | |
94ba5069 | 5250 | struct constructor_stack *p; |
8b6a5902 | 5251 | tree value = NULL_TREE; |
94ba5069 RS |
5252 | |
5253 | /* If we've exhausted any levels that didn't have braces, | |
5254 | pop them now. */ | |
5255 | while (constructor_stack->implicit) | |
5256 | { | |
5257 | if ((TREE_CODE (constructor_type) == RECORD_TYPE | |
5258 | || TREE_CODE (constructor_type) == UNION_TYPE) | |
5259 | && constructor_fields == 0) | |
5260 | process_init_element (pop_init_level (1)); | |
5261 | else if (TREE_CODE (constructor_type) == ARRAY_TYPE | |
5262 | && tree_int_cst_lt (constructor_max_index, constructor_index)) | |
5263 | process_init_element (pop_init_level (1)); | |
5264 | else | |
5265 | break; | |
5266 | } | |
5267 | ||
8b6a5902 JJ |
5268 | /* Unless this is an explicit brace, we need to preserve previous |
5269 | content if any. */ | |
5270 | if (implicit) | |
5271 | { | |
5272 | if ((TREE_CODE (constructor_type) == RECORD_TYPE | |
5273 | || TREE_CODE (constructor_type) == UNION_TYPE) | |
5274 | && constructor_fields) | |
5275 | value = find_init_member (constructor_fields); | |
5276 | else if (TREE_CODE (constructor_type) == ARRAY_TYPE) | |
5277 | value = find_init_member (constructor_index); | |
5278 | } | |
5279 | ||
94ba5069 | 5280 | p = (struct constructor_stack *) xmalloc (sizeof (struct constructor_stack)); |
de520661 RS |
5281 | p->type = constructor_type; |
5282 | p->fields = constructor_fields; | |
5283 | p->index = constructor_index; | |
de520661 RS |
5284 | p->max_index = constructor_max_index; |
5285 | p->unfilled_index = constructor_unfilled_index; | |
5286 | p->unfilled_fields = constructor_unfilled_fields; | |
b62acd60 | 5287 | p->bit_index = constructor_bit_index; |
de520661 RS |
5288 | p->elements = constructor_elements; |
5289 | p->constant = constructor_constant; | |
5290 | p->simple = constructor_simple; | |
5291 | p->erroneous = constructor_erroneous; | |
5292 | p->pending_elts = constructor_pending_elts; | |
5293 | p->depth = constructor_depth; | |
790e9490 | 5294 | p->replacement_value = 0; |
de520661 | 5295 | p->implicit = implicit; |
de520661 | 5296 | p->outer = 0; |
8b6a5902 | 5297 | p->incremental = constructor_incremental; |
b621a4dd | 5298 | p->designated = constructor_designated; |
de520661 | 5299 | p->next = constructor_stack; |
940ff66d | 5300 | p->range_stack = 0; |
de520661 RS |
5301 | constructor_stack = p; |
5302 | ||
5303 | constructor_constant = 1; | |
5304 | constructor_simple = 1; | |
5305 | constructor_depth = SPELLING_DEPTH (); | |
5306 | constructor_elements = 0; | |
8b6a5902 | 5307 | constructor_incremental = 1; |
b621a4dd | 5308 | constructor_designated = 0; |
de520661 | 5309 | constructor_pending_elts = 0; |
8b6a5902 JJ |
5310 | if (!implicit) |
5311 | { | |
940ff66d JJ |
5312 | p->range_stack = constructor_range_stack; |
5313 | constructor_range_stack = 0; | |
8b6a5902 JJ |
5314 | designator_depth = 0; |
5315 | designator_errorneous = 0; | |
5316 | } | |
de520661 | 5317 | |
94ba5069 RS |
5318 | /* Don't die if an entire brace-pair level is superfluous |
5319 | in the containing level. */ | |
5320 | if (constructor_type == 0) | |
5321 | ; | |
5322 | else if (TREE_CODE (constructor_type) == RECORD_TYPE | |
5323 | || TREE_CODE (constructor_type) == UNION_TYPE) | |
de520661 | 5324 | { |
91fa3c30 RS |
5325 | /* Don't die if there are extra init elts at the end. */ |
5326 | if (constructor_fields == 0) | |
5327 | constructor_type = 0; | |
5328 | else | |
5329 | { | |
5330 | constructor_type = TREE_TYPE (constructor_fields); | |
19d76e60 | 5331 | push_member_name (constructor_fields); |
e4376e63 | 5332 | constructor_depth++; |
91fa3c30 | 5333 | } |
de520661 RS |
5334 | } |
5335 | else if (TREE_CODE (constructor_type) == ARRAY_TYPE) | |
5336 | { | |
5337 | constructor_type = TREE_TYPE (constructor_type); | |
665f2503 | 5338 | push_array_bounds (tree_low_cst (constructor_index, 0)); |
e4376e63 | 5339 | constructor_depth++; |
de520661 | 5340 | } |
400fbf9f | 5341 | |
91fa3c30 RS |
5342 | if (constructor_type == 0) |
5343 | { | |
ab87f8c8 | 5344 | error_init ("extra brace group at end of initializer"); |
91fa3c30 RS |
5345 | constructor_fields = 0; |
5346 | constructor_unfilled_fields = 0; | |
b71c7f8a | 5347 | return; |
91fa3c30 | 5348 | } |
b71c7f8a | 5349 | |
8b6a5902 JJ |
5350 | if (value && TREE_CODE (value) == CONSTRUCTOR) |
5351 | { | |
5352 | constructor_constant = TREE_CONSTANT (value); | |
5353 | constructor_simple = TREE_STATIC (value); | |
5354 | constructor_elements = TREE_OPERAND (value, 1); | |
5355 | if (constructor_elements | |
5356 | && (TREE_CODE (constructor_type) == RECORD_TYPE | |
5357 | || TREE_CODE (constructor_type) == ARRAY_TYPE)) | |
5358 | set_nonincremental_init (); | |
5359 | } | |
5360 | ||
5361 | if (implicit == 1 && warn_missing_braces && !missing_braces_mentioned) | |
b71c7f8a RK |
5362 | { |
5363 | missing_braces_mentioned = 1; | |
ab87f8c8 | 5364 | warning_init ("missing braces around initializer"); |
b71c7f8a RK |
5365 | } |
5366 | ||
5367 | if (TREE_CODE (constructor_type) == RECORD_TYPE | |
91fa3c30 | 5368 | || TREE_CODE (constructor_type) == UNION_TYPE) |
de520661 RS |
5369 | { |
5370 | constructor_fields = TYPE_FIELDS (constructor_type); | |
abc95ed3 | 5371 | /* Skip any nameless bit fields at the beginning. */ |
ef86d2a6 | 5372 | while (constructor_fields != 0 && DECL_C_BIT_FIELD (constructor_fields) |
fc623854 RS |
5373 | && DECL_NAME (constructor_fields) == 0) |
5374 | constructor_fields = TREE_CHAIN (constructor_fields); | |
665f2503 | 5375 | |
de520661 | 5376 | constructor_unfilled_fields = constructor_fields; |
770ae6cc | 5377 | constructor_bit_index = bitsize_zero_node; |
de520661 | 5378 | } |
6786d201 AH |
5379 | else if (TREE_CODE (constructor_type) == VECTOR_TYPE) |
5380 | { | |
5381 | /* Vectors are like simple fixed-size arrays. */ | |
5382 | constructor_max_index = | |
5383 | build_int_2 (TYPE_VECTOR_SUBPARTS (constructor_type) - 1, 0); | |
5384 | constructor_index = convert (bitsizetype, integer_zero_node); | |
5385 | constructor_unfilled_index = constructor_index; | |
5386 | } | |
de520661 RS |
5387 | else if (TREE_CODE (constructor_type) == ARRAY_TYPE) |
5388 | { | |
de520661 | 5389 | if (TYPE_DOMAIN (constructor_type)) |
2bede729 PB |
5390 | { |
5391 | constructor_max_index | |
5392 | = TYPE_MAX_VALUE (TYPE_DOMAIN (constructor_type)); | |
e7b6a0ee DD |
5393 | |
5394 | /* Detect non-empty initializations of zero-length arrays. */ | |
5395 | if (constructor_max_index == NULL_TREE | |
5396 | && TYPE_SIZE (constructor_type)) | |
5397 | constructor_max_index = build_int_2 (-1, -1); | |
39bc99c2 JM |
5398 | |
5399 | /* constructor_max_index needs to be an INTEGER_CST. Attempts | |
5400 | to initialize VLAs will cause an proper error; avoid tree | |
5401 | checking errors as well by setting a safe value. */ | |
5402 | if (constructor_max_index | |
5403 | && TREE_CODE (constructor_max_index) != INTEGER_CST) | |
5404 | constructor_max_index = build_int_2 (-1, -1); | |
e7b6a0ee | 5405 | |
2bede729 | 5406 | constructor_index |
665f2503 | 5407 | = convert (bitsizetype, |
584ef5fe | 5408 | TYPE_MIN_VALUE (TYPE_DOMAIN (constructor_type))); |
2bede729 PB |
5409 | } |
5410 | else | |
770ae6cc | 5411 | constructor_index = bitsize_zero_node; |
fed3cef0 | 5412 | |
665f2503 | 5413 | constructor_unfilled_index = constructor_index; |
8b6a5902 JJ |
5414 | if (value && TREE_CODE (value) == STRING_CST) |
5415 | { | |
5416 | /* We need to split the char/wchar array into individual | |
5417 | characters, so that we don't have to special case it | |
5418 | everywhere. */ | |
5419 | set_nonincremental_init_from_string (value); | |
5420 | } | |
de520661 RS |
5421 | } |
5422 | else | |
5423 | { | |
ab87f8c8 | 5424 | warning_init ("braces around scalar initializer"); |
de520661 RS |
5425 | constructor_fields = constructor_type; |
5426 | constructor_unfilled_fields = constructor_type; | |
5427 | } | |
5428 | } | |
400fbf9f | 5429 | |
de520661 RS |
5430 | /* At the end of an implicit or explicit brace level, |
5431 | finish up that level of constructor. | |
5432 | If we were outputting the elements as they are read, return 0 | |
5433 | from inner levels (process_init_element ignores that), | |
5434 | but return error_mark_node from the outermost level | |
5435 | (that's what we want to put in DECL_INITIAL). | |
5436 | Otherwise, return a CONSTRUCTOR expression. */ | |
5437 | ||
5438 | tree | |
5439 | pop_init_level (implicit) | |
5440 | int implicit; | |
5441 | { | |
5442 | struct constructor_stack *p; | |
de520661 RS |
5443 | tree constructor = 0; |
5444 | ||
5445 | if (implicit == 0) | |
400fbf9f | 5446 | { |
de520661 RS |
5447 | /* When we come to an explicit close brace, |
5448 | pop any inner levels that didn't have explicit braces. */ | |
5449 | while (constructor_stack->implicit) | |
5450 | process_init_element (pop_init_level (1)); | |
940ff66d JJ |
5451 | |
5452 | if (constructor_range_stack) | |
5453 | abort (); | |
de520661 | 5454 | } |
400fbf9f | 5455 | |
de520661 | 5456 | p = constructor_stack; |
91fa3c30 | 5457 | |
584ef5fe RH |
5458 | /* Error for initializing a flexible array member, or a zero-length |
5459 | array member in an inappropriate context. */ | |
ffc5c6a9 | 5460 | if (constructor_type && constructor_fields |
584ef5fe RH |
5461 | && TREE_CODE (constructor_type) == ARRAY_TYPE |
5462 | && TYPE_DOMAIN (constructor_type) | |
5463 | && ! TYPE_MAX_VALUE (TYPE_DOMAIN (constructor_type))) | |
5464 | { | |
ffc5c6a9 RH |
5465 | /* Silently discard empty initializations. The parser will |
5466 | already have pedwarned for empty brackets. */ | |
5467 | if (integer_zerop (constructor_unfilled_index)) | |
5468 | constructor_type = NULL_TREE; | |
5469 | else if (! TYPE_SIZE (constructor_type)) | |
5470 | { | |
5471 | if (constructor_depth > 2) | |
5472 | error_init ("initialization of flexible array member in a nested context"); | |
5473 | else if (pedantic) | |
5474 | pedwarn_init ("initialization of a flexible array member"); | |
5475 | ||
ff7cc307 | 5476 | /* We have already issued an error message for the existence |
ffc5c6a9 RH |
5477 | of a flexible array member not at the end of the structure. |
5478 | Discard the initializer so that we do not abort later. */ | |
5479 | if (TREE_CHAIN (constructor_fields) != NULL_TREE) | |
5480 | constructor_type = NULL_TREE; | |
5481 | } | |
5482 | else | |
e7b6a0ee DD |
5483 | /* Zero-length arrays are no longer special, so we should no longer |
5484 | get here. */ | |
505ddab6 | 5485 | abort (); |
584ef5fe RH |
5486 | } |
5487 | ||
9dfcc8db BH |
5488 | /* Warn when some struct elements are implicitly initialized to zero. */ |
5489 | if (extra_warnings | |
5490 | && constructor_type | |
5491 | && TREE_CODE (constructor_type) == RECORD_TYPE | |
5492 | && constructor_unfilled_fields) | |
5493 | { | |
8b6a5902 JJ |
5494 | /* Do not warn for flexible array members or zero-length arrays. */ |
5495 | while (constructor_unfilled_fields | |
5496 | && (! DECL_SIZE (constructor_unfilled_fields) | |
5497 | || integer_zerop (DECL_SIZE (constructor_unfilled_fields)))) | |
5498 | constructor_unfilled_fields = TREE_CHAIN (constructor_unfilled_fields); | |
ffc5c6a9 | 5499 | |
b621a4dd ZW |
5500 | /* Do not warn if this level of the initializer uses member |
5501 | designators; it is likely to be deliberate. */ | |
5502 | if (constructor_unfilled_fields && !constructor_designated) | |
8b6a5902 JJ |
5503 | { |
5504 | push_member_name (constructor_unfilled_fields); | |
5505 | warning_init ("missing initializer"); | |
5506 | RESTORE_SPELLING_DEPTH (constructor_depth); | |
5507 | } | |
9dfcc8db BH |
5508 | } |
5509 | ||
de520661 | 5510 | /* Now output all pending elements. */ |
8b6a5902 | 5511 | constructor_incremental = 1; |
de520661 RS |
5512 | output_pending_init_elements (1); |
5513 | ||
5514 | /* Pad out the end of the structure. */ | |
790e9490 | 5515 | if (p->replacement_value) |
229a2e65 MM |
5516 | /* If this closes a superfluous brace pair, |
5517 | just pass out the element between them. */ | |
5518 | constructor = p->replacement_value; | |
91fa3c30 RS |
5519 | else if (constructor_type == 0) |
5520 | ; | |
19d76e60 RK |
5521 | else if (TREE_CODE (constructor_type) != RECORD_TYPE |
5522 | && TREE_CODE (constructor_type) != UNION_TYPE | |
e6834654 SS |
5523 | && TREE_CODE (constructor_type) != ARRAY_TYPE |
5524 | && TREE_CODE (constructor_type) != VECTOR_TYPE) | |
19d76e60 RK |
5525 | { |
5526 | /* A nonincremental scalar initializer--just return | |
5527 | the element, after verifying there is just one. */ | |
5528 | if (constructor_elements == 0) | |
5529 | { | |
8b6a5902 JJ |
5530 | if (!constructor_erroneous) |
5531 | error_init ("empty scalar initializer"); | |
19d76e60 RK |
5532 | constructor = error_mark_node; |
5533 | } | |
5534 | else if (TREE_CHAIN (constructor_elements) != 0) | |
5535 | { | |
ab87f8c8 | 5536 | error_init ("extra elements in scalar initializer"); |
19d76e60 RK |
5537 | constructor = TREE_VALUE (constructor_elements); |
5538 | } | |
5539 | else | |
5540 | constructor = TREE_VALUE (constructor_elements); | |
5541 | } | |
229a2e65 | 5542 | else |
de520661 RS |
5543 | { |
5544 | if (constructor_erroneous) | |
5545 | constructor = error_mark_node; | |
5546 | else | |
400fbf9f | 5547 | { |
de520661 RS |
5548 | constructor = build (CONSTRUCTOR, constructor_type, NULL_TREE, |
5549 | nreverse (constructor_elements)); | |
5550 | if (constructor_constant) | |
5551 | TREE_CONSTANT (constructor) = 1; | |
5552 | if (constructor_constant && constructor_simple) | |
5553 | TREE_STATIC (constructor) = 1; | |
de520661 RS |
5554 | } |
5555 | } | |
de520661 | 5556 | |
de520661 RS |
5557 | constructor_type = p->type; |
5558 | constructor_fields = p->fields; | |
5559 | constructor_index = p->index; | |
de520661 RS |
5560 | constructor_max_index = p->max_index; |
5561 | constructor_unfilled_index = p->unfilled_index; | |
5562 | constructor_unfilled_fields = p->unfilled_fields; | |
b62acd60 | 5563 | constructor_bit_index = p->bit_index; |
de520661 RS |
5564 | constructor_elements = p->elements; |
5565 | constructor_constant = p->constant; | |
5566 | constructor_simple = p->simple; | |
5567 | constructor_erroneous = p->erroneous; | |
8b6a5902 | 5568 | constructor_incremental = p->incremental; |
b621a4dd | 5569 | constructor_designated = p->designated; |
de520661 RS |
5570 | constructor_pending_elts = p->pending_elts; |
5571 | constructor_depth = p->depth; | |
940ff66d JJ |
5572 | if (!p->implicit) |
5573 | constructor_range_stack = p->range_stack; | |
de520661 RS |
5574 | RESTORE_SPELLING_DEPTH (constructor_depth); |
5575 | ||
5576 | constructor_stack = p->next; | |
5577 | free (p); | |
5578 | ||
5579 | if (constructor == 0) | |
5580 | { | |
5581 | if (constructor_stack == 0) | |
5582 | return error_mark_node; | |
5583 | return NULL_TREE; | |
5584 | } | |
5585 | return constructor; | |
5586 | } | |
5587 | ||
8b6a5902 JJ |
5588 | /* Common handling for both array range and field name designators. |
5589 | ARRAY argument is non-zero for array ranges. Returns zero for success. */ | |
5590 | ||
5591 | static int | |
5592 | set_designator (array) | |
5593 | int array; | |
5594 | { | |
5595 | tree subtype; | |
5596 | enum tree_code subcode; | |
5597 | ||
5598 | /* Don't die if an entire brace-pair level is superfluous | |
5599 | in the containing level. */ | |
5600 | if (constructor_type == 0) | |
5601 | return 1; | |
5602 | ||
5603 | /* If there were errors in this designator list already, bail out silently. */ | |
5604 | if (designator_errorneous) | |
5605 | return 1; | |
5606 | ||
5607 | if (!designator_depth) | |
5608 | { | |
5609 | if (constructor_range_stack) | |
5610 | abort (); | |
5611 | ||
5612 | /* Designator list starts at the level of closest explicit | |
5613 | braces. */ | |
5614 | while (constructor_stack->implicit) | |
5615 | process_init_element (pop_init_level (1)); | |
b621a4dd | 5616 | constructor_designated = 1; |
8b6a5902 JJ |
5617 | return 0; |
5618 | } | |
5619 | ||
5620 | if (constructor_no_implicit) | |
5621 | { | |
5622 | error_init ("initialization designators may not nest"); | |
5623 | return 1; | |
5624 | } | |
5625 | ||
5626 | if (TREE_CODE (constructor_type) == RECORD_TYPE | |
5627 | || TREE_CODE (constructor_type) == UNION_TYPE) | |
5628 | { | |
5629 | subtype = TREE_TYPE (constructor_fields); | |
5630 | if (subtype != error_mark_node) | |
5631 | subtype = TYPE_MAIN_VARIANT (subtype); | |
5632 | } | |
5633 | else if (TREE_CODE (constructor_type) == ARRAY_TYPE) | |
5634 | { | |
5635 | subtype = TYPE_MAIN_VARIANT (TREE_TYPE (constructor_type)); | |
5636 | } | |
5637 | else | |
5638 | abort (); | |
5639 | ||
5640 | subcode = TREE_CODE (subtype); | |
5641 | if (array && subcode != ARRAY_TYPE) | |
5642 | { | |
5643 | error_init ("array index in non-array initializer"); | |
5644 | return 1; | |
5645 | } | |
5646 | else if (!array && subcode != RECORD_TYPE && subcode != UNION_TYPE) | |
5647 | { | |
5648 | error_init ("field name not in record or union initializer"); | |
5649 | return 1; | |
5650 | } | |
5651 | ||
b621a4dd | 5652 | constructor_designated = 1; |
8b6a5902 JJ |
5653 | push_init_level (2); |
5654 | return 0; | |
5655 | } | |
5656 | ||
5657 | /* If there are range designators in designator list, push a new designator | |
5658 | to constructor_range_stack. RANGE_END is end of such stack range or | |
5659 | NULL_TREE if there is no range designator at this level. */ | |
5660 | ||
5661 | static void | |
5662 | push_range_stack (range_end) | |
5663 | tree range_end; | |
5664 | { | |
5665 | struct constructor_range_stack *p; | |
5666 | ||
5667 | p = (struct constructor_range_stack *) | |
5668 | ggc_alloc (sizeof (struct constructor_range_stack)); | |
5669 | p->prev = constructor_range_stack; | |
5670 | p->next = 0; | |
5671 | p->fields = constructor_fields; | |
5672 | p->range_start = constructor_index; | |
5673 | p->index = constructor_index; | |
5674 | p->stack = constructor_stack; | |
5675 | p->range_end = range_end; | |
5676 | if (constructor_range_stack) | |
5677 | constructor_range_stack->next = p; | |
5678 | constructor_range_stack = p; | |
5679 | } | |
5680 | ||
de520661 RS |
5681 | /* Within an array initializer, specify the next index to be initialized. |
5682 | FIRST is that index. If LAST is nonzero, then initialize a range | |
5683 | of indices, running from FIRST through LAST. */ | |
5684 | ||
5685 | void | |
5686 | set_init_index (first, last) | |
5687 | tree first, last; | |
5688 | { | |
8b6a5902 JJ |
5689 | if (set_designator (1)) |
5690 | return; | |
5691 | ||
5692 | designator_errorneous = 1; | |
5693 | ||
19d76e60 RK |
5694 | while ((TREE_CODE (first) == NOP_EXPR |
5695 | || TREE_CODE (first) == CONVERT_EXPR | |
5696 | || TREE_CODE (first) == NON_LVALUE_EXPR) | |
5697 | && (TYPE_MODE (TREE_TYPE (first)) | |
5698 | == TYPE_MODE (TREE_TYPE (TREE_OPERAND (first, 0))))) | |
665f2503 RK |
5699 | first = TREE_OPERAND (first, 0); |
5700 | ||
19d76e60 RK |
5701 | if (last) |
5702 | while ((TREE_CODE (last) == NOP_EXPR | |
5703 | || TREE_CODE (last) == CONVERT_EXPR | |
5704 | || TREE_CODE (last) == NON_LVALUE_EXPR) | |
5705 | && (TYPE_MODE (TREE_TYPE (last)) | |
5706 | == TYPE_MODE (TREE_TYPE (TREE_OPERAND (last, 0))))) | |
665f2503 | 5707 | last = TREE_OPERAND (last, 0); |
19d76e60 | 5708 | |
94ba5069 | 5709 | if (TREE_CODE (first) != INTEGER_CST) |
ab87f8c8 | 5710 | error_init ("nonconstant array index in initializer"); |
94ba5069 | 5711 | else if (last != 0 && TREE_CODE (last) != INTEGER_CST) |
ab87f8c8 | 5712 | error_init ("nonconstant array index in initializer"); |
8b6a5902 | 5713 | else if (TREE_CODE (constructor_type) != ARRAY_TYPE) |
ab87f8c8 | 5714 | error_init ("array index in non-array initializer"); |
8b6a5902 JJ |
5715 | else if (constructor_max_index |
5716 | && tree_int_cst_lt (constructor_max_index, first)) | |
5717 | error_init ("array index in initializer exceeds array bounds"); | |
de520661 RS |
5718 | else |
5719 | { | |
665f2503 | 5720 | constructor_index = convert (bitsizetype, first); |
de520661 | 5721 | |
ce662d4c | 5722 | if (last) |
8b6a5902 | 5723 | { |
ce662d4c JJ |
5724 | if (tree_int_cst_equal (first, last)) |
5725 | last = 0; | |
5726 | else if (tree_int_cst_lt (last, first)) | |
8b6a5902 | 5727 | { |
ce662d4c | 5728 | error_init ("empty index range in initializer"); |
8b6a5902 JJ |
5729 | last = 0; |
5730 | } | |
ce662d4c JJ |
5731 | else |
5732 | { | |
5733 | last = convert (bitsizetype, last); | |
5734 | if (constructor_max_index != 0 | |
5735 | && tree_int_cst_lt (constructor_max_index, last)) | |
5736 | { | |
5737 | error_init ("array index range in initializer exceeds array bounds"); | |
5738 | last = 0; | |
5739 | } | |
5740 | } | |
8b6a5902 | 5741 | } |
ce662d4c | 5742 | |
8b6a5902 JJ |
5743 | designator_depth++; |
5744 | designator_errorneous = 0; | |
5745 | if (constructor_range_stack || last) | |
5746 | push_range_stack (last); | |
de520661 RS |
5747 | } |
5748 | } | |
5749 | ||
5750 | /* Within a struct initializer, specify the next field to be initialized. */ | |
5751 | ||
94ba5069 | 5752 | void |
de520661 RS |
5753 | set_init_label (fieldname) |
5754 | tree fieldname; | |
5755 | { | |
5756 | tree tail; | |
de520661 | 5757 | |
8b6a5902 | 5758 | if (set_designator (0)) |
e5cfb88f RK |
5759 | return; |
5760 | ||
8b6a5902 JJ |
5761 | designator_errorneous = 1; |
5762 | ||
5763 | if (TREE_CODE (constructor_type) != RECORD_TYPE | |
5764 | && TREE_CODE (constructor_type) != UNION_TYPE) | |
5765 | { | |
5766 | error_init ("field name not in record or union initializer"); | |
5767 | return; | |
5768 | } | |
5769 | ||
de520661 RS |
5770 | for (tail = TYPE_FIELDS (constructor_type); tail; |
5771 | tail = TREE_CHAIN (tail)) | |
5772 | { | |
de520661 RS |
5773 | if (DECL_NAME (tail) == fieldname) |
5774 | break; | |
5775 | } | |
5776 | ||
5777 | if (tail == 0) | |
5778 | error ("unknown field `%s' specified in initializer", | |
5779 | IDENTIFIER_POINTER (fieldname)); | |
de520661 | 5780 | else |
8b6a5902 JJ |
5781 | { |
5782 | constructor_fields = tail; | |
5783 | designator_depth++; | |
5784 | designator_errorneous = 0; | |
5785 | if (constructor_range_stack) | |
5786 | push_range_stack (NULL_TREE); | |
5787 | } | |
de520661 RS |
5788 | } |
5789 | \f | |
e5e809f4 | 5790 | /* Add a new initializer to the tree of pending initializers. PURPOSE |
684d9f3b | 5791 | identifies the initializer, either array index or field in a structure. |
e5e809f4 JL |
5792 | VALUE is the value of that index or field. */ |
5793 | ||
5794 | static void | |
5795 | add_pending_init (purpose, value) | |
5796 | tree purpose, value; | |
5797 | { | |
5798 | struct init_node *p, **q, *r; | |
5799 | ||
5800 | q = &constructor_pending_elts; | |
5801 | p = 0; | |
5802 | ||
5803 | if (TREE_CODE (constructor_type) == ARRAY_TYPE) | |
5804 | { | |
5805 | while (*q != 0) | |
5806 | { | |
5807 | p = *q; | |
5808 | if (tree_int_cst_lt (purpose, p->purpose)) | |
5809 | q = &p->left; | |
8b6a5902 | 5810 | else if (tree_int_cst_lt (p->purpose, purpose)) |
e5e809f4 JL |
5811 | q = &p->right; |
5812 | else | |
8b6a5902 JJ |
5813 | { |
5814 | if (TREE_SIDE_EFFECTS (p->value)) | |
5815 | warning_init ("initialized field with side-effects overwritten"); | |
5816 | p->value = value; | |
5817 | return; | |
5818 | } | |
e5e809f4 JL |
5819 | } |
5820 | } | |
5821 | else | |
5822 | { | |
8b6a5902 JJ |
5823 | tree bitpos; |
5824 | ||
5825 | bitpos = bit_position (purpose); | |
e5e809f4 JL |
5826 | while (*q != NULL) |
5827 | { | |
5828 | p = *q; | |
8b6a5902 | 5829 | if (tree_int_cst_lt (bitpos, bit_position (p->purpose))) |
e5e809f4 | 5830 | q = &p->left; |
83b091c7 | 5831 | else if (p->purpose != purpose) |
e5e809f4 JL |
5832 | q = &p->right; |
5833 | else | |
8b6a5902 JJ |
5834 | { |
5835 | if (TREE_SIDE_EFFECTS (p->value)) | |
5836 | warning_init ("initialized field with side-effects overwritten"); | |
5837 | p->value = value; | |
5838 | return; | |
5839 | } | |
e5e809f4 JL |
5840 | } |
5841 | } | |
5842 | ||
f8a83ee3 | 5843 | r = (struct init_node *) ggc_alloc (sizeof (struct init_node)); |
e5e809f4 JL |
5844 | r->purpose = purpose; |
5845 | r->value = value; | |
5846 | ||
5847 | *q = r; | |
5848 | r->parent = p; | |
5849 | r->left = 0; | |
5850 | r->right = 0; | |
5851 | r->balance = 0; | |
5852 | ||
5853 | while (p) | |
5854 | { | |
5855 | struct init_node *s; | |
5856 | ||
5857 | if (r == p->left) | |
5858 | { | |
5859 | if (p->balance == 0) | |
5860 | p->balance = -1; | |
5861 | else if (p->balance < 0) | |
5862 | { | |
5863 | if (r->balance < 0) | |
5864 | { | |
ec5c56db | 5865 | /* L rotation. */ |
e5e809f4 JL |
5866 | p->left = r->right; |
5867 | if (p->left) | |
5868 | p->left->parent = p; | |
5869 | r->right = p; | |
5870 | ||
5871 | p->balance = 0; | |
5872 | r->balance = 0; | |
5873 | ||
5874 | s = p->parent; | |
5875 | p->parent = r; | |
5876 | r->parent = s; | |
5877 | if (s) | |
5878 | { | |
5879 | if (s->left == p) | |
5880 | s->left = r; | |
5881 | else | |
5882 | s->right = r; | |
5883 | } | |
5884 | else | |
5885 | constructor_pending_elts = r; | |
5886 | } | |
5887 | else | |
5888 | { | |
ec5c56db | 5889 | /* LR rotation. */ |
e5e809f4 JL |
5890 | struct init_node *t = r->right; |
5891 | ||
5892 | r->right = t->left; | |
5893 | if (r->right) | |
5894 | r->right->parent = r; | |
5895 | t->left = r; | |
5896 | ||
5897 | p->left = t->right; | |
5898 | if (p->left) | |
5899 | p->left->parent = p; | |
5900 | t->right = p; | |
5901 | ||
5902 | p->balance = t->balance < 0; | |
5903 | r->balance = -(t->balance > 0); | |
5904 | t->balance = 0; | |
5905 | ||
5906 | s = p->parent; | |
5907 | p->parent = t; | |
5908 | r->parent = t; | |
5909 | t->parent = s; | |
5910 | if (s) | |
5911 | { | |
5912 | if (s->left == p) | |
5913 | s->left = t; | |
5914 | else | |
5915 | s->right = t; | |
5916 | } | |
5917 | else | |
5918 | constructor_pending_elts = t; | |
5919 | } | |
5920 | break; | |
5921 | } | |
5922 | else | |
5923 | { | |
5924 | /* p->balance == +1; growth of left side balances the node. */ | |
5925 | p->balance = 0; | |
5926 | break; | |
5927 | } | |
5928 | } | |
5929 | else /* r == p->right */ | |
5930 | { | |
5931 | if (p->balance == 0) | |
5932 | /* Growth propagation from right side. */ | |
5933 | p->balance++; | |
5934 | else if (p->balance > 0) | |
5935 | { | |
5936 | if (r->balance > 0) | |
5937 | { | |
ec5c56db | 5938 | /* R rotation. */ |
e5e809f4 JL |
5939 | p->right = r->left; |
5940 | if (p->right) | |
5941 | p->right->parent = p; | |
5942 | r->left = p; | |
5943 | ||
5944 | p->balance = 0; | |
5945 | r->balance = 0; | |
5946 | ||
5947 | s = p->parent; | |
5948 | p->parent = r; | |
5949 | r->parent = s; | |
5950 | if (s) | |
5951 | { | |
5952 | if (s->left == p) | |
5953 | s->left = r; | |
5954 | else | |
5955 | s->right = r; | |
5956 | } | |
5957 | else | |
5958 | constructor_pending_elts = r; | |
5959 | } | |
5960 | else /* r->balance == -1 */ | |
5961 | { | |
5962 | /* RL rotation */ | |
5963 | struct init_node *t = r->left; | |
5964 | ||
5965 | r->left = t->right; | |
5966 | if (r->left) | |
5967 | r->left->parent = r; | |
5968 | t->right = r; | |
5969 | ||
5970 | p->right = t->left; | |
5971 | if (p->right) | |
5972 | p->right->parent = p; | |
5973 | t->left = p; | |
5974 | ||
5975 | r->balance = (t->balance < 0); | |
5976 | p->balance = -(t->balance > 0); | |
5977 | t->balance = 0; | |
5978 | ||
5979 | s = p->parent; | |
5980 | p->parent = t; | |
5981 | r->parent = t; | |
5982 | t->parent = s; | |
5983 | if (s) | |
5984 | { | |
5985 | if (s->left == p) | |
5986 | s->left = t; | |
5987 | else | |
5988 | s->right = t; | |
5989 | } | |
5990 | else | |
5991 | constructor_pending_elts = t; | |
5992 | } | |
5993 | break; | |
5994 | } | |
5995 | else | |
5996 | { | |
ec5c56db | 5997 | /* p->balance == -1; growth of right side balances the node. */ |
e5e809f4 JL |
5998 | p->balance = 0; |
5999 | break; | |
6000 | } | |
6001 | } | |
6002 | ||
6003 | r = p; | |
6004 | p = p->parent; | |
6005 | } | |
6006 | } | |
6007 | ||
8b6a5902 | 6008 | /* Build AVL tree from a sorted chain. */ |
e5e809f4 | 6009 | |
8b6a5902 JJ |
6010 | static void |
6011 | set_nonincremental_init () | |
6012 | { | |
6013 | tree chain; | |
6014 | ||
6015 | if (TREE_CODE (constructor_type) != RECORD_TYPE | |
6016 | && TREE_CODE (constructor_type) != ARRAY_TYPE) | |
6017 | return; | |
6018 | ||
6019 | for (chain = constructor_elements; chain; chain = TREE_CHAIN (chain)) | |
6020 | add_pending_init (TREE_PURPOSE (chain), TREE_VALUE (chain)); | |
6021 | constructor_elements = 0; | |
6022 | if (TREE_CODE (constructor_type) == RECORD_TYPE) | |
6023 | { | |
6024 | constructor_unfilled_fields = TYPE_FIELDS (constructor_type); | |
6025 | /* Skip any nameless bit fields at the beginning. */ | |
6026 | while (constructor_unfilled_fields != 0 | |
6027 | && DECL_C_BIT_FIELD (constructor_unfilled_fields) | |
6028 | && DECL_NAME (constructor_unfilled_fields) == 0) | |
6029 | constructor_unfilled_fields = TREE_CHAIN (constructor_unfilled_fields); | |
6030 | ||
6031 | } | |
6032 | else if (TREE_CODE (constructor_type) == ARRAY_TYPE) | |
6033 | { | |
6034 | if (TYPE_DOMAIN (constructor_type)) | |
6035 | constructor_unfilled_index | |
6036 | = convert (bitsizetype, | |
6037 | TYPE_MIN_VALUE (TYPE_DOMAIN (constructor_type))); | |
6038 | else | |
6039 | constructor_unfilled_index = bitsize_zero_node; | |
6040 | } | |
6041 | constructor_incremental = 0; | |
6042 | } | |
6043 | ||
6044 | /* Build AVL tree from a string constant. */ | |
6045 | ||
6046 | static void | |
6047 | set_nonincremental_init_from_string (str) | |
6048 | tree str; | |
6049 | { | |
6050 | tree value, purpose, type; | |
6051 | HOST_WIDE_INT val[2]; | |
6052 | const char *p, *end; | |
6053 | int byte, wchar_bytes, charwidth, bitpos; | |
6054 | ||
6055 | if (TREE_CODE (constructor_type) != ARRAY_TYPE) | |
6056 | abort (); | |
6057 | ||
6058 | if (TYPE_PRECISION (TREE_TYPE (TREE_TYPE (str))) | |
6059 | == TYPE_PRECISION (char_type_node)) | |
6060 | wchar_bytes = 1; | |
6061 | else if (TYPE_PRECISION (TREE_TYPE (TREE_TYPE (str))) | |
6062 | == TYPE_PRECISION (wchar_type_node)) | |
6063 | wchar_bytes = TYPE_PRECISION (wchar_type_node) / BITS_PER_UNIT; | |
6064 | else | |
6065 | abort (); | |
6066 | ||
6067 | charwidth = TYPE_PRECISION (char_type_node); | |
6068 | type = TREE_TYPE (constructor_type); | |
6069 | p = TREE_STRING_POINTER (str); | |
6070 | end = p + TREE_STRING_LENGTH (str); | |
6071 | ||
6072 | for (purpose = bitsize_zero_node; | |
6073 | p < end && !tree_int_cst_lt (constructor_max_index, purpose); | |
6074 | purpose = size_binop (PLUS_EXPR, purpose, bitsize_one_node)) | |
6075 | { | |
6076 | if (wchar_bytes == 1) | |
6077 | { | |
6078 | val[1] = (unsigned char) *p++; | |
6079 | val[0] = 0; | |
6080 | } | |
6081 | else | |
6082 | { | |
6083 | val[0] = 0; | |
6084 | val[1] = 0; | |
6085 | for (byte = 0; byte < wchar_bytes; byte++) | |
6086 | { | |
6087 | if (BYTES_BIG_ENDIAN) | |
6088 | bitpos = (wchar_bytes - byte - 1) * charwidth; | |
6089 | else | |
6090 | bitpos = byte * charwidth; | |
6091 | val[bitpos < HOST_BITS_PER_WIDE_INT] | |
6092 | |= ((unsigned HOST_WIDE_INT) ((unsigned char) *p++)) | |
6093 | << (bitpos % HOST_BITS_PER_WIDE_INT); | |
6094 | } | |
6095 | } | |
6096 | ||
6097 | if (!TREE_UNSIGNED (type)) | |
6098 | { | |
6099 | bitpos = ((wchar_bytes - 1) * charwidth) + HOST_BITS_PER_CHAR; | |
6100 | if (bitpos < HOST_BITS_PER_WIDE_INT) | |
6101 | { | |
6102 | if (val[1] & (((HOST_WIDE_INT) 1) << (bitpos - 1))) | |
6103 | { | |
6104 | val[1] |= ((HOST_WIDE_INT) -1) << bitpos; | |
6105 | val[0] = -1; | |
6106 | } | |
6107 | } | |
6108 | else if (bitpos == HOST_BITS_PER_WIDE_INT) | |
6109 | { | |
6110 | if (val[1] < 0) | |
6111 | val[0] = -1; | |
6112 | } | |
6113 | else if (val[0] & (((HOST_WIDE_INT) 1) | |
6114 | << (bitpos - 1 - HOST_BITS_PER_WIDE_INT))) | |
6115 | val[0] |= ((HOST_WIDE_INT) -1) | |
6116 | << (bitpos - HOST_BITS_PER_WIDE_INT); | |
6117 | } | |
6118 | ||
6119 | value = build_int_2 (val[1], val[0]); | |
6120 | TREE_TYPE (value) = type; | |
6121 | add_pending_init (purpose, value); | |
6122 | } | |
6123 | ||
6124 | constructor_incremental = 0; | |
6125 | } | |
6126 | ||
6127 | /* Return value of FIELD in pending initializer or zero if the field was | |
6128 | not initialized yet. */ | |
6129 | ||
6130 | static tree | |
6131 | find_init_member (field) | |
e5e809f4 JL |
6132 | tree field; |
6133 | { | |
6134 | struct init_node *p; | |
6135 | ||
e5e809f4 JL |
6136 | if (TREE_CODE (constructor_type) == ARRAY_TYPE) |
6137 | { | |
8b6a5902 JJ |
6138 | if (constructor_incremental |
6139 | && tree_int_cst_lt (field, constructor_unfilled_index)) | |
6140 | set_nonincremental_init (); | |
6141 | ||
6142 | p = constructor_pending_elts; | |
e5e809f4 JL |
6143 | while (p) |
6144 | { | |
8b6a5902 | 6145 | if (tree_int_cst_lt (field, p->purpose)) |
e5e809f4 | 6146 | p = p->left; |
8b6a5902 | 6147 | else if (tree_int_cst_lt (p->purpose, field)) |
e5e809f4 | 6148 | p = p->right; |
8b6a5902 JJ |
6149 | else |
6150 | return p->value; | |
e5e809f4 JL |
6151 | } |
6152 | } | |
8b6a5902 | 6153 | else if (TREE_CODE (constructor_type) == RECORD_TYPE) |
e5e809f4 | 6154 | { |
8b6a5902 JJ |
6155 | tree bitpos = bit_position (field); |
6156 | ||
6157 | if (constructor_incremental | |
6158 | && (!constructor_unfilled_fields | |
6159 | || tree_int_cst_lt (bitpos, | |
6160 | bit_position (constructor_unfilled_fields)))) | |
6161 | set_nonincremental_init (); | |
6162 | ||
6163 | p = constructor_pending_elts; | |
e5e809f4 JL |
6164 | while (p) |
6165 | { | |
6166 | if (field == p->purpose) | |
8b6a5902 JJ |
6167 | return p->value; |
6168 | else if (tree_int_cst_lt (bitpos, bit_position (p->purpose))) | |
e5e809f4 JL |
6169 | p = p->left; |
6170 | else | |
6171 | p = p->right; | |
6172 | } | |
6173 | } | |
8b6a5902 JJ |
6174 | else if (TREE_CODE (constructor_type) == UNION_TYPE) |
6175 | { | |
6176 | if (constructor_elements | |
6177 | && TREE_PURPOSE (constructor_elements) == field) | |
6178 | return TREE_VALUE (constructor_elements); | |
6179 | } | |
e5e809f4 JL |
6180 | return 0; |
6181 | } | |
6182 | ||
de520661 RS |
6183 | /* "Output" the next constructor element. |
6184 | At top level, really output it to assembler code now. | |
6185 | Otherwise, collect it in a list from which we will make a CONSTRUCTOR. | |
6186 | TYPE is the data type that the containing data type wants here. | |
6187 | FIELD is the field (a FIELD_DECL) or the index that this element fills. | |
6188 | ||
6189 | PENDING if non-nil means output pending elements that belong | |
6190 | right after this element. (PENDING is normally 1; | |
6191 | it is 0 while outputting pending elements, to avoid recursion.) */ | |
6192 | ||
34403047 | 6193 | static void |
de520661 RS |
6194 | output_init_element (value, type, field, pending) |
6195 | tree value, type, field; | |
6196 | int pending; | |
6197 | { | |
d3ab9753 RS |
6198 | if (TREE_CODE (TREE_TYPE (value)) == FUNCTION_TYPE |
6199 | || (TREE_CODE (TREE_TYPE (value)) == ARRAY_TYPE | |
fd5d5b94 RS |
6200 | && !(TREE_CODE (value) == STRING_CST |
6201 | && TREE_CODE (type) == ARRAY_TYPE | |
6202 | && TREE_CODE (TREE_TYPE (type)) == INTEGER_TYPE) | |
1e40eab8 RS |
6203 | && !comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (value)), |
6204 | TYPE_MAIN_VARIANT (type)))) | |
d3ab9753 RS |
6205 | value = default_conversion (value); |
6206 | ||
e6ecc89b JJ |
6207 | if (TREE_CODE (value) == COMPOUND_LITERAL_EXPR |
6208 | && require_constant_value && !flag_isoc99 && pending) | |
6209 | { | |
6210 | /* As an extension, allow initializing objects with static storage | |
6211 | duration with compound literals (which are then treated just as | |
6212 | the brace enclosed list they contain). */ | |
6213 | tree decl = COMPOUND_LITERAL_EXPR_DECL (value); | |
6214 | value = DECL_INITIAL (decl); | |
6215 | } | |
6216 | ||
d3ab9753 RS |
6217 | if (value == error_mark_node) |
6218 | constructor_erroneous = 1; | |
6219 | else if (!TREE_CONSTANT (value)) | |
6220 | constructor_constant = 0; | |
4160009f RK |
6221 | else if (initializer_constant_valid_p (value, TREE_TYPE (value)) == 0 |
6222 | || ((TREE_CODE (constructor_type) == RECORD_TYPE | |
6223 | || TREE_CODE (constructor_type) == UNION_TYPE) | |
ef86d2a6 RK |
6224 | && DECL_C_BIT_FIELD (field) |
6225 | && TREE_CODE (value) != INTEGER_CST)) | |
d3ab9753 RS |
6226 | constructor_simple = 0; |
6227 | ||
de520661 RS |
6228 | if (require_constant_value && ! TREE_CONSTANT (value)) |
6229 | { | |
ab87f8c8 | 6230 | error_init ("initializer element is not constant"); |
de520661 RS |
6231 | value = error_mark_node; |
6232 | } | |
6233 | else if (require_constant_elements | |
6234 | && initializer_constant_valid_p (value, TREE_TYPE (value)) == 0) | |
8b6a5902 JJ |
6235 | pedwarn ("initializer element is not computable at load time"); |
6236 | ||
6237 | /* If this field is empty (and not at the end of structure), | |
6238 | don't do anything other than checking the initializer. */ | |
6239 | if (field | |
6240 | && (TREE_TYPE (field) == error_mark_node | |
6241 | || (COMPLETE_TYPE_P (TREE_TYPE (field)) | |
6242 | && integer_zerop (TYPE_SIZE (TREE_TYPE (field))) | |
6243 | && (TREE_CODE (constructor_type) == ARRAY_TYPE | |
6244 | || TREE_CHAIN (field))))) | |
6245 | return; | |
de520661 | 6246 | |
273cf2e4 | 6247 | value = digest_init (type, value, require_constant_value); |
8b6a5902 | 6248 | if (value == error_mark_node) |
de520661 | 6249 | { |
8b6a5902 JJ |
6250 | constructor_erroneous = 1; |
6251 | return; | |
400fbf9f | 6252 | } |
400fbf9f | 6253 | |
de520661 RS |
6254 | /* If this element doesn't come next in sequence, |
6255 | put it on constructor_pending_elts. */ | |
6256 | if (TREE_CODE (constructor_type) == ARRAY_TYPE | |
8b6a5902 JJ |
6257 | && (!constructor_incremental |
6258 | || !tree_int_cst_equal (field, constructor_unfilled_index))) | |
de520661 | 6259 | { |
8b6a5902 JJ |
6260 | if (constructor_incremental |
6261 | && tree_int_cst_lt (field, constructor_unfilled_index)) | |
6262 | set_nonincremental_init (); | |
6263 | ||
822baa84 | 6264 | add_pending_init (field, value); |
8b6a5902 | 6265 | return; |
de520661 | 6266 | } |
76aaaae2 | 6267 | else if (TREE_CODE (constructor_type) == RECORD_TYPE |
8b6a5902 JJ |
6268 | && (!constructor_incremental |
6269 | || field != constructor_unfilled_fields)) | |
de520661 | 6270 | { |
76aaaae2 RS |
6271 | /* We do this for records but not for unions. In a union, |
6272 | no matter which field is specified, it can be initialized | |
6273 | right away since it starts at the beginning of the union. */ | |
8b6a5902 JJ |
6274 | if (constructor_incremental) |
6275 | { | |
6276 | if (!constructor_unfilled_fields) | |
6277 | set_nonincremental_init (); | |
6278 | else | |
6279 | { | |
6280 | tree bitpos, unfillpos; | |
6281 | ||
6282 | bitpos = bit_position (field); | |
6283 | unfillpos = bit_position (constructor_unfilled_fields); | |
6284 | ||
6285 | if (tree_int_cst_lt (bitpos, unfillpos)) | |
6286 | set_nonincremental_init (); | |
6287 | } | |
6288 | } | |
6289 | ||
822baa84 | 6290 | add_pending_init (field, value); |
8b6a5902 | 6291 | return; |
de520661 | 6292 | } |
8b6a5902 JJ |
6293 | else if (TREE_CODE (constructor_type) == UNION_TYPE |
6294 | && constructor_elements) | |
de520661 | 6295 | { |
8b6a5902 JJ |
6296 | if (TREE_SIDE_EFFECTS (TREE_VALUE (constructor_elements))) |
6297 | warning_init ("initialized field with side-effects overwritten"); | |
400fbf9f | 6298 | |
8b6a5902 JJ |
6299 | /* We can have just one union field set. */ |
6300 | constructor_elements = 0; | |
6301 | } | |
c2f4acb7 | 6302 | |
8b6a5902 JJ |
6303 | /* Otherwise, output this element either to |
6304 | constructor_elements or to the assembler file. */ | |
6305 | ||
6306 | if (field && TREE_CODE (field) == INTEGER_CST) | |
6307 | field = copy_node (field); | |
6308 | constructor_elements | |
822baa84 | 6309 | = tree_cons (field, value, constructor_elements); |
8b6a5902 JJ |
6310 | |
6311 | /* Advance the variable that indicates sequential elements output. */ | |
6312 | if (TREE_CODE (constructor_type) == ARRAY_TYPE) | |
6313 | constructor_unfilled_index | |
6314 | = size_binop (PLUS_EXPR, constructor_unfilled_index, | |
6315 | bitsize_one_node); | |
6316 | else if (TREE_CODE (constructor_type) == RECORD_TYPE) | |
6317 | { | |
6318 | constructor_unfilled_fields | |
6319 | = TREE_CHAIN (constructor_unfilled_fields); | |
de520661 | 6320 | |
8b6a5902 JJ |
6321 | /* Skip any nameless bit fields. */ |
6322 | while (constructor_unfilled_fields != 0 | |
6323 | && DECL_C_BIT_FIELD (constructor_unfilled_fields) | |
6324 | && DECL_NAME (constructor_unfilled_fields) == 0) | |
6325 | constructor_unfilled_fields = | |
6326 | TREE_CHAIN (constructor_unfilled_fields); | |
de520661 | 6327 | } |
8b6a5902 JJ |
6328 | else if (TREE_CODE (constructor_type) == UNION_TYPE) |
6329 | constructor_unfilled_fields = 0; | |
6330 | ||
6331 | /* Now output any pending elements which have become next. */ | |
6332 | if (pending) | |
6333 | output_pending_init_elements (0); | |
de520661 | 6334 | } |
400fbf9f | 6335 | |
de520661 RS |
6336 | /* Output any pending elements which have become next. |
6337 | As we output elements, constructor_unfilled_{fields,index} | |
6338 | advances, which may cause other elements to become next; | |
6339 | if so, they too are output. | |
6340 | ||
6341 | If ALL is 0, we return when there are | |
6342 | no more pending elements to output now. | |
6343 | ||
6344 | If ALL is 1, we output space as necessary so that | |
6345 | we can output all the pending elements. */ | |
6346 | ||
6347 | static void | |
6348 | output_pending_init_elements (all) | |
6349 | int all; | |
6350 | { | |
e5e809f4 | 6351 | struct init_node *elt = constructor_pending_elts; |
de520661 RS |
6352 | tree next; |
6353 | ||
6354 | retry: | |
6355 | ||
e5e809f4 | 6356 | /* Look thru the whole pending tree. |
de520661 RS |
6357 | If we find an element that should be output now, |
6358 | output it. Otherwise, set NEXT to the element | |
6359 | that comes first among those still pending. */ | |
6360 | ||
6361 | next = 0; | |
e5e809f4 | 6362 | while (elt) |
de520661 RS |
6363 | { |
6364 | if (TREE_CODE (constructor_type) == ARRAY_TYPE) | |
6365 | { | |
e5e809f4 | 6366 | if (tree_int_cst_equal (elt->purpose, |
de520661 | 6367 | constructor_unfilled_index)) |
e5e809f4 JL |
6368 | output_init_element (elt->value, |
6369 | TREE_TYPE (constructor_type), | |
6370 | constructor_unfilled_index, 0); | |
6371 | else if (tree_int_cst_lt (constructor_unfilled_index, | |
6372 | elt->purpose)) | |
400fbf9f | 6373 | { |
e5e809f4 JL |
6374 | /* Advance to the next smaller node. */ |
6375 | if (elt->left) | |
6376 | elt = elt->left; | |
6377 | else | |
6378 | { | |
6379 | /* We have reached the smallest node bigger than the | |
6380 | current unfilled index. Fill the space first. */ | |
6381 | next = elt->purpose; | |
6382 | break; | |
6383 | } | |
6384 | } | |
6385 | else | |
6386 | { | |
6387 | /* Advance to the next bigger node. */ | |
6388 | if (elt->right) | |
6389 | elt = elt->right; | |
6390 | else | |
6391 | { | |
6392 | /* We have reached the biggest node in a subtree. Find | |
6393 | the parent of it, which is the next bigger node. */ | |
6394 | while (elt->parent && elt->parent->right == elt) | |
6395 | elt = elt->parent; | |
6396 | elt = elt->parent; | |
6397 | if (elt && tree_int_cst_lt (constructor_unfilled_index, | |
6398 | elt->purpose)) | |
6399 | { | |
6400 | next = elt->purpose; | |
6401 | break; | |
6402 | } | |
6403 | } | |
de520661 | 6404 | } |
de520661 RS |
6405 | } |
6406 | else if (TREE_CODE (constructor_type) == RECORD_TYPE | |
6407 | || TREE_CODE (constructor_type) == UNION_TYPE) | |
6408 | { | |
8b6a5902 JJ |
6409 | tree ctor_unfilled_bitpos, elt_bitpos; |
6410 | ||
e5e809f4 JL |
6411 | /* If the current record is complete we are done. */ |
6412 | if (constructor_unfilled_fields == 0) | |
6413 | break; | |
8b6a5902 JJ |
6414 | |
6415 | ctor_unfilled_bitpos = bit_position (constructor_unfilled_fields); | |
6416 | elt_bitpos = bit_position (elt->purpose); | |
6417 | /* We can't compare fields here because there might be empty | |
6418 | fields in between. */ | |
6419 | if (tree_int_cst_equal (elt_bitpos, ctor_unfilled_bitpos)) | |
de520661 | 6420 | { |
8b6a5902 JJ |
6421 | constructor_unfilled_fields = elt->purpose; |
6422 | output_init_element (elt->value, TREE_TYPE (elt->purpose), | |
6423 | elt->purpose, 0); | |
400fbf9f | 6424 | } |
8b6a5902 | 6425 | else if (tree_int_cst_lt (ctor_unfilled_bitpos, elt_bitpos)) |
e5e809f4 JL |
6426 | { |
6427 | /* Advance to the next smaller node. */ | |
6428 | if (elt->left) | |
6429 | elt = elt->left; | |
6430 | else | |
6431 | { | |
6432 | /* We have reached the smallest node bigger than the | |
6433 | current unfilled field. Fill the space first. */ | |
6434 | next = elt->purpose; | |
6435 | break; | |
6436 | } | |
6437 | } | |
6438 | else | |
6439 | { | |
6440 | /* Advance to the next bigger node. */ | |
6441 | if (elt->right) | |
6442 | elt = elt->right; | |
6443 | else | |
6444 | { | |
6445 | /* We have reached the biggest node in a subtree. Find | |
6446 | the parent of it, which is the next bigger node. */ | |
6447 | while (elt->parent && elt->parent->right == elt) | |
6448 | elt = elt->parent; | |
6449 | elt = elt->parent; | |
6450 | if (elt | |
8b6a5902 JJ |
6451 | && (tree_int_cst_lt (ctor_unfilled_bitpos, |
6452 | bit_position (elt->purpose)))) | |
e5e809f4 JL |
6453 | { |
6454 | next = elt->purpose; | |
6455 | break; | |
6456 | } | |
6457 | } | |
6458 | } | |
400fbf9f | 6459 | } |
de520661 RS |
6460 | } |
6461 | ||
6462 | /* Ordinarily return, but not if we want to output all | |
6463 | and there are elements left. */ | |
6464 | if (! (all && next != 0)) | |
6465 | return; | |
6466 | ||
229a2e65 MM |
6467 | /* If it's not incremental, just skip over the gap, so that after |
6468 | jumping to retry we will output the next successive element. */ | |
6469 | if (TREE_CODE (constructor_type) == RECORD_TYPE | |
6470 | || TREE_CODE (constructor_type) == UNION_TYPE) | |
6471 | constructor_unfilled_fields = next; | |
6472 | else if (TREE_CODE (constructor_type) == ARRAY_TYPE) | |
6473 | constructor_unfilled_index = next; | |
de520661 | 6474 | |
e5e809f4 JL |
6475 | /* ELT now points to the node in the pending tree with the next |
6476 | initializer to output. */ | |
de520661 RS |
6477 | goto retry; |
6478 | } | |
6479 | \f | |
6480 | /* Add one non-braced element to the current constructor level. | |
6481 | This adjusts the current position within the constructor's type. | |
6482 | This may also start or terminate implicit levels | |
6483 | to handle a partly-braced initializer. | |
6484 | ||
6485 | Once this has found the correct level for the new element, | |
229a2e65 | 6486 | it calls output_init_element. */ |
de520661 RS |
6487 | |
6488 | void | |
6489 | process_init_element (value) | |
6490 | tree value; | |
6491 | { | |
b62acd60 RS |
6492 | tree orig_value = value; |
6493 | int string_flag = value != 0 && TREE_CODE (value) == STRING_CST; | |
6494 | ||
8b6a5902 JJ |
6495 | designator_depth = 0; |
6496 | designator_errorneous = 0; | |
6497 | ||
790e9490 RS |
6498 | /* Handle superfluous braces around string cst as in |
6499 | char x[] = {"foo"}; */ | |
6500 | if (string_flag | |
d27c148b | 6501 | && constructor_type |
790e9490 | 6502 | && TREE_CODE (constructor_type) == ARRAY_TYPE |
61e215dd | 6503 | && TREE_CODE (TREE_TYPE (constructor_type)) == INTEGER_TYPE |
790e9490 RS |
6504 | && integer_zerop (constructor_unfilled_index)) |
6505 | { | |
d739a3bc NS |
6506 | if (constructor_stack->replacement_value) |
6507 | error_init ("excess elements in char array initializer"); | |
790e9490 RS |
6508 | constructor_stack->replacement_value = value; |
6509 | return; | |
6510 | } | |
6511 | ||
790e9490 RS |
6512 | if (constructor_stack->replacement_value != 0) |
6513 | { | |
ab87f8c8 | 6514 | error_init ("excess elements in struct initializer"); |
790e9490 RS |
6515 | return; |
6516 | } | |
6517 | ||
91fa3c30 RS |
6518 | /* Ignore elements of a brace group if it is entirely superfluous |
6519 | and has already been diagnosed. */ | |
6520 | if (constructor_type == 0) | |
6521 | return; | |
6522 | ||
de520661 RS |
6523 | /* If we've exhausted any levels that didn't have braces, |
6524 | pop them now. */ | |
6525 | while (constructor_stack->implicit) | |
6526 | { | |
6527 | if ((TREE_CODE (constructor_type) == RECORD_TYPE | |
6528 | || TREE_CODE (constructor_type) == UNION_TYPE) | |
6529 | && constructor_fields == 0) | |
6530 | process_init_element (pop_init_level (1)); | |
6531 | else if (TREE_CODE (constructor_type) == ARRAY_TYPE | |
ec0bc8b6 RK |
6532 | && (constructor_max_index == 0 |
6533 | || tree_int_cst_lt (constructor_max_index, | |
6534 | constructor_index))) | |
de520661 | 6535 | process_init_element (pop_init_level (1)); |
fe67cf58 | 6536 | else |
de520661 | 6537 | break; |
400fbf9f JW |
6538 | } |
6539 | ||
8b6a5902 JJ |
6540 | /* In the case of [LO ... HI] = VALUE, only evaluate VALUE once. */ |
6541 | if (constructor_range_stack) | |
7c94ce7f JJ |
6542 | { |
6543 | /* If value is a compound literal and we'll be just using its | |
6544 | content, don't put it into a SAVE_EXPR. */ | |
6545 | if (TREE_CODE (value) != COMPOUND_LITERAL_EXPR | |
6546 | || !require_constant_value | |
6547 | || flag_isoc99) | |
6548 | value = save_expr (value); | |
6549 | } | |
8b6a5902 | 6550 | |
de520661 | 6551 | while (1) |
400fbf9f | 6552 | { |
de520661 | 6553 | if (TREE_CODE (constructor_type) == RECORD_TYPE) |
400fbf9f | 6554 | { |
de520661 RS |
6555 | tree fieldtype; |
6556 | enum tree_code fieldcode; | |
6557 | ||
6558 | if (constructor_fields == 0) | |
6559 | { | |
ab87f8c8 | 6560 | pedwarn_init ("excess elements in struct initializer"); |
de520661 RS |
6561 | break; |
6562 | } | |
6563 | ||
1d33b2a9 JW |
6564 | fieldtype = TREE_TYPE (constructor_fields); |
6565 | if (fieldtype != error_mark_node) | |
6566 | fieldtype = TYPE_MAIN_VARIANT (fieldtype); | |
de520661 RS |
6567 | fieldcode = TREE_CODE (fieldtype); |
6568 | ||
eba80994 EB |
6569 | /* Error for non-static initialization of a flexible array member. */ |
6570 | if (fieldcode == ARRAY_TYPE | |
6571 | && !require_constant_value | |
6572 | && TYPE_SIZE (fieldtype) == NULL_TREE | |
6573 | && TREE_CHAIN (constructor_fields) == NULL_TREE) | |
6574 | { | |
6575 | error_init ("non-static initialization of a flexible array member"); | |
6576 | break; | |
6577 | } | |
6578 | ||
b62acd60 RS |
6579 | /* Accept a string constant to initialize a subarray. */ |
6580 | if (value != 0 | |
6581 | && fieldcode == ARRAY_TYPE | |
6582 | && TREE_CODE (TREE_TYPE (fieldtype)) == INTEGER_TYPE | |
6583 | && string_flag) | |
6584 | value = orig_value; | |
6585 | /* Otherwise, if we have come to a subaggregate, | |
6586 | and we don't have an element of its type, push into it. */ | |
cc77d4d5 | 6587 | else if (value != 0 && !constructor_no_implicit |
ee7204ee | 6588 | && value != error_mark_node |
b62acd60 RS |
6589 | && TYPE_MAIN_VARIANT (TREE_TYPE (value)) != fieldtype |
6590 | && (fieldcode == RECORD_TYPE || fieldcode == ARRAY_TYPE | |
6591 | || fieldcode == UNION_TYPE)) | |
de520661 RS |
6592 | { |
6593 | push_init_level (1); | |
6594 | continue; | |
6595 | } | |
6596 | ||
6597 | if (value) | |
6598 | { | |
19d76e60 | 6599 | push_member_name (constructor_fields); |
de520661 RS |
6600 | output_init_element (value, fieldtype, constructor_fields, 1); |
6601 | RESTORE_SPELLING_DEPTH (constructor_depth); | |
6602 | } | |
6603 | else | |
b62acd60 RS |
6604 | /* Do the bookkeeping for an element that was |
6605 | directly output as a constructor. */ | |
6606 | { | |
6607 | /* For a record, keep track of end position of last field. */ | |
ffc5c6a9 RH |
6608 | if (DECL_SIZE (constructor_fields)) |
6609 | constructor_bit_index | |
6610 | = size_binop (PLUS_EXPR, | |
6611 | bit_position (constructor_fields), | |
6612 | DECL_SIZE (constructor_fields)); | |
b62acd60 RS |
6613 | |
6614 | constructor_unfilled_fields = TREE_CHAIN (constructor_fields); | |
9bbecbc4 R |
6615 | /* Skip any nameless bit fields. */ |
6616 | while (constructor_unfilled_fields != 0 | |
6617 | && DECL_C_BIT_FIELD (constructor_unfilled_fields) | |
6618 | && DECL_NAME (constructor_unfilled_fields) == 0) | |
6619 | constructor_unfilled_fields = | |
6620 | TREE_CHAIN (constructor_unfilled_fields); | |
b62acd60 | 6621 | } |
de520661 RS |
6622 | |
6623 | constructor_fields = TREE_CHAIN (constructor_fields); | |
abc95ed3 | 6624 | /* Skip any nameless bit fields at the beginning. */ |
ef86d2a6 RK |
6625 | while (constructor_fields != 0 |
6626 | && DECL_C_BIT_FIELD (constructor_fields) | |
fc623854 RS |
6627 | && DECL_NAME (constructor_fields) == 0) |
6628 | constructor_fields = TREE_CHAIN (constructor_fields); | |
400fbf9f | 6629 | } |
8b6a5902 | 6630 | else if (TREE_CODE (constructor_type) == UNION_TYPE) |
400fbf9f | 6631 | { |
de520661 RS |
6632 | tree fieldtype; |
6633 | enum tree_code fieldcode; | |
6634 | ||
6635 | if (constructor_fields == 0) | |
6636 | { | |
ab87f8c8 | 6637 | pedwarn_init ("excess elements in union initializer"); |
de520661 RS |
6638 | break; |
6639 | } | |
6640 | ||
1d33b2a9 JW |
6641 | fieldtype = TREE_TYPE (constructor_fields); |
6642 | if (fieldtype != error_mark_node) | |
6643 | fieldtype = TYPE_MAIN_VARIANT (fieldtype); | |
de520661 RS |
6644 | fieldcode = TREE_CODE (fieldtype); |
6645 | ||
253b6b82 KG |
6646 | /* Warn that traditional C rejects initialization of unions. |
6647 | We skip the warning if the value is zero. This is done | |
6648 | under the assumption that the zero initializer in user | |
6649 | code appears conditioned on e.g. __STDC__ to avoid | |
6650 | "missing initializer" warnings and relies on default | |
b621a4dd ZW |
6651 | initialization to zero in the traditional C case. |
6652 | We also skip the warning if the initializer is designated, | |
6653 | again on the assumption that this must be conditional on | |
6654 | __STDC__ anyway (and we've already complained about the | |
6655 | member-designator already). */ | |
6656 | if (warn_traditional && !in_system_header && !constructor_designated | |
32892c52 | 6657 | && !(value && (integer_zerop (value) || real_zerop (value)))) |
253b6b82 KG |
6658 | warning ("traditional C rejects initialization of unions"); |
6659 | ||
b62acd60 RS |
6660 | /* Accept a string constant to initialize a subarray. */ |
6661 | if (value != 0 | |
6662 | && fieldcode == ARRAY_TYPE | |
6663 | && TREE_CODE (TREE_TYPE (fieldtype)) == INTEGER_TYPE | |
6664 | && string_flag) | |
6665 | value = orig_value; | |
6666 | /* Otherwise, if we have come to a subaggregate, | |
6667 | and we don't have an element of its type, push into it. */ | |
cc77d4d5 | 6668 | else if (value != 0 && !constructor_no_implicit |
ee7204ee | 6669 | && value != error_mark_node |
b62acd60 RS |
6670 | && TYPE_MAIN_VARIANT (TREE_TYPE (value)) != fieldtype |
6671 | && (fieldcode == RECORD_TYPE || fieldcode == ARRAY_TYPE | |
6672 | || fieldcode == UNION_TYPE)) | |
de520661 RS |
6673 | { |
6674 | push_init_level (1); | |
6675 | continue; | |
6676 | } | |
6677 | ||
6678 | if (value) | |
6679 | { | |
19d76e60 | 6680 | push_member_name (constructor_fields); |
de520661 RS |
6681 | output_init_element (value, fieldtype, constructor_fields, 1); |
6682 | RESTORE_SPELLING_DEPTH (constructor_depth); | |
6683 | } | |
6684 | else | |
94ba5069 RS |
6685 | /* Do the bookkeeping for an element that was |
6686 | directly output as a constructor. */ | |
6687 | { | |
665f2503 | 6688 | constructor_bit_index = DECL_SIZE (constructor_fields); |
94ba5069 RS |
6689 | constructor_unfilled_fields = TREE_CHAIN (constructor_fields); |
6690 | } | |
de520661 RS |
6691 | |
6692 | constructor_fields = 0; | |
400fbf9f | 6693 | } |
8b6a5902 | 6694 | else if (TREE_CODE (constructor_type) == ARRAY_TYPE) |
de520661 RS |
6695 | { |
6696 | tree elttype = TYPE_MAIN_VARIANT (TREE_TYPE (constructor_type)); | |
6697 | enum tree_code eltcode = TREE_CODE (elttype); | |
6698 | ||
b62acd60 RS |
6699 | /* Accept a string constant to initialize a subarray. */ |
6700 | if (value != 0 | |
6701 | && eltcode == ARRAY_TYPE | |
6702 | && TREE_CODE (TREE_TYPE (elttype)) == INTEGER_TYPE | |
6703 | && string_flag) | |
6704 | value = orig_value; | |
6705 | /* Otherwise, if we have come to a subaggregate, | |
6706 | and we don't have an element of its type, push into it. */ | |
cc77d4d5 | 6707 | else if (value != 0 && !constructor_no_implicit |
ee7204ee | 6708 | && value != error_mark_node |
b62acd60 RS |
6709 | && TYPE_MAIN_VARIANT (TREE_TYPE (value)) != elttype |
6710 | && (eltcode == RECORD_TYPE || eltcode == ARRAY_TYPE | |
6711 | || eltcode == UNION_TYPE)) | |
de520661 RS |
6712 | { |
6713 | push_init_level (1); | |
6714 | continue; | |
6715 | } | |
6716 | ||
6717 | if (constructor_max_index != 0 | |
4b606faf WC |
6718 | && (tree_int_cst_lt (constructor_max_index, constructor_index) |
6719 | || integer_all_onesp (constructor_max_index))) | |
de520661 | 6720 | { |
ab87f8c8 | 6721 | pedwarn_init ("excess elements in array initializer"); |
de520661 RS |
6722 | break; |
6723 | } | |
400fbf9f | 6724 | |
8b6a5902 JJ |
6725 | /* Now output the actual element. */ |
6726 | if (value) | |
ee2990e7 | 6727 | { |
8b6a5902 JJ |
6728 | push_array_bounds (tree_low_cst (constructor_index, 0)); |
6729 | output_init_element (value, elttype, constructor_index, 1); | |
6730 | RESTORE_SPELLING_DEPTH (constructor_depth); | |
ee2990e7 | 6731 | } |
333a5dae | 6732 | |
8b6a5902 JJ |
6733 | constructor_index |
6734 | = size_binop (PLUS_EXPR, constructor_index, bitsize_one_node); | |
400fbf9f | 6735 | |
8b6a5902 JJ |
6736 | if (! value) |
6737 | /* If we are doing the bookkeeping for an element that was | |
6738 | directly output as a constructor, we must update | |
6739 | constructor_unfilled_index. */ | |
6740 | constructor_unfilled_index = constructor_index; | |
de520661 | 6741 | } |
e6834654 SS |
6742 | else if (TREE_CODE (constructor_type) == VECTOR_TYPE) |
6743 | { | |
6744 | tree elttype = TYPE_MAIN_VARIANT (TREE_TYPE (constructor_type)); | |
6745 | ||
6746 | /* Do a basic check of initializer size. Note that vectors | |
6747 | always have a fixed size derived from their type. */ | |
6748 | if (tree_int_cst_lt (constructor_max_index, constructor_index)) | |
6749 | { | |
6750 | pedwarn_init ("excess elements in vector initializer"); | |
6751 | break; | |
6752 | } | |
6753 | ||
6754 | /* Now output the actual element. */ | |
6755 | if (value) | |
6756 | output_init_element (value, elttype, constructor_index, 1); | |
6757 | ||
6758 | constructor_index | |
6759 | = size_binop (PLUS_EXPR, constructor_index, bitsize_one_node); | |
6760 | ||
6761 | if (! value) | |
6762 | /* If we are doing the bookkeeping for an element that was | |
6763 | directly output as a constructor, we must update | |
6764 | constructor_unfilled_index. */ | |
6765 | constructor_unfilled_index = constructor_index; | |
6766 | } | |
de520661 RS |
6767 | |
6768 | /* Handle the sole element allowed in a braced initializer | |
6769 | for a scalar variable. */ | |
8b6a5902 | 6770 | else if (constructor_fields == 0) |
de520661 | 6771 | { |
ab87f8c8 | 6772 | pedwarn_init ("excess elements in scalar initializer"); |
de520661 RS |
6773 | break; |
6774 | } | |
8b6a5902 JJ |
6775 | else |
6776 | { | |
6777 | if (value) | |
6778 | output_init_element (value, constructor_type, NULL_TREE, 1); | |
6779 | constructor_fields = 0; | |
6780 | } | |
6781 | ||
6782 | /* Handle range initializers either at this level or anywhere higher | |
6783 | in the designator stack. */ | |
6784 | if (constructor_range_stack) | |
6785 | { | |
6786 | struct constructor_range_stack *p, *range_stack; | |
6787 | int finish = 0; | |
6788 | ||
6789 | range_stack = constructor_range_stack; | |
6790 | constructor_range_stack = 0; | |
6791 | while (constructor_stack != range_stack->stack) | |
6792 | { | |
6793 | if (!constructor_stack->implicit) | |
6794 | abort (); | |
6795 | process_init_element (pop_init_level (1)); | |
6796 | } | |
6797 | for (p = range_stack; | |
6798 | !p->range_end || tree_int_cst_equal (p->index, p->range_end); | |
6799 | p = p->prev) | |
6800 | { | |
6801 | if (!constructor_stack->implicit) | |
6802 | abort (); | |
6803 | process_init_element (pop_init_level (1)); | |
6804 | } | |
6805 | ||
6806 | p->index = size_binop (PLUS_EXPR, p->index, bitsize_one_node); | |
6807 | if (tree_int_cst_equal (p->index, p->range_end) && !p->prev) | |
6808 | finish = 1; | |
6809 | ||
6810 | while (1) | |
6811 | { | |
6812 | constructor_index = p->index; | |
6813 | constructor_fields = p->fields; | |
6814 | if (finish && p->range_end && p->index == p->range_start) | |
6815 | { | |
6816 | finish = 0; | |
6817 | p->prev = 0; | |
6818 | } | |
6819 | p = p->next; | |
6820 | if (!p) | |
6821 | break; | |
6822 | push_init_level (2); | |
6823 | p->stack = constructor_stack; | |
6824 | if (p->range_end && tree_int_cst_equal (p->index, p->range_end)) | |
6825 | p->index = p->range_start; | |
6826 | } | |
6827 | ||
6828 | if (!finish) | |
6829 | constructor_range_stack = range_stack; | |
6830 | continue; | |
6831 | } | |
de520661 | 6832 | |
de520661 | 6833 | break; |
fe67cf58 | 6834 | } |
8b6a5902 JJ |
6835 | |
6836 | constructor_range_stack = 0; | |
400fbf9f JW |
6837 | } |
6838 | \f | |
15b732b2 NB |
6839 | /* Build a simple asm-statement, from one string literal. */ |
6840 | tree | |
a23c9413 NB |
6841 | simple_asm_stmt (expr) |
6842 | tree expr; | |
15b732b2 | 6843 | { |
a23c9413 NB |
6844 | STRIP_NOPS (expr); |
6845 | ||
6846 | if (TREE_CODE (expr) == ADDR_EXPR) | |
6847 | expr = TREE_OPERAND (expr, 0); | |
15b732b2 | 6848 | |
a23c9413 NB |
6849 | if (TREE_CODE (expr) == STRING_CST) |
6850 | { | |
6851 | tree stmt; | |
6852 | ||
a23c9413 NB |
6853 | stmt = add_stmt (build_stmt (ASM_STMT, NULL_TREE, expr, |
6854 | NULL_TREE, NULL_TREE, | |
6855 | NULL_TREE)); | |
6856 | ASM_INPUT_P (stmt) = 1; | |
6857 | return stmt; | |
6858 | } | |
6859 | ||
6860 | error ("argument of `asm' is not a constant string"); | |
6861 | return NULL_TREE; | |
15b732b2 NB |
6862 | } |
6863 | ||
64094f6a RH |
6864 | /* Build an asm-statement, whose components are a CV_QUALIFIER, a |
6865 | STRING, some OUTPUTS, some INPUTS, and some CLOBBERS. */ | |
400fbf9f | 6866 | |
64094f6a RH |
6867 | tree |
6868 | build_asm_stmt (cv_qualifier, string, outputs, inputs, clobbers) | |
6869 | tree cv_qualifier; | |
6870 | tree string; | |
6871 | tree outputs; | |
6872 | tree inputs; | |
6873 | tree clobbers; | |
400fbf9f | 6874 | { |
64094f6a | 6875 | tree tail; |
400fbf9f | 6876 | |
a23c9413 NB |
6877 | if (TREE_CODE (string) != STRING_CST) |
6878 | { | |
6879 | error ("asm template is not a string constant"); | |
6880 | return NULL_TREE; | |
6881 | } | |
6882 | ||
64094f6a RH |
6883 | if (cv_qualifier != NULL_TREE |
6884 | && cv_qualifier != ridpointers[(int) RID_VOLATILE]) | |
6885 | { | |
6886 | warning ("%s qualifier ignored on asm", | |
6887 | IDENTIFIER_POINTER (cv_qualifier)); | |
6888 | cv_qualifier = NULL_TREE; | |
6889 | } | |
6890 | ||
6891 | /* We can remove output conversions that change the type, | |
6892 | but not the mode. */ | |
6893 | for (tail = outputs; tail; tail = TREE_CHAIN (tail)) | |
c5c76735 JL |
6894 | { |
6895 | tree output = TREE_VALUE (tail); | |
6896 | ||
c5c76735 | 6897 | STRIP_NOPS (output); |
64094f6a | 6898 | TREE_VALUE (tail) = output; |
c5c76735 JL |
6899 | |
6900 | /* Allow conversions as LHS here. build_modify_expr as called below | |
6901 | will do the right thing with them. */ | |
6902 | while (TREE_CODE (output) == NOP_EXPR | |
6903 | || TREE_CODE (output) == CONVERT_EXPR | |
6904 | || TREE_CODE (output) == FLOAT_EXPR | |
6905 | || TREE_CODE (output) == FIX_TRUNC_EXPR | |
6906 | || TREE_CODE (output) == FIX_FLOOR_EXPR | |
6907 | || TREE_CODE (output) == FIX_ROUND_EXPR | |
6908 | || TREE_CODE (output) == FIX_CEIL_EXPR) | |
1bef1e7c | 6909 | output = TREE_OPERAND (output, 0); |
c5c76735 | 6910 | |
64094f6a RH |
6911 | lvalue_or_else (TREE_VALUE (tail), "invalid lvalue in asm statement"); |
6912 | } | |
6913 | ||
6914 | /* Remove output conversions that change the type but not the mode. */ | |
6915 | for (tail = outputs; tail; tail = TREE_CHAIN (tail)) | |
6916 | { | |
6917 | tree output = TREE_VALUE (tail); | |
6918 | STRIP_NOPS (output); | |
6919 | TREE_VALUE (tail) = output; | |
c5c76735 | 6920 | } |
400fbf9f | 6921 | |
64094f6a RH |
6922 | /* Perform default conversions on array and function inputs. |
6923 | Don't do this for other types as it would screw up operands | |
6924 | expected to be in memory. */ | |
6925 | for (tail = inputs; tail; tail = TREE_CHAIN (tail)) | |
207bf485 | 6926 | TREE_VALUE (tail) = default_function_array_conversion (TREE_VALUE (tail)); |
400fbf9f | 6927 | |
64094f6a RH |
6928 | return add_stmt (build_stmt (ASM_STMT, cv_qualifier, string, |
6929 | outputs, inputs, clobbers)); | |
6930 | } | |
6931 | ||
6932 | /* Expand an ASM statement with operands, handling output operands | |
6933 | that are not variables or INDIRECT_REFS by transforming such | |
6934 | cases into cases that expand_asm_operands can handle. | |
6935 | ||
6936 | Arguments are same as for expand_asm_operands. */ | |
6937 | ||
6938 | void | |
6939 | c_expand_asm_operands (string, outputs, inputs, clobbers, vol, filename, line) | |
6940 | tree string, outputs, inputs, clobbers; | |
6941 | int vol; | |
6942 | const char *filename; | |
6943 | int line; | |
6944 | { | |
6945 | int noutputs = list_length (outputs); | |
b3694847 | 6946 | int i; |
64094f6a | 6947 | /* o[I] is the place that output number I should be written. */ |
b3694847 SS |
6948 | tree *o = (tree *) alloca (noutputs * sizeof (tree)); |
6949 | tree tail; | |
64094f6a RH |
6950 | |
6951 | /* Record the contents of OUTPUTS before it is modified. */ | |
6952 | for (i = 0, tail = outputs; tail; tail = TREE_CHAIN (tail), i++) | |
6953 | o[i] = TREE_VALUE (tail); | |
8f17b5c5 | 6954 | |
64094f6a RH |
6955 | /* Generate the ASM_OPERANDS insn; store into the TREE_VALUEs of |
6956 | OUTPUTS some trees for where the values were actually stored. */ | |
400fbf9f JW |
6957 | expand_asm_operands (string, outputs, inputs, clobbers, vol, filename, line); |
6958 | ||
6959 | /* Copy all the intermediate outputs into the specified outputs. */ | |
6960 | for (i = 0, tail = outputs; tail; tail = TREE_CHAIN (tail), i++) | |
6961 | { | |
6962 | if (o[i] != TREE_VALUE (tail)) | |
6963 | { | |
6964 | expand_expr (build_modify_expr (o[i], NOP_EXPR, TREE_VALUE (tail)), | |
f5a8bfff | 6965 | NULL_RTX, VOIDmode, EXPAND_NORMAL); |
400fbf9f | 6966 | free_temp_slots (); |
39b726dd RH |
6967 | |
6968 | /* Restore the original value so that it's correct the next | |
6969 | time we expand this function. */ | |
6970 | TREE_VALUE (tail) = o[i]; | |
400fbf9f JW |
6971 | } |
6972 | /* Detect modification of read-only values. | |
6973 | (Otherwise done by build_modify_expr.) */ | |
6974 | else | |
6975 | { | |
6976 | tree type = TREE_TYPE (o[i]); | |
a43ea319 RK |
6977 | if (TREE_READONLY (o[i]) |
6978 | || TYPE_READONLY (type) | |
400fbf9f JW |
6979 | || ((TREE_CODE (type) == RECORD_TYPE |
6980 | || TREE_CODE (type) == UNION_TYPE) | |
6981 | && C_TYPE_FIELDS_READONLY (type))) | |
6982 | readonly_warning (o[i], "modification by `asm'"); | |
6983 | } | |
6984 | } | |
6985 | ||
6986 | /* Those MODIFY_EXPRs could do autoincrements. */ | |
6987 | emit_queue (); | |
6988 | } | |
6989 | \f | |
6990 | /* Expand a C `return' statement. | |
6991 | RETVAL is the expression for what to return, | |
6992 | or a null pointer for `return;' with no value. */ | |
6993 | ||
64094f6a | 6994 | tree |
400fbf9f JW |
6995 | c_expand_return (retval) |
6996 | tree retval; | |
6997 | { | |
6998 | tree valtype = TREE_TYPE (TREE_TYPE (current_function_decl)); | |
6999 | ||
7000 | if (TREE_THIS_VOLATILE (current_function_decl)) | |
08bf538e | 7001 | warning ("function declared `noreturn' has a `return' statement"); |
400fbf9f JW |
7002 | |
7003 | if (!retval) | |
7004 | { | |
7005 | current_function_returns_null = 1; | |
903f51d9 RH |
7006 | if ((warn_return_type || flag_isoc99) |
7007 | && valtype != 0 && TREE_CODE (valtype) != VOID_TYPE) | |
7008 | pedwarn_c99 ("`return' with no value, in function returning non-void"); | |
400fbf9f JW |
7009 | } |
7010 | else if (valtype == 0 || TREE_CODE (valtype) == VOID_TYPE) | |
7011 | { | |
7012 | current_function_returns_null = 1; | |
7013 | if (pedantic || TREE_CODE (TREE_TYPE (retval)) != VOID_TYPE) | |
7014 | pedwarn ("`return' with a value, in function returning void"); | |
400fbf9f JW |
7015 | } |
7016 | else | |
7017 | { | |
ab87f8c8 | 7018 | tree t = convert_for_assignment (valtype, retval, _("return"), |
9b7267b8 | 7019 | NULL_TREE, NULL_TREE, 0); |
400fbf9f | 7020 | tree res = DECL_RESULT (current_function_decl); |
88a3dbc1 | 7021 | tree inner; |
70768eda | 7022 | |
5ce89b2e | 7023 | current_function_returns_value = 1; |
70768eda | 7024 | if (t == error_mark_node) |
64094f6a | 7025 | return NULL_TREE; |
70768eda | 7026 | |
88a3dbc1 RK |
7027 | inner = t = convert (TREE_TYPE (res), t); |
7028 | ||
7029 | /* Strip any conversions, additions, and subtractions, and see if | |
7030 | we are returning the address of a local variable. Warn if so. */ | |
abe80e6d | 7031 | while (1) |
88a3dbc1 | 7032 | { |
abe80e6d RK |
7033 | switch (TREE_CODE (inner)) |
7034 | { | |
7035 | case NOP_EXPR: case NON_LVALUE_EXPR: case CONVERT_EXPR: | |
7036 | case PLUS_EXPR: | |
7037 | inner = TREE_OPERAND (inner, 0); | |
7038 | continue; | |
7039 | ||
7040 | case MINUS_EXPR: | |
7041 | /* If the second operand of the MINUS_EXPR has a pointer | |
7042 | type (or is converted from it), this may be valid, so | |
7043 | don't give a warning. */ | |
7044 | { | |
7045 | tree op1 = TREE_OPERAND (inner, 1); | |
7046 | ||
7047 | while (! POINTER_TYPE_P (TREE_TYPE (op1)) | |
7048 | && (TREE_CODE (op1) == NOP_EXPR | |
7049 | || TREE_CODE (op1) == NON_LVALUE_EXPR | |
7050 | || TREE_CODE (op1) == CONVERT_EXPR)) | |
7051 | op1 = TREE_OPERAND (op1, 0); | |
7052 | ||
7053 | if (POINTER_TYPE_P (TREE_TYPE (op1))) | |
7054 | break; | |
88a3dbc1 | 7055 | |
abe80e6d RK |
7056 | inner = TREE_OPERAND (inner, 0); |
7057 | continue; | |
7058 | } | |
7059 | ||
7060 | case ADDR_EXPR: | |
7061 | inner = TREE_OPERAND (inner, 0); | |
88a3dbc1 | 7062 | |
abe80e6d RK |
7063 | while (TREE_CODE_CLASS (TREE_CODE (inner)) == 'r') |
7064 | inner = TREE_OPERAND (inner, 0); | |
7065 | ||
7066 | if (TREE_CODE (inner) == VAR_DECL | |
7067 | && ! DECL_EXTERNAL (inner) | |
7068 | && ! TREE_STATIC (inner) | |
7069 | && DECL_CONTEXT (inner) == current_function_decl) | |
7070 | warning ("function returns address of local variable"); | |
7071 | break; | |
e9a25f70 JL |
7072 | |
7073 | default: | |
7074 | break; | |
abe80e6d RK |
7075 | } |
7076 | ||
7077 | break; | |
88a3dbc1 RK |
7078 | } |
7079 | ||
56cb9733 | 7080 | retval = build (MODIFY_EXPR, TREE_TYPE (res), res, t); |
400fbf9f | 7081 | } |
56cb9733 | 7082 | |
64094f6a | 7083 | return add_stmt (build_return_stmt (retval)); |
400fbf9f JW |
7084 | } |
7085 | \f | |
8f17b5c5 MM |
7086 | struct c_switch { |
7087 | /* The SWITCH_STMT being built. */ | |
7088 | tree switch_stmt; | |
7089 | /* A splay-tree mapping the low element of a case range to the high | |
7090 | element, or NULL_TREE if there is no high element. Used to | |
7091 | determine whether or not a new case label duplicates an old case | |
7092 | label. We need a tree, rather than simply a hash table, because | |
7093 | of the GNU case range extension. */ | |
7094 | splay_tree cases; | |
7095 | /* The next node on the stack. */ | |
7096 | struct c_switch *next; | |
7097 | }; | |
7098 | ||
7099 | /* A stack of the currently active switch statements. The innermost | |
7100 | switch statement is on the top of the stack. There is no need to | |
7101 | mark the stack for garbage collection because it is only active | |
7102 | during the processing of the body of a function, and we never | |
7103 | collect at that point. */ | |
7104 | ||
7105 | static struct c_switch *switch_stack; | |
7106 | ||
7107 | /* Start a C switch statement, testing expression EXP. Return the new | |
7108 | SWITCH_STMT. */ | |
400fbf9f JW |
7109 | |
7110 | tree | |
8f17b5c5 | 7111 | c_start_case (exp) |
400fbf9f JW |
7112 | tree exp; |
7113 | { | |
b3694847 | 7114 | enum tree_code code; |
6f9fdf4d | 7115 | tree type, orig_type = error_mark_node; |
8f17b5c5 | 7116 | struct c_switch *cs; |
e89a9554 | 7117 | |
8f17b5c5 MM |
7118 | if (exp != error_mark_node) |
7119 | { | |
7120 | code = TREE_CODE (TREE_TYPE (exp)); | |
6f9fdf4d | 7121 | orig_type = TREE_TYPE (exp); |
e89a9554 | 7122 | |
6f9fdf4d | 7123 | if (! INTEGRAL_TYPE_P (orig_type) |
8f17b5c5 MM |
7124 | && code != ERROR_MARK) |
7125 | { | |
7126 | error ("switch quantity not an integer"); | |
7127 | exp = integer_zero_node; | |
7128 | } | |
7129 | else | |
7130 | { | |
8f17b5c5 | 7131 | type = TYPE_MAIN_VARIANT (TREE_TYPE (exp)); |
400fbf9f | 7132 | |
8f17b5c5 MM |
7133 | if (warn_traditional && !in_system_header |
7134 | && (type == long_integer_type_node | |
7135 | || type == long_unsigned_type_node)) | |
7136 | warning ("`long' switch expression not converted to `int' in ISO C"); | |
7137 | ||
7138 | exp = default_conversion (exp); | |
7139 | type = TREE_TYPE (exp); | |
8f17b5c5 | 7140 | } |
400fbf9f | 7141 | } |
8f17b5c5 MM |
7142 | |
7143 | /* Add this new SWITCH_STMT to the stack. */ | |
2ac86f90 | 7144 | cs = (struct c_switch *) xmalloc (sizeof (*cs)); |
6f9fdf4d | 7145 | cs->switch_stmt = build_stmt (SWITCH_STMT, exp, NULL_TREE, orig_type); |
8f17b5c5 MM |
7146 | cs->cases = splay_tree_new (case_compare, NULL, NULL); |
7147 | cs->next = switch_stack; | |
7148 | switch_stack = cs; | |
7149 | ||
7150 | return add_stmt (switch_stack->switch_stmt); | |
7151 | } | |
7152 | ||
7153 | /* Process a case label. */ | |
7154 | ||
64094f6a | 7155 | tree |
8f17b5c5 MM |
7156 | do_case (low_value, high_value) |
7157 | tree low_value; | |
7158 | tree high_value; | |
7159 | { | |
64094f6a RH |
7160 | tree label = NULL_TREE; |
7161 | ||
8f17b5c5 | 7162 | if (switch_stack) |
64094f6a RH |
7163 | { |
7164 | label = c_add_case_label (switch_stack->cases, | |
7165 | SWITCH_COND (switch_stack->switch_stmt), | |
7166 | low_value, high_value); | |
7167 | if (label == error_mark_node) | |
7168 | label = NULL_TREE; | |
7169 | } | |
8f17b5c5 MM |
7170 | else if (low_value) |
7171 | error ("case label not within a switch statement"); | |
400fbf9f | 7172 | else |
8f17b5c5 | 7173 | error ("`default' label not within a switch statement"); |
64094f6a RH |
7174 | |
7175 | return label; | |
8f17b5c5 | 7176 | } |
400fbf9f | 7177 | |
8f17b5c5 | 7178 | /* Finish the switch statement. */ |
400fbf9f | 7179 | |
8f17b5c5 MM |
7180 | void |
7181 | c_finish_case () | |
7182 | { | |
7183 | struct c_switch *cs = switch_stack; | |
400fbf9f | 7184 | |
8f17b5c5 | 7185 | RECHAIN_STMTS (cs->switch_stmt, SWITCH_BODY (cs->switch_stmt)); |
400fbf9f | 7186 | |
8f17b5c5 MM |
7187 | /* Pop the stack. */ |
7188 | switch_stack = switch_stack->next; | |
7189 | splay_tree_delete (cs->cases); | |
7190 | free (cs); | |
400fbf9f | 7191 | } |