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