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