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