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