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