]>
Commit | Line | Data |
---|---|---|
b0fc3e72 | 1 | /* Subroutines shared by all languages that are variants of C. |
d513ec2f | 2 | Copyright (C) 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000, |
2d9d8740 | 3 | 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009 |
4 | Free Software Foundation, Inc. | |
b0fc3e72 | 5 | |
f12b58b3 | 6 | This file is part of GCC. |
b0fc3e72 | 7 | |
f12b58b3 | 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 | |
8c4c00c1 | 10 | Software Foundation; either version 3, or (at your option) any later |
f12b58b3 | 11 | version. |
b0fc3e72 | 12 | |
f12b58b3 | 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. | |
b0fc3e72 | 17 | |
18 | You should have received a copy of the GNU General Public License | |
8c4c00c1 | 19 | along with GCC; see the file COPYING3. If not see |
20 | <http://www.gnu.org/licenses/>. */ | |
b0fc3e72 | 21 | |
22 | #include "config.h" | |
405711de | 23 | #include "system.h" |
805e22b2 | 24 | #include "coretypes.h" |
25 | #include "tm.h" | |
e48d0f41 | 26 | #include "intl.h" |
b0fc3e72 | 27 | #include "tree.h" |
b0fc3e72 | 28 | #include "flags.h" |
cd03a192 | 29 | #include "output.h" |
a3fa7feb | 30 | #include "c-pragma.h" |
a5b1863e | 31 | #include "rtl.h" |
dc12af01 | 32 | #include "ggc.h" |
573aba85 | 33 | #include "varray.h" |
74647769 | 34 | #include "expr.h" |
e41f0d80 | 35 | #include "c-common.h" |
d8c9779c | 36 | #include "tm_p.h" |
4e91a871 | 37 | #include "obstack.h" |
a654e028 | 38 | #include "cpplib.h" |
8ee295a7 | 39 | #include "target.h" |
96554925 | 40 | #include "langhooks.h" |
f3dde807 | 41 | #include "tree-inline.h" |
7acb29a3 | 42 | #include "c-tree.h" |
69579044 | 43 | #include "toplev.h" |
7f5f3953 | 44 | #include "diagnostic.h" |
4ee9c684 | 45 | #include "tree-iterator.h" |
46 | #include "hashtab.h" | |
b55af61c | 47 | #include "tree-mudflap.h" |
e08bd2f4 | 48 | #include "opts.h" |
5000e21c | 49 | #include "real.h" |
62eec3b4 | 50 | #include "cgraph.h" |
b9fc964a | 51 | #include "target-def.h" |
75a70cf9 | 52 | #include "gimple.h" |
9421ebb9 | 53 | #include "fixed-value.h" |
979d3efc | 54 | #include "libfuncs.h" |
fd6f6435 | 55 | |
90cc7820 | 56 | cpp_reader *parse_in; /* Declared in c-pragma.h. */ |
a654e028 | 57 | |
174fcc61 | 58 | /* We let tm.h override the types used here, to handle trivial differences |
59 | such as the choice of unsigned int or long unsigned int for size_t. | |
60 | When machines start needing nontrivial differences in the size type, | |
61 | it would be best to do something here to figure out automatically | |
62 | from other information what type to use. */ | |
63 | ||
64 | #ifndef SIZE_TYPE | |
65 | #define SIZE_TYPE "long unsigned int" | |
66 | #endif | |
67 | ||
73673831 | 68 | #ifndef PID_TYPE |
69 | #define PID_TYPE "int" | |
70 | #endif | |
71 | ||
f3449a3c | 72 | /* If GCC knows the exact uint_least16_t and uint_least32_t types from |
73 | <stdint.h>, use them for char16_t and char32_t. Otherwise, use | |
74 | these guesses; getting the wrong type of a given width will not | |
75 | affect C++ name mangling because in C++ these are distinct types | |
76 | not typedefs. */ | |
77 | ||
78 | #ifdef UINT_LEAST16_TYPE | |
79 | #define CHAR16_TYPE UINT_LEAST16_TYPE | |
80 | #else | |
924bbf02 | 81 | #define CHAR16_TYPE "short unsigned int" |
82 | #endif | |
83 | ||
f3449a3c | 84 | #ifdef UINT_LEAST32_TYPE |
85 | #define CHAR32_TYPE UINT_LEAST32_TYPE | |
86 | #else | |
924bbf02 | 87 | #define CHAR32_TYPE "unsigned int" |
88 | #endif | |
89 | ||
174fcc61 | 90 | #ifndef WCHAR_TYPE |
91 | #define WCHAR_TYPE "int" | |
92 | #endif | |
93 | ||
18ef7ac2 | 94 | /* WCHAR_TYPE gets overridden by -fshort-wchar. */ |
95 | #define MODIFIED_WCHAR_TYPE \ | |
96 | (flag_short_wchar ? "short unsigned int" : WCHAR_TYPE) | |
97 | ||
194c4d9f | 98 | #ifndef PTRDIFF_TYPE |
99 | #define PTRDIFF_TYPE "long int" | |
100 | #endif | |
101 | ||
6bf5ed8d | 102 | #ifndef WINT_TYPE |
103 | #define WINT_TYPE "unsigned int" | |
104 | #endif | |
105 | ||
106 | #ifndef INTMAX_TYPE | |
107 | #define INTMAX_TYPE ((INT_TYPE_SIZE == LONG_LONG_TYPE_SIZE) \ | |
108 | ? "int" \ | |
109 | : ((LONG_TYPE_SIZE == LONG_LONG_TYPE_SIZE) \ | |
110 | ? "long int" \ | |
111 | : "long long int")) | |
112 | #endif | |
113 | ||
114 | #ifndef UINTMAX_TYPE | |
115 | #define UINTMAX_TYPE ((INT_TYPE_SIZE == LONG_LONG_TYPE_SIZE) \ | |
116 | ? "unsigned int" \ | |
117 | : ((LONG_TYPE_SIZE == LONG_LONG_TYPE_SIZE) \ | |
118 | ? "long unsigned int" \ | |
119 | : "long long unsigned int")) | |
120 | #endif | |
121 | ||
f3449a3c | 122 | /* There are no default definitions of these <stdint.h> types. */ |
123 | ||
124 | #ifndef SIG_ATOMIC_TYPE | |
125 | #define SIG_ATOMIC_TYPE ((const char *) NULL) | |
126 | #endif | |
127 | ||
128 | #ifndef INT8_TYPE | |
129 | #define INT8_TYPE ((const char *) NULL) | |
130 | #endif | |
131 | ||
132 | #ifndef INT16_TYPE | |
133 | #define INT16_TYPE ((const char *) NULL) | |
134 | #endif | |
135 | ||
136 | #ifndef INT32_TYPE | |
137 | #define INT32_TYPE ((const char *) NULL) | |
138 | #endif | |
139 | ||
140 | #ifndef INT64_TYPE | |
141 | #define INT64_TYPE ((const char *) NULL) | |
142 | #endif | |
143 | ||
144 | #ifndef UINT8_TYPE | |
145 | #define UINT8_TYPE ((const char *) NULL) | |
146 | #endif | |
147 | ||
148 | #ifndef UINT16_TYPE | |
149 | #define UINT16_TYPE ((const char *) NULL) | |
150 | #endif | |
151 | ||
152 | #ifndef UINT32_TYPE | |
153 | #define UINT32_TYPE ((const char *) NULL) | |
154 | #endif | |
155 | ||
156 | #ifndef UINT64_TYPE | |
157 | #define UINT64_TYPE ((const char *) NULL) | |
158 | #endif | |
159 | ||
160 | #ifndef INT_LEAST8_TYPE | |
161 | #define INT_LEAST8_TYPE ((const char *) NULL) | |
162 | #endif | |
163 | ||
164 | #ifndef INT_LEAST16_TYPE | |
165 | #define INT_LEAST16_TYPE ((const char *) NULL) | |
166 | #endif | |
167 | ||
168 | #ifndef INT_LEAST32_TYPE | |
169 | #define INT_LEAST32_TYPE ((const char *) NULL) | |
170 | #endif | |
171 | ||
172 | #ifndef INT_LEAST64_TYPE | |
173 | #define INT_LEAST64_TYPE ((const char *) NULL) | |
174 | #endif | |
175 | ||
176 | #ifndef UINT_LEAST8_TYPE | |
177 | #define UINT_LEAST8_TYPE ((const char *) NULL) | |
178 | #endif | |
179 | ||
180 | #ifndef UINT_LEAST16_TYPE | |
181 | #define UINT_LEAST16_TYPE ((const char *) NULL) | |
182 | #endif | |
183 | ||
184 | #ifndef UINT_LEAST32_TYPE | |
185 | #define UINT_LEAST32_TYPE ((const char *) NULL) | |
186 | #endif | |
187 | ||
188 | #ifndef UINT_LEAST64_TYPE | |
189 | #define UINT_LEAST64_TYPE ((const char *) NULL) | |
190 | #endif | |
191 | ||
192 | #ifndef INT_FAST8_TYPE | |
193 | #define INT_FAST8_TYPE ((const char *) NULL) | |
194 | #endif | |
195 | ||
196 | #ifndef INT_FAST16_TYPE | |
197 | #define INT_FAST16_TYPE ((const char *) NULL) | |
198 | #endif | |
199 | ||
200 | #ifndef INT_FAST32_TYPE | |
201 | #define INT_FAST32_TYPE ((const char *) NULL) | |
202 | #endif | |
203 | ||
204 | #ifndef INT_FAST64_TYPE | |
205 | #define INT_FAST64_TYPE ((const char *) NULL) | |
206 | #endif | |
207 | ||
208 | #ifndef UINT_FAST8_TYPE | |
209 | #define UINT_FAST8_TYPE ((const char *) NULL) | |
210 | #endif | |
211 | ||
212 | #ifndef UINT_FAST16_TYPE | |
213 | #define UINT_FAST16_TYPE ((const char *) NULL) | |
214 | #endif | |
215 | ||
216 | #ifndef UINT_FAST32_TYPE | |
217 | #define UINT_FAST32_TYPE ((const char *) NULL) | |
218 | #endif | |
219 | ||
220 | #ifndef UINT_FAST64_TYPE | |
221 | #define UINT_FAST64_TYPE ((const char *) NULL) | |
222 | #endif | |
223 | ||
224 | #ifndef INTPTR_TYPE | |
225 | #define INTPTR_TYPE ((const char *) NULL) | |
226 | #endif | |
227 | ||
228 | #ifndef UINTPTR_TYPE | |
229 | #define UINTPTR_TYPE ((const char *) NULL) | |
230 | #endif | |
231 | ||
72040e7e | 232 | /* The following symbols are subsumed in the c_global_trees array, and |
44e9fa65 | 233 | listed here individually for documentation purposes. |
72040e7e | 234 | |
235 | INTEGER_TYPE and REAL_TYPE nodes for the standard data types. | |
236 | ||
237 | tree short_integer_type_node; | |
238 | tree long_integer_type_node; | |
239 | tree long_long_integer_type_node; | |
240 | ||
241 | tree short_unsigned_type_node; | |
242 | tree long_unsigned_type_node; | |
243 | tree long_long_unsigned_type_node; | |
244 | ||
3c2239cf | 245 | tree truthvalue_type_node; |
246 | tree truthvalue_false_node; | |
247 | tree truthvalue_true_node; | |
72040e7e | 248 | |
249 | tree ptrdiff_type_node; | |
250 | ||
251 | tree unsigned_char_type_node; | |
252 | tree signed_char_type_node; | |
253 | tree wchar_type_node; | |
72040e7e | 254 | |
924bbf02 | 255 | tree char16_type_node; |
256 | tree char32_type_node; | |
257 | ||
72040e7e | 258 | tree float_type_node; |
259 | tree double_type_node; | |
260 | tree long_double_type_node; | |
261 | ||
262 | tree complex_integer_type_node; | |
263 | tree complex_float_type_node; | |
264 | tree complex_double_type_node; | |
265 | tree complex_long_double_type_node; | |
266 | ||
c4503c0a | 267 | tree dfloat32_type_node; |
268 | tree dfloat64_type_node; | |
269 | tree_dfloat128_type_node; | |
270 | ||
72040e7e | 271 | tree intQI_type_node; |
272 | tree intHI_type_node; | |
273 | tree intSI_type_node; | |
274 | tree intDI_type_node; | |
275 | tree intTI_type_node; | |
276 | ||
277 | tree unsigned_intQI_type_node; | |
278 | tree unsigned_intHI_type_node; | |
279 | tree unsigned_intSI_type_node; | |
280 | tree unsigned_intDI_type_node; | |
281 | tree unsigned_intTI_type_node; | |
282 | ||
283 | tree widest_integer_literal_type_node; | |
284 | tree widest_unsigned_literal_type_node; | |
285 | ||
286 | Nodes for types `void *' and `const void *'. | |
287 | ||
288 | tree ptr_type_node, const_ptr_type_node; | |
289 | ||
290 | Nodes for types `char *' and `const char *'. | |
291 | ||
292 | tree string_type_node, const_string_type_node; | |
293 | ||
294 | Type `char[SOMENUMBER]'. | |
295 | Used when an array of char is needed and the size is irrelevant. | |
296 | ||
297 | tree char_array_type_node; | |
298 | ||
299 | Type `int[SOMENUMBER]' or something like it. | |
300 | Used when an array of int needed and the size is irrelevant. | |
301 | ||
302 | tree int_array_type_node; | |
303 | ||
304 | Type `wchar_t[SOMENUMBER]' or something like it. | |
305 | Used when a wide string literal is created. | |
306 | ||
307 | tree wchar_array_type_node; | |
308 | ||
924bbf02 | 309 | Type `char16_t[SOMENUMBER]' or something like it. |
310 | Used when a UTF-16 string literal is created. | |
311 | ||
312 | tree char16_array_type_node; | |
313 | ||
314 | Type `char32_t[SOMENUMBER]' or something like it. | |
315 | Used when a UTF-32 string literal is created. | |
316 | ||
317 | tree char32_array_type_node; | |
318 | ||
72040e7e | 319 | Type `int ()' -- used for implicit declaration of functions. |
320 | ||
321 | tree default_function_type; | |
322 | ||
72040e7e | 323 | A VOID_TYPE node, packaged in a TREE_LIST. |
324 | ||
325 | tree void_list_node; | |
326 | ||
734c98be | 327 | The lazily created VAR_DECLs for __FUNCTION__, __PRETTY_FUNCTION__, |
65b7f83f | 328 | and __func__. (C doesn't generate __FUNCTION__ and__PRETTY_FUNCTION__ |
329 | VAR_DECLS, but C++ does.) | |
71d9fc9b | 330 | |
65b7f83f | 331 | tree function_name_decl_node; |
734c98be | 332 | tree pretty_function_name_decl_node; |
65b7f83f | 333 | tree c99_function_name_decl_node; |
334 | ||
335 | Stack of nested function name VAR_DECLs. | |
1cae46be | 336 | |
65b7f83f | 337 | tree saved_function_name_decls; |
71d9fc9b | 338 | |
72040e7e | 339 | */ |
340 | ||
341 | tree c_global_trees[CTI_MAX]; | |
573aba85 | 342 | \f |
574a6990 | 343 | /* Switches common to the C front ends. */ |
344 | ||
f0b5f617 | 345 | /* Nonzero if preprocessing only. */ |
f7070933 | 346 | |
ffd56b21 | 347 | int flag_preprocess_only; |
348 | ||
f7070933 | 349 | /* Nonzero means don't output line number information. */ |
350 | ||
351 | char flag_no_line_commands; | |
352 | ||
353 | /* Nonzero causes -E output not to be done, but directives such as | |
354 | #define that have side effects are still obeyed. */ | |
355 | ||
356 | char flag_no_output; | |
357 | ||
358 | /* Nonzero means dump macros in some fashion. */ | |
359 | ||
360 | char flag_dump_macros; | |
361 | ||
362 | /* Nonzero means pass #include lines through to the output. */ | |
363 | ||
364 | char flag_dump_includes; | |
365 | ||
d718b525 | 366 | /* Nonzero means process PCH files while preprocessing. */ |
367 | ||
368 | bool flag_pch_preprocess; | |
369 | ||
573aba85 | 370 | /* The file name to which we should write a precompiled header, or |
371 | NULL if no header will be written in this compile. */ | |
372 | ||
373 | const char *pch_file; | |
374 | ||
1ed9d5f5 | 375 | /* Nonzero if an ISO standard was selected. It rejects macros in the |
376 | user's namespace. */ | |
377 | int flag_iso; | |
378 | ||
379 | /* Nonzero if -undef was given. It suppresses target built-in macros | |
380 | and assertions. */ | |
381 | int flag_undef; | |
382 | ||
0270ae90 | 383 | /* Nonzero means don't recognize the non-ANSI builtin functions. */ |
384 | ||
385 | int flag_no_builtin; | |
386 | ||
387 | /* Nonzero means don't recognize the non-ANSI builtin functions. | |
388 | -ansi sets this. */ | |
389 | ||
390 | int flag_no_nonansi_builtin; | |
391 | ||
174fcc61 | 392 | /* Nonzero means give `double' the same size as `float'. */ |
393 | ||
394 | int flag_short_double; | |
395 | ||
396 | /* Nonzero means give `wchar_t' the same size as `short'. */ | |
397 | ||
398 | int flag_short_wchar; | |
399 | ||
546c4794 | 400 | /* Nonzero means allow implicit conversions between vectors with |
401 | differing numbers of subparts and/or differing element types. */ | |
402 | int flag_lax_vector_conversions; | |
403 | ||
07ebd091 | 404 | /* Nonzero means allow Microsoft extensions without warnings or errors. */ |
405 | int flag_ms_extensions; | |
406 | ||
574a6990 | 407 | /* Nonzero means don't recognize the keyword `asm'. */ |
408 | ||
409 | int flag_no_asm; | |
410 | ||
574a6990 | 411 | /* Nonzero means to treat bitfields as signed unless they say `unsigned'. */ |
412 | ||
413 | int flag_signed_bitfields = 1; | |
574a6990 | 414 | |
1cae46be | 415 | /* Warn about #pragma directives that are not recognized. */ |
574a6990 | 416 | |
1cae46be | 417 | int warn_unknown_pragmas; /* Tri state variable. */ |
574a6990 | 418 | |
574a6990 | 419 | /* Warn about format/argument anomalies in calls to formatted I/O functions |
420 | (*printf, *scanf, strftime, strfmon, etc.). */ | |
421 | ||
422 | int warn_format; | |
423 | ||
ae84079f | 424 | /* Warn about using __null (as NULL in C++) as sentinel. For code compiled |
425 | with GCC this doesn't matter as __null is guaranteed to have the right | |
426 | size. */ | |
427 | ||
428 | int warn_strict_null_sentinel; | |
429 | ||
c17b85ea | 430 | /* Zero means that faster, ...NonNil variants of objc_msgSend... |
431 | calls will be used in ObjC; passing nil receivers to such calls | |
432 | will most likely result in crashes. */ | |
433 | int flag_nil_receivers = 1; | |
434 | ||
c17b85ea | 435 | /* Nonzero means that code generation will be altered to support |
436 | "zero-link" execution. This currently affects ObjC only, but may | |
437 | affect other languages in the future. */ | |
438 | int flag_zero_link = 0; | |
439 | ||
440 | /* Nonzero means emit an '__OBJC, __image_info' for the current translation | |
441 | unit. It will inform the ObjC runtime that class definition(s) herein | |
442 | contained are to replace one(s) previously loaded. */ | |
443 | int flag_replace_objc_classes = 0; | |
b27ac6b5 | 444 | |
574a6990 | 445 | /* C/ObjC language option variables. */ |
446 | ||
447 | ||
574a6990 | 448 | /* Nonzero means allow type mismatches in conditional expressions; |
449 | just make their values `void'. */ | |
450 | ||
451 | int flag_cond_mismatch; | |
452 | ||
453 | /* Nonzero means enable C89 Amendment 1 features. */ | |
454 | ||
455 | int flag_isoc94; | |
456 | ||
457 | /* Nonzero means use the ISO C99 dialect of C. */ | |
458 | ||
459 | int flag_isoc99; | |
460 | ||
8b332087 | 461 | /* Nonzero means that we have builtin functions, and main is an int. */ |
574a6990 | 462 | |
463 | int flag_hosted = 1; | |
464 | ||
574a6990 | 465 | |
466 | /* ObjC language option variables. */ | |
467 | ||
468 | ||
469 | /* Open and close the file for outputting class declarations, if | |
470 | requested (ObjC). */ | |
471 | ||
472 | int flag_gen_declaration; | |
473 | ||
574a6990 | 474 | /* Tells the compiler that this is a special run. Do not perform any |
475 | compiling, instead we are to test some platform dependent features | |
476 | and output a C header file with appropriate definitions. */ | |
477 | ||
478 | int print_struct_values; | |
479 | ||
f0b5f617 | 480 | /* Tells the compiler what is the constant string class for ObjC. */ |
574a6990 | 481 | |
482 | const char *constant_string_class_name; | |
483 | ||
574a6990 | 484 | |
485 | /* C++ language option variables. */ | |
486 | ||
487 | ||
488 | /* Nonzero means don't recognize any extension keywords. */ | |
489 | ||
490 | int flag_no_gnu_keywords; | |
491 | ||
492 | /* Nonzero means do emit exported implementations of functions even if | |
493 | they can be inlined. */ | |
494 | ||
495 | int flag_implement_inlines = 1; | |
496 | ||
574a6990 | 497 | /* Nonzero means that implicit instantiations will be emitted if needed. */ |
498 | ||
499 | int flag_implicit_templates = 1; | |
500 | ||
501 | /* Nonzero means that implicit instantiations of inline templates will be | |
502 | emitted if needed, even if instantiations of non-inline templates | |
503 | aren't. */ | |
504 | ||
505 | int flag_implicit_inline_templates = 1; | |
506 | ||
507 | /* Nonzero means generate separate instantiation control files and | |
508 | juggle them at link time. */ | |
509 | ||
510 | int flag_use_repository; | |
511 | ||
512 | /* Nonzero if we want to issue diagnostics that the standard says are not | |
513 | required. */ | |
514 | ||
515 | int flag_optional_diags = 1; | |
516 | ||
517 | /* Nonzero means we should attempt to elide constructors when possible. */ | |
518 | ||
519 | int flag_elide_constructors = 1; | |
520 | ||
521 | /* Nonzero means that member functions defined in class scope are | |
522 | inline by default. */ | |
523 | ||
524 | int flag_default_inline = 1; | |
525 | ||
526 | /* Controls whether compiler generates 'type descriptor' that give | |
527 | run-time type information. */ | |
528 | ||
529 | int flag_rtti = 1; | |
530 | ||
531 | /* Nonzero if we want to conserve space in the .o files. We do this | |
532 | by putting uninitialized data and runtime initialized data into | |
533 | .common instead of .data at the expense of not flagging multiple | |
534 | definitions. */ | |
535 | ||
536 | int flag_conserve_space; | |
537 | ||
538 | /* Nonzero if we want to obey access control semantics. */ | |
539 | ||
540 | int flag_access_control = 1; | |
541 | ||
542 | /* Nonzero if we want to check the return value of new and avoid calling | |
543 | constructors if it is a null pointer. */ | |
544 | ||
545 | int flag_check_new; | |
546 | ||
6dcdb5de | 547 | /* The C++ dialect being used. C++98 is the default. */ |
0fe6eeac | 548 | |
6dcdb5de | 549 | enum cxx_dialect cxx_dialect = cxx98; |
0fe6eeac | 550 | |
574a6990 | 551 | /* Nonzero if we want the new ISO rules for pushing a new scope for `for' |
552 | initialization variables. | |
553 | 0: Old rules, set by -fno-for-scope. | |
554 | 2: New ISO rules, set by -ffor-scope. | |
555 | 1: Try to implement new ISO rules, but with backup compatibility | |
556 | (and warnings). This is the default, for now. */ | |
557 | ||
558 | int flag_new_for_scope = 1; | |
559 | ||
560 | /* Nonzero if we want to emit defined symbols with common-like linkage as | |
561 | weak symbols where possible, in order to conform to C++ semantics. | |
562 | Otherwise, emit them as local symbols. */ | |
563 | ||
564 | int flag_weak = 1; | |
565 | ||
e7aa92b2 | 566 | /* 0 means we want the preprocessor to not emit line directives for |
567 | the current working directory. 1 means we want it to do it. -1 | |
568 | means we should decide depending on whether debugging information | |
569 | is being emitted or not. */ | |
570 | ||
571 | int flag_working_directory = -1; | |
572 | ||
574a6990 | 573 | /* Nonzero to use __cxa_atexit, rather than atexit, to register |
3bf418bd | 574 | destructors for local statics and global objects. '2' means it has been |
575 | set nonzero as a default, not by a command-line flag. */ | |
574a6990 | 576 | |
577 | int flag_use_cxa_atexit = DEFAULT_USE_CXA_ATEXIT; | |
578 | ||
3bf418bd | 579 | /* Nonzero to use __cxa_get_exception_ptr in C++ exception-handling |
580 | code. '2' means it has not been set explicitly on the command line. */ | |
581 | ||
582 | int flag_use_cxa_get_exception_ptr = 2; | |
583 | ||
574a6990 | 584 | /* Nonzero means to implement standard semantics for exception |
585 | specifications, calling unexpected if an exception is thrown that | |
586 | doesn't match the specification. Zero means to treat them as | |
587 | assertions and optimize accordingly, but not check them. */ | |
588 | ||
589 | int flag_enforce_eh_specs = 1; | |
590 | ||
4813f5af | 591 | /* Nonzero means to generate thread-safe code for initializing local |
592 | statics. */ | |
593 | ||
594 | int flag_threadsafe_statics = 1; | |
595 | ||
fc8ee10c | 596 | /* Nonzero if we want to pretty-print template specializations as the |
597 | template signature followed by the arguments. */ | |
598 | ||
599 | int flag_pretty_templates = 1; | |
600 | ||
574a6990 | 601 | /* Nonzero means warn about implicit declarations. */ |
602 | ||
603 | int warn_implicit = 1; | |
604 | ||
574a6990 | 605 | /* Maximum template instantiation depth. This limit is rather |
606 | arbitrary, but it exists to limit the time it takes to notice | |
607 | infinite template instantiations. */ | |
608 | ||
609 | int max_tinst_depth = 500; | |
610 | ||
611 | ||
612 | ||
988fc1d1 | 613 | /* The elements of `ridpointers' are identifier nodes for the reserved |
614 | type names and storage classes. It is indexed by a RID_... value. */ | |
615 | tree *ridpointers; | |
616 | ||
1cae46be | 617 | tree (*make_fname_decl) (tree, int); |
9e5a737d | 618 | |
e78703c1 | 619 | /* Nonzero means the expression being parsed will never be evaluated. |
620 | This is a count, since unevaluated expressions can nest. */ | |
621 | int skip_evaluation; | |
622 | ||
7f5f3953 | 623 | /* Whether lexing has been completed, so subsequent preprocessor |
624 | errors should use the compiler's input_location. */ | |
625 | bool done_lexing = false; | |
626 | ||
2c0e001b | 627 | /* Information about how a function name is generated. */ |
65b7f83f | 628 | struct fname_var_t |
629 | { | |
e99c3a1d | 630 | tree *const decl; /* pointer to the VAR_DECL. */ |
631 | const unsigned rid; /* RID number for the identifier. */ | |
632 | const int pretty; /* How pretty is it? */ | |
65b7f83f | 633 | }; |
634 | ||
2c0e001b | 635 | /* The three ways of getting then name of the current function. */ |
65b7f83f | 636 | |
637 | const struct fname_var_t fname_vars[] = | |
638 | { | |
2c0e001b | 639 | /* C99 compliant __func__, must be first. */ |
65b7f83f | 640 | {&c99_function_name_decl_node, RID_C99_FUNCTION_NAME, 0}, |
2c0e001b | 641 | /* GCC __FUNCTION__ compliant. */ |
65b7f83f | 642 | {&function_name_decl_node, RID_FUNCTION_NAME, 0}, |
2c0e001b | 643 | /* GCC __PRETTY_FUNCTION__ compliant. */ |
65b7f83f | 644 | {&pretty_function_name_decl_node, RID_PRETTY_FUNCTION_NAME, 1}, |
645 | {NULL, 0, 0}, | |
646 | }; | |
647 | ||
a75b1c71 | 648 | static tree c_fully_fold_internal (tree expr, bool, bool *, bool *); |
2ca392fd | 649 | static tree check_case_value (tree); |
650 | static bool check_case_bounds (tree, tree, tree *, tree *); | |
be43ff5a | 651 | |
1cae46be | 652 | static tree handle_packed_attribute (tree *, tree, tree, int, bool *); |
653 | static tree handle_nocommon_attribute (tree *, tree, tree, int, bool *); | |
654 | static tree handle_common_attribute (tree *, tree, tree, int, bool *); | |
655 | static tree handle_noreturn_attribute (tree *, tree, tree, int, bool *); | |
5de92639 | 656 | static tree handle_hot_attribute (tree *, tree, tree, int, bool *); |
657 | static tree handle_cold_attribute (tree *, tree, tree, int, bool *); | |
1cae46be | 658 | static tree handle_noinline_attribute (tree *, tree, tree, int, bool *); |
659 | static tree handle_always_inline_attribute (tree *, tree, tree, int, | |
660 | bool *); | |
1b16fc45 | 661 | static tree handle_gnu_inline_attribute (tree *, tree, tree, int, bool *); |
662 | static tree handle_artificial_attribute (tree *, tree, tree, int, bool *); | |
0cdd9887 | 663 | static tree handle_flatten_attribute (tree *, tree, tree, int, bool *); |
10fc867f | 664 | static tree handle_error_attribute (tree *, tree, tree, int, bool *); |
1cae46be | 665 | static tree handle_used_attribute (tree *, tree, tree, int, bool *); |
666 | static tree handle_unused_attribute (tree *, tree, tree, int, bool *); | |
62eec3b4 | 667 | static tree handle_externally_visible_attribute (tree *, tree, tree, int, |
668 | bool *); | |
1cae46be | 669 | static tree handle_const_attribute (tree *, tree, tree, int, bool *); |
670 | static tree handle_transparent_union_attribute (tree *, tree, tree, | |
671 | int, bool *); | |
672 | static tree handle_constructor_attribute (tree *, tree, tree, int, bool *); | |
673 | static tree handle_destructor_attribute (tree *, tree, tree, int, bool *); | |
674 | static tree handle_mode_attribute (tree *, tree, tree, int, bool *); | |
675 | static tree handle_section_attribute (tree *, tree, tree, int, bool *); | |
676 | static tree handle_aligned_attribute (tree *, tree, tree, int, bool *); | |
677 | static tree handle_weak_attribute (tree *, tree, tree, int, bool *) ; | |
678 | static tree handle_alias_attribute (tree *, tree, tree, int, bool *); | |
f4a30bd7 | 679 | static tree handle_weakref_attribute (tree *, tree, tree, int, bool *) ; |
1cae46be | 680 | static tree handle_visibility_attribute (tree *, tree, tree, int, |
681 | bool *); | |
682 | static tree handle_tls_model_attribute (tree *, tree, tree, int, | |
683 | bool *); | |
684 | static tree handle_no_instrument_function_attribute (tree *, tree, | |
685 | tree, int, bool *); | |
686 | static tree handle_malloc_attribute (tree *, tree, tree, int, bool *); | |
26d1c5ff | 687 | static tree handle_returns_twice_attribute (tree *, tree, tree, int, bool *); |
1cae46be | 688 | static tree handle_no_limit_stack_attribute (tree *, tree, tree, int, |
689 | bool *); | |
690 | static tree handle_pure_attribute (tree *, tree, tree, int, bool *); | |
fc09b200 | 691 | static tree handle_novops_attribute (tree *, tree, tree, int, bool *); |
1cae46be | 692 | static tree handle_deprecated_attribute (tree *, tree, tree, int, |
693 | bool *); | |
694 | static tree handle_vector_size_attribute (tree *, tree, tree, int, | |
695 | bool *); | |
696 | static tree handle_nonnull_attribute (tree *, tree, tree, int, bool *); | |
697 | static tree handle_nothrow_attribute (tree *, tree, tree, int, bool *); | |
698 | static tree handle_cleanup_attribute (tree *, tree, tree, int, bool *); | |
8a8cdb8d | 699 | static tree handle_warn_unused_result_attribute (tree *, tree, tree, int, |
700 | bool *); | |
bf6c8de0 | 701 | static tree handle_sentinel_attribute (tree *, tree, tree, int, bool *); |
b5c26b42 | 702 | static tree handle_type_generic_attribute (tree *, tree, tree, int, bool *); |
4a29c97c | 703 | static tree handle_alloc_size_attribute (tree *, tree, tree, int, bool *); |
24470055 | 704 | static tree handle_target_attribute (tree *, tree, tree, int, bool *); |
46f8e3b0 | 705 | static tree handle_optimize_attribute (tree *, tree, tree, int, bool *); |
1cae46be | 706 | |
d01f58f9 | 707 | static void check_function_nonnull (tree, int, tree *); |
1cae46be | 708 | static void check_nonnull_arg (void *, tree, unsigned HOST_WIDE_INT); |
709 | static bool nonnull_check_p (tree, unsigned HOST_WIDE_INT); | |
710 | static bool get_nonnull_operand (tree, unsigned HOST_WIDE_INT *); | |
860251be | 711 | static int resort_field_decl_cmp (const void *, const void *); |
dbf6c367 | 712 | |
5c6e5756 | 713 | /* Reserved words. The third field is a mask: keywords are disabled |
714 | if they match the mask. | |
715 | ||
716 | Masks for languages: | |
717 | C --std=c89: D_C99 | D_CXXONLY | D_OBJC | D_CXX_OBJC | |
718 | C --std=c99: D_CXXONLY | D_OBJC | |
719 | ObjC is like C except that D_OBJC and D_CXX_OBJC are not set | |
720 | C++ --std=c98: D_CONLY | D_CXXOX | D_OBJC | |
721 | C++ --std=c0x: D_CONLY | D_OBJC | |
722 | ObjC++ is like C++ except that D_OBJC is not set | |
723 | ||
724 | If -fno-asm is used, D_ASM is added to the mask. If | |
725 | -fno-gnu-keywords is used, D_EXT is added. If -fno-asm and C in | |
726 | C89 mode, D_EXT89 is added for both -fno-asm and -fno-gnu-keywords. | |
51030405 | 727 | In C with -Wc++-compat, we warn if D_CXXWARN is set. */ |
5c6e5756 | 728 | |
729 | const struct c_common_resword c_common_reswords[] = | |
730 | { | |
731 | { "_Bool", RID_BOOL, D_CONLY }, | |
732 | { "_Complex", RID_COMPLEX, 0 }, | |
733 | { "_Decimal32", RID_DFLOAT32, D_CONLY | D_EXT }, | |
734 | { "_Decimal64", RID_DFLOAT64, D_CONLY | D_EXT }, | |
735 | { "_Decimal128", RID_DFLOAT128, D_CONLY | D_EXT }, | |
736 | { "_Fract", RID_FRACT, D_CONLY | D_EXT }, | |
737 | { "_Accum", RID_ACCUM, D_CONLY | D_EXT }, | |
738 | { "_Sat", RID_SAT, D_CONLY | D_EXT }, | |
739 | { "__FUNCTION__", RID_FUNCTION_NAME, 0 }, | |
740 | { "__PRETTY_FUNCTION__", RID_PRETTY_FUNCTION_NAME, 0 }, | |
741 | { "__alignof", RID_ALIGNOF, 0 }, | |
742 | { "__alignof__", RID_ALIGNOF, 0 }, | |
743 | { "__asm", RID_ASM, 0 }, | |
744 | { "__asm__", RID_ASM, 0 }, | |
745 | { "__attribute", RID_ATTRIBUTE, 0 }, | |
746 | { "__attribute__", RID_ATTRIBUTE, 0 }, | |
747 | { "__builtin_choose_expr", RID_CHOOSE_EXPR, D_CONLY }, | |
748 | { "__builtin_offsetof", RID_OFFSETOF, 0 }, | |
749 | { "__builtin_types_compatible_p", RID_TYPES_COMPATIBLE_P, D_CONLY }, | |
750 | { "__builtin_va_arg", RID_VA_ARG, 0 }, | |
751 | { "__complex", RID_COMPLEX, 0 }, | |
752 | { "__complex__", RID_COMPLEX, 0 }, | |
753 | { "__const", RID_CONST, 0 }, | |
754 | { "__const__", RID_CONST, 0 }, | |
755 | { "__decltype", RID_DECLTYPE, D_CXXONLY }, | |
756 | { "__extension__", RID_EXTENSION, 0 }, | |
757 | { "__func__", RID_C99_FUNCTION_NAME, 0 }, | |
758 | { "__has_nothrow_assign", RID_HAS_NOTHROW_ASSIGN, D_CXXONLY }, | |
759 | { "__has_nothrow_constructor", RID_HAS_NOTHROW_CONSTRUCTOR, D_CXXONLY }, | |
760 | { "__has_nothrow_copy", RID_HAS_NOTHROW_COPY, D_CXXONLY }, | |
761 | { "__has_trivial_assign", RID_HAS_TRIVIAL_ASSIGN, D_CXXONLY }, | |
762 | { "__has_trivial_constructor", RID_HAS_TRIVIAL_CONSTRUCTOR, D_CXXONLY }, | |
763 | { "__has_trivial_copy", RID_HAS_TRIVIAL_COPY, D_CXXONLY }, | |
764 | { "__has_trivial_destructor", RID_HAS_TRIVIAL_DESTRUCTOR, D_CXXONLY }, | |
765 | { "__has_virtual_destructor", RID_HAS_VIRTUAL_DESTRUCTOR, D_CXXONLY }, | |
766 | { "__is_abstract", RID_IS_ABSTRACT, D_CXXONLY }, | |
767 | { "__is_base_of", RID_IS_BASE_OF, D_CXXONLY }, | |
768 | { "__is_class", RID_IS_CLASS, D_CXXONLY }, | |
769 | { "__is_convertible_to", RID_IS_CONVERTIBLE_TO, D_CXXONLY }, | |
770 | { "__is_empty", RID_IS_EMPTY, D_CXXONLY }, | |
771 | { "__is_enum", RID_IS_ENUM, D_CXXONLY }, | |
772 | { "__is_pod", RID_IS_POD, D_CXXONLY }, | |
773 | { "__is_polymorphic", RID_IS_POLYMORPHIC, D_CXXONLY }, | |
774 | { "__is_union", RID_IS_UNION, D_CXXONLY }, | |
775 | { "__imag", RID_IMAGPART, 0 }, | |
776 | { "__imag__", RID_IMAGPART, 0 }, | |
777 | { "__inline", RID_INLINE, 0 }, | |
778 | { "__inline__", RID_INLINE, 0 }, | |
779 | { "__label__", RID_LABEL, 0 }, | |
780 | { "__null", RID_NULL, 0 }, | |
781 | { "__real", RID_REALPART, 0 }, | |
782 | { "__real__", RID_REALPART, 0 }, | |
783 | { "__restrict", RID_RESTRICT, 0 }, | |
784 | { "__restrict__", RID_RESTRICT, 0 }, | |
785 | { "__signed", RID_SIGNED, 0 }, | |
786 | { "__signed__", RID_SIGNED, 0 }, | |
787 | { "__thread", RID_THREAD, 0 }, | |
788 | { "__typeof", RID_TYPEOF, 0 }, | |
789 | { "__typeof__", RID_TYPEOF, 0 }, | |
790 | { "__volatile", RID_VOLATILE, 0 }, | |
791 | { "__volatile__", RID_VOLATILE, 0 }, | |
792 | { "asm", RID_ASM, D_ASM }, | |
793 | { "auto", RID_AUTO, 0 }, | |
dbd982c9 | 794 | { "bool", RID_BOOL, D_CXXONLY | D_CXXWARN }, |
5c6e5756 | 795 | { "break", RID_BREAK, 0 }, |
796 | { "case", RID_CASE, 0 }, | |
51030405 | 797 | { "catch", RID_CATCH, D_CXX_OBJC | D_CXXWARN }, |
5c6e5756 | 798 | { "char", RID_CHAR, 0 }, |
51030405 | 799 | { "char16_t", RID_CHAR16, D_CXXONLY | D_CXX0X | D_CXXWARN }, |
800 | { "char32_t", RID_CHAR32, D_CXXONLY | D_CXX0X | D_CXXWARN }, | |
801 | { "class", RID_CLASS, D_CXX_OBJC | D_CXXWARN }, | |
5c6e5756 | 802 | { "const", RID_CONST, 0 }, |
803 | { "const_cast", RID_CONSTCAST, D_CXXONLY | D_CXXWARN }, | |
804 | { "continue", RID_CONTINUE, 0 }, | |
51030405 | 805 | { "decltype", RID_DECLTYPE, D_CXXONLY | D_CXX0X | D_CXXWARN }, |
5c6e5756 | 806 | { "default", RID_DEFAULT, 0 }, |
51030405 | 807 | { "delete", RID_DELETE, D_CXXONLY | D_CXXWARN }, |
5c6e5756 | 808 | { "do", RID_DO, 0 }, |
809 | { "double", RID_DOUBLE, 0 }, | |
810 | { "dynamic_cast", RID_DYNCAST, D_CXXONLY | D_CXXWARN }, | |
811 | { "else", RID_ELSE, 0 }, | |
812 | { "enum", RID_ENUM, 0 }, | |
51030405 | 813 | { "explicit", RID_EXPLICIT, D_CXXONLY | D_CXXWARN }, |
814 | { "export", RID_EXPORT, D_CXXONLY | D_CXXWARN }, | |
5c6e5756 | 815 | { "extern", RID_EXTERN, 0 }, |
51030405 | 816 | { "false", RID_FALSE, D_CXXONLY | D_CXXWARN }, |
5c6e5756 | 817 | { "float", RID_FLOAT, 0 }, |
818 | { "for", RID_FOR, 0 }, | |
51030405 | 819 | { "friend", RID_FRIEND, D_CXXONLY | D_CXXWARN }, |
5c6e5756 | 820 | { "goto", RID_GOTO, 0 }, |
821 | { "if", RID_IF, 0 }, | |
822 | { "inline", RID_INLINE, D_EXT89 }, | |
823 | { "int", RID_INT, 0 }, | |
824 | { "long", RID_LONG, 0 }, | |
825 | { "mutable", RID_MUTABLE, D_CXXONLY | D_CXXWARN }, | |
51030405 | 826 | { "namespace", RID_NAMESPACE, D_CXXONLY | D_CXXWARN }, |
827 | { "new", RID_NEW, D_CXXONLY | D_CXXWARN }, | |
828 | { "operator", RID_OPERATOR, D_CXXONLY | D_CXXWARN }, | |
829 | { "private", RID_PRIVATE, D_CXX_OBJC | D_CXXWARN }, | |
830 | { "protected", RID_PROTECTED, D_CXX_OBJC | D_CXXWARN }, | |
831 | { "public", RID_PUBLIC, D_CXX_OBJC | D_CXXWARN }, | |
5c6e5756 | 832 | { "register", RID_REGISTER, 0 }, |
833 | { "reinterpret_cast", RID_REINTCAST, D_CXXONLY | D_CXXWARN }, | |
834 | { "restrict", RID_RESTRICT, D_CONLY | D_C99 }, | |
835 | { "return", RID_RETURN, 0 }, | |
836 | { "short", RID_SHORT, 0 }, | |
837 | { "signed", RID_SIGNED, 0 }, | |
838 | { "sizeof", RID_SIZEOF, 0 }, | |
839 | { "static", RID_STATIC, 0 }, | |
840 | { "static_assert", RID_STATIC_ASSERT, D_CXXONLY | D_CXX0X | D_CXXWARN }, | |
841 | { "static_cast", RID_STATCAST, D_CXXONLY | D_CXXWARN }, | |
842 | { "struct", RID_STRUCT, 0 }, | |
843 | { "switch", RID_SWITCH, 0 }, | |
51030405 | 844 | { "template", RID_TEMPLATE, D_CXXONLY | D_CXXWARN }, |
845 | { "this", RID_THIS, D_CXXONLY | D_CXXWARN }, | |
846 | { "throw", RID_THROW, D_CXX_OBJC | D_CXXWARN }, | |
847 | { "true", RID_TRUE, D_CXXONLY | D_CXXWARN }, | |
848 | { "try", RID_TRY, D_CXX_OBJC | D_CXXWARN }, | |
5c6e5756 | 849 | { "typedef", RID_TYPEDEF, 0 }, |
51030405 | 850 | { "typename", RID_TYPENAME, D_CXXONLY | D_CXXWARN }, |
851 | { "typeid", RID_TYPEID, D_CXXONLY | D_CXXWARN }, | |
5c6e5756 | 852 | { "typeof", RID_TYPEOF, D_ASM | D_EXT }, |
853 | { "union", RID_UNION, 0 }, | |
854 | { "unsigned", RID_UNSIGNED, 0 }, | |
51030405 | 855 | { "using", RID_USING, D_CXXONLY | D_CXXWARN }, |
856 | { "virtual", RID_VIRTUAL, D_CXXONLY | D_CXXWARN }, | |
5c6e5756 | 857 | { "void", RID_VOID, 0 }, |
858 | { "volatile", RID_VOLATILE, 0 }, | |
859 | { "wchar_t", RID_WCHAR, D_CXXONLY }, | |
860 | { "while", RID_WHILE, 0 }, | |
861 | /* These Objective-C keywords are recognized only immediately after | |
862 | an '@'. */ | |
863 | { "compatibility_alias", RID_AT_ALIAS, D_OBJC }, | |
864 | { "defs", RID_AT_DEFS, D_OBJC }, | |
865 | { "encode", RID_AT_ENCODE, D_OBJC }, | |
866 | { "end", RID_AT_END, D_OBJC }, | |
867 | { "implementation", RID_AT_IMPLEMENTATION, D_OBJC }, | |
868 | { "interface", RID_AT_INTERFACE, D_OBJC }, | |
869 | { "protocol", RID_AT_PROTOCOL, D_OBJC }, | |
870 | { "selector", RID_AT_SELECTOR, D_OBJC }, | |
871 | { "finally", RID_AT_FINALLY, D_OBJC }, | |
872 | { "synchronized", RID_AT_SYNCHRONIZED, D_OBJC }, | |
873 | /* These are recognized only in protocol-qualifier context | |
874 | (see above) */ | |
875 | { "bycopy", RID_BYCOPY, D_OBJC }, | |
876 | { "byref", RID_BYREF, D_OBJC }, | |
877 | { "in", RID_IN, D_OBJC }, | |
878 | { "inout", RID_INOUT, D_OBJC }, | |
879 | { "oneway", RID_ONEWAY, D_OBJC }, | |
880 | { "out", RID_OUT, D_OBJC }, | |
881 | }; | |
882 | ||
883 | const unsigned int num_c_common_reswords = | |
884 | sizeof c_common_reswords / sizeof (struct c_common_resword); | |
885 | ||
f8e93a2e | 886 | /* Table of machine-independent attributes common to all C-like languages. */ |
887 | const struct attribute_spec c_common_attribute_table[] = | |
888 | { | |
889 | /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler } */ | |
890 | { "packed", 0, 0, false, false, false, | |
1cae46be | 891 | handle_packed_attribute }, |
f8e93a2e | 892 | { "nocommon", 0, 0, true, false, false, |
893 | handle_nocommon_attribute }, | |
894 | { "common", 0, 0, true, false, false, | |
895 | handle_common_attribute }, | |
896 | /* FIXME: logically, noreturn attributes should be listed as | |
897 | "false, true, true" and apply to function types. But implementing this | |
898 | would require all the places in the compiler that use TREE_THIS_VOLATILE | |
899 | on a decl to identify non-returning functions to be located and fixed | |
900 | to check the function type instead. */ | |
901 | { "noreturn", 0, 0, true, false, false, | |
902 | handle_noreturn_attribute }, | |
903 | { "volatile", 0, 0, true, false, false, | |
904 | handle_noreturn_attribute }, | |
905 | { "noinline", 0, 0, true, false, false, | |
906 | handle_noinline_attribute }, | |
907 | { "always_inline", 0, 0, true, false, false, | |
908 | handle_always_inline_attribute }, | |
541e4101 | 909 | { "gnu_inline", 0, 0, true, false, false, |
910 | handle_gnu_inline_attribute }, | |
1b16fc45 | 911 | { "artificial", 0, 0, true, false, false, |
912 | handle_artificial_attribute }, | |
0cdd9887 | 913 | { "flatten", 0, 0, true, false, false, |
a0c938f0 | 914 | handle_flatten_attribute }, |
f8e93a2e | 915 | { "used", 0, 0, true, false, false, |
916 | handle_used_attribute }, | |
917 | { "unused", 0, 0, false, false, false, | |
918 | handle_unused_attribute }, | |
62eec3b4 | 919 | { "externally_visible", 0, 0, true, false, false, |
920 | handle_externally_visible_attribute }, | |
f8e93a2e | 921 | /* The same comments as for noreturn attributes apply to const ones. */ |
922 | { "const", 0, 0, true, false, false, | |
923 | handle_const_attribute }, | |
924 | { "transparent_union", 0, 0, false, false, false, | |
925 | handle_transparent_union_attribute }, | |
9af7fd5b | 926 | { "constructor", 0, 1, true, false, false, |
f8e93a2e | 927 | handle_constructor_attribute }, |
9af7fd5b | 928 | { "destructor", 0, 1, true, false, false, |
f8e93a2e | 929 | handle_destructor_attribute }, |
930 | { "mode", 1, 1, false, true, false, | |
931 | handle_mode_attribute }, | |
932 | { "section", 1, 1, true, false, false, | |
933 | handle_section_attribute }, | |
934 | { "aligned", 0, 1, false, false, false, | |
935 | handle_aligned_attribute }, | |
936 | { "weak", 0, 0, true, false, false, | |
937 | handle_weak_attribute }, | |
938 | { "alias", 1, 1, true, false, false, | |
939 | handle_alias_attribute }, | |
f4a30bd7 | 940 | { "weakref", 0, 1, true, false, false, |
941 | handle_weakref_attribute }, | |
f8e93a2e | 942 | { "no_instrument_function", 0, 0, true, false, false, |
943 | handle_no_instrument_function_attribute }, | |
944 | { "malloc", 0, 0, true, false, false, | |
945 | handle_malloc_attribute }, | |
26d1c5ff | 946 | { "returns_twice", 0, 0, true, false, false, |
947 | handle_returns_twice_attribute }, | |
f8e93a2e | 948 | { "no_stack_limit", 0, 0, true, false, false, |
949 | handle_no_limit_stack_attribute }, | |
950 | { "pure", 0, 0, true, false, false, | |
951 | handle_pure_attribute }, | |
fc09b200 | 952 | /* For internal use (marking of builtins) only. The name contains space |
953 | to prevent its usage in source code. */ | |
954 | { "no vops", 0, 0, true, false, false, | |
955 | handle_novops_attribute }, | |
f8e93a2e | 956 | { "deprecated", 0, 0, false, false, false, |
957 | handle_deprecated_attribute }, | |
958 | { "vector_size", 1, 1, false, true, false, | |
959 | handle_vector_size_attribute }, | |
b212f378 | 960 | { "visibility", 1, 1, false, false, false, |
f8e93a2e | 961 | handle_visibility_attribute }, |
24dfead4 | 962 | { "tls_model", 1, 1, true, false, false, |
963 | handle_tls_model_attribute }, | |
dbf6c367 | 964 | { "nonnull", 0, -1, false, true, true, |
965 | handle_nonnull_attribute }, | |
fa987697 | 966 | { "nothrow", 0, 0, true, false, false, |
967 | handle_nothrow_attribute }, | |
cb59f969 | 968 | { "may_alias", 0, 0, false, true, false, NULL }, |
7acb29a3 | 969 | { "cleanup", 1, 1, true, false, false, |
970 | handle_cleanup_attribute }, | |
8a8cdb8d | 971 | { "warn_unused_result", 0, 0, false, true, true, |
972 | handle_warn_unused_result_attribute }, | |
50ca527f | 973 | { "sentinel", 0, 1, false, true, true, |
bf6c8de0 | 974 | handle_sentinel_attribute }, |
b5c26b42 | 975 | /* For internal use (marking of builtins) only. The name contains space |
976 | to prevent its usage in source code. */ | |
977 | { "type generic", 0, 0, false, true, true, | |
978 | handle_type_generic_attribute }, | |
4a29c97c | 979 | { "alloc_size", 1, 2, false, true, true, |
980 | handle_alloc_size_attribute }, | |
5de92639 | 981 | { "cold", 0, 0, true, false, false, |
982 | handle_cold_attribute }, | |
983 | { "hot", 0, 0, true, false, false, | |
984 | handle_hot_attribute }, | |
10fc867f | 985 | { "warning", 1, 1, true, false, false, |
986 | handle_error_attribute }, | |
987 | { "error", 1, 1, true, false, false, | |
988 | handle_error_attribute }, | |
24470055 | 989 | { "target", 1, -1, true, false, false, |
990 | handle_target_attribute }, | |
46f8e3b0 | 991 | { "optimize", 1, -1, true, false, false, |
992 | handle_optimize_attribute }, | |
f8e93a2e | 993 | { NULL, 0, 0, false, false, false, NULL } |
994 | }; | |
995 | ||
996 | /* Give the specifications for the format attributes, used by C and all | |
d716ce75 | 997 | descendants. */ |
f8e93a2e | 998 | |
999 | const struct attribute_spec c_common_format_attribute_table[] = | |
1000 | { | |
1001 | /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler } */ | |
1002 | { "format", 3, 3, false, true, true, | |
1003 | handle_format_attribute }, | |
1004 | { "format_arg", 1, 1, false, true, true, | |
1005 | handle_format_arg_attribute }, | |
1006 | { NULL, 0, 0, false, false, false, NULL } | |
1007 | }; | |
1008 | ||
2c0e001b | 1009 | /* Push current bindings for the function name VAR_DECLS. */ |
f4e3c278 | 1010 | |
1011 | void | |
1cae46be | 1012 | start_fname_decls (void) |
f4e3c278 | 1013 | { |
65b7f83f | 1014 | unsigned ix; |
1015 | tree saved = NULL_TREE; | |
1cae46be | 1016 | |
65b7f83f | 1017 | for (ix = 0; fname_vars[ix].decl; ix++) |
1018 | { | |
1019 | tree decl = *fname_vars[ix].decl; | |
f4e3c278 | 1020 | |
65b7f83f | 1021 | if (decl) |
1022 | { | |
7016c612 | 1023 | saved = tree_cons (decl, build_int_cst (NULL_TREE, ix), saved); |
65b7f83f | 1024 | *fname_vars[ix].decl = NULL_TREE; |
1025 | } | |
1026 | } | |
1027 | if (saved || saved_function_name_decls) | |
1028 | /* Normally they'll have been NULL, so only push if we've got a | |
1029 | stack, or they are non-NULL. */ | |
1030 | saved_function_name_decls = tree_cons (saved, NULL_TREE, | |
1031 | saved_function_name_decls); | |
1032 | } | |
1033 | ||
2363ef00 | 1034 | /* Finish up the current bindings, adding them into the current function's |
1035 | statement tree. This must be done _before_ finish_stmt_tree is called. | |
1036 | If there is no current function, we must be at file scope and no statements | |
1037 | are involved. Pop the previous bindings. */ | |
65b7f83f | 1038 | |
1039 | void | |
1cae46be | 1040 | finish_fname_decls (void) |
65b7f83f | 1041 | { |
1042 | unsigned ix; | |
2363ef00 | 1043 | tree stmts = NULL_TREE; |
65b7f83f | 1044 | tree stack = saved_function_name_decls; |
1045 | ||
1046 | for (; stack && TREE_VALUE (stack); stack = TREE_CHAIN (stack)) | |
2363ef00 | 1047 | append_to_statement_list (TREE_VALUE (stack), &stmts); |
1cae46be | 1048 | |
2363ef00 | 1049 | if (stmts) |
65b7f83f | 1050 | { |
2363ef00 | 1051 | tree *bodyp = &DECL_SAVED_TREE (current_function_decl); |
5c423bd6 | 1052 | |
2363ef00 | 1053 | if (TREE_CODE (*bodyp) == BIND_EXPR) |
1054 | bodyp = &BIND_EXPR_BODY (*bodyp); | |
81010c97 | 1055 | |
bc2b76e0 | 1056 | append_to_statement_list_force (*bodyp, &stmts); |
2363ef00 | 1057 | *bodyp = stmts; |
65b7f83f | 1058 | } |
1cae46be | 1059 | |
65b7f83f | 1060 | for (ix = 0; fname_vars[ix].decl; ix++) |
1061 | *fname_vars[ix].decl = NULL_TREE; | |
1cae46be | 1062 | |
65b7f83f | 1063 | if (stack) |
f4e3c278 | 1064 | { |
2c0e001b | 1065 | /* We had saved values, restore them. */ |
65b7f83f | 1066 | tree saved; |
1067 | ||
1068 | for (saved = TREE_PURPOSE (stack); saved; saved = TREE_CHAIN (saved)) | |
1069 | { | |
1070 | tree decl = TREE_PURPOSE (saved); | |
1071 | unsigned ix = TREE_INT_CST_LOW (TREE_VALUE (saved)); | |
1cae46be | 1072 | |
65b7f83f | 1073 | *fname_vars[ix].decl = decl; |
1074 | } | |
1075 | stack = TREE_CHAIN (stack); | |
f4e3c278 | 1076 | } |
65b7f83f | 1077 | saved_function_name_decls = stack; |
1078 | } | |
1079 | ||
81010c97 | 1080 | /* Return the text name of the current function, suitably prettified |
5fc7fa69 | 1081 | by PRETTY_P. Return string must be freed by caller. */ |
65b7f83f | 1082 | |
1083 | const char * | |
1cae46be | 1084 | fname_as_string (int pretty_p) |
65b7f83f | 1085 | { |
9ad4bb1e | 1086 | const char *name = "top level"; |
5fc7fa69 | 1087 | char *namep; |
8115b8be | 1088 | int vrb = 2, len; |
1089 | cpp_string cstr = { 0, 0 }, strname; | |
9ad4bb1e | 1090 | |
84166705 | 1091 | if (!pretty_p) |
9ad4bb1e | 1092 | { |
1093 | name = ""; | |
1094 | vrb = 0; | |
1095 | } | |
1096 | ||
1097 | if (current_function_decl) | |
dc24ddbd | 1098 | name = lang_hooks.decl_printable_name (current_function_decl, vrb); |
9ad4bb1e | 1099 | |
8115b8be | 1100 | len = strlen (name) + 3; /* Two for '"'s. One for NULL. */ |
5fc7fa69 | 1101 | |
8115b8be | 1102 | namep = XNEWVEC (char, len); |
1103 | snprintf (namep, len, "\"%s\"", name); | |
1104 | strname.text = (unsigned char *) namep; | |
1105 | strname.len = len - 1; | |
5fc7fa69 | 1106 | |
924bbf02 | 1107 | if (cpp_interpret_string (parse_in, &strname, 1, &cstr, CPP_STRING)) |
8115b8be | 1108 | { |
1109 | XDELETEVEC (namep); | |
1110 | return (const char *) cstr.text; | |
5fc7fa69 | 1111 | } |
5fc7fa69 | 1112 | |
1113 | return namep; | |
65b7f83f | 1114 | } |
1115 | ||
65b7f83f | 1116 | /* Return the VAR_DECL for a const char array naming the current |
1117 | function. If the VAR_DECL has not yet been created, create it | |
1118 | now. RID indicates how it should be formatted and IDENTIFIER_NODE | |
1119 | ID is its name (unfortunately C and C++ hold the RID values of | |
1120 | keywords in different places, so we can't derive RID from ID in | |
e3b80d49 | 1121 | this language independent code. LOC is the location of the |
1122 | function. */ | |
65b7f83f | 1123 | |
1124 | tree | |
e3b80d49 | 1125 | fname_decl (location_t loc, unsigned int rid, tree id) |
65b7f83f | 1126 | { |
1127 | unsigned ix; | |
1128 | tree decl = NULL_TREE; | |
1129 | ||
1130 | for (ix = 0; fname_vars[ix].decl; ix++) | |
1131 | if (fname_vars[ix].rid == rid) | |
1132 | break; | |
1133 | ||
1134 | decl = *fname_vars[ix].decl; | |
1135 | if (!decl) | |
f4e3c278 | 1136 | { |
2222b3c6 | 1137 | /* If a tree is built here, it would normally have the lineno of |
1138 | the current statement. Later this tree will be moved to the | |
1139 | beginning of the function and this line number will be wrong. | |
1140 | To avoid this problem set the lineno to 0 here; that prevents | |
7299020b | 1141 | it from appearing in the RTL. */ |
2363ef00 | 1142 | tree stmts; |
9a6486a6 | 1143 | location_t saved_location = input_location; |
9a6486a6 | 1144 | input_location = UNKNOWN_LOCATION; |
1cae46be | 1145 | |
2363ef00 | 1146 | stmts = push_stmt_list (); |
65b7f83f | 1147 | decl = (*make_fname_decl) (id, fname_vars[ix].pretty); |
2363ef00 | 1148 | stmts = pop_stmt_list (stmts); |
1149 | if (!IS_EMPTY_STMT (stmts)) | |
1150 | saved_function_name_decls | |
1151 | = tree_cons (decl, stmts, saved_function_name_decls); | |
65b7f83f | 1152 | *fname_vars[ix].decl = decl; |
9a6486a6 | 1153 | input_location = saved_location; |
f4e3c278 | 1154 | } |
65b7f83f | 1155 | if (!ix && !current_function_decl) |
e3b80d49 | 1156 | pedwarn (loc, 0, "%qD is not defined outside of function scope", decl); |
81010c97 | 1157 | |
65b7f83f | 1158 | return decl; |
f4e3c278 | 1159 | } |
1160 | ||
070236f0 | 1161 | /* Given a STRING_CST, give it a suitable array-of-chars data type. */ |
b0fc3e72 | 1162 | |
1163 | tree | |
1cae46be | 1164 | fix_string_type (tree value) |
b0fc3e72 | 1165 | { |
070236f0 | 1166 | int length = TREE_STRING_LENGTH (value); |
1167 | int nchars; | |
00d26680 | 1168 | tree e_type, i_type, a_type; |
1169 | ||
73be5127 | 1170 | /* Compute the number of elements, for the array type. */ |
924bbf02 | 1171 | if (TREE_TYPE (value) == char_array_type_node || !TREE_TYPE (value)) |
1172 | { | |
1173 | nchars = length; | |
1174 | e_type = char_type_node; | |
1175 | } | |
1176 | else if (TREE_TYPE (value) == char16_array_type_node) | |
1177 | { | |
1178 | nchars = length / (TYPE_PRECISION (char16_type_node) / BITS_PER_UNIT); | |
1179 | e_type = char16_type_node; | |
1180 | } | |
1181 | else if (TREE_TYPE (value) == char32_array_type_node) | |
1182 | { | |
1183 | nchars = length / (TYPE_PRECISION (char32_type_node) / BITS_PER_UNIT); | |
1184 | e_type = char32_type_node; | |
1185 | } | |
1186 | else | |
1187 | { | |
1188 | nchars = length / (TYPE_PRECISION (wchar_type_node) / BITS_PER_UNIT); | |
1189 | e_type = wchar_type_node; | |
1190 | } | |
b0fc3e72 | 1191 | |
1d752508 | 1192 | /* C89 2.2.4.1, C99 5.2.4.1 (Translation limits). The analogous |
1193 | limit in C++98 Annex B is very large (65536) and is not normative, | |
1194 | so we do not diagnose it (warn_overlength_strings is forced off | |
1195 | in c_common_post_options). */ | |
1196 | if (warn_overlength_strings) | |
1197 | { | |
1198 | const int nchars_max = flag_isoc99 ? 4095 : 509; | |
1199 | const int relevant_std = flag_isoc99 ? 99 : 90; | |
1200 | if (nchars - 1 > nchars_max) | |
1201 | /* Translators: The %d after 'ISO C' will be 90 or 99. Do not | |
1202 | separate the %d from the 'C'. 'ISO' should not be | |
1203 | translated, but it may be moved after 'C%d' in languages | |
1204 | where modifiers follow nouns. */ | |
21ca8540 | 1205 | pedwarn (input_location, OPT_Woverlength_strings, |
8864917d | 1206 | "string length %qd is greater than the length %qd " |
1d752508 | 1207 | "ISO C%d compilers are required to support", |
1208 | nchars - 1, nchars_max, relevant_std); | |
1209 | } | |
82cfc7f7 | 1210 | |
390be14e | 1211 | /* Create the array type for the string constant. The ISO C++ |
1212 | standard says that a string literal has type `const char[N]' or | |
1213 | `const wchar_t[N]'. We use the same logic when invoked as a C | |
1214 | front-end with -Wwrite-strings. | |
1215 | ??? We should change the type of an expression depending on the | |
1216 | state of a warning flag. We should just be warning -- see how | |
1217 | this is handled in the C++ front-end for the deprecated implicit | |
1218 | conversion from string literals to `char*' or `wchar_t*'. | |
00d26680 | 1219 | |
1220 | The C++ front end relies on TYPE_MAIN_VARIANT of a cv-qualified | |
1221 | array type being the unqualified version of that type. | |
1222 | Therefore, if we are constructing an array of const char, we must | |
1223 | construct the matching unqualified array type first. The C front | |
1224 | end does not require this, but it does no harm, so we do it | |
1225 | unconditionally. */ | |
7016c612 | 1226 | i_type = build_index_type (build_int_cst (NULL_TREE, nchars - 1)); |
00d26680 | 1227 | a_type = build_array_type (e_type, i_type); |
390be14e | 1228 | if (c_dialect_cxx() || warn_write_strings) |
aebc8537 | 1229 | a_type = c_build_qualified_type (a_type, TYPE_QUAL_CONST); |
3a10ba35 | 1230 | |
00d26680 | 1231 | TREE_TYPE (value) = a_type; |
b8e3b7ad | 1232 | TREE_CONSTANT (value) = 1; |
a814bad5 | 1233 | TREE_READONLY (value) = 1; |
b0fc3e72 | 1234 | TREE_STATIC (value) = 1; |
1235 | return value; | |
1236 | } | |
1237 | \f | |
a75b1c71 | 1238 | /* Fully fold EXPR, an expression that was not folded (beyond integer |
1239 | constant expressions and null pointer constants) when being built | |
1240 | up. If IN_INIT, this is in a static initializer and certain | |
1241 | changes are made to the folding done. Clear *MAYBE_CONST if | |
1242 | MAYBE_CONST is not NULL and EXPR is definitely not a constant | |
1243 | expression because it contains an evaluated operator (in C99) or an | |
1244 | operator outside of sizeof returning an integer constant (in C90) | |
1245 | not permitted in constant expressions, or because it contains an | |
1246 | evaluated arithmetic overflow. (*MAYBE_CONST should typically be | |
1247 | set to true by callers before calling this function.) Return the | |
1248 | folded expression. Function arguments have already been folded | |
1249 | before calling this function, as have the contents of SAVE_EXPR, | |
1250 | TARGET_EXPR, BIND_EXPR, VA_ARG_EXPR, OBJ_TYPE_REF and | |
1251 | C_MAYBE_CONST_EXPR. */ | |
1252 | ||
1253 | tree | |
1254 | c_fully_fold (tree expr, bool in_init, bool *maybe_const) | |
1255 | { | |
1256 | tree ret; | |
c6418a4e | 1257 | tree eptype = NULL_TREE; |
a75b1c71 | 1258 | bool dummy = true; |
1259 | bool maybe_const_itself = true; | |
1260 | ||
1261 | /* This function is not relevant to C++ because C++ folds while | |
1262 | parsing, and may need changes to be correct for C++ when C++ | |
1263 | stops folding while parsing. */ | |
1264 | if (c_dialect_cxx ()) | |
1265 | gcc_unreachable (); | |
1266 | ||
1267 | if (!maybe_const) | |
1268 | maybe_const = &dummy; | |
c6418a4e | 1269 | if (TREE_CODE (expr) == EXCESS_PRECISION_EXPR) |
1270 | { | |
1271 | eptype = TREE_TYPE (expr); | |
1272 | expr = TREE_OPERAND (expr, 0); | |
1273 | } | |
a75b1c71 | 1274 | ret = c_fully_fold_internal (expr, in_init, maybe_const, |
1275 | &maybe_const_itself); | |
c6418a4e | 1276 | if (eptype) |
1277 | ret = fold_convert (eptype, ret); | |
a75b1c71 | 1278 | *maybe_const &= maybe_const_itself; |
1279 | return ret; | |
1280 | } | |
1281 | ||
1282 | /* Internal helper for c_fully_fold. EXPR and IN_INIT are as for | |
1283 | c_fully_fold. *MAYBE_CONST_OPERANDS is cleared because of operands | |
1284 | not permitted, while *MAYBE_CONST_ITSELF is cleared because of | |
1285 | arithmetic overflow (for C90, *MAYBE_CONST_OPERANDS is carried from | |
1286 | both evaluated and unevaluated subexpressions while | |
1287 | *MAYBE_CONST_ITSELF is carried from only evaluated | |
1288 | subexpressions). */ | |
1289 | ||
1290 | static tree | |
1291 | c_fully_fold_internal (tree expr, bool in_init, bool *maybe_const_operands, | |
1292 | bool *maybe_const_itself) | |
1293 | { | |
1294 | tree ret = expr; | |
1295 | enum tree_code code = TREE_CODE (expr); | |
1296 | enum tree_code_class kind = TREE_CODE_CLASS (code); | |
1297 | location_t loc = EXPR_LOCATION (expr); | |
1298 | tree op0, op1, op2, op3; | |
1299 | tree orig_op0, orig_op1, orig_op2; | |
1300 | bool op0_const = true, op1_const = true, op2_const = true; | |
1301 | bool op0_const_self = true, op1_const_self = true, op2_const_self = true; | |
1302 | bool nowarning = TREE_NO_WARNING (expr); | |
1303 | ||
1304 | /* This function is not relevant to C++ because C++ folds while | |
1305 | parsing, and may need changes to be correct for C++ when C++ | |
1306 | stops folding while parsing. */ | |
1307 | if (c_dialect_cxx ()) | |
1308 | gcc_unreachable (); | |
1309 | ||
1310 | /* Constants, declarations, statements, errors, SAVE_EXPRs and | |
1311 | anything else not counted as an expression cannot usefully be | |
1312 | folded further at this point. */ | |
1313 | if (!IS_EXPR_CODE_CLASS (kind) | |
1314 | || kind == tcc_statement | |
1315 | || code == SAVE_EXPR) | |
1316 | return expr; | |
1317 | ||
1318 | /* Operands of variable-length expressions (function calls) have | |
1319 | already been folded, as have __builtin_* function calls, and such | |
1320 | expressions cannot occur in constant expressions. */ | |
1321 | if (kind == tcc_vl_exp) | |
1322 | { | |
1323 | *maybe_const_operands = false; | |
1324 | ret = fold (expr); | |
1325 | goto out; | |
1326 | } | |
1327 | ||
1328 | if (code == C_MAYBE_CONST_EXPR) | |
1329 | { | |
1330 | tree pre = C_MAYBE_CONST_EXPR_PRE (expr); | |
1331 | tree inner = C_MAYBE_CONST_EXPR_EXPR (expr); | |
1332 | if (C_MAYBE_CONST_EXPR_NON_CONST (expr)) | |
1333 | *maybe_const_operands = false; | |
1334 | if (C_MAYBE_CONST_EXPR_INT_OPERANDS (expr)) | |
1335 | *maybe_const_itself = false; | |
1336 | if (pre && !in_init) | |
1337 | ret = build2 (COMPOUND_EXPR, TREE_TYPE (expr), pre, inner); | |
1338 | else | |
1339 | ret = inner; | |
1340 | goto out; | |
1341 | } | |
1342 | ||
1343 | /* Assignment, increment, decrement, function call and comma | |
1344 | operators, and statement expressions, cannot occur in constant | |
1345 | expressions if evaluated / outside of sizeof. (Function calls | |
1346 | were handled above, though VA_ARG_EXPR is treated like a function | |
1347 | call here, and statement expressions are handled through | |
1348 | C_MAYBE_CONST_EXPR to avoid folding inside them.) */ | |
1349 | switch (code) | |
1350 | { | |
1351 | case MODIFY_EXPR: | |
1352 | case PREDECREMENT_EXPR: | |
1353 | case PREINCREMENT_EXPR: | |
1354 | case POSTDECREMENT_EXPR: | |
1355 | case POSTINCREMENT_EXPR: | |
1356 | case COMPOUND_EXPR: | |
1357 | *maybe_const_operands = false; | |
1358 | break; | |
1359 | ||
1360 | case VA_ARG_EXPR: | |
1361 | case TARGET_EXPR: | |
1362 | case BIND_EXPR: | |
1363 | case OBJ_TYPE_REF: | |
1364 | *maybe_const_operands = false; | |
1365 | ret = fold (expr); | |
1366 | goto out; | |
1367 | ||
1368 | default: | |
1369 | break; | |
1370 | } | |
1371 | ||
1372 | /* Fold individual tree codes as appropriate. */ | |
1373 | switch (code) | |
1374 | { | |
1375 | case COMPOUND_LITERAL_EXPR: | |
1376 | /* Any non-constancy will have been marked in a containing | |
1377 | C_MAYBE_CONST_EXPR; there is no more folding to do here. */ | |
1378 | goto out; | |
1379 | ||
1380 | case COMPONENT_REF: | |
1381 | orig_op0 = op0 = TREE_OPERAND (expr, 0); | |
1382 | op1 = TREE_OPERAND (expr, 1); | |
1383 | op2 = TREE_OPERAND (expr, 2); | |
1384 | op0 = c_fully_fold_internal (op0, in_init, maybe_const_operands, | |
1385 | maybe_const_itself); | |
1386 | if (op0 != orig_op0) | |
1387 | ret = build3 (COMPONENT_REF, TREE_TYPE (expr), op0, op1, op2); | |
1388 | if (ret != expr) | |
1389 | { | |
1390 | TREE_READONLY (ret) = TREE_READONLY (expr); | |
1391 | TREE_THIS_VOLATILE (ret) = TREE_THIS_VOLATILE (expr); | |
1392 | } | |
1393 | goto out; | |
1394 | ||
1395 | case ARRAY_REF: | |
1396 | orig_op0 = op0 = TREE_OPERAND (expr, 0); | |
1397 | orig_op1 = op1 = TREE_OPERAND (expr, 1); | |
1398 | op2 = TREE_OPERAND (expr, 2); | |
1399 | op3 = TREE_OPERAND (expr, 3); | |
1400 | op0 = c_fully_fold_internal (op0, in_init, maybe_const_operands, | |
1401 | maybe_const_itself); | |
1402 | op1 = c_fully_fold_internal (op1, in_init, maybe_const_operands, | |
1403 | maybe_const_itself); | |
1404 | op1 = decl_constant_value_for_optimization (op1); | |
1405 | if (op0 != orig_op0 || op1 != orig_op1) | |
1406 | ret = build4 (ARRAY_REF, TREE_TYPE (expr), op0, op1, op2, op3); | |
1407 | if (ret != expr) | |
1408 | { | |
1409 | TREE_READONLY (ret) = TREE_READONLY (expr); | |
1410 | TREE_SIDE_EFFECTS (ret) = TREE_SIDE_EFFECTS (expr); | |
1411 | TREE_THIS_VOLATILE (ret) = TREE_THIS_VOLATILE (expr); | |
1412 | } | |
1413 | ret = fold (ret); | |
1414 | goto out; | |
1415 | ||
1416 | case COMPOUND_EXPR: | |
1417 | case MODIFY_EXPR: | |
1418 | case PREDECREMENT_EXPR: | |
1419 | case PREINCREMENT_EXPR: | |
1420 | case POSTDECREMENT_EXPR: | |
1421 | case POSTINCREMENT_EXPR: | |
1422 | case PLUS_EXPR: | |
1423 | case MINUS_EXPR: | |
1424 | case MULT_EXPR: | |
1425 | case POINTER_PLUS_EXPR: | |
1426 | case TRUNC_DIV_EXPR: | |
1427 | case CEIL_DIV_EXPR: | |
1428 | case FLOOR_DIV_EXPR: | |
1429 | case TRUNC_MOD_EXPR: | |
1430 | case RDIV_EXPR: | |
1431 | case EXACT_DIV_EXPR: | |
1432 | case LSHIFT_EXPR: | |
1433 | case RSHIFT_EXPR: | |
1434 | case BIT_IOR_EXPR: | |
1435 | case BIT_XOR_EXPR: | |
1436 | case BIT_AND_EXPR: | |
1437 | case LT_EXPR: | |
1438 | case LE_EXPR: | |
1439 | case GT_EXPR: | |
1440 | case GE_EXPR: | |
1441 | case EQ_EXPR: | |
1442 | case NE_EXPR: | |
1443 | case COMPLEX_EXPR: | |
1444 | case TRUTH_AND_EXPR: | |
1445 | case TRUTH_OR_EXPR: | |
1446 | case TRUTH_XOR_EXPR: | |
1447 | case UNORDERED_EXPR: | |
1448 | case ORDERED_EXPR: | |
1449 | case UNLT_EXPR: | |
1450 | case UNLE_EXPR: | |
1451 | case UNGT_EXPR: | |
1452 | case UNGE_EXPR: | |
1453 | case UNEQ_EXPR: | |
1454 | /* Binary operations evaluating both arguments (increment and | |
1455 | decrement are binary internally in GCC). */ | |
1456 | orig_op0 = op0 = TREE_OPERAND (expr, 0); | |
1457 | orig_op1 = op1 = TREE_OPERAND (expr, 1); | |
1458 | op0 = c_fully_fold_internal (op0, in_init, maybe_const_operands, | |
1459 | maybe_const_itself); | |
1460 | if (code != MODIFY_EXPR | |
1461 | && code != PREDECREMENT_EXPR | |
1462 | && code != PREINCREMENT_EXPR | |
1463 | && code != POSTDECREMENT_EXPR | |
1464 | && code != POSTINCREMENT_EXPR) | |
1465 | op0 = decl_constant_value_for_optimization (op0); | |
1466 | /* The RHS of a MODIFY_EXPR was fully folded when building that | |
1467 | expression for the sake of conversion warnings. */ | |
1468 | if (code != MODIFY_EXPR) | |
1469 | op1 = c_fully_fold_internal (op1, in_init, maybe_const_operands, | |
1470 | maybe_const_itself); | |
1471 | op1 = decl_constant_value_for_optimization (op1); | |
1472 | if (op0 != orig_op0 || op1 != orig_op1 || in_init) | |
1473 | ret = in_init | |
1474 | ? fold_build2_initializer (code, TREE_TYPE (expr), op0, op1) | |
1475 | : fold_build2 (code, TREE_TYPE (expr), op0, op1); | |
1476 | else | |
1477 | ret = fold (expr); | |
1478 | goto out; | |
1479 | ||
1480 | case INDIRECT_REF: | |
1481 | case FIX_TRUNC_EXPR: | |
1482 | case FLOAT_EXPR: | |
1483 | CASE_CONVERT: | |
1484 | case NON_LVALUE_EXPR: | |
1485 | case NEGATE_EXPR: | |
1486 | case BIT_NOT_EXPR: | |
1487 | case TRUTH_NOT_EXPR: | |
1488 | case ADDR_EXPR: | |
1489 | case CONJ_EXPR: | |
1490 | case REALPART_EXPR: | |
1491 | case IMAGPART_EXPR: | |
1492 | /* Unary operations. */ | |
1493 | orig_op0 = op0 = TREE_OPERAND (expr, 0); | |
1494 | op0 = c_fully_fold_internal (op0, in_init, maybe_const_operands, | |
1495 | maybe_const_itself); | |
1496 | if (code != ADDR_EXPR && code != REALPART_EXPR && code != IMAGPART_EXPR) | |
1497 | op0 = decl_constant_value_for_optimization (op0); | |
1498 | if (op0 != orig_op0 || in_init) | |
1499 | ret = in_init | |
1500 | ? fold_build1_initializer (code, TREE_TYPE (expr), op0) | |
1501 | : fold_build1 (code, TREE_TYPE (expr), op0); | |
1502 | else | |
1503 | ret = fold (expr); | |
1504 | if (code == INDIRECT_REF | |
1505 | && ret != expr | |
1506 | && TREE_CODE (ret) == INDIRECT_REF) | |
1507 | { | |
1508 | TREE_READONLY (ret) = TREE_READONLY (expr); | |
1509 | TREE_SIDE_EFFECTS (ret) = TREE_SIDE_EFFECTS (expr); | |
1510 | TREE_THIS_VOLATILE (ret) = TREE_THIS_VOLATILE (expr); | |
1511 | } | |
1512 | goto out; | |
1513 | ||
1514 | case TRUTH_ANDIF_EXPR: | |
1515 | case TRUTH_ORIF_EXPR: | |
1516 | /* Binary operations not necessarily evaluating both | |
1517 | arguments. */ | |
1518 | orig_op0 = op0 = TREE_OPERAND (expr, 0); | |
1519 | orig_op1 = op1 = TREE_OPERAND (expr, 1); | |
1520 | op0 = c_fully_fold_internal (op0, in_init, &op0_const, &op0_const_self); | |
1521 | op1 = c_fully_fold_internal (op1, in_init, &op1_const, &op1_const_self); | |
1522 | if (op0 != orig_op0 || op1 != orig_op1 || in_init) | |
1523 | ret = in_init | |
1524 | ? fold_build2_initializer (code, TREE_TYPE (expr), op0, op1) | |
1525 | : fold_build2 (code, TREE_TYPE (expr), op0, op1); | |
1526 | else | |
1527 | ret = fold (expr); | |
1528 | *maybe_const_operands &= op0_const; | |
1529 | *maybe_const_itself &= op0_const_self; | |
1530 | if (!(flag_isoc99 | |
1531 | && op0_const | |
1532 | && op0_const_self | |
1533 | && (code == TRUTH_ANDIF_EXPR | |
1534 | ? op0 == truthvalue_false_node | |
1535 | : op0 == truthvalue_true_node))) | |
1536 | *maybe_const_operands &= op1_const; | |
1537 | if (!(op0_const | |
1538 | && op0_const_self | |
1539 | && (code == TRUTH_ANDIF_EXPR | |
1540 | ? op0 == truthvalue_false_node | |
1541 | : op0 == truthvalue_true_node))) | |
1542 | *maybe_const_itself &= op1_const_self; | |
1543 | goto out; | |
1544 | ||
1545 | case COND_EXPR: | |
1546 | orig_op0 = op0 = TREE_OPERAND (expr, 0); | |
1547 | orig_op1 = op1 = TREE_OPERAND (expr, 1); | |
1548 | orig_op2 = op2 = TREE_OPERAND (expr, 2); | |
1549 | op0 = c_fully_fold_internal (op0, in_init, &op0_const, &op0_const_self); | |
1550 | op1 = c_fully_fold_internal (op1, in_init, &op1_const, &op1_const_self); | |
1551 | op2 = c_fully_fold_internal (op2, in_init, &op2_const, &op2_const_self); | |
1552 | if (op0 != orig_op0 || op1 != orig_op1 || op2 != orig_op2) | |
1553 | ret = fold_build3 (code, TREE_TYPE (expr), op0, op1, op2); | |
1554 | else | |
1555 | ret = fold (expr); | |
1556 | *maybe_const_operands &= op0_const; | |
1557 | *maybe_const_itself &= op0_const_self; | |
1558 | if (!(flag_isoc99 | |
1559 | && op0_const | |
1560 | && op0_const_self | |
1561 | && op0 == truthvalue_false_node)) | |
1562 | *maybe_const_operands &= op1_const; | |
1563 | if (!(op0_const | |
1564 | && op0_const_self | |
1565 | && op0 == truthvalue_false_node)) | |
1566 | *maybe_const_itself &= op1_const_self; | |
1567 | if (!(flag_isoc99 | |
1568 | && op0_const | |
1569 | && op0_const_self | |
1570 | && op0 == truthvalue_true_node)) | |
1571 | *maybe_const_operands &= op2_const; | |
1572 | if (!(op0_const | |
1573 | && op0_const_self | |
1574 | && op0 == truthvalue_true_node)) | |
1575 | *maybe_const_itself &= op2_const_self; | |
1576 | goto out; | |
1577 | ||
c6418a4e | 1578 | case EXCESS_PRECISION_EXPR: |
1579 | /* Each case where an operand with excess precision may be | |
1580 | encountered must remove the EXCESS_PRECISION_EXPR around | |
1581 | inner operands and possibly put one around the whole | |
1582 | expression or possibly convert to the semantic type (which | |
1583 | c_fully_fold does); we cannot tell at this stage which is | |
1584 | appropriate in any particular case. */ | |
1585 | gcc_unreachable (); | |
1586 | ||
a75b1c71 | 1587 | default: |
1588 | /* Various codes may appear through folding built-in functions | |
1589 | and their arguments. */ | |
1590 | goto out; | |
1591 | } | |
1592 | ||
1593 | out: | |
1594 | /* Some folding may introduce NON_LVALUE_EXPRs; all lvalue checks | |
1595 | have been done by this point, so remove them again. */ | |
1596 | nowarning |= TREE_NO_WARNING (ret); | |
1597 | STRIP_TYPE_NOPS (ret); | |
1598 | if (nowarning && !TREE_NO_WARNING (ret)) | |
1599 | { | |
1600 | if (!CAN_HAVE_LOCATION_P (ret)) | |
1601 | ret = build1 (NOP_EXPR, TREE_TYPE (ret), ret); | |
1602 | TREE_NO_WARNING (ret) = 1; | |
1603 | } | |
1604 | if (ret != expr) | |
1605 | protected_set_expr_location (ret, loc); | |
1606 | return ret; | |
1607 | } | |
1608 | ||
1609 | /* If not optimizing, EXP is not a VAR_DECL, or EXP has array type, | |
1610 | return EXP. Otherwise, return either EXP or its known constant | |
1611 | value (if it has one), but return EXP if EXP has mode BLKmode. ??? | |
1612 | Is the BLKmode test appropriate? */ | |
1613 | ||
1614 | tree | |
1615 | decl_constant_value_for_optimization (tree exp) | |
1616 | { | |
1617 | tree ret; | |
1618 | ||
1619 | /* This function is only used by C, for c_fully_fold and other | |
1620 | optimization, and may not be correct for C++. */ | |
1621 | if (c_dialect_cxx ()) | |
1622 | gcc_unreachable (); | |
1623 | ||
1624 | if (!optimize | |
1625 | || TREE_CODE (exp) != VAR_DECL | |
1626 | || TREE_CODE (TREE_TYPE (exp)) == ARRAY_TYPE | |
1627 | || DECL_MODE (exp) == BLKmode) | |
1628 | return exp; | |
1629 | ||
1630 | ret = decl_constant_value (exp); | |
1631 | /* Avoid unwanted tree sharing between the initializer and current | |
1632 | function's body where the tree can be modified e.g. by the | |
1633 | gimplifier. */ | |
1634 | if (ret != exp && TREE_STATIC (exp)) | |
1635 | ret = unshare_expr (ret); | |
1636 | return ret; | |
1637 | } | |
1638 | ||
2a1736ed | 1639 | /* Print a warning if a constant expression had overflow in folding. |
1640 | Invoke this function on every expression that the language | |
1641 | requires to be a constant expression. | |
1642 | Note the ANSI C standard says it is erroneous for a | |
1643 | constant expression to overflow. */ | |
b2806639 | 1644 | |
1645 | void | |
1cae46be | 1646 | constant_expression_warning (tree value) |
07317e69 | 1647 | { |
1648 | if (warn_overflow && pedantic | |
1649 | && (TREE_CODE (value) == INTEGER_CST || TREE_CODE (value) == REAL_CST | |
1650 | || TREE_CODE (value) == FIXED_CST | |
1651 | || TREE_CODE (value) == VECTOR_CST | |
1652 | || TREE_CODE (value) == COMPLEX_CST) | |
1653 | && TREE_OVERFLOW (value)) | |
21ca8540 | 1654 | pedwarn (input_location, OPT_Woverflow, "overflow in constant expression"); |
07317e69 | 1655 | } |
1656 | ||
1657 | /* The same as above but print an unconditional error. */ | |
1658 | void | |
1659 | constant_expression_error (tree value) | |
b2806639 | 1660 | { |
837e1122 | 1661 | if ((TREE_CODE (value) == INTEGER_CST || TREE_CODE (value) == REAL_CST |
9421ebb9 | 1662 | || TREE_CODE (value) == FIXED_CST |
886cfd4f | 1663 | || TREE_CODE (value) == VECTOR_CST |
837e1122 | 1664 | || TREE_CODE (value) == COMPLEX_CST) |
07317e69 | 1665 | && TREE_OVERFLOW (value)) |
1666 | error ("overflow in constant expression"); | |
2a1736ed | 1667 | } |
1668 | ||
f170d67f | 1669 | /* Print a warning if an expression had overflow in folding and its |
1670 | operands hadn't. | |
1671 | ||
2a1736ed | 1672 | Invoke this function on every expression that |
1673 | (1) appears in the source code, and | |
f170d67f | 1674 | (2) is a constant expression that overflowed, and |
2a1736ed | 1675 | (3) is not already checked by convert_and_check; |
f170d67f | 1676 | however, do not invoke this function on operands of explicit casts |
1677 | or when the expression is the result of an operator and any operand | |
1678 | already overflowed. */ | |
2a1736ed | 1679 | |
1680 | void | |
1cae46be | 1681 | overflow_warning (tree value) |
2a1736ed | 1682 | { |
f170d67f | 1683 | if (skip_evaluation) return; |
1684 | ||
1685 | switch (TREE_CODE (value)) | |
886cfd4f | 1686 | { |
f170d67f | 1687 | case INTEGER_CST: |
1688 | warning (OPT_Woverflow, "integer overflow in expression"); | |
1689 | break; | |
1690 | ||
1691 | case REAL_CST: | |
1692 | warning (OPT_Woverflow, "floating point overflow in expression"); | |
1693 | break; | |
1694 | ||
9421ebb9 | 1695 | case FIXED_CST: |
1696 | warning (OPT_Woverflow, "fixed-point overflow in expression"); | |
1697 | break; | |
1698 | ||
f170d67f | 1699 | case VECTOR_CST: |
1700 | warning (OPT_Woverflow, "vector overflow in expression"); | |
1701 | break; | |
1702 | ||
1703 | case COMPLEX_CST: | |
1704 | if (TREE_CODE (TREE_REALPART (value)) == INTEGER_CST) | |
1705 | warning (OPT_Woverflow, "complex integer overflow in expression"); | |
1706 | else if (TREE_CODE (TREE_REALPART (value)) == REAL_CST) | |
1707 | warning (OPT_Woverflow, "complex floating point overflow in expression"); | |
1708 | break; | |
1709 | ||
1710 | default: | |
1711 | break; | |
886cfd4f | 1712 | } |
2a1736ed | 1713 | } |
1714 | ||
03033af4 | 1715 | /* Warn about uses of logical || / && operator in a context where it |
1716 | is likely that the bitwise equivalent was intended by the | |
1717 | programmer. We have seen an expression in which CODE is a binary | |
1718 | operator used to combine expressions OP_LEFT and OP_RIGHT, which | |
1719 | before folding had CODE_LEFT and CODE_RIGHT. */ | |
b13d1547 | 1720 | |
1721 | void | |
03033af4 | 1722 | warn_logical_operator (location_t location, enum tree_code code, |
1723 | enum tree_code code_left, tree op_left, | |
1724 | enum tree_code ARG_UNUSED (code_right), tree op_right) | |
b13d1547 | 1725 | { |
03033af4 | 1726 | if (code != TRUTH_ANDIF_EXPR |
1727 | && code != TRUTH_AND_EXPR | |
1728 | && code != TRUTH_ORIF_EXPR | |
1729 | && code != TRUTH_OR_EXPR) | |
1730 | return; | |
1731 | ||
1732 | /* Warn if &&/|| are being used in a context where it is | |
1733 | likely that the bitwise equivalent was intended by the | |
1734 | programmer. That is, an expression such as op && MASK | |
1735 | where op should not be any boolean expression, nor a | |
1736 | constant, and mask seems to be a non-boolean integer constant. */ | |
1737 | if (!truth_value_p (code_left) | |
1738 | && INTEGRAL_TYPE_P (TREE_TYPE (op_left)) | |
1739 | && !CONSTANT_CLASS_P (op_left) | |
1740 | && !TREE_NO_WARNING (op_left) | |
1741 | && TREE_CODE (op_right) == INTEGER_CST | |
1742 | && !integer_zerop (op_right) | |
1743 | && !integer_onep (op_right)) | |
b13d1547 | 1744 | { |
03033af4 | 1745 | if (code == TRUTH_ORIF_EXPR || code == TRUTH_OR_EXPR) |
1746 | warning_at (location, OPT_Wlogical_op, "logical %<or%>" | |
1747 | " applied to non-boolean constant"); | |
1748 | else | |
1749 | warning_at (location, OPT_Wlogical_op, "logical %<and%>" | |
1750 | " applied to non-boolean constant"); | |
1751 | TREE_NO_WARNING (op_left) = true; | |
b13d1547 | 1752 | } |
1753 | } | |
1754 | ||
1755 | ||
bcf22371 | 1756 | /* Print a warning about casts that might indicate violation |
1757 | of strict aliasing rules if -Wstrict-aliasing is used and | |
1e31ff37 | 1758 | strict aliasing mode is in effect. OTYPE is the original |
1759 | TREE_TYPE of EXPR, and TYPE the type we're casting to. */ | |
bcf22371 | 1760 | |
e6fa0ea6 | 1761 | bool |
1e31ff37 | 1762 | strict_aliasing_warning (tree otype, tree type, tree expr) |
bcf22371 | 1763 | { |
f06537f2 | 1764 | if (!(flag_strict_aliasing |
1765 | && POINTER_TYPE_P (type) | |
1766 | && POINTER_TYPE_P (otype) | |
1767 | && !VOID_TYPE_P (TREE_TYPE (type))) | |
1768 | /* If the type we are casting to is a ref-all pointer | |
1769 | dereferencing it is always valid. */ | |
1770 | || TYPE_REF_CAN_ALIAS_ALL (type)) | |
e6fa0ea6 | 1771 | return false; |
1772 | ||
1773 | if ((warn_strict_aliasing > 1) && TREE_CODE (expr) == ADDR_EXPR | |
bcf22371 | 1774 | && (DECL_P (TREE_OPERAND (expr, 0)) |
e6fa0ea6 | 1775 | || handled_component_p (TREE_OPERAND (expr, 0)))) |
bcf22371 | 1776 | { |
1777 | /* Casting the address of an object to non void pointer. Warn | |
1778 | if the cast breaks type based aliasing. */ | |
e6fa0ea6 | 1779 | if (!COMPLETE_TYPE_P (TREE_TYPE (type)) && warn_strict_aliasing == 2) |
1780 | { | |
1781 | warning (OPT_Wstrict_aliasing, "type-punning to incomplete type " | |
1782 | "might break strict-aliasing rules"); | |
1783 | return true; | |
1784 | } | |
bcf22371 | 1785 | else |
1786 | { | |
e6fa0ea6 | 1787 | /* warn_strict_aliasing >= 3. This includes the default (3). |
1788 | Only warn if the cast is dereferenced immediately. */ | |
32c2fdea | 1789 | alias_set_type set1 = |
e6fa0ea6 | 1790 | get_alias_set (TREE_TYPE (TREE_OPERAND (expr, 0))); |
32c2fdea | 1791 | alias_set_type set2 = get_alias_set (TREE_TYPE (type)); |
bcf22371 | 1792 | |
62d823d0 | 1793 | if (set1 != set2 && set2 != 0 |
1794 | && (set1 == 0 || !alias_sets_conflict_p (set1, set2))) | |
e6fa0ea6 | 1795 | { |
1796 | warning (OPT_Wstrict_aliasing, "dereferencing type-punned " | |
1797 | "pointer will break strict-aliasing rules"); | |
1798 | return true; | |
1799 | } | |
1800 | else if (warn_strict_aliasing == 2 | |
879f881c | 1801 | && !alias_sets_must_conflict_p (set1, set2)) |
e6fa0ea6 | 1802 | { |
1803 | warning (OPT_Wstrict_aliasing, "dereferencing type-punned " | |
1804 | "pointer might break strict-aliasing rules"); | |
1805 | return true; | |
1806 | } | |
bcf22371 | 1807 | } |
1808 | } | |
e6fa0ea6 | 1809 | else |
1810 | if ((warn_strict_aliasing == 1) && !VOID_TYPE_P (TREE_TYPE (otype))) | |
1811 | { | |
1812 | /* At this level, warn for any conversions, even if an address is | |
1813 | not taken in the same statement. This will likely produce many | |
1814 | false positives, but could be useful to pinpoint problems that | |
1815 | are not revealed at higher levels. */ | |
32c2fdea | 1816 | alias_set_type set1 = get_alias_set (TREE_TYPE (otype)); |
1817 | alias_set_type set2 = get_alias_set (TREE_TYPE (type)); | |
1818 | if (!COMPLETE_TYPE_P (type) | |
879f881c | 1819 | || !alias_sets_must_conflict_p (set1, set2)) |
e6fa0ea6 | 1820 | { |
1821 | warning (OPT_Wstrict_aliasing, "dereferencing type-punned " | |
1822 | "pointer might break strict-aliasing rules"); | |
1823 | return true; | |
1824 | } | |
1825 | } | |
1826 | ||
1827 | return false; | |
bcf22371 | 1828 | } |
1829 | ||
3f08e399 | 1830 | /* Warn for unlikely, improbable, or stupid DECL declarations |
1831 | of `main'. */ | |
1832 | ||
1833 | void | |
1834 | check_main_parameter_types (tree decl) | |
1835 | { | |
1836 | tree args; | |
1837 | int argct = 0; | |
1838 | ||
1839 | for (args = TYPE_ARG_TYPES (TREE_TYPE (decl)); args; | |
1840 | args = TREE_CHAIN (args)) | |
1841 | { | |
1842 | tree type = args ? TREE_VALUE (args) : 0; | |
1843 | ||
7accad14 | 1844 | if (type == void_type_node || type == error_mark_node ) |
3f08e399 | 1845 | break; |
1846 | ||
1847 | ++argct; | |
1848 | switch (argct) | |
1849 | { | |
1850 | case 1: | |
1851 | if (TYPE_MAIN_VARIANT (type) != integer_type_node) | |
21ca8540 | 1852 | pedwarn (input_location, OPT_Wmain, "first argument of %q+D should be %<int%>", |
23efcc02 | 1853 | decl); |
3f08e399 | 1854 | break; |
1855 | ||
1856 | case 2: | |
1857 | if (TREE_CODE (type) != POINTER_TYPE | |
1858 | || TREE_CODE (TREE_TYPE (type)) != POINTER_TYPE | |
1859 | || (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (type))) | |
1860 | != char_type_node)) | |
21ca8540 | 1861 | pedwarn (input_location, OPT_Wmain, "second argument of %q+D should be %<char **%>", |
23efcc02 | 1862 | decl); |
3f08e399 | 1863 | break; |
1864 | ||
1865 | case 3: | |
1866 | if (TREE_CODE (type) != POINTER_TYPE | |
1867 | || TREE_CODE (TREE_TYPE (type)) != POINTER_TYPE | |
1868 | || (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (type))) | |
1869 | != char_type_node)) | |
21ca8540 | 1870 | pedwarn (input_location, OPT_Wmain, "third argument of %q+D should probably be " |
23efcc02 | 1871 | "%<char **%>", decl); |
3f08e399 | 1872 | break; |
1873 | } | |
1874 | } | |
1875 | ||
1876 | /* It is intentional that this message does not mention the third | |
1877 | argument because it's only mentioned in an appendix of the | |
1878 | standard. */ | |
1879 | if (argct > 0 && (argct < 2 || argct > 3)) | |
21ca8540 | 1880 | pedwarn (input_location, OPT_Wmain, "%q+D takes only zero or two arguments", decl); |
3f08e399 | 1881 | } |
1882 | ||
ed7c4e62 | 1883 | /* True if pointers to distinct types T1 and T2 can be converted to |
1884 | each other without an explicit cast. Only returns true for opaque | |
1885 | vector types. */ | |
1886 | bool | |
1887 | vector_targets_convertible_p (const_tree t1, const_tree t2) | |
1888 | { | |
1889 | if (TREE_CODE (t1) == VECTOR_TYPE && TREE_CODE (t2) == VECTOR_TYPE | |
8d125f7d | 1890 | && (TYPE_VECTOR_OPAQUE (t1) || TYPE_VECTOR_OPAQUE (t2)) |
ed7c4e62 | 1891 | && tree_int_cst_equal (TYPE_SIZE (t1), TYPE_SIZE (t2))) |
1892 | return true; | |
1893 | ||
1894 | return false; | |
1895 | } | |
1896 | ||
546c4794 | 1897 | /* True if vector types T1 and T2 can be converted to each other |
1898 | without an explicit cast. If EMIT_LAX_NOTE is true, and T1 and T2 | |
1899 | can only be converted with -flax-vector-conversions yet that is not | |
1900 | in effect, emit a note telling the user about that option if such | |
1901 | a note has not previously been emitted. */ | |
1902 | bool | |
9f627b1a | 1903 | vector_types_convertible_p (const_tree t1, const_tree t2, bool emit_lax_note) |
8b4b9810 | 1904 | { |
546c4794 | 1905 | static bool emitted_lax_note = false; |
ae6db8ab | 1906 | bool convertible_lax; |
1907 | ||
8d125f7d | 1908 | if ((TYPE_VECTOR_OPAQUE (t1) || TYPE_VECTOR_OPAQUE (t2)) |
ae6db8ab | 1909 | && tree_int_cst_equal (TYPE_SIZE (t1), TYPE_SIZE (t2))) |
1910 | return true; | |
1911 | ||
1912 | convertible_lax = | |
1913 | (tree_int_cst_equal (TYPE_SIZE (t1), TYPE_SIZE (t2)) | |
1914 | && (TREE_CODE (TREE_TYPE (t1)) != REAL_TYPE || | |
1915 | TYPE_PRECISION (t1) == TYPE_PRECISION (t2)) | |
1916 | && (INTEGRAL_TYPE_P (TREE_TYPE (t1)) | |
1917 | == INTEGRAL_TYPE_P (TREE_TYPE (t2)))); | |
546c4794 | 1918 | |
1919 | if (!convertible_lax || flag_lax_vector_conversions) | |
1920 | return convertible_lax; | |
1921 | ||
1922 | if (TYPE_VECTOR_SUBPARTS (t1) == TYPE_VECTOR_SUBPARTS (t2) | |
29f51994 | 1923 | && lang_hooks.types_compatible_p (TREE_TYPE (t1), TREE_TYPE (t2))) |
546c4794 | 1924 | return true; |
1925 | ||
1926 | if (emit_lax_note && !emitted_lax_note) | |
1927 | { | |
1928 | emitted_lax_note = true; | |
5bcc316e | 1929 | inform (input_location, "use -flax-vector-conversions to permit " |
546c4794 | 1930 | "conversions between vectors with differing " |
1931 | "element types or numbers of subparts"); | |
1932 | } | |
1933 | ||
1934 | return false; | |
8b4b9810 | 1935 | } |
1936 | ||
2561cea2 | 1937 | /* This is a helper function of build_binary_op. |
1938 | ||
1939 | For certain operations if both args were extended from the same | |
1940 | smaller type, do the arithmetic in that type and then extend. | |
1941 | ||
1942 | BITWISE indicates a bitwise operation. | |
1943 | For them, this optimization is safe only if | |
1944 | both args are zero-extended or both are sign-extended. | |
1945 | Otherwise, we might change the result. | |
1946 | Eg, (short)-1 | (unsigned short)-1 is (int)-1 | |
1947 | but calculated in (unsigned short) it would be (unsigned short)-1. | |
1948 | */ | |
1949 | tree shorten_binary_op (tree result_type, tree op0, tree op1, bool bitwise) | |
1950 | { | |
1951 | int unsigned0, unsigned1; | |
1952 | tree arg0, arg1; | |
1953 | int uns; | |
1954 | tree type; | |
1955 | ||
1956 | /* Cast OP0 and OP1 to RESULT_TYPE. Doing so prevents | |
1957 | excessive narrowing when we call get_narrower below. For | |
1958 | example, suppose that OP0 is of unsigned int extended | |
1959 | from signed char and that RESULT_TYPE is long long int. | |
1960 | If we explicitly cast OP0 to RESULT_TYPE, OP0 would look | |
1961 | like | |
1962 | ||
1963 | (long long int) (unsigned int) signed_char | |
1964 | ||
1965 | which get_narrower would narrow down to | |
1966 | ||
1967 | (unsigned int) signed char | |
1968 | ||
1969 | If we do not cast OP0 first, get_narrower would return | |
1970 | signed_char, which is inconsistent with the case of the | |
1971 | explicit cast. */ | |
1972 | op0 = convert (result_type, op0); | |
1973 | op1 = convert (result_type, op1); | |
1974 | ||
1975 | arg0 = get_narrower (op0, &unsigned0); | |
1976 | arg1 = get_narrower (op1, &unsigned1); | |
1977 | ||
1978 | /* UNS is 1 if the operation to be done is an unsigned one. */ | |
1979 | uns = TYPE_UNSIGNED (result_type); | |
1980 | ||
1981 | /* Handle the case that OP0 (or OP1) does not *contain* a conversion | |
1982 | but it *requires* conversion to FINAL_TYPE. */ | |
1983 | ||
1984 | if ((TYPE_PRECISION (TREE_TYPE (op0)) | |
1985 | == TYPE_PRECISION (TREE_TYPE (arg0))) | |
1986 | && TREE_TYPE (op0) != result_type) | |
1987 | unsigned0 = TYPE_UNSIGNED (TREE_TYPE (op0)); | |
1988 | if ((TYPE_PRECISION (TREE_TYPE (op1)) | |
1989 | == TYPE_PRECISION (TREE_TYPE (arg1))) | |
1990 | && TREE_TYPE (op1) != result_type) | |
1991 | unsigned1 = TYPE_UNSIGNED (TREE_TYPE (op1)); | |
1992 | ||
1993 | /* Now UNSIGNED0 is 1 if ARG0 zero-extends to FINAL_TYPE. */ | |
1994 | ||
1995 | /* For bitwise operations, signedness of nominal type | |
1996 | does not matter. Consider only how operands were extended. */ | |
1997 | if (bitwise) | |
1998 | uns = unsigned0; | |
1999 | ||
2000 | /* Note that in all three cases below we refrain from optimizing | |
2001 | an unsigned operation on sign-extended args. | |
2002 | That would not be valid. */ | |
2003 | ||
2004 | /* Both args variable: if both extended in same way | |
2005 | from same width, do it in that width. | |
2006 | Do it unsigned if args were zero-extended. */ | |
2007 | if ((TYPE_PRECISION (TREE_TYPE (arg0)) | |
2008 | < TYPE_PRECISION (result_type)) | |
2009 | && (TYPE_PRECISION (TREE_TYPE (arg1)) | |
2010 | == TYPE_PRECISION (TREE_TYPE (arg0))) | |
2011 | && unsigned0 == unsigned1 | |
2012 | && (unsigned0 || !uns)) | |
2013 | return c_common_signed_or_unsigned_type | |
2014 | (unsigned0, common_type (TREE_TYPE (arg0), TREE_TYPE (arg1))); | |
2015 | ||
2016 | else if (TREE_CODE (arg0) == INTEGER_CST | |
2017 | && (unsigned1 || !uns) | |
2018 | && (TYPE_PRECISION (TREE_TYPE (arg1)) | |
2019 | < TYPE_PRECISION (result_type)) | |
2020 | && (type | |
2021 | = c_common_signed_or_unsigned_type (unsigned1, | |
2022 | TREE_TYPE (arg1))) | |
2023 | && !POINTER_TYPE_P (type) | |
2024 | && int_fits_type_p (arg0, type)) | |
2025 | return type; | |
2026 | ||
2027 | else if (TREE_CODE (arg1) == INTEGER_CST | |
2028 | && (unsigned0 || !uns) | |
2029 | && (TYPE_PRECISION (TREE_TYPE (arg0)) | |
2030 | < TYPE_PRECISION (result_type)) | |
2031 | && (type | |
2032 | = c_common_signed_or_unsigned_type (unsigned0, | |
2033 | TREE_TYPE (arg0))) | |
2034 | && !POINTER_TYPE_P (type) | |
2035 | && int_fits_type_p (arg1, type)) | |
2036 | return type; | |
2037 | ||
2038 | return result_type; | |
2039 | } | |
2040 | ||
d31d55f0 | 2041 | /* Warns if the conversion of EXPR to TYPE may alter a value. |
59dd8856 | 2042 | This is a helper function for warnings_for_convert_and_check. */ |
d31d55f0 | 2043 | |
2044 | static void | |
2045 | conversion_warning (tree type, tree expr) | |
2046 | { | |
2047 | bool give_warning = false; | |
2048 | ||
5b16c152 | 2049 | int i; |
2050 | const int expr_num_operands = TREE_OPERAND_LENGTH (expr); | |
27259707 | 2051 | tree expr_type = TREE_TYPE (expr); |
d31d55f0 | 2052 | |
7ee0d227 | 2053 | if (!warn_conversion && !warn_sign_conversion) |
2054 | return; | |
2055 | ||
5b16c152 | 2056 | /* If any operand is artificial, then this expression was generated |
2057 | by the compiler and we do not warn. */ | |
2058 | for (i = 0; i < expr_num_operands; i++) | |
2059 | { | |
2060 | tree op = TREE_OPERAND (expr, i); | |
7bdc5064 | 2061 | if (op && DECL_P (op) && DECL_ARTIFICIAL (op)) |
5b16c152 | 2062 | return; |
2063 | } | |
2064 | ||
27259707 | 2065 | switch (TREE_CODE (expr)) |
d31d55f0 | 2066 | { |
27259707 | 2067 | case EQ_EXPR: |
2068 | case NE_EXPR: | |
2069 | case LE_EXPR: | |
2070 | case GE_EXPR: | |
2071 | case LT_EXPR: | |
2072 | case GT_EXPR: | |
2073 | case TRUTH_ANDIF_EXPR: | |
2074 | case TRUTH_ORIF_EXPR: | |
2075 | case TRUTH_AND_EXPR: | |
2076 | case TRUTH_OR_EXPR: | |
2077 | case TRUTH_XOR_EXPR: | |
2078 | case TRUTH_NOT_EXPR: | |
2079 | /* Conversion from boolean to a signed:1 bit-field (which only | |
2080 | can hold the values 0 and -1) doesn't lose information - but | |
2081 | it does change the value. */ | |
2082 | if (TYPE_PRECISION (type) == 1 && !TYPE_UNSIGNED (type)) | |
2083 | warning (OPT_Wconversion, | |
2084 | "conversion to %qT from boolean expression", type); | |
2085 | return; | |
2086 | ||
2087 | case REAL_CST: | |
2088 | case INTEGER_CST: | |
2089 | ||
d31d55f0 | 2090 | /* Warn for real constant that is not an exact integer converted |
2091 | to integer type. */ | |
27259707 | 2092 | if (TREE_CODE (expr_type) == REAL_TYPE |
d31d55f0 | 2093 | && TREE_CODE (type) == INTEGER_TYPE) |
2094 | { | |
27259707 | 2095 | if (!real_isinteger (TREE_REAL_CST_PTR (expr), TYPE_MODE (expr_type))) |
d31d55f0 | 2096 | give_warning = true; |
2097 | } | |
da1fb07b | 2098 | /* Warn for an integer constant that does not fit into integer type. */ |
27259707 | 2099 | else if (TREE_CODE (expr_type) == INTEGER_TYPE |
d31d55f0 | 2100 | && TREE_CODE (type) == INTEGER_TYPE |
da1fb07b | 2101 | && !int_fits_type_p (expr, type)) |
2102 | { | |
27259707 | 2103 | if (TYPE_UNSIGNED (type) && !TYPE_UNSIGNED (expr_type) |
2104 | && tree_int_cst_sgn (expr) < 0) | |
7ee0d227 | 2105 | warning (OPT_Wsign_conversion, |
2106 | "negative integer implicitly converted to unsigned type"); | |
27259707 | 2107 | else if (!TYPE_UNSIGNED (type) && TYPE_UNSIGNED (expr_type)) |
2108 | warning (OPT_Wsign_conversion, "conversion of unsigned constant " | |
2109 | "value to negative integer"); | |
7ee0d227 | 2110 | else |
2111 | give_warning = true; | |
da1fb07b | 2112 | } |
d31d55f0 | 2113 | else if (TREE_CODE (type) == REAL_TYPE) |
2114 | { | |
2115 | /* Warn for an integer constant that does not fit into real type. */ | |
27259707 | 2116 | if (TREE_CODE (expr_type) == INTEGER_TYPE) |
d31d55f0 | 2117 | { |
2118 | REAL_VALUE_TYPE a = real_value_from_int_cst (0, expr); | |
2119 | if (!exact_real_truncate (TYPE_MODE (type), &a)) | |
2120 | give_warning = true; | |
2121 | } | |
2122 | /* Warn for a real constant that does not fit into a smaller | |
2123 | real type. */ | |
27259707 | 2124 | else if (TREE_CODE (expr_type) == REAL_TYPE |
2125 | && TYPE_PRECISION (type) < TYPE_PRECISION (expr_type)) | |
d31d55f0 | 2126 | { |
2127 | REAL_VALUE_TYPE a = TREE_REAL_CST (expr); | |
2128 | if (!exact_real_truncate (TYPE_MODE (type), &a)) | |
2129 | give_warning = true; | |
2130 | } | |
2131 | } | |
2132 | ||
2133 | if (give_warning) | |
2134 | warning (OPT_Wconversion, | |
2135 | "conversion to %qT alters %qT constant value", | |
27259707 | 2136 | type, expr_type); |
2137 | ||
2138 | return; | |
2139 | ||
2140 | case COND_EXPR: | |
2141 | { | |
2142 | /* In case of COND_EXPR, if both operands are constants or | |
2143 | COND_EXPR, then we do not care about the type of COND_EXPR, | |
2144 | only about the conversion of each operand. */ | |
2145 | tree op1 = TREE_OPERAND (expr, 1); | |
2146 | tree op2 = TREE_OPERAND (expr, 2); | |
2147 | ||
2148 | if ((TREE_CODE (op1) == REAL_CST || TREE_CODE (op1) == INTEGER_CST | |
2149 | || TREE_CODE (op1) == COND_EXPR) | |
2150 | && (TREE_CODE (op2) == REAL_CST || TREE_CODE (op2) == INTEGER_CST | |
2151 | || TREE_CODE (op2) == COND_EXPR)) | |
2152 | { | |
2153 | conversion_warning (type, op1); | |
2154 | conversion_warning (type, op2); | |
2155 | return; | |
2156 | } | |
2157 | /* Fall through. */ | |
2158 | } | |
2159 | ||
2160 | default: /* 'expr' is not a constant. */ | |
2561cea2 | 2161 | |
d31d55f0 | 2162 | /* Warn for real types converted to integer types. */ |
2561cea2 | 2163 | if (TREE_CODE (expr_type) == REAL_TYPE |
d31d55f0 | 2164 | && TREE_CODE (type) == INTEGER_TYPE) |
2165 | give_warning = true; | |
2166 | ||
2561cea2 | 2167 | else if (TREE_CODE (expr_type) == INTEGER_TYPE |
d31d55f0 | 2168 | && TREE_CODE (type) == INTEGER_TYPE) |
2169 | { | |
69609004 | 2170 | /* Don't warn about unsigned char y = 0xff, x = (int) y; */ |
f9d856a4 | 2171 | expr = get_unwidened (expr, 0); |
2561cea2 | 2172 | expr_type = TREE_TYPE (expr); |
69609004 | 2173 | |
2561cea2 | 2174 | /* Don't warn for short y; short x = ((int)y & 0xff); */ |
2175 | if (TREE_CODE (expr) == BIT_AND_EXPR | |
27259707 | 2176 | || TREE_CODE (expr) == BIT_IOR_EXPR |
2561cea2 | 2177 | || TREE_CODE (expr) == BIT_XOR_EXPR) |
2178 | { | |
27259707 | 2179 | /* If both args were extended from a shortest type, |
2180 | use that type if that is safe. */ | |
2561cea2 | 2181 | expr_type = shorten_binary_op (expr_type, |
2182 | TREE_OPERAND (expr, 0), | |
2183 | TREE_OPERAND (expr, 1), | |
2184 | /* bitwise */1); | |
2185 | ||
2561cea2 | 2186 | if (TREE_CODE (expr) == BIT_AND_EXPR) |
2187 | { | |
2188 | tree op0 = TREE_OPERAND (expr, 0); | |
2189 | tree op1 = TREE_OPERAND (expr, 1); | |
30de145b | 2190 | bool unsigned0 = TYPE_UNSIGNED (TREE_TYPE (op0)); |
2191 | bool unsigned1 = TYPE_UNSIGNED (TREE_TYPE (op1)); | |
2192 | ||
2193 | /* If one of the operands is a non-negative constant | |
2194 | that fits in the target type, then the type of the | |
2195 | other operand does not matter. */ | |
2561cea2 | 2196 | if ((TREE_CODE (op0) == INTEGER_CST |
2197 | && int_fits_type_p (op0, c_common_signed_type (type)) | |
2198 | && int_fits_type_p (op0, c_common_unsigned_type (type))) | |
2199 | || (TREE_CODE (op1) == INTEGER_CST | |
27259707 | 2200 | && int_fits_type_p (op1, c_common_signed_type (type)) |
2201 | && int_fits_type_p (op1, | |
2202 | c_common_unsigned_type (type)))) | |
2561cea2 | 2203 | return; |
30de145b | 2204 | /* If constant is unsigned and fits in the target |
2205 | type, then the result will also fit. */ | |
2206 | else if ((TREE_CODE (op0) == INTEGER_CST | |
2207 | && unsigned0 | |
2208 | && int_fits_type_p (op0, type)) | |
2209 | || (TREE_CODE (op1) == INTEGER_CST | |
2210 | && unsigned1 | |
2211 | && int_fits_type_p (op1, type))) | |
2212 | return; | |
2561cea2 | 2213 | } |
2214 | } | |
d31d55f0 | 2215 | /* Warn for integer types converted to smaller integer types. */ |
27259707 | 2216 | if (TYPE_PRECISION (type) < TYPE_PRECISION (expr_type)) |
7ee0d227 | 2217 | give_warning = true; |
2218 | ||
2219 | /* When they are the same width but different signedness, | |
2220 | then the value may change. */ | |
27259707 | 2221 | else if ((TYPE_PRECISION (type) == TYPE_PRECISION (expr_type) |
2561cea2 | 2222 | && TYPE_UNSIGNED (expr_type) != TYPE_UNSIGNED (type)) |
7ee0d227 | 2223 | /* Even when converted to a bigger type, if the type is |
2224 | unsigned but expr is signed, then negative values | |
2225 | will be changed. */ | |
2561cea2 | 2226 | || (TYPE_UNSIGNED (type) && !TYPE_UNSIGNED (expr_type))) |
27259707 | 2227 | warning (OPT_Wsign_conversion, "conversion to %qT from %qT " |
2228 | "may change the sign of the result", | |
2561cea2 | 2229 | type, expr_type); |
d31d55f0 | 2230 | } |
2231 | ||
2232 | /* Warn for integer types converted to real types if and only if | |
2233 | all the range of values of the integer type cannot be | |
2234 | represented by the real type. */ | |
2561cea2 | 2235 | else if (TREE_CODE (expr_type) == INTEGER_TYPE |
d31d55f0 | 2236 | && TREE_CODE (type) == REAL_TYPE) |
2237 | { | |
2561cea2 | 2238 | tree type_low_bound = TYPE_MIN_VALUE (expr_type); |
2239 | tree type_high_bound = TYPE_MAX_VALUE (expr_type); | |
27259707 | 2240 | REAL_VALUE_TYPE real_low_bound |
2241 | = real_value_from_int_cst (0, type_low_bound); | |
2242 | REAL_VALUE_TYPE real_high_bound | |
2243 | = real_value_from_int_cst (0, type_high_bound); | |
d31d55f0 | 2244 | |
2245 | if (!exact_real_truncate (TYPE_MODE (type), &real_low_bound) | |
2246 | || !exact_real_truncate (TYPE_MODE (type), &real_high_bound)) | |
2247 | give_warning = true; | |
2248 | } | |
2249 | ||
2250 | /* Warn for real types converted to smaller real types. */ | |
2561cea2 | 2251 | else if (TREE_CODE (expr_type) == REAL_TYPE |
d31d55f0 | 2252 | && TREE_CODE (type) == REAL_TYPE |
27259707 | 2253 | && TYPE_PRECISION (type) < TYPE_PRECISION (expr_type)) |
d31d55f0 | 2254 | give_warning = true; |
2255 | ||
2256 | ||
2257 | if (give_warning) | |
2258 | warning (OPT_Wconversion, | |
2259 | "conversion to %qT from %qT may alter its value", | |
2561cea2 | 2260 | type, expr_type); |
d31d55f0 | 2261 | } |
2262 | } | |
2263 | ||
59dd8856 | 2264 | /* Produce warnings after a conversion. RESULT is the result of |
2265 | converting EXPR to TYPE. This is a helper function for | |
2266 | convert_and_check and cp_convert_and_check. */ | |
2a1736ed | 2267 | |
59dd8856 | 2268 | void |
2269 | warnings_for_convert_and_check (tree type, tree expr, tree result) | |
2a1736ed | 2270 | { |
da1fb07b | 2271 | if (TREE_CODE (expr) == INTEGER_CST |
2272 | && (TREE_CODE (type) == INTEGER_TYPE | |
2273 | || TREE_CODE (type) == ENUMERAL_TYPE) | |
2274 | && !int_fits_type_p (expr, type)) | |
2275 | { | |
d31d55f0 | 2276 | /* Do not diagnose overflow in a constant expression merely |
2277 | because a conversion overflowed. */ | |
da1fb07b | 2278 | if (TREE_OVERFLOW (result)) |
eddad94a | 2279 | TREE_OVERFLOW (result) = TREE_OVERFLOW (expr); |
2280 | ||
da1fb07b | 2281 | if (TYPE_UNSIGNED (type)) |
d31d55f0 | 2282 | { |
da1fb07b | 2283 | /* This detects cases like converting -129 or 256 to |
2284 | unsigned char. */ | |
2285 | if (!int_fits_type_p (expr, c_common_signed_type (type))) | |
2286 | warning (OPT_Woverflow, | |
2287 | "large integer implicitly truncated to unsigned type"); | |
7ee0d227 | 2288 | else |
da1fb07b | 2289 | conversion_warning (type, expr); |
2290 | } | |
11773141 | 2291 | else if (!int_fits_type_p (expr, c_common_unsigned_type (type))) |
e0913805 | 2292 | warning (OPT_Woverflow, |
2293 | "overflow in implicit constant conversion"); | |
2294 | /* No warning for converting 0x80000000 to int. */ | |
2295 | else if (pedantic | |
2296 | && (TREE_CODE (TREE_TYPE (expr)) != INTEGER_TYPE | |
2297 | || TYPE_PRECISION (TREE_TYPE (expr)) | |
2298 | != TYPE_PRECISION (type))) | |
2299 | warning (OPT_Woverflow, | |
2300 | "overflow in implicit constant conversion"); | |
2301 | ||
7ee0d227 | 2302 | else |
e0913805 | 2303 | conversion_warning (type, expr); |
2a1736ed | 2304 | } |
9421ebb9 | 2305 | else if ((TREE_CODE (result) == INTEGER_CST |
2306 | || TREE_CODE (result) == FIXED_CST) && TREE_OVERFLOW (result)) | |
da1fb07b | 2307 | warning (OPT_Woverflow, |
2308 | "overflow in implicit constant conversion"); | |
7ee0d227 | 2309 | else |
da1fb07b | 2310 | conversion_warning (type, expr); |
59dd8856 | 2311 | } |
2312 | ||
2313 | ||
2314 | /* Convert EXPR to TYPE, warning about conversion problems with constants. | |
2315 | Invoke this function on every expression that is converted implicitly, | |
2316 | i.e. because of language rules and not because of an explicit cast. */ | |
2317 | ||
2318 | tree | |
2319 | convert_and_check (tree type, tree expr) | |
2320 | { | |
2321 | tree result; | |
c6418a4e | 2322 | tree expr_for_warning; |
2323 | ||
2324 | /* Convert from a value with possible excess precision rather than | |
2325 | via the semantic type, but do not warn about values not fitting | |
2326 | exactly in the semantic type. */ | |
2327 | if (TREE_CODE (expr) == EXCESS_PRECISION_EXPR) | |
2328 | { | |
2329 | tree orig_type = TREE_TYPE (expr); | |
2330 | expr = TREE_OPERAND (expr, 0); | |
2331 | expr_for_warning = convert (orig_type, expr); | |
2332 | if (orig_type == type) | |
2333 | return expr_for_warning; | |
2334 | } | |
2335 | else | |
2336 | expr_for_warning = expr; | |
59dd8856 | 2337 | |
2338 | if (TREE_TYPE (expr) == type) | |
2339 | return expr; | |
da1fb07b | 2340 | |
59dd8856 | 2341 | result = convert (type, expr); |
2342 | ||
7ee0d227 | 2343 | if (!skip_evaluation && !TREE_OVERFLOW_P (expr) && result != error_mark_node) |
c6418a4e | 2344 | warnings_for_convert_and_check (type, expr_for_warning, result); |
59dd8856 | 2345 | |
da1fb07b | 2346 | return result; |
b2806639 | 2347 | } |
2348 | \f | |
4e91a871 | 2349 | /* A node in a list that describes references to variables (EXPR), which are |
2350 | either read accesses if WRITER is zero, or write accesses, in which case | |
2351 | WRITER is the parent of EXPR. */ | |
2352 | struct tlist | |
2353 | { | |
2354 | struct tlist *next; | |
2355 | tree expr, writer; | |
2356 | }; | |
2357 | ||
2358 | /* Used to implement a cache the results of a call to verify_tree. We only | |
2359 | use this for SAVE_EXPRs. */ | |
2360 | struct tlist_cache | |
2361 | { | |
2362 | struct tlist_cache *next; | |
2363 | struct tlist *cache_before_sp; | |
2364 | struct tlist *cache_after_sp; | |
2365 | tree expr; | |
481c6ce6 | 2366 | }; |
2367 | ||
4e91a871 | 2368 | /* Obstack to use when allocating tlist structures, and corresponding |
2369 | firstobj. */ | |
2370 | static struct obstack tlist_obstack; | |
2371 | static char *tlist_firstobj = 0; | |
2372 | ||
2373 | /* Keep track of the identifiers we've warned about, so we can avoid duplicate | |
2374 | warnings. */ | |
2375 | static struct tlist *warned_ids; | |
2376 | /* SAVE_EXPRs need special treatment. We process them only once and then | |
2377 | cache the results. */ | |
2378 | static struct tlist_cache *save_expr_cache; | |
2379 | ||
1cae46be | 2380 | static void add_tlist (struct tlist **, struct tlist *, tree, int); |
2381 | static void merge_tlist (struct tlist **, struct tlist *, int); | |
2382 | static void verify_tree (tree, struct tlist **, struct tlist **, tree); | |
2383 | static int warning_candidate_p (tree); | |
79973b57 | 2384 | static bool candidate_equal_p (const_tree, const_tree); |
1cae46be | 2385 | static void warn_for_collisions (struct tlist *); |
2386 | static void warn_for_collisions_1 (tree, tree, struct tlist *, int); | |
2387 | static struct tlist *new_tlist (struct tlist *, tree, tree); | |
481c6ce6 | 2388 | |
4e91a871 | 2389 | /* Create a new struct tlist and fill in its fields. */ |
2390 | static struct tlist * | |
1cae46be | 2391 | new_tlist (struct tlist *next, tree t, tree writer) |
4e91a871 | 2392 | { |
2393 | struct tlist *l; | |
9318f22c | 2394 | l = XOBNEW (&tlist_obstack, struct tlist); |
4e91a871 | 2395 | l->next = next; |
2396 | l->expr = t; | |
2397 | l->writer = writer; | |
2398 | return l; | |
2399 | } | |
2400 | ||
2401 | /* Add duplicates of the nodes found in ADD to the list *TO. If EXCLUDE_WRITER | |
2402 | is nonnull, we ignore any node we find which has a writer equal to it. */ | |
2403 | ||
2404 | static void | |
1cae46be | 2405 | add_tlist (struct tlist **to, struct tlist *add, tree exclude_writer, int copy) |
4e91a871 | 2406 | { |
2407 | while (add) | |
2408 | { | |
2409 | struct tlist *next = add->next; | |
84166705 | 2410 | if (!copy) |
4e91a871 | 2411 | add->next = *to; |
79973b57 | 2412 | if (!exclude_writer || !candidate_equal_p (add->writer, exclude_writer)) |
4e91a871 | 2413 | *to = copy ? new_tlist (*to, add->expr, add->writer) : add; |
2414 | add = next; | |
2415 | } | |
2416 | } | |
2417 | ||
2418 | /* Merge the nodes of ADD into TO. This merging process is done so that for | |
2419 | each variable that already exists in TO, no new node is added; however if | |
2420 | there is a write access recorded in ADD, and an occurrence on TO is only | |
2421 | a read access, then the occurrence in TO will be modified to record the | |
2422 | write. */ | |
481c6ce6 | 2423 | |
2424 | static void | |
1cae46be | 2425 | merge_tlist (struct tlist **to, struct tlist *add, int copy) |
4e91a871 | 2426 | { |
2427 | struct tlist **end = to; | |
2428 | ||
2429 | while (*end) | |
2430 | end = &(*end)->next; | |
2431 | ||
2432 | while (add) | |
2433 | { | |
2434 | int found = 0; | |
2435 | struct tlist *tmp2; | |
2436 | struct tlist *next = add->next; | |
2437 | ||
2438 | for (tmp2 = *to; tmp2; tmp2 = tmp2->next) | |
79973b57 | 2439 | if (candidate_equal_p (tmp2->expr, add->expr)) |
4e91a871 | 2440 | { |
2441 | found = 1; | |
84166705 | 2442 | if (!tmp2->writer) |
4e91a871 | 2443 | tmp2->writer = add->writer; |
2444 | } | |
84166705 | 2445 | if (!found) |
4e91a871 | 2446 | { |
2447 | *end = copy ? add : new_tlist (NULL, add->expr, add->writer); | |
2448 | end = &(*end)->next; | |
2449 | *end = 0; | |
2450 | } | |
2451 | add = next; | |
2452 | } | |
2453 | } | |
2454 | ||
2455 | /* WRITTEN is a variable, WRITER is its parent. Warn if any of the variable | |
2456 | references in list LIST conflict with it, excluding reads if ONLY writers | |
2457 | is nonzero. */ | |
2458 | ||
2459 | static void | |
1cae46be | 2460 | warn_for_collisions_1 (tree written, tree writer, struct tlist *list, |
2461 | int only_writes) | |
4e91a871 | 2462 | { |
2463 | struct tlist *tmp; | |
2464 | ||
2465 | /* Avoid duplicate warnings. */ | |
2466 | for (tmp = warned_ids; tmp; tmp = tmp->next) | |
79973b57 | 2467 | if (candidate_equal_p (tmp->expr, written)) |
4e91a871 | 2468 | return; |
2469 | ||
2470 | while (list) | |
2471 | { | |
79973b57 | 2472 | if (candidate_equal_p (list->expr, written) |
2473 | && !candidate_equal_p (list->writer, writer) | |
2474 | && (!only_writes || list->writer)) | |
4e91a871 | 2475 | { |
2476 | warned_ids = new_tlist (warned_ids, written, NULL_TREE); | |
6513b50d | 2477 | warning_at (EXPR_HAS_LOCATION (writer) |
2478 | ? EXPR_LOCATION (writer) : input_location, | |
2479 | OPT_Wsequence_point, "operation on %qE may be undefined", | |
2480 | list->expr); | |
4e91a871 | 2481 | } |
2482 | list = list->next; | |
2483 | } | |
2484 | } | |
2485 | ||
2486 | /* Given a list LIST of references to variables, find whether any of these | |
2487 | can cause conflicts due to missing sequence points. */ | |
2488 | ||
2489 | static void | |
1cae46be | 2490 | warn_for_collisions (struct tlist *list) |
4e91a871 | 2491 | { |
2492 | struct tlist *tmp; | |
1cae46be | 2493 | |
4e91a871 | 2494 | for (tmp = list; tmp; tmp = tmp->next) |
2495 | { | |
2496 | if (tmp->writer) | |
2497 | warn_for_collisions_1 (tmp->expr, tmp->writer, list, 0); | |
2498 | } | |
2499 | } | |
2500 | ||
734c98be | 2501 | /* Return nonzero if X is a tree that can be verified by the sequence point |
4e91a871 | 2502 | warnings. */ |
2503 | static int | |
1cae46be | 2504 | warning_candidate_p (tree x) |
481c6ce6 | 2505 | { |
79973b57 | 2506 | /* !VOID_TYPE_P (TREE_TYPE (x)) is workaround for cp/tree.c |
2507 | (lvalue_p) crash on TRY/CATCH. */ | |
2508 | return !(DECL_P (x) && DECL_ARTIFICIAL (x)) | |
2509 | && TREE_TYPE (x) && !VOID_TYPE_P (TREE_TYPE (x)) && lvalue_p (x); | |
2510 | } | |
2511 | ||
2512 | /* Return nonzero if X and Y appear to be the same candidate (or NULL) */ | |
2513 | static bool | |
2514 | candidate_equal_p (const_tree x, const_tree y) | |
2515 | { | |
2516 | return (x == y) || (x && y && operand_equal_p (x, y, 0)); | |
4e91a871 | 2517 | } |
481c6ce6 | 2518 | |
4e91a871 | 2519 | /* Walk the tree X, and record accesses to variables. If X is written by the |
2520 | parent tree, WRITER is the parent. | |
2521 | We store accesses in one of the two lists: PBEFORE_SP, and PNO_SP. If this | |
2522 | expression or its only operand forces a sequence point, then everything up | |
2523 | to the sequence point is stored in PBEFORE_SP. Everything else gets stored | |
2524 | in PNO_SP. | |
2525 | Once we return, we will have emitted warnings if any subexpression before | |
2526 | such a sequence point could be undefined. On a higher level, however, the | |
2527 | sequence point may not be relevant, and we'll merge the two lists. | |
2528 | ||
2529 | Example: (b++, a) + b; | |
2530 | The call that processes the COMPOUND_EXPR will store the increment of B | |
2531 | in PBEFORE_SP, and the use of A in PNO_SP. The higher-level call that | |
2532 | processes the PLUS_EXPR will need to merge the two lists so that | |
2533 | eventually, all accesses end up on the same list (and we'll warn about the | |
2534 | unordered subexpressions b++ and b. | |
2535 | ||
2536 | A note on merging. If we modify the former example so that our expression | |
2537 | becomes | |
2538 | (b++, b) + a | |
2539 | care must be taken not simply to add all three expressions into the final | |
2540 | PNO_SP list. The function merge_tlist takes care of that by merging the | |
2541 | before-SP list of the COMPOUND_EXPR into its after-SP list in a special | |
2542 | way, so that no more than one access to B is recorded. */ | |
481c6ce6 | 2543 | |
4e91a871 | 2544 | static void |
1cae46be | 2545 | verify_tree (tree x, struct tlist **pbefore_sp, struct tlist **pno_sp, |
2546 | tree writer) | |
4e91a871 | 2547 | { |
2548 | struct tlist *tmp_before, *tmp_nosp, *tmp_list2, *tmp_list3; | |
2549 | enum tree_code code; | |
ce45a448 | 2550 | enum tree_code_class cl; |
481c6ce6 | 2551 | |
e5b75768 | 2552 | /* X may be NULL if it is the operand of an empty statement expression |
2553 | ({ }). */ | |
2554 | if (x == NULL) | |
2555 | return; | |
2556 | ||
4e91a871 | 2557 | restart: |
2558 | code = TREE_CODE (x); | |
e916c70c | 2559 | cl = TREE_CODE_CLASS (code); |
481c6ce6 | 2560 | |
4e91a871 | 2561 | if (warning_candidate_p (x)) |
79973b57 | 2562 | *pno_sp = new_tlist (*pno_sp, x, writer); |
4e91a871 | 2563 | |
2564 | switch (code) | |
2565 | { | |
67b28e3e | 2566 | case CONSTRUCTOR: |
2567 | return; | |
2568 | ||
4e91a871 | 2569 | case COMPOUND_EXPR: |
2570 | case TRUTH_ANDIF_EXPR: | |
2571 | case TRUTH_ORIF_EXPR: | |
2572 | tmp_before = tmp_nosp = tmp_list3 = 0; | |
2573 | verify_tree (TREE_OPERAND (x, 0), &tmp_before, &tmp_nosp, NULL_TREE); | |
2574 | warn_for_collisions (tmp_nosp); | |
2575 | merge_tlist (pbefore_sp, tmp_before, 0); | |
2576 | merge_tlist (pbefore_sp, tmp_nosp, 0); | |
2577 | verify_tree (TREE_OPERAND (x, 1), &tmp_list3, pno_sp, NULL_TREE); | |
2578 | merge_tlist (pbefore_sp, tmp_list3, 0); | |
2579 | return; | |
2580 | ||
2581 | case COND_EXPR: | |
2582 | tmp_before = tmp_list2 = 0; | |
2583 | verify_tree (TREE_OPERAND (x, 0), &tmp_before, &tmp_list2, NULL_TREE); | |
2584 | warn_for_collisions (tmp_list2); | |
2585 | merge_tlist (pbefore_sp, tmp_before, 0); | |
2586 | merge_tlist (pbefore_sp, tmp_list2, 1); | |
2587 | ||
2588 | tmp_list3 = tmp_nosp = 0; | |
2589 | verify_tree (TREE_OPERAND (x, 1), &tmp_list3, &tmp_nosp, NULL_TREE); | |
2590 | warn_for_collisions (tmp_nosp); | |
2591 | merge_tlist (pbefore_sp, tmp_list3, 0); | |
2592 | ||
2593 | tmp_list3 = tmp_list2 = 0; | |
2594 | verify_tree (TREE_OPERAND (x, 2), &tmp_list3, &tmp_list2, NULL_TREE); | |
2595 | warn_for_collisions (tmp_list2); | |
2596 | merge_tlist (pbefore_sp, tmp_list3, 0); | |
2597 | /* Rather than add both tmp_nosp and tmp_list2, we have to merge the | |
2598 | two first, to avoid warning for (a ? b++ : b++). */ | |
2599 | merge_tlist (&tmp_nosp, tmp_list2, 0); | |
2600 | add_tlist (pno_sp, tmp_nosp, NULL_TREE, 0); | |
2601 | return; | |
2602 | ||
481c6ce6 | 2603 | case PREDECREMENT_EXPR: |
2604 | case PREINCREMENT_EXPR: | |
2605 | case POSTDECREMENT_EXPR: | |
2606 | case POSTINCREMENT_EXPR: | |
4e91a871 | 2607 | verify_tree (TREE_OPERAND (x, 0), pno_sp, pno_sp, x); |
2608 | return; | |
2609 | ||
2610 | case MODIFY_EXPR: | |
2611 | tmp_before = tmp_nosp = tmp_list3 = 0; | |
2612 | verify_tree (TREE_OPERAND (x, 1), &tmp_before, &tmp_nosp, NULL_TREE); | |
2613 | verify_tree (TREE_OPERAND (x, 0), &tmp_list3, &tmp_list3, x); | |
2614 | /* Expressions inside the LHS are not ordered wrt. the sequence points | |
2615 | in the RHS. Example: | |
2616 | *a = (a++, 2) | |
2617 | Despite the fact that the modification of "a" is in the before_sp | |
2618 | list (tmp_before), it conflicts with the use of "a" in the LHS. | |
2619 | We can handle this by adding the contents of tmp_list3 | |
2620 | to those of tmp_before, and redoing the collision warnings for that | |
2621 | list. */ | |
2622 | add_tlist (&tmp_before, tmp_list3, x, 1); | |
2623 | warn_for_collisions (tmp_before); | |
2624 | /* Exclude the LHS itself here; we first have to merge it into the | |
2625 | tmp_nosp list. This is done to avoid warning for "a = a"; if we | |
2626 | didn't exclude the LHS, we'd get it twice, once as a read and once | |
2627 | as a write. */ | |
2628 | add_tlist (pno_sp, tmp_list3, x, 0); | |
2629 | warn_for_collisions_1 (TREE_OPERAND (x, 0), x, tmp_nosp, 1); | |
2630 | ||
2631 | merge_tlist (pbefore_sp, tmp_before, 0); | |
2632 | if (warning_candidate_p (TREE_OPERAND (x, 0))) | |
2633 | merge_tlist (&tmp_nosp, new_tlist (NULL, TREE_OPERAND (x, 0), x), 0); | |
2634 | add_tlist (pno_sp, tmp_nosp, NULL_TREE, 1); | |
2635 | return; | |
481c6ce6 | 2636 | |
2637 | case CALL_EXPR: | |
4e91a871 | 2638 | /* We need to warn about conflicts among arguments and conflicts between |
2639 | args and the function address. Side effects of the function address, | |
2640 | however, are not ordered by the sequence point of the call. */ | |
c2f47e15 | 2641 | { |
2642 | call_expr_arg_iterator iter; | |
2643 | tree arg; | |
2644 | tmp_before = tmp_nosp = 0; | |
2645 | verify_tree (CALL_EXPR_FN (x), &tmp_before, &tmp_nosp, NULL_TREE); | |
2646 | FOR_EACH_CALL_EXPR_ARG (arg, iter, x) | |
2647 | { | |
2648 | tmp_list2 = tmp_list3 = 0; | |
2649 | verify_tree (arg, &tmp_list2, &tmp_list3, NULL_TREE); | |
2650 | merge_tlist (&tmp_list3, tmp_list2, 0); | |
2651 | add_tlist (&tmp_before, tmp_list3, NULL_TREE, 0); | |
2652 | } | |
2653 | add_tlist (&tmp_before, tmp_nosp, NULL_TREE, 0); | |
2654 | warn_for_collisions (tmp_before); | |
2655 | add_tlist (pbefore_sp, tmp_before, NULL_TREE, 0); | |
2656 | return; | |
2657 | } | |
481c6ce6 | 2658 | |
2659 | case TREE_LIST: | |
2660 | /* Scan all the list, e.g. indices of multi dimensional array. */ | |
2661 | while (x) | |
2662 | { | |
4e91a871 | 2663 | tmp_before = tmp_nosp = 0; |
2664 | verify_tree (TREE_VALUE (x), &tmp_before, &tmp_nosp, NULL_TREE); | |
2665 | merge_tlist (&tmp_nosp, tmp_before, 0); | |
2666 | add_tlist (pno_sp, tmp_nosp, NULL_TREE, 0); | |
481c6ce6 | 2667 | x = TREE_CHAIN (x); |
2668 | } | |
4e91a871 | 2669 | return; |
481c6ce6 | 2670 | |
4e91a871 | 2671 | case SAVE_EXPR: |
2672 | { | |
2673 | struct tlist_cache *t; | |
2674 | for (t = save_expr_cache; t; t = t->next) | |
79973b57 | 2675 | if (candidate_equal_p (t->expr, x)) |
4e91a871 | 2676 | break; |
481c6ce6 | 2677 | |
84166705 | 2678 | if (!t) |
481c6ce6 | 2679 | { |
9318f22c | 2680 | t = XOBNEW (&tlist_obstack, struct tlist_cache); |
4e91a871 | 2681 | t->next = save_expr_cache; |
2682 | t->expr = x; | |
2683 | save_expr_cache = t; | |
2684 | ||
2685 | tmp_before = tmp_nosp = 0; | |
2686 | verify_tree (TREE_OPERAND (x, 0), &tmp_before, &tmp_nosp, NULL_TREE); | |
2687 | warn_for_collisions (tmp_nosp); | |
2688 | ||
2689 | tmp_list3 = 0; | |
2690 | while (tmp_nosp) | |
2691 | { | |
2692 | struct tlist *t = tmp_nosp; | |
2693 | tmp_nosp = t->next; | |
2694 | merge_tlist (&tmp_list3, t, 0); | |
2695 | } | |
2696 | t->cache_before_sp = tmp_before; | |
2697 | t->cache_after_sp = tmp_list3; | |
481c6ce6 | 2698 | } |
4e91a871 | 2699 | merge_tlist (pbefore_sp, t->cache_before_sp, 1); |
2700 | add_tlist (pno_sp, t->cache_after_sp, NULL_TREE, 1); | |
2701 | return; | |
2702 | } | |
481c6ce6 | 2703 | |
012916cb | 2704 | case ADDR_EXPR: |
2705 | x = TREE_OPERAND (x, 0); | |
2706 | if (DECL_P (x)) | |
2707 | return; | |
2708 | writer = 0; | |
2709 | goto restart; | |
2710 | ||
ce45a448 | 2711 | default: |
2712 | /* For other expressions, simply recurse on their operands. | |
a0c938f0 | 2713 | Manual tail recursion for unary expressions. |
ce45a448 | 2714 | Other non-expressions need not be processed. */ |
2715 | if (cl == tcc_unary) | |
2716 | { | |
ce45a448 | 2717 | x = TREE_OPERAND (x, 0); |
2718 | writer = 0; | |
2719 | goto restart; | |
2720 | } | |
2721 | else if (IS_EXPR_CODE_CLASS (cl)) | |
2722 | { | |
2723 | int lp; | |
c2f47e15 | 2724 | int max = TREE_OPERAND_LENGTH (x); |
ce45a448 | 2725 | for (lp = 0; lp < max; lp++) |
2726 | { | |
2727 | tmp_before = tmp_nosp = 0; | |
2728 | verify_tree (TREE_OPERAND (x, lp), &tmp_before, &tmp_nosp, 0); | |
2729 | merge_tlist (&tmp_nosp, tmp_before, 0); | |
2730 | add_tlist (pno_sp, tmp_nosp, NULL_TREE, 0); | |
2731 | } | |
2732 | } | |
2733 | return; | |
481c6ce6 | 2734 | } |
481c6ce6 | 2735 | } |
2736 | ||
974e2c0c | 2737 | /* Try to warn for undefined behavior in EXPR due to missing sequence |
481c6ce6 | 2738 | points. */ |
2739 | ||
2569a1be | 2740 | void |
1cae46be | 2741 | verify_sequence_points (tree expr) |
481c6ce6 | 2742 | { |
4e91a871 | 2743 | struct tlist *before_sp = 0, *after_sp = 0; |
481c6ce6 | 2744 | |
4e91a871 | 2745 | warned_ids = 0; |
2746 | save_expr_cache = 0; | |
2747 | if (tlist_firstobj == 0) | |
481c6ce6 | 2748 | { |
4e91a871 | 2749 | gcc_obstack_init (&tlist_obstack); |
4fd61bc6 | 2750 | tlist_firstobj = (char *) obstack_alloc (&tlist_obstack, 0); |
481c6ce6 | 2751 | } |
2752 | ||
4e91a871 | 2753 | verify_tree (expr, &before_sp, &after_sp, 0); |
2754 | warn_for_collisions (after_sp); | |
2755 | obstack_free (&tlist_obstack, tlist_firstobj); | |
481c6ce6 | 2756 | } |
b0fc3e72 | 2757 | \f |
2758 | /* Validate the expression after `case' and apply default promotions. */ | |
2759 | ||
2ca392fd | 2760 | static tree |
1cae46be | 2761 | check_case_value (tree value) |
b0fc3e72 | 2762 | { |
2763 | if (value == NULL_TREE) | |
2764 | return value; | |
2765 | ||
a97c952c | 2766 | /* ??? Can we ever get nops here for a valid case value? We |
2767 | shouldn't for C. */ | |
fce1d6af | 2768 | STRIP_TYPE_NOPS (value); |
225ec6aa | 2769 | /* In C++, the following is allowed: |
2770 | ||
2771 | const int i = 3; | |
2772 | switch (...) { case i: ... } | |
2773 | ||
2774 | So, we try to reduce the VALUE to a constant that way. */ | |
c0f19401 | 2775 | if (c_dialect_cxx ()) |
225ec6aa | 2776 | { |
2777 | value = decl_constant_value (value); | |
2778 | STRIP_TYPE_NOPS (value); | |
2779 | value = fold (value); | |
2780 | } | |
b0fc3e72 | 2781 | |
b96dc121 | 2782 | if (TREE_CODE (value) == INTEGER_CST) |
2783 | /* Promote char or short to int. */ | |
2784 | value = perform_integral_promotions (value); | |
2785 | else if (value != error_mark_node) | |
b0fc3e72 | 2786 | { |
2787 | error ("case label does not reduce to an integer constant"); | |
2788 | value = error_mark_node; | |
2789 | } | |
b0fc3e72 | 2790 | |
6433f1c2 | 2791 | constant_expression_warning (value); |
2792 | ||
b0fc3e72 | 2793 | return value; |
2794 | } | |
2795 | \f | |
2ca392fd | 2796 | /* See if the case values LOW and HIGH are in the range of the original |
5c9dae64 | 2797 | type (i.e. before the default conversion to int) of the switch testing |
2ca392fd | 2798 | expression. |
2799 | TYPE is the promoted type of the testing expression, and ORIG_TYPE is | |
91275768 | 2800 | the type before promoting it. CASE_LOW_P is a pointer to the lower |
2ca392fd | 2801 | bound of the case label, and CASE_HIGH_P is the upper bound or NULL |
2802 | if the case is not a case range. | |
2803 | The caller has to make sure that we are not called with NULL for | |
5c9dae64 | 2804 | CASE_LOW_P (i.e. the default case). |
442e3cb9 | 2805 | Returns true if the case label is in range of ORIG_TYPE (saturated or |
2ca392fd | 2806 | untouched) or false if the label is out of range. */ |
2807 | ||
2808 | static bool | |
2809 | check_case_bounds (tree type, tree orig_type, | |
2810 | tree *case_low_p, tree *case_high_p) | |
2811 | { | |
2812 | tree min_value, max_value; | |
2813 | tree case_low = *case_low_p; | |
2814 | tree case_high = case_high_p ? *case_high_p : case_low; | |
2815 | ||
2816 | /* If there was a problem with the original type, do nothing. */ | |
2817 | if (orig_type == error_mark_node) | |
2818 | return true; | |
2819 | ||
2820 | min_value = TYPE_MIN_VALUE (orig_type); | |
2821 | max_value = TYPE_MAX_VALUE (orig_type); | |
2822 | ||
2823 | /* Case label is less than minimum for type. */ | |
2824 | if (tree_int_cst_compare (case_low, min_value) < 0 | |
2825 | && tree_int_cst_compare (case_high, min_value) < 0) | |
2826 | { | |
c3ceba8e | 2827 | warning (0, "case label value is less than minimum value for type"); |
2ca392fd | 2828 | return false; |
2829 | } | |
b27ac6b5 | 2830 | |
2ca392fd | 2831 | /* Case value is greater than maximum for type. */ |
2832 | if (tree_int_cst_compare (case_low, max_value) > 0 | |
2833 | && tree_int_cst_compare (case_high, max_value) > 0) | |
2834 | { | |
c3ceba8e | 2835 | warning (0, "case label value exceeds maximum value for type"); |
2ca392fd | 2836 | return false; |
2837 | } | |
2838 | ||
2839 | /* Saturate lower case label value to minimum. */ | |
2840 | if (tree_int_cst_compare (case_high, min_value) >= 0 | |
2841 | && tree_int_cst_compare (case_low, min_value) < 0) | |
2842 | { | |
c3ceba8e | 2843 | warning (0, "lower value in case label range" |
2ca392fd | 2844 | " less than minimum value for type"); |
2845 | case_low = min_value; | |
2846 | } | |
b27ac6b5 | 2847 | |
2ca392fd | 2848 | /* Saturate upper case label value to maximum. */ |
2849 | if (tree_int_cst_compare (case_low, max_value) <= 0 | |
2850 | && tree_int_cst_compare (case_high, max_value) > 0) | |
2851 | { | |
c3ceba8e | 2852 | warning (0, "upper value in case label range" |
2ca392fd | 2853 | " exceeds maximum value for type"); |
2854 | case_high = max_value; | |
2855 | } | |
2856 | ||
2857 | if (*case_low_p != case_low) | |
2858 | *case_low_p = convert (type, case_low); | |
2859 | if (case_high_p && *case_high_p != case_high) | |
2860 | *case_high_p = convert (type, case_high); | |
2861 | ||
2862 | return true; | |
2863 | } | |
2864 | \f | |
b0fc3e72 | 2865 | /* Return an integer type with BITS bits of precision, |
2866 | that is unsigned if UNSIGNEDP is nonzero, otherwise signed. */ | |
2867 | ||
2868 | tree | |
1cae46be | 2869 | c_common_type_for_size (unsigned int bits, int unsignedp) |
b0fc3e72 | 2870 | { |
46375237 | 2871 | if (bits == TYPE_PRECISION (integer_type_node)) |
2872 | return unsignedp ? unsigned_type_node : integer_type_node; | |
2873 | ||
bacde65a | 2874 | if (bits == TYPE_PRECISION (signed_char_type_node)) |
b0fc3e72 | 2875 | return unsignedp ? unsigned_char_type_node : signed_char_type_node; |
2876 | ||
bacde65a | 2877 | if (bits == TYPE_PRECISION (short_integer_type_node)) |
b0fc3e72 | 2878 | return unsignedp ? short_unsigned_type_node : short_integer_type_node; |
2879 | ||
bacde65a | 2880 | if (bits == TYPE_PRECISION (long_integer_type_node)) |
b0fc3e72 | 2881 | return unsignedp ? long_unsigned_type_node : long_integer_type_node; |
2882 | ||
bacde65a | 2883 | if (bits == TYPE_PRECISION (long_long_integer_type_node)) |
b0fc3e72 | 2884 | return (unsignedp ? long_long_unsigned_type_node |
2885 | : long_long_integer_type_node); | |
2886 | ||
f57fa2ea | 2887 | if (bits == TYPE_PRECISION (widest_integer_literal_type_node)) |
2888 | return (unsignedp ? widest_unsigned_literal_type_node | |
2889 | : widest_integer_literal_type_node); | |
2890 | ||
bacde65a | 2891 | if (bits <= TYPE_PRECISION (intQI_type_node)) |
2892 | return unsignedp ? unsigned_intQI_type_node : intQI_type_node; | |
2893 | ||
2894 | if (bits <= TYPE_PRECISION (intHI_type_node)) | |
2895 | return unsignedp ? unsigned_intHI_type_node : intHI_type_node; | |
2896 | ||
2897 | if (bits <= TYPE_PRECISION (intSI_type_node)) | |
2898 | return unsignedp ? unsigned_intSI_type_node : intSI_type_node; | |
2899 | ||
2900 | if (bits <= TYPE_PRECISION (intDI_type_node)) | |
2901 | return unsignedp ? unsigned_intDI_type_node : intDI_type_node; | |
2902 | ||
b0fc3e72 | 2903 | return 0; |
2904 | } | |
2905 | ||
9421ebb9 | 2906 | /* Return a fixed-point type that has at least IBIT ibits and FBIT fbits |
2907 | that is unsigned if UNSIGNEDP is nonzero, otherwise signed; | |
2908 | and saturating if SATP is nonzero, otherwise not saturating. */ | |
2909 | ||
2910 | tree | |
2911 | c_common_fixed_point_type_for_size (unsigned int ibit, unsigned int fbit, | |
2912 | int unsignedp, int satp) | |
2913 | { | |
2914 | enum machine_mode mode; | |
2915 | if (ibit == 0) | |
2916 | mode = unsignedp ? UQQmode : QQmode; | |
2917 | else | |
2918 | mode = unsignedp ? UHAmode : HAmode; | |
2919 | ||
2920 | for (; mode != VOIDmode; mode = GET_MODE_WIDER_MODE (mode)) | |
2921 | if (GET_MODE_IBIT (mode) >= ibit && GET_MODE_FBIT (mode) >= fbit) | |
2922 | break; | |
2923 | ||
2924 | if (mode == VOIDmode || !targetm.scalar_mode_supported_p (mode)) | |
2925 | { | |
2926 | sorry ("GCC cannot support operators with integer types and " | |
2927 | "fixed-point types that have too many integral and " | |
2928 | "fractional bits together"); | |
2929 | return 0; | |
2930 | } | |
2931 | ||
2932 | return c_common_type_for_mode (mode, satp); | |
2933 | } | |
2934 | ||
5b247e9f | 2935 | /* Used for communication between c_common_type_for_mode and |
2936 | c_register_builtin_type. */ | |
2937 | static GTY(()) tree registered_builtin_types; | |
2938 | ||
b0fc3e72 | 2939 | /* Return a data type that has machine mode MODE. |
2940 | If the mode is an integer, | |
9421ebb9 | 2941 | then UNSIGNEDP selects between signed and unsigned types. |
2942 | If the mode is a fixed-point mode, | |
2943 | then UNSIGNEDP selects between saturating and nonsaturating types. */ | |
b0fc3e72 | 2944 | |
2945 | tree | |
1cae46be | 2946 | c_common_type_for_mode (enum machine_mode mode, int unsignedp) |
b0fc3e72 | 2947 | { |
5b247e9f | 2948 | tree t; |
2949 | ||
46375237 | 2950 | if (mode == TYPE_MODE (integer_type_node)) |
2951 | return unsignedp ? unsigned_type_node : integer_type_node; | |
2952 | ||
b0fc3e72 | 2953 | if (mode == TYPE_MODE (signed_char_type_node)) |
2954 | return unsignedp ? unsigned_char_type_node : signed_char_type_node; | |
2955 | ||
2956 | if (mode == TYPE_MODE (short_integer_type_node)) | |
2957 | return unsignedp ? short_unsigned_type_node : short_integer_type_node; | |
2958 | ||
b0fc3e72 | 2959 | if (mode == TYPE_MODE (long_integer_type_node)) |
2960 | return unsignedp ? long_unsigned_type_node : long_integer_type_node; | |
2961 | ||
2962 | if (mode == TYPE_MODE (long_long_integer_type_node)) | |
2963 | return unsignedp ? long_long_unsigned_type_node : long_long_integer_type_node; | |
2964 | ||
f57fa2ea | 2965 | if (mode == TYPE_MODE (widest_integer_literal_type_node)) |
44e9fa65 | 2966 | return unsignedp ? widest_unsigned_literal_type_node |
4ee9c684 | 2967 | : widest_integer_literal_type_node; |
f57fa2ea | 2968 | |
88ae7f04 | 2969 | if (mode == QImode) |
bacde65a | 2970 | return unsignedp ? unsigned_intQI_type_node : intQI_type_node; |
2971 | ||
88ae7f04 | 2972 | if (mode == HImode) |
bacde65a | 2973 | return unsignedp ? unsigned_intHI_type_node : intHI_type_node; |
2974 | ||
88ae7f04 | 2975 | if (mode == SImode) |
bacde65a | 2976 | return unsignedp ? unsigned_intSI_type_node : intSI_type_node; |
2977 | ||
88ae7f04 | 2978 | if (mode == DImode) |
bacde65a | 2979 | return unsignedp ? unsigned_intDI_type_node : intDI_type_node; |
2980 | ||
cc1cc1c7 | 2981 | #if HOST_BITS_PER_WIDE_INT >= 64 |
6274009c | 2982 | if (mode == TYPE_MODE (intTI_type_node)) |
2983 | return unsignedp ? unsigned_intTI_type_node : intTI_type_node; | |
cc1cc1c7 | 2984 | #endif |
6274009c | 2985 | |
b0fc3e72 | 2986 | if (mode == TYPE_MODE (float_type_node)) |
2987 | return float_type_node; | |
2988 | ||
2989 | if (mode == TYPE_MODE (double_type_node)) | |
2990 | return double_type_node; | |
2991 | ||
2992 | if (mode == TYPE_MODE (long_double_type_node)) | |
2993 | return long_double_type_node; | |
2994 | ||
545c2bde | 2995 | if (mode == TYPE_MODE (void_type_node)) |
2996 | return void_type_node; | |
b27ac6b5 | 2997 | |
b0fc3e72 | 2998 | if (mode == TYPE_MODE (build_pointer_type (char_type_node))) |
61b9b73c | 2999 | return (unsignedp |
3000 | ? make_unsigned_type (GET_MODE_PRECISION (mode)) | |
3001 | : make_signed_type (GET_MODE_PRECISION (mode))); | |
b0fc3e72 | 3002 | |
3003 | if (mode == TYPE_MODE (build_pointer_type (integer_type_node))) | |
61b9b73c | 3004 | return (unsignedp |
3005 | ? make_unsigned_type (GET_MODE_PRECISION (mode)) | |
3006 | : make_signed_type (GET_MODE_PRECISION (mode))); | |
b0fc3e72 | 3007 | |
0dfc45b5 | 3008 | if (COMPLEX_MODE_P (mode)) |
3009 | { | |
3010 | enum machine_mode inner_mode; | |
3011 | tree inner_type; | |
3012 | ||
3013 | if (mode == TYPE_MODE (complex_float_type_node)) | |
3014 | return complex_float_type_node; | |
3015 | if (mode == TYPE_MODE (complex_double_type_node)) | |
3016 | return complex_double_type_node; | |
3017 | if (mode == TYPE_MODE (complex_long_double_type_node)) | |
3018 | return complex_long_double_type_node; | |
3019 | ||
3020 | if (mode == TYPE_MODE (complex_integer_type_node) && !unsignedp) | |
3021 | return complex_integer_type_node; | |
3022 | ||
3023 | inner_mode = GET_MODE_INNER (mode); | |
3024 | inner_type = c_common_type_for_mode (inner_mode, unsignedp); | |
3025 | if (inner_type != NULL_TREE) | |
3026 | return build_complex_type (inner_type); | |
3027 | } | |
3028 | else if (VECTOR_MODE_P (mode)) | |
4917c376 | 3029 | { |
3030 | enum machine_mode inner_mode = GET_MODE_INNER (mode); | |
3031 | tree inner_type = c_common_type_for_mode (inner_mode, unsignedp); | |
3032 | if (inner_type != NULL_TREE) | |
3033 | return build_vector_type_for_mode (inner_type, mode); | |
88ae7f04 | 3034 | } |
e2ea7e3a | 3035 | |
c4503c0a | 3036 | if (mode == TYPE_MODE (dfloat32_type_node)) |
3037 | return dfloat32_type_node; | |
3038 | if (mode == TYPE_MODE (dfloat64_type_node)) | |
3039 | return dfloat64_type_node; | |
3040 | if (mode == TYPE_MODE (dfloat128_type_node)) | |
3041 | return dfloat128_type_node; | |
3042 | ||
9421ebb9 | 3043 | if (ALL_SCALAR_FIXED_POINT_MODE_P (mode)) |
3044 | { | |
3045 | if (mode == TYPE_MODE (short_fract_type_node)) | |
3046 | return unsignedp ? sat_short_fract_type_node : short_fract_type_node; | |
3047 | if (mode == TYPE_MODE (fract_type_node)) | |
3048 | return unsignedp ? sat_fract_type_node : fract_type_node; | |
3049 | if (mode == TYPE_MODE (long_fract_type_node)) | |
3050 | return unsignedp ? sat_long_fract_type_node : long_fract_type_node; | |
3051 | if (mode == TYPE_MODE (long_long_fract_type_node)) | |
3052 | return unsignedp ? sat_long_long_fract_type_node | |
3053 | : long_long_fract_type_node; | |
3054 | ||
3055 | if (mode == TYPE_MODE (unsigned_short_fract_type_node)) | |
3056 | return unsignedp ? sat_unsigned_short_fract_type_node | |
3057 | : unsigned_short_fract_type_node; | |
3058 | if (mode == TYPE_MODE (unsigned_fract_type_node)) | |
3059 | return unsignedp ? sat_unsigned_fract_type_node | |
3060 | : unsigned_fract_type_node; | |
3061 | if (mode == TYPE_MODE (unsigned_long_fract_type_node)) | |
3062 | return unsignedp ? sat_unsigned_long_fract_type_node | |
3063 | : unsigned_long_fract_type_node; | |
3064 | if (mode == TYPE_MODE (unsigned_long_long_fract_type_node)) | |
3065 | return unsignedp ? sat_unsigned_long_long_fract_type_node | |
3066 | : unsigned_long_long_fract_type_node; | |
3067 | ||
3068 | if (mode == TYPE_MODE (short_accum_type_node)) | |
3069 | return unsignedp ? sat_short_accum_type_node : short_accum_type_node; | |
3070 | if (mode == TYPE_MODE (accum_type_node)) | |
3071 | return unsignedp ? sat_accum_type_node : accum_type_node; | |
3072 | if (mode == TYPE_MODE (long_accum_type_node)) | |
3073 | return unsignedp ? sat_long_accum_type_node : long_accum_type_node; | |
3074 | if (mode == TYPE_MODE (long_long_accum_type_node)) | |
3075 | return unsignedp ? sat_long_long_accum_type_node | |
3076 | : long_long_accum_type_node; | |
3077 | ||
3078 | if (mode == TYPE_MODE (unsigned_short_accum_type_node)) | |
3079 | return unsignedp ? sat_unsigned_short_accum_type_node | |
3080 | : unsigned_short_accum_type_node; | |
3081 | if (mode == TYPE_MODE (unsigned_accum_type_node)) | |
3082 | return unsignedp ? sat_unsigned_accum_type_node | |
3083 | : unsigned_accum_type_node; | |
3084 | if (mode == TYPE_MODE (unsigned_long_accum_type_node)) | |
3085 | return unsignedp ? sat_unsigned_long_accum_type_node | |
3086 | : unsigned_long_accum_type_node; | |
3087 | if (mode == TYPE_MODE (unsigned_long_long_accum_type_node)) | |
3088 | return unsignedp ? sat_unsigned_long_long_accum_type_node | |
3089 | : unsigned_long_long_accum_type_node; | |
3090 | ||
3091 | if (mode == QQmode) | |
3092 | return unsignedp ? sat_qq_type_node : qq_type_node; | |
3093 | if (mode == HQmode) | |
3094 | return unsignedp ? sat_hq_type_node : hq_type_node; | |
3095 | if (mode == SQmode) | |
3096 | return unsignedp ? sat_sq_type_node : sq_type_node; | |
3097 | if (mode == DQmode) | |
3098 | return unsignedp ? sat_dq_type_node : dq_type_node; | |
3099 | if (mode == TQmode) | |
3100 | return unsignedp ? sat_tq_type_node : tq_type_node; | |
3101 | ||
3102 | if (mode == UQQmode) | |
3103 | return unsignedp ? sat_uqq_type_node : uqq_type_node; | |
3104 | if (mode == UHQmode) | |
3105 | return unsignedp ? sat_uhq_type_node : uhq_type_node; | |
3106 | if (mode == USQmode) | |
3107 | return unsignedp ? sat_usq_type_node : usq_type_node; | |
3108 | if (mode == UDQmode) | |
3109 | return unsignedp ? sat_udq_type_node : udq_type_node; | |
3110 | if (mode == UTQmode) | |
3111 | return unsignedp ? sat_utq_type_node : utq_type_node; | |
3112 | ||
3113 | if (mode == HAmode) | |
3114 | return unsignedp ? sat_ha_type_node : ha_type_node; | |
3115 | if (mode == SAmode) | |
3116 | return unsignedp ? sat_sa_type_node : sa_type_node; | |
3117 | if (mode == DAmode) | |
3118 | return unsignedp ? sat_da_type_node : da_type_node; | |
3119 | if (mode == TAmode) | |
3120 | return unsignedp ? sat_ta_type_node : ta_type_node; | |
3121 | ||
3122 | if (mode == UHAmode) | |
3123 | return unsignedp ? sat_uha_type_node : uha_type_node; | |
3124 | if (mode == USAmode) | |
3125 | return unsignedp ? sat_usa_type_node : usa_type_node; | |
3126 | if (mode == UDAmode) | |
3127 | return unsignedp ? sat_uda_type_node : uda_type_node; | |
3128 | if (mode == UTAmode) | |
3129 | return unsignedp ? sat_uta_type_node : uta_type_node; | |
3130 | } | |
3131 | ||
5b247e9f | 3132 | for (t = registered_builtin_types; t; t = TREE_CHAIN (t)) |
3133 | if (TYPE_MODE (TREE_VALUE (t)) == mode) | |
3134 | return TREE_VALUE (t); | |
3135 | ||
b0fc3e72 | 3136 | return 0; |
3137 | } | |
20d39783 | 3138 | |
11773141 | 3139 | tree |
3140 | c_common_unsigned_type (tree type) | |
3141 | { | |
3142 | return c_common_signed_or_unsigned_type (1, type); | |
3143 | } | |
3144 | ||
20d39783 | 3145 | /* Return a signed type the same as TYPE in other respects. */ |
3146 | ||
3147 | tree | |
1cae46be | 3148 | c_common_signed_type (tree type) |
20d39783 | 3149 | { |
4070745f | 3150 | return c_common_signed_or_unsigned_type (0, type); |
20d39783 | 3151 | } |
3152 | ||
3153 | /* Return a type the same as TYPE except unsigned or | |
3154 | signed according to UNSIGNEDP. */ | |
3155 | ||
3156 | tree | |
1cae46be | 3157 | c_common_signed_or_unsigned_type (int unsignedp, tree type) |
20d39783 | 3158 | { |
7a91101f | 3159 | tree type1; |
20d39783 | 3160 | |
7a91101f | 3161 | /* This block of code emulates the behavior of the old |
3162 | c_common_unsigned_type. In particular, it returns | |
3163 | long_unsigned_type_node if passed a long, even when a int would | |
3164 | have the same size. This is necessary for warnings to work | |
3165 | correctly in archs where sizeof(int) == sizeof(long) */ | |
3166 | ||
3167 | type1 = TYPE_MAIN_VARIANT (type); | |
3168 | if (type1 == signed_char_type_node || type1 == char_type_node || type1 == unsigned_char_type_node) | |
3169 | return unsignedp ? unsigned_char_type_node : signed_char_type_node; | |
3170 | if (type1 == integer_type_node || type1 == unsigned_type_node) | |
3171 | return unsignedp ? unsigned_type_node : integer_type_node; | |
3172 | if (type1 == short_integer_type_node || type1 == short_unsigned_type_node) | |
3173 | return unsignedp ? short_unsigned_type_node : short_integer_type_node; | |
3174 | if (type1 == long_integer_type_node || type1 == long_unsigned_type_node) | |
3175 | return unsignedp ? long_unsigned_type_node : long_integer_type_node; | |
3176 | if (type1 == long_long_integer_type_node || type1 == long_long_unsigned_type_node) | |
3177 | return unsignedp ? long_long_unsigned_type_node : long_long_integer_type_node; | |
3178 | if (type1 == widest_integer_literal_type_node || type1 == widest_unsigned_literal_type_node) | |
3179 | return unsignedp ? widest_unsigned_literal_type_node : widest_integer_literal_type_node; | |
3180 | #if HOST_BITS_PER_WIDE_INT >= 64 | |
3181 | if (type1 == intTI_type_node || type1 == unsigned_intTI_type_node) | |
3182 | return unsignedp ? unsigned_intTI_type_node : intTI_type_node; | |
3183 | #endif | |
3184 | if (type1 == intDI_type_node || type1 == unsigned_intDI_type_node) | |
3185 | return unsignedp ? unsigned_intDI_type_node : intDI_type_node; | |
3186 | if (type1 == intSI_type_node || type1 == unsigned_intSI_type_node) | |
3187 | return unsignedp ? unsigned_intSI_type_node : intSI_type_node; | |
3188 | if (type1 == intHI_type_node || type1 == unsigned_intHI_type_node) | |
3189 | return unsignedp ? unsigned_intHI_type_node : intHI_type_node; | |
3190 | if (type1 == intQI_type_node || type1 == unsigned_intQI_type_node) | |
3191 | return unsignedp ? unsigned_intQI_type_node : intQI_type_node; | |
3192 | ||
9f92e1a2 | 3193 | #define C_COMMON_FIXED_TYPES(NAME) \ |
3194 | if (type1 == short_ ## NAME ## _type_node \ | |
3195 | || type1 == unsigned_short_ ## NAME ## _type_node) \ | |
3196 | return unsignedp ? unsigned_short_ ## NAME ## _type_node \ | |
3197 | : short_ ## NAME ## _type_node; \ | |
3198 | if (type1 == NAME ## _type_node \ | |
3199 | || type1 == unsigned_ ## NAME ## _type_node) \ | |
3200 | return unsignedp ? unsigned_ ## NAME ## _type_node \ | |
3201 | : NAME ## _type_node; \ | |
3202 | if (type1 == long_ ## NAME ## _type_node \ | |
3203 | || type1 == unsigned_long_ ## NAME ## _type_node) \ | |
3204 | return unsignedp ? unsigned_long_ ## NAME ## _type_node \ | |
3205 | : long_ ## NAME ## _type_node; \ | |
3206 | if (type1 == long_long_ ## NAME ## _type_node \ | |
3207 | || type1 == unsigned_long_long_ ## NAME ## _type_node) \ | |
3208 | return unsignedp ? unsigned_long_long_ ## NAME ## _type_node \ | |
3209 | : long_long_ ## NAME ## _type_node; | |
3210 | ||
3211 | #define C_COMMON_FIXED_MODE_TYPES(NAME) \ | |
3212 | if (type1 == NAME ## _type_node \ | |
3213 | || type1 == u ## NAME ## _type_node) \ | |
3214 | return unsignedp ? u ## NAME ## _type_node \ | |
3215 | : NAME ## _type_node; | |
3216 | ||
3217 | #define C_COMMON_FIXED_TYPES_SAT(NAME) \ | |
3218 | if (type1 == sat_ ## short_ ## NAME ## _type_node \ | |
3219 | || type1 == sat_ ## unsigned_short_ ## NAME ## _type_node) \ | |
3220 | return unsignedp ? sat_ ## unsigned_short_ ## NAME ## _type_node \ | |
3221 | : sat_ ## short_ ## NAME ## _type_node; \ | |
3222 | if (type1 == sat_ ## NAME ## _type_node \ | |
3223 | || type1 == sat_ ## unsigned_ ## NAME ## _type_node) \ | |
3224 | return unsignedp ? sat_ ## unsigned_ ## NAME ## _type_node \ | |
3225 | : sat_ ## NAME ## _type_node; \ | |
3226 | if (type1 == sat_ ## long_ ## NAME ## _type_node \ | |
3227 | || type1 == sat_ ## unsigned_long_ ## NAME ## _type_node) \ | |
3228 | return unsignedp ? sat_ ## unsigned_long_ ## NAME ## _type_node \ | |
3229 | : sat_ ## long_ ## NAME ## _type_node; \ | |
3230 | if (type1 == sat_ ## long_long_ ## NAME ## _type_node \ | |
3231 | || type1 == sat_ ## unsigned_long_long_ ## NAME ## _type_node) \ | |
3232 | return unsignedp ? sat_ ## unsigned_long_long_ ## NAME ## _type_node \ | |
3233 | : sat_ ## long_long_ ## NAME ## _type_node; | |
3234 | ||
3235 | #define C_COMMON_FIXED_MODE_TYPES_SAT(NAME) \ | |
3236 | if (type1 == sat_ ## NAME ## _type_node \ | |
3237 | || type1 == sat_ ## u ## NAME ## _type_node) \ | |
3238 | return unsignedp ? sat_ ## u ## NAME ## _type_node \ | |
3239 | : sat_ ## NAME ## _type_node; | |
3240 | ||
3241 | C_COMMON_FIXED_TYPES (fract); | |
3242 | C_COMMON_FIXED_TYPES_SAT (fract); | |
3243 | C_COMMON_FIXED_TYPES (accum); | |
3244 | C_COMMON_FIXED_TYPES_SAT (accum); | |
3245 | ||
3246 | C_COMMON_FIXED_MODE_TYPES (qq); | |
3247 | C_COMMON_FIXED_MODE_TYPES (hq); | |
3248 | C_COMMON_FIXED_MODE_TYPES (sq); | |
3249 | C_COMMON_FIXED_MODE_TYPES (dq); | |
3250 | C_COMMON_FIXED_MODE_TYPES (tq); | |
3251 | C_COMMON_FIXED_MODE_TYPES_SAT (qq); | |
3252 | C_COMMON_FIXED_MODE_TYPES_SAT (hq); | |
3253 | C_COMMON_FIXED_MODE_TYPES_SAT (sq); | |
3254 | C_COMMON_FIXED_MODE_TYPES_SAT (dq); | |
3255 | C_COMMON_FIXED_MODE_TYPES_SAT (tq); | |
3256 | C_COMMON_FIXED_MODE_TYPES (ha); | |
3257 | C_COMMON_FIXED_MODE_TYPES (sa); | |
3258 | C_COMMON_FIXED_MODE_TYPES (da); | |
3259 | C_COMMON_FIXED_MODE_TYPES (ta); | |
3260 | C_COMMON_FIXED_MODE_TYPES_SAT (ha); | |
3261 | C_COMMON_FIXED_MODE_TYPES_SAT (sa); | |
3262 | C_COMMON_FIXED_MODE_TYPES_SAT (da); | |
3263 | C_COMMON_FIXED_MODE_TYPES_SAT (ta); | |
9421ebb9 | 3264 | |
4f7f7efd | 3265 | /* For ENUMERAL_TYPEs in C++, must check the mode of the types, not |
3266 | the precision; they have precision set to match their range, but | |
3267 | may use a wider mode to match an ABI. If we change modes, we may | |
3268 | wind up with bad conversions. For INTEGER_TYPEs in C, must check | |
3269 | the precision as well, so as to yield correct results for | |
3270 | bit-field types. C++ does not have these separate bit-field | |
3271 | types, and producing a signed or unsigned variant of an | |
3272 | ENUMERAL_TYPE may cause other problems as well. */ | |
3273 | ||
ac265864 | 3274 | if (!INTEGRAL_TYPE_P (type) |
3275 | || TYPE_UNSIGNED (type) == unsignedp) | |
3276 | return type; | |
3277 | ||
4f7f7efd | 3278 | #define TYPE_OK(node) \ |
3279 | (TYPE_MODE (type) == TYPE_MODE (node) \ | |
0c4abe5b | 3280 | && TYPE_PRECISION (type) == TYPE_PRECISION (node)) |
4f7f7efd | 3281 | if (TYPE_OK (signed_char_type_node)) |
20d39783 | 3282 | return unsignedp ? unsigned_char_type_node : signed_char_type_node; |
4f7f7efd | 3283 | if (TYPE_OK (integer_type_node)) |
20d39783 | 3284 | return unsignedp ? unsigned_type_node : integer_type_node; |
4f7f7efd | 3285 | if (TYPE_OK (short_integer_type_node)) |
20d39783 | 3286 | return unsignedp ? short_unsigned_type_node : short_integer_type_node; |
4f7f7efd | 3287 | if (TYPE_OK (long_integer_type_node)) |
20d39783 | 3288 | return unsignedp ? long_unsigned_type_node : long_integer_type_node; |
4f7f7efd | 3289 | if (TYPE_OK (long_long_integer_type_node)) |
20d39783 | 3290 | return (unsignedp ? long_long_unsigned_type_node |
3291 | : long_long_integer_type_node); | |
4f7f7efd | 3292 | if (TYPE_OK (widest_integer_literal_type_node)) |
20d39783 | 3293 | return (unsignedp ? widest_unsigned_literal_type_node |
3294 | : widest_integer_literal_type_node); | |
ef11801e | 3295 | |
3296 | #if HOST_BITS_PER_WIDE_INT >= 64 | |
4f7f7efd | 3297 | if (TYPE_OK (intTI_type_node)) |
ef11801e | 3298 | return unsignedp ? unsigned_intTI_type_node : intTI_type_node; |
3299 | #endif | |
4f7f7efd | 3300 | if (TYPE_OK (intDI_type_node)) |
ef11801e | 3301 | return unsignedp ? unsigned_intDI_type_node : intDI_type_node; |
4f7f7efd | 3302 | if (TYPE_OK (intSI_type_node)) |
ef11801e | 3303 | return unsignedp ? unsigned_intSI_type_node : intSI_type_node; |
4f7f7efd | 3304 | if (TYPE_OK (intHI_type_node)) |
ef11801e | 3305 | return unsignedp ? unsigned_intHI_type_node : intHI_type_node; |
4f7f7efd | 3306 | if (TYPE_OK (intQI_type_node)) |
ef11801e | 3307 | return unsignedp ? unsigned_intQI_type_node : intQI_type_node; |
4f7f7efd | 3308 | #undef TYPE_OK |
ef11801e | 3309 | |
0c4abe5b | 3310 | return build_nonstandard_integer_type (TYPE_PRECISION (type), unsignedp); |
20d39783 | 3311 | } |
b268e47e | 3312 | |
c0e47fd4 | 3313 | /* Build a bit-field integer type for the given WIDTH and UNSIGNEDP. */ |
3314 | ||
3315 | tree | |
3316 | c_build_bitfield_integer_type (unsigned HOST_WIDE_INT width, int unsignedp) | |
3317 | { | |
3318 | /* Extended integer types of the same width as a standard type have | |
3319 | lesser rank, so those of the same width as int promote to int or | |
3320 | unsigned int and are valid for printf formats expecting int or | |
3321 | unsigned int. To avoid such special cases, avoid creating | |
3322 | extended integer types for bit-fields if a standard integer type | |
3323 | is available. */ | |
3324 | if (width == TYPE_PRECISION (integer_type_node)) | |
3325 | return unsignedp ? unsigned_type_node : integer_type_node; | |
3326 | if (width == TYPE_PRECISION (signed_char_type_node)) | |
3327 | return unsignedp ? unsigned_char_type_node : signed_char_type_node; | |
3328 | if (width == TYPE_PRECISION (short_integer_type_node)) | |
3329 | return unsignedp ? short_unsigned_type_node : short_integer_type_node; | |
3330 | if (width == TYPE_PRECISION (long_integer_type_node)) | |
3331 | return unsignedp ? long_unsigned_type_node : long_integer_type_node; | |
3332 | if (width == TYPE_PRECISION (long_long_integer_type_node)) | |
3333 | return (unsignedp ? long_long_unsigned_type_node | |
3334 | : long_long_integer_type_node); | |
3335 | return build_nonstandard_integer_type (width, unsignedp); | |
3336 | } | |
3337 | ||
b268e47e | 3338 | /* The C version of the register_builtin_type langhook. */ |
3339 | ||
3340 | void | |
3341 | c_register_builtin_type (tree type, const char* name) | |
3342 | { | |
3343 | tree decl; | |
3344 | ||
3345 | decl = build_decl (TYPE_DECL, get_identifier (name), type); | |
3346 | DECL_ARTIFICIAL (decl) = 1; | |
3347 | if (!TYPE_NAME (type)) | |
3348 | TYPE_NAME (type) = decl; | |
3349 | pushdecl (decl); | |
5b247e9f | 3350 | |
3351 | registered_builtin_types = tree_cons (0, type, registered_builtin_types); | |
b268e47e | 3352 | } |
a9b9d10c | 3353 | \f |
aff9e656 | 3354 | /* Print an error message for invalid operands to arith operation |
8e70fb09 | 3355 | CODE with TYPE0 for operand 0, and TYPE1 for operand 1. |
3356 | LOCATION is the location of the message. */ | |
b0fc3e72 | 3357 | |
3358 | void | |
8e70fb09 | 3359 | binary_op_error (location_t location, enum tree_code code, |
3360 | tree type0, tree type1) | |
b0fc3e72 | 3361 | { |
19cb6b50 | 3362 | const char *opname; |
f03946e4 | 3363 | |
b0fc3e72 | 3364 | switch (code) |
3365 | { | |
b0fc3e72 | 3366 | case PLUS_EXPR: |
3367 | opname = "+"; break; | |
3368 | case MINUS_EXPR: | |
3369 | opname = "-"; break; | |
3370 | case MULT_EXPR: | |
3371 | opname = "*"; break; | |
3372 | case MAX_EXPR: | |
3373 | opname = "max"; break; | |
3374 | case MIN_EXPR: | |
3375 | opname = "min"; break; | |
3376 | case EQ_EXPR: | |
3377 | opname = "=="; break; | |
3378 | case NE_EXPR: | |
3379 | opname = "!="; break; | |
3380 | case LE_EXPR: | |
3381 | opname = "<="; break; | |
3382 | case GE_EXPR: | |
3383 | opname = ">="; break; | |
3384 | case LT_EXPR: | |
3385 | opname = "<"; break; | |
3386 | case GT_EXPR: | |
3387 | opname = ">"; break; | |
3388 | case LSHIFT_EXPR: | |
3389 | opname = "<<"; break; | |
3390 | case RSHIFT_EXPR: | |
3391 | opname = ">>"; break; | |
3392 | case TRUNC_MOD_EXPR: | |
66618a1e | 3393 | case FLOOR_MOD_EXPR: |
b0fc3e72 | 3394 | opname = "%"; break; |
3395 | case TRUNC_DIV_EXPR: | |
66618a1e | 3396 | case FLOOR_DIV_EXPR: |
b0fc3e72 | 3397 | opname = "/"; break; |
3398 | case BIT_AND_EXPR: | |
3399 | opname = "&"; break; | |
3400 | case BIT_IOR_EXPR: | |
3401 | opname = "|"; break; | |
3402 | case TRUTH_ANDIF_EXPR: | |
3403 | opname = "&&"; break; | |
3404 | case TRUTH_ORIF_EXPR: | |
3405 | opname = "||"; break; | |
3406 | case BIT_XOR_EXPR: | |
3407 | opname = "^"; break; | |
31f820d2 | 3408 | default: |
315ba355 | 3409 | gcc_unreachable (); |
b0fc3e72 | 3410 | } |
8e70fb09 | 3411 | error_at (location, |
3412 | "invalid operands to binary %s (have %qT and %qT)", opname, | |
3413 | type0, type1); | |
b0fc3e72 | 3414 | } |
3415 | \f | |
3416 | /* Subroutine of build_binary_op, used for comparison operations. | |
3417 | See if the operands have both been converted from subword integer types | |
3418 | and, if so, perhaps change them both back to their original type. | |
5b511807 | 3419 | This function is also responsible for converting the two operands |
3420 | to the proper common type for comparison. | |
b0fc3e72 | 3421 | |
3422 | The arguments of this function are all pointers to local variables | |
3423 | of build_binary_op: OP0_PTR is &OP0, OP1_PTR is &OP1, | |
3424 | RESTYPE_PTR is &RESULT_TYPE and RESCODE_PTR is &RESULTCODE. | |
3425 | ||
3426 | If this function returns nonzero, it means that the comparison has | |
3427 | a constant value. What this function returns is an expression for | |
3428 | that value. */ | |
3429 | ||
3430 | tree | |
1cae46be | 3431 | shorten_compare (tree *op0_ptr, tree *op1_ptr, tree *restype_ptr, |
3432 | enum tree_code *rescode_ptr) | |
b0fc3e72 | 3433 | { |
19cb6b50 | 3434 | tree type; |
b0fc3e72 | 3435 | tree op0 = *op0_ptr; |
3436 | tree op1 = *op1_ptr; | |
3437 | int unsignedp0, unsignedp1; | |
3438 | int real1, real2; | |
3439 | tree primop0, primop1; | |
3440 | enum tree_code code = *rescode_ptr; | |
3441 | ||
3442 | /* Throw away any conversions to wider types | |
3443 | already present in the operands. */ | |
3444 | ||
3445 | primop0 = get_narrower (op0, &unsignedp0); | |
3446 | primop1 = get_narrower (op1, &unsignedp1); | |
3447 | ||
3448 | /* Handle the case that OP0 does not *contain* a conversion | |
3449 | but it *requires* conversion to FINAL_TYPE. */ | |
3450 | ||
3451 | if (op0 == primop0 && TREE_TYPE (op0) != *restype_ptr) | |
78a8ed03 | 3452 | unsignedp0 = TYPE_UNSIGNED (TREE_TYPE (op0)); |
b0fc3e72 | 3453 | if (op1 == primop1 && TREE_TYPE (op1) != *restype_ptr) |
78a8ed03 | 3454 | unsignedp1 = TYPE_UNSIGNED (TREE_TYPE (op1)); |
b0fc3e72 | 3455 | |
3456 | /* If one of the operands must be floated, we cannot optimize. */ | |
3457 | real1 = TREE_CODE (TREE_TYPE (primop0)) == REAL_TYPE; | |
3458 | real2 = TREE_CODE (TREE_TYPE (primop1)) == REAL_TYPE; | |
3459 | ||
3460 | /* If first arg is constant, swap the args (changing operation | |
2bd278cc | 3461 | so value is preserved), for canonicalization. Don't do this if |
3462 | the second arg is 0. */ | |
b0fc3e72 | 3463 | |
2bd278cc | 3464 | if (TREE_CONSTANT (primop0) |
9421ebb9 | 3465 | && !integer_zerop (primop1) && !real_zerop (primop1) |
3466 | && !fixed_zerop (primop1)) | |
b0fc3e72 | 3467 | { |
19cb6b50 | 3468 | tree tem = primop0; |
3469 | int temi = unsignedp0; | |
b0fc3e72 | 3470 | primop0 = primop1; |
3471 | primop1 = tem; | |
3472 | tem = op0; | |
3473 | op0 = op1; | |
3474 | op1 = tem; | |
3475 | *op0_ptr = op0; | |
3476 | *op1_ptr = op1; | |
3477 | unsignedp0 = unsignedp1; | |
3478 | unsignedp1 = temi; | |
3479 | temi = real1; | |
3480 | real1 = real2; | |
3481 | real2 = temi; | |
3482 | ||
3483 | switch (code) | |
3484 | { | |
3485 | case LT_EXPR: | |
3486 | code = GT_EXPR; | |
3487 | break; | |
3488 | case GT_EXPR: | |
3489 | code = LT_EXPR; | |
3490 | break; | |
3491 | case LE_EXPR: | |
3492 | code = GE_EXPR; | |
3493 | break; | |
3494 | case GE_EXPR: | |
3495 | code = LE_EXPR; | |
3496 | break; | |
31f820d2 | 3497 | default: |
3498 | break; | |
b0fc3e72 | 3499 | } |
3500 | *rescode_ptr = code; | |
3501 | } | |
3502 | ||
3503 | /* If comparing an integer against a constant more bits wide, | |
3504 | maybe we can deduce a value of 1 or 0 independent of the data. | |
3505 | Or else truncate the constant now | |
3506 | rather than extend the variable at run time. | |
3507 | ||
3508 | This is only interesting if the constant is the wider arg. | |
3509 | Also, it is not safe if the constant is unsigned and the | |
3510 | variable arg is signed, since in this case the variable | |
3511 | would be sign-extended and then regarded as unsigned. | |
3512 | Our technique fails in this case because the lowest/highest | |
3513 | possible unsigned results don't follow naturally from the | |
3514 | lowest/highest possible values of the variable operand. | |
3515 | For just EQ_EXPR and NE_EXPR there is another technique that | |
3516 | could be used: see if the constant can be faithfully represented | |
3517 | in the other operand's type, by truncating it and reextending it | |
3518 | and see if that preserves the constant's value. */ | |
3519 | ||
3520 | if (!real1 && !real2 | |
9421ebb9 | 3521 | && TREE_CODE (TREE_TYPE (primop0)) != FIXED_POINT_TYPE |
b0fc3e72 | 3522 | && TREE_CODE (primop1) == INTEGER_CST |
3523 | && TYPE_PRECISION (TREE_TYPE (primop0)) < TYPE_PRECISION (*restype_ptr)) | |
3524 | { | |
3525 | int min_gt, max_gt, min_lt, max_lt; | |
3526 | tree maxval, minval; | |
3527 | /* 1 if comparison is nominally unsigned. */ | |
78a8ed03 | 3528 | int unsignedp = TYPE_UNSIGNED (*restype_ptr); |
b0fc3e72 | 3529 | tree val; |
3530 | ||
4070745f | 3531 | type = c_common_signed_or_unsigned_type (unsignedp0, |
3532 | TREE_TYPE (primop0)); | |
cda09c61 | 3533 | |
b0fc3e72 | 3534 | maxval = TYPE_MAX_VALUE (type); |
3535 | minval = TYPE_MIN_VALUE (type); | |
3536 | ||
3537 | if (unsignedp && !unsignedp0) | |
4070745f | 3538 | *restype_ptr = c_common_signed_type (*restype_ptr); |
b0fc3e72 | 3539 | |
3540 | if (TREE_TYPE (primop1) != *restype_ptr) | |
18dbec6f | 3541 | { |
9a5e8086 | 3542 | /* Convert primop1 to target type, but do not introduce |
3543 | additional overflow. We know primop1 is an int_cst. */ | |
c8110c8f | 3544 | primop1 = force_fit_type_double (*restype_ptr, |
3545 | TREE_INT_CST_LOW (primop1), | |
3546 | TREE_INT_CST_HIGH (primop1), 0, | |
eddad94a | 3547 | TREE_OVERFLOW (primop1)); |
18dbec6f | 3548 | } |
b0fc3e72 | 3549 | if (type != *restype_ptr) |
3550 | { | |
3551 | minval = convert (*restype_ptr, minval); | |
3552 | maxval = convert (*restype_ptr, maxval); | |
3553 | } | |
3554 | ||
3555 | if (unsignedp && unsignedp0) | |
3556 | { | |
3557 | min_gt = INT_CST_LT_UNSIGNED (primop1, minval); | |
3558 | max_gt = INT_CST_LT_UNSIGNED (primop1, maxval); | |
3559 | min_lt = INT_CST_LT_UNSIGNED (minval, primop1); | |
3560 | max_lt = INT_CST_LT_UNSIGNED (maxval, primop1); | |
3561 | } | |
3562 | else | |
3563 | { | |
3564 | min_gt = INT_CST_LT (primop1, minval); | |
3565 | max_gt = INT_CST_LT (primop1, maxval); | |
3566 | min_lt = INT_CST_LT (minval, primop1); | |
3567 | max_lt = INT_CST_LT (maxval, primop1); | |
3568 | } | |
3569 | ||
3570 | val = 0; | |
3571 | /* This used to be a switch, but Genix compiler can't handle that. */ | |
3572 | if (code == NE_EXPR) | |
3573 | { | |
3574 | if (max_lt || min_gt) | |
3c2239cf | 3575 | val = truthvalue_true_node; |
b0fc3e72 | 3576 | } |
3577 | else if (code == EQ_EXPR) | |
3578 | { | |
3579 | if (max_lt || min_gt) | |
3c2239cf | 3580 | val = truthvalue_false_node; |
b0fc3e72 | 3581 | } |
3582 | else if (code == LT_EXPR) | |
3583 | { | |
3584 | if (max_lt) | |
3c2239cf | 3585 | val = truthvalue_true_node; |
b0fc3e72 | 3586 | if (!min_lt) |
3c2239cf | 3587 | val = truthvalue_false_node; |
b0fc3e72 | 3588 | } |
3589 | else if (code == GT_EXPR) | |
3590 | { | |
3591 | if (min_gt) | |
3c2239cf | 3592 | val = truthvalue_true_node; |
b0fc3e72 | 3593 | if (!max_gt) |
3c2239cf | 3594 | val = truthvalue_false_node; |
b0fc3e72 | 3595 | } |
3596 | else if (code == LE_EXPR) | |
3597 | { | |
3598 | if (!max_gt) | |
3c2239cf | 3599 | val = truthvalue_true_node; |
b0fc3e72 | 3600 | if (min_gt) |
3c2239cf | 3601 | val = truthvalue_false_node; |
b0fc3e72 | 3602 | } |
3603 | else if (code == GE_EXPR) | |
3604 | { | |
3605 | if (!min_lt) | |
3c2239cf | 3606 | val = truthvalue_true_node; |
b0fc3e72 | 3607 | if (max_lt) |
3c2239cf | 3608 | val = truthvalue_false_node; |
b0fc3e72 | 3609 | } |
3610 | ||
3611 | /* If primop0 was sign-extended and unsigned comparison specd, | |
3612 | we did a signed comparison above using the signed type bounds. | |
3613 | But the comparison we output must be unsigned. | |
3614 | ||
3615 | Also, for inequalities, VAL is no good; but if the signed | |
3616 | comparison had *any* fixed result, it follows that the | |
3617 | unsigned comparison just tests the sign in reverse | |
3618 | (positive values are LE, negative ones GE). | |
3619 | So we can generate an unsigned comparison | |
3620 | against an extreme value of the signed type. */ | |
3621 | ||
3622 | if (unsignedp && !unsignedp0) | |
3623 | { | |
3624 | if (val != 0) | |
3625 | switch (code) | |
3626 | { | |
3627 | case LT_EXPR: | |
3628 | case GE_EXPR: | |
3629 | primop1 = TYPE_MIN_VALUE (type); | |
3630 | val = 0; | |
3631 | break; | |
3632 | ||
3633 | case LE_EXPR: | |
3634 | case GT_EXPR: | |
3635 | primop1 = TYPE_MAX_VALUE (type); | |
3636 | val = 0; | |
3637 | break; | |
31f820d2 | 3638 | |
3639 | default: | |
3640 | break; | |
b0fc3e72 | 3641 | } |
11773141 | 3642 | type = c_common_unsigned_type (type); |
b0fc3e72 | 3643 | } |
3644 | ||
fe5f2366 | 3645 | if (TREE_CODE (primop0) != INTEGER_CST) |
b0fc3e72 | 3646 | { |
3c2239cf | 3647 | if (val == truthvalue_false_node) |
e6e352cb | 3648 | warning (OPT_Wtype_limits, "comparison is always false due to limited range of data type"); |
3c2239cf | 3649 | if (val == truthvalue_true_node) |
e6e352cb | 3650 | warning (OPT_Wtype_limits, "comparison is always true due to limited range of data type"); |
b0fc3e72 | 3651 | } |
3652 | ||
3653 | if (val != 0) | |
3654 | { | |
3655 | /* Don't forget to evaluate PRIMOP0 if it has side effects. */ | |
3656 | if (TREE_SIDE_EFFECTS (primop0)) | |
14ae0310 | 3657 | return build2 (COMPOUND_EXPR, TREE_TYPE (val), primop0, val); |
b0fc3e72 | 3658 | return val; |
3659 | } | |
3660 | ||
3661 | /* Value is not predetermined, but do the comparison | |
3662 | in the type of the operand that is not constant. | |
3663 | TYPE is already properly set. */ | |
3664 | } | |
c4503c0a | 3665 | |
3666 | /* If either arg is decimal float and the other is float, find the | |
3667 | proper common type to use for comparison. */ | |
3668 | else if (real1 && real2 | |
3669 | && (DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (primop0))) | |
3670 | || DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (primop1))))) | |
3671 | type = common_type (TREE_TYPE (primop0), TREE_TYPE (primop1)); | |
3672 | ||
b0fc3e72 | 3673 | else if (real1 && real2 |
2203bd5c | 3674 | && (TYPE_PRECISION (TREE_TYPE (primop0)) |
3675 | == TYPE_PRECISION (TREE_TYPE (primop1)))) | |
b0fc3e72 | 3676 | type = TREE_TYPE (primop0); |
3677 | ||
3678 | /* If args' natural types are both narrower than nominal type | |
3679 | and both extend in the same manner, compare them | |
3680 | in the type of the wider arg. | |
3681 | Otherwise must actually extend both to the nominal | |
3682 | common type lest different ways of extending | |
3683 | alter the result. | |
3684 | (eg, (short)-1 == (unsigned short)-1 should be 0.) */ | |
3685 | ||
3686 | else if (unsignedp0 == unsignedp1 && real1 == real2 | |
3687 | && TYPE_PRECISION (TREE_TYPE (primop0)) < TYPE_PRECISION (*restype_ptr) | |
3688 | && TYPE_PRECISION (TREE_TYPE (primop1)) < TYPE_PRECISION (*restype_ptr)) | |
3689 | { | |
3690 | type = common_type (TREE_TYPE (primop0), TREE_TYPE (primop1)); | |
4070745f | 3691 | type = c_common_signed_or_unsigned_type (unsignedp0 |
78a8ed03 | 3692 | || TYPE_UNSIGNED (*restype_ptr), |
4070745f | 3693 | type); |
b0fc3e72 | 3694 | /* Make sure shorter operand is extended the right way |
3695 | to match the longer operand. */ | |
4070745f | 3696 | primop0 |
3697 | = convert (c_common_signed_or_unsigned_type (unsignedp0, | |
3698 | TREE_TYPE (primop0)), | |
3699 | primop0); | |
3700 | primop1 | |
3701 | = convert (c_common_signed_or_unsigned_type (unsignedp1, | |
3702 | TREE_TYPE (primop1)), | |
3703 | primop1); | |
b0fc3e72 | 3704 | } |
3705 | else | |
3706 | { | |
3707 | /* Here we must do the comparison on the nominal type | |
3708 | using the args exactly as we received them. */ | |
3709 | type = *restype_ptr; | |
3710 | primop0 = op0; | |
3711 | primop1 = op1; | |
3712 | ||
3713 | if (!real1 && !real2 && integer_zerop (primop1) | |
78a8ed03 | 3714 | && TYPE_UNSIGNED (*restype_ptr)) |
b0fc3e72 | 3715 | { |
3716 | tree value = 0; | |
3717 | switch (code) | |
3718 | { | |
3719 | case GE_EXPR: | |
e6e352cb | 3720 | /* All unsigned values are >= 0, so we warn. However, |
3721 | if OP0 is a constant that is >= 0, the signedness of | |
3722 | the comparison isn't an issue, so suppress the | |
3723 | warning. */ | |
3724 | if (warn_type_limits && !in_system_header | |
84166705 | 3725 | && !(TREE_CODE (primop0) == INTEGER_CST |
3726 | && !TREE_OVERFLOW (convert (c_common_signed_type (type), | |
3727 | primop0)))) | |
e6e352cb | 3728 | warning (OPT_Wtype_limits, |
3729 | "comparison of unsigned expression >= 0 is always true"); | |
3c2239cf | 3730 | value = truthvalue_true_node; |
b0fc3e72 | 3731 | break; |
3732 | ||
3733 | case LT_EXPR: | |
e6e352cb | 3734 | if (warn_type_limits && !in_system_header |
84166705 | 3735 | && !(TREE_CODE (primop0) == INTEGER_CST |
3736 | && !TREE_OVERFLOW (convert (c_common_signed_type (type), | |
3737 | primop0)))) | |
e6e352cb | 3738 | warning (OPT_Wtype_limits, |
3739 | "comparison of unsigned expression < 0 is always false"); | |
3c2239cf | 3740 | value = truthvalue_false_node; |
31f820d2 | 3741 | break; |
3742 | ||
3743 | default: | |
3744 | break; | |
b0fc3e72 | 3745 | } |
3746 | ||
3747 | if (value != 0) | |
3748 | { | |
3749 | /* Don't forget to evaluate PRIMOP0 if it has side effects. */ | |
3750 | if (TREE_SIDE_EFFECTS (primop0)) | |
14ae0310 | 3751 | return build2 (COMPOUND_EXPR, TREE_TYPE (value), |
3752 | primop0, value); | |
b0fc3e72 | 3753 | return value; |
3754 | } | |
3755 | } | |
3756 | } | |
3757 | ||
3758 | *op0_ptr = convert (type, primop0); | |
3759 | *op1_ptr = convert (type, primop1); | |
3760 | ||
3c2239cf | 3761 | *restype_ptr = truthvalue_type_node; |
b0fc3e72 | 3762 | |
3763 | return 0; | |
3764 | } | |
3765 | \f | |
1c26100f | 3766 | /* Return a tree for the sum or difference (RESULTCODE says which) |
3767 | of pointer PTROP and integer INTOP. */ | |
3768 | ||
3769 | tree | |
d924b670 | 3770 | pointer_int_sum (location_t location, enum tree_code resultcode, |
3771 | tree ptrop, tree intop) | |
1c26100f | 3772 | { |
add6ee5e | 3773 | tree size_exp, ret; |
1c26100f | 3774 | |
1c26100f | 3775 | /* The result is a pointer of the same type that is being added. */ |
1c26100f | 3776 | tree result_type = TREE_TYPE (ptrop); |
3777 | ||
3778 | if (TREE_CODE (TREE_TYPE (result_type)) == VOID_TYPE) | |
3779 | { | |
d924b670 | 3780 | pedwarn (location, pedantic ? OPT_pedantic : OPT_Wpointer_arith, |
8864917d | 3781 | "pointer of type %<void *%> used in arithmetic"); |
1c26100f | 3782 | size_exp = integer_one_node; |
3783 | } | |
3784 | else if (TREE_CODE (TREE_TYPE (result_type)) == FUNCTION_TYPE) | |
3785 | { | |
d924b670 | 3786 | pedwarn (location, pedantic ? OPT_pedantic : OPT_Wpointer_arith, |
8864917d | 3787 | "pointer to a function used in arithmetic"); |
1c26100f | 3788 | size_exp = integer_one_node; |
3789 | } | |
3790 | else if (TREE_CODE (TREE_TYPE (result_type)) == METHOD_TYPE) | |
3791 | { | |
d924b670 | 3792 | pedwarn (location, pedantic ? OPT_pedantic : OPT_Wpointer_arith, |
8864917d | 3793 | "pointer to member function used in arithmetic"); |
1c26100f | 3794 | size_exp = integer_one_node; |
3795 | } | |
1c26100f | 3796 | else |
3797 | size_exp = size_in_bytes (TREE_TYPE (result_type)); | |
3798 | ||
add6ee5e | 3799 | /* We are manipulating pointer values, so we don't need to warn |
3800 | about relying on undefined signed overflow. We disable the | |
3801 | warning here because we use integer types so fold won't know that | |
3802 | they are really pointers. */ | |
3803 | fold_defer_overflow_warnings (); | |
3804 | ||
1c26100f | 3805 | /* If what we are about to multiply by the size of the elements |
3806 | contains a constant term, apply distributive law | |
3807 | and multiply that constant term separately. | |
3808 | This helps produce common subexpressions. */ | |
1c26100f | 3809 | if ((TREE_CODE (intop) == PLUS_EXPR || TREE_CODE (intop) == MINUS_EXPR) |
84166705 | 3810 | && !TREE_CONSTANT (intop) |
1c26100f | 3811 | && TREE_CONSTANT (TREE_OPERAND (intop, 1)) |
3812 | && TREE_CONSTANT (size_exp) | |
3813 | /* If the constant comes from pointer subtraction, | |
3814 | skip this optimization--it would cause an error. */ | |
3815 | && TREE_CODE (TREE_TYPE (TREE_OPERAND (intop, 0))) == INTEGER_TYPE | |
3816 | /* If the constant is unsigned, and smaller than the pointer size, | |
3817 | then we must skip this optimization. This is because it could cause | |
3818 | an overflow error if the constant is negative but INTOP is not. */ | |
84166705 | 3819 | && (!TYPE_UNSIGNED (TREE_TYPE (intop)) |
1c26100f | 3820 | || (TYPE_PRECISION (TREE_TYPE (intop)) |
3821 | == TYPE_PRECISION (TREE_TYPE (ptrop))))) | |
3822 | { | |
3823 | enum tree_code subcode = resultcode; | |
3824 | tree int_type = TREE_TYPE (intop); | |
3825 | if (TREE_CODE (intop) == MINUS_EXPR) | |
3826 | subcode = (subcode == PLUS_EXPR ? MINUS_EXPR : PLUS_EXPR); | |
3827 | /* Convert both subexpression types to the type of intop, | |
3828 | because weird cases involving pointer arithmetic | |
3829 | can result in a sum or difference with different type args. */ | |
8e70fb09 | 3830 | ptrop = build_binary_op (EXPR_LOCATION (TREE_OPERAND (intop, 1)), |
3831 | subcode, ptrop, | |
1c26100f | 3832 | convert (int_type, TREE_OPERAND (intop, 1)), 1); |
3833 | intop = convert (int_type, TREE_OPERAND (intop, 0)); | |
3834 | } | |
3835 | ||
3836 | /* Convert the integer argument to a type the same size as sizetype | |
3837 | so the multiply won't overflow spuriously. */ | |
1c26100f | 3838 | if (TYPE_PRECISION (TREE_TYPE (intop)) != TYPE_PRECISION (sizetype) |
78a8ed03 | 3839 | || TYPE_UNSIGNED (TREE_TYPE (intop)) != TYPE_UNSIGNED (sizetype)) |
1cae46be | 3840 | intop = convert (c_common_type_for_size (TYPE_PRECISION (sizetype), |
78a8ed03 | 3841 | TYPE_UNSIGNED (sizetype)), intop); |
1c26100f | 3842 | |
3843 | /* Replace the integer argument with a suitable product by the object size. | |
3844 | Do this multiplication as signed, then convert to the appropriate | |
499e523f | 3845 | type for the pointer operation. */ |
3846 | intop = convert (sizetype, | |
8e70fb09 | 3847 | build_binary_op (EXPR_LOCATION (intop), |
3848 | MULT_EXPR, intop, | |
499e523f | 3849 | convert (TREE_TYPE (intop), size_exp), 1)); |
0de36bdb | 3850 | |
499e523f | 3851 | /* Create the sum or difference. */ |
0de36bdb | 3852 | if (resultcode == MINUS_EXPR) |
499e523f | 3853 | intop = fold_build1 (NEGATE_EXPR, sizetype, intop); |
1c26100f | 3854 | |
d924b670 | 3855 | if (TREE_CODE (intop) == INTEGER_CST) |
3856 | { | |
3857 | tree offset_node; | |
3858 | tree string_cst = string_constant (ptrop, &offset_node); | |
3859 | ||
3860 | if (string_cst != 0 | |
3861 | && !(offset_node && TREE_CODE (offset_node) != INTEGER_CST)) | |
3862 | { | |
3863 | HOST_WIDE_INT max = TREE_STRING_LENGTH (string_cst); | |
3864 | HOST_WIDE_INT offset; | |
3865 | if (offset_node == 0) | |
3866 | offset = 0; | |
3867 | else if (! host_integerp (offset_node, 0)) | |
3868 | offset = -1; | |
3869 | else | |
3870 | offset = tree_low_cst (offset_node, 0); | |
3871 | ||
3872 | offset = offset + tree_low_cst (intop, 0); | |
3873 | if (offset < 0 || offset > max) | |
545ba0d7 | 3874 | warning_at (location, 0, |
3875 | "offset %<%wd%> outside bounds of constant string", | |
d924b670 | 3876 | tree_low_cst (intop, 0)); |
3877 | } | |
3878 | } | |
3879 | ||
0de36bdb | 3880 | ret = fold_build2 (POINTER_PLUS_EXPR, result_type, ptrop, intop); |
add6ee5e | 3881 | |
3882 | fold_undefer_and_ignore_overflow_warnings (); | |
3883 | ||
3884 | return ret; | |
1c26100f | 3885 | } |
3886 | \f | |
a75b1c71 | 3887 | /* Wrap a SAVE_EXPR around EXPR, if appropriate. Like save_expr, but |
3888 | for C folds the inside expression and wraps a C_MAYBE_CONST_EXPR | |
3889 | around the SAVE_EXPR if needed so that c_fully_fold does not need | |
3890 | to look inside SAVE_EXPRs. */ | |
3891 | ||
3892 | tree | |
3893 | c_save_expr (tree expr) | |
3894 | { | |
3895 | bool maybe_const = true; | |
3896 | if (c_dialect_cxx ()) | |
3897 | return save_expr (expr); | |
3898 | expr = c_fully_fold (expr, false, &maybe_const); | |
3899 | expr = save_expr (expr); | |
3900 | if (!maybe_const) | |
3901 | { | |
3902 | expr = build2 (C_MAYBE_CONST_EXPR, TREE_TYPE (expr), NULL, expr); | |
3903 | C_MAYBE_CONST_EXPR_NON_CONST (expr) = 1; | |
3904 | } | |
3905 | return expr; | |
3906 | } | |
3907 | ||
6b68e71a | 3908 | /* Return whether EXPR is a declaration whose address can never be |
3909 | NULL. */ | |
3910 | ||
3911 | bool | |
9f627b1a | 3912 | decl_with_nonnull_addr_p (const_tree expr) |
6b68e71a | 3913 | { |
3914 | return (DECL_P (expr) | |
3915 | && (TREE_CODE (expr) == PARM_DECL | |
3916 | || TREE_CODE (expr) == LABEL_DECL | |
3917 | || !DECL_WEAK (expr))); | |
3918 | } | |
3919 | ||
b0fc3e72 | 3920 | /* Prepare expr to be an argument of a TRUTH_NOT_EXPR, |
45a78cc0 | 3921 | or for an `if' or `while' statement or ?..: exp. It should already |
3922 | have been validated to be of suitable type; otherwise, a bad | |
3923 | diagnostic may result. | |
b0fc3e72 | 3924 | |
8e70fb09 | 3925 | The EXPR is located at LOCATION. |
3926 | ||
b0fc3e72 | 3927 | This preparation consists of taking the ordinary |
3928 | representation of an expression expr and producing a valid tree | |
3929 | boolean expression describing whether expr is nonzero. We could | |
3c2239cf | 3930 | simply always do build_binary_op (NE_EXPR, expr, truthvalue_false_node, 1), |
b0fc3e72 | 3931 | but we optimize comparisons, &&, ||, and !. |
3932 | ||
3c2239cf | 3933 | The resulting type should always be `truthvalue_type_node'. */ |
b0fc3e72 | 3934 | |
3935 | tree | |
8e70fb09 | 3936 | c_common_truthvalue_conversion (location_t location, tree expr) |
b0fc3e72 | 3937 | { |
b0fc3e72 | 3938 | switch (TREE_CODE (expr)) |
3939 | { | |
318a728f | 3940 | case EQ_EXPR: case NE_EXPR: case UNEQ_EXPR: case LTGT_EXPR: |
e1232ce2 | 3941 | case LE_EXPR: case GE_EXPR: case LT_EXPR: case GT_EXPR: |
3942 | case UNLE_EXPR: case UNGE_EXPR: case UNLT_EXPR: case UNGT_EXPR: | |
3943 | case ORDERED_EXPR: case UNORDERED_EXPR: | |
ce04dcdc | 3944 | if (TREE_TYPE (expr) == truthvalue_type_node) |
3945 | return expr; | |
3946 | return build2 (TREE_CODE (expr), truthvalue_type_node, | |
3947 | TREE_OPERAND (expr, 0), TREE_OPERAND (expr, 1)); | |
3948 | ||
b0fc3e72 | 3949 | case TRUTH_ANDIF_EXPR: |
3950 | case TRUTH_ORIF_EXPR: | |
3951 | case TRUTH_AND_EXPR: | |
3952 | case TRUTH_OR_EXPR: | |
31f6e93c | 3953 | case TRUTH_XOR_EXPR: |
ce04dcdc | 3954 | if (TREE_TYPE (expr) == truthvalue_type_node) |
3955 | return expr; | |
3956 | return build2 (TREE_CODE (expr), truthvalue_type_node, | |
8e70fb09 | 3957 | c_common_truthvalue_conversion (location, |
3958 | TREE_OPERAND (expr, 0)), | |
3959 | c_common_truthvalue_conversion (location, | |
3960 | TREE_OPERAND (expr, 1))); | |
3e851b85 | 3961 | |
f6e28f72 | 3962 | case TRUTH_NOT_EXPR: |
ce04dcdc | 3963 | if (TREE_TYPE (expr) == truthvalue_type_node) |
3964 | return expr; | |
3965 | return build1 (TREE_CODE (expr), truthvalue_type_node, | |
8e70fb09 | 3966 | c_common_truthvalue_conversion (location, |
3967 | TREE_OPERAND (expr, 0))); | |
f6e28f72 | 3968 | |
b0fc3e72 | 3969 | case ERROR_MARK: |
3970 | return expr; | |
3971 | ||
3972 | case INTEGER_CST: | |
eddad94a | 3973 | return integer_zerop (expr) ? truthvalue_false_node |
3974 | : truthvalue_true_node; | |
b0fc3e72 | 3975 | |
3976 | case REAL_CST: | |
5000e21c | 3977 | return real_compare (NE_EXPR, &TREE_REAL_CST (expr), &dconst0) |
3978 | ? truthvalue_true_node | |
3979 | : truthvalue_false_node; | |
b0fc3e72 | 3980 | |
9421ebb9 | 3981 | case FIXED_CST: |
3982 | return fixed_compare (NE_EXPR, &TREE_FIXED_CST (expr), | |
3983 | &FCONST0 (TYPE_MODE (TREE_TYPE (expr)))) | |
3984 | ? truthvalue_true_node | |
3985 | : truthvalue_false_node; | |
3986 | ||
ce04dcdc | 3987 | case FUNCTION_DECL: |
b6889cb0 | 3988 | expr = build_unary_op (location, ADDR_EXPR, expr, 0); |
ce04dcdc | 3989 | /* Fall through. */ |
3990 | ||
b0fc3e72 | 3991 | case ADDR_EXPR: |
ce871053 | 3992 | { |
ee7d4d6a | 3993 | tree inner = TREE_OPERAND (expr, 0); |
6b68e71a | 3994 | if (decl_with_nonnull_addr_p (inner)) |
ce871053 | 3995 | { |
6b68e71a | 3996 | /* Common Ada/Pascal programmer's mistake. */ |
8e70fb09 | 3997 | warning_at (location, |
3998 | OPT_Waddress, | |
3999 | "the address of %qD will always evaluate as %<true%>", | |
4000 | inner); | |
ce871053 | 4001 | return truthvalue_true_node; |
4002 | } | |
65b5e6a6 | 4003 | |
6b68e71a | 4004 | /* If we still have a decl, it is possible for its address to |
4005 | be NULL, so we cannot optimize. */ | |
4006 | if (DECL_P (inner)) | |
4007 | { | |
4008 | gcc_assert (DECL_WEAK (inner)); | |
4009 | break; | |
4010 | } | |
ce871053 | 4011 | |
ee7d4d6a | 4012 | if (TREE_SIDE_EFFECTS (inner)) |
14ae0310 | 4013 | return build2 (COMPOUND_EXPR, truthvalue_type_node, |
ee7d4d6a | 4014 | inner, truthvalue_true_node); |
ce871053 | 4015 | else |
4016 | return truthvalue_true_node; | |
4017 | } | |
b0fc3e72 | 4018 | |
2203bd5c | 4019 | case COMPLEX_EXPR: |
8e70fb09 | 4020 | return build_binary_op (EXPR_LOCATION (expr), |
4021 | (TREE_SIDE_EFFECTS (TREE_OPERAND (expr, 1)) | |
95809de4 | 4022 | ? TRUTH_OR_EXPR : TRUTH_ORIF_EXPR), |
8e70fb09 | 4023 | c_common_truthvalue_conversion (location, |
4024 | TREE_OPERAND (expr, 0)), | |
4025 | c_common_truthvalue_conversion (location, | |
4026 | TREE_OPERAND (expr, 1)), | |
2203bd5c | 4027 | 0); |
4028 | ||
b0fc3e72 | 4029 | case NEGATE_EXPR: |
4030 | case ABS_EXPR: | |
4031 | case FLOAT_EXPR: | |
c6418a4e | 4032 | case EXCESS_PRECISION_EXPR: |
d10cfa8d | 4033 | /* These don't change whether an object is nonzero or zero. */ |
8e70fb09 | 4034 | return c_common_truthvalue_conversion (location, TREE_OPERAND (expr, 0)); |
b0fc3e72 | 4035 | |
4036 | case LROTATE_EXPR: | |
4037 | case RROTATE_EXPR: | |
d10cfa8d | 4038 | /* These don't change whether an object is zero or nonzero, but |
b0fc3e72 | 4039 | we can't ignore them if their second arg has side-effects. */ |
4040 | if (TREE_SIDE_EFFECTS (TREE_OPERAND (expr, 1))) | |
14ae0310 | 4041 | return build2 (COMPOUND_EXPR, truthvalue_type_node, |
4042 | TREE_OPERAND (expr, 1), | |
8e70fb09 | 4043 | c_common_truthvalue_conversion |
4044 | (location, TREE_OPERAND (expr, 0))); | |
b0fc3e72 | 4045 | else |
8e70fb09 | 4046 | return c_common_truthvalue_conversion (location, |
4047 | TREE_OPERAND (expr, 0)); | |
73be5127 | 4048 | |
b0fc3e72 | 4049 | case COND_EXPR: |
4050 | /* Distribute the conversion into the arms of a COND_EXPR. */ | |
a75b1c71 | 4051 | if (c_dialect_cxx ()) |
4052 | return fold_build3 (COND_EXPR, truthvalue_type_node, | |
4053 | TREE_OPERAND (expr, 0), | |
4054 | c_common_truthvalue_conversion (location, | |
4055 | TREE_OPERAND (expr, | |
4056 | 1)), | |
4057 | c_common_truthvalue_conversion (location, | |
4058 | TREE_OPERAND (expr, | |
4059 | 2))); | |
4060 | else | |
4061 | /* Folding will happen later for C. */ | |
4062 | return build3 (COND_EXPR, truthvalue_type_node, | |
4063 | TREE_OPERAND (expr, 0), | |
4064 | c_common_truthvalue_conversion (location, | |
4065 | TREE_OPERAND (expr, 1)), | |
4066 | c_common_truthvalue_conversion (location, | |
4067 | TREE_OPERAND (expr, 2))); | |
b0fc3e72 | 4068 | |
72dd6141 | 4069 | CASE_CONVERT: |
b0fc3e72 | 4070 | /* Don't cancel the effect of a CONVERT_EXPR from a REFERENCE_TYPE, |
4071 | since that affects how `default_conversion' will behave. */ | |
4072 | if (TREE_CODE (TREE_TYPE (expr)) == REFERENCE_TYPE | |
4073 | || TREE_CODE (TREE_TYPE (TREE_OPERAND (expr, 0))) == REFERENCE_TYPE) | |
4074 | break; | |
b0fc3e72 | 4075 | /* If this is widening the argument, we can ignore it. */ |
4076 | if (TYPE_PRECISION (TREE_TYPE (expr)) | |
4077 | >= TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (expr, 0)))) | |
8e70fb09 | 4078 | return c_common_truthvalue_conversion (location, |
4079 | TREE_OPERAND (expr, 0)); | |
b0fc3e72 | 4080 | break; |
4081 | ||
16837b18 | 4082 | case MODIFY_EXPR: |
60a0513e | 4083 | if (!TREE_NO_WARNING (expr) |
4084 | && warn_parentheses) | |
4085 | { | |
4086 | warning (OPT_Wparentheses, | |
4087 | "suggest parentheses around assignment used as truth value"); | |
4088 | TREE_NO_WARNING (expr) = 1; | |
4089 | } | |
16837b18 | 4090 | break; |
73be5127 | 4091 | |
31f820d2 | 4092 | default: |
4093 | break; | |
b0fc3e72 | 4094 | } |
4095 | ||
2ba726d2 | 4096 | if (TREE_CODE (TREE_TYPE (expr)) == COMPLEX_TYPE) |
a0748b7d | 4097 | { |
a75b1c71 | 4098 | tree t = c_save_expr (expr); |
a0748b7d | 4099 | return (build_binary_op |
8e70fb09 | 4100 | (EXPR_LOCATION (expr), |
4101 | (TREE_SIDE_EFFECTS (expr) | |
a0748b7d | 4102 | ? TRUTH_OR_EXPR : TRUTH_ORIF_EXPR), |
b6889cb0 | 4103 | c_common_truthvalue_conversion |
4104 | (location, | |
4105 | build_unary_op (location, REALPART_EXPR, t, 0)), | |
4106 | c_common_truthvalue_conversion | |
4107 | (location, | |
4108 | build_unary_op (location, IMAGPART_EXPR, t, 0)), | |
a0748b7d | 4109 | 0)); |
4110 | } | |
2ba726d2 | 4111 | |
9421ebb9 | 4112 | if (TREE_CODE (TREE_TYPE (expr)) == FIXED_POINT_TYPE) |
4113 | { | |
4114 | tree fixed_zero_node = build_fixed (TREE_TYPE (expr), | |
4115 | FCONST0 (TYPE_MODE | |
4116 | (TREE_TYPE (expr)))); | |
8e70fb09 | 4117 | return build_binary_op (EXPR_LOCATION (expr), |
4118 | NE_EXPR, expr, fixed_zero_node, 1); | |
9421ebb9 | 4119 | } |
4120 | ||
8e70fb09 | 4121 | return build_binary_op (EXPR_LOCATION (expr), |
4122 | NE_EXPR, expr, integer_zero_node, 1); | |
b0fc3e72 | 4123 | } |
4124 | \f | |
3237155d | 4125 | static void def_builtin_1 (enum built_in_function fncode, |
4126 | const char *name, | |
4127 | enum built_in_class fnclass, | |
4128 | tree fntype, tree libtype, | |
4129 | bool both_p, bool fallback_p, bool nonansi_p, | |
4130 | tree fnattrs, bool implicit_p); | |
0d4238dc | 4131 | |
a5b1863e | 4132 | |
4133 | /* Apply the TYPE_QUALS to the new DECL. */ | |
4134 | ||
4135 | void | |
1cae46be | 4136 | c_apply_type_quals_to_decl (int type_quals, tree decl) |
a5b1863e | 4137 | { |
adfb367f | 4138 | tree type = TREE_TYPE (decl); |
b27ac6b5 | 4139 | |
e4eabbe4 | 4140 | if (type == error_mark_node) |
4141 | return; | |
adfb367f | 4142 | |
4143 | if (((type_quals & TYPE_QUAL_CONST) | |
4144 | || (type && TREE_CODE (type) == REFERENCE_TYPE)) | |
4145 | /* An object declared 'const' is only readonly after it is | |
4146 | initialized. We don't have any way of expressing this currently, | |
4147 | so we need to be conservative and unset TREE_READONLY for types | |
4148 | with constructors. Otherwise aliasing code will ignore stores in | |
4149 | an inline constructor. */ | |
4150 | && !(type && TYPE_NEEDS_CONSTRUCTING (type))) | |
a5b1863e | 4151 | TREE_READONLY (decl) = 1; |
4152 | if (type_quals & TYPE_QUAL_VOLATILE) | |
4153 | { | |
4154 | TREE_SIDE_EFFECTS (decl) = 1; | |
4155 | TREE_THIS_VOLATILE (decl) = 1; | |
4156 | } | |
d91a20bc | 4157 | if (type_quals & TYPE_QUAL_RESTRICT) |
a5b1863e | 4158 | { |
adfb367f | 4159 | while (type && TREE_CODE (type) == ARRAY_TYPE) |
4160 | /* Allow 'restrict' on arrays of pointers. | |
4161 | FIXME currently we just ignore it. */ | |
4162 | type = TREE_TYPE (type); | |
4163 | if (!type | |
4164 | || !POINTER_TYPE_P (type) | |
4165 | || !C_TYPE_OBJECT_OR_INCOMPLETE_P (TREE_TYPE (type))) | |
b0b1af64 | 4166 | error ("invalid use of %<restrict%>"); |
adfb367f | 4167 | else if (flag_strict_aliasing && type == TREE_TYPE (decl)) |
ed83aafb | 4168 | /* Indicate we need to make a unique alias set for this pointer. |
4169 | We can't do it here because it might be pointing to an | |
4170 | incomplete type. */ | |
4171 | DECL_POINTER_ALIAS_SET (decl) = -2; | |
a5b1863e | 4172 | } |
4173 | } | |
4174 | ||
4ee9c684 | 4175 | /* Hash function for the problem of multiple type definitions in |
4176 | different files. This must hash all types that will compare | |
4177 | equal via comptypes to the same value. In practice it hashes | |
0bed3869 | 4178 | on some of the simple stuff and leaves the details to comptypes. */ |
4ee9c684 | 4179 | |
4180 | static hashval_t | |
4181 | c_type_hash (const void *p) | |
4182 | { | |
4183 | int i = 0; | |
4184 | int shift, size; | |
aae87fc3 | 4185 | const_tree const t = (const_tree) p; |
4ee9c684 | 4186 | tree t2; |
4187 | switch (TREE_CODE (t)) | |
4188 | { | |
fbf0afd1 | 4189 | /* For pointers, hash on pointee type plus some swizzling. */ |
2363ef00 | 4190 | case POINTER_TYPE: |
4191 | return c_type_hash (TREE_TYPE (t)) ^ 0x3003003; | |
4192 | /* Hash on number of elements and total size. */ | |
4193 | case ENUMERAL_TYPE: | |
4194 | shift = 3; | |
4195 | t2 = TYPE_VALUES (t); | |
4196 | break; | |
4197 | case RECORD_TYPE: | |
4198 | shift = 0; | |
4199 | t2 = TYPE_FIELDS (t); | |
4200 | break; | |
4201 | case QUAL_UNION_TYPE: | |
4202 | shift = 1; | |
4203 | t2 = TYPE_FIELDS (t); | |
4204 | break; | |
4205 | case UNION_TYPE: | |
4206 | shift = 2; | |
4207 | t2 = TYPE_FIELDS (t); | |
4208 | break; | |
4209 | default: | |
231bd014 | 4210 | gcc_unreachable (); |
4ee9c684 | 4211 | } |
4212 | for (; t2; t2 = TREE_CHAIN (t2)) | |
4213 | i++; | |
78c2e180 | 4214 | /* We might have a VLA here. */ |
4215 | if (TREE_CODE (TYPE_SIZE (t)) != INTEGER_CST) | |
4216 | size = 0; | |
4217 | else | |
4218 | size = TREE_INT_CST_LOW (TYPE_SIZE (t)); | |
4ee9c684 | 4219 | return ((size << 24) | (i << shift)); |
4220 | } | |
4221 | ||
1ecd4018 | 4222 | static GTY((param_is (union tree_node))) htab_t type_hash_table; |
4223 | ||
b5ba9f3a | 4224 | /* Return the typed-based alias set for T, which may be an expression |
f7c44134 | 4225 | or a type. Return -1 if we don't do anything special. */ |
b5ba9f3a | 4226 | |
32c2fdea | 4227 | alias_set_type |
1cae46be | 4228 | c_common_get_alias_set (tree t) |
b5ba9f3a | 4229 | { |
be4f2de7 | 4230 | tree u; |
4ee9c684 | 4231 | PTR *slot; |
1cae46be | 4232 | |
be4f2de7 | 4233 | /* Permit type-punning when accessing a union, provided the access |
4234 | is directly through the union. For example, this code does not | |
4235 | permit taking the address of a union member and then storing | |
4236 | through it. Even the type-punning allowed here is a GCC | |
4237 | extension, albeit a common and useful one; the C standard says | |
4238 | that such accesses have implementation-defined behavior. */ | |
4239 | for (u = t; | |
4240 | TREE_CODE (u) == COMPONENT_REF || TREE_CODE (u) == ARRAY_REF; | |
4241 | u = TREE_OPERAND (u, 0)) | |
4242 | if (TREE_CODE (u) == COMPONENT_REF | |
4243 | && TREE_CODE (TREE_TYPE (TREE_OPERAND (u, 0))) == UNION_TYPE) | |
4244 | return 0; | |
1e2513d9 | 4245 | |
9fcc3e54 | 4246 | /* That's all the expressions we handle specially. */ |
84166705 | 4247 | if (!TYPE_P (t)) |
9fcc3e54 | 4248 | return -1; |
4249 | ||
d716ce75 | 4250 | /* The C standard guarantees that any object may be accessed via an |
9fcc3e54 | 4251 | lvalue that has character type. */ |
4252 | if (t == char_type_node | |
4253 | || t == signed_char_type_node | |
4254 | || t == unsigned_char_type_node) | |
f7c44134 | 4255 | return 0; |
a5b1863e | 4256 | |
1607663f | 4257 | /* The C standard specifically allows aliasing between signed and |
4258 | unsigned variants of the same type. We treat the signed | |
4259 | variant as canonical. */ | |
78a8ed03 | 4260 | if (TREE_CODE (t) == INTEGER_TYPE && TYPE_UNSIGNED (t)) |
a8868e19 | 4261 | { |
4070745f | 4262 | tree t1 = c_common_signed_type (t); |
1607663f | 4263 | |
a8868e19 | 4264 | /* t1 == t can happen for boolean nodes which are always unsigned. */ |
4265 | if (t1 != t) | |
4266 | return get_alias_set (t1); | |
4267 | } | |
f7c44134 | 4268 | else if (POINTER_TYPE_P (t)) |
87d2d17e | 4269 | { |
f7c44134 | 4270 | tree t1; |
87d2d17e | 4271 | |
4272 | /* Unfortunately, there is no canonical form of a pointer type. | |
4273 | In particular, if we have `typedef int I', then `int *', and | |
4274 | `I *' are different types. So, we have to pick a canonical | |
4275 | representative. We do this below. | |
44e9fa65 | 4276 | |
40bdc593 | 4277 | Technically, this approach is actually more conservative that |
4278 | it needs to be. In particular, `const int *' and `int *' | |
734c98be | 4279 | should be in different alias sets, according to the C and C++ |
40bdc593 | 4280 | standard, since their types are not the same, and so, |
4281 | technically, an `int **' and `const int **' cannot point at | |
4282 | the same thing. | |
4283 | ||
4ee9c684 | 4284 | But, the standard is wrong. In particular, this code is |
40bdc593 | 4285 | legal C++: |
4286 | ||
a0c938f0 | 4287 | int *ip; |
4288 | int **ipp = &ip; | |
4289 | const int* const* cipp = ipp; | |
40bdc593 | 4290 | |
4ee9c684 | 4291 | And, it doesn't make sense for that to be legal unless you |
40bdc593 | 4292 | can dereference IPP and CIPP. So, we ignore cv-qualifiers on |
4293 | the pointed-to types. This issue has been reported to the | |
4294 | C++ committee. */ | |
211f3116 | 4295 | t1 = build_type_no_quals (t); |
f7c44134 | 4296 | if (t1 != t) |
4297 | return get_alias_set (t1); | |
87d2d17e | 4298 | } |
1e2513d9 | 4299 | |
4ee9c684 | 4300 | /* Handle the case of multiple type nodes referring to "the same" type, |
4301 | which occurs with IMA. These share an alias set. FIXME: Currently only | |
4302 | C90 is handled. (In C99 type compatibility is not transitive, which | |
4303 | complicates things mightily. The alias set splay trees can theoretically | |
4304 | represent this, but insertion is tricky when you consider all the | |
4305 | different orders things might arrive in.) */ | |
4306 | ||
4307 | if (c_language != clk_c || flag_isoc99) | |
4308 | return -1; | |
4309 | ||
0bed3869 | 4310 | /* Save time if there's only one input file. */ |
e08bd2f4 | 4311 | if (num_in_fnames == 1) |
4ee9c684 | 4312 | return -1; |
4313 | ||
4314 | /* Pointers need special handling if they point to any type that | |
4315 | needs special handling (below). */ | |
4316 | if (TREE_CODE (t) == POINTER_TYPE) | |
4317 | { | |
4318 | tree t2; | |
4319 | /* Find bottom type under any nested POINTERs. */ | |
b27ac6b5 | 4320 | for (t2 = TREE_TYPE (t); |
af592f67 | 4321 | TREE_CODE (t2) == POINTER_TYPE; |
4322 | t2 = TREE_TYPE (t2)) | |
4323 | ; | |
b27ac6b5 | 4324 | if (TREE_CODE (t2) != RECORD_TYPE |
af592f67 | 4325 | && TREE_CODE (t2) != ENUMERAL_TYPE |
4326 | && TREE_CODE (t2) != QUAL_UNION_TYPE | |
4327 | && TREE_CODE (t2) != UNION_TYPE) | |
4328 | return -1; | |
4ee9c684 | 4329 | if (TYPE_SIZE (t2) == 0) |
af592f67 | 4330 | return -1; |
4ee9c684 | 4331 | } |
4332 | /* These are the only cases that need special handling. */ | |
b27ac6b5 | 4333 | if (TREE_CODE (t) != RECORD_TYPE |
4ee9c684 | 4334 | && TREE_CODE (t) != ENUMERAL_TYPE |
4335 | && TREE_CODE (t) != QUAL_UNION_TYPE | |
4336 | && TREE_CODE (t) != UNION_TYPE | |
4337 | && TREE_CODE (t) != POINTER_TYPE) | |
4338 | return -1; | |
4339 | /* Undefined? */ | |
4340 | if (TYPE_SIZE (t) == 0) | |
4341 | return -1; | |
4342 | ||
b27ac6b5 | 4343 | /* Look up t in hash table. Only one of the compatible types within each |
4ee9c684 | 4344 | alias set is recorded in the table. */ |
4345 | if (!type_hash_table) | |
1ecd4018 | 4346 | type_hash_table = htab_create_ggc (1021, c_type_hash, |
4ee9c684 | 4347 | (htab_eq) lang_hooks.types_compatible_p, |
4348 | NULL); | |
4349 | slot = htab_find_slot (type_hash_table, t, INSERT); | |
4350 | if (*slot != NULL) | |
ad16cb2c | 4351 | { |
4352 | TYPE_ALIAS_SET (t) = TYPE_ALIAS_SET ((tree)*slot); | |
4353 | return TYPE_ALIAS_SET ((tree)*slot); | |
4354 | } | |
4ee9c684 | 4355 | else |
4356 | /* Our caller will assign and record (in t) a new alias set; all we need | |
4357 | to do is remember t in the hash table. */ | |
4358 | *slot = t; | |
4359 | ||
f7c44134 | 4360 | return -1; |
b5ba9f3a | 4361 | } |
902b4e01 | 4362 | \f |
d4c4d95c | 4363 | /* Compute the value of 'sizeof (TYPE)' or '__alignof__ (TYPE)', where the |
d3a4d008 | 4364 | second parameter indicates which OPERATOR is being applied. The COMPLAIN |
4365 | flag controls whether we should diagnose possibly ill-formed | |
4366 | constructs or not. */ | |
908c697e | 4367 | |
902b4e01 | 4368 | tree |
908c697e | 4369 | c_sizeof_or_alignof_type (tree type, bool is_sizeof, int complain) |
902b4e01 | 4370 | { |
d4c4d95c | 4371 | const char *op_name; |
4372 | tree value = NULL; | |
4373 | enum tree_code type_code = TREE_CODE (type); | |
1cae46be | 4374 | |
908c697e | 4375 | op_name = is_sizeof ? "sizeof" : "__alignof__"; |
1cae46be | 4376 | |
d4c4d95c | 4377 | if (type_code == FUNCTION_TYPE) |
902b4e01 | 4378 | { |
908c697e | 4379 | if (is_sizeof) |
d4c4d95c | 4380 | { |
d3a4d008 | 4381 | if (complain && (pedantic || warn_pointer_arith)) |
21ca8540 | 4382 | pedwarn (input_location, pedantic ? OPT_pedantic : OPT_Wpointer_arith, |
8864917d | 4383 | "invalid application of %<sizeof%> to a function type"); |
ebd21de4 | 4384 | else if (!complain) |
4385 | return error_mark_node; | |
d4c4d95c | 4386 | value = size_one_node; |
4387 | } | |
4388 | else | |
4389 | value = size_int (FUNCTION_BOUNDARY / BITS_PER_UNIT); | |
4390 | } | |
4391 | else if (type_code == VOID_TYPE || type_code == ERROR_MARK) | |
4392 | { | |
1cae46be | 4393 | if (type_code == VOID_TYPE |
d3a4d008 | 4394 | && complain && (pedantic || warn_pointer_arith)) |
21ca8540 | 4395 | pedwarn (input_location, pedantic ? OPT_pedantic : OPT_Wpointer_arith, |
8864917d | 4396 | "invalid application of %qs to a void type", op_name); |
ebd21de4 | 4397 | else if (!complain) |
4398 | return error_mark_node; | |
d4c4d95c | 4399 | value = size_one_node; |
902b4e01 | 4400 | } |
902b4e01 | 4401 | else if (!COMPLETE_TYPE_P (type)) |
4402 | { | |
d3a4d008 | 4403 | if (complain) |
b0b1af64 | 4404 | error ("invalid application of %qs to incomplete type %qT ", |
3ad0e8cc | 4405 | op_name, type); |
d4c4d95c | 4406 | value = size_zero_node; |
902b4e01 | 4407 | } |
4408 | else | |
d4c4d95c | 4409 | { |
908c697e | 4410 | if (is_sizeof) |
d4c4d95c | 4411 | /* Convert in case a char is more than one unit. */ |
4412 | value = size_binop (CEIL_DIV_EXPR, TYPE_SIZE_UNIT (type), | |
4413 | size_int (TYPE_PRECISION (char_type_node) | |
4414 | / BITS_PER_UNIT)); | |
4415 | else | |
d37625c0 | 4416 | value = size_int (TYPE_ALIGN_UNIT (type)); |
d4c4d95c | 4417 | } |
902b4e01 | 4418 | |
d4c4d95c | 4419 | /* VALUE will have an integer type with TYPE_IS_SIZETYPE set. |
4420 | TYPE_IS_SIZETYPE means that certain things (like overflow) will | |
4421 | never happen. However, this node should really have type | |
4422 | `size_t', which is just a typedef for an ordinary integer type. */ | |
143d62d7 | 4423 | value = fold_convert (size_type_node, value); |
1d8fc210 | 4424 | gcc_assert (!TYPE_IS_SIZETYPE (TREE_TYPE (value))); |
1cae46be | 4425 | |
d4c4d95c | 4426 | return value; |
902b4e01 | 4427 | } |
4428 | ||
4429 | /* Implement the __alignof keyword: Return the minimum required | |
097b5c8b | 4430 | alignment of EXPR, measured in bytes. For VAR_DECLs, |
4431 | FUNCTION_DECLs and FIELD_DECLs return DECL_ALIGN (which can be set | |
4432 | from an "aligned" __attribute__ specification). */ | |
72040e7e | 4433 | |
902b4e01 | 4434 | tree |
1cae46be | 4435 | c_alignof_expr (tree expr) |
902b4e01 | 4436 | { |
4437 | tree t; | |
4438 | ||
097b5c8b | 4439 | if (VAR_OR_FUNCTION_DECL_P (expr)) |
d37625c0 | 4440 | t = size_int (DECL_ALIGN_UNIT (expr)); |
1cae46be | 4441 | |
902b4e01 | 4442 | else if (TREE_CODE (expr) == COMPONENT_REF |
4443 | && DECL_C_BIT_FIELD (TREE_OPERAND (expr, 1))) | |
4444 | { | |
b0b1af64 | 4445 | error ("%<__alignof%> applied to a bit-field"); |
902b4e01 | 4446 | t = size_one_node; |
4447 | } | |
4448 | else if (TREE_CODE (expr) == COMPONENT_REF | |
7cc7e163 | 4449 | && TREE_CODE (TREE_OPERAND (expr, 1)) == FIELD_DECL) |
d37625c0 | 4450 | t = size_int (DECL_ALIGN_UNIT (TREE_OPERAND (expr, 1))); |
1cae46be | 4451 | |
902b4e01 | 4452 | else if (TREE_CODE (expr) == INDIRECT_REF) |
4453 | { | |
4454 | tree t = TREE_OPERAND (expr, 0); | |
4455 | tree best = t; | |
4456 | int bestalign = TYPE_ALIGN (TREE_TYPE (TREE_TYPE (t))); | |
1cae46be | 4457 | |
72dd6141 | 4458 | while (CONVERT_EXPR_P (t) |
7cc7e163 | 4459 | && TREE_CODE (TREE_TYPE (TREE_OPERAND (t, 0))) == POINTER_TYPE) |
902b4e01 | 4460 | { |
4461 | int thisalign; | |
4462 | ||
4463 | t = TREE_OPERAND (t, 0); | |
4464 | thisalign = TYPE_ALIGN (TREE_TYPE (TREE_TYPE (t))); | |
4465 | if (thisalign > bestalign) | |
4466 | best = t, bestalign = thisalign; | |
4467 | } | |
4468 | return c_alignof (TREE_TYPE (TREE_TYPE (best))); | |
4469 | } | |
4470 | else | |
4471 | return c_alignof (TREE_TYPE (expr)); | |
4472 | ||
143d62d7 | 4473 | return fold_convert (size_type_node, t); |
902b4e01 | 4474 | } |
4475 | \f | |
8fe4a266 | 4476 | /* Handle C and C++ default attributes. */ |
4477 | ||
4478 | enum built_in_attribute | |
4479 | { | |
4480 | #define DEF_ATTR_NULL_TREE(ENUM) ENUM, | |
4481 | #define DEF_ATTR_INT(ENUM, VALUE) ENUM, | |
4482 | #define DEF_ATTR_IDENT(ENUM, STRING) ENUM, | |
4483 | #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) ENUM, | |
8fe4a266 | 4484 | #include "builtin-attrs.def" |
4485 | #undef DEF_ATTR_NULL_TREE | |
4486 | #undef DEF_ATTR_INT | |
4487 | #undef DEF_ATTR_IDENT | |
4488 | #undef DEF_ATTR_TREE_LIST | |
8fe4a266 | 4489 | ATTR_LAST |
4490 | }; | |
4491 | ||
4492 | static GTY(()) tree built_in_attributes[(int) ATTR_LAST]; | |
4493 | ||
1cae46be | 4494 | static void c_init_attributes (void); |
8fe4a266 | 4495 | |
27213ba3 | 4496 | enum c_builtin_type |
72040e7e | 4497 | { |
d2d4bdde | 4498 | #define DEF_PRIMITIVE_TYPE(NAME, VALUE) NAME, |
4499 | #define DEF_FUNCTION_TYPE_0(NAME, RETURN) NAME, | |
4500 | #define DEF_FUNCTION_TYPE_1(NAME, RETURN, ARG1) NAME, | |
4501 | #define DEF_FUNCTION_TYPE_2(NAME, RETURN, ARG1, ARG2) NAME, | |
4502 | #define DEF_FUNCTION_TYPE_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME, | |
4503 | #define DEF_FUNCTION_TYPE_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME, | |
0a39fd54 | 4504 | #define DEF_FUNCTION_TYPE_5(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) NAME, |
27213ba3 | 4505 | #define DEF_FUNCTION_TYPE_6(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6) NAME, |
4506 | #define DEF_FUNCTION_TYPE_7(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, ARG7) NAME, | |
d2d4bdde | 4507 | #define DEF_FUNCTION_TYPE_VAR_0(NAME, RETURN) NAME, |
4508 | #define DEF_FUNCTION_TYPE_VAR_1(NAME, RETURN, ARG1) NAME, | |
4509 | #define DEF_FUNCTION_TYPE_VAR_2(NAME, RETURN, ARG1, ARG2) NAME, | |
03901330 | 4510 | #define DEF_FUNCTION_TYPE_VAR_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME, |
0a39fd54 | 4511 | #define DEF_FUNCTION_TYPE_VAR_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME, |
4512 | #define DEF_FUNCTION_TYPE_VAR_5(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG6) \ | |
4513 | NAME, | |
d2d4bdde | 4514 | #define DEF_POINTER_TYPE(NAME, TYPE) NAME, |
4515 | #include "builtin-types.def" | |
4516 | #undef DEF_PRIMITIVE_TYPE | |
4517 | #undef DEF_FUNCTION_TYPE_0 | |
4518 | #undef DEF_FUNCTION_TYPE_1 | |
4519 | #undef DEF_FUNCTION_TYPE_2 | |
4520 | #undef DEF_FUNCTION_TYPE_3 | |
4521 | #undef DEF_FUNCTION_TYPE_4 | |
0a39fd54 | 4522 | #undef DEF_FUNCTION_TYPE_5 |
4523 | #undef DEF_FUNCTION_TYPE_6 | |
27213ba3 | 4524 | #undef DEF_FUNCTION_TYPE_7 |
d2d4bdde | 4525 | #undef DEF_FUNCTION_TYPE_VAR_0 |
4526 | #undef DEF_FUNCTION_TYPE_VAR_1 | |
4527 | #undef DEF_FUNCTION_TYPE_VAR_2 | |
03901330 | 4528 | #undef DEF_FUNCTION_TYPE_VAR_3 |
0a39fd54 | 4529 | #undef DEF_FUNCTION_TYPE_VAR_4 |
4530 | #undef DEF_FUNCTION_TYPE_VAR_5 | |
d2d4bdde | 4531 | #undef DEF_POINTER_TYPE |
27213ba3 | 4532 | BT_LAST |
4533 | }; | |
4534 | ||
4535 | typedef enum c_builtin_type builtin_type; | |
d2d4bdde | 4536 | |
27213ba3 | 4537 | /* A temporary array for c_common_nodes_and_builtins. Used in |
4538 | communication with def_fn_type. */ | |
4539 | static tree builtin_types[(int) BT_LAST + 1]; | |
d2d4bdde | 4540 | |
27213ba3 | 4541 | /* A helper function for c_common_nodes_and_builtins. Build function type |
4542 | for DEF with return type RET and N arguments. If VAR is true, then the | |
4543 | function should be variadic after those N arguments. | |
4544 | ||
4545 | Takes special care not to ICE if any of the types involved are | |
4546 | error_mark_node, which indicates that said type is not in fact available | |
4547 | (see builtin_type_for_size). In which case the function type as a whole | |
4548 | should be error_mark_node. */ | |
4549 | ||
4550 | static void | |
4551 | def_fn_type (builtin_type def, builtin_type ret, bool var, int n, ...) | |
4552 | { | |
4553 | tree args = NULL, t; | |
4554 | va_list list; | |
4555 | int i; | |
4556 | ||
4557 | va_start (list, n); | |
4558 | for (i = 0; i < n; ++i) | |
4559 | { | |
7d339f93 | 4560 | builtin_type a = (builtin_type) va_arg (list, int); |
27213ba3 | 4561 | t = builtin_types[a]; |
4562 | if (t == error_mark_node) | |
4563 | goto egress; | |
4564 | args = tree_cons (NULL_TREE, t, args); | |
4565 | } | |
4566 | va_end (list); | |
4567 | ||
4568 | args = nreverse (args); | |
4569 | if (!var) | |
4570 | args = chainon (args, void_list_node); | |
4571 | ||
4572 | t = builtin_types[ret]; | |
4573 | if (t == error_mark_node) | |
4574 | goto egress; | |
4575 | t = build_function_type (t, args); | |
4576 | ||
4577 | egress: | |
4578 | builtin_types[def] = t; | |
4579 | } | |
4580 | ||
dce22712 | 4581 | /* Build builtin functions common to both C and C++ language |
4582 | frontends. */ | |
4583 | ||
4584 | static void | |
4585 | c_define_builtins (tree va_list_ref_type_node, tree va_list_arg_type_node) | |
4586 | { | |
4587 | #define DEF_PRIMITIVE_TYPE(ENUM, VALUE) \ | |
4588 | builtin_types[ENUM] = VALUE; | |
4589 | #define DEF_FUNCTION_TYPE_0(ENUM, RETURN) \ | |
4590 | def_fn_type (ENUM, RETURN, 0, 0); | |
4591 | #define DEF_FUNCTION_TYPE_1(ENUM, RETURN, ARG1) \ | |
4592 | def_fn_type (ENUM, RETURN, 0, 1, ARG1); | |
4593 | #define DEF_FUNCTION_TYPE_2(ENUM, RETURN, ARG1, ARG2) \ | |
4594 | def_fn_type (ENUM, RETURN, 0, 2, ARG1, ARG2); | |
4595 | #define DEF_FUNCTION_TYPE_3(ENUM, RETURN, ARG1, ARG2, ARG3) \ | |
4596 | def_fn_type (ENUM, RETURN, 0, 3, ARG1, ARG2, ARG3); | |
4597 | #define DEF_FUNCTION_TYPE_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \ | |
4598 | def_fn_type (ENUM, RETURN, 0, 4, ARG1, ARG2, ARG3, ARG4); | |
4599 | #define DEF_FUNCTION_TYPE_5(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \ | |
4600 | def_fn_type (ENUM, RETURN, 0, 5, ARG1, ARG2, ARG3, ARG4, ARG5); | |
4601 | #define DEF_FUNCTION_TYPE_6(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \ | |
4602 | ARG6) \ | |
4603 | def_fn_type (ENUM, RETURN, 0, 6, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6); | |
4604 | #define DEF_FUNCTION_TYPE_7(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \ | |
4605 | ARG6, ARG7) \ | |
4606 | def_fn_type (ENUM, RETURN, 0, 7, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, ARG7); | |
4607 | #define DEF_FUNCTION_TYPE_VAR_0(ENUM, RETURN) \ | |
4608 | def_fn_type (ENUM, RETURN, 1, 0); | |
4609 | #define DEF_FUNCTION_TYPE_VAR_1(ENUM, RETURN, ARG1) \ | |
4610 | def_fn_type (ENUM, RETURN, 1, 1, ARG1); | |
4611 | #define DEF_FUNCTION_TYPE_VAR_2(ENUM, RETURN, ARG1, ARG2) \ | |
4612 | def_fn_type (ENUM, RETURN, 1, 2, ARG1, ARG2); | |
4613 | #define DEF_FUNCTION_TYPE_VAR_3(ENUM, RETURN, ARG1, ARG2, ARG3) \ | |
4614 | def_fn_type (ENUM, RETURN, 1, 3, ARG1, ARG2, ARG3); | |
4615 | #define DEF_FUNCTION_TYPE_VAR_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \ | |
4616 | def_fn_type (ENUM, RETURN, 1, 4, ARG1, ARG2, ARG3, ARG4); | |
4617 | #define DEF_FUNCTION_TYPE_VAR_5(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \ | |
4618 | def_fn_type (ENUM, RETURN, 1, 5, ARG1, ARG2, ARG3, ARG4, ARG5); | |
4619 | #define DEF_POINTER_TYPE(ENUM, TYPE) \ | |
4620 | builtin_types[(int) ENUM] = build_pointer_type (builtin_types[(int) TYPE]); | |
4621 | ||
4622 | #include "builtin-types.def" | |
4623 | ||
4624 | #undef DEF_PRIMITIVE_TYPE | |
4625 | #undef DEF_FUNCTION_TYPE_1 | |
4626 | #undef DEF_FUNCTION_TYPE_2 | |
4627 | #undef DEF_FUNCTION_TYPE_3 | |
4628 | #undef DEF_FUNCTION_TYPE_4 | |
4629 | #undef DEF_FUNCTION_TYPE_5 | |
4630 | #undef DEF_FUNCTION_TYPE_6 | |
4631 | #undef DEF_FUNCTION_TYPE_VAR_0 | |
4632 | #undef DEF_FUNCTION_TYPE_VAR_1 | |
4633 | #undef DEF_FUNCTION_TYPE_VAR_2 | |
4634 | #undef DEF_FUNCTION_TYPE_VAR_3 | |
4635 | #undef DEF_FUNCTION_TYPE_VAR_4 | |
4636 | #undef DEF_FUNCTION_TYPE_VAR_5 | |
4637 | #undef DEF_POINTER_TYPE | |
4638 | builtin_types[(int) BT_LAST] = NULL_TREE; | |
4639 | ||
4640 | c_init_attributes (); | |
4641 | ||
4642 | #define DEF_BUILTIN(ENUM, NAME, CLASS, TYPE, LIBTYPE, BOTH_P, FALLBACK_P, \ | |
4643 | NONANSI_P, ATTRS, IMPLICIT, COND) \ | |
4644 | if (NAME && COND) \ | |
4645 | def_builtin_1 (ENUM, NAME, CLASS, \ | |
4646 | builtin_types[(int) TYPE], \ | |
4647 | builtin_types[(int) LIBTYPE], \ | |
4648 | BOTH_P, FALLBACK_P, NONANSI_P, \ | |
4649 | built_in_attributes[(int) ATTRS], IMPLICIT); | |
4650 | #include "builtins.def" | |
4651 | #undef DEF_BUILTIN | |
4652 | ||
87eb1c28 | 4653 | targetm.init_builtins (); |
4654 | ||
dce22712 | 4655 | build_common_builtin_nodes (); |
4656 | ||
dce22712 | 4657 | if (flag_mudflap) |
4658 | mudflap_init (); | |
4659 | } | |
4660 | ||
9e6687c8 | 4661 | /* Like get_identifier, but avoid warnings about null arguments when |
4662 | the argument may be NULL for targets where GCC lacks stdint.h type | |
4663 | information. */ | |
4664 | ||
4665 | static inline tree | |
4666 | c_get_ident (const char *id) | |
4667 | { | |
4668 | return get_identifier (id); | |
4669 | } | |
4670 | ||
27213ba3 | 4671 | /* Build tree nodes and builtin functions common to both C and C++ language |
4672 | frontends. */ | |
4673 | ||
4674 | void | |
4675 | c_common_nodes_and_builtins (void) | |
4676 | { | |
924bbf02 | 4677 | int char16_type_size; |
4678 | int char32_type_size; | |
174fcc61 | 4679 | int wchar_type_size; |
4680 | tree array_domain_type; | |
2d47cc32 | 4681 | tree va_list_ref_type_node; |
8a15c04a | 4682 | tree va_list_arg_type_node; |
a66c9326 | 4683 | |
174fcc61 | 4684 | /* Define `int' and `char' first so that dbx will output them first. */ |
d946ea19 | 4685 | record_builtin_type (RID_INT, NULL, integer_type_node); |
174fcc61 | 4686 | record_builtin_type (RID_CHAR, "char", char_type_node); |
4687 | ||
4688 | /* `signed' is the same as `int'. FIXME: the declarations of "signed", | |
4689 | "unsigned long", "long long unsigned" and "unsigned short" were in C++ | |
4690 | but not C. Are the conditionals here needed? */ | |
c0f19401 | 4691 | if (c_dialect_cxx ()) |
d946ea19 | 4692 | record_builtin_type (RID_SIGNED, NULL, integer_type_node); |
174fcc61 | 4693 | record_builtin_type (RID_LONG, "long int", long_integer_type_node); |
4694 | record_builtin_type (RID_UNSIGNED, "unsigned int", unsigned_type_node); | |
4695 | record_builtin_type (RID_MAX, "long unsigned int", | |
4696 | long_unsigned_type_node); | |
c0f19401 | 4697 | if (c_dialect_cxx ()) |
174fcc61 | 4698 | record_builtin_type (RID_MAX, "unsigned long", long_unsigned_type_node); |
4699 | record_builtin_type (RID_MAX, "long long int", | |
4700 | long_long_integer_type_node); | |
4701 | record_builtin_type (RID_MAX, "long long unsigned int", | |
4702 | long_long_unsigned_type_node); | |
c0f19401 | 4703 | if (c_dialect_cxx ()) |
174fcc61 | 4704 | record_builtin_type (RID_MAX, "long long unsigned", |
4705 | long_long_unsigned_type_node); | |
4706 | record_builtin_type (RID_SHORT, "short int", short_integer_type_node); | |
4707 | record_builtin_type (RID_MAX, "short unsigned int", | |
4708 | short_unsigned_type_node); | |
c0f19401 | 4709 | if (c_dialect_cxx ()) |
174fcc61 | 4710 | record_builtin_type (RID_MAX, "unsigned short", |
4711 | short_unsigned_type_node); | |
4712 | ||
4713 | /* Define both `signed char' and `unsigned char'. */ | |
4714 | record_builtin_type (RID_MAX, "signed char", signed_char_type_node); | |
4715 | record_builtin_type (RID_MAX, "unsigned char", unsigned_char_type_node); | |
4716 | ||
771d21fa | 4717 | /* These are types that c_common_type_for_size and |
4718 | c_common_type_for_mode use. */ | |
dc24ddbd | 4719 | lang_hooks.decls.pushdecl (build_decl (TYPE_DECL, NULL_TREE, |
4720 | intQI_type_node)); | |
4721 | lang_hooks.decls.pushdecl (build_decl (TYPE_DECL, NULL_TREE, | |
4722 | intHI_type_node)); | |
4723 | lang_hooks.decls.pushdecl (build_decl (TYPE_DECL, NULL_TREE, | |
4724 | intSI_type_node)); | |
4725 | lang_hooks.decls.pushdecl (build_decl (TYPE_DECL, NULL_TREE, | |
4726 | intDI_type_node)); | |
174fcc61 | 4727 | #if HOST_BITS_PER_WIDE_INT >= 64 |
f1515a39 | 4728 | if (targetm.scalar_mode_supported_p (TImode)) |
4729 | lang_hooks.decls.pushdecl (build_decl (TYPE_DECL, | |
4730 | get_identifier ("__int128_t"), | |
4731 | intTI_type_node)); | |
174fcc61 | 4732 | #endif |
dc24ddbd | 4733 | lang_hooks.decls.pushdecl (build_decl (TYPE_DECL, NULL_TREE, |
4734 | unsigned_intQI_type_node)); | |
4735 | lang_hooks.decls.pushdecl (build_decl (TYPE_DECL, NULL_TREE, | |
4736 | unsigned_intHI_type_node)); | |
4737 | lang_hooks.decls.pushdecl (build_decl (TYPE_DECL, NULL_TREE, | |
4738 | unsigned_intSI_type_node)); | |
4739 | lang_hooks.decls.pushdecl (build_decl (TYPE_DECL, NULL_TREE, | |
4740 | unsigned_intDI_type_node)); | |
174fcc61 | 4741 | #if HOST_BITS_PER_WIDE_INT >= 64 |
f1515a39 | 4742 | if (targetm.scalar_mode_supported_p (TImode)) |
4743 | lang_hooks.decls.pushdecl (build_decl (TYPE_DECL, | |
4744 | get_identifier ("__uint128_t"), | |
4745 | unsigned_intTI_type_node)); | |
174fcc61 | 4746 | #endif |
4747 | ||
4748 | /* Create the widest literal types. */ | |
4749 | widest_integer_literal_type_node | |
4750 | = make_signed_type (HOST_BITS_PER_WIDE_INT * 2); | |
dc24ddbd | 4751 | lang_hooks.decls.pushdecl (build_decl (TYPE_DECL, NULL_TREE, |
4752 | widest_integer_literal_type_node)); | |
174fcc61 | 4753 | |
4754 | widest_unsigned_literal_type_node | |
4755 | = make_unsigned_type (HOST_BITS_PER_WIDE_INT * 2); | |
dc24ddbd | 4756 | lang_hooks.decls.pushdecl (build_decl (TYPE_DECL, NULL_TREE, |
4757 | widest_unsigned_literal_type_node)); | |
174fcc61 | 4758 | |
4759 | /* `unsigned long' is the standard type for sizeof. | |
4760 | Note that stddef.h uses `unsigned long', | |
4761 | and this must agree, even if long and int are the same size. */ | |
654ef926 | 4762 | size_type_node = |
174fcc61 | 4763 | TREE_TYPE (identifier_global_value (get_identifier (SIZE_TYPE))); |
654ef926 | 4764 | signed_size_type_node = c_common_signed_type (size_type_node); |
4765 | set_sizetype (size_type_node); | |
174fcc61 | 4766 | |
73673831 | 4767 | pid_type_node = |
4768 | TREE_TYPE (identifier_global_value (get_identifier (PID_TYPE))); | |
4769 | ||
174fcc61 | 4770 | build_common_tree_nodes_2 (flag_short_double); |
4771 | ||
d946ea19 | 4772 | record_builtin_type (RID_FLOAT, NULL, float_type_node); |
4773 | record_builtin_type (RID_DOUBLE, NULL, double_type_node); | |
174fcc61 | 4774 | record_builtin_type (RID_MAX, "long double", long_double_type_node); |
4775 | ||
c4503c0a | 4776 | /* Only supported decimal floating point extension if the target |
4777 | actually supports underlying modes. */ | |
4778 | if (targetm.scalar_mode_supported_p (SDmode) | |
4779 | && targetm.scalar_mode_supported_p (DDmode) | |
4780 | && targetm.scalar_mode_supported_p (TDmode)) | |
4781 | { | |
4782 | record_builtin_type (RID_DFLOAT32, NULL, dfloat32_type_node); | |
4783 | record_builtin_type (RID_DFLOAT64, NULL, dfloat64_type_node); | |
4784 | record_builtin_type (RID_DFLOAT128, NULL, dfloat128_type_node); | |
4785 | } | |
4786 | ||
9421ebb9 | 4787 | if (targetm.fixed_point_supported_p ()) |
4788 | { | |
4789 | record_builtin_type (RID_MAX, "short _Fract", short_fract_type_node); | |
4790 | record_builtin_type (RID_FRACT, NULL, fract_type_node); | |
4791 | record_builtin_type (RID_MAX, "long _Fract", long_fract_type_node); | |
4792 | record_builtin_type (RID_MAX, "long long _Fract", | |
4793 | long_long_fract_type_node); | |
4794 | record_builtin_type (RID_MAX, "unsigned short _Fract", | |
4795 | unsigned_short_fract_type_node); | |
4796 | record_builtin_type (RID_MAX, "unsigned _Fract", | |
4797 | unsigned_fract_type_node); | |
4798 | record_builtin_type (RID_MAX, "unsigned long _Fract", | |
4799 | unsigned_long_fract_type_node); | |
4800 | record_builtin_type (RID_MAX, "unsigned long long _Fract", | |
4801 | unsigned_long_long_fract_type_node); | |
4802 | record_builtin_type (RID_MAX, "_Sat short _Fract", | |
4803 | sat_short_fract_type_node); | |
4804 | record_builtin_type (RID_MAX, "_Sat _Fract", sat_fract_type_node); | |
4805 | record_builtin_type (RID_MAX, "_Sat long _Fract", | |
4806 | sat_long_fract_type_node); | |
4807 | record_builtin_type (RID_MAX, "_Sat long long _Fract", | |
4808 | sat_long_long_fract_type_node); | |
4809 | record_builtin_type (RID_MAX, "_Sat unsigned short _Fract", | |
4810 | sat_unsigned_short_fract_type_node); | |
4811 | record_builtin_type (RID_MAX, "_Sat unsigned _Fract", | |
4812 | sat_unsigned_fract_type_node); | |
4813 | record_builtin_type (RID_MAX, "_Sat unsigned long _Fract", | |
4814 | sat_unsigned_long_fract_type_node); | |
4815 | record_builtin_type (RID_MAX, "_Sat unsigned long long _Fract", | |
4816 | sat_unsigned_long_long_fract_type_node); | |
4817 | record_builtin_type (RID_MAX, "short _Accum", short_accum_type_node); | |
4818 | record_builtin_type (RID_ACCUM, NULL, accum_type_node); | |
4819 | record_builtin_type (RID_MAX, "long _Accum", long_accum_type_node); | |
4820 | record_builtin_type (RID_MAX, "long long _Accum", | |
4821 | long_long_accum_type_node); | |
4822 | record_builtin_type (RID_MAX, "unsigned short _Accum", | |
4823 | unsigned_short_accum_type_node); | |
4824 | record_builtin_type (RID_MAX, "unsigned _Accum", | |
4825 | unsigned_accum_type_node); | |
4826 | record_builtin_type (RID_MAX, "unsigned long _Accum", | |
4827 | unsigned_long_accum_type_node); | |
4828 | record_builtin_type (RID_MAX, "unsigned long long _Accum", | |
4829 | unsigned_long_long_accum_type_node); | |
4830 | record_builtin_type (RID_MAX, "_Sat short _Accum", | |
4831 | sat_short_accum_type_node); | |
4832 | record_builtin_type (RID_MAX, "_Sat _Accum", sat_accum_type_node); | |
4833 | record_builtin_type (RID_MAX, "_Sat long _Accum", | |
4834 | sat_long_accum_type_node); | |
4835 | record_builtin_type (RID_MAX, "_Sat long long _Accum", | |
4836 | sat_long_long_accum_type_node); | |
4837 | record_builtin_type (RID_MAX, "_Sat unsigned short _Accum", | |
4838 | sat_unsigned_short_accum_type_node); | |
4839 | record_builtin_type (RID_MAX, "_Sat unsigned _Accum", | |
4840 | sat_unsigned_accum_type_node); | |
4841 | record_builtin_type (RID_MAX, "_Sat unsigned long _Accum", | |
4842 | sat_unsigned_long_accum_type_node); | |
4843 | record_builtin_type (RID_MAX, "_Sat unsigned long long _Accum", | |
4844 | sat_unsigned_long_long_accum_type_node); | |
4845 | ||
4846 | } | |
4847 | ||
dc24ddbd | 4848 | lang_hooks.decls.pushdecl (build_decl (TYPE_DECL, |
4849 | get_identifier ("complex int"), | |
4850 | complex_integer_type_node)); | |
4851 | lang_hooks.decls.pushdecl (build_decl (TYPE_DECL, | |
4852 | get_identifier ("complex float"), | |
4853 | complex_float_type_node)); | |
4854 | lang_hooks.decls.pushdecl (build_decl (TYPE_DECL, | |
4855 | get_identifier ("complex double"), | |
4856 | complex_double_type_node)); | |
4857 | lang_hooks.decls.pushdecl | |
20325f61 | 4858 | (build_decl (TYPE_DECL, get_identifier ("complex long double"), |
4859 | complex_long_double_type_node)); | |
174fcc61 | 4860 | |
e256d445 | 4861 | if (c_dialect_cxx ()) |
4862 | /* For C++, make fileptr_type_node a distinct void * type until | |
4863 | FILE type is defined. */ | |
e086912e | 4864 | fileptr_type_node = build_variant_type_copy (ptr_type_node); |
e256d445 | 4865 | |
d946ea19 | 4866 | record_builtin_type (RID_VOID, NULL, void_type_node); |
174fcc61 | 4867 | |
6753bca0 | 4868 | /* Set the TYPE_NAME for any variants that were built before |
4869 | record_builtin_type gave names to the built-in types. */ | |
4870 | { | |
4871 | tree void_name = TYPE_NAME (void_type_node); | |
4872 | TYPE_NAME (void_type_node) = NULL_TREE; | |
4873 | TYPE_NAME (build_qualified_type (void_type_node, TYPE_QUAL_CONST)) | |
4874 | = void_name; | |
4875 | TYPE_NAME (void_type_node) = void_name; | |
4876 | } | |
4877 | ||
fbf0afd1 | 4878 | /* This node must not be shared. */ |
7c446c95 | 4879 | void_zero_node = make_node (INTEGER_CST); |
d2d4bdde | 4880 | TREE_TYPE (void_zero_node) = void_type_node; |
4881 | ||
174fcc61 | 4882 | void_list_node = build_void_list_node (); |
4883 | ||
4884 | /* Make a type to be the domain of a few array types | |
4885 | whose domains don't really matter. | |
4886 | 200 is small enough that it always fits in size_t | |
4887 | and large enough that it can hold most function names for the | |
4888 | initializations of __FUNCTION__ and __PRETTY_FUNCTION__. */ | |
4889 | array_domain_type = build_index_type (size_int (200)); | |
4890 | ||
4891 | /* Make a type for arrays of characters. | |
4892 | With luck nothing will ever really depend on the length of this | |
4893 | array type. */ | |
4894 | char_array_type_node | |
4895 | = build_array_type (char_type_node, array_domain_type); | |
4896 | ||
4897 | /* Likewise for arrays of ints. */ | |
4898 | int_array_type_node | |
4899 | = build_array_type (integer_type_node, array_domain_type); | |
4900 | ||
d2d4bdde | 4901 | string_type_node = build_pointer_type (char_type_node); |
4902 | const_string_type_node | |
4903 | = build_pointer_type (build_qualified_type | |
4904 | (char_type_node, TYPE_QUAL_CONST)); | |
4905 | ||
174fcc61 | 4906 | /* This is special for C++ so functions can be overloaded. */ |
18ef7ac2 | 4907 | wchar_type_node = get_identifier (MODIFIED_WCHAR_TYPE); |
174fcc61 | 4908 | wchar_type_node = TREE_TYPE (identifier_global_value (wchar_type_node)); |
4909 | wchar_type_size = TYPE_PRECISION (wchar_type_node); | |
f3449a3c | 4910 | underlying_wchar_type_node = wchar_type_node; |
c0f19401 | 4911 | if (c_dialect_cxx ()) |
174fcc61 | 4912 | { |
78a8ed03 | 4913 | if (TYPE_UNSIGNED (wchar_type_node)) |
174fcc61 | 4914 | wchar_type_node = make_unsigned_type (wchar_type_size); |
4915 | else | |
4916 | wchar_type_node = make_signed_type (wchar_type_size); | |
4917 | record_builtin_type (RID_WCHAR, "wchar_t", wchar_type_node); | |
4918 | } | |
174fcc61 | 4919 | |
4920 | /* This is for wide string constants. */ | |
4921 | wchar_array_type_node | |
4922 | = build_array_type (wchar_type_node, array_domain_type); | |
4923 | ||
924bbf02 | 4924 | /* Define 'char16_t'. */ |
4925 | char16_type_node = get_identifier (CHAR16_TYPE); | |
4926 | char16_type_node = TREE_TYPE (identifier_global_value (char16_type_node)); | |
4927 | char16_type_size = TYPE_PRECISION (char16_type_node); | |
4928 | if (c_dialect_cxx ()) | |
4929 | { | |
4930 | char16_type_node = make_unsigned_type (char16_type_size); | |
4931 | ||
4932 | if (cxx_dialect == cxx0x) | |
4933 | record_builtin_type (RID_CHAR16, "char16_t", char16_type_node); | |
4934 | } | |
4935 | ||
4936 | /* This is for UTF-16 string constants. */ | |
4937 | char16_array_type_node | |
4938 | = build_array_type (char16_type_node, array_domain_type); | |
4939 | ||
4940 | /* Define 'char32_t'. */ | |
4941 | char32_type_node = get_identifier (CHAR32_TYPE); | |
4942 | char32_type_node = TREE_TYPE (identifier_global_value (char32_type_node)); | |
4943 | char32_type_size = TYPE_PRECISION (char32_type_node); | |
4944 | if (c_dialect_cxx ()) | |
4945 | { | |
4946 | char32_type_node = make_unsigned_type (char32_type_size); | |
4947 | ||
4948 | if (cxx_dialect == cxx0x) | |
4949 | record_builtin_type (RID_CHAR32, "char32_t", char32_type_node); | |
4950 | } | |
4951 | ||
4952 | /* This is for UTF-32 string constants. */ | |
4953 | char32_array_type_node | |
4954 | = build_array_type (char32_type_node, array_domain_type); | |
4955 | ||
6bf5ed8d | 4956 | wint_type_node = |
4957 | TREE_TYPE (identifier_global_value (get_identifier (WINT_TYPE))); | |
4958 | ||
4959 | intmax_type_node = | |
4960 | TREE_TYPE (identifier_global_value (get_identifier (INTMAX_TYPE))); | |
4961 | uintmax_type_node = | |
4962 | TREE_TYPE (identifier_global_value (get_identifier (UINTMAX_TYPE))); | |
4963 | ||
f3449a3c | 4964 | if (SIG_ATOMIC_TYPE) |
4965 | sig_atomic_type_node = | |
9e6687c8 | 4966 | TREE_TYPE (identifier_global_value (c_get_ident (SIG_ATOMIC_TYPE))); |
f3449a3c | 4967 | if (INT8_TYPE) |
4968 | int8_type_node = | |
9e6687c8 | 4969 | TREE_TYPE (identifier_global_value (c_get_ident (INT8_TYPE))); |
f3449a3c | 4970 | if (INT16_TYPE) |
4971 | int16_type_node = | |
9e6687c8 | 4972 | TREE_TYPE (identifier_global_value (c_get_ident (INT16_TYPE))); |
f3449a3c | 4973 | if (INT32_TYPE) |
4974 | int32_type_node = | |
9e6687c8 | 4975 | TREE_TYPE (identifier_global_value (c_get_ident (INT32_TYPE))); |
f3449a3c | 4976 | if (INT64_TYPE) |
4977 | int64_type_node = | |
9e6687c8 | 4978 | TREE_TYPE (identifier_global_value (c_get_ident (INT64_TYPE))); |
f3449a3c | 4979 | if (UINT8_TYPE) |
4980 | uint8_type_node = | |
9e6687c8 | 4981 | TREE_TYPE (identifier_global_value (c_get_ident (UINT8_TYPE))); |
f3449a3c | 4982 | if (UINT16_TYPE) |
4983 | uint16_type_node = | |
9e6687c8 | 4984 | TREE_TYPE (identifier_global_value (c_get_ident (UINT16_TYPE))); |
f3449a3c | 4985 | if (UINT32_TYPE) |
4986 | c_uint32_type_node = | |
9e6687c8 | 4987 | TREE_TYPE (identifier_global_value (c_get_ident (UINT32_TYPE))); |
f3449a3c | 4988 | if (UINT64_TYPE) |
4989 | c_uint64_type_node = | |
9e6687c8 | 4990 | TREE_TYPE (identifier_global_value (c_get_ident (UINT64_TYPE))); |
f3449a3c | 4991 | if (INT_LEAST8_TYPE) |
4992 | int_least8_type_node = | |
9e6687c8 | 4993 | TREE_TYPE (identifier_global_value (c_get_ident (INT_LEAST8_TYPE))); |
f3449a3c | 4994 | if (INT_LEAST16_TYPE) |
4995 | int_least16_type_node = | |
9e6687c8 | 4996 | TREE_TYPE (identifier_global_value (c_get_ident (INT_LEAST16_TYPE))); |
f3449a3c | 4997 | if (INT_LEAST32_TYPE) |
4998 | int_least32_type_node = | |
9e6687c8 | 4999 | TREE_TYPE (identifier_global_value (c_get_ident (INT_LEAST32_TYPE))); |
f3449a3c | 5000 | if (INT_LEAST64_TYPE) |
5001 | int_least64_type_node = | |
9e6687c8 | 5002 | TREE_TYPE (identifier_global_value (c_get_ident (INT_LEAST64_TYPE))); |
f3449a3c | 5003 | if (UINT_LEAST8_TYPE) |
5004 | uint_least8_type_node = | |
9e6687c8 | 5005 | TREE_TYPE (identifier_global_value (c_get_ident (UINT_LEAST8_TYPE))); |
f3449a3c | 5006 | if (UINT_LEAST16_TYPE) |
5007 | uint_least16_type_node = | |
9e6687c8 | 5008 | TREE_TYPE (identifier_global_value (c_get_ident (UINT_LEAST16_TYPE))); |
f3449a3c | 5009 | if (UINT_LEAST32_TYPE) |
5010 | uint_least32_type_node = | |
9e6687c8 | 5011 | TREE_TYPE (identifier_global_value (c_get_ident (UINT_LEAST32_TYPE))); |
f3449a3c | 5012 | if (UINT_LEAST64_TYPE) |
5013 | uint_least64_type_node = | |
9e6687c8 | 5014 | TREE_TYPE (identifier_global_value (c_get_ident (UINT_LEAST64_TYPE))); |
f3449a3c | 5015 | if (INT_FAST8_TYPE) |
5016 | int_fast8_type_node = | |
9e6687c8 | 5017 | TREE_TYPE (identifier_global_value (c_get_ident (INT_FAST8_TYPE))); |
f3449a3c | 5018 | if (INT_FAST16_TYPE) |
5019 | int_fast16_type_node = | |
9e6687c8 | 5020 | TREE_TYPE (identifier_global_value (c_get_ident (INT_FAST16_TYPE))); |
f3449a3c | 5021 | if (INT_FAST32_TYPE) |
5022 | int_fast32_type_node = | |
9e6687c8 | 5023 | TREE_TYPE (identifier_global_value (c_get_ident (INT_FAST32_TYPE))); |
f3449a3c | 5024 | if (INT_FAST64_TYPE) |
5025 | int_fast64_type_node = | |
9e6687c8 | 5026 | TREE_TYPE (identifier_global_value (c_get_ident (INT_FAST64_TYPE))); |
f3449a3c | 5027 | if (UINT_FAST8_TYPE) |
5028 | uint_fast8_type_node = | |
9e6687c8 | 5029 | TREE_TYPE (identifier_global_value (c_get_ident (UINT_FAST8_TYPE))); |
f3449a3c | 5030 | if (UINT_FAST16_TYPE) |
5031 | uint_fast16_type_node = | |
9e6687c8 | 5032 | TREE_TYPE (identifier_global_value (c_get_ident (UINT_FAST16_TYPE))); |
f3449a3c | 5033 | if (UINT_FAST32_TYPE) |
5034 | uint_fast32_type_node = | |
9e6687c8 | 5035 | TREE_TYPE (identifier_global_value (c_get_ident (UINT_FAST32_TYPE))); |
f3449a3c | 5036 | if (UINT_FAST64_TYPE) |
5037 | uint_fast64_type_node = | |
9e6687c8 | 5038 | TREE_TYPE (identifier_global_value (c_get_ident (UINT_FAST64_TYPE))); |
f3449a3c | 5039 | if (INTPTR_TYPE) |
5040 | intptr_type_node = | |
9e6687c8 | 5041 | TREE_TYPE (identifier_global_value (c_get_ident (INTPTR_TYPE))); |
f3449a3c | 5042 | if (UINTPTR_TYPE) |
5043 | uintptr_type_node = | |
9e6687c8 | 5044 | TREE_TYPE (identifier_global_value (c_get_ident (UINTPTR_TYPE))); |
f3449a3c | 5045 | |
6bf5ed8d | 5046 | default_function_type = build_function_type (integer_type_node, NULL_TREE); |
5047 | ptrdiff_type_node | |
5048 | = TREE_TYPE (identifier_global_value (get_identifier (PTRDIFF_TYPE))); | |
11773141 | 5049 | unsigned_ptrdiff_type_node = c_common_unsigned_type (ptrdiff_type_node); |
6bf5ed8d | 5050 | |
dc24ddbd | 5051 | lang_hooks.decls.pushdecl |
20325f61 | 5052 | (build_decl (TYPE_DECL, get_identifier ("__builtin_va_list"), |
5053 | va_list_type_node)); | |
5f57a8b1 | 5054 | #ifdef TARGET_ENUM_VA_LIST |
5055 | { | |
5056 | int l; | |
5057 | const char *pname; | |
5058 | tree ptype; | |
5059 | for (l = 0; TARGET_ENUM_VA_LIST (l, &pname, &ptype); ++l) | |
5060 | { | |
5061 | lang_hooks.decls.pushdecl | |
5062 | (build_decl (TYPE_DECL, get_identifier (pname), | |
5063 | ptype)); | |
5064 | ||
5065 | } | |
5066 | } | |
5067 | #endif | |
8a15c04a | 5068 | |
8a15c04a | 5069 | if (TREE_CODE (va_list_type_node) == ARRAY_TYPE) |
2d47cc32 | 5070 | { |
5071 | va_list_arg_type_node = va_list_ref_type_node = | |
5072 | build_pointer_type (TREE_TYPE (va_list_type_node)); | |
5073 | } | |
8a15c04a | 5074 | else |
2d47cc32 | 5075 | { |
5076 | va_list_arg_type_node = va_list_type_node; | |
5077 | va_list_ref_type_node = build_reference_type (va_list_type_node); | |
5078 | } | |
1cae46be | 5079 | |
dce22712 | 5080 | if (!flag_preprocess_only) |
5081 | c_define_builtins (va_list_ref_type_node, va_list_arg_type_node); | |
ffa8918b | 5082 | |
5c62f199 | 5083 | main_identifier_node = get_identifier ("main"); |
ae84079f | 5084 | |
5085 | /* Create the built-in __null node. It is important that this is | |
5086 | not shared. */ | |
5087 | null_node = make_node (INTEGER_CST); | |
5088 | TREE_TYPE (null_node) = c_common_type_for_size (POINTER_SIZE, 0); | |
27213ba3 | 5089 | |
5090 | /* Since builtin_types isn't gc'ed, don't export these nodes. */ | |
5091 | memset (builtin_types, 0, sizeof (builtin_types)); | |
72040e7e | 5092 | } |
a66c9326 | 5093 | |
46a7e216 | 5094 | /* Look up the function in built_in_decls that corresponds to DECL |
5095 | and set ASMSPEC as its user assembler name. DECL must be a | |
f7f07c95 | 5096 | function decl that declares a builtin. */ |
46a7e216 | 5097 | |
5098 | void | |
5099 | set_builtin_user_assembler_name (tree decl, const char *asmspec) | |
5100 | { | |
5101 | tree builtin; | |
5102 | gcc_assert (TREE_CODE (decl) == FUNCTION_DECL | |
5103 | && DECL_BUILT_IN_CLASS (decl) == BUILT_IN_NORMAL | |
5104 | && asmspec != 0); | |
5105 | ||
5106 | builtin = built_in_decls [DECL_FUNCTION_CODE (decl)]; | |
5107 | set_user_assembler_name (builtin, asmspec); | |
979d3efc | 5108 | switch (DECL_FUNCTION_CODE (decl)) |
5109 | { | |
5110 | case BUILT_IN_MEMCPY: | |
5111 | init_block_move_fn (asmspec); | |
5112 | memcpy_libfunc = set_user_assembler_libfunc ("memcpy", asmspec); | |
5113 | break; | |
5114 | case BUILT_IN_MEMSET: | |
5115 | init_block_clear_fn (asmspec); | |
5116 | memset_libfunc = set_user_assembler_libfunc ("memset", asmspec); | |
5117 | break; | |
5118 | case BUILT_IN_MEMMOVE: | |
5119 | memmove_libfunc = set_user_assembler_libfunc ("memmove", asmspec); | |
5120 | break; | |
5121 | case BUILT_IN_MEMCMP: | |
5122 | memcmp_libfunc = set_user_assembler_libfunc ("memcmp", asmspec); | |
5123 | break; | |
5124 | case BUILT_IN_ABORT: | |
5125 | abort_libfunc = set_user_assembler_libfunc ("abort", asmspec); | |
5126 | break; | |
5127 | default: | |
5128 | break; | |
5129 | } | |
46a7e216 | 5130 | } |
5131 | ||
79b01846 | 5132 | /* The number of named compound-literals generated thus far. */ |
5133 | static GTY(()) int compound_literal_number; | |
5134 | ||
5135 | /* Set DECL_NAME for DECL, a VAR_DECL for a compound-literal. */ | |
5136 | ||
5137 | void | |
5138 | set_compound_literal_name (tree decl) | |
5139 | { | |
5140 | char *name; | |
5141 | ASM_FORMAT_PRIVATE_NAME (name, "__compound_literal", | |
5142 | compound_literal_number); | |
5143 | compound_literal_number++; | |
5144 | DECL_NAME (decl) = get_identifier (name); | |
5145 | } | |
5146 | ||
a66c9326 | 5147 | tree |
1cae46be | 5148 | build_va_arg (tree expr, tree type) |
a66c9326 | 5149 | { |
5150 | return build1 (VA_ARG_EXPR, type, expr); | |
5151 | } | |
0d4238dc | 5152 | |
5153 | ||
dd878098 | 5154 | /* Linked list of disabled built-in functions. */ |
5155 | ||
5156 | typedef struct disabled_builtin | |
5157 | { | |
5158 | const char *name; | |
5159 | struct disabled_builtin *next; | |
5160 | } disabled_builtin; | |
5161 | static disabled_builtin *disabled_builtins = NULL; | |
5162 | ||
1cae46be | 5163 | static bool builtin_function_disabled_p (const char *); |
dd878098 | 5164 | |
5165 | /* Disable a built-in function specified by -fno-builtin-NAME. If NAME | |
5166 | begins with "__builtin_", give an error. */ | |
5167 | ||
5168 | void | |
1cae46be | 5169 | disable_builtin_function (const char *name) |
dd878098 | 5170 | { |
5171 | if (strncmp (name, "__builtin_", strlen ("__builtin_")) == 0) | |
b0b1af64 | 5172 | error ("cannot disable built-in function %qs", name); |
dd878098 | 5173 | else |
5174 | { | |
e85905e5 | 5175 | disabled_builtin *new_disabled_builtin = XNEW (disabled_builtin); |
5176 | new_disabled_builtin->name = name; | |
5177 | new_disabled_builtin->next = disabled_builtins; | |
5178 | disabled_builtins = new_disabled_builtin; | |
dd878098 | 5179 | } |
5180 | } | |
5181 | ||
5182 | ||
5183 | /* Return true if the built-in function NAME has been disabled, false | |
5184 | otherwise. */ | |
5185 | ||
5186 | static bool | |
1cae46be | 5187 | builtin_function_disabled_p (const char *name) |
dd878098 | 5188 | { |
5189 | disabled_builtin *p; | |
5190 | for (p = disabled_builtins; p != NULL; p = p->next) | |
5191 | { | |
5192 | if (strcmp (name, p->name) == 0) | |
5193 | return true; | |
5194 | } | |
5195 | return false; | |
5196 | } | |
5197 | ||
5198 | ||
3237155d | 5199 | /* Worker for DEF_BUILTIN. |
5200 | Possibly define a builtin function with one or two names. | |
5201 | Does not declare a non-__builtin_ function if flag_no_builtin, or if | |
5202 | nonansi_p and flag_no_nonansi_builtin. */ | |
0d4238dc | 5203 | |
3237155d | 5204 | static void |
5205 | def_builtin_1 (enum built_in_function fncode, | |
5206 | const char *name, | |
5207 | enum built_in_class fnclass, | |
5208 | tree fntype, tree libtype, | |
5209 | bool both_p, bool fallback_p, bool nonansi_p, | |
5210 | tree fnattrs, bool implicit_p) | |
0d4238dc | 5211 | { |
3237155d | 5212 | tree decl; |
5213 | const char *libname; | |
5214 | ||
27213ba3 | 5215 | if (fntype == error_mark_node) |
5216 | return; | |
5217 | ||
3237155d | 5218 | gcc_assert ((!both_p && !fallback_p) |
5219 | || !strncmp (name, "__builtin_", | |
5220 | strlen ("__builtin_"))); | |
5221 | ||
5222 | libname = name + strlen ("__builtin_"); | |
54be5d7e | 5223 | decl = add_builtin_function (name, fntype, fncode, fnclass, |
5224 | (fallback_p ? libname : NULL), | |
5225 | fnattrs); | |
3237155d | 5226 | if (both_p |
5227 | && !flag_no_builtin && !builtin_function_disabled_p (libname) | |
dd878098 | 5228 | && !(nonansi_p && flag_no_nonansi_builtin)) |
54be5d7e | 5229 | add_builtin_function (libname, libtype, fncode, fnclass, |
5230 | NULL, fnattrs); | |
a40609e6 | 5231 | |
3237155d | 5232 | built_in_decls[(int) fncode] = decl; |
5233 | if (implicit_p) | |
5234 | implicit_built_in_decls[(int) fncode] = decl; | |
0d4238dc | 5235 | } |
e94026da | 5236 | \f |
d7aeef06 | 5237 | /* Nonzero if the type T promotes to int. This is (nearly) the |
5238 | integral promotions defined in ISO C99 6.3.1.1/2. */ | |
5239 | ||
5240 | bool | |
9f627b1a | 5241 | c_promoting_integer_type_p (const_tree t) |
d7aeef06 | 5242 | { |
5243 | switch (TREE_CODE (t)) | |
5244 | { | |
5245 | case INTEGER_TYPE: | |
5246 | return (TYPE_MAIN_VARIANT (t) == char_type_node | |
5247 | || TYPE_MAIN_VARIANT (t) == signed_char_type_node | |
5248 | || TYPE_MAIN_VARIANT (t) == unsigned_char_type_node | |
5249 | || TYPE_MAIN_VARIANT (t) == short_integer_type_node | |
7aa1e6eb | 5250 | || TYPE_MAIN_VARIANT (t) == short_unsigned_type_node |
5251 | || TYPE_PRECISION (t) < TYPE_PRECISION (integer_type_node)); | |
d7aeef06 | 5252 | |
5253 | case ENUMERAL_TYPE: | |
5254 | /* ??? Technically all enumerations not larger than an int | |
5255 | promote to an int. But this is used along code paths | |
5256 | that only want to notice a size change. */ | |
5257 | return TYPE_PRECISION (t) < TYPE_PRECISION (integer_type_node); | |
5258 | ||
5259 | case BOOLEAN_TYPE: | |
5260 | return 1; | |
5261 | ||
5262 | default: | |
5263 | return 0; | |
5264 | } | |
5265 | } | |
5266 | ||
e94026da | 5267 | /* Return 1 if PARMS specifies a fixed number of parameters |
5268 | and none of their types is affected by default promotions. */ | |
5269 | ||
5270 | int | |
9f627b1a | 5271 | self_promoting_args_p (const_tree parms) |
e94026da | 5272 | { |
9f627b1a | 5273 | const_tree t; |
e94026da | 5274 | for (t = parms; t; t = TREE_CHAIN (t)) |
5275 | { | |
19cb6b50 | 5276 | tree type = TREE_VALUE (t); |
43f74bc4 | 5277 | |
e1d8e198 | 5278 | if (type == error_mark_node) |
5279 | continue; | |
5280 | ||
e94026da | 5281 | if (TREE_CHAIN (t) == 0 && type != void_type_node) |
5282 | return 0; | |
5283 | ||
5284 | if (type == 0) | |
5285 | return 0; | |
5286 | ||
5287 | if (TYPE_MAIN_VARIANT (type) == float_type_node) | |
5288 | return 0; | |
5289 | ||
d7aeef06 | 5290 | if (c_promoting_integer_type_p (type)) |
e94026da | 5291 | return 0; |
5292 | } | |
5293 | return 1; | |
5294 | } | |
605fb01e | 5295 | |
c10de5e7 | 5296 | /* Recursively remove any '*' or '&' operator from TYPE. */ |
5297 | tree | |
5298 | strip_pointer_operator (tree t) | |
5299 | { | |
5300 | while (POINTER_TYPE_P (t)) | |
5301 | t = TREE_TYPE (t); | |
5302 | return t; | |
5303 | } | |
5304 | ||
57a0ed23 | 5305 | /* Recursively remove pointer or array type from TYPE. */ |
5306 | tree | |
5307 | strip_pointer_or_array_types (tree t) | |
5308 | { | |
5309 | while (TREE_CODE (t) == ARRAY_TYPE || POINTER_TYPE_P (t)) | |
5310 | t = TREE_TYPE (t); | |
5311 | return t; | |
5312 | } | |
5313 | ||
e41f0d80 | 5314 | /* Used to compare case labels. K1 and K2 are actually tree nodes |
5315 | representing case labels, or NULL_TREE for a `default' label. | |
5316 | Returns -1 if K1 is ordered before K2, -1 if K1 is ordered after | |
5317 | K2, and 0 if K1 and K2 are equal. */ | |
5318 | ||
5319 | int | |
1cae46be | 5320 | case_compare (splay_tree_key k1, splay_tree_key k2) |
e41f0d80 | 5321 | { |
5322 | /* Consider a NULL key (such as arises with a `default' label) to be | |
5323 | smaller than anything else. */ | |
5324 | if (!k1) | |
5325 | return k2 ? -1 : 0; | |
5326 | else if (!k2) | |
5327 | return k1 ? 1 : 0; | |
5328 | ||
5329 | return tree_int_cst_compare ((tree) k1, (tree) k2); | |
5330 | } | |
5331 | ||
5332 | /* Process a case label for the range LOW_VALUE ... HIGH_VALUE. If | |
5333 | LOW_VALUE and HIGH_VALUE are both NULL_TREE then this case label is | |
5334 | actually a `default' label. If only HIGH_VALUE is NULL_TREE, then | |
5335 | case label was declared using the usual C/C++ syntax, rather than | |
5336 | the GNU case range extension. CASES is a tree containing all the | |
5337 | case ranges processed so far; COND is the condition for the | |
eaae3b75 | 5338 | switch-statement itself. Returns the CASE_LABEL_EXPR created, or |
5339 | ERROR_MARK_NODE if no CASE_LABEL_EXPR is created. */ | |
e41f0d80 | 5340 | |
5341 | tree | |
2ca392fd | 5342 | c_add_case_label (splay_tree cases, tree cond, tree orig_type, |
5343 | tree low_value, tree high_value) | |
e41f0d80 | 5344 | { |
5345 | tree type; | |
5346 | tree label; | |
5347 | tree case_label; | |
5348 | splay_tree_node node; | |
5349 | ||
5350 | /* Create the LABEL_DECL itself. */ | |
4ee9c684 | 5351 | label = create_artificial_label (); |
e41f0d80 | 5352 | |
5353 | /* If there was an error processing the switch condition, bail now | |
5354 | before we get more confused. */ | |
5355 | if (!cond || cond == error_mark_node) | |
4ee9c684 | 5356 | goto error_out; |
e41f0d80 | 5357 | |
1cae46be | 5358 | if ((low_value && TREE_TYPE (low_value) |
5359 | && POINTER_TYPE_P (TREE_TYPE (low_value))) | |
e41f0d80 | 5360 | || (high_value && TREE_TYPE (high_value) |
5361 | && POINTER_TYPE_P (TREE_TYPE (high_value)))) | |
b96dc121 | 5362 | { |
5363 | error ("pointers are not permitted as case values"); | |
5364 | goto error_out; | |
5365 | } | |
e41f0d80 | 5366 | |
5367 | /* Case ranges are a GNU extension. */ | |
8864917d | 5368 | if (high_value) |
21ca8540 | 5369 | pedwarn (input_location, OPT_pedantic, |
8864917d | 5370 | "range expressions in switch statements are non-standard"); |
e41f0d80 | 5371 | |
5372 | type = TREE_TYPE (cond); | |
5373 | if (low_value) | |
5374 | { | |
5375 | low_value = check_case_value (low_value); | |
5376 | low_value = convert_and_check (type, low_value); | |
96722196 | 5377 | if (low_value == error_mark_node) |
5378 | goto error_out; | |
e41f0d80 | 5379 | } |
5380 | if (high_value) | |
5381 | { | |
5382 | high_value = check_case_value (high_value); | |
5383 | high_value = convert_and_check (type, high_value); | |
96722196 | 5384 | if (high_value == error_mark_node) |
5385 | goto error_out; | |
e41f0d80 | 5386 | } |
5387 | ||
96722196 | 5388 | if (low_value && high_value) |
5389 | { | |
5390 | /* If the LOW_VALUE and HIGH_VALUE are the same, then this isn't | |
a0c938f0 | 5391 | really a case range, even though it was written that way. |
5392 | Remove the HIGH_VALUE to simplify later processing. */ | |
96722196 | 5393 | if (tree_int_cst_equal (low_value, high_value)) |
5394 | high_value = NULL_TREE; | |
5395 | else if (!tree_int_cst_lt (low_value, high_value)) | |
5396 | warning (0, "empty range specified"); | |
5397 | } | |
e41f0d80 | 5398 | |
2ca392fd | 5399 | /* See if the case is in range of the type of the original testing |
5400 | expression. If both low_value and high_value are out of range, | |
5401 | don't insert the case label and return NULL_TREE. */ | |
5402 | if (low_value | |
84166705 | 5403 | && !check_case_bounds (type, orig_type, |
5404 | &low_value, high_value ? &high_value : NULL)) | |
2ca392fd | 5405 | return NULL_TREE; |
5406 | ||
e41f0d80 | 5407 | /* Look up the LOW_VALUE in the table of case labels we already |
5408 | have. */ | |
5409 | node = splay_tree_lookup (cases, (splay_tree_key) low_value); | |
5410 | /* If there was not an exact match, check for overlapping ranges. | |
5411 | There's no need to do this if there's no LOW_VALUE or HIGH_VALUE; | |
5412 | that's a `default' label and the only overlap is an exact match. */ | |
5413 | if (!node && (low_value || high_value)) | |
5414 | { | |
5415 | splay_tree_node low_bound; | |
5416 | splay_tree_node high_bound; | |
5417 | ||
5418 | /* Even though there wasn't an exact match, there might be an | |
5419 | overlap between this case range and another case range. | |
5420 | Since we've (inductively) not allowed any overlapping case | |
5421 | ranges, we simply need to find the greatest low case label | |
5422 | that is smaller that LOW_VALUE, and the smallest low case | |
5423 | label that is greater than LOW_VALUE. If there is an overlap | |
5424 | it will occur in one of these two ranges. */ | |
5425 | low_bound = splay_tree_predecessor (cases, | |
5426 | (splay_tree_key) low_value); | |
5427 | high_bound = splay_tree_successor (cases, | |
5428 | (splay_tree_key) low_value); | |
5429 | ||
5430 | /* Check to see if the LOW_BOUND overlaps. It is smaller than | |
5431 | the LOW_VALUE, so there is no need to check unless the | |
5432 | LOW_BOUND is in fact itself a case range. */ | |
5433 | if (low_bound | |
5434 | && CASE_HIGH ((tree) low_bound->value) | |
5435 | && tree_int_cst_compare (CASE_HIGH ((tree) low_bound->value), | |
5436 | low_value) >= 0) | |
5437 | node = low_bound; | |
5438 | /* Check to see if the HIGH_BOUND overlaps. The low end of that | |
5439 | range is bigger than the low end of the current range, so we | |
5440 | are only interested if the current range is a real range, and | |
5441 | not an ordinary case label. */ | |
1cae46be | 5442 | else if (high_bound |
e41f0d80 | 5443 | && high_value |
5444 | && (tree_int_cst_compare ((tree) high_bound->key, | |
5445 | high_value) | |
5446 | <= 0)) | |
5447 | node = high_bound; | |
5448 | } | |
5449 | /* If there was an overlap, issue an error. */ | |
5450 | if (node) | |
5451 | { | |
eaae3b75 | 5452 | tree duplicate = CASE_LABEL ((tree) node->value); |
e41f0d80 | 5453 | |
5454 | if (high_value) | |
5455 | { | |
5456 | error ("duplicate (or overlapping) case value"); | |
9bc3739f | 5457 | error ("%Jthis is the first entry overlapping that value", duplicate); |
e41f0d80 | 5458 | } |
5459 | else if (low_value) | |
5460 | { | |
5461 | error ("duplicate case value") ; | |
9bc3739f | 5462 | error ("%Jpreviously used here", duplicate); |
e41f0d80 | 5463 | } |
5464 | else | |
5465 | { | |
5466 | error ("multiple default labels in one switch"); | |
9bc3739f | 5467 | error ("%Jthis is the first default label", duplicate); |
e41f0d80 | 5468 | } |
4ee9c684 | 5469 | goto error_out; |
e41f0d80 | 5470 | } |
5471 | ||
5472 | /* Add a CASE_LABEL to the statement-tree. */ | |
5473 | case_label = add_stmt (build_case_label (low_value, high_value, label)); | |
5474 | /* Register this case label in the splay tree. */ | |
1cae46be | 5475 | splay_tree_insert (cases, |
e41f0d80 | 5476 | (splay_tree_key) low_value, |
5477 | (splay_tree_value) case_label); | |
5478 | ||
5479 | return case_label; | |
4ee9c684 | 5480 | |
5481 | error_out: | |
daf6dff5 | 5482 | /* Add a label so that the back-end doesn't think that the beginning of |
4ee9c684 | 5483 | the switch is unreachable. Note that we do not add a case label, as |
a53ff4c1 | 5484 | that just leads to duplicates and thence to failure later on. */ |
4ee9c684 | 5485 | if (!cases->root) |
5486 | { | |
5487 | tree t = create_artificial_label (); | |
daf6dff5 | 5488 | add_stmt (build_stmt (LABEL_EXPR, t)); |
4ee9c684 | 5489 | } |
5490 | return error_mark_node; | |
5491 | } | |
5492 | ||
5493 | /* Subroutines of c_do_switch_warnings, called via splay_tree_foreach. | |
5494 | Used to verify that case values match up with enumerator values. */ | |
5495 | ||
5496 | static void | |
5497 | match_case_to_enum_1 (tree key, tree type, tree label) | |
5498 | { | |
5499 | char buf[2 + 2*HOST_BITS_PER_WIDE_INT/4 + 1]; | |
5500 | ||
5501 | /* ??? Not working too hard to print the double-word value. | |
5502 | Should perhaps be done with %lwd in the diagnostic routines? */ | |
5503 | if (TREE_INT_CST_HIGH (key) == 0) | |
5504 | snprintf (buf, sizeof (buf), HOST_WIDE_INT_PRINT_UNSIGNED, | |
5505 | TREE_INT_CST_LOW (key)); | |
5506 | else if (!TYPE_UNSIGNED (type) | |
5507 | && TREE_INT_CST_HIGH (key) == -1 | |
5508 | && TREE_INT_CST_LOW (key) != 0) | |
5509 | snprintf (buf, sizeof (buf), "-" HOST_WIDE_INT_PRINT_UNSIGNED, | |
5510 | -TREE_INT_CST_LOW (key)); | |
5511 | else | |
5512 | snprintf (buf, sizeof (buf), HOST_WIDE_INT_PRINT_DOUBLE_HEX, | |
7df7561b | 5513 | (unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (key), |
5514 | (unsigned HOST_WIDE_INT) TREE_INT_CST_LOW (key)); | |
4ee9c684 | 5515 | |
5516 | if (TYPE_NAME (type) == 0) | |
6cbbbc89 | 5517 | warning (warn_switch ? OPT_Wswitch : OPT_Wswitch_enum, |
5518 | "%Jcase value %qs not in enumerated type", | |
eaae3b75 | 5519 | CASE_LABEL (label), buf); |
4ee9c684 | 5520 | else |
6cbbbc89 | 5521 | warning (warn_switch ? OPT_Wswitch : OPT_Wswitch_enum, |
5522 | "%Jcase value %qs not in enumerated type %qT", | |
eaae3b75 | 5523 | CASE_LABEL (label), buf, type); |
4ee9c684 | 5524 | } |
5525 | ||
359d87c6 | 5526 | /* Subroutine of c_do_switch_warnings, called via splay_tree_foreach. |
5527 | Used to verify that case values match up with enumerator values. */ | |
5528 | ||
4ee9c684 | 5529 | static int |
5530 | match_case_to_enum (splay_tree_node node, void *data) | |
5531 | { | |
5532 | tree label = (tree) node->value; | |
4fd61bc6 | 5533 | tree type = (tree) data; |
4ee9c684 | 5534 | |
5535 | /* Skip default case. */ | |
5536 | if (!CASE_LOW (label)) | |
5537 | return 0; | |
5538 | ||
359d87c6 | 5539 | /* If CASE_LOW_SEEN is not set, that means CASE_LOW did not appear |
4ee9c684 | 5540 | when we did our enum->case scan. Reset our scratch bit after. */ |
359d87c6 | 5541 | if (!CASE_LOW_SEEN (label)) |
4ee9c684 | 5542 | match_case_to_enum_1 (CASE_LOW (label), type, label); |
5543 | else | |
359d87c6 | 5544 | CASE_LOW_SEEN (label) = 0; |
4ee9c684 | 5545 | |
359d87c6 | 5546 | /* If CASE_HIGH is non-null, we have a range. If CASE_HIGH_SEEN is |
5547 | not set, that means that CASE_HIGH did not appear when we did our | |
5548 | enum->case scan. Reset our scratch bit after. */ | |
4ee9c684 | 5549 | if (CASE_HIGH (label)) |
5550 | { | |
359d87c6 | 5551 | if (!CASE_HIGH_SEEN (label)) |
5552 | match_case_to_enum_1 (CASE_HIGH (label), type, label); | |
5553 | else | |
5554 | CASE_HIGH_SEEN (label) = 0; | |
4ee9c684 | 5555 | } |
5556 | ||
5557 | return 0; | |
5558 | } | |
5559 | ||
e7911019 | 5560 | /* Handle -Wswitch*. Called from the front end after parsing the |
5561 | switch construct. */ | |
5562 | /* ??? Should probably be somewhere generic, since other languages | |
5563 | besides C and C++ would want this. At the moment, however, C/C++ | |
5564 | are the only tree-ssa languages that support enumerations at all, | |
5565 | so the point is moot. */ | |
4ee9c684 | 5566 | |
e7911019 | 5567 | void |
5568 | c_do_switch_warnings (splay_tree cases, location_t switch_location, | |
5569 | tree type, tree cond) | |
4ee9c684 | 5570 | { |
b27ac6b5 | 5571 | splay_tree_node default_node; |
359d87c6 | 5572 | splay_tree_node node; |
5573 | tree chain; | |
6cbbbc89 | 5574 | int saved_warn_switch; |
4ee9c684 | 5575 | |
5576 | if (!warn_switch && !warn_switch_enum && !warn_switch_default) | |
5577 | return; | |
5578 | ||
4ee9c684 | 5579 | default_node = splay_tree_lookup (cases, (splay_tree_key) NULL); |
8b6866af | 5580 | if (!default_node) |
5581 | warning (OPT_Wswitch_default, "%Hswitch missing default case", | |
5582 | &switch_location); | |
4ee9c684 | 5583 | |
359d87c6 | 5584 | /* From here on, we only care about about enumerated types. */ |
5585 | if (!type || TREE_CODE (type) != ENUMERAL_TYPE) | |
5586 | return; | |
5587 | ||
4ee9c684 | 5588 | /* If the switch expression was an enumerated type, check that |
5589 | exactly all enumeration literals are covered by the cases. | |
5590 | The check is made when -Wswitch was specified and there is no | |
5591 | default case, or when -Wswitch-enum was specified. */ | |
4ee9c684 | 5592 | |
359d87c6 | 5593 | if (!warn_switch_enum |
5594 | && !(warn_switch && !default_node)) | |
5595 | return; | |
5596 | ||
5597 | /* Clearing COND if it is not an integer constant simplifies | |
5598 | the tests inside the loop below. */ | |
5599 | if (TREE_CODE (cond) != INTEGER_CST) | |
5600 | cond = NULL_TREE; | |
5601 | ||
5602 | /* The time complexity here is O(N*lg(N)) worst case, but for the | |
5603 | common case of monotonically increasing enumerators, it is | |
5604 | O(N), since the nature of the splay tree will keep the next | |
5605 | element adjacent to the root at all times. */ | |
4ee9c684 | 5606 | |
359d87c6 | 5607 | for (chain = TYPE_VALUES (type); chain; chain = TREE_CHAIN (chain)) |
5608 | { | |
5609 | tree value = TREE_VALUE (chain); | |
3f00a6c0 | 5610 | if (TREE_CODE (value) == CONST_DECL) |
5611 | value = DECL_INITIAL (value); | |
359d87c6 | 5612 | node = splay_tree_lookup (cases, (splay_tree_key) value); |
5613 | if (node) | |
4ee9c684 | 5614 | { |
359d87c6 | 5615 | /* Mark the CASE_LOW part of the case entry as seen. */ |
5616 | tree label = (tree) node->value; | |
5617 | CASE_LOW_SEEN (label) = 1; | |
5618 | continue; | |
5619 | } | |
5620 | ||
5621 | /* Even though there wasn't an exact match, there might be a | |
f0b5f617 | 5622 | case range which includes the enumerator's value. */ |
359d87c6 | 5623 | node = splay_tree_predecessor (cases, (splay_tree_key) value); |
5624 | if (node && CASE_HIGH ((tree) node->value)) | |
5625 | { | |
5626 | tree label = (tree) node->value; | |
5627 | int cmp = tree_int_cst_compare (CASE_HIGH (label), value); | |
5628 | if (cmp >= 0) | |
4ee9c684 | 5629 | { |
359d87c6 | 5630 | /* If we match the upper bound exactly, mark the CASE_HIGH |
5631 | part of the case entry as seen. */ | |
5632 | if (cmp == 0) | |
5633 | CASE_HIGH_SEEN (label) = 1; | |
5634 | continue; | |
4ee9c684 | 5635 | } |
5636 | } | |
5637 | ||
359d87c6 | 5638 | /* We've now determined that this enumerated literal isn't |
5639 | handled by the case labels of the switch statement. */ | |
4ee9c684 | 5640 | |
359d87c6 | 5641 | /* If the switch expression is a constant, we only really care |
5642 | about whether that constant is handled by the switch. */ | |
5643 | if (cond && tree_int_cst_compare (cond, value)) | |
5644 | continue; | |
4ee9c684 | 5645 | |
6cbbbc89 | 5646 | /* If there is a default_node, the only relevant option is |
5647 | Wswitch-enum. Otherwise, if both are enabled then we prefer | |
5648 | to warn using -Wswitch because -Wswitch is enabled by -Wall | |
5649 | while -Wswitch-enum is explicit. */ | |
5650 | warning ((default_node || !warn_switch) | |
5651 | ? OPT_Wswitch_enum : OPT_Wswitch, | |
5652 | "%Henumeration value %qE not handled in switch", | |
359d87c6 | 5653 | &switch_location, TREE_PURPOSE (chain)); |
4ee9c684 | 5654 | } |
359d87c6 | 5655 | |
5656 | /* Warn if there are case expressions that don't correspond to | |
5657 | enumerators. This can occur since C and C++ don't enforce | |
5658 | type-checking of assignments to enumeration variables. | |
5659 | ||
5660 | The time complexity here is now always O(N) worst case, since | |
5661 | we should have marked both the lower bound and upper bound of | |
5662 | every disjoint case label, with CASE_LOW_SEEN and CASE_HIGH_SEEN | |
5663 | above. This scan also resets those fields. */ | |
6cbbbc89 | 5664 | |
5665 | /* If there is a default_node, the only relevant option is | |
5666 | Wswitch-enum. Otherwise, if both are enabled then we prefer | |
5667 | to warn using -Wswitch because -Wswitch is enabled by -Wall | |
5668 | while -Wswitch-enum is explicit. */ | |
5669 | saved_warn_switch = warn_switch; | |
5670 | if (default_node) | |
5671 | warn_switch = 0; | |
359d87c6 | 5672 | splay_tree_foreach (cases, match_case_to_enum, type); |
6cbbbc89 | 5673 | warn_switch = saved_warn_switch; |
5674 | ||
e41f0d80 | 5675 | } |
5676 | ||
9dd48740 | 5677 | /* Finish an expression taking the address of LABEL (an |
dda49785 | 5678 | IDENTIFIER_NODE). Returns an expression for the address. |
5679 | ||
5680 | LOC is the location for the expression returned. */ | |
d0a47c8d | 5681 | |
1cae46be | 5682 | tree |
dda49785 | 5683 | finish_label_address_expr (tree label, location_t loc) |
d0a47c8d | 5684 | { |
5685 | tree result; | |
5686 | ||
21ca8540 | 5687 | pedwarn (input_location, OPT_pedantic, "taking the address of a label is non-standard"); |
d0a47c8d | 5688 | |
9dd48740 | 5689 | if (label == error_mark_node) |
5690 | return error_mark_node; | |
5691 | ||
d0a47c8d | 5692 | label = lookup_label (label); |
5693 | if (label == NULL_TREE) | |
5694 | result = null_pointer_node; | |
5695 | else | |
5696 | { | |
5697 | TREE_USED (label) = 1; | |
5698 | result = build1 (ADDR_EXPR, ptr_type_node, label); | |
d0a47c8d | 5699 | /* The current function in not necessarily uninlinable. |
5700 | Computed gotos are incompatible with inlining, but the value | |
5701 | here could be used only in a diagnostic, for example. */ | |
dda49785 | 5702 | protected_set_expr_location (result, loc); |
d0a47c8d | 5703 | } |
5704 | ||
5705 | return result; | |
5706 | } | |
4f9a1c9b | 5707 | \f |
5708 | ||
5709 | /* Given a boolean expression ARG, return a tree representing an increment | |
5710 | or decrement (as indicated by CODE) of ARG. The front end must check for | |
5711 | invalid cases (e.g., decrement in C++). */ | |
5712 | tree | |
1cae46be | 5713 | boolean_increment (enum tree_code code, tree arg) |
4f9a1c9b | 5714 | { |
5715 | tree val; | |
69db191c | 5716 | tree true_res = build_int_cst (TREE_TYPE (arg), 1); |
c0f19401 | 5717 | |
4f9a1c9b | 5718 | arg = stabilize_reference (arg); |
5719 | switch (code) | |
5720 | { | |
5721 | case PREINCREMENT_EXPR: | |
14ae0310 | 5722 | val = build2 (MODIFY_EXPR, TREE_TYPE (arg), arg, true_res); |
4f9a1c9b | 5723 | break; |
5724 | case POSTINCREMENT_EXPR: | |
14ae0310 | 5725 | val = build2 (MODIFY_EXPR, TREE_TYPE (arg), arg, true_res); |
4f9a1c9b | 5726 | arg = save_expr (arg); |
14ae0310 | 5727 | val = build2 (COMPOUND_EXPR, TREE_TYPE (arg), val, arg); |
5728 | val = build2 (COMPOUND_EXPR, TREE_TYPE (arg), arg, val); | |
4f9a1c9b | 5729 | break; |
5730 | case PREDECREMENT_EXPR: | |
14ae0310 | 5731 | val = build2 (MODIFY_EXPR, TREE_TYPE (arg), arg, |
5732 | invert_truthvalue (arg)); | |
4f9a1c9b | 5733 | break; |
5734 | case POSTDECREMENT_EXPR: | |
14ae0310 | 5735 | val = build2 (MODIFY_EXPR, TREE_TYPE (arg), arg, |
5736 | invert_truthvalue (arg)); | |
4f9a1c9b | 5737 | arg = save_expr (arg); |
14ae0310 | 5738 | val = build2 (COMPOUND_EXPR, TREE_TYPE (arg), val, arg); |
5739 | val = build2 (COMPOUND_EXPR, TREE_TYPE (arg), arg, val); | |
4f9a1c9b | 5740 | break; |
5741 | default: | |
231bd014 | 5742 | gcc_unreachable (); |
4f9a1c9b | 5743 | } |
5744 | TREE_SIDE_EFFECTS (val) = 1; | |
5745 | return val; | |
5746 | } | |
76a6e674 | 5747 | \f |
f3449a3c | 5748 | /* Built-in macros for stddef.h and stdint.h, that require macros |
5749 | defined in this file. */ | |
79cf3ec1 | 5750 | void |
1cae46be | 5751 | c_stddef_cpp_builtins(void) |
1ed9d5f5 | 5752 | { |
63994318 | 5753 | builtin_define_with_value ("__SIZE_TYPE__", SIZE_TYPE, 0); |
5754 | builtin_define_with_value ("__PTRDIFF_TYPE__", PTRDIFF_TYPE, 0); | |
5755 | builtin_define_with_value ("__WCHAR_TYPE__", MODIFIED_WCHAR_TYPE, 0); | |
5756 | builtin_define_with_value ("__WINT_TYPE__", WINT_TYPE, 0); | |
36bccbfc | 5757 | builtin_define_with_value ("__INTMAX_TYPE__", INTMAX_TYPE, 0); |
5758 | builtin_define_with_value ("__UINTMAX_TYPE__", UINTMAX_TYPE, 0); | |
b0726616 | 5759 | builtin_define_with_value ("__CHAR16_TYPE__", CHAR16_TYPE, 0); |
5760 | builtin_define_with_value ("__CHAR32_TYPE__", CHAR32_TYPE, 0); | |
f3449a3c | 5761 | if (SIG_ATOMIC_TYPE) |
5762 | builtin_define_with_value ("__SIG_ATOMIC_TYPE__", SIG_ATOMIC_TYPE, 0); | |
5763 | if (INT8_TYPE) | |
5764 | builtin_define_with_value ("__INT8_TYPE__", INT8_TYPE, 0); | |
5765 | if (INT16_TYPE) | |
5766 | builtin_define_with_value ("__INT16_TYPE__", INT16_TYPE, 0); | |
5767 | if (INT32_TYPE) | |
5768 | builtin_define_with_value ("__INT32_TYPE__", INT32_TYPE, 0); | |
5769 | if (INT64_TYPE) | |
5770 | builtin_define_with_value ("__INT64_TYPE__", INT64_TYPE, 0); | |
5771 | if (UINT8_TYPE) | |
5772 | builtin_define_with_value ("__UINT8_TYPE__", UINT8_TYPE, 0); | |
5773 | if (UINT16_TYPE) | |
5774 | builtin_define_with_value ("__UINT16_TYPE__", UINT16_TYPE, 0); | |
5775 | if (UINT32_TYPE) | |
5776 | builtin_define_with_value ("__UINT32_TYPE__", UINT32_TYPE, 0); | |
5777 | if (UINT64_TYPE) | |
5778 | builtin_define_with_value ("__UINT64_TYPE__", UINT64_TYPE, 0); | |
5779 | if (INT_LEAST8_TYPE) | |
5780 | builtin_define_with_value ("__INT_LEAST8_TYPE__", INT_LEAST8_TYPE, 0); | |
5781 | if (INT_LEAST16_TYPE) | |
5782 | builtin_define_with_value ("__INT_LEAST16_TYPE__", INT_LEAST16_TYPE, 0); | |
5783 | if (INT_LEAST32_TYPE) | |
5784 | builtin_define_with_value ("__INT_LEAST32_TYPE__", INT_LEAST32_TYPE, 0); | |
5785 | if (INT_LEAST64_TYPE) | |
5786 | builtin_define_with_value ("__INT_LEAST64_TYPE__", INT_LEAST64_TYPE, 0); | |
5787 | if (UINT_LEAST8_TYPE) | |
5788 | builtin_define_with_value ("__UINT_LEAST8_TYPE__", UINT_LEAST8_TYPE, 0); | |
5789 | if (UINT_LEAST16_TYPE) | |
5790 | builtin_define_with_value ("__UINT_LEAST16_TYPE__", UINT_LEAST16_TYPE, 0); | |
5791 | if (UINT_LEAST32_TYPE) | |
5792 | builtin_define_with_value ("__UINT_LEAST32_TYPE__", UINT_LEAST32_TYPE, 0); | |
5793 | if (UINT_LEAST64_TYPE) | |
5794 | builtin_define_with_value ("__UINT_LEAST64_TYPE__", UINT_LEAST64_TYPE, 0); | |
5795 | if (INT_FAST8_TYPE) | |
5796 | builtin_define_with_value ("__INT_FAST8_TYPE__", INT_FAST8_TYPE, 0); | |
5797 | if (INT_FAST16_TYPE) | |
5798 | builtin_define_with_value ("__INT_FAST16_TYPE__", INT_FAST16_TYPE, 0); | |
5799 | if (INT_FAST32_TYPE) | |
5800 | builtin_define_with_value ("__INT_FAST32_TYPE__", INT_FAST32_TYPE, 0); | |
5801 | if (INT_FAST64_TYPE) | |
5802 | builtin_define_with_value ("__INT_FAST64_TYPE__", INT_FAST64_TYPE, 0); | |
5803 | if (UINT_FAST8_TYPE) | |
5804 | builtin_define_with_value ("__UINT_FAST8_TYPE__", UINT_FAST8_TYPE, 0); | |
5805 | if (UINT_FAST16_TYPE) | |
5806 | builtin_define_with_value ("__UINT_FAST16_TYPE__", UINT_FAST16_TYPE, 0); | |
5807 | if (UINT_FAST32_TYPE) | |
5808 | builtin_define_with_value ("__UINT_FAST32_TYPE__", UINT_FAST32_TYPE, 0); | |
5809 | if (UINT_FAST64_TYPE) | |
5810 | builtin_define_with_value ("__UINT_FAST64_TYPE__", UINT_FAST64_TYPE, 0); | |
5811 | if (INTPTR_TYPE) | |
5812 | builtin_define_with_value ("__INTPTR_TYPE__", INTPTR_TYPE, 0); | |
5813 | if (UINTPTR_TYPE) | |
5814 | builtin_define_with_value ("__UINTPTR_TYPE__", UINTPTR_TYPE, 0); | |
574006c3 | 5815 | } |
5816 | ||
7d3b509a | 5817 | static void |
1cae46be | 5818 | c_init_attributes (void) |
7d3b509a | 5819 | { |
5820 | /* Fill in the built_in_attributes array. */ | |
7c446c95 | 5821 | #define DEF_ATTR_NULL_TREE(ENUM) \ |
7d3b509a | 5822 | built_in_attributes[(int) ENUM] = NULL_TREE; |
7c446c95 | 5823 | #define DEF_ATTR_INT(ENUM, VALUE) \ |
7016c612 | 5824 | built_in_attributes[(int) ENUM] = build_int_cst (NULL_TREE, VALUE); |
7d3b509a | 5825 | #define DEF_ATTR_IDENT(ENUM, STRING) \ |
5826 | built_in_attributes[(int) ENUM] = get_identifier (STRING); | |
5827 | #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) \ | |
5828 | built_in_attributes[(int) ENUM] \ | |
5829 | = tree_cons (built_in_attributes[(int) PURPOSE], \ | |
5830 | built_in_attributes[(int) VALUE], \ | |
5831 | built_in_attributes[(int) CHAIN]); | |
7d3b509a | 5832 | #include "builtin-attrs.def" |
5833 | #undef DEF_ATTR_NULL_TREE | |
5834 | #undef DEF_ATTR_INT | |
5835 | #undef DEF_ATTR_IDENT | |
5836 | #undef DEF_ATTR_TREE_LIST | |
76a6e674 | 5837 | } |
5f3cead1 | 5838 | |
f8e93a2e | 5839 | /* Attribute handlers common to C front ends. */ |
5840 | ||
5841 | /* Handle a "packed" attribute; arguments as in | |
5842 | struct attribute_spec.handler. */ | |
5843 | ||
5844 | static tree | |
9a03a746 | 5845 | handle_packed_attribute (tree *node, tree name, tree ARG_UNUSED (args), |
09347743 | 5846 | int flags, bool *no_add_attrs) |
f8e93a2e | 5847 | { |
f40175cb | 5848 | if (TYPE_P (*node)) |
f8e93a2e | 5849 | { |
5850 | if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE)) | |
e086912e | 5851 | *node = build_variant_type_copy (*node); |
f40175cb | 5852 | TYPE_PACKED (*node) = 1; |
f8e93a2e | 5853 | } |
5854 | else if (TREE_CODE (*node) == FIELD_DECL) | |
c2ab04f9 | 5855 | { |
9fd767c5 | 5856 | if (TYPE_ALIGN (TREE_TYPE (*node)) <= BITS_PER_UNIT |
5857 | /* Still pack bitfields. */ | |
5858 | && ! DECL_INITIAL (*node)) | |
c2ab04f9 | 5859 | warning (OPT_Wattributes, |
5860 | "%qE attribute ignored for field of type %qT", | |
5861 | name, TREE_TYPE (*node)); | |
5862 | else | |
5863 | DECL_PACKED (*node) = 1; | |
5864 | } | |
f8e93a2e | 5865 | /* We can't set DECL_PACKED for a VAR_DECL, because the bit is |
f40175cb | 5866 | used for DECL_REGISTER. It wouldn't mean anything anyway. |
5867 | We can't set DECL_PACKED on the type of a TYPE_DECL, because | |
5868 | that changes what the typedef is typing. */ | |
f8e93a2e | 5869 | else |
5870 | { | |
9b2d6d13 | 5871 | warning (OPT_Wattributes, "%qE attribute ignored", name); |
f8e93a2e | 5872 | *no_add_attrs = true; |
5873 | } | |
5874 | ||
5875 | return NULL_TREE; | |
5876 | } | |
5877 | ||
5878 | /* Handle a "nocommon" attribute; arguments as in | |
5879 | struct attribute_spec.handler. */ | |
5880 | ||
5881 | static tree | |
1cae46be | 5882 | handle_nocommon_attribute (tree *node, tree name, |
9a03a746 | 5883 | tree ARG_UNUSED (args), |
5884 | int ARG_UNUSED (flags), bool *no_add_attrs) | |
f8e93a2e | 5885 | { |
5886 | if (TREE_CODE (*node) == VAR_DECL) | |
5887 | DECL_COMMON (*node) = 0; | |
5888 | else | |
5889 | { | |
9b2d6d13 | 5890 | warning (OPT_Wattributes, "%qE attribute ignored", name); |
f8e93a2e | 5891 | *no_add_attrs = true; |
5892 | } | |
5893 | ||
5894 | return NULL_TREE; | |
5895 | } | |
5896 | ||
5897 | /* Handle a "common" attribute; arguments as in | |
5898 | struct attribute_spec.handler. */ | |
5899 | ||
5900 | static tree | |
9a03a746 | 5901 | handle_common_attribute (tree *node, tree name, tree ARG_UNUSED (args), |
5902 | int ARG_UNUSED (flags), bool *no_add_attrs) | |
f8e93a2e | 5903 | { |
5904 | if (TREE_CODE (*node) == VAR_DECL) | |
5905 | DECL_COMMON (*node) = 1; | |
5906 | else | |
5907 | { | |
9b2d6d13 | 5908 | warning (OPT_Wattributes, "%qE attribute ignored", name); |
f8e93a2e | 5909 | *no_add_attrs = true; |
5910 | } | |
5911 | ||
5912 | return NULL_TREE; | |
5913 | } | |
5914 | ||
5915 | /* Handle a "noreturn" attribute; arguments as in | |
5916 | struct attribute_spec.handler. */ | |
5917 | ||
5918 | static tree | |
9a03a746 | 5919 | handle_noreturn_attribute (tree *node, tree name, tree ARG_UNUSED (args), |
5920 | int ARG_UNUSED (flags), bool *no_add_attrs) | |
f8e93a2e | 5921 | { |
5922 | tree type = TREE_TYPE (*node); | |
5923 | ||
5924 | /* See FIXME comment in c_common_attribute_table. */ | |
5925 | if (TREE_CODE (*node) == FUNCTION_DECL) | |
5926 | TREE_THIS_VOLATILE (*node) = 1; | |
5927 | else if (TREE_CODE (type) == POINTER_TYPE | |
5928 | && TREE_CODE (TREE_TYPE (type)) == FUNCTION_TYPE) | |
5929 | TREE_TYPE (*node) | |
5930 | = build_pointer_type | |
5931 | (build_type_variant (TREE_TYPE (type), | |
71bda45d | 5932 | TYPE_READONLY (TREE_TYPE (type)), 1)); |
f8e93a2e | 5933 | else |
5934 | { | |
9b2d6d13 | 5935 | warning (OPT_Wattributes, "%qE attribute ignored", name); |
f8e93a2e | 5936 | *no_add_attrs = true; |
5937 | } | |
5938 | ||
5939 | return NULL_TREE; | |
5940 | } | |
5941 | ||
5de92639 | 5942 | /* Handle a "hot" and attribute; arguments as in |
5943 | struct attribute_spec.handler. */ | |
5944 | ||
5945 | static tree | |
5946 | handle_hot_attribute (tree *node, tree name, tree ARG_UNUSED (args), | |
46f8e3b0 | 5947 | int ARG_UNUSED (flags), bool *no_add_attrs) |
5de92639 | 5948 | { |
5949 | if (TREE_CODE (*node) == FUNCTION_DECL) | |
5950 | { | |
5951 | if (lookup_attribute ("cold", DECL_ATTRIBUTES (*node)) != NULL) | |
5952 | { | |
5953 | warning (OPT_Wattributes, "%qE attribute conflicts with attribute %s", | |
5954 | name, "cold"); | |
5955 | *no_add_attrs = true; | |
5956 | } | |
24470055 | 5957 | /* Most of the rest of the hot processing is done later with |
5958 | lookup_attribute. */ | |
5de92639 | 5959 | } |
5960 | else | |
5961 | { | |
5962 | warning (OPT_Wattributes, "%qE attribute ignored", name); | |
5963 | *no_add_attrs = true; | |
5964 | } | |
5965 | ||
5966 | return NULL_TREE; | |
5967 | } | |
5968 | /* Handle a "cold" and attribute; arguments as in | |
5969 | struct attribute_spec.handler. */ | |
5970 | ||
5971 | static tree | |
5972 | handle_cold_attribute (tree *node, tree name, tree ARG_UNUSED (args), | |
5973 | int ARG_UNUSED (flags), bool *no_add_attrs) | |
5974 | { | |
5975 | if (TREE_CODE (*node) == FUNCTION_DECL) | |
5976 | { | |
5977 | if (lookup_attribute ("hot", DECL_ATTRIBUTES (*node)) != NULL) | |
5978 | { | |
5979 | warning (OPT_Wattributes, "%qE attribute conflicts with attribute %s", | |
5980 | name, "hot"); | |
5981 | *no_add_attrs = true; | |
5982 | } | |
24470055 | 5983 | /* Most of the rest of the cold processing is done later with |
5984 | lookup_attribute. */ | |
5de92639 | 5985 | } |
5986 | else | |
5987 | { | |
5988 | warning (OPT_Wattributes, "%qE attribute ignored", name); | |
5989 | *no_add_attrs = true; | |
5990 | } | |
5991 | ||
5992 | return NULL_TREE; | |
5993 | } | |
5994 | ||
f8e93a2e | 5995 | /* Handle a "noinline" attribute; arguments as in |
5996 | struct attribute_spec.handler. */ | |
5997 | ||
5998 | static tree | |
1cae46be | 5999 | handle_noinline_attribute (tree *node, tree name, |
9a03a746 | 6000 | tree ARG_UNUSED (args), |
6001 | int ARG_UNUSED (flags), bool *no_add_attrs) | |
f8e93a2e | 6002 | { |
6003 | if (TREE_CODE (*node) == FUNCTION_DECL) | |
6004 | DECL_UNINLINABLE (*node) = 1; | |
6005 | else | |
6006 | { | |
9b2d6d13 | 6007 | warning (OPT_Wattributes, "%qE attribute ignored", name); |
f8e93a2e | 6008 | *no_add_attrs = true; |
6009 | } | |
6010 | ||
6011 | return NULL_TREE; | |
6012 | } | |
6013 | ||
6014 | /* Handle a "always_inline" attribute; arguments as in | |
6015 | struct attribute_spec.handler. */ | |
6016 | ||
6017 | static tree | |
1cae46be | 6018 | handle_always_inline_attribute (tree *node, tree name, |
9a03a746 | 6019 | tree ARG_UNUSED (args), |
6020 | int ARG_UNUSED (flags), | |
09347743 | 6021 | bool *no_add_attrs) |
f8e93a2e | 6022 | { |
6023 | if (TREE_CODE (*node) == FUNCTION_DECL) | |
6024 | { | |
ebb7d626 | 6025 | /* Set the attribute and mark it for disregarding inline |
6026 | limits. */ | |
6027 | DECL_DISREGARD_INLINE_LIMITS (*node) = 1; | |
f8e93a2e | 6028 | } |
6029 | else | |
6030 | { | |
9b2d6d13 | 6031 | warning (OPT_Wattributes, "%qE attribute ignored", name); |
f8e93a2e | 6032 | *no_add_attrs = true; |
541e4101 | 6033 | } |
6034 | ||
6035 | return NULL_TREE; | |
6036 | } | |
6037 | ||
6038 | /* Handle a "gnu_inline" attribute; arguments as in | |
6039 | struct attribute_spec.handler. */ | |
6040 | ||
6041 | static tree | |
6042 | handle_gnu_inline_attribute (tree *node, tree name, | |
6043 | tree ARG_UNUSED (args), | |
6044 | int ARG_UNUSED (flags), | |
6045 | bool *no_add_attrs) | |
6046 | { | |
6047 | if (TREE_CODE (*node) == FUNCTION_DECL && DECL_DECLARED_INLINE_P (*node)) | |
6048 | { | |
6049 | /* Do nothing else, just set the attribute. We'll get at | |
6050 | it later with lookup_attribute. */ | |
6051 | } | |
6052 | else | |
6053 | { | |
6054 | warning (OPT_Wattributes, "%qE attribute ignored", name); | |
6055 | *no_add_attrs = true; | |
f8e93a2e | 6056 | } |
6057 | ||
6058 | return NULL_TREE; | |
6059 | } | |
6060 | ||
1b16fc45 | 6061 | /* Handle an "artificial" attribute; arguments as in |
6062 | struct attribute_spec.handler. */ | |
6063 | ||
6064 | static tree | |
6065 | handle_artificial_attribute (tree *node, tree name, | |
6066 | tree ARG_UNUSED (args), | |
6067 | int ARG_UNUSED (flags), | |
6068 | bool *no_add_attrs) | |
6069 | { | |
6070 | if (TREE_CODE (*node) == FUNCTION_DECL && DECL_DECLARED_INLINE_P (*node)) | |
6071 | { | |
6072 | /* Do nothing else, just set the attribute. We'll get at | |
6073 | it later with lookup_attribute. */ | |
6074 | } | |
6075 | else | |
6076 | { | |
6077 | warning (OPT_Wattributes, "%qE attribute ignored", name); | |
6078 | *no_add_attrs = true; | |
6079 | } | |
6080 | ||
6081 | return NULL_TREE; | |
6082 | } | |
6083 | ||
0cdd9887 | 6084 | /* Handle a "flatten" attribute; arguments as in |
6085 | struct attribute_spec.handler. */ | |
6086 | ||
6087 | static tree | |
6088 | handle_flatten_attribute (tree *node, tree name, | |
a0c938f0 | 6089 | tree args ATTRIBUTE_UNUSED, |
6090 | int flags ATTRIBUTE_UNUSED, bool *no_add_attrs) | |
0cdd9887 | 6091 | { |
6092 | if (TREE_CODE (*node) == FUNCTION_DECL) | |
6093 | /* Do nothing else, just set the attribute. We'll get at | |
6094 | it later with lookup_attribute. */ | |
6095 | ; | |
6096 | else | |
6097 | { | |
6098 | warning (OPT_Wattributes, "%qE attribute ignored", name); | |
6099 | *no_add_attrs = true; | |
6100 | } | |
6101 | ||
6102 | return NULL_TREE; | |
6103 | } | |
6104 | ||
10fc867f | 6105 | /* Handle a "warning" or "error" attribute; arguments as in |
6106 | struct attribute_spec.handler. */ | |
6107 | ||
6108 | static tree | |
6109 | handle_error_attribute (tree *node, tree name, tree args, | |
6110 | int ARG_UNUSED (flags), bool *no_add_attrs) | |
6111 | { | |
6112 | if (TREE_CODE (*node) == FUNCTION_DECL | |
6113 | || TREE_CODE (TREE_VALUE (args)) == STRING_CST) | |
6114 | /* Do nothing else, just set the attribute. We'll get at | |
6115 | it later with lookup_attribute. */ | |
6116 | ; | |
6117 | else | |
6118 | { | |
6119 | warning (OPT_Wattributes, "%qE attribute ignored", name); | |
6120 | *no_add_attrs = true; | |
6121 | } | |
6122 | ||
6123 | return NULL_TREE; | |
6124 | } | |
0cdd9887 | 6125 | |
f8e93a2e | 6126 | /* Handle a "used" attribute; arguments as in |
6127 | struct attribute_spec.handler. */ | |
6128 | ||
6129 | static tree | |
9a03a746 | 6130 | handle_used_attribute (tree *pnode, tree name, tree ARG_UNUSED (args), |
6131 | int ARG_UNUSED (flags), bool *no_add_attrs) | |
f8e93a2e | 6132 | { |
d0a31bd8 | 6133 | tree node = *pnode; |
6134 | ||
6135 | if (TREE_CODE (node) == FUNCTION_DECL | |
6136 | || (TREE_CODE (node) == VAR_DECL && TREE_STATIC (node))) | |
f54ed8bc | 6137 | { |
f54ed8bc | 6138 | TREE_USED (node) = 1; |
9423c9b7 | 6139 | DECL_PRESERVE_P (node) = 1; |
f54ed8bc | 6140 | } |
f8e93a2e | 6141 | else |
6142 | { | |
9b2d6d13 | 6143 | warning (OPT_Wattributes, "%qE attribute ignored", name); |
f8e93a2e | 6144 | *no_add_attrs = true; |
6145 | } | |
6146 | ||
6147 | return NULL_TREE; | |
6148 | } | |
6149 | ||
6150 | /* Handle a "unused" attribute; arguments as in | |
6151 | struct attribute_spec.handler. */ | |
6152 | ||
6153 | static tree | |
9a03a746 | 6154 | handle_unused_attribute (tree *node, tree name, tree ARG_UNUSED (args), |
6155 | int flags, bool *no_add_attrs) | |
f8e93a2e | 6156 | { |
6157 | if (DECL_P (*node)) | |
6158 | { | |
6159 | tree decl = *node; | |
6160 | ||
6161 | if (TREE_CODE (decl) == PARM_DECL | |
6162 | || TREE_CODE (decl) == VAR_DECL | |
6163 | || TREE_CODE (decl) == FUNCTION_DECL | |
6164 | || TREE_CODE (decl) == LABEL_DECL | |
6165 | || TREE_CODE (decl) == TYPE_DECL) | |
6166 | TREE_USED (decl) = 1; | |
6167 | else | |
6168 | { | |
9b2d6d13 | 6169 | warning (OPT_Wattributes, "%qE attribute ignored", name); |
f8e93a2e | 6170 | *no_add_attrs = true; |
6171 | } | |
6172 | } | |
6173 | else | |
6174 | { | |
6175 | if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE)) | |
e086912e | 6176 | *node = build_variant_type_copy (*node); |
f8e93a2e | 6177 | TREE_USED (*node) = 1; |
6178 | } | |
6179 | ||
6180 | return NULL_TREE; | |
6181 | } | |
6182 | ||
62eec3b4 | 6183 | /* Handle a "externally_visible" attribute; arguments as in |
6184 | struct attribute_spec.handler. */ | |
6185 | ||
6186 | static tree | |
6187 | handle_externally_visible_attribute (tree *pnode, tree name, | |
6188 | tree ARG_UNUSED (args), | |
6189 | int ARG_UNUSED (flags), | |
6190 | bool *no_add_attrs) | |
6191 | { | |
6192 | tree node = *pnode; | |
6193 | ||
ba12ea31 | 6194 | if (TREE_CODE (node) == FUNCTION_DECL || TREE_CODE (node) == VAR_DECL) |
62eec3b4 | 6195 | { |
ba12ea31 | 6196 | if ((!TREE_STATIC (node) && TREE_CODE (node) != FUNCTION_DECL |
6197 | && !DECL_EXTERNAL (node)) || !TREE_PUBLIC (node)) | |
6198 | { | |
6199 | warning (OPT_Wattributes, | |
6200 | "%qE attribute have effect only on public objects", name); | |
6201 | *no_add_attrs = true; | |
6202 | } | |
62eec3b4 | 6203 | } |
62eec3b4 | 6204 | else |
6205 | { | |
6206 | warning (OPT_Wattributes, "%qE attribute ignored", name); | |
6207 | *no_add_attrs = true; | |
6208 | } | |
6209 | ||
6210 | return NULL_TREE; | |
6211 | } | |
6212 | ||
f8e93a2e | 6213 | /* Handle a "const" attribute; arguments as in |
6214 | struct attribute_spec.handler. */ | |
6215 | ||
6216 | static tree | |
9a03a746 | 6217 | handle_const_attribute (tree *node, tree name, tree ARG_UNUSED (args), |
6218 | int ARG_UNUSED (flags), bool *no_add_attrs) | |
f8e93a2e | 6219 | { |
6220 | tree type = TREE_TYPE (*node); | |
6221 | ||
6222 | /* See FIXME comment on noreturn in c_common_attribute_table. */ | |
6223 | if (TREE_CODE (*node) == FUNCTION_DECL) | |
6224 | TREE_READONLY (*node) = 1; | |
6225 | else if (TREE_CODE (type) == POINTER_TYPE | |
6226 | && TREE_CODE (TREE_TYPE (type)) == FUNCTION_TYPE) | |
6227 | TREE_TYPE (*node) | |
6228 | = build_pointer_type | |
6229 | (build_type_variant (TREE_TYPE (type), 1, | |
6230 | TREE_THIS_VOLATILE (TREE_TYPE (type)))); | |
6231 | else | |
6232 | { | |
9b2d6d13 | 6233 | warning (OPT_Wattributes, "%qE attribute ignored", name); |
f8e93a2e | 6234 | *no_add_attrs = true; |
6235 | } | |
6236 | ||
6237 | return NULL_TREE; | |
6238 | } | |
6239 | ||
6240 | /* Handle a "transparent_union" attribute; arguments as in | |
6241 | struct attribute_spec.handler. */ | |
6242 | ||
6243 | static tree | |
1cae46be | 6244 | handle_transparent_union_attribute (tree *node, tree name, |
9a03a746 | 6245 | tree ARG_UNUSED (args), int flags, |
09347743 | 6246 | bool *no_add_attrs) |
f8e93a2e | 6247 | { |
881eb642 | 6248 | tree type; |
03908818 | 6249 | |
6250 | *no_add_attrs = true; | |
f8e93a2e | 6251 | |
881eb642 | 6252 | if (TREE_CODE (*node) == TYPE_DECL) |
6253 | node = &TREE_TYPE (*node); | |
6254 | type = *node; | |
f8e93a2e | 6255 | |
03908818 | 6256 | if (TREE_CODE (type) == UNION_TYPE) |
f8e93a2e | 6257 | { |
03908818 | 6258 | /* When IN_PLACE is set, leave the check for FIELDS and MODE to |
6259 | the code in finish_struct. */ | |
f8e93a2e | 6260 | if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE)) |
03908818 | 6261 | { |
6262 | if (TYPE_FIELDS (type) == NULL_TREE | |
6263 | || TYPE_MODE (type) != DECL_MODE (TYPE_FIELDS (type))) | |
6264 | goto ignored; | |
6265 | ||
6266 | /* A type variant isn't good enough, since we don't a cast | |
6267 | to such a type removed as a no-op. */ | |
6268 | *node = type = build_duplicate_type (type); | |
6269 | } | |
6270 | ||
6271 | TYPE_TRANSPARENT_UNION (type) = 1; | |
6272 | return NULL_TREE; | |
f8e93a2e | 6273 | } |
6274 | ||
03908818 | 6275 | ignored: |
6276 | warning (OPT_Wattributes, "%qE attribute ignored", name); | |
f8e93a2e | 6277 | return NULL_TREE; |
6278 | } | |
6279 | ||
9af7fd5b | 6280 | /* Subroutine of handle_{con,de}structor_attribute. Evaluate ARGS to |
6281 | get the requested priority for a constructor or destructor, | |
6282 | possibly issuing diagnostics for invalid or reserved | |
6283 | priorities. */ | |
6284 | ||
6285 | static priority_type | |
6286 | get_priority (tree args, bool is_destructor) | |
6287 | { | |
6288 | HOST_WIDE_INT pri; | |
6c181a06 | 6289 | tree arg; |
9af7fd5b | 6290 | |
6291 | if (!args) | |
6292 | return DEFAULT_INIT_PRIORITY; | |
6c181a06 | 6293 | |
28fbc04f | 6294 | if (!SUPPORTS_INIT_PRIORITY) |
6295 | { | |
6296 | if (is_destructor) | |
6297 | error ("destructor priorities are not supported"); | |
6298 | else | |
6299 | error ("constructor priorities are not supported"); | |
6300 | return DEFAULT_INIT_PRIORITY; | |
6301 | } | |
6302 | ||
6c181a06 | 6303 | arg = TREE_VALUE (args); |
6304 | if (!host_integerp (arg, /*pos=*/0) | |
6305 | || !INTEGRAL_TYPE_P (TREE_TYPE (arg))) | |
9af7fd5b | 6306 | goto invalid; |
6307 | ||
6308 | pri = tree_low_cst (TREE_VALUE (args), /*pos=*/0); | |
6309 | if (pri < 0 || pri > MAX_INIT_PRIORITY) | |
6310 | goto invalid; | |
6311 | ||
6312 | if (pri <= MAX_RESERVED_INIT_PRIORITY) | |
6313 | { | |
6314 | if (is_destructor) | |
6315 | warning (0, | |
6316 | "destructor priorities from 0 to %d are reserved " | |
6317 | "for the implementation", | |
6318 | MAX_RESERVED_INIT_PRIORITY); | |
6319 | else | |
6320 | warning (0, | |
6321 | "constructor priorities from 0 to %d are reserved " | |
6322 | "for the implementation", | |
6323 | MAX_RESERVED_INIT_PRIORITY); | |
6324 | } | |
6325 | return pri; | |
6326 | ||
6327 | invalid: | |
6328 | if (is_destructor) | |
6329 | error ("destructor priorities must be integers from 0 to %d inclusive", | |
6330 | MAX_INIT_PRIORITY); | |
6331 | else | |
6332 | error ("constructor priorities must be integers from 0 to %d inclusive", | |
6333 | MAX_INIT_PRIORITY); | |
6334 | return DEFAULT_INIT_PRIORITY; | |
6335 | } | |
6336 | ||
f8e93a2e | 6337 | /* Handle a "constructor" attribute; arguments as in |
6338 | struct attribute_spec.handler. */ | |
6339 | ||
6340 | static tree | |
9af7fd5b | 6341 | handle_constructor_attribute (tree *node, tree name, tree args, |
9a03a746 | 6342 | int ARG_UNUSED (flags), |
09347743 | 6343 | bool *no_add_attrs) |
f8e93a2e | 6344 | { |
6345 | tree decl = *node; | |
6346 | tree type = TREE_TYPE (decl); | |
6347 | ||
6348 | if (TREE_CODE (decl) == FUNCTION_DECL | |
6349 | && TREE_CODE (type) == FUNCTION_TYPE | |
6350 | && decl_function_context (decl) == 0) | |
6351 | { | |
9af7fd5b | 6352 | priority_type priority; |
f8e93a2e | 6353 | DECL_STATIC_CONSTRUCTOR (decl) = 1; |
9af7fd5b | 6354 | priority = get_priority (args, /*is_destructor=*/false); |
6355 | SET_DECL_INIT_PRIORITY (decl, priority); | |
f8e93a2e | 6356 | TREE_USED (decl) = 1; |
6357 | } | |
6358 | else | |
6359 | { | |
9b2d6d13 | 6360 | warning (OPT_Wattributes, "%qE attribute ignored", name); |
f8e93a2e | 6361 | *no_add_attrs = true; |
6362 | } | |
6363 | ||
6364 | return NULL_TREE; | |
6365 | } | |
6366 | ||
6367 | /* Handle a "destructor" attribute; arguments as in | |
6368 | struct attribute_spec.handler. */ | |
6369 | ||
6370 | static tree | |
9af7fd5b | 6371 | handle_destructor_attribute (tree *node, tree name, tree args, |
9a03a746 | 6372 | int ARG_UNUSED (flags), |
09347743 | 6373 | bool *no_add_attrs) |
f8e93a2e | 6374 | { |
6375 | tree decl = *node; | |
6376 | tree type = TREE_TYPE (decl); | |
6377 | ||
6378 | if (TREE_CODE (decl) == FUNCTION_DECL | |
6379 | && TREE_CODE (type) == FUNCTION_TYPE | |
6380 | && decl_function_context (decl) == 0) | |
6381 | { | |
9af7fd5b | 6382 | priority_type priority; |
f8e93a2e | 6383 | DECL_STATIC_DESTRUCTOR (decl) = 1; |
9af7fd5b | 6384 | priority = get_priority (args, /*is_destructor=*/true); |
6385 | SET_DECL_FINI_PRIORITY (decl, priority); | |
f8e93a2e | 6386 | TREE_USED (decl) = 1; |
6387 | } | |
6388 | else | |
6389 | { | |
9b2d6d13 | 6390 | warning (OPT_Wattributes, "%qE attribute ignored", name); |
f8e93a2e | 6391 | *no_add_attrs = true; |
6392 | } | |
6393 | ||
6394 | return NULL_TREE; | |
6395 | } | |
6396 | ||
6397 | /* Handle a "mode" attribute; arguments as in | |
6398 | struct attribute_spec.handler. */ | |
6399 | ||
6400 | static tree | |
9a03a746 | 6401 | handle_mode_attribute (tree *node, tree name, tree args, |
6402 | int ARG_UNUSED (flags), bool *no_add_attrs) | |
f8e93a2e | 6403 | { |
6404 | tree type = *node; | |
6405 | ||
6406 | *no_add_attrs = true; | |
6407 | ||
6408 | if (TREE_CODE (TREE_VALUE (args)) != IDENTIFIER_NODE) | |
9b2d6d13 | 6409 | warning (OPT_Wattributes, "%qE attribute ignored", name); |
f8e93a2e | 6410 | else |
6411 | { | |
6412 | int j; | |
6413 | const char *p = IDENTIFIER_POINTER (TREE_VALUE (args)); | |
6414 | int len = strlen (p); | |
6415 | enum machine_mode mode = VOIDmode; | |
6416 | tree typefm; | |
b2aef146 | 6417 | bool valid_mode; |
f8e93a2e | 6418 | |
6419 | if (len > 4 && p[0] == '_' && p[1] == '_' | |
6420 | && p[len - 1] == '_' && p[len - 2] == '_') | |
6421 | { | |
4fd61bc6 | 6422 | char *newp = (char *) alloca (len - 1); |
f8e93a2e | 6423 | |
6424 | strcpy (newp, &p[2]); | |
6425 | newp[len - 4] = '\0'; | |
6426 | p = newp; | |
6427 | } | |
6428 | ||
6429 | /* Change this type to have a type with the specified mode. | |
6430 | First check for the special modes. */ | |
84166705 | 6431 | if (!strcmp (p, "byte")) |
f8e93a2e | 6432 | mode = byte_mode; |
6433 | else if (!strcmp (p, "word")) | |
6434 | mode = word_mode; | |
84166705 | 6435 | else if (!strcmp (p, "pointer")) |
f8e93a2e | 6436 | mode = ptr_mode; |
0ef89dfd | 6437 | else if (!strcmp (p, "libgcc_cmp_return")) |
6438 | mode = targetm.libgcc_cmp_return_mode (); | |
6439 | else if (!strcmp (p, "libgcc_shift_count")) | |
6440 | mode = targetm.libgcc_shift_count_mode (); | |
1bd43494 | 6441 | else if (!strcmp (p, "unwind_word")) |
6442 | mode = targetm.unwind_word_mode (); | |
f8e93a2e | 6443 | else |
6444 | for (j = 0; j < NUM_MACHINE_MODES; j++) | |
6445 | if (!strcmp (p, GET_MODE_NAME (j))) | |
743a6f47 | 6446 | { |
6447 | mode = (enum machine_mode) j; | |
6448 | break; | |
6449 | } | |
f8e93a2e | 6450 | |
6451 | if (mode == VOIDmode) | |
4917c376 | 6452 | { |
1e5fcbe2 | 6453 | error ("unknown machine mode %qs", p); |
4917c376 | 6454 | return NULL_TREE; |
6455 | } | |
6456 | ||
b2aef146 | 6457 | valid_mode = false; |
6458 | switch (GET_MODE_CLASS (mode)) | |
4917c376 | 6459 | { |
b2aef146 | 6460 | case MODE_INT: |
6461 | case MODE_PARTIAL_INT: | |
6462 | case MODE_FLOAT: | |
c4503c0a | 6463 | case MODE_DECIMAL_FLOAT: |
9421ebb9 | 6464 | case MODE_FRACT: |
6465 | case MODE_UFRACT: | |
6466 | case MODE_ACCUM: | |
6467 | case MODE_UACCUM: | |
b2aef146 | 6468 | valid_mode = targetm.scalar_mode_supported_p (mode); |
6469 | break; | |
6470 | ||
6471 | case MODE_COMPLEX_INT: | |
6472 | case MODE_COMPLEX_FLOAT: | |
6473 | valid_mode = targetm.scalar_mode_supported_p (GET_MODE_INNER (mode)); | |
6474 | break; | |
6475 | ||
6476 | case MODE_VECTOR_INT: | |
6477 | case MODE_VECTOR_FLOAT: | |
9421ebb9 | 6478 | case MODE_VECTOR_FRACT: |
6479 | case MODE_VECTOR_UFRACT: | |
6480 | case MODE_VECTOR_ACCUM: | |
6481 | case MODE_VECTOR_UACCUM: | |
9b2d6d13 | 6482 | warning (OPT_Wattributes, "specifying vector types with " |
6483 | "__attribute__ ((mode)) is deprecated"); | |
6484 | warning (OPT_Wattributes, | |
6485 | "use __attribute__ ((vector_size)) instead"); | |
b2aef146 | 6486 | valid_mode = vector_mode_valid_p (mode); |
6487 | break; | |
4917c376 | 6488 | |
b2aef146 | 6489 | default: |
6490 | break; | |
6491 | } | |
6492 | if (!valid_mode) | |
6493 | { | |
1e5fcbe2 | 6494 | error ("unable to emulate %qs", p); |
b2aef146 | 6495 | return NULL_TREE; |
6496 | } | |
4917c376 | 6497 | |
b2aef146 | 6498 | if (POINTER_TYPE_P (type)) |
ead34f59 | 6499 | { |
b2aef146 | 6500 | tree (*fn)(tree, enum machine_mode, bool); |
6501 | ||
6502 | if (!targetm.valid_pointer_mode (mode)) | |
ead34f59 | 6503 | { |
1e5fcbe2 | 6504 | error ("invalid pointer mode %qs", p); |
ead34f59 | 6505 | return NULL_TREE; |
6506 | } | |
6507 | ||
a0c938f0 | 6508 | if (TREE_CODE (type) == POINTER_TYPE) |
b2aef146 | 6509 | fn = build_pointer_type_for_mode; |
805e22b2 | 6510 | else |
b2aef146 | 6511 | fn = build_reference_type_for_mode; |
6512 | typefm = fn (TREE_TYPE (type), mode, false); | |
ead34f59 | 6513 | } |
b2aef146 | 6514 | else |
9421ebb9 | 6515 | { |
6516 | /* For fixed-point modes, we need to test if the signness of type | |
6517 | and the machine mode are consistent. */ | |
6518 | if (ALL_FIXED_POINT_MODE_P (mode) | |
6519 | && TYPE_UNSIGNED (type) != UNSIGNED_FIXED_POINT_MODE_P (mode)) | |
6520 | { | |
6521 | error ("signness of type and machine mode %qs don't match", p); | |
6522 | return NULL_TREE; | |
6523 | } | |
6524 | /* For fixed-point modes, we need to pass saturating info. */ | |
6525 | typefm = lang_hooks.types.type_for_mode (mode, | |
6526 | ALL_FIXED_POINT_MODE_P (mode) ? TYPE_SATURATING (type) | |
6527 | : TYPE_UNSIGNED (type)); | |
6528 | } | |
3a648ab9 | 6529 | |
b2aef146 | 6530 | if (typefm == NULL_TREE) |
6531 | { | |
743a6f47 | 6532 | error ("no data type for mode %qs", p); |
b2aef146 | 6533 | return NULL_TREE; |
6534 | } | |
3a648ab9 | 6535 | else if (TREE_CODE (type) == ENUMERAL_TYPE) |
6536 | { | |
6537 | /* For enumeral types, copy the precision from the integer | |
6538 | type returned above. If not an INTEGER_TYPE, we can't use | |
6539 | this mode for this type. */ | |
6540 | if (TREE_CODE (typefm) != INTEGER_TYPE) | |
6541 | { | |
743a6f47 | 6542 | error ("cannot use mode %qs for enumeral types", p); |
3a648ab9 | 6543 | return NULL_TREE; |
6544 | } | |
6545 | ||
10080eac | 6546 | if (flags & ATTR_FLAG_TYPE_IN_PLACE) |
6547 | { | |
6548 | TYPE_PRECISION (type) = TYPE_PRECISION (typefm); | |
6549 | typefm = type; | |
6550 | } | |
6551 | else | |
6552 | { | |
6553 | /* We cannot build a type variant, as there's code that assumes | |
6554 | that TYPE_MAIN_VARIANT has the same mode. This includes the | |
6555 | debug generators. Instead, create a subrange type. This | |
6556 | results in all of the enumeral values being emitted only once | |
6557 | in the original, and the subtype gets them by reference. */ | |
6558 | if (TYPE_UNSIGNED (type)) | |
6559 | typefm = make_unsigned_type (TYPE_PRECISION (typefm)); | |
6560 | else | |
6561 | typefm = make_signed_type (TYPE_PRECISION (typefm)); | |
6562 | TREE_TYPE (typefm) = type; | |
6563 | } | |
3a648ab9 | 6564 | } |
4bf450a1 | 6565 | else if (VECTOR_MODE_P (mode) |
6566 | ? TREE_CODE (type) != TREE_CODE (TREE_TYPE (typefm)) | |
6567 | : TREE_CODE (type) != TREE_CODE (typefm)) | |
743a6f47 | 6568 | { |
6569 | error ("mode %qs applied to inappropriate type", p); | |
6570 | return NULL_TREE; | |
6571 | } | |
6572 | ||
b2aef146 | 6573 | *node = typefm; |
f8e93a2e | 6574 | } |
6575 | ||
6576 | return NULL_TREE; | |
6577 | } | |
6578 | ||
6579 | /* Handle a "section" attribute; arguments as in | |
6580 | struct attribute_spec.handler. */ | |
6581 | ||
6582 | static tree | |
9a03a746 | 6583 | handle_section_attribute (tree *node, tree ARG_UNUSED (name), tree args, |
6584 | int ARG_UNUSED (flags), bool *no_add_attrs) | |
f8e93a2e | 6585 | { |
6586 | tree decl = *node; | |
6587 | ||
6588 | if (targetm.have_named_sections) | |
6589 | { | |
065efcb1 | 6590 | user_defined_section_attribute = true; |
6591 | ||
f8e93a2e | 6592 | if ((TREE_CODE (decl) == FUNCTION_DECL |
6593 | || TREE_CODE (decl) == VAR_DECL) | |
6594 | && TREE_CODE (TREE_VALUE (args)) == STRING_CST) | |
6595 | { | |
6596 | if (TREE_CODE (decl) == VAR_DECL | |
6597 | && current_function_decl != NULL_TREE | |
84166705 | 6598 | && !TREE_STATIC (decl)) |
f8e93a2e | 6599 | { |
9bc3739f | 6600 | error ("%Jsection attribute cannot be specified for " |
4ee9c684 | 6601 | "local variables", decl); |
f8e93a2e | 6602 | *no_add_attrs = true; |
6603 | } | |
6604 | ||
6605 | /* The decl may have already been given a section attribute | |
6606 | from a previous declaration. Ensure they match. */ | |
6607 | else if (DECL_SECTION_NAME (decl) != NULL_TREE | |
6608 | && strcmp (TREE_STRING_POINTER (DECL_SECTION_NAME (decl)), | |
6609 | TREE_STRING_POINTER (TREE_VALUE (args))) != 0) | |
6610 | { | |
3cf8b391 | 6611 | error ("section of %q+D conflicts with previous declaration", |
6612 | *node); | |
f8e93a2e | 6613 | *no_add_attrs = true; |
6614 | } | |
38475469 | 6615 | else if (TREE_CODE (decl) == VAR_DECL |
6616 | && !targetm.have_tls && targetm.emutls.tmpl_section | |
6617 | && DECL_THREAD_LOCAL_P (decl)) | |
6618 | { | |
6619 | error ("section of %q+D cannot be overridden", *node); | |
6620 | *no_add_attrs = true; | |
6621 | } | |
f8e93a2e | 6622 | else |
6623 | DECL_SECTION_NAME (decl) = TREE_VALUE (args); | |
6624 | } | |
6625 | else | |
6626 | { | |
3cf8b391 | 6627 | error ("section attribute not allowed for %q+D", *node); |
f8e93a2e | 6628 | *no_add_attrs = true; |
6629 | } | |
6630 | } | |
6631 | else | |
6632 | { | |
9bc3739f | 6633 | error ("%Jsection attributes are not supported for this target", *node); |
f8e93a2e | 6634 | *no_add_attrs = true; |
6635 | } | |
6636 | ||
6637 | return NULL_TREE; | |
6638 | } | |
6639 | ||
6640 | /* Handle a "aligned" attribute; arguments as in | |
6641 | struct attribute_spec.handler. */ | |
6642 | ||
6643 | static tree | |
9a03a746 | 6644 | handle_aligned_attribute (tree *node, tree ARG_UNUSED (name), tree args, |
09347743 | 6645 | int flags, bool *no_add_attrs) |
f8e93a2e | 6646 | { |
6647 | tree decl = NULL_TREE; | |
6648 | tree *type = NULL; | |
6649 | int is_type = 0; | |
6650 | tree align_expr = (args ? TREE_VALUE (args) | |
02421213 | 6651 | : size_int (ATTRIBUTE_ALIGNED_VALUE / BITS_PER_UNIT)); |
f8e93a2e | 6652 | int i; |
6653 | ||
6654 | if (DECL_P (*node)) | |
6655 | { | |
6656 | decl = *node; | |
6657 | type = &TREE_TYPE (decl); | |
6658 | is_type = TREE_CODE (*node) == TYPE_DECL; | |
6659 | } | |
6660 | else if (TYPE_P (*node)) | |
6661 | type = node, is_type = 1; | |
6662 | ||
f8e93a2e | 6663 | if (TREE_CODE (align_expr) != INTEGER_CST) |
6664 | { | |
6665 | error ("requested alignment is not a constant"); | |
6666 | *no_add_attrs = true; | |
6667 | } | |
6668 | else if ((i = tree_log2 (align_expr)) == -1) | |
6669 | { | |
6670 | error ("requested alignment is not a power of 2"); | |
6671 | *no_add_attrs = true; | |
6672 | } | |
7cfdc2f0 | 6673 | else if (i >= HOST_BITS_PER_INT - BITS_PER_UNIT_LOG) |
f8e93a2e | 6674 | { |
6675 | error ("requested alignment is too large"); | |
6676 | *no_add_attrs = true; | |
6677 | } | |
6678 | else if (is_type) | |
6679 | { | |
6680 | /* If we have a TYPE_DECL, then copy the type, so that we | |
6681 | don't accidentally modify a builtin type. See pushdecl. */ | |
6682 | if (decl && TREE_TYPE (decl) != error_mark_node | |
6683 | && DECL_ORIGINAL_TYPE (decl) == NULL_TREE) | |
6684 | { | |
6685 | tree tt = TREE_TYPE (decl); | |
e086912e | 6686 | *type = build_variant_type_copy (*type); |
f8e93a2e | 6687 | DECL_ORIGINAL_TYPE (decl) = tt; |
6688 | TYPE_NAME (*type) = decl; | |
6689 | TREE_USED (*type) = TREE_USED (decl); | |
6690 | TREE_TYPE (decl) = *type; | |
6691 | } | |
6692 | else if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE)) | |
e086912e | 6693 | *type = build_variant_type_copy (*type); |
f8e93a2e | 6694 | |
7cfdc2f0 | 6695 | TYPE_ALIGN (*type) = (1U << i) * BITS_PER_UNIT; |
f8e93a2e | 6696 | TYPE_USER_ALIGN (*type) = 1; |
6697 | } | |
097b5c8b | 6698 | else if (! VAR_OR_FUNCTION_DECL_P (decl) |
f8e93a2e | 6699 | && TREE_CODE (decl) != FIELD_DECL) |
6700 | { | |
3cf8b391 | 6701 | error ("alignment may not be specified for %q+D", decl); |
f8e93a2e | 6702 | *no_add_attrs = true; |
6703 | } | |
097b5c8b | 6704 | else if (TREE_CODE (decl) == FUNCTION_DECL |
7cfdc2f0 | 6705 | && DECL_ALIGN (decl) > (1U << i) * BITS_PER_UNIT) |
097b5c8b | 6706 | { |
6707 | if (DECL_USER_ALIGN (decl)) | |
6708 | error ("alignment for %q+D was previously specified as %d " | |
6709 | "and may not be decreased", decl, | |
6710 | DECL_ALIGN (decl) / BITS_PER_UNIT); | |
6711 | else | |
6712 | error ("alignment for %q+D must be at least %d", decl, | |
6713 | DECL_ALIGN (decl) / BITS_PER_UNIT); | |
6714 | *no_add_attrs = true; | |
6715 | } | |
f8e93a2e | 6716 | else |
6717 | { | |
7cfdc2f0 | 6718 | DECL_ALIGN (decl) = (1U << i) * BITS_PER_UNIT; |
f8e93a2e | 6719 | DECL_USER_ALIGN (decl) = 1; |
6720 | } | |
6721 | ||
6722 | return NULL_TREE; | |
6723 | } | |
6724 | ||
6725 | /* Handle a "weak" attribute; arguments as in | |
6726 | struct attribute_spec.handler. */ | |
6727 | ||
6728 | static tree | |
f948b309 | 6729 | handle_weak_attribute (tree *node, tree name, |
9a03a746 | 6730 | tree ARG_UNUSED (args), |
6731 | int ARG_UNUSED (flags), | |
6732 | bool * ARG_UNUSED (no_add_attrs)) | |
f8e93a2e | 6733 | { |
f948b309 | 6734 | if (TREE_CODE (*node) == FUNCTION_DECL |
059a60f3 | 6735 | && DECL_DECLARED_INLINE_P (*node)) |
6736 | { | |
6737 | error ("inline function %q+D cannot be declared weak", *node); | |
6738 | *no_add_attrs = true; | |
6739 | } | |
6740 | else if (TREE_CODE (*node) == FUNCTION_DECL | |
6741 | || TREE_CODE (*node) == VAR_DECL) | |
f948b309 | 6742 | declare_weak (*node); |
6743 | else | |
6744 | warning (OPT_Wattributes, "%qE attribute ignored", name); | |
f8e93a2e | 6745 | |
6746 | return NULL_TREE; | |
6747 | } | |
6748 | ||
6749 | /* Handle an "alias" attribute; arguments as in | |
6750 | struct attribute_spec.handler. */ | |
6751 | ||
6752 | static tree | |
1cae46be | 6753 | handle_alias_attribute (tree *node, tree name, tree args, |
9a03a746 | 6754 | int ARG_UNUSED (flags), bool *no_add_attrs) |
f8e93a2e | 6755 | { |
6756 | tree decl = *node; | |
6757 | ||
9e830260 | 6758 | if (TREE_CODE (decl) != FUNCTION_DECL && TREE_CODE (decl) != VAR_DECL) |
6759 | { | |
6760 | warning (OPT_Wattributes, "%qE attribute ignored", name); | |
6761 | *no_add_attrs = true; | |
6762 | } | |
6763 | else if ((TREE_CODE (decl) == FUNCTION_DECL && DECL_INITIAL (decl)) | |
0a3ecdc1 | 6764 | || (TREE_CODE (decl) != FUNCTION_DECL |
6765 | && TREE_PUBLIC (decl) && !DECL_EXTERNAL (decl)) | |
6766 | /* A static variable declaration is always a tentative definition, | |
6767 | but the alias is a non-tentative definition which overrides. */ | |
6768 | || (TREE_CODE (decl) != FUNCTION_DECL | |
6769 | && ! TREE_PUBLIC (decl) && DECL_INITIAL (decl))) | |
f8e93a2e | 6770 | { |
3cf8b391 | 6771 | error ("%q+D defined both normally and as an alias", decl); |
f8e93a2e | 6772 | *no_add_attrs = true; |
6773 | } | |
8c42f0d9 | 6774 | |
6775 | /* Note that the very first time we process a nested declaration, | |
6776 | decl_function_context will not be set. Indeed, *would* never | |
6777 | be set except for the DECL_INITIAL/DECL_EXTERNAL frobbery that | |
6778 | we do below. After such frobbery, pushdecl would set the context. | |
6779 | In any case, this is never what we want. */ | |
6780 | else if (decl_function_context (decl) == 0 && current_function_decl == NULL) | |
f8e93a2e | 6781 | { |
6782 | tree id; | |
6783 | ||
6784 | id = TREE_VALUE (args); | |
6785 | if (TREE_CODE (id) != STRING_CST) | |
6786 | { | |
07e3a3d2 | 6787 | error ("alias argument not a string"); |
f8e93a2e | 6788 | *no_add_attrs = true; |
6789 | return NULL_TREE; | |
6790 | } | |
6791 | id = get_identifier (TREE_STRING_POINTER (id)); | |
6792 | /* This counts as a use of the object pointed to. */ | |
6793 | TREE_USED (id) = 1; | |
6794 | ||
6795 | if (TREE_CODE (decl) == FUNCTION_DECL) | |
6796 | DECL_INITIAL (decl) = error_mark_node; | |
6797 | else | |
4ee9c684 | 6798 | { |
f4a30bd7 | 6799 | if (lookup_attribute ("weakref", DECL_ATTRIBUTES (decl))) |
6800 | DECL_EXTERNAL (decl) = 1; | |
6801 | else | |
6802 | DECL_EXTERNAL (decl) = 0; | |
4ee9c684 | 6803 | TREE_STATIC (decl) = 1; |
6804 | } | |
f8e93a2e | 6805 | } |
6806 | else | |
6807 | { | |
9b2d6d13 | 6808 | warning (OPT_Wattributes, "%qE attribute ignored", name); |
f8e93a2e | 6809 | *no_add_attrs = true; |
6810 | } | |
6811 | ||
6812 | return NULL_TREE; | |
6813 | } | |
6814 | ||
f4a30bd7 | 6815 | /* Handle a "weakref" attribute; arguments as in struct |
6816 | attribute_spec.handler. */ | |
6817 | ||
6818 | static tree | |
6819 | handle_weakref_attribute (tree *node, tree ARG_UNUSED (name), tree args, | |
6820 | int flags, bool *no_add_attrs) | |
6821 | { | |
6822 | tree attr = NULL_TREE; | |
6823 | ||
83852912 | 6824 | /* We must ignore the attribute when it is associated with |
6825 | local-scoped decls, since attribute alias is ignored and many | |
6826 | such symbols do not even have a DECL_WEAK field. */ | |
64a7bd81 | 6827 | if (decl_function_context (*node) |
6828 | || current_function_decl | |
6829 | || (TREE_CODE (*node) != VAR_DECL && TREE_CODE (*node) != FUNCTION_DECL)) | |
83852912 | 6830 | { |
6831 | warning (OPT_Wattributes, "%qE attribute ignored", name); | |
6832 | *no_add_attrs = true; | |
6833 | return NULL_TREE; | |
6834 | } | |
6835 | ||
f4a30bd7 | 6836 | /* The idea here is that `weakref("name")' mutates into `weakref, |
6837 | alias("name")', and weakref without arguments, in turn, | |
6838 | implicitly adds weak. */ | |
6839 | ||
6840 | if (args) | |
6841 | { | |
6842 | attr = tree_cons (get_identifier ("alias"), args, attr); | |
6843 | attr = tree_cons (get_identifier ("weakref"), NULL_TREE, attr); | |
6844 | ||
6845 | *no_add_attrs = true; | |
0a3ecdc1 | 6846 | |
6847 | decl_attributes (node, attr, flags); | |
f4a30bd7 | 6848 | } |
6849 | else | |
6850 | { | |
6851 | if (lookup_attribute ("alias", DECL_ATTRIBUTES (*node))) | |
6852 | error ("%Jweakref attribute must appear before alias attribute", | |
6853 | *node); | |
6854 | ||
0a3ecdc1 | 6855 | /* Can't call declare_weak because it wants this to be TREE_PUBLIC, |
6856 | and that isn't supported; and because it wants to add it to | |
6857 | the list of weak decls, which isn't helpful. */ | |
6858 | DECL_WEAK (*node) = 1; | |
f4a30bd7 | 6859 | } |
6860 | ||
f4a30bd7 | 6861 | return NULL_TREE; |
6862 | } | |
6863 | ||
f8e93a2e | 6864 | /* Handle an "visibility" attribute; arguments as in |
6865 | struct attribute_spec.handler. */ | |
6866 | ||
6867 | static tree | |
1cae46be | 6868 | handle_visibility_attribute (tree *node, tree name, tree args, |
9a03a746 | 6869 | int ARG_UNUSED (flags), |
4a2849cb | 6870 | bool *ARG_UNUSED (no_add_attrs)) |
f8e93a2e | 6871 | { |
6872 | tree decl = *node; | |
9c40570a | 6873 | tree id = TREE_VALUE (args); |
4a2849cb | 6874 | enum symbol_visibility vis; |
f8e93a2e | 6875 | |
b212f378 | 6876 | if (TYPE_P (*node)) |
6877 | { | |
4a2849cb | 6878 | if (TREE_CODE (*node) == ENUMERAL_TYPE) |
6879 | /* OK */; | |
6880 | else if (TREE_CODE (*node) != RECORD_TYPE && TREE_CODE (*node) != UNION_TYPE) | |
6881 | { | |
6882 | warning (OPT_Wattributes, "%qE attribute ignored on non-class types", | |
6883 | name); | |
6884 | return NULL_TREE; | |
6885 | } | |
6886 | else if (TYPE_FIELDS (*node)) | |
6887 | { | |
6888 | error ("%qE attribute ignored because %qT is already defined", | |
6889 | name, *node); | |
6890 | return NULL_TREE; | |
6891 | } | |
b212f378 | 6892 | } |
84166705 | 6893 | else if (decl_function_context (decl) != 0 || !TREE_PUBLIC (decl)) |
f8e93a2e | 6894 | { |
9b2d6d13 | 6895 | warning (OPT_Wattributes, "%qE attribute ignored", name); |
9c40570a | 6896 | return NULL_TREE; |
f8e93a2e | 6897 | } |
f8e93a2e | 6898 | |
9c40570a | 6899 | if (TREE_CODE (id) != STRING_CST) |
6900 | { | |
07e3a3d2 | 6901 | error ("visibility argument not a string"); |
9c40570a | 6902 | return NULL_TREE; |
f8e93a2e | 6903 | } |
b27ac6b5 | 6904 | |
b212f378 | 6905 | /* If this is a type, set the visibility on the type decl. */ |
6906 | if (TYPE_P (decl)) | |
6907 | { | |
6908 | decl = TYPE_NAME (decl); | |
84166705 | 6909 | if (!decl) |
a0c938f0 | 6910 | return NULL_TREE; |
e147aab3 | 6911 | if (TREE_CODE (decl) == IDENTIFIER_NODE) |
6912 | { | |
9b2d6d13 | 6913 | warning (OPT_Wattributes, "%qE attribute ignored on types", |
e147aab3 | 6914 | name); |
6915 | return NULL_TREE; | |
6916 | } | |
b212f378 | 6917 | } |
f8e93a2e | 6918 | |
9c40570a | 6919 | if (strcmp (TREE_STRING_POINTER (id), "default") == 0) |
4a2849cb | 6920 | vis = VISIBILITY_DEFAULT; |
9c40570a | 6921 | else if (strcmp (TREE_STRING_POINTER (id), "internal") == 0) |
4a2849cb | 6922 | vis = VISIBILITY_INTERNAL; |
9c40570a | 6923 | else if (strcmp (TREE_STRING_POINTER (id), "hidden") == 0) |
4a2849cb | 6924 | vis = VISIBILITY_HIDDEN; |
9c40570a | 6925 | else if (strcmp (TREE_STRING_POINTER (id), "protected") == 0) |
4a2849cb | 6926 | vis = VISIBILITY_PROTECTED; |
9c40570a | 6927 | else |
4a2849cb | 6928 | { |
6929 | error ("visibility argument must be one of \"default\", \"hidden\", \"protected\" or \"internal\""); | |
6930 | vis = VISIBILITY_DEFAULT; | |
6931 | } | |
6932 | ||
6933 | if (DECL_VISIBILITY_SPECIFIED (decl) | |
098a01e7 | 6934 | && vis != DECL_VISIBILITY (decl)) |
6935 | { | |
6936 | tree attributes = (TYPE_P (*node) | |
6937 | ? TYPE_ATTRIBUTES (*node) | |
6938 | : DECL_ATTRIBUTES (decl)); | |
6939 | if (lookup_attribute ("visibility", attributes)) | |
6940 | error ("%qD redeclared with different visibility", decl); | |
6941 | else if (TARGET_DLLIMPORT_DECL_ATTRIBUTES | |
6942 | && lookup_attribute ("dllimport", attributes)) | |
6943 | error ("%qD was declared %qs which implies default visibility", | |
6944 | decl, "dllimport"); | |
6945 | else if (TARGET_DLLIMPORT_DECL_ATTRIBUTES | |
6946 | && lookup_attribute ("dllexport", attributes)) | |
6947 | error ("%qD was declared %qs which implies default visibility", | |
6948 | decl, "dllexport"); | |
6949 | } | |
4a2849cb | 6950 | |
6951 | DECL_VISIBILITY (decl) = vis; | |
b212f378 | 6952 | DECL_VISIBILITY_SPECIFIED (decl) = 1; |
6953 | ||
4a2849cb | 6954 | /* Go ahead and attach the attribute to the node as well. This is needed |
6955 | so we can determine whether we have VISIBILITY_DEFAULT because the | |
6956 | visibility was not specified, or because it was explicitly overridden | |
6957 | from the containing scope. */ | |
9c40570a | 6958 | |
f8e93a2e | 6959 | return NULL_TREE; |
6960 | } | |
6961 | ||
3aa0c315 | 6962 | /* Determine the ELF symbol visibility for DECL, which is either a |
6963 | variable or a function. It is an error to use this function if a | |
6964 | definition of DECL is not available in this translation unit. | |
6965 | Returns true if the final visibility has been determined by this | |
6966 | function; false if the caller is free to make additional | |
6967 | modifications. */ | |
6968 | ||
6969 | bool | |
6970 | c_determine_visibility (tree decl) | |
6971 | { | |
1d8fc210 | 6972 | gcc_assert (TREE_CODE (decl) == VAR_DECL |
6973 | || TREE_CODE (decl) == FUNCTION_DECL); | |
3aa0c315 | 6974 | |
6975 | /* If the user explicitly specified the visibility with an | |
6976 | attribute, honor that. DECL_VISIBILITY will have been set during | |
6977 | the processing of the attribute. We check for an explicit | |
6978 | attribute, rather than just checking DECL_VISIBILITY_SPECIFIED, | |
6979 | to distinguish the use of an attribute from the use of a "#pragma | |
6980 | GCC visibility push(...)"; in the latter case we still want other | |
6981 | considerations to be able to overrule the #pragma. */ | |
098a01e7 | 6982 | if (lookup_attribute ("visibility", DECL_ATTRIBUTES (decl)) |
6983 | || (TARGET_DLLIMPORT_DECL_ATTRIBUTES | |
6984 | && (lookup_attribute ("dllimport", DECL_ATTRIBUTES (decl)) | |
6985 | || lookup_attribute ("dllexport", DECL_ATTRIBUTES (decl))))) | |
3aa0c315 | 6986 | return true; |
6987 | ||
4a2849cb | 6988 | /* Set default visibility to whatever the user supplied with |
6989 | visibility_specified depending on #pragma GCC visibility. */ | |
6990 | if (!DECL_VISIBILITY_SPECIFIED (decl)) | |
6991 | { | |
2d9d8740 | 6992 | if (visibility_options.inpragma |
6993 | || DECL_VISIBILITY (decl) != default_visibility) | |
6994 | { | |
6995 | DECL_VISIBILITY (decl) = default_visibility; | |
6996 | DECL_VISIBILITY_SPECIFIED (decl) = visibility_options.inpragma; | |
6997 | /* If visibility changed and DECL already has DECL_RTL, ensure | |
6998 | symbol flags are updated. */ | |
6999 | if (((TREE_CODE (decl) == VAR_DECL && TREE_STATIC (decl)) | |
7000 | || TREE_CODE (decl) == FUNCTION_DECL) | |
7001 | && DECL_RTL_SET_P (decl)) | |
7002 | make_decl_rtl (decl); | |
7003 | } | |
4a2849cb | 7004 | } |
3aa0c315 | 7005 | return false; |
7006 | } | |
7007 | ||
24dfead4 | 7008 | /* Handle an "tls_model" attribute; arguments as in |
7009 | struct attribute_spec.handler. */ | |
7010 | ||
7011 | static tree | |
1cae46be | 7012 | handle_tls_model_attribute (tree *node, tree name, tree args, |
9a03a746 | 7013 | int ARG_UNUSED (flags), bool *no_add_attrs) |
24dfead4 | 7014 | { |
1b53eb20 | 7015 | tree id; |
24dfead4 | 7016 | tree decl = *node; |
1b53eb20 | 7017 | enum tls_model kind; |
24dfead4 | 7018 | |
1b53eb20 | 7019 | *no_add_attrs = true; |
7020 | ||
c34f8a78 | 7021 | if (TREE_CODE (decl) != VAR_DECL || !DECL_THREAD_LOCAL_P (decl)) |
24dfead4 | 7022 | { |
9b2d6d13 | 7023 | warning (OPT_Wattributes, "%qE attribute ignored", name); |
1b53eb20 | 7024 | return NULL_TREE; |
24dfead4 | 7025 | } |
24dfead4 | 7026 | |
1b53eb20 | 7027 | kind = DECL_TLS_MODEL (decl); |
7028 | id = TREE_VALUE (args); | |
7029 | if (TREE_CODE (id) != STRING_CST) | |
7030 | { | |
7031 | error ("tls_model argument not a string"); | |
7032 | return NULL_TREE; | |
24dfead4 | 7033 | } |
7034 | ||
1b53eb20 | 7035 | if (!strcmp (TREE_STRING_POINTER (id), "local-exec")) |
7036 | kind = TLS_MODEL_LOCAL_EXEC; | |
7037 | else if (!strcmp (TREE_STRING_POINTER (id), "initial-exec")) | |
7038 | kind = TLS_MODEL_INITIAL_EXEC; | |
7039 | else if (!strcmp (TREE_STRING_POINTER (id), "local-dynamic")) | |
7040 | kind = optimize ? TLS_MODEL_LOCAL_DYNAMIC : TLS_MODEL_GLOBAL_DYNAMIC; | |
7041 | else if (!strcmp (TREE_STRING_POINTER (id), "global-dynamic")) | |
7042 | kind = TLS_MODEL_GLOBAL_DYNAMIC; | |
7043 | else | |
7044 | error ("tls_model argument must be one of \"local-exec\", \"initial-exec\", \"local-dynamic\" or \"global-dynamic\""); | |
7045 | ||
7046 | DECL_TLS_MODEL (decl) = kind; | |
24dfead4 | 7047 | return NULL_TREE; |
7048 | } | |
7049 | ||
f8e93a2e | 7050 | /* Handle a "no_instrument_function" attribute; arguments as in |
7051 | struct attribute_spec.handler. */ | |
7052 | ||
7053 | static tree | |
1cae46be | 7054 | handle_no_instrument_function_attribute (tree *node, tree name, |
9a03a746 | 7055 | tree ARG_UNUSED (args), |
7056 | int ARG_UNUSED (flags), | |
09347743 | 7057 | bool *no_add_attrs) |
f8e93a2e | 7058 | { |
7059 | tree decl = *node; | |
7060 | ||
7061 | if (TREE_CODE (decl) != FUNCTION_DECL) | |
7062 | { | |
b0b1af64 | 7063 | error ("%J%qE attribute applies only to functions", decl, name); |
f8e93a2e | 7064 | *no_add_attrs = true; |
7065 | } | |
7066 | else if (DECL_INITIAL (decl)) | |
7067 | { | |
b0b1af64 | 7068 | error ("%Jcan%'t set %qE attribute after definition", decl, name); |
f8e93a2e | 7069 | *no_add_attrs = true; |
7070 | } | |
7071 | else | |
7072 | DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (decl) = 1; | |
7073 | ||
7074 | return NULL_TREE; | |
7075 | } | |
7076 | ||
7077 | /* Handle a "malloc" attribute; arguments as in | |
7078 | struct attribute_spec.handler. */ | |
7079 | ||
7080 | static tree | |
9a03a746 | 7081 | handle_malloc_attribute (tree *node, tree name, tree ARG_UNUSED (args), |
7082 | int ARG_UNUSED (flags), bool *no_add_attrs) | |
f8e93a2e | 7083 | { |
a5147fca | 7084 | if (TREE_CODE (*node) == FUNCTION_DECL |
7085 | && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (*node)))) | |
f8e93a2e | 7086 | DECL_IS_MALLOC (*node) = 1; |
f8e93a2e | 7087 | else |
7088 | { | |
9b2d6d13 | 7089 | warning (OPT_Wattributes, "%qE attribute ignored", name); |
f8e93a2e | 7090 | *no_add_attrs = true; |
7091 | } | |
7092 | ||
7093 | return NULL_TREE; | |
7094 | } | |
7095 | ||
4a29c97c | 7096 | /* Handle a "alloc_size" attribute; arguments as in |
7097 | struct attribute_spec.handler. */ | |
7098 | ||
7099 | static tree | |
7100 | handle_alloc_size_attribute (tree *node, tree ARG_UNUSED (name), tree args, | |
7101 | int ARG_UNUSED (flags), bool *no_add_attrs) | |
7102 | { | |
2802826e | 7103 | unsigned arg_count = type_num_arguments (*node); |
4a29c97c | 7104 | for (; args; args = TREE_CHAIN (args)) |
7105 | { | |
7106 | tree position = TREE_VALUE (args); | |
7107 | ||
7108 | if (TREE_CODE (position) != INTEGER_CST | |
7109 | || TREE_INT_CST_HIGH (position) | |
7110 | || TREE_INT_CST_LOW (position) < 1 | |
7111 | || TREE_INT_CST_LOW (position) > arg_count ) | |
7112 | { | |
7113 | warning (OPT_Wattributes, | |
7114 | "alloc_size parameter outside range"); | |
7115 | *no_add_attrs = true; | |
7116 | return NULL_TREE; | |
7117 | } | |
7118 | } | |
7119 | return NULL_TREE; | |
7120 | } | |
7121 | ||
26d1c5ff | 7122 | /* Handle a "returns_twice" attribute; arguments as in |
7123 | struct attribute_spec.handler. */ | |
7124 | ||
7125 | static tree | |
7126 | handle_returns_twice_attribute (tree *node, tree name, tree ARG_UNUSED (args), | |
7127 | int ARG_UNUSED (flags), bool *no_add_attrs) | |
7128 | { | |
7129 | if (TREE_CODE (*node) == FUNCTION_DECL) | |
7130 | DECL_IS_RETURNS_TWICE (*node) = 1; | |
7131 | else | |
7132 | { | |
9b2d6d13 | 7133 | warning (OPT_Wattributes, "%qE attribute ignored", name); |
26d1c5ff | 7134 | *no_add_attrs = true; |
7135 | } | |
7136 | ||
7137 | return NULL_TREE; | |
7138 | } | |
7139 | ||
f8e93a2e | 7140 | /* Handle a "no_limit_stack" attribute; arguments as in |
7141 | struct attribute_spec.handler. */ | |
7142 | ||
7143 | static tree | |
1cae46be | 7144 | handle_no_limit_stack_attribute (tree *node, tree name, |
9a03a746 | 7145 | tree ARG_UNUSED (args), |
7146 | int ARG_UNUSED (flags), | |
09347743 | 7147 | bool *no_add_attrs) |
f8e93a2e | 7148 | { |
7149 | tree decl = *node; | |
7150 | ||
7151 | if (TREE_CODE (decl) != FUNCTION_DECL) | |
7152 | { | |
b0b1af64 | 7153 | error ("%J%qE attribute applies only to functions", decl, name); |
f8e93a2e | 7154 | *no_add_attrs = true; |
7155 | } | |
7156 | else if (DECL_INITIAL (decl)) | |
7157 | { | |
b0b1af64 | 7158 | error ("%Jcan%'t set %qE attribute after definition", decl, name); |
f8e93a2e | 7159 | *no_add_attrs = true; |
7160 | } | |
7161 | else | |
7162 | DECL_NO_LIMIT_STACK (decl) = 1; | |
7163 | ||
7164 | return NULL_TREE; | |
7165 | } | |
7166 | ||
7167 | /* Handle a "pure" attribute; arguments as in | |
7168 | struct attribute_spec.handler. */ | |
7169 | ||
7170 | static tree | |
9a03a746 | 7171 | handle_pure_attribute (tree *node, tree name, tree ARG_UNUSED (args), |
7172 | int ARG_UNUSED (flags), bool *no_add_attrs) | |
f8e93a2e | 7173 | { |
7174 | if (TREE_CODE (*node) == FUNCTION_DECL) | |
9c2a0c05 | 7175 | DECL_PURE_P (*node) = 1; |
f8e93a2e | 7176 | /* ??? TODO: Support types. */ |
7177 | else | |
7178 | { | |
9b2d6d13 | 7179 | warning (OPT_Wattributes, "%qE attribute ignored", name); |
f8e93a2e | 7180 | *no_add_attrs = true; |
7181 | } | |
7182 | ||
7183 | return NULL_TREE; | |
7184 | } | |
7185 | ||
fc09b200 | 7186 | /* Handle a "no vops" attribute; arguments as in |
7187 | struct attribute_spec.handler. */ | |
7188 | ||
7189 | static tree | |
7190 | handle_novops_attribute (tree *node, tree ARG_UNUSED (name), | |
7191 | tree ARG_UNUSED (args), int ARG_UNUSED (flags), | |
7192 | bool *ARG_UNUSED (no_add_attrs)) | |
7193 | { | |
7194 | gcc_assert (TREE_CODE (*node) == FUNCTION_DECL); | |
7195 | DECL_IS_NOVOPS (*node) = 1; | |
7196 | return NULL_TREE; | |
7197 | } | |
7198 | ||
f8e93a2e | 7199 | /* Handle a "deprecated" attribute; arguments as in |
7200 | struct attribute_spec.handler. */ | |
1cae46be | 7201 | |
f8e93a2e | 7202 | static tree |
1cae46be | 7203 | handle_deprecated_attribute (tree *node, tree name, |
9a03a746 | 7204 | tree ARG_UNUSED (args), int flags, |
09347743 | 7205 | bool *no_add_attrs) |
f8e93a2e | 7206 | { |
7207 | tree type = NULL_TREE; | |
7208 | int warn = 0; | |
782858b8 | 7209 | tree what = NULL_TREE; |
1cae46be | 7210 | |
f8e93a2e | 7211 | if (DECL_P (*node)) |
7212 | { | |
7213 | tree decl = *node; | |
7214 | type = TREE_TYPE (decl); | |
1cae46be | 7215 | |
f8e93a2e | 7216 | if (TREE_CODE (decl) == TYPE_DECL |
7217 | || TREE_CODE (decl) == PARM_DECL | |
7218 | || TREE_CODE (decl) == VAR_DECL | |
7219 | || TREE_CODE (decl) == FUNCTION_DECL | |
7220 | || TREE_CODE (decl) == FIELD_DECL) | |
7221 | TREE_DEPRECATED (decl) = 1; | |
7222 | else | |
7223 | warn = 1; | |
7224 | } | |
7225 | else if (TYPE_P (*node)) | |
7226 | { | |
7227 | if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE)) | |
e086912e | 7228 | *node = build_variant_type_copy (*node); |
f8e93a2e | 7229 | TREE_DEPRECATED (*node) = 1; |
7230 | type = *node; | |
7231 | } | |
7232 | else | |
7233 | warn = 1; | |
1cae46be | 7234 | |
f8e93a2e | 7235 | if (warn) |
7236 | { | |
7237 | *no_add_attrs = true; | |
7238 | if (type && TYPE_NAME (type)) | |
7239 | { | |
7240 | if (TREE_CODE (TYPE_NAME (type)) == IDENTIFIER_NODE) | |
782858b8 | 7241 | what = TYPE_NAME (*node); |
f8e93a2e | 7242 | else if (TREE_CODE (TYPE_NAME (type)) == TYPE_DECL |
7243 | && DECL_NAME (TYPE_NAME (type))) | |
782858b8 | 7244 | what = DECL_NAME (TYPE_NAME (type)); |
f8e93a2e | 7245 | } |
7246 | if (what) | |
9b2d6d13 | 7247 | warning (OPT_Wattributes, "%qE attribute ignored for %qE", name, what); |
f8e93a2e | 7248 | else |
9b2d6d13 | 7249 | warning (OPT_Wattributes, "%qE attribute ignored", name); |
f8e93a2e | 7250 | } |
7251 | ||
7252 | return NULL_TREE; | |
7253 | } | |
7254 | ||
f8e93a2e | 7255 | /* Handle a "vector_size" attribute; arguments as in |
7256 | struct attribute_spec.handler. */ | |
7257 | ||
7258 | static tree | |
1cae46be | 7259 | handle_vector_size_attribute (tree *node, tree name, tree args, |
9a03a746 | 7260 | int ARG_UNUSED (flags), |
09347743 | 7261 | bool *no_add_attrs) |
f8e93a2e | 7262 | { |
7263 | unsigned HOST_WIDE_INT vecsize, nunits; | |
83e2a11b | 7264 | enum machine_mode orig_mode; |
4917c376 | 7265 | tree type = *node, new_type, size; |
f8e93a2e | 7266 | |
7267 | *no_add_attrs = true; | |
7268 | ||
4917c376 | 7269 | size = TREE_VALUE (args); |
4917c376 | 7270 | |
84166705 | 7271 | if (!host_integerp (size, 1)) |
f8e93a2e | 7272 | { |
9b2d6d13 | 7273 | warning (OPT_Wattributes, "%qE attribute ignored", name); |
f8e93a2e | 7274 | return NULL_TREE; |
7275 | } | |
7276 | ||
7277 | /* Get the vector size (in bytes). */ | |
4917c376 | 7278 | vecsize = tree_low_cst (size, 1); |
f8e93a2e | 7279 | |
7280 | /* We need to provide for vector pointers, vector arrays, and | |
7281 | functions returning vectors. For example: | |
7282 | ||
7283 | __attribute__((vector_size(16))) short *foo; | |
7284 | ||
7285 | In this case, the mode is SI, but the type being modified is | |
7286 | HI, so we need to look further. */ | |
7287 | ||
7288 | while (POINTER_TYPE_P (type) | |
7289 | || TREE_CODE (type) == FUNCTION_TYPE | |
5bfb0742 | 7290 | || TREE_CODE (type) == METHOD_TYPE |
2cb0e5d9 | 7291 | || TREE_CODE (type) == ARRAY_TYPE |
7292 | || TREE_CODE (type) == OFFSET_TYPE) | |
f8e93a2e | 7293 | type = TREE_TYPE (type); |
7294 | ||
7295 | /* Get the mode of the type being modified. */ | |
7296 | orig_mode = TYPE_MODE (type); | |
7297 | ||
2cb0e5d9 | 7298 | if ((!INTEGRAL_TYPE_P (type) |
7299 | && !SCALAR_FLOAT_TYPE_P (type) | |
7300 | && !FIXED_POINT_TYPE_P (type)) | |
cee7491d | 7301 | || (!SCALAR_FLOAT_MODE_P (orig_mode) |
9421ebb9 | 7302 | && GET_MODE_CLASS (orig_mode) != MODE_INT |
7303 | && !ALL_SCALAR_FIXED_POINT_MODE_P (orig_mode)) | |
7ec31215 | 7304 | || !host_integerp (TYPE_SIZE_UNIT (type), 1) |
7305 | || TREE_CODE (type) == BOOLEAN_TYPE) | |
f8e93a2e | 7306 | { |
782858b8 | 7307 | error ("invalid vector type for attribute %qE", name); |
f8e93a2e | 7308 | return NULL_TREE; |
7309 | } | |
7310 | ||
39cc3e6d | 7311 | if (vecsize % tree_low_cst (TYPE_SIZE_UNIT (type), 1)) |
7312 | { | |
7313 | error ("vector size not an integral multiple of component size"); | |
7314 | return NULL; | |
7315 | } | |
7316 | ||
7317 | if (vecsize == 0) | |
7318 | { | |
7319 | error ("zero vector size"); | |
7320 | return NULL; | |
7321 | } | |
7322 | ||
f8e93a2e | 7323 | /* Calculate how many units fit in the vector. */ |
7324 | nunits = vecsize / tree_low_cst (TYPE_SIZE_UNIT (type), 1); | |
83e2a11b | 7325 | if (nunits & (nunits - 1)) |
f8e93a2e | 7326 | { |
83e2a11b | 7327 | error ("number of components of the vector not a power of two"); |
f8e93a2e | 7328 | return NULL_TREE; |
7329 | } | |
7330 | ||
83e2a11b | 7331 | new_type = build_vector_type (type, nunits); |
f8e93a2e | 7332 | |
7333 | /* Build back pointers if needed. */ | |
d991e6e8 | 7334 | *node = lang_hooks.types.reconstruct_complex_type (*node, new_type); |
f8e93a2e | 7335 | |
7336 | return NULL_TREE; | |
7337 | } | |
7338 | ||
dbf6c367 | 7339 | /* Handle the "nonnull" attribute. */ |
7340 | static tree | |
9a03a746 | 7341 | handle_nonnull_attribute (tree *node, tree ARG_UNUSED (name), |
7342 | tree args, int ARG_UNUSED (flags), | |
09347743 | 7343 | bool *no_add_attrs) |
dbf6c367 | 7344 | { |
7345 | tree type = *node; | |
7346 | unsigned HOST_WIDE_INT attr_arg_num; | |
7347 | ||
7348 | /* If no arguments are specified, all pointer arguments should be | |
d716ce75 | 7349 | non-null. Verify a full prototype is given so that the arguments |
dbf6c367 | 7350 | will have the correct types when we actually check them later. */ |
84166705 | 7351 | if (!args) |
dbf6c367 | 7352 | { |
84166705 | 7353 | if (!TYPE_ARG_TYPES (type)) |
dbf6c367 | 7354 | { |
7355 | error ("nonnull attribute without arguments on a non-prototype"); | |
4ee9c684 | 7356 | *no_add_attrs = true; |
dbf6c367 | 7357 | } |
7358 | return NULL_TREE; | |
7359 | } | |
7360 | ||
7361 | /* Argument list specified. Verify that each argument number references | |
7362 | a pointer argument. */ | |
7363 | for (attr_arg_num = 1; args; args = TREE_CHAIN (args)) | |
7364 | { | |
7365 | tree argument; | |
4ee9c684 | 7366 | unsigned HOST_WIDE_INT arg_num = 0, ck_num; |
dbf6c367 | 7367 | |
84166705 | 7368 | if (!get_nonnull_operand (TREE_VALUE (args), &arg_num)) |
dbf6c367 | 7369 | { |
07e3a3d2 | 7370 | error ("nonnull argument has invalid operand number (argument %lu)", |
dbf6c367 | 7371 | (unsigned long) attr_arg_num); |
7372 | *no_add_attrs = true; | |
7373 | return NULL_TREE; | |
7374 | } | |
7375 | ||
7376 | argument = TYPE_ARG_TYPES (type); | |
7377 | if (argument) | |
7378 | { | |
7379 | for (ck_num = 1; ; ck_num++) | |
7380 | { | |
84166705 | 7381 | if (!argument || ck_num == arg_num) |
dbf6c367 | 7382 | break; |
7383 | argument = TREE_CHAIN (argument); | |
7384 | } | |
7385 | ||
84166705 | 7386 | if (!argument |
dbf6c367 | 7387 | || TREE_CODE (TREE_VALUE (argument)) == VOID_TYPE) |
7388 | { | |
07e3a3d2 | 7389 | error ("nonnull argument with out-of-range operand number (argument %lu, operand %lu)", |
dbf6c367 | 7390 | (unsigned long) attr_arg_num, (unsigned long) arg_num); |
7391 | *no_add_attrs = true; | |
7392 | return NULL_TREE; | |
7393 | } | |
7394 | ||
4ee9c684 | 7395 | if (TREE_CODE (TREE_VALUE (argument)) != POINTER_TYPE) |
dbf6c367 | 7396 | { |
07e3a3d2 | 7397 | error ("nonnull argument references non-pointer operand (argument %lu, operand %lu)", |
dbf6c367 | 7398 | (unsigned long) attr_arg_num, (unsigned long) arg_num); |
7399 | *no_add_attrs = true; | |
7400 | return NULL_TREE; | |
7401 | } | |
7402 | } | |
7403 | } | |
7404 | ||
7405 | return NULL_TREE; | |
7406 | } | |
7407 | ||
7408 | /* Check the argument list of a function call for null in argument slots | |
d01f58f9 | 7409 | that are marked as requiring a non-null pointer argument. The NARGS |
7410 | arguments are passed in the array ARGARRAY. | |
7411 | */ | |
dbf6c367 | 7412 | |
7413 | static void | |
d01f58f9 | 7414 | check_function_nonnull (tree attrs, int nargs, tree *argarray) |
dbf6c367 | 7415 | { |
d01f58f9 | 7416 | tree a, args; |
7417 | int i; | |
dbf6c367 | 7418 | |
7419 | for (a = attrs; a; a = TREE_CHAIN (a)) | |
7420 | { | |
7421 | if (is_attribute_p ("nonnull", TREE_PURPOSE (a))) | |
7422 | { | |
4ee9c684 | 7423 | args = TREE_VALUE (a); |
dbf6c367 | 7424 | |
4ee9c684 | 7425 | /* Walk the argument list. If we encounter an argument number we |
7426 | should check for non-null, do it. If the attribute has no args, | |
7427 | then every pointer argument is checked (in which case the check | |
dbf6c367 | 7428 | for pointer type is done in check_nonnull_arg). */ |
d01f58f9 | 7429 | for (i = 0; i < nargs; i++) |
4ee9c684 | 7430 | { |
d01f58f9 | 7431 | if (!args || nonnull_check_p (args, i + 1)) |
e4603171 | 7432 | check_function_arguments_recurse (check_nonnull_arg, NULL, |
d01f58f9 | 7433 | argarray[i], |
7434 | i + 1); | |
4ee9c684 | 7435 | } |
dbf6c367 | 7436 | } |
7437 | } | |
7438 | } | |
7439 | ||
50ca527f | 7440 | /* Check that the Nth argument of a function call (counting backwards |
d01f58f9 | 7441 | from the end) is a (pointer)0. The NARGS arguments are passed in the |
7442 | array ARGARRAY. */ | |
bf6c8de0 | 7443 | |
7444 | static void | |
d01f58f9 | 7445 | check_function_sentinel (tree attrs, int nargs, tree *argarray, tree typelist) |
bf6c8de0 | 7446 | { |
7447 | tree attr = lookup_attribute ("sentinel", attrs); | |
7448 | ||
7449 | if (attr) | |
7450 | { | |
d01f58f9 | 7451 | int len = 0; |
7452 | int pos = 0; | |
7453 | tree sentinel; | |
a0c938f0 | 7454 | |
d01f58f9 | 7455 | /* Skip over the named arguments. */ |
7456 | while (typelist && len < nargs) | |
a0c938f0 | 7457 | { |
d01f58f9 | 7458 | typelist = TREE_CHAIN (typelist); |
7459 | len++; | |
7460 | } | |
50ca527f | 7461 | |
d01f58f9 | 7462 | if (TREE_VALUE (attr)) |
7463 | { | |
7464 | tree p = TREE_VALUE (TREE_VALUE (attr)); | |
7465 | pos = TREE_INT_CST_LOW (p); | |
7466 | } | |
50ca527f | 7467 | |
d01f58f9 | 7468 | /* The sentinel must be one of the varargs, i.e. |
7469 | in position >= the number of fixed arguments. */ | |
7470 | if ((nargs - 1 - pos) < len) | |
7471 | { | |
7472 | warning (OPT_Wformat, | |
7473 | "not enough variable arguments to fit a sentinel"); | |
7474 | return; | |
bf6c8de0 | 7475 | } |
d01f58f9 | 7476 | |
7477 | /* Validate the sentinel. */ | |
7478 | sentinel = argarray[nargs - 1 - pos]; | |
7479 | if ((!POINTER_TYPE_P (TREE_TYPE (sentinel)) | |
7480 | || !integer_zerop (sentinel)) | |
7481 | /* Although __null (in C++) is only an integer we allow it | |
7482 | nevertheless, as we are guaranteed that it's exactly | |
7483 | as wide as a pointer, and we don't want to force | |
7484 | users to cast the NULL they have written there. | |
7485 | We warn with -Wstrict-null-sentinel, though. */ | |
7486 | && (warn_strict_null_sentinel || null_node != sentinel)) | |
7487 | warning (OPT_Wformat, "missing sentinel in function call"); | |
bf6c8de0 | 7488 | } |
7489 | } | |
7490 | ||
dbf6c367 | 7491 | /* Helper for check_function_nonnull; given a list of operands which |
7492 | must be non-null in ARGS, determine if operand PARAM_NUM should be | |
7493 | checked. */ | |
7494 | ||
7495 | static bool | |
1cae46be | 7496 | nonnull_check_p (tree args, unsigned HOST_WIDE_INT param_num) |
dbf6c367 | 7497 | { |
4ee9c684 | 7498 | unsigned HOST_WIDE_INT arg_num = 0; |
dbf6c367 | 7499 | |
7500 | for (; args; args = TREE_CHAIN (args)) | |
7501 | { | |
231bd014 | 7502 | bool found = get_nonnull_operand (TREE_VALUE (args), &arg_num); |
7503 | ||
7504 | gcc_assert (found); | |
dbf6c367 | 7505 | |
7506 | if (arg_num == param_num) | |
7507 | return true; | |
7508 | } | |
7509 | return false; | |
7510 | } | |
7511 | ||
7512 | /* Check that the function argument PARAM (which is operand number | |
7513 | PARAM_NUM) is non-null. This is called by check_function_nonnull | |
7514 | via check_function_arguments_recurse. */ | |
7515 | ||
7516 | static void | |
9a03a746 | 7517 | check_nonnull_arg (void * ARG_UNUSED (ctx), tree param, |
1cae46be | 7518 | unsigned HOST_WIDE_INT param_num) |
dbf6c367 | 7519 | { |
7520 | /* Just skip checking the argument if it's not a pointer. This can | |
7521 | happen if the "nonnull" attribute was given without an operand | |
7522 | list (which means to check every pointer argument). */ | |
7523 | ||
7524 | if (TREE_CODE (TREE_TYPE (param)) != POINTER_TYPE) | |
7525 | return; | |
7526 | ||
7527 | if (integer_zerop (param)) | |
155b601b | 7528 | warning (OPT_Wnonnull, "null argument where non-null required " |
7529 | "(argument %lu)", (unsigned long) param_num); | |
dbf6c367 | 7530 | } |
7531 | ||
7532 | /* Helper for nonnull attribute handling; fetch the operand number | |
7533 | from the attribute argument list. */ | |
7534 | ||
7535 | static bool | |
1cae46be | 7536 | get_nonnull_operand (tree arg_num_expr, unsigned HOST_WIDE_INT *valp) |
dbf6c367 | 7537 | { |
67409385 | 7538 | /* Verify the arg number is a constant. */ |
dbf6c367 | 7539 | if (TREE_CODE (arg_num_expr) != INTEGER_CST |
7540 | || TREE_INT_CST_HIGH (arg_num_expr) != 0) | |
7541 | return false; | |
7542 | ||
7543 | *valp = TREE_INT_CST_LOW (arg_num_expr); | |
7544 | return true; | |
7545 | } | |
fa987697 | 7546 | |
7547 | /* Handle a "nothrow" attribute; arguments as in | |
7548 | struct attribute_spec.handler. */ | |
7549 | ||
7550 | static tree | |
9a03a746 | 7551 | handle_nothrow_attribute (tree *node, tree name, tree ARG_UNUSED (args), |
7552 | int ARG_UNUSED (flags), bool *no_add_attrs) | |
fa987697 | 7553 | { |
7554 | if (TREE_CODE (*node) == FUNCTION_DECL) | |
7555 | TREE_NOTHROW (*node) = 1; | |
7556 | /* ??? TODO: Support types. */ | |
7557 | else | |
7558 | { | |
9b2d6d13 | 7559 | warning (OPT_Wattributes, "%qE attribute ignored", name); |
fa987697 | 7560 | *no_add_attrs = true; |
7561 | } | |
7562 | ||
7563 | return NULL_TREE; | |
7564 | } | |
7acb29a3 | 7565 | |
7566 | /* Handle a "cleanup" attribute; arguments as in | |
7567 | struct attribute_spec.handler. */ | |
7568 | ||
7569 | static tree | |
1cae46be | 7570 | handle_cleanup_attribute (tree *node, tree name, tree args, |
9a03a746 | 7571 | int ARG_UNUSED (flags), bool *no_add_attrs) |
7acb29a3 | 7572 | { |
7573 | tree decl = *node; | |
7574 | tree cleanup_id, cleanup_decl; | |
7575 | ||
7576 | /* ??? Could perhaps support cleanups on TREE_STATIC, much like we do | |
7577 | for global destructors in C++. This requires infrastructure that | |
7578 | we don't have generically at the moment. It's also not a feature | |
7579 | we'd be missing too much, since we do have attribute constructor. */ | |
7580 | if (TREE_CODE (decl) != VAR_DECL || TREE_STATIC (decl)) | |
7581 | { | |
9b2d6d13 | 7582 | warning (OPT_Wattributes, "%qE attribute ignored", name); |
7acb29a3 | 7583 | *no_add_attrs = true; |
7584 | return NULL_TREE; | |
7585 | } | |
7586 | ||
7587 | /* Verify that the argument is a function in scope. */ | |
7588 | /* ??? We could support pointers to functions here as well, if | |
7589 | that was considered desirable. */ | |
7590 | cleanup_id = TREE_VALUE (args); | |
7591 | if (TREE_CODE (cleanup_id) != IDENTIFIER_NODE) | |
7592 | { | |
07e3a3d2 | 7593 | error ("cleanup argument not an identifier"); |
7acb29a3 | 7594 | *no_add_attrs = true; |
7595 | return NULL_TREE; | |
7596 | } | |
d1c41717 | 7597 | cleanup_decl = lookup_name (cleanup_id); |
7acb29a3 | 7598 | if (!cleanup_decl || TREE_CODE (cleanup_decl) != FUNCTION_DECL) |
7599 | { | |
07e3a3d2 | 7600 | error ("cleanup argument not a function"); |
7acb29a3 | 7601 | *no_add_attrs = true; |
7602 | return NULL_TREE; | |
7603 | } | |
7604 | ||
1cae46be | 7605 | /* That the function has proper type is checked with the |
7acb29a3 | 7606 | eventual call to build_function_call. */ |
7607 | ||
7608 | return NULL_TREE; | |
7609 | } | |
8a8cdb8d | 7610 | |
7611 | /* Handle a "warn_unused_result" attribute. No special handling. */ | |
7612 | ||
7613 | static tree | |
7614 | handle_warn_unused_result_attribute (tree *node, tree name, | |
9a03a746 | 7615 | tree ARG_UNUSED (args), |
7616 | int ARG_UNUSED (flags), bool *no_add_attrs) | |
8a8cdb8d | 7617 | { |
7618 | /* Ignore the attribute for functions not returning any value. */ | |
7619 | if (VOID_TYPE_P (TREE_TYPE (*node))) | |
7620 | { | |
9b2d6d13 | 7621 | warning (OPT_Wattributes, "%qE attribute ignored", name); |
8a8cdb8d | 7622 | *no_add_attrs = true; |
7623 | } | |
7624 | ||
7625 | return NULL_TREE; | |
7626 | } | |
bf6c8de0 | 7627 | |
7628 | /* Handle a "sentinel" attribute. */ | |
7629 | ||
7630 | static tree | |
50ca527f | 7631 | handle_sentinel_attribute (tree *node, tree name, tree args, |
bf6c8de0 | 7632 | int ARG_UNUSED (flags), bool *no_add_attrs) |
7633 | { | |
7634 | tree params = TYPE_ARG_TYPES (*node); | |
7635 | ||
7636 | if (!params) | |
7637 | { | |
9b2d6d13 | 7638 | warning (OPT_Wattributes, |
7639 | "%qE attribute requires prototypes with named arguments", name); | |
bf6c8de0 | 7640 | *no_add_attrs = true; |
bf6c8de0 | 7641 | } |
50ca527f | 7642 | else |
7643 | { | |
7644 | while (TREE_CHAIN (params)) | |
7645 | params = TREE_CHAIN (params); | |
bf6c8de0 | 7646 | |
50ca527f | 7647 | if (VOID_TYPE_P (TREE_VALUE (params))) |
a0c938f0 | 7648 | { |
9b2d6d13 | 7649 | warning (OPT_Wattributes, |
7650 | "%qE attribute only applies to variadic functions", name); | |
50ca527f | 7651 | *no_add_attrs = true; |
7652 | } | |
7653 | } | |
a0c938f0 | 7654 | |
50ca527f | 7655 | if (args) |
bf6c8de0 | 7656 | { |
50ca527f | 7657 | tree position = TREE_VALUE (args); |
7658 | ||
50ca527f | 7659 | if (TREE_CODE (position) != INTEGER_CST) |
a0c938f0 | 7660 | { |
01b54db5 | 7661 | warning (OPT_Wattributes, |
7662 | "requested position is not an integer constant"); | |
50ca527f | 7663 | *no_add_attrs = true; |
7664 | } | |
7665 | else | |
a0c938f0 | 7666 | { |
50ca527f | 7667 | if (tree_int_cst_lt (position, integer_zero_node)) |
7668 | { | |
01b54db5 | 7669 | warning (OPT_Wattributes, |
7670 | "requested position is less than zero"); | |
50ca527f | 7671 | *no_add_attrs = true; |
7672 | } | |
7673 | } | |
bf6c8de0 | 7674 | } |
a0c938f0 | 7675 | |
bf6c8de0 | 7676 | return NULL_TREE; |
7677 | } | |
b5c26b42 | 7678 | |
7679 | /* Handle a "type_generic" attribute. */ | |
7680 | ||
7681 | static tree | |
7682 | handle_type_generic_attribute (tree *node, tree ARG_UNUSED (name), | |
7683 | tree ARG_UNUSED (args), int ARG_UNUSED (flags), | |
7684 | bool * ARG_UNUSED (no_add_attrs)) | |
7685 | { | |
19fbe3a4 | 7686 | tree params; |
7687 | ||
7688 | /* Ensure we have a function type. */ | |
7689 | gcc_assert (TREE_CODE (*node) == FUNCTION_TYPE); | |
7690 | ||
7691 | params = TYPE_ARG_TYPES (*node); | |
7692 | while (params && ! VOID_TYPE_P (TREE_VALUE (params))) | |
7693 | params = TREE_CHAIN (params); | |
7694 | ||
7695 | /* Ensure we have a variadic function. */ | |
7696 | gcc_assert (!params); | |
b5c26b42 | 7697 | |
7698 | return NULL_TREE; | |
7699 | } | |
46f8e3b0 | 7700 | |
24470055 | 7701 | /* Handle a "target" attribute. */ |
46f8e3b0 | 7702 | |
7703 | static tree | |
24470055 | 7704 | handle_target_attribute (tree *node, tree name, tree args, int flags, |
46f8e3b0 | 7705 | bool *no_add_attrs) |
7706 | { | |
7707 | /* Ensure we have a function type. */ | |
7708 | if (TREE_CODE (*node) != FUNCTION_DECL) | |
7709 | { | |
7710 | warning (OPT_Wattributes, "%qE attribute ignored", name); | |
7711 | *no_add_attrs = true; | |
7712 | } | |
46f8e3b0 | 7713 | else if (! targetm.target_option.valid_attribute_p (*node, name, args, |
7714 | flags)) | |
7715 | *no_add_attrs = true; | |
7716 | ||
7717 | return NULL_TREE; | |
7718 | } | |
7719 | ||
7720 | /* Arguments being collected for optimization. */ | |
7721 | typedef const char *const_char_p; /* For DEF_VEC_P. */ | |
7722 | DEF_VEC_P(const_char_p); | |
7723 | DEF_VEC_ALLOC_P(const_char_p, gc); | |
7724 | static GTY(()) VEC(const_char_p, gc) *optimize_args; | |
7725 | ||
7726 | ||
7727 | /* Inner function to convert a TREE_LIST to argv string to parse the optimize | |
7728 | options in ARGS. ATTR_P is true if this is for attribute(optimize), and | |
7729 | false for #pragma GCC optimize. */ | |
7730 | ||
7731 | bool | |
7732 | parse_optimize_options (tree args, bool attr_p) | |
7733 | { | |
7734 | bool ret = true; | |
7735 | unsigned opt_argc; | |
7736 | unsigned i; | |
2becf397 | 7737 | int saved_flag_strict_aliasing; |
46f8e3b0 | 7738 | const char **opt_argv; |
7739 | tree ap; | |
7740 | ||
7741 | /* Build up argv vector. Just in case the string is stored away, use garbage | |
7742 | collected strings. */ | |
7743 | VEC_truncate (const_char_p, optimize_args, 0); | |
7744 | VEC_safe_push (const_char_p, gc, optimize_args, NULL); | |
7745 | ||
7746 | for (ap = args; ap != NULL_TREE; ap = TREE_CHAIN (ap)) | |
7747 | { | |
7748 | tree value = TREE_VALUE (ap); | |
7749 | ||
7750 | if (TREE_CODE (value) == INTEGER_CST) | |
7751 | { | |
7752 | char buffer[20]; | |
7753 | sprintf (buffer, "-O%ld", (long) TREE_INT_CST_LOW (value)); | |
7754 | VEC_safe_push (const_char_p, gc, optimize_args, ggc_strdup (buffer)); | |
7755 | } | |
7756 | ||
7757 | else if (TREE_CODE (value) == STRING_CST) | |
7758 | { | |
7759 | /* Split string into multiple substrings. */ | |
7760 | size_t len = TREE_STRING_LENGTH (value); | |
7761 | char *p = ASTRDUP (TREE_STRING_POINTER (value)); | |
7762 | char *end = p + len; | |
7763 | char *comma; | |
7764 | char *next_p = p; | |
7765 | ||
7766 | while (next_p != NULL) | |
7767 | { | |
7768 | size_t len2; | |
7769 | char *q, *r; | |
7770 | ||
7771 | p = next_p; | |
7772 | comma = strchr (p, ','); | |
7773 | if (comma) | |
7774 | { | |
7775 | len2 = comma - p; | |
7776 | *comma = '\0'; | |
7777 | next_p = comma+1; | |
7778 | } | |
7779 | else | |
7780 | { | |
7781 | len2 = end - p; | |
7782 | next_p = NULL; | |
7783 | } | |
7784 | ||
7785 | r = q = (char *) ggc_alloc (len2 + 3); | |
7786 | ||
7787 | /* If the user supplied -Oxxx or -fxxx, only allow -Oxxx or -fxxx | |
7788 | options. */ | |
7789 | if (*p == '-' && p[1] != 'O' && p[1] != 'f') | |
7790 | { | |
7791 | ret = false; | |
7792 | if (attr_p) | |
7793 | warning (OPT_Wattributes, | |
7794 | "Bad option %s to optimize attribute.", p); | |
7795 | else | |
7796 | warning (OPT_Wpragmas, | |
7797 | "Bad option %s to pragma attribute", p); | |
7798 | continue; | |
7799 | } | |
7800 | ||
7801 | if (*p != '-') | |
7802 | { | |
7803 | *r++ = '-'; | |
7804 | ||
7805 | /* Assume that Ox is -Ox, a numeric value is -Ox, a s by | |
7806 | itself is -Os, and any other switch begins with a -f. */ | |
7807 | if ((*p >= '0' && *p <= '9') | |
7808 | || (p[0] == 's' && p[1] == '\0')) | |
7809 | *r++ = 'O'; | |
7810 | else if (*p != 'O') | |
7811 | *r++ = 'f'; | |
7812 | } | |
7813 | ||
7814 | memcpy (r, p, len2); | |
7815 | r[len2] = '\0'; | |
7816 | VEC_safe_push (const_char_p, gc, optimize_args, q); | |
7817 | } | |
7818 | ||
7819 | } | |
7820 | } | |
7821 | ||
7822 | opt_argc = VEC_length (const_char_p, optimize_args); | |
7823 | opt_argv = (const char **) alloca (sizeof (char *) * (opt_argc + 1)); | |
7824 | ||
7825 | for (i = 1; i < opt_argc; i++) | |
7826 | opt_argv[i] = VEC_index (const_char_p, optimize_args, i); | |
7827 | ||
2becf397 | 7828 | saved_flag_strict_aliasing = flag_strict_aliasing; |
7829 | ||
46f8e3b0 | 7830 | /* Now parse the options. */ |
7831 | decode_options (opt_argc, opt_argv); | |
7832 | ||
2becf397 | 7833 | /* Don't allow changing -fstrict-aliasing. */ |
7834 | flag_strict_aliasing = saved_flag_strict_aliasing; | |
7835 | ||
46f8e3b0 | 7836 | VEC_truncate (const_char_p, optimize_args, 0); |
7837 | return ret; | |
7838 | } | |
7839 | ||
7840 | /* For handling "optimize" attribute. arguments as in | |
7841 | struct attribute_spec.handler. */ | |
7842 | ||
7843 | static tree | |
7844 | handle_optimize_attribute (tree *node, tree name, tree args, | |
7845 | int ARG_UNUSED (flags), bool *no_add_attrs) | |
7846 | { | |
7847 | /* Ensure we have a function type. */ | |
7848 | if (TREE_CODE (*node) != FUNCTION_DECL) | |
7849 | { | |
7850 | warning (OPT_Wattributes, "%qE attribute ignored", name); | |
7851 | *no_add_attrs = true; | |
7852 | } | |
7853 | else | |
7854 | { | |
7855 | struct cl_optimization cur_opts; | |
7856 | tree old_opts = DECL_FUNCTION_SPECIFIC_OPTIMIZATION (*node); | |
7857 | ||
7858 | /* Save current options. */ | |
7859 | cl_optimization_save (&cur_opts); | |
7860 | ||
7861 | /* If we previously had some optimization options, use them as the | |
7862 | default. */ | |
7863 | if (old_opts) | |
7864 | cl_optimization_restore (TREE_OPTIMIZATION (old_opts)); | |
7865 | ||
7866 | /* Parse options, and update the vector. */ | |
7867 | parse_optimize_options (args, true); | |
7868 | DECL_FUNCTION_SPECIFIC_OPTIMIZATION (*node) | |
7869 | = build_optimization_node (); | |
7870 | ||
7871 | /* Restore current options. */ | |
7872 | cl_optimization_restore (&cur_opts); | |
7873 | } | |
7874 | ||
7875 | return NULL_TREE; | |
7876 | } | |
dbf6c367 | 7877 | \f |
d01f58f9 | 7878 | /* Check for valid arguments being passed to a function. |
7879 | ATTRS is a list of attributes. There are NARGS arguments in the array | |
7880 | ARGARRAY. TYPELIST is the list of argument types for the function. | |
7881 | */ | |
dbf6c367 | 7882 | void |
d01f58f9 | 7883 | check_function_arguments (tree attrs, int nargs, tree *argarray, tree typelist) |
dbf6c367 | 7884 | { |
7885 | /* Check for null being passed in a pointer argument that must be | |
7886 | non-null. We also need to do this if format checking is enabled. */ | |
7887 | ||
7888 | if (warn_nonnull) | |
d01f58f9 | 7889 | check_function_nonnull (attrs, nargs, argarray); |
dbf6c367 | 7890 | |
7891 | /* Check for errors in format strings. */ | |
7892 | ||
95c90e04 | 7893 | if (warn_format || warn_missing_format_attribute) |
d01f58f9 | 7894 | check_function_format (attrs, nargs, argarray); |
95c90e04 | 7895 | |
7896 | if (warn_format) | |
d01f58f9 | 7897 | check_function_sentinel (attrs, nargs, argarray, typelist); |
dbf6c367 | 7898 | } |
7899 | ||
7900 | /* Generic argument checking recursion routine. PARAM is the argument to | |
7901 | be checked. PARAM_NUM is the number of the argument. CALLBACK is invoked | |
7902 | once the argument is resolved. CTX is context for the callback. */ | |
7903 | void | |
1cae46be | 7904 | check_function_arguments_recurse (void (*callback) |
7905 | (void *, tree, unsigned HOST_WIDE_INT), | |
7906 | void *ctx, tree param, | |
7907 | unsigned HOST_WIDE_INT param_num) | |
dbf6c367 | 7908 | { |
72dd6141 | 7909 | if (CONVERT_EXPR_P (param) |
c44afe23 | 7910 | && (TYPE_PRECISION (TREE_TYPE (param)) |
7911 | == TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (param, 0))))) | |
dbf6c367 | 7912 | { |
7913 | /* Strip coercion. */ | |
7914 | check_function_arguments_recurse (callback, ctx, | |
4ee9c684 | 7915 | TREE_OPERAND (param, 0), param_num); |
dbf6c367 | 7916 | return; |
7917 | } | |
7918 | ||
7919 | if (TREE_CODE (param) == CALL_EXPR) | |
7920 | { | |
c2f47e15 | 7921 | tree type = TREE_TYPE (TREE_TYPE (CALL_EXPR_FN (param))); |
dbf6c367 | 7922 | tree attrs; |
7923 | bool found_format_arg = false; | |
7924 | ||
7925 | /* See if this is a call to a known internationalization function | |
7926 | that modifies a format arg. Such a function may have multiple | |
7927 | format_arg attributes (for example, ngettext). */ | |
7928 | ||
7929 | for (attrs = TYPE_ATTRIBUTES (type); | |
7930 | attrs; | |
7931 | attrs = TREE_CHAIN (attrs)) | |
7932 | if (is_attribute_p ("format_arg", TREE_PURPOSE (attrs))) | |
7933 | { | |
c2f47e15 | 7934 | tree inner_arg; |
dbf6c367 | 7935 | tree format_num_expr; |
7936 | int format_num; | |
7937 | int i; | |
c2f47e15 | 7938 | call_expr_arg_iterator iter; |
dbf6c367 | 7939 | |
7940 | /* Extract the argument number, which was previously checked | |
7941 | to be valid. */ | |
7942 | format_num_expr = TREE_VALUE (TREE_VALUE (attrs)); | |
dbf6c367 | 7943 | |
231bd014 | 7944 | gcc_assert (TREE_CODE (format_num_expr) == INTEGER_CST |
7945 | && !TREE_INT_CST_HIGH (format_num_expr)); | |
dbf6c367 | 7946 | |
7947 | format_num = TREE_INT_CST_LOW (format_num_expr); | |
7948 | ||
c2f47e15 | 7949 | for (inner_arg = first_call_expr_arg (param, &iter), i = 1; |
7950 | inner_arg != 0; | |
7951 | inner_arg = next_call_expr_arg (&iter), i++) | |
dbf6c367 | 7952 | if (i == format_num) |
7953 | { | |
7954 | check_function_arguments_recurse (callback, ctx, | |
c2f47e15 | 7955 | inner_arg, param_num); |
dbf6c367 | 7956 | found_format_arg = true; |
7957 | break; | |
7958 | } | |
7959 | } | |
7960 | ||
7961 | /* If we found a format_arg attribute and did a recursive check, | |
7962 | we are done with checking this argument. Otherwise, we continue | |
7963 | and this will be considered a non-literal. */ | |
7964 | if (found_format_arg) | |
7965 | return; | |
7966 | } | |
7967 | ||
7968 | if (TREE_CODE (param) == COND_EXPR) | |
7969 | { | |
7970 | /* Check both halves of the conditional expression. */ | |
7971 | check_function_arguments_recurse (callback, ctx, | |
4ee9c684 | 7972 | TREE_OPERAND (param, 1), param_num); |
dbf6c367 | 7973 | check_function_arguments_recurse (callback, ctx, |
4ee9c684 | 7974 | TREE_OPERAND (param, 2), param_num); |
dbf6c367 | 7975 | return; |
7976 | } | |
7977 | ||
7978 | (*callback) (ctx, param, param_num); | |
7979 | } | |
1f3233d1 | 7980 | |
d43cee80 | 7981 | /* Checks the number of arguments NARGS against the required number |
7982 | REQUIRED and issues an error if there is a mismatch. Returns true | |
7983 | if the number of arguments is correct, otherwise false. */ | |
7984 | ||
7985 | static bool | |
7986 | validate_nargs (tree fndecl, int nargs, int required) | |
7987 | { | |
7988 | if (nargs < required) | |
7989 | { | |
7990 | error ("not enough arguments to function %qE", fndecl); | |
7991 | return false; | |
7992 | } | |
7993 | else if (nargs > required) | |
7994 | { | |
7995 | error ("too many arguments to function %qE", fndecl); | |
7996 | return false; | |
7997 | } | |
7998 | return true; | |
7999 | } | |
8000 | ||
8001 | /* Verifies the NARGS arguments ARGS to the builtin function FNDECL. | |
8002 | Returns false if there was an error, otherwise true. */ | |
8003 | ||
8004 | bool | |
8005 | check_builtin_function_arguments (tree fndecl, int nargs, tree *args) | |
8006 | { | |
8007 | if (!DECL_BUILT_IN (fndecl) | |
8008 | || DECL_BUILT_IN_CLASS (fndecl) != BUILT_IN_NORMAL) | |
8009 | return true; | |
8010 | ||
8011 | switch (DECL_FUNCTION_CODE (fndecl)) | |
8012 | { | |
8013 | case BUILT_IN_CONSTANT_P: | |
8014 | return validate_nargs (fndecl, nargs, 1); | |
8015 | ||
8016 | case BUILT_IN_ISFINITE: | |
8017 | case BUILT_IN_ISINF: | |
c319d56a | 8018 | case BUILT_IN_ISINF_SIGN: |
d43cee80 | 8019 | case BUILT_IN_ISNAN: |
8020 | case BUILT_IN_ISNORMAL: | |
8021 | if (validate_nargs (fndecl, nargs, 1)) | |
8022 | { | |
8023 | if (TREE_CODE (TREE_TYPE (args[0])) != REAL_TYPE) | |
8024 | { | |
8025 | error ("non-floating-point argument in call to " | |
8026 | "function %qE", fndecl); | |
8027 | return false; | |
8028 | } | |
8029 | return true; | |
8030 | } | |
8031 | return false; | |
8032 | ||
8033 | case BUILT_IN_ISGREATER: | |
8034 | case BUILT_IN_ISGREATEREQUAL: | |
8035 | case BUILT_IN_ISLESS: | |
8036 | case BUILT_IN_ISLESSEQUAL: | |
8037 | case BUILT_IN_ISLESSGREATER: | |
8038 | case BUILT_IN_ISUNORDERED: | |
8039 | if (validate_nargs (fndecl, nargs, 2)) | |
8040 | { | |
8041 | enum tree_code code0, code1; | |
8042 | code0 = TREE_CODE (TREE_TYPE (args[0])); | |
8043 | code1 = TREE_CODE (TREE_TYPE (args[1])); | |
8044 | if (!((code0 == REAL_TYPE && code1 == REAL_TYPE) | |
8045 | || (code0 == REAL_TYPE && code1 == INTEGER_TYPE) | |
8046 | || (code0 == INTEGER_TYPE && code1 == REAL_TYPE))) | |
8047 | { | |
8048 | error ("non-floating-point arguments in call to " | |
8049 | "function %qE", fndecl); | |
8050 | return false; | |
8051 | } | |
8052 | return true; | |
8053 | } | |
8054 | return false; | |
8055 | ||
19fbe3a4 | 8056 | case BUILT_IN_FPCLASSIFY: |
8057 | if (validate_nargs (fndecl, nargs, 6)) | |
8058 | { | |
8059 | unsigned i; | |
8060 | ||
8061 | for (i=0; i<5; i++) | |
8062 | if (TREE_CODE (args[i]) != INTEGER_CST) | |
8063 | { | |
8064 | error ("non-const integer argument %u in call to function %qE", | |
8065 | i+1, fndecl); | |
8066 | return false; | |
8067 | } | |
8068 | ||
8069 | if (TREE_CODE (TREE_TYPE (args[5])) != REAL_TYPE) | |
8070 | { | |
8071 | error ("non-floating-point argument in call to function %qE", | |
8072 | fndecl); | |
8073 | return false; | |
8074 | } | |
8075 | return true; | |
8076 | } | |
8077 | return false; | |
8078 | ||
d43cee80 | 8079 | default: |
8080 | return true; | |
8081 | } | |
8082 | } | |
8083 | ||
860251be | 8084 | /* Function to help qsort sort FIELD_DECLs by name order. */ |
8085 | ||
8086 | int | |
8087 | field_decl_cmp (const void *x_p, const void *y_p) | |
8088 | { | |
4fd61bc6 | 8089 | const tree *const x = (const tree *const) x_p; |
8090 | const tree *const y = (const tree *const) y_p; | |
8091 | ||
860251be | 8092 | if (DECL_NAME (*x) == DECL_NAME (*y)) |
8093 | /* A nontype is "greater" than a type. */ | |
8094 | return (TREE_CODE (*y) == TYPE_DECL) - (TREE_CODE (*x) == TYPE_DECL); | |
8095 | if (DECL_NAME (*x) == NULL_TREE) | |
8096 | return -1; | |
8097 | if (DECL_NAME (*y) == NULL_TREE) | |
8098 | return 1; | |
8099 | if (DECL_NAME (*x) < DECL_NAME (*y)) | |
8100 | return -1; | |
8101 | return 1; | |
8102 | } | |
8103 | ||
8104 | static struct { | |
8105 | gt_pointer_operator new_value; | |
8106 | void *cookie; | |
8107 | } resort_data; | |
8108 | ||
8109 | /* This routine compares two fields like field_decl_cmp but using the | |
8110 | pointer operator in resort_data. */ | |
8111 | ||
8112 | static int | |
8113 | resort_field_decl_cmp (const void *x_p, const void *y_p) | |
8114 | { | |
4fd61bc6 | 8115 | const tree *const x = (const tree *const) x_p; |
8116 | const tree *const y = (const tree *const) y_p; | |
860251be | 8117 | |
8118 | if (DECL_NAME (*x) == DECL_NAME (*y)) | |
8119 | /* A nontype is "greater" than a type. */ | |
8120 | return (TREE_CODE (*y) == TYPE_DECL) - (TREE_CODE (*x) == TYPE_DECL); | |
8121 | if (DECL_NAME (*x) == NULL_TREE) | |
8122 | return -1; | |
8123 | if (DECL_NAME (*y) == NULL_TREE) | |
8124 | return 1; | |
8125 | { | |
8126 | tree d1 = DECL_NAME (*x); | |
8127 | tree d2 = DECL_NAME (*y); | |
8128 | resort_data.new_value (&d1, resort_data.cookie); | |
8129 | resort_data.new_value (&d2, resort_data.cookie); | |
8130 | if (d1 < d2) | |
8131 | return -1; | |
8132 | } | |
8133 | return 1; | |
8134 | } | |
8135 | ||
8136 | /* Resort DECL_SORTED_FIELDS because pointers have been reordered. */ | |
8137 | ||
8138 | void | |
8139 | resort_sorted_fields (void *obj, | |
9a03a746 | 8140 | void * ARG_UNUSED (orig_obj), |
4ee9c684 | 8141 | gt_pointer_operator new_value, |
8142 | void *cookie) | |
860251be | 8143 | { |
9a03a746 | 8144 | struct sorted_fields_type *sf = (struct sorted_fields_type *) obj; |
860251be | 8145 | resort_data.new_value = new_value; |
8146 | resort_data.cookie = cookie; | |
8147 | qsort (&sf->elts[0], sf->len, sizeof (tree), | |
4ee9c684 | 8148 | resort_field_decl_cmp); |
860251be | 8149 | } |
8150 | ||
209c9752 | 8151 | /* Subroutine of c_parse_error. |
8152 | Return the result of concatenating LHS and RHS. RHS is really | |
8153 | a string literal, its first character is indicated by RHS_START and | |
cfee01e3 | 8154 | RHS_SIZE is its length (including the terminating NUL character). |
209c9752 | 8155 | |
8156 | The caller is responsible for deleting the returned pointer. */ | |
8157 | ||
8158 | static char * | |
8159 | catenate_strings (const char *lhs, const char *rhs_start, int rhs_size) | |
8160 | { | |
8161 | const int lhs_size = strlen (lhs); | |
8162 | char *result = XNEWVEC (char, lhs_size + rhs_size); | |
8163 | strncpy (result, lhs, lhs_size); | |
8164 | strncpy (result + lhs_size, rhs_start, rhs_size); | |
8165 | return result; | |
8166 | } | |
8167 | ||
380c6697 | 8168 | /* Issue the error given by GMSGID, indicating that it occurred before |
92b128ed | 8169 | TOKEN, which had the associated VALUE. */ |
8170 | ||
8171 | void | |
380c6697 | 8172 | c_parse_error (const char *gmsgid, enum cpp_ttype token, tree value) |
92b128ed | 8173 | { |
209c9752 | 8174 | #define catenate_messages(M1, M2) catenate_strings ((M1), (M2), sizeof (M2)) |
8175 | ||
8176 | char *message = NULL; | |
92b128ed | 8177 | |
8178 | if (token == CPP_EOF) | |
380c6697 | 8179 | message = catenate_messages (gmsgid, " at end of input"); |
924bbf02 | 8180 | else if (token == CPP_CHAR || token == CPP_WCHAR || token == CPP_CHAR16 |
8181 | || token == CPP_CHAR32) | |
92b128ed | 8182 | { |
8183 | unsigned int val = TREE_INT_CST_LOW (value); | |
924bbf02 | 8184 | const char *prefix; |
8185 | ||
8186 | switch (token) | |
8187 | { | |
8188 | default: | |
8189 | prefix = ""; | |
8190 | break; | |
8191 | case CPP_WCHAR: | |
8192 | prefix = "L"; | |
8193 | break; | |
8194 | case CPP_CHAR16: | |
8195 | prefix = "u"; | |
8196 | break; | |
8197 | case CPP_CHAR32: | |
8198 | prefix = "U"; | |
8199 | break; | |
8200 | } | |
8201 | ||
92b128ed | 8202 | if (val <= UCHAR_MAX && ISGRAPH (val)) |
a0c938f0 | 8203 | message = catenate_messages (gmsgid, " before %s'%c'"); |
92b128ed | 8204 | else |
a0c938f0 | 8205 | message = catenate_messages (gmsgid, " before %s'\\x%x'"); |
209c9752 | 8206 | |
924bbf02 | 8207 | error (message, prefix, val); |
209c9752 | 8208 | free (message); |
8209 | message = NULL; | |
92b128ed | 8210 | } |
924bbf02 | 8211 | else if (token == CPP_STRING || token == CPP_WSTRING || token == CPP_STRING16 |
8212 | || token == CPP_STRING32) | |
380c6697 | 8213 | message = catenate_messages (gmsgid, " before string constant"); |
92b128ed | 8214 | else if (token == CPP_NUMBER) |
380c6697 | 8215 | message = catenate_messages (gmsgid, " before numeric constant"); |
92b128ed | 8216 | else if (token == CPP_NAME) |
209c9752 | 8217 | { |
380c6697 | 8218 | message = catenate_messages (gmsgid, " before %qE"); |
782858b8 | 8219 | error (message, value); |
209c9752 | 8220 | free (message); |
8221 | message = NULL; | |
8222 | } | |
b75b98aa | 8223 | else if (token == CPP_PRAGMA) |
8224 | message = catenate_messages (gmsgid, " before %<#pragma%>"); | |
8225 | else if (token == CPP_PRAGMA_EOL) | |
8226 | message = catenate_messages (gmsgid, " before end of line"); | |
92b128ed | 8227 | else if (token < N_TTYPES) |
209c9752 | 8228 | { |
380c6697 | 8229 | message = catenate_messages (gmsgid, " before %qs token"); |
209c9752 | 8230 | error (message, cpp_type2name (token)); |
8231 | free (message); | |
8232 | message = NULL; | |
8233 | } | |
92b128ed | 8234 | else |
380c6697 | 8235 | error (gmsgid); |
209c9752 | 8236 | |
8237 | if (message) | |
8238 | { | |
8239 | error (message); | |
8240 | free (message); | |
8241 | } | |
a0c938f0 | 8242 | #undef catenate_messages |
92b128ed | 8243 | } |
8244 | ||
7f5f3953 | 8245 | /* Callback from cpp_error for PFILE to print diagnostics from the |
8246 | preprocessor. The diagnostic is of type LEVEL, at location | |
8247 | LOCATION unless this is after lexing and the compiler's location | |
8248 | should be used instead, with column number possibly overridden by | |
8249 | COLUMN_OVERRIDE if not zero; MSG is the translated message and AP | |
8250 | the arguments. Returns true if a diagnostic was emitted, false | |
8251 | otherwise. */ | |
8252 | ||
8253 | bool | |
8254 | c_cpp_error (cpp_reader *pfile ATTRIBUTE_UNUSED, int level, | |
8255 | location_t location, unsigned int column_override, | |
8256 | const char *msg, va_list *ap) | |
8257 | { | |
8258 | diagnostic_info diagnostic; | |
8259 | diagnostic_t dlevel; | |
8260 | int save_warn_system_headers = warn_system_headers; | |
8261 | bool ret; | |
8262 | ||
8263 | switch (level) | |
8264 | { | |
8265 | case CPP_DL_WARNING_SYSHDR: | |
8266 | if (flag_no_output) | |
8267 | return false; | |
8268 | warn_system_headers = 1; | |
8269 | /* Fall through. */ | |
8270 | case CPP_DL_WARNING: | |
8271 | if (flag_no_output) | |
8272 | return false; | |
8273 | dlevel = DK_WARNING; | |
8274 | break; | |
8275 | case CPP_DL_PEDWARN: | |
8276 | if (flag_no_output && !flag_pedantic_errors) | |
8277 | return false; | |
8278 | dlevel = DK_PEDWARN; | |
8279 | break; | |
8280 | case CPP_DL_ERROR: | |
8281 | dlevel = DK_ERROR; | |
8282 | break; | |
8283 | case CPP_DL_ICE: | |
8284 | dlevel = DK_ICE; | |
8285 | break; | |
8286 | case CPP_DL_NOTE: | |
8287 | dlevel = DK_NOTE; | |
8288 | break; | |
ff903809 | 8289 | case CPP_DL_FATAL: |
8290 | dlevel = DK_FATAL; | |
8291 | break; | |
7f5f3953 | 8292 | default: |
8293 | gcc_unreachable (); | |
8294 | } | |
8295 | if (done_lexing) | |
8296 | location = input_location; | |
8297 | diagnostic_set_info_translated (&diagnostic, msg, ap, | |
8298 | location, dlevel); | |
8299 | if (column_override) | |
8300 | diagnostic_override_column (&diagnostic, column_override); | |
8301 | ret = report_diagnostic (&diagnostic); | |
8302 | if (level == CPP_DL_WARNING_SYSHDR) | |
8303 | warn_system_headers = save_warn_system_headers; | |
8304 | return ret; | |
8305 | } | |
8306 | ||
4ee9c684 | 8307 | /* Walk a gimplified function and warn for functions whose return value is |
8308 | ignored and attribute((warn_unused_result)) is set. This is done before | |
b27ac6b5 | 8309 | inlining, so we don't have to worry about that. */ |
8310 | ||
4ee9c684 | 8311 | void |
75a70cf9 | 8312 | c_warn_unused_result (gimple_seq seq) |
4ee9c684 | 8313 | { |
4ee9c684 | 8314 | tree fdecl, ftype; |
75a70cf9 | 8315 | gimple_stmt_iterator i; |
4ee9c684 | 8316 | |
75a70cf9 | 8317 | for (i = gsi_start (seq); !gsi_end_p (i); gsi_next (&i)) |
4ee9c684 | 8318 | { |
75a70cf9 | 8319 | gimple g = gsi_stmt (i); |
4ee9c684 | 8320 | |
75a70cf9 | 8321 | switch (gimple_code (g)) |
4ee9c684 | 8322 | { |
75a70cf9 | 8323 | case GIMPLE_BIND: |
8324 | c_warn_unused_result (gimple_bind_body (g)); | |
8325 | break; | |
8326 | case GIMPLE_TRY: | |
8327 | c_warn_unused_result (gimple_try_eval (g)); | |
8328 | c_warn_unused_result (gimple_try_cleanup (g)); | |
8329 | break; | |
8330 | case GIMPLE_CATCH: | |
8331 | c_warn_unused_result (gimple_catch_handler (g)); | |
8332 | break; | |
8333 | case GIMPLE_EH_FILTER: | |
8334 | c_warn_unused_result (gimple_eh_filter_failure (g)); | |
8335 | break; | |
4ee9c684 | 8336 | |
75a70cf9 | 8337 | case GIMPLE_CALL: |
8338 | if (gimple_call_lhs (g)) | |
8339 | break; | |
8340 | ||
8341 | /* This is a naked call, as opposed to a GIMPLE_CALL with an | |
8342 | LHS. All calls whose value is ignored should be | |
8343 | represented like this. Look for the attribute. */ | |
0acacf9e | 8344 | fdecl = gimple_call_fndecl (g); |
8345 | ftype = TREE_TYPE (TREE_TYPE (gimple_call_fn (g))); | |
4ee9c684 | 8346 | |
75a70cf9 | 8347 | if (lookup_attribute ("warn_unused_result", TYPE_ATTRIBUTES (ftype))) |
8348 | { | |
8349 | location_t loc = gimple_location (g); | |
8350 | ||
8351 | if (fdecl) | |
8352 | warning (0, "%Hignoring return value of %qD, " | |
8353 | "declared with attribute warn_unused_result", | |
8354 | &loc, fdecl); | |
8355 | else | |
8356 | warning (0, "%Hignoring return value of function " | |
8357 | "declared with attribute warn_unused_result", | |
8358 | &loc); | |
8359 | } | |
8360 | break; | |
8361 | ||
8362 | default: | |
8363 | /* Not a container, not a call, or a call whose value is used. */ | |
8364 | break; | |
8365 | } | |
4ee9c684 | 8366 | } |
8367 | } | |
8368 | ||
624d37a6 | 8369 | /* Convert a character from the host to the target execution character |
8370 | set. cpplib handles this, mostly. */ | |
8371 | ||
8372 | HOST_WIDE_INT | |
8373 | c_common_to_target_charset (HOST_WIDE_INT c) | |
8374 | { | |
8375 | /* Character constants in GCC proper are sign-extended under -fsigned-char, | |
8376 | zero-extended under -fno-signed-char. cpplib insists that characters | |
8377 | and character constants are always unsigned. Hence we must convert | |
8378 | back and forth. */ | |
8379 | cppchar_t uc = ((cppchar_t)c) & ((((cppchar_t)1) << CHAR_BIT)-1); | |
8380 | ||
8381 | uc = cpp_host_to_exec_charset (parse_in, uc); | |
8382 | ||
8383 | if (flag_signed_char) | |
8384 | return ((HOST_WIDE_INT)uc) << (HOST_BITS_PER_WIDE_INT - CHAR_TYPE_SIZE) | |
8385 | >> (HOST_BITS_PER_WIDE_INT - CHAR_TYPE_SIZE); | |
8386 | else | |
8387 | return uc; | |
8388 | } | |
8389 | ||
af28855b | 8390 | /* Build the result of __builtin_offsetof. EXPR is a nested sequence of |
d897f7c2 | 8391 | component references, with STOP_REF, or alternatively an INDIRECT_REF of |
8392 | NULL, at the bottom; much like the traditional rendering of offsetof as a | |
8393 | macro. Returns the folded and properly cast result. */ | |
af28855b | 8394 | |
8395 | static tree | |
d897f7c2 | 8396 | fold_offsetof_1 (tree expr, tree stop_ref) |
af28855b | 8397 | { |
8398 | enum tree_code code = PLUS_EXPR; | |
8399 | tree base, off, t; | |
8400 | ||
d897f7c2 | 8401 | if (expr == stop_ref && TREE_CODE (expr) != ERROR_MARK) |
8402 | return size_zero_node; | |
8403 | ||
af28855b | 8404 | switch (TREE_CODE (expr)) |
8405 | { | |
8406 | case ERROR_MARK: | |
8407 | return expr; | |
8408 | ||
6b11d2e3 | 8409 | case VAR_DECL: |
8410 | error ("cannot apply %<offsetof%> to static data member %qD", expr); | |
8411 | return error_mark_node; | |
8412 | ||
d897f7c2 | 8413 | case CALL_EXPR: |
cf1a89a3 | 8414 | case TARGET_EXPR: |
d897f7c2 | 8415 | error ("cannot apply %<offsetof%> when %<operator[]%> is overloaded"); |
8416 | return error_mark_node; | |
8417 | ||
8418 | case INTEGER_CST: | |
8419 | gcc_assert (integer_zerop (expr)); | |
af28855b | 8420 | return size_zero_node; |
8421 | ||
d897f7c2 | 8422 | case NOP_EXPR: |
8423 | case INDIRECT_REF: | |
8424 | base = fold_offsetof_1 (TREE_OPERAND (expr, 0), stop_ref); | |
8425 | gcc_assert (base == error_mark_node || base == size_zero_node); | |
8426 | return base; | |
8427 | ||
af28855b | 8428 | case COMPONENT_REF: |
d897f7c2 | 8429 | base = fold_offsetof_1 (TREE_OPERAND (expr, 0), stop_ref); |
af28855b | 8430 | if (base == error_mark_node) |
8431 | return base; | |
8432 | ||
8433 | t = TREE_OPERAND (expr, 1); | |
8434 | if (DECL_C_BIT_FIELD (t)) | |
8435 | { | |
8436 | error ("attempt to take address of bit-field structure " | |
782858b8 | 8437 | "member %qD", t); |
af28855b | 8438 | return error_mark_node; |
8439 | } | |
8440 | off = size_binop (PLUS_EXPR, DECL_FIELD_OFFSET (t), | |
8441 | size_int (tree_low_cst (DECL_FIELD_BIT_OFFSET (t), 1) | |
8442 | / BITS_PER_UNIT)); | |
8443 | break; | |
8444 | ||
8445 | case ARRAY_REF: | |
d897f7c2 | 8446 | base = fold_offsetof_1 (TREE_OPERAND (expr, 0), stop_ref); |
af28855b | 8447 | if (base == error_mark_node) |
8448 | return base; | |
8449 | ||
8450 | t = TREE_OPERAND (expr, 1); | |
8451 | if (TREE_CODE (t) == INTEGER_CST && tree_int_cst_sgn (t) < 0) | |
8452 | { | |
8453 | code = MINUS_EXPR; | |
49d00087 | 8454 | t = fold_build1 (NEGATE_EXPR, TREE_TYPE (t), t); |
af28855b | 8455 | } |
8456 | t = convert (sizetype, t); | |
8457 | off = size_binop (MULT_EXPR, TYPE_SIZE_UNIT (TREE_TYPE (expr)), t); | |
8458 | break; | |
8459 | ||
ede90cc2 | 8460 | case COMPOUND_EXPR: |
8461 | /* Handle static members of volatile structs. */ | |
8462 | t = TREE_OPERAND (expr, 1); | |
8463 | gcc_assert (TREE_CODE (t) == VAR_DECL); | |
8464 | return fold_offsetof_1 (t, stop_ref); | |
8465 | ||
af28855b | 8466 | default: |
231bd014 | 8467 | gcc_unreachable (); |
af28855b | 8468 | } |
8469 | ||
8470 | return size_binop (code, base, off); | |
8471 | } | |
8472 | ||
8473 | tree | |
d897f7c2 | 8474 | fold_offsetof (tree expr, tree stop_ref) |
af28855b | 8475 | { |
8476 | /* Convert back from the internal sizetype to size_t. */ | |
d897f7c2 | 8477 | return convert (size_type_node, fold_offsetof_1 (expr, stop_ref)); |
af28855b | 8478 | } |
8479 | ||
e35976b1 | 8480 | /* Print an error message for an invalid lvalue. USE says |
ab6bb714 | 8481 | how the lvalue is being used and so selects the error message. */ |
8482 | ||
e35976b1 | 8483 | void |
8484 | lvalue_error (enum lvalue_use use) | |
ab6bb714 | 8485 | { |
e35976b1 | 8486 | switch (use) |
ab6bb714 | 8487 | { |
e35976b1 | 8488 | case lv_assign: |
82d76a54 | 8489 | error ("lvalue required as left operand of assignment"); |
e35976b1 | 8490 | break; |
8491 | case lv_increment: | |
82d76a54 | 8492 | error ("lvalue required as increment operand"); |
e35976b1 | 8493 | break; |
8494 | case lv_decrement: | |
82d76a54 | 8495 | error ("lvalue required as decrement operand"); |
e35976b1 | 8496 | break; |
8497 | case lv_addressof: | |
82d76a54 | 8498 | error ("lvalue required as unary %<&%> operand"); |
e35976b1 | 8499 | break; |
8500 | case lv_asm: | |
82d76a54 | 8501 | error ("lvalue required in asm statement"); |
e35976b1 | 8502 | break; |
8503 | default: | |
8504 | gcc_unreachable (); | |
ab6bb714 | 8505 | } |
ab6bb714 | 8506 | } |
c271bdb2 | 8507 | \f |
8508 | /* *PTYPE is an incomplete array. Complete it with a domain based on | |
8509 | INITIAL_VALUE. If INITIAL_VALUE is not present, use 1 if DO_DEFAULT | |
8510 | is true. Return 0 if successful, 1 if INITIAL_VALUE can't be deciphered, | |
8511 | 2 if INITIAL_VALUE was NULL, and 3 if INITIAL_VALUE was empty. */ | |
8512 | ||
8513 | int | |
8514 | complete_array_type (tree *ptype, tree initial_value, bool do_default) | |
8515 | { | |
8516 | tree maxindex, type, main_type, elt, unqual_elt; | |
8517 | int failure = 0, quals; | |
6753bca0 | 8518 | hashval_t hashcode = 0; |
c271bdb2 | 8519 | |
8520 | maxindex = size_zero_node; | |
8521 | if (initial_value) | |
8522 | { | |
8523 | if (TREE_CODE (initial_value) == STRING_CST) | |
8524 | { | |
8525 | int eltsize | |
8526 | = int_size_in_bytes (TREE_TYPE (TREE_TYPE (initial_value))); | |
8527 | maxindex = size_int (TREE_STRING_LENGTH (initial_value)/eltsize - 1); | |
8528 | } | |
8529 | else if (TREE_CODE (initial_value) == CONSTRUCTOR) | |
8530 | { | |
c75b4594 | 8531 | VEC(constructor_elt,gc) *v = CONSTRUCTOR_ELTS (initial_value); |
c271bdb2 | 8532 | |
c75b4594 | 8533 | if (VEC_empty (constructor_elt, v)) |
c271bdb2 | 8534 | { |
8535 | if (pedantic) | |
8536 | failure = 3; | |
8537 | maxindex = integer_minus_one_node; | |
8538 | } | |
8539 | else | |
8540 | { | |
8541 | tree curindex; | |
c75b4594 | 8542 | unsigned HOST_WIDE_INT cnt; |
8543 | constructor_elt *ce; | |
cee43f7e | 8544 | bool fold_p = false; |
c271bdb2 | 8545 | |
c75b4594 | 8546 | if (VEC_index (constructor_elt, v, 0)->index) |
8547 | maxindex = fold_convert (sizetype, | |
8548 | VEC_index (constructor_elt, | |
8549 | v, 0)->index); | |
c271bdb2 | 8550 | curindex = maxindex; |
8551 | ||
c75b4594 | 8552 | for (cnt = 1; |
8553 | VEC_iterate (constructor_elt, v, cnt, ce); | |
8554 | cnt++) | |
c271bdb2 | 8555 | { |
cee43f7e | 8556 | bool curfold_p = false; |
c75b4594 | 8557 | if (ce->index) |
cee43f7e | 8558 | curindex = ce->index, curfold_p = true; |
c271bdb2 | 8559 | else |
cee43f7e | 8560 | { |
8561 | if (fold_p) | |
8562 | curindex = fold_convert (sizetype, curindex); | |
8563 | curindex = size_binop (PLUS_EXPR, curindex, size_one_node); | |
8564 | } | |
c271bdb2 | 8565 | if (tree_int_cst_lt (maxindex, curindex)) |
cee43f7e | 8566 | maxindex = curindex, fold_p = curfold_p; |
c271bdb2 | 8567 | } |
cee43f7e | 8568 | if (fold_p) |
8569 | maxindex = fold_convert (sizetype, maxindex); | |
c271bdb2 | 8570 | } |
8571 | } | |
8572 | else | |
8573 | { | |
8574 | /* Make an error message unless that happened already. */ | |
8575 | if (initial_value != error_mark_node) | |
8576 | failure = 1; | |
8577 | } | |
8578 | } | |
8579 | else | |
8580 | { | |
8581 | failure = 2; | |
8582 | if (!do_default) | |
8583 | return failure; | |
8584 | } | |
8585 | ||
8586 | type = *ptype; | |
8587 | elt = TREE_TYPE (type); | |
8588 | quals = TYPE_QUALS (strip_array_types (elt)); | |
8589 | if (quals == 0) | |
8590 | unqual_elt = elt; | |
8591 | else | |
8592 | unqual_elt = c_build_qualified_type (elt, TYPE_UNQUALIFIED); | |
8593 | ||
8594 | /* Using build_distinct_type_copy and modifying things afterward instead | |
8595 | of using build_array_type to create a new type preserves all of the | |
8596 | TYPE_LANG_FLAG_? bits that the front end may have set. */ | |
8597 | main_type = build_distinct_type_copy (TYPE_MAIN_VARIANT (type)); | |
8598 | TREE_TYPE (main_type) = unqual_elt; | |
8599 | TYPE_DOMAIN (main_type) = build_index_type (maxindex); | |
8600 | layout_type (main_type); | |
8601 | ||
6753bca0 | 8602 | /* Make sure we have the canonical MAIN_TYPE. */ |
8603 | hashcode = iterative_hash_object (TYPE_HASH (unqual_elt), hashcode); | |
8604 | hashcode = iterative_hash_object (TYPE_HASH (TYPE_DOMAIN (main_type)), | |
8605 | hashcode); | |
8606 | main_type = type_hash_canon (hashcode, main_type); | |
8607 | ||
796735dc | 8608 | /* Fix the canonical type. */ |
8609 | if (TYPE_STRUCTURAL_EQUALITY_P (TREE_TYPE (main_type)) | |
8610 | || TYPE_STRUCTURAL_EQUALITY_P (TYPE_DOMAIN (main_type))) | |
8611 | SET_TYPE_STRUCTURAL_EQUALITY (main_type); | |
8612 | else if (TYPE_CANONICAL (TREE_TYPE (main_type)) != TREE_TYPE (main_type) | |
8613 | || (TYPE_CANONICAL (TYPE_DOMAIN (main_type)) | |
8614 | != TYPE_DOMAIN (main_type))) | |
8615 | TYPE_CANONICAL (main_type) | |
8616 | = build_array_type (TYPE_CANONICAL (TREE_TYPE (main_type)), | |
8617 | TYPE_CANONICAL (TYPE_DOMAIN (main_type))); | |
8618 | else | |
8619 | TYPE_CANONICAL (main_type) = main_type; | |
8620 | ||
c271bdb2 | 8621 | if (quals == 0) |
8622 | type = main_type; | |
8623 | else | |
8624 | type = c_build_qualified_type (main_type, quals); | |
8625 | ||
4f5b8f2a | 8626 | if (COMPLETE_TYPE_P (type) |
8627 | && TREE_CODE (TYPE_SIZE_UNIT (type)) == INTEGER_CST | |
8628 | && TREE_OVERFLOW (TYPE_SIZE_UNIT (type))) | |
8629 | { | |
8630 | error ("size of array is too large"); | |
8631 | /* If we proceed with the array type as it is, we'll eventually | |
8632 | crash in tree_low_cst(). */ | |
8633 | type = error_mark_node; | |
8634 | } | |
8635 | ||
c271bdb2 | 8636 | *ptype = type; |
8637 | return failure; | |
8638 | } | |
ab6bb714 | 8639 | |
b6a5fc45 | 8640 | \f |
8641 | /* Used to help initialize the builtin-types.def table. When a type of | |
8642 | the correct size doesn't exist, use error_mark_node instead of NULL. | |
8643 | The later results in segfaults even when a decl using the type doesn't | |
8644 | get invoked. */ | |
8645 | ||
8646 | tree | |
8647 | builtin_type_for_size (int size, bool unsignedp) | |
8648 | { | |
8649 | tree type = lang_hooks.types.type_for_size (size, unsignedp); | |
8650 | return type ? type : error_mark_node; | |
8651 | } | |
8652 | ||
8653 | /* A helper function for resolve_overloaded_builtin in resolving the | |
8654 | overloaded __sync_ builtins. Returns a positive power of 2 if the | |
8655 | first operand of PARAMS is a pointer to a supported data type. | |
8656 | Returns 0 if an error is encountered. */ | |
8657 | ||
8658 | static int | |
b9c74b4d | 8659 | sync_resolve_size (tree function, VEC(tree,gc) *params) |
b6a5fc45 | 8660 | { |
8661 | tree type; | |
8662 | int size; | |
8663 | ||
b9c74b4d | 8664 | if (VEC_empty (tree, params)) |
b6a5fc45 | 8665 | { |
8666 | error ("too few arguments to function %qE", function); | |
8667 | return 0; | |
8668 | } | |
8669 | ||
b9c74b4d | 8670 | type = TREE_TYPE (VEC_index (tree, params, 0)); |
b6a5fc45 | 8671 | if (TREE_CODE (type) != POINTER_TYPE) |
8672 | goto incompatible; | |
8673 | ||
8674 | type = TREE_TYPE (type); | |
8675 | if (!INTEGRAL_TYPE_P (type) && !POINTER_TYPE_P (type)) | |
8676 | goto incompatible; | |
8677 | ||
8678 | size = tree_low_cst (TYPE_SIZE_UNIT (type), 1); | |
27213ba3 | 8679 | if (size == 1 || size == 2 || size == 4 || size == 8 || size == 16) |
b6a5fc45 | 8680 | return size; |
8681 | ||
8682 | incompatible: | |
8683 | error ("incompatible type for argument %d of %qE", 1, function); | |
8684 | return 0; | |
8685 | } | |
8686 | ||
a0c938f0 | 8687 | /* A helper function for resolve_overloaded_builtin. Adds casts to |
b6a5fc45 | 8688 | PARAMS to make arguments match up with those of FUNCTION. Drops |
8689 | the variadic arguments at the end. Returns false if some error | |
8690 | was encountered; true on success. */ | |
8691 | ||
8692 | static bool | |
b9c74b4d | 8693 | sync_resolve_params (tree orig_function, tree function, VEC(tree, gc) *params) |
b6a5fc45 | 8694 | { |
8695 | tree arg_types = TYPE_ARG_TYPES (TREE_TYPE (function)); | |
8696 | tree ptype; | |
8697 | int number; | |
b9c74b4d | 8698 | unsigned int parmnum; |
b6a5fc45 | 8699 | |
8700 | /* We've declared the implementation functions to use "volatile void *" | |
8701 | as the pointer parameter, so we shouldn't get any complaints from the | |
8702 | call to check_function_arguments what ever type the user used. */ | |
8703 | arg_types = TREE_CHAIN (arg_types); | |
b9c74b4d | 8704 | ptype = TREE_TYPE (TREE_TYPE (VEC_index (tree, params, 0))); |
b6a5fc45 | 8705 | number = 2; |
8706 | ||
8707 | /* For the rest of the values, we need to cast these to FTYPE, so that we | |
8708 | don't get warnings for passing pointer types, etc. */ | |
b9c74b4d | 8709 | parmnum = 0; |
b6a5fc45 | 8710 | while (arg_types != void_list_node) |
8711 | { | |
8712 | tree val; | |
8713 | ||
b9c74b4d | 8714 | ++parmnum; |
8715 | if (VEC_length (tree, params) <= parmnum) | |
b6a5fc45 | 8716 | { |
8717 | error ("too few arguments to function %qE", orig_function); | |
8718 | return false; | |
8719 | } | |
8720 | ||
8721 | /* ??? Ideally for the first conversion we'd use convert_for_assignment | |
8722 | so that we get warnings for anything that doesn't match the pointer | |
8723 | type. This isn't portable across the C and C++ front ends atm. */ | |
b9c74b4d | 8724 | val = VEC_index (tree, params, parmnum); |
b6a5fc45 | 8725 | val = convert (ptype, val); |
8726 | val = convert (TREE_VALUE (arg_types), val); | |
b9c74b4d | 8727 | VEC_replace (tree, params, parmnum, val); |
b6a5fc45 | 8728 | |
8729 | arg_types = TREE_CHAIN (arg_types); | |
8730 | number++; | |
8731 | } | |
8732 | ||
8733 | /* The definition of these primitives is variadic, with the remaining | |
8734 | being "an optional list of variables protected by the memory barrier". | |
8735 | No clue what that's supposed to mean, precisely, but we consider all | |
8736 | call-clobbered variables to be protected so we're safe. */ | |
b9c74b4d | 8737 | VEC_truncate (tree, params, parmnum + 1); |
b6a5fc45 | 8738 | |
8739 | return true; | |
8740 | } | |
8741 | ||
a0c938f0 | 8742 | /* A helper function for resolve_overloaded_builtin. Adds a cast to |
b6a5fc45 | 8743 | RESULT to make it match the type of the first pointer argument in |
8744 | PARAMS. */ | |
8745 | ||
8746 | static tree | |
b9c74b4d | 8747 | sync_resolve_return (tree first_param, tree result) |
b6a5fc45 | 8748 | { |
b9c74b4d | 8749 | tree ptype = TREE_TYPE (TREE_TYPE (first_param)); |
10080eac | 8750 | ptype = TYPE_MAIN_VARIANT (ptype); |
b6a5fc45 | 8751 | return convert (ptype, result); |
8752 | } | |
8753 | ||
8754 | /* Some builtin functions are placeholders for other expressions. This | |
8755 | function should be called immediately after parsing the call expression | |
8756 | before surrounding code has committed to the type of the expression. | |
8757 | ||
8758 | FUNCTION is the DECL that has been invoked; it is known to be a builtin. | |
8759 | PARAMS is the argument list for the call. The return value is non-null | |
8760 | when expansion is complete, and null if normal processing should | |
8761 | continue. */ | |
8762 | ||
8763 | tree | |
b9c74b4d | 8764 | resolve_overloaded_builtin (tree function, VEC(tree,gc) *params) |
b6a5fc45 | 8765 | { |
8766 | enum built_in_function orig_code = DECL_FUNCTION_CODE (function); | |
65441f6f | 8767 | switch (DECL_BUILT_IN_CLASS (function)) |
8768 | { | |
8769 | case BUILT_IN_NORMAL: | |
8770 | break; | |
8771 | case BUILT_IN_MD: | |
8772 | if (targetm.resolve_overloaded_builtin) | |
a0c938f0 | 8773 | return targetm.resolve_overloaded_builtin (function, params); |
65441f6f | 8774 | else |
a0c938f0 | 8775 | return NULL_TREE; |
65441f6f | 8776 | default: |
8777 | return NULL_TREE; | |
8778 | } | |
a0c938f0 | 8779 | |
65441f6f | 8780 | /* Handle BUILT_IN_NORMAL here. */ |
b6a5fc45 | 8781 | switch (orig_code) |
8782 | { | |
8783 | case BUILT_IN_FETCH_AND_ADD_N: | |
8784 | case BUILT_IN_FETCH_AND_SUB_N: | |
8785 | case BUILT_IN_FETCH_AND_OR_N: | |
8786 | case BUILT_IN_FETCH_AND_AND_N: | |
8787 | case BUILT_IN_FETCH_AND_XOR_N: | |
8788 | case BUILT_IN_FETCH_AND_NAND_N: | |
8789 | case BUILT_IN_ADD_AND_FETCH_N: | |
8790 | case BUILT_IN_SUB_AND_FETCH_N: | |
8791 | case BUILT_IN_OR_AND_FETCH_N: | |
8792 | case BUILT_IN_AND_AND_FETCH_N: | |
8793 | case BUILT_IN_XOR_AND_FETCH_N: | |
8794 | case BUILT_IN_NAND_AND_FETCH_N: | |
8795 | case BUILT_IN_BOOL_COMPARE_AND_SWAP_N: | |
8796 | case BUILT_IN_VAL_COMPARE_AND_SWAP_N: | |
8797 | case BUILT_IN_LOCK_TEST_AND_SET_N: | |
8798 | case BUILT_IN_LOCK_RELEASE_N: | |
8799 | { | |
8800 | int n = sync_resolve_size (function, params); | |
b9c74b4d | 8801 | tree new_function, first_param, result; |
b6a5fc45 | 8802 | |
8803 | if (n == 0) | |
8804 | return error_mark_node; | |
8805 | ||
8806 | new_function = built_in_decls[orig_code + exact_log2 (n) + 1]; | |
8807 | if (!sync_resolve_params (function, new_function, params)) | |
8808 | return error_mark_node; | |
8809 | ||
b9c74b4d | 8810 | first_param = VEC_index (tree, params, 0); |
8811 | result = build_function_call_vec (new_function, params, NULL); | |
b6a5fc45 | 8812 | if (orig_code != BUILT_IN_BOOL_COMPARE_AND_SWAP_N |
8813 | && orig_code != BUILT_IN_LOCK_RELEASE_N) | |
b9c74b4d | 8814 | result = sync_resolve_return (first_param, result); |
b6a5fc45 | 8815 | |
8816 | return result; | |
8817 | } | |
8818 | ||
8819 | default: | |
65441f6f | 8820 | return NULL_TREE; |
b6a5fc45 | 8821 | } |
8822 | } | |
8823 | ||
491255f5 | 8824 | /* Ignoring their sign, return true if two scalar types are the same. */ |
8825 | bool | |
8826 | same_scalar_type_ignoring_signedness (tree t1, tree t2) | |
8827 | { | |
8828 | enum tree_code c1 = TREE_CODE (t1), c2 = TREE_CODE (t2); | |
8829 | ||
9421ebb9 | 8830 | gcc_assert ((c1 == INTEGER_TYPE || c1 == REAL_TYPE || c1 == FIXED_POINT_TYPE) |
8831 | && (c2 == INTEGER_TYPE || c2 == REAL_TYPE | |
8832 | || c2 == FIXED_POINT_TYPE)); | |
491255f5 | 8833 | |
8834 | /* Equality works here because c_common_signed_type uses | |
8835 | TYPE_MAIN_VARIANT. */ | |
11773141 | 8836 | return c_common_signed_type (t1) |
8837 | == c_common_signed_type (t2); | |
491255f5 | 8838 | } |
8839 | ||
be7350e7 | 8840 | /* Check for missing format attributes on function pointers. LTYPE is |
8841 | the new type or left-hand side type. RTYPE is the old type or | |
8842 | right-hand side type. Returns TRUE if LTYPE is missing the desired | |
8843 | attribute. */ | |
8844 | ||
8845 | bool | |
8846 | check_missing_format_attribute (tree ltype, tree rtype) | |
8847 | { | |
8848 | tree const ttr = TREE_TYPE (rtype), ttl = TREE_TYPE (ltype); | |
8849 | tree ra; | |
8850 | ||
8851 | for (ra = TYPE_ATTRIBUTES (ttr); ra; ra = TREE_CHAIN (ra)) | |
8852 | if (is_attribute_p ("format", TREE_PURPOSE (ra))) | |
8853 | break; | |
8854 | if (ra) | |
8855 | { | |
8856 | tree la; | |
8857 | for (la = TYPE_ATTRIBUTES (ttl); la; la = TREE_CHAIN (la)) | |
8858 | if (is_attribute_p ("format", TREE_PURPOSE (la))) | |
8859 | break; | |
8860 | return !la; | |
8861 | } | |
8862 | else | |
8863 | return false; | |
8864 | } | |
8865 | ||
2840aae4 | 8866 | /* Subscripting with type char is likely to lose on a machine where |
8867 | chars are signed. So warn on any machine, but optionally. Don't | |
8868 | warn for unsigned char since that type is safe. Don't warn for | |
8869 | signed char because anyone who uses that must have done so | |
8870 | deliberately. Furthermore, we reduce the false positive load by | |
8871 | warning only for non-constant value of type char. */ | |
8872 | ||
8873 | void | |
8874 | warn_array_subscript_with_type_char (tree index) | |
8875 | { | |
8876 | if (TYPE_MAIN_VARIANT (TREE_TYPE (index)) == char_type_node | |
8877 | && TREE_CODE (index) != INTEGER_CST) | |
8878 | warning (OPT_Wchar_subscripts, "array subscript has type %<char%>"); | |
8879 | } | |
8880 | ||
e534436e | 8881 | /* Implement -Wparentheses for the unexpected C precedence rules, to |
8882 | cover cases like x + y << z which readers are likely to | |
8883 | misinterpret. We have seen an expression in which CODE is a binary | |
82012ffe | 8884 | operator used to combine expressions ARG_LEFT and ARG_RIGHT, which |
8885 | before folding had CODE_LEFT and CODE_RIGHT. CODE_LEFT and | |
8886 | CODE_RIGHT may be ERROR_MARK, which means that that side of the | |
8887 | expression was not formed using a binary or unary operator, or it | |
8888 | was enclosed in parentheses. */ | |
e534436e | 8889 | |
8890 | void | |
82012ffe | 8891 | warn_about_parentheses (enum tree_code code, |
269f7979 | 8892 | enum tree_code code_left, tree arg_left, |
82012ffe | 8893 | enum tree_code code_right, tree arg_right) |
e534436e | 8894 | { |
8895 | if (!warn_parentheses) | |
8896 | return; | |
8897 | ||
82012ffe | 8898 | /* This macro tests that the expression ARG with original tree code |
8899 | CODE appears to be a boolean expression. or the result of folding a | |
8900 | boolean expression. */ | |
8901 | #define APPEARS_TO_BE_BOOLEAN_EXPR_P(CODE, ARG) \ | |
8902 | (truth_value_p (TREE_CODE (ARG)) \ | |
8903 | || TREE_CODE (TREE_TYPE (ARG)) == BOOLEAN_TYPE \ | |
8904 | /* Folding may create 0 or 1 integers from other expressions. */ \ | |
8905 | || ((CODE) != INTEGER_CST \ | |
8906 | && (integer_onep (ARG) || integer_zerop (ARG)))) | |
8907 | ||
8908 | switch (code) | |
e534436e | 8909 | { |
82012ffe | 8910 | case LSHIFT_EXPR: |
8911 | if (code_left == PLUS_EXPR || code_right == PLUS_EXPR) | |
e534436e | 8912 | warning (OPT_Wparentheses, |
82012ffe | 8913 | "suggest parentheses around %<+%> inside %<<<%>"); |
8914 | else if (code_left == MINUS_EXPR || code_right == MINUS_EXPR) | |
8915 | warning (OPT_Wparentheses, | |
8916 | "suggest parentheses around %<-%> inside %<<<%>"); | |
8917 | return; | |
e534436e | 8918 | |
82012ffe | 8919 | case RSHIFT_EXPR: |
8920 | if (code_left == PLUS_EXPR || code_right == PLUS_EXPR) | |
e534436e | 8921 | warning (OPT_Wparentheses, |
82012ffe | 8922 | "suggest parentheses around %<+%> inside %<>>%>"); |
8923 | else if (code_left == MINUS_EXPR || code_right == MINUS_EXPR) | |
8924 | warning (OPT_Wparentheses, | |
8925 | "suggest parentheses around %<-%> inside %<>>%>"); | |
8926 | return; | |
e534436e | 8927 | |
82012ffe | 8928 | case TRUTH_ORIF_EXPR: |
8929 | if (code_left == TRUTH_ANDIF_EXPR || code_right == TRUTH_ANDIF_EXPR) | |
8930 | warning (OPT_Wparentheses, | |
8931 | "suggest parentheses around %<&&%> within %<||%>"); | |
8932 | return; | |
8933 | ||
8934 | case BIT_IOR_EXPR: | |
e534436e | 8935 | if (code_left == BIT_AND_EXPR || code_left == BIT_XOR_EXPR |
8936 | || code_left == PLUS_EXPR || code_left == MINUS_EXPR | |
8937 | || code_right == BIT_AND_EXPR || code_right == BIT_XOR_EXPR | |
8938 | || code_right == PLUS_EXPR || code_right == MINUS_EXPR) | |
8939 | warning (OPT_Wparentheses, | |
82012ffe | 8940 | "suggest parentheses around arithmetic in operand of %<|%>"); |
e534436e | 8941 | /* Check cases like x|y==z */ |
82012ffe | 8942 | else if (TREE_CODE_CLASS (code_left) == tcc_comparison |
8943 | || TREE_CODE_CLASS (code_right) == tcc_comparison) | |
e534436e | 8944 | warning (OPT_Wparentheses, |
82012ffe | 8945 | "suggest parentheses around comparison in operand of %<|%>"); |
8946 | /* Check cases like !x | y */ | |
8947 | else if (code_left == TRUTH_NOT_EXPR | |
8948 | && !APPEARS_TO_BE_BOOLEAN_EXPR_P (code_right, arg_right)) | |
96bda40f | 8949 | warning (OPT_Wparentheses, "suggest parentheses around operand of " |
82012ffe | 8950 | "%<!%> or change %<|%> to %<||%> or %<!%> to %<~%>"); |
8951 | return; | |
e534436e | 8952 | |
82012ffe | 8953 | case BIT_XOR_EXPR: |
e534436e | 8954 | if (code_left == BIT_AND_EXPR |
8955 | || code_left == PLUS_EXPR || code_left == MINUS_EXPR | |
8956 | || code_right == BIT_AND_EXPR | |
8957 | || code_right == PLUS_EXPR || code_right == MINUS_EXPR) | |
8958 | warning (OPT_Wparentheses, | |
82012ffe | 8959 | "suggest parentheses around arithmetic in operand of %<^%>"); |
e534436e | 8960 | /* Check cases like x^y==z */ |
82012ffe | 8961 | else if (TREE_CODE_CLASS (code_left) == tcc_comparison |
8962 | || TREE_CODE_CLASS (code_right) == tcc_comparison) | |
e534436e | 8963 | warning (OPT_Wparentheses, |
82012ffe | 8964 | "suggest parentheses around comparison in operand of %<^%>"); |
8965 | return; | |
e534436e | 8966 | |
82012ffe | 8967 | case BIT_AND_EXPR: |
8968 | if (code_left == PLUS_EXPR || code_right == PLUS_EXPR) | |
8969 | warning (OPT_Wparentheses, | |
8970 | "suggest parentheses around %<+%> in operand of %<&%>"); | |
8971 | else if (code_left == MINUS_EXPR || code_right == MINUS_EXPR) | |
e534436e | 8972 | warning (OPT_Wparentheses, |
82012ffe | 8973 | "suggest parentheses around %<-%> in operand of %<&%>"); |
e534436e | 8974 | /* Check cases like x&y==z */ |
82012ffe | 8975 | else if (TREE_CODE_CLASS (code_left) == tcc_comparison |
8976 | || TREE_CODE_CLASS (code_right) == tcc_comparison) | |
e534436e | 8977 | warning (OPT_Wparentheses, |
82012ffe | 8978 | "suggest parentheses around comparison in operand of %<&%>"); |
8979 | /* Check cases like !x & y */ | |
8980 | else if (code_left == TRUTH_NOT_EXPR | |
8981 | && !APPEARS_TO_BE_BOOLEAN_EXPR_P (code_right, arg_right)) | |
96bda40f | 8982 | warning (OPT_Wparentheses, "suggest parentheses around operand of " |
82012ffe | 8983 | "%<!%> or change %<&%> to %<&&%> or %<!%> to %<~%>"); |
8984 | return; | |
e534436e | 8985 | |
82012ffe | 8986 | case EQ_EXPR: |
6ce0c450 | 8987 | if (TREE_CODE_CLASS (code_left) == tcc_comparison |
8988 | || TREE_CODE_CLASS (code_right) == tcc_comparison) | |
8989 | warning (OPT_Wparentheses, | |
82012ffe | 8990 | "suggest parentheses around comparison in operand of %<==%>"); |
8991 | return; | |
8992 | case NE_EXPR: | |
8993 | if (TREE_CODE_CLASS (code_left) == tcc_comparison | |
8994 | || TREE_CODE_CLASS (code_right) == tcc_comparison) | |
8995 | warning (OPT_Wparentheses, | |
8996 | "suggest parentheses around comparison in operand of %<!=%>"); | |
8997 | return; | |
8998 | ||
8999 | default: | |
9000 | if (TREE_CODE_CLASS (code) == tcc_comparison | |
9001 | && ((TREE_CODE_CLASS (code_left) == tcc_comparison | |
269f7979 | 9002 | && code_left != NE_EXPR && code_left != EQ_EXPR |
9003 | && INTEGRAL_TYPE_P (TREE_TYPE (arg_left))) | |
82012ffe | 9004 | || (TREE_CODE_CLASS (code_right) == tcc_comparison |
269f7979 | 9005 | && code_right != NE_EXPR && code_right != EQ_EXPR |
9006 | && INTEGRAL_TYPE_P (TREE_TYPE (arg_right))))) | |
82012ffe | 9007 | warning (OPT_Wparentheses, "comparisons like %<X<=Y<=Z%> do not " |
6ce0c450 | 9008 | "have their mathematical meaning"); |
82012ffe | 9009 | return; |
6ce0c450 | 9010 | } |
82012ffe | 9011 | #undef NOT_A_BOOLEAN_EXPR_P |
e534436e | 9012 | } |
9013 | ||
92fccaaa | 9014 | /* If LABEL (a LABEL_DECL) has not been used, issue a warning. */ |
9015 | ||
9016 | void | |
9017 | warn_for_unused_label (tree label) | |
9018 | { | |
9019 | if (!TREE_USED (label)) | |
9020 | { | |
9021 | if (DECL_INITIAL (label)) | |
9022 | warning (OPT_Wunused_label, "label %q+D defined but not used", label); | |
9023 | else | |
9024 | warning (OPT_Wunused_label, "label %q+D declared but not defined", label); | |
9025 | } | |
9026 | } | |
2840aae4 | 9027 | |
b9fc964a | 9028 | #ifndef TARGET_HAS_TARGETCM |
9029 | struct gcc_targetcm targetcm = TARGETCM_INITIALIZER; | |
9030 | #endif | |
9031 | ||
b6889cb0 | 9032 | /* Warn for division by zero according to the value of DIVISOR. LOC |
9033 | is the location of the division operator. */ | |
f092582b | 9034 | |
9035 | void | |
b6889cb0 | 9036 | warn_for_div_by_zero (location_t loc, tree divisor) |
f092582b | 9037 | { |
9421ebb9 | 9038 | /* If DIVISOR is zero, and has integral or fixed-point type, issue a warning |
9039 | about division by zero. Do not issue a warning if DIVISOR has a | |
f092582b | 9040 | floating-point type, since we consider 0.0/0.0 a valid way of |
9041 | generating a NaN. */ | |
9421ebb9 | 9042 | if (skip_evaluation == 0 |
9043 | && (integer_zerop (divisor) || fixed_zerop (divisor))) | |
b6889cb0 | 9044 | warning_at (loc, OPT_Wdiv_by_zero, "division by zero"); |
f092582b | 9045 | } |
9046 | ||
13869a99 | 9047 | /* Subroutine of build_binary_op. Give warnings for comparisons |
9048 | between signed and unsigned quantities that may fail. Do the | |
9049 | checking based on the original operand trees ORIG_OP0 and ORIG_OP1, | |
9050 | so that casts will be considered, but default promotions won't | |
8e70fb09 | 9051 | be. |
9052 | ||
9053 | LOCATION is the location of the comparison operator. | |
13869a99 | 9054 | |
9055 | The arguments of this function map directly to local variables | |
9056 | of build_binary_op. */ | |
9057 | ||
9058 | void | |
8e70fb09 | 9059 | warn_for_sign_compare (location_t location, |
9060 | tree orig_op0, tree orig_op1, | |
13869a99 | 9061 | tree op0, tree op1, |
9062 | tree result_type, enum tree_code resultcode) | |
9063 | { | |
9064 | int op0_signed = !TYPE_UNSIGNED (TREE_TYPE (orig_op0)); | |
9065 | int op1_signed = !TYPE_UNSIGNED (TREE_TYPE (orig_op1)); | |
9066 | int unsignedp0, unsignedp1; | |
9067 | ||
9068 | /* In C++, check for comparison of different enum types. */ | |
9069 | if (c_dialect_cxx() | |
9070 | && TREE_CODE (TREE_TYPE (orig_op0)) == ENUMERAL_TYPE | |
9071 | && TREE_CODE (TREE_TYPE (orig_op1)) == ENUMERAL_TYPE | |
9072 | && TYPE_MAIN_VARIANT (TREE_TYPE (orig_op0)) | |
895b662f | 9073 | != TYPE_MAIN_VARIANT (TREE_TYPE (orig_op1))) |
13869a99 | 9074 | { |
8e70fb09 | 9075 | warning_at (location, |
9076 | OPT_Wsign_compare, "comparison between types %qT and %qT", | |
9077 | TREE_TYPE (orig_op0), TREE_TYPE (orig_op1)); | |
13869a99 | 9078 | } |
9079 | ||
9080 | /* Do not warn if the comparison is being done in a signed type, | |
9081 | since the signed type will only be chosen if it can represent | |
9082 | all the values of the unsigned type. */ | |
9083 | if (!TYPE_UNSIGNED (result_type)) | |
9084 | /* OK */; | |
9085 | /* Do not warn if both operands are unsigned. */ | |
9086 | else if (op0_signed == op1_signed) | |
9087 | /* OK */; | |
9088 | else | |
9089 | { | |
895b662f | 9090 | tree sop, uop, base_type; |
13869a99 | 9091 | bool ovf; |
895b662f | 9092 | |
13869a99 | 9093 | if (op0_signed) |
9094 | sop = orig_op0, uop = orig_op1; | |
9095 | else | |
9096 | sop = orig_op1, uop = orig_op0; | |
9097 | ||
9098 | STRIP_TYPE_NOPS (sop); | |
9099 | STRIP_TYPE_NOPS (uop); | |
895b662f | 9100 | base_type = (TREE_CODE (result_type) == COMPLEX_TYPE |
9101 | ? TREE_TYPE (result_type) : result_type); | |
13869a99 | 9102 | |
9103 | /* Do not warn if the signed quantity is an unsuffixed integer | |
9104 | literal (or some static constant expression involving such | |
9105 | literals or a conditional expression involving such literals) | |
9106 | and it is non-negative. */ | |
9107 | if (tree_expr_nonnegative_warnv_p (sop, &ovf)) | |
9108 | /* OK */; | |
9109 | /* Do not warn if the comparison is an equality operation, the | |
9110 | unsigned quantity is an integral constant, and it would fit | |
9111 | in the result if the result were signed. */ | |
9112 | else if (TREE_CODE (uop) == INTEGER_CST | |
9113 | && (resultcode == EQ_EXPR || resultcode == NE_EXPR) | |
895b662f | 9114 | && int_fits_type_p (uop, c_common_signed_type (base_type))) |
13869a99 | 9115 | /* OK */; |
9116 | /* In C, do not warn if the unsigned quantity is an enumeration | |
9117 | constant and its maximum value would fit in the result if the | |
9118 | result were signed. */ | |
9119 | else if (!c_dialect_cxx() && TREE_CODE (uop) == INTEGER_CST | |
9120 | && TREE_CODE (TREE_TYPE (uop)) == ENUMERAL_TYPE | |
9121 | && int_fits_type_p (TYPE_MAX_VALUE (TREE_TYPE (uop)), | |
895b662f | 9122 | c_common_signed_type (base_type))) |
13869a99 | 9123 | /* OK */; |
9124 | else | |
8e70fb09 | 9125 | warning_at (location, |
9126 | OPT_Wsign_compare, | |
9127 | "comparison between signed and unsigned integer expressions"); | |
13869a99 | 9128 | } |
9129 | ||
9130 | /* Warn if two unsigned values are being compared in a size larger | |
9131 | than their original size, and one (and only one) is the result of | |
9132 | a `~' operator. This comparison will always fail. | |
9133 | ||
9134 | Also warn if one operand is a constant, and the constant does not | |
9135 | have all bits set that are set in the ~ operand when it is | |
9136 | extended. */ | |
9137 | ||
9138 | op0 = get_narrower (op0, &unsignedp0); | |
9139 | op1 = get_narrower (op1, &unsignedp1); | |
9140 | ||
9141 | if ((TREE_CODE (op0) == BIT_NOT_EXPR) | |
9142 | ^ (TREE_CODE (op1) == BIT_NOT_EXPR)) | |
9143 | { | |
9144 | if (TREE_CODE (op0) == BIT_NOT_EXPR) | |
9145 | op0 = get_narrower (TREE_OPERAND (op0, 0), &unsignedp0); | |
9146 | if (TREE_CODE (op1) == BIT_NOT_EXPR) | |
9147 | op1 = get_narrower (TREE_OPERAND (op1, 0), &unsignedp1); | |
9148 | ||
9149 | if (host_integerp (op0, 0) || host_integerp (op1, 0)) | |
9150 | { | |
9151 | tree primop; | |
9152 | HOST_WIDE_INT constant, mask; | |
9153 | int unsignedp; | |
9154 | unsigned int bits; | |
9155 | ||
9156 | if (host_integerp (op0, 0)) | |
9157 | { | |
9158 | primop = op1; | |
9159 | unsignedp = unsignedp1; | |
9160 | constant = tree_low_cst (op0, 0); | |
9161 | } | |
9162 | else | |
9163 | { | |
9164 | primop = op0; | |
9165 | unsignedp = unsignedp0; | |
9166 | constant = tree_low_cst (op1, 0); | |
9167 | } | |
9168 | ||
9169 | bits = TYPE_PRECISION (TREE_TYPE (primop)); | |
9170 | if (bits < TYPE_PRECISION (result_type) | |
9171 | && bits < HOST_BITS_PER_LONG && unsignedp) | |
9172 | { | |
9173 | mask = (~ (HOST_WIDE_INT) 0) << bits; | |
9174 | if ((mask & constant) != mask) | |
9175 | { | |
9176 | if (constant == 0) | |
9177 | warning (OPT_Wsign_compare, | |
9178 | "promoted ~unsigned is always non-zero"); | |
9179 | else | |
8e70fb09 | 9180 | warning_at (location, OPT_Wsign_compare, |
9181 | "comparison of promoted ~unsigned with constant"); | |
13869a99 | 9182 | } |
9183 | } | |
9184 | } | |
9185 | else if (unsignedp0 && unsignedp1 | |
9186 | && (TYPE_PRECISION (TREE_TYPE (op0)) | |
9187 | < TYPE_PRECISION (result_type)) | |
9188 | && (TYPE_PRECISION (TREE_TYPE (op1)) | |
9189 | < TYPE_PRECISION (result_type))) | |
8e70fb09 | 9190 | warning_at (location, OPT_Wsign_compare, |
13869a99 | 9191 | "comparison of promoted ~unsigned with unsigned"); |
9192 | } | |
9193 | } | |
9194 | ||
41771881 | 9195 | /* Setup a TYPE_DECL node as a typedef representation. |
9196 | ||
9197 | X is a TYPE_DECL for a typedef statement. Create a brand new | |
9198 | ..._TYPE node (which will be just a variant of the existing | |
9199 | ..._TYPE node with identical properties) and then install X | |
9200 | as the TYPE_NAME of this brand new (duplicate) ..._TYPE node. | |
9201 | ||
9202 | The whole point here is to end up with a situation where each | |
9203 | and every ..._TYPE node the compiler creates will be uniquely | |
9204 | associated with AT MOST one node representing a typedef name. | |
9205 | This way, even though the compiler substitutes corresponding | |
9206 | ..._TYPE nodes for TYPE_DECL (i.e. "typedef name") nodes very | |
9207 | early on, later parts of the compiler can always do the reverse | |
9208 | translation and get back the corresponding typedef name. For | |
9209 | example, given: | |
9210 | ||
9211 | typedef struct S MY_TYPE; | |
9212 | MY_TYPE object; | |
9213 | ||
9214 | Later parts of the compiler might only know that `object' was of | |
9215 | type `struct S' if it were not for code just below. With this | |
9216 | code however, later parts of the compiler see something like: | |
9217 | ||
9218 | struct S' == struct S | |
9219 | typedef struct S' MY_TYPE; | |
9220 | struct S' object; | |
9221 | ||
9222 | And they can then deduce (from the node for type struct S') that | |
9223 | the original object declaration was: | |
9224 | ||
9225 | MY_TYPE object; | |
9226 | ||
9227 | Being able to do this is important for proper support of protoize, | |
9228 | and also for generating precise symbolic debugging information | |
9229 | which takes full account of the programmer's (typedef) vocabulary. | |
9230 | ||
9231 | Obviously, we don't want to generate a duplicate ..._TYPE node if | |
9232 | the TYPE_DECL node that we are now processing really represents a | |
9233 | standard built-in type. */ | |
9234 | ||
9235 | void | |
9236 | set_underlying_type (tree x) | |
9237 | { | |
9238 | if (x == error_mark_node) | |
9239 | return; | |
9240 | if (DECL_IS_BUILTIN (x)) | |
9241 | { | |
9242 | if (TYPE_NAME (TREE_TYPE (x)) == 0) | |
9243 | TYPE_NAME (TREE_TYPE (x)) = x; | |
9244 | } | |
9245 | else if (TREE_TYPE (x) != error_mark_node | |
9246 | && DECL_ORIGINAL_TYPE (x) == NULL_TREE) | |
9247 | { | |
9248 | tree tt = TREE_TYPE (x); | |
9249 | DECL_ORIGINAL_TYPE (x) = tt; | |
9250 | tt = build_variant_type_copy (tt); | |
9251 | TYPE_STUB_DECL (tt) = TYPE_STUB_DECL (DECL_ORIGINAL_TYPE (x)); | |
9252 | TYPE_NAME (tt) = x; | |
9253 | TREE_USED (tt) = TREE_USED (x); | |
9254 | TREE_TYPE (x) = tt; | |
9255 | } | |
9256 | } | |
9257 | ||
9258 | /* Returns true if X is a typedef decl. */ | |
9259 | ||
9260 | bool | |
9261 | is_typedef_decl (tree x) | |
9262 | { | |
9263 | return (x && TREE_CODE (x) == TYPE_DECL | |
9264 | && DECL_ORIGINAL_TYPE (x) != NULL_TREE); | |
9265 | } | |
9266 | ||
1f3233d1 | 9267 | #include "gt-c-common.h" |