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