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.
5 This file is part of GCC.
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
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
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
34 #include "tree-inline.h"
35 #include "diagnostic.h"
40 #include "langhooks.h"
41 #include "except.h" /* For USING_SJLJ_EXCEPTIONS. */
43 cpp_reader
*parse_in
; /* Declared in c-pragma.h. */
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. */
52 #define SIZE_TYPE "long unsigned int"
56 #define WCHAR_TYPE "int"
59 /* WCHAR_TYPE gets overridden by -fshort-wchar. */
60 #define MODIFIED_WCHAR_TYPE \
61 (flag_short_wchar ? "short unsigned int" : WCHAR_TYPE)
64 #define PTRDIFF_TYPE "long int"
68 #define WINT_TYPE "unsigned int"
72 #define INTMAX_TYPE ((INT_TYPE_SIZE == LONG_LONG_TYPE_SIZE) \
74 : ((LONG_TYPE_SIZE == LONG_LONG_TYPE_SIZE) \
80 #define UINTMAX_TYPE ((INT_TYPE_SIZE == LONG_LONG_TYPE_SIZE) \
82 : ((LONG_TYPE_SIZE == LONG_LONG_TYPE_SIZE) \
83 ? "long unsigned int" \
84 : "long long unsigned int"))
87 #ifndef STDC_0_IN_SYSTEM_HEADERS
88 #define STDC_0_IN_SYSTEM_HEADERS 0
91 #ifndef REGISTER_PREFIX
92 #define REGISTER_PREFIX ""
95 /* The variant of the C language being processed. */
97 enum c_language_kind c_language
;
99 /* The following symbols are subsumed in the c_global_trees array, and
100 listed here individually for documentation purposes.
102 INTEGER_TYPE and REAL_TYPE nodes for the standard data types.
104 tree short_integer_type_node;
105 tree long_integer_type_node;
106 tree long_long_integer_type_node;
108 tree short_unsigned_type_node;
109 tree long_unsigned_type_node;
110 tree long_long_unsigned_type_node;
112 tree boolean_type_node;
113 tree boolean_false_node;
114 tree boolean_true_node;
116 tree ptrdiff_type_node;
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;
124 tree float_type_node;
125 tree double_type_node;
126 tree long_double_type_node;
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;
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;
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;
145 tree widest_integer_literal_type_node;
146 tree widest_unsigned_literal_type_node;
148 Nodes for types `void *' and `const void *'.
150 tree ptr_type_node, const_ptr_type_node;
152 Nodes for types `char *' and `const char *'.
154 tree string_type_node, const_string_type_node;
156 Type `char[SOMENUMBER]'.
157 Used when an array of char is needed and the size is irrelevant.
159 tree char_array_type_node;
161 Type `int[SOMENUMBER]' or something like it.
162 Used when an array of int needed and the size is irrelevant.
164 tree int_array_type_node;
166 Type `wchar_t[SOMENUMBER]' or something like it.
167 Used when a wide string literal is created.
169 tree wchar_array_type_node;
171 Type `int ()' -- used for implicit declaration of functions.
173 tree default_function_type;
175 A VOID_TYPE node, packaged in a TREE_LIST.
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.)
183 tree function_name_decl_node;
184 tree pretty_function_name_decl_node;
185 tree c99_function_name_decl_node;
187 Stack of nested function name VAR_DECLs.
189 tree saved_function_name_decls;
193 tree c_global_trees
[CTI_MAX
];
195 /* Nonzero if prepreprocessing only. */
196 int flag_preprocess_only
;
198 /* Nonzero if an ISO standard was selected. It rejects macros in the
202 /* Nonzero if -undef was given. It suppresses target built-in macros
206 /* Nonzero means don't recognize the non-ANSI builtin functions. */
210 /* Nonzero means don't recognize the non-ANSI builtin functions.
213 int flag_no_nonansi_builtin
;
215 /* Nonzero means give `double' the same size as `float'. */
217 int flag_short_double
;
219 /* Nonzero means give `wchar_t' the same size as `short'. */
221 int flag_short_wchar
;
223 /* Nonzero means allow Microsoft extensions without warnings or errors. */
224 int flag_ms_extensions
;
226 /* Nonzero means warn about use of multicharacter literals. */
228 int warn_multichar
= 1;
230 /* Nonzero means warn about possible violations of sequence point rules. */
232 int warn_sequence_point
;
234 /* Nonzero means to warn about compile-time division by zero. */
235 int warn_div_by_zero
= 1;
237 /* Warn about NULL being passed to argument slots marked as requiring
242 /* The elements of `ridpointers' are identifier nodes for the reserved
243 type names and storage classes. It is indexed by a RID_... value. */
246 tree (*make_fname_decl
) PARAMS ((tree
, int));
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
));
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));
256 /* Nonzero means the expression being parsed will never be evaluated.
257 This is a count, since unevaluated expressions can nest. */
260 /* Information about how a function name is generated. */
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? */
268 /* The three ways of getting then name of the current function. */
270 const struct fname_var_t fname_vars
[] =
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},
281 static int constant_fits_type_p
PARAMS ((tree
, tree
));
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. */
297 static if_elt
*if_stack
;
299 /* Amount of space in the if statement stack. */
300 static int if_stack_space
= 0;
303 static int if_stack_pointer
= 0;
305 static void cb_register_builtins
PARAMS ((cpp_reader
*));
307 static tree handle_packed_attribute
PARAMS ((tree
*, tree
, tree
, int,
309 static tree handle_nocommon_attribute
PARAMS ((tree
*, tree
, tree
, int,
311 static tree handle_common_attribute
PARAMS ((tree
*, tree
, tree
, int,
313 static tree handle_noreturn_attribute
PARAMS ((tree
*, tree
, tree
, int,
315 static tree handle_noinline_attribute
PARAMS ((tree
*, tree
, tree
, int,
317 static tree handle_always_inline_attribute
PARAMS ((tree
*, tree
, tree
, int,
319 static tree handle_used_attribute
PARAMS ((tree
*, tree
, tree
, int,
321 static tree handle_unused_attribute
PARAMS ((tree
*, tree
, tree
, int,
323 static tree handle_const_attribute
PARAMS ((tree
*, tree
, tree
, int,
325 static tree handle_transparent_union_attribute
PARAMS ((tree
*, tree
, tree
,
327 static tree handle_constructor_attribute
PARAMS ((tree
*, tree
, tree
, int,
329 static tree handle_destructor_attribute
PARAMS ((tree
*, tree
, tree
, int,
331 static tree handle_mode_attribute
PARAMS ((tree
*, tree
, tree
, int,
333 static tree handle_section_attribute
PARAMS ((tree
*, tree
, tree
, int,
335 static tree handle_aligned_attribute
PARAMS ((tree
*, tree
, tree
, int,
337 static tree handle_weak_attribute
PARAMS ((tree
*, tree
, tree
, int,
339 static tree handle_alias_attribute
PARAMS ((tree
*, tree
, tree
, int,
341 static tree handle_visibility_attribute
PARAMS ((tree
*, tree
, tree
, int,
343 static tree handle_no_instrument_function_attribute
PARAMS ((tree
*, tree
,
346 static tree handle_malloc_attribute
PARAMS ((tree
*, tree
, tree
, int,
348 static tree handle_no_limit_stack_attribute
PARAMS ((tree
*, tree
, tree
, int,
350 static tree handle_pure_attribute
PARAMS ((tree
*, tree
, tree
, int,
352 static tree handle_deprecated_attribute
PARAMS ((tree
*, tree
, tree
, int,
354 static tree handle_vector_size_attribute
PARAMS ((tree
*, tree
, tree
, int,
356 static tree handle_nonnull_attribute
PARAMS ((tree
*, tree
, tree
, int,
358 static tree handle_nothrow_attribute
PARAMS ((tree
*, tree
, tree
, int,
360 static tree vector_size_helper
PARAMS ((tree
, tree
));
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 *,
371 static void builtin_define_type_max
PARAMS ((const char *, tree
, int));
373 /* Table of machine-independent attributes common to all C-like languages. */
374 const struct attribute_spec c_common_attribute_table
[] =
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
}
441 /* Give the specifications for the format attributes, used by C and all
444 const struct attribute_spec c_common_format_attribute_table
[] =
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
}
454 /* Record the start of an if-then, and record the start of it
455 for ambiguous else detection.
457 COND is the condition for the if-then statement.
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. */
464 c_expand_start_cond (cond
, compstmt_count
, if_stmt
)
469 /* Make sure there is enough space on the stack. */
470 if (if_stack_space
== 0)
473 if_stack
= (if_elt
*) xmalloc (10 * sizeof (if_elt
));
475 else if (if_stack_space
== if_stack_pointer
)
477 if_stack_space
+= 10;
478 if_stack
= (if_elt
*) xrealloc (if_stack
, if_stack_space
* sizeof (if_elt
));
481 IF_COND (if_stmt
) = cond
;
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
;
493 /* Called after the then-clause for an if-statement is processed. */
498 tree if_stmt
= if_stack
[if_stack_pointer
- 1].if_stmt
;
499 RECHAIN_STMTS (if_stmt
, THEN_CLAUSE (if_stmt
));
502 /* Record the end of an if-then. Optionally warn if a nested
503 if statement had an ambiguous else clause. */
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
;
516 /* Called between the then-clause and the else-clause
517 of an if-then-else. */
520 c_expand_start_else ()
522 /* An ambiguous else warning must be generated for the enclosing if
523 statement, unless we see an else branch for that one, too. */
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;
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
--;
537 /* Called after the else-clause for an if-statement is processed. */
542 tree if_stmt
= if_stack
[if_stack_pointer
- 1].if_stmt
;
543 RECHAIN_STMTS (if_stmt
, ELSE_CLAUSE (if_stmt
));
546 /* Begin an if-statement. Returns a newly created IF_STMT if
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. */
558 r
= build_stmt (IF_STMT
, NULL_TREE
, NULL_TREE
, NULL_TREE
);
562 /* Begin a while statement. Returns a newly created WHILE_STMT if
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. */
571 c_begin_while_stmt ()
574 r
= build_stmt (WHILE_STMT
, NULL_TREE
, NULL_TREE
);
579 c_finish_while_stmt_cond (cond
, while_stmt
)
583 WHILE_COND (while_stmt
) = cond
;
586 /* Push current bindings for the function name VAR_DECLS. */
592 tree saved
= NULL_TREE
;
594 for (ix
= 0; fname_vars
[ix
].decl
; ix
++)
596 tree decl
= *fname_vars
[ix
].decl
;
600 saved
= tree_cons (decl
, build_int_2 (ix
, 0), saved
);
601 *fname_vars
[ix
].decl
= NULL_TREE
;
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
);
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. */
619 finish_fname_decls ()
622 tree body
= NULL_TREE
;
623 tree stack
= saved_function_name_decls
;
625 for (; stack
&& TREE_VALUE (stack
); stack
= TREE_CHAIN (stack
))
626 body
= chainon (TREE_VALUE (stack
), body
);
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
);
635 COMPOUND_STMT_NO_SCOPE (body
) = 1;
636 TREE_CHAIN (DECL_SAVED_TREE (current_function_decl
)) = body
;
639 for (ix
= 0; fname_vars
[ix
].decl
; ix
++)
640 *fname_vars
[ix
].decl
= NULL_TREE
;
644 /* We had saved values, restore them. */
647 for (saved
= TREE_PURPOSE (stack
); saved
; saved
= TREE_CHAIN (saved
))
649 tree decl
= TREE_PURPOSE (saved
);
650 unsigned ix
= TREE_INT_CST_LOW (TREE_VALUE (saved
));
652 *fname_vars
[ix
].decl
= decl
;
654 stack
= TREE_CHAIN (stack
);
656 saved_function_name_decls
= stack
;
659 /* Return the text name of the current function, suitable prettified
663 fname_as_string (pretty_p
)
666 const char *name
= NULL
;
669 name
= (current_function_decl
670 ? (*lang_hooks
.decl_printable_name
) (current_function_decl
, 2)
672 else if (current_function_decl
&& DECL_NAME (current_function_decl
))
673 name
= IDENTIFIER_POINTER (DECL_NAME (current_function_decl
));
679 /* Return the text name of the current function, formatted as
680 required by the supplied RID value. */
688 for (ix
= 0; fname_vars
[ix
].decl
; ix
++)
689 if (fname_vars
[ix
].rid
== rid
)
691 return fname_as_string (fname_vars
[ix
].pretty
);
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. */
707 tree decl
= NULL_TREE
;
709 for (ix
= 0; fname_vars
[ix
].decl
; ix
++)
710 if (fname_vars
[ix
].rid
== rid
)
713 decl
= *fname_vars
[ix
].decl
;
716 tree saved_last_tree
= last_tree
;
718 decl
= (*make_fname_decl
) (id
, fname_vars
[ix
].pretty
);
719 if (last_tree
!= saved_last_tree
)
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
);
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
);
731 *fname_vars
[ix
].decl
= decl
;
733 if (!ix
&& !current_function_decl
)
734 pedwarn_with_decl (decl
, "`%s' is not defined outside of function scope");
739 /* Given a STRING_CST, give it a suitable array-of-chars data type. */
742 fix_string_type (value
)
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
);
751 /* Compute the number of elements, for the array type. */
752 nchars
= wide_flag
? length
/ wchar_bytes
: length
;
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);
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
)
765 = build_type_variant (wide_flag
? wchar_type_node
: char_type_node
,
768 = build_array_type (elements
,
769 build_index_type (build_int_2 (nchars
- 1, 0)));
773 = build_array_type (wide_flag
? wchar_type_node
: char_type_node
,
774 build_index_type (build_int_2 (nchars
- 1, 0)));
776 TREE_CONSTANT (value
) = 1;
777 TREE_READONLY (value
) = ! flag_writable_strings
;
778 TREE_STATIC (value
) = 1;
782 /* Given a VARRAY of STRING_CST nodes, concatenate them into one
786 combine_strings (strings
)
789 const int wchar_bytes
= TYPE_PRECISION (wchar_type_node
) / BITS_PER_UNIT
;
790 const int nstrings
= VARRAY_ACTIVE_SIZE (strings
);
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
)
802 t
= VARRAY_TREE (strings
, i
);
804 if (TREE_TYPE (t
) == wchar_array_type_node
)
806 wide_length
+= TREE_STRING_LENGTH (t
) - wchar_bytes
;
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");
817 /* If anything is wide, the non-wides will be converted,
818 which makes them take more space. */
820 length
= length
* wchar_bytes
+ wide_length
;
822 p
= xmalloc (length
);
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. */
829 for (i
= 0; i
< nstrings
; ++i
)
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
)
838 memcpy (q
, TREE_STRING_POINTER (t
), len
);
843 const int nzeros
= (TYPE_PRECISION (wchar_type_node
)
844 / BITS_PER_UNIT
) - 1;
847 if (BYTES_BIG_ENDIAN
)
849 for (k
= 0; k
< len
; k
++)
851 for (j
= 0; j
< nzeros
; j
++)
853 *q
++ = TREE_STRING_POINTER (t
)[k
];
858 for (k
= 0; k
< len
; k
++)
860 *q
++ = TREE_STRING_POINTER (t
)[k
];
861 for (j
= 0; j
< nzeros
; j
++)
868 /* Nul terminate the string. */
871 for (i
= 0; i
< wchar_bytes
; i
++)
877 value
= build_string (length
, p
);
881 TREE_TYPE (value
) = wchar_array_type_node
;
883 TREE_TYPE (value
) = char_array_type_node
;
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));
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. */
902 constant_expression_warning (value
)
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");
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. */
920 overflow_warning (value
)
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
))
928 TREE_OVERFLOW (value
) = 0;
929 if (skip_evaluation
== 0)
930 warning ("integer overflow in expression");
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
))
937 TREE_OVERFLOW (value
) = 0;
938 if (skip_evaluation
== 0)
939 warning ("floating point overflow in expression");
941 else if (TREE_CODE (value
) == VECTOR_CST
&& TREE_OVERFLOW (value
))
943 TREE_OVERFLOW (value
) = 0;
944 if (skip_evaluation
== 0)
945 warning ("vector overflow in expression");
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. */
955 unsigned_conversion_warning (result
, operand
)
956 tree result
, operand
;
958 tree type
= TREE_TYPE (result
);
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
))
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");
974 /* Nonzero if constant C has a value that is permissible
975 for type TYPE (an INTEGER_TYPE). */
978 constant_fits_type_p (c
, type
)
981 if (TREE_CODE (c
) == INTEGER_CST
)
982 return int_fits_type_p (c
, type
);
984 c
= convert (type
, c
);
985 return !TREE_OVERFLOW (c
);
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. */
993 convert_and_check (type
, expr
)
996 tree t
= convert (type
, expr
);
997 if (TREE_CODE (t
) == INTEGER_CST
)
999 if (TREE_OVERFLOW (t
))
1001 TREE_OVERFLOW (t
) = 0;
1003 /* Do not diagnose overflow in a constant expression merely
1004 because a conversion overflowed. */
1005 TREE_CONSTANT_OVERFLOW (t
) = TREE_CONSTANT_OVERFLOW (expr
);
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. */
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");
1021 unsigned_conversion_warning (t
, expr
);
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. */
1035 /* Used to implement a cache the results of a call to verify_tree. We only
1036 use this for SAVE_EXPRs. */
1039 struct tlist_cache
*next
;
1040 struct tlist
*cache_before_sp
;
1041 struct tlist
*cache_after_sp
;
1045 /* Obstack to use when allocating tlist structures, and corresponding
1047 static struct obstack tlist_obstack
;
1048 static char *tlist_firstobj
= 0;
1050 /* Keep track of the identifiers we've warned about, so we can avoid duplicate
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
;
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
));
1066 /* Create a new struct tlist and fill in its fields. */
1067 static struct tlist
*
1068 new_tlist (next
, t
, writer
)
1074 l
= (struct tlist
*) obstack_alloc (&tlist_obstack
, sizeof *l
);
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. */
1085 add_tlist (to
, add
, exclude_writer
, copy
)
1088 tree exclude_writer
;
1093 struct tlist
*next
= add
->next
;
1096 if (! exclude_writer
|| add
->writer
!= exclude_writer
)
1097 *to
= copy
? new_tlist (*to
, add
->expr
, add
->writer
) : add
;
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
1109 merge_tlist (to
, add
, copy
)
1114 struct tlist
**end
= to
;
1117 end
= &(*end
)->next
;
1123 struct tlist
*next
= add
->next
;
1125 for (tmp2
= *to
; tmp2
; tmp2
= tmp2
->next
)
1126 if (tmp2
->expr
== add
->expr
)
1130 tmp2
->writer
= add
->writer
;
1134 *end
= copy
? add
: new_tlist (NULL
, add
->expr
, add
->writer
);
1135 end
= &(*end
)->next
;
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
1147 warn_for_collisions_1 (written
, writer
, list
, only_writes
)
1148 tree written
, writer
;
1154 /* Avoid duplicate warnings. */
1155 for (tmp
= warned_ids
; tmp
; tmp
= tmp
->next
)
1156 if (tmp
->expr
== written
)
1161 if (list
->expr
== written
1162 && list
->writer
!= writer
1163 && (! only_writes
|| list
->writer
))
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
)));
1173 /* Given a list LIST of references to variables, find whether any of these
1174 can cause conflicts due to missing sequence points. */
1177 warn_for_collisions (list
)
1182 for (tmp
= list
; tmp
; tmp
= tmp
->next
)
1185 warn_for_collisions_1 (tmp
->expr
, tmp
->writer
, list
, 0);
1189 /* Return nonzero if X is a tree that can be verified by the sequence point
1192 warning_candidate_p (x
)
1195 return TREE_CODE (x
) == VAR_DECL
|| TREE_CODE (x
) == PARM_DECL
;
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
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.
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.
1215 A note on merging. If we modify the former example so that our expression
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. */
1224 verify_tree (x
, pbefore_sp
, pno_sp
, writer
)
1226 struct tlist
**pbefore_sp
, **pno_sp
;
1229 struct tlist
*tmp_before
, *tmp_nosp
, *tmp_list2
, *tmp_list3
;
1230 enum tree_code code
;
1233 /* X may be NULL if it is the operand of an empty statement expression
1239 code
= TREE_CODE (x
);
1240 class = TREE_CODE_CLASS (code
);
1242 if (warning_candidate_p (x
))
1244 *pno_sp
= new_tlist (*pno_sp
, x
, writer
);
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);
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);
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);
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);
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
);
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:
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
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
1312 add_tlist (pno_sp
, tmp_list3
, x
, 0);
1313 warn_for_collisions_1 (TREE_OPERAND (x
, 0), x
, tmp_nosp
, 1);
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);
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);
1337 /* Scan all the list, e.g. indices of multi dimensional array. */
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);
1350 struct tlist_cache
*t
;
1351 for (t
= save_expr_cache
; t
; t
= t
->next
)
1357 t
= (struct tlist_cache
*) obstack_alloc (&tlist_obstack
,
1359 t
->next
= save_expr_cache
;
1361 save_expr_cache
= t
;
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
);
1370 struct tlist
*t
= tmp_nosp
;
1372 merge_tlist (&tmp_list3
, t
, 0);
1374 t
->cache_before_sp
= tmp_before
;
1375 t
->cache_after_sp
= tmp_list3
;
1377 merge_tlist (pbefore_sp
, t
->cache_before_sp
, 1);
1378 add_tlist (pno_sp
, t
->cache_after_sp
, NULL_TREE
, 1);
1387 if (first_rtl_op (code
) == 0)
1389 x
= TREE_OPERAND (x
, 0);
1405 int max
= first_rtl_op (TREE_CODE (x
));
1406 for (lp
= 0; lp
< max
; lp
++)
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);
1418 /* Try to warn for undefined behaviour in EXPR due to missing sequence
1422 verify_sequence_points (expr
)
1425 struct tlist
*before_sp
= 0, *after_sp
= 0;
1428 save_expr_cache
= 0;
1429 if (tlist_firstobj
== 0)
1431 gcc_obstack_init (&tlist_obstack
);
1432 tlist_firstobj
= obstack_alloc (&tlist_obstack
, 0);
1435 verify_tree (expr
, &before_sp
, &after_sp
, 0);
1436 warn_for_collisions (after_sp
);
1437 obstack_free (&tlist_obstack
, tlist_firstobj
);
1441 c_expand_expr_stmt (expr
)
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
);
1451 if (warn_sequence_point
)
1452 verify_sequence_points (expr
);
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");
1459 last_expr_type
= TREE_TYPE (expr
);
1460 return add_stmt (build_stmt (EXPR_STMT
, expr
));
1463 /* Validate the expression after `case' and apply default promotions. */
1466 check_case_value (value
)
1469 if (value
== NULL_TREE
)
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:
1477 switch (...) { case i: ... }
1479 So, we try to reduce the VALUE to a constant that way. */
1480 if (c_language
== clk_cplusplus
)
1482 value
= decl_constant_value (value
);
1483 STRIP_TYPE_NOPS (value
);
1484 value
= fold (value
);
1487 if (TREE_CODE (value
) != INTEGER_CST
1488 && value
!= error_mark_node
)
1490 error ("case label does not reduce to an integer constant");
1491 value
= error_mark_node
;
1494 /* Promote char or short to int. */
1495 value
= default_conversion (value
);
1497 constant_expression_warning (value
);
1502 /* Return an integer type with BITS bits of precision,
1503 that is unsigned if UNSIGNEDP is nonzero, otherwise signed. */
1506 c_common_type_for_size (bits
, unsignedp
)
1510 if (bits
== TYPE_PRECISION (integer_type_node
))
1511 return unsignedp
? unsigned_type_node
: integer_type_node
;
1513 if (bits
== TYPE_PRECISION (signed_char_type_node
))
1514 return unsignedp
? unsigned_char_type_node
: signed_char_type_node
;
1516 if (bits
== TYPE_PRECISION (short_integer_type_node
))
1517 return unsignedp
? short_unsigned_type_node
: short_integer_type_node
;
1519 if (bits
== TYPE_PRECISION (long_integer_type_node
))
1520 return unsignedp
? long_unsigned_type_node
: long_integer_type_node
;
1522 if (bits
== TYPE_PRECISION (long_long_integer_type_node
))
1523 return (unsignedp
? long_long_unsigned_type_node
1524 : long_long_integer_type_node
);
1526 if (bits
== TYPE_PRECISION (widest_integer_literal_type_node
))
1527 return (unsignedp
? widest_unsigned_literal_type_node
1528 : widest_integer_literal_type_node
);
1530 if (bits
<= TYPE_PRECISION (intQI_type_node
))
1531 return unsignedp
? unsigned_intQI_type_node
: intQI_type_node
;
1533 if (bits
<= TYPE_PRECISION (intHI_type_node
))
1534 return unsignedp
? unsigned_intHI_type_node
: intHI_type_node
;
1536 if (bits
<= TYPE_PRECISION (intSI_type_node
))
1537 return unsignedp
? unsigned_intSI_type_node
: intSI_type_node
;
1539 if (bits
<= TYPE_PRECISION (intDI_type_node
))
1540 return unsignedp
? unsigned_intDI_type_node
: intDI_type_node
;
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. */
1550 c_common_type_for_mode (mode
, unsignedp
)
1551 enum machine_mode mode
;
1554 if (mode
== TYPE_MODE (integer_type_node
))
1555 return unsignedp
? unsigned_type_node
: integer_type_node
;
1557 if (mode
== TYPE_MODE (signed_char_type_node
))
1558 return unsignedp
? unsigned_char_type_node
: signed_char_type_node
;
1560 if (mode
== TYPE_MODE (short_integer_type_node
))
1561 return unsignedp
? short_unsigned_type_node
: short_integer_type_node
;
1563 if (mode
== TYPE_MODE (long_integer_type_node
))
1564 return unsignedp
? long_unsigned_type_node
: long_integer_type_node
;
1566 if (mode
== TYPE_MODE (long_long_integer_type_node
))
1567 return unsignedp
? long_long_unsigned_type_node
: long_long_integer_type_node
;
1569 if (mode
== TYPE_MODE (widest_integer_literal_type_node
))
1570 return unsignedp
? widest_unsigned_literal_type_node
1571 : widest_integer_literal_type_node
;
1574 return unsignedp
? unsigned_intQI_type_node
: intQI_type_node
;
1577 return unsignedp
? unsigned_intHI_type_node
: intHI_type_node
;
1580 return unsignedp
? unsigned_intSI_type_node
: intSI_type_node
;
1583 return unsignedp
? unsigned_intDI_type_node
: intDI_type_node
;
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
;
1590 if (mode
== TYPE_MODE (float_type_node
))
1591 return float_type_node
;
1593 if (mode
== TYPE_MODE (double_type_node
))
1594 return double_type_node
;
1596 if (mode
== TYPE_MODE (long_double_type_node
))
1597 return long_double_type_node
;
1599 if (mode
== TYPE_MODE (build_pointer_type (char_type_node
)))
1600 return build_pointer_type (char_type_node
);
1602 if (mode
== TYPE_MODE (build_pointer_type (integer_type_node
)))
1603 return build_pointer_type (integer_type_node
);
1608 return unsignedp
? unsigned_V16QI_type_node
: V16QI_type_node
;
1610 return unsignedp
? unsigned_V8HI_type_node
: V8HI_type_node
;
1612 return unsignedp
? unsigned_V4SI_type_node
: V4SI_type_node
;
1614 return unsignedp
? unsigned_V2DI_type_node
: V2DI_type_node
;
1616 return unsignedp
? unsigned_V2SI_type_node
: V2SI_type_node
;
1618 return unsignedp
? unsigned_V4HI_type_node
: V4HI_type_node
;
1620 return unsignedp
? unsigned_V8QI_type_node
: V8QI_type_node
;
1622 return V16SF_type_node
;
1624 return V4SF_type_node
;
1626 return V2SF_type_node
;
1628 return V2DF_type_node
;
1636 /* Return an unsigned type the same as TYPE in other respects. */
1638 c_common_unsigned_type (type
)
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
;
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
;
1667 return c_common_signed_or_unsigned_type (1, type
);
1670 /* Return a signed type the same as TYPE in other respects. */
1673 c_common_signed_type (type
)
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
;
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
;
1702 return c_common_signed_or_unsigned_type (0, type
);
1705 /* Return a type the same as TYPE except unsigned or
1706 signed according to UNSIGNEDP. */
1709 c_common_signed_or_unsigned_type (unsignedp
, type
)
1713 if (! INTEGRAL_TYPE_P (type
)
1714 || TREE_UNSIGNED (type
) == unsignedp
)
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
);
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
;
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
;
1748 /* Return the minimum number of bits needed to represent VALUE in a
1749 signed or unsigned type, UNSIGNEDP says which. */
1752 min_precision (value
, unsignedp
)
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. */
1763 if (tree_int_cst_sgn (value
) < 0)
1764 value
= fold (build1 (BIT_NOT_EXPR
, TREE_TYPE (value
), value
));
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. */
1769 if (integer_zerop (value
))
1772 log
= tree_floor_log2 (value
);
1774 return log
+ 1 + ! unsignedp
;
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). */
1782 binary_op_error (code
)
1783 enum tree_code code
;
1790 error ("invalid truth-value expression");
1794 opname
= "+"; break;
1796 opname
= "-"; break;
1798 opname
= "*"; break;
1800 opname
= "max"; break;
1802 opname
= "min"; break;
1804 opname
= "=="; break;
1806 opname
= "!="; break;
1808 opname
= "<="; break;
1810 opname
= ">="; break;
1812 opname
= "<"; break;
1814 opname
= ">"; break;
1816 opname
= "<<"; break;
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;
1826 opname
= "&"; break;
1828 opname
= "|"; break;
1829 case TRUTH_ANDIF_EXPR
:
1830 opname
= "&&"; break;
1831 case TRUTH_ORIF_EXPR
:
1832 opname
= "||"; break;
1834 opname
= "^"; break;
1837 opname
= "rotate"; break;
1839 opname
= "unknown"; break;
1841 error ("invalid operands to binary %s", opname
);
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.
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.
1854 If this function returns nonzero, it means that the comparison has
1855 a constant value. What this function returns is an expression for
1859 shorten_compare (op0_ptr
, op1_ptr
, restype_ptr
, rescode_ptr
)
1860 tree
*op0_ptr
, *op1_ptr
;
1862 enum tree_code
*rescode_ptr
;
1865 tree op0
= *op0_ptr
;
1866 tree op1
= *op1_ptr
;
1867 int unsignedp0
, unsignedp1
;
1869 tree primop0
, primop1
;
1870 enum tree_code code
= *rescode_ptr
;
1872 /* Throw away any conversions to wider types
1873 already present in the operands. */
1875 primop0
= get_narrower (op0
, &unsignedp0
);
1876 primop1
= get_narrower (op1
, &unsignedp1
);
1878 /* Handle the case that OP0 does not *contain* a conversion
1879 but it *requires* conversion to FINAL_TYPE. */
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
));
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
;
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. */
1894 if (TREE_CONSTANT (primop0
)
1895 && ! integer_zerop (primop1
) && ! real_zerop (primop1
))
1898 int temi
= unsignedp0
;
1906 unsignedp0
= unsignedp1
;
1929 *rescode_ptr
= code
;
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.
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. */
1949 if (!real1
&& !real2
1950 && TREE_CODE (primop1
) == INTEGER_CST
1951 && TYPE_PRECISION (TREE_TYPE (primop0
)) < TYPE_PRECISION (*restype_ptr
))
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
);
1959 type
= c_common_signed_or_unsigned_type (unsignedp0
,
1960 TREE_TYPE (primop0
));
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
1965 if (TREE_CODE (type
) == ENUMERAL_TYPE
)
1966 type
= c_common_type_for_size (TYPE_PRECISION (type
), unsignedp0
);
1968 maxval
= TYPE_MAX_VALUE (type
);
1969 minval
= TYPE_MIN_VALUE (type
);
1971 if (unsignedp
&& !unsignedp0
)
1972 *restype_ptr
= c_common_signed_type (*restype_ptr
);
1974 if (TREE_TYPE (primop1
) != *restype_ptr
)
1975 primop1
= convert (*restype_ptr
, primop1
);
1976 if (type
!= *restype_ptr
)
1978 minval
= convert (*restype_ptr
, minval
);
1979 maxval
= convert (*restype_ptr
, maxval
);
1982 if (unsignedp
&& unsignedp0
)
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
);
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
);
1998 /* This used to be a switch, but Genix compiler can't handle that. */
1999 if (code
== NE_EXPR
)
2001 if (max_lt
|| min_gt
)
2002 val
= boolean_true_node
;
2004 else if (code
== EQ_EXPR
)
2006 if (max_lt
|| min_gt
)
2007 val
= boolean_false_node
;
2009 else if (code
== LT_EXPR
)
2012 val
= boolean_true_node
;
2014 val
= boolean_false_node
;
2016 else if (code
== GT_EXPR
)
2019 val
= boolean_true_node
;
2021 val
= boolean_false_node
;
2023 else if (code
== LE_EXPR
)
2026 val
= boolean_true_node
;
2028 val
= boolean_false_node
;
2030 else if (code
== GE_EXPR
)
2033 val
= boolean_true_node
;
2035 val
= boolean_false_node
;
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.
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. */
2049 if (unsignedp
&& !unsignedp0
)
2056 primop1
= TYPE_MIN_VALUE (type
);
2062 primop1
= TYPE_MAX_VALUE (type
);
2069 type
= c_common_unsigned_type (type
);
2072 if (TREE_CODE (primop0
) != INTEGER_CST
)
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");
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
);
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. */
2092 else if (real1
&& real2
2093 && (TYPE_PRECISION (TREE_TYPE (primop0
))
2094 == TYPE_PRECISION (TREE_TYPE (primop1
))))
2095 type
= TREE_TYPE (primop0
);
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
2103 (eg, (short)-1 == (unsigned short)-1 should be 0.) */
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
))
2109 type
= common_type (TREE_TYPE (primop0
), TREE_TYPE (primop1
));
2110 type
= c_common_signed_or_unsigned_type (unsignedp0
2111 || TREE_UNSIGNED (*restype_ptr
),
2113 /* Make sure shorter operand is extended the right way
2114 to match the longer operand. */
2116 = convert (c_common_signed_or_unsigned_type (unsignedp0
,
2117 TREE_TYPE (primop0
)),
2120 = convert (c_common_signed_or_unsigned_type (unsignedp1
,
2121 TREE_TYPE (primop1
)),
2126 /* Here we must do the comparison on the nominal type
2127 using the args exactly as we received them. */
2128 type
= *restype_ptr
;
2132 if (!real1
&& !real2
&& integer_zerop (primop1
)
2133 && TREE_UNSIGNED (*restype_ptr
))
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
),
2147 warning ("comparison of unsigned expression >= 0 is always true");
2148 value
= boolean_true_node
;
2152 if (extra_warnings
&& !in_system_header
2153 && ! (TREE_CODE (primop0
) == INTEGER_CST
2154 && ! TREE_OVERFLOW (convert (c_common_signed_type (type
),
2156 warning ("comparison of unsigned expression < 0 is always false");
2157 value
= boolean_false_node
;
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
),
2175 *op0_ptr
= convert (type
, primop0
);
2176 *op1_ptr
= convert (type
, primop1
);
2178 *restype_ptr
= boolean_type_node
;
2183 /* Return a tree for the sum or difference (RESULTCODE says which)
2184 of pointer PTROP and integer INTOP. */
2187 pointer_int_sum (resultcode
, ptrop
, intop
)
2188 enum tree_code resultcode
;
2196 /* The result is a pointer of the same type that is being added. */
2198 tree result_type
= TREE_TYPE (ptrop
);
2200 if (TREE_CODE (TREE_TYPE (result_type
)) == VOID_TYPE
)
2202 if (pedantic
|| warn_pointer_arith
)
2203 pedwarn ("pointer of type `void *' used in arithmetic");
2204 size_exp
= integer_one_node
;
2206 else if (TREE_CODE (TREE_TYPE (result_type
)) == FUNCTION_TYPE
)
2208 if (pedantic
|| warn_pointer_arith
)
2209 pedwarn ("pointer to a function used in arithmetic");
2210 size_exp
= integer_one_node
;
2212 else if (TREE_CODE (TREE_TYPE (result_type
)) == METHOD_TYPE
)
2214 if (pedantic
|| warn_pointer_arith
)
2215 pedwarn ("pointer to member function used in arithmetic");
2216 size_exp
= integer_one_node
;
2218 else if (TREE_CODE (TREE_TYPE (result_type
)) == OFFSET_TYPE
)
2220 if (pedantic
|| warn_pointer_arith
)
2221 pedwarn ("pointer to a member used in arithmetic");
2222 size_exp
= integer_one_node
;
2225 size_exp
= size_in_bytes (TREE_TYPE (result_type
));
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. */
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
)))))
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));
2258 /* Convert the integer argument to a type the same size as sizetype
2259 so the multiply won't overflow spuriously. */
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
);
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). */
2270 intop
= convert (result_type
,
2271 build_binary_op (MULT_EXPR
, intop
,
2272 convert (TREE_TYPE (intop
), size_exp
), 1));
2274 /* Create the sum or difference. */
2276 result
= build (resultcode
, result_type
, ptrop
, intop
);
2278 folded
= fold (result
);
2279 if (folded
== result
)
2280 TREE_CONSTANT (folded
) = TREE_CONSTANT (ptrop
) & TREE_CONSTANT (intop
);
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.
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 !.
2293 The resulting type should always be `boolean_type_node'. */
2296 c_common_truthvalue_conversion (expr
)
2299 if (TREE_CODE (expr
) == ERROR_MARK
)
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
)))
2308 error ("struct type value used where scalar is required");
2309 return boolean_false_node
;
2312 error ("union type value used where scalar is required");
2313 return boolean_false_node
;
2316 error ("array type value used where scalar is required");
2317 return boolean_false_node
;
2324 switch (TREE_CODE (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
:
2332 case TRUTH_XOR_EXPR
:
2333 case TRUTH_NOT_EXPR
:
2334 TREE_TYPE (expr
) = boolean_type_node
;
2341 return integer_zerop (expr
) ? boolean_false_node
: boolean_true_node
;
2344 return real_zerop (expr
) ? boolean_false_node
: boolean_true_node
;
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)))
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
);
2357 return boolean_true_node
;
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)),
2370 /* These don't change whether an object is non-zero or zero. */
2371 return c_common_truthvalue_conversion (TREE_OPERAND (expr
, 0));
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)));
2381 return c_common_truthvalue_conversion (TREE_OPERAND (expr
, 0));
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))));
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
)
2395 /* fall through... */
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));
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.
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
2412 if (HONOR_INFINITIES (TYPE_MODE (TREE_TYPE (TREE_OPERAND (expr
, 0)))))
2414 /* fall through... */
2416 /* This and MINUS_EXPR can be changed into a comparison of the
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);
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
);
2435 if (warn_parentheses
&& C_EXP_ORIGINAL_CODE (expr
) == MODIFY_EXPR
)
2436 warning ("suggest parentheses around assignment used as truth value");
2443 if (TREE_CODE (TREE_TYPE (expr
)) == COMPLEX_TYPE
)
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)),
2454 return build_binary_op (NE_EXPR
, expr
, integer_zero_node
, 1);
2457 static tree builtin_function_2
PARAMS ((const char *, const char *, tree
, tree
,
2458 int, enum built_in_class
, int, int,
2461 /* Make a variant type in the proper way for C/C++, propagating qualifiers
2462 down to the element type of an array. */
2465 c_build_qualified_type (type
, type_quals
)
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
))))
2480 error ("invalid use of `restrict'");
2481 type_quals
&= ~TYPE_QUAL_RESTRICT
;
2484 if (TREE_CODE (type
) == ARRAY_TYPE
)
2485 return build_array_type (c_build_qualified_type (TREE_TYPE (type
),
2487 TYPE_DOMAIN (type
));
2488 return build_qualified_type (type
, type_quals
);
2491 /* Apply the TYPE_QUALS to the new DECL. */
2494 c_apply_type_quals_to_decl (type_quals
, decl
)
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
)
2504 TREE_SIDE_EFFECTS (decl
) = 1;
2505 TREE_THIS_VOLATILE (decl
) = 1;
2507 if (type_quals
& TYPE_QUAL_RESTRICT
)
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
2517 DECL_POINTER_ALIAS_SET (decl
) = -2;
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. */
2525 c_common_get_alias_set (t
)
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. */
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
)
2543 /* That's all the expressions we handle specially. */
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
)
2554 /* If it has the may_alias attribute, it can alias anything. */
2555 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (t
)))
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
))
2563 tree t1
= c_common_signed_type (t
);
2565 /* t1 == t can happen for boolean nodes which are always unsigned. */
2567 return get_alias_set (t1
);
2569 else if (POINTER_TYPE_P (t
))
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.
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
2585 But, the standard is wrong. In particular, this code is
2590 const int* const* cipp = &ipp;
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
2596 t1
= build_type_no_quals (t
);
2598 return get_alias_set (t1
);
2604 /* Implement the __alignof keyword: Return the minimum required
2605 alignment of TYPE, measured in bytes. */
2611 enum tree_code code
= TREE_CODE (type
);
2614 /* In C++, sizeof applies to the referent. Handle alignof the same way. */
2615 if (code
== REFERENCE_TYPE
)
2617 type
= TREE_TYPE (type
);
2618 code
= TREE_CODE (type
);
2621 if (code
== FUNCTION_TYPE
)
2622 t
= size_int (FUNCTION_BOUNDARY
/ BITS_PER_UNIT
);
2623 else if (code
== VOID_TYPE
|| code
== ERROR_MARK
)
2625 else if (!COMPLETE_TYPE_P (type
))
2627 error ("__alignof__ applied to an incomplete type");
2631 t
= size_int (TYPE_ALIGN (type
) / BITS_PER_UNIT
);
2633 return fold (build1 (NOP_EXPR
, c_size_type_node
, t
));
2636 /* Implement the __alignof keyword: Return the minimum required
2637 alignment of EXPR, measured in bytes. For VAR_DECL's and
2638 FIELD_DECL's return DECL_ALIGN (which can be set from an
2639 "aligned" __attribute__ specification). */
2642 c_alignof_expr (expr
)
2647 if (TREE_CODE (expr
) == VAR_DECL
)
2648 t
= size_int (DECL_ALIGN (expr
) / BITS_PER_UNIT
);
2650 else if (TREE_CODE (expr
) == COMPONENT_REF
2651 && DECL_C_BIT_FIELD (TREE_OPERAND (expr
, 1)))
2653 error ("`__alignof' applied to a bit-field");
2656 else if (TREE_CODE (expr
) == COMPONENT_REF
2657 && TREE_CODE (TREE_OPERAND (expr
, 1)) == FIELD_DECL
)
2658 t
= size_int (DECL_ALIGN (TREE_OPERAND (expr
, 1)) / BITS_PER_UNIT
);
2660 else if (TREE_CODE (expr
) == INDIRECT_REF
)
2662 tree t
= TREE_OPERAND (expr
, 0);
2664 int bestalign
= TYPE_ALIGN (TREE_TYPE (TREE_TYPE (t
)));
2666 while (TREE_CODE (t
) == NOP_EXPR
2667 && TREE_CODE (TREE_TYPE (TREE_OPERAND (t
, 0))) == POINTER_TYPE
)
2671 t
= TREE_OPERAND (t
, 0);
2672 thisalign
= TYPE_ALIGN (TREE_TYPE (TREE_TYPE (t
)));
2673 if (thisalign
> bestalign
)
2674 best
= t
, bestalign
= thisalign
;
2676 return c_alignof (TREE_TYPE (TREE_TYPE (best
)));
2679 return c_alignof (TREE_TYPE (expr
));
2681 return fold (build1 (NOP_EXPR
, c_size_type_node
, t
));
2684 /* Build tree nodes and builtin functions common to both C and C++ language
2688 c_common_nodes_and_builtins ()
2692 #define DEF_PRIMITIVE_TYPE(NAME, VALUE) NAME,
2693 #define DEF_FUNCTION_TYPE_0(NAME, RETURN) NAME,
2694 #define DEF_FUNCTION_TYPE_1(NAME, RETURN, ARG1) NAME,
2695 #define DEF_FUNCTION_TYPE_2(NAME, RETURN, ARG1, ARG2) NAME,
2696 #define DEF_FUNCTION_TYPE_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
2697 #define DEF_FUNCTION_TYPE_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME,
2698 #define DEF_FUNCTION_TYPE_VAR_0(NAME, RETURN) NAME,
2699 #define DEF_FUNCTION_TYPE_VAR_1(NAME, RETURN, ARG1) NAME,
2700 #define DEF_FUNCTION_TYPE_VAR_2(NAME, RETURN, ARG1, ARG2) NAME,
2701 #define DEF_POINTER_TYPE(NAME, TYPE) NAME,
2702 #include "builtin-types.def"
2703 #undef DEF_PRIMITIVE_TYPE
2704 #undef DEF_FUNCTION_TYPE_0
2705 #undef DEF_FUNCTION_TYPE_1
2706 #undef DEF_FUNCTION_TYPE_2
2707 #undef DEF_FUNCTION_TYPE_3
2708 #undef DEF_FUNCTION_TYPE_4
2709 #undef DEF_FUNCTION_TYPE_VAR_0
2710 #undef DEF_FUNCTION_TYPE_VAR_1
2711 #undef DEF_FUNCTION_TYPE_VAR_2
2712 #undef DEF_POINTER_TYPE
2716 typedef enum builtin_type builtin_type
;
2718 tree builtin_types
[(int) BT_LAST
];
2719 int wchar_type_size
;
2720 tree array_domain_type
;
2721 tree va_list_ref_type_node
;
2722 tree va_list_arg_type_node
;
2724 /* Define `int' and `char' first so that dbx will output them first. */
2725 record_builtin_type (RID_INT
, NULL
, integer_type_node
);
2726 record_builtin_type (RID_CHAR
, "char", char_type_node
);
2728 /* `signed' is the same as `int'. FIXME: the declarations of "signed",
2729 "unsigned long", "long long unsigned" and "unsigned short" were in C++
2730 but not C. Are the conditionals here needed? */
2731 if (c_language
== clk_cplusplus
)
2732 record_builtin_type (RID_SIGNED
, NULL
, integer_type_node
);
2733 record_builtin_type (RID_LONG
, "long int", long_integer_type_node
);
2734 record_builtin_type (RID_UNSIGNED
, "unsigned int", unsigned_type_node
);
2735 record_builtin_type (RID_MAX
, "long unsigned int",
2736 long_unsigned_type_node
);
2737 if (c_language
== clk_cplusplus
)
2738 record_builtin_type (RID_MAX
, "unsigned long", long_unsigned_type_node
);
2739 record_builtin_type (RID_MAX
, "long long int",
2740 long_long_integer_type_node
);
2741 record_builtin_type (RID_MAX
, "long long unsigned int",
2742 long_long_unsigned_type_node
);
2743 if (c_language
== clk_cplusplus
)
2744 record_builtin_type (RID_MAX
, "long long unsigned",
2745 long_long_unsigned_type_node
);
2746 record_builtin_type (RID_SHORT
, "short int", short_integer_type_node
);
2747 record_builtin_type (RID_MAX
, "short unsigned int",
2748 short_unsigned_type_node
);
2749 if (c_language
== clk_cplusplus
)
2750 record_builtin_type (RID_MAX
, "unsigned short",
2751 short_unsigned_type_node
);
2753 /* Define both `signed char' and `unsigned char'. */
2754 record_builtin_type (RID_MAX
, "signed char", signed_char_type_node
);
2755 record_builtin_type (RID_MAX
, "unsigned char", unsigned_char_type_node
);
2757 /* These are types that c_common_type_for_size and
2758 c_common_type_for_mode use. */
2759 (*lang_hooks
.decls
.pushdecl
) (build_decl (TYPE_DECL
, NULL_TREE
,
2761 (*lang_hooks
.decls
.pushdecl
) (build_decl (TYPE_DECL
, NULL_TREE
,
2763 (*lang_hooks
.decls
.pushdecl
) (build_decl (TYPE_DECL
, NULL_TREE
,
2765 (*lang_hooks
.decls
.pushdecl
) (build_decl (TYPE_DECL
, NULL_TREE
,
2767 #if HOST_BITS_PER_WIDE_INT >= 64
2768 (*lang_hooks
.decls
.pushdecl
) (build_decl (TYPE_DECL
,
2769 get_identifier ("__int128_t"),
2772 (*lang_hooks
.decls
.pushdecl
) (build_decl (TYPE_DECL
, NULL_TREE
,
2773 unsigned_intQI_type_node
));
2774 (*lang_hooks
.decls
.pushdecl
) (build_decl (TYPE_DECL
, NULL_TREE
,
2775 unsigned_intHI_type_node
));
2776 (*lang_hooks
.decls
.pushdecl
) (build_decl (TYPE_DECL
, NULL_TREE
,
2777 unsigned_intSI_type_node
));
2778 (*lang_hooks
.decls
.pushdecl
) (build_decl (TYPE_DECL
, NULL_TREE
,
2779 unsigned_intDI_type_node
));
2780 #if HOST_BITS_PER_WIDE_INT >= 64
2781 (*lang_hooks
.decls
.pushdecl
) (build_decl (TYPE_DECL
,
2782 get_identifier ("__uint128_t"),
2783 unsigned_intTI_type_node
));
2786 /* Create the widest literal types. */
2787 widest_integer_literal_type_node
2788 = make_signed_type (HOST_BITS_PER_WIDE_INT
* 2);
2789 (*lang_hooks
.decls
.pushdecl
) (build_decl (TYPE_DECL
, NULL_TREE
,
2790 widest_integer_literal_type_node
));
2792 widest_unsigned_literal_type_node
2793 = make_unsigned_type (HOST_BITS_PER_WIDE_INT
* 2);
2794 (*lang_hooks
.decls
.pushdecl
) (build_decl (TYPE_DECL
, NULL_TREE
,
2795 widest_unsigned_literal_type_node
));
2797 /* `unsigned long' is the standard type for sizeof.
2798 Note that stddef.h uses `unsigned long',
2799 and this must agree, even if long and int are the same size. */
2801 TREE_TYPE (identifier_global_value (get_identifier (SIZE_TYPE
)));
2802 signed_size_type_node
= c_common_signed_type (c_size_type_node
);
2803 set_sizetype (c_size_type_node
);
2805 build_common_tree_nodes_2 (flag_short_double
);
2807 record_builtin_type (RID_FLOAT
, NULL
, float_type_node
);
2808 record_builtin_type (RID_DOUBLE
, NULL
, double_type_node
);
2809 record_builtin_type (RID_MAX
, "long double", long_double_type_node
);
2811 (*lang_hooks
.decls
.pushdecl
) (build_decl (TYPE_DECL
,
2812 get_identifier ("complex int"),
2813 complex_integer_type_node
));
2814 (*lang_hooks
.decls
.pushdecl
) (build_decl (TYPE_DECL
,
2815 get_identifier ("complex float"),
2816 complex_float_type_node
));
2817 (*lang_hooks
.decls
.pushdecl
) (build_decl (TYPE_DECL
,
2818 get_identifier ("complex double"),
2819 complex_double_type_node
));
2820 (*lang_hooks
.decls
.pushdecl
)
2821 (build_decl (TYPE_DECL
, get_identifier ("complex long double"),
2822 complex_long_double_type_node
));
2824 /* Types which are common to the fortran compiler and libf2c. When
2825 changing these, you also need to be concerned with f/com.h. */
2827 if (TYPE_PRECISION (float_type_node
)
2828 == TYPE_PRECISION (long_integer_type_node
))
2830 g77_integer_type_node
= long_integer_type_node
;
2831 g77_uinteger_type_node
= long_unsigned_type_node
;
2833 else if (TYPE_PRECISION (float_type_node
)
2834 == TYPE_PRECISION (integer_type_node
))
2836 g77_integer_type_node
= integer_type_node
;
2837 g77_uinteger_type_node
= unsigned_type_node
;
2840 g77_integer_type_node
= g77_uinteger_type_node
= NULL_TREE
;
2842 if (g77_integer_type_node
!= NULL_TREE
)
2844 (*lang_hooks
.decls
.pushdecl
) (build_decl (TYPE_DECL
,
2845 get_identifier ("__g77_integer"),
2846 g77_integer_type_node
));
2847 (*lang_hooks
.decls
.pushdecl
) (build_decl (TYPE_DECL
,
2848 get_identifier ("__g77_uinteger"),
2849 g77_uinteger_type_node
));
2852 if (TYPE_PRECISION (float_type_node
) * 2
2853 == TYPE_PRECISION (long_integer_type_node
))
2855 g77_longint_type_node
= long_integer_type_node
;
2856 g77_ulongint_type_node
= long_unsigned_type_node
;
2858 else if (TYPE_PRECISION (float_type_node
) * 2
2859 == TYPE_PRECISION (long_long_integer_type_node
))
2861 g77_longint_type_node
= long_long_integer_type_node
;
2862 g77_ulongint_type_node
= long_long_unsigned_type_node
;
2865 g77_longint_type_node
= g77_ulongint_type_node
= NULL_TREE
;
2867 if (g77_longint_type_node
!= NULL_TREE
)
2869 (*lang_hooks
.decls
.pushdecl
) (build_decl (TYPE_DECL
,
2870 get_identifier ("__g77_longint"),
2871 g77_longint_type_node
));
2872 (*lang_hooks
.decls
.pushdecl
) (build_decl (TYPE_DECL
,
2873 get_identifier ("__g77_ulongint"),
2874 g77_ulongint_type_node
));
2877 record_builtin_type (RID_VOID
, NULL
, void_type_node
);
2879 void_zero_node
= build_int_2 (0, 0);
2880 TREE_TYPE (void_zero_node
) = void_type_node
;
2882 void_list_node
= build_void_list_node ();
2884 /* Make a type to be the domain of a few array types
2885 whose domains don't really matter.
2886 200 is small enough that it always fits in size_t
2887 and large enough that it can hold most function names for the
2888 initializations of __FUNCTION__ and __PRETTY_FUNCTION__. */
2889 array_domain_type
= build_index_type (size_int (200));
2891 /* Make a type for arrays of characters.
2892 With luck nothing will ever really depend on the length of this
2894 char_array_type_node
2895 = build_array_type (char_type_node
, array_domain_type
);
2897 /* Likewise for arrays of ints. */
2899 = build_array_type (integer_type_node
, array_domain_type
);
2901 string_type_node
= build_pointer_type (char_type_node
);
2902 const_string_type_node
2903 = build_pointer_type (build_qualified_type
2904 (char_type_node
, TYPE_QUAL_CONST
));
2906 (*targetm
.init_builtins
) ();
2908 /* This is special for C++ so functions can be overloaded. */
2909 wchar_type_node
= get_identifier (MODIFIED_WCHAR_TYPE
);
2910 wchar_type_node
= TREE_TYPE (identifier_global_value (wchar_type_node
));
2911 wchar_type_size
= TYPE_PRECISION (wchar_type_node
);
2912 if (c_language
== clk_cplusplus
)
2914 if (TREE_UNSIGNED (wchar_type_node
))
2915 wchar_type_node
= make_unsigned_type (wchar_type_size
);
2917 wchar_type_node
= make_signed_type (wchar_type_size
);
2918 record_builtin_type (RID_WCHAR
, "wchar_t", wchar_type_node
);
2922 signed_wchar_type_node
= c_common_signed_type (wchar_type_node
);
2923 unsigned_wchar_type_node
= c_common_unsigned_type (wchar_type_node
);
2926 /* This is for wide string constants. */
2927 wchar_array_type_node
2928 = build_array_type (wchar_type_node
, array_domain_type
);
2931 TREE_TYPE (identifier_global_value (get_identifier (WINT_TYPE
)));
2934 TREE_TYPE (identifier_global_value (get_identifier (INTMAX_TYPE
)));
2936 TREE_TYPE (identifier_global_value (get_identifier (UINTMAX_TYPE
)));
2938 default_function_type
= build_function_type (integer_type_node
, NULL_TREE
);
2940 = TREE_TYPE (identifier_global_value (get_identifier (PTRDIFF_TYPE
)));
2941 unsigned_ptrdiff_type_node
= c_common_unsigned_type (ptrdiff_type_node
);
2943 (*lang_hooks
.decls
.pushdecl
)
2944 (build_decl (TYPE_DECL
, get_identifier ("__builtin_va_list"),
2945 va_list_type_node
));
2947 (*lang_hooks
.decls
.pushdecl
)
2948 (build_decl (TYPE_DECL
, get_identifier ("__builtin_ptrdiff_t"),
2949 ptrdiff_type_node
));
2951 (*lang_hooks
.decls
.pushdecl
)
2952 (build_decl (TYPE_DECL
, get_identifier ("__builtin_size_t"),
2955 if (TREE_CODE (va_list_type_node
) == ARRAY_TYPE
)
2957 va_list_arg_type_node
= va_list_ref_type_node
=
2958 build_pointer_type (TREE_TYPE (va_list_type_node
));
2962 va_list_arg_type_node
= va_list_type_node
;
2963 va_list_ref_type_node
= build_reference_type (va_list_type_node
);
2966 #define DEF_PRIMITIVE_TYPE(ENUM, VALUE) \
2967 builtin_types[(int) ENUM] = VALUE;
2968 #define DEF_FUNCTION_TYPE_0(ENUM, RETURN) \
2969 builtin_types[(int) ENUM] \
2970 = build_function_type (builtin_types[(int) RETURN], \
2972 #define DEF_FUNCTION_TYPE_1(ENUM, RETURN, ARG1) \
2973 builtin_types[(int) ENUM] \
2974 = build_function_type (builtin_types[(int) RETURN], \
2975 tree_cons (NULL_TREE, \
2976 builtin_types[(int) ARG1], \
2978 #define DEF_FUNCTION_TYPE_2(ENUM, RETURN, ARG1, ARG2) \
2979 builtin_types[(int) ENUM] \
2980 = build_function_type \
2981 (builtin_types[(int) RETURN], \
2982 tree_cons (NULL_TREE, \
2983 builtin_types[(int) ARG1], \
2984 tree_cons (NULL_TREE, \
2985 builtin_types[(int) ARG2], \
2987 #define DEF_FUNCTION_TYPE_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
2988 builtin_types[(int) ENUM] \
2989 = build_function_type \
2990 (builtin_types[(int) RETURN], \
2991 tree_cons (NULL_TREE, \
2992 builtin_types[(int) ARG1], \
2993 tree_cons (NULL_TREE, \
2994 builtin_types[(int) ARG2], \
2995 tree_cons (NULL_TREE, \
2996 builtin_types[(int) ARG3], \
2998 #define DEF_FUNCTION_TYPE_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \
2999 builtin_types[(int) ENUM] \
3000 = build_function_type \
3001 (builtin_types[(int) RETURN], \
3002 tree_cons (NULL_TREE, \
3003 builtin_types[(int) ARG1], \
3004 tree_cons (NULL_TREE, \
3005 builtin_types[(int) ARG2], \
3008 builtin_types[(int) ARG3], \
3009 tree_cons (NULL_TREE, \
3010 builtin_types[(int) ARG4], \
3011 void_list_node)))));
3012 #define DEF_FUNCTION_TYPE_VAR_0(ENUM, RETURN) \
3013 builtin_types[(int) ENUM] \
3014 = build_function_type (builtin_types[(int) RETURN], NULL_TREE);
3015 #define DEF_FUNCTION_TYPE_VAR_1(ENUM, RETURN, ARG1) \
3016 builtin_types[(int) ENUM] \
3017 = build_function_type (builtin_types[(int) RETURN], \
3018 tree_cons (NULL_TREE, \
3019 builtin_types[(int) ARG1], \
3022 #define DEF_FUNCTION_TYPE_VAR_2(ENUM, RETURN, ARG1, ARG2) \
3023 builtin_types[(int) ENUM] \
3024 = build_function_type \
3025 (builtin_types[(int) RETURN], \
3026 tree_cons (NULL_TREE, \
3027 builtin_types[(int) ARG1], \
3028 tree_cons (NULL_TREE, \
3029 builtin_types[(int) ARG2], \
3031 #define DEF_POINTER_TYPE(ENUM, TYPE) \
3032 builtin_types[(int) ENUM] \
3033 = build_pointer_type (builtin_types[(int) TYPE]);
3034 #include "builtin-types.def"
3035 #undef DEF_PRIMITIVE_TYPE
3036 #undef DEF_FUNCTION_TYPE_1
3037 #undef DEF_FUNCTION_TYPE_2
3038 #undef DEF_FUNCTION_TYPE_3
3039 #undef DEF_FUNCTION_TYPE_4
3040 #undef DEF_FUNCTION_TYPE_VAR_0
3041 #undef DEF_FUNCTION_TYPE_VAR_1
3042 #undef DEF_POINTER_TYPE
3044 #define DEF_BUILTIN(ENUM, NAME, CLASS, \
3045 TYPE, LIBTYPE, BOTH_P, FALLBACK_P, NONANSI_P) \
3050 if (strncmp (NAME, "__builtin_", strlen ("__builtin_")) != 0) \
3054 decl = builtin_function (NAME, builtin_types[TYPE], ENUM, \
3057 ? (NAME + strlen ("__builtin_")) \
3060 decl = builtin_function_2 (NAME, \
3061 NAME + strlen ("__builtin_"), \
3062 builtin_types[TYPE], \
3063 builtin_types[LIBTYPE], \
3068 /*noreturn_p=*/0); \
3070 built_in_decls[(int) ENUM] = decl; \
3072 #include "builtins.def"
3075 /* Declare _exit and _Exit just to mark them as non-returning. */
3076 builtin_function_2 (NULL
, "_exit", NULL_TREE
,
3077 builtin_types
[BT_FN_VOID_INT
],
3078 0, NOT_BUILT_IN
, 0, 1, 1);
3079 builtin_function_2 (NULL
, "_Exit", NULL_TREE
,
3080 builtin_types
[BT_FN_VOID_INT
],
3081 0, NOT_BUILT_IN
, 0, !flag_isoc99
, 1);
3083 /* Declare these functions non-returning
3084 to avoid spurious "control drops through" warnings. */
3085 builtin_function_2 (NULL
, "abort",
3086 NULL_TREE
, ((c_language
== clk_cplusplus
)
3087 ? builtin_types
[BT_FN_VOID
]
3088 : builtin_types
[BT_FN_VOID_VAR
]),
3089 0, NOT_BUILT_IN
, 0, 0, 1);
3091 builtin_function_2 (NULL
, "exit",
3092 NULL_TREE
, ((c_language
== clk_cplusplus
)
3093 ? builtin_types
[BT_FN_VOID_INT
]
3094 : builtin_types
[BT_FN_VOID_VAR
]),
3095 0, NOT_BUILT_IN
, 0, 0, 1);
3097 main_identifier_node
= get_identifier ("main");
3101 build_va_arg (expr
, type
)
3104 return build1 (VA_ARG_EXPR
, type
, expr
);
3108 /* Linked list of disabled built-in functions. */
3110 typedef struct disabled_builtin
3113 struct disabled_builtin
*next
;
3115 static disabled_builtin
*disabled_builtins
= NULL
;
3117 static bool builtin_function_disabled_p
PARAMS ((const char *));
3119 /* Disable a built-in function specified by -fno-builtin-NAME. If NAME
3120 begins with "__builtin_", give an error. */
3123 disable_builtin_function (name
)
3126 if (strncmp (name
, "__builtin_", strlen ("__builtin_")) == 0)
3127 error ("cannot disable built-in function `%s'", name
);
3130 disabled_builtin
*new = xmalloc (sizeof (disabled_builtin
));
3132 new->next
= disabled_builtins
;
3133 disabled_builtins
= new;
3138 /* Return true if the built-in function NAME has been disabled, false
3142 builtin_function_disabled_p (name
)
3145 disabled_builtin
*p
;
3146 for (p
= disabled_builtins
; p
!= NULL
; p
= p
->next
)
3148 if (strcmp (name
, p
->name
) == 0)
3155 /* Possibly define a builtin function with one or two names. BUILTIN_NAME
3156 is an __builtin_-prefixed name; NAME is the ordinary name; one or both
3157 of these may be NULL (though both being NULL is useless).
3158 BUILTIN_TYPE is the type of the __builtin_-prefixed function;
3159 TYPE is the type of the function with the ordinary name. These
3160 may differ if the ordinary name is declared with a looser type to avoid
3161 conflicts with headers. FUNCTION_CODE and CLASS are as for
3162 builtin_function. If LIBRARY_NAME_P is nonzero, NAME is passed as
3163 the LIBRARY_NAME parameter to builtin_function when declaring BUILTIN_NAME.
3164 If NONANSI_P is nonzero, the name NAME is treated as a non-ANSI name; if
3165 NORETURN_P is nonzero, the function is marked as non-returning.
3166 Returns the declaration of BUILTIN_NAME, if any, otherwise
3167 the declaration of NAME. Does not declare NAME if flag_no_builtin,
3168 or if NONANSI_P and flag_no_nonansi_builtin. */
3171 builtin_function_2 (builtin_name
, name
, builtin_type
, type
, function_code
,
3172 class, library_name_p
, nonansi_p
, noreturn_p
)
3173 const char *builtin_name
;
3178 enum built_in_class
class;
3183 tree bdecl
= NULL_TREE
;
3184 tree decl
= NULL_TREE
;
3185 if (builtin_name
!= 0)
3187 bdecl
= builtin_function (builtin_name
, builtin_type
, function_code
,
3188 class, library_name_p
? name
: NULL
);
3191 TREE_THIS_VOLATILE (bdecl
) = 1;
3192 TREE_SIDE_EFFECTS (bdecl
) = 1;
3195 if (name
!= 0 && !flag_no_builtin
&& !builtin_function_disabled_p (name
)
3196 && !(nonansi_p
&& flag_no_nonansi_builtin
))
3198 decl
= builtin_function (name
, type
, function_code
, class, NULL
);
3200 DECL_BUILT_IN_NONANSI (decl
) = 1;
3203 TREE_THIS_VOLATILE (decl
) = 1;
3204 TREE_SIDE_EFFECTS (decl
) = 1;
3207 return (bdecl
!= 0 ? bdecl
: decl
);
3210 /* Nonzero if the type T promotes to int. This is (nearly) the
3211 integral promotions defined in ISO C99 6.3.1.1/2. */
3214 c_promoting_integer_type_p (t
)
3217 switch (TREE_CODE (t
))
3220 return (TYPE_MAIN_VARIANT (t
) == char_type_node
3221 || TYPE_MAIN_VARIANT (t
) == signed_char_type_node
3222 || TYPE_MAIN_VARIANT (t
) == unsigned_char_type_node
3223 || TYPE_MAIN_VARIANT (t
) == short_integer_type_node
3224 || TYPE_MAIN_VARIANT (t
) == short_unsigned_type_node
3225 || TYPE_PRECISION (t
) < TYPE_PRECISION (integer_type_node
));
3228 /* ??? Technically all enumerations not larger than an int
3229 promote to an int. But this is used along code paths
3230 that only want to notice a size change. */
3231 return TYPE_PRECISION (t
) < TYPE_PRECISION (integer_type_node
);
3241 /* Return 1 if PARMS specifies a fixed number of parameters
3242 and none of their types is affected by default promotions. */
3245 self_promoting_args_p (parms
)
3249 for (t
= parms
; t
; t
= TREE_CHAIN (t
))
3251 tree type
= TREE_VALUE (t
);
3253 if (TREE_CHAIN (t
) == 0 && type
!= void_type_node
)
3259 if (TYPE_MAIN_VARIANT (type
) == float_type_node
)
3262 if (c_promoting_integer_type_p (type
))
3268 /* Recursively examines the array elements of TYPE, until a non-array
3269 element type is found. */
3272 strip_array_types (type
)
3275 while (TREE_CODE (type
) == ARRAY_TYPE
)
3276 type
= TREE_TYPE (type
);
3281 static tree expand_unordered_cmp
PARAMS ((tree
, tree
, enum tree_code
,
3284 /* Expand a call to an unordered comparison function such as
3285 __builtin_isgreater(). FUNCTION is the function's declaration and
3286 PARAMS a list of the values passed. For __builtin_isunordered(),
3287 UNORDERED_CODE is UNORDERED_EXPR and ORDERED_CODE is NOP_EXPR. In
3288 other cases, UNORDERED_CODE and ORDERED_CODE are comparison codes
3289 that give the opposite of the desired result. UNORDERED_CODE is
3290 used for modes that can hold NaNs and ORDERED_CODE is used for the
3294 expand_unordered_cmp (function
, params
, unordered_code
, ordered_code
)
3295 tree function
, params
;
3296 enum tree_code unordered_code
, ordered_code
;
3298 tree arg0
, arg1
, type
;
3299 enum tree_code code0
, code1
;
3301 /* Check that we have exactly two arguments. */
3302 if (params
== 0 || TREE_CHAIN (params
) == 0)
3304 error ("too few arguments to function `%s'",
3305 IDENTIFIER_POINTER (DECL_NAME (function
)));
3306 return error_mark_node
;
3308 else if (TREE_CHAIN (TREE_CHAIN (params
)) != 0)
3310 error ("too many arguments to function `%s'",
3311 IDENTIFIER_POINTER (DECL_NAME (function
)));
3312 return error_mark_node
;
3315 arg0
= TREE_VALUE (params
);
3316 arg1
= TREE_VALUE (TREE_CHAIN (params
));
3318 code0
= TREE_CODE (TREE_TYPE (arg0
));
3319 code1
= TREE_CODE (TREE_TYPE (arg1
));
3321 /* Make sure that the arguments have a common type of REAL. */
3323 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
)
3324 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
))
3325 type
= common_type (TREE_TYPE (arg0
), TREE_TYPE (arg1
));
3327 if (type
== 0 || TREE_CODE (type
) != REAL_TYPE
)
3329 error ("non-floating-point argument to function `%s'",
3330 IDENTIFIER_POINTER (DECL_NAME (function
)));
3331 return error_mark_node
;
3334 if (unordered_code
== UNORDERED_EXPR
)
3336 if (MODE_HAS_NANS (TYPE_MODE (type
)))
3337 return build_binary_op (unordered_code
,
3338 convert (type
, arg0
),
3339 convert (type
, arg1
),
3342 return integer_zero_node
;
3345 return build_unary_op (TRUTH_NOT_EXPR
,
3346 build_binary_op (MODE_HAS_NANS (TYPE_MODE (type
))
3349 convert (type
, arg0
),
3350 convert (type
, arg1
),
3356 /* Recognize certain built-in functions so we can make tree-codes
3357 other than CALL_EXPR. We do this when it enables fold-const.c
3358 to do something useful. */
3359 /* ??? By rights this should go in builtins.c, but only C and C++
3360 implement build_{binary,unary}_op. Not exactly sure what bits
3361 of functionality are actually needed from those functions, or
3362 where the similar functionality exists in the other front ends. */
3365 expand_tree_builtin (function
, params
, coerced_params
)
3366 tree function
, params
, coerced_params
;
3368 if (DECL_BUILT_IN_CLASS (function
) != BUILT_IN_NORMAL
)
3371 switch (DECL_FUNCTION_CODE (function
))
3375 case BUILT_IN_LLABS
:
3376 case BUILT_IN_IMAXABS
:
3378 case BUILT_IN_FABSL
:
3379 case BUILT_IN_FABSF
:
3380 if (coerced_params
== 0)
3381 return integer_zero_node
;
3382 return build_unary_op (ABS_EXPR
, TREE_VALUE (coerced_params
), 0);
3385 case BUILT_IN_CONJF
:
3386 case BUILT_IN_CONJL
:
3387 if (coerced_params
== 0)
3388 return integer_zero_node
;
3389 return build_unary_op (CONJ_EXPR
, TREE_VALUE (coerced_params
), 0);
3391 case BUILT_IN_CREAL
:
3392 case BUILT_IN_CREALF
:
3393 case BUILT_IN_CREALL
:
3394 if (coerced_params
== 0)
3395 return integer_zero_node
;
3396 return build_unary_op (REALPART_EXPR
, TREE_VALUE (coerced_params
), 0);
3398 case BUILT_IN_CIMAG
:
3399 case BUILT_IN_CIMAGF
:
3400 case BUILT_IN_CIMAGL
:
3401 if (coerced_params
== 0)
3402 return integer_zero_node
;
3403 return build_unary_op (IMAGPART_EXPR
, TREE_VALUE (coerced_params
), 0);
3405 case BUILT_IN_ISGREATER
:
3406 return expand_unordered_cmp (function
, params
, UNLE_EXPR
, LE_EXPR
);
3408 case BUILT_IN_ISGREATEREQUAL
:
3409 return expand_unordered_cmp (function
, params
, UNLT_EXPR
, LT_EXPR
);
3411 case BUILT_IN_ISLESS
:
3412 return expand_unordered_cmp (function
, params
, UNGE_EXPR
, GE_EXPR
);
3414 case BUILT_IN_ISLESSEQUAL
:
3415 return expand_unordered_cmp (function
, params
, UNGT_EXPR
, GT_EXPR
);
3417 case BUILT_IN_ISLESSGREATER
:
3418 return expand_unordered_cmp (function
, params
, UNEQ_EXPR
, EQ_EXPR
);
3420 case BUILT_IN_ISUNORDERED
:
3421 return expand_unordered_cmp (function
, params
, UNORDERED_EXPR
, NOP_EXPR
);
3430 /* Returns non-zero if CODE is the code for a statement. */
3433 statement_code_p (code
)
3434 enum tree_code code
;
3459 if (lang_statement_code_p
)
3460 return (*lang_statement_code_p
) (code
);
3465 /* Walk the statement tree, rooted at *tp. Apply FUNC to all the
3466 sub-trees of *TP in a pre-order traversal. FUNC is called with the
3467 DATA and the address of each sub-tree. If FUNC returns a non-NULL
3468 value, the traversal is aborted, and the value returned by FUNC is
3469 returned. If FUNC sets WALK_SUBTREES to zero, then the subtrees of
3470 the node being visited are not walked.
3472 We don't need a without_duplicates variant of this one because the
3473 statement tree is a tree, not a graph. */
3476 walk_stmt_tree (tp
, func
, data
)
3481 enum tree_code code
;
3486 #define WALK_SUBTREE(NODE) \
3489 result = walk_stmt_tree (&(NODE), func, data); \
3495 /* Skip empty subtrees. */
3499 /* Skip subtrees below non-statement nodes. */
3500 if (!statement_code_p (TREE_CODE (*tp
)))
3503 /* Call the function. */
3505 result
= (*func
) (tp
, &walk_subtrees
, data
);
3507 /* If we found something, return it. */
3511 /* FUNC may have modified the tree, recheck that we're looking at a
3513 code
= TREE_CODE (*tp
);
3514 if (!statement_code_p (code
))
3517 /* Visit the subtrees unless FUNC decided that there was nothing
3518 interesting below this point in the tree. */
3521 /* Walk over all the sub-trees of this operand. Statement nodes
3522 never contain RTL, and we needn't worry about TARGET_EXPRs. */
3523 len
= TREE_CODE_LENGTH (code
);
3525 /* Go through the subtrees. We need to do this in forward order so
3526 that the scope of a FOR_EXPR is handled properly. */
3527 for (i
= 0; i
< len
; ++i
)
3528 WALK_SUBTREE (TREE_OPERAND (*tp
, i
));
3531 /* Finally visit the chain. This can be tail-recursion optimized if
3532 we write it this way. */
3533 return walk_stmt_tree (&TREE_CHAIN (*tp
), func
, data
);
3538 /* Used to compare case labels. K1 and K2 are actually tree nodes
3539 representing case labels, or NULL_TREE for a `default' label.
3540 Returns -1 if K1 is ordered before K2, -1 if K1 is ordered after
3541 K2, and 0 if K1 and K2 are equal. */
3544 case_compare (k1
, k2
)
3548 /* Consider a NULL key (such as arises with a `default' label) to be
3549 smaller than anything else. */
3555 return tree_int_cst_compare ((tree
) k1
, (tree
) k2
);
3558 /* Process a case label for the range LOW_VALUE ... HIGH_VALUE. If
3559 LOW_VALUE and HIGH_VALUE are both NULL_TREE then this case label is
3560 actually a `default' label. If only HIGH_VALUE is NULL_TREE, then
3561 case label was declared using the usual C/C++ syntax, rather than
3562 the GNU case range extension. CASES is a tree containing all the
3563 case ranges processed so far; COND is the condition for the
3564 switch-statement itself. Returns the CASE_LABEL created, or
3565 ERROR_MARK_NODE if no CASE_LABEL is created. */
3568 c_add_case_label (cases
, cond
, low_value
, high_value
)
3577 splay_tree_node node
;
3579 /* Create the LABEL_DECL itself. */
3580 label
= build_decl (LABEL_DECL
, NULL_TREE
, NULL_TREE
);
3581 DECL_CONTEXT (label
) = current_function_decl
;
3583 /* If there was an error processing the switch condition, bail now
3584 before we get more confused. */
3585 if (!cond
|| cond
== error_mark_node
)
3587 /* Add a label anyhow so that the back-end doesn't think that
3588 the beginning of the switch is unreachable. */
3590 add_stmt (build_case_label (NULL_TREE
, NULL_TREE
, label
));
3591 return error_mark_node
;
3594 if ((low_value
&& TREE_TYPE (low_value
)
3595 && POINTER_TYPE_P (TREE_TYPE (low_value
)))
3596 || (high_value
&& TREE_TYPE (high_value
)
3597 && POINTER_TYPE_P (TREE_TYPE (high_value
))))
3598 error ("pointers are not permitted as case values");
3600 /* Case ranges are a GNU extension. */
3601 if (high_value
&& pedantic
)
3603 if (c_language
== clk_cplusplus
)
3604 pedwarn ("ISO C++ forbids range expressions in switch statements");
3606 pedwarn ("ISO C forbids range expressions in switch statements");
3609 type
= TREE_TYPE (cond
);
3612 low_value
= check_case_value (low_value
);
3613 low_value
= convert_and_check (type
, low_value
);
3617 high_value
= check_case_value (high_value
);
3618 high_value
= convert_and_check (type
, high_value
);
3621 /* If an error has occurred, bail out now. */
3622 if (low_value
== error_mark_node
|| high_value
== error_mark_node
)
3625 add_stmt (build_case_label (NULL_TREE
, NULL_TREE
, label
));
3626 return error_mark_node
;
3629 /* If the LOW_VALUE and HIGH_VALUE are the same, then this isn't
3630 really a case range, even though it was written that way. Remove
3631 the HIGH_VALUE to simplify later processing. */
3632 if (tree_int_cst_equal (low_value
, high_value
))
3633 high_value
= NULL_TREE
;
3634 if (low_value
&& high_value
3635 && !tree_int_cst_lt (low_value
, high_value
))
3636 warning ("empty range specified");
3638 /* Look up the LOW_VALUE in the table of case labels we already
3640 node
= splay_tree_lookup (cases
, (splay_tree_key
) low_value
);
3641 /* If there was not an exact match, check for overlapping ranges.
3642 There's no need to do this if there's no LOW_VALUE or HIGH_VALUE;
3643 that's a `default' label and the only overlap is an exact match. */
3644 if (!node
&& (low_value
|| high_value
))
3646 splay_tree_node low_bound
;
3647 splay_tree_node high_bound
;
3649 /* Even though there wasn't an exact match, there might be an
3650 overlap between this case range and another case range.
3651 Since we've (inductively) not allowed any overlapping case
3652 ranges, we simply need to find the greatest low case label
3653 that is smaller that LOW_VALUE, and the smallest low case
3654 label that is greater than LOW_VALUE. If there is an overlap
3655 it will occur in one of these two ranges. */
3656 low_bound
= splay_tree_predecessor (cases
,
3657 (splay_tree_key
) low_value
);
3658 high_bound
= splay_tree_successor (cases
,
3659 (splay_tree_key
) low_value
);
3661 /* Check to see if the LOW_BOUND overlaps. It is smaller than
3662 the LOW_VALUE, so there is no need to check unless the
3663 LOW_BOUND is in fact itself a case range. */
3665 && CASE_HIGH ((tree
) low_bound
->value
)
3666 && tree_int_cst_compare (CASE_HIGH ((tree
) low_bound
->value
),
3669 /* Check to see if the HIGH_BOUND overlaps. The low end of that
3670 range is bigger than the low end of the current range, so we
3671 are only interested if the current range is a real range, and
3672 not an ordinary case label. */
3675 && (tree_int_cst_compare ((tree
) high_bound
->key
,
3680 /* If there was an overlap, issue an error. */
3683 tree duplicate
= CASE_LABEL_DECL ((tree
) node
->value
);
3687 error ("duplicate (or overlapping) case value");
3688 error_with_decl (duplicate
,
3689 "this is the first entry overlapping that value");
3693 error ("duplicate case value") ;
3694 error_with_decl (duplicate
, "previously used here");
3698 error ("multiple default labels in one switch");
3699 error_with_decl (duplicate
, "this is the first default label");
3702 add_stmt (build_case_label (NULL_TREE
, NULL_TREE
, label
));
3705 /* Add a CASE_LABEL to the statement-tree. */
3706 case_label
= add_stmt (build_case_label (low_value
, high_value
, label
));
3707 /* Register this case label in the splay tree. */
3708 splay_tree_insert (cases
,
3709 (splay_tree_key
) low_value
,
3710 (splay_tree_value
) case_label
);
3715 /* Finish an expression taking the address of LABEL. Returns an
3716 expression for the address. */
3719 finish_label_address_expr (label
)
3726 if (c_language
== clk_cplusplus
)
3727 pedwarn ("ISO C++ forbids taking the address of a label");
3729 pedwarn ("ISO C forbids taking the address of a label");
3732 label
= lookup_label (label
);
3733 if (label
== NULL_TREE
)
3734 result
= null_pointer_node
;
3737 TREE_USED (label
) = 1;
3738 result
= build1 (ADDR_EXPR
, ptr_type_node
, label
);
3739 TREE_CONSTANT (result
) = 1;
3740 /* The current function in not necessarily uninlinable.
3741 Computed gotos are incompatible with inlining, but the value
3742 here could be used only in a diagnostic, for example. */
3748 /* Hook used by expand_expr to expand language-specific tree codes. */
3751 c_expand_expr (exp
, target
, tmode
, modifier
)
3754 enum machine_mode tmode
;
3755 int modifier
; /* Actually enum_modifier. */
3757 switch (TREE_CODE (exp
))
3763 bool preserve_result
= false;
3765 /* Since expand_expr_stmt calls free_temp_slots after every
3766 expression statement, we must call push_temp_slots here.
3767 Otherwise, any temporaries in use now would be considered
3768 out-of-scope after the first EXPR_STMT from within the
3771 rtl_expr
= expand_start_stmt_expr (!STMT_EXPR_NO_SCOPE (exp
));
3773 /* If we want the result of this expression, find the last
3774 EXPR_STMT in the COMPOUND_STMT and mark it as addressable. */
3775 if (target
!= const0_rtx
3776 && TREE_CODE (STMT_EXPR_STMT (exp
)) == COMPOUND_STMT
3777 && TREE_CODE (COMPOUND_BODY (STMT_EXPR_STMT (exp
))) == SCOPE_STMT
)
3779 tree expr
= COMPOUND_BODY (STMT_EXPR_STMT (exp
));
3780 tree last
= TREE_CHAIN (expr
);
3782 while (TREE_CHAIN (last
))
3785 last
= TREE_CHAIN (last
);
3788 if (TREE_CODE (last
) == SCOPE_STMT
3789 && TREE_CODE (expr
) == EXPR_STMT
)
3791 TREE_ADDRESSABLE (expr
) = 1;
3792 preserve_result
= true;
3796 expand_stmt (STMT_EXPR_STMT (exp
));
3797 expand_end_stmt_expr (rtl_expr
);
3799 result
= expand_expr (rtl_expr
, target
, tmode
, modifier
);
3800 if (preserve_result
&& GET_CODE (result
) == MEM
)
3802 if (GET_MODE (result
) != BLKmode
)
3803 result
= copy_to_reg (result
);
3805 preserve_temp_slots (result
);
3808 /* If the statment-expression does not have a scope, then the
3809 new temporaries we created within it must live beyond the
3810 statement-expression. */
3811 if (STMT_EXPR_NO_SCOPE (exp
))
3812 preserve_temp_slots (NULL_RTX
);
3821 if (TREE_CODE (TREE_OPERAND (exp
, 0)) == ADDR_EXPR
3822 && (TREE_CODE (TREE_OPERAND (TREE_OPERAND (exp
, 0), 0))
3824 && DECL_BUILT_IN (TREE_OPERAND (TREE_OPERAND (exp
, 0), 0))
3825 && (DECL_BUILT_IN_CLASS (TREE_OPERAND (TREE_OPERAND (exp
, 0), 0))
3826 == BUILT_IN_FRONTEND
))
3827 return c_expand_builtin (exp
, target
, tmode
, modifier
);
3833 case COMPOUND_LITERAL_EXPR
:
3835 /* Initialize the anonymous variable declared in the compound
3836 literal, then return the variable. */
3837 tree decl
= COMPOUND_LITERAL_EXPR_DECL (exp
);
3838 emit_local_var (decl
);
3839 return expand_expr (decl
, target
, tmode
, modifier
);
3850 /* Hook used by safe_from_p to handle language-specific tree codes. */
3853 c_safe_from_p (target
, exp
)
3857 /* We can see statements here when processing the body of a
3858 statement-expression. For a declaration statement declaring a
3859 variable, look at the variable's initializer. */
3860 if (TREE_CODE (exp
) == DECL_STMT
)
3862 tree decl
= DECL_STMT_DECL (exp
);
3864 if (TREE_CODE (decl
) == VAR_DECL
3865 && DECL_INITIAL (decl
)
3866 && !safe_from_p (target
, DECL_INITIAL (decl
), /*top_p=*/0))
3870 /* For any statement, we must follow the statement-chain. */
3871 if (statement_code_p (TREE_CODE (exp
)) && TREE_CHAIN (exp
))
3872 return safe_from_p (target
, TREE_CHAIN (exp
), /*top_p=*/0);
3874 /* Assume everything else is safe. */
3878 /* Hook used by unsafe_for_reeval to handle language-specific tree codes. */
3881 c_common_unsafe_for_reeval (exp
)
3884 /* Statement expressions may not be reevaluated, likewise compound
3886 if (TREE_CODE (exp
) == STMT_EXPR
3887 || TREE_CODE (exp
) == COMPOUND_LITERAL_EXPR
)
3890 /* Walk all other expressions. */
3894 /* Hook used by staticp to handle language-specific tree codes. */
3900 if (TREE_CODE (exp
) == COMPOUND_LITERAL_EXPR
3901 && TREE_STATIC (COMPOUND_LITERAL_EXPR_DECL (exp
)))
3906 #define CALLED_AS_BUILT_IN(NODE) \
3907 (!strncmp (IDENTIFIER_POINTER (DECL_NAME (NODE)), "__builtin_", 10))
3910 c_expand_builtin (exp
, target
, tmode
, modifier
)
3913 enum machine_mode tmode
;
3914 enum expand_modifier modifier
;
3916 tree type
= TREE_TYPE (exp
);
3917 tree fndecl
= TREE_OPERAND (TREE_OPERAND (exp
, 0), 0);
3918 tree arglist
= TREE_OPERAND (exp
, 1);
3919 enum built_in_function fcode
= DECL_FUNCTION_CODE (fndecl
);
3920 enum tree_code code
= TREE_CODE (exp
);
3921 const int ignore
= (target
== const0_rtx
3922 || ((code
== NON_LVALUE_EXPR
|| code
== NOP_EXPR
3923 || code
== CONVERT_EXPR
|| code
== REFERENCE_EXPR
3924 || code
== COND_EXPR
)
3925 && TREE_CODE (type
) == VOID_TYPE
));
3927 if (! optimize
&& ! CALLED_AS_BUILT_IN (fndecl
))
3928 return expand_call (exp
, target
, ignore
);
3932 case BUILT_IN_PRINTF
:
3933 target
= c_expand_builtin_printf (arglist
, target
, tmode
,
3934 modifier
, ignore
, /*unlocked=*/ 0);
3939 case BUILT_IN_PRINTF_UNLOCKED
:
3940 target
= c_expand_builtin_printf (arglist
, target
, tmode
,
3941 modifier
, ignore
, /*unlocked=*/ 1);
3946 case BUILT_IN_FPRINTF
:
3947 target
= c_expand_builtin_fprintf (arglist
, target
, tmode
,
3948 modifier
, ignore
, /*unlocked=*/ 0);
3953 case BUILT_IN_FPRINTF_UNLOCKED
:
3954 target
= c_expand_builtin_fprintf (arglist
, target
, tmode
,
3955 modifier
, ignore
, /*unlocked=*/ 1);
3960 default: /* just do library call, if unknown builtin */
3961 error ("built-in function `%s' not currently supported",
3962 IDENTIFIER_POINTER (DECL_NAME (fndecl
)));
3965 /* The switch statement above can drop through to cause the function
3966 to be called normally. */
3967 return expand_call (exp
, target
, ignore
);
3970 /* Check an arglist to *printf for problems. The arglist should start
3971 at the format specifier, with the remaining arguments immediately
3974 is_valid_printf_arglist (arglist
)
3977 /* Save this value so we can restore it later. */
3978 const int SAVE_pedantic
= pedantic
;
3979 int diagnostic_occurred
= 0;
3982 /* Set this to a known value so the user setting won't affect code
3985 /* Check to make sure there are no format specifier errors. */
3986 attrs
= tree_cons (get_identifier ("format"),
3987 tree_cons (NULL_TREE
,
3988 get_identifier ("printf"),
3989 tree_cons (NULL_TREE
,
3991 tree_cons (NULL_TREE
,
3995 check_function_format (&diagnostic_occurred
, attrs
, arglist
);
3997 /* Restore the value of `pedantic'. */
3998 pedantic
= SAVE_pedantic
;
4000 /* If calling `check_function_format_ptr' produces a warning, we
4001 return false, otherwise we return true. */
4002 return ! diagnostic_occurred
;
4005 /* If the arguments passed to printf are suitable for optimizations,
4006 we attempt to transform the call. */
4008 c_expand_builtin_printf (arglist
, target
, tmode
, modifier
, ignore
, unlocked
)
4011 enum machine_mode tmode
;
4012 enum expand_modifier modifier
;
4016 tree fn_putchar
= unlocked
?
4017 built_in_decls
[BUILT_IN_PUTCHAR_UNLOCKED
] : built_in_decls
[BUILT_IN_PUTCHAR
];
4018 tree fn_puts
= unlocked
?
4019 built_in_decls
[BUILT_IN_PUTS_UNLOCKED
] : built_in_decls
[BUILT_IN_PUTS
];
4020 tree fn
, format_arg
, stripped_string
;
4022 /* If the return value is used, or the replacement _DECL isn't
4023 initialized, don't do the transformation. */
4024 if (!ignore
|| !fn_putchar
|| !fn_puts
)
4027 /* Verify the required arguments in the original call. */
4029 || (TREE_CODE (TREE_TYPE (TREE_VALUE (arglist
))) != POINTER_TYPE
))
4032 /* Check the specifier vs. the parameters. */
4033 if (!is_valid_printf_arglist (arglist
))
4036 format_arg
= TREE_VALUE (arglist
);
4037 stripped_string
= format_arg
;
4038 STRIP_NOPS (stripped_string
);
4039 if (stripped_string
&& TREE_CODE (stripped_string
) == ADDR_EXPR
)
4040 stripped_string
= TREE_OPERAND (stripped_string
, 0);
4042 /* If the format specifier isn't a STRING_CST, punt. */
4043 if (TREE_CODE (stripped_string
) != STRING_CST
)
4046 /* OK! We can attempt optimization. */
4048 /* If the format specifier was "%s\n", call __builtin_puts(arg2). */
4049 if (strcmp (TREE_STRING_POINTER (stripped_string
), "%s\n") == 0)
4051 arglist
= TREE_CHAIN (arglist
);
4054 /* If the format specifier was "%c", call __builtin_putchar (arg2). */
4055 else if (strcmp (TREE_STRING_POINTER (stripped_string
), "%c") == 0)
4057 arglist
= TREE_CHAIN (arglist
);
4062 /* We can't handle anything else with % args or %% ... yet. */
4063 if (strchr (TREE_STRING_POINTER (stripped_string
), '%'))
4066 /* If the resulting constant string has a length of 1, call
4067 putchar. Note, TREE_STRING_LENGTH includes the terminating
4068 NULL in its count. */
4069 if (TREE_STRING_LENGTH (stripped_string
) == 2)
4071 /* Given printf("c"), (where c is any one character,)
4072 convert "c"[0] to an int and pass that to the replacement
4074 arglist
= build_int_2 (TREE_STRING_POINTER (stripped_string
)[0], 0);
4075 arglist
= build_tree_list (NULL_TREE
, arglist
);
4079 /* If the resulting constant was "string\n", call
4080 __builtin_puts("string"). Ensure "string" has at least one
4081 character besides the trailing \n. Note, TREE_STRING_LENGTH
4082 includes the terminating NULL in its count. */
4083 else if (TREE_STRING_LENGTH (stripped_string
) > 2
4084 && TREE_STRING_POINTER (stripped_string
)
4085 [TREE_STRING_LENGTH (stripped_string
) - 2] == '\n')
4087 /* Create a NULL-terminated string that's one char shorter
4088 than the original, stripping off the trailing '\n'. */
4089 const int newlen
= TREE_STRING_LENGTH (stripped_string
) - 1;
4090 char *newstr
= (char *) alloca (newlen
);
4091 memcpy (newstr
, TREE_STRING_POINTER (stripped_string
), newlen
- 1);
4092 newstr
[newlen
- 1] = 0;
4094 arglist
= fix_string_type (build_string (newlen
, newstr
));
4095 arglist
= build_tree_list (NULL_TREE
, arglist
);
4099 /* We'd like to arrange to call fputs(string) here, but we
4100 need stdout and don't have a way to get it ... yet. */
4104 return expand_expr (build_function_call (fn
, arglist
),
4105 (ignore
? const0_rtx
: target
),
4109 /* If the arguments passed to fprintf are suitable for optimizations,
4110 we attempt to transform the call. */
4112 c_expand_builtin_fprintf (arglist
, target
, tmode
, modifier
, ignore
, unlocked
)
4115 enum machine_mode tmode
;
4116 enum expand_modifier modifier
;
4120 tree fn_fputc
= unlocked
?
4121 built_in_decls
[BUILT_IN_FPUTC_UNLOCKED
] : built_in_decls
[BUILT_IN_FPUTC
];
4122 tree fn_fputs
= unlocked
?
4123 built_in_decls
[BUILT_IN_FPUTS_UNLOCKED
] : built_in_decls
[BUILT_IN_FPUTS
];
4124 tree fn
, format_arg
, stripped_string
;
4126 /* If the return value is used, or the replacement _DECL isn't
4127 initialized, don't do the transformation. */
4128 if (!ignore
|| !fn_fputc
|| !fn_fputs
)
4131 /* Verify the required arguments in the original call. */
4133 || (TREE_CODE (TREE_TYPE (TREE_VALUE (arglist
))) != POINTER_TYPE
)
4134 || (TREE_CHAIN (arglist
) == 0)
4135 || (TREE_CODE (TREE_TYPE (TREE_VALUE (TREE_CHAIN (arglist
)))) !=
4139 /* Check the specifier vs. the parameters. */
4140 if (!is_valid_printf_arglist (TREE_CHAIN (arglist
)))
4143 format_arg
= TREE_VALUE (TREE_CHAIN (arglist
));
4144 stripped_string
= format_arg
;
4145 STRIP_NOPS (stripped_string
);
4146 if (stripped_string
&& TREE_CODE (stripped_string
) == ADDR_EXPR
)
4147 stripped_string
= TREE_OPERAND (stripped_string
, 0);
4149 /* If the format specifier isn't a STRING_CST, punt. */
4150 if (TREE_CODE (stripped_string
) != STRING_CST
)
4153 /* OK! We can attempt optimization. */
4155 /* If the format specifier was "%s", call __builtin_fputs(arg3, arg1). */
4156 if (strcmp (TREE_STRING_POINTER (stripped_string
), "%s") == 0)
4158 tree newarglist
= build_tree_list (NULL_TREE
, TREE_VALUE (arglist
));
4159 arglist
= tree_cons (NULL_TREE
,
4160 TREE_VALUE (TREE_CHAIN (TREE_CHAIN (arglist
))),
4164 /* If the format specifier was "%c", call __builtin_fputc (arg3, arg1). */
4165 else if (strcmp (TREE_STRING_POINTER (stripped_string
), "%c") == 0)
4167 tree newarglist
= build_tree_list (NULL_TREE
, TREE_VALUE (arglist
));
4168 arglist
= tree_cons (NULL_TREE
,
4169 TREE_VALUE (TREE_CHAIN (TREE_CHAIN (arglist
))),
4175 /* We can't handle anything else with % args or %% ... yet. */
4176 if (strchr (TREE_STRING_POINTER (stripped_string
), '%'))
4179 /* When "string" doesn't contain %, replace all cases of
4180 fprintf(stream,string) with fputs(string,stream). The fputs
4181 builtin will take take of special cases like length==1. */
4182 arglist
= tree_cons (NULL_TREE
, TREE_VALUE (TREE_CHAIN (arglist
)),
4183 build_tree_list (NULL_TREE
, TREE_VALUE (arglist
)));
4187 return expand_expr (build_function_call (fn
, arglist
),
4188 (ignore
? const0_rtx
: target
),
4193 /* Given a boolean expression ARG, return a tree representing an increment
4194 or decrement (as indicated by CODE) of ARG. The front end must check for
4195 invalid cases (e.g., decrement in C++). */
4197 boolean_increment (code
, arg
)
4198 enum tree_code code
;
4202 tree true_res
= (c_language
== clk_cplusplus
4204 : c_bool_true_node
);
4205 arg
= stabilize_reference (arg
);
4208 case PREINCREMENT_EXPR
:
4209 val
= build (MODIFY_EXPR
, TREE_TYPE (arg
), arg
, true_res
);
4211 case POSTINCREMENT_EXPR
:
4212 val
= build (MODIFY_EXPR
, TREE_TYPE (arg
), arg
, true_res
);
4213 arg
= save_expr (arg
);
4214 val
= build (COMPOUND_EXPR
, TREE_TYPE (arg
), val
, arg
);
4215 val
= build (COMPOUND_EXPR
, TREE_TYPE (arg
), arg
, val
);
4217 case PREDECREMENT_EXPR
:
4218 val
= build (MODIFY_EXPR
, TREE_TYPE (arg
), arg
, invert_truthvalue (arg
));
4220 case POSTDECREMENT_EXPR
:
4221 val
= build (MODIFY_EXPR
, TREE_TYPE (arg
), arg
, invert_truthvalue (arg
));
4222 arg
= save_expr (arg
);
4223 val
= build (COMPOUND_EXPR
, TREE_TYPE (arg
), val
, arg
);
4224 val
= build (COMPOUND_EXPR
, TREE_TYPE (arg
), arg
, val
);
4229 TREE_SIDE_EFFECTS (val
) = 1;
4233 /* Handle C and C++ default attributes. */
4235 enum built_in_attribute
4237 #define DEF_ATTR_NULL_TREE(ENUM) ENUM,
4238 #define DEF_ATTR_INT(ENUM, VALUE) ENUM,
4239 #define DEF_ATTR_IDENT(ENUM, STRING) ENUM,
4240 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) ENUM,
4241 #define DEF_FN_ATTR(NAME, ATTRS, PREDICATE) /* No entry needed in enum. */
4242 #include "builtin-attrs.def"
4243 #undef DEF_ATTR_NULL_TREE
4245 #undef DEF_ATTR_IDENT
4246 #undef DEF_ATTR_TREE_LIST
4251 static GTY(()) tree built_in_attributes
[(int) ATTR_LAST
];
4253 static bool c_attrs_initialized
= false;
4255 static void c_init_attributes
PARAMS ((void));
4257 /* Common initialization before parsing options. */
4259 c_common_init_options (lang
)
4260 enum c_language_kind lang
;
4263 parse_in
= cpp_create_reader (lang
== clk_c
|| lang
== clk_objective_c
4264 ? CLK_GNUC89
: CLK_GNUCXX
);
4265 if (lang
== clk_objective_c
)
4266 cpp_get_options (parse_in
)->objc
= 1;
4268 /* Mark as "unspecified" (see c_common_post_options). */
4269 flag_bounds_check
= -1;
4272 /* Post-switch processing. */
4274 c_common_post_options ()
4276 cpp_post_options (parse_in
);
4278 flag_inline_trees
= 1;
4280 /* Use tree inlining if possible. Function instrumentation is only
4281 done in the RTL level, so we disable tree inlining. */
4282 if (! flag_instrument_function_entry_exit
)
4284 if (!flag_no_inline
)
4286 if (flag_inline_functions
)
4288 flag_inline_trees
= 2;
4289 flag_inline_functions
= 0;
4293 /* If still "unspecified", make it match -fbounded-pointers. */
4294 if (flag_bounds_check
== -1)
4295 flag_bounds_check
= flag_bounded_pointers
;
4297 /* Special format checking options don't work without -Wformat; warn if
4299 if (warn_format_y2k
&& !warn_format
)
4300 warning ("-Wformat-y2k ignored without -Wformat");
4301 if (warn_format_extra_args
&& !warn_format
)
4302 warning ("-Wformat-extra-args ignored without -Wformat");
4303 if (warn_format_zero_length
&& !warn_format
)
4304 warning ("-Wformat-zero-length ignored without -Wformat");
4305 if (warn_format_nonliteral
&& !warn_format
)
4306 warning ("-Wformat-nonliteral ignored without -Wformat");
4307 if (warn_format_security
&& !warn_format
)
4308 warning ("-Wformat-security ignored without -Wformat");
4309 if (warn_missing_format_attribute
&& !warn_format
)
4310 warning ("-Wmissing-format-attribute ignored without -Wformat");
4312 /* If an error has occurred in cpplib, note it so we fail
4314 errorcount
+= cpp_errors (parse_in
);
4317 /* Hook that registers front end and target-specific built-ins. */
4319 cb_register_builtins (pfile
)
4322 /* -undef turns off target-specific built-ins. */
4326 if (c_language
== clk_cplusplus
)
4328 if (SUPPORTS_ONE_ONLY
)
4329 cpp_define (pfile
, "__GXX_WEAK__=1");
4331 cpp_define (pfile
, "__GXX_WEAK__=0");
4334 /* libgcc needs to know this. */
4335 if (USING_SJLJ_EXCEPTIONS
)
4336 cpp_define (pfile
, "__USING_SJLJ_EXCEPTIONS__");
4338 /* stddef.h needs to know these. */
4339 builtin_define_with_value ("__SIZE_TYPE__", SIZE_TYPE
, 0);
4340 builtin_define_with_value ("__PTRDIFF_TYPE__", PTRDIFF_TYPE
, 0);
4341 builtin_define_with_value ("__WCHAR_TYPE__", MODIFIED_WCHAR_TYPE
, 0);
4342 builtin_define_with_value ("__WINT_TYPE__", WINT_TYPE
, 0);
4344 /* limits.h needs to know these. */
4345 builtin_define_type_max ("__SCHAR_MAX__", signed_char_type_node
, 0);
4346 builtin_define_type_max ("__SHRT_MAX__", short_integer_type_node
, 0);
4347 builtin_define_type_max ("__INT_MAX__", integer_type_node
, 0);
4348 builtin_define_type_max ("__LONG_MAX__", long_integer_type_node
, 1);
4349 builtin_define_type_max ("__LONG_LONG_MAX__", long_long_integer_type_node
, 2);
4353 sprintf (buf
, "%d", (int) TYPE_PRECISION (signed_char_type_node
));
4354 builtin_define_with_value ("__CHAR_BIT__", buf
, 0);
4357 /* For use in assembly language. */
4358 builtin_define_with_value ("__REGISTER_PREFIX__", REGISTER_PREFIX
, 0);
4359 builtin_define_with_value ("__USER_LABEL_PREFIX__", user_label_prefix
, 0);
4362 builtin_define_with_value ("__VERSION__", version_string
, 1);
4364 /* Other target-independent built-ins determined by command-line
4367 cpp_define (pfile
, "__OPTIMIZE_SIZE__");
4369 cpp_define (pfile
, "__OPTIMIZE__");
4372 cpp_define (pfile
, "__STDC_HOSTED__=1");
4374 cpp_define (pfile
, "__STDC_HOSTED__=0");
4376 if (fast_math_flags_set_p ())
4377 cpp_define (pfile
, "__FAST_MATH__");
4379 cpp_define (pfile
, "__NO_INLINE__");
4382 cpp_define (pfile
, "__STRICT_ANSI__");
4384 if (!flag_signed_char
)
4385 cpp_define (pfile
, "__CHAR_UNSIGNED__");
4387 /* A straightforward target hook doesn't work, because of problems
4388 linking that hook's body when part of non-C front ends. */
4389 # define preprocessing_asm_p() (cpp_get_options (pfile)->lang == CLK_ASM)
4390 # define builtin_define(TXT) cpp_define (pfile, TXT)
4391 # define builtin_assert(TXT) cpp_assert (pfile, TXT)
4392 TARGET_CPU_CPP_BUILTINS ();
4393 TARGET_OS_CPP_BUILTINS ();
4396 /* Pass an object-like macro. If it doesn't lie in the user's
4397 namespace, defines it unconditionally. Otherwise define a version
4398 with two leading underscores, and another version with two leading
4399 and trailing underscores, and define the original only if an ISO
4400 standard was not nominated.
4402 e.g. passing "unix" defines "__unix", "__unix__" and possibly
4403 "unix". Passing "_mips" defines "__mips", "__mips__" and possibly
4406 builtin_define_std (macro
)
4409 size_t len
= strlen (macro
);
4410 char *buff
= alloca (len
+ 5);
4414 /* prepend __ (or maybe just _) if in user's namespace. */
4415 memcpy (p
, macro
, len
+ 1);
4416 if (!( *p
== '_' && (p
[1] == '_' || ISUPPER (p
[1]))))
4423 cpp_define (parse_in
, p
);
4425 /* If it was in user's namespace... */
4428 /* Define the macro with leading and following __. */
4434 cpp_define (parse_in
, p
);
4436 /* Finally, define the original macro if permitted. */
4438 cpp_define (parse_in
, macro
);
4442 /* Pass an object-like macro and a value to define it to. The third
4443 parameter says whether or not to turn the value into a string
4446 builtin_define_with_value (macro
, expansion
, is_str
)
4448 const char *expansion
;
4452 size_t mlen
= strlen (macro
);
4453 size_t elen
= strlen (expansion
);
4454 size_t extra
= 2; /* space for an = and a NUL */
4457 extra
+= 2; /* space for two quote marks */
4459 buf
= alloca (mlen
+ elen
+ extra
);
4461 sprintf (buf
, "%s=\"%s\"", macro
, expansion
);
4463 sprintf (buf
, "%s=%s", macro
, expansion
);
4465 cpp_define (parse_in
, buf
);
4468 /* Define MAX for TYPE based on the precision of the type, which is assumed
4469 to be signed. IS_LONG is 1 for type "long" and 2 for "long long". */
4472 builtin_define_type_max (macro
, type
, is_long
)
4479 size_t mlen
, vlen
, extra
;
4481 /* Pre-rendering the values mean we don't have to futz with printing a
4482 multi-word decimal value. There are also a very limited number of
4483 precisions that we support, so it's really a waste of time. */
4484 switch (TYPE_PRECISION (type
))
4493 value
= "2147483647";
4496 value
= "9223372036854775807";
4499 value
= "170141183460469231731687303715884105727";
4505 mlen
= strlen (macro
);
4506 vlen
= strlen (value
);
4507 extra
= 2 + is_long
;
4508 buf
= alloca (mlen
+ vlen
+ extra
);
4510 sprintf (buf
, "%s=%s%s", macro
, value
,
4511 (is_long
== 1 ? "L" : is_long
== 2 ? "LL" : ""));
4513 cpp_define (parse_in
, buf
);
4516 /* Front end initialization common to C, ObjC and C++. */
4518 c_common_init (filename
)
4519 const char *filename
;
4521 cpp_options
*options
= cpp_get_options (parse_in
);
4523 /* Set up preprocessor arithmetic. Must be done after call to
4524 c_common_nodes_and_builtins for wchar_type_node to be good. */
4525 options
->precision
= TYPE_PRECISION (intmax_type_node
);
4526 options
->char_precision
= TYPE_PRECISION (char_type_node
);
4527 options
->int_precision
= TYPE_PRECISION (integer_type_node
);
4528 options
->wchar_precision
= TYPE_PRECISION (wchar_type_node
);
4529 options
->unsigned_wchar
= TREE_UNSIGNED (wchar_type_node
);
4530 options
->unsigned_char
= !flag_signed_char
;
4531 options
->warn_multichar
= warn_multichar
;
4532 options
->stdc_0_in_system_headers
= STDC_0_IN_SYSTEM_HEADERS
;
4534 /* We want -Wno-long-long to override -pedantic -std=non-c99
4535 whatever the ordering. */
4536 options
->warn_long_long
= warn_long_long
&& !flag_isoc99
&& pedantic
;
4538 /* Register preprocessor built-ins before calls to
4540 cpp_get_callbacks (parse_in
)->register_builtins
= cb_register_builtins
;
4542 /* NULL is passed up to toplev.c and we exit quickly. */
4543 if (flag_preprocess_only
)
4545 cpp_preprocess_file (parse_in
);
4549 /* Do this before initializing pragmas, as then cpplib's hash table
4551 filename
= init_c_lex (filename
);
4555 if (!c_attrs_initialized
)
4556 c_init_attributes ();
4561 /* Common finish hook for the C, ObjC and C++ front ends. */
4565 cpp_finish (parse_in
);
4567 /* For performance, avoid tearing down cpplib's internal structures.
4568 Call cpp_errors () instead of cpp_destroy (). */
4569 errorcount
+= cpp_errors (parse_in
);
4573 c_init_attributes ()
4575 /* Fill in the built_in_attributes array. */
4576 #define DEF_ATTR_NULL_TREE(ENUM) \
4577 built_in_attributes[(int) ENUM] = NULL_TREE;
4578 #define DEF_ATTR_INT(ENUM, VALUE) \
4579 built_in_attributes[(int) ENUM] = build_int_2 (VALUE, VALUE < 0 ? -1 : 0);
4580 #define DEF_ATTR_IDENT(ENUM, STRING) \
4581 built_in_attributes[(int) ENUM] = get_identifier (STRING);
4582 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) \
4583 built_in_attributes[(int) ENUM] \
4584 = tree_cons (built_in_attributes[(int) PURPOSE], \
4585 built_in_attributes[(int) VALUE], \
4586 built_in_attributes[(int) CHAIN]);
4587 #define DEF_FN_ATTR(NAME, ATTRS, PREDICATE) /* No initialization needed. */
4588 #include "builtin-attrs.def"
4589 #undef DEF_ATTR_NULL_TREE
4591 #undef DEF_ATTR_IDENT
4592 #undef DEF_ATTR_TREE_LIST
4594 c_attrs_initialized
= true;
4597 /* Depending on the name of DECL, apply default attributes to it. */
4600 c_common_insert_default_attributes (decl
)
4603 tree name
= DECL_NAME (decl
);
4605 if (!c_attrs_initialized
)
4606 c_init_attributes ();
4608 #define DEF_ATTR_NULL_TREE(ENUM) /* Nothing needed after initialization. */
4609 #define DEF_ATTR_INT(ENUM, VALUE)
4610 #define DEF_ATTR_IDENT(ENUM, STRING)
4611 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN)
4612 #define DEF_FN_ATTR(NAME, ATTRS, PREDICATE) \
4613 if ((PREDICATE) && name == built_in_attributes[(int) NAME]) \
4614 decl_attributes (&decl, built_in_attributes[(int) ATTRS], \
4615 ATTR_FLAG_BUILT_IN);
4616 #include "builtin-attrs.def"
4617 #undef DEF_ATTR_NULL_TREE
4619 #undef DEF_ATTR_IDENT
4620 #undef DEF_ATTR_TREE_LIST
4624 /* Output a -Wshadow warning MSGID about NAME, an IDENTIFIER_NODE, and
4625 additionally give the location of the previous declaration DECL. */
4627 shadow_warning (msgid
, name
, decl
)
4631 warning ("declaration of `%s' shadows %s", IDENTIFIER_POINTER (name
), msgid
);
4632 warning_with_file_and_line (DECL_SOURCE_FILE (decl
),
4633 DECL_SOURCE_LINE (decl
),
4634 "shadowed declaration is here");
4637 /* Attribute handlers common to C front ends. */
4639 /* Handle a "packed" attribute; arguments as in
4640 struct attribute_spec.handler. */
4643 handle_packed_attribute (node
, name
, args
, flags
, no_add_attrs
)
4646 tree args ATTRIBUTE_UNUSED
;
4653 if (TREE_CODE (*node
) == TYPE_DECL
)
4654 type
= &TREE_TYPE (*node
);
4661 if (!(flags
& (int) ATTR_FLAG_TYPE_IN_PLACE
))
4662 *type
= build_type_copy (*type
);
4663 TYPE_PACKED (*type
) = 1;
4665 else if (TREE_CODE (*node
) == FIELD_DECL
)
4666 DECL_PACKED (*node
) = 1;
4667 /* We can't set DECL_PACKED for a VAR_DECL, because the bit is
4668 used for DECL_REGISTER. It wouldn't mean anything anyway. */
4671 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name
));
4672 *no_add_attrs
= true;
4678 /* Handle a "nocommon" attribute; arguments as in
4679 struct attribute_spec.handler. */
4682 handle_nocommon_attribute (node
, name
, args
, flags
, no_add_attrs
)
4685 tree args ATTRIBUTE_UNUSED
;
4686 int flags ATTRIBUTE_UNUSED
;
4689 if (TREE_CODE (*node
) == VAR_DECL
)
4690 DECL_COMMON (*node
) = 0;
4693 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name
));
4694 *no_add_attrs
= true;
4700 /* Handle a "common" attribute; arguments as in
4701 struct attribute_spec.handler. */
4704 handle_common_attribute (node
, name
, args
, flags
, no_add_attrs
)
4707 tree args ATTRIBUTE_UNUSED
;
4708 int flags ATTRIBUTE_UNUSED
;
4711 if (TREE_CODE (*node
) == VAR_DECL
)
4712 DECL_COMMON (*node
) = 1;
4715 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name
));
4716 *no_add_attrs
= true;
4722 /* Handle a "noreturn" attribute; arguments as in
4723 struct attribute_spec.handler. */
4726 handle_noreturn_attribute (node
, name
, args
, flags
, no_add_attrs
)
4729 tree args ATTRIBUTE_UNUSED
;
4730 int flags ATTRIBUTE_UNUSED
;
4733 tree type
= TREE_TYPE (*node
);
4735 /* See FIXME comment in c_common_attribute_table. */
4736 if (TREE_CODE (*node
) == FUNCTION_DECL
)
4737 TREE_THIS_VOLATILE (*node
) = 1;
4738 else if (TREE_CODE (type
) == POINTER_TYPE
4739 && TREE_CODE (TREE_TYPE (type
)) == FUNCTION_TYPE
)
4741 = build_pointer_type
4742 (build_type_variant (TREE_TYPE (type
),
4743 TREE_READONLY (TREE_TYPE (type
)), 1));
4746 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name
));
4747 *no_add_attrs
= true;
4753 /* Handle a "noinline" attribute; arguments as in
4754 struct attribute_spec.handler. */
4757 handle_noinline_attribute (node
, name
, args
, flags
, no_add_attrs
)
4760 tree args ATTRIBUTE_UNUSED
;
4761 int flags ATTRIBUTE_UNUSED
;
4764 if (TREE_CODE (*node
) == FUNCTION_DECL
)
4765 DECL_UNINLINABLE (*node
) = 1;
4768 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name
));
4769 *no_add_attrs
= true;
4775 /* Handle a "always_inline" attribute; arguments as in
4776 struct attribute_spec.handler. */
4779 handle_always_inline_attribute (node
, name
, args
, flags
, no_add_attrs
)
4782 tree args ATTRIBUTE_UNUSED
;
4783 int flags ATTRIBUTE_UNUSED
;
4786 if (TREE_CODE (*node
) == FUNCTION_DECL
)
4788 /* Do nothing else, just set the attribute. We'll get at
4789 it later with lookup_attribute. */
4793 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name
));
4794 *no_add_attrs
= true;
4800 /* Handle a "used" attribute; arguments as in
4801 struct attribute_spec.handler. */
4804 handle_used_attribute (node
, name
, args
, flags
, no_add_attrs
)
4807 tree args ATTRIBUTE_UNUSED
;
4808 int flags ATTRIBUTE_UNUSED
;
4811 if (TREE_CODE (*node
) == FUNCTION_DECL
)
4812 TREE_SYMBOL_REFERENCED (DECL_ASSEMBLER_NAME (*node
))
4813 = TREE_USED (*node
) = 1;
4816 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name
));
4817 *no_add_attrs
= true;
4823 /* Handle a "unused" attribute; arguments as in
4824 struct attribute_spec.handler. */
4827 handle_unused_attribute (node
, name
, args
, flags
, no_add_attrs
)
4830 tree args ATTRIBUTE_UNUSED
;
4838 if (TREE_CODE (decl
) == PARM_DECL
4839 || TREE_CODE (decl
) == VAR_DECL
4840 || TREE_CODE (decl
) == FUNCTION_DECL
4841 || TREE_CODE (decl
) == LABEL_DECL
4842 || TREE_CODE (decl
) == TYPE_DECL
)
4843 TREE_USED (decl
) = 1;
4846 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name
));
4847 *no_add_attrs
= true;
4852 if (!(flags
& (int) ATTR_FLAG_TYPE_IN_PLACE
))
4853 *node
= build_type_copy (*node
);
4854 TREE_USED (*node
) = 1;
4860 /* Handle a "const" attribute; arguments as in
4861 struct attribute_spec.handler. */
4864 handle_const_attribute (node
, name
, args
, flags
, no_add_attrs
)
4867 tree args ATTRIBUTE_UNUSED
;
4868 int flags ATTRIBUTE_UNUSED
;
4871 tree type
= TREE_TYPE (*node
);
4873 /* See FIXME comment on noreturn in c_common_attribute_table. */
4874 if (TREE_CODE (*node
) == FUNCTION_DECL
)
4875 TREE_READONLY (*node
) = 1;
4876 else if (TREE_CODE (type
) == POINTER_TYPE
4877 && TREE_CODE (TREE_TYPE (type
)) == FUNCTION_TYPE
)
4879 = build_pointer_type
4880 (build_type_variant (TREE_TYPE (type
), 1,
4881 TREE_THIS_VOLATILE (TREE_TYPE (type
))));
4884 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name
));
4885 *no_add_attrs
= true;
4891 /* Handle a "transparent_union" attribute; arguments as in
4892 struct attribute_spec.handler. */
4895 handle_transparent_union_attribute (node
, name
, args
, flags
, no_add_attrs
)
4898 tree args ATTRIBUTE_UNUSED
;
4902 tree decl
= NULL_TREE
;
4909 type
= &TREE_TYPE (decl
);
4910 is_type
= TREE_CODE (*node
) == TYPE_DECL
;
4912 else if (TYPE_P (*node
))
4913 type
= node
, is_type
= 1;
4916 && TREE_CODE (*type
) == UNION_TYPE
4918 || (TYPE_FIELDS (*type
) != 0
4919 && TYPE_MODE (*type
) == DECL_MODE (TYPE_FIELDS (*type
)))))
4921 if (!(flags
& (int) ATTR_FLAG_TYPE_IN_PLACE
))
4922 *type
= build_type_copy (*type
);
4923 TYPE_TRANSPARENT_UNION (*type
) = 1;
4925 else if (decl
!= 0 && TREE_CODE (decl
) == PARM_DECL
4926 && TREE_CODE (*type
) == UNION_TYPE
4927 && TYPE_MODE (*type
) == DECL_MODE (TYPE_FIELDS (*type
)))
4928 DECL_TRANSPARENT_UNION (decl
) = 1;
4931 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name
));
4932 *no_add_attrs
= true;
4938 /* Handle a "constructor" attribute; arguments as in
4939 struct attribute_spec.handler. */
4942 handle_constructor_attribute (node
, name
, args
, flags
, no_add_attrs
)
4945 tree args ATTRIBUTE_UNUSED
;
4946 int flags ATTRIBUTE_UNUSED
;
4950 tree type
= TREE_TYPE (decl
);
4952 if (TREE_CODE (decl
) == FUNCTION_DECL
4953 && TREE_CODE (type
) == FUNCTION_TYPE
4954 && decl_function_context (decl
) == 0)
4956 DECL_STATIC_CONSTRUCTOR (decl
) = 1;
4957 TREE_USED (decl
) = 1;
4961 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name
));
4962 *no_add_attrs
= true;
4968 /* Handle a "destructor" attribute; arguments as in
4969 struct attribute_spec.handler. */
4972 handle_destructor_attribute (node
, name
, args
, flags
, no_add_attrs
)
4975 tree args ATTRIBUTE_UNUSED
;
4976 int flags ATTRIBUTE_UNUSED
;
4980 tree type
= TREE_TYPE (decl
);
4982 if (TREE_CODE (decl
) == FUNCTION_DECL
4983 && TREE_CODE (type
) == FUNCTION_TYPE
4984 && decl_function_context (decl
) == 0)
4986 DECL_STATIC_DESTRUCTOR (decl
) = 1;
4987 TREE_USED (decl
) = 1;
4991 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name
));
4992 *no_add_attrs
= true;
4998 /* Handle a "mode" attribute; arguments as in
4999 struct attribute_spec.handler. */
5002 handle_mode_attribute (node
, name
, args
, flags
, no_add_attrs
)
5006 int flags ATTRIBUTE_UNUSED
;
5011 *no_add_attrs
= true;
5013 if (TREE_CODE (TREE_VALUE (args
)) != IDENTIFIER_NODE
)
5014 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name
));
5018 const char *p
= IDENTIFIER_POINTER (TREE_VALUE (args
));
5019 int len
= strlen (p
);
5020 enum machine_mode mode
= VOIDmode
;
5023 if (len
> 4 && p
[0] == '_' && p
[1] == '_'
5024 && p
[len
- 1] == '_' && p
[len
- 2] == '_')
5026 char *newp
= (char *) alloca (len
- 1);
5028 strcpy (newp
, &p
[2]);
5029 newp
[len
- 4] = '\0';
5033 /* Change this type to have a type with the specified mode.
5034 First check for the special modes. */
5035 if (! strcmp (p
, "byte"))
5037 else if (!strcmp (p
, "word"))
5039 else if (! strcmp (p
, "pointer"))
5042 for (j
= 0; j
< NUM_MACHINE_MODES
; j
++)
5043 if (!strcmp (p
, GET_MODE_NAME (j
)))
5044 mode
= (enum machine_mode
) j
;
5046 if (mode
== VOIDmode
)
5047 error ("unknown machine mode `%s'", p
);
5048 else if (0 == (typefm
= (*lang_hooks
.types
.type_for_mode
)
5049 (mode
, TREE_UNSIGNED (type
))))
5050 error ("no data type for mode `%s'", p
);
5053 /* If this is a vector, make sure we either have hardware
5054 support, or we can emulate it. */
5055 if ((GET_MODE_CLASS (mode
) == MODE_VECTOR_INT
5056 || GET_MODE_CLASS (mode
) == MODE_VECTOR_FLOAT
)
5057 && !vector_mode_valid_p (mode
))
5059 error ("unable to emulate '%s'", GET_MODE_NAME (mode
));
5064 /* No need to layout the type here. The caller should do this. */
5071 /* Handle a "section" attribute; arguments as in
5072 struct attribute_spec.handler. */
5075 handle_section_attribute (node
, name
, args
, flags
, no_add_attrs
)
5077 tree name ATTRIBUTE_UNUSED
;
5079 int flags ATTRIBUTE_UNUSED
;
5084 if (targetm
.have_named_sections
)
5086 if ((TREE_CODE (decl
) == FUNCTION_DECL
5087 || TREE_CODE (decl
) == VAR_DECL
)
5088 && TREE_CODE (TREE_VALUE (args
)) == STRING_CST
)
5090 if (TREE_CODE (decl
) == VAR_DECL
5091 && current_function_decl
!= NULL_TREE
5092 && ! TREE_STATIC (decl
))
5094 error_with_decl (decl
,
5095 "section attribute cannot be specified for local variables");
5096 *no_add_attrs
= true;
5099 /* The decl may have already been given a section attribute
5100 from a previous declaration. Ensure they match. */
5101 else if (DECL_SECTION_NAME (decl
) != NULL_TREE
5102 && strcmp (TREE_STRING_POINTER (DECL_SECTION_NAME (decl
)),
5103 TREE_STRING_POINTER (TREE_VALUE (args
))) != 0)
5105 error_with_decl (*node
,
5106 "section of `%s' conflicts with previous declaration");
5107 *no_add_attrs
= true;
5110 DECL_SECTION_NAME (decl
) = TREE_VALUE (args
);
5114 error_with_decl (*node
,
5115 "section attribute not allowed for `%s'");
5116 *no_add_attrs
= true;
5121 error_with_decl (*node
,
5122 "section attributes are not supported for this target");
5123 *no_add_attrs
= true;
5129 /* Handle a "aligned" attribute; arguments as in
5130 struct attribute_spec.handler. */
5133 handle_aligned_attribute (node
, name
, args
, flags
, no_add_attrs
)
5135 tree name ATTRIBUTE_UNUSED
;
5140 tree decl
= NULL_TREE
;
5143 tree align_expr
= (args
? TREE_VALUE (args
)
5144 : size_int (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
));
5150 type
= &TREE_TYPE (decl
);
5151 is_type
= TREE_CODE (*node
) == TYPE_DECL
;
5153 else if (TYPE_P (*node
))
5154 type
= node
, is_type
= 1;
5156 /* Strip any NOPs of any kind. */
5157 while (TREE_CODE (align_expr
) == NOP_EXPR
5158 || TREE_CODE (align_expr
) == CONVERT_EXPR
5159 || TREE_CODE (align_expr
) == NON_LVALUE_EXPR
)
5160 align_expr
= TREE_OPERAND (align_expr
, 0);
5162 if (TREE_CODE (align_expr
) != INTEGER_CST
)
5164 error ("requested alignment is not a constant");
5165 *no_add_attrs
= true;
5167 else if ((i
= tree_log2 (align_expr
)) == -1)
5169 error ("requested alignment is not a power of 2");
5170 *no_add_attrs
= true;
5172 else if (i
> HOST_BITS_PER_INT
- 2)
5174 error ("requested alignment is too large");
5175 *no_add_attrs
= true;
5179 /* If we have a TYPE_DECL, then copy the type, so that we
5180 don't accidentally modify a builtin type. See pushdecl. */
5181 if (decl
&& TREE_TYPE (decl
) != error_mark_node
5182 && DECL_ORIGINAL_TYPE (decl
) == NULL_TREE
)
5184 tree tt
= TREE_TYPE (decl
);
5185 *type
= build_type_copy (*type
);
5186 DECL_ORIGINAL_TYPE (decl
) = tt
;
5187 TYPE_NAME (*type
) = decl
;
5188 TREE_USED (*type
) = TREE_USED (decl
);
5189 TREE_TYPE (decl
) = *type
;
5191 else if (!(flags
& (int) ATTR_FLAG_TYPE_IN_PLACE
))
5192 *type
= build_type_copy (*type
);
5194 TYPE_ALIGN (*type
) = (1 << i
) * BITS_PER_UNIT
;
5195 TYPE_USER_ALIGN (*type
) = 1;
5197 else if (TREE_CODE (decl
) != VAR_DECL
5198 && TREE_CODE (decl
) != FIELD_DECL
)
5200 error_with_decl (decl
,
5201 "alignment may not be specified for `%s'");
5202 *no_add_attrs
= true;
5206 DECL_ALIGN (decl
) = (1 << i
) * BITS_PER_UNIT
;
5207 DECL_USER_ALIGN (decl
) = 1;
5213 /* Handle a "weak" attribute; arguments as in
5214 struct attribute_spec.handler. */
5217 handle_weak_attribute (node
, name
, args
, flags
, no_add_attrs
)
5219 tree name ATTRIBUTE_UNUSED
;
5220 tree args ATTRIBUTE_UNUSED
;
5221 int flags ATTRIBUTE_UNUSED
;
5222 bool *no_add_attrs ATTRIBUTE_UNUSED
;
5224 declare_weak (*node
);
5229 /* Handle an "alias" attribute; arguments as in
5230 struct attribute_spec.handler. */
5233 handle_alias_attribute (node
, name
, args
, flags
, no_add_attrs
)
5237 int flags ATTRIBUTE_UNUSED
;
5242 if ((TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_INITIAL (decl
))
5243 || (TREE_CODE (decl
) != FUNCTION_DECL
&& ! DECL_EXTERNAL (decl
)))
5245 error_with_decl (decl
,
5246 "`%s' defined both normally and as an alias");
5247 *no_add_attrs
= true;
5249 else if (decl_function_context (decl
) == 0)
5253 id
= TREE_VALUE (args
);
5254 if (TREE_CODE (id
) != STRING_CST
)
5256 error ("alias arg not a string");
5257 *no_add_attrs
= true;
5260 id
= get_identifier (TREE_STRING_POINTER (id
));
5261 /* This counts as a use of the object pointed to. */
5264 if (TREE_CODE (decl
) == FUNCTION_DECL
)
5265 DECL_INITIAL (decl
) = error_mark_node
;
5267 DECL_EXTERNAL (decl
) = 0;
5271 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name
));
5272 *no_add_attrs
= true;
5278 /* Handle an "visibility" attribute; arguments as in
5279 struct attribute_spec.handler. */
5282 handle_visibility_attribute (node
, name
, args
, flags
, no_add_attrs
)
5286 int flags ATTRIBUTE_UNUSED
;
5291 if (decl_function_context (decl
) != 0 || ! TREE_PUBLIC (decl
))
5293 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name
));
5294 *no_add_attrs
= true;
5300 id
= TREE_VALUE (args
);
5301 if (TREE_CODE (id
) != STRING_CST
)
5303 error ("visibility arg not a string");
5304 *no_add_attrs
= true;
5307 if (strcmp (TREE_STRING_POINTER (id
), "hidden")
5308 && strcmp (TREE_STRING_POINTER (id
), "protected")
5309 && strcmp (TREE_STRING_POINTER (id
), "internal"))
5311 error ("visibility arg must be one of \"hidden\", \"protected\" or \"internal\"");
5312 *no_add_attrs
= true;
5320 /* Handle a "no_instrument_function" attribute; arguments as in
5321 struct attribute_spec.handler. */
5324 handle_no_instrument_function_attribute (node
, name
, args
, flags
, no_add_attrs
)
5327 tree args ATTRIBUTE_UNUSED
;
5328 int flags ATTRIBUTE_UNUSED
;
5333 if (TREE_CODE (decl
) != FUNCTION_DECL
)
5335 error_with_decl (decl
,
5336 "`%s' attribute applies only to functions",
5337 IDENTIFIER_POINTER (name
));
5338 *no_add_attrs
= true;
5340 else if (DECL_INITIAL (decl
))
5342 error_with_decl (decl
,
5343 "can't set `%s' attribute after definition",
5344 IDENTIFIER_POINTER (name
));
5345 *no_add_attrs
= true;
5348 DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (decl
) = 1;
5353 /* Handle a "malloc" attribute; arguments as in
5354 struct attribute_spec.handler. */
5357 handle_malloc_attribute (node
, name
, args
, flags
, no_add_attrs
)
5360 tree args ATTRIBUTE_UNUSED
;
5361 int flags ATTRIBUTE_UNUSED
;
5364 if (TREE_CODE (*node
) == FUNCTION_DECL
)
5365 DECL_IS_MALLOC (*node
) = 1;
5366 /* ??? TODO: Support types. */
5369 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name
));
5370 *no_add_attrs
= true;
5376 /* Handle a "no_limit_stack" attribute; arguments as in
5377 struct attribute_spec.handler. */
5380 handle_no_limit_stack_attribute (node
, name
, args
, flags
, no_add_attrs
)
5383 tree args ATTRIBUTE_UNUSED
;
5384 int flags ATTRIBUTE_UNUSED
;
5389 if (TREE_CODE (decl
) != FUNCTION_DECL
)
5391 error_with_decl (decl
,
5392 "`%s' attribute applies only to functions",
5393 IDENTIFIER_POINTER (name
));
5394 *no_add_attrs
= true;
5396 else if (DECL_INITIAL (decl
))
5398 error_with_decl (decl
,
5399 "can't set `%s' attribute after definition",
5400 IDENTIFIER_POINTER (name
));
5401 *no_add_attrs
= true;
5404 DECL_NO_LIMIT_STACK (decl
) = 1;
5409 /* Handle a "pure" attribute; arguments as in
5410 struct attribute_spec.handler. */
5413 handle_pure_attribute (node
, name
, args
, flags
, no_add_attrs
)
5416 tree args ATTRIBUTE_UNUSED
;
5417 int flags ATTRIBUTE_UNUSED
;
5420 if (TREE_CODE (*node
) == FUNCTION_DECL
)
5421 DECL_IS_PURE (*node
) = 1;
5422 /* ??? TODO: Support types. */
5425 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name
));
5426 *no_add_attrs
= true;
5432 /* Handle a "deprecated" attribute; arguments as in
5433 struct attribute_spec.handler. */
5436 handle_deprecated_attribute (node
, name
, args
, flags
, no_add_attrs
)
5439 tree args ATTRIBUTE_UNUSED
;
5443 tree type
= NULL_TREE
;
5445 const char *what
= NULL
;
5450 type
= TREE_TYPE (decl
);
5452 if (TREE_CODE (decl
) == TYPE_DECL
5453 || TREE_CODE (decl
) == PARM_DECL
5454 || TREE_CODE (decl
) == VAR_DECL
5455 || TREE_CODE (decl
) == FUNCTION_DECL
5456 || TREE_CODE (decl
) == FIELD_DECL
)
5457 TREE_DEPRECATED (decl
) = 1;
5461 else if (TYPE_P (*node
))
5463 if (!(flags
& (int) ATTR_FLAG_TYPE_IN_PLACE
))
5464 *node
= build_type_copy (*node
);
5465 TREE_DEPRECATED (*node
) = 1;
5473 *no_add_attrs
= true;
5474 if (type
&& TYPE_NAME (type
))
5476 if (TREE_CODE (TYPE_NAME (type
)) == IDENTIFIER_NODE
)
5477 what
= IDENTIFIER_POINTER (TYPE_NAME (*node
));
5478 else if (TREE_CODE (TYPE_NAME (type
)) == TYPE_DECL
5479 && DECL_NAME (TYPE_NAME (type
)))
5480 what
= IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (type
)));
5483 warning ("`%s' attribute ignored for `%s'",
5484 IDENTIFIER_POINTER (name
), what
);
5486 warning ("`%s' attribute ignored",
5487 IDENTIFIER_POINTER (name
));
5493 /* Keep a list of vector type nodes we created in handle_vector_size_attribute,
5494 to prevent us from duplicating type nodes unnecessarily.
5495 The normal mechanism to prevent duplicates is to use type_hash_canon, but
5496 since we want to distinguish types that are essentially identical (except
5497 for their debug representation), we use a local list here. */
5498 static tree vector_type_node_list
= 0;
5500 /* Handle a "vector_size" attribute; arguments as in
5501 struct attribute_spec.handler. */
5504 handle_vector_size_attribute (node
, name
, args
, flags
, no_add_attrs
)
5508 int flags ATTRIBUTE_UNUSED
;
5511 unsigned HOST_WIDE_INT vecsize
, nunits
;
5512 enum machine_mode mode
, orig_mode
, new_mode
;
5513 tree type
= *node
, new_type
= NULL_TREE
;
5514 tree type_list_node
;
5516 *no_add_attrs
= true;
5518 if (! host_integerp (TREE_VALUE (args
), 1))
5520 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name
));
5524 /* Get the vector size (in bytes). */
5525 vecsize
= tree_low_cst (TREE_VALUE (args
), 1);
5527 /* We need to provide for vector pointers, vector arrays, and
5528 functions returning vectors. For example:
5530 __attribute__((vector_size(16))) short *foo;
5532 In this case, the mode is SI, but the type being modified is
5533 HI, so we need to look further. */
5535 while (POINTER_TYPE_P (type
)
5536 || TREE_CODE (type
) == FUNCTION_TYPE
5537 || TREE_CODE (type
) == ARRAY_TYPE
)
5538 type
= TREE_TYPE (type
);
5540 /* Get the mode of the type being modified. */
5541 orig_mode
= TYPE_MODE (type
);
5543 if (TREE_CODE (type
) == RECORD_TYPE
5544 || (GET_MODE_CLASS (orig_mode
) != MODE_FLOAT
5545 && GET_MODE_CLASS (orig_mode
) != MODE_INT
)
5546 || ! host_integerp (TYPE_SIZE_UNIT (type
), 1))
5548 error ("invalid vector type for attribute `%s'",
5549 IDENTIFIER_POINTER (name
));
5553 /* Calculate how many units fit in the vector. */
5554 nunits
= vecsize
/ tree_low_cst (TYPE_SIZE_UNIT (type
), 1);
5556 /* Find a suitably sized vector. */
5557 new_mode
= VOIDmode
;
5558 for (mode
= GET_CLASS_NARROWEST_MODE (GET_MODE_CLASS (orig_mode
) == MODE_INT
5560 : MODE_VECTOR_FLOAT
);
5562 mode
= GET_MODE_WIDER_MODE (mode
))
5563 if (vecsize
== GET_MODE_SIZE (mode
)
5564 && nunits
== (unsigned HOST_WIDE_INT
) GET_MODE_NUNITS (mode
))
5570 if (new_mode
== VOIDmode
)
5572 error ("no vector mode with the size and type specified could be found");
5576 for (type_list_node
= vector_type_node_list
; type_list_node
;
5577 type_list_node
= TREE_CHAIN (type_list_node
))
5579 tree other_type
= TREE_VALUE (type_list_node
);
5580 tree record
= TYPE_DEBUG_REPRESENTATION_TYPE (other_type
);
5581 tree fields
= TYPE_FIELDS (record
);
5582 tree field_type
= TREE_TYPE (fields
);
5583 tree array_type
= TREE_TYPE (field_type
);
5584 if (TREE_CODE (fields
) != FIELD_DECL
5585 || TREE_CODE (field_type
) != ARRAY_TYPE
)
5588 if (TYPE_MODE (other_type
) == mode
&& type
== array_type
)
5590 new_type
= other_type
;
5595 if (new_type
== NULL_TREE
)
5597 tree index
, array
, rt
, list_node
;
5599 new_type
= (*lang_hooks
.types
.type_for_mode
) (new_mode
,
5600 TREE_UNSIGNED (type
));
5604 error ("no vector mode with the size and type specified could be found");
5608 new_type
= build_type_copy (new_type
);
5610 /* If this is a vector, make sure we either have hardware
5611 support, or we can emulate it. */
5612 if ((GET_MODE_CLASS (mode
) == MODE_VECTOR_INT
5613 || GET_MODE_CLASS (mode
) == MODE_VECTOR_FLOAT
)
5614 && !vector_mode_valid_p (mode
))
5616 error ("unable to emulate '%s'", GET_MODE_NAME (mode
));
5620 /* Set the debug information here, because this is the only
5621 place where we know the underlying type for a vector made
5622 with vector_size. For debugging purposes we pretend a vector
5623 is an array within a structure. */
5624 index
= build_int_2 (TYPE_VECTOR_SUBPARTS (new_type
) - 1, 0);
5625 array
= build_array_type (type
, build_index_type (index
));
5626 rt
= make_node (RECORD_TYPE
);
5628 TYPE_FIELDS (rt
) = build_decl (FIELD_DECL
, get_identifier ("f"), array
);
5629 DECL_CONTEXT (TYPE_FIELDS (rt
)) = rt
;
5631 TYPE_DEBUG_REPRESENTATION_TYPE (new_type
) = rt
;
5633 list_node
= build_tree_list (NULL
, new_type
);
5634 TREE_CHAIN (list_node
) = vector_type_node_list
;
5635 vector_type_node_list
= list_node
;
5638 /* Build back pointers if needed. */
5639 *node
= vector_size_helper (*node
, new_type
);
5644 /* HACK. GROSS. This is absolutely disgusting. I wish there was a
5647 If we requested a pointer to a vector, build up the pointers that
5648 we stripped off while looking for the inner type. Similarly for
5649 return values from functions.
5651 The argument "type" is the top of the chain, and "bottom" is the
5652 new type which we will point to. */
5655 vector_size_helper (type
, bottom
)
5660 if (POINTER_TYPE_P (type
))
5662 inner
= vector_size_helper (TREE_TYPE (type
), bottom
);
5663 outer
= build_pointer_type (inner
);
5665 else if (TREE_CODE (type
) == ARRAY_TYPE
)
5667 inner
= vector_size_helper (TREE_TYPE (type
), bottom
);
5668 outer
= build_array_type (inner
, TYPE_VALUES (type
));
5670 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
5672 inner
= vector_size_helper (TREE_TYPE (type
), bottom
);
5673 outer
= build_function_type (inner
, TYPE_VALUES (type
));
5678 TREE_READONLY (outer
) = TREE_READONLY (type
);
5679 TREE_THIS_VOLATILE (outer
) = TREE_THIS_VOLATILE (type
);
5684 /* Handle the "nonnull" attribute. */
5686 handle_nonnull_attribute (node
, name
, args
, flags
, no_add_attrs
)
5688 tree name ATTRIBUTE_UNUSED
;
5690 int flags ATTRIBUTE_UNUSED
;
5694 unsigned HOST_WIDE_INT attr_arg_num
;
5696 /* If no arguments are specified, all pointer arguments should be
5697 non-null. Veryify a full prototype is given so that the arguments
5698 will have the correct types when we actually check them later. */
5701 if (! TYPE_ARG_TYPES (type
))
5703 error ("nonnull attribute without arguments on a non-prototype");
5704 *no_add_attrs
= true;
5709 /* Argument list specified. Verify that each argument number references
5710 a pointer argument. */
5711 for (attr_arg_num
= 1; args
; args
= TREE_CHAIN (args
))
5714 unsigned HOST_WIDE_INT arg_num
, ck_num
;
5716 if (! get_nonnull_operand (TREE_VALUE (args
), &arg_num
))
5718 error ("nonnull argument has invalid operand number (arg %lu)",
5719 (unsigned long) attr_arg_num
);
5720 *no_add_attrs
= true;
5724 argument
= TYPE_ARG_TYPES (type
);
5727 for (ck_num
= 1; ; ck_num
++)
5729 if (! argument
|| ck_num
== arg_num
)
5731 argument
= TREE_CHAIN (argument
);
5735 || TREE_CODE (TREE_VALUE (argument
)) == VOID_TYPE
)
5737 error ("nonnull argument with out-of-range operand number (arg %lu, operand %lu)",
5738 (unsigned long) attr_arg_num
, (unsigned long) arg_num
);
5739 *no_add_attrs
= true;
5743 if (TREE_CODE (TREE_VALUE (argument
)) != POINTER_TYPE
)
5745 error ("nonnull argument references non-pointer operand (arg %lu, operand %lu)",
5746 (unsigned long) attr_arg_num
, (unsigned long) arg_num
);
5747 *no_add_attrs
= true;
5756 /* Check the argument list of a function call for null in argument slots
5757 that are marked as requiring a non-null pointer argument. */
5760 check_function_nonnull (attrs
, params
)
5764 tree a
, args
, param
;
5767 for (a
= attrs
; a
; a
= TREE_CHAIN (a
))
5769 if (is_attribute_p ("nonnull", TREE_PURPOSE (a
)))
5771 args
= TREE_VALUE (a
);
5773 /* Walk the argument list. If we encounter an argument number we
5774 should check for non-null, do it. If the attribute has no args,
5775 then every pointer argument is checked (in which case the check
5776 for pointer type is done in check_nonnull_arg). */
5777 for (param
= params
, param_num
= 1; ;
5778 param_num
++, param
= TREE_CHAIN (param
))
5782 if (! args
|| nonnull_check_p (args
, param_num
))
5783 check_function_arguments_recurse (check_nonnull_arg
, NULL
,
5791 /* Helper for check_function_nonnull; given a list of operands which
5792 must be non-null in ARGS, determine if operand PARAM_NUM should be
5796 nonnull_check_p (args
, param_num
)
5798 unsigned HOST_WIDE_INT param_num
;
5800 unsigned HOST_WIDE_INT arg_num
;
5802 for (; args
; args
= TREE_CHAIN (args
))
5804 if (! get_nonnull_operand (TREE_VALUE (args
), &arg_num
))
5807 if (arg_num
== param_num
)
5813 /* Check that the function argument PARAM (which is operand number
5814 PARAM_NUM) is non-null. This is called by check_function_nonnull
5815 via check_function_arguments_recurse. */
5818 check_nonnull_arg (ctx
, param
, param_num
)
5819 void *ctx ATTRIBUTE_UNUSED
;
5821 unsigned HOST_WIDE_INT param_num
;
5823 /* Just skip checking the argument if it's not a pointer. This can
5824 happen if the "nonnull" attribute was given without an operand
5825 list (which means to check every pointer argument). */
5827 if (TREE_CODE (TREE_TYPE (param
)) != POINTER_TYPE
)
5830 if (integer_zerop (param
))
5831 warning ("null argument where non-null required (arg %lu)",
5832 (unsigned long) param_num
);
5835 /* Helper for nonnull attribute handling; fetch the operand number
5836 from the attribute argument list. */
5839 get_nonnull_operand (arg_num_expr
, valp
)
5841 unsigned HOST_WIDE_INT
*valp
;
5843 /* Strip any conversions from the arg number and verify they
5845 while (TREE_CODE (arg_num_expr
) == NOP_EXPR
5846 || TREE_CODE (arg_num_expr
) == CONVERT_EXPR
5847 || TREE_CODE (arg_num_expr
) == NON_LVALUE_EXPR
)
5848 arg_num_expr
= TREE_OPERAND (arg_num_expr
, 0);
5850 if (TREE_CODE (arg_num_expr
) != INTEGER_CST
5851 || TREE_INT_CST_HIGH (arg_num_expr
) != 0)
5854 *valp
= TREE_INT_CST_LOW (arg_num_expr
);
5858 /* Handle a "nothrow" attribute; arguments as in
5859 struct attribute_spec.handler. */
5862 handle_nothrow_attribute (node
, name
, args
, flags
, no_add_attrs
)
5865 tree args ATTRIBUTE_UNUSED
;
5866 int flags ATTRIBUTE_UNUSED
;
5869 if (TREE_CODE (*node
) == FUNCTION_DECL
)
5870 TREE_NOTHROW (*node
) = 1;
5871 /* ??? TODO: Support types. */
5874 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name
));
5875 *no_add_attrs
= true;
5881 /* Check for valid arguments being passed to a function. */
5883 check_function_arguments (attrs
, params
)
5887 /* Check for null being passed in a pointer argument that must be
5888 non-null. We also need to do this if format checking is enabled. */
5891 check_function_nonnull (attrs
, params
);
5893 /* Check for errors in format strings. */
5896 check_function_format (NULL
, attrs
, params
);
5899 /* Generic argument checking recursion routine. PARAM is the argument to
5900 be checked. PARAM_NUM is the number of the argument. CALLBACK is invoked
5901 once the argument is resolved. CTX is context for the callback. */
5903 check_function_arguments_recurse (callback
, ctx
, param
, param_num
)
5904 void (*callback
) PARAMS ((void *, tree
, unsigned HOST_WIDE_INT
));
5907 unsigned HOST_WIDE_INT param_num
;
5909 if (TREE_CODE (param
) == NOP_EXPR
)
5911 /* Strip coercion. */
5912 check_function_arguments_recurse (callback
, ctx
,
5913 TREE_OPERAND (param
, 0), param_num
);
5917 if (TREE_CODE (param
) == CALL_EXPR
)
5919 tree type
= TREE_TYPE (TREE_TYPE (TREE_OPERAND (param
, 0)));
5921 bool found_format_arg
= false;
5923 /* See if this is a call to a known internationalization function
5924 that modifies a format arg. Such a function may have multiple
5925 format_arg attributes (for example, ngettext). */
5927 for (attrs
= TYPE_ATTRIBUTES (type
);
5929 attrs
= TREE_CHAIN (attrs
))
5930 if (is_attribute_p ("format_arg", TREE_PURPOSE (attrs
)))
5933 tree format_num_expr
;
5937 /* Extract the argument number, which was previously checked
5939 format_num_expr
= TREE_VALUE (TREE_VALUE (attrs
));
5940 while (TREE_CODE (format_num_expr
) == NOP_EXPR
5941 || TREE_CODE (format_num_expr
) == CONVERT_EXPR
5942 || TREE_CODE (format_num_expr
) == NON_LVALUE_EXPR
)
5943 format_num_expr
= TREE_OPERAND (format_num_expr
, 0);
5945 if (TREE_CODE (format_num_expr
) != INTEGER_CST
5946 || TREE_INT_CST_HIGH (format_num_expr
) != 0)
5949 format_num
= TREE_INT_CST_LOW (format_num_expr
);
5951 for (inner_args
= TREE_OPERAND (param
, 1), i
= 1;
5953 inner_args
= TREE_CHAIN (inner_args
), i
++)
5954 if (i
== format_num
)
5956 check_function_arguments_recurse (callback
, ctx
,
5957 TREE_VALUE (inner_args
),
5959 found_format_arg
= true;
5964 /* If we found a format_arg attribute and did a recursive check,
5965 we are done with checking this argument. Otherwise, we continue
5966 and this will be considered a non-literal. */
5967 if (found_format_arg
)
5971 if (TREE_CODE (param
) == COND_EXPR
)
5973 /* Check both halves of the conditional expression. */
5974 check_function_arguments_recurse (callback
, ctx
,
5975 TREE_OPERAND (param
, 1), param_num
);
5976 check_function_arguments_recurse (callback
, ctx
,
5977 TREE_OPERAND (param
, 2), param_num
);
5981 (*callback
) (ctx
, param
, param_num
);
5984 #include "gt-c-common.h"