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