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