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