]>
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, |
78c2e180 | 3 | 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008 Free Software Foundation, Inc. |
b0fc3e72 | 4 | |
f12b58b3 | 5 | This file is part of GCC. |
b0fc3e72 | 6 | |
f12b58b3 | 7 | GCC is free software; you can redistribute it and/or modify it under |
8 | the terms of the GNU General Public License as published by the Free | |
8c4c00c1 | 9 | Software Foundation; either version 3, or (at your option) any later |
f12b58b3 | 10 | version. |
b0fc3e72 | 11 | |
f12b58b3 | 12 | GCC is distributed in the hope that it will be useful, but WITHOUT ANY |
13 | WARRANTY; without even the implied warranty of MERCHANTABILITY or | |
14 | FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License | |
15 | for more details. | |
b0fc3e72 | 16 | |
17 | You should have received a copy of the GNU General Public License | |
8c4c00c1 | 18 | along with GCC; see the file COPYING3. If not see |
19 | <http://www.gnu.org/licenses/>. */ | |
b0fc3e72 | 20 | |
21 | #include "config.h" | |
405711de | 22 | #include "system.h" |
805e22b2 | 23 | #include "coretypes.h" |
24 | #include "tm.h" | |
e48d0f41 | 25 | #include "intl.h" |
b0fc3e72 | 26 | #include "tree.h" |
b0fc3e72 | 27 | #include "flags.h" |
cd03a192 | 28 | #include "output.h" |
a3fa7feb | 29 | #include "c-pragma.h" |
a5b1863e | 30 | #include "rtl.h" |
dc12af01 | 31 | #include "ggc.h" |
573aba85 | 32 | #include "varray.h" |
74647769 | 33 | #include "expr.h" |
e41f0d80 | 34 | #include "c-common.h" |
cdc9fa3e | 35 | #include "diagnostic.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" |
4ee9c684 | 44 | #include "tree-iterator.h" |
45 | #include "hashtab.h" | |
b55af61c | 46 | #include "tree-mudflap.h" |
e08bd2f4 | 47 | #include "opts.h" |
5000e21c | 48 | #include "real.h" |
62eec3b4 | 49 | #include "cgraph.h" |
b9fc964a | 50 | #include "target-def.h" |
9421ebb9 | 51 | #include "fixed-value.h" |
fd6f6435 | 52 | |
90cc7820 | 53 | cpp_reader *parse_in; /* Declared in c-pragma.h. */ |
a654e028 | 54 | |
174fcc61 | 55 | /* We let tm.h override the types used here, to handle trivial differences |
56 | such as the choice of unsigned int or long unsigned int for size_t. | |
57 | When machines start needing nontrivial differences in the size type, | |
58 | it would be best to do something here to figure out automatically | |
59 | from other information what type to use. */ | |
60 | ||
61 | #ifndef SIZE_TYPE | |
62 | #define SIZE_TYPE "long unsigned int" | |
63 | #endif | |
64 | ||
73673831 | 65 | #ifndef PID_TYPE |
66 | #define PID_TYPE "int" | |
67 | #endif | |
68 | ||
924bbf02 | 69 | #ifndef CHAR16_TYPE |
70 | #define CHAR16_TYPE "short unsigned int" | |
71 | #endif | |
72 | ||
73 | #ifndef CHAR32_TYPE | |
74 | #define CHAR32_TYPE "unsigned int" | |
75 | #endif | |
76 | ||
174fcc61 | 77 | #ifndef WCHAR_TYPE |
78 | #define WCHAR_TYPE "int" | |
79 | #endif | |
80 | ||
18ef7ac2 | 81 | /* WCHAR_TYPE gets overridden by -fshort-wchar. */ |
82 | #define MODIFIED_WCHAR_TYPE \ | |
83 | (flag_short_wchar ? "short unsigned int" : WCHAR_TYPE) | |
84 | ||
194c4d9f | 85 | #ifndef PTRDIFF_TYPE |
86 | #define PTRDIFF_TYPE "long int" | |
87 | #endif | |
88 | ||
6bf5ed8d | 89 | #ifndef WINT_TYPE |
90 | #define WINT_TYPE "unsigned int" | |
91 | #endif | |
92 | ||
93 | #ifndef INTMAX_TYPE | |
94 | #define INTMAX_TYPE ((INT_TYPE_SIZE == LONG_LONG_TYPE_SIZE) \ | |
95 | ? "int" \ | |
96 | : ((LONG_TYPE_SIZE == LONG_LONG_TYPE_SIZE) \ | |
97 | ? "long int" \ | |
98 | : "long long int")) | |
99 | #endif | |
100 | ||
101 | #ifndef UINTMAX_TYPE | |
102 | #define UINTMAX_TYPE ((INT_TYPE_SIZE == LONG_LONG_TYPE_SIZE) \ | |
103 | ? "unsigned int" \ | |
104 | : ((LONG_TYPE_SIZE == LONG_LONG_TYPE_SIZE) \ | |
105 | ? "long unsigned int" \ | |
106 | : "long long unsigned int")) | |
107 | #endif | |
108 | ||
72040e7e | 109 | /* The following symbols are subsumed in the c_global_trees array, and |
44e9fa65 | 110 | listed here individually for documentation purposes. |
72040e7e | 111 | |
112 | INTEGER_TYPE and REAL_TYPE nodes for the standard data types. | |
113 | ||
114 | tree short_integer_type_node; | |
115 | tree long_integer_type_node; | |
116 | tree long_long_integer_type_node; | |
117 | ||
118 | tree short_unsigned_type_node; | |
119 | tree long_unsigned_type_node; | |
120 | tree long_long_unsigned_type_node; | |
121 | ||
3c2239cf | 122 | tree truthvalue_type_node; |
123 | tree truthvalue_false_node; | |
124 | tree truthvalue_true_node; | |
72040e7e | 125 | |
126 | tree ptrdiff_type_node; | |
127 | ||
128 | tree unsigned_char_type_node; | |
129 | tree signed_char_type_node; | |
130 | tree wchar_type_node; | |
131 | tree signed_wchar_type_node; | |
132 | tree unsigned_wchar_type_node; | |
133 | ||
924bbf02 | 134 | tree char16_type_node; |
135 | tree char32_type_node; | |
136 | ||
72040e7e | 137 | tree float_type_node; |
138 | tree double_type_node; | |
139 | tree long_double_type_node; | |
140 | ||
141 | tree complex_integer_type_node; | |
142 | tree complex_float_type_node; | |
143 | tree complex_double_type_node; | |
144 | tree complex_long_double_type_node; | |
145 | ||
c4503c0a | 146 | tree dfloat32_type_node; |
147 | tree dfloat64_type_node; | |
148 | tree_dfloat128_type_node; | |
149 | ||
72040e7e | 150 | tree intQI_type_node; |
151 | tree intHI_type_node; | |
152 | tree intSI_type_node; | |
153 | tree intDI_type_node; | |
154 | tree intTI_type_node; | |
155 | ||
156 | tree unsigned_intQI_type_node; | |
157 | tree unsigned_intHI_type_node; | |
158 | tree unsigned_intSI_type_node; | |
159 | tree unsigned_intDI_type_node; | |
160 | tree unsigned_intTI_type_node; | |
161 | ||
162 | tree widest_integer_literal_type_node; | |
163 | tree widest_unsigned_literal_type_node; | |
164 | ||
165 | Nodes for types `void *' and `const void *'. | |
166 | ||
167 | tree ptr_type_node, const_ptr_type_node; | |
168 | ||
169 | Nodes for types `char *' and `const char *'. | |
170 | ||
171 | tree string_type_node, const_string_type_node; | |
172 | ||
173 | Type `char[SOMENUMBER]'. | |
174 | Used when an array of char is needed and the size is irrelevant. | |
175 | ||
176 | tree char_array_type_node; | |
177 | ||
178 | Type `int[SOMENUMBER]' or something like it. | |
179 | Used when an array of int needed and the size is irrelevant. | |
180 | ||
181 | tree int_array_type_node; | |
182 | ||
183 | Type `wchar_t[SOMENUMBER]' or something like it. | |
184 | Used when a wide string literal is created. | |
185 | ||
186 | tree wchar_array_type_node; | |
187 | ||
924bbf02 | 188 | Type `char16_t[SOMENUMBER]' or something like it. |
189 | Used when a UTF-16 string literal is created. | |
190 | ||
191 | tree char16_array_type_node; | |
192 | ||
193 | Type `char32_t[SOMENUMBER]' or something like it. | |
194 | Used when a UTF-32 string literal is created. | |
195 | ||
196 | tree char32_array_type_node; | |
197 | ||
72040e7e | 198 | Type `int ()' -- used for implicit declaration of functions. |
199 | ||
200 | tree default_function_type; | |
201 | ||
72040e7e | 202 | A VOID_TYPE node, packaged in a TREE_LIST. |
203 | ||
204 | tree void_list_node; | |
205 | ||
734c98be | 206 | The lazily created VAR_DECLs for __FUNCTION__, __PRETTY_FUNCTION__, |
65b7f83f | 207 | and __func__. (C doesn't generate __FUNCTION__ and__PRETTY_FUNCTION__ |
208 | VAR_DECLS, but C++ does.) | |
71d9fc9b | 209 | |
65b7f83f | 210 | tree function_name_decl_node; |
734c98be | 211 | tree pretty_function_name_decl_node; |
65b7f83f | 212 | tree c99_function_name_decl_node; |
213 | ||
214 | Stack of nested function name VAR_DECLs. | |
1cae46be | 215 | |
65b7f83f | 216 | tree saved_function_name_decls; |
71d9fc9b | 217 | |
72040e7e | 218 | */ |
219 | ||
220 | tree c_global_trees[CTI_MAX]; | |
573aba85 | 221 | \f |
574a6990 | 222 | /* Switches common to the C front ends. */ |
223 | ||
f0b5f617 | 224 | /* Nonzero if preprocessing only. */ |
f7070933 | 225 | |
ffd56b21 | 226 | int flag_preprocess_only; |
227 | ||
f7070933 | 228 | /* Nonzero means don't output line number information. */ |
229 | ||
230 | char flag_no_line_commands; | |
231 | ||
232 | /* Nonzero causes -E output not to be done, but directives such as | |
233 | #define that have side effects are still obeyed. */ | |
234 | ||
235 | char flag_no_output; | |
236 | ||
237 | /* Nonzero means dump macros in some fashion. */ | |
238 | ||
239 | char flag_dump_macros; | |
240 | ||
241 | /* Nonzero means pass #include lines through to the output. */ | |
242 | ||
243 | char flag_dump_includes; | |
244 | ||
d718b525 | 245 | /* Nonzero means process PCH files while preprocessing. */ |
246 | ||
247 | bool flag_pch_preprocess; | |
248 | ||
573aba85 | 249 | /* The file name to which we should write a precompiled header, or |
250 | NULL if no header will be written in this compile. */ | |
251 | ||
252 | const char *pch_file; | |
253 | ||
1ed9d5f5 | 254 | /* Nonzero if an ISO standard was selected. It rejects macros in the |
255 | user's namespace. */ | |
256 | int flag_iso; | |
257 | ||
258 | /* Nonzero if -undef was given. It suppresses target built-in macros | |
259 | and assertions. */ | |
260 | int flag_undef; | |
261 | ||
0270ae90 | 262 | /* Nonzero means don't recognize the non-ANSI builtin functions. */ |
263 | ||
264 | int flag_no_builtin; | |
265 | ||
266 | /* Nonzero means don't recognize the non-ANSI builtin functions. | |
267 | -ansi sets this. */ | |
268 | ||
269 | int flag_no_nonansi_builtin; | |
270 | ||
174fcc61 | 271 | /* Nonzero means give `double' the same size as `float'. */ |
272 | ||
273 | int flag_short_double; | |
274 | ||
275 | /* Nonzero means give `wchar_t' the same size as `short'. */ | |
276 | ||
277 | int flag_short_wchar; | |
278 | ||
546c4794 | 279 | /* Nonzero means allow implicit conversions between vectors with |
280 | differing numbers of subparts and/or differing element types. */ | |
281 | int flag_lax_vector_conversions; | |
282 | ||
07ebd091 | 283 | /* Nonzero means allow Microsoft extensions without warnings or errors. */ |
284 | int flag_ms_extensions; | |
285 | ||
574a6990 | 286 | /* Nonzero means don't recognize the keyword `asm'. */ |
287 | ||
288 | int flag_no_asm; | |
289 | ||
574a6990 | 290 | /* Nonzero means to treat bitfields as signed unless they say `unsigned'. */ |
291 | ||
292 | int flag_signed_bitfields = 1; | |
574a6990 | 293 | |
1cae46be | 294 | /* Warn about #pragma directives that are not recognized. */ |
574a6990 | 295 | |
1cae46be | 296 | int warn_unknown_pragmas; /* Tri state variable. */ |
574a6990 | 297 | |
574a6990 | 298 | /* Warn about format/argument anomalies in calls to formatted I/O functions |
299 | (*printf, *scanf, strftime, strfmon, etc.). */ | |
300 | ||
301 | int warn_format; | |
302 | ||
ae84079f | 303 | /* Warn about using __null (as NULL in C++) as sentinel. For code compiled |
304 | with GCC this doesn't matter as __null is guaranteed to have the right | |
305 | size. */ | |
306 | ||
307 | int warn_strict_null_sentinel; | |
308 | ||
c17b85ea | 309 | /* Zero means that faster, ...NonNil variants of objc_msgSend... |
310 | calls will be used in ObjC; passing nil receivers to such calls | |
311 | will most likely result in crashes. */ | |
312 | int flag_nil_receivers = 1; | |
313 | ||
c17b85ea | 314 | /* Nonzero means that code generation will be altered to support |
315 | "zero-link" execution. This currently affects ObjC only, but may | |
316 | affect other languages in the future. */ | |
317 | int flag_zero_link = 0; | |
318 | ||
319 | /* Nonzero means emit an '__OBJC, __image_info' for the current translation | |
320 | unit. It will inform the ObjC runtime that class definition(s) herein | |
321 | contained are to replace one(s) previously loaded. */ | |
322 | int flag_replace_objc_classes = 0; | |
b27ac6b5 | 323 | |
574a6990 | 324 | /* C/ObjC language option variables. */ |
325 | ||
326 | ||
574a6990 | 327 | /* Nonzero means allow type mismatches in conditional expressions; |
328 | just make their values `void'. */ | |
329 | ||
330 | int flag_cond_mismatch; | |
331 | ||
332 | /* Nonzero means enable C89 Amendment 1 features. */ | |
333 | ||
334 | int flag_isoc94; | |
335 | ||
336 | /* Nonzero means use the ISO C99 dialect of C. */ | |
337 | ||
338 | int flag_isoc99; | |
339 | ||
8b332087 | 340 | /* Nonzero means that we have builtin functions, and main is an int. */ |
574a6990 | 341 | |
342 | int flag_hosted = 1; | |
343 | ||
574a6990 | 344 | /* Warn if main is suspicious. */ |
345 | ||
346 | int warn_main; | |
347 | ||
574a6990 | 348 | |
349 | /* ObjC language option variables. */ | |
350 | ||
351 | ||
352 | /* Open and close the file for outputting class declarations, if | |
353 | requested (ObjC). */ | |
354 | ||
355 | int flag_gen_declaration; | |
356 | ||
574a6990 | 357 | /* Tells the compiler that this is a special run. Do not perform any |
358 | compiling, instead we are to test some platform dependent features | |
359 | and output a C header file with appropriate definitions. */ | |
360 | ||
361 | int print_struct_values; | |
362 | ||
f0b5f617 | 363 | /* Tells the compiler what is the constant string class for ObjC. */ |
574a6990 | 364 | |
365 | const char *constant_string_class_name; | |
366 | ||
574a6990 | 367 | |
368 | /* C++ language option variables. */ | |
369 | ||
370 | ||
371 | /* Nonzero means don't recognize any extension keywords. */ | |
372 | ||
373 | int flag_no_gnu_keywords; | |
374 | ||
375 | /* Nonzero means do emit exported implementations of functions even if | |
376 | they can be inlined. */ | |
377 | ||
378 | int flag_implement_inlines = 1; | |
379 | ||
574a6990 | 380 | /* Nonzero means that implicit instantiations will be emitted if needed. */ |
381 | ||
382 | int flag_implicit_templates = 1; | |
383 | ||
384 | /* Nonzero means that implicit instantiations of inline templates will be | |
385 | emitted if needed, even if instantiations of non-inline templates | |
386 | aren't. */ | |
387 | ||
388 | int flag_implicit_inline_templates = 1; | |
389 | ||
390 | /* Nonzero means generate separate instantiation control files and | |
391 | juggle them at link time. */ | |
392 | ||
393 | int flag_use_repository; | |
394 | ||
395 | /* Nonzero if we want to issue diagnostics that the standard says are not | |
396 | required. */ | |
397 | ||
398 | int flag_optional_diags = 1; | |
399 | ||
400 | /* Nonzero means we should attempt to elide constructors when possible. */ | |
401 | ||
402 | int flag_elide_constructors = 1; | |
403 | ||
404 | /* Nonzero means that member functions defined in class scope are | |
405 | inline by default. */ | |
406 | ||
407 | int flag_default_inline = 1; | |
408 | ||
409 | /* Controls whether compiler generates 'type descriptor' that give | |
410 | run-time type information. */ | |
411 | ||
412 | int flag_rtti = 1; | |
413 | ||
414 | /* Nonzero if we want to conserve space in the .o files. We do this | |
415 | by putting uninitialized data and runtime initialized data into | |
416 | .common instead of .data at the expense of not flagging multiple | |
417 | definitions. */ | |
418 | ||
419 | int flag_conserve_space; | |
420 | ||
421 | /* Nonzero if we want to obey access control semantics. */ | |
422 | ||
423 | int flag_access_control = 1; | |
424 | ||
425 | /* Nonzero if we want to check the return value of new and avoid calling | |
426 | constructors if it is a null pointer. */ | |
427 | ||
428 | int flag_check_new; | |
429 | ||
6dcdb5de | 430 | /* The C++ dialect being used. C++98 is the default. */ |
0fe6eeac | 431 | |
6dcdb5de | 432 | enum cxx_dialect cxx_dialect = cxx98; |
0fe6eeac | 433 | |
574a6990 | 434 | /* Nonzero if we want the new ISO rules for pushing a new scope for `for' |
435 | initialization variables. | |
436 | 0: Old rules, set by -fno-for-scope. | |
437 | 2: New ISO rules, set by -ffor-scope. | |
438 | 1: Try to implement new ISO rules, but with backup compatibility | |
439 | (and warnings). This is the default, for now. */ | |
440 | ||
441 | int flag_new_for_scope = 1; | |
442 | ||
443 | /* Nonzero if we want to emit defined symbols with common-like linkage as | |
444 | weak symbols where possible, in order to conform to C++ semantics. | |
445 | Otherwise, emit them as local symbols. */ | |
446 | ||
447 | int flag_weak = 1; | |
448 | ||
e7aa92b2 | 449 | /* 0 means we want the preprocessor to not emit line directives for |
450 | the current working directory. 1 means we want it to do it. -1 | |
451 | means we should decide depending on whether debugging information | |
452 | is being emitted or not. */ | |
453 | ||
454 | int flag_working_directory = -1; | |
455 | ||
574a6990 | 456 | /* Nonzero to use __cxa_atexit, rather than atexit, to register |
3bf418bd | 457 | destructors for local statics and global objects. '2' means it has been |
458 | set nonzero as a default, not by a command-line flag. */ | |
574a6990 | 459 | |
460 | int flag_use_cxa_atexit = DEFAULT_USE_CXA_ATEXIT; | |
461 | ||
3bf418bd | 462 | /* Nonzero to use __cxa_get_exception_ptr in C++ exception-handling |
463 | code. '2' means it has not been set explicitly on the command line. */ | |
464 | ||
465 | int flag_use_cxa_get_exception_ptr = 2; | |
466 | ||
574a6990 | 467 | /* Nonzero means to implement standard semantics for exception |
468 | specifications, calling unexpected if an exception is thrown that | |
469 | doesn't match the specification. Zero means to treat them as | |
470 | assertions and optimize accordingly, but not check them. */ | |
471 | ||
472 | int flag_enforce_eh_specs = 1; | |
473 | ||
4813f5af | 474 | /* Nonzero means to generate thread-safe code for initializing local |
475 | statics. */ | |
476 | ||
477 | int flag_threadsafe_statics = 1; | |
478 | ||
574a6990 | 479 | /* Nonzero means warn about implicit declarations. */ |
480 | ||
481 | int warn_implicit = 1; | |
482 | ||
574a6990 | 483 | /* Maximum template instantiation depth. This limit is rather |
484 | arbitrary, but it exists to limit the time it takes to notice | |
485 | infinite template instantiations. */ | |
486 | ||
487 | int max_tinst_depth = 500; | |
488 | ||
489 | ||
490 | ||
988fc1d1 | 491 | /* The elements of `ridpointers' are identifier nodes for the reserved |
492 | type names and storage classes. It is indexed by a RID_... value. */ | |
493 | tree *ridpointers; | |
494 | ||
1cae46be | 495 | tree (*make_fname_decl) (tree, int); |
9e5a737d | 496 | |
e78703c1 | 497 | /* Nonzero means the expression being parsed will never be evaluated. |
498 | This is a count, since unevaluated expressions can nest. */ | |
499 | int skip_evaluation; | |
500 | ||
2c0e001b | 501 | /* Information about how a function name is generated. */ |
65b7f83f | 502 | struct fname_var_t |
503 | { | |
e99c3a1d | 504 | tree *const decl; /* pointer to the VAR_DECL. */ |
505 | const unsigned rid; /* RID number for the identifier. */ | |
506 | const int pretty; /* How pretty is it? */ | |
65b7f83f | 507 | }; |
508 | ||
2c0e001b | 509 | /* The three ways of getting then name of the current function. */ |
65b7f83f | 510 | |
511 | const struct fname_var_t fname_vars[] = | |
512 | { | |
2c0e001b | 513 | /* C99 compliant __func__, must be first. */ |
65b7f83f | 514 | {&c99_function_name_decl_node, RID_C99_FUNCTION_NAME, 0}, |
2c0e001b | 515 | /* GCC __FUNCTION__ compliant. */ |
65b7f83f | 516 | {&function_name_decl_node, RID_FUNCTION_NAME, 0}, |
2c0e001b | 517 | /* GCC __PRETTY_FUNCTION__ compliant. */ |
65b7f83f | 518 | {&pretty_function_name_decl_node, RID_PRETTY_FUNCTION_NAME, 1}, |
519 | {NULL, 0, 0}, | |
520 | }; | |
521 | ||
2ca392fd | 522 | static tree check_case_value (tree); |
523 | static bool check_case_bounds (tree, tree, tree *, tree *); | |
be43ff5a | 524 | |
1cae46be | 525 | static tree handle_packed_attribute (tree *, tree, tree, int, bool *); |
526 | static tree handle_nocommon_attribute (tree *, tree, tree, int, bool *); | |
527 | static tree handle_common_attribute (tree *, tree, tree, int, bool *); | |
528 | static tree handle_noreturn_attribute (tree *, tree, tree, int, bool *); | |
5de92639 | 529 | static tree handle_hot_attribute (tree *, tree, tree, int, bool *); |
530 | static tree handle_cold_attribute (tree *, tree, tree, int, bool *); | |
1cae46be | 531 | static tree handle_noinline_attribute (tree *, tree, tree, int, bool *); |
532 | static tree handle_always_inline_attribute (tree *, tree, tree, int, | |
533 | bool *); | |
1b16fc45 | 534 | static tree handle_gnu_inline_attribute (tree *, tree, tree, int, bool *); |
535 | static tree handle_artificial_attribute (tree *, tree, tree, int, bool *); | |
0cdd9887 | 536 | static tree handle_flatten_attribute (tree *, tree, tree, int, bool *); |
10fc867f | 537 | static tree handle_error_attribute (tree *, tree, tree, int, bool *); |
1cae46be | 538 | static tree handle_used_attribute (tree *, tree, tree, int, bool *); |
539 | static tree handle_unused_attribute (tree *, tree, tree, int, bool *); | |
62eec3b4 | 540 | static tree handle_externally_visible_attribute (tree *, tree, tree, int, |
541 | bool *); | |
1cae46be | 542 | static tree handle_const_attribute (tree *, tree, tree, int, bool *); |
543 | static tree handle_transparent_union_attribute (tree *, tree, tree, | |
544 | int, bool *); | |
545 | static tree handle_constructor_attribute (tree *, tree, tree, int, bool *); | |
546 | static tree handle_destructor_attribute (tree *, tree, tree, int, bool *); | |
547 | static tree handle_mode_attribute (tree *, tree, tree, int, bool *); | |
548 | static tree handle_section_attribute (tree *, tree, tree, int, bool *); | |
549 | static tree handle_aligned_attribute (tree *, tree, tree, int, bool *); | |
550 | static tree handle_weak_attribute (tree *, tree, tree, int, bool *) ; | |
551 | static tree handle_alias_attribute (tree *, tree, tree, int, bool *); | |
f4a30bd7 | 552 | static tree handle_weakref_attribute (tree *, tree, tree, int, bool *) ; |
1cae46be | 553 | static tree handle_visibility_attribute (tree *, tree, tree, int, |
554 | bool *); | |
555 | static tree handle_tls_model_attribute (tree *, tree, tree, int, | |
556 | bool *); | |
557 | static tree handle_no_instrument_function_attribute (tree *, tree, | |
558 | tree, int, bool *); | |
559 | static tree handle_malloc_attribute (tree *, tree, tree, int, bool *); | |
26d1c5ff | 560 | static tree handle_returns_twice_attribute (tree *, tree, tree, int, bool *); |
1cae46be | 561 | static tree handle_no_limit_stack_attribute (tree *, tree, tree, int, |
562 | bool *); | |
563 | static tree handle_pure_attribute (tree *, tree, tree, int, bool *); | |
fc09b200 | 564 | static tree handle_novops_attribute (tree *, tree, tree, int, bool *); |
1cae46be | 565 | static tree handle_deprecated_attribute (tree *, tree, tree, int, |
566 | bool *); | |
567 | static tree handle_vector_size_attribute (tree *, tree, tree, int, | |
568 | bool *); | |
569 | static tree handle_nonnull_attribute (tree *, tree, tree, int, bool *); | |
570 | static tree handle_nothrow_attribute (tree *, tree, tree, int, bool *); | |
571 | static tree handle_cleanup_attribute (tree *, tree, tree, int, bool *); | |
8a8cdb8d | 572 | static tree handle_warn_unused_result_attribute (tree *, tree, tree, int, |
573 | bool *); | |
bf6c8de0 | 574 | static tree handle_sentinel_attribute (tree *, tree, tree, int, bool *); |
b5c26b42 | 575 | static tree handle_type_generic_attribute (tree *, tree, tree, int, bool *); |
4a29c97c | 576 | static tree handle_alloc_size_attribute (tree *, tree, tree, int, bool *); |
1cae46be | 577 | |
d01f58f9 | 578 | static void check_function_nonnull (tree, int, tree *); |
1cae46be | 579 | static void check_nonnull_arg (void *, tree, unsigned HOST_WIDE_INT); |
580 | static bool nonnull_check_p (tree, unsigned HOST_WIDE_INT); | |
581 | static bool get_nonnull_operand (tree, unsigned HOST_WIDE_INT *); | |
860251be | 582 | static int resort_field_decl_cmp (const void *, const void *); |
dbf6c367 | 583 | |
f8e93a2e | 584 | /* Table of machine-independent attributes common to all C-like languages. */ |
585 | const struct attribute_spec c_common_attribute_table[] = | |
586 | { | |
587 | /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler } */ | |
588 | { "packed", 0, 0, false, false, false, | |
1cae46be | 589 | handle_packed_attribute }, |
f8e93a2e | 590 | { "nocommon", 0, 0, true, false, false, |
591 | handle_nocommon_attribute }, | |
592 | { "common", 0, 0, true, false, false, | |
593 | handle_common_attribute }, | |
594 | /* FIXME: logically, noreturn attributes should be listed as | |
595 | "false, true, true" and apply to function types. But implementing this | |
596 | would require all the places in the compiler that use TREE_THIS_VOLATILE | |
597 | on a decl to identify non-returning functions to be located and fixed | |
598 | to check the function type instead. */ | |
599 | { "noreturn", 0, 0, true, false, false, | |
600 | handle_noreturn_attribute }, | |
601 | { "volatile", 0, 0, true, false, false, | |
602 | handle_noreturn_attribute }, | |
603 | { "noinline", 0, 0, true, false, false, | |
604 | handle_noinline_attribute }, | |
605 | { "always_inline", 0, 0, true, false, false, | |
606 | handle_always_inline_attribute }, | |
541e4101 | 607 | { "gnu_inline", 0, 0, true, false, false, |
608 | handle_gnu_inline_attribute }, | |
1b16fc45 | 609 | { "artificial", 0, 0, true, false, false, |
610 | handle_artificial_attribute }, | |
0cdd9887 | 611 | { "flatten", 0, 0, true, false, false, |
a0c938f0 | 612 | handle_flatten_attribute }, |
f8e93a2e | 613 | { "used", 0, 0, true, false, false, |
614 | handle_used_attribute }, | |
615 | { "unused", 0, 0, false, false, false, | |
616 | handle_unused_attribute }, | |
62eec3b4 | 617 | { "externally_visible", 0, 0, true, false, false, |
618 | handle_externally_visible_attribute }, | |
f8e93a2e | 619 | /* The same comments as for noreturn attributes apply to const ones. */ |
620 | { "const", 0, 0, true, false, false, | |
621 | handle_const_attribute }, | |
622 | { "transparent_union", 0, 0, false, false, false, | |
623 | handle_transparent_union_attribute }, | |
9af7fd5b | 624 | { "constructor", 0, 1, true, false, false, |
f8e93a2e | 625 | handle_constructor_attribute }, |
9af7fd5b | 626 | { "destructor", 0, 1, true, false, false, |
f8e93a2e | 627 | handle_destructor_attribute }, |
628 | { "mode", 1, 1, false, true, false, | |
629 | handle_mode_attribute }, | |
630 | { "section", 1, 1, true, false, false, | |
631 | handle_section_attribute }, | |
632 | { "aligned", 0, 1, false, false, false, | |
633 | handle_aligned_attribute }, | |
634 | { "weak", 0, 0, true, false, false, | |
635 | handle_weak_attribute }, | |
636 | { "alias", 1, 1, true, false, false, | |
637 | handle_alias_attribute }, | |
f4a30bd7 | 638 | { "weakref", 0, 1, true, false, false, |
639 | handle_weakref_attribute }, | |
f8e93a2e | 640 | { "no_instrument_function", 0, 0, true, false, false, |
641 | handle_no_instrument_function_attribute }, | |
642 | { "malloc", 0, 0, true, false, false, | |
643 | handle_malloc_attribute }, | |
26d1c5ff | 644 | { "returns_twice", 0, 0, true, false, false, |
645 | handle_returns_twice_attribute }, | |
f8e93a2e | 646 | { "no_stack_limit", 0, 0, true, false, false, |
647 | handle_no_limit_stack_attribute }, | |
648 | { "pure", 0, 0, true, false, false, | |
649 | handle_pure_attribute }, | |
fc09b200 | 650 | /* For internal use (marking of builtins) only. The name contains space |
651 | to prevent its usage in source code. */ | |
652 | { "no vops", 0, 0, true, false, false, | |
653 | handle_novops_attribute }, | |
f8e93a2e | 654 | { "deprecated", 0, 0, false, false, false, |
655 | handle_deprecated_attribute }, | |
656 | { "vector_size", 1, 1, false, true, false, | |
657 | handle_vector_size_attribute }, | |
b212f378 | 658 | { "visibility", 1, 1, false, false, false, |
f8e93a2e | 659 | handle_visibility_attribute }, |
24dfead4 | 660 | { "tls_model", 1, 1, true, false, false, |
661 | handle_tls_model_attribute }, | |
dbf6c367 | 662 | { "nonnull", 0, -1, false, true, true, |
663 | handle_nonnull_attribute }, | |
fa987697 | 664 | { "nothrow", 0, 0, true, false, false, |
665 | handle_nothrow_attribute }, | |
cb59f969 | 666 | { "may_alias", 0, 0, false, true, false, NULL }, |
7acb29a3 | 667 | { "cleanup", 1, 1, true, false, false, |
668 | handle_cleanup_attribute }, | |
8a8cdb8d | 669 | { "warn_unused_result", 0, 0, false, true, true, |
670 | handle_warn_unused_result_attribute }, | |
50ca527f | 671 | { "sentinel", 0, 1, false, true, true, |
bf6c8de0 | 672 | handle_sentinel_attribute }, |
b5c26b42 | 673 | /* For internal use (marking of builtins) only. The name contains space |
674 | to prevent its usage in source code. */ | |
675 | { "type generic", 0, 0, false, true, true, | |
676 | handle_type_generic_attribute }, | |
4a29c97c | 677 | { "alloc_size", 1, 2, false, true, true, |
678 | handle_alloc_size_attribute }, | |
5de92639 | 679 | { "cold", 0, 0, true, false, false, |
680 | handle_cold_attribute }, | |
681 | { "hot", 0, 0, true, false, false, | |
682 | handle_hot_attribute }, | |
10fc867f | 683 | { "warning", 1, 1, true, false, false, |
684 | handle_error_attribute }, | |
685 | { "error", 1, 1, true, false, false, | |
686 | handle_error_attribute }, | |
f8e93a2e | 687 | { NULL, 0, 0, false, false, false, NULL } |
688 | }; | |
689 | ||
690 | /* Give the specifications for the format attributes, used by C and all | |
d716ce75 | 691 | descendants. */ |
f8e93a2e | 692 | |
693 | const struct attribute_spec c_common_format_attribute_table[] = | |
694 | { | |
695 | /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler } */ | |
696 | { "format", 3, 3, false, true, true, | |
697 | handle_format_attribute }, | |
698 | { "format_arg", 1, 1, false, true, true, | |
699 | handle_format_arg_attribute }, | |
700 | { NULL, 0, 0, false, false, false, NULL } | |
701 | }; | |
702 | ||
2c0e001b | 703 | /* Push current bindings for the function name VAR_DECLS. */ |
f4e3c278 | 704 | |
705 | void | |
1cae46be | 706 | start_fname_decls (void) |
f4e3c278 | 707 | { |
65b7f83f | 708 | unsigned ix; |
709 | tree saved = NULL_TREE; | |
1cae46be | 710 | |
65b7f83f | 711 | for (ix = 0; fname_vars[ix].decl; ix++) |
712 | { | |
713 | tree decl = *fname_vars[ix].decl; | |
f4e3c278 | 714 | |
65b7f83f | 715 | if (decl) |
716 | { | |
7016c612 | 717 | saved = tree_cons (decl, build_int_cst (NULL_TREE, ix), saved); |
65b7f83f | 718 | *fname_vars[ix].decl = NULL_TREE; |
719 | } | |
720 | } | |
721 | if (saved || saved_function_name_decls) | |
722 | /* Normally they'll have been NULL, so only push if we've got a | |
723 | stack, or they are non-NULL. */ | |
724 | saved_function_name_decls = tree_cons (saved, NULL_TREE, | |
725 | saved_function_name_decls); | |
726 | } | |
727 | ||
2363ef00 | 728 | /* Finish up the current bindings, adding them into the current function's |
729 | statement tree. This must be done _before_ finish_stmt_tree is called. | |
730 | If there is no current function, we must be at file scope and no statements | |
731 | are involved. Pop the previous bindings. */ | |
65b7f83f | 732 | |
733 | void | |
1cae46be | 734 | finish_fname_decls (void) |
65b7f83f | 735 | { |
736 | unsigned ix; | |
2363ef00 | 737 | tree stmts = NULL_TREE; |
65b7f83f | 738 | tree stack = saved_function_name_decls; |
739 | ||
740 | for (; stack && TREE_VALUE (stack); stack = TREE_CHAIN (stack)) | |
2363ef00 | 741 | append_to_statement_list (TREE_VALUE (stack), &stmts); |
1cae46be | 742 | |
2363ef00 | 743 | if (stmts) |
65b7f83f | 744 | { |
2363ef00 | 745 | tree *bodyp = &DECL_SAVED_TREE (current_function_decl); |
5c423bd6 | 746 | |
2363ef00 | 747 | if (TREE_CODE (*bodyp) == BIND_EXPR) |
748 | bodyp = &BIND_EXPR_BODY (*bodyp); | |
81010c97 | 749 | |
bc2b76e0 | 750 | append_to_statement_list_force (*bodyp, &stmts); |
2363ef00 | 751 | *bodyp = stmts; |
65b7f83f | 752 | } |
1cae46be | 753 | |
65b7f83f | 754 | for (ix = 0; fname_vars[ix].decl; ix++) |
755 | *fname_vars[ix].decl = NULL_TREE; | |
1cae46be | 756 | |
65b7f83f | 757 | if (stack) |
f4e3c278 | 758 | { |
2c0e001b | 759 | /* We had saved values, restore them. */ |
65b7f83f | 760 | tree saved; |
761 | ||
762 | for (saved = TREE_PURPOSE (stack); saved; saved = TREE_CHAIN (saved)) | |
763 | { | |
764 | tree decl = TREE_PURPOSE (saved); | |
765 | unsigned ix = TREE_INT_CST_LOW (TREE_VALUE (saved)); | |
1cae46be | 766 | |
65b7f83f | 767 | *fname_vars[ix].decl = decl; |
768 | } | |
769 | stack = TREE_CHAIN (stack); | |
f4e3c278 | 770 | } |
65b7f83f | 771 | saved_function_name_decls = stack; |
772 | } | |
773 | ||
81010c97 | 774 | /* Return the text name of the current function, suitably prettified |
5fc7fa69 | 775 | by PRETTY_P. Return string must be freed by caller. */ |
65b7f83f | 776 | |
777 | const char * | |
1cae46be | 778 | fname_as_string (int pretty_p) |
65b7f83f | 779 | { |
9ad4bb1e | 780 | const char *name = "top level"; |
5fc7fa69 | 781 | char *namep; |
8115b8be | 782 | int vrb = 2, len; |
783 | cpp_string cstr = { 0, 0 }, strname; | |
9ad4bb1e | 784 | |
84166705 | 785 | if (!pretty_p) |
9ad4bb1e | 786 | { |
787 | name = ""; | |
788 | vrb = 0; | |
789 | } | |
790 | ||
791 | if (current_function_decl) | |
dc24ddbd | 792 | name = lang_hooks.decl_printable_name (current_function_decl, vrb); |
9ad4bb1e | 793 | |
8115b8be | 794 | len = strlen (name) + 3; /* Two for '"'s. One for NULL. */ |
5fc7fa69 | 795 | |
8115b8be | 796 | namep = XNEWVEC (char, len); |
797 | snprintf (namep, len, "\"%s\"", name); | |
798 | strname.text = (unsigned char *) namep; | |
799 | strname.len = len - 1; | |
5fc7fa69 | 800 | |
924bbf02 | 801 | if (cpp_interpret_string (parse_in, &strname, 1, &cstr, CPP_STRING)) |
8115b8be | 802 | { |
803 | XDELETEVEC (namep); | |
804 | return (const char *) cstr.text; | |
5fc7fa69 | 805 | } |
5fc7fa69 | 806 | |
807 | return namep; | |
65b7f83f | 808 | } |
809 | ||
05f9ea78 | 810 | /* Expand DECL if it declares an entity not handled by the |
811 | common code. */ | |
812 | ||
813 | int | |
814 | c_expand_decl (tree decl) | |
815 | { | |
816 | if (TREE_CODE (decl) == VAR_DECL && !TREE_STATIC (decl)) | |
817 | { | |
818 | /* Let the back-end know about this variable. */ | |
819 | if (!anon_aggr_type_p (TREE_TYPE (decl))) | |
a0c938f0 | 820 | emit_local_var (decl); |
05f9ea78 | 821 | else |
a0c938f0 | 822 | expand_anon_union_decl (decl, NULL_TREE, |
823 | DECL_ANON_UNION_ELEMS (decl)); | |
05f9ea78 | 824 | } |
05f9ea78 | 825 | else |
826 | return 0; | |
827 | ||
828 | return 1; | |
829 | } | |
830 | ||
831 | ||
65b7f83f | 832 | /* Return the VAR_DECL for a const char array naming the current |
833 | function. If the VAR_DECL has not yet been created, create it | |
834 | now. RID indicates how it should be formatted and IDENTIFIER_NODE | |
835 | ID is its name (unfortunately C and C++ hold the RID values of | |
836 | keywords in different places, so we can't derive RID from ID in | |
dd5b4b36 | 837 | this language independent code. */ |
65b7f83f | 838 | |
839 | tree | |
1cae46be | 840 | fname_decl (unsigned int rid, tree id) |
65b7f83f | 841 | { |
842 | unsigned ix; | |
843 | tree decl = NULL_TREE; | |
844 | ||
845 | for (ix = 0; fname_vars[ix].decl; ix++) | |
846 | if (fname_vars[ix].rid == rid) | |
847 | break; | |
848 | ||
849 | decl = *fname_vars[ix].decl; | |
850 | if (!decl) | |
f4e3c278 | 851 | { |
2222b3c6 | 852 | /* If a tree is built here, it would normally have the lineno of |
853 | the current statement. Later this tree will be moved to the | |
854 | beginning of the function and this line number will be wrong. | |
855 | To avoid this problem set the lineno to 0 here; that prevents | |
7299020b | 856 | it from appearing in the RTL. */ |
2363ef00 | 857 | tree stmts; |
9a6486a6 | 858 | location_t saved_location = input_location; |
9a6486a6 | 859 | input_location = UNKNOWN_LOCATION; |
1cae46be | 860 | |
2363ef00 | 861 | stmts = push_stmt_list (); |
65b7f83f | 862 | decl = (*make_fname_decl) (id, fname_vars[ix].pretty); |
2363ef00 | 863 | stmts = pop_stmt_list (stmts); |
864 | if (!IS_EMPTY_STMT (stmts)) | |
865 | saved_function_name_decls | |
866 | = tree_cons (decl, stmts, saved_function_name_decls); | |
65b7f83f | 867 | *fname_vars[ix].decl = decl; |
9a6486a6 | 868 | input_location = saved_location; |
f4e3c278 | 869 | } |
65b7f83f | 870 | if (!ix && !current_function_decl) |
cbb0dbb0 | 871 | pedwarn ("%qD is not defined outside of function scope", decl); |
81010c97 | 872 | |
65b7f83f | 873 | return decl; |
f4e3c278 | 874 | } |
875 | ||
070236f0 | 876 | /* Given a STRING_CST, give it a suitable array-of-chars data type. */ |
b0fc3e72 | 877 | |
878 | tree | |
1cae46be | 879 | fix_string_type (tree value) |
b0fc3e72 | 880 | { |
070236f0 | 881 | int length = TREE_STRING_LENGTH (value); |
882 | int nchars; | |
00d26680 | 883 | tree e_type, i_type, a_type; |
884 | ||
73be5127 | 885 | /* Compute the number of elements, for the array type. */ |
924bbf02 | 886 | if (TREE_TYPE (value) == char_array_type_node || !TREE_TYPE (value)) |
887 | { | |
888 | nchars = length; | |
889 | e_type = char_type_node; | |
890 | } | |
891 | else if (TREE_TYPE (value) == char16_array_type_node) | |
892 | { | |
893 | nchars = length / (TYPE_PRECISION (char16_type_node) / BITS_PER_UNIT); | |
894 | e_type = char16_type_node; | |
895 | } | |
896 | else if (TREE_TYPE (value) == char32_array_type_node) | |
897 | { | |
898 | nchars = length / (TYPE_PRECISION (char32_type_node) / BITS_PER_UNIT); | |
899 | e_type = char32_type_node; | |
900 | } | |
901 | else | |
902 | { | |
903 | nchars = length / (TYPE_PRECISION (wchar_type_node) / BITS_PER_UNIT); | |
904 | e_type = wchar_type_node; | |
905 | } | |
b0fc3e72 | 906 | |
1d752508 | 907 | /* C89 2.2.4.1, C99 5.2.4.1 (Translation limits). The analogous |
908 | limit in C++98 Annex B is very large (65536) and is not normative, | |
909 | so we do not diagnose it (warn_overlength_strings is forced off | |
910 | in c_common_post_options). */ | |
911 | if (warn_overlength_strings) | |
912 | { | |
913 | const int nchars_max = flag_isoc99 ? 4095 : 509; | |
914 | const int relevant_std = flag_isoc99 ? 99 : 90; | |
915 | if (nchars - 1 > nchars_max) | |
916 | /* Translators: The %d after 'ISO C' will be 90 or 99. Do not | |
917 | separate the %d from the 'C'. 'ISO' should not be | |
918 | translated, but it may be moved after 'C%d' in languages | |
919 | where modifiers follow nouns. */ | |
920 | pedwarn ("string length %qd is greater than the length %qd " | |
921 | "ISO C%d compilers are required to support", | |
922 | nchars - 1, nchars_max, relevant_std); | |
923 | } | |
82cfc7f7 | 924 | |
390be14e | 925 | /* Create the array type for the string constant. The ISO C++ |
926 | standard says that a string literal has type `const char[N]' or | |
927 | `const wchar_t[N]'. We use the same logic when invoked as a C | |
928 | front-end with -Wwrite-strings. | |
929 | ??? We should change the type of an expression depending on the | |
930 | state of a warning flag. We should just be warning -- see how | |
931 | this is handled in the C++ front-end for the deprecated implicit | |
932 | conversion from string literals to `char*' or `wchar_t*'. | |
00d26680 | 933 | |
934 | The C++ front end relies on TYPE_MAIN_VARIANT of a cv-qualified | |
935 | array type being the unqualified version of that type. | |
936 | Therefore, if we are constructing an array of const char, we must | |
937 | construct the matching unqualified array type first. The C front | |
938 | end does not require this, but it does no harm, so we do it | |
939 | unconditionally. */ | |
7016c612 | 940 | i_type = build_index_type (build_int_cst (NULL_TREE, nchars - 1)); |
00d26680 | 941 | a_type = build_array_type (e_type, i_type); |
390be14e | 942 | if (c_dialect_cxx() || warn_write_strings) |
aebc8537 | 943 | a_type = c_build_qualified_type (a_type, TYPE_QUAL_CONST); |
3a10ba35 | 944 | |
00d26680 | 945 | TREE_TYPE (value) = a_type; |
b8e3b7ad | 946 | TREE_CONSTANT (value) = 1; |
a814bad5 | 947 | TREE_READONLY (value) = 1; |
b0fc3e72 | 948 | TREE_STATIC (value) = 1; |
949 | return value; | |
950 | } | |
951 | \f | |
2a1736ed | 952 | /* Print a warning if a constant expression had overflow in folding. |
953 | Invoke this function on every expression that the language | |
954 | requires to be a constant expression. | |
955 | Note the ANSI C standard says it is erroneous for a | |
956 | constant expression to overflow. */ | |
b2806639 | 957 | |
958 | void | |
1cae46be | 959 | constant_expression_warning (tree value) |
07317e69 | 960 | { |
961 | if (warn_overflow && pedantic | |
962 | && (TREE_CODE (value) == INTEGER_CST || TREE_CODE (value) == REAL_CST | |
963 | || TREE_CODE (value) == FIXED_CST | |
964 | || TREE_CODE (value) == VECTOR_CST | |
965 | || TREE_CODE (value) == COMPLEX_CST) | |
966 | && TREE_OVERFLOW (value)) | |
967 | pedwarn ("overflow in constant expression"); | |
968 | } | |
969 | ||
970 | /* The same as above but print an unconditional error. */ | |
971 | void | |
972 | constant_expression_error (tree value) | |
b2806639 | 973 | { |
837e1122 | 974 | if ((TREE_CODE (value) == INTEGER_CST || TREE_CODE (value) == REAL_CST |
9421ebb9 | 975 | || TREE_CODE (value) == FIXED_CST |
886cfd4f | 976 | || TREE_CODE (value) == VECTOR_CST |
837e1122 | 977 | || TREE_CODE (value) == COMPLEX_CST) |
07317e69 | 978 | && TREE_OVERFLOW (value)) |
979 | error ("overflow in constant expression"); | |
2a1736ed | 980 | } |
981 | ||
f170d67f | 982 | /* Print a warning if an expression had overflow in folding and its |
983 | operands hadn't. | |
984 | ||
2a1736ed | 985 | Invoke this function on every expression that |
986 | (1) appears in the source code, and | |
f170d67f | 987 | (2) is a constant expression that overflowed, and |
2a1736ed | 988 | (3) is not already checked by convert_and_check; |
f170d67f | 989 | however, do not invoke this function on operands of explicit casts |
990 | or when the expression is the result of an operator and any operand | |
991 | already overflowed. */ | |
2a1736ed | 992 | |
993 | void | |
1cae46be | 994 | overflow_warning (tree value) |
2a1736ed | 995 | { |
f170d67f | 996 | if (skip_evaluation) return; |
997 | ||
998 | switch (TREE_CODE (value)) | |
886cfd4f | 999 | { |
f170d67f | 1000 | case INTEGER_CST: |
1001 | warning (OPT_Woverflow, "integer overflow in expression"); | |
1002 | break; | |
1003 | ||
1004 | case REAL_CST: | |
1005 | warning (OPT_Woverflow, "floating point overflow in expression"); | |
1006 | break; | |
1007 | ||
9421ebb9 | 1008 | case FIXED_CST: |
1009 | warning (OPT_Woverflow, "fixed-point overflow in expression"); | |
1010 | break; | |
1011 | ||
f170d67f | 1012 | case VECTOR_CST: |
1013 | warning (OPT_Woverflow, "vector overflow in expression"); | |
1014 | break; | |
1015 | ||
1016 | case COMPLEX_CST: | |
1017 | if (TREE_CODE (TREE_REALPART (value)) == INTEGER_CST) | |
1018 | warning (OPT_Woverflow, "complex integer overflow in expression"); | |
1019 | else if (TREE_CODE (TREE_REALPART (value)) == REAL_CST) | |
1020 | warning (OPT_Woverflow, "complex floating point overflow in expression"); | |
1021 | break; | |
1022 | ||
1023 | default: | |
1024 | break; | |
886cfd4f | 1025 | } |
2a1736ed | 1026 | } |
1027 | ||
b13d1547 | 1028 | |
1029 | /* Warn about use of a logical || / && operator being used in a | |
1030 | context where it is likely that the bitwise equivalent was intended | |
1031 | by the programmer. CODE is the TREE_CODE of the operator, ARG1 | |
1032 | and ARG2 the arguments. */ | |
1033 | ||
1034 | void | |
1035 | warn_logical_operator (enum tree_code code, tree arg1, tree | |
1036 | arg2) | |
1037 | { | |
1038 | switch (code) | |
1039 | { | |
1040 | case TRUTH_ANDIF_EXPR: | |
1041 | case TRUTH_ORIF_EXPR: | |
1042 | case TRUTH_OR_EXPR: | |
1043 | case TRUTH_AND_EXPR: | |
e6978426 | 1044 | if (!TREE_NO_WARNING (arg1) |
1045 | && INTEGRAL_TYPE_P (TREE_TYPE (arg1)) | |
1046 | && !CONSTANT_CLASS_P (arg1) | |
1047 | && TREE_CODE (arg2) == INTEGER_CST | |
1048 | && !integer_zerop (arg2)) | |
1049 | { | |
1050 | warning (OPT_Wlogical_op, | |
1051 | "logical %<%s%> with non-zero constant " | |
1052 | "will always evaluate as true", | |
1053 | ((code == TRUTH_ANDIF_EXPR) | |
1054 | || (code == TRUTH_AND_EXPR)) ? "&&" : "||"); | |
1055 | TREE_NO_WARNING (arg1) = true; | |
1056 | } | |
1057 | break; | |
b13d1547 | 1058 | default: |
e6978426 | 1059 | break; |
b13d1547 | 1060 | } |
1061 | } | |
1062 | ||
1063 | ||
bcf22371 | 1064 | /* Print a warning about casts that might indicate violation |
1065 | of strict aliasing rules if -Wstrict-aliasing is used and | |
1e31ff37 | 1066 | strict aliasing mode is in effect. OTYPE is the original |
1067 | TREE_TYPE of EXPR, and TYPE the type we're casting to. */ | |
bcf22371 | 1068 | |
e6fa0ea6 | 1069 | bool |
1e31ff37 | 1070 | strict_aliasing_warning (tree otype, tree type, tree expr) |
bcf22371 | 1071 | { |
e6fa0ea6 | 1072 | if (!(flag_strict_aliasing && POINTER_TYPE_P (type) |
1073 | && POINTER_TYPE_P (otype) && !VOID_TYPE_P (TREE_TYPE (type)))) | |
1074 | return false; | |
1075 | ||
1076 | if ((warn_strict_aliasing > 1) && TREE_CODE (expr) == ADDR_EXPR | |
bcf22371 | 1077 | && (DECL_P (TREE_OPERAND (expr, 0)) |
e6fa0ea6 | 1078 | || handled_component_p (TREE_OPERAND (expr, 0)))) |
bcf22371 | 1079 | { |
1080 | /* Casting the address of an object to non void pointer. Warn | |
1081 | if the cast breaks type based aliasing. */ | |
e6fa0ea6 | 1082 | if (!COMPLETE_TYPE_P (TREE_TYPE (type)) && warn_strict_aliasing == 2) |
1083 | { | |
1084 | warning (OPT_Wstrict_aliasing, "type-punning to incomplete type " | |
1085 | "might break strict-aliasing rules"); | |
1086 | return true; | |
1087 | } | |
bcf22371 | 1088 | else |
1089 | { | |
e6fa0ea6 | 1090 | /* warn_strict_aliasing >= 3. This includes the default (3). |
1091 | Only warn if the cast is dereferenced immediately. */ | |
32c2fdea | 1092 | alias_set_type set1 = |
e6fa0ea6 | 1093 | get_alias_set (TREE_TYPE (TREE_OPERAND (expr, 0))); |
32c2fdea | 1094 | alias_set_type set2 = get_alias_set (TREE_TYPE (type)); |
bcf22371 | 1095 | |
62d823d0 | 1096 | if (set1 != set2 && set2 != 0 |
1097 | && (set1 == 0 || !alias_sets_conflict_p (set1, set2))) | |
e6fa0ea6 | 1098 | { |
1099 | warning (OPT_Wstrict_aliasing, "dereferencing type-punned " | |
1100 | "pointer will break strict-aliasing rules"); | |
1101 | return true; | |
1102 | } | |
1103 | else if (warn_strict_aliasing == 2 | |
879f881c | 1104 | && !alias_sets_must_conflict_p (set1, set2)) |
e6fa0ea6 | 1105 | { |
1106 | warning (OPT_Wstrict_aliasing, "dereferencing type-punned " | |
1107 | "pointer might break strict-aliasing rules"); | |
1108 | return true; | |
1109 | } | |
bcf22371 | 1110 | } |
1111 | } | |
e6fa0ea6 | 1112 | else |
1113 | if ((warn_strict_aliasing == 1) && !VOID_TYPE_P (TREE_TYPE (otype))) | |
1114 | { | |
1115 | /* At this level, warn for any conversions, even if an address is | |
1116 | not taken in the same statement. This will likely produce many | |
1117 | false positives, but could be useful to pinpoint problems that | |
1118 | are not revealed at higher levels. */ | |
32c2fdea | 1119 | alias_set_type set1 = get_alias_set (TREE_TYPE (otype)); |
1120 | alias_set_type set2 = get_alias_set (TREE_TYPE (type)); | |
1121 | if (!COMPLETE_TYPE_P (type) | |
879f881c | 1122 | || !alias_sets_must_conflict_p (set1, set2)) |
e6fa0ea6 | 1123 | { |
1124 | warning (OPT_Wstrict_aliasing, "dereferencing type-punned " | |
1125 | "pointer might break strict-aliasing rules"); | |
1126 | return true; | |
1127 | } | |
1128 | } | |
1129 | ||
1130 | return false; | |
bcf22371 | 1131 | } |
1132 | ||
50247dd9 | 1133 | /* Print a warning about if (); or if () .. else; constructs |
1134 | via the special empty statement node that we create. INNER_THEN | |
1135 | and INNER_ELSE are the statement lists of the if and the else | |
1136 | block. */ | |
1137 | ||
1138 | void | |
ffe8fd56 | 1139 | empty_if_body_warning (tree inner_then, tree inner_else) |
50247dd9 | 1140 | { |
ffe8fd56 | 1141 | if (TREE_CODE (inner_then) == STATEMENT_LIST |
1142 | && STATEMENT_LIST_TAIL (inner_then)) | |
1143 | inner_then = STATEMENT_LIST_TAIL (inner_then)->stmt; | |
1144 | ||
1145 | if (inner_else && TREE_CODE (inner_else) == STATEMENT_LIST | |
1146 | && STATEMENT_LIST_TAIL (inner_else)) | |
1147 | inner_else = STATEMENT_LIST_TAIL (inner_else)->stmt; | |
1148 | ||
1149 | if (IS_EMPTY_STMT (inner_then) && !inner_else) | |
1150 | warning (OPT_Wempty_body, "%Hsuggest braces around empty body " | |
1151 | "in an %<if%> statement", EXPR_LOCUS (inner_then)); | |
1152 | ||
1153 | else if (inner_else && IS_EMPTY_STMT (inner_else)) | |
1154 | warning (OPT_Wempty_body, "%Hsuggest braces around empty body " | |
1155 | "in an %<else%> statement", EXPR_LOCUS (inner_else)); | |
50247dd9 | 1156 | } |
1157 | ||
3f08e399 | 1158 | /* Warn for unlikely, improbable, or stupid DECL declarations |
1159 | of `main'. */ | |
1160 | ||
1161 | void | |
1162 | check_main_parameter_types (tree decl) | |
1163 | { | |
1164 | tree args; | |
1165 | int argct = 0; | |
1166 | ||
1167 | for (args = TYPE_ARG_TYPES (TREE_TYPE (decl)); args; | |
1168 | args = TREE_CHAIN (args)) | |
1169 | { | |
1170 | tree type = args ? TREE_VALUE (args) : 0; | |
1171 | ||
7accad14 | 1172 | if (type == void_type_node || type == error_mark_node ) |
3f08e399 | 1173 | break; |
1174 | ||
1175 | ++argct; | |
1176 | switch (argct) | |
1177 | { | |
1178 | case 1: | |
1179 | if (TYPE_MAIN_VARIANT (type) != integer_type_node) | |
1180 | pedwarn ("first argument of %q+D should be %<int%>", decl); | |
1181 | break; | |
1182 | ||
1183 | case 2: | |
1184 | if (TREE_CODE (type) != POINTER_TYPE | |
1185 | || TREE_CODE (TREE_TYPE (type)) != POINTER_TYPE | |
1186 | || (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (type))) | |
1187 | != char_type_node)) | |
1188 | pedwarn ("second argument of %q+D should be %<char **%>", | |
1189 | decl); | |
1190 | break; | |
1191 | ||
1192 | case 3: | |
1193 | if (TREE_CODE (type) != POINTER_TYPE | |
1194 | || TREE_CODE (TREE_TYPE (type)) != POINTER_TYPE | |
1195 | || (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (type))) | |
1196 | != char_type_node)) | |
1197 | pedwarn ("third argument of %q+D should probably be " | |
1198 | "%<char **%>", decl); | |
1199 | break; | |
1200 | } | |
1201 | } | |
1202 | ||
1203 | /* It is intentional that this message does not mention the third | |
1204 | argument because it's only mentioned in an appendix of the | |
1205 | standard. */ | |
1206 | if (argct > 0 && (argct < 2 || argct > 3)) | |
1207 | pedwarn ("%q+D takes only zero or two arguments", decl); | |
1208 | } | |
1209 | ||
ed7c4e62 | 1210 | /* True if pointers to distinct types T1 and T2 can be converted to |
1211 | each other without an explicit cast. Only returns true for opaque | |
1212 | vector types. */ | |
1213 | bool | |
1214 | vector_targets_convertible_p (const_tree t1, const_tree t2) | |
1215 | { | |
1216 | if (TREE_CODE (t1) == VECTOR_TYPE && TREE_CODE (t2) == VECTOR_TYPE | |
1217 | && (targetm.vector_opaque_p (t1) || targetm.vector_opaque_p (t2)) | |
1218 | && tree_int_cst_equal (TYPE_SIZE (t1), TYPE_SIZE (t2))) | |
1219 | return true; | |
1220 | ||
1221 | return false; | |
1222 | } | |
1223 | ||
546c4794 | 1224 | /* True if vector types T1 and T2 can be converted to each other |
1225 | without an explicit cast. If EMIT_LAX_NOTE is true, and T1 and T2 | |
1226 | can only be converted with -flax-vector-conversions yet that is not | |
1227 | in effect, emit a note telling the user about that option if such | |
1228 | a note has not previously been emitted. */ | |
1229 | bool | |
9f627b1a | 1230 | vector_types_convertible_p (const_tree t1, const_tree t2, bool emit_lax_note) |
8b4b9810 | 1231 | { |
546c4794 | 1232 | static bool emitted_lax_note = false; |
ae6db8ab | 1233 | bool convertible_lax; |
1234 | ||
1235 | if ((targetm.vector_opaque_p (t1) || targetm.vector_opaque_p (t2)) | |
1236 | && tree_int_cst_equal (TYPE_SIZE (t1), TYPE_SIZE (t2))) | |
1237 | return true; | |
1238 | ||
1239 | convertible_lax = | |
1240 | (tree_int_cst_equal (TYPE_SIZE (t1), TYPE_SIZE (t2)) | |
1241 | && (TREE_CODE (TREE_TYPE (t1)) != REAL_TYPE || | |
1242 | TYPE_PRECISION (t1) == TYPE_PRECISION (t2)) | |
1243 | && (INTEGRAL_TYPE_P (TREE_TYPE (t1)) | |
1244 | == INTEGRAL_TYPE_P (TREE_TYPE (t2)))); | |
546c4794 | 1245 | |
1246 | if (!convertible_lax || flag_lax_vector_conversions) | |
1247 | return convertible_lax; | |
1248 | ||
1249 | if (TYPE_VECTOR_SUBPARTS (t1) == TYPE_VECTOR_SUBPARTS (t2) | |
29f51994 | 1250 | && lang_hooks.types_compatible_p (TREE_TYPE (t1), TREE_TYPE (t2))) |
546c4794 | 1251 | return true; |
1252 | ||
1253 | if (emit_lax_note && !emitted_lax_note) | |
1254 | { | |
1255 | emitted_lax_note = true; | |
1256 | inform ("use -flax-vector-conversions to permit " | |
1257 | "conversions between vectors with differing " | |
1258 | "element types or numbers of subparts"); | |
1259 | } | |
1260 | ||
1261 | return false; | |
8b4b9810 | 1262 | } |
1263 | ||
d31d55f0 | 1264 | /* Warns if the conversion of EXPR to TYPE may alter a value. |
59dd8856 | 1265 | This is a helper function for warnings_for_convert_and_check. */ |
d31d55f0 | 1266 | |
1267 | static void | |
1268 | conversion_warning (tree type, tree expr) | |
1269 | { | |
1270 | bool give_warning = false; | |
1271 | ||
1272 | unsigned int formal_prec = TYPE_PRECISION (type); | |
1273 | ||
7ee0d227 | 1274 | if (!warn_conversion && !warn_sign_conversion) |
1275 | return; | |
1276 | ||
d31d55f0 | 1277 | if (TREE_CODE (expr) == REAL_CST || TREE_CODE (expr) == INTEGER_CST) |
1278 | { | |
1279 | /* Warn for real constant that is not an exact integer converted | |
1280 | to integer type. */ | |
1281 | if (TREE_CODE (TREE_TYPE (expr)) == REAL_TYPE | |
1282 | && TREE_CODE (type) == INTEGER_TYPE) | |
1283 | { | |
1284 | if (!real_isinteger (TREE_REAL_CST_PTR (expr), TYPE_MODE (TREE_TYPE (expr)))) | |
1285 | give_warning = true; | |
1286 | } | |
da1fb07b | 1287 | /* Warn for an integer constant that does not fit into integer type. */ |
d31d55f0 | 1288 | else if (TREE_CODE (TREE_TYPE (expr)) == INTEGER_TYPE |
1289 | && TREE_CODE (type) == INTEGER_TYPE | |
da1fb07b | 1290 | && !int_fits_type_p (expr, type)) |
1291 | { | |
1292 | if (TYPE_UNSIGNED (type) && !TYPE_UNSIGNED (TREE_TYPE (expr))) | |
7ee0d227 | 1293 | warning (OPT_Wsign_conversion, |
1294 | "negative integer implicitly converted to unsigned type"); | |
1295 | else if (!TYPE_UNSIGNED (type) && TYPE_UNSIGNED (TREE_TYPE (expr))) | |
1296 | warning (OPT_Wsign_conversion, | |
1297 | "conversion of unsigned constant value to negative integer"); | |
1298 | else | |
1299 | give_warning = true; | |
da1fb07b | 1300 | } |
d31d55f0 | 1301 | else if (TREE_CODE (type) == REAL_TYPE) |
1302 | { | |
1303 | /* Warn for an integer constant that does not fit into real type. */ | |
1304 | if (TREE_CODE (TREE_TYPE (expr)) == INTEGER_TYPE) | |
1305 | { | |
1306 | REAL_VALUE_TYPE a = real_value_from_int_cst (0, expr); | |
1307 | if (!exact_real_truncate (TYPE_MODE (type), &a)) | |
1308 | give_warning = true; | |
1309 | } | |
1310 | /* Warn for a real constant that does not fit into a smaller | |
1311 | real type. */ | |
1312 | else if (TREE_CODE (TREE_TYPE (expr)) == REAL_TYPE | |
1313 | && formal_prec < TYPE_PRECISION (TREE_TYPE (expr))) | |
1314 | { | |
1315 | REAL_VALUE_TYPE a = TREE_REAL_CST (expr); | |
1316 | if (!exact_real_truncate (TYPE_MODE (type), &a)) | |
1317 | give_warning = true; | |
1318 | } | |
1319 | } | |
1320 | ||
1321 | if (give_warning) | |
1322 | warning (OPT_Wconversion, | |
1323 | "conversion to %qT alters %qT constant value", | |
1324 | type, TREE_TYPE (expr)); | |
1325 | } | |
1326 | else /* 'expr' is not a constant. */ | |
1327 | { | |
1328 | /* Warn for real types converted to integer types. */ | |
1329 | if (TREE_CODE (TREE_TYPE (expr)) == REAL_TYPE | |
1330 | && TREE_CODE (type) == INTEGER_TYPE) | |
1331 | give_warning = true; | |
1332 | ||
1333 | else if (TREE_CODE (TREE_TYPE (expr)) == INTEGER_TYPE | |
1334 | && TREE_CODE (type) == INTEGER_TYPE) | |
1335 | { | |
69609004 | 1336 | /* Don't warn about unsigned char y = 0xff, x = (int) y; */ |
f9d856a4 | 1337 | expr = get_unwidened (expr, 0); |
69609004 | 1338 | |
d31d55f0 | 1339 | /* Warn for integer types converted to smaller integer types. */ |
7ee0d227 | 1340 | if (formal_prec < TYPE_PRECISION (TREE_TYPE (expr))) |
1341 | give_warning = true; | |
1342 | ||
1343 | /* When they are the same width but different signedness, | |
1344 | then the value may change. */ | |
1345 | else if ((formal_prec == TYPE_PRECISION (TREE_TYPE (expr)) | |
f9d856a4 | 1346 | && TYPE_UNSIGNED (TREE_TYPE (expr)) != TYPE_UNSIGNED (type)) |
7ee0d227 | 1347 | /* Even when converted to a bigger type, if the type is |
1348 | unsigned but expr is signed, then negative values | |
1349 | will be changed. */ | |
f9d856a4 | 1350 | || (TYPE_UNSIGNED (type) && !TYPE_UNSIGNED (TREE_TYPE (expr)))) |
1351 | warning (OPT_Wsign_conversion, | |
1352 | "conversion to %qT from %qT may change the sign of the result", | |
1353 | type, TREE_TYPE (expr)); | |
d31d55f0 | 1354 | } |
1355 | ||
1356 | /* Warn for integer types converted to real types if and only if | |
1357 | all the range of values of the integer type cannot be | |
1358 | represented by the real type. */ | |
1359 | else if (TREE_CODE (TREE_TYPE (expr)) == INTEGER_TYPE | |
1360 | && TREE_CODE (type) == REAL_TYPE) | |
1361 | { | |
1362 | tree type_low_bound = TYPE_MIN_VALUE (TREE_TYPE (expr)); | |
1363 | tree type_high_bound = TYPE_MAX_VALUE (TREE_TYPE (expr)); | |
1364 | REAL_VALUE_TYPE real_low_bound = real_value_from_int_cst (0, type_low_bound); | |
1365 | REAL_VALUE_TYPE real_high_bound = real_value_from_int_cst (0, type_high_bound); | |
1366 | ||
1367 | if (!exact_real_truncate (TYPE_MODE (type), &real_low_bound) | |
1368 | || !exact_real_truncate (TYPE_MODE (type), &real_high_bound)) | |
1369 | give_warning = true; | |
1370 | } | |
1371 | ||
1372 | /* Warn for real types converted to smaller real types. */ | |
1373 | else if (TREE_CODE (TREE_TYPE (expr)) == REAL_TYPE | |
1374 | && TREE_CODE (type) == REAL_TYPE | |
1375 | && formal_prec < TYPE_PRECISION (TREE_TYPE (expr))) | |
1376 | give_warning = true; | |
1377 | ||
1378 | ||
1379 | if (give_warning) | |
1380 | warning (OPT_Wconversion, | |
1381 | "conversion to %qT from %qT may alter its value", | |
1382 | type, TREE_TYPE (expr)); | |
1383 | } | |
1384 | } | |
1385 | ||
59dd8856 | 1386 | /* Produce warnings after a conversion. RESULT is the result of |
1387 | converting EXPR to TYPE. This is a helper function for | |
1388 | convert_and_check and cp_convert_and_check. */ | |
2a1736ed | 1389 | |
59dd8856 | 1390 | void |
1391 | warnings_for_convert_and_check (tree type, tree expr, tree result) | |
2a1736ed | 1392 | { |
da1fb07b | 1393 | if (TREE_CODE (expr) == INTEGER_CST |
1394 | && (TREE_CODE (type) == INTEGER_TYPE | |
1395 | || TREE_CODE (type) == ENUMERAL_TYPE) | |
1396 | && !int_fits_type_p (expr, type)) | |
1397 | { | |
d31d55f0 | 1398 | /* Do not diagnose overflow in a constant expression merely |
1399 | because a conversion overflowed. */ | |
da1fb07b | 1400 | if (TREE_OVERFLOW (result)) |
eddad94a | 1401 | TREE_OVERFLOW (result) = TREE_OVERFLOW (expr); |
1402 | ||
da1fb07b | 1403 | if (TYPE_UNSIGNED (type)) |
d31d55f0 | 1404 | { |
da1fb07b | 1405 | /* This detects cases like converting -129 or 256 to |
1406 | unsigned char. */ | |
1407 | if (!int_fits_type_p (expr, c_common_signed_type (type))) | |
1408 | warning (OPT_Woverflow, | |
1409 | "large integer implicitly truncated to unsigned type"); | |
7ee0d227 | 1410 | else |
da1fb07b | 1411 | conversion_warning (type, expr); |
1412 | } | |
11773141 | 1413 | else if (!int_fits_type_p (expr, c_common_unsigned_type (type))) |
e0913805 | 1414 | warning (OPT_Woverflow, |
1415 | "overflow in implicit constant conversion"); | |
1416 | /* No warning for converting 0x80000000 to int. */ | |
1417 | else if (pedantic | |
1418 | && (TREE_CODE (TREE_TYPE (expr)) != INTEGER_TYPE | |
1419 | || TYPE_PRECISION (TREE_TYPE (expr)) | |
1420 | != TYPE_PRECISION (type))) | |
1421 | warning (OPT_Woverflow, | |
1422 | "overflow in implicit constant conversion"); | |
1423 | ||
7ee0d227 | 1424 | else |
e0913805 | 1425 | conversion_warning (type, expr); |
2a1736ed | 1426 | } |
9421ebb9 | 1427 | else if ((TREE_CODE (result) == INTEGER_CST |
1428 | || TREE_CODE (result) == FIXED_CST) && TREE_OVERFLOW (result)) | |
da1fb07b | 1429 | warning (OPT_Woverflow, |
1430 | "overflow in implicit constant conversion"); | |
7ee0d227 | 1431 | else |
da1fb07b | 1432 | conversion_warning (type, expr); |
59dd8856 | 1433 | } |
1434 | ||
1435 | ||
1436 | /* Convert EXPR to TYPE, warning about conversion problems with constants. | |
1437 | Invoke this function on every expression that is converted implicitly, | |
1438 | i.e. because of language rules and not because of an explicit cast. */ | |
1439 | ||
1440 | tree | |
1441 | convert_and_check (tree type, tree expr) | |
1442 | { | |
1443 | tree result; | |
1444 | ||
1445 | if (TREE_TYPE (expr) == type) | |
1446 | return expr; | |
da1fb07b | 1447 | |
59dd8856 | 1448 | result = convert (type, expr); |
1449 | ||
7ee0d227 | 1450 | if (!skip_evaluation && !TREE_OVERFLOW_P (expr) && result != error_mark_node) |
59dd8856 | 1451 | warnings_for_convert_and_check (type, expr, result); |
1452 | ||
da1fb07b | 1453 | return result; |
b2806639 | 1454 | } |
1455 | \f | |
4e91a871 | 1456 | /* A node in a list that describes references to variables (EXPR), which are |
1457 | either read accesses if WRITER is zero, or write accesses, in which case | |
1458 | WRITER is the parent of EXPR. */ | |
1459 | struct tlist | |
1460 | { | |
1461 | struct tlist *next; | |
1462 | tree expr, writer; | |
1463 | }; | |
1464 | ||
1465 | /* Used to implement a cache the results of a call to verify_tree. We only | |
1466 | use this for SAVE_EXPRs. */ | |
1467 | struct tlist_cache | |
1468 | { | |
1469 | struct tlist_cache *next; | |
1470 | struct tlist *cache_before_sp; | |
1471 | struct tlist *cache_after_sp; | |
1472 | tree expr; | |
481c6ce6 | 1473 | }; |
1474 | ||
4e91a871 | 1475 | /* Obstack to use when allocating tlist structures, and corresponding |
1476 | firstobj. */ | |
1477 | static struct obstack tlist_obstack; | |
1478 | static char *tlist_firstobj = 0; | |
1479 | ||
1480 | /* Keep track of the identifiers we've warned about, so we can avoid duplicate | |
1481 | warnings. */ | |
1482 | static struct tlist *warned_ids; | |
1483 | /* SAVE_EXPRs need special treatment. We process them only once and then | |
1484 | cache the results. */ | |
1485 | static struct tlist_cache *save_expr_cache; | |
1486 | ||
1cae46be | 1487 | static void add_tlist (struct tlist **, struct tlist *, tree, int); |
1488 | static void merge_tlist (struct tlist **, struct tlist *, int); | |
1489 | static void verify_tree (tree, struct tlist **, struct tlist **, tree); | |
1490 | static int warning_candidate_p (tree); | |
1491 | static void warn_for_collisions (struct tlist *); | |
1492 | static void warn_for_collisions_1 (tree, tree, struct tlist *, int); | |
1493 | static struct tlist *new_tlist (struct tlist *, tree, tree); | |
481c6ce6 | 1494 | |
4e91a871 | 1495 | /* Create a new struct tlist and fill in its fields. */ |
1496 | static struct tlist * | |
1cae46be | 1497 | new_tlist (struct tlist *next, tree t, tree writer) |
4e91a871 | 1498 | { |
1499 | struct tlist *l; | |
9318f22c | 1500 | l = XOBNEW (&tlist_obstack, struct tlist); |
4e91a871 | 1501 | l->next = next; |
1502 | l->expr = t; | |
1503 | l->writer = writer; | |
1504 | return l; | |
1505 | } | |
1506 | ||
1507 | /* Add duplicates of the nodes found in ADD to the list *TO. If EXCLUDE_WRITER | |
1508 | is nonnull, we ignore any node we find which has a writer equal to it. */ | |
1509 | ||
1510 | static void | |
1cae46be | 1511 | add_tlist (struct tlist **to, struct tlist *add, tree exclude_writer, int copy) |
4e91a871 | 1512 | { |
1513 | while (add) | |
1514 | { | |
1515 | struct tlist *next = add->next; | |
84166705 | 1516 | if (!copy) |
4e91a871 | 1517 | add->next = *to; |
84166705 | 1518 | if (!exclude_writer || add->writer != exclude_writer) |
4e91a871 | 1519 | *to = copy ? new_tlist (*to, add->expr, add->writer) : add; |
1520 | add = next; | |
1521 | } | |
1522 | } | |
1523 | ||
1524 | /* Merge the nodes of ADD into TO. This merging process is done so that for | |
1525 | each variable that already exists in TO, no new node is added; however if | |
1526 | there is a write access recorded in ADD, and an occurrence on TO is only | |
1527 | a read access, then the occurrence in TO will be modified to record the | |
1528 | write. */ | |
481c6ce6 | 1529 | |
1530 | static void | |
1cae46be | 1531 | merge_tlist (struct tlist **to, struct tlist *add, int copy) |
4e91a871 | 1532 | { |
1533 | struct tlist **end = to; | |
1534 | ||
1535 | while (*end) | |
1536 | end = &(*end)->next; | |
1537 | ||
1538 | while (add) | |
1539 | { | |
1540 | int found = 0; | |
1541 | struct tlist *tmp2; | |
1542 | struct tlist *next = add->next; | |
1543 | ||
1544 | for (tmp2 = *to; tmp2; tmp2 = tmp2->next) | |
1545 | if (tmp2->expr == add->expr) | |
1546 | { | |
1547 | found = 1; | |
84166705 | 1548 | if (!tmp2->writer) |
4e91a871 | 1549 | tmp2->writer = add->writer; |
1550 | } | |
84166705 | 1551 | if (!found) |
4e91a871 | 1552 | { |
1553 | *end = copy ? add : new_tlist (NULL, add->expr, add->writer); | |
1554 | end = &(*end)->next; | |
1555 | *end = 0; | |
1556 | } | |
1557 | add = next; | |
1558 | } | |
1559 | } | |
1560 | ||
1561 | /* WRITTEN is a variable, WRITER is its parent. Warn if any of the variable | |
1562 | references in list LIST conflict with it, excluding reads if ONLY writers | |
1563 | is nonzero. */ | |
1564 | ||
1565 | static void | |
1cae46be | 1566 | warn_for_collisions_1 (tree written, tree writer, struct tlist *list, |
1567 | int only_writes) | |
4e91a871 | 1568 | { |
1569 | struct tlist *tmp; | |
1570 | ||
1571 | /* Avoid duplicate warnings. */ | |
1572 | for (tmp = warned_ids; tmp; tmp = tmp->next) | |
1573 | if (tmp->expr == written) | |
1574 | return; | |
1575 | ||
1576 | while (list) | |
1577 | { | |
1578 | if (list->expr == written | |
1579 | && list->writer != writer | |
84166705 | 1580 | && (!only_writes || list->writer) |
e4323659 | 1581 | && DECL_NAME (list->expr)) |
4e91a871 | 1582 | { |
1583 | warned_ids = new_tlist (warned_ids, written, NULL_TREE); | |
23ce1cf6 | 1584 | warning (OPT_Wsequence_point, "operation on %qE may be undefined", |
1585 | list->expr); | |
4e91a871 | 1586 | } |
1587 | list = list->next; | |
1588 | } | |
1589 | } | |
1590 | ||
1591 | /* Given a list LIST of references to variables, find whether any of these | |
1592 | can cause conflicts due to missing sequence points. */ | |
1593 | ||
1594 | static void | |
1cae46be | 1595 | warn_for_collisions (struct tlist *list) |
4e91a871 | 1596 | { |
1597 | struct tlist *tmp; | |
1cae46be | 1598 | |
4e91a871 | 1599 | for (tmp = list; tmp; tmp = tmp->next) |
1600 | { | |
1601 | if (tmp->writer) | |
1602 | warn_for_collisions_1 (tmp->expr, tmp->writer, list, 0); | |
1603 | } | |
1604 | } | |
1605 | ||
734c98be | 1606 | /* Return nonzero if X is a tree that can be verified by the sequence point |
4e91a871 | 1607 | warnings. */ |
1608 | static int | |
1cae46be | 1609 | warning_candidate_p (tree x) |
481c6ce6 | 1610 | { |
4e91a871 | 1611 | return TREE_CODE (x) == VAR_DECL || TREE_CODE (x) == PARM_DECL; |
1612 | } | |
481c6ce6 | 1613 | |
4e91a871 | 1614 | /* Walk the tree X, and record accesses to variables. If X is written by the |
1615 | parent tree, WRITER is the parent. | |
1616 | We store accesses in one of the two lists: PBEFORE_SP, and PNO_SP. If this | |
1617 | expression or its only operand forces a sequence point, then everything up | |
1618 | to the sequence point is stored in PBEFORE_SP. Everything else gets stored | |
1619 | in PNO_SP. | |
1620 | Once we return, we will have emitted warnings if any subexpression before | |
1621 | such a sequence point could be undefined. On a higher level, however, the | |
1622 | sequence point may not be relevant, and we'll merge the two lists. | |
1623 | ||
1624 | Example: (b++, a) + b; | |
1625 | The call that processes the COMPOUND_EXPR will store the increment of B | |
1626 | in PBEFORE_SP, and the use of A in PNO_SP. The higher-level call that | |
1627 | processes the PLUS_EXPR will need to merge the two lists so that | |
1628 | eventually, all accesses end up on the same list (and we'll warn about the | |
1629 | unordered subexpressions b++ and b. | |
1630 | ||
1631 | A note on merging. If we modify the former example so that our expression | |
1632 | becomes | |
1633 | (b++, b) + a | |
1634 | care must be taken not simply to add all three expressions into the final | |
1635 | PNO_SP list. The function merge_tlist takes care of that by merging the | |
1636 | before-SP list of the COMPOUND_EXPR into its after-SP list in a special | |
1637 | way, so that no more than one access to B is recorded. */ | |
481c6ce6 | 1638 | |
4e91a871 | 1639 | static void |
1cae46be | 1640 | verify_tree (tree x, struct tlist **pbefore_sp, struct tlist **pno_sp, |
1641 | tree writer) | |
4e91a871 | 1642 | { |
1643 | struct tlist *tmp_before, *tmp_nosp, *tmp_list2, *tmp_list3; | |
1644 | enum tree_code code; | |
ce45a448 | 1645 | enum tree_code_class cl; |
481c6ce6 | 1646 | |
e5b75768 | 1647 | /* X may be NULL if it is the operand of an empty statement expression |
1648 | ({ }). */ | |
1649 | if (x == NULL) | |
1650 | return; | |
1651 | ||
4e91a871 | 1652 | restart: |
1653 | code = TREE_CODE (x); | |
e916c70c | 1654 | cl = TREE_CODE_CLASS (code); |
481c6ce6 | 1655 | |
4e91a871 | 1656 | if (warning_candidate_p (x)) |
481c6ce6 | 1657 | { |
4e91a871 | 1658 | *pno_sp = new_tlist (*pno_sp, x, writer); |
1659 | return; | |
1660 | } | |
1661 | ||
1662 | switch (code) | |
1663 | { | |
67b28e3e | 1664 | case CONSTRUCTOR: |
1665 | return; | |
1666 | ||
4e91a871 | 1667 | case COMPOUND_EXPR: |
1668 | case TRUTH_ANDIF_EXPR: | |
1669 | case TRUTH_ORIF_EXPR: | |
1670 | tmp_before = tmp_nosp = tmp_list3 = 0; | |
1671 | verify_tree (TREE_OPERAND (x, 0), &tmp_before, &tmp_nosp, NULL_TREE); | |
1672 | warn_for_collisions (tmp_nosp); | |
1673 | merge_tlist (pbefore_sp, tmp_before, 0); | |
1674 | merge_tlist (pbefore_sp, tmp_nosp, 0); | |
1675 | verify_tree (TREE_OPERAND (x, 1), &tmp_list3, pno_sp, NULL_TREE); | |
1676 | merge_tlist (pbefore_sp, tmp_list3, 0); | |
1677 | return; | |
1678 | ||
1679 | case COND_EXPR: | |
1680 | tmp_before = tmp_list2 = 0; | |
1681 | verify_tree (TREE_OPERAND (x, 0), &tmp_before, &tmp_list2, NULL_TREE); | |
1682 | warn_for_collisions (tmp_list2); | |
1683 | merge_tlist (pbefore_sp, tmp_before, 0); | |
1684 | merge_tlist (pbefore_sp, tmp_list2, 1); | |
1685 | ||
1686 | tmp_list3 = tmp_nosp = 0; | |
1687 | verify_tree (TREE_OPERAND (x, 1), &tmp_list3, &tmp_nosp, NULL_TREE); | |
1688 | warn_for_collisions (tmp_nosp); | |
1689 | merge_tlist (pbefore_sp, tmp_list3, 0); | |
1690 | ||
1691 | tmp_list3 = tmp_list2 = 0; | |
1692 | verify_tree (TREE_OPERAND (x, 2), &tmp_list3, &tmp_list2, NULL_TREE); | |
1693 | warn_for_collisions (tmp_list2); | |
1694 | merge_tlist (pbefore_sp, tmp_list3, 0); | |
1695 | /* Rather than add both tmp_nosp and tmp_list2, we have to merge the | |
1696 | two first, to avoid warning for (a ? b++ : b++). */ | |
1697 | merge_tlist (&tmp_nosp, tmp_list2, 0); | |
1698 | add_tlist (pno_sp, tmp_nosp, NULL_TREE, 0); | |
1699 | return; | |
1700 | ||
481c6ce6 | 1701 | case PREDECREMENT_EXPR: |
1702 | case PREINCREMENT_EXPR: | |
1703 | case POSTDECREMENT_EXPR: | |
1704 | case POSTINCREMENT_EXPR: | |
4e91a871 | 1705 | verify_tree (TREE_OPERAND (x, 0), pno_sp, pno_sp, x); |
1706 | return; | |
1707 | ||
1708 | case MODIFY_EXPR: | |
1709 | tmp_before = tmp_nosp = tmp_list3 = 0; | |
1710 | verify_tree (TREE_OPERAND (x, 1), &tmp_before, &tmp_nosp, NULL_TREE); | |
1711 | verify_tree (TREE_OPERAND (x, 0), &tmp_list3, &tmp_list3, x); | |
1712 | /* Expressions inside the LHS are not ordered wrt. the sequence points | |
1713 | in the RHS. Example: | |
1714 | *a = (a++, 2) | |
1715 | Despite the fact that the modification of "a" is in the before_sp | |
1716 | list (tmp_before), it conflicts with the use of "a" in the LHS. | |
1717 | We can handle this by adding the contents of tmp_list3 | |
1718 | to those of tmp_before, and redoing the collision warnings for that | |
1719 | list. */ | |
1720 | add_tlist (&tmp_before, tmp_list3, x, 1); | |
1721 | warn_for_collisions (tmp_before); | |
1722 | /* Exclude the LHS itself here; we first have to merge it into the | |
1723 | tmp_nosp list. This is done to avoid warning for "a = a"; if we | |
1724 | didn't exclude the LHS, we'd get it twice, once as a read and once | |
1725 | as a write. */ | |
1726 | add_tlist (pno_sp, tmp_list3, x, 0); | |
1727 | warn_for_collisions_1 (TREE_OPERAND (x, 0), x, tmp_nosp, 1); | |
1728 | ||
1729 | merge_tlist (pbefore_sp, tmp_before, 0); | |
1730 | if (warning_candidate_p (TREE_OPERAND (x, 0))) | |
1731 | merge_tlist (&tmp_nosp, new_tlist (NULL, TREE_OPERAND (x, 0), x), 0); | |
1732 | add_tlist (pno_sp, tmp_nosp, NULL_TREE, 1); | |
1733 | return; | |
481c6ce6 | 1734 | |
1735 | case CALL_EXPR: | |
4e91a871 | 1736 | /* We need to warn about conflicts among arguments and conflicts between |
1737 | args and the function address. Side effects of the function address, | |
1738 | however, are not ordered by the sequence point of the call. */ | |
c2f47e15 | 1739 | { |
1740 | call_expr_arg_iterator iter; | |
1741 | tree arg; | |
1742 | tmp_before = tmp_nosp = 0; | |
1743 | verify_tree (CALL_EXPR_FN (x), &tmp_before, &tmp_nosp, NULL_TREE); | |
1744 | FOR_EACH_CALL_EXPR_ARG (arg, iter, x) | |
1745 | { | |
1746 | tmp_list2 = tmp_list3 = 0; | |
1747 | verify_tree (arg, &tmp_list2, &tmp_list3, NULL_TREE); | |
1748 | merge_tlist (&tmp_list3, tmp_list2, 0); | |
1749 | add_tlist (&tmp_before, tmp_list3, NULL_TREE, 0); | |
1750 | } | |
1751 | add_tlist (&tmp_before, tmp_nosp, NULL_TREE, 0); | |
1752 | warn_for_collisions (tmp_before); | |
1753 | add_tlist (pbefore_sp, tmp_before, NULL_TREE, 0); | |
1754 | return; | |
1755 | } | |
481c6ce6 | 1756 | |
1757 | case TREE_LIST: | |
1758 | /* Scan all the list, e.g. indices of multi dimensional array. */ | |
1759 | while (x) | |
1760 | { | |
4e91a871 | 1761 | tmp_before = tmp_nosp = 0; |
1762 | verify_tree (TREE_VALUE (x), &tmp_before, &tmp_nosp, NULL_TREE); | |
1763 | merge_tlist (&tmp_nosp, tmp_before, 0); | |
1764 | add_tlist (pno_sp, tmp_nosp, NULL_TREE, 0); | |
481c6ce6 | 1765 | x = TREE_CHAIN (x); |
1766 | } | |
4e91a871 | 1767 | return; |
481c6ce6 | 1768 | |
4e91a871 | 1769 | case SAVE_EXPR: |
1770 | { | |
1771 | struct tlist_cache *t; | |
1772 | for (t = save_expr_cache; t; t = t->next) | |
1773 | if (t->expr == x) | |
1774 | break; | |
481c6ce6 | 1775 | |
84166705 | 1776 | if (!t) |
481c6ce6 | 1777 | { |
9318f22c | 1778 | t = XOBNEW (&tlist_obstack, struct tlist_cache); |
4e91a871 | 1779 | t->next = save_expr_cache; |
1780 | t->expr = x; | |
1781 | save_expr_cache = t; | |
1782 | ||
1783 | tmp_before = tmp_nosp = 0; | |
1784 | verify_tree (TREE_OPERAND (x, 0), &tmp_before, &tmp_nosp, NULL_TREE); | |
1785 | warn_for_collisions (tmp_nosp); | |
1786 | ||
1787 | tmp_list3 = 0; | |
1788 | while (tmp_nosp) | |
1789 | { | |
1790 | struct tlist *t = tmp_nosp; | |
1791 | tmp_nosp = t->next; | |
1792 | merge_tlist (&tmp_list3, t, 0); | |
1793 | } | |
1794 | t->cache_before_sp = tmp_before; | |
1795 | t->cache_after_sp = tmp_list3; | |
481c6ce6 | 1796 | } |
4e91a871 | 1797 | merge_tlist (pbefore_sp, t->cache_before_sp, 1); |
1798 | add_tlist (pno_sp, t->cache_after_sp, NULL_TREE, 1); | |
1799 | return; | |
1800 | } | |
481c6ce6 | 1801 | |
ce45a448 | 1802 | default: |
1803 | /* For other expressions, simply recurse on their operands. | |
a0c938f0 | 1804 | Manual tail recursion for unary expressions. |
ce45a448 | 1805 | Other non-expressions need not be processed. */ |
1806 | if (cl == tcc_unary) | |
1807 | { | |
ce45a448 | 1808 | x = TREE_OPERAND (x, 0); |
1809 | writer = 0; | |
1810 | goto restart; | |
1811 | } | |
1812 | else if (IS_EXPR_CODE_CLASS (cl)) | |
1813 | { | |
1814 | int lp; | |
c2f47e15 | 1815 | int max = TREE_OPERAND_LENGTH (x); |
ce45a448 | 1816 | for (lp = 0; lp < max; lp++) |
1817 | { | |
1818 | tmp_before = tmp_nosp = 0; | |
1819 | verify_tree (TREE_OPERAND (x, lp), &tmp_before, &tmp_nosp, 0); | |
1820 | merge_tlist (&tmp_nosp, tmp_before, 0); | |
1821 | add_tlist (pno_sp, tmp_nosp, NULL_TREE, 0); | |
1822 | } | |
1823 | } | |
1824 | return; | |
481c6ce6 | 1825 | } |
481c6ce6 | 1826 | } |
1827 | ||
974e2c0c | 1828 | /* Try to warn for undefined behavior in EXPR due to missing sequence |
481c6ce6 | 1829 | points. */ |
1830 | ||
2569a1be | 1831 | void |
1cae46be | 1832 | verify_sequence_points (tree expr) |
481c6ce6 | 1833 | { |
4e91a871 | 1834 | struct tlist *before_sp = 0, *after_sp = 0; |
481c6ce6 | 1835 | |
4e91a871 | 1836 | warned_ids = 0; |
1837 | save_expr_cache = 0; | |
1838 | if (tlist_firstobj == 0) | |
481c6ce6 | 1839 | { |
4e91a871 | 1840 | gcc_obstack_init (&tlist_obstack); |
4fd61bc6 | 1841 | tlist_firstobj = (char *) obstack_alloc (&tlist_obstack, 0); |
481c6ce6 | 1842 | } |
1843 | ||
4e91a871 | 1844 | verify_tree (expr, &before_sp, &after_sp, 0); |
1845 | warn_for_collisions (after_sp); | |
1846 | obstack_free (&tlist_obstack, tlist_firstobj); | |
481c6ce6 | 1847 | } |
b0fc3e72 | 1848 | \f |
1849 | /* Validate the expression after `case' and apply default promotions. */ | |
1850 | ||
2ca392fd | 1851 | static tree |
1cae46be | 1852 | check_case_value (tree value) |
b0fc3e72 | 1853 | { |
1854 | if (value == NULL_TREE) | |
1855 | return value; | |
1856 | ||
a97c952c | 1857 | /* ??? Can we ever get nops here for a valid case value? We |
1858 | shouldn't for C. */ | |
fce1d6af | 1859 | STRIP_TYPE_NOPS (value); |
225ec6aa | 1860 | /* In C++, the following is allowed: |
1861 | ||
1862 | const int i = 3; | |
1863 | switch (...) { case i: ... } | |
1864 | ||
1865 | So, we try to reduce the VALUE to a constant that way. */ | |
c0f19401 | 1866 | if (c_dialect_cxx ()) |
225ec6aa | 1867 | { |
1868 | value = decl_constant_value (value); | |
1869 | STRIP_TYPE_NOPS (value); | |
1870 | value = fold (value); | |
1871 | } | |
b0fc3e72 | 1872 | |
b96dc121 | 1873 | if (TREE_CODE (value) == INTEGER_CST) |
1874 | /* Promote char or short to int. */ | |
1875 | value = perform_integral_promotions (value); | |
1876 | else if (value != error_mark_node) | |
b0fc3e72 | 1877 | { |
1878 | error ("case label does not reduce to an integer constant"); | |
1879 | value = error_mark_node; | |
1880 | } | |
b0fc3e72 | 1881 | |
6433f1c2 | 1882 | constant_expression_warning (value); |
1883 | ||
b0fc3e72 | 1884 | return value; |
1885 | } | |
1886 | \f | |
2ca392fd | 1887 | /* See if the case values LOW and HIGH are in the range of the original |
5c9dae64 | 1888 | type (i.e. before the default conversion to int) of the switch testing |
2ca392fd | 1889 | expression. |
1890 | TYPE is the promoted type of the testing expression, and ORIG_TYPE is | |
91275768 | 1891 | the type before promoting it. CASE_LOW_P is a pointer to the lower |
2ca392fd | 1892 | bound of the case label, and CASE_HIGH_P is the upper bound or NULL |
1893 | if the case is not a case range. | |
1894 | The caller has to make sure that we are not called with NULL for | |
5c9dae64 | 1895 | CASE_LOW_P (i.e. the default case). |
442e3cb9 | 1896 | Returns true if the case label is in range of ORIG_TYPE (saturated or |
2ca392fd | 1897 | untouched) or false if the label is out of range. */ |
1898 | ||
1899 | static bool | |
1900 | check_case_bounds (tree type, tree orig_type, | |
1901 | tree *case_low_p, tree *case_high_p) | |
1902 | { | |
1903 | tree min_value, max_value; | |
1904 | tree case_low = *case_low_p; | |
1905 | tree case_high = case_high_p ? *case_high_p : case_low; | |
1906 | ||
1907 | /* If there was a problem with the original type, do nothing. */ | |
1908 | if (orig_type == error_mark_node) | |
1909 | return true; | |
1910 | ||
1911 | min_value = TYPE_MIN_VALUE (orig_type); | |
1912 | max_value = TYPE_MAX_VALUE (orig_type); | |
1913 | ||
1914 | /* Case label is less than minimum for type. */ | |
1915 | if (tree_int_cst_compare (case_low, min_value) < 0 | |
1916 | && tree_int_cst_compare (case_high, min_value) < 0) | |
1917 | { | |
c3ceba8e | 1918 | warning (0, "case label value is less than minimum value for type"); |
2ca392fd | 1919 | return false; |
1920 | } | |
b27ac6b5 | 1921 | |
2ca392fd | 1922 | /* Case value is greater than maximum for type. */ |
1923 | if (tree_int_cst_compare (case_low, max_value) > 0 | |
1924 | && tree_int_cst_compare (case_high, max_value) > 0) | |
1925 | { | |
c3ceba8e | 1926 | warning (0, "case label value exceeds maximum value for type"); |
2ca392fd | 1927 | return false; |
1928 | } | |
1929 | ||
1930 | /* Saturate lower case label value to minimum. */ | |
1931 | if (tree_int_cst_compare (case_high, min_value) >= 0 | |
1932 | && tree_int_cst_compare (case_low, min_value) < 0) | |
1933 | { | |
c3ceba8e | 1934 | warning (0, "lower value in case label range" |
2ca392fd | 1935 | " less than minimum value for type"); |
1936 | case_low = min_value; | |
1937 | } | |
b27ac6b5 | 1938 | |
2ca392fd | 1939 | /* Saturate upper case label value to maximum. */ |
1940 | if (tree_int_cst_compare (case_low, max_value) <= 0 | |
1941 | && tree_int_cst_compare (case_high, max_value) > 0) | |
1942 | { | |
c3ceba8e | 1943 | warning (0, "upper value in case label range" |
2ca392fd | 1944 | " exceeds maximum value for type"); |
1945 | case_high = max_value; | |
1946 | } | |
1947 | ||
1948 | if (*case_low_p != case_low) | |
1949 | *case_low_p = convert (type, case_low); | |
1950 | if (case_high_p && *case_high_p != case_high) | |
1951 | *case_high_p = convert (type, case_high); | |
1952 | ||
1953 | return true; | |
1954 | } | |
1955 | \f | |
b0fc3e72 | 1956 | /* Return an integer type with BITS bits of precision, |
1957 | that is unsigned if UNSIGNEDP is nonzero, otherwise signed. */ | |
1958 | ||
1959 | tree | |
1cae46be | 1960 | c_common_type_for_size (unsigned int bits, int unsignedp) |
b0fc3e72 | 1961 | { |
46375237 | 1962 | if (bits == TYPE_PRECISION (integer_type_node)) |
1963 | return unsignedp ? unsigned_type_node : integer_type_node; | |
1964 | ||
bacde65a | 1965 | if (bits == TYPE_PRECISION (signed_char_type_node)) |
b0fc3e72 | 1966 | return unsignedp ? unsigned_char_type_node : signed_char_type_node; |
1967 | ||
bacde65a | 1968 | if (bits == TYPE_PRECISION (short_integer_type_node)) |
b0fc3e72 | 1969 | return unsignedp ? short_unsigned_type_node : short_integer_type_node; |
1970 | ||
bacde65a | 1971 | if (bits == TYPE_PRECISION (long_integer_type_node)) |
b0fc3e72 | 1972 | return unsignedp ? long_unsigned_type_node : long_integer_type_node; |
1973 | ||
bacde65a | 1974 | if (bits == TYPE_PRECISION (long_long_integer_type_node)) |
b0fc3e72 | 1975 | return (unsignedp ? long_long_unsigned_type_node |
1976 | : long_long_integer_type_node); | |
1977 | ||
f57fa2ea | 1978 | if (bits == TYPE_PRECISION (widest_integer_literal_type_node)) |
1979 | return (unsignedp ? widest_unsigned_literal_type_node | |
1980 | : widest_integer_literal_type_node); | |
1981 | ||
bacde65a | 1982 | if (bits <= TYPE_PRECISION (intQI_type_node)) |
1983 | return unsignedp ? unsigned_intQI_type_node : intQI_type_node; | |
1984 | ||
1985 | if (bits <= TYPE_PRECISION (intHI_type_node)) | |
1986 | return unsignedp ? unsigned_intHI_type_node : intHI_type_node; | |
1987 | ||
1988 | if (bits <= TYPE_PRECISION (intSI_type_node)) | |
1989 | return unsignedp ? unsigned_intSI_type_node : intSI_type_node; | |
1990 | ||
1991 | if (bits <= TYPE_PRECISION (intDI_type_node)) | |
1992 | return unsignedp ? unsigned_intDI_type_node : intDI_type_node; | |
1993 | ||
b0fc3e72 | 1994 | return 0; |
1995 | } | |
1996 | ||
9421ebb9 | 1997 | /* Return a fixed-point type that has at least IBIT ibits and FBIT fbits |
1998 | that is unsigned if UNSIGNEDP is nonzero, otherwise signed; | |
1999 | and saturating if SATP is nonzero, otherwise not saturating. */ | |
2000 | ||
2001 | tree | |
2002 | c_common_fixed_point_type_for_size (unsigned int ibit, unsigned int fbit, | |
2003 | int unsignedp, int satp) | |
2004 | { | |
2005 | enum machine_mode mode; | |
2006 | if (ibit == 0) | |
2007 | mode = unsignedp ? UQQmode : QQmode; | |
2008 | else | |
2009 | mode = unsignedp ? UHAmode : HAmode; | |
2010 | ||
2011 | for (; mode != VOIDmode; mode = GET_MODE_WIDER_MODE (mode)) | |
2012 | if (GET_MODE_IBIT (mode) >= ibit && GET_MODE_FBIT (mode) >= fbit) | |
2013 | break; | |
2014 | ||
2015 | if (mode == VOIDmode || !targetm.scalar_mode_supported_p (mode)) | |
2016 | { | |
2017 | sorry ("GCC cannot support operators with integer types and " | |
2018 | "fixed-point types that have too many integral and " | |
2019 | "fractional bits together"); | |
2020 | return 0; | |
2021 | } | |
2022 | ||
2023 | return c_common_type_for_mode (mode, satp); | |
2024 | } | |
2025 | ||
5b247e9f | 2026 | /* Used for communication between c_common_type_for_mode and |
2027 | c_register_builtin_type. */ | |
2028 | static GTY(()) tree registered_builtin_types; | |
2029 | ||
b0fc3e72 | 2030 | /* Return a data type that has machine mode MODE. |
2031 | If the mode is an integer, | |
9421ebb9 | 2032 | then UNSIGNEDP selects between signed and unsigned types. |
2033 | If the mode is a fixed-point mode, | |
2034 | then UNSIGNEDP selects between saturating and nonsaturating types. */ | |
b0fc3e72 | 2035 | |
2036 | tree | |
1cae46be | 2037 | c_common_type_for_mode (enum machine_mode mode, int unsignedp) |
b0fc3e72 | 2038 | { |
5b247e9f | 2039 | tree t; |
2040 | ||
46375237 | 2041 | if (mode == TYPE_MODE (integer_type_node)) |
2042 | return unsignedp ? unsigned_type_node : integer_type_node; | |
2043 | ||
b0fc3e72 | 2044 | if (mode == TYPE_MODE (signed_char_type_node)) |
2045 | return unsignedp ? unsigned_char_type_node : signed_char_type_node; | |
2046 | ||
2047 | if (mode == TYPE_MODE (short_integer_type_node)) | |
2048 | return unsignedp ? short_unsigned_type_node : short_integer_type_node; | |
2049 | ||
b0fc3e72 | 2050 | if (mode == TYPE_MODE (long_integer_type_node)) |
2051 | return unsignedp ? long_unsigned_type_node : long_integer_type_node; | |
2052 | ||
2053 | if (mode == TYPE_MODE (long_long_integer_type_node)) | |
2054 | return unsignedp ? long_long_unsigned_type_node : long_long_integer_type_node; | |
2055 | ||
f57fa2ea | 2056 | if (mode == TYPE_MODE (widest_integer_literal_type_node)) |
44e9fa65 | 2057 | return unsignedp ? widest_unsigned_literal_type_node |
4ee9c684 | 2058 | : widest_integer_literal_type_node; |
f57fa2ea | 2059 | |
88ae7f04 | 2060 | if (mode == QImode) |
bacde65a | 2061 | return unsignedp ? unsigned_intQI_type_node : intQI_type_node; |
2062 | ||
88ae7f04 | 2063 | if (mode == HImode) |
bacde65a | 2064 | return unsignedp ? unsigned_intHI_type_node : intHI_type_node; |
2065 | ||
88ae7f04 | 2066 | if (mode == SImode) |
bacde65a | 2067 | return unsignedp ? unsigned_intSI_type_node : intSI_type_node; |
2068 | ||
88ae7f04 | 2069 | if (mode == DImode) |
bacde65a | 2070 | return unsignedp ? unsigned_intDI_type_node : intDI_type_node; |
2071 | ||
cc1cc1c7 | 2072 | #if HOST_BITS_PER_WIDE_INT >= 64 |
6274009c | 2073 | if (mode == TYPE_MODE (intTI_type_node)) |
2074 | return unsignedp ? unsigned_intTI_type_node : intTI_type_node; | |
cc1cc1c7 | 2075 | #endif |
6274009c | 2076 | |
b0fc3e72 | 2077 | if (mode == TYPE_MODE (float_type_node)) |
2078 | return float_type_node; | |
2079 | ||
2080 | if (mode == TYPE_MODE (double_type_node)) | |
2081 | return double_type_node; | |
2082 | ||
2083 | if (mode == TYPE_MODE (long_double_type_node)) | |
2084 | return long_double_type_node; | |
2085 | ||
545c2bde | 2086 | if (mode == TYPE_MODE (void_type_node)) |
2087 | return void_type_node; | |
b27ac6b5 | 2088 | |
b0fc3e72 | 2089 | if (mode == TYPE_MODE (build_pointer_type (char_type_node))) |
61b9b73c | 2090 | return (unsignedp |
2091 | ? make_unsigned_type (GET_MODE_PRECISION (mode)) | |
2092 | : make_signed_type (GET_MODE_PRECISION (mode))); | |
b0fc3e72 | 2093 | |
2094 | if (mode == TYPE_MODE (build_pointer_type (integer_type_node))) | |
61b9b73c | 2095 | return (unsignedp |
2096 | ? make_unsigned_type (GET_MODE_PRECISION (mode)) | |
2097 | : make_signed_type (GET_MODE_PRECISION (mode))); | |
b0fc3e72 | 2098 | |
0dfc45b5 | 2099 | if (COMPLEX_MODE_P (mode)) |
2100 | { | |
2101 | enum machine_mode inner_mode; | |
2102 | tree inner_type; | |
2103 | ||
2104 | if (mode == TYPE_MODE (complex_float_type_node)) | |
2105 | return complex_float_type_node; | |
2106 | if (mode == TYPE_MODE (complex_double_type_node)) | |
2107 | return complex_double_type_node; | |
2108 | if (mode == TYPE_MODE (complex_long_double_type_node)) | |
2109 | return complex_long_double_type_node; | |
2110 | ||
2111 | if (mode == TYPE_MODE (complex_integer_type_node) && !unsignedp) | |
2112 | return complex_integer_type_node; | |
2113 | ||
2114 | inner_mode = GET_MODE_INNER (mode); | |
2115 | inner_type = c_common_type_for_mode (inner_mode, unsignedp); | |
2116 | if (inner_type != NULL_TREE) | |
2117 | return build_complex_type (inner_type); | |
2118 | } | |
2119 | else if (VECTOR_MODE_P (mode)) | |
4917c376 | 2120 | { |
2121 | enum machine_mode inner_mode = GET_MODE_INNER (mode); | |
2122 | tree inner_type = c_common_type_for_mode (inner_mode, unsignedp); | |
2123 | if (inner_type != NULL_TREE) | |
2124 | return build_vector_type_for_mode (inner_type, mode); | |
88ae7f04 | 2125 | } |
e2ea7e3a | 2126 | |
c4503c0a | 2127 | if (mode == TYPE_MODE (dfloat32_type_node)) |
2128 | return dfloat32_type_node; | |
2129 | if (mode == TYPE_MODE (dfloat64_type_node)) | |
2130 | return dfloat64_type_node; | |
2131 | if (mode == TYPE_MODE (dfloat128_type_node)) | |
2132 | return dfloat128_type_node; | |
2133 | ||
9421ebb9 | 2134 | if (ALL_SCALAR_FIXED_POINT_MODE_P (mode)) |
2135 | { | |
2136 | if (mode == TYPE_MODE (short_fract_type_node)) | |
2137 | return unsignedp ? sat_short_fract_type_node : short_fract_type_node; | |
2138 | if (mode == TYPE_MODE (fract_type_node)) | |
2139 | return unsignedp ? sat_fract_type_node : fract_type_node; | |
2140 | if (mode == TYPE_MODE (long_fract_type_node)) | |
2141 | return unsignedp ? sat_long_fract_type_node : long_fract_type_node; | |
2142 | if (mode == TYPE_MODE (long_long_fract_type_node)) | |
2143 | return unsignedp ? sat_long_long_fract_type_node | |
2144 | : long_long_fract_type_node; | |
2145 | ||
2146 | if (mode == TYPE_MODE (unsigned_short_fract_type_node)) | |
2147 | return unsignedp ? sat_unsigned_short_fract_type_node | |
2148 | : unsigned_short_fract_type_node; | |
2149 | if (mode == TYPE_MODE (unsigned_fract_type_node)) | |
2150 | return unsignedp ? sat_unsigned_fract_type_node | |
2151 | : unsigned_fract_type_node; | |
2152 | if (mode == TYPE_MODE (unsigned_long_fract_type_node)) | |
2153 | return unsignedp ? sat_unsigned_long_fract_type_node | |
2154 | : unsigned_long_fract_type_node; | |
2155 | if (mode == TYPE_MODE (unsigned_long_long_fract_type_node)) | |
2156 | return unsignedp ? sat_unsigned_long_long_fract_type_node | |
2157 | : unsigned_long_long_fract_type_node; | |
2158 | ||
2159 | if (mode == TYPE_MODE (short_accum_type_node)) | |
2160 | return unsignedp ? sat_short_accum_type_node : short_accum_type_node; | |
2161 | if (mode == TYPE_MODE (accum_type_node)) | |
2162 | return unsignedp ? sat_accum_type_node : accum_type_node; | |
2163 | if (mode == TYPE_MODE (long_accum_type_node)) | |
2164 | return unsignedp ? sat_long_accum_type_node : long_accum_type_node; | |
2165 | if (mode == TYPE_MODE (long_long_accum_type_node)) | |
2166 | return unsignedp ? sat_long_long_accum_type_node | |
2167 | : long_long_accum_type_node; | |
2168 | ||
2169 | if (mode == TYPE_MODE (unsigned_short_accum_type_node)) | |
2170 | return unsignedp ? sat_unsigned_short_accum_type_node | |
2171 | : unsigned_short_accum_type_node; | |
2172 | if (mode == TYPE_MODE (unsigned_accum_type_node)) | |
2173 | return unsignedp ? sat_unsigned_accum_type_node | |
2174 | : unsigned_accum_type_node; | |
2175 | if (mode == TYPE_MODE (unsigned_long_accum_type_node)) | |
2176 | return unsignedp ? sat_unsigned_long_accum_type_node | |
2177 | : unsigned_long_accum_type_node; | |
2178 | if (mode == TYPE_MODE (unsigned_long_long_accum_type_node)) | |
2179 | return unsignedp ? sat_unsigned_long_long_accum_type_node | |
2180 | : unsigned_long_long_accum_type_node; | |
2181 | ||
2182 | if (mode == QQmode) | |
2183 | return unsignedp ? sat_qq_type_node : qq_type_node; | |
2184 | if (mode == HQmode) | |
2185 | return unsignedp ? sat_hq_type_node : hq_type_node; | |
2186 | if (mode == SQmode) | |
2187 | return unsignedp ? sat_sq_type_node : sq_type_node; | |
2188 | if (mode == DQmode) | |
2189 | return unsignedp ? sat_dq_type_node : dq_type_node; | |
2190 | if (mode == TQmode) | |
2191 | return unsignedp ? sat_tq_type_node : tq_type_node; | |
2192 | ||
2193 | if (mode == UQQmode) | |
2194 | return unsignedp ? sat_uqq_type_node : uqq_type_node; | |
2195 | if (mode == UHQmode) | |
2196 | return unsignedp ? sat_uhq_type_node : uhq_type_node; | |
2197 | if (mode == USQmode) | |
2198 | return unsignedp ? sat_usq_type_node : usq_type_node; | |
2199 | if (mode == UDQmode) | |
2200 | return unsignedp ? sat_udq_type_node : udq_type_node; | |
2201 | if (mode == UTQmode) | |
2202 | return unsignedp ? sat_utq_type_node : utq_type_node; | |
2203 | ||
2204 | if (mode == HAmode) | |
2205 | return unsignedp ? sat_ha_type_node : ha_type_node; | |
2206 | if (mode == SAmode) | |
2207 | return unsignedp ? sat_sa_type_node : sa_type_node; | |
2208 | if (mode == DAmode) | |
2209 | return unsignedp ? sat_da_type_node : da_type_node; | |
2210 | if (mode == TAmode) | |
2211 | return unsignedp ? sat_ta_type_node : ta_type_node; | |
2212 | ||
2213 | if (mode == UHAmode) | |
2214 | return unsignedp ? sat_uha_type_node : uha_type_node; | |
2215 | if (mode == USAmode) | |
2216 | return unsignedp ? sat_usa_type_node : usa_type_node; | |
2217 | if (mode == UDAmode) | |
2218 | return unsignedp ? sat_uda_type_node : uda_type_node; | |
2219 | if (mode == UTAmode) | |
2220 | return unsignedp ? sat_uta_type_node : uta_type_node; | |
2221 | } | |
2222 | ||
5b247e9f | 2223 | for (t = registered_builtin_types; t; t = TREE_CHAIN (t)) |
2224 | if (TYPE_MODE (TREE_VALUE (t)) == mode) | |
2225 | return TREE_VALUE (t); | |
2226 | ||
b0fc3e72 | 2227 | return 0; |
2228 | } | |
20d39783 | 2229 | |
11773141 | 2230 | tree |
2231 | c_common_unsigned_type (tree type) | |
2232 | { | |
2233 | return c_common_signed_or_unsigned_type (1, type); | |
2234 | } | |
2235 | ||
20d39783 | 2236 | /* Return a signed type the same as TYPE in other respects. */ |
2237 | ||
2238 | tree | |
1cae46be | 2239 | c_common_signed_type (tree type) |
20d39783 | 2240 | { |
4070745f | 2241 | return c_common_signed_or_unsigned_type (0, type); |
20d39783 | 2242 | } |
2243 | ||
2244 | /* Return a type the same as TYPE except unsigned or | |
2245 | signed according to UNSIGNEDP. */ | |
2246 | ||
2247 | tree | |
1cae46be | 2248 | c_common_signed_or_unsigned_type (int unsignedp, tree type) |
20d39783 | 2249 | { |
7a91101f | 2250 | tree type1; |
20d39783 | 2251 | |
7a91101f | 2252 | /* This block of code emulates the behavior of the old |
2253 | c_common_unsigned_type. In particular, it returns | |
2254 | long_unsigned_type_node if passed a long, even when a int would | |
2255 | have the same size. This is necessary for warnings to work | |
2256 | correctly in archs where sizeof(int) == sizeof(long) */ | |
2257 | ||
2258 | type1 = TYPE_MAIN_VARIANT (type); | |
2259 | if (type1 == signed_char_type_node || type1 == char_type_node || type1 == unsigned_char_type_node) | |
2260 | return unsignedp ? unsigned_char_type_node : signed_char_type_node; | |
2261 | if (type1 == integer_type_node || type1 == unsigned_type_node) | |
2262 | return unsignedp ? unsigned_type_node : integer_type_node; | |
2263 | if (type1 == short_integer_type_node || type1 == short_unsigned_type_node) | |
2264 | return unsignedp ? short_unsigned_type_node : short_integer_type_node; | |
2265 | if (type1 == long_integer_type_node || type1 == long_unsigned_type_node) | |
2266 | return unsignedp ? long_unsigned_type_node : long_integer_type_node; | |
2267 | if (type1 == long_long_integer_type_node || type1 == long_long_unsigned_type_node) | |
2268 | return unsignedp ? long_long_unsigned_type_node : long_long_integer_type_node; | |
2269 | if (type1 == widest_integer_literal_type_node || type1 == widest_unsigned_literal_type_node) | |
2270 | return unsignedp ? widest_unsigned_literal_type_node : widest_integer_literal_type_node; | |
2271 | #if HOST_BITS_PER_WIDE_INT >= 64 | |
2272 | if (type1 == intTI_type_node || type1 == unsigned_intTI_type_node) | |
2273 | return unsignedp ? unsigned_intTI_type_node : intTI_type_node; | |
2274 | #endif | |
2275 | if (type1 == intDI_type_node || type1 == unsigned_intDI_type_node) | |
2276 | return unsignedp ? unsigned_intDI_type_node : intDI_type_node; | |
2277 | if (type1 == intSI_type_node || type1 == unsigned_intSI_type_node) | |
2278 | return unsignedp ? unsigned_intSI_type_node : intSI_type_node; | |
2279 | if (type1 == intHI_type_node || type1 == unsigned_intHI_type_node) | |
2280 | return unsignedp ? unsigned_intHI_type_node : intHI_type_node; | |
2281 | if (type1 == intQI_type_node || type1 == unsigned_intQI_type_node) | |
2282 | return unsignedp ? unsigned_intQI_type_node : intQI_type_node; | |
2283 | ||
9421ebb9 | 2284 | #define C_COMMON_FIXED_TYPES(SAT,NAME) \ |
2285 | if (type1 == SAT ## short_ ## NAME ## _type_node \ | |
2286 | || type1 == SAT ## unsigned_short_ ## NAME ## _type_node) \ | |
2287 | return unsignedp ? SAT ## unsigned_short_ ## NAME ## _type_node \ | |
2288 | : SAT ## short_ ## NAME ## _type_node; \ | |
2289 | if (type1 == SAT ## NAME ## _type_node \ | |
2290 | || type1 == SAT ## unsigned_ ## NAME ## _type_node) \ | |
2291 | return unsignedp ? SAT ## unsigned_ ## NAME ## _type_node \ | |
2292 | : SAT ## NAME ## _type_node; \ | |
2293 | if (type1 == SAT ## long_ ## NAME ## _type_node \ | |
2294 | || type1 == SAT ## unsigned_long_ ## NAME ## _type_node) \ | |
2295 | return unsignedp ? SAT ## unsigned_long_ ## NAME ## _type_node \ | |
2296 | : SAT ## long_ ## NAME ## _type_node; \ | |
2297 | if (type1 == SAT ## long_long_ ## NAME ## _type_node \ | |
2298 | || type1 == SAT ## unsigned_long_long_ ## NAME ## _type_node) \ | |
2299 | return unsignedp ? SAT ## unsigned_long_long_ ## NAME ## _type_node \ | |
2300 | : SAT ## long_long_ ## NAME ## _type_node; | |
2301 | ||
2302 | #define C_COMMON_FIXED_MODE_TYPES(SAT,NAME) \ | |
2303 | if (type1 == SAT ## NAME ## _type_node \ | |
2304 | || type1 == SAT ## u ## NAME ## _type_node) \ | |
2305 | return unsignedp ? SAT ## u ## NAME ## _type_node \ | |
2306 | : SAT ## NAME ## _type_node; | |
2307 | ||
2308 | C_COMMON_FIXED_TYPES (, fract); | |
2309 | C_COMMON_FIXED_TYPES (sat_, fract); | |
2310 | C_COMMON_FIXED_TYPES (, accum); | |
2311 | C_COMMON_FIXED_TYPES (sat_, accum); | |
2312 | ||
2313 | C_COMMON_FIXED_MODE_TYPES (, qq); | |
2314 | C_COMMON_FIXED_MODE_TYPES (, hq); | |
2315 | C_COMMON_FIXED_MODE_TYPES (, sq); | |
2316 | C_COMMON_FIXED_MODE_TYPES (, dq); | |
2317 | C_COMMON_FIXED_MODE_TYPES (, tq); | |
2318 | C_COMMON_FIXED_MODE_TYPES (sat_, qq); | |
2319 | C_COMMON_FIXED_MODE_TYPES (sat_, hq); | |
2320 | C_COMMON_FIXED_MODE_TYPES (sat_, sq); | |
2321 | C_COMMON_FIXED_MODE_TYPES (sat_, dq); | |
2322 | C_COMMON_FIXED_MODE_TYPES (sat_, tq); | |
2323 | C_COMMON_FIXED_MODE_TYPES (, ha); | |
2324 | C_COMMON_FIXED_MODE_TYPES (, sa); | |
2325 | C_COMMON_FIXED_MODE_TYPES (, da); | |
2326 | C_COMMON_FIXED_MODE_TYPES (, ta); | |
2327 | C_COMMON_FIXED_MODE_TYPES (sat_, ha); | |
2328 | C_COMMON_FIXED_MODE_TYPES (sat_, sa); | |
2329 | C_COMMON_FIXED_MODE_TYPES (sat_, da); | |
2330 | C_COMMON_FIXED_MODE_TYPES (sat_, ta); | |
2331 | ||
4f7f7efd | 2332 | /* For ENUMERAL_TYPEs in C++, must check the mode of the types, not |
2333 | the precision; they have precision set to match their range, but | |
2334 | may use a wider mode to match an ABI. If we change modes, we may | |
2335 | wind up with bad conversions. For INTEGER_TYPEs in C, must check | |
2336 | the precision as well, so as to yield correct results for | |
2337 | bit-field types. C++ does not have these separate bit-field | |
2338 | types, and producing a signed or unsigned variant of an | |
2339 | ENUMERAL_TYPE may cause other problems as well. */ | |
2340 | ||
ac265864 | 2341 | if (!INTEGRAL_TYPE_P (type) |
2342 | || TYPE_UNSIGNED (type) == unsignedp) | |
2343 | return type; | |
2344 | ||
4f7f7efd | 2345 | #define TYPE_OK(node) \ |
2346 | (TYPE_MODE (type) == TYPE_MODE (node) \ | |
2347 | && (c_dialect_cxx () || TYPE_PRECISION (type) == TYPE_PRECISION (node))) | |
2348 | if (TYPE_OK (signed_char_type_node)) | |
20d39783 | 2349 | return unsignedp ? unsigned_char_type_node : signed_char_type_node; |
4f7f7efd | 2350 | if (TYPE_OK (integer_type_node)) |
20d39783 | 2351 | return unsignedp ? unsigned_type_node : integer_type_node; |
4f7f7efd | 2352 | if (TYPE_OK (short_integer_type_node)) |
20d39783 | 2353 | return unsignedp ? short_unsigned_type_node : short_integer_type_node; |
4f7f7efd | 2354 | if (TYPE_OK (long_integer_type_node)) |
20d39783 | 2355 | return unsignedp ? long_unsigned_type_node : long_integer_type_node; |
4f7f7efd | 2356 | if (TYPE_OK (long_long_integer_type_node)) |
20d39783 | 2357 | return (unsignedp ? long_long_unsigned_type_node |
2358 | : long_long_integer_type_node); | |
4f7f7efd | 2359 | if (TYPE_OK (widest_integer_literal_type_node)) |
20d39783 | 2360 | return (unsignedp ? widest_unsigned_literal_type_node |
2361 | : widest_integer_literal_type_node); | |
ef11801e | 2362 | |
2363 | #if HOST_BITS_PER_WIDE_INT >= 64 | |
4f7f7efd | 2364 | if (TYPE_OK (intTI_type_node)) |
ef11801e | 2365 | return unsignedp ? unsigned_intTI_type_node : intTI_type_node; |
2366 | #endif | |
4f7f7efd | 2367 | if (TYPE_OK (intDI_type_node)) |
ef11801e | 2368 | return unsignedp ? unsigned_intDI_type_node : intDI_type_node; |
4f7f7efd | 2369 | if (TYPE_OK (intSI_type_node)) |
ef11801e | 2370 | return unsignedp ? unsigned_intSI_type_node : intSI_type_node; |
4f7f7efd | 2371 | if (TYPE_OK (intHI_type_node)) |
ef11801e | 2372 | return unsignedp ? unsigned_intHI_type_node : intHI_type_node; |
4f7f7efd | 2373 | if (TYPE_OK (intQI_type_node)) |
ef11801e | 2374 | return unsignedp ? unsigned_intQI_type_node : intQI_type_node; |
4f7f7efd | 2375 | #undef TYPE_OK |
ef11801e | 2376 | |
4f7f7efd | 2377 | if (c_dialect_cxx ()) |
2378 | return type; | |
2379 | else | |
2380 | return build_nonstandard_integer_type (TYPE_PRECISION (type), unsignedp); | |
20d39783 | 2381 | } |
b268e47e | 2382 | |
c0e47fd4 | 2383 | /* Build a bit-field integer type for the given WIDTH and UNSIGNEDP. */ |
2384 | ||
2385 | tree | |
2386 | c_build_bitfield_integer_type (unsigned HOST_WIDE_INT width, int unsignedp) | |
2387 | { | |
2388 | /* Extended integer types of the same width as a standard type have | |
2389 | lesser rank, so those of the same width as int promote to int or | |
2390 | unsigned int and are valid for printf formats expecting int or | |
2391 | unsigned int. To avoid such special cases, avoid creating | |
2392 | extended integer types for bit-fields if a standard integer type | |
2393 | is available. */ | |
2394 | if (width == TYPE_PRECISION (integer_type_node)) | |
2395 | return unsignedp ? unsigned_type_node : integer_type_node; | |
2396 | if (width == TYPE_PRECISION (signed_char_type_node)) | |
2397 | return unsignedp ? unsigned_char_type_node : signed_char_type_node; | |
2398 | if (width == TYPE_PRECISION (short_integer_type_node)) | |
2399 | return unsignedp ? short_unsigned_type_node : short_integer_type_node; | |
2400 | if (width == TYPE_PRECISION (long_integer_type_node)) | |
2401 | return unsignedp ? long_unsigned_type_node : long_integer_type_node; | |
2402 | if (width == TYPE_PRECISION (long_long_integer_type_node)) | |
2403 | return (unsignedp ? long_long_unsigned_type_node | |
2404 | : long_long_integer_type_node); | |
2405 | return build_nonstandard_integer_type (width, unsignedp); | |
2406 | } | |
2407 | ||
b268e47e | 2408 | /* The C version of the register_builtin_type langhook. */ |
2409 | ||
2410 | void | |
2411 | c_register_builtin_type (tree type, const char* name) | |
2412 | { | |
2413 | tree decl; | |
2414 | ||
2415 | decl = build_decl (TYPE_DECL, get_identifier (name), type); | |
2416 | DECL_ARTIFICIAL (decl) = 1; | |
2417 | if (!TYPE_NAME (type)) | |
2418 | TYPE_NAME (type) = decl; | |
2419 | pushdecl (decl); | |
5b247e9f | 2420 | |
2421 | registered_builtin_types = tree_cons (0, type, registered_builtin_types); | |
b268e47e | 2422 | } |
2423 | ||
b0fc3e72 | 2424 | \f |
a9b9d10c | 2425 | /* Return the minimum number of bits needed to represent VALUE in a |
2426 | signed or unsigned type, UNSIGNEDP says which. */ | |
2427 | ||
a0c2c45b | 2428 | unsigned int |
1cae46be | 2429 | min_precision (tree value, int unsignedp) |
a9b9d10c | 2430 | { |
2431 | int log; | |
2432 | ||
2433 | /* If the value is negative, compute its negative minus 1. The latter | |
2434 | adjustment is because the absolute value of the largest negative value | |
2435 | is one larger than the largest positive value. This is equivalent to | |
2436 | a bit-wise negation, so use that operation instead. */ | |
2437 | ||
2438 | if (tree_int_cst_sgn (value) < 0) | |
49d00087 | 2439 | value = fold_build1 (BIT_NOT_EXPR, TREE_TYPE (value), value); |
a9b9d10c | 2440 | |
2441 | /* Return the number of bits needed, taking into account the fact | |
2442 | that we need one more bit for a signed than unsigned type. */ | |
2443 | ||
2444 | if (integer_zerop (value)) | |
2445 | log = 0; | |
a9b9d10c | 2446 | else |
a0c2c45b | 2447 | log = tree_floor_log2 (value); |
a9b9d10c | 2448 | |
84166705 | 2449 | return log + 1 + !unsignedp; |
a9b9d10c | 2450 | } |
2451 | \f | |
aff9e656 | 2452 | /* Print an error message for invalid operands to arith operation |
17075f13 | 2453 | CODE with TYPE0 for operand 0, and TYPE1 for operand 1. */ |
b0fc3e72 | 2454 | |
2455 | void | |
17075f13 | 2456 | binary_op_error (enum tree_code code, tree type0, tree type1) |
b0fc3e72 | 2457 | { |
19cb6b50 | 2458 | const char *opname; |
f03946e4 | 2459 | |
b0fc3e72 | 2460 | switch (code) |
2461 | { | |
b0fc3e72 | 2462 | case PLUS_EXPR: |
2463 | opname = "+"; break; | |
2464 | case MINUS_EXPR: | |
2465 | opname = "-"; break; | |
2466 | case MULT_EXPR: | |
2467 | opname = "*"; break; | |
2468 | case MAX_EXPR: | |
2469 | opname = "max"; break; | |
2470 | case MIN_EXPR: | |
2471 | opname = "min"; break; | |
2472 | case EQ_EXPR: | |
2473 | opname = "=="; break; | |
2474 | case NE_EXPR: | |
2475 | opname = "!="; break; | |
2476 | case LE_EXPR: | |
2477 | opname = "<="; break; | |
2478 | case GE_EXPR: | |
2479 | opname = ">="; break; | |
2480 | case LT_EXPR: | |
2481 | opname = "<"; break; | |
2482 | case GT_EXPR: | |
2483 | opname = ">"; break; | |
2484 | case LSHIFT_EXPR: | |
2485 | opname = "<<"; break; | |
2486 | case RSHIFT_EXPR: | |
2487 | opname = ">>"; break; | |
2488 | case TRUNC_MOD_EXPR: | |
66618a1e | 2489 | case FLOOR_MOD_EXPR: |
b0fc3e72 | 2490 | opname = "%"; break; |
2491 | case TRUNC_DIV_EXPR: | |
66618a1e | 2492 | case FLOOR_DIV_EXPR: |
b0fc3e72 | 2493 | opname = "/"; break; |
2494 | case BIT_AND_EXPR: | |
2495 | opname = "&"; break; | |
2496 | case BIT_IOR_EXPR: | |
2497 | opname = "|"; break; | |
2498 | case TRUTH_ANDIF_EXPR: | |
2499 | opname = "&&"; break; | |
2500 | case TRUTH_ORIF_EXPR: | |
2501 | opname = "||"; break; | |
2502 | case BIT_XOR_EXPR: | |
2503 | opname = "^"; break; | |
31f820d2 | 2504 | default: |
315ba355 | 2505 | gcc_unreachable (); |
b0fc3e72 | 2506 | } |
17075f13 | 2507 | error ("invalid operands to binary %s (have %qT and %qT)", opname, |
2508 | type0, type1); | |
b0fc3e72 | 2509 | } |
2510 | \f | |
2511 | /* Subroutine of build_binary_op, used for comparison operations. | |
2512 | See if the operands have both been converted from subword integer types | |
2513 | and, if so, perhaps change them both back to their original type. | |
5b511807 | 2514 | This function is also responsible for converting the two operands |
2515 | to the proper common type for comparison. | |
b0fc3e72 | 2516 | |
2517 | The arguments of this function are all pointers to local variables | |
2518 | of build_binary_op: OP0_PTR is &OP0, OP1_PTR is &OP1, | |
2519 | RESTYPE_PTR is &RESULT_TYPE and RESCODE_PTR is &RESULTCODE. | |
2520 | ||
2521 | If this function returns nonzero, it means that the comparison has | |
2522 | a constant value. What this function returns is an expression for | |
2523 | that value. */ | |
2524 | ||
2525 | tree | |
1cae46be | 2526 | shorten_compare (tree *op0_ptr, tree *op1_ptr, tree *restype_ptr, |
2527 | enum tree_code *rescode_ptr) | |
b0fc3e72 | 2528 | { |
19cb6b50 | 2529 | tree type; |
b0fc3e72 | 2530 | tree op0 = *op0_ptr; |
2531 | tree op1 = *op1_ptr; | |
2532 | int unsignedp0, unsignedp1; | |
2533 | int real1, real2; | |
2534 | tree primop0, primop1; | |
2535 | enum tree_code code = *rescode_ptr; | |
2536 | ||
2537 | /* Throw away any conversions to wider types | |
2538 | already present in the operands. */ | |
2539 | ||
2540 | primop0 = get_narrower (op0, &unsignedp0); | |
2541 | primop1 = get_narrower (op1, &unsignedp1); | |
2542 | ||
2543 | /* Handle the case that OP0 does not *contain* a conversion | |
2544 | but it *requires* conversion to FINAL_TYPE. */ | |
2545 | ||
2546 | if (op0 == primop0 && TREE_TYPE (op0) != *restype_ptr) | |
78a8ed03 | 2547 | unsignedp0 = TYPE_UNSIGNED (TREE_TYPE (op0)); |
b0fc3e72 | 2548 | if (op1 == primop1 && TREE_TYPE (op1) != *restype_ptr) |
78a8ed03 | 2549 | unsignedp1 = TYPE_UNSIGNED (TREE_TYPE (op1)); |
b0fc3e72 | 2550 | |
2551 | /* If one of the operands must be floated, we cannot optimize. */ | |
2552 | real1 = TREE_CODE (TREE_TYPE (primop0)) == REAL_TYPE; | |
2553 | real2 = TREE_CODE (TREE_TYPE (primop1)) == REAL_TYPE; | |
2554 | ||
2555 | /* If first arg is constant, swap the args (changing operation | |
2bd278cc | 2556 | so value is preserved), for canonicalization. Don't do this if |
2557 | the second arg is 0. */ | |
b0fc3e72 | 2558 | |
2bd278cc | 2559 | if (TREE_CONSTANT (primop0) |
9421ebb9 | 2560 | && !integer_zerop (primop1) && !real_zerop (primop1) |
2561 | && !fixed_zerop (primop1)) | |
b0fc3e72 | 2562 | { |
19cb6b50 | 2563 | tree tem = primop0; |
2564 | int temi = unsignedp0; | |
b0fc3e72 | 2565 | primop0 = primop1; |
2566 | primop1 = tem; | |
2567 | tem = op0; | |
2568 | op0 = op1; | |
2569 | op1 = tem; | |
2570 | *op0_ptr = op0; | |
2571 | *op1_ptr = op1; | |
2572 | unsignedp0 = unsignedp1; | |
2573 | unsignedp1 = temi; | |
2574 | temi = real1; | |
2575 | real1 = real2; | |
2576 | real2 = temi; | |
2577 | ||
2578 | switch (code) | |
2579 | { | |
2580 | case LT_EXPR: | |
2581 | code = GT_EXPR; | |
2582 | break; | |
2583 | case GT_EXPR: | |
2584 | code = LT_EXPR; | |
2585 | break; | |
2586 | case LE_EXPR: | |
2587 | code = GE_EXPR; | |
2588 | break; | |
2589 | case GE_EXPR: | |
2590 | code = LE_EXPR; | |
2591 | break; | |
31f820d2 | 2592 | default: |
2593 | break; | |
b0fc3e72 | 2594 | } |
2595 | *rescode_ptr = code; | |
2596 | } | |
2597 | ||
2598 | /* If comparing an integer against a constant more bits wide, | |
2599 | maybe we can deduce a value of 1 or 0 independent of the data. | |
2600 | Or else truncate the constant now | |
2601 | rather than extend the variable at run time. | |
2602 | ||
2603 | This is only interesting if the constant is the wider arg. | |
2604 | Also, it is not safe if the constant is unsigned and the | |
2605 | variable arg is signed, since in this case the variable | |
2606 | would be sign-extended and then regarded as unsigned. | |
2607 | Our technique fails in this case because the lowest/highest | |
2608 | possible unsigned results don't follow naturally from the | |
2609 | lowest/highest possible values of the variable operand. | |
2610 | For just EQ_EXPR and NE_EXPR there is another technique that | |
2611 | could be used: see if the constant can be faithfully represented | |
2612 | in the other operand's type, by truncating it and reextending it | |
2613 | and see if that preserves the constant's value. */ | |
2614 | ||
2615 | if (!real1 && !real2 | |
9421ebb9 | 2616 | && TREE_CODE (TREE_TYPE (primop0)) != FIXED_POINT_TYPE |
b0fc3e72 | 2617 | && TREE_CODE (primop1) == INTEGER_CST |
2618 | && TYPE_PRECISION (TREE_TYPE (primop0)) < TYPE_PRECISION (*restype_ptr)) | |
2619 | { | |
2620 | int min_gt, max_gt, min_lt, max_lt; | |
2621 | tree maxval, minval; | |
2622 | /* 1 if comparison is nominally unsigned. */ | |
78a8ed03 | 2623 | int unsignedp = TYPE_UNSIGNED (*restype_ptr); |
b0fc3e72 | 2624 | tree val; |
2625 | ||
4070745f | 2626 | type = c_common_signed_or_unsigned_type (unsignedp0, |
2627 | TREE_TYPE (primop0)); | |
cda09c61 | 2628 | |
b0fc3e72 | 2629 | maxval = TYPE_MAX_VALUE (type); |
2630 | minval = TYPE_MIN_VALUE (type); | |
2631 | ||
2632 | if (unsignedp && !unsignedp0) | |
4070745f | 2633 | *restype_ptr = c_common_signed_type (*restype_ptr); |
b0fc3e72 | 2634 | |
2635 | if (TREE_TYPE (primop1) != *restype_ptr) | |
18dbec6f | 2636 | { |
9a5e8086 | 2637 | /* Convert primop1 to target type, but do not introduce |
2638 | additional overflow. We know primop1 is an int_cst. */ | |
c8110c8f | 2639 | primop1 = force_fit_type_double (*restype_ptr, |
2640 | TREE_INT_CST_LOW (primop1), | |
2641 | TREE_INT_CST_HIGH (primop1), 0, | |
eddad94a | 2642 | TREE_OVERFLOW (primop1)); |
18dbec6f | 2643 | } |
b0fc3e72 | 2644 | if (type != *restype_ptr) |
2645 | { | |
2646 | minval = convert (*restype_ptr, minval); | |
2647 | maxval = convert (*restype_ptr, maxval); | |
2648 | } | |
2649 | ||
2650 | if (unsignedp && unsignedp0) | |
2651 | { | |
2652 | min_gt = INT_CST_LT_UNSIGNED (primop1, minval); | |
2653 | max_gt = INT_CST_LT_UNSIGNED (primop1, maxval); | |
2654 | min_lt = INT_CST_LT_UNSIGNED (minval, primop1); | |
2655 | max_lt = INT_CST_LT_UNSIGNED (maxval, primop1); | |
2656 | } | |
2657 | else | |
2658 | { | |
2659 | min_gt = INT_CST_LT (primop1, minval); | |
2660 | max_gt = INT_CST_LT (primop1, maxval); | |
2661 | min_lt = INT_CST_LT (minval, primop1); | |
2662 | max_lt = INT_CST_LT (maxval, primop1); | |
2663 | } | |
2664 | ||
2665 | val = 0; | |
2666 | /* This used to be a switch, but Genix compiler can't handle that. */ | |
2667 | if (code == NE_EXPR) | |
2668 | { | |
2669 | if (max_lt || min_gt) | |
3c2239cf | 2670 | val = truthvalue_true_node; |
b0fc3e72 | 2671 | } |
2672 | else if (code == EQ_EXPR) | |
2673 | { | |
2674 | if (max_lt || min_gt) | |
3c2239cf | 2675 | val = truthvalue_false_node; |
b0fc3e72 | 2676 | } |
2677 | else if (code == LT_EXPR) | |
2678 | { | |
2679 | if (max_lt) | |
3c2239cf | 2680 | val = truthvalue_true_node; |
b0fc3e72 | 2681 | if (!min_lt) |
3c2239cf | 2682 | val = truthvalue_false_node; |
b0fc3e72 | 2683 | } |
2684 | else if (code == GT_EXPR) | |
2685 | { | |
2686 | if (min_gt) | |
3c2239cf | 2687 | val = truthvalue_true_node; |
b0fc3e72 | 2688 | if (!max_gt) |
3c2239cf | 2689 | val = truthvalue_false_node; |
b0fc3e72 | 2690 | } |
2691 | else if (code == LE_EXPR) | |
2692 | { | |
2693 | if (!max_gt) | |
3c2239cf | 2694 | val = truthvalue_true_node; |
b0fc3e72 | 2695 | if (min_gt) |
3c2239cf | 2696 | val = truthvalue_false_node; |
b0fc3e72 | 2697 | } |
2698 | else if (code == GE_EXPR) | |
2699 | { | |
2700 | if (!min_lt) | |
3c2239cf | 2701 | val = truthvalue_true_node; |
b0fc3e72 | 2702 | if (max_lt) |
3c2239cf | 2703 | val = truthvalue_false_node; |
b0fc3e72 | 2704 | } |
2705 | ||
2706 | /* If primop0 was sign-extended and unsigned comparison specd, | |
2707 | we did a signed comparison above using the signed type bounds. | |
2708 | But the comparison we output must be unsigned. | |
2709 | ||
2710 | Also, for inequalities, VAL is no good; but if the signed | |
2711 | comparison had *any* fixed result, it follows that the | |
2712 | unsigned comparison just tests the sign in reverse | |
2713 | (positive values are LE, negative ones GE). | |
2714 | So we can generate an unsigned comparison | |
2715 | against an extreme value of the signed type. */ | |
2716 | ||
2717 | if (unsignedp && !unsignedp0) | |
2718 | { | |
2719 | if (val != 0) | |
2720 | switch (code) | |
2721 | { | |
2722 | case LT_EXPR: | |
2723 | case GE_EXPR: | |
2724 | primop1 = TYPE_MIN_VALUE (type); | |
2725 | val = 0; | |
2726 | break; | |
2727 | ||
2728 | case LE_EXPR: | |
2729 | case GT_EXPR: | |
2730 | primop1 = TYPE_MAX_VALUE (type); | |
2731 | val = 0; | |
2732 | break; | |
31f820d2 | 2733 | |
2734 | default: | |
2735 | break; | |
b0fc3e72 | 2736 | } |
11773141 | 2737 | type = c_common_unsigned_type (type); |
b0fc3e72 | 2738 | } |
2739 | ||
fe5f2366 | 2740 | if (TREE_CODE (primop0) != INTEGER_CST) |
b0fc3e72 | 2741 | { |
3c2239cf | 2742 | if (val == truthvalue_false_node) |
e6e352cb | 2743 | warning (OPT_Wtype_limits, "comparison is always false due to limited range of data type"); |
3c2239cf | 2744 | if (val == truthvalue_true_node) |
e6e352cb | 2745 | warning (OPT_Wtype_limits, "comparison is always true due to limited range of data type"); |
b0fc3e72 | 2746 | } |
2747 | ||
2748 | if (val != 0) | |
2749 | { | |
2750 | /* Don't forget to evaluate PRIMOP0 if it has side effects. */ | |
2751 | if (TREE_SIDE_EFFECTS (primop0)) | |
14ae0310 | 2752 | return build2 (COMPOUND_EXPR, TREE_TYPE (val), primop0, val); |
b0fc3e72 | 2753 | return val; |
2754 | } | |
2755 | ||
2756 | /* Value is not predetermined, but do the comparison | |
2757 | in the type of the operand that is not constant. | |
2758 | TYPE is already properly set. */ | |
2759 | } | |
c4503c0a | 2760 | |
2761 | /* If either arg is decimal float and the other is float, find the | |
2762 | proper common type to use for comparison. */ | |
2763 | else if (real1 && real2 | |
2764 | && (DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (primop0))) | |
2765 | || DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (primop1))))) | |
2766 | type = common_type (TREE_TYPE (primop0), TREE_TYPE (primop1)); | |
2767 | ||
b0fc3e72 | 2768 | else if (real1 && real2 |
2203bd5c | 2769 | && (TYPE_PRECISION (TREE_TYPE (primop0)) |
2770 | == TYPE_PRECISION (TREE_TYPE (primop1)))) | |
b0fc3e72 | 2771 | type = TREE_TYPE (primop0); |
2772 | ||
2773 | /* If args' natural types are both narrower than nominal type | |
2774 | and both extend in the same manner, compare them | |
2775 | in the type of the wider arg. | |
2776 | Otherwise must actually extend both to the nominal | |
2777 | common type lest different ways of extending | |
2778 | alter the result. | |
2779 | (eg, (short)-1 == (unsigned short)-1 should be 0.) */ | |
2780 | ||
2781 | else if (unsignedp0 == unsignedp1 && real1 == real2 | |
2782 | && TYPE_PRECISION (TREE_TYPE (primop0)) < TYPE_PRECISION (*restype_ptr) | |
2783 | && TYPE_PRECISION (TREE_TYPE (primop1)) < TYPE_PRECISION (*restype_ptr)) | |
2784 | { | |
2785 | type = common_type (TREE_TYPE (primop0), TREE_TYPE (primop1)); | |
4070745f | 2786 | type = c_common_signed_or_unsigned_type (unsignedp0 |
78a8ed03 | 2787 | || TYPE_UNSIGNED (*restype_ptr), |
4070745f | 2788 | type); |
b0fc3e72 | 2789 | /* Make sure shorter operand is extended the right way |
2790 | to match the longer operand. */ | |
4070745f | 2791 | primop0 |
2792 | = convert (c_common_signed_or_unsigned_type (unsignedp0, | |
2793 | TREE_TYPE (primop0)), | |
2794 | primop0); | |
2795 | primop1 | |
2796 | = convert (c_common_signed_or_unsigned_type (unsignedp1, | |
2797 | TREE_TYPE (primop1)), | |
2798 | primop1); | |
b0fc3e72 | 2799 | } |
2800 | else | |
2801 | { | |
2802 | /* Here we must do the comparison on the nominal type | |
2803 | using the args exactly as we received them. */ | |
2804 | type = *restype_ptr; | |
2805 | primop0 = op0; | |
2806 | primop1 = op1; | |
2807 | ||
2808 | if (!real1 && !real2 && integer_zerop (primop1) | |
78a8ed03 | 2809 | && TYPE_UNSIGNED (*restype_ptr)) |
b0fc3e72 | 2810 | { |
2811 | tree value = 0; | |
2812 | switch (code) | |
2813 | { | |
2814 | case GE_EXPR: | |
e6e352cb | 2815 | /* All unsigned values are >= 0, so we warn. However, |
2816 | if OP0 is a constant that is >= 0, the signedness of | |
2817 | the comparison isn't an issue, so suppress the | |
2818 | warning. */ | |
2819 | if (warn_type_limits && !in_system_header | |
84166705 | 2820 | && !(TREE_CODE (primop0) == INTEGER_CST |
2821 | && !TREE_OVERFLOW (convert (c_common_signed_type (type), | |
2822 | primop0)))) | |
e6e352cb | 2823 | warning (OPT_Wtype_limits, |
2824 | "comparison of unsigned expression >= 0 is always true"); | |
3c2239cf | 2825 | value = truthvalue_true_node; |
b0fc3e72 | 2826 | break; |
2827 | ||
2828 | case LT_EXPR: | |
e6e352cb | 2829 | if (warn_type_limits && !in_system_header |
84166705 | 2830 | && !(TREE_CODE (primop0) == INTEGER_CST |
2831 | && !TREE_OVERFLOW (convert (c_common_signed_type (type), | |
2832 | primop0)))) | |
e6e352cb | 2833 | warning (OPT_Wtype_limits, |
2834 | "comparison of unsigned expression < 0 is always false"); | |
3c2239cf | 2835 | value = truthvalue_false_node; |
31f820d2 | 2836 | break; |
2837 | ||
2838 | default: | |
2839 | break; | |
b0fc3e72 | 2840 | } |
2841 | ||
2842 | if (value != 0) | |
2843 | { | |
2844 | /* Don't forget to evaluate PRIMOP0 if it has side effects. */ | |
2845 | if (TREE_SIDE_EFFECTS (primop0)) | |
14ae0310 | 2846 | return build2 (COMPOUND_EXPR, TREE_TYPE (value), |
2847 | primop0, value); | |
b0fc3e72 | 2848 | return value; |
2849 | } | |
2850 | } | |
2851 | } | |
2852 | ||
2853 | *op0_ptr = convert (type, primop0); | |
2854 | *op1_ptr = convert (type, primop1); | |
2855 | ||
3c2239cf | 2856 | *restype_ptr = truthvalue_type_node; |
b0fc3e72 | 2857 | |
2858 | return 0; | |
2859 | } | |
2860 | \f | |
1c26100f | 2861 | /* Return a tree for the sum or difference (RESULTCODE says which) |
2862 | of pointer PTROP and integer INTOP. */ | |
2863 | ||
2864 | tree | |
1cae46be | 2865 | pointer_int_sum (enum tree_code resultcode, tree ptrop, tree intop) |
1c26100f | 2866 | { |
add6ee5e | 2867 | tree size_exp, ret; |
1c26100f | 2868 | |
1c26100f | 2869 | /* The result is a pointer of the same type that is being added. */ |
1c26100f | 2870 | tree result_type = TREE_TYPE (ptrop); |
2871 | ||
2872 | if (TREE_CODE (TREE_TYPE (result_type)) == VOID_TYPE) | |
2873 | { | |
2874 | if (pedantic || warn_pointer_arith) | |
b0b1af64 | 2875 | pedwarn ("pointer of type %<void *%> used in arithmetic"); |
1c26100f | 2876 | size_exp = integer_one_node; |
2877 | } | |
2878 | else if (TREE_CODE (TREE_TYPE (result_type)) == FUNCTION_TYPE) | |
2879 | { | |
2880 | if (pedantic || warn_pointer_arith) | |
2881 | pedwarn ("pointer to a function used in arithmetic"); | |
2882 | size_exp = integer_one_node; | |
2883 | } | |
2884 | else if (TREE_CODE (TREE_TYPE (result_type)) == METHOD_TYPE) | |
2885 | { | |
2886 | if (pedantic || warn_pointer_arith) | |
2887 | pedwarn ("pointer to member function used in arithmetic"); | |
2888 | size_exp = integer_one_node; | |
2889 | } | |
1c26100f | 2890 | else |
2891 | size_exp = size_in_bytes (TREE_TYPE (result_type)); | |
2892 | ||
add6ee5e | 2893 | /* We are manipulating pointer values, so we don't need to warn |
2894 | about relying on undefined signed overflow. We disable the | |
2895 | warning here because we use integer types so fold won't know that | |
2896 | they are really pointers. */ | |
2897 | fold_defer_overflow_warnings (); | |
2898 | ||
1c26100f | 2899 | /* If what we are about to multiply by the size of the elements |
2900 | contains a constant term, apply distributive law | |
2901 | and multiply that constant term separately. | |
2902 | This helps produce common subexpressions. */ | |
1c26100f | 2903 | if ((TREE_CODE (intop) == PLUS_EXPR || TREE_CODE (intop) == MINUS_EXPR) |
84166705 | 2904 | && !TREE_CONSTANT (intop) |
1c26100f | 2905 | && TREE_CONSTANT (TREE_OPERAND (intop, 1)) |
2906 | && TREE_CONSTANT (size_exp) | |
2907 | /* If the constant comes from pointer subtraction, | |
2908 | skip this optimization--it would cause an error. */ | |
2909 | && TREE_CODE (TREE_TYPE (TREE_OPERAND (intop, 0))) == INTEGER_TYPE | |
2910 | /* If the constant is unsigned, and smaller than the pointer size, | |
2911 | then we must skip this optimization. This is because it could cause | |
2912 | an overflow error if the constant is negative but INTOP is not. */ | |
84166705 | 2913 | && (!TYPE_UNSIGNED (TREE_TYPE (intop)) |
1c26100f | 2914 | || (TYPE_PRECISION (TREE_TYPE (intop)) |
2915 | == TYPE_PRECISION (TREE_TYPE (ptrop))))) | |
2916 | { | |
2917 | enum tree_code subcode = resultcode; | |
2918 | tree int_type = TREE_TYPE (intop); | |
2919 | if (TREE_CODE (intop) == MINUS_EXPR) | |
2920 | subcode = (subcode == PLUS_EXPR ? MINUS_EXPR : PLUS_EXPR); | |
2921 | /* Convert both subexpression types to the type of intop, | |
2922 | because weird cases involving pointer arithmetic | |
2923 | can result in a sum or difference with different type args. */ | |
2924 | ptrop = build_binary_op (subcode, ptrop, | |
2925 | convert (int_type, TREE_OPERAND (intop, 1)), 1); | |
2926 | intop = convert (int_type, TREE_OPERAND (intop, 0)); | |
2927 | } | |
2928 | ||
2929 | /* Convert the integer argument to a type the same size as sizetype | |
2930 | so the multiply won't overflow spuriously. */ | |
1c26100f | 2931 | if (TYPE_PRECISION (TREE_TYPE (intop)) != TYPE_PRECISION (sizetype) |
78a8ed03 | 2932 | || TYPE_UNSIGNED (TREE_TYPE (intop)) != TYPE_UNSIGNED (sizetype)) |
1cae46be | 2933 | intop = convert (c_common_type_for_size (TYPE_PRECISION (sizetype), |
78a8ed03 | 2934 | TYPE_UNSIGNED (sizetype)), intop); |
1c26100f | 2935 | |
2936 | /* Replace the integer argument with a suitable product by the object size. | |
2937 | Do this multiplication as signed, then convert to the appropriate | |
499e523f | 2938 | type for the pointer operation. */ |
2939 | intop = convert (sizetype, | |
2940 | build_binary_op (MULT_EXPR, intop, | |
2941 | convert (TREE_TYPE (intop), size_exp), 1)); | |
0de36bdb | 2942 | |
499e523f | 2943 | /* Create the sum or difference. */ |
0de36bdb | 2944 | if (resultcode == MINUS_EXPR) |
499e523f | 2945 | intop = fold_build1 (NEGATE_EXPR, sizetype, intop); |
1c26100f | 2946 | |
0de36bdb | 2947 | ret = fold_build2 (POINTER_PLUS_EXPR, result_type, ptrop, intop); |
add6ee5e | 2948 | |
2949 | fold_undefer_and_ignore_overflow_warnings (); | |
2950 | ||
2951 | return ret; | |
1c26100f | 2952 | } |
2953 | \f | |
6b68e71a | 2954 | /* Return whether EXPR is a declaration whose address can never be |
2955 | NULL. */ | |
2956 | ||
2957 | bool | |
9f627b1a | 2958 | decl_with_nonnull_addr_p (const_tree expr) |
6b68e71a | 2959 | { |
2960 | return (DECL_P (expr) | |
2961 | && (TREE_CODE (expr) == PARM_DECL | |
2962 | || TREE_CODE (expr) == LABEL_DECL | |
2963 | || !DECL_WEAK (expr))); | |
2964 | } | |
2965 | ||
b0fc3e72 | 2966 | /* Prepare expr to be an argument of a TRUTH_NOT_EXPR, |
45a78cc0 | 2967 | or for an `if' or `while' statement or ?..: exp. It should already |
2968 | have been validated to be of suitable type; otherwise, a bad | |
2969 | diagnostic may result. | |
b0fc3e72 | 2970 | |
2971 | This preparation consists of taking the ordinary | |
2972 | representation of an expression expr and producing a valid tree | |
2973 | boolean expression describing whether expr is nonzero. We could | |
3c2239cf | 2974 | simply always do build_binary_op (NE_EXPR, expr, truthvalue_false_node, 1), |
b0fc3e72 | 2975 | but we optimize comparisons, &&, ||, and !. |
2976 | ||
3c2239cf | 2977 | The resulting type should always be `truthvalue_type_node'. */ |
b0fc3e72 | 2978 | |
2979 | tree | |
1cae46be | 2980 | c_common_truthvalue_conversion (tree expr) |
b0fc3e72 | 2981 | { |
b0fc3e72 | 2982 | switch (TREE_CODE (expr)) |
2983 | { | |
318a728f | 2984 | case EQ_EXPR: case NE_EXPR: case UNEQ_EXPR: case LTGT_EXPR: |
e1232ce2 | 2985 | case LE_EXPR: case GE_EXPR: case LT_EXPR: case GT_EXPR: |
2986 | case UNLE_EXPR: case UNGE_EXPR: case UNLT_EXPR: case UNGT_EXPR: | |
2987 | case ORDERED_EXPR: case UNORDERED_EXPR: | |
ce04dcdc | 2988 | if (TREE_TYPE (expr) == truthvalue_type_node) |
2989 | return expr; | |
2990 | return build2 (TREE_CODE (expr), truthvalue_type_node, | |
2991 | TREE_OPERAND (expr, 0), TREE_OPERAND (expr, 1)); | |
2992 | ||
b0fc3e72 | 2993 | case TRUTH_ANDIF_EXPR: |
2994 | case TRUTH_ORIF_EXPR: | |
2995 | case TRUTH_AND_EXPR: | |
2996 | case TRUTH_OR_EXPR: | |
31f6e93c | 2997 | case TRUTH_XOR_EXPR: |
ce04dcdc | 2998 | if (TREE_TYPE (expr) == truthvalue_type_node) |
2999 | return expr; | |
3000 | return build2 (TREE_CODE (expr), truthvalue_type_node, | |
45a78cc0 | 3001 | c_common_truthvalue_conversion (TREE_OPERAND (expr, 0)), |
3002 | c_common_truthvalue_conversion (TREE_OPERAND (expr, 1))); | |
3e851b85 | 3003 | |
f6e28f72 | 3004 | case TRUTH_NOT_EXPR: |
ce04dcdc | 3005 | if (TREE_TYPE (expr) == truthvalue_type_node) |
3006 | return expr; | |
3007 | return build1 (TREE_CODE (expr), truthvalue_type_node, | |
45a78cc0 | 3008 | c_common_truthvalue_conversion (TREE_OPERAND (expr, 0))); |
f6e28f72 | 3009 | |
b0fc3e72 | 3010 | case ERROR_MARK: |
3011 | return expr; | |
3012 | ||
3013 | case INTEGER_CST: | |
eddad94a | 3014 | return integer_zerop (expr) ? truthvalue_false_node |
3015 | : truthvalue_true_node; | |
b0fc3e72 | 3016 | |
3017 | case REAL_CST: | |
5000e21c | 3018 | return real_compare (NE_EXPR, &TREE_REAL_CST (expr), &dconst0) |
3019 | ? truthvalue_true_node | |
3020 | : truthvalue_false_node; | |
b0fc3e72 | 3021 | |
9421ebb9 | 3022 | case FIXED_CST: |
3023 | return fixed_compare (NE_EXPR, &TREE_FIXED_CST (expr), | |
3024 | &FCONST0 (TYPE_MODE (TREE_TYPE (expr)))) | |
3025 | ? truthvalue_true_node | |
3026 | : truthvalue_false_node; | |
3027 | ||
ce04dcdc | 3028 | case FUNCTION_DECL: |
3029 | expr = build_unary_op (ADDR_EXPR, expr, 0); | |
3030 | /* Fall through. */ | |
3031 | ||
b0fc3e72 | 3032 | case ADDR_EXPR: |
ce871053 | 3033 | { |
ee7d4d6a | 3034 | tree inner = TREE_OPERAND (expr, 0); |
6b68e71a | 3035 | if (decl_with_nonnull_addr_p (inner)) |
ce871053 | 3036 | { |
6b68e71a | 3037 | /* Common Ada/Pascal programmer's mistake. */ |
ede5a481 | 3038 | warning (OPT_Waddress, |
6b68e71a | 3039 | "the address of %qD will always evaluate as %<true%>", |
ee7d4d6a | 3040 | inner); |
ce871053 | 3041 | return truthvalue_true_node; |
3042 | } | |
65b5e6a6 | 3043 | |
6b68e71a | 3044 | /* If we still have a decl, it is possible for its address to |
3045 | be NULL, so we cannot optimize. */ | |
3046 | if (DECL_P (inner)) | |
3047 | { | |
3048 | gcc_assert (DECL_WEAK (inner)); | |
3049 | break; | |
3050 | } | |
ce871053 | 3051 | |
ee7d4d6a | 3052 | if (TREE_SIDE_EFFECTS (inner)) |
14ae0310 | 3053 | return build2 (COMPOUND_EXPR, truthvalue_type_node, |
ee7d4d6a | 3054 | inner, truthvalue_true_node); |
ce871053 | 3055 | else |
3056 | return truthvalue_true_node; | |
3057 | } | |
b0fc3e72 | 3058 | |
2203bd5c | 3059 | case COMPLEX_EXPR: |
2ba726d2 | 3060 | return build_binary_op ((TREE_SIDE_EFFECTS (TREE_OPERAND (expr, 1)) |
95809de4 | 3061 | ? TRUTH_OR_EXPR : TRUTH_ORIF_EXPR), |
45a78cc0 | 3062 | c_common_truthvalue_conversion (TREE_OPERAND (expr, 0)), |
3063 | c_common_truthvalue_conversion (TREE_OPERAND (expr, 1)), | |
2203bd5c | 3064 | 0); |
3065 | ||
b0fc3e72 | 3066 | case NEGATE_EXPR: |
3067 | case ABS_EXPR: | |
3068 | case FLOAT_EXPR: | |
d10cfa8d | 3069 | /* These don't change whether an object is nonzero or zero. */ |
45a78cc0 | 3070 | return c_common_truthvalue_conversion (TREE_OPERAND (expr, 0)); |
b0fc3e72 | 3071 | |
3072 | case LROTATE_EXPR: | |
3073 | case RROTATE_EXPR: | |
d10cfa8d | 3074 | /* These don't change whether an object is zero or nonzero, but |
b0fc3e72 | 3075 | we can't ignore them if their second arg has side-effects. */ |
3076 | if (TREE_SIDE_EFFECTS (TREE_OPERAND (expr, 1))) | |
14ae0310 | 3077 | return build2 (COMPOUND_EXPR, truthvalue_type_node, |
3078 | TREE_OPERAND (expr, 1), | |
45a78cc0 | 3079 | c_common_truthvalue_conversion (TREE_OPERAND (expr, 0))); |
b0fc3e72 | 3080 | else |
45a78cc0 | 3081 | return c_common_truthvalue_conversion (TREE_OPERAND (expr, 0)); |
73be5127 | 3082 | |
b0fc3e72 | 3083 | case COND_EXPR: |
3084 | /* Distribute the conversion into the arms of a COND_EXPR. */ | |
49d00087 | 3085 | return fold_build3 (COND_EXPR, truthvalue_type_node, |
14ae0310 | 3086 | TREE_OPERAND (expr, 0), |
45a78cc0 | 3087 | c_common_truthvalue_conversion (TREE_OPERAND (expr, 1)), |
49d00087 | 3088 | c_common_truthvalue_conversion (TREE_OPERAND (expr, 2))); |
b0fc3e72 | 3089 | |
72dd6141 | 3090 | CASE_CONVERT: |
b0fc3e72 | 3091 | /* Don't cancel the effect of a CONVERT_EXPR from a REFERENCE_TYPE, |
3092 | since that affects how `default_conversion' will behave. */ | |
3093 | if (TREE_CODE (TREE_TYPE (expr)) == REFERENCE_TYPE | |
3094 | || TREE_CODE (TREE_TYPE (TREE_OPERAND (expr, 0))) == REFERENCE_TYPE) | |
3095 | break; | |
b0fc3e72 | 3096 | /* If this is widening the argument, we can ignore it. */ |
3097 | if (TYPE_PRECISION (TREE_TYPE (expr)) | |
3098 | >= TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (expr, 0)))) | |
45a78cc0 | 3099 | return c_common_truthvalue_conversion (TREE_OPERAND (expr, 0)); |
b0fc3e72 | 3100 | break; |
3101 | ||
16837b18 | 3102 | case MODIFY_EXPR: |
60a0513e | 3103 | if (!TREE_NO_WARNING (expr) |
3104 | && warn_parentheses) | |
3105 | { | |
3106 | warning (OPT_Wparentheses, | |
3107 | "suggest parentheses around assignment used as truth value"); | |
3108 | TREE_NO_WARNING (expr) = 1; | |
3109 | } | |
16837b18 | 3110 | break; |
73be5127 | 3111 | |
31f820d2 | 3112 | default: |
3113 | break; | |
b0fc3e72 | 3114 | } |
3115 | ||
2ba726d2 | 3116 | if (TREE_CODE (TREE_TYPE (expr)) == COMPLEX_TYPE) |
a0748b7d | 3117 | { |
aff9e656 | 3118 | tree t = save_expr (expr); |
a0748b7d | 3119 | return (build_binary_op |
3120 | ((TREE_SIDE_EFFECTS (expr) | |
3121 | ? TRUTH_OR_EXPR : TRUTH_ORIF_EXPR), | |
45a78cc0 | 3122 | c_common_truthvalue_conversion (build_unary_op (REALPART_EXPR, t, 0)), |
3123 | c_common_truthvalue_conversion (build_unary_op (IMAGPART_EXPR, t, 0)), | |
a0748b7d | 3124 | 0)); |
3125 | } | |
2ba726d2 | 3126 | |
9421ebb9 | 3127 | if (TREE_CODE (TREE_TYPE (expr)) == FIXED_POINT_TYPE) |
3128 | { | |
3129 | tree fixed_zero_node = build_fixed (TREE_TYPE (expr), | |
3130 | FCONST0 (TYPE_MODE | |
3131 | (TREE_TYPE (expr)))); | |
3132 | return build_binary_op (NE_EXPR, expr, fixed_zero_node, 1); | |
3133 | } | |
3134 | ||
b0fc3e72 | 3135 | return build_binary_op (NE_EXPR, expr, integer_zero_node, 1); |
3136 | } | |
3137 | \f | |
3237155d | 3138 | static void def_builtin_1 (enum built_in_function fncode, |
3139 | const char *name, | |
3140 | enum built_in_class fnclass, | |
3141 | tree fntype, tree libtype, | |
3142 | bool both_p, bool fallback_p, bool nonansi_p, | |
3143 | tree fnattrs, bool implicit_p); | |
0d4238dc | 3144 | |
a5b1863e | 3145 | |
3146 | /* Apply the TYPE_QUALS to the new DECL. */ | |
3147 | ||
3148 | void | |
1cae46be | 3149 | c_apply_type_quals_to_decl (int type_quals, tree decl) |
a5b1863e | 3150 | { |
adfb367f | 3151 | tree type = TREE_TYPE (decl); |
b27ac6b5 | 3152 | |
e4eabbe4 | 3153 | if (type == error_mark_node) |
3154 | return; | |
adfb367f | 3155 | |
3156 | if (((type_quals & TYPE_QUAL_CONST) | |
3157 | || (type && TREE_CODE (type) == REFERENCE_TYPE)) | |
3158 | /* An object declared 'const' is only readonly after it is | |
3159 | initialized. We don't have any way of expressing this currently, | |
3160 | so we need to be conservative and unset TREE_READONLY for types | |
3161 | with constructors. Otherwise aliasing code will ignore stores in | |
3162 | an inline constructor. */ | |
3163 | && !(type && TYPE_NEEDS_CONSTRUCTING (type))) | |
a5b1863e | 3164 | TREE_READONLY (decl) = 1; |
3165 | if (type_quals & TYPE_QUAL_VOLATILE) | |
3166 | { | |
3167 | TREE_SIDE_EFFECTS (decl) = 1; | |
3168 | TREE_THIS_VOLATILE (decl) = 1; | |
3169 | } | |
d91a20bc | 3170 | if (type_quals & TYPE_QUAL_RESTRICT) |
a5b1863e | 3171 | { |
adfb367f | 3172 | while (type && TREE_CODE (type) == ARRAY_TYPE) |
3173 | /* Allow 'restrict' on arrays of pointers. | |
3174 | FIXME currently we just ignore it. */ | |
3175 | type = TREE_TYPE (type); | |
3176 | if (!type | |
3177 | || !POINTER_TYPE_P (type) | |
3178 | || !C_TYPE_OBJECT_OR_INCOMPLETE_P (TREE_TYPE (type))) | |
b0b1af64 | 3179 | error ("invalid use of %<restrict%>"); |
adfb367f | 3180 | else if (flag_strict_aliasing && type == TREE_TYPE (decl)) |
ed83aafb | 3181 | /* Indicate we need to make a unique alias set for this pointer. |
3182 | We can't do it here because it might be pointing to an | |
3183 | incomplete type. */ | |
3184 | DECL_POINTER_ALIAS_SET (decl) = -2; | |
a5b1863e | 3185 | } |
3186 | } | |
3187 | ||
4ee9c684 | 3188 | /* Hash function for the problem of multiple type definitions in |
3189 | different files. This must hash all types that will compare | |
3190 | equal via comptypes to the same value. In practice it hashes | |
0bed3869 | 3191 | on some of the simple stuff and leaves the details to comptypes. */ |
4ee9c684 | 3192 | |
3193 | static hashval_t | |
3194 | c_type_hash (const void *p) | |
3195 | { | |
3196 | int i = 0; | |
3197 | int shift, size; | |
aae87fc3 | 3198 | const_tree const t = (const_tree) p; |
4ee9c684 | 3199 | tree t2; |
3200 | switch (TREE_CODE (t)) | |
3201 | { | |
fbf0afd1 | 3202 | /* For pointers, hash on pointee type plus some swizzling. */ |
2363ef00 | 3203 | case POINTER_TYPE: |
3204 | return c_type_hash (TREE_TYPE (t)) ^ 0x3003003; | |
3205 | /* Hash on number of elements and total size. */ | |
3206 | case ENUMERAL_TYPE: | |
3207 | shift = 3; | |
3208 | t2 = TYPE_VALUES (t); | |
3209 | break; | |
3210 | case RECORD_TYPE: | |
3211 | shift = 0; | |
3212 | t2 = TYPE_FIELDS (t); | |
3213 | break; | |
3214 | case QUAL_UNION_TYPE: | |
3215 | shift = 1; | |
3216 | t2 = TYPE_FIELDS (t); | |
3217 | break; | |
3218 | case UNION_TYPE: | |
3219 | shift = 2; | |
3220 | t2 = TYPE_FIELDS (t); | |
3221 | break; | |
3222 | default: | |
231bd014 | 3223 | gcc_unreachable (); |
4ee9c684 | 3224 | } |
3225 | for (; t2; t2 = TREE_CHAIN (t2)) | |
3226 | i++; | |
78c2e180 | 3227 | /* We might have a VLA here. */ |
3228 | if (TREE_CODE (TYPE_SIZE (t)) != INTEGER_CST) | |
3229 | size = 0; | |
3230 | else | |
3231 | size = TREE_INT_CST_LOW (TYPE_SIZE (t)); | |
4ee9c684 | 3232 | return ((size << 24) | (i << shift)); |
3233 | } | |
3234 | ||
1ecd4018 | 3235 | static GTY((param_is (union tree_node))) htab_t type_hash_table; |
3236 | ||
b5ba9f3a | 3237 | /* Return the typed-based alias set for T, which may be an expression |
f7c44134 | 3238 | or a type. Return -1 if we don't do anything special. */ |
b5ba9f3a | 3239 | |
32c2fdea | 3240 | alias_set_type |
1cae46be | 3241 | c_common_get_alias_set (tree t) |
b5ba9f3a | 3242 | { |
be4f2de7 | 3243 | tree u; |
4ee9c684 | 3244 | PTR *slot; |
1cae46be | 3245 | |
be4f2de7 | 3246 | /* Permit type-punning when accessing a union, provided the access |
3247 | is directly through the union. For example, this code does not | |
3248 | permit taking the address of a union member and then storing | |
3249 | through it. Even the type-punning allowed here is a GCC | |
3250 | extension, albeit a common and useful one; the C standard says | |
3251 | that such accesses have implementation-defined behavior. */ | |
3252 | for (u = t; | |
3253 | TREE_CODE (u) == COMPONENT_REF || TREE_CODE (u) == ARRAY_REF; | |
3254 | u = TREE_OPERAND (u, 0)) | |
3255 | if (TREE_CODE (u) == COMPONENT_REF | |
3256 | && TREE_CODE (TREE_TYPE (TREE_OPERAND (u, 0))) == UNION_TYPE) | |
3257 | return 0; | |
1e2513d9 | 3258 | |
9fcc3e54 | 3259 | /* That's all the expressions we handle specially. */ |
84166705 | 3260 | if (!TYPE_P (t)) |
9fcc3e54 | 3261 | return -1; |
3262 | ||
d716ce75 | 3263 | /* The C standard guarantees that any object may be accessed via an |
9fcc3e54 | 3264 | lvalue that has character type. */ |
3265 | if (t == char_type_node | |
3266 | || t == signed_char_type_node | |
3267 | || t == unsigned_char_type_node) | |
f7c44134 | 3268 | return 0; |
a5b1863e | 3269 | |
cb59f969 | 3270 | /* If it has the may_alias attribute, it can alias anything. */ |
9fcc3e54 | 3271 | if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (t))) |
cb59f969 | 3272 | return 0; |
3273 | ||
1607663f | 3274 | /* The C standard specifically allows aliasing between signed and |
3275 | unsigned variants of the same type. We treat the signed | |
3276 | variant as canonical. */ | |
78a8ed03 | 3277 | if (TREE_CODE (t) == INTEGER_TYPE && TYPE_UNSIGNED (t)) |
a8868e19 | 3278 | { |
4070745f | 3279 | tree t1 = c_common_signed_type (t); |
1607663f | 3280 | |
a8868e19 | 3281 | /* t1 == t can happen for boolean nodes which are always unsigned. */ |
3282 | if (t1 != t) | |
3283 | return get_alias_set (t1); | |
3284 | } | |
f7c44134 | 3285 | else if (POINTER_TYPE_P (t)) |
87d2d17e | 3286 | { |
f7c44134 | 3287 | tree t1; |
87d2d17e | 3288 | |
3289 | /* Unfortunately, there is no canonical form of a pointer type. | |
3290 | In particular, if we have `typedef int I', then `int *', and | |
3291 | `I *' are different types. So, we have to pick a canonical | |
3292 | representative. We do this below. | |
44e9fa65 | 3293 | |
40bdc593 | 3294 | Technically, this approach is actually more conservative that |
3295 | it needs to be. In particular, `const int *' and `int *' | |
734c98be | 3296 | should be in different alias sets, according to the C and C++ |
40bdc593 | 3297 | standard, since their types are not the same, and so, |
3298 | technically, an `int **' and `const int **' cannot point at | |
3299 | the same thing. | |
3300 | ||
4ee9c684 | 3301 | But, the standard is wrong. In particular, this code is |
40bdc593 | 3302 | legal C++: |
3303 | ||
a0c938f0 | 3304 | int *ip; |
3305 | int **ipp = &ip; | |
3306 | const int* const* cipp = ipp; | |
40bdc593 | 3307 | |
4ee9c684 | 3308 | And, it doesn't make sense for that to be legal unless you |
40bdc593 | 3309 | can dereference IPP and CIPP. So, we ignore cv-qualifiers on |
3310 | the pointed-to types. This issue has been reported to the | |
3311 | C++ committee. */ | |
211f3116 | 3312 | t1 = build_type_no_quals (t); |
f7c44134 | 3313 | if (t1 != t) |
3314 | return get_alias_set (t1); | |
87d2d17e | 3315 | } |
1e2513d9 | 3316 | |
4ee9c684 | 3317 | /* Handle the case of multiple type nodes referring to "the same" type, |
3318 | which occurs with IMA. These share an alias set. FIXME: Currently only | |
3319 | C90 is handled. (In C99 type compatibility is not transitive, which | |
3320 | complicates things mightily. The alias set splay trees can theoretically | |
3321 | represent this, but insertion is tricky when you consider all the | |
3322 | different orders things might arrive in.) */ | |
3323 | ||
3324 | if (c_language != clk_c || flag_isoc99) | |
3325 | return -1; | |
3326 | ||
0bed3869 | 3327 | /* Save time if there's only one input file. */ |
e08bd2f4 | 3328 | if (num_in_fnames == 1) |
4ee9c684 | 3329 | return -1; |
3330 | ||
3331 | /* Pointers need special handling if they point to any type that | |
3332 | needs special handling (below). */ | |
3333 | if (TREE_CODE (t) == POINTER_TYPE) | |
3334 | { | |
3335 | tree t2; | |
3336 | /* Find bottom type under any nested POINTERs. */ | |
b27ac6b5 | 3337 | for (t2 = TREE_TYPE (t); |
af592f67 | 3338 | TREE_CODE (t2) == POINTER_TYPE; |
3339 | t2 = TREE_TYPE (t2)) | |
3340 | ; | |
b27ac6b5 | 3341 | if (TREE_CODE (t2) != RECORD_TYPE |
af592f67 | 3342 | && TREE_CODE (t2) != ENUMERAL_TYPE |
3343 | && TREE_CODE (t2) != QUAL_UNION_TYPE | |
3344 | && TREE_CODE (t2) != UNION_TYPE) | |
3345 | return -1; | |
4ee9c684 | 3346 | if (TYPE_SIZE (t2) == 0) |
af592f67 | 3347 | return -1; |
4ee9c684 | 3348 | } |
3349 | /* These are the only cases that need special handling. */ | |
b27ac6b5 | 3350 | if (TREE_CODE (t) != RECORD_TYPE |
4ee9c684 | 3351 | && TREE_CODE (t) != ENUMERAL_TYPE |
3352 | && TREE_CODE (t) != QUAL_UNION_TYPE | |
3353 | && TREE_CODE (t) != UNION_TYPE | |
3354 | && TREE_CODE (t) != POINTER_TYPE) | |
3355 | return -1; | |
3356 | /* Undefined? */ | |
3357 | if (TYPE_SIZE (t) == 0) | |
3358 | return -1; | |
3359 | ||
b27ac6b5 | 3360 | /* Look up t in hash table. Only one of the compatible types within each |
4ee9c684 | 3361 | alias set is recorded in the table. */ |
3362 | if (!type_hash_table) | |
1ecd4018 | 3363 | type_hash_table = htab_create_ggc (1021, c_type_hash, |
4ee9c684 | 3364 | (htab_eq) lang_hooks.types_compatible_p, |
3365 | NULL); | |
3366 | slot = htab_find_slot (type_hash_table, t, INSERT); | |
3367 | if (*slot != NULL) | |
ad16cb2c | 3368 | { |
3369 | TYPE_ALIAS_SET (t) = TYPE_ALIAS_SET ((tree)*slot); | |
3370 | return TYPE_ALIAS_SET ((tree)*slot); | |
3371 | } | |
4ee9c684 | 3372 | else |
3373 | /* Our caller will assign and record (in t) a new alias set; all we need | |
3374 | to do is remember t in the hash table. */ | |
3375 | *slot = t; | |
3376 | ||
f7c44134 | 3377 | return -1; |
b5ba9f3a | 3378 | } |
902b4e01 | 3379 | \f |
d4c4d95c | 3380 | /* Compute the value of 'sizeof (TYPE)' or '__alignof__ (TYPE)', where the |
d3a4d008 | 3381 | second parameter indicates which OPERATOR is being applied. The COMPLAIN |
3382 | flag controls whether we should diagnose possibly ill-formed | |
3383 | constructs or not. */ | |
908c697e | 3384 | |
902b4e01 | 3385 | tree |
908c697e | 3386 | c_sizeof_or_alignof_type (tree type, bool is_sizeof, int complain) |
902b4e01 | 3387 | { |
d4c4d95c | 3388 | const char *op_name; |
3389 | tree value = NULL; | |
3390 | enum tree_code type_code = TREE_CODE (type); | |
1cae46be | 3391 | |
908c697e | 3392 | op_name = is_sizeof ? "sizeof" : "__alignof__"; |
1cae46be | 3393 | |
d4c4d95c | 3394 | if (type_code == FUNCTION_TYPE) |
902b4e01 | 3395 | { |
908c697e | 3396 | if (is_sizeof) |
d4c4d95c | 3397 | { |
d3a4d008 | 3398 | if (complain && (pedantic || warn_pointer_arith)) |
b0b1af64 | 3399 | pedwarn ("invalid application of %<sizeof%> to a function type"); |
ebd21de4 | 3400 | else if (!complain) |
3401 | return error_mark_node; | |
d4c4d95c | 3402 | value = size_one_node; |
3403 | } | |
3404 | else | |
3405 | value = size_int (FUNCTION_BOUNDARY / BITS_PER_UNIT); | |
3406 | } | |
3407 | else if (type_code == VOID_TYPE || type_code == ERROR_MARK) | |
3408 | { | |
1cae46be | 3409 | if (type_code == VOID_TYPE |
d3a4d008 | 3410 | && complain && (pedantic || warn_pointer_arith)) |
b0b1af64 | 3411 | pedwarn ("invalid application of %qs to a void type", op_name); |
ebd21de4 | 3412 | else if (!complain) |
3413 | return error_mark_node; | |
d4c4d95c | 3414 | value = size_one_node; |
902b4e01 | 3415 | } |
902b4e01 | 3416 | else if (!COMPLETE_TYPE_P (type)) |
3417 | { | |
d3a4d008 | 3418 | if (complain) |
b0b1af64 | 3419 | error ("invalid application of %qs to incomplete type %qT ", |
3ad0e8cc | 3420 | op_name, type); |
d4c4d95c | 3421 | value = size_zero_node; |
902b4e01 | 3422 | } |
3423 | else | |
d4c4d95c | 3424 | { |
908c697e | 3425 | if (is_sizeof) |
d4c4d95c | 3426 | /* Convert in case a char is more than one unit. */ |
3427 | value = size_binop (CEIL_DIV_EXPR, TYPE_SIZE_UNIT (type), | |
3428 | size_int (TYPE_PRECISION (char_type_node) | |
3429 | / BITS_PER_UNIT)); | |
3430 | else | |
d37625c0 | 3431 | value = size_int (TYPE_ALIGN_UNIT (type)); |
d4c4d95c | 3432 | } |
902b4e01 | 3433 | |
d4c4d95c | 3434 | /* VALUE will have an integer type with TYPE_IS_SIZETYPE set. |
3435 | TYPE_IS_SIZETYPE means that certain things (like overflow) will | |
3436 | never happen. However, this node should really have type | |
3437 | `size_t', which is just a typedef for an ordinary integer type. */ | |
143d62d7 | 3438 | value = fold_convert (size_type_node, value); |
1d8fc210 | 3439 | gcc_assert (!TYPE_IS_SIZETYPE (TREE_TYPE (value))); |
1cae46be | 3440 | |
d4c4d95c | 3441 | return value; |
902b4e01 | 3442 | } |
3443 | ||
3444 | /* Implement the __alignof keyword: Return the minimum required | |
097b5c8b | 3445 | alignment of EXPR, measured in bytes. For VAR_DECLs, |
3446 | FUNCTION_DECLs and FIELD_DECLs return DECL_ALIGN (which can be set | |
3447 | from an "aligned" __attribute__ specification). */ | |
72040e7e | 3448 | |
902b4e01 | 3449 | tree |
1cae46be | 3450 | c_alignof_expr (tree expr) |
902b4e01 | 3451 | { |
3452 | tree t; | |
3453 | ||
097b5c8b | 3454 | if (VAR_OR_FUNCTION_DECL_P (expr)) |
d37625c0 | 3455 | t = size_int (DECL_ALIGN_UNIT (expr)); |
1cae46be | 3456 | |
902b4e01 | 3457 | else if (TREE_CODE (expr) == COMPONENT_REF |
3458 | && DECL_C_BIT_FIELD (TREE_OPERAND (expr, 1))) | |
3459 | { | |
b0b1af64 | 3460 | error ("%<__alignof%> applied to a bit-field"); |
902b4e01 | 3461 | t = size_one_node; |
3462 | } | |
3463 | else if (TREE_CODE (expr) == COMPONENT_REF | |
7cc7e163 | 3464 | && TREE_CODE (TREE_OPERAND (expr, 1)) == FIELD_DECL) |
d37625c0 | 3465 | t = size_int (DECL_ALIGN_UNIT (TREE_OPERAND (expr, 1))); |
1cae46be | 3466 | |
902b4e01 | 3467 | else if (TREE_CODE (expr) == INDIRECT_REF) |
3468 | { | |
3469 | tree t = TREE_OPERAND (expr, 0); | |
3470 | tree best = t; | |
3471 | int bestalign = TYPE_ALIGN (TREE_TYPE (TREE_TYPE (t))); | |
1cae46be | 3472 | |
72dd6141 | 3473 | while (CONVERT_EXPR_P (t) |
7cc7e163 | 3474 | && TREE_CODE (TREE_TYPE (TREE_OPERAND (t, 0))) == POINTER_TYPE) |
902b4e01 | 3475 | { |
3476 | int thisalign; | |
3477 | ||
3478 | t = TREE_OPERAND (t, 0); | |
3479 | thisalign = TYPE_ALIGN (TREE_TYPE (TREE_TYPE (t))); | |
3480 | if (thisalign > bestalign) | |
3481 | best = t, bestalign = thisalign; | |
3482 | } | |
3483 | return c_alignof (TREE_TYPE (TREE_TYPE (best))); | |
3484 | } | |
3485 | else | |
3486 | return c_alignof (TREE_TYPE (expr)); | |
3487 | ||
143d62d7 | 3488 | return fold_convert (size_type_node, t); |
902b4e01 | 3489 | } |
3490 | \f | |
8fe4a266 | 3491 | /* Handle C and C++ default attributes. */ |
3492 | ||
3493 | enum built_in_attribute | |
3494 | { | |
3495 | #define DEF_ATTR_NULL_TREE(ENUM) ENUM, | |
3496 | #define DEF_ATTR_INT(ENUM, VALUE) ENUM, | |
3497 | #define DEF_ATTR_IDENT(ENUM, STRING) ENUM, | |
3498 | #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) ENUM, | |
8fe4a266 | 3499 | #include "builtin-attrs.def" |
3500 | #undef DEF_ATTR_NULL_TREE | |
3501 | #undef DEF_ATTR_INT | |
3502 | #undef DEF_ATTR_IDENT | |
3503 | #undef DEF_ATTR_TREE_LIST | |
8fe4a266 | 3504 | ATTR_LAST |
3505 | }; | |
3506 | ||
3507 | static GTY(()) tree built_in_attributes[(int) ATTR_LAST]; | |
3508 | ||
1cae46be | 3509 | static void c_init_attributes (void); |
8fe4a266 | 3510 | |
27213ba3 | 3511 | enum c_builtin_type |
72040e7e | 3512 | { |
d2d4bdde | 3513 | #define DEF_PRIMITIVE_TYPE(NAME, VALUE) NAME, |
3514 | #define DEF_FUNCTION_TYPE_0(NAME, RETURN) NAME, | |
3515 | #define DEF_FUNCTION_TYPE_1(NAME, RETURN, ARG1) NAME, | |
3516 | #define DEF_FUNCTION_TYPE_2(NAME, RETURN, ARG1, ARG2) NAME, | |
3517 | #define DEF_FUNCTION_TYPE_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME, | |
3518 | #define DEF_FUNCTION_TYPE_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME, | |
0a39fd54 | 3519 | #define DEF_FUNCTION_TYPE_5(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) NAME, |
27213ba3 | 3520 | #define DEF_FUNCTION_TYPE_6(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6) NAME, |
3521 | #define DEF_FUNCTION_TYPE_7(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, ARG7) NAME, | |
d2d4bdde | 3522 | #define DEF_FUNCTION_TYPE_VAR_0(NAME, RETURN) NAME, |
3523 | #define DEF_FUNCTION_TYPE_VAR_1(NAME, RETURN, ARG1) NAME, | |
3524 | #define DEF_FUNCTION_TYPE_VAR_2(NAME, RETURN, ARG1, ARG2) NAME, | |
03901330 | 3525 | #define DEF_FUNCTION_TYPE_VAR_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME, |
0a39fd54 | 3526 | #define DEF_FUNCTION_TYPE_VAR_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME, |
3527 | #define DEF_FUNCTION_TYPE_VAR_5(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG6) \ | |
3528 | NAME, | |
d2d4bdde | 3529 | #define DEF_POINTER_TYPE(NAME, TYPE) NAME, |
3530 | #include "builtin-types.def" | |
3531 | #undef DEF_PRIMITIVE_TYPE | |
3532 | #undef DEF_FUNCTION_TYPE_0 | |
3533 | #undef DEF_FUNCTION_TYPE_1 | |
3534 | #undef DEF_FUNCTION_TYPE_2 | |
3535 | #undef DEF_FUNCTION_TYPE_3 | |
3536 | #undef DEF_FUNCTION_TYPE_4 | |
0a39fd54 | 3537 | #undef DEF_FUNCTION_TYPE_5 |
3538 | #undef DEF_FUNCTION_TYPE_6 | |
27213ba3 | 3539 | #undef DEF_FUNCTION_TYPE_7 |
d2d4bdde | 3540 | #undef DEF_FUNCTION_TYPE_VAR_0 |
3541 | #undef DEF_FUNCTION_TYPE_VAR_1 | |
3542 | #undef DEF_FUNCTION_TYPE_VAR_2 | |
03901330 | 3543 | #undef DEF_FUNCTION_TYPE_VAR_3 |
0a39fd54 | 3544 | #undef DEF_FUNCTION_TYPE_VAR_4 |
3545 | #undef DEF_FUNCTION_TYPE_VAR_5 | |
d2d4bdde | 3546 | #undef DEF_POINTER_TYPE |
27213ba3 | 3547 | BT_LAST |
3548 | }; | |
3549 | ||
3550 | typedef enum c_builtin_type builtin_type; | |
d2d4bdde | 3551 | |
27213ba3 | 3552 | /* A temporary array for c_common_nodes_and_builtins. Used in |
3553 | communication with def_fn_type. */ | |
3554 | static tree builtin_types[(int) BT_LAST + 1]; | |
d2d4bdde | 3555 | |
27213ba3 | 3556 | /* A helper function for c_common_nodes_and_builtins. Build function type |
3557 | for DEF with return type RET and N arguments. If VAR is true, then the | |
3558 | function should be variadic after those N arguments. | |
3559 | ||
3560 | Takes special care not to ICE if any of the types involved are | |
3561 | error_mark_node, which indicates that said type is not in fact available | |
3562 | (see builtin_type_for_size). In which case the function type as a whole | |
3563 | should be error_mark_node. */ | |
3564 | ||
3565 | static void | |
3566 | def_fn_type (builtin_type def, builtin_type ret, bool var, int n, ...) | |
3567 | { | |
3568 | tree args = NULL, t; | |
3569 | va_list list; | |
3570 | int i; | |
3571 | ||
3572 | va_start (list, n); | |
3573 | for (i = 0; i < n; ++i) | |
3574 | { | |
7d339f93 | 3575 | builtin_type a = (builtin_type) va_arg (list, int); |
27213ba3 | 3576 | t = builtin_types[a]; |
3577 | if (t == error_mark_node) | |
3578 | goto egress; | |
3579 | args = tree_cons (NULL_TREE, t, args); | |
3580 | } | |
3581 | va_end (list); | |
3582 | ||
3583 | args = nreverse (args); | |
3584 | if (!var) | |
3585 | args = chainon (args, void_list_node); | |
3586 | ||
3587 | t = builtin_types[ret]; | |
3588 | if (t == error_mark_node) | |
3589 | goto egress; | |
3590 | t = build_function_type (t, args); | |
3591 | ||
3592 | egress: | |
3593 | builtin_types[def] = t; | |
3594 | } | |
3595 | ||
dce22712 | 3596 | /* Build builtin functions common to both C and C++ language |
3597 | frontends. */ | |
3598 | ||
3599 | static void | |
3600 | c_define_builtins (tree va_list_ref_type_node, tree va_list_arg_type_node) | |
3601 | { | |
3602 | #define DEF_PRIMITIVE_TYPE(ENUM, VALUE) \ | |
3603 | builtin_types[ENUM] = VALUE; | |
3604 | #define DEF_FUNCTION_TYPE_0(ENUM, RETURN) \ | |
3605 | def_fn_type (ENUM, RETURN, 0, 0); | |
3606 | #define DEF_FUNCTION_TYPE_1(ENUM, RETURN, ARG1) \ | |
3607 | def_fn_type (ENUM, RETURN, 0, 1, ARG1); | |
3608 | #define DEF_FUNCTION_TYPE_2(ENUM, RETURN, ARG1, ARG2) \ | |
3609 | def_fn_type (ENUM, RETURN, 0, 2, ARG1, ARG2); | |
3610 | #define DEF_FUNCTION_TYPE_3(ENUM, RETURN, ARG1, ARG2, ARG3) \ | |
3611 | def_fn_type (ENUM, RETURN, 0, 3, ARG1, ARG2, ARG3); | |
3612 | #define DEF_FUNCTION_TYPE_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \ | |
3613 | def_fn_type (ENUM, RETURN, 0, 4, ARG1, ARG2, ARG3, ARG4); | |
3614 | #define DEF_FUNCTION_TYPE_5(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \ | |
3615 | def_fn_type (ENUM, RETURN, 0, 5, ARG1, ARG2, ARG3, ARG4, ARG5); | |
3616 | #define DEF_FUNCTION_TYPE_6(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \ | |
3617 | ARG6) \ | |
3618 | def_fn_type (ENUM, RETURN, 0, 6, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6); | |
3619 | #define DEF_FUNCTION_TYPE_7(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \ | |
3620 | ARG6, ARG7) \ | |
3621 | def_fn_type (ENUM, RETURN, 0, 7, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, ARG7); | |
3622 | #define DEF_FUNCTION_TYPE_VAR_0(ENUM, RETURN) \ | |
3623 | def_fn_type (ENUM, RETURN, 1, 0); | |
3624 | #define DEF_FUNCTION_TYPE_VAR_1(ENUM, RETURN, ARG1) \ | |
3625 | def_fn_type (ENUM, RETURN, 1, 1, ARG1); | |
3626 | #define DEF_FUNCTION_TYPE_VAR_2(ENUM, RETURN, ARG1, ARG2) \ | |
3627 | def_fn_type (ENUM, RETURN, 1, 2, ARG1, ARG2); | |
3628 | #define DEF_FUNCTION_TYPE_VAR_3(ENUM, RETURN, ARG1, ARG2, ARG3) \ | |
3629 | def_fn_type (ENUM, RETURN, 1, 3, ARG1, ARG2, ARG3); | |
3630 | #define DEF_FUNCTION_TYPE_VAR_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \ | |
3631 | def_fn_type (ENUM, RETURN, 1, 4, ARG1, ARG2, ARG3, ARG4); | |
3632 | #define DEF_FUNCTION_TYPE_VAR_5(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \ | |
3633 | def_fn_type (ENUM, RETURN, 1, 5, ARG1, ARG2, ARG3, ARG4, ARG5); | |
3634 | #define DEF_POINTER_TYPE(ENUM, TYPE) \ | |
3635 | builtin_types[(int) ENUM] = build_pointer_type (builtin_types[(int) TYPE]); | |
3636 | ||
3637 | #include "builtin-types.def" | |
3638 | ||
3639 | #undef DEF_PRIMITIVE_TYPE | |
3640 | #undef DEF_FUNCTION_TYPE_1 | |
3641 | #undef DEF_FUNCTION_TYPE_2 | |
3642 | #undef DEF_FUNCTION_TYPE_3 | |
3643 | #undef DEF_FUNCTION_TYPE_4 | |
3644 | #undef DEF_FUNCTION_TYPE_5 | |
3645 | #undef DEF_FUNCTION_TYPE_6 | |
3646 | #undef DEF_FUNCTION_TYPE_VAR_0 | |
3647 | #undef DEF_FUNCTION_TYPE_VAR_1 | |
3648 | #undef DEF_FUNCTION_TYPE_VAR_2 | |
3649 | #undef DEF_FUNCTION_TYPE_VAR_3 | |
3650 | #undef DEF_FUNCTION_TYPE_VAR_4 | |
3651 | #undef DEF_FUNCTION_TYPE_VAR_5 | |
3652 | #undef DEF_POINTER_TYPE | |
3653 | builtin_types[(int) BT_LAST] = NULL_TREE; | |
3654 | ||
3655 | c_init_attributes (); | |
3656 | ||
3657 | #define DEF_BUILTIN(ENUM, NAME, CLASS, TYPE, LIBTYPE, BOTH_P, FALLBACK_P, \ | |
3658 | NONANSI_P, ATTRS, IMPLICIT, COND) \ | |
3659 | if (NAME && COND) \ | |
3660 | def_builtin_1 (ENUM, NAME, CLASS, \ | |
3661 | builtin_types[(int) TYPE], \ | |
3662 | builtin_types[(int) LIBTYPE], \ | |
3663 | BOTH_P, FALLBACK_P, NONANSI_P, \ | |
3664 | built_in_attributes[(int) ATTRS], IMPLICIT); | |
3665 | #include "builtins.def" | |
3666 | #undef DEF_BUILTIN | |
3667 | ||
87eb1c28 | 3668 | targetm.init_builtins (); |
3669 | ||
dce22712 | 3670 | build_common_builtin_nodes (); |
3671 | ||
dce22712 | 3672 | if (flag_mudflap) |
3673 | mudflap_init (); | |
3674 | } | |
3675 | ||
27213ba3 | 3676 | /* Build tree nodes and builtin functions common to both C and C++ language |
3677 | frontends. */ | |
3678 | ||
3679 | void | |
3680 | c_common_nodes_and_builtins (void) | |
3681 | { | |
924bbf02 | 3682 | int char16_type_size; |
3683 | int char32_type_size; | |
174fcc61 | 3684 | int wchar_type_size; |
3685 | tree array_domain_type; | |
2d47cc32 | 3686 | tree va_list_ref_type_node; |
8a15c04a | 3687 | tree va_list_arg_type_node; |
a66c9326 | 3688 | |
174fcc61 | 3689 | /* Define `int' and `char' first so that dbx will output them first. */ |
d946ea19 | 3690 | record_builtin_type (RID_INT, NULL, integer_type_node); |
174fcc61 | 3691 | record_builtin_type (RID_CHAR, "char", char_type_node); |
3692 | ||
3693 | /* `signed' is the same as `int'. FIXME: the declarations of "signed", | |
3694 | "unsigned long", "long long unsigned" and "unsigned short" were in C++ | |
3695 | but not C. Are the conditionals here needed? */ | |
c0f19401 | 3696 | if (c_dialect_cxx ()) |
d946ea19 | 3697 | record_builtin_type (RID_SIGNED, NULL, integer_type_node); |
174fcc61 | 3698 | record_builtin_type (RID_LONG, "long int", long_integer_type_node); |
3699 | record_builtin_type (RID_UNSIGNED, "unsigned int", unsigned_type_node); | |
3700 | record_builtin_type (RID_MAX, "long unsigned int", | |
3701 | long_unsigned_type_node); | |
c0f19401 | 3702 | if (c_dialect_cxx ()) |
174fcc61 | 3703 | record_builtin_type (RID_MAX, "unsigned long", long_unsigned_type_node); |
3704 | record_builtin_type (RID_MAX, "long long int", | |
3705 | long_long_integer_type_node); | |
3706 | record_builtin_type (RID_MAX, "long long unsigned int", | |
3707 | long_long_unsigned_type_node); | |
c0f19401 | 3708 | if (c_dialect_cxx ()) |
174fcc61 | 3709 | record_builtin_type (RID_MAX, "long long unsigned", |
3710 | long_long_unsigned_type_node); | |
3711 | record_builtin_type (RID_SHORT, "short int", short_integer_type_node); | |
3712 | record_builtin_type (RID_MAX, "short unsigned int", | |
3713 | short_unsigned_type_node); | |
c0f19401 | 3714 | if (c_dialect_cxx ()) |
174fcc61 | 3715 | record_builtin_type (RID_MAX, "unsigned short", |
3716 | short_unsigned_type_node); | |
3717 | ||
3718 | /* Define both `signed char' and `unsigned char'. */ | |
3719 | record_builtin_type (RID_MAX, "signed char", signed_char_type_node); | |
3720 | record_builtin_type (RID_MAX, "unsigned char", unsigned_char_type_node); | |
3721 | ||
771d21fa | 3722 | /* These are types that c_common_type_for_size and |
3723 | c_common_type_for_mode use. */ | |
dc24ddbd | 3724 | lang_hooks.decls.pushdecl (build_decl (TYPE_DECL, NULL_TREE, |
3725 | intQI_type_node)); | |
3726 | lang_hooks.decls.pushdecl (build_decl (TYPE_DECL, NULL_TREE, | |
3727 | intHI_type_node)); | |
3728 | lang_hooks.decls.pushdecl (build_decl (TYPE_DECL, NULL_TREE, | |
3729 | intSI_type_node)); | |
3730 | lang_hooks.decls.pushdecl (build_decl (TYPE_DECL, NULL_TREE, | |
3731 | intDI_type_node)); | |
174fcc61 | 3732 | #if HOST_BITS_PER_WIDE_INT >= 64 |
f1515a39 | 3733 | if (targetm.scalar_mode_supported_p (TImode)) |
3734 | lang_hooks.decls.pushdecl (build_decl (TYPE_DECL, | |
3735 | get_identifier ("__int128_t"), | |
3736 | intTI_type_node)); | |
174fcc61 | 3737 | #endif |
dc24ddbd | 3738 | lang_hooks.decls.pushdecl (build_decl (TYPE_DECL, NULL_TREE, |
3739 | unsigned_intQI_type_node)); | |
3740 | lang_hooks.decls.pushdecl (build_decl (TYPE_DECL, NULL_TREE, | |
3741 | unsigned_intHI_type_node)); | |
3742 | lang_hooks.decls.pushdecl (build_decl (TYPE_DECL, NULL_TREE, | |
3743 | unsigned_intSI_type_node)); | |
3744 | lang_hooks.decls.pushdecl (build_decl (TYPE_DECL, NULL_TREE, | |
3745 | unsigned_intDI_type_node)); | |
174fcc61 | 3746 | #if HOST_BITS_PER_WIDE_INT >= 64 |
f1515a39 | 3747 | if (targetm.scalar_mode_supported_p (TImode)) |
3748 | lang_hooks.decls.pushdecl (build_decl (TYPE_DECL, | |
3749 | get_identifier ("__uint128_t"), | |
3750 | unsigned_intTI_type_node)); | |
174fcc61 | 3751 | #endif |
3752 | ||
3753 | /* Create the widest literal types. */ | |
3754 | widest_integer_literal_type_node | |
3755 | = make_signed_type (HOST_BITS_PER_WIDE_INT * 2); | |
dc24ddbd | 3756 | lang_hooks.decls.pushdecl (build_decl (TYPE_DECL, NULL_TREE, |
3757 | widest_integer_literal_type_node)); | |
174fcc61 | 3758 | |
3759 | widest_unsigned_literal_type_node | |
3760 | = make_unsigned_type (HOST_BITS_PER_WIDE_INT * 2); | |
dc24ddbd | 3761 | lang_hooks.decls.pushdecl (build_decl (TYPE_DECL, NULL_TREE, |
3762 | widest_unsigned_literal_type_node)); | |
174fcc61 | 3763 | |
3764 | /* `unsigned long' is the standard type for sizeof. | |
3765 | Note that stddef.h uses `unsigned long', | |
3766 | and this must agree, even if long and int are the same size. */ | |
654ef926 | 3767 | size_type_node = |
174fcc61 | 3768 | TREE_TYPE (identifier_global_value (get_identifier (SIZE_TYPE))); |
654ef926 | 3769 | signed_size_type_node = c_common_signed_type (size_type_node); |
3770 | set_sizetype (size_type_node); | |
174fcc61 | 3771 | |
73673831 | 3772 | pid_type_node = |
3773 | TREE_TYPE (identifier_global_value (get_identifier (PID_TYPE))); | |
3774 | ||
174fcc61 | 3775 | build_common_tree_nodes_2 (flag_short_double); |
3776 | ||
d946ea19 | 3777 | record_builtin_type (RID_FLOAT, NULL, float_type_node); |
3778 | record_builtin_type (RID_DOUBLE, NULL, double_type_node); | |
174fcc61 | 3779 | record_builtin_type (RID_MAX, "long double", long_double_type_node); |
3780 | ||
c4503c0a | 3781 | /* Only supported decimal floating point extension if the target |
3782 | actually supports underlying modes. */ | |
3783 | if (targetm.scalar_mode_supported_p (SDmode) | |
3784 | && targetm.scalar_mode_supported_p (DDmode) | |
3785 | && targetm.scalar_mode_supported_p (TDmode)) | |
3786 | { | |
3787 | record_builtin_type (RID_DFLOAT32, NULL, dfloat32_type_node); | |
3788 | record_builtin_type (RID_DFLOAT64, NULL, dfloat64_type_node); | |
3789 | record_builtin_type (RID_DFLOAT128, NULL, dfloat128_type_node); | |
3790 | } | |
3791 | ||
9421ebb9 | 3792 | if (targetm.fixed_point_supported_p ()) |
3793 | { | |
3794 | record_builtin_type (RID_MAX, "short _Fract", short_fract_type_node); | |
3795 | record_builtin_type (RID_FRACT, NULL, fract_type_node); | |
3796 | record_builtin_type (RID_MAX, "long _Fract", long_fract_type_node); | |
3797 | record_builtin_type (RID_MAX, "long long _Fract", | |
3798 | long_long_fract_type_node); | |
3799 | record_builtin_type (RID_MAX, "unsigned short _Fract", | |
3800 | unsigned_short_fract_type_node); | |
3801 | record_builtin_type (RID_MAX, "unsigned _Fract", | |
3802 | unsigned_fract_type_node); | |
3803 | record_builtin_type (RID_MAX, "unsigned long _Fract", | |
3804 | unsigned_long_fract_type_node); | |
3805 | record_builtin_type (RID_MAX, "unsigned long long _Fract", | |
3806 | unsigned_long_long_fract_type_node); | |
3807 | record_builtin_type (RID_MAX, "_Sat short _Fract", | |
3808 | sat_short_fract_type_node); | |
3809 | record_builtin_type (RID_MAX, "_Sat _Fract", sat_fract_type_node); | |
3810 | record_builtin_type (RID_MAX, "_Sat long _Fract", | |
3811 | sat_long_fract_type_node); | |
3812 | record_builtin_type (RID_MAX, "_Sat long long _Fract", | |
3813 | sat_long_long_fract_type_node); | |
3814 | record_builtin_type (RID_MAX, "_Sat unsigned short _Fract", | |
3815 | sat_unsigned_short_fract_type_node); | |
3816 | record_builtin_type (RID_MAX, "_Sat unsigned _Fract", | |
3817 | sat_unsigned_fract_type_node); | |
3818 | record_builtin_type (RID_MAX, "_Sat unsigned long _Fract", | |
3819 | sat_unsigned_long_fract_type_node); | |
3820 | record_builtin_type (RID_MAX, "_Sat unsigned long long _Fract", | |
3821 | sat_unsigned_long_long_fract_type_node); | |
3822 | record_builtin_type (RID_MAX, "short _Accum", short_accum_type_node); | |
3823 | record_builtin_type (RID_ACCUM, NULL, accum_type_node); | |
3824 | record_builtin_type (RID_MAX, "long _Accum", long_accum_type_node); | |
3825 | record_builtin_type (RID_MAX, "long long _Accum", | |
3826 | long_long_accum_type_node); | |
3827 | record_builtin_type (RID_MAX, "unsigned short _Accum", | |
3828 | unsigned_short_accum_type_node); | |
3829 | record_builtin_type (RID_MAX, "unsigned _Accum", | |
3830 | unsigned_accum_type_node); | |
3831 | record_builtin_type (RID_MAX, "unsigned long _Accum", | |
3832 | unsigned_long_accum_type_node); | |
3833 | record_builtin_type (RID_MAX, "unsigned long long _Accum", | |
3834 | unsigned_long_long_accum_type_node); | |
3835 | record_builtin_type (RID_MAX, "_Sat short _Accum", | |
3836 | sat_short_accum_type_node); | |
3837 | record_builtin_type (RID_MAX, "_Sat _Accum", sat_accum_type_node); | |
3838 | record_builtin_type (RID_MAX, "_Sat long _Accum", | |
3839 | sat_long_accum_type_node); | |
3840 | record_builtin_type (RID_MAX, "_Sat long long _Accum", | |
3841 | sat_long_long_accum_type_node); | |
3842 | record_builtin_type (RID_MAX, "_Sat unsigned short _Accum", | |
3843 | sat_unsigned_short_accum_type_node); | |
3844 | record_builtin_type (RID_MAX, "_Sat unsigned _Accum", | |
3845 | sat_unsigned_accum_type_node); | |
3846 | record_builtin_type (RID_MAX, "_Sat unsigned long _Accum", | |
3847 | sat_unsigned_long_accum_type_node); | |
3848 | record_builtin_type (RID_MAX, "_Sat unsigned long long _Accum", | |
3849 | sat_unsigned_long_long_accum_type_node); | |
3850 | ||
3851 | } | |
3852 | ||
dc24ddbd | 3853 | lang_hooks.decls.pushdecl (build_decl (TYPE_DECL, |
3854 | get_identifier ("complex int"), | |
3855 | complex_integer_type_node)); | |
3856 | lang_hooks.decls.pushdecl (build_decl (TYPE_DECL, | |
3857 | get_identifier ("complex float"), | |
3858 | complex_float_type_node)); | |
3859 | lang_hooks.decls.pushdecl (build_decl (TYPE_DECL, | |
3860 | get_identifier ("complex double"), | |
3861 | complex_double_type_node)); | |
3862 | lang_hooks.decls.pushdecl | |
20325f61 | 3863 | (build_decl (TYPE_DECL, get_identifier ("complex long double"), |
3864 | complex_long_double_type_node)); | |
174fcc61 | 3865 | |
e256d445 | 3866 | if (c_dialect_cxx ()) |
3867 | /* For C++, make fileptr_type_node a distinct void * type until | |
3868 | FILE type is defined. */ | |
e086912e | 3869 | fileptr_type_node = build_variant_type_copy (ptr_type_node); |
e256d445 | 3870 | |
d946ea19 | 3871 | record_builtin_type (RID_VOID, NULL, void_type_node); |
174fcc61 | 3872 | |
6753bca0 | 3873 | /* Set the TYPE_NAME for any variants that were built before |
3874 | record_builtin_type gave names to the built-in types. */ | |
3875 | { | |
3876 | tree void_name = TYPE_NAME (void_type_node); | |
3877 | TYPE_NAME (void_type_node) = NULL_TREE; | |
3878 | TYPE_NAME (build_qualified_type (void_type_node, TYPE_QUAL_CONST)) | |
3879 | = void_name; | |
3880 | TYPE_NAME (void_type_node) = void_name; | |
3881 | } | |
3882 | ||
fbf0afd1 | 3883 | /* This node must not be shared. */ |
7c446c95 | 3884 | void_zero_node = make_node (INTEGER_CST); |
d2d4bdde | 3885 | TREE_TYPE (void_zero_node) = void_type_node; |
3886 | ||
174fcc61 | 3887 | void_list_node = build_void_list_node (); |
3888 | ||
3889 | /* Make a type to be the domain of a few array types | |
3890 | whose domains don't really matter. | |
3891 | 200 is small enough that it always fits in size_t | |
3892 | and large enough that it can hold most function names for the | |
3893 | initializations of __FUNCTION__ and __PRETTY_FUNCTION__. */ | |
3894 | array_domain_type = build_index_type (size_int (200)); | |
3895 | ||
3896 | /* Make a type for arrays of characters. | |
3897 | With luck nothing will ever really depend on the length of this | |
3898 | array type. */ | |
3899 | char_array_type_node | |
3900 | = build_array_type (char_type_node, array_domain_type); | |
3901 | ||
3902 | /* Likewise for arrays of ints. */ | |
3903 | int_array_type_node | |
3904 | = build_array_type (integer_type_node, array_domain_type); | |
3905 | ||
d2d4bdde | 3906 | string_type_node = build_pointer_type (char_type_node); |
3907 | const_string_type_node | |
3908 | = build_pointer_type (build_qualified_type | |
3909 | (char_type_node, TYPE_QUAL_CONST)); | |
3910 | ||
174fcc61 | 3911 | /* This is special for C++ so functions can be overloaded. */ |
18ef7ac2 | 3912 | wchar_type_node = get_identifier (MODIFIED_WCHAR_TYPE); |
174fcc61 | 3913 | wchar_type_node = TREE_TYPE (identifier_global_value (wchar_type_node)); |
3914 | wchar_type_size = TYPE_PRECISION (wchar_type_node); | |
c0f19401 | 3915 | if (c_dialect_cxx ()) |
174fcc61 | 3916 | { |
78a8ed03 | 3917 | if (TYPE_UNSIGNED (wchar_type_node)) |
174fcc61 | 3918 | wchar_type_node = make_unsigned_type (wchar_type_size); |
3919 | else | |
3920 | wchar_type_node = make_signed_type (wchar_type_size); | |
3921 | record_builtin_type (RID_WCHAR, "wchar_t", wchar_type_node); | |
3922 | } | |
3923 | else | |
3924 | { | |
4070745f | 3925 | signed_wchar_type_node = c_common_signed_type (wchar_type_node); |
11773141 | 3926 | unsigned_wchar_type_node = c_common_unsigned_type (wchar_type_node); |
174fcc61 | 3927 | } |
3928 | ||
3929 | /* This is for wide string constants. */ | |
3930 | wchar_array_type_node | |
3931 | = build_array_type (wchar_type_node, array_domain_type); | |
3932 | ||
924bbf02 | 3933 | /* Define 'char16_t'. */ |
3934 | char16_type_node = get_identifier (CHAR16_TYPE); | |
3935 | char16_type_node = TREE_TYPE (identifier_global_value (char16_type_node)); | |
3936 | char16_type_size = TYPE_PRECISION (char16_type_node); | |
3937 | if (c_dialect_cxx ()) | |
3938 | { | |
3939 | char16_type_node = make_unsigned_type (char16_type_size); | |
3940 | ||
3941 | if (cxx_dialect == cxx0x) | |
3942 | record_builtin_type (RID_CHAR16, "char16_t", char16_type_node); | |
3943 | } | |
3944 | ||
3945 | /* This is for UTF-16 string constants. */ | |
3946 | char16_array_type_node | |
3947 | = build_array_type (char16_type_node, array_domain_type); | |
3948 | ||
3949 | /* Define 'char32_t'. */ | |
3950 | char32_type_node = get_identifier (CHAR32_TYPE); | |
3951 | char32_type_node = TREE_TYPE (identifier_global_value (char32_type_node)); | |
3952 | char32_type_size = TYPE_PRECISION (char32_type_node); | |
3953 | if (c_dialect_cxx ()) | |
3954 | { | |
3955 | char32_type_node = make_unsigned_type (char32_type_size); | |
3956 | ||
3957 | if (cxx_dialect == cxx0x) | |
3958 | record_builtin_type (RID_CHAR32, "char32_t", char32_type_node); | |
3959 | } | |
3960 | ||
3961 | /* This is for UTF-32 string constants. */ | |
3962 | char32_array_type_node | |
3963 | = build_array_type (char32_type_node, array_domain_type); | |
3964 | ||
6bf5ed8d | 3965 | wint_type_node = |
3966 | TREE_TYPE (identifier_global_value (get_identifier (WINT_TYPE))); | |
3967 | ||
3968 | intmax_type_node = | |
3969 | TREE_TYPE (identifier_global_value (get_identifier (INTMAX_TYPE))); | |
3970 | uintmax_type_node = | |
3971 | TREE_TYPE (identifier_global_value (get_identifier (UINTMAX_TYPE))); | |
3972 | ||
3973 | default_function_type = build_function_type (integer_type_node, NULL_TREE); | |
3974 | ptrdiff_type_node | |
3975 | = TREE_TYPE (identifier_global_value (get_identifier (PTRDIFF_TYPE))); | |
11773141 | 3976 | unsigned_ptrdiff_type_node = c_common_unsigned_type (ptrdiff_type_node); |
6bf5ed8d | 3977 | |
dc24ddbd | 3978 | lang_hooks.decls.pushdecl |
20325f61 | 3979 | (build_decl (TYPE_DECL, get_identifier ("__builtin_va_list"), |
3980 | va_list_type_node)); | |
8a15c04a | 3981 | |
8a15c04a | 3982 | if (TREE_CODE (va_list_type_node) == ARRAY_TYPE) |
2d47cc32 | 3983 | { |
3984 | va_list_arg_type_node = va_list_ref_type_node = | |
3985 | build_pointer_type (TREE_TYPE (va_list_type_node)); | |
3986 | } | |
8a15c04a | 3987 | else |
2d47cc32 | 3988 | { |
3989 | va_list_arg_type_node = va_list_type_node; | |
3990 | va_list_ref_type_node = build_reference_type (va_list_type_node); | |
3991 | } | |
1cae46be | 3992 | |
dce22712 | 3993 | if (!flag_preprocess_only) |
3994 | c_define_builtins (va_list_ref_type_node, va_list_arg_type_node); | |
ffa8918b | 3995 | |
5c62f199 | 3996 | main_identifier_node = get_identifier ("main"); |
ae84079f | 3997 | |
3998 | /* Create the built-in __null node. It is important that this is | |
3999 | not shared. */ | |
4000 | null_node = make_node (INTEGER_CST); | |
4001 | TREE_TYPE (null_node) = c_common_type_for_size (POINTER_SIZE, 0); | |
27213ba3 | 4002 | |
4003 | /* Since builtin_types isn't gc'ed, don't export these nodes. */ | |
4004 | memset (builtin_types, 0, sizeof (builtin_types)); | |
72040e7e | 4005 | } |
a66c9326 | 4006 | |
46a7e216 | 4007 | /* Look up the function in built_in_decls that corresponds to DECL |
4008 | and set ASMSPEC as its user assembler name. DECL must be a | |
f7f07c95 | 4009 | function decl that declares a builtin. */ |
46a7e216 | 4010 | |
4011 | void | |
4012 | set_builtin_user_assembler_name (tree decl, const char *asmspec) | |
4013 | { | |
4014 | tree builtin; | |
4015 | gcc_assert (TREE_CODE (decl) == FUNCTION_DECL | |
4016 | && DECL_BUILT_IN_CLASS (decl) == BUILT_IN_NORMAL | |
4017 | && asmspec != 0); | |
4018 | ||
4019 | builtin = built_in_decls [DECL_FUNCTION_CODE (decl)]; | |
4020 | set_user_assembler_name (builtin, asmspec); | |
4021 | if (DECL_FUNCTION_CODE (decl) == BUILT_IN_MEMCPY) | |
4022 | init_block_move_fn (asmspec); | |
4023 | else if (DECL_FUNCTION_CODE (decl) == BUILT_IN_MEMSET) | |
4024 | init_block_clear_fn (asmspec); | |
4025 | } | |
4026 | ||
79b01846 | 4027 | /* The number of named compound-literals generated thus far. */ |
4028 | static GTY(()) int compound_literal_number; | |
4029 | ||
4030 | /* Set DECL_NAME for DECL, a VAR_DECL for a compound-literal. */ | |
4031 | ||
4032 | void | |
4033 | set_compound_literal_name (tree decl) | |
4034 | { | |
4035 | char *name; | |
4036 | ASM_FORMAT_PRIVATE_NAME (name, "__compound_literal", | |
4037 | compound_literal_number); | |
4038 | compound_literal_number++; | |
4039 | DECL_NAME (decl) = get_identifier (name); | |
4040 | } | |
4041 | ||
a66c9326 | 4042 | tree |
1cae46be | 4043 | build_va_arg (tree expr, tree type) |
a66c9326 | 4044 | { |
4045 | return build1 (VA_ARG_EXPR, type, expr); | |
4046 | } | |
0d4238dc | 4047 | |
4048 | ||
dd878098 | 4049 | /* Linked list of disabled built-in functions. */ |
4050 | ||
4051 | typedef struct disabled_builtin | |
4052 | { | |
4053 | const char *name; | |
4054 | struct disabled_builtin *next; | |
4055 | } disabled_builtin; | |
4056 | static disabled_builtin *disabled_builtins = NULL; | |
4057 | ||
1cae46be | 4058 | static bool builtin_function_disabled_p (const char *); |
dd878098 | 4059 | |
4060 | /* Disable a built-in function specified by -fno-builtin-NAME. If NAME | |
4061 | begins with "__builtin_", give an error. */ | |
4062 | ||
4063 | void | |
1cae46be | 4064 | disable_builtin_function (const char *name) |
dd878098 | 4065 | { |
4066 | if (strncmp (name, "__builtin_", strlen ("__builtin_")) == 0) | |
b0b1af64 | 4067 | error ("cannot disable built-in function %qs", name); |
dd878098 | 4068 | else |
4069 | { | |
e85905e5 | 4070 | disabled_builtin *new_disabled_builtin = XNEW (disabled_builtin); |
4071 | new_disabled_builtin->name = name; | |
4072 | new_disabled_builtin->next = disabled_builtins; | |
4073 | disabled_builtins = new_disabled_builtin; | |
dd878098 | 4074 | } |
4075 | } | |
4076 | ||
4077 | ||
4078 | /* Return true if the built-in function NAME has been disabled, false | |
4079 | otherwise. */ | |
4080 | ||
4081 | static bool | |
1cae46be | 4082 | builtin_function_disabled_p (const char *name) |
dd878098 | 4083 | { |
4084 | disabled_builtin *p; | |
4085 | for (p = disabled_builtins; p != NULL; p = p->next) | |
4086 | { | |
4087 | if (strcmp (name, p->name) == 0) | |
4088 | return true; | |
4089 | } | |
4090 | return false; | |
4091 | } | |
4092 | ||
4093 | ||
3237155d | 4094 | /* Worker for DEF_BUILTIN. |
4095 | Possibly define a builtin function with one or two names. | |
4096 | Does not declare a non-__builtin_ function if flag_no_builtin, or if | |
4097 | nonansi_p and flag_no_nonansi_builtin. */ | |
0d4238dc | 4098 | |
3237155d | 4099 | static void |
4100 | def_builtin_1 (enum built_in_function fncode, | |
4101 | const char *name, | |
4102 | enum built_in_class fnclass, | |
4103 | tree fntype, tree libtype, | |
4104 | bool both_p, bool fallback_p, bool nonansi_p, | |
4105 | tree fnattrs, bool implicit_p) | |
0d4238dc | 4106 | { |
3237155d | 4107 | tree decl; |
4108 | const char *libname; | |
4109 | ||
27213ba3 | 4110 | if (fntype == error_mark_node) |
4111 | return; | |
4112 | ||
3237155d | 4113 | gcc_assert ((!both_p && !fallback_p) |
4114 | || !strncmp (name, "__builtin_", | |
4115 | strlen ("__builtin_"))); | |
4116 | ||
4117 | libname = name + strlen ("__builtin_"); | |
54be5d7e | 4118 | decl = add_builtin_function (name, fntype, fncode, fnclass, |
4119 | (fallback_p ? libname : NULL), | |
4120 | fnattrs); | |
3237155d | 4121 | if (both_p |
4122 | && !flag_no_builtin && !builtin_function_disabled_p (libname) | |
dd878098 | 4123 | && !(nonansi_p && flag_no_nonansi_builtin)) |
54be5d7e | 4124 | add_builtin_function (libname, libtype, fncode, fnclass, |
4125 | NULL, fnattrs); | |
a40609e6 | 4126 | |
3237155d | 4127 | built_in_decls[(int) fncode] = decl; |
4128 | if (implicit_p) | |
4129 | implicit_built_in_decls[(int) fncode] = decl; | |
0d4238dc | 4130 | } |
e94026da | 4131 | \f |
d7aeef06 | 4132 | /* Nonzero if the type T promotes to int. This is (nearly) the |
4133 | integral promotions defined in ISO C99 6.3.1.1/2. */ | |
4134 | ||
4135 | bool | |
9f627b1a | 4136 | c_promoting_integer_type_p (const_tree t) |
d7aeef06 | 4137 | { |
4138 | switch (TREE_CODE (t)) | |
4139 | { | |
4140 | case INTEGER_TYPE: | |
4141 | return (TYPE_MAIN_VARIANT (t) == char_type_node | |
4142 | || TYPE_MAIN_VARIANT (t) == signed_char_type_node | |
4143 | || TYPE_MAIN_VARIANT (t) == unsigned_char_type_node | |
4144 | || TYPE_MAIN_VARIANT (t) == short_integer_type_node | |
7aa1e6eb | 4145 | || TYPE_MAIN_VARIANT (t) == short_unsigned_type_node |
4146 | || TYPE_PRECISION (t) < TYPE_PRECISION (integer_type_node)); | |
d7aeef06 | 4147 | |
4148 | case ENUMERAL_TYPE: | |
4149 | /* ??? Technically all enumerations not larger than an int | |
4150 | promote to an int. But this is used along code paths | |
4151 | that only want to notice a size change. */ | |
4152 | return TYPE_PRECISION (t) < TYPE_PRECISION (integer_type_node); | |
4153 | ||
4154 | case BOOLEAN_TYPE: | |
4155 | return 1; | |
4156 | ||
4157 | default: | |
4158 | return 0; | |
4159 | } | |
4160 | } | |
4161 | ||
e94026da | 4162 | /* Return 1 if PARMS specifies a fixed number of parameters |
4163 | and none of their types is affected by default promotions. */ | |
4164 | ||
4165 | int | |
9f627b1a | 4166 | self_promoting_args_p (const_tree parms) |
e94026da | 4167 | { |
9f627b1a | 4168 | const_tree t; |
e94026da | 4169 | for (t = parms; t; t = TREE_CHAIN (t)) |
4170 | { | |
19cb6b50 | 4171 | tree type = TREE_VALUE (t); |
43f74bc4 | 4172 | |
e1d8e198 | 4173 | if (type == error_mark_node) |
4174 | continue; | |
4175 | ||
e94026da | 4176 | if (TREE_CHAIN (t) == 0 && type != void_type_node) |
4177 | return 0; | |
4178 | ||
4179 | if (type == 0) | |
4180 | return 0; | |
4181 | ||
4182 | if (TYPE_MAIN_VARIANT (type) == float_type_node) | |
4183 | return 0; | |
4184 | ||
d7aeef06 | 4185 | if (c_promoting_integer_type_p (type)) |
e94026da | 4186 | return 0; |
4187 | } | |
4188 | return 1; | |
4189 | } | |
605fb01e | 4190 | |
c10de5e7 | 4191 | /* Recursively remove any '*' or '&' operator from TYPE. */ |
4192 | tree | |
4193 | strip_pointer_operator (tree t) | |
4194 | { | |
4195 | while (POINTER_TYPE_P (t)) | |
4196 | t = TREE_TYPE (t); | |
4197 | return t; | |
4198 | } | |
4199 | ||
57a0ed23 | 4200 | /* Recursively remove pointer or array type from TYPE. */ |
4201 | tree | |
4202 | strip_pointer_or_array_types (tree t) | |
4203 | { | |
4204 | while (TREE_CODE (t) == ARRAY_TYPE || POINTER_TYPE_P (t)) | |
4205 | t = TREE_TYPE (t); | |
4206 | return t; | |
4207 | } | |
4208 | ||
e41f0d80 | 4209 | /* Used to compare case labels. K1 and K2 are actually tree nodes |
4210 | representing case labels, or NULL_TREE for a `default' label. | |
4211 | Returns -1 if K1 is ordered before K2, -1 if K1 is ordered after | |
4212 | K2, and 0 if K1 and K2 are equal. */ | |
4213 | ||
4214 | int | |
1cae46be | 4215 | case_compare (splay_tree_key k1, splay_tree_key k2) |
e41f0d80 | 4216 | { |
4217 | /* Consider a NULL key (such as arises with a `default' label) to be | |
4218 | smaller than anything else. */ | |
4219 | if (!k1) | |
4220 | return k2 ? -1 : 0; | |
4221 | else if (!k2) | |
4222 | return k1 ? 1 : 0; | |
4223 | ||
4224 | return tree_int_cst_compare ((tree) k1, (tree) k2); | |
4225 | } | |
4226 | ||
4227 | /* Process a case label for the range LOW_VALUE ... HIGH_VALUE. If | |
4228 | LOW_VALUE and HIGH_VALUE are both NULL_TREE then this case label is | |
4229 | actually a `default' label. If only HIGH_VALUE is NULL_TREE, then | |
4230 | case label was declared using the usual C/C++ syntax, rather than | |
4231 | the GNU case range extension. CASES is a tree containing all the | |
4232 | case ranges processed so far; COND is the condition for the | |
eaae3b75 | 4233 | switch-statement itself. Returns the CASE_LABEL_EXPR created, or |
4234 | ERROR_MARK_NODE if no CASE_LABEL_EXPR is created. */ | |
e41f0d80 | 4235 | |
4236 | tree | |
2ca392fd | 4237 | c_add_case_label (splay_tree cases, tree cond, tree orig_type, |
4238 | tree low_value, tree high_value) | |
e41f0d80 | 4239 | { |
4240 | tree type; | |
4241 | tree label; | |
4242 | tree case_label; | |
4243 | splay_tree_node node; | |
4244 | ||
4245 | /* Create the LABEL_DECL itself. */ | |
4ee9c684 | 4246 | label = create_artificial_label (); |
e41f0d80 | 4247 | |
4248 | /* If there was an error processing the switch condition, bail now | |
4249 | before we get more confused. */ | |
4250 | if (!cond || cond == error_mark_node) | |
4ee9c684 | 4251 | goto error_out; |
e41f0d80 | 4252 | |
1cae46be | 4253 | if ((low_value && TREE_TYPE (low_value) |
4254 | && POINTER_TYPE_P (TREE_TYPE (low_value))) | |
e41f0d80 | 4255 | || (high_value && TREE_TYPE (high_value) |
4256 | && POINTER_TYPE_P (TREE_TYPE (high_value)))) | |
b96dc121 | 4257 | { |
4258 | error ("pointers are not permitted as case values"); | |
4259 | goto error_out; | |
4260 | } | |
e41f0d80 | 4261 | |
4262 | /* Case ranges are a GNU extension. */ | |
4263 | if (high_value && pedantic) | |
c0f19401 | 4264 | pedwarn ("range expressions in switch statements are non-standard"); |
e41f0d80 | 4265 | |
4266 | type = TREE_TYPE (cond); | |
4267 | if (low_value) | |
4268 | { | |
4269 | low_value = check_case_value (low_value); | |
4270 | low_value = convert_and_check (type, low_value); | |
96722196 | 4271 | if (low_value == error_mark_node) |
4272 | goto error_out; | |
e41f0d80 | 4273 | } |
4274 | if (high_value) | |
4275 | { | |
4276 | high_value = check_case_value (high_value); | |
4277 | high_value = convert_and_check (type, high_value); | |
96722196 | 4278 | if (high_value == error_mark_node) |
4279 | goto error_out; | |
e41f0d80 | 4280 | } |
4281 | ||
96722196 | 4282 | if (low_value && high_value) |
4283 | { | |
4284 | /* If the LOW_VALUE and HIGH_VALUE are the same, then this isn't | |
a0c938f0 | 4285 | really a case range, even though it was written that way. |
4286 | Remove the HIGH_VALUE to simplify later processing. */ | |
96722196 | 4287 | if (tree_int_cst_equal (low_value, high_value)) |
4288 | high_value = NULL_TREE; | |
4289 | else if (!tree_int_cst_lt (low_value, high_value)) | |
4290 | warning (0, "empty range specified"); | |
4291 | } | |
e41f0d80 | 4292 | |
2ca392fd | 4293 | /* See if the case is in range of the type of the original testing |
4294 | expression. If both low_value and high_value are out of range, | |
4295 | don't insert the case label and return NULL_TREE. */ | |
4296 | if (low_value | |
84166705 | 4297 | && !check_case_bounds (type, orig_type, |
4298 | &low_value, high_value ? &high_value : NULL)) | |
2ca392fd | 4299 | return NULL_TREE; |
4300 | ||
e41f0d80 | 4301 | /* Look up the LOW_VALUE in the table of case labels we already |
4302 | have. */ | |
4303 | node = splay_tree_lookup (cases, (splay_tree_key) low_value); | |
4304 | /* If there was not an exact match, check for overlapping ranges. | |
4305 | There's no need to do this if there's no LOW_VALUE or HIGH_VALUE; | |
4306 | that's a `default' label and the only overlap is an exact match. */ | |
4307 | if (!node && (low_value || high_value)) | |
4308 | { | |
4309 | splay_tree_node low_bound; | |
4310 | splay_tree_node high_bound; | |
4311 | ||
4312 | /* Even though there wasn't an exact match, there might be an | |
4313 | overlap between this case range and another case range. | |
4314 | Since we've (inductively) not allowed any overlapping case | |
4315 | ranges, we simply need to find the greatest low case label | |
4316 | that is smaller that LOW_VALUE, and the smallest low case | |
4317 | label that is greater than LOW_VALUE. If there is an overlap | |
4318 | it will occur in one of these two ranges. */ | |
4319 | low_bound = splay_tree_predecessor (cases, | |
4320 | (splay_tree_key) low_value); | |
4321 | high_bound = splay_tree_successor (cases, | |
4322 | (splay_tree_key) low_value); | |
4323 | ||
4324 | /* Check to see if the LOW_BOUND overlaps. It is smaller than | |
4325 | the LOW_VALUE, so there is no need to check unless the | |
4326 | LOW_BOUND is in fact itself a case range. */ | |
4327 | if (low_bound | |
4328 | && CASE_HIGH ((tree) low_bound->value) | |
4329 | && tree_int_cst_compare (CASE_HIGH ((tree) low_bound->value), | |
4330 | low_value) >= 0) | |
4331 | node = low_bound; | |
4332 | /* Check to see if the HIGH_BOUND overlaps. The low end of that | |
4333 | range is bigger than the low end of the current range, so we | |
4334 | are only interested if the current range is a real range, and | |
4335 | not an ordinary case label. */ | |
1cae46be | 4336 | else if (high_bound |
e41f0d80 | 4337 | && high_value |
4338 | && (tree_int_cst_compare ((tree) high_bound->key, | |
4339 | high_value) | |
4340 | <= 0)) | |
4341 | node = high_bound; | |
4342 | } | |
4343 | /* If there was an overlap, issue an error. */ | |
4344 | if (node) | |
4345 | { | |
eaae3b75 | 4346 | tree duplicate = CASE_LABEL ((tree) node->value); |
e41f0d80 | 4347 | |
4348 | if (high_value) | |
4349 | { | |
4350 | error ("duplicate (or overlapping) case value"); | |
9bc3739f | 4351 | error ("%Jthis is the first entry overlapping that value", duplicate); |
e41f0d80 | 4352 | } |
4353 | else if (low_value) | |
4354 | { | |
4355 | error ("duplicate case value") ; | |
9bc3739f | 4356 | error ("%Jpreviously used here", duplicate); |
e41f0d80 | 4357 | } |
4358 | else | |
4359 | { | |
4360 | error ("multiple default labels in one switch"); | |
9bc3739f | 4361 | error ("%Jthis is the first default label", duplicate); |
e41f0d80 | 4362 | } |
4ee9c684 | 4363 | goto error_out; |
e41f0d80 | 4364 | } |
4365 | ||
4366 | /* Add a CASE_LABEL to the statement-tree. */ | |
4367 | case_label = add_stmt (build_case_label (low_value, high_value, label)); | |
4368 | /* Register this case label in the splay tree. */ | |
1cae46be | 4369 | splay_tree_insert (cases, |
e41f0d80 | 4370 | (splay_tree_key) low_value, |
4371 | (splay_tree_value) case_label); | |
4372 | ||
4373 | return case_label; | |
4ee9c684 | 4374 | |
4375 | error_out: | |
daf6dff5 | 4376 | /* Add a label so that the back-end doesn't think that the beginning of |
4ee9c684 | 4377 | the switch is unreachable. Note that we do not add a case label, as |
a53ff4c1 | 4378 | that just leads to duplicates and thence to failure later on. */ |
4ee9c684 | 4379 | if (!cases->root) |
4380 | { | |
4381 | tree t = create_artificial_label (); | |
daf6dff5 | 4382 | add_stmt (build_stmt (LABEL_EXPR, t)); |
4ee9c684 | 4383 | } |
4384 | return error_mark_node; | |
4385 | } | |
4386 | ||
4387 | /* Subroutines of c_do_switch_warnings, called via splay_tree_foreach. | |
4388 | Used to verify that case values match up with enumerator values. */ | |
4389 | ||
4390 | static void | |
4391 | match_case_to_enum_1 (tree key, tree type, tree label) | |
4392 | { | |
4393 | char buf[2 + 2*HOST_BITS_PER_WIDE_INT/4 + 1]; | |
4394 | ||
4395 | /* ??? Not working too hard to print the double-word value. | |
4396 | Should perhaps be done with %lwd in the diagnostic routines? */ | |
4397 | if (TREE_INT_CST_HIGH (key) == 0) | |
4398 | snprintf (buf, sizeof (buf), HOST_WIDE_INT_PRINT_UNSIGNED, | |
4399 | TREE_INT_CST_LOW (key)); | |
4400 | else if (!TYPE_UNSIGNED (type) | |
4401 | && TREE_INT_CST_HIGH (key) == -1 | |
4402 | && TREE_INT_CST_LOW (key) != 0) | |
4403 | snprintf (buf, sizeof (buf), "-" HOST_WIDE_INT_PRINT_UNSIGNED, | |
4404 | -TREE_INT_CST_LOW (key)); | |
4405 | else | |
4406 | snprintf (buf, sizeof (buf), HOST_WIDE_INT_PRINT_DOUBLE_HEX, | |
7df7561b | 4407 | (unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (key), |
4408 | (unsigned HOST_WIDE_INT) TREE_INT_CST_LOW (key)); | |
4ee9c684 | 4409 | |
4410 | if (TYPE_NAME (type) == 0) | |
6cbbbc89 | 4411 | warning (warn_switch ? OPT_Wswitch : OPT_Wswitch_enum, |
4412 | "%Jcase value %qs not in enumerated type", | |
eaae3b75 | 4413 | CASE_LABEL (label), buf); |
4ee9c684 | 4414 | else |
6cbbbc89 | 4415 | warning (warn_switch ? OPT_Wswitch : OPT_Wswitch_enum, |
4416 | "%Jcase value %qs not in enumerated type %qT", | |
eaae3b75 | 4417 | CASE_LABEL (label), buf, type); |
4ee9c684 | 4418 | } |
4419 | ||
359d87c6 | 4420 | /* Subroutine of c_do_switch_warnings, called via splay_tree_foreach. |
4421 | Used to verify that case values match up with enumerator values. */ | |
4422 | ||
4ee9c684 | 4423 | static int |
4424 | match_case_to_enum (splay_tree_node node, void *data) | |
4425 | { | |
4426 | tree label = (tree) node->value; | |
4fd61bc6 | 4427 | tree type = (tree) data; |
4ee9c684 | 4428 | |
4429 | /* Skip default case. */ | |
4430 | if (!CASE_LOW (label)) | |
4431 | return 0; | |
4432 | ||
359d87c6 | 4433 | /* If CASE_LOW_SEEN is not set, that means CASE_LOW did not appear |
4ee9c684 | 4434 | when we did our enum->case scan. Reset our scratch bit after. */ |
359d87c6 | 4435 | if (!CASE_LOW_SEEN (label)) |
4ee9c684 | 4436 | match_case_to_enum_1 (CASE_LOW (label), type, label); |
4437 | else | |
359d87c6 | 4438 | CASE_LOW_SEEN (label) = 0; |
4ee9c684 | 4439 | |
359d87c6 | 4440 | /* If CASE_HIGH is non-null, we have a range. If CASE_HIGH_SEEN is |
4441 | not set, that means that CASE_HIGH did not appear when we did our | |
4442 | enum->case scan. Reset our scratch bit after. */ | |
4ee9c684 | 4443 | if (CASE_HIGH (label)) |
4444 | { | |
359d87c6 | 4445 | if (!CASE_HIGH_SEEN (label)) |
4446 | match_case_to_enum_1 (CASE_HIGH (label), type, label); | |
4447 | else | |
4448 | CASE_HIGH_SEEN (label) = 0; | |
4ee9c684 | 4449 | } |
4450 | ||
4451 | return 0; | |
4452 | } | |
4453 | ||
e7911019 | 4454 | /* Handle -Wswitch*. Called from the front end after parsing the |
4455 | switch construct. */ | |
4456 | /* ??? Should probably be somewhere generic, since other languages | |
4457 | besides C and C++ would want this. At the moment, however, C/C++ | |
4458 | are the only tree-ssa languages that support enumerations at all, | |
4459 | so the point is moot. */ | |
4ee9c684 | 4460 | |
e7911019 | 4461 | void |
4462 | c_do_switch_warnings (splay_tree cases, location_t switch_location, | |
4463 | tree type, tree cond) | |
4ee9c684 | 4464 | { |
b27ac6b5 | 4465 | splay_tree_node default_node; |
359d87c6 | 4466 | splay_tree_node node; |
4467 | tree chain; | |
6cbbbc89 | 4468 | int saved_warn_switch; |
4ee9c684 | 4469 | |
4470 | if (!warn_switch && !warn_switch_enum && !warn_switch_default) | |
4471 | return; | |
4472 | ||
4ee9c684 | 4473 | default_node = splay_tree_lookup (cases, (splay_tree_key) NULL); |
8b6866af | 4474 | if (!default_node) |
4475 | warning (OPT_Wswitch_default, "%Hswitch missing default case", | |
4476 | &switch_location); | |
4ee9c684 | 4477 | |
359d87c6 | 4478 | /* From here on, we only care about about enumerated types. */ |
4479 | if (!type || TREE_CODE (type) != ENUMERAL_TYPE) | |
4480 | return; | |
4481 | ||
4ee9c684 | 4482 | /* If the switch expression was an enumerated type, check that |
4483 | exactly all enumeration literals are covered by the cases. | |
4484 | The check is made when -Wswitch was specified and there is no | |
4485 | default case, or when -Wswitch-enum was specified. */ | |
4ee9c684 | 4486 | |
359d87c6 | 4487 | if (!warn_switch_enum |
4488 | && !(warn_switch && !default_node)) | |
4489 | return; | |
4490 | ||
4491 | /* Clearing COND if it is not an integer constant simplifies | |
4492 | the tests inside the loop below. */ | |
4493 | if (TREE_CODE (cond) != INTEGER_CST) | |
4494 | cond = NULL_TREE; | |
4495 | ||
4496 | /* The time complexity here is O(N*lg(N)) worst case, but for the | |
4497 | common case of monotonically increasing enumerators, it is | |
4498 | O(N), since the nature of the splay tree will keep the next | |
4499 | element adjacent to the root at all times. */ | |
4ee9c684 | 4500 | |
359d87c6 | 4501 | for (chain = TYPE_VALUES (type); chain; chain = TREE_CHAIN (chain)) |
4502 | { | |
4503 | tree value = TREE_VALUE (chain); | |
4504 | node = splay_tree_lookup (cases, (splay_tree_key) value); | |
4505 | if (node) | |
4ee9c684 | 4506 | { |
359d87c6 | 4507 | /* Mark the CASE_LOW part of the case entry as seen. */ |
4508 | tree label = (tree) node->value; | |
4509 | CASE_LOW_SEEN (label) = 1; | |
4510 | continue; | |
4511 | } | |
4512 | ||
4513 | /* Even though there wasn't an exact match, there might be a | |
f0b5f617 | 4514 | case range which includes the enumerator's value. */ |
359d87c6 | 4515 | node = splay_tree_predecessor (cases, (splay_tree_key) value); |
4516 | if (node && CASE_HIGH ((tree) node->value)) | |
4517 | { | |
4518 | tree label = (tree) node->value; | |
4519 | int cmp = tree_int_cst_compare (CASE_HIGH (label), value); | |
4520 | if (cmp >= 0) | |
4ee9c684 | 4521 | { |
359d87c6 | 4522 | /* If we match the upper bound exactly, mark the CASE_HIGH |
4523 | part of the case entry as seen. */ | |
4524 | if (cmp == 0) | |
4525 | CASE_HIGH_SEEN (label) = 1; | |
4526 | continue; | |
4ee9c684 | 4527 | } |
4528 | } | |
4529 | ||
359d87c6 | 4530 | /* We've now determined that this enumerated literal isn't |
4531 | handled by the case labels of the switch statement. */ | |
4ee9c684 | 4532 | |
359d87c6 | 4533 | /* If the switch expression is a constant, we only really care |
4534 | about whether that constant is handled by the switch. */ | |
4535 | if (cond && tree_int_cst_compare (cond, value)) | |
4536 | continue; | |
4ee9c684 | 4537 | |
6cbbbc89 | 4538 | /* If there is a default_node, the only relevant option is |
4539 | Wswitch-enum. Otherwise, if both are enabled then we prefer | |
4540 | to warn using -Wswitch because -Wswitch is enabled by -Wall | |
4541 | while -Wswitch-enum is explicit. */ | |
4542 | warning ((default_node || !warn_switch) | |
4543 | ? OPT_Wswitch_enum : OPT_Wswitch, | |
4544 | "%Henumeration value %qE not handled in switch", | |
359d87c6 | 4545 | &switch_location, TREE_PURPOSE (chain)); |
4ee9c684 | 4546 | } |
359d87c6 | 4547 | |
4548 | /* Warn if there are case expressions that don't correspond to | |
4549 | enumerators. This can occur since C and C++ don't enforce | |
4550 | type-checking of assignments to enumeration variables. | |
4551 | ||
4552 | The time complexity here is now always O(N) worst case, since | |
4553 | we should have marked both the lower bound and upper bound of | |
4554 | every disjoint case label, with CASE_LOW_SEEN and CASE_HIGH_SEEN | |
4555 | above. This scan also resets those fields. */ | |
6cbbbc89 | 4556 | |
4557 | /* If there is a default_node, the only relevant option is | |
4558 | Wswitch-enum. Otherwise, if both are enabled then we prefer | |
4559 | to warn using -Wswitch because -Wswitch is enabled by -Wall | |
4560 | while -Wswitch-enum is explicit. */ | |
4561 | saved_warn_switch = warn_switch; | |
4562 | if (default_node) | |
4563 | warn_switch = 0; | |
359d87c6 | 4564 | splay_tree_foreach (cases, match_case_to_enum, type); |
6cbbbc89 | 4565 | warn_switch = saved_warn_switch; |
4566 | ||
e41f0d80 | 4567 | } |
4568 | ||
9dd48740 | 4569 | /* Finish an expression taking the address of LABEL (an |
4570 | IDENTIFIER_NODE). Returns an expression for the address. */ | |
d0a47c8d | 4571 | |
1cae46be | 4572 | tree |
4573 | finish_label_address_expr (tree label) | |
d0a47c8d | 4574 | { |
4575 | tree result; | |
4576 | ||
4577 | if (pedantic) | |
c0f19401 | 4578 | pedwarn ("taking the address of a label is non-standard"); |
d0a47c8d | 4579 | |
9dd48740 | 4580 | if (label == error_mark_node) |
4581 | return error_mark_node; | |
4582 | ||
d0a47c8d | 4583 | label = lookup_label (label); |
4584 | if (label == NULL_TREE) | |
4585 | result = null_pointer_node; | |
4586 | else | |
4587 | { | |
4588 | TREE_USED (label) = 1; | |
4589 | result = build1 (ADDR_EXPR, ptr_type_node, label); | |
d0a47c8d | 4590 | /* The current function in not necessarily uninlinable. |
4591 | Computed gotos are incompatible with inlining, but the value | |
4592 | here could be used only in a diagnostic, for example. */ | |
4593 | } | |
4594 | ||
4595 | return result; | |
4596 | } | |
4597 | ||
e41f0d80 | 4598 | /* Hook used by expand_expr to expand language-specific tree codes. */ |
b27ac6b5 | 4599 | /* The only things that should go here are bits needed to expand |
365db11e | 4600 | constant initializers. Everything else should be handled by the |
4ee9c684 | 4601 | gimplification routines. */ |
e41f0d80 | 4602 | |
4603 | rtx | |
b27ac6b5 | 4604 | c_expand_expr (tree exp, rtx target, enum machine_mode tmode, |
7d339f93 | 4605 | int modifiera /* Actually enum expand_modifier. */, |
60ffaf4d | 4606 | rtx *alt_rtl) |
e41f0d80 | 4607 | { |
7d339f93 | 4608 | enum expand_modifier modifier = (enum expand_modifier) modifiera; |
e41f0d80 | 4609 | switch (TREE_CODE (exp)) |
4610 | { | |
ec11e38e | 4611 | case COMPOUND_LITERAL_EXPR: |
4612 | { | |
4613 | /* Initialize the anonymous variable declared in the compound | |
4614 | literal, then return the variable. */ | |
4615 | tree decl = COMPOUND_LITERAL_EXPR_DECL (exp); | |
4616 | emit_local_var (decl); | |
60ffaf4d | 4617 | return expand_expr_real (decl, target, tmode, modifier, alt_rtl); |
ec11e38e | 4618 | } |
4619 | ||
e41f0d80 | 4620 | default: |
231bd014 | 4621 | gcc_unreachable (); |
e41f0d80 | 4622 | } |
e41f0d80 | 4623 | } |
4624 | ||
cf484390 | 4625 | /* Hook used by staticp to handle language-specific tree codes. */ |
4626 | ||
4627 | tree | |
4628 | c_staticp (tree exp) | |
4629 | { | |
4630 | return (TREE_CODE (exp) == COMPOUND_LITERAL_EXPR | |
4631 | && TREE_STATIC (COMPOUND_LITERAL_EXPR_DECL (exp)) | |
4632 | ? exp : NULL); | |
4633 | } | |
4f9a1c9b | 4634 | \f |
4635 | ||
4636 | /* Given a boolean expression ARG, return a tree representing an increment | |
4637 | or decrement (as indicated by CODE) of ARG. The front end must check for | |
4638 | invalid cases (e.g., decrement in C++). */ | |
4639 | tree | |
1cae46be | 4640 | boolean_increment (enum tree_code code, tree arg) |
4f9a1c9b | 4641 | { |
4642 | tree val; | |
69db191c | 4643 | tree true_res = build_int_cst (TREE_TYPE (arg), 1); |
c0f19401 | 4644 | |
4f9a1c9b | 4645 | arg = stabilize_reference (arg); |
4646 | switch (code) | |
4647 | { | |
4648 | case PREINCREMENT_EXPR: | |
14ae0310 | 4649 | val = build2 (MODIFY_EXPR, TREE_TYPE (arg), arg, true_res); |
4f9a1c9b | 4650 | break; |
4651 | case POSTINCREMENT_EXPR: | |
14ae0310 | 4652 | val = build2 (MODIFY_EXPR, TREE_TYPE (arg), arg, true_res); |
4f9a1c9b | 4653 | arg = save_expr (arg); |
14ae0310 | 4654 | val = build2 (COMPOUND_EXPR, TREE_TYPE (arg), val, arg); |
4655 | val = build2 (COMPOUND_EXPR, TREE_TYPE (arg), arg, val); | |
4f9a1c9b | 4656 | break; |
4657 | case PREDECREMENT_EXPR: | |
14ae0310 | 4658 | val = build2 (MODIFY_EXPR, TREE_TYPE (arg), arg, |
4659 | invert_truthvalue (arg)); | |
4f9a1c9b | 4660 | break; |
4661 | case POSTDECREMENT_EXPR: | |
14ae0310 | 4662 | val = build2 (MODIFY_EXPR, TREE_TYPE (arg), arg, |
4663 | invert_truthvalue (arg)); | |
4f9a1c9b | 4664 | arg = save_expr (arg); |
14ae0310 | 4665 | val = build2 (COMPOUND_EXPR, TREE_TYPE (arg), val, arg); |
4666 | val = build2 (COMPOUND_EXPR, TREE_TYPE (arg), arg, val); | |
4f9a1c9b | 4667 | break; |
4668 | default: | |
231bd014 | 4669 | gcc_unreachable (); |
4f9a1c9b | 4670 | } |
4671 | TREE_SIDE_EFFECTS (val) = 1; | |
4672 | return val; | |
4673 | } | |
76a6e674 | 4674 | \f |
fd6f6435 | 4675 | /* Built-in macros for stddef.h, that require macros defined in this |
4676 | file. */ | |
79cf3ec1 | 4677 | void |
1cae46be | 4678 | c_stddef_cpp_builtins(void) |
1ed9d5f5 | 4679 | { |
63994318 | 4680 | builtin_define_with_value ("__SIZE_TYPE__", SIZE_TYPE, 0); |
4681 | builtin_define_with_value ("__PTRDIFF_TYPE__", PTRDIFF_TYPE, 0); | |
4682 | builtin_define_with_value ("__WCHAR_TYPE__", MODIFIED_WCHAR_TYPE, 0); | |
4683 | builtin_define_with_value ("__WINT_TYPE__", WINT_TYPE, 0); | |
36bccbfc | 4684 | builtin_define_with_value ("__INTMAX_TYPE__", INTMAX_TYPE, 0); |
4685 | builtin_define_with_value ("__UINTMAX_TYPE__", UINTMAX_TYPE, 0); | |
574006c3 | 4686 | } |
4687 | ||
7d3b509a | 4688 | static void |
1cae46be | 4689 | c_init_attributes (void) |
7d3b509a | 4690 | { |
4691 | /* Fill in the built_in_attributes array. */ | |
7c446c95 | 4692 | #define DEF_ATTR_NULL_TREE(ENUM) \ |
7d3b509a | 4693 | built_in_attributes[(int) ENUM] = NULL_TREE; |
7c446c95 | 4694 | #define DEF_ATTR_INT(ENUM, VALUE) \ |
7016c612 | 4695 | built_in_attributes[(int) ENUM] = build_int_cst (NULL_TREE, VALUE); |
7d3b509a | 4696 | #define DEF_ATTR_IDENT(ENUM, STRING) \ |
4697 | built_in_attributes[(int) ENUM] = get_identifier (STRING); | |
4698 | #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) \ | |
4699 | built_in_attributes[(int) ENUM] \ | |
4700 | = tree_cons (built_in_attributes[(int) PURPOSE], \ | |
4701 | built_in_attributes[(int) VALUE], \ | |
4702 | built_in_attributes[(int) CHAIN]); | |
7d3b509a | 4703 | #include "builtin-attrs.def" |
4704 | #undef DEF_ATTR_NULL_TREE | |
4705 | #undef DEF_ATTR_INT | |
4706 | #undef DEF_ATTR_IDENT | |
4707 | #undef DEF_ATTR_TREE_LIST | |
76a6e674 | 4708 | } |
5f3cead1 | 4709 | |
f8e93a2e | 4710 | /* Attribute handlers common to C front ends. */ |
4711 | ||
4712 | /* Handle a "packed" attribute; arguments as in | |
4713 | struct attribute_spec.handler. */ | |
4714 | ||
4715 | static tree | |
9a03a746 | 4716 | handle_packed_attribute (tree *node, tree name, tree ARG_UNUSED (args), |
09347743 | 4717 | int flags, bool *no_add_attrs) |
f8e93a2e | 4718 | { |
f40175cb | 4719 | if (TYPE_P (*node)) |
f8e93a2e | 4720 | { |
4721 | if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE)) | |
e086912e | 4722 | *node = build_variant_type_copy (*node); |
f40175cb | 4723 | TYPE_PACKED (*node) = 1; |
f8e93a2e | 4724 | } |
4725 | else if (TREE_CODE (*node) == FIELD_DECL) | |
c2ab04f9 | 4726 | { |
4727 | if (TYPE_ALIGN (TREE_TYPE (*node)) <= BITS_PER_UNIT) | |
4728 | warning (OPT_Wattributes, | |
4729 | "%qE attribute ignored for field of type %qT", | |
4730 | name, TREE_TYPE (*node)); | |
4731 | else | |
4732 | DECL_PACKED (*node) = 1; | |
4733 | } | |
f8e93a2e | 4734 | /* We can't set DECL_PACKED for a VAR_DECL, because the bit is |
f40175cb | 4735 | used for DECL_REGISTER. It wouldn't mean anything anyway. |
4736 | We can't set DECL_PACKED on the type of a TYPE_DECL, because | |
4737 | that changes what the typedef is typing. */ | |
f8e93a2e | 4738 | else |
4739 | { | |
9b2d6d13 | 4740 | warning (OPT_Wattributes, "%qE attribute ignored", name); |
f8e93a2e | 4741 | *no_add_attrs = true; |
4742 | } | |
4743 | ||
4744 | return NULL_TREE; | |
4745 | } | |
4746 | ||
4747 | /* Handle a "nocommon" attribute; arguments as in | |
4748 | struct attribute_spec.handler. */ | |
4749 | ||
4750 | static tree | |
1cae46be | 4751 | handle_nocommon_attribute (tree *node, tree name, |
9a03a746 | 4752 | tree ARG_UNUSED (args), |
4753 | int ARG_UNUSED (flags), bool *no_add_attrs) | |
f8e93a2e | 4754 | { |
4755 | if (TREE_CODE (*node) == VAR_DECL) | |
4756 | DECL_COMMON (*node) = 0; | |
4757 | else | |
4758 | { | |
9b2d6d13 | 4759 | warning (OPT_Wattributes, "%qE attribute ignored", name); |
f8e93a2e | 4760 | *no_add_attrs = true; |
4761 | } | |
4762 | ||
4763 | return NULL_TREE; | |
4764 | } | |
4765 | ||
4766 | /* Handle a "common" attribute; arguments as in | |
4767 | struct attribute_spec.handler. */ | |
4768 | ||
4769 | static tree | |
9a03a746 | 4770 | handle_common_attribute (tree *node, tree name, tree ARG_UNUSED (args), |
4771 | int ARG_UNUSED (flags), bool *no_add_attrs) | |
f8e93a2e | 4772 | { |
4773 | if (TREE_CODE (*node) == VAR_DECL) | |
4774 | DECL_COMMON (*node) = 1; | |
4775 | else | |
4776 | { | |
9b2d6d13 | 4777 | warning (OPT_Wattributes, "%qE attribute ignored", name); |
f8e93a2e | 4778 | *no_add_attrs = true; |
4779 | } | |
4780 | ||
4781 | return NULL_TREE; | |
4782 | } | |
4783 | ||
4784 | /* Handle a "noreturn" attribute; arguments as in | |
4785 | struct attribute_spec.handler. */ | |
4786 | ||
4787 | static tree | |
9a03a746 | 4788 | handle_noreturn_attribute (tree *node, tree name, tree ARG_UNUSED (args), |
4789 | int ARG_UNUSED (flags), bool *no_add_attrs) | |
f8e93a2e | 4790 | { |
4791 | tree type = TREE_TYPE (*node); | |
4792 | ||
4793 | /* See FIXME comment in c_common_attribute_table. */ | |
4794 | if (TREE_CODE (*node) == FUNCTION_DECL) | |
4795 | TREE_THIS_VOLATILE (*node) = 1; | |
4796 | else if (TREE_CODE (type) == POINTER_TYPE | |
4797 | && TREE_CODE (TREE_TYPE (type)) == FUNCTION_TYPE) | |
4798 | TREE_TYPE (*node) | |
4799 | = build_pointer_type | |
4800 | (build_type_variant (TREE_TYPE (type), | |
71bda45d | 4801 | TYPE_READONLY (TREE_TYPE (type)), 1)); |
f8e93a2e | 4802 | else |
4803 | { | |
9b2d6d13 | 4804 | warning (OPT_Wattributes, "%qE attribute ignored", name); |
f8e93a2e | 4805 | *no_add_attrs = true; |
4806 | } | |
4807 | ||
4808 | return NULL_TREE; | |
4809 | } | |
4810 | ||
5de92639 | 4811 | /* Handle a "hot" and attribute; arguments as in |
4812 | struct attribute_spec.handler. */ | |
4813 | ||
4814 | static tree | |
4815 | handle_hot_attribute (tree *node, tree name, tree ARG_UNUSED (args), | |
4816 | int ARG_UNUSED (flags), bool *no_add_attrs) | |
4817 | { | |
4818 | if (TREE_CODE (*node) == FUNCTION_DECL) | |
4819 | { | |
4820 | if (lookup_attribute ("cold", DECL_ATTRIBUTES (*node)) != NULL) | |
4821 | { | |
4822 | warning (OPT_Wattributes, "%qE attribute conflicts with attribute %s", | |
4823 | name, "cold"); | |
4824 | *no_add_attrs = true; | |
4825 | } | |
4826 | /* Do nothing else, just set the attribute. We'll get at | |
4827 | it later with lookup_attribute. */ | |
4828 | } | |
4829 | else | |
4830 | { | |
4831 | warning (OPT_Wattributes, "%qE attribute ignored", name); | |
4832 | *no_add_attrs = true; | |
4833 | } | |
4834 | ||
4835 | return NULL_TREE; | |
4836 | } | |
4837 | /* Handle a "cold" and attribute; arguments as in | |
4838 | struct attribute_spec.handler. */ | |
4839 | ||
4840 | static tree | |
4841 | handle_cold_attribute (tree *node, tree name, tree ARG_UNUSED (args), | |
4842 | int ARG_UNUSED (flags), bool *no_add_attrs) | |
4843 | { | |
4844 | if (TREE_CODE (*node) == FUNCTION_DECL) | |
4845 | { | |
4846 | if (lookup_attribute ("hot", DECL_ATTRIBUTES (*node)) != NULL) | |
4847 | { | |
4848 | warning (OPT_Wattributes, "%qE attribute conflicts with attribute %s", | |
4849 | name, "hot"); | |
4850 | *no_add_attrs = true; | |
4851 | } | |
4852 | /* Do nothing else, just set the attribute. We'll get at | |
4853 | it later with lookup_attribute. */ | |
4854 | } | |
4855 | else | |
4856 | { | |
4857 | warning (OPT_Wattributes, "%qE attribute ignored", name); | |
4858 | *no_add_attrs = true; | |
4859 | } | |
4860 | ||
4861 | return NULL_TREE; | |
4862 | } | |
4863 | ||
f8e93a2e | 4864 | /* Handle a "noinline" attribute; arguments as in |
4865 | struct attribute_spec.handler. */ | |
4866 | ||
4867 | static tree | |
1cae46be | 4868 | handle_noinline_attribute (tree *node, tree name, |
9a03a746 | 4869 | tree ARG_UNUSED (args), |
4870 | int ARG_UNUSED (flags), bool *no_add_attrs) | |
f8e93a2e | 4871 | { |
4872 | if (TREE_CODE (*node) == FUNCTION_DECL) | |
4873 | DECL_UNINLINABLE (*node) = 1; | |
4874 | else | |
4875 | { | |
9b2d6d13 | 4876 | warning (OPT_Wattributes, "%qE attribute ignored", name); |
f8e93a2e | 4877 | *no_add_attrs = true; |
4878 | } | |
4879 | ||
4880 | return NULL_TREE; | |
4881 | } | |
4882 | ||
4883 | /* Handle a "always_inline" attribute; arguments as in | |
4884 | struct attribute_spec.handler. */ | |
4885 | ||
4886 | static tree | |
1cae46be | 4887 | handle_always_inline_attribute (tree *node, tree name, |
9a03a746 | 4888 | tree ARG_UNUSED (args), |
4889 | int ARG_UNUSED (flags), | |
09347743 | 4890 | bool *no_add_attrs) |
f8e93a2e | 4891 | { |
4892 | if (TREE_CODE (*node) == FUNCTION_DECL) | |
4893 | { | |
ebb7d626 | 4894 | /* Set the attribute and mark it for disregarding inline |
4895 | limits. */ | |
4896 | DECL_DISREGARD_INLINE_LIMITS (*node) = 1; | |
f8e93a2e | 4897 | } |
4898 | else | |
4899 | { | |
9b2d6d13 | 4900 | warning (OPT_Wattributes, "%qE attribute ignored", name); |
f8e93a2e | 4901 | *no_add_attrs = true; |
541e4101 | 4902 | } |
4903 | ||
4904 | return NULL_TREE; | |
4905 | } | |
4906 | ||
4907 | /* Handle a "gnu_inline" attribute; arguments as in | |
4908 | struct attribute_spec.handler. */ | |
4909 | ||
4910 | static tree | |
4911 | handle_gnu_inline_attribute (tree *node, tree name, | |
4912 | tree ARG_UNUSED (args), | |
4913 | int ARG_UNUSED (flags), | |
4914 | bool *no_add_attrs) | |
4915 | { | |
4916 | if (TREE_CODE (*node) == FUNCTION_DECL && DECL_DECLARED_INLINE_P (*node)) | |
4917 | { | |
4918 | /* Do nothing else, just set the attribute. We'll get at | |
4919 | it later with lookup_attribute. */ | |
4920 | } | |
4921 | else | |
4922 | { | |
4923 | warning (OPT_Wattributes, "%qE attribute ignored", name); | |
4924 | *no_add_attrs = true; | |
f8e93a2e | 4925 | } |
4926 | ||
4927 | return NULL_TREE; | |
4928 | } | |
4929 | ||
1b16fc45 | 4930 | /* Handle an "artificial" attribute; arguments as in |
4931 | struct attribute_spec.handler. */ | |
4932 | ||
4933 | static tree | |
4934 | handle_artificial_attribute (tree *node, tree name, | |
4935 | tree ARG_UNUSED (args), | |
4936 | int ARG_UNUSED (flags), | |
4937 | bool *no_add_attrs) | |
4938 | { | |
4939 | if (TREE_CODE (*node) == FUNCTION_DECL && DECL_DECLARED_INLINE_P (*node)) | |
4940 | { | |
4941 | /* Do nothing else, just set the attribute. We'll get at | |
4942 | it later with lookup_attribute. */ | |
4943 | } | |
4944 | else | |
4945 | { | |
4946 | warning (OPT_Wattributes, "%qE attribute ignored", name); | |
4947 | *no_add_attrs = true; | |
4948 | } | |
4949 | ||
4950 | return NULL_TREE; | |
4951 | } | |
4952 | ||
0cdd9887 | 4953 | /* Handle a "flatten" attribute; arguments as in |
4954 | struct attribute_spec.handler. */ | |
4955 | ||
4956 | static tree | |
4957 | handle_flatten_attribute (tree *node, tree name, | |
a0c938f0 | 4958 | tree args ATTRIBUTE_UNUSED, |
4959 | int flags ATTRIBUTE_UNUSED, bool *no_add_attrs) | |
0cdd9887 | 4960 | { |
4961 | if (TREE_CODE (*node) == FUNCTION_DECL) | |
4962 | /* Do nothing else, just set the attribute. We'll get at | |
4963 | it later with lookup_attribute. */ | |
4964 | ; | |
4965 | else | |
4966 | { | |
4967 | warning (OPT_Wattributes, "%qE attribute ignored", name); | |
4968 | *no_add_attrs = true; | |
4969 | } | |
4970 | ||
4971 | return NULL_TREE; | |
4972 | } | |
4973 | ||
10fc867f | 4974 | /* Handle a "warning" or "error" attribute; arguments as in |
4975 | struct attribute_spec.handler. */ | |
4976 | ||
4977 | static tree | |
4978 | handle_error_attribute (tree *node, tree name, tree args, | |
4979 | int ARG_UNUSED (flags), bool *no_add_attrs) | |
4980 | { | |
4981 | if (TREE_CODE (*node) == FUNCTION_DECL | |
4982 | || TREE_CODE (TREE_VALUE (args)) == STRING_CST) | |
4983 | /* Do nothing else, just set the attribute. We'll get at | |
4984 | it later with lookup_attribute. */ | |
4985 | ; | |
4986 | else | |
4987 | { | |
4988 | warning (OPT_Wattributes, "%qE attribute ignored", name); | |
4989 | *no_add_attrs = true; | |
4990 | } | |
4991 | ||
4992 | return NULL_TREE; | |
4993 | } | |
0cdd9887 | 4994 | |
f8e93a2e | 4995 | /* Handle a "used" attribute; arguments as in |
4996 | struct attribute_spec.handler. */ | |
4997 | ||
4998 | static tree | |
9a03a746 | 4999 | handle_used_attribute (tree *pnode, tree name, tree ARG_UNUSED (args), |
5000 | int ARG_UNUSED (flags), bool *no_add_attrs) | |
f8e93a2e | 5001 | { |
d0a31bd8 | 5002 | tree node = *pnode; |
5003 | ||
5004 | if (TREE_CODE (node) == FUNCTION_DECL | |
5005 | || (TREE_CODE (node) == VAR_DECL && TREE_STATIC (node))) | |
f54ed8bc | 5006 | { |
f54ed8bc | 5007 | TREE_USED (node) = 1; |
9423c9b7 | 5008 | DECL_PRESERVE_P (node) = 1; |
f54ed8bc | 5009 | } |
f8e93a2e | 5010 | else |
5011 | { | |
9b2d6d13 | 5012 | warning (OPT_Wattributes, "%qE attribute ignored", name); |
f8e93a2e | 5013 | *no_add_attrs = true; |
5014 | } | |
5015 | ||
5016 | return NULL_TREE; | |
5017 | } | |
5018 | ||
5019 | /* Handle a "unused" attribute; arguments as in | |
5020 | struct attribute_spec.handler. */ | |
5021 | ||
5022 | static tree | |
9a03a746 | 5023 | handle_unused_attribute (tree *node, tree name, tree ARG_UNUSED (args), |
5024 | int flags, bool *no_add_attrs) | |
f8e93a2e | 5025 | { |
5026 | if (DECL_P (*node)) | |
5027 | { | |
5028 | tree decl = *node; | |
5029 | ||
5030 | if (TREE_CODE (decl) == PARM_DECL | |
5031 | || TREE_CODE (decl) == VAR_DECL | |
5032 | || TREE_CODE (decl) == FUNCTION_DECL | |
5033 | || TREE_CODE (decl) == LABEL_DECL | |
5034 | || TREE_CODE (decl) == TYPE_DECL) | |
5035 | TREE_USED (decl) = 1; | |
5036 | else | |
5037 | { | |
9b2d6d13 | 5038 | warning (OPT_Wattributes, "%qE attribute ignored", name); |
f8e93a2e | 5039 | *no_add_attrs = true; |
5040 | } | |
5041 | } | |
5042 | else | |
5043 | { | |
5044 | if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE)) | |
e086912e | 5045 | *node = build_variant_type_copy (*node); |
f8e93a2e | 5046 | TREE_USED (*node) = 1; |
5047 | } | |
5048 | ||
5049 | return NULL_TREE; | |
5050 | } | |
5051 | ||
62eec3b4 | 5052 | /* Handle a "externally_visible" attribute; arguments as in |
5053 | struct attribute_spec.handler. */ | |
5054 | ||
5055 | static tree | |
5056 | handle_externally_visible_attribute (tree *pnode, tree name, | |
5057 | tree ARG_UNUSED (args), | |
5058 | int ARG_UNUSED (flags), | |
5059 | bool *no_add_attrs) | |
5060 | { | |
5061 | tree node = *pnode; | |
5062 | ||
ba12ea31 | 5063 | if (TREE_CODE (node) == FUNCTION_DECL || TREE_CODE (node) == VAR_DECL) |
62eec3b4 | 5064 | { |
ba12ea31 | 5065 | if ((!TREE_STATIC (node) && TREE_CODE (node) != FUNCTION_DECL |
5066 | && !DECL_EXTERNAL (node)) || !TREE_PUBLIC (node)) | |
5067 | { | |
5068 | warning (OPT_Wattributes, | |
5069 | "%qE attribute have effect only on public objects", name); | |
5070 | *no_add_attrs = true; | |
5071 | } | |
62eec3b4 | 5072 | } |
62eec3b4 | 5073 | else |
5074 | { | |
5075 | warning (OPT_Wattributes, "%qE attribute ignored", name); | |
5076 | *no_add_attrs = true; | |
5077 | } | |
5078 | ||
5079 | return NULL_TREE; | |
5080 | } | |
5081 | ||
f8e93a2e | 5082 | /* Handle a "const" attribute; arguments as in |
5083 | struct attribute_spec.handler. */ | |
5084 | ||
5085 | static tree | |
9a03a746 | 5086 | handle_const_attribute (tree *node, tree name, tree ARG_UNUSED (args), |
5087 | int ARG_UNUSED (flags), bool *no_add_attrs) | |
f8e93a2e | 5088 | { |
5089 | tree type = TREE_TYPE (*node); | |
5090 | ||
5091 | /* See FIXME comment on noreturn in c_common_attribute_table. */ | |
5092 | if (TREE_CODE (*node) == FUNCTION_DECL) | |
5093 | TREE_READONLY (*node) = 1; | |
5094 | else if (TREE_CODE (type) == POINTER_TYPE | |
5095 | && TREE_CODE (TREE_TYPE (type)) == FUNCTION_TYPE) | |
5096 | TREE_TYPE (*node) | |
5097 | = build_pointer_type | |
5098 | (build_type_variant (TREE_TYPE (type), 1, | |
5099 | TREE_THIS_VOLATILE (TREE_TYPE (type)))); | |
5100 | else | |
5101 | { | |
9b2d6d13 | 5102 | warning (OPT_Wattributes, "%qE attribute ignored", name); |
f8e93a2e | 5103 | *no_add_attrs = true; |
5104 | } | |
5105 | ||
5106 | return NULL_TREE; | |
5107 | } | |
5108 | ||
5109 | /* Handle a "transparent_union" attribute; arguments as in | |
5110 | struct attribute_spec.handler. */ | |
5111 | ||
5112 | static tree | |
1cae46be | 5113 | handle_transparent_union_attribute (tree *node, tree name, |
9a03a746 | 5114 | tree ARG_UNUSED (args), int flags, |
09347743 | 5115 | bool *no_add_attrs) |
f8e93a2e | 5116 | { |
881eb642 | 5117 | tree type; |
03908818 | 5118 | |
5119 | *no_add_attrs = true; | |
f8e93a2e | 5120 | |
881eb642 | 5121 | if (TREE_CODE (*node) == TYPE_DECL) |
5122 | node = &TREE_TYPE (*node); | |
5123 | type = *node; | |
f8e93a2e | 5124 | |
03908818 | 5125 | if (TREE_CODE (type) == UNION_TYPE) |
f8e93a2e | 5126 | { |
03908818 | 5127 | /* When IN_PLACE is set, leave the check for FIELDS and MODE to |
5128 | the code in finish_struct. */ | |
f8e93a2e | 5129 | if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE)) |
03908818 | 5130 | { |
5131 | if (TYPE_FIELDS (type) == NULL_TREE | |
5132 | || TYPE_MODE (type) != DECL_MODE (TYPE_FIELDS (type))) | |
5133 | goto ignored; | |
5134 | ||
5135 | /* A type variant isn't good enough, since we don't a cast | |
5136 | to such a type removed as a no-op. */ | |
5137 | *node = type = build_duplicate_type (type); | |
5138 | } | |
5139 | ||
5140 | TYPE_TRANSPARENT_UNION (type) = 1; | |
5141 | return NULL_TREE; | |
f8e93a2e | 5142 | } |
5143 | ||
03908818 | 5144 | ignored: |
5145 | warning (OPT_Wattributes, "%qE attribute ignored", name); | |
f8e93a2e | 5146 | return NULL_TREE; |
5147 | } | |
5148 | ||
9af7fd5b | 5149 | /* Subroutine of handle_{con,de}structor_attribute. Evaluate ARGS to |
5150 | get the requested priority for a constructor or destructor, | |
5151 | possibly issuing diagnostics for invalid or reserved | |
5152 | priorities. */ | |
5153 | ||
5154 | static priority_type | |
5155 | get_priority (tree args, bool is_destructor) | |
5156 | { | |
5157 | HOST_WIDE_INT pri; | |
6c181a06 | 5158 | tree arg; |
9af7fd5b | 5159 | |
5160 | if (!args) | |
5161 | return DEFAULT_INIT_PRIORITY; | |
6c181a06 | 5162 | |
28fbc04f | 5163 | if (!SUPPORTS_INIT_PRIORITY) |
5164 | { | |
5165 | if (is_destructor) | |
5166 | error ("destructor priorities are not supported"); | |
5167 | else | |
5168 | error ("constructor priorities are not supported"); | |
5169 | return DEFAULT_INIT_PRIORITY; | |
5170 | } | |
5171 | ||
6c181a06 | 5172 | arg = TREE_VALUE (args); |
5173 | if (!host_integerp (arg, /*pos=*/0) | |
5174 | || !INTEGRAL_TYPE_P (TREE_TYPE (arg))) | |
9af7fd5b | 5175 | goto invalid; |
5176 | ||
5177 | pri = tree_low_cst (TREE_VALUE (args), /*pos=*/0); | |
5178 | if (pri < 0 || pri > MAX_INIT_PRIORITY) | |
5179 | goto invalid; | |
5180 | ||
5181 | if (pri <= MAX_RESERVED_INIT_PRIORITY) | |
5182 | { | |
5183 | if (is_destructor) | |
5184 | warning (0, | |
5185 | "destructor priorities from 0 to %d are reserved " | |
5186 | "for the implementation", | |
5187 | MAX_RESERVED_INIT_PRIORITY); | |
5188 | else | |
5189 | warning (0, | |
5190 | "constructor priorities from 0 to %d are reserved " | |
5191 | "for the implementation", | |
5192 | MAX_RESERVED_INIT_PRIORITY); | |
5193 | } | |
5194 | return pri; | |
5195 | ||
5196 | invalid: | |
5197 | if (is_destructor) | |
5198 | error ("destructor priorities must be integers from 0 to %d inclusive", | |
5199 | MAX_INIT_PRIORITY); | |
5200 | else | |
5201 | error ("constructor priorities must be integers from 0 to %d inclusive", | |
5202 | MAX_INIT_PRIORITY); | |
5203 | return DEFAULT_INIT_PRIORITY; | |
5204 | } | |
5205 | ||
f8e93a2e | 5206 | /* Handle a "constructor" attribute; arguments as in |
5207 | struct attribute_spec.handler. */ | |
5208 | ||
5209 | static tree | |
9af7fd5b | 5210 | handle_constructor_attribute (tree *node, tree name, tree args, |
9a03a746 | 5211 | int ARG_UNUSED (flags), |
09347743 | 5212 | bool *no_add_attrs) |
f8e93a2e | 5213 | { |
5214 | tree decl = *node; | |
5215 | tree type = TREE_TYPE (decl); | |
5216 | ||
5217 | if (TREE_CODE (decl) == FUNCTION_DECL | |
5218 | && TREE_CODE (type) == FUNCTION_TYPE | |
5219 | && decl_function_context (decl) == 0) | |
5220 | { | |
9af7fd5b | 5221 | priority_type priority; |
f8e93a2e | 5222 | DECL_STATIC_CONSTRUCTOR (decl) = 1; |
9af7fd5b | 5223 | priority = get_priority (args, /*is_destructor=*/false); |
5224 | SET_DECL_INIT_PRIORITY (decl, priority); | |
f8e93a2e | 5225 | TREE_USED (decl) = 1; |
5226 | } | |
5227 | else | |
5228 | { | |
9b2d6d13 | 5229 | warning (OPT_Wattributes, "%qE attribute ignored", name); |
f8e93a2e | 5230 | *no_add_attrs = true; |
5231 | } | |
5232 | ||
5233 | return NULL_TREE; | |
5234 | } | |
5235 | ||
5236 | /* Handle a "destructor" attribute; arguments as in | |
5237 | struct attribute_spec.handler. */ | |
5238 | ||
5239 | static tree | |
9af7fd5b | 5240 | handle_destructor_attribute (tree *node, tree name, tree args, |
9a03a746 | 5241 | int ARG_UNUSED (flags), |
09347743 | 5242 | bool *no_add_attrs) |
f8e93a2e | 5243 | { |
5244 | tree decl = *node; | |
5245 | tree type = TREE_TYPE (decl); | |
5246 | ||
5247 | if (TREE_CODE (decl) == FUNCTION_DECL | |
5248 | && TREE_CODE (type) == FUNCTION_TYPE | |
5249 | && decl_function_context (decl) == 0) | |
5250 | { | |
9af7fd5b | 5251 | priority_type priority; |
f8e93a2e | 5252 | DECL_STATIC_DESTRUCTOR (decl) = 1; |
9af7fd5b | 5253 | priority = get_priority (args, /*is_destructor=*/true); |
5254 | SET_DECL_FINI_PRIORITY (decl, priority); | |
f8e93a2e | 5255 | TREE_USED (decl) = 1; |
5256 | } | |
5257 | else | |
5258 | { | |
9b2d6d13 | 5259 | warning (OPT_Wattributes, "%qE attribute ignored", name); |
f8e93a2e | 5260 | *no_add_attrs = true; |
5261 | } | |
5262 | ||
5263 | return NULL_TREE; | |
5264 | } | |
5265 | ||
5266 | /* Handle a "mode" attribute; arguments as in | |
5267 | struct attribute_spec.handler. */ | |
5268 | ||
5269 | static tree | |
9a03a746 | 5270 | handle_mode_attribute (tree *node, tree name, tree args, |
5271 | int ARG_UNUSED (flags), bool *no_add_attrs) | |
f8e93a2e | 5272 | { |
5273 | tree type = *node; | |
5274 | ||
5275 | *no_add_attrs = true; | |
5276 | ||
5277 | if (TREE_CODE (TREE_VALUE (args)) != IDENTIFIER_NODE) | |
9b2d6d13 | 5278 | warning (OPT_Wattributes, "%qE attribute ignored", name); |
f8e93a2e | 5279 | else |
5280 | { | |
5281 | int j; | |
5282 | const char *p = IDENTIFIER_POINTER (TREE_VALUE (args)); | |
5283 | int len = strlen (p); | |
5284 | enum machine_mode mode = VOIDmode; | |
5285 | tree typefm; | |
b2aef146 | 5286 | bool valid_mode; |
f8e93a2e | 5287 | |
5288 | if (len > 4 && p[0] == '_' && p[1] == '_' | |
5289 | && p[len - 1] == '_' && p[len - 2] == '_') | |
5290 | { | |
4fd61bc6 | 5291 | char *newp = (char *) alloca (len - 1); |
f8e93a2e | 5292 | |
5293 | strcpy (newp, &p[2]); | |
5294 | newp[len - 4] = '\0'; | |
5295 | p = newp; | |
5296 | } | |
5297 | ||
5298 | /* Change this type to have a type with the specified mode. | |
5299 | First check for the special modes. */ | |
84166705 | 5300 | if (!strcmp (p, "byte")) |
f8e93a2e | 5301 | mode = byte_mode; |
5302 | else if (!strcmp (p, "word")) | |
5303 | mode = word_mode; | |
84166705 | 5304 | else if (!strcmp (p, "pointer")) |
f8e93a2e | 5305 | mode = ptr_mode; |
0ef89dfd | 5306 | else if (!strcmp (p, "libgcc_cmp_return")) |
5307 | mode = targetm.libgcc_cmp_return_mode (); | |
5308 | else if (!strcmp (p, "libgcc_shift_count")) | |
5309 | mode = targetm.libgcc_shift_count_mode (); | |
1bd43494 | 5310 | else if (!strcmp (p, "unwind_word")) |
5311 | mode = targetm.unwind_word_mode (); | |
f8e93a2e | 5312 | else |
5313 | for (j = 0; j < NUM_MACHINE_MODES; j++) | |
5314 | if (!strcmp (p, GET_MODE_NAME (j))) | |
743a6f47 | 5315 | { |
5316 | mode = (enum machine_mode) j; | |
5317 | break; | |
5318 | } | |
f8e93a2e | 5319 | |
5320 | if (mode == VOIDmode) | |
4917c376 | 5321 | { |
1e5fcbe2 | 5322 | error ("unknown machine mode %qs", p); |
4917c376 | 5323 | return NULL_TREE; |
5324 | } | |
5325 | ||
b2aef146 | 5326 | valid_mode = false; |
5327 | switch (GET_MODE_CLASS (mode)) | |
4917c376 | 5328 | { |
b2aef146 | 5329 | case MODE_INT: |
5330 | case MODE_PARTIAL_INT: | |
5331 | case MODE_FLOAT: | |
c4503c0a | 5332 | case MODE_DECIMAL_FLOAT: |
9421ebb9 | 5333 | case MODE_FRACT: |
5334 | case MODE_UFRACT: | |
5335 | case MODE_ACCUM: | |
5336 | case MODE_UACCUM: | |
b2aef146 | 5337 | valid_mode = targetm.scalar_mode_supported_p (mode); |
5338 | break; | |
5339 | ||
5340 | case MODE_COMPLEX_INT: | |
5341 | case MODE_COMPLEX_FLOAT: | |
5342 | valid_mode = targetm.scalar_mode_supported_p (GET_MODE_INNER (mode)); | |
5343 | break; | |
5344 | ||
5345 | case MODE_VECTOR_INT: | |
5346 | case MODE_VECTOR_FLOAT: | |
9421ebb9 | 5347 | case MODE_VECTOR_FRACT: |
5348 | case MODE_VECTOR_UFRACT: | |
5349 | case MODE_VECTOR_ACCUM: | |
5350 | case MODE_VECTOR_UACCUM: | |
9b2d6d13 | 5351 | warning (OPT_Wattributes, "specifying vector types with " |
5352 | "__attribute__ ((mode)) is deprecated"); | |
5353 | warning (OPT_Wattributes, | |
5354 | "use __attribute__ ((vector_size)) instead"); | |
b2aef146 | 5355 | valid_mode = vector_mode_valid_p (mode); |
5356 | break; | |
4917c376 | 5357 | |
b2aef146 | 5358 | default: |
5359 | break; | |
5360 | } | |
5361 | if (!valid_mode) | |
5362 | { | |
1e5fcbe2 | 5363 | error ("unable to emulate %qs", p); |
b2aef146 | 5364 | return NULL_TREE; |
5365 | } | |
4917c376 | 5366 | |
b2aef146 | 5367 | if (POINTER_TYPE_P (type)) |
ead34f59 | 5368 | { |
b2aef146 | 5369 | tree (*fn)(tree, enum machine_mode, bool); |
5370 | ||
5371 | if (!targetm.valid_pointer_mode (mode)) | |
ead34f59 | 5372 | { |
1e5fcbe2 | 5373 | error ("invalid pointer mode %qs", p); |
ead34f59 | 5374 | return NULL_TREE; |
5375 | } | |
5376 | ||
a0c938f0 | 5377 | if (TREE_CODE (type) == POINTER_TYPE) |
b2aef146 | 5378 | fn = build_pointer_type_for_mode; |
805e22b2 | 5379 | else |
b2aef146 | 5380 | fn = build_reference_type_for_mode; |
5381 | typefm = fn (TREE_TYPE (type), mode, false); | |
ead34f59 | 5382 | } |
b2aef146 | 5383 | else |
9421ebb9 | 5384 | { |
5385 | /* For fixed-point modes, we need to test if the signness of type | |
5386 | and the machine mode are consistent. */ | |
5387 | if (ALL_FIXED_POINT_MODE_P (mode) | |
5388 | && TYPE_UNSIGNED (type) != UNSIGNED_FIXED_POINT_MODE_P (mode)) | |
5389 | { | |
5390 | error ("signness of type and machine mode %qs don't match", p); | |
5391 | return NULL_TREE; | |
5392 | } | |
5393 | /* For fixed-point modes, we need to pass saturating info. */ | |
5394 | typefm = lang_hooks.types.type_for_mode (mode, | |
5395 | ALL_FIXED_POINT_MODE_P (mode) ? TYPE_SATURATING (type) | |
5396 | : TYPE_UNSIGNED (type)); | |
5397 | } | |
3a648ab9 | 5398 | |
b2aef146 | 5399 | if (typefm == NULL_TREE) |
5400 | { | |
743a6f47 | 5401 | error ("no data type for mode %qs", p); |
b2aef146 | 5402 | return NULL_TREE; |
5403 | } | |
3a648ab9 | 5404 | else if (TREE_CODE (type) == ENUMERAL_TYPE) |
5405 | { | |
5406 | /* For enumeral types, copy the precision from the integer | |
5407 | type returned above. If not an INTEGER_TYPE, we can't use | |
5408 | this mode for this type. */ | |
5409 | if (TREE_CODE (typefm) != INTEGER_TYPE) | |
5410 | { | |
743a6f47 | 5411 | error ("cannot use mode %qs for enumeral types", p); |
3a648ab9 | 5412 | return NULL_TREE; |
5413 | } | |
5414 | ||
10080eac | 5415 | if (flags & ATTR_FLAG_TYPE_IN_PLACE) |
5416 | { | |
5417 | TYPE_PRECISION (type) = TYPE_PRECISION (typefm); | |
5418 | typefm = type; | |
5419 | } | |
5420 | else | |
5421 | { | |
5422 | /* We cannot build a type variant, as there's code that assumes | |
5423 | that TYPE_MAIN_VARIANT has the same mode. This includes the | |
5424 | debug generators. Instead, create a subrange type. This | |
5425 | results in all of the enumeral values being emitted only once | |
5426 | in the original, and the subtype gets them by reference. */ | |
5427 | if (TYPE_UNSIGNED (type)) | |
5428 | typefm = make_unsigned_type (TYPE_PRECISION (typefm)); | |
5429 | else | |
5430 | typefm = make_signed_type (TYPE_PRECISION (typefm)); | |
5431 | TREE_TYPE (typefm) = type; | |
5432 | } | |
3a648ab9 | 5433 | } |
4bf450a1 | 5434 | else if (VECTOR_MODE_P (mode) |
5435 | ? TREE_CODE (type) != TREE_CODE (TREE_TYPE (typefm)) | |
5436 | : TREE_CODE (type) != TREE_CODE (typefm)) | |
743a6f47 | 5437 | { |
5438 | error ("mode %qs applied to inappropriate type", p); | |
5439 | return NULL_TREE; | |
5440 | } | |
5441 | ||
b2aef146 | 5442 | *node = typefm; |
f8e93a2e | 5443 | } |
5444 | ||
5445 | return NULL_TREE; | |
5446 | } | |
5447 | ||
5448 | /* Handle a "section" attribute; arguments as in | |
5449 | struct attribute_spec.handler. */ | |
5450 | ||
5451 | static tree | |
9a03a746 | 5452 | handle_section_attribute (tree *node, tree ARG_UNUSED (name), tree args, |
5453 | int ARG_UNUSED (flags), bool *no_add_attrs) | |
f8e93a2e | 5454 | { |
5455 | tree decl = *node; | |
5456 | ||
5457 | if (targetm.have_named_sections) | |
5458 | { | |
065efcb1 | 5459 | user_defined_section_attribute = true; |
5460 | ||
f8e93a2e | 5461 | if ((TREE_CODE (decl) == FUNCTION_DECL |
5462 | || TREE_CODE (decl) == VAR_DECL) | |
5463 | && TREE_CODE (TREE_VALUE (args)) == STRING_CST) | |
5464 | { | |
5465 | if (TREE_CODE (decl) == VAR_DECL | |
5466 | && current_function_decl != NULL_TREE | |
84166705 | 5467 | && !TREE_STATIC (decl)) |
f8e93a2e | 5468 | { |
9bc3739f | 5469 | error ("%Jsection attribute cannot be specified for " |
4ee9c684 | 5470 | "local variables", decl); |
f8e93a2e | 5471 | *no_add_attrs = true; |
5472 | } | |
5473 | ||
5474 | /* The decl may have already been given a section attribute | |
5475 | from a previous declaration. Ensure they match. */ | |
5476 | else if (DECL_SECTION_NAME (decl) != NULL_TREE | |
5477 | && strcmp (TREE_STRING_POINTER (DECL_SECTION_NAME (decl)), | |
5478 | TREE_STRING_POINTER (TREE_VALUE (args))) != 0) | |
5479 | { | |
3cf8b391 | 5480 | error ("section of %q+D conflicts with previous declaration", |
5481 | *node); | |
f8e93a2e | 5482 | *no_add_attrs = true; |
5483 | } | |
38475469 | 5484 | else if (TREE_CODE (decl) == VAR_DECL |
5485 | && !targetm.have_tls && targetm.emutls.tmpl_section | |
5486 | && DECL_THREAD_LOCAL_P (decl)) | |
5487 | { | |
5488 | error ("section of %q+D cannot be overridden", *node); | |
5489 | *no_add_attrs = true; | |
5490 | } | |
f8e93a2e | 5491 | else |
5492 | DECL_SECTION_NAME (decl) = TREE_VALUE (args); | |
5493 | } | |
5494 | else | |
5495 | { | |
3cf8b391 | 5496 | error ("section attribute not allowed for %q+D", *node); |
f8e93a2e | 5497 | *no_add_attrs = true; |
5498 | } | |
5499 | } | |
5500 | else | |
5501 | { | |
9bc3739f | 5502 | error ("%Jsection attributes are not supported for this target", *node); |
f8e93a2e | 5503 | *no_add_attrs = true; |
5504 | } | |
5505 | ||
5506 | return NULL_TREE; | |
5507 | } | |
5508 | ||
5509 | /* Handle a "aligned" attribute; arguments as in | |
5510 | struct attribute_spec.handler. */ | |
5511 | ||
5512 | static tree | |
9a03a746 | 5513 | handle_aligned_attribute (tree *node, tree ARG_UNUSED (name), tree args, |
09347743 | 5514 | int flags, bool *no_add_attrs) |
f8e93a2e | 5515 | { |
5516 | tree decl = NULL_TREE; | |
5517 | tree *type = NULL; | |
5518 | int is_type = 0; | |
5519 | tree align_expr = (args ? TREE_VALUE (args) | |
5520 | : size_int (BIGGEST_ALIGNMENT / BITS_PER_UNIT)); | |
5521 | int i; | |
5522 | ||
5523 | if (DECL_P (*node)) | |
5524 | { | |
5525 | decl = *node; | |
5526 | type = &TREE_TYPE (decl); | |
5527 | is_type = TREE_CODE (*node) == TYPE_DECL; | |
5528 | } | |
5529 | else if (TYPE_P (*node)) | |
5530 | type = node, is_type = 1; | |
5531 | ||
f8e93a2e | 5532 | if (TREE_CODE (align_expr) != INTEGER_CST) |
5533 | { | |
5534 | error ("requested alignment is not a constant"); | |
5535 | *no_add_attrs = true; | |
5536 | } | |
5537 | else if ((i = tree_log2 (align_expr)) == -1) | |
5538 | { | |
5539 | error ("requested alignment is not a power of 2"); | |
5540 | *no_add_attrs = true; | |
5541 | } | |
5542 | else if (i > HOST_BITS_PER_INT - 2) | |
5543 | { | |
5544 | error ("requested alignment is too large"); | |
5545 | *no_add_attrs = true; | |
5546 | } | |
5547 | else if (is_type) | |
5548 | { | |
5549 | /* If we have a TYPE_DECL, then copy the type, so that we | |
5550 | don't accidentally modify a builtin type. See pushdecl. */ | |
5551 | if (decl && TREE_TYPE (decl) != error_mark_node | |
5552 | && DECL_ORIGINAL_TYPE (decl) == NULL_TREE) | |
5553 | { | |
5554 | tree tt = TREE_TYPE (decl); | |
e086912e | 5555 | *type = build_variant_type_copy (*type); |
f8e93a2e | 5556 | DECL_ORIGINAL_TYPE (decl) = tt; |
5557 | TYPE_NAME (*type) = decl; | |
5558 | TREE_USED (*type) = TREE_USED (decl); | |
5559 | TREE_TYPE (decl) = *type; | |
5560 | } | |
5561 | else if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE)) | |
e086912e | 5562 | *type = build_variant_type_copy (*type); |
f8e93a2e | 5563 | |
5564 | TYPE_ALIGN (*type) = (1 << i) * BITS_PER_UNIT; | |
5565 | TYPE_USER_ALIGN (*type) = 1; | |
5566 | } | |
097b5c8b | 5567 | else if (! VAR_OR_FUNCTION_DECL_P (decl) |
f8e93a2e | 5568 | && TREE_CODE (decl) != FIELD_DECL) |
5569 | { | |
3cf8b391 | 5570 | error ("alignment may not be specified for %q+D", decl); |
f8e93a2e | 5571 | *no_add_attrs = true; |
5572 | } | |
097b5c8b | 5573 | else if (TREE_CODE (decl) == FUNCTION_DECL |
5574 | && DECL_ALIGN (decl) > (1 << i) * BITS_PER_UNIT) | |
5575 | { | |
5576 | if (DECL_USER_ALIGN (decl)) | |
5577 | error ("alignment for %q+D was previously specified as %d " | |
5578 | "and may not be decreased", decl, | |
5579 | DECL_ALIGN (decl) / BITS_PER_UNIT); | |
5580 | else | |
5581 | error ("alignment for %q+D must be at least %d", decl, | |
5582 | DECL_ALIGN (decl) / BITS_PER_UNIT); | |
5583 | *no_add_attrs = true; | |
5584 | } | |
f8e93a2e | 5585 | else |
5586 | { | |
5587 | DECL_ALIGN (decl) = (1 << i) * BITS_PER_UNIT; | |
5588 | DECL_USER_ALIGN (decl) = 1; | |
5589 | } | |
5590 | ||
5591 | return NULL_TREE; | |
5592 | } | |
5593 | ||
5594 | /* Handle a "weak" attribute; arguments as in | |
5595 | struct attribute_spec.handler. */ | |
5596 | ||
5597 | static tree | |
f948b309 | 5598 | handle_weak_attribute (tree *node, tree name, |
9a03a746 | 5599 | tree ARG_UNUSED (args), |
5600 | int ARG_UNUSED (flags), | |
5601 | bool * ARG_UNUSED (no_add_attrs)) | |
f8e93a2e | 5602 | { |
f948b309 | 5603 | if (TREE_CODE (*node) == FUNCTION_DECL |
059a60f3 | 5604 | && DECL_DECLARED_INLINE_P (*node)) |
5605 | { | |
5606 | error ("inline function %q+D cannot be declared weak", *node); | |
5607 | *no_add_attrs = true; | |
5608 | } | |
5609 | else if (TREE_CODE (*node) == FUNCTION_DECL | |
5610 | || TREE_CODE (*node) == VAR_DECL) | |
f948b309 | 5611 | declare_weak (*node); |
5612 | else | |
5613 | warning (OPT_Wattributes, "%qE attribute ignored", name); | |
f8e93a2e | 5614 | |
5615 | return NULL_TREE; | |
5616 | } | |
5617 | ||
5618 | /* Handle an "alias" attribute; arguments as in | |
5619 | struct attribute_spec.handler. */ | |
5620 | ||
5621 | static tree | |
1cae46be | 5622 | handle_alias_attribute (tree *node, tree name, tree args, |
9a03a746 | 5623 | int ARG_UNUSED (flags), bool *no_add_attrs) |
f8e93a2e | 5624 | { |
5625 | tree decl = *node; | |
5626 | ||
5627 | if ((TREE_CODE (decl) == FUNCTION_DECL && DECL_INITIAL (decl)) | |
0a3ecdc1 | 5628 | || (TREE_CODE (decl) != FUNCTION_DECL |
5629 | && TREE_PUBLIC (decl) && !DECL_EXTERNAL (decl)) | |
5630 | /* A static variable declaration is always a tentative definition, | |
5631 | but the alias is a non-tentative definition which overrides. */ | |
5632 | || (TREE_CODE (decl) != FUNCTION_DECL | |
5633 | && ! TREE_PUBLIC (decl) && DECL_INITIAL (decl))) | |
f8e93a2e | 5634 | { |
3cf8b391 | 5635 | error ("%q+D defined both normally and as an alias", decl); |
f8e93a2e | 5636 | *no_add_attrs = true; |
5637 | } | |
8c42f0d9 | 5638 | |
5639 | /* Note that the very first time we process a nested declaration, | |
5640 | decl_function_context will not be set. Indeed, *would* never | |
5641 | be set except for the DECL_INITIAL/DECL_EXTERNAL frobbery that | |
5642 | we do below. After such frobbery, pushdecl would set the context. | |
5643 | In any case, this is never what we want. */ | |
5644 | else if (decl_function_context (decl) == 0 && current_function_decl == NULL) | |
f8e93a2e | 5645 | { |
5646 | tree id; | |
5647 | ||
5648 | id = TREE_VALUE (args); | |
5649 | if (TREE_CODE (id) != STRING_CST) | |
5650 | { | |
07e3a3d2 | 5651 | error ("alias argument not a string"); |
f8e93a2e | 5652 | *no_add_attrs = true; |
5653 | return NULL_TREE; | |
5654 | } | |
5655 | id = get_identifier (TREE_STRING_POINTER (id)); | |
5656 | /* This counts as a use of the object pointed to. */ | |
5657 | TREE_USED (id) = 1; | |
5658 | ||
5659 | if (TREE_CODE (decl) == FUNCTION_DECL) | |
5660 | DECL_INITIAL (decl) = error_mark_node; | |
5661 | else | |
4ee9c684 | 5662 | { |
f4a30bd7 | 5663 | if (lookup_attribute ("weakref", DECL_ATTRIBUTES (decl))) |
5664 | DECL_EXTERNAL (decl) = 1; | |
5665 | else | |
5666 | DECL_EXTERNAL (decl) = 0; | |
4ee9c684 | 5667 | TREE_STATIC (decl) = 1; |
5668 | } | |
f8e93a2e | 5669 | } |
5670 | else | |
5671 | { | |
9b2d6d13 | 5672 | warning (OPT_Wattributes, "%qE attribute ignored", name); |
f8e93a2e | 5673 | *no_add_attrs = true; |
5674 | } | |
5675 | ||
5676 | return NULL_TREE; | |
5677 | } | |
5678 | ||
f4a30bd7 | 5679 | /* Handle a "weakref" attribute; arguments as in struct |
5680 | attribute_spec.handler. */ | |
5681 | ||
5682 | static tree | |
5683 | handle_weakref_attribute (tree *node, tree ARG_UNUSED (name), tree args, | |
5684 | int flags, bool *no_add_attrs) | |
5685 | { | |
5686 | tree attr = NULL_TREE; | |
5687 | ||
83852912 | 5688 | /* We must ignore the attribute when it is associated with |
5689 | local-scoped decls, since attribute alias is ignored and many | |
5690 | such symbols do not even have a DECL_WEAK field. */ | |
5691 | if (decl_function_context (*node) || current_function_decl) | |
5692 | { | |
5693 | warning (OPT_Wattributes, "%qE attribute ignored", name); | |
5694 | *no_add_attrs = true; | |
5695 | return NULL_TREE; | |
5696 | } | |
5697 | ||
f4a30bd7 | 5698 | /* The idea here is that `weakref("name")' mutates into `weakref, |
5699 | alias("name")', and weakref without arguments, in turn, | |
5700 | implicitly adds weak. */ | |
5701 | ||
5702 | if (args) | |
5703 | { | |
5704 | attr = tree_cons (get_identifier ("alias"), args, attr); | |
5705 | attr = tree_cons (get_identifier ("weakref"), NULL_TREE, attr); | |
5706 | ||
5707 | *no_add_attrs = true; | |
0a3ecdc1 | 5708 | |
5709 | decl_attributes (node, attr, flags); | |
f4a30bd7 | 5710 | } |
5711 | else | |
5712 | { | |
5713 | if (lookup_attribute ("alias", DECL_ATTRIBUTES (*node))) | |
5714 | error ("%Jweakref attribute must appear before alias attribute", | |
5715 | *node); | |
5716 | ||
0a3ecdc1 | 5717 | /* Can't call declare_weak because it wants this to be TREE_PUBLIC, |
5718 | and that isn't supported; and because it wants to add it to | |
5719 | the list of weak decls, which isn't helpful. */ | |
5720 | DECL_WEAK (*node) = 1; | |
f4a30bd7 | 5721 | } |
5722 | ||
f4a30bd7 | 5723 | return NULL_TREE; |
5724 | } | |
5725 | ||
f8e93a2e | 5726 | /* Handle an "visibility" attribute; arguments as in |
5727 | struct attribute_spec.handler. */ | |
5728 | ||
5729 | static tree | |
1cae46be | 5730 | handle_visibility_attribute (tree *node, tree name, tree args, |
9a03a746 | 5731 | int ARG_UNUSED (flags), |
4a2849cb | 5732 | bool *ARG_UNUSED (no_add_attrs)) |
f8e93a2e | 5733 | { |
5734 | tree decl = *node; | |
9c40570a | 5735 | tree id = TREE_VALUE (args); |
4a2849cb | 5736 | enum symbol_visibility vis; |
f8e93a2e | 5737 | |
b212f378 | 5738 | if (TYPE_P (*node)) |
5739 | { | |
4a2849cb | 5740 | if (TREE_CODE (*node) == ENUMERAL_TYPE) |
5741 | /* OK */; | |
5742 | else if (TREE_CODE (*node) != RECORD_TYPE && TREE_CODE (*node) != UNION_TYPE) | |
5743 | { | |
5744 | warning (OPT_Wattributes, "%qE attribute ignored on non-class types", | |
5745 | name); | |
5746 | return NULL_TREE; | |
5747 | } | |
5748 | else if (TYPE_FIELDS (*node)) | |
5749 | { | |
5750 | error ("%qE attribute ignored because %qT is already defined", | |
5751 | name, *node); | |
5752 | return NULL_TREE; | |
5753 | } | |
b212f378 | 5754 | } |
84166705 | 5755 | else if (decl_function_context (decl) != 0 || !TREE_PUBLIC (decl)) |
f8e93a2e | 5756 | { |
9b2d6d13 | 5757 | warning (OPT_Wattributes, "%qE attribute ignored", name); |
9c40570a | 5758 | return NULL_TREE; |
f8e93a2e | 5759 | } |
f8e93a2e | 5760 | |
9c40570a | 5761 | if (TREE_CODE (id) != STRING_CST) |
5762 | { | |
07e3a3d2 | 5763 | error ("visibility argument not a string"); |
9c40570a | 5764 | return NULL_TREE; |
f8e93a2e | 5765 | } |
b27ac6b5 | 5766 | |
b212f378 | 5767 | /* If this is a type, set the visibility on the type decl. */ |
5768 | if (TYPE_P (decl)) | |
5769 | { | |
5770 | decl = TYPE_NAME (decl); | |
84166705 | 5771 | if (!decl) |
a0c938f0 | 5772 | return NULL_TREE; |
e147aab3 | 5773 | if (TREE_CODE (decl) == IDENTIFIER_NODE) |
5774 | { | |
9b2d6d13 | 5775 | warning (OPT_Wattributes, "%qE attribute ignored on types", |
e147aab3 | 5776 | name); |
5777 | return NULL_TREE; | |
5778 | } | |
b212f378 | 5779 | } |
f8e93a2e | 5780 | |
9c40570a | 5781 | if (strcmp (TREE_STRING_POINTER (id), "default") == 0) |
4a2849cb | 5782 | vis = VISIBILITY_DEFAULT; |
9c40570a | 5783 | else if (strcmp (TREE_STRING_POINTER (id), "internal") == 0) |
4a2849cb | 5784 | vis = VISIBILITY_INTERNAL; |
9c40570a | 5785 | else if (strcmp (TREE_STRING_POINTER (id), "hidden") == 0) |
4a2849cb | 5786 | vis = VISIBILITY_HIDDEN; |
9c40570a | 5787 | else if (strcmp (TREE_STRING_POINTER (id), "protected") == 0) |
4a2849cb | 5788 | vis = VISIBILITY_PROTECTED; |
9c40570a | 5789 | else |
4a2849cb | 5790 | { |
5791 | error ("visibility argument must be one of \"default\", \"hidden\", \"protected\" or \"internal\""); | |
5792 | vis = VISIBILITY_DEFAULT; | |
5793 | } | |
5794 | ||
5795 | if (DECL_VISIBILITY_SPECIFIED (decl) | |
098a01e7 | 5796 | && vis != DECL_VISIBILITY (decl)) |
5797 | { | |
5798 | tree attributes = (TYPE_P (*node) | |
5799 | ? TYPE_ATTRIBUTES (*node) | |
5800 | : DECL_ATTRIBUTES (decl)); | |
5801 | if (lookup_attribute ("visibility", attributes)) | |
5802 | error ("%qD redeclared with different visibility", decl); | |
5803 | else if (TARGET_DLLIMPORT_DECL_ATTRIBUTES | |
5804 | && lookup_attribute ("dllimport", attributes)) | |
5805 | error ("%qD was declared %qs which implies default visibility", | |
5806 | decl, "dllimport"); | |
5807 | else if (TARGET_DLLIMPORT_DECL_ATTRIBUTES | |
5808 | && lookup_attribute ("dllexport", attributes)) | |
5809 | error ("%qD was declared %qs which implies default visibility", | |
5810 | decl, "dllexport"); | |
5811 | } | |
4a2849cb | 5812 | |
5813 | DECL_VISIBILITY (decl) = vis; | |
b212f378 | 5814 | DECL_VISIBILITY_SPECIFIED (decl) = 1; |
5815 | ||
4a2849cb | 5816 | /* Go ahead and attach the attribute to the node as well. This is needed |
5817 | so we can determine whether we have VISIBILITY_DEFAULT because the | |
5818 | visibility was not specified, or because it was explicitly overridden | |
5819 | from the containing scope. */ | |
9c40570a | 5820 | |
f8e93a2e | 5821 | return NULL_TREE; |
5822 | } | |
5823 | ||
3aa0c315 | 5824 | /* Determine the ELF symbol visibility for DECL, which is either a |
5825 | variable or a function. It is an error to use this function if a | |
5826 | definition of DECL is not available in this translation unit. | |
5827 | Returns true if the final visibility has been determined by this | |
5828 | function; false if the caller is free to make additional | |
5829 | modifications. */ | |
5830 | ||
5831 | bool | |
5832 | c_determine_visibility (tree decl) | |
5833 | { | |
1d8fc210 | 5834 | gcc_assert (TREE_CODE (decl) == VAR_DECL |
5835 | || TREE_CODE (decl) == FUNCTION_DECL); | |
3aa0c315 | 5836 | |
5837 | /* If the user explicitly specified the visibility with an | |
5838 | attribute, honor that. DECL_VISIBILITY will have been set during | |
5839 | the processing of the attribute. We check for an explicit | |
5840 | attribute, rather than just checking DECL_VISIBILITY_SPECIFIED, | |
5841 | to distinguish the use of an attribute from the use of a "#pragma | |
5842 | GCC visibility push(...)"; in the latter case we still want other | |
5843 | considerations to be able to overrule the #pragma. */ | |
098a01e7 | 5844 | if (lookup_attribute ("visibility", DECL_ATTRIBUTES (decl)) |
5845 | || (TARGET_DLLIMPORT_DECL_ATTRIBUTES | |
5846 | && (lookup_attribute ("dllimport", DECL_ATTRIBUTES (decl)) | |
5847 | || lookup_attribute ("dllexport", DECL_ATTRIBUTES (decl))))) | |
3aa0c315 | 5848 | return true; |
5849 | ||
4a2849cb | 5850 | /* Set default visibility to whatever the user supplied with |
5851 | visibility_specified depending on #pragma GCC visibility. */ | |
5852 | if (!DECL_VISIBILITY_SPECIFIED (decl)) | |
5853 | { | |
5854 | DECL_VISIBILITY (decl) = default_visibility; | |
5855 | DECL_VISIBILITY_SPECIFIED (decl) = visibility_options.inpragma; | |
5856 | } | |
3aa0c315 | 5857 | return false; |
5858 | } | |
5859 | ||
24dfead4 | 5860 | /* Handle an "tls_model" attribute; arguments as in |
5861 | struct attribute_spec.handler. */ | |
5862 | ||
5863 | static tree | |
1cae46be | 5864 | handle_tls_model_attribute (tree *node, tree name, tree args, |
9a03a746 | 5865 | int ARG_UNUSED (flags), bool *no_add_attrs) |
24dfead4 | 5866 | { |
1b53eb20 | 5867 | tree id; |
24dfead4 | 5868 | tree decl = *node; |
1b53eb20 | 5869 | enum tls_model kind; |
24dfead4 | 5870 | |
1b53eb20 | 5871 | *no_add_attrs = true; |
5872 | ||
5873 | if (!DECL_THREAD_LOCAL_P (decl)) | |
24dfead4 | 5874 | { |
9b2d6d13 | 5875 | warning (OPT_Wattributes, "%qE attribute ignored", name); |
1b53eb20 | 5876 | return NULL_TREE; |
24dfead4 | 5877 | } |
24dfead4 | 5878 | |
1b53eb20 | 5879 | kind = DECL_TLS_MODEL (decl); |
5880 | id = TREE_VALUE (args); | |
5881 | if (TREE_CODE (id) != STRING_CST) | |
5882 | { | |
5883 | error ("tls_model argument not a string"); | |
5884 | return NULL_TREE; | |
24dfead4 | 5885 | } |
5886 | ||
1b53eb20 | 5887 | if (!strcmp (TREE_STRING_POINTER (id), "local-exec")) |
5888 | kind = TLS_MODEL_LOCAL_EXEC; | |
5889 | else if (!strcmp (TREE_STRING_POINTER (id), "initial-exec")) | |
5890 | kind = TLS_MODEL_INITIAL_EXEC; | |
5891 | else if (!strcmp (TREE_STRING_POINTER (id), "local-dynamic")) | |
5892 | kind = optimize ? TLS_MODEL_LOCAL_DYNAMIC : TLS_MODEL_GLOBAL_DYNAMIC; | |
5893 | else if (!strcmp (TREE_STRING_POINTER (id), "global-dynamic")) | |
5894 | kind = TLS_MODEL_GLOBAL_DYNAMIC; | |
5895 | else | |
5896 | error ("tls_model argument must be one of \"local-exec\", \"initial-exec\", \"local-dynamic\" or \"global-dynamic\""); | |
5897 | ||
5898 | DECL_TLS_MODEL (decl) = kind; | |
24dfead4 | 5899 | return NULL_TREE; |
5900 | } | |
5901 | ||
f8e93a2e | 5902 | /* Handle a "no_instrument_function" attribute; arguments as in |
5903 | struct attribute_spec.handler. */ | |
5904 | ||
5905 | static tree | |
1cae46be | 5906 | handle_no_instrument_function_attribute (tree *node, tree name, |
9a03a746 | 5907 | tree ARG_UNUSED (args), |
5908 | int ARG_UNUSED (flags), | |
09347743 | 5909 | bool *no_add_attrs) |
f8e93a2e | 5910 | { |
5911 | tree decl = *node; | |
5912 | ||
5913 | if (TREE_CODE (decl) != FUNCTION_DECL) | |
5914 | { | |
b0b1af64 | 5915 | error ("%J%qE attribute applies only to functions", decl, name); |
f8e93a2e | 5916 | *no_add_attrs = true; |
5917 | } | |
5918 | else if (DECL_INITIAL (decl)) | |
5919 | { | |
b0b1af64 | 5920 | error ("%Jcan%'t set %qE attribute after definition", decl, name); |
f8e93a2e | 5921 | *no_add_attrs = true; |
5922 | } | |
5923 | else | |
5924 | DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (decl) = 1; | |
5925 | ||
5926 | return NULL_TREE; | |
5927 | } | |
5928 | ||
5929 | /* Handle a "malloc" attribute; arguments as in | |
5930 | struct attribute_spec.handler. */ | |
5931 | ||
5932 | static tree | |
9a03a746 | 5933 | handle_malloc_attribute (tree *node, tree name, tree ARG_UNUSED (args), |
5934 | int ARG_UNUSED (flags), bool *no_add_attrs) | |
f8e93a2e | 5935 | { |
a5147fca | 5936 | if (TREE_CODE (*node) == FUNCTION_DECL |
5937 | && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (*node)))) | |
f8e93a2e | 5938 | DECL_IS_MALLOC (*node) = 1; |
f8e93a2e | 5939 | else |
5940 | { | |
9b2d6d13 | 5941 | warning (OPT_Wattributes, "%qE attribute ignored", name); |
f8e93a2e | 5942 | *no_add_attrs = true; |
5943 | } | |
5944 | ||
5945 | return NULL_TREE; | |
5946 | } | |
5947 | ||
4a29c97c | 5948 | /* Handle a "alloc_size" attribute; arguments as in |
5949 | struct attribute_spec.handler. */ | |
5950 | ||
5951 | static tree | |
5952 | handle_alloc_size_attribute (tree *node, tree ARG_UNUSED (name), tree args, | |
5953 | int ARG_UNUSED (flags), bool *no_add_attrs) | |
5954 | { | |
2802826e | 5955 | unsigned arg_count = type_num_arguments (*node); |
4a29c97c | 5956 | for (; args; args = TREE_CHAIN (args)) |
5957 | { | |
5958 | tree position = TREE_VALUE (args); | |
5959 | ||
5960 | if (TREE_CODE (position) != INTEGER_CST | |
5961 | || TREE_INT_CST_HIGH (position) | |
5962 | || TREE_INT_CST_LOW (position) < 1 | |
5963 | || TREE_INT_CST_LOW (position) > arg_count ) | |
5964 | { | |
5965 | warning (OPT_Wattributes, | |
5966 | "alloc_size parameter outside range"); | |
5967 | *no_add_attrs = true; | |
5968 | return NULL_TREE; | |
5969 | } | |
5970 | } | |
5971 | return NULL_TREE; | |
5972 | } | |
5973 | ||
26d1c5ff | 5974 | /* Handle a "returns_twice" attribute; arguments as in |
5975 | struct attribute_spec.handler. */ | |
5976 | ||
5977 | static tree | |
5978 | handle_returns_twice_attribute (tree *node, tree name, tree ARG_UNUSED (args), | |
5979 | int ARG_UNUSED (flags), bool *no_add_attrs) | |
5980 | { | |
5981 | if (TREE_CODE (*node) == FUNCTION_DECL) | |
5982 | DECL_IS_RETURNS_TWICE (*node) = 1; | |
5983 | else | |
5984 | { | |
9b2d6d13 | 5985 | warning (OPT_Wattributes, "%qE attribute ignored", name); |
26d1c5ff | 5986 | *no_add_attrs = true; |
5987 | } | |
5988 | ||
5989 | return NULL_TREE; | |
5990 | } | |
5991 | ||
f8e93a2e | 5992 | /* Handle a "no_limit_stack" attribute; arguments as in |
5993 | struct attribute_spec.handler. */ | |
5994 | ||
5995 | static tree | |
1cae46be | 5996 | handle_no_limit_stack_attribute (tree *node, tree name, |
9a03a746 | 5997 | tree ARG_UNUSED (args), |
5998 | int ARG_UNUSED (flags), | |
09347743 | 5999 | bool *no_add_attrs) |
f8e93a2e | 6000 | { |
6001 | tree decl = *node; | |
6002 | ||
6003 | if (TREE_CODE (decl) != FUNCTION_DECL) | |
6004 | { | |
b0b1af64 | 6005 | error ("%J%qE attribute applies only to functions", decl, name); |
f8e93a2e | 6006 | *no_add_attrs = true; |
6007 | } | |
6008 | else if (DECL_INITIAL (decl)) | |
6009 | { | |
b0b1af64 | 6010 | error ("%Jcan%'t set %qE attribute after definition", decl, name); |
f8e93a2e | 6011 | *no_add_attrs = true; |
6012 | } | |
6013 | else | |
6014 | DECL_NO_LIMIT_STACK (decl) = 1; | |
6015 | ||
6016 | return NULL_TREE; | |
6017 | } | |
6018 | ||
6019 | /* Handle a "pure" attribute; arguments as in | |
6020 | struct attribute_spec.handler. */ | |
6021 | ||
6022 | static tree | |
9a03a746 | 6023 | handle_pure_attribute (tree *node, tree name, tree ARG_UNUSED (args), |
6024 | int ARG_UNUSED (flags), bool *no_add_attrs) | |
f8e93a2e | 6025 | { |
6026 | if (TREE_CODE (*node) == FUNCTION_DECL) | |
9c2a0c05 | 6027 | DECL_PURE_P (*node) = 1; |
f8e93a2e | 6028 | /* ??? TODO: Support types. */ |
6029 | else | |
6030 | { | |
9b2d6d13 | 6031 | warning (OPT_Wattributes, "%qE attribute ignored", name); |
f8e93a2e | 6032 | *no_add_attrs = true; |
6033 | } | |
6034 | ||
6035 | return NULL_TREE; | |
6036 | } | |
6037 | ||
fc09b200 | 6038 | /* Handle a "no vops" attribute; arguments as in |
6039 | struct attribute_spec.handler. */ | |
6040 | ||
6041 | static tree | |
6042 | handle_novops_attribute (tree *node, tree ARG_UNUSED (name), | |
6043 | tree ARG_UNUSED (args), int ARG_UNUSED (flags), | |
6044 | bool *ARG_UNUSED (no_add_attrs)) | |
6045 | { | |
6046 | gcc_assert (TREE_CODE (*node) == FUNCTION_DECL); | |
6047 | DECL_IS_NOVOPS (*node) = 1; | |
6048 | return NULL_TREE; | |
6049 | } | |
6050 | ||
f8e93a2e | 6051 | /* Handle a "deprecated" attribute; arguments as in |
6052 | struct attribute_spec.handler. */ | |
1cae46be | 6053 | |
f8e93a2e | 6054 | static tree |
1cae46be | 6055 | handle_deprecated_attribute (tree *node, tree name, |
9a03a746 | 6056 | tree ARG_UNUSED (args), int flags, |
09347743 | 6057 | bool *no_add_attrs) |
f8e93a2e | 6058 | { |
6059 | tree type = NULL_TREE; | |
6060 | int warn = 0; | |
782858b8 | 6061 | tree what = NULL_TREE; |
1cae46be | 6062 | |
f8e93a2e | 6063 | if (DECL_P (*node)) |
6064 | { | |
6065 | tree decl = *node; | |
6066 | type = TREE_TYPE (decl); | |
1cae46be | 6067 | |
f8e93a2e | 6068 | if (TREE_CODE (decl) == TYPE_DECL |
6069 | || TREE_CODE (decl) == PARM_DECL | |
6070 | || TREE_CODE (decl) == VAR_DECL | |
6071 | || TREE_CODE (decl) == FUNCTION_DECL | |
6072 | || TREE_CODE (decl) == FIELD_DECL) | |
6073 | TREE_DEPRECATED (decl) = 1; | |
6074 | else | |
6075 | warn = 1; | |
6076 | } | |
6077 | else if (TYPE_P (*node)) | |
6078 | { | |
6079 | if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE)) | |
e086912e | 6080 | *node = build_variant_type_copy (*node); |
f8e93a2e | 6081 | TREE_DEPRECATED (*node) = 1; |
6082 | type = *node; | |
6083 | } | |
6084 | else | |
6085 | warn = 1; | |
1cae46be | 6086 | |
f8e93a2e | 6087 | if (warn) |
6088 | { | |
6089 | *no_add_attrs = true; | |
6090 | if (type && TYPE_NAME (type)) | |
6091 | { | |
6092 | if (TREE_CODE (TYPE_NAME (type)) == IDENTIFIER_NODE) | |
782858b8 | 6093 | what = TYPE_NAME (*node); |
f8e93a2e | 6094 | else if (TREE_CODE (TYPE_NAME (type)) == TYPE_DECL |
6095 | && DECL_NAME (TYPE_NAME (type))) | |
782858b8 | 6096 | what = DECL_NAME (TYPE_NAME (type)); |
f8e93a2e | 6097 | } |
6098 | if (what) | |
9b2d6d13 | 6099 | warning (OPT_Wattributes, "%qE attribute ignored for %qE", name, what); |
f8e93a2e | 6100 | else |
9b2d6d13 | 6101 | warning (OPT_Wattributes, "%qE attribute ignored", name); |
f8e93a2e | 6102 | } |
6103 | ||
6104 | return NULL_TREE; | |
6105 | } | |
6106 | ||
f8e93a2e | 6107 | /* Handle a "vector_size" attribute; arguments as in |
6108 | struct attribute_spec.handler. */ | |
6109 | ||
6110 | static tree | |
1cae46be | 6111 | handle_vector_size_attribute (tree *node, tree name, tree args, |
9a03a746 | 6112 | int ARG_UNUSED (flags), |
09347743 | 6113 | bool *no_add_attrs) |
f8e93a2e | 6114 | { |
6115 | unsigned HOST_WIDE_INT vecsize, nunits; | |
83e2a11b | 6116 | enum machine_mode orig_mode; |
4917c376 | 6117 | tree type = *node, new_type, size; |
f8e93a2e | 6118 | |
6119 | *no_add_attrs = true; | |
6120 | ||
4917c376 | 6121 | size = TREE_VALUE (args); |
4917c376 | 6122 | |
84166705 | 6123 | if (!host_integerp (size, 1)) |
f8e93a2e | 6124 | { |
9b2d6d13 | 6125 | warning (OPT_Wattributes, "%qE attribute ignored", name); |
f8e93a2e | 6126 | return NULL_TREE; |
6127 | } | |
6128 | ||
6129 | /* Get the vector size (in bytes). */ | |
4917c376 | 6130 | vecsize = tree_low_cst (size, 1); |
f8e93a2e | 6131 | |
6132 | /* We need to provide for vector pointers, vector arrays, and | |
6133 | functions returning vectors. For example: | |
6134 | ||
6135 | __attribute__((vector_size(16))) short *foo; | |
6136 | ||
6137 | In this case, the mode is SI, but the type being modified is | |
6138 | HI, so we need to look further. */ | |
6139 | ||
6140 | while (POINTER_TYPE_P (type) | |
6141 | || TREE_CODE (type) == FUNCTION_TYPE | |
5bfb0742 | 6142 | || TREE_CODE (type) == METHOD_TYPE |
2cb0e5d9 | 6143 | || TREE_CODE (type) == ARRAY_TYPE |
6144 | || TREE_CODE (type) == OFFSET_TYPE) | |
f8e93a2e | 6145 | type = TREE_TYPE (type); |
6146 | ||
6147 | /* Get the mode of the type being modified. */ | |
6148 | orig_mode = TYPE_MODE (type); | |
6149 | ||
2cb0e5d9 | 6150 | if ((!INTEGRAL_TYPE_P (type) |
6151 | && !SCALAR_FLOAT_TYPE_P (type) | |
6152 | && !FIXED_POINT_TYPE_P (type)) | |
cee7491d | 6153 | || (!SCALAR_FLOAT_MODE_P (orig_mode) |
9421ebb9 | 6154 | && GET_MODE_CLASS (orig_mode) != MODE_INT |
6155 | && !ALL_SCALAR_FIXED_POINT_MODE_P (orig_mode)) | |
84166705 | 6156 | || !host_integerp (TYPE_SIZE_UNIT (type), 1)) |
f8e93a2e | 6157 | { |
782858b8 | 6158 | error ("invalid vector type for attribute %qE", name); |
f8e93a2e | 6159 | return NULL_TREE; |
6160 | } | |
6161 | ||
39cc3e6d | 6162 | if (vecsize % tree_low_cst (TYPE_SIZE_UNIT (type), 1)) |
6163 | { | |
6164 | error ("vector size not an integral multiple of component size"); | |
6165 | return NULL; | |
6166 | } | |
6167 | ||
6168 | if (vecsize == 0) | |
6169 | { | |
6170 | error ("zero vector size"); | |
6171 | return NULL; | |
6172 | } | |
6173 | ||
f8e93a2e | 6174 | /* Calculate how many units fit in the vector. */ |
6175 | nunits = vecsize / tree_low_cst (TYPE_SIZE_UNIT (type), 1); | |
83e2a11b | 6176 | if (nunits & (nunits - 1)) |
f8e93a2e | 6177 | { |
83e2a11b | 6178 | error ("number of components of the vector not a power of two"); |
f8e93a2e | 6179 | return NULL_TREE; |
6180 | } | |
6181 | ||
83e2a11b | 6182 | new_type = build_vector_type (type, nunits); |
f8e93a2e | 6183 | |
6184 | /* Build back pointers if needed. */ | |
d991e6e8 | 6185 | *node = lang_hooks.types.reconstruct_complex_type (*node, new_type); |
f8e93a2e | 6186 | |
6187 | return NULL_TREE; | |
6188 | } | |
6189 | ||
dbf6c367 | 6190 | /* Handle the "nonnull" attribute. */ |
6191 | static tree | |
9a03a746 | 6192 | handle_nonnull_attribute (tree *node, tree ARG_UNUSED (name), |
6193 | tree args, int ARG_UNUSED (flags), | |
09347743 | 6194 | bool *no_add_attrs) |
dbf6c367 | 6195 | { |
6196 | tree type = *node; | |
6197 | unsigned HOST_WIDE_INT attr_arg_num; | |
6198 | ||
6199 | /* If no arguments are specified, all pointer arguments should be | |
d716ce75 | 6200 | non-null. Verify a full prototype is given so that the arguments |
dbf6c367 | 6201 | will have the correct types when we actually check them later. */ |
84166705 | 6202 | if (!args) |
dbf6c367 | 6203 | { |
84166705 | 6204 | if (!TYPE_ARG_TYPES (type)) |
dbf6c367 | 6205 | { |
6206 | error ("nonnull attribute without arguments on a non-prototype"); | |
4ee9c684 | 6207 | *no_add_attrs = true; |
dbf6c367 | 6208 | } |
6209 | return NULL_TREE; | |
6210 | } | |
6211 | ||
6212 | /* Argument list specified. Verify that each argument number references | |
6213 | a pointer argument. */ | |
6214 | for (attr_arg_num = 1; args; args = TREE_CHAIN (args)) | |
6215 | { | |
6216 | tree argument; | |
4ee9c684 | 6217 | unsigned HOST_WIDE_INT arg_num = 0, ck_num; |
dbf6c367 | 6218 | |
84166705 | 6219 | if (!get_nonnull_operand (TREE_VALUE (args), &arg_num)) |
dbf6c367 | 6220 | { |
07e3a3d2 | 6221 | error ("nonnull argument has invalid operand number (argument %lu)", |
dbf6c367 | 6222 | (unsigned long) attr_arg_num); |
6223 | *no_add_attrs = true; | |
6224 | return NULL_TREE; | |
6225 | } | |
6226 | ||
6227 | argument = TYPE_ARG_TYPES (type); | |
6228 | if (argument) | |
6229 | { | |
6230 | for (ck_num = 1; ; ck_num++) | |
6231 | { | |
84166705 | 6232 | if (!argument || ck_num == arg_num) |
dbf6c367 | 6233 | break; |
6234 | argument = TREE_CHAIN (argument); | |
6235 | } | |
6236 | ||
84166705 | 6237 | if (!argument |
dbf6c367 | 6238 | || TREE_CODE (TREE_VALUE (argument)) == VOID_TYPE) |
6239 | { | |
07e3a3d2 | 6240 | error ("nonnull argument with out-of-range operand number (argument %lu, operand %lu)", |
dbf6c367 | 6241 | (unsigned long) attr_arg_num, (unsigned long) arg_num); |
6242 | *no_add_attrs = true; | |
6243 | return NULL_TREE; | |
6244 | } | |
6245 | ||
4ee9c684 | 6246 | if (TREE_CODE (TREE_VALUE (argument)) != POINTER_TYPE) |
dbf6c367 | 6247 | { |
07e3a3d2 | 6248 | error ("nonnull argument references non-pointer operand (argument %lu, operand %lu)", |
dbf6c367 | 6249 | (unsigned long) attr_arg_num, (unsigned long) arg_num); |
6250 | *no_add_attrs = true; | |
6251 | return NULL_TREE; | |
6252 | } | |
6253 | } | |
6254 | } | |
6255 | ||
6256 | return NULL_TREE; | |
6257 | } | |
6258 | ||
6259 | /* Check the argument list of a function call for null in argument slots | |
d01f58f9 | 6260 | that are marked as requiring a non-null pointer argument. The NARGS |
6261 | arguments are passed in the array ARGARRAY. | |
6262 | */ | |
dbf6c367 | 6263 | |
6264 | static void | |
d01f58f9 | 6265 | check_function_nonnull (tree attrs, int nargs, tree *argarray) |
dbf6c367 | 6266 | { |
d01f58f9 | 6267 | tree a, args; |
6268 | int i; | |
dbf6c367 | 6269 | |
6270 | for (a = attrs; a; a = TREE_CHAIN (a)) | |
6271 | { | |
6272 | if (is_attribute_p ("nonnull", TREE_PURPOSE (a))) | |
6273 | { | |
4ee9c684 | 6274 | args = TREE_VALUE (a); |
dbf6c367 | 6275 | |
4ee9c684 | 6276 | /* Walk the argument list. If we encounter an argument number we |
6277 | should check for non-null, do it. If the attribute has no args, | |
6278 | then every pointer argument is checked (in which case the check | |
dbf6c367 | 6279 | for pointer type is done in check_nonnull_arg). */ |
d01f58f9 | 6280 | for (i = 0; i < nargs; i++) |
4ee9c684 | 6281 | { |
d01f58f9 | 6282 | if (!args || nonnull_check_p (args, i + 1)) |
e4603171 | 6283 | check_function_arguments_recurse (check_nonnull_arg, NULL, |
d01f58f9 | 6284 | argarray[i], |
6285 | i + 1); | |
4ee9c684 | 6286 | } |
dbf6c367 | 6287 | } |
6288 | } | |
6289 | } | |
6290 | ||
50ca527f | 6291 | /* Check that the Nth argument of a function call (counting backwards |
d01f58f9 | 6292 | from the end) is a (pointer)0. The NARGS arguments are passed in the |
6293 | array ARGARRAY. */ | |
bf6c8de0 | 6294 | |
6295 | static void | |
d01f58f9 | 6296 | check_function_sentinel (tree attrs, int nargs, tree *argarray, tree typelist) |
bf6c8de0 | 6297 | { |
6298 | tree attr = lookup_attribute ("sentinel", attrs); | |
6299 | ||
6300 | if (attr) | |
6301 | { | |
d01f58f9 | 6302 | int len = 0; |
6303 | int pos = 0; | |
6304 | tree sentinel; | |
a0c938f0 | 6305 | |
d01f58f9 | 6306 | /* Skip over the named arguments. */ |
6307 | while (typelist && len < nargs) | |
a0c938f0 | 6308 | { |
d01f58f9 | 6309 | typelist = TREE_CHAIN (typelist); |
6310 | len++; | |
6311 | } | |
50ca527f | 6312 | |
d01f58f9 | 6313 | if (TREE_VALUE (attr)) |
6314 | { | |
6315 | tree p = TREE_VALUE (TREE_VALUE (attr)); | |
6316 | pos = TREE_INT_CST_LOW (p); | |
6317 | } | |
50ca527f | 6318 | |
d01f58f9 | 6319 | /* The sentinel must be one of the varargs, i.e. |
6320 | in position >= the number of fixed arguments. */ | |
6321 | if ((nargs - 1 - pos) < len) | |
6322 | { | |
6323 | warning (OPT_Wformat, | |
6324 | "not enough variable arguments to fit a sentinel"); | |
6325 | return; | |
bf6c8de0 | 6326 | } |
d01f58f9 | 6327 | |
6328 | /* Validate the sentinel. */ | |
6329 | sentinel = argarray[nargs - 1 - pos]; | |
6330 | if ((!POINTER_TYPE_P (TREE_TYPE (sentinel)) | |
6331 | || !integer_zerop (sentinel)) | |
6332 | /* Although __null (in C++) is only an integer we allow it | |
6333 | nevertheless, as we are guaranteed that it's exactly | |
6334 | as wide as a pointer, and we don't want to force | |
6335 | users to cast the NULL they have written there. | |
6336 | We warn with -Wstrict-null-sentinel, though. */ | |
6337 | && (warn_strict_null_sentinel || null_node != sentinel)) | |
6338 | warning (OPT_Wformat, "missing sentinel in function call"); | |
bf6c8de0 | 6339 | } |
6340 | } | |
6341 | ||
dbf6c367 | 6342 | /* Helper for check_function_nonnull; given a list of operands which |
6343 | must be non-null in ARGS, determine if operand PARAM_NUM should be | |
6344 | checked. */ | |
6345 | ||
6346 | static bool | |
1cae46be | 6347 | nonnull_check_p (tree args, unsigned HOST_WIDE_INT param_num) |
dbf6c367 | 6348 | { |
4ee9c684 | 6349 | unsigned HOST_WIDE_INT arg_num = 0; |
dbf6c367 | 6350 | |
6351 | for (; args; args = TREE_CHAIN (args)) | |
6352 | { | |
231bd014 | 6353 | bool found = get_nonnull_operand (TREE_VALUE (args), &arg_num); |
6354 | ||
6355 | gcc_assert (found); | |
dbf6c367 | 6356 | |
6357 | if (arg_num == param_num) | |
6358 | return true; | |
6359 | } | |
6360 | return false; | |
6361 | } | |
6362 | ||
6363 | /* Check that the function argument PARAM (which is operand number | |
6364 | PARAM_NUM) is non-null. This is called by check_function_nonnull | |
6365 | via check_function_arguments_recurse. */ | |
6366 | ||
6367 | static void | |
9a03a746 | 6368 | check_nonnull_arg (void * ARG_UNUSED (ctx), tree param, |
1cae46be | 6369 | unsigned HOST_WIDE_INT param_num) |
dbf6c367 | 6370 | { |
6371 | /* Just skip checking the argument if it's not a pointer. This can | |
6372 | happen if the "nonnull" attribute was given without an operand | |
6373 | list (which means to check every pointer argument). */ | |
6374 | ||
6375 | if (TREE_CODE (TREE_TYPE (param)) != POINTER_TYPE) | |
6376 | return; | |
6377 | ||
6378 | if (integer_zerop (param)) | |
155b601b | 6379 | warning (OPT_Wnonnull, "null argument where non-null required " |
6380 | "(argument %lu)", (unsigned long) param_num); | |
dbf6c367 | 6381 | } |
6382 | ||
6383 | /* Helper for nonnull attribute handling; fetch the operand number | |
6384 | from the attribute argument list. */ | |
6385 | ||
6386 | static bool | |
1cae46be | 6387 | get_nonnull_operand (tree arg_num_expr, unsigned HOST_WIDE_INT *valp) |
dbf6c367 | 6388 | { |
67409385 | 6389 | /* Verify the arg number is a constant. */ |
dbf6c367 | 6390 | if (TREE_CODE (arg_num_expr) != INTEGER_CST |
6391 | || TREE_INT_CST_HIGH (arg_num_expr) != 0) | |
6392 | return false; | |
6393 | ||
6394 | *valp = TREE_INT_CST_LOW (arg_num_expr); | |
6395 | return true; | |
6396 | } | |
fa987697 | 6397 | |
6398 | /* Handle a "nothrow" attribute; arguments as in | |
6399 | struct attribute_spec.handler. */ | |
6400 | ||
6401 | static tree | |
9a03a746 | 6402 | handle_nothrow_attribute (tree *node, tree name, tree ARG_UNUSED (args), |
6403 | int ARG_UNUSED (flags), bool *no_add_attrs) | |
fa987697 | 6404 | { |
6405 | if (TREE_CODE (*node) == FUNCTION_DECL) | |
6406 | TREE_NOTHROW (*node) = 1; | |
6407 | /* ??? TODO: Support types. */ | |
6408 | else | |
6409 | { | |
9b2d6d13 | 6410 | warning (OPT_Wattributes, "%qE attribute ignored", name); |
fa987697 | 6411 | *no_add_attrs = true; |
6412 | } | |
6413 | ||
6414 | return NULL_TREE; | |
6415 | } | |
7acb29a3 | 6416 | |
6417 | /* Handle a "cleanup" attribute; arguments as in | |
6418 | struct attribute_spec.handler. */ | |
6419 | ||
6420 | static tree | |
1cae46be | 6421 | handle_cleanup_attribute (tree *node, tree name, tree args, |
9a03a746 | 6422 | int ARG_UNUSED (flags), bool *no_add_attrs) |
7acb29a3 | 6423 | { |
6424 | tree decl = *node; | |
6425 | tree cleanup_id, cleanup_decl; | |
6426 | ||
6427 | /* ??? Could perhaps support cleanups on TREE_STATIC, much like we do | |
6428 | for global destructors in C++. This requires infrastructure that | |
6429 | we don't have generically at the moment. It's also not a feature | |
6430 | we'd be missing too much, since we do have attribute constructor. */ | |
6431 | if (TREE_CODE (decl) != VAR_DECL || TREE_STATIC (decl)) | |
6432 | { | |
9b2d6d13 | 6433 | warning (OPT_Wattributes, "%qE attribute ignored", name); |
7acb29a3 | 6434 | *no_add_attrs = true; |
6435 | return NULL_TREE; | |
6436 | } | |
6437 | ||
6438 | /* Verify that the argument is a function in scope. */ | |
6439 | /* ??? We could support pointers to functions here as well, if | |
6440 | that was considered desirable. */ | |
6441 | cleanup_id = TREE_VALUE (args); | |
6442 | if (TREE_CODE (cleanup_id) != IDENTIFIER_NODE) | |
6443 | { | |
07e3a3d2 | 6444 | error ("cleanup argument not an identifier"); |
7acb29a3 | 6445 | *no_add_attrs = true; |
6446 | return NULL_TREE; | |
6447 | } | |
d1c41717 | 6448 | cleanup_decl = lookup_name (cleanup_id); |
7acb29a3 | 6449 | if (!cleanup_decl || TREE_CODE (cleanup_decl) != FUNCTION_DECL) |
6450 | { | |
07e3a3d2 | 6451 | error ("cleanup argument not a function"); |
7acb29a3 | 6452 | *no_add_attrs = true; |
6453 | return NULL_TREE; | |
6454 | } | |
6455 | ||
1cae46be | 6456 | /* That the function has proper type is checked with the |
7acb29a3 | 6457 | eventual call to build_function_call. */ |
6458 | ||
6459 | return NULL_TREE; | |
6460 | } | |
8a8cdb8d | 6461 | |
6462 | /* Handle a "warn_unused_result" attribute. No special handling. */ | |
6463 | ||
6464 | static tree | |
6465 | handle_warn_unused_result_attribute (tree *node, tree name, | |
9a03a746 | 6466 | tree ARG_UNUSED (args), |
6467 | int ARG_UNUSED (flags), bool *no_add_attrs) | |
8a8cdb8d | 6468 | { |
6469 | /* Ignore the attribute for functions not returning any value. */ | |
6470 | if (VOID_TYPE_P (TREE_TYPE (*node))) | |
6471 | { | |
9b2d6d13 | 6472 | warning (OPT_Wattributes, "%qE attribute ignored", name); |
8a8cdb8d | 6473 | *no_add_attrs = true; |
6474 | } | |
6475 | ||
6476 | return NULL_TREE; | |
6477 | } | |
bf6c8de0 | 6478 | |
6479 | /* Handle a "sentinel" attribute. */ | |
6480 | ||
6481 | static tree | |
50ca527f | 6482 | handle_sentinel_attribute (tree *node, tree name, tree args, |
bf6c8de0 | 6483 | int ARG_UNUSED (flags), bool *no_add_attrs) |
6484 | { | |
6485 | tree params = TYPE_ARG_TYPES (*node); | |
6486 | ||
6487 | if (!params) | |
6488 | { | |
9b2d6d13 | 6489 | warning (OPT_Wattributes, |
6490 | "%qE attribute requires prototypes with named arguments", name); | |
bf6c8de0 | 6491 | *no_add_attrs = true; |
bf6c8de0 | 6492 | } |
50ca527f | 6493 | else |
6494 | { | |
6495 | while (TREE_CHAIN (params)) | |
6496 | params = TREE_CHAIN (params); | |
bf6c8de0 | 6497 | |
50ca527f | 6498 | if (VOID_TYPE_P (TREE_VALUE (params))) |
a0c938f0 | 6499 | { |
9b2d6d13 | 6500 | warning (OPT_Wattributes, |
6501 | "%qE attribute only applies to variadic functions", name); | |
50ca527f | 6502 | *no_add_attrs = true; |
6503 | } | |
6504 | } | |
a0c938f0 | 6505 | |
50ca527f | 6506 | if (args) |
bf6c8de0 | 6507 | { |
50ca527f | 6508 | tree position = TREE_VALUE (args); |
6509 | ||
50ca527f | 6510 | if (TREE_CODE (position) != INTEGER_CST) |
a0c938f0 | 6511 | { |
01b54db5 | 6512 | warning (OPT_Wattributes, |
6513 | "requested position is not an integer constant"); | |
50ca527f | 6514 | *no_add_attrs = true; |
6515 | } | |
6516 | else | |
a0c938f0 | 6517 | { |
50ca527f | 6518 | if (tree_int_cst_lt (position, integer_zero_node)) |
6519 | { | |
01b54db5 | 6520 | warning (OPT_Wattributes, |
6521 | "requested position is less than zero"); | |
50ca527f | 6522 | *no_add_attrs = true; |
6523 | } | |
6524 | } | |
bf6c8de0 | 6525 | } |
a0c938f0 | 6526 | |
bf6c8de0 | 6527 | return NULL_TREE; |
6528 | } | |
b5c26b42 | 6529 | |
6530 | /* Handle a "type_generic" attribute. */ | |
6531 | ||
6532 | static tree | |
6533 | handle_type_generic_attribute (tree *node, tree ARG_UNUSED (name), | |
6534 | tree ARG_UNUSED (args), int ARG_UNUSED (flags), | |
6535 | bool * ARG_UNUSED (no_add_attrs)) | |
6536 | { | |
19fbe3a4 | 6537 | tree params; |
6538 | ||
6539 | /* Ensure we have a function type. */ | |
6540 | gcc_assert (TREE_CODE (*node) == FUNCTION_TYPE); | |
6541 | ||
6542 | params = TYPE_ARG_TYPES (*node); | |
6543 | while (params && ! VOID_TYPE_P (TREE_VALUE (params))) | |
6544 | params = TREE_CHAIN (params); | |
6545 | ||
6546 | /* Ensure we have a variadic function. */ | |
6547 | gcc_assert (!params); | |
b5c26b42 | 6548 | |
6549 | return NULL_TREE; | |
6550 | } | |
dbf6c367 | 6551 | \f |
d01f58f9 | 6552 | /* Check for valid arguments being passed to a function. |
6553 | ATTRS is a list of attributes. There are NARGS arguments in the array | |
6554 | ARGARRAY. TYPELIST is the list of argument types for the function. | |
6555 | */ | |
dbf6c367 | 6556 | void |
d01f58f9 | 6557 | check_function_arguments (tree attrs, int nargs, tree *argarray, tree typelist) |
dbf6c367 | 6558 | { |
6559 | /* Check for null being passed in a pointer argument that must be | |
6560 | non-null. We also need to do this if format checking is enabled. */ | |
6561 | ||
6562 | if (warn_nonnull) | |
d01f58f9 | 6563 | check_function_nonnull (attrs, nargs, argarray); |
dbf6c367 | 6564 | |
6565 | /* Check for errors in format strings. */ | |
6566 | ||
95c90e04 | 6567 | if (warn_format || warn_missing_format_attribute) |
d01f58f9 | 6568 | check_function_format (attrs, nargs, argarray); |
95c90e04 | 6569 | |
6570 | if (warn_format) | |
d01f58f9 | 6571 | check_function_sentinel (attrs, nargs, argarray, typelist); |
dbf6c367 | 6572 | } |
6573 | ||
6574 | /* Generic argument checking recursion routine. PARAM is the argument to | |
6575 | be checked. PARAM_NUM is the number of the argument. CALLBACK is invoked | |
6576 | once the argument is resolved. CTX is context for the callback. */ | |
6577 | void | |
1cae46be | 6578 | check_function_arguments_recurse (void (*callback) |
6579 | (void *, tree, unsigned HOST_WIDE_INT), | |
6580 | void *ctx, tree param, | |
6581 | unsigned HOST_WIDE_INT param_num) | |
dbf6c367 | 6582 | { |
72dd6141 | 6583 | if (CONVERT_EXPR_P (param) |
c44afe23 | 6584 | && (TYPE_PRECISION (TREE_TYPE (param)) |
6585 | == TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (param, 0))))) | |
dbf6c367 | 6586 | { |
6587 | /* Strip coercion. */ | |
6588 | check_function_arguments_recurse (callback, ctx, | |
4ee9c684 | 6589 | TREE_OPERAND (param, 0), param_num); |
dbf6c367 | 6590 | return; |
6591 | } | |
6592 | ||
6593 | if (TREE_CODE (param) == CALL_EXPR) | |
6594 | { | |
c2f47e15 | 6595 | tree type = TREE_TYPE (TREE_TYPE (CALL_EXPR_FN (param))); |
dbf6c367 | 6596 | tree attrs; |
6597 | bool found_format_arg = false; | |
6598 | ||
6599 | /* See if this is a call to a known internationalization function | |
6600 | that modifies a format arg. Such a function may have multiple | |
6601 | format_arg attributes (for example, ngettext). */ | |
6602 | ||
6603 | for (attrs = TYPE_ATTRIBUTES (type); | |
6604 | attrs; | |
6605 | attrs = TREE_CHAIN (attrs)) | |
6606 | if (is_attribute_p ("format_arg", TREE_PURPOSE (attrs))) | |
6607 | { | |
c2f47e15 | 6608 | tree inner_arg; |
dbf6c367 | 6609 | tree format_num_expr; |
6610 | int format_num; | |
6611 | int i; | |
c2f47e15 | 6612 | call_expr_arg_iterator iter; |
dbf6c367 | 6613 | |
6614 | /* Extract the argument number, which was previously checked | |
6615 | to be valid. */ | |
6616 | format_num_expr = TREE_VALUE (TREE_VALUE (attrs)); | |
dbf6c367 | 6617 | |
231bd014 | 6618 | gcc_assert (TREE_CODE (format_num_expr) == INTEGER_CST |
6619 | && !TREE_INT_CST_HIGH (format_num_expr)); | |
dbf6c367 | 6620 | |
6621 | format_num = TREE_INT_CST_LOW (format_num_expr); | |
6622 | ||
c2f47e15 | 6623 | for (inner_arg = first_call_expr_arg (param, &iter), i = 1; |
6624 | inner_arg != 0; | |
6625 | inner_arg = next_call_expr_arg (&iter), i++) | |
dbf6c367 | 6626 | if (i == format_num) |
6627 | { | |
6628 | check_function_arguments_recurse (callback, ctx, | |
c2f47e15 | 6629 | inner_arg, param_num); |
dbf6c367 | 6630 | found_format_arg = true; |
6631 | break; | |
6632 | } | |
6633 | } | |
6634 | ||
6635 | /* If we found a format_arg attribute and did a recursive check, | |
6636 | we are done with checking this argument. Otherwise, we continue | |
6637 | and this will be considered a non-literal. */ | |
6638 | if (found_format_arg) | |
6639 | return; | |
6640 | } | |
6641 | ||
6642 | if (TREE_CODE (param) == COND_EXPR) | |
6643 | { | |
6644 | /* Check both halves of the conditional expression. */ | |
6645 | check_function_arguments_recurse (callback, ctx, | |
4ee9c684 | 6646 | TREE_OPERAND (param, 1), param_num); |
dbf6c367 | 6647 | check_function_arguments_recurse (callback, ctx, |
4ee9c684 | 6648 | TREE_OPERAND (param, 2), param_num); |
dbf6c367 | 6649 | return; |
6650 | } | |
6651 | ||
6652 | (*callback) (ctx, param, param_num); | |
6653 | } | |
1f3233d1 | 6654 | |
d43cee80 | 6655 | /* Checks the number of arguments NARGS against the required number |
6656 | REQUIRED and issues an error if there is a mismatch. Returns true | |
6657 | if the number of arguments is correct, otherwise false. */ | |
6658 | ||
6659 | static bool | |
6660 | validate_nargs (tree fndecl, int nargs, int required) | |
6661 | { | |
6662 | if (nargs < required) | |
6663 | { | |
6664 | error ("not enough arguments to function %qE", fndecl); | |
6665 | return false; | |
6666 | } | |
6667 | else if (nargs > required) | |
6668 | { | |
6669 | error ("too many arguments to function %qE", fndecl); | |
6670 | return false; | |
6671 | } | |
6672 | return true; | |
6673 | } | |
6674 | ||
6675 | /* Verifies the NARGS arguments ARGS to the builtin function FNDECL. | |
6676 | Returns false if there was an error, otherwise true. */ | |
6677 | ||
6678 | bool | |
6679 | check_builtin_function_arguments (tree fndecl, int nargs, tree *args) | |
6680 | { | |
6681 | if (!DECL_BUILT_IN (fndecl) | |
6682 | || DECL_BUILT_IN_CLASS (fndecl) != BUILT_IN_NORMAL) | |
6683 | return true; | |
6684 | ||
6685 | switch (DECL_FUNCTION_CODE (fndecl)) | |
6686 | { | |
6687 | case BUILT_IN_CONSTANT_P: | |
6688 | return validate_nargs (fndecl, nargs, 1); | |
6689 | ||
6690 | case BUILT_IN_ISFINITE: | |
6691 | case BUILT_IN_ISINF: | |
c319d56a | 6692 | case BUILT_IN_ISINF_SIGN: |
d43cee80 | 6693 | case BUILT_IN_ISNAN: |
6694 | case BUILT_IN_ISNORMAL: | |
6695 | if (validate_nargs (fndecl, nargs, 1)) | |
6696 | { | |
6697 | if (TREE_CODE (TREE_TYPE (args[0])) != REAL_TYPE) | |
6698 | { | |
6699 | error ("non-floating-point argument in call to " | |
6700 | "function %qE", fndecl); | |
6701 | return false; | |
6702 | } | |
6703 | return true; | |
6704 | } | |
6705 | return false; | |
6706 | ||
6707 | case BUILT_IN_ISGREATER: | |
6708 | case BUILT_IN_ISGREATEREQUAL: | |
6709 | case BUILT_IN_ISLESS: | |
6710 | case BUILT_IN_ISLESSEQUAL: | |
6711 | case BUILT_IN_ISLESSGREATER: | |
6712 | case BUILT_IN_ISUNORDERED: | |
6713 | if (validate_nargs (fndecl, nargs, 2)) | |
6714 | { | |
6715 | enum tree_code code0, code1; | |
6716 | code0 = TREE_CODE (TREE_TYPE (args[0])); | |
6717 | code1 = TREE_CODE (TREE_TYPE (args[1])); | |
6718 | if (!((code0 == REAL_TYPE && code1 == REAL_TYPE) | |
6719 | || (code0 == REAL_TYPE && code1 == INTEGER_TYPE) | |
6720 | || (code0 == INTEGER_TYPE && code1 == REAL_TYPE))) | |
6721 | { | |
6722 | error ("non-floating-point arguments in call to " | |
6723 | "function %qE", fndecl); | |
6724 | return false; | |
6725 | } | |
6726 | return true; | |
6727 | } | |
6728 | return false; | |
6729 | ||
19fbe3a4 | 6730 | case BUILT_IN_FPCLASSIFY: |
6731 | if (validate_nargs (fndecl, nargs, 6)) | |
6732 | { | |
6733 | unsigned i; | |
6734 | ||
6735 | for (i=0; i<5; i++) | |
6736 | if (TREE_CODE (args[i]) != INTEGER_CST) | |
6737 | { | |
6738 | error ("non-const integer argument %u in call to function %qE", | |
6739 | i+1, fndecl); | |
6740 | return false; | |
6741 | } | |
6742 | ||
6743 | if (TREE_CODE (TREE_TYPE (args[5])) != REAL_TYPE) | |
6744 | { | |
6745 | error ("non-floating-point argument in call to function %qE", | |
6746 | fndecl); | |
6747 | return false; | |
6748 | } | |
6749 | return true; | |
6750 | } | |
6751 | return false; | |
6752 | ||
d43cee80 | 6753 | default: |
6754 | return true; | |
6755 | } | |
6756 | } | |
6757 | ||
860251be | 6758 | /* Function to help qsort sort FIELD_DECLs by name order. */ |
6759 | ||
6760 | int | |
6761 | field_decl_cmp (const void *x_p, const void *y_p) | |
6762 | { | |
4fd61bc6 | 6763 | const tree *const x = (const tree *const) x_p; |
6764 | const tree *const y = (const tree *const) y_p; | |
6765 | ||
860251be | 6766 | if (DECL_NAME (*x) == DECL_NAME (*y)) |
6767 | /* A nontype is "greater" than a type. */ | |
6768 | return (TREE_CODE (*y) == TYPE_DECL) - (TREE_CODE (*x) == TYPE_DECL); | |
6769 | if (DECL_NAME (*x) == NULL_TREE) | |
6770 | return -1; | |
6771 | if (DECL_NAME (*y) == NULL_TREE) | |
6772 | return 1; | |
6773 | if (DECL_NAME (*x) < DECL_NAME (*y)) | |
6774 | return -1; | |
6775 | return 1; | |
6776 | } | |
6777 | ||
6778 | static struct { | |
6779 | gt_pointer_operator new_value; | |
6780 | void *cookie; | |
6781 | } resort_data; | |
6782 | ||
6783 | /* This routine compares two fields like field_decl_cmp but using the | |
6784 | pointer operator in resort_data. */ | |
6785 | ||
6786 | static int | |
6787 | resort_field_decl_cmp (const void *x_p, const void *y_p) | |
6788 | { | |
4fd61bc6 | 6789 | const tree *const x = (const tree *const) x_p; |
6790 | const tree *const y = (const tree *const) y_p; | |
860251be | 6791 | |
6792 | if (DECL_NAME (*x) == DECL_NAME (*y)) | |
6793 | /* A nontype is "greater" than a type. */ | |
6794 | return (TREE_CODE (*y) == TYPE_DECL) - (TREE_CODE (*x) == TYPE_DECL); | |
6795 | if (DECL_NAME (*x) == NULL_TREE) | |
6796 | return -1; | |
6797 | if (DECL_NAME (*y) == NULL_TREE) | |
6798 | return 1; | |
6799 | { | |
6800 | tree d1 = DECL_NAME (*x); | |
6801 | tree d2 = DECL_NAME (*y); | |
6802 | resort_data.new_value (&d1, resort_data.cookie); | |
6803 | resort_data.new_value (&d2, resort_data.cookie); | |
6804 | if (d1 < d2) | |
6805 | return -1; | |
6806 | } | |
6807 | return 1; | |
6808 | } | |
6809 | ||
6810 | /* Resort DECL_SORTED_FIELDS because pointers have been reordered. */ | |
6811 | ||
6812 | void | |
6813 | resort_sorted_fields (void *obj, | |
9a03a746 | 6814 | void * ARG_UNUSED (orig_obj), |
4ee9c684 | 6815 | gt_pointer_operator new_value, |
6816 | void *cookie) | |
860251be | 6817 | { |
9a03a746 | 6818 | struct sorted_fields_type *sf = (struct sorted_fields_type *) obj; |
860251be | 6819 | resort_data.new_value = new_value; |
6820 | resort_data.cookie = cookie; | |
6821 | qsort (&sf->elts[0], sf->len, sizeof (tree), | |
4ee9c684 | 6822 | resort_field_decl_cmp); |
860251be | 6823 | } |
6824 | ||
209c9752 | 6825 | /* Subroutine of c_parse_error. |
6826 | Return the result of concatenating LHS and RHS. RHS is really | |
6827 | a string literal, its first character is indicated by RHS_START and | |
cfee01e3 | 6828 | RHS_SIZE is its length (including the terminating NUL character). |
209c9752 | 6829 | |
6830 | The caller is responsible for deleting the returned pointer. */ | |
6831 | ||
6832 | static char * | |
6833 | catenate_strings (const char *lhs, const char *rhs_start, int rhs_size) | |
6834 | { | |
6835 | const int lhs_size = strlen (lhs); | |
6836 | char *result = XNEWVEC (char, lhs_size + rhs_size); | |
6837 | strncpy (result, lhs, lhs_size); | |
6838 | strncpy (result + lhs_size, rhs_start, rhs_size); | |
6839 | return result; | |
6840 | } | |
6841 | ||
380c6697 | 6842 | /* Issue the error given by GMSGID, indicating that it occurred before |
92b128ed | 6843 | TOKEN, which had the associated VALUE. */ |
6844 | ||
6845 | void | |
380c6697 | 6846 | c_parse_error (const char *gmsgid, enum cpp_ttype token, tree value) |
92b128ed | 6847 | { |
209c9752 | 6848 | #define catenate_messages(M1, M2) catenate_strings ((M1), (M2), sizeof (M2)) |
6849 | ||
6850 | char *message = NULL; | |
92b128ed | 6851 | |
6852 | if (token == CPP_EOF) | |
380c6697 | 6853 | message = catenate_messages (gmsgid, " at end of input"); |
924bbf02 | 6854 | else if (token == CPP_CHAR || token == CPP_WCHAR || token == CPP_CHAR16 |
6855 | || token == CPP_CHAR32) | |
92b128ed | 6856 | { |
6857 | unsigned int val = TREE_INT_CST_LOW (value); | |
924bbf02 | 6858 | const char *prefix; |
6859 | ||
6860 | switch (token) | |
6861 | { | |
6862 | default: | |
6863 | prefix = ""; | |
6864 | break; | |
6865 | case CPP_WCHAR: | |
6866 | prefix = "L"; | |
6867 | break; | |
6868 | case CPP_CHAR16: | |
6869 | prefix = "u"; | |
6870 | break; | |
6871 | case CPP_CHAR32: | |
6872 | prefix = "U"; | |
6873 | break; | |
6874 | } | |
6875 | ||
92b128ed | 6876 | if (val <= UCHAR_MAX && ISGRAPH (val)) |
a0c938f0 | 6877 | message = catenate_messages (gmsgid, " before %s'%c'"); |
92b128ed | 6878 | else |
a0c938f0 | 6879 | message = catenate_messages (gmsgid, " before %s'\\x%x'"); |
209c9752 | 6880 | |
924bbf02 | 6881 | error (message, prefix, val); |
209c9752 | 6882 | free (message); |
6883 | message = NULL; | |
92b128ed | 6884 | } |
924bbf02 | 6885 | else if (token == CPP_STRING || token == CPP_WSTRING || token == CPP_STRING16 |
6886 | || token == CPP_STRING32) | |
380c6697 | 6887 | message = catenate_messages (gmsgid, " before string constant"); |
92b128ed | 6888 | else if (token == CPP_NUMBER) |
380c6697 | 6889 | message = catenate_messages (gmsgid, " before numeric constant"); |
92b128ed | 6890 | else if (token == CPP_NAME) |
209c9752 | 6891 | { |
380c6697 | 6892 | message = catenate_messages (gmsgid, " before %qE"); |
782858b8 | 6893 | error (message, value); |
209c9752 | 6894 | free (message); |
6895 | message = NULL; | |
6896 | } | |
b75b98aa | 6897 | else if (token == CPP_PRAGMA) |
6898 | message = catenate_messages (gmsgid, " before %<#pragma%>"); | |
6899 | else if (token == CPP_PRAGMA_EOL) | |
6900 | message = catenate_messages (gmsgid, " before end of line"); | |
92b128ed | 6901 | else if (token < N_TTYPES) |
209c9752 | 6902 | { |
380c6697 | 6903 | message = catenate_messages (gmsgid, " before %qs token"); |
209c9752 | 6904 | error (message, cpp_type2name (token)); |
6905 | free (message); | |
6906 | message = NULL; | |
6907 | } | |
92b128ed | 6908 | else |
380c6697 | 6909 | error (gmsgid); |
209c9752 | 6910 | |
6911 | if (message) | |
6912 | { | |
6913 | error (message); | |
6914 | free (message); | |
6915 | } | |
a0c938f0 | 6916 | #undef catenate_messages |
92b128ed | 6917 | } |
6918 | ||
4ee9c684 | 6919 | /* Walk a gimplified function and warn for functions whose return value is |
6920 | ignored and attribute((warn_unused_result)) is set. This is done before | |
b27ac6b5 | 6921 | inlining, so we don't have to worry about that. */ |
6922 | ||
4ee9c684 | 6923 | void |
6924 | c_warn_unused_result (tree *top_p) | |
6925 | { | |
6926 | tree t = *top_p; | |
6927 | tree_stmt_iterator i; | |
6928 | tree fdecl, ftype; | |
6929 | ||
6930 | switch (TREE_CODE (t)) | |
6931 | { | |
6932 | case STATEMENT_LIST: | |
6933 | for (i = tsi_start (*top_p); !tsi_end_p (i); tsi_next (&i)) | |
6934 | c_warn_unused_result (tsi_stmt_ptr (i)); | |
6935 | break; | |
6936 | ||
6937 | case COND_EXPR: | |
6938 | c_warn_unused_result (&COND_EXPR_THEN (t)); | |
6939 | c_warn_unused_result (&COND_EXPR_ELSE (t)); | |
6940 | break; | |
6941 | case BIND_EXPR: | |
6942 | c_warn_unused_result (&BIND_EXPR_BODY (t)); | |
6943 | break; | |
6944 | case TRY_FINALLY_EXPR: | |
6945 | case TRY_CATCH_EXPR: | |
6946 | c_warn_unused_result (&TREE_OPERAND (t, 0)); | |
6947 | c_warn_unused_result (&TREE_OPERAND (t, 1)); | |
6948 | break; | |
6949 | case CATCH_EXPR: | |
6950 | c_warn_unused_result (&CATCH_BODY (t)); | |
6951 | break; | |
6952 | case EH_FILTER_EXPR: | |
6953 | c_warn_unused_result (&EH_FILTER_FAILURE (t)); | |
6954 | break; | |
6955 | ||
6956 | case CALL_EXPR: | |
0e364d12 | 6957 | if (TREE_USED (t)) |
6958 | break; | |
6959 | ||
4ee9c684 | 6960 | /* This is a naked call, as opposed to a CALL_EXPR nested inside |
6961 | a MODIFY_EXPR. All calls whose value is ignored should be | |
6962 | represented like this. Look for the attribute. */ | |
6963 | fdecl = get_callee_fndecl (t); | |
6964 | if (fdecl) | |
6965 | ftype = TREE_TYPE (fdecl); | |
6966 | else | |
6967 | { | |
c2f47e15 | 6968 | ftype = TREE_TYPE (CALL_EXPR_FN (t)); |
4ee9c684 | 6969 | /* Look past pointer-to-function to the function type itself. */ |
6970 | ftype = TREE_TYPE (ftype); | |
6971 | } | |
6972 | ||
6973 | if (lookup_attribute ("warn_unused_result", TYPE_ATTRIBUTES (ftype))) | |
6974 | { | |
6975 | if (fdecl) | |
c3ceba8e | 6976 | warning (0, "%Hignoring return value of %qD, " |
4ee9c684 | 6977 | "declared with attribute warn_unused_result", |
6978 | EXPR_LOCUS (t), fdecl); | |
6979 | else | |
c3ceba8e | 6980 | warning (0, "%Hignoring return value of function " |
4ee9c684 | 6981 | "declared with attribute warn_unused_result", |
6982 | EXPR_LOCUS (t)); | |
6983 | } | |
6984 | break; | |
6985 | ||
6986 | default: | |
6987 | /* Not a container, not a call, or a call whose value is used. */ | |
6988 | break; | |
6989 | } | |
6990 | } | |
6991 | ||
624d37a6 | 6992 | /* Convert a character from the host to the target execution character |
6993 | set. cpplib handles this, mostly. */ | |
6994 | ||
6995 | HOST_WIDE_INT | |
6996 | c_common_to_target_charset (HOST_WIDE_INT c) | |
6997 | { | |
6998 | /* Character constants in GCC proper are sign-extended under -fsigned-char, | |
6999 | zero-extended under -fno-signed-char. cpplib insists that characters | |
7000 | and character constants are always unsigned. Hence we must convert | |
7001 | back and forth. */ | |
7002 | cppchar_t uc = ((cppchar_t)c) & ((((cppchar_t)1) << CHAR_BIT)-1); | |
7003 | ||
7004 | uc = cpp_host_to_exec_charset (parse_in, uc); | |
7005 | ||
7006 | if (flag_signed_char) | |
7007 | return ((HOST_WIDE_INT)uc) << (HOST_BITS_PER_WIDE_INT - CHAR_TYPE_SIZE) | |
7008 | >> (HOST_BITS_PER_WIDE_INT - CHAR_TYPE_SIZE); | |
7009 | else | |
7010 | return uc; | |
7011 | } | |
7012 | ||
af28855b | 7013 | /* Build the result of __builtin_offsetof. EXPR is a nested sequence of |
d897f7c2 | 7014 | component references, with STOP_REF, or alternatively an INDIRECT_REF of |
7015 | NULL, at the bottom; much like the traditional rendering of offsetof as a | |
7016 | macro. Returns the folded and properly cast result. */ | |
af28855b | 7017 | |
7018 | static tree | |
d897f7c2 | 7019 | fold_offsetof_1 (tree expr, tree stop_ref) |
af28855b | 7020 | { |
7021 | enum tree_code code = PLUS_EXPR; | |
7022 | tree base, off, t; | |
7023 | ||
d897f7c2 | 7024 | if (expr == stop_ref && TREE_CODE (expr) != ERROR_MARK) |
7025 | return size_zero_node; | |
7026 | ||
af28855b | 7027 | switch (TREE_CODE (expr)) |
7028 | { | |
7029 | case ERROR_MARK: | |
7030 | return expr; | |
7031 | ||
6b11d2e3 | 7032 | case VAR_DECL: |
7033 | error ("cannot apply %<offsetof%> to static data member %qD", expr); | |
7034 | return error_mark_node; | |
7035 | ||
d897f7c2 | 7036 | case CALL_EXPR: |
7037 | error ("cannot apply %<offsetof%> when %<operator[]%> is overloaded"); | |
7038 | return error_mark_node; | |
7039 | ||
7040 | case INTEGER_CST: | |
7041 | gcc_assert (integer_zerop (expr)); | |
af28855b | 7042 | return size_zero_node; |
7043 | ||
d897f7c2 | 7044 | case NOP_EXPR: |
7045 | case INDIRECT_REF: | |
7046 | base = fold_offsetof_1 (TREE_OPERAND (expr, 0), stop_ref); | |
7047 | gcc_assert (base == error_mark_node || base == size_zero_node); | |
7048 | return base; | |
7049 | ||
af28855b | 7050 | case COMPONENT_REF: |
d897f7c2 | 7051 | base = fold_offsetof_1 (TREE_OPERAND (expr, 0), stop_ref); |
af28855b | 7052 | if (base == error_mark_node) |
7053 | return base; | |
7054 | ||
7055 | t = TREE_OPERAND (expr, 1); | |
7056 | if (DECL_C_BIT_FIELD (t)) | |
7057 | { | |
7058 | error ("attempt to take address of bit-field structure " | |
782858b8 | 7059 | "member %qD", t); |
af28855b | 7060 | return error_mark_node; |
7061 | } | |
7062 | off = size_binop (PLUS_EXPR, DECL_FIELD_OFFSET (t), | |
7063 | size_int (tree_low_cst (DECL_FIELD_BIT_OFFSET (t), 1) | |
7064 | / BITS_PER_UNIT)); | |
7065 | break; | |
7066 | ||
7067 | case ARRAY_REF: | |
d897f7c2 | 7068 | base = fold_offsetof_1 (TREE_OPERAND (expr, 0), stop_ref); |
af28855b | 7069 | if (base == error_mark_node) |
7070 | return base; | |
7071 | ||
7072 | t = TREE_OPERAND (expr, 1); | |
7073 | if (TREE_CODE (t) == INTEGER_CST && tree_int_cst_sgn (t) < 0) | |
7074 | { | |
7075 | code = MINUS_EXPR; | |
49d00087 | 7076 | t = fold_build1 (NEGATE_EXPR, TREE_TYPE (t), t); |
af28855b | 7077 | } |
7078 | t = convert (sizetype, t); | |
7079 | off = size_binop (MULT_EXPR, TYPE_SIZE_UNIT (TREE_TYPE (expr)), t); | |
7080 | break; | |
7081 | ||
ede90cc2 | 7082 | case COMPOUND_EXPR: |
7083 | /* Handle static members of volatile structs. */ | |
7084 | t = TREE_OPERAND (expr, 1); | |
7085 | gcc_assert (TREE_CODE (t) == VAR_DECL); | |
7086 | return fold_offsetof_1 (t, stop_ref); | |
7087 | ||
af28855b | 7088 | default: |
231bd014 | 7089 | gcc_unreachable (); |
af28855b | 7090 | } |
7091 | ||
7092 | return size_binop (code, base, off); | |
7093 | } | |
7094 | ||
7095 | tree | |
d897f7c2 | 7096 | fold_offsetof (tree expr, tree stop_ref) |
af28855b | 7097 | { |
7098 | /* Convert back from the internal sizetype to size_t. */ | |
d897f7c2 | 7099 | return convert (size_type_node, fold_offsetof_1 (expr, stop_ref)); |
af28855b | 7100 | } |
7101 | ||
e35976b1 | 7102 | /* Print an error message for an invalid lvalue. USE says |
ab6bb714 | 7103 | how the lvalue is being used and so selects the error message. */ |
7104 | ||
e35976b1 | 7105 | void |
7106 | lvalue_error (enum lvalue_use use) | |
ab6bb714 | 7107 | { |
e35976b1 | 7108 | switch (use) |
ab6bb714 | 7109 | { |
e35976b1 | 7110 | case lv_assign: |
82d76a54 | 7111 | error ("lvalue required as left operand of assignment"); |
e35976b1 | 7112 | break; |
7113 | case lv_increment: | |
82d76a54 | 7114 | error ("lvalue required as increment operand"); |
e35976b1 | 7115 | break; |
7116 | case lv_decrement: | |
82d76a54 | 7117 | error ("lvalue required as decrement operand"); |
e35976b1 | 7118 | break; |
7119 | case lv_addressof: | |
82d76a54 | 7120 | error ("lvalue required as unary %<&%> operand"); |
e35976b1 | 7121 | break; |
7122 | case lv_asm: | |
82d76a54 | 7123 | error ("lvalue required in asm statement"); |
e35976b1 | 7124 | break; |
7125 | default: | |
7126 | gcc_unreachable (); | |
ab6bb714 | 7127 | } |
ab6bb714 | 7128 | } |
c271bdb2 | 7129 | \f |
7130 | /* *PTYPE is an incomplete array. Complete it with a domain based on | |
7131 | INITIAL_VALUE. If INITIAL_VALUE is not present, use 1 if DO_DEFAULT | |
7132 | is true. Return 0 if successful, 1 if INITIAL_VALUE can't be deciphered, | |
7133 | 2 if INITIAL_VALUE was NULL, and 3 if INITIAL_VALUE was empty. */ | |
7134 | ||
7135 | int | |
7136 | complete_array_type (tree *ptype, tree initial_value, bool do_default) | |
7137 | { | |
7138 | tree maxindex, type, main_type, elt, unqual_elt; | |
7139 | int failure = 0, quals; | |
6753bca0 | 7140 | hashval_t hashcode = 0; |
c271bdb2 | 7141 | |
7142 | maxindex = size_zero_node; | |
7143 | if (initial_value) | |
7144 | { | |
7145 | if (TREE_CODE (initial_value) == STRING_CST) | |
7146 | { | |
7147 | int eltsize | |
7148 | = int_size_in_bytes (TREE_TYPE (TREE_TYPE (initial_value))); | |
7149 | maxindex = size_int (TREE_STRING_LENGTH (initial_value)/eltsize - 1); | |
7150 | } | |
7151 | else if (TREE_CODE (initial_value) == CONSTRUCTOR) | |
7152 | { | |
c75b4594 | 7153 | VEC(constructor_elt,gc) *v = CONSTRUCTOR_ELTS (initial_value); |
c271bdb2 | 7154 | |
c75b4594 | 7155 | if (VEC_empty (constructor_elt, v)) |
c271bdb2 | 7156 | { |
7157 | if (pedantic) | |
7158 | failure = 3; | |
7159 | maxindex = integer_minus_one_node; | |
7160 | } | |
7161 | else | |
7162 | { | |
7163 | tree curindex; | |
c75b4594 | 7164 | unsigned HOST_WIDE_INT cnt; |
7165 | constructor_elt *ce; | |
c271bdb2 | 7166 | |
c75b4594 | 7167 | if (VEC_index (constructor_elt, v, 0)->index) |
7168 | maxindex = fold_convert (sizetype, | |
7169 | VEC_index (constructor_elt, | |
7170 | v, 0)->index); | |
c271bdb2 | 7171 | curindex = maxindex; |
7172 | ||
c75b4594 | 7173 | for (cnt = 1; |
7174 | VEC_iterate (constructor_elt, v, cnt, ce); | |
7175 | cnt++) | |
c271bdb2 | 7176 | { |
c75b4594 | 7177 | if (ce->index) |
7178 | curindex = fold_convert (sizetype, ce->index); | |
c271bdb2 | 7179 | else |
7180 | curindex = size_binop (PLUS_EXPR, curindex, size_one_node); | |
7181 | ||
7182 | if (tree_int_cst_lt (maxindex, curindex)) | |
7183 | maxindex = curindex; | |
7184 | } | |
7185 | } | |
7186 | } | |
7187 | else | |
7188 | { | |
7189 | /* Make an error message unless that happened already. */ | |
7190 | if (initial_value != error_mark_node) | |
7191 | failure = 1; | |
7192 | } | |
7193 | } | |
7194 | else | |
7195 | { | |
7196 | failure = 2; | |
7197 | if (!do_default) | |
7198 | return failure; | |
7199 | } | |
7200 | ||
7201 | type = *ptype; | |
7202 | elt = TREE_TYPE (type); | |
7203 | quals = TYPE_QUALS (strip_array_types (elt)); | |
7204 | if (quals == 0) | |
7205 | unqual_elt = elt; | |
7206 | else | |
7207 | unqual_elt = c_build_qualified_type (elt, TYPE_UNQUALIFIED); | |
7208 | ||
7209 | /* Using build_distinct_type_copy and modifying things afterward instead | |
7210 | of using build_array_type to create a new type preserves all of the | |
7211 | TYPE_LANG_FLAG_? bits that the front end may have set. */ | |
7212 | main_type = build_distinct_type_copy (TYPE_MAIN_VARIANT (type)); | |
7213 | TREE_TYPE (main_type) = unqual_elt; | |
7214 | TYPE_DOMAIN (main_type) = build_index_type (maxindex); | |
7215 | layout_type (main_type); | |
7216 | ||
6753bca0 | 7217 | /* Make sure we have the canonical MAIN_TYPE. */ |
7218 | hashcode = iterative_hash_object (TYPE_HASH (unqual_elt), hashcode); | |
7219 | hashcode = iterative_hash_object (TYPE_HASH (TYPE_DOMAIN (main_type)), | |
7220 | hashcode); | |
7221 | main_type = type_hash_canon (hashcode, main_type); | |
7222 | ||
796735dc | 7223 | /* Fix the canonical type. */ |
7224 | if (TYPE_STRUCTURAL_EQUALITY_P (TREE_TYPE (main_type)) | |
7225 | || TYPE_STRUCTURAL_EQUALITY_P (TYPE_DOMAIN (main_type))) | |
7226 | SET_TYPE_STRUCTURAL_EQUALITY (main_type); | |
7227 | else if (TYPE_CANONICAL (TREE_TYPE (main_type)) != TREE_TYPE (main_type) | |
7228 | || (TYPE_CANONICAL (TYPE_DOMAIN (main_type)) | |
7229 | != TYPE_DOMAIN (main_type))) | |
7230 | TYPE_CANONICAL (main_type) | |
7231 | = build_array_type (TYPE_CANONICAL (TREE_TYPE (main_type)), | |
7232 | TYPE_CANONICAL (TYPE_DOMAIN (main_type))); | |
7233 | else | |
7234 | TYPE_CANONICAL (main_type) = main_type; | |
7235 | ||
c271bdb2 | 7236 | if (quals == 0) |
7237 | type = main_type; | |
7238 | else | |
7239 | type = c_build_qualified_type (main_type, quals); | |
7240 | ||
4f5b8f2a | 7241 | if (COMPLETE_TYPE_P (type) |
7242 | && TREE_CODE (TYPE_SIZE_UNIT (type)) == INTEGER_CST | |
7243 | && TREE_OVERFLOW (TYPE_SIZE_UNIT (type))) | |
7244 | { | |
7245 | error ("size of array is too large"); | |
7246 | /* If we proceed with the array type as it is, we'll eventually | |
7247 | crash in tree_low_cst(). */ | |
7248 | type = error_mark_node; | |
7249 | } | |
7250 | ||
c271bdb2 | 7251 | *ptype = type; |
7252 | return failure; | |
7253 | } | |
ab6bb714 | 7254 | |
b6a5fc45 | 7255 | \f |
7256 | /* Used to help initialize the builtin-types.def table. When a type of | |
7257 | the correct size doesn't exist, use error_mark_node instead of NULL. | |
7258 | The later results in segfaults even when a decl using the type doesn't | |
7259 | get invoked. */ | |
7260 | ||
7261 | tree | |
7262 | builtin_type_for_size (int size, bool unsignedp) | |
7263 | { | |
7264 | tree type = lang_hooks.types.type_for_size (size, unsignedp); | |
7265 | return type ? type : error_mark_node; | |
7266 | } | |
7267 | ||
7268 | /* A helper function for resolve_overloaded_builtin in resolving the | |
7269 | overloaded __sync_ builtins. Returns a positive power of 2 if the | |
7270 | first operand of PARAMS is a pointer to a supported data type. | |
7271 | Returns 0 if an error is encountered. */ | |
7272 | ||
7273 | static int | |
7274 | sync_resolve_size (tree function, tree params) | |
7275 | { | |
7276 | tree type; | |
7277 | int size; | |
7278 | ||
7279 | if (params == NULL) | |
7280 | { | |
7281 | error ("too few arguments to function %qE", function); | |
7282 | return 0; | |
7283 | } | |
7284 | ||
7285 | type = TREE_TYPE (TREE_VALUE (params)); | |
7286 | if (TREE_CODE (type) != POINTER_TYPE) | |
7287 | goto incompatible; | |
7288 | ||
7289 | type = TREE_TYPE (type); | |
7290 | if (!INTEGRAL_TYPE_P (type) && !POINTER_TYPE_P (type)) | |
7291 | goto incompatible; | |
7292 | ||
7293 | size = tree_low_cst (TYPE_SIZE_UNIT (type), 1); | |
27213ba3 | 7294 | if (size == 1 || size == 2 || size == 4 || size == 8 || size == 16) |
b6a5fc45 | 7295 | return size; |
7296 | ||
7297 | incompatible: | |
7298 | error ("incompatible type for argument %d of %qE", 1, function); | |
7299 | return 0; | |
7300 | } | |
7301 | ||
a0c938f0 | 7302 | /* A helper function for resolve_overloaded_builtin. Adds casts to |
b6a5fc45 | 7303 | PARAMS to make arguments match up with those of FUNCTION. Drops |
7304 | the variadic arguments at the end. Returns false if some error | |
7305 | was encountered; true on success. */ | |
7306 | ||
7307 | static bool | |
7308 | sync_resolve_params (tree orig_function, tree function, tree params) | |
7309 | { | |
7310 | tree arg_types = TYPE_ARG_TYPES (TREE_TYPE (function)); | |
7311 | tree ptype; | |
7312 | int number; | |
7313 | ||
7314 | /* We've declared the implementation functions to use "volatile void *" | |
7315 | as the pointer parameter, so we shouldn't get any complaints from the | |
7316 | call to check_function_arguments what ever type the user used. */ | |
7317 | arg_types = TREE_CHAIN (arg_types); | |
7318 | ptype = TREE_TYPE (TREE_TYPE (TREE_VALUE (params))); | |
7319 | number = 2; | |
7320 | ||
7321 | /* For the rest of the values, we need to cast these to FTYPE, so that we | |
7322 | don't get warnings for passing pointer types, etc. */ | |
7323 | while (arg_types != void_list_node) | |
7324 | { | |
7325 | tree val; | |
7326 | ||
7327 | params = TREE_CHAIN (params); | |
7328 | if (params == NULL) | |
7329 | { | |
7330 | error ("too few arguments to function %qE", orig_function); | |
7331 | return false; | |
7332 | } | |
7333 | ||
7334 | /* ??? Ideally for the first conversion we'd use convert_for_assignment | |
7335 | so that we get warnings for anything that doesn't match the pointer | |
7336 | type. This isn't portable across the C and C++ front ends atm. */ | |
7337 | val = TREE_VALUE (params); | |
7338 | val = convert (ptype, val); | |
7339 | val = convert (TREE_VALUE (arg_types), val); | |
7340 | TREE_VALUE (params) = val; | |
7341 | ||
7342 | arg_types = TREE_CHAIN (arg_types); | |
7343 | number++; | |
7344 | } | |
7345 | ||
7346 | /* The definition of these primitives is variadic, with the remaining | |
7347 | being "an optional list of variables protected by the memory barrier". | |
7348 | No clue what that's supposed to mean, precisely, but we consider all | |
7349 | call-clobbered variables to be protected so we're safe. */ | |
7350 | TREE_CHAIN (params) = NULL; | |
7351 | ||
7352 | return true; | |
7353 | } | |
7354 | ||
a0c938f0 | 7355 | /* A helper function for resolve_overloaded_builtin. Adds a cast to |
b6a5fc45 | 7356 | RESULT to make it match the type of the first pointer argument in |
7357 | PARAMS. */ | |
7358 | ||
7359 | static tree | |
7360 | sync_resolve_return (tree params, tree result) | |
7361 | { | |
7362 | tree ptype = TREE_TYPE (TREE_TYPE (TREE_VALUE (params))); | |
10080eac | 7363 | ptype = TYPE_MAIN_VARIANT (ptype); |
b6a5fc45 | 7364 | return convert (ptype, result); |
7365 | } | |
7366 | ||
7367 | /* Some builtin functions are placeholders for other expressions. This | |
7368 | function should be called immediately after parsing the call expression | |
7369 | before surrounding code has committed to the type of the expression. | |
7370 | ||
7371 | FUNCTION is the DECL that has been invoked; it is known to be a builtin. | |
7372 | PARAMS is the argument list for the call. The return value is non-null | |
7373 | when expansion is complete, and null if normal processing should | |
7374 | continue. */ | |
7375 | ||
7376 | tree | |
7377 | resolve_overloaded_builtin (tree function, tree params) | |
7378 | { | |
7379 | enum built_in_function orig_code = DECL_FUNCTION_CODE (function); | |
65441f6f | 7380 | switch (DECL_BUILT_IN_CLASS (function)) |
7381 | { | |
7382 | case BUILT_IN_NORMAL: | |
7383 | break; | |
7384 | case BUILT_IN_MD: | |
7385 | if (targetm.resolve_overloaded_builtin) | |
a0c938f0 | 7386 | return targetm.resolve_overloaded_builtin (function, params); |
65441f6f | 7387 | else |
a0c938f0 | 7388 | return NULL_TREE; |
65441f6f | 7389 | default: |
7390 | return NULL_TREE; | |
7391 | } | |
a0c938f0 | 7392 | |
65441f6f | 7393 | /* Handle BUILT_IN_NORMAL here. */ |
b6a5fc45 | 7394 | switch (orig_code) |
7395 | { | |
7396 | case BUILT_IN_FETCH_AND_ADD_N: | |
7397 | case BUILT_IN_FETCH_AND_SUB_N: | |
7398 | case BUILT_IN_FETCH_AND_OR_N: | |
7399 | case BUILT_IN_FETCH_AND_AND_N: | |
7400 | case BUILT_IN_FETCH_AND_XOR_N: | |
7401 | case BUILT_IN_FETCH_AND_NAND_N: | |
7402 | case BUILT_IN_ADD_AND_FETCH_N: | |
7403 | case BUILT_IN_SUB_AND_FETCH_N: | |
7404 | case BUILT_IN_OR_AND_FETCH_N: | |
7405 | case BUILT_IN_AND_AND_FETCH_N: | |
7406 | case BUILT_IN_XOR_AND_FETCH_N: | |
7407 | case BUILT_IN_NAND_AND_FETCH_N: | |
7408 | case BUILT_IN_BOOL_COMPARE_AND_SWAP_N: | |
7409 | case BUILT_IN_VAL_COMPARE_AND_SWAP_N: | |
7410 | case BUILT_IN_LOCK_TEST_AND_SET_N: | |
7411 | case BUILT_IN_LOCK_RELEASE_N: | |
7412 | { | |
7413 | int n = sync_resolve_size (function, params); | |
7414 | tree new_function, result; | |
7415 | ||
7416 | if (n == 0) | |
7417 | return error_mark_node; | |
7418 | ||
7419 | new_function = built_in_decls[orig_code + exact_log2 (n) + 1]; | |
7420 | if (!sync_resolve_params (function, new_function, params)) | |
7421 | return error_mark_node; | |
7422 | ||
7423 | result = build_function_call (new_function, params); | |
7424 | if (orig_code != BUILT_IN_BOOL_COMPARE_AND_SWAP_N | |
7425 | && orig_code != BUILT_IN_LOCK_RELEASE_N) | |
7426 | result = sync_resolve_return (params, result); | |
7427 | ||
7428 | return result; | |
7429 | } | |
7430 | ||
7431 | default: | |
65441f6f | 7432 | return NULL_TREE; |
b6a5fc45 | 7433 | } |
7434 | } | |
7435 | ||
491255f5 | 7436 | /* Ignoring their sign, return true if two scalar types are the same. */ |
7437 | bool | |
7438 | same_scalar_type_ignoring_signedness (tree t1, tree t2) | |
7439 | { | |
7440 | enum tree_code c1 = TREE_CODE (t1), c2 = TREE_CODE (t2); | |
7441 | ||
9421ebb9 | 7442 | gcc_assert ((c1 == INTEGER_TYPE || c1 == REAL_TYPE || c1 == FIXED_POINT_TYPE) |
7443 | && (c2 == INTEGER_TYPE || c2 == REAL_TYPE | |
7444 | || c2 == FIXED_POINT_TYPE)); | |
491255f5 | 7445 | |
7446 | /* Equality works here because c_common_signed_type uses | |
7447 | TYPE_MAIN_VARIANT. */ | |
11773141 | 7448 | return c_common_signed_type (t1) |
7449 | == c_common_signed_type (t2); | |
491255f5 | 7450 | } |
7451 | ||
be7350e7 | 7452 | /* Check for missing format attributes on function pointers. LTYPE is |
7453 | the new type or left-hand side type. RTYPE is the old type or | |
7454 | right-hand side type. Returns TRUE if LTYPE is missing the desired | |
7455 | attribute. */ | |
7456 | ||
7457 | bool | |
7458 | check_missing_format_attribute (tree ltype, tree rtype) | |
7459 | { | |
7460 | tree const ttr = TREE_TYPE (rtype), ttl = TREE_TYPE (ltype); | |
7461 | tree ra; | |
7462 | ||
7463 | for (ra = TYPE_ATTRIBUTES (ttr); ra; ra = TREE_CHAIN (ra)) | |
7464 | if (is_attribute_p ("format", TREE_PURPOSE (ra))) | |
7465 | break; | |
7466 | if (ra) | |
7467 | { | |
7468 | tree la; | |
7469 | for (la = TYPE_ATTRIBUTES (ttl); la; la = TREE_CHAIN (la)) | |
7470 | if (is_attribute_p ("format", TREE_PURPOSE (la))) | |
7471 | break; | |
7472 | return !la; | |
7473 | } | |
7474 | else | |
7475 | return false; | |
7476 | } | |
7477 | ||
2840aae4 | 7478 | /* Subscripting with type char is likely to lose on a machine where |
7479 | chars are signed. So warn on any machine, but optionally. Don't | |
7480 | warn for unsigned char since that type is safe. Don't warn for | |
7481 | signed char because anyone who uses that must have done so | |
7482 | deliberately. Furthermore, we reduce the false positive load by | |
7483 | warning only for non-constant value of type char. */ | |
7484 | ||
7485 | void | |
7486 | warn_array_subscript_with_type_char (tree index) | |
7487 | { | |
7488 | if (TYPE_MAIN_VARIANT (TREE_TYPE (index)) == char_type_node | |
7489 | && TREE_CODE (index) != INTEGER_CST) | |
7490 | warning (OPT_Wchar_subscripts, "array subscript has type %<char%>"); | |
7491 | } | |
7492 | ||
e534436e | 7493 | /* Implement -Wparentheses for the unexpected C precedence rules, to |
7494 | cover cases like x + y << z which readers are likely to | |
7495 | misinterpret. We have seen an expression in which CODE is a binary | |
7496 | operator used to combine expressions headed by CODE_LEFT and | |
7497 | CODE_RIGHT. CODE_LEFT and CODE_RIGHT may be ERROR_MARK, which | |
7498 | means that that side of the expression was not formed using a | |
7499 | binary operator, or it was enclosed in parentheses. */ | |
7500 | ||
7501 | void | |
7502 | warn_about_parentheses (enum tree_code code, enum tree_code code_left, | |
7503 | enum tree_code code_right) | |
7504 | { | |
7505 | if (!warn_parentheses) | |
7506 | return; | |
7507 | ||
7508 | if (code == LSHIFT_EXPR || code == RSHIFT_EXPR) | |
7509 | { | |
7510 | if (code_left == PLUS_EXPR || code_left == MINUS_EXPR | |
7511 | || code_right == PLUS_EXPR || code_right == MINUS_EXPR) | |
7512 | warning (OPT_Wparentheses, | |
7513 | "suggest parentheses around + or - inside shift"); | |
7514 | } | |
7515 | ||
7516 | if (code == TRUTH_ORIF_EXPR) | |
7517 | { | |
7518 | if (code_left == TRUTH_ANDIF_EXPR | |
7519 | || code_right == TRUTH_ANDIF_EXPR) | |
7520 | warning (OPT_Wparentheses, | |
7521 | "suggest parentheses around && within ||"); | |
7522 | } | |
7523 | ||
7524 | if (code == BIT_IOR_EXPR) | |
7525 | { | |
7526 | if (code_left == BIT_AND_EXPR || code_left == BIT_XOR_EXPR | |
7527 | || code_left == PLUS_EXPR || code_left == MINUS_EXPR | |
7528 | || code_right == BIT_AND_EXPR || code_right == BIT_XOR_EXPR | |
7529 | || code_right == PLUS_EXPR || code_right == MINUS_EXPR) | |
7530 | warning (OPT_Wparentheses, | |
7531 | "suggest parentheses around arithmetic in operand of |"); | |
7532 | /* Check cases like x|y==z */ | |
7533 | if (TREE_CODE_CLASS (code_left) == tcc_comparison | |
7534 | || TREE_CODE_CLASS (code_right) == tcc_comparison) | |
7535 | warning (OPT_Wparentheses, | |
7536 | "suggest parentheses around comparison in operand of |"); | |
7537 | } | |
7538 | ||
7539 | if (code == BIT_XOR_EXPR) | |
7540 | { | |
7541 | if (code_left == BIT_AND_EXPR | |
7542 | || code_left == PLUS_EXPR || code_left == MINUS_EXPR | |
7543 | || code_right == BIT_AND_EXPR | |
7544 | || code_right == PLUS_EXPR || code_right == MINUS_EXPR) | |
7545 | warning (OPT_Wparentheses, | |
7546 | "suggest parentheses around arithmetic in operand of ^"); | |
7547 | /* Check cases like x^y==z */ | |
7548 | if (TREE_CODE_CLASS (code_left) == tcc_comparison | |
7549 | || TREE_CODE_CLASS (code_right) == tcc_comparison) | |
7550 | warning (OPT_Wparentheses, | |
7551 | "suggest parentheses around comparison in operand of ^"); | |
7552 | } | |
7553 | ||
7554 | if (code == BIT_AND_EXPR) | |
7555 | { | |
7556 | if (code_left == PLUS_EXPR || code_left == MINUS_EXPR | |
7557 | || code_right == PLUS_EXPR || code_right == MINUS_EXPR) | |
7558 | warning (OPT_Wparentheses, | |
7559 | "suggest parentheses around + or - in operand of &"); | |
7560 | /* Check cases like x&y==z */ | |
7561 | if (TREE_CODE_CLASS (code_left) == tcc_comparison | |
7562 | || TREE_CODE_CLASS (code_right) == tcc_comparison) | |
7563 | warning (OPT_Wparentheses, | |
7564 | "suggest parentheses around comparison in operand of &"); | |
7565 | } | |
7566 | ||
6ce0c450 | 7567 | if (code == EQ_EXPR || code == NE_EXPR) |
7568 | { | |
7569 | if (TREE_CODE_CLASS (code_left) == tcc_comparison | |
7570 | || TREE_CODE_CLASS (code_right) == tcc_comparison) | |
7571 | warning (OPT_Wparentheses, | |
7572 | "suggest parentheses around comparison in operand of %s", | |
7573 | code == EQ_EXPR ? "==" : "!="); | |
7574 | } | |
7575 | else if (TREE_CODE_CLASS (code) == tcc_comparison) | |
7576 | { | |
7577 | if ((TREE_CODE_CLASS (code_left) == tcc_comparison | |
7578 | && code_left != NE_EXPR && code_left != EQ_EXPR) | |
7579 | || (TREE_CODE_CLASS (code_right) == tcc_comparison | |
7580 | && code_right != NE_EXPR && code_right != EQ_EXPR)) | |
7581 | warning (OPT_Wparentheses, "comparisons like X<=Y<=Z do not " | |
7582 | "have their mathematical meaning"); | |
7583 | } | |
e534436e | 7584 | } |
7585 | ||
92fccaaa | 7586 | /* If LABEL (a LABEL_DECL) has not been used, issue a warning. */ |
7587 | ||
7588 | void | |
7589 | warn_for_unused_label (tree label) | |
7590 | { | |
7591 | if (!TREE_USED (label)) | |
7592 | { | |
7593 | if (DECL_INITIAL (label)) | |
7594 | warning (OPT_Wunused_label, "label %q+D defined but not used", label); | |
7595 | else | |
7596 | warning (OPT_Wunused_label, "label %q+D declared but not defined", label); | |
7597 | } | |
7598 | } | |
2840aae4 | 7599 | |
b9fc964a | 7600 | #ifndef TARGET_HAS_TARGETCM |
7601 | struct gcc_targetcm targetcm = TARGETCM_INITIALIZER; | |
7602 | #endif | |
7603 | ||
f092582b | 7604 | /* Warn for division by zero according to the value of DIVISOR. */ |
7605 | ||
7606 | void | |
7607 | warn_for_div_by_zero (tree divisor) | |
7608 | { | |
9421ebb9 | 7609 | /* If DIVISOR is zero, and has integral or fixed-point type, issue a warning |
7610 | about division by zero. Do not issue a warning if DIVISOR has a | |
f092582b | 7611 | floating-point type, since we consider 0.0/0.0 a valid way of |
7612 | generating a NaN. */ | |
9421ebb9 | 7613 | if (skip_evaluation == 0 |
7614 | && (integer_zerop (divisor) || fixed_zerop (divisor))) | |
f092582b | 7615 | warning (OPT_Wdiv_by_zero, "division by zero"); |
7616 | } | |
7617 | ||
1f3233d1 | 7618 | #include "gt-c-common.h" |