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