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