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