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