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