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