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