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
24 #include "coretypes.h"
36 #include "diagnostic.h"
41 #include "langhooks.h"
42 #include "except.h" /* For USING_SJLJ_EXCEPTIONS. */
43 #include "tree-inline.h"
45 cpp_reader
*parse_in
; /* Declared in c-pragma.h. */
47 /* We let tm.h override the types used here, to handle trivial differences
48 such as the choice of unsigned int or long unsigned int for size_t.
49 When machines start needing nontrivial differences in the size type,
50 it would be best to do something here to figure out automatically
51 from other information what type to use. */
54 #define SIZE_TYPE "long unsigned int"
58 #define WCHAR_TYPE "int"
61 /* WCHAR_TYPE gets overridden by -fshort-wchar. */
62 #define MODIFIED_WCHAR_TYPE \
63 (flag_short_wchar ? "short unsigned int" : WCHAR_TYPE)
66 #define PTRDIFF_TYPE "long int"
70 #define WINT_TYPE "unsigned int"
74 #define INTMAX_TYPE ((INT_TYPE_SIZE == LONG_LONG_TYPE_SIZE) \
76 : ((LONG_TYPE_SIZE == LONG_LONG_TYPE_SIZE) \
82 #define UINTMAX_TYPE ((INT_TYPE_SIZE == LONG_LONG_TYPE_SIZE) \
84 : ((LONG_TYPE_SIZE == LONG_LONG_TYPE_SIZE) \
85 ? "long unsigned int" \
86 : "long long unsigned int"))
89 #ifndef REGISTER_PREFIX
90 #define REGISTER_PREFIX ""
93 /* The variant of the C language being processed. */
95 enum c_language_kind c_language
;
97 /* The following symbols are subsumed in the c_global_trees array, and
98 listed here individually for documentation purposes.
100 INTEGER_TYPE and REAL_TYPE nodes for the standard data types.
102 tree short_integer_type_node;
103 tree long_integer_type_node;
104 tree long_long_integer_type_node;
106 tree short_unsigned_type_node;
107 tree long_unsigned_type_node;
108 tree long_long_unsigned_type_node;
110 tree boolean_type_node;
111 tree boolean_false_node;
112 tree boolean_true_node;
114 tree ptrdiff_type_node;
116 tree unsigned_char_type_node;
117 tree signed_char_type_node;
118 tree wchar_type_node;
119 tree signed_wchar_type_node;
120 tree unsigned_wchar_type_node;
122 tree float_type_node;
123 tree double_type_node;
124 tree long_double_type_node;
126 tree complex_integer_type_node;
127 tree complex_float_type_node;
128 tree complex_double_type_node;
129 tree complex_long_double_type_node;
131 tree intQI_type_node;
132 tree intHI_type_node;
133 tree intSI_type_node;
134 tree intDI_type_node;
135 tree intTI_type_node;
137 tree unsigned_intQI_type_node;
138 tree unsigned_intHI_type_node;
139 tree unsigned_intSI_type_node;
140 tree unsigned_intDI_type_node;
141 tree unsigned_intTI_type_node;
143 tree widest_integer_literal_type_node;
144 tree widest_unsigned_literal_type_node;
146 Nodes for types `void *' and `const void *'.
148 tree ptr_type_node, const_ptr_type_node;
150 Nodes for types `char *' and `const char *'.
152 tree string_type_node, const_string_type_node;
154 Type `char[SOMENUMBER]'.
155 Used when an array of char is needed and the size is irrelevant.
157 tree char_array_type_node;
159 Type `int[SOMENUMBER]' or something like it.
160 Used when an array of int needed and the size is irrelevant.
162 tree int_array_type_node;
164 Type `wchar_t[SOMENUMBER]' or something like it.
165 Used when a wide string literal is created.
167 tree wchar_array_type_node;
169 Type `int ()' -- used for implicit declaration of functions.
171 tree default_function_type;
173 A VOID_TYPE node, packaged in a TREE_LIST.
177 The lazily created VAR_DECLs for __FUNCTION__, __PRETTY_FUNCTION__,
178 and __func__. (C doesn't generate __FUNCTION__ and__PRETTY_FUNCTION__
179 VAR_DECLS, but C++ does.)
181 tree function_name_decl_node;
182 tree pretty_function_name_decl_node;
183 tree c99_function_name_decl_node;
185 Stack of nested function name VAR_DECLs.
187 tree saved_function_name_decls;
191 tree c_global_trees
[CTI_MAX
];
193 /* Switches common to the C front ends. */
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 whenever Objective-C functionality is being used. */
205 /* Nonzero if -undef was given. It suppresses target built-in macros
209 /* Nonzero means don't recognize the non-ANSI builtin functions. */
213 /* Nonzero means don't recognize the non-ANSI builtin functions.
216 int flag_no_nonansi_builtin
;
218 /* Nonzero means give `double' the same size as `float'. */
220 int flag_short_double
;
222 /* Nonzero means give `wchar_t' the same size as `short'. */
224 int flag_short_wchar
;
226 /* Nonzero means allow Microsoft extensions without warnings or errors. */
227 int flag_ms_extensions
;
229 /* Nonzero means don't recognize the keyword `asm'. */
233 /* Nonzero means give string constants the type `const char *', as mandated
236 int flag_const_strings
;
238 /* Nonzero means `$' can be in an identifier. */
240 #ifndef DOLLARS_IN_IDENTIFIERS
241 #define DOLLARS_IN_IDENTIFIERS 1
243 int dollars_in_ident
= DOLLARS_IN_IDENTIFIERS
;
245 /* Nonzero means to treat bitfields as signed unless they say `unsigned'. */
247 int flag_signed_bitfields
= 1;
248 int explicit_flag_signed_bitfields
;
250 /* Nonzero means warn about pointer casts that can drop a type qualifier
251 from the pointer target type. */
255 /* Warn about functions which might be candidates for format attributes. */
257 int warn_missing_format_attribute
;
259 /* Nonzero means warn about sizeof(function) or addition/subtraction
260 of function pointers. */
262 int warn_pointer_arith
;
264 /* Nonzero means warn for any global function def
265 without separate previous prototype decl. */
267 int warn_missing_prototypes
;
269 /* Warn if adding () is suggested. */
271 int warn_parentheses
;
273 /* Warn if initializer is not completely bracketed. */
275 int warn_missing_braces
;
277 /* Warn about comparison of signed and unsigned values.
278 If -1, neither -Wsign-compare nor -Wno-sign-compare has been specified. */
280 int warn_sign_compare
;
282 /* Nonzero means warn about usage of long long when `-pedantic'. */
284 int warn_long_long
= 1;
286 /* Nonzero means warn about deprecated conversion from string constant to
289 int warn_write_strings
;
291 /* Nonzero means warn about multiple (redundant) decls for the same single
292 variable or function. */
294 int warn_redundant_decls
;
296 /* Warn about testing equality of floating point numbers. */
298 int warn_float_equal
;
300 /* Warn about a subscript that has type char. */
302 int warn_char_subscripts
;
304 /* Warn if a type conversion is done that might have confusing results. */
308 /* Warn about #pragma directives that are not recognized. */
310 int warn_unknown_pragmas
; /* Tri state variable. */
312 /* Warn about format/argument anomalies in calls to formatted I/O functions
313 (*printf, *scanf, strftime, strfmon, etc.). */
317 /* Warn about Y2K problems with strftime formats. */
321 /* Warn about excess arguments to formats. */
323 int warn_format_extra_args
;
325 /* Warn about zero-length formats. */
327 int warn_format_zero_length
;
329 /* Warn about non-literal format arguments. */
331 int warn_format_nonliteral
;
333 /* Warn about possible security problems with calls to format functions. */
335 int warn_format_security
;
338 /* C/ObjC language option variables. */
341 /* Nonzero means message about use of implicit function declarations;
342 1 means warning; 2 means error. */
344 int mesg_implicit_function_declaration
= -1;
346 /* Nonzero means allow type mismatches in conditional expressions;
347 just make their values `void'. */
349 int flag_cond_mismatch
;
351 /* Nonzero means enable C89 Amendment 1 features. */
355 /* Nonzero means use the ISO C99 dialect of C. */
359 /* Nonzero means that we have builtin functions, and main is an int */
363 /* Nonzero means add default format_arg attributes for functions not
366 int flag_noniso_default_format_attributes
= 1;
368 /* Nonzero means warn when casting a function call to a type that does
369 not match the return type (e.g. (float)sqrt() or (anything*)malloc()
370 when there is no previous declaration of sqrt or malloc. */
372 int warn_bad_function_cast
;
374 /* Warn about traditional constructs whose meanings changed in ANSI C. */
376 int warn_traditional
;
378 /* Nonzero means warn for non-prototype function decls
379 or non-prototyped defs without previous prototype. */
381 int warn_strict_prototypes
;
383 /* Nonzero means warn for any global function def
384 without separate previous decl. */
386 int warn_missing_declarations
;
388 /* Nonzero means warn about declarations of objects not at
389 file-scope level and about *all* declarations of functions (whether
390 or static) not at file-scope level. Note that we exclude
391 implicit function declarations. To get warnings about those, use
394 int warn_nested_externs
;
396 /* Warn if main is suspicious. */
400 /* Nonzero means warn about possible violations of sequence point rules. */
402 int warn_sequence_point
;
404 /* Nonzero means to warn about compile-time division by zero. */
405 int warn_div_by_zero
= 1;
407 /* Nonzero means warn about use of implicit int. */
409 int warn_implicit_int
;
411 /* Warn about NULL being passed to argument slots marked as requiring
417 /* ObjC language option variables. */
420 /* Open and close the file for outputting class declarations, if
423 int flag_gen_declaration
;
425 /* Generate code for GNU or NeXT runtime environment. */
427 #ifdef NEXT_OBJC_RUNTIME
428 int flag_next_runtime
= 1;
430 int flag_next_runtime
= 0;
433 /* Tells the compiler that this is a special run. Do not perform any
434 compiling, instead we are to test some platform dependent features
435 and output a C header file with appropriate definitions. */
437 int print_struct_values
;
439 /* ???. Undocumented. */
441 const char *constant_string_class_name
;
443 /* Warn if multiple methods are seen for the same selector, but with
444 different argument types. Performs the check on the whole selector
445 table at the end of compilation. */
449 /* Warn if a @selector() is found, and no method with that selector
450 has been previously declared. The check is done on each
451 @selector() as soon as it is found - so it warns about forward
454 int warn_undeclared_selector
;
456 /* Warn if methods required by a protocol are not implemented in the
457 class adopting it. When turned off, methods inherited to that
458 class are also considered implemented. */
460 int warn_protocol
= 1;
463 /* C++ language option variables. */
466 /* Nonzero means don't recognize any extension keywords. */
468 int flag_no_gnu_keywords
;
470 /* Nonzero means do emit exported implementations of functions even if
471 they can be inlined. */
473 int flag_implement_inlines
= 1;
475 /* Nonzero means do emit exported implementations of templates, instead of
476 multiple static copies in each file that needs a definition. */
478 int flag_external_templates
;
480 /* Nonzero means that the decision to emit or not emit the implementation of a
481 template depends on where the template is instantiated, rather than where
484 int flag_alt_external_templates
;
486 /* Nonzero means that implicit instantiations will be emitted if needed. */
488 int flag_implicit_templates
= 1;
490 /* Nonzero means that implicit instantiations of inline templates will be
491 emitted if needed, even if instantiations of non-inline templates
494 int flag_implicit_inline_templates
= 1;
496 /* Nonzero means generate separate instantiation control files and
497 juggle them at link time. */
499 int flag_use_repository
;
501 /* Nonzero if we want to issue diagnostics that the standard says are not
504 int flag_optional_diags
= 1;
506 /* Nonzero means we should attempt to elide constructors when possible. */
508 int flag_elide_constructors
= 1;
510 /* Nonzero means that member functions defined in class scope are
511 inline by default. */
513 int flag_default_inline
= 1;
515 /* Controls whether compiler generates 'type descriptor' that give
516 run-time type information. */
520 /* Nonzero if we want to conserve space in the .o files. We do this
521 by putting uninitialized data and runtime initialized data into
522 .common instead of .data at the expense of not flagging multiple
525 int flag_conserve_space
;
527 /* Nonzero if we want to obey access control semantics. */
529 int flag_access_control
= 1;
531 /* Nonzero if we want to check the return value of new and avoid calling
532 constructors if it is a null pointer. */
536 /* Nonzero if we want the new ISO rules for pushing a new scope for `for'
537 initialization variables.
538 0: Old rules, set by -fno-for-scope.
539 2: New ISO rules, set by -ffor-scope.
540 1: Try to implement new ISO rules, but with backup compatibility
541 (and warnings). This is the default, for now. */
543 int flag_new_for_scope
= 1;
545 /* Nonzero if we want to emit defined symbols with common-like linkage as
546 weak symbols where possible, in order to conform to C++ semantics.
547 Otherwise, emit them as local symbols. */
551 /* Nonzero to use __cxa_atexit, rather than atexit, to register
552 destructors for local statics and global objects. */
554 int flag_use_cxa_atexit
= DEFAULT_USE_CXA_ATEXIT
;
556 /* Nonzero means output .vtable_{entry,inherit} for use in doing vtable gc. */
560 /* Nonzero means make the default pedwarns warnings instead of errors.
561 The value of this flag is ignored if -pedantic is specified. */
565 /* Nonzero means to implement standard semantics for exception
566 specifications, calling unexpected if an exception is thrown that
567 doesn't match the specification. Zero means to treat them as
568 assertions and optimize accordingly, but not check them. */
570 int flag_enforce_eh_specs
= 1;
572 /* The version of the C++ ABI in use. The following values are
575 0: The version of the ABI believed most conformant with the
576 C++ ABI specification. This ABI may change as bugs are
577 discovered and fixed. Therefore, 0 will not necessarily
578 indicate the same ABI in different versions of G++.
580 1: The version of the ABI first used in G++ 3.2.
582 Additional positive integers will be assigned as new versions of
583 the ABI become the default version of the ABI. */
585 int flag_abi_version
= 1;
587 /* Nonzero means warn about things that will change when compiling
588 with an ABI-compliant compiler. */
592 /* Nonzero means warn about implicit declarations. */
594 int warn_implicit
= 1;
596 /* Nonzero means warn when all ctors or dtors are private, and the class
599 int warn_ctor_dtor_privacy
= 1;
601 /* Nonzero means warn in function declared in derived class has the
602 same name as a virtual in the base class, but fails to match the
603 type signature of any virtual function in the base class. */
605 int warn_overloaded_virtual
;
607 /* Nonzero means warn when declaring a class that has a non virtual
608 destructor, when it really ought to have a virtual one. */
612 /* Nonzero means warn when the compiler will reorder code. */
616 /* Nonzero means warn when synthesis behavior differs from Cfront's. */
620 /* Nonzero means warn when we convert a pointer to member function
621 into a pointer to (void or function). */
623 int warn_pmf2ptr
= 1;
625 /* Nonzero means warn about violation of some Effective C++ style rules. */
629 /* Nonzero means warn where overload resolution chooses a promotion from
630 unsigned to signed over a conversion to an unsigned of the same size. */
634 /* Nonzero means warn when an old-style cast is used. */
636 int warn_old_style_cast
;
638 /* Nonzero means warn when non-templatized friend functions are
639 declared within a template */
641 int warn_nontemplate_friend
= 1;
643 /* Nonzero means complain about deprecated features. */
645 int warn_deprecated
= 1;
647 /* Maximum template instantiation depth. This limit is rather
648 arbitrary, but it exists to limit the time it takes to notice
649 infinite template instantiations. */
651 int max_tinst_depth
= 500;
655 /* The elements of `ridpointers' are identifier nodes for the reserved
656 type names and storage classes. It is indexed by a RID_... value. */
659 tree (*make_fname_decl
) PARAMS ((tree
, int));
661 /* If non-NULL, the address of a language-specific function that
662 returns 1 for language-specific statement codes. */
663 int (*lang_statement_code_p
) PARAMS ((enum tree_code
));
665 /* If non-NULL, the address of a language-specific function that takes
666 any action required right before expand_function_end is called. */
667 void (*lang_expand_function_end
) PARAMS ((void));
669 /* Nonzero means the expression being parsed will never be evaluated.
670 This is a count, since unevaluated expressions can nest. */
673 /* Information about how a function name is generated. */
676 tree
*const decl
; /* pointer to the VAR_DECL. */
677 const unsigned rid
; /* RID number for the identifier. */
678 const int pretty
; /* How pretty is it? */
681 /* The three ways of getting then name of the current function. */
683 const struct fname_var_t fname_vars
[] =
685 /* C99 compliant __func__, must be first. */
686 {&c99_function_name_decl_node
, RID_C99_FUNCTION_NAME
, 0},
687 /* GCC __FUNCTION__ compliant. */
688 {&function_name_decl_node
, RID_FUNCTION_NAME
, 0},
689 /* GCC __PRETTY_FUNCTION__ compliant. */
690 {&pretty_function_name_decl_node
, RID_PRETTY_FUNCTION_NAME
, 1},
694 static int constant_fits_type_p
PARAMS ((tree
, tree
));
696 /* Keep a stack of if statements. We record the number of compound
697 statements seen up to the if keyword, as well as the line number
698 and file of the if. If a potentially ambiguous else is seen, that
699 fact is recorded; the warning is issued when we can be sure that
700 the enclosing if statement does not have an else branch. */
710 static if_elt
*if_stack
;
712 /* Amount of space in the if statement stack. */
713 static int if_stack_space
= 0;
716 static int if_stack_pointer
= 0;
718 static tree handle_packed_attribute
PARAMS ((tree
*, tree
, tree
, int,
720 static tree handle_nocommon_attribute
PARAMS ((tree
*, tree
, tree
, int,
722 static tree handle_common_attribute
PARAMS ((tree
*, tree
, tree
, int,
724 static tree handle_noreturn_attribute
PARAMS ((tree
*, tree
, tree
, int,
726 static tree handle_noinline_attribute
PARAMS ((tree
*, tree
, tree
, int,
728 static tree handle_always_inline_attribute
PARAMS ((tree
*, tree
, tree
, int,
730 static tree handle_used_attribute
PARAMS ((tree
*, tree
, tree
, int,
732 static tree handle_unused_attribute
PARAMS ((tree
*, tree
, tree
, int,
734 static tree handle_const_attribute
PARAMS ((tree
*, tree
, tree
, int,
736 static tree handle_transparent_union_attribute
PARAMS ((tree
*, tree
, tree
,
738 static tree handle_constructor_attribute
PARAMS ((tree
*, tree
, tree
, int,
740 static tree handle_destructor_attribute
PARAMS ((tree
*, tree
, tree
, int,
742 static tree handle_mode_attribute
PARAMS ((tree
*, tree
, tree
, int,
744 static tree handle_section_attribute
PARAMS ((tree
*, tree
, tree
, int,
746 static tree handle_aligned_attribute
PARAMS ((tree
*, tree
, tree
, int,
748 static tree handle_weak_attribute
PARAMS ((tree
*, tree
, tree
, int,
750 static tree handle_alias_attribute
PARAMS ((tree
*, tree
, tree
, int,
752 static tree handle_visibility_attribute
PARAMS ((tree
*, tree
, tree
, int,
754 static tree handle_tls_model_attribute
PARAMS ((tree
*, tree
, tree
, int,
756 static tree handle_no_instrument_function_attribute
PARAMS ((tree
*, tree
,
759 static tree handle_malloc_attribute
PARAMS ((tree
*, tree
, tree
, int,
761 static tree handle_no_limit_stack_attribute
PARAMS ((tree
*, tree
, tree
, int,
763 static tree handle_pure_attribute
PARAMS ((tree
*, tree
, tree
, int,
765 static tree handle_deprecated_attribute
PARAMS ((tree
*, tree
, tree
, int,
767 static tree handle_vector_size_attribute
PARAMS ((tree
*, tree
, tree
, int,
769 static tree handle_nonnull_attribute
PARAMS ((tree
*, tree
, tree
, int,
771 static tree handle_nothrow_attribute
PARAMS ((tree
*, tree
, tree
, int,
773 static tree vector_size_helper
PARAMS ((tree
, tree
));
775 static void check_function_nonnull
PARAMS ((tree
, tree
));
776 static void check_nonnull_arg
PARAMS ((void *, tree
,
777 unsigned HOST_WIDE_INT
));
778 static bool nonnull_check_p
PARAMS ((tree
, unsigned HOST_WIDE_INT
));
779 static bool get_nonnull_operand
PARAMS ((tree
,
780 unsigned HOST_WIDE_INT
*));
781 void builtin_define_std
PARAMS ((const char *));
782 static void builtin_define_with_value
PARAMS ((const char *, const char *,
784 static void builtin_define_with_int_value
PARAMS ((const char *,
786 static void builtin_define_with_hex_fp_value
PARAMS ((const char *, tree
,
789 static void builtin_define_type_max
PARAMS ((const char *, tree
, int));
790 static void builtin_define_type_precision
PARAMS ((const char *, tree
));
791 static void builtin_define_float_constants
PARAMS ((const char *,
792 const char *, tree
));
794 /* Table of machine-independent attributes common to all C-like languages. */
795 const struct attribute_spec c_common_attribute_table
[] =
797 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler } */
798 { "packed", 0, 0, false, false, false,
799 handle_packed_attribute
},
800 { "nocommon", 0, 0, true, false, false,
801 handle_nocommon_attribute
},
802 { "common", 0, 0, true, false, false,
803 handle_common_attribute
},
804 /* FIXME: logically, noreturn attributes should be listed as
805 "false, true, true" and apply to function types. But implementing this
806 would require all the places in the compiler that use TREE_THIS_VOLATILE
807 on a decl to identify non-returning functions to be located and fixed
808 to check the function type instead. */
809 { "noreturn", 0, 0, true, false, false,
810 handle_noreturn_attribute
},
811 { "volatile", 0, 0, true, false, false,
812 handle_noreturn_attribute
},
813 { "noinline", 0, 0, true, false, false,
814 handle_noinline_attribute
},
815 { "always_inline", 0, 0, true, false, false,
816 handle_always_inline_attribute
},
817 { "used", 0, 0, true, false, false,
818 handle_used_attribute
},
819 { "unused", 0, 0, false, false, false,
820 handle_unused_attribute
},
821 /* The same comments as for noreturn attributes apply to const ones. */
822 { "const", 0, 0, true, false, false,
823 handle_const_attribute
},
824 { "transparent_union", 0, 0, false, false, false,
825 handle_transparent_union_attribute
},
826 { "constructor", 0, 0, true, false, false,
827 handle_constructor_attribute
},
828 { "destructor", 0, 0, true, false, false,
829 handle_destructor_attribute
},
830 { "mode", 1, 1, false, true, false,
831 handle_mode_attribute
},
832 { "section", 1, 1, true, false, false,
833 handle_section_attribute
},
834 { "aligned", 0, 1, false, false, false,
835 handle_aligned_attribute
},
836 { "weak", 0, 0, true, false, false,
837 handle_weak_attribute
},
838 { "alias", 1, 1, true, false, false,
839 handle_alias_attribute
},
840 { "no_instrument_function", 0, 0, true, false, false,
841 handle_no_instrument_function_attribute
},
842 { "malloc", 0, 0, true, false, false,
843 handle_malloc_attribute
},
844 { "no_stack_limit", 0, 0, true, false, false,
845 handle_no_limit_stack_attribute
},
846 { "pure", 0, 0, true, false, false,
847 handle_pure_attribute
},
848 { "deprecated", 0, 0, false, false, false,
849 handle_deprecated_attribute
},
850 { "vector_size", 1, 1, false, true, false,
851 handle_vector_size_attribute
},
852 { "visibility", 1, 1, true, false, false,
853 handle_visibility_attribute
},
854 { "tls_model", 1, 1, true, false, false,
855 handle_tls_model_attribute
},
856 { "nonnull", 0, -1, false, true, true,
857 handle_nonnull_attribute
},
858 { "nothrow", 0, 0, true, false, false,
859 handle_nothrow_attribute
},
860 { "may_alias", 0, 0, false, true, false, NULL
},
861 { NULL
, 0, 0, false, false, false, NULL
}
864 /* Give the specifications for the format attributes, used by C and all
867 const struct attribute_spec c_common_format_attribute_table
[] =
869 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler } */
870 { "format", 3, 3, false, true, true,
871 handle_format_attribute
},
872 { "format_arg", 1, 1, false, true, true,
873 handle_format_arg_attribute
},
874 { NULL
, 0, 0, false, false, false, NULL
}
877 /* Record the start of an if-then, and record the start of it
878 for ambiguous else detection.
880 COND is the condition for the if-then statement.
882 IF_STMT is the statement node that has already been created for
883 this if-then statement. It is created before parsing the
884 condition to keep line number information accurate. */
887 c_expand_start_cond (cond
, compstmt_count
, if_stmt
)
892 /* Make sure there is enough space on the stack. */
893 if (if_stack_space
== 0)
896 if_stack
= (if_elt
*) xmalloc (10 * sizeof (if_elt
));
898 else if (if_stack_space
== if_stack_pointer
)
900 if_stack_space
+= 10;
901 if_stack
= (if_elt
*) xrealloc (if_stack
, if_stack_space
* sizeof (if_elt
));
904 IF_COND (if_stmt
) = cond
;
907 /* Record this if statement. */
908 if_stack
[if_stack_pointer
].compstmt_count
= compstmt_count
;
909 if_stack
[if_stack_pointer
].file
= input_filename
;
910 if_stack
[if_stack_pointer
].line
= lineno
;
911 if_stack
[if_stack_pointer
].needs_warning
= 0;
912 if_stack
[if_stack_pointer
].if_stmt
= if_stmt
;
916 /* Called after the then-clause for an if-statement is processed. */
921 tree if_stmt
= if_stack
[if_stack_pointer
- 1].if_stmt
;
922 RECHAIN_STMTS (if_stmt
, THEN_CLAUSE (if_stmt
));
925 /* Record the end of an if-then. Optionally warn if a nested
926 if statement had an ambiguous else clause. */
932 if (if_stack
[if_stack_pointer
].needs_warning
)
933 warning_with_file_and_line (if_stack
[if_stack_pointer
].file
,
934 if_stack
[if_stack_pointer
].line
,
935 "suggest explicit braces to avoid ambiguous `else'");
936 last_expr_type
= NULL_TREE
;
939 /* Called between the then-clause and the else-clause
940 of an if-then-else. */
943 c_expand_start_else ()
945 /* An ambiguous else warning must be generated for the enclosing if
946 statement, unless we see an else branch for that one, too. */
948 && if_stack_pointer
> 1
949 && (if_stack
[if_stack_pointer
- 1].compstmt_count
950 == if_stack
[if_stack_pointer
- 2].compstmt_count
))
951 if_stack
[if_stack_pointer
- 2].needs_warning
= 1;
953 /* Even if a nested if statement had an else branch, it can't be
954 ambiguous if this one also has an else. So don't warn in that
955 case. Also don't warn for any if statements nested in this else. */
956 if_stack
[if_stack_pointer
- 1].needs_warning
= 0;
957 if_stack
[if_stack_pointer
- 1].compstmt_count
--;
960 /* Called after the else-clause for an if-statement is processed. */
965 tree if_stmt
= if_stack
[if_stack_pointer
- 1].if_stmt
;
966 RECHAIN_STMTS (if_stmt
, ELSE_CLAUSE (if_stmt
));
969 /* Begin an if-statement. Returns a newly created IF_STMT if
972 Unlike the C++ front-end, we do not call add_stmt here; it is
973 probably safe to do so, but I am not very familiar with this
974 code so I am being extra careful not to change its behavior
975 beyond what is strictly necessary for correctness. */
981 r
= build_stmt (IF_STMT
, NULL_TREE
, NULL_TREE
, NULL_TREE
);
985 /* Begin a while statement. Returns a newly created WHILE_STMT if
988 Unlike the C++ front-end, we do not call add_stmt here; it is
989 probably safe to do so, but I am not very familiar with this
990 code so I am being extra careful not to change its behavior
991 beyond what is strictly necessary for correctness. */
994 c_begin_while_stmt ()
997 r
= build_stmt (WHILE_STMT
, NULL_TREE
, NULL_TREE
);
1002 c_finish_while_stmt_cond (cond
, while_stmt
)
1006 WHILE_COND (while_stmt
) = cond
;
1009 /* Push current bindings for the function name VAR_DECLS. */
1012 start_fname_decls ()
1015 tree saved
= NULL_TREE
;
1017 for (ix
= 0; fname_vars
[ix
].decl
; ix
++)
1019 tree decl
= *fname_vars
[ix
].decl
;
1023 saved
= tree_cons (decl
, build_int_2 (ix
, 0), saved
);
1024 *fname_vars
[ix
].decl
= NULL_TREE
;
1027 if (saved
|| saved_function_name_decls
)
1028 /* Normally they'll have been NULL, so only push if we've got a
1029 stack, or they are non-NULL. */
1030 saved_function_name_decls
= tree_cons (saved
, NULL_TREE
,
1031 saved_function_name_decls
);
1034 /* Finish up the current bindings, adding them into the
1035 current function's statement tree. This is done by wrapping the
1036 function's body in a COMPOUND_STMT containing these decls too. This
1037 must be done _before_ finish_stmt_tree is called. If there is no
1038 current function, we must be at file scope and no statements are
1039 involved. Pop the previous bindings. */
1042 finish_fname_decls ()
1045 tree body
= NULL_TREE
;
1046 tree stack
= saved_function_name_decls
;
1048 for (; stack
&& TREE_VALUE (stack
); stack
= TREE_CHAIN (stack
))
1049 body
= chainon (TREE_VALUE (stack
), body
);
1053 /* They were called into existence, so add to statement tree. */
1054 body
= chainon (body
,
1055 TREE_CHAIN (DECL_SAVED_TREE (current_function_decl
)));
1056 body
= build_stmt (COMPOUND_STMT
, body
);
1058 COMPOUND_STMT_NO_SCOPE (body
) = 1;
1059 TREE_CHAIN (DECL_SAVED_TREE (current_function_decl
)) = body
;
1062 for (ix
= 0; fname_vars
[ix
].decl
; ix
++)
1063 *fname_vars
[ix
].decl
= NULL_TREE
;
1067 /* We had saved values, restore them. */
1070 for (saved
= TREE_PURPOSE (stack
); saved
; saved
= TREE_CHAIN (saved
))
1072 tree decl
= TREE_PURPOSE (saved
);
1073 unsigned ix
= TREE_INT_CST_LOW (TREE_VALUE (saved
));
1075 *fname_vars
[ix
].decl
= decl
;
1077 stack
= TREE_CHAIN (stack
);
1079 saved_function_name_decls
= stack
;
1082 /* Return the text name of the current function, suitable prettified
1086 fname_as_string (pretty_p
)
1089 const char *name
= NULL
;
1092 name
= (current_function_decl
1093 ? (*lang_hooks
.decl_printable_name
) (current_function_decl
, 2)
1095 else if (current_function_decl
&& DECL_NAME (current_function_decl
))
1096 name
= IDENTIFIER_POINTER (DECL_NAME (current_function_decl
));
1102 /* Return the text name of the current function, formatted as
1103 required by the supplied RID value. */
1111 for (ix
= 0; fname_vars
[ix
].decl
; ix
++)
1112 if (fname_vars
[ix
].rid
== rid
)
1114 return fname_as_string (fname_vars
[ix
].pretty
);
1117 /* Return the VAR_DECL for a const char array naming the current
1118 function. If the VAR_DECL has not yet been created, create it
1119 now. RID indicates how it should be formatted and IDENTIFIER_NODE
1120 ID is its name (unfortunately C and C++ hold the RID values of
1121 keywords in different places, so we can't derive RID from ID in
1122 this language independent code. */
1125 fname_decl (rid
, id
)
1130 tree decl
= NULL_TREE
;
1132 for (ix
= 0; fname_vars
[ix
].decl
; ix
++)
1133 if (fname_vars
[ix
].rid
== rid
)
1136 decl
= *fname_vars
[ix
].decl
;
1139 tree saved_last_tree
= last_tree
;
1140 /* If a tree is built here, it would normally have the lineno of
1141 the current statement. Later this tree will be moved to the
1142 beginning of the function and this line number will be wrong.
1143 To avoid this problem set the lineno to 0 here; that prevents
1144 it from appearing in the RTL. */
1145 int saved_lineno
= lineno
;
1148 decl
= (*make_fname_decl
) (id
, fname_vars
[ix
].pretty
);
1149 if (last_tree
!= saved_last_tree
)
1151 /* We created some statement tree for the decl. This belongs
1152 at the start of the function, so remove it now and reinsert
1153 it after the function is complete. */
1154 tree stmts
= TREE_CHAIN (saved_last_tree
);
1156 TREE_CHAIN (saved_last_tree
) = NULL_TREE
;
1157 last_tree
= saved_last_tree
;
1158 saved_function_name_decls
= tree_cons (decl
, stmts
,
1159 saved_function_name_decls
);
1161 *fname_vars
[ix
].decl
= decl
;
1162 lineno
= saved_lineno
;
1164 if (!ix
&& !current_function_decl
)
1165 pedwarn_with_decl (decl
, "`%s' is not defined outside of function scope");
1170 /* Given a STRING_CST, give it a suitable array-of-chars data type. */
1173 fix_string_type (value
)
1176 const int wchar_bytes
= TYPE_PRECISION (wchar_type_node
) / BITS_PER_UNIT
;
1177 const int wide_flag
= TREE_TYPE (value
) == wchar_array_type_node
;
1178 const int nchars_max
= flag_isoc99
? 4095 : 509;
1179 int length
= TREE_STRING_LENGTH (value
);
1182 /* Compute the number of elements, for the array type. */
1183 nchars
= wide_flag
? length
/ wchar_bytes
: length
;
1185 if (pedantic
&& nchars
- 1 > nchars_max
&& c_language
== clk_c
)
1186 pedwarn ("string length `%d' is greater than the length `%d' ISO C%d compilers are required to support",
1187 nchars
- 1, nchars_max
, flag_isoc99
? 99 : 89);
1189 /* Create the array type for the string constant.
1190 -Wwrite-strings says make the string constant an array of const char
1191 so that copying it to a non-const pointer will get a warning.
1192 For C++, this is the standard behavior. */
1193 if (flag_const_strings
&& ! flag_writable_strings
)
1196 = build_type_variant (wide_flag
? wchar_type_node
: char_type_node
,
1199 = build_array_type (elements
,
1200 build_index_type (build_int_2 (nchars
- 1, 0)));
1204 = build_array_type (wide_flag
? wchar_type_node
: char_type_node
,
1205 build_index_type (build_int_2 (nchars
- 1, 0)));
1207 TREE_CONSTANT (value
) = 1;
1208 TREE_READONLY (value
) = ! flag_writable_strings
;
1209 TREE_STATIC (value
) = 1;
1213 /* Given a VARRAY of STRING_CST nodes, concatenate them into one
1217 combine_strings (strings
)
1218 varray_type strings
;
1220 const int wchar_bytes
= TYPE_PRECISION (wchar_type_node
) / BITS_PER_UNIT
;
1221 const int nstrings
= VARRAY_ACTIVE_SIZE (strings
);
1224 int wide_length
= 0;
1229 /* Don't include the \0 at the end of each substring. Count wide
1230 strings and ordinary strings separately. */
1231 for (i
= 0; i
< nstrings
; ++i
)
1233 t
= VARRAY_TREE (strings
, i
);
1235 if (TREE_TYPE (t
) == wchar_array_type_node
)
1237 wide_length
+= TREE_STRING_LENGTH (t
) - wchar_bytes
;
1242 length
+= (TREE_STRING_LENGTH (t
) - 1);
1243 if (C_ARTIFICIAL_STRING_P (t
) && !in_system_header
)
1244 warning ("concatenation of string literals with __FUNCTION__ is deprecated");
1248 /* If anything is wide, the non-wides will be converted,
1249 which makes them take more space. */
1251 length
= length
* wchar_bytes
+ wide_length
;
1253 p
= xmalloc (length
);
1255 /* Copy the individual strings into the new combined string.
1256 If the combined string is wide, convert the chars to ints
1257 for any individual strings that are not wide. */
1260 for (i
= 0; i
< nstrings
; ++i
)
1264 t
= VARRAY_TREE (strings
, i
);
1265 this_wide
= TREE_TYPE (t
) == wchar_array_type_node
;
1266 len
= TREE_STRING_LENGTH (t
) - (this_wide
? wchar_bytes
: 1);
1267 if (this_wide
== wide_flag
)
1269 memcpy (q
, TREE_STRING_POINTER (t
), len
);
1274 const int nzeros
= (TYPE_PRECISION (wchar_type_node
)
1275 / BITS_PER_UNIT
) - 1;
1278 if (BYTES_BIG_ENDIAN
)
1280 for (k
= 0; k
< len
; k
++)
1282 for (j
= 0; j
< nzeros
; j
++)
1284 *q
++ = TREE_STRING_POINTER (t
)[k
];
1289 for (k
= 0; k
< len
; k
++)
1291 *q
++ = TREE_STRING_POINTER (t
)[k
];
1292 for (j
= 0; j
< nzeros
; j
++)
1299 /* Nul terminate the string. */
1302 for (i
= 0; i
< wchar_bytes
; i
++)
1308 value
= build_string (length
, p
);
1312 TREE_TYPE (value
) = wchar_array_type_node
;
1314 TREE_TYPE (value
) = char_array_type_node
;
1319 static int is_valid_printf_arglist
PARAMS ((tree
));
1320 static rtx c_expand_builtin
PARAMS ((tree
, rtx
, enum machine_mode
, enum expand_modifier
));
1321 static rtx c_expand_builtin_printf
PARAMS ((tree
, rtx
, enum machine_mode
,
1322 enum expand_modifier
, int, int));
1323 static rtx c_expand_builtin_fprintf
PARAMS ((tree
, rtx
, enum machine_mode
,
1324 enum expand_modifier
, int, int));
1326 /* Print a warning if a constant expression had overflow in folding.
1327 Invoke this function on every expression that the language
1328 requires to be a constant expression.
1329 Note the ANSI C standard says it is erroneous for a
1330 constant expression to overflow. */
1333 constant_expression_warning (value
)
1336 if ((TREE_CODE (value
) == INTEGER_CST
|| TREE_CODE (value
) == REAL_CST
1337 || TREE_CODE (value
) == VECTOR_CST
1338 || TREE_CODE (value
) == COMPLEX_CST
)
1339 && TREE_CONSTANT_OVERFLOW (value
) && pedantic
)
1340 pedwarn ("overflow in constant expression");
1343 /* Print a warning if an expression had overflow in folding.
1344 Invoke this function on every expression that
1345 (1) appears in the source code, and
1346 (2) might be a constant expression that overflowed, and
1347 (3) is not already checked by convert_and_check;
1348 however, do not invoke this function on operands of explicit casts. */
1351 overflow_warning (value
)
1354 if ((TREE_CODE (value
) == INTEGER_CST
1355 || (TREE_CODE (value
) == COMPLEX_CST
1356 && TREE_CODE (TREE_REALPART (value
)) == INTEGER_CST
))
1357 && TREE_OVERFLOW (value
))
1359 TREE_OVERFLOW (value
) = 0;
1360 if (skip_evaluation
== 0)
1361 warning ("integer overflow in expression");
1363 else if ((TREE_CODE (value
) == REAL_CST
1364 || (TREE_CODE (value
) == COMPLEX_CST
1365 && TREE_CODE (TREE_REALPART (value
)) == REAL_CST
))
1366 && TREE_OVERFLOW (value
))
1368 TREE_OVERFLOW (value
) = 0;
1369 if (skip_evaluation
== 0)
1370 warning ("floating point overflow in expression");
1372 else if (TREE_CODE (value
) == VECTOR_CST
&& TREE_OVERFLOW (value
))
1374 TREE_OVERFLOW (value
) = 0;
1375 if (skip_evaluation
== 0)
1376 warning ("vector overflow in expression");
1380 /* Print a warning if a large constant is truncated to unsigned,
1381 or if -Wconversion is used and a constant < 0 is converted to unsigned.
1382 Invoke this function on every expression that might be implicitly
1383 converted to an unsigned type. */
1386 unsigned_conversion_warning (result
, operand
)
1387 tree result
, operand
;
1389 tree type
= TREE_TYPE (result
);
1391 if (TREE_CODE (operand
) == INTEGER_CST
1392 && TREE_CODE (type
) == INTEGER_TYPE
1393 && TREE_UNSIGNED (type
)
1394 && skip_evaluation
== 0
1395 && !int_fits_type_p (operand
, type
))
1397 if (!int_fits_type_p (operand
, c_common_signed_type (type
)))
1398 /* This detects cases like converting -129 or 256 to unsigned char. */
1399 warning ("large integer implicitly truncated to unsigned type");
1400 else if (warn_conversion
)
1401 warning ("negative integer implicitly converted to unsigned type");
1405 /* Nonzero if constant C has a value that is permissible
1406 for type TYPE (an INTEGER_TYPE). */
1409 constant_fits_type_p (c
, type
)
1412 if (TREE_CODE (c
) == INTEGER_CST
)
1413 return int_fits_type_p (c
, type
);
1415 c
= convert (type
, c
);
1416 return !TREE_OVERFLOW (c
);
1419 /* Convert EXPR to TYPE, warning about conversion problems with constants.
1420 Invoke this function on every expression that is converted implicitly,
1421 i.e. because of language rules and not because of an explicit cast. */
1424 convert_and_check (type
, expr
)
1427 tree t
= convert (type
, expr
);
1428 if (TREE_CODE (t
) == INTEGER_CST
)
1430 if (TREE_OVERFLOW (t
))
1432 TREE_OVERFLOW (t
) = 0;
1434 /* Do not diagnose overflow in a constant expression merely
1435 because a conversion overflowed. */
1436 TREE_CONSTANT_OVERFLOW (t
) = TREE_CONSTANT_OVERFLOW (expr
);
1438 /* No warning for converting 0x80000000 to int. */
1439 if (!(TREE_UNSIGNED (type
) < TREE_UNSIGNED (TREE_TYPE (expr
))
1440 && TREE_CODE (TREE_TYPE (expr
)) == INTEGER_TYPE
1441 && TYPE_PRECISION (type
) == TYPE_PRECISION (TREE_TYPE (expr
))))
1442 /* If EXPR fits in the unsigned version of TYPE,
1443 don't warn unless pedantic. */
1445 || TREE_UNSIGNED (type
)
1446 || ! constant_fits_type_p (expr
,
1447 c_common_unsigned_type (type
)))
1448 && skip_evaluation
== 0)
1449 warning ("overflow in implicit constant conversion");
1452 unsigned_conversion_warning (t
, expr
);
1457 /* A node in a list that describes references to variables (EXPR), which are
1458 either read accesses if WRITER is zero, or write accesses, in which case
1459 WRITER is the parent of EXPR. */
1466 /* Used to implement a cache the results of a call to verify_tree. We only
1467 use this for SAVE_EXPRs. */
1470 struct tlist_cache
*next
;
1471 struct tlist
*cache_before_sp
;
1472 struct tlist
*cache_after_sp
;
1476 /* Obstack to use when allocating tlist structures, and corresponding
1478 static struct obstack tlist_obstack
;
1479 static char *tlist_firstobj
= 0;
1481 /* Keep track of the identifiers we've warned about, so we can avoid duplicate
1483 static struct tlist
*warned_ids
;
1484 /* SAVE_EXPRs need special treatment. We process them only once and then
1485 cache the results. */
1486 static struct tlist_cache
*save_expr_cache
;
1488 static void add_tlist
PARAMS ((struct tlist
**, struct tlist
*, tree
, int));
1489 static void merge_tlist
PARAMS ((struct tlist
**, struct tlist
*, int));
1490 static void verify_tree
PARAMS ((tree
, struct tlist
**, struct tlist
**, tree
));
1491 static int warning_candidate_p
PARAMS ((tree
));
1492 static void warn_for_collisions
PARAMS ((struct tlist
*));
1493 static void warn_for_collisions_1
PARAMS ((tree
, tree
, struct tlist
*, int));
1494 static struct tlist
*new_tlist
PARAMS ((struct tlist
*, tree
, tree
));
1495 static void verify_sequence_points
PARAMS ((tree
));
1497 /* Create a new struct tlist and fill in its fields. */
1498 static struct tlist
*
1499 new_tlist (next
, t
, writer
)
1505 l
= (struct tlist
*) obstack_alloc (&tlist_obstack
, sizeof *l
);
1512 /* Add duplicates of the nodes found in ADD to the list *TO. If EXCLUDE_WRITER
1513 is nonnull, we ignore any node we find which has a writer equal to it. */
1516 add_tlist (to
, add
, exclude_writer
, copy
)
1519 tree exclude_writer
;
1524 struct tlist
*next
= add
->next
;
1527 if (! exclude_writer
|| add
->writer
!= exclude_writer
)
1528 *to
= copy
? new_tlist (*to
, add
->expr
, add
->writer
) : add
;
1533 /* Merge the nodes of ADD into TO. This merging process is done so that for
1534 each variable that already exists in TO, no new node is added; however if
1535 there is a write access recorded in ADD, and an occurrence on TO is only
1536 a read access, then the occurrence in TO will be modified to record the
1540 merge_tlist (to
, add
, copy
)
1545 struct tlist
**end
= to
;
1548 end
= &(*end
)->next
;
1554 struct tlist
*next
= add
->next
;
1556 for (tmp2
= *to
; tmp2
; tmp2
= tmp2
->next
)
1557 if (tmp2
->expr
== add
->expr
)
1561 tmp2
->writer
= add
->writer
;
1565 *end
= copy
? add
: new_tlist (NULL
, add
->expr
, add
->writer
);
1566 end
= &(*end
)->next
;
1573 /* WRITTEN is a variable, WRITER is its parent. Warn if any of the variable
1574 references in list LIST conflict with it, excluding reads if ONLY writers
1578 warn_for_collisions_1 (written
, writer
, list
, only_writes
)
1579 tree written
, writer
;
1585 /* Avoid duplicate warnings. */
1586 for (tmp
= warned_ids
; tmp
; tmp
= tmp
->next
)
1587 if (tmp
->expr
== written
)
1592 if (list
->expr
== written
1593 && list
->writer
!= writer
1594 && (! only_writes
|| list
->writer
))
1596 warned_ids
= new_tlist (warned_ids
, written
, NULL_TREE
);
1597 warning ("operation on `%s' may be undefined",
1598 IDENTIFIER_POINTER (DECL_NAME (list
->expr
)));
1604 /* Given a list LIST of references to variables, find whether any of these
1605 can cause conflicts due to missing sequence points. */
1608 warn_for_collisions (list
)
1613 for (tmp
= list
; tmp
; tmp
= tmp
->next
)
1616 warn_for_collisions_1 (tmp
->expr
, tmp
->writer
, list
, 0);
1620 /* Return nonzero if X is a tree that can be verified by the sequence point
1623 warning_candidate_p (x
)
1626 return TREE_CODE (x
) == VAR_DECL
|| TREE_CODE (x
) == PARM_DECL
;
1629 /* Walk the tree X, and record accesses to variables. If X is written by the
1630 parent tree, WRITER is the parent.
1631 We store accesses in one of the two lists: PBEFORE_SP, and PNO_SP. If this
1632 expression or its only operand forces a sequence point, then everything up
1633 to the sequence point is stored in PBEFORE_SP. Everything else gets stored
1635 Once we return, we will have emitted warnings if any subexpression before
1636 such a sequence point could be undefined. On a higher level, however, the
1637 sequence point may not be relevant, and we'll merge the two lists.
1639 Example: (b++, a) + b;
1640 The call that processes the COMPOUND_EXPR will store the increment of B
1641 in PBEFORE_SP, and the use of A in PNO_SP. The higher-level call that
1642 processes the PLUS_EXPR will need to merge the two lists so that
1643 eventually, all accesses end up on the same list (and we'll warn about the
1644 unordered subexpressions b++ and b.
1646 A note on merging. If we modify the former example so that our expression
1649 care must be taken not simply to add all three expressions into the final
1650 PNO_SP list. The function merge_tlist takes care of that by merging the
1651 before-SP list of the COMPOUND_EXPR into its after-SP list in a special
1652 way, so that no more than one access to B is recorded. */
1655 verify_tree (x
, pbefore_sp
, pno_sp
, writer
)
1657 struct tlist
**pbefore_sp
, **pno_sp
;
1660 struct tlist
*tmp_before
, *tmp_nosp
, *tmp_list2
, *tmp_list3
;
1661 enum tree_code code
;
1664 /* X may be NULL if it is the operand of an empty statement expression
1670 code
= TREE_CODE (x
);
1671 class = TREE_CODE_CLASS (code
);
1673 if (warning_candidate_p (x
))
1675 *pno_sp
= new_tlist (*pno_sp
, x
, writer
);
1685 case TRUTH_ANDIF_EXPR
:
1686 case TRUTH_ORIF_EXPR
:
1687 tmp_before
= tmp_nosp
= tmp_list3
= 0;
1688 verify_tree (TREE_OPERAND (x
, 0), &tmp_before
, &tmp_nosp
, NULL_TREE
);
1689 warn_for_collisions (tmp_nosp
);
1690 merge_tlist (pbefore_sp
, tmp_before
, 0);
1691 merge_tlist (pbefore_sp
, tmp_nosp
, 0);
1692 verify_tree (TREE_OPERAND (x
, 1), &tmp_list3
, pno_sp
, NULL_TREE
);
1693 merge_tlist (pbefore_sp
, tmp_list3
, 0);
1697 tmp_before
= tmp_list2
= 0;
1698 verify_tree (TREE_OPERAND (x
, 0), &tmp_before
, &tmp_list2
, NULL_TREE
);
1699 warn_for_collisions (tmp_list2
);
1700 merge_tlist (pbefore_sp
, tmp_before
, 0);
1701 merge_tlist (pbefore_sp
, tmp_list2
, 1);
1703 tmp_list3
= tmp_nosp
= 0;
1704 verify_tree (TREE_OPERAND (x
, 1), &tmp_list3
, &tmp_nosp
, NULL_TREE
);
1705 warn_for_collisions (tmp_nosp
);
1706 merge_tlist (pbefore_sp
, tmp_list3
, 0);
1708 tmp_list3
= tmp_list2
= 0;
1709 verify_tree (TREE_OPERAND (x
, 2), &tmp_list3
, &tmp_list2
, NULL_TREE
);
1710 warn_for_collisions (tmp_list2
);
1711 merge_tlist (pbefore_sp
, tmp_list3
, 0);
1712 /* Rather than add both tmp_nosp and tmp_list2, we have to merge the
1713 two first, to avoid warning for (a ? b++ : b++). */
1714 merge_tlist (&tmp_nosp
, tmp_list2
, 0);
1715 add_tlist (pno_sp
, tmp_nosp
, NULL_TREE
, 0);
1718 case PREDECREMENT_EXPR
:
1719 case PREINCREMENT_EXPR
:
1720 case POSTDECREMENT_EXPR
:
1721 case POSTINCREMENT_EXPR
:
1722 verify_tree (TREE_OPERAND (x
, 0), pno_sp
, pno_sp
, x
);
1726 tmp_before
= tmp_nosp
= tmp_list3
= 0;
1727 verify_tree (TREE_OPERAND (x
, 1), &tmp_before
, &tmp_nosp
, NULL_TREE
);
1728 verify_tree (TREE_OPERAND (x
, 0), &tmp_list3
, &tmp_list3
, x
);
1729 /* Expressions inside the LHS are not ordered wrt. the sequence points
1730 in the RHS. Example:
1732 Despite the fact that the modification of "a" is in the before_sp
1733 list (tmp_before), it conflicts with the use of "a" in the LHS.
1734 We can handle this by adding the contents of tmp_list3
1735 to those of tmp_before, and redoing the collision warnings for that
1737 add_tlist (&tmp_before
, tmp_list3
, x
, 1);
1738 warn_for_collisions (tmp_before
);
1739 /* Exclude the LHS itself here; we first have to merge it into the
1740 tmp_nosp list. This is done to avoid warning for "a = a"; if we
1741 didn't exclude the LHS, we'd get it twice, once as a read and once
1743 add_tlist (pno_sp
, tmp_list3
, x
, 0);
1744 warn_for_collisions_1 (TREE_OPERAND (x
, 0), x
, tmp_nosp
, 1);
1746 merge_tlist (pbefore_sp
, tmp_before
, 0);
1747 if (warning_candidate_p (TREE_OPERAND (x
, 0)))
1748 merge_tlist (&tmp_nosp
, new_tlist (NULL
, TREE_OPERAND (x
, 0), x
), 0);
1749 add_tlist (pno_sp
, tmp_nosp
, NULL_TREE
, 1);
1753 /* We need to warn about conflicts among arguments and conflicts between
1754 args and the function address. Side effects of the function address,
1755 however, are not ordered by the sequence point of the call. */
1756 tmp_before
= tmp_nosp
= tmp_list2
= tmp_list3
= 0;
1757 verify_tree (TREE_OPERAND (x
, 0), &tmp_before
, &tmp_nosp
, NULL_TREE
);
1758 if (TREE_OPERAND (x
, 1))
1759 verify_tree (TREE_OPERAND (x
, 1), &tmp_list2
, &tmp_list3
, NULL_TREE
);
1760 merge_tlist (&tmp_list3
, tmp_list2
, 0);
1761 add_tlist (&tmp_before
, tmp_list3
, NULL_TREE
, 0);
1762 add_tlist (&tmp_before
, tmp_nosp
, NULL_TREE
, 0);
1763 warn_for_collisions (tmp_before
);
1764 add_tlist (pbefore_sp
, tmp_before
, NULL_TREE
, 0);
1768 /* Scan all the list, e.g. indices of multi dimensional array. */
1771 tmp_before
= tmp_nosp
= 0;
1772 verify_tree (TREE_VALUE (x
), &tmp_before
, &tmp_nosp
, NULL_TREE
);
1773 merge_tlist (&tmp_nosp
, tmp_before
, 0);
1774 add_tlist (pno_sp
, tmp_nosp
, NULL_TREE
, 0);
1781 struct tlist_cache
*t
;
1782 for (t
= save_expr_cache
; t
; t
= t
->next
)
1788 t
= (struct tlist_cache
*) obstack_alloc (&tlist_obstack
,
1790 t
->next
= save_expr_cache
;
1792 save_expr_cache
= t
;
1794 tmp_before
= tmp_nosp
= 0;
1795 verify_tree (TREE_OPERAND (x
, 0), &tmp_before
, &tmp_nosp
, NULL_TREE
);
1796 warn_for_collisions (tmp_nosp
);
1801 struct tlist
*t
= tmp_nosp
;
1803 merge_tlist (&tmp_list3
, t
, 0);
1805 t
->cache_before_sp
= tmp_before
;
1806 t
->cache_after_sp
= tmp_list3
;
1808 merge_tlist (pbefore_sp
, t
->cache_before_sp
, 1);
1809 add_tlist (pno_sp
, t
->cache_after_sp
, NULL_TREE
, 1);
1818 if (first_rtl_op (code
) == 0)
1820 x
= TREE_OPERAND (x
, 0);
1836 int max
= first_rtl_op (TREE_CODE (x
));
1837 for (lp
= 0; lp
< max
; lp
++)
1839 tmp_before
= tmp_nosp
= 0;
1840 verify_tree (TREE_OPERAND (x
, lp
), &tmp_before
, &tmp_nosp
, NULL_TREE
);
1841 merge_tlist (&tmp_nosp
, tmp_before
, 0);
1842 add_tlist (pno_sp
, tmp_nosp
, NULL_TREE
, 0);
1849 /* Try to warn for undefined behavior in EXPR due to missing sequence
1853 verify_sequence_points (expr
)
1856 struct tlist
*before_sp
= 0, *after_sp
= 0;
1859 save_expr_cache
= 0;
1860 if (tlist_firstobj
== 0)
1862 gcc_obstack_init (&tlist_obstack
);
1863 tlist_firstobj
= obstack_alloc (&tlist_obstack
, 0);
1866 verify_tree (expr
, &before_sp
, &after_sp
, 0);
1867 warn_for_collisions (after_sp
);
1868 obstack_free (&tlist_obstack
, tlist_firstobj
);
1872 c_expand_expr_stmt (expr
)
1875 /* Do default conversion if safe and possibly important,
1876 in case within ({...}). */
1877 if ((TREE_CODE (TREE_TYPE (expr
)) == ARRAY_TYPE
1878 && (flag_isoc99
|| lvalue_p (expr
)))
1879 || TREE_CODE (TREE_TYPE (expr
)) == FUNCTION_TYPE
)
1880 expr
= default_conversion (expr
);
1882 if (warn_sequence_point
)
1883 verify_sequence_points (expr
);
1885 if (TREE_TYPE (expr
) != error_mark_node
1886 && !COMPLETE_OR_VOID_TYPE_P (TREE_TYPE (expr
))
1887 && TREE_CODE (TREE_TYPE (expr
)) != ARRAY_TYPE
)
1888 error ("expression statement has incomplete type");
1890 last_expr_type
= TREE_TYPE (expr
);
1891 return add_stmt (build_stmt (EXPR_STMT
, expr
));
1894 /* Validate the expression after `case' and apply default promotions. */
1897 check_case_value (value
)
1900 if (value
== NULL_TREE
)
1903 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
1904 STRIP_TYPE_NOPS (value
);
1905 /* In C++, the following is allowed:
1908 switch (...) { case i: ... }
1910 So, we try to reduce the VALUE to a constant that way. */
1911 if (c_language
== clk_cplusplus
)
1913 value
= decl_constant_value (value
);
1914 STRIP_TYPE_NOPS (value
);
1915 value
= fold (value
);
1918 if (TREE_CODE (value
) != INTEGER_CST
1919 && value
!= error_mark_node
)
1921 error ("case label does not reduce to an integer constant");
1922 value
= error_mark_node
;
1925 /* Promote char or short to int. */
1926 value
= default_conversion (value
);
1928 constant_expression_warning (value
);
1933 /* Return an integer type with BITS bits of precision,
1934 that is unsigned if UNSIGNEDP is nonzero, otherwise signed. */
1937 c_common_type_for_size (bits
, unsignedp
)
1941 if (bits
== TYPE_PRECISION (integer_type_node
))
1942 return unsignedp
? unsigned_type_node
: integer_type_node
;
1944 if (bits
== TYPE_PRECISION (signed_char_type_node
))
1945 return unsignedp
? unsigned_char_type_node
: signed_char_type_node
;
1947 if (bits
== TYPE_PRECISION (short_integer_type_node
))
1948 return unsignedp
? short_unsigned_type_node
: short_integer_type_node
;
1950 if (bits
== TYPE_PRECISION (long_integer_type_node
))
1951 return unsignedp
? long_unsigned_type_node
: long_integer_type_node
;
1953 if (bits
== TYPE_PRECISION (long_long_integer_type_node
))
1954 return (unsignedp
? long_long_unsigned_type_node
1955 : long_long_integer_type_node
);
1957 if (bits
== TYPE_PRECISION (widest_integer_literal_type_node
))
1958 return (unsignedp
? widest_unsigned_literal_type_node
1959 : widest_integer_literal_type_node
);
1961 if (bits
<= TYPE_PRECISION (intQI_type_node
))
1962 return unsignedp
? unsigned_intQI_type_node
: intQI_type_node
;
1964 if (bits
<= TYPE_PRECISION (intHI_type_node
))
1965 return unsignedp
? unsigned_intHI_type_node
: intHI_type_node
;
1967 if (bits
<= TYPE_PRECISION (intSI_type_node
))
1968 return unsignedp
? unsigned_intSI_type_node
: intSI_type_node
;
1970 if (bits
<= TYPE_PRECISION (intDI_type_node
))
1971 return unsignedp
? unsigned_intDI_type_node
: intDI_type_node
;
1976 /* Return a data type that has machine mode MODE.
1977 If the mode is an integer,
1978 then UNSIGNEDP selects between signed and unsigned types. */
1981 c_common_type_for_mode (mode
, unsignedp
)
1982 enum machine_mode mode
;
1985 if (mode
== TYPE_MODE (integer_type_node
))
1986 return unsignedp
? unsigned_type_node
: integer_type_node
;
1988 if (mode
== TYPE_MODE (signed_char_type_node
))
1989 return unsignedp
? unsigned_char_type_node
: signed_char_type_node
;
1991 if (mode
== TYPE_MODE (short_integer_type_node
))
1992 return unsignedp
? short_unsigned_type_node
: short_integer_type_node
;
1994 if (mode
== TYPE_MODE (long_integer_type_node
))
1995 return unsignedp
? long_unsigned_type_node
: long_integer_type_node
;
1997 if (mode
== TYPE_MODE (long_long_integer_type_node
))
1998 return unsignedp
? long_long_unsigned_type_node
: long_long_integer_type_node
;
2000 if (mode
== TYPE_MODE (widest_integer_literal_type_node
))
2001 return unsignedp
? widest_unsigned_literal_type_node
2002 : widest_integer_literal_type_node
;
2005 return unsignedp
? unsigned_intQI_type_node
: intQI_type_node
;
2008 return unsignedp
? unsigned_intHI_type_node
: intHI_type_node
;
2011 return unsignedp
? unsigned_intSI_type_node
: intSI_type_node
;
2014 return unsignedp
? unsigned_intDI_type_node
: intDI_type_node
;
2016 #if HOST_BITS_PER_WIDE_INT >= 64
2017 if (mode
== TYPE_MODE (intTI_type_node
))
2018 return unsignedp
? unsigned_intTI_type_node
: intTI_type_node
;
2021 if (mode
== TYPE_MODE (float_type_node
))
2022 return float_type_node
;
2024 if (mode
== TYPE_MODE (double_type_node
))
2025 return double_type_node
;
2027 if (mode
== TYPE_MODE (long_double_type_node
))
2028 return long_double_type_node
;
2030 if (mode
== TYPE_MODE (build_pointer_type (char_type_node
)))
2031 return build_pointer_type (char_type_node
);
2033 if (mode
== TYPE_MODE (build_pointer_type (integer_type_node
)))
2034 return build_pointer_type (integer_type_node
);
2039 return unsignedp
? unsigned_V16QI_type_node
: V16QI_type_node
;
2041 return unsignedp
? unsigned_V8HI_type_node
: V8HI_type_node
;
2043 return unsignedp
? unsigned_V4SI_type_node
: V4SI_type_node
;
2045 return unsignedp
? unsigned_V2DI_type_node
: V2DI_type_node
;
2047 return unsignedp
? unsigned_V2SI_type_node
: V2SI_type_node
;
2049 return unsignedp
? unsigned_V2HI_type_node
: V2HI_type_node
;
2051 return unsignedp
? unsigned_V4HI_type_node
: V4HI_type_node
;
2053 return unsignedp
? unsigned_V8QI_type_node
: V8QI_type_node
;
2055 return unsignedp
? unsigned_V1DI_type_node
: V1DI_type_node
;
2057 return V16SF_type_node
;
2059 return V4SF_type_node
;
2061 return V2SF_type_node
;
2063 return V2DF_type_node
;
2071 /* Return an unsigned type the same as TYPE in other respects. */
2073 c_common_unsigned_type (type
)
2076 tree type1
= TYPE_MAIN_VARIANT (type
);
2077 if (type1
== signed_char_type_node
|| type1
== char_type_node
)
2078 return unsigned_char_type_node
;
2079 if (type1
== integer_type_node
)
2080 return unsigned_type_node
;
2081 if (type1
== short_integer_type_node
)
2082 return short_unsigned_type_node
;
2083 if (type1
== long_integer_type_node
)
2084 return long_unsigned_type_node
;
2085 if (type1
== long_long_integer_type_node
)
2086 return long_long_unsigned_type_node
;
2087 if (type1
== widest_integer_literal_type_node
)
2088 return widest_unsigned_literal_type_node
;
2089 #if HOST_BITS_PER_WIDE_INT >= 64
2090 if (type1
== intTI_type_node
)
2091 return unsigned_intTI_type_node
;
2093 if (type1
== intDI_type_node
)
2094 return unsigned_intDI_type_node
;
2095 if (type1
== intSI_type_node
)
2096 return unsigned_intSI_type_node
;
2097 if (type1
== intHI_type_node
)
2098 return unsigned_intHI_type_node
;
2099 if (type1
== intQI_type_node
)
2100 return unsigned_intQI_type_node
;
2102 return c_common_signed_or_unsigned_type (1, type
);
2105 /* Return a signed type the same as TYPE in other respects. */
2108 c_common_signed_type (type
)
2111 tree type1
= TYPE_MAIN_VARIANT (type
);
2112 if (type1
== unsigned_char_type_node
|| type1
== char_type_node
)
2113 return signed_char_type_node
;
2114 if (type1
== unsigned_type_node
)
2115 return integer_type_node
;
2116 if (type1
== short_unsigned_type_node
)
2117 return short_integer_type_node
;
2118 if (type1
== long_unsigned_type_node
)
2119 return long_integer_type_node
;
2120 if (type1
== long_long_unsigned_type_node
)
2121 return long_long_integer_type_node
;
2122 if (type1
== widest_unsigned_literal_type_node
)
2123 return widest_integer_literal_type_node
;
2124 #if HOST_BITS_PER_WIDE_INT >= 64
2125 if (type1
== unsigned_intTI_type_node
)
2126 return intTI_type_node
;
2128 if (type1
== unsigned_intDI_type_node
)
2129 return intDI_type_node
;
2130 if (type1
== unsigned_intSI_type_node
)
2131 return intSI_type_node
;
2132 if (type1
== unsigned_intHI_type_node
)
2133 return intHI_type_node
;
2134 if (type1
== unsigned_intQI_type_node
)
2135 return intQI_type_node
;
2137 return c_common_signed_or_unsigned_type (0, type
);
2140 /* Return a type the same as TYPE except unsigned or
2141 signed according to UNSIGNEDP. */
2144 c_common_signed_or_unsigned_type (unsignedp
, type
)
2148 if (! INTEGRAL_TYPE_P (type
)
2149 || TREE_UNSIGNED (type
) == unsignedp
)
2152 if (TYPE_PRECISION (type
) == TYPE_PRECISION (signed_char_type_node
))
2153 return unsignedp
? unsigned_char_type_node
: signed_char_type_node
;
2154 if (TYPE_PRECISION (type
) == TYPE_PRECISION (integer_type_node
))
2155 return unsignedp
? unsigned_type_node
: integer_type_node
;
2156 if (TYPE_PRECISION (type
) == TYPE_PRECISION (short_integer_type_node
))
2157 return unsignedp
? short_unsigned_type_node
: short_integer_type_node
;
2158 if (TYPE_PRECISION (type
) == TYPE_PRECISION (long_integer_type_node
))
2159 return unsignedp
? long_unsigned_type_node
: long_integer_type_node
;
2160 if (TYPE_PRECISION (type
) == TYPE_PRECISION (long_long_integer_type_node
))
2161 return (unsignedp
? long_long_unsigned_type_node
2162 : long_long_integer_type_node
);
2163 if (TYPE_PRECISION (type
) == TYPE_PRECISION (widest_integer_literal_type_node
))
2164 return (unsignedp
? widest_unsigned_literal_type_node
2165 : widest_integer_literal_type_node
);
2167 #if HOST_BITS_PER_WIDE_INT >= 64
2168 if (TYPE_PRECISION (type
) == TYPE_PRECISION (intTI_type_node
))
2169 return unsignedp
? unsigned_intTI_type_node
: intTI_type_node
;
2171 if (TYPE_PRECISION (type
) == TYPE_PRECISION (intDI_type_node
))
2172 return unsignedp
? unsigned_intDI_type_node
: intDI_type_node
;
2173 if (TYPE_PRECISION (type
) == TYPE_PRECISION (intSI_type_node
))
2174 return unsignedp
? unsigned_intSI_type_node
: intSI_type_node
;
2175 if (TYPE_PRECISION (type
) == TYPE_PRECISION (intHI_type_node
))
2176 return unsignedp
? unsigned_intHI_type_node
: intHI_type_node
;
2177 if (TYPE_PRECISION (type
) == TYPE_PRECISION (intQI_type_node
))
2178 return unsignedp
? unsigned_intQI_type_node
: intQI_type_node
;
2183 /* Return the minimum number of bits needed to represent VALUE in a
2184 signed or unsigned type, UNSIGNEDP says which. */
2187 min_precision (value
, unsignedp
)
2193 /* If the value is negative, compute its negative minus 1. The latter
2194 adjustment is because the absolute value of the largest negative value
2195 is one larger than the largest positive value. This is equivalent to
2196 a bit-wise negation, so use that operation instead. */
2198 if (tree_int_cst_sgn (value
) < 0)
2199 value
= fold (build1 (BIT_NOT_EXPR
, TREE_TYPE (value
), value
));
2201 /* Return the number of bits needed, taking into account the fact
2202 that we need one more bit for a signed than unsigned type. */
2204 if (integer_zerop (value
))
2207 log
= tree_floor_log2 (value
);
2209 return log
+ 1 + ! unsignedp
;
2212 /* Print an error message for invalid operands to arith operation
2213 CODE. NOP_EXPR is used as a special case (see
2214 c_common_truthvalue_conversion). */
2217 binary_op_error (code
)
2218 enum tree_code code
;
2225 error ("invalid truth-value expression");
2229 opname
= "+"; break;
2231 opname
= "-"; break;
2233 opname
= "*"; break;
2235 opname
= "max"; break;
2237 opname
= "min"; break;
2239 opname
= "=="; break;
2241 opname
= "!="; break;
2243 opname
= "<="; break;
2245 opname
= ">="; break;
2247 opname
= "<"; break;
2249 opname
= ">"; break;
2251 opname
= "<<"; break;
2253 opname
= ">>"; break;
2254 case TRUNC_MOD_EXPR
:
2255 case FLOOR_MOD_EXPR
:
2256 opname
= "%"; break;
2257 case TRUNC_DIV_EXPR
:
2258 case FLOOR_DIV_EXPR
:
2259 opname
= "/"; break;
2261 opname
= "&"; break;
2263 opname
= "|"; break;
2264 case TRUTH_ANDIF_EXPR
:
2265 opname
= "&&"; break;
2266 case TRUTH_ORIF_EXPR
:
2267 opname
= "||"; break;
2269 opname
= "^"; break;
2272 opname
= "rotate"; break;
2274 opname
= "unknown"; break;
2276 error ("invalid operands to binary %s", opname
);
2279 /* Subroutine of build_binary_op, used for comparison operations.
2280 See if the operands have both been converted from subword integer types
2281 and, if so, perhaps change them both back to their original type.
2282 This function is also responsible for converting the two operands
2283 to the proper common type for comparison.
2285 The arguments of this function are all pointers to local variables
2286 of build_binary_op: OP0_PTR is &OP0, OP1_PTR is &OP1,
2287 RESTYPE_PTR is &RESULT_TYPE and RESCODE_PTR is &RESULTCODE.
2289 If this function returns nonzero, it means that the comparison has
2290 a constant value. What this function returns is an expression for
2294 shorten_compare (op0_ptr
, op1_ptr
, restype_ptr
, rescode_ptr
)
2295 tree
*op0_ptr
, *op1_ptr
;
2297 enum tree_code
*rescode_ptr
;
2300 tree op0
= *op0_ptr
;
2301 tree op1
= *op1_ptr
;
2302 int unsignedp0
, unsignedp1
;
2304 tree primop0
, primop1
;
2305 enum tree_code code
= *rescode_ptr
;
2307 /* Throw away any conversions to wider types
2308 already present in the operands. */
2310 primop0
= get_narrower (op0
, &unsignedp0
);
2311 primop1
= get_narrower (op1
, &unsignedp1
);
2313 /* Handle the case that OP0 does not *contain* a conversion
2314 but it *requires* conversion to FINAL_TYPE. */
2316 if (op0
== primop0
&& TREE_TYPE (op0
) != *restype_ptr
)
2317 unsignedp0
= TREE_UNSIGNED (TREE_TYPE (op0
));
2318 if (op1
== primop1
&& TREE_TYPE (op1
) != *restype_ptr
)
2319 unsignedp1
= TREE_UNSIGNED (TREE_TYPE (op1
));
2321 /* If one of the operands must be floated, we cannot optimize. */
2322 real1
= TREE_CODE (TREE_TYPE (primop0
)) == REAL_TYPE
;
2323 real2
= TREE_CODE (TREE_TYPE (primop1
)) == REAL_TYPE
;
2325 /* If first arg is constant, swap the args (changing operation
2326 so value is preserved), for canonicalization. Don't do this if
2327 the second arg is 0. */
2329 if (TREE_CONSTANT (primop0
)
2330 && ! integer_zerop (primop1
) && ! real_zerop (primop1
))
2333 int temi
= unsignedp0
;
2341 unsignedp0
= unsignedp1
;
2364 *rescode_ptr
= code
;
2367 /* If comparing an integer against a constant more bits wide,
2368 maybe we can deduce a value of 1 or 0 independent of the data.
2369 Or else truncate the constant now
2370 rather than extend the variable at run time.
2372 This is only interesting if the constant is the wider arg.
2373 Also, it is not safe if the constant is unsigned and the
2374 variable arg is signed, since in this case the variable
2375 would be sign-extended and then regarded as unsigned.
2376 Our technique fails in this case because the lowest/highest
2377 possible unsigned results don't follow naturally from the
2378 lowest/highest possible values of the variable operand.
2379 For just EQ_EXPR and NE_EXPR there is another technique that
2380 could be used: see if the constant can be faithfully represented
2381 in the other operand's type, by truncating it and reextending it
2382 and see if that preserves the constant's value. */
2384 if (!real1
&& !real2
2385 && TREE_CODE (primop1
) == INTEGER_CST
2386 && TYPE_PRECISION (TREE_TYPE (primop0
)) < TYPE_PRECISION (*restype_ptr
))
2388 int min_gt
, max_gt
, min_lt
, max_lt
;
2389 tree maxval
, minval
;
2390 /* 1 if comparison is nominally unsigned. */
2391 int unsignedp
= TREE_UNSIGNED (*restype_ptr
);
2394 type
= c_common_signed_or_unsigned_type (unsignedp0
,
2395 TREE_TYPE (primop0
));
2397 /* If TYPE is an enumeration, then we need to get its min/max
2398 values from it's underlying integral type, not the enumerated
2400 if (TREE_CODE (type
) == ENUMERAL_TYPE
)
2401 type
= c_common_type_for_size (TYPE_PRECISION (type
), unsignedp0
);
2403 maxval
= TYPE_MAX_VALUE (type
);
2404 minval
= TYPE_MIN_VALUE (type
);
2406 if (unsignedp
&& !unsignedp0
)
2407 *restype_ptr
= c_common_signed_type (*restype_ptr
);
2409 if (TREE_TYPE (primop1
) != *restype_ptr
)
2410 primop1
= convert (*restype_ptr
, primop1
);
2411 if (type
!= *restype_ptr
)
2413 minval
= convert (*restype_ptr
, minval
);
2414 maxval
= convert (*restype_ptr
, maxval
);
2417 if (unsignedp
&& unsignedp0
)
2419 min_gt
= INT_CST_LT_UNSIGNED (primop1
, minval
);
2420 max_gt
= INT_CST_LT_UNSIGNED (primop1
, maxval
);
2421 min_lt
= INT_CST_LT_UNSIGNED (minval
, primop1
);
2422 max_lt
= INT_CST_LT_UNSIGNED (maxval
, primop1
);
2426 min_gt
= INT_CST_LT (primop1
, minval
);
2427 max_gt
= INT_CST_LT (primop1
, maxval
);
2428 min_lt
= INT_CST_LT (minval
, primop1
);
2429 max_lt
= INT_CST_LT (maxval
, primop1
);
2433 /* This used to be a switch, but Genix compiler can't handle that. */
2434 if (code
== NE_EXPR
)
2436 if (max_lt
|| min_gt
)
2437 val
= boolean_true_node
;
2439 else if (code
== EQ_EXPR
)
2441 if (max_lt
|| min_gt
)
2442 val
= boolean_false_node
;
2444 else if (code
== LT_EXPR
)
2447 val
= boolean_true_node
;
2449 val
= boolean_false_node
;
2451 else if (code
== GT_EXPR
)
2454 val
= boolean_true_node
;
2456 val
= boolean_false_node
;
2458 else if (code
== LE_EXPR
)
2461 val
= boolean_true_node
;
2463 val
= boolean_false_node
;
2465 else if (code
== GE_EXPR
)
2468 val
= boolean_true_node
;
2470 val
= boolean_false_node
;
2473 /* If primop0 was sign-extended and unsigned comparison specd,
2474 we did a signed comparison above using the signed type bounds.
2475 But the comparison we output must be unsigned.
2477 Also, for inequalities, VAL is no good; but if the signed
2478 comparison had *any* fixed result, it follows that the
2479 unsigned comparison just tests the sign in reverse
2480 (positive values are LE, negative ones GE).
2481 So we can generate an unsigned comparison
2482 against an extreme value of the signed type. */
2484 if (unsignedp
&& !unsignedp0
)
2491 primop1
= TYPE_MIN_VALUE (type
);
2497 primop1
= TYPE_MAX_VALUE (type
);
2504 type
= c_common_unsigned_type (type
);
2507 if (TREE_CODE (primop0
) != INTEGER_CST
)
2509 if (val
== boolean_false_node
)
2510 warning ("comparison is always false due to limited range of data type");
2511 if (val
== boolean_true_node
)
2512 warning ("comparison is always true due to limited range of data type");
2517 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
2518 if (TREE_SIDE_EFFECTS (primop0
))
2519 return build (COMPOUND_EXPR
, TREE_TYPE (val
), primop0
, val
);
2523 /* Value is not predetermined, but do the comparison
2524 in the type of the operand that is not constant.
2525 TYPE is already properly set. */
2527 else if (real1
&& real2
2528 && (TYPE_PRECISION (TREE_TYPE (primop0
))
2529 == TYPE_PRECISION (TREE_TYPE (primop1
))))
2530 type
= TREE_TYPE (primop0
);
2532 /* If args' natural types are both narrower than nominal type
2533 and both extend in the same manner, compare them
2534 in the type of the wider arg.
2535 Otherwise must actually extend both to the nominal
2536 common type lest different ways of extending
2538 (eg, (short)-1 == (unsigned short)-1 should be 0.) */
2540 else if (unsignedp0
== unsignedp1
&& real1
== real2
2541 && TYPE_PRECISION (TREE_TYPE (primop0
)) < TYPE_PRECISION (*restype_ptr
)
2542 && TYPE_PRECISION (TREE_TYPE (primop1
)) < TYPE_PRECISION (*restype_ptr
))
2544 type
= common_type (TREE_TYPE (primop0
), TREE_TYPE (primop1
));
2545 type
= c_common_signed_or_unsigned_type (unsignedp0
2546 || TREE_UNSIGNED (*restype_ptr
),
2548 /* Make sure shorter operand is extended the right way
2549 to match the longer operand. */
2551 = convert (c_common_signed_or_unsigned_type (unsignedp0
,
2552 TREE_TYPE (primop0
)),
2555 = convert (c_common_signed_or_unsigned_type (unsignedp1
,
2556 TREE_TYPE (primop1
)),
2561 /* Here we must do the comparison on the nominal type
2562 using the args exactly as we received them. */
2563 type
= *restype_ptr
;
2567 if (!real1
&& !real2
&& integer_zerop (primop1
)
2568 && TREE_UNSIGNED (*restype_ptr
))
2574 /* All unsigned values are >= 0, so we warn if extra warnings
2575 are requested. However, if OP0 is a constant that is
2576 >= 0, the signedness of the comparison isn't an issue,
2577 so suppress the warning. */
2578 if (extra_warnings
&& !in_system_header
2579 && ! (TREE_CODE (primop0
) == INTEGER_CST
2580 && ! TREE_OVERFLOW (convert (c_common_signed_type (type
),
2582 warning ("comparison of unsigned expression >= 0 is always true");
2583 value
= boolean_true_node
;
2587 if (extra_warnings
&& !in_system_header
2588 && ! (TREE_CODE (primop0
) == INTEGER_CST
2589 && ! TREE_OVERFLOW (convert (c_common_signed_type (type
),
2591 warning ("comparison of unsigned expression < 0 is always false");
2592 value
= boolean_false_node
;
2601 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
2602 if (TREE_SIDE_EFFECTS (primop0
))
2603 return build (COMPOUND_EXPR
, TREE_TYPE (value
),
2610 *op0_ptr
= convert (type
, primop0
);
2611 *op1_ptr
= convert (type
, primop1
);
2613 *restype_ptr
= boolean_type_node
;
2618 /* Return a tree for the sum or difference (RESULTCODE says which)
2619 of pointer PTROP and integer INTOP. */
2622 pointer_int_sum (resultcode
, ptrop
, intop
)
2623 enum tree_code resultcode
;
2631 /* The result is a pointer of the same type that is being added. */
2633 tree result_type
= TREE_TYPE (ptrop
);
2635 if (TREE_CODE (TREE_TYPE (result_type
)) == VOID_TYPE
)
2637 if (pedantic
|| warn_pointer_arith
)
2638 pedwarn ("pointer of type `void *' used in arithmetic");
2639 size_exp
= integer_one_node
;
2641 else if (TREE_CODE (TREE_TYPE (result_type
)) == FUNCTION_TYPE
)
2643 if (pedantic
|| warn_pointer_arith
)
2644 pedwarn ("pointer to a function used in arithmetic");
2645 size_exp
= integer_one_node
;
2647 else if (TREE_CODE (TREE_TYPE (result_type
)) == METHOD_TYPE
)
2649 if (pedantic
|| warn_pointer_arith
)
2650 pedwarn ("pointer to member function used in arithmetic");
2651 size_exp
= integer_one_node
;
2653 else if (TREE_CODE (TREE_TYPE (result_type
)) == OFFSET_TYPE
)
2655 if (pedantic
|| warn_pointer_arith
)
2656 pedwarn ("pointer to a member used in arithmetic");
2657 size_exp
= integer_one_node
;
2660 size_exp
= size_in_bytes (TREE_TYPE (result_type
));
2662 /* If what we are about to multiply by the size of the elements
2663 contains a constant term, apply distributive law
2664 and multiply that constant term separately.
2665 This helps produce common subexpressions. */
2667 if ((TREE_CODE (intop
) == PLUS_EXPR
|| TREE_CODE (intop
) == MINUS_EXPR
)
2668 && ! TREE_CONSTANT (intop
)
2669 && TREE_CONSTANT (TREE_OPERAND (intop
, 1))
2670 && TREE_CONSTANT (size_exp
)
2671 /* If the constant comes from pointer subtraction,
2672 skip this optimization--it would cause an error. */
2673 && TREE_CODE (TREE_TYPE (TREE_OPERAND (intop
, 0))) == INTEGER_TYPE
2674 /* If the constant is unsigned, and smaller than the pointer size,
2675 then we must skip this optimization. This is because it could cause
2676 an overflow error if the constant is negative but INTOP is not. */
2677 && (! TREE_UNSIGNED (TREE_TYPE (intop
))
2678 || (TYPE_PRECISION (TREE_TYPE (intop
))
2679 == TYPE_PRECISION (TREE_TYPE (ptrop
)))))
2681 enum tree_code subcode
= resultcode
;
2682 tree int_type
= TREE_TYPE (intop
);
2683 if (TREE_CODE (intop
) == MINUS_EXPR
)
2684 subcode
= (subcode
== PLUS_EXPR
? MINUS_EXPR
: PLUS_EXPR
);
2685 /* Convert both subexpression types to the type of intop,
2686 because weird cases involving pointer arithmetic
2687 can result in a sum or difference with different type args. */
2688 ptrop
= build_binary_op (subcode
, ptrop
,
2689 convert (int_type
, TREE_OPERAND (intop
, 1)), 1);
2690 intop
= convert (int_type
, TREE_OPERAND (intop
, 0));
2693 /* Convert the integer argument to a type the same size as sizetype
2694 so the multiply won't overflow spuriously. */
2696 if (TYPE_PRECISION (TREE_TYPE (intop
)) != TYPE_PRECISION (sizetype
)
2697 || TREE_UNSIGNED (TREE_TYPE (intop
)) != TREE_UNSIGNED (sizetype
))
2698 intop
= convert (c_common_type_for_size (TYPE_PRECISION (sizetype
),
2699 TREE_UNSIGNED (sizetype
)), intop
);
2701 /* Replace the integer argument with a suitable product by the object size.
2702 Do this multiplication as signed, then convert to the appropriate
2703 pointer type (actually unsigned integral). */
2705 intop
= convert (result_type
,
2706 build_binary_op (MULT_EXPR
, intop
,
2707 convert (TREE_TYPE (intop
), size_exp
), 1));
2709 /* Create the sum or difference. */
2711 result
= build (resultcode
, result_type
, ptrop
, intop
);
2713 folded
= fold (result
);
2714 if (folded
== result
)
2715 TREE_CONSTANT (folded
) = TREE_CONSTANT (ptrop
) & TREE_CONSTANT (intop
);
2719 /* Prepare expr to be an argument of a TRUTH_NOT_EXPR,
2720 or validate its data type for an `if' or `while' statement or ?..: exp.
2722 This preparation consists of taking the ordinary
2723 representation of an expression expr and producing a valid tree
2724 boolean expression describing whether expr is nonzero. We could
2725 simply always do build_binary_op (NE_EXPR, expr, boolean_false_node, 1),
2726 but we optimize comparisons, &&, ||, and !.
2728 The resulting type should always be `boolean_type_node'. */
2731 c_common_truthvalue_conversion (expr
)
2734 if (TREE_CODE (expr
) == ERROR_MARK
)
2737 #if 0 /* This appears to be wrong for C++. */
2738 /* These really should return error_mark_node after 2.4 is stable.
2739 But not all callers handle ERROR_MARK properly. */
2740 switch (TREE_CODE (TREE_TYPE (expr
)))
2743 error ("struct type value used where scalar is required");
2744 return boolean_false_node
;
2747 error ("union type value used where scalar is required");
2748 return boolean_false_node
;
2751 error ("array type value used where scalar is required");
2752 return boolean_false_node
;
2759 switch (TREE_CODE (expr
))
2762 case NE_EXPR
: case LE_EXPR
: case GE_EXPR
: case LT_EXPR
: case GT_EXPR
:
2763 case TRUTH_ANDIF_EXPR
:
2764 case TRUTH_ORIF_EXPR
:
2765 case TRUTH_AND_EXPR
:
2767 case TRUTH_XOR_EXPR
:
2768 case TRUTH_NOT_EXPR
:
2769 TREE_TYPE (expr
) = boolean_type_node
;
2776 return integer_zerop (expr
) ? boolean_false_node
: boolean_true_node
;
2779 return real_zerop (expr
) ? boolean_false_node
: boolean_true_node
;
2782 /* If we are taking the address of an external decl, it might be zero
2783 if it is weak, so we cannot optimize. */
2784 if (DECL_P (TREE_OPERAND (expr
, 0))
2785 && DECL_EXTERNAL (TREE_OPERAND (expr
, 0)))
2788 if (TREE_SIDE_EFFECTS (TREE_OPERAND (expr
, 0)))
2789 return build (COMPOUND_EXPR
, boolean_type_node
,
2790 TREE_OPERAND (expr
, 0), boolean_true_node
);
2792 return boolean_true_node
;
2795 return build_binary_op ((TREE_SIDE_EFFECTS (TREE_OPERAND (expr
, 1))
2796 ? TRUTH_OR_EXPR
: TRUTH_ORIF_EXPR
),
2797 c_common_truthvalue_conversion (TREE_OPERAND (expr
, 0)),
2798 c_common_truthvalue_conversion (TREE_OPERAND (expr
, 1)),
2805 /* These don't change whether an object is nonzero or zero. */
2806 return c_common_truthvalue_conversion (TREE_OPERAND (expr
, 0));
2810 /* These don't change whether an object is zero or nonzero, but
2811 we can't ignore them if their second arg has side-effects. */
2812 if (TREE_SIDE_EFFECTS (TREE_OPERAND (expr
, 1)))
2813 return build (COMPOUND_EXPR
, boolean_type_node
, TREE_OPERAND (expr
, 1),
2814 c_common_truthvalue_conversion (TREE_OPERAND (expr
, 0)));
2816 return c_common_truthvalue_conversion (TREE_OPERAND (expr
, 0));
2819 /* Distribute the conversion into the arms of a COND_EXPR. */
2820 return fold (build (COND_EXPR
, boolean_type_node
, TREE_OPERAND (expr
, 0),
2821 c_common_truthvalue_conversion (TREE_OPERAND (expr
, 1)),
2822 c_common_truthvalue_conversion (TREE_OPERAND (expr
, 2))));
2825 /* Don't cancel the effect of a CONVERT_EXPR from a REFERENCE_TYPE,
2826 since that affects how `default_conversion' will behave. */
2827 if (TREE_CODE (TREE_TYPE (expr
)) == REFERENCE_TYPE
2828 || TREE_CODE (TREE_TYPE (TREE_OPERAND (expr
, 0))) == REFERENCE_TYPE
)
2830 /* fall through... */
2832 /* If this is widening the argument, we can ignore it. */
2833 if (TYPE_PRECISION (TREE_TYPE (expr
))
2834 >= TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (expr
, 0))))
2835 return c_common_truthvalue_conversion (TREE_OPERAND (expr
, 0));
2839 /* Perhaps reduce (x - y) != 0 to (x != y). The expressions
2840 aren't guaranteed to the be same for modes that can represent
2841 infinity, since if x and y are both +infinity, or both
2842 -infinity, then x - y is not a number.
2844 Note that this transformation is safe when x or y is NaN.
2845 (x - y) is then NaN, and both (x - y) != 0 and x != y will
2847 if (HONOR_INFINITIES (TYPE_MODE (TREE_TYPE (TREE_OPERAND (expr
, 0)))))
2849 /* fall through... */
2851 /* This and MINUS_EXPR can be changed into a comparison of the
2853 if (TREE_TYPE (TREE_OPERAND (expr
, 0))
2854 == TREE_TYPE (TREE_OPERAND (expr
, 1)))
2855 return build_binary_op (NE_EXPR
, TREE_OPERAND (expr
, 0),
2856 TREE_OPERAND (expr
, 1), 1);
2857 return build_binary_op (NE_EXPR
, TREE_OPERAND (expr
, 0),
2858 fold (build1 (NOP_EXPR
,
2859 TREE_TYPE (TREE_OPERAND (expr
, 0)),
2860 TREE_OPERAND (expr
, 1))), 1);
2863 if (integer_onep (TREE_OPERAND (expr
, 1))
2864 && TREE_TYPE (expr
) != boolean_type_node
)
2865 /* Using convert here would cause infinite recursion. */
2866 return build1 (NOP_EXPR
, boolean_type_node
, expr
);
2870 if (warn_parentheses
&& C_EXP_ORIGINAL_CODE (expr
) == MODIFY_EXPR
)
2871 warning ("suggest parentheses around assignment used as truth value");
2878 if (TREE_CODE (TREE_TYPE (expr
)) == COMPLEX_TYPE
)
2880 tree t
= save_expr (expr
);
2881 return (build_binary_op
2882 ((TREE_SIDE_EFFECTS (expr
)
2883 ? TRUTH_OR_EXPR
: TRUTH_ORIF_EXPR
),
2884 c_common_truthvalue_conversion (build_unary_op (REALPART_EXPR
, t
, 0)),
2885 c_common_truthvalue_conversion (build_unary_op (IMAGPART_EXPR
, t
, 0)),
2889 return build_binary_op (NE_EXPR
, expr
, integer_zero_node
, 1);
2892 static tree builtin_function_2
PARAMS ((const char *, const char *, tree
, tree
,
2893 int, enum built_in_class
, int, int,
2896 /* Make a variant type in the proper way for C/C++, propagating qualifiers
2897 down to the element type of an array. */
2900 c_build_qualified_type (type
, type_quals
)
2904 /* A restrict-qualified pointer type must be a pointer to object or
2905 incomplete type. Note that the use of POINTER_TYPE_P also allows
2906 REFERENCE_TYPEs, which is appropriate for C++. Unfortunately,
2907 the C++ front-end also use POINTER_TYPE for pointer-to-member
2908 values, so even though it should be illegal to use `restrict'
2909 with such an entity we don't flag that here. Thus, special case
2910 code for that case is required in the C++ front-end. */
2911 if ((type_quals
& TYPE_QUAL_RESTRICT
)
2912 && (!POINTER_TYPE_P (type
)
2913 || !C_TYPE_OBJECT_OR_INCOMPLETE_P (TREE_TYPE (type
))))
2915 error ("invalid use of `restrict'");
2916 type_quals
&= ~TYPE_QUAL_RESTRICT
;
2919 if (TREE_CODE (type
) == ARRAY_TYPE
)
2920 return build_array_type (c_build_qualified_type (TREE_TYPE (type
),
2922 TYPE_DOMAIN (type
));
2923 return build_qualified_type (type
, type_quals
);
2926 /* Apply the TYPE_QUALS to the new DECL. */
2929 c_apply_type_quals_to_decl (type_quals
, decl
)
2933 if ((type_quals
& TYPE_QUAL_CONST
)
2934 || (TREE_TYPE (decl
)
2935 && TREE_CODE (TREE_TYPE (decl
)) == REFERENCE_TYPE
))
2936 TREE_READONLY (decl
) = 1;
2937 if (type_quals
& TYPE_QUAL_VOLATILE
)
2939 TREE_SIDE_EFFECTS (decl
) = 1;
2940 TREE_THIS_VOLATILE (decl
) = 1;
2942 if (type_quals
& TYPE_QUAL_RESTRICT
)
2944 if (!TREE_TYPE (decl
)
2945 || !POINTER_TYPE_P (TREE_TYPE (decl
))
2946 || !C_TYPE_OBJECT_OR_INCOMPLETE_P (TREE_TYPE (TREE_TYPE (decl
))))
2947 error ("invalid use of `restrict'");
2948 else if (flag_strict_aliasing
)
2949 /* Indicate we need to make a unique alias set for this pointer.
2950 We can't do it here because it might be pointing to an
2952 DECL_POINTER_ALIAS_SET (decl
) = -2;
2956 /* Return the typed-based alias set for T, which may be an expression
2957 or a type. Return -1 if we don't do anything special. */
2960 c_common_get_alias_set (t
)
2965 /* Permit type-punning when accessing a union, provided the access
2966 is directly through the union. For example, this code does not
2967 permit taking the address of a union member and then storing
2968 through it. Even the type-punning allowed here is a GCC
2969 extension, albeit a common and useful one; the C standard says
2970 that such accesses have implementation-defined behavior. */
2972 TREE_CODE (u
) == COMPONENT_REF
|| TREE_CODE (u
) == ARRAY_REF
;
2973 u
= TREE_OPERAND (u
, 0))
2974 if (TREE_CODE (u
) == COMPONENT_REF
2975 && TREE_CODE (TREE_TYPE (TREE_OPERAND (u
, 0))) == UNION_TYPE
)
2978 /* That's all the expressions we handle specially. */
2982 /* The C standard guarantess that any object may be accessed via an
2983 lvalue that has character type. */
2984 if (t
== char_type_node
2985 || t
== signed_char_type_node
2986 || t
== unsigned_char_type_node
)
2989 /* If it has the may_alias attribute, it can alias anything. */
2990 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (t
)))
2993 /* The C standard specifically allows aliasing between signed and
2994 unsigned variants of the same type. We treat the signed
2995 variant as canonical. */
2996 if (TREE_CODE (t
) == INTEGER_TYPE
&& TREE_UNSIGNED (t
))
2998 tree t1
= c_common_signed_type (t
);
3000 /* t1 == t can happen for boolean nodes which are always unsigned. */
3002 return get_alias_set (t1
);
3004 else if (POINTER_TYPE_P (t
))
3008 /* Unfortunately, there is no canonical form of a pointer type.
3009 In particular, if we have `typedef int I', then `int *', and
3010 `I *' are different types. So, we have to pick a canonical
3011 representative. We do this below.
3013 Technically, this approach is actually more conservative that
3014 it needs to be. In particular, `const int *' and `int *'
3015 should be in different alias sets, according to the C and C++
3016 standard, since their types are not the same, and so,
3017 technically, an `int **' and `const int **' cannot point at
3020 But, the standard is wrong. In particular, this code is
3025 const int* const* cipp = &ipp;
3027 And, it doesn't make sense for that to be legal unless you
3028 can dereference IPP and CIPP. So, we ignore cv-qualifiers on
3029 the pointed-to types. This issue has been reported to the
3031 t1
= build_type_no_quals (t
);
3033 return get_alias_set (t1
);
3039 /* Compute the value of 'sizeof (TYPE)' or '__alignof__ (TYPE)', where the
3040 second parameter indicates which OPERATOR is being applied. The COMPLAIN
3041 flag controls whether we should diagnose possibly ill-formed
3042 constructs or not. */
3044 c_sizeof_or_alignof_type (type
, op
, complain
)
3049 const char *op_name
;
3051 enum tree_code type_code
= TREE_CODE (type
);
3053 my_friendly_assert (op
== SIZEOF_EXPR
|| op
== ALIGNOF_EXPR
, 20020720);
3054 op_name
= op
== SIZEOF_EXPR
? "sizeof" : "__alignof__";
3056 if (type_code
== FUNCTION_TYPE
)
3058 if (op
== SIZEOF_EXPR
)
3060 if (complain
&& (pedantic
|| warn_pointer_arith
))
3061 pedwarn ("invalid application of `sizeof' to a function type");
3062 value
= size_one_node
;
3065 value
= size_int (FUNCTION_BOUNDARY
/ BITS_PER_UNIT
);
3067 else if (type_code
== VOID_TYPE
|| type_code
== ERROR_MARK
)
3069 if (type_code
== VOID_TYPE
3070 && complain
&& (pedantic
|| warn_pointer_arith
))
3071 pedwarn ("invalid application of `%s' to a void type", op_name
);
3072 value
= size_one_node
;
3074 else if (!COMPLETE_TYPE_P (type
))
3077 error ("invalid application of `%s' to an incomplete type", op_name
);
3078 value
= size_zero_node
;
3082 if (op
== SIZEOF_EXPR
)
3083 /* Convert in case a char is more than one unit. */
3084 value
= size_binop (CEIL_DIV_EXPR
, TYPE_SIZE_UNIT (type
),
3085 size_int (TYPE_PRECISION (char_type_node
)
3088 value
= size_int (TYPE_ALIGN (type
) / BITS_PER_UNIT
);
3091 /* VALUE will have an integer type with TYPE_IS_SIZETYPE set.
3092 TYPE_IS_SIZETYPE means that certain things (like overflow) will
3093 never happen. However, this node should really have type
3094 `size_t', which is just a typedef for an ordinary integer type. */
3095 value
= fold (build1 (NOP_EXPR
, size_type_node
, value
));
3096 my_friendly_assert (!TYPE_IS_SIZETYPE (TREE_TYPE (value
)), 20001021);
3101 /* Implement the __alignof keyword: Return the minimum required
3102 alignment of EXPR, measured in bytes. For VAR_DECL's and
3103 FIELD_DECL's return DECL_ALIGN (which can be set from an
3104 "aligned" __attribute__ specification). */
3107 c_alignof_expr (expr
)
3112 if (TREE_CODE (expr
) == VAR_DECL
)
3113 t
= size_int (DECL_ALIGN (expr
) / BITS_PER_UNIT
);
3115 else if (TREE_CODE (expr
) == COMPONENT_REF
3116 && DECL_C_BIT_FIELD (TREE_OPERAND (expr
, 1)))
3118 error ("`__alignof' applied to a bit-field");
3121 else if (TREE_CODE (expr
) == COMPONENT_REF
3122 && TREE_CODE (TREE_OPERAND (expr
, 1)) == FIELD_DECL
)
3123 t
= size_int (DECL_ALIGN (TREE_OPERAND (expr
, 1)) / BITS_PER_UNIT
);
3125 else if (TREE_CODE (expr
) == INDIRECT_REF
)
3127 tree t
= TREE_OPERAND (expr
, 0);
3129 int bestalign
= TYPE_ALIGN (TREE_TYPE (TREE_TYPE (t
)));
3131 while (TREE_CODE (t
) == NOP_EXPR
3132 && TREE_CODE (TREE_TYPE (TREE_OPERAND (t
, 0))) == POINTER_TYPE
)
3136 t
= TREE_OPERAND (t
, 0);
3137 thisalign
= TYPE_ALIGN (TREE_TYPE (TREE_TYPE (t
)));
3138 if (thisalign
> bestalign
)
3139 best
= t
, bestalign
= thisalign
;
3141 return c_alignof (TREE_TYPE (TREE_TYPE (best
)));
3144 return c_alignof (TREE_TYPE (expr
));
3146 return fold (build1 (NOP_EXPR
, size_type_node
, t
));
3149 /* Handle C and C++ default attributes. */
3151 enum built_in_attribute
3153 #define DEF_ATTR_NULL_TREE(ENUM) ENUM,
3154 #define DEF_ATTR_INT(ENUM, VALUE) ENUM,
3155 #define DEF_ATTR_IDENT(ENUM, STRING) ENUM,
3156 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) ENUM,
3157 #define DEF_FN_ATTR(NAME, ATTRS, PREDICATE) /* No entry needed in enum. */
3158 #include "builtin-attrs.def"
3159 #undef DEF_ATTR_NULL_TREE
3161 #undef DEF_ATTR_IDENT
3162 #undef DEF_ATTR_TREE_LIST
3167 static GTY(()) tree built_in_attributes
[(int) ATTR_LAST
];
3169 static bool c_attrs_initialized
= false;
3171 static void c_init_attributes
PARAMS ((void));
3173 /* Build tree nodes and builtin functions common to both C and C++ language
3177 c_common_nodes_and_builtins ()
3181 #define DEF_PRIMITIVE_TYPE(NAME, VALUE) NAME,
3182 #define DEF_FUNCTION_TYPE_0(NAME, RETURN) NAME,
3183 #define DEF_FUNCTION_TYPE_1(NAME, RETURN, ARG1) NAME,
3184 #define DEF_FUNCTION_TYPE_2(NAME, RETURN, ARG1, ARG2) NAME,
3185 #define DEF_FUNCTION_TYPE_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
3186 #define DEF_FUNCTION_TYPE_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME,
3187 #define DEF_FUNCTION_TYPE_VAR_0(NAME, RETURN) NAME,
3188 #define DEF_FUNCTION_TYPE_VAR_1(NAME, RETURN, ARG1) NAME,
3189 #define DEF_FUNCTION_TYPE_VAR_2(NAME, RETURN, ARG1, ARG2) NAME,
3190 #define DEF_POINTER_TYPE(NAME, TYPE) NAME,
3191 #include "builtin-types.def"
3192 #undef DEF_PRIMITIVE_TYPE
3193 #undef DEF_FUNCTION_TYPE_0
3194 #undef DEF_FUNCTION_TYPE_1
3195 #undef DEF_FUNCTION_TYPE_2
3196 #undef DEF_FUNCTION_TYPE_3
3197 #undef DEF_FUNCTION_TYPE_4
3198 #undef DEF_FUNCTION_TYPE_VAR_0
3199 #undef DEF_FUNCTION_TYPE_VAR_1
3200 #undef DEF_FUNCTION_TYPE_VAR_2
3201 #undef DEF_POINTER_TYPE
3205 typedef enum builtin_type builtin_type
;
3207 tree builtin_types
[(int) BT_LAST
];
3208 int wchar_type_size
;
3209 tree array_domain_type
;
3210 tree va_list_ref_type_node
;
3211 tree va_list_arg_type_node
;
3213 /* Define `int' and `char' first so that dbx will output them first. */
3214 record_builtin_type (RID_INT
, NULL
, integer_type_node
);
3215 record_builtin_type (RID_CHAR
, "char", char_type_node
);
3217 /* `signed' is the same as `int'. FIXME: the declarations of "signed",
3218 "unsigned long", "long long unsigned" and "unsigned short" were in C++
3219 but not C. Are the conditionals here needed? */
3220 if (c_language
== clk_cplusplus
)
3221 record_builtin_type (RID_SIGNED
, NULL
, integer_type_node
);
3222 record_builtin_type (RID_LONG
, "long int", long_integer_type_node
);
3223 record_builtin_type (RID_UNSIGNED
, "unsigned int", unsigned_type_node
);
3224 record_builtin_type (RID_MAX
, "long unsigned int",
3225 long_unsigned_type_node
);
3226 if (c_language
== clk_cplusplus
)
3227 record_builtin_type (RID_MAX
, "unsigned long", long_unsigned_type_node
);
3228 record_builtin_type (RID_MAX
, "long long int",
3229 long_long_integer_type_node
);
3230 record_builtin_type (RID_MAX
, "long long unsigned int",
3231 long_long_unsigned_type_node
);
3232 if (c_language
== clk_cplusplus
)
3233 record_builtin_type (RID_MAX
, "long long unsigned",
3234 long_long_unsigned_type_node
);
3235 record_builtin_type (RID_SHORT
, "short int", short_integer_type_node
);
3236 record_builtin_type (RID_MAX
, "short unsigned int",
3237 short_unsigned_type_node
);
3238 if (c_language
== clk_cplusplus
)
3239 record_builtin_type (RID_MAX
, "unsigned short",
3240 short_unsigned_type_node
);
3242 /* Define both `signed char' and `unsigned char'. */
3243 record_builtin_type (RID_MAX
, "signed char", signed_char_type_node
);
3244 record_builtin_type (RID_MAX
, "unsigned char", unsigned_char_type_node
);
3246 /* These are types that c_common_type_for_size and
3247 c_common_type_for_mode use. */
3248 (*lang_hooks
.decls
.pushdecl
) (build_decl (TYPE_DECL
, NULL_TREE
,
3250 (*lang_hooks
.decls
.pushdecl
) (build_decl (TYPE_DECL
, NULL_TREE
,
3252 (*lang_hooks
.decls
.pushdecl
) (build_decl (TYPE_DECL
, NULL_TREE
,
3254 (*lang_hooks
.decls
.pushdecl
) (build_decl (TYPE_DECL
, NULL_TREE
,
3256 #if HOST_BITS_PER_WIDE_INT >= 64
3257 (*lang_hooks
.decls
.pushdecl
) (build_decl (TYPE_DECL
,
3258 get_identifier ("__int128_t"),
3261 (*lang_hooks
.decls
.pushdecl
) (build_decl (TYPE_DECL
, NULL_TREE
,
3262 unsigned_intQI_type_node
));
3263 (*lang_hooks
.decls
.pushdecl
) (build_decl (TYPE_DECL
, NULL_TREE
,
3264 unsigned_intHI_type_node
));
3265 (*lang_hooks
.decls
.pushdecl
) (build_decl (TYPE_DECL
, NULL_TREE
,
3266 unsigned_intSI_type_node
));
3267 (*lang_hooks
.decls
.pushdecl
) (build_decl (TYPE_DECL
, NULL_TREE
,
3268 unsigned_intDI_type_node
));
3269 #if HOST_BITS_PER_WIDE_INT >= 64
3270 (*lang_hooks
.decls
.pushdecl
) (build_decl (TYPE_DECL
,
3271 get_identifier ("__uint128_t"),
3272 unsigned_intTI_type_node
));
3275 /* Create the widest literal types. */
3276 widest_integer_literal_type_node
3277 = make_signed_type (HOST_BITS_PER_WIDE_INT
* 2);
3278 (*lang_hooks
.decls
.pushdecl
) (build_decl (TYPE_DECL
, NULL_TREE
,
3279 widest_integer_literal_type_node
));
3281 widest_unsigned_literal_type_node
3282 = make_unsigned_type (HOST_BITS_PER_WIDE_INT
* 2);
3283 (*lang_hooks
.decls
.pushdecl
) (build_decl (TYPE_DECL
, NULL_TREE
,
3284 widest_unsigned_literal_type_node
));
3286 /* `unsigned long' is the standard type for sizeof.
3287 Note that stddef.h uses `unsigned long',
3288 and this must agree, even if long and int are the same size. */
3290 TREE_TYPE (identifier_global_value (get_identifier (SIZE_TYPE
)));
3291 signed_size_type_node
= c_common_signed_type (size_type_node
);
3292 set_sizetype (size_type_node
);
3294 build_common_tree_nodes_2 (flag_short_double
);
3296 record_builtin_type (RID_FLOAT
, NULL
, float_type_node
);
3297 record_builtin_type (RID_DOUBLE
, NULL
, double_type_node
);
3298 record_builtin_type (RID_MAX
, "long double", long_double_type_node
);
3300 (*lang_hooks
.decls
.pushdecl
) (build_decl (TYPE_DECL
,
3301 get_identifier ("complex int"),
3302 complex_integer_type_node
));
3303 (*lang_hooks
.decls
.pushdecl
) (build_decl (TYPE_DECL
,
3304 get_identifier ("complex float"),
3305 complex_float_type_node
));
3306 (*lang_hooks
.decls
.pushdecl
) (build_decl (TYPE_DECL
,
3307 get_identifier ("complex double"),
3308 complex_double_type_node
));
3309 (*lang_hooks
.decls
.pushdecl
)
3310 (build_decl (TYPE_DECL
, get_identifier ("complex long double"),
3311 complex_long_double_type_node
));
3313 /* Types which are common to the fortran compiler and libf2c. When
3314 changing these, you also need to be concerned with f/com.h. */
3316 if (TYPE_PRECISION (float_type_node
)
3317 == TYPE_PRECISION (long_integer_type_node
))
3319 g77_integer_type_node
= long_integer_type_node
;
3320 g77_uinteger_type_node
= long_unsigned_type_node
;
3322 else if (TYPE_PRECISION (float_type_node
)
3323 == TYPE_PRECISION (integer_type_node
))
3325 g77_integer_type_node
= integer_type_node
;
3326 g77_uinteger_type_node
= unsigned_type_node
;
3329 g77_integer_type_node
= g77_uinteger_type_node
= NULL_TREE
;
3331 if (g77_integer_type_node
!= NULL_TREE
)
3333 (*lang_hooks
.decls
.pushdecl
) (build_decl (TYPE_DECL
,
3334 get_identifier ("__g77_integer"),
3335 g77_integer_type_node
));
3336 (*lang_hooks
.decls
.pushdecl
) (build_decl (TYPE_DECL
,
3337 get_identifier ("__g77_uinteger"),
3338 g77_uinteger_type_node
));
3341 if (TYPE_PRECISION (float_type_node
) * 2
3342 == TYPE_PRECISION (long_integer_type_node
))
3344 g77_longint_type_node
= long_integer_type_node
;
3345 g77_ulongint_type_node
= long_unsigned_type_node
;
3347 else if (TYPE_PRECISION (float_type_node
) * 2
3348 == TYPE_PRECISION (long_long_integer_type_node
))
3350 g77_longint_type_node
= long_long_integer_type_node
;
3351 g77_ulongint_type_node
= long_long_unsigned_type_node
;
3354 g77_longint_type_node
= g77_ulongint_type_node
= NULL_TREE
;
3356 if (g77_longint_type_node
!= NULL_TREE
)
3358 (*lang_hooks
.decls
.pushdecl
) (build_decl (TYPE_DECL
,
3359 get_identifier ("__g77_longint"),
3360 g77_longint_type_node
));
3361 (*lang_hooks
.decls
.pushdecl
) (build_decl (TYPE_DECL
,
3362 get_identifier ("__g77_ulongint"),
3363 g77_ulongint_type_node
));
3366 record_builtin_type (RID_VOID
, NULL
, void_type_node
);
3368 void_zero_node
= build_int_2 (0, 0);
3369 TREE_TYPE (void_zero_node
) = void_type_node
;
3371 void_list_node
= build_void_list_node ();
3373 /* Make a type to be the domain of a few array types
3374 whose domains don't really matter.
3375 200 is small enough that it always fits in size_t
3376 and large enough that it can hold most function names for the
3377 initializations of __FUNCTION__ and __PRETTY_FUNCTION__. */
3378 array_domain_type
= build_index_type (size_int (200));
3380 /* Make a type for arrays of characters.
3381 With luck nothing will ever really depend on the length of this
3383 char_array_type_node
3384 = build_array_type (char_type_node
, array_domain_type
);
3386 /* Likewise for arrays of ints. */
3388 = build_array_type (integer_type_node
, array_domain_type
);
3390 string_type_node
= build_pointer_type (char_type_node
);
3391 const_string_type_node
3392 = build_pointer_type (build_qualified_type
3393 (char_type_node
, TYPE_QUAL_CONST
));
3395 (*targetm
.init_builtins
) ();
3397 /* This is special for C++ so functions can be overloaded. */
3398 wchar_type_node
= get_identifier (MODIFIED_WCHAR_TYPE
);
3399 wchar_type_node
= TREE_TYPE (identifier_global_value (wchar_type_node
));
3400 wchar_type_size
= TYPE_PRECISION (wchar_type_node
);
3401 if (c_language
== clk_cplusplus
)
3403 if (TREE_UNSIGNED (wchar_type_node
))
3404 wchar_type_node
= make_unsigned_type (wchar_type_size
);
3406 wchar_type_node
= make_signed_type (wchar_type_size
);
3407 record_builtin_type (RID_WCHAR
, "wchar_t", wchar_type_node
);
3411 signed_wchar_type_node
= c_common_signed_type (wchar_type_node
);
3412 unsigned_wchar_type_node
= c_common_unsigned_type (wchar_type_node
);
3415 /* This is for wide string constants. */
3416 wchar_array_type_node
3417 = build_array_type (wchar_type_node
, array_domain_type
);
3420 TREE_TYPE (identifier_global_value (get_identifier (WINT_TYPE
)));
3423 TREE_TYPE (identifier_global_value (get_identifier (INTMAX_TYPE
)));
3425 TREE_TYPE (identifier_global_value (get_identifier (UINTMAX_TYPE
)));
3427 default_function_type
= build_function_type (integer_type_node
, NULL_TREE
);
3429 = TREE_TYPE (identifier_global_value (get_identifier (PTRDIFF_TYPE
)));
3430 unsigned_ptrdiff_type_node
= c_common_unsigned_type (ptrdiff_type_node
);
3432 (*lang_hooks
.decls
.pushdecl
)
3433 (build_decl (TYPE_DECL
, get_identifier ("__builtin_va_list"),
3434 va_list_type_node
));
3436 (*lang_hooks
.decls
.pushdecl
)
3437 (build_decl (TYPE_DECL
, get_identifier ("__builtin_ptrdiff_t"),
3438 ptrdiff_type_node
));
3440 (*lang_hooks
.decls
.pushdecl
)
3441 (build_decl (TYPE_DECL
, get_identifier ("__builtin_size_t"),
3444 if (TREE_CODE (va_list_type_node
) == ARRAY_TYPE
)
3446 va_list_arg_type_node
= va_list_ref_type_node
=
3447 build_pointer_type (TREE_TYPE (va_list_type_node
));
3451 va_list_arg_type_node
= va_list_type_node
;
3452 va_list_ref_type_node
= build_reference_type (va_list_type_node
);
3455 #define DEF_PRIMITIVE_TYPE(ENUM, VALUE) \
3456 builtin_types[(int) ENUM] = VALUE;
3457 #define DEF_FUNCTION_TYPE_0(ENUM, RETURN) \
3458 builtin_types[(int) ENUM] \
3459 = build_function_type (builtin_types[(int) RETURN], \
3461 #define DEF_FUNCTION_TYPE_1(ENUM, RETURN, ARG1) \
3462 builtin_types[(int) ENUM] \
3463 = build_function_type (builtin_types[(int) RETURN], \
3464 tree_cons (NULL_TREE, \
3465 builtin_types[(int) ARG1], \
3467 #define DEF_FUNCTION_TYPE_2(ENUM, RETURN, ARG1, ARG2) \
3468 builtin_types[(int) ENUM] \
3469 = build_function_type \
3470 (builtin_types[(int) RETURN], \
3471 tree_cons (NULL_TREE, \
3472 builtin_types[(int) ARG1], \
3473 tree_cons (NULL_TREE, \
3474 builtin_types[(int) ARG2], \
3476 #define DEF_FUNCTION_TYPE_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
3477 builtin_types[(int) ENUM] \
3478 = build_function_type \
3479 (builtin_types[(int) RETURN], \
3480 tree_cons (NULL_TREE, \
3481 builtin_types[(int) ARG1], \
3482 tree_cons (NULL_TREE, \
3483 builtin_types[(int) ARG2], \
3484 tree_cons (NULL_TREE, \
3485 builtin_types[(int) ARG3], \
3487 #define DEF_FUNCTION_TYPE_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \
3488 builtin_types[(int) ENUM] \
3489 = build_function_type \
3490 (builtin_types[(int) RETURN], \
3491 tree_cons (NULL_TREE, \
3492 builtin_types[(int) ARG1], \
3493 tree_cons (NULL_TREE, \
3494 builtin_types[(int) ARG2], \
3497 builtin_types[(int) ARG3], \
3498 tree_cons (NULL_TREE, \
3499 builtin_types[(int) ARG4], \
3500 void_list_node)))));
3501 #define DEF_FUNCTION_TYPE_VAR_0(ENUM, RETURN) \
3502 builtin_types[(int) ENUM] \
3503 = build_function_type (builtin_types[(int) RETURN], NULL_TREE);
3504 #define DEF_FUNCTION_TYPE_VAR_1(ENUM, RETURN, ARG1) \
3505 builtin_types[(int) ENUM] \
3506 = build_function_type (builtin_types[(int) RETURN], \
3507 tree_cons (NULL_TREE, \
3508 builtin_types[(int) ARG1], \
3511 #define DEF_FUNCTION_TYPE_VAR_2(ENUM, RETURN, ARG1, ARG2) \
3512 builtin_types[(int) ENUM] \
3513 = build_function_type \
3514 (builtin_types[(int) RETURN], \
3515 tree_cons (NULL_TREE, \
3516 builtin_types[(int) ARG1], \
3517 tree_cons (NULL_TREE, \
3518 builtin_types[(int) ARG2], \
3520 #define DEF_POINTER_TYPE(ENUM, TYPE) \
3521 builtin_types[(int) ENUM] \
3522 = build_pointer_type (builtin_types[(int) TYPE]);
3523 #include "builtin-types.def"
3524 #undef DEF_PRIMITIVE_TYPE
3525 #undef DEF_FUNCTION_TYPE_1
3526 #undef DEF_FUNCTION_TYPE_2
3527 #undef DEF_FUNCTION_TYPE_3
3528 #undef DEF_FUNCTION_TYPE_4
3529 #undef DEF_FUNCTION_TYPE_VAR_0
3530 #undef DEF_FUNCTION_TYPE_VAR_1
3531 #undef DEF_POINTER_TYPE
3533 if (!c_attrs_initialized
)
3534 c_init_attributes ();
3536 #define DEF_BUILTIN(ENUM, NAME, CLASS, TYPE, LIBTYPE, \
3537 BOTH_P, FALLBACK_P, NONANSI_P, ATTRS) \
3542 if (strncmp (NAME, "__builtin_", strlen ("__builtin_")) != 0) \
3546 decl = builtin_function (NAME, builtin_types[TYPE], ENUM, \
3549 ? (NAME + strlen ("__builtin_")) \
3551 built_in_attributes[(int) ATTRS]); \
3553 decl = builtin_function_2 (NAME, \
3554 NAME + strlen ("__builtin_"), \
3555 builtin_types[TYPE], \
3556 builtin_types[LIBTYPE], \
3561 built_in_attributes[(int) ATTRS]); \
3563 built_in_decls[(int) ENUM] = decl; \
3565 #include "builtins.def"
3568 main_identifier_node
= get_identifier ("main");
3572 build_va_arg (expr
, type
)
3575 return build1 (VA_ARG_EXPR
, type
, expr
);
3579 /* Linked list of disabled built-in functions. */
3581 typedef struct disabled_builtin
3584 struct disabled_builtin
*next
;
3586 static disabled_builtin
*disabled_builtins
= NULL
;
3588 static bool builtin_function_disabled_p
PARAMS ((const char *));
3590 /* Disable a built-in function specified by -fno-builtin-NAME. If NAME
3591 begins with "__builtin_", give an error. */
3594 disable_builtin_function (name
)
3597 if (strncmp (name
, "__builtin_", strlen ("__builtin_")) == 0)
3598 error ("cannot disable built-in function `%s'", name
);
3601 disabled_builtin
*new = xmalloc (sizeof (disabled_builtin
));
3603 new->next
= disabled_builtins
;
3604 disabled_builtins
= new;
3609 /* Return true if the built-in function NAME has been disabled, false
3613 builtin_function_disabled_p (name
)
3616 disabled_builtin
*p
;
3617 for (p
= disabled_builtins
; p
!= NULL
; p
= p
->next
)
3619 if (strcmp (name
, p
->name
) == 0)
3626 /* Possibly define a builtin function with one or two names. BUILTIN_NAME
3627 is an __builtin_-prefixed name; NAME is the ordinary name; one or both
3628 of these may be NULL (though both being NULL is useless).
3629 BUILTIN_TYPE is the type of the __builtin_-prefixed function;
3630 TYPE is the type of the function with the ordinary name. These
3631 may differ if the ordinary name is declared with a looser type to avoid
3632 conflicts with headers. FUNCTION_CODE and CLASS are as for
3633 builtin_function. If LIBRARY_NAME_P is nonzero, NAME is passed as
3634 the LIBRARY_NAME parameter to builtin_function when declaring BUILTIN_NAME.
3635 If NONANSI_P is nonzero, the name NAME is treated as a non-ANSI name;
3636 ATTRS is the tree list representing the builtin's function attributes.
3637 Returns the declaration of BUILTIN_NAME, if any, otherwise
3638 the declaration of NAME. Does not declare NAME if flag_no_builtin,
3639 or if NONANSI_P and flag_no_nonansi_builtin. */
3642 builtin_function_2 (builtin_name
, name
, builtin_type
, type
, function_code
,
3643 class, library_name_p
, nonansi_p
, attrs
)
3644 const char *builtin_name
;
3649 enum built_in_class
class;
3654 tree bdecl
= NULL_TREE
;
3655 tree decl
= NULL_TREE
;
3656 if (builtin_name
!= 0)
3658 bdecl
= builtin_function (builtin_name
, builtin_type
, function_code
,
3659 class, library_name_p
? name
: NULL
,
3662 if (name
!= 0 && !flag_no_builtin
&& !builtin_function_disabled_p (name
)
3663 && !(nonansi_p
&& flag_no_nonansi_builtin
))
3665 decl
= builtin_function (name
, type
, function_code
, class, NULL
,
3668 DECL_BUILT_IN_NONANSI (decl
) = 1;
3670 return (bdecl
!= 0 ? bdecl
: decl
);
3673 /* Nonzero if the type T promotes to int. This is (nearly) the
3674 integral promotions defined in ISO C99 6.3.1.1/2. */
3677 c_promoting_integer_type_p (t
)
3680 switch (TREE_CODE (t
))
3683 return (TYPE_MAIN_VARIANT (t
) == char_type_node
3684 || TYPE_MAIN_VARIANT (t
) == signed_char_type_node
3685 || TYPE_MAIN_VARIANT (t
) == unsigned_char_type_node
3686 || TYPE_MAIN_VARIANT (t
) == short_integer_type_node
3687 || TYPE_MAIN_VARIANT (t
) == short_unsigned_type_node
3688 || TYPE_PRECISION (t
) < TYPE_PRECISION (integer_type_node
));
3691 /* ??? Technically all enumerations not larger than an int
3692 promote to an int. But this is used along code paths
3693 that only want to notice a size change. */
3694 return TYPE_PRECISION (t
) < TYPE_PRECISION (integer_type_node
);
3704 /* Return 1 if PARMS specifies a fixed number of parameters
3705 and none of their types is affected by default promotions. */
3708 self_promoting_args_p (parms
)
3712 for (t
= parms
; t
; t
= TREE_CHAIN (t
))
3714 tree type
= TREE_VALUE (t
);
3716 if (TREE_CHAIN (t
) == 0 && type
!= void_type_node
)
3722 if (TYPE_MAIN_VARIANT (type
) == float_type_node
)
3725 if (c_promoting_integer_type_p (type
))
3731 /* Recursively examines the array elements of TYPE, until a non-array
3732 element type is found. */
3735 strip_array_types (type
)
3738 while (TREE_CODE (type
) == ARRAY_TYPE
)
3739 type
= TREE_TYPE (type
);
3744 static tree expand_unordered_cmp
PARAMS ((tree
, tree
, enum tree_code
,
3747 /* Expand a call to an unordered comparison function such as
3748 __builtin_isgreater(). FUNCTION is the function's declaration and
3749 PARAMS a list of the values passed. For __builtin_isunordered(),
3750 UNORDERED_CODE is UNORDERED_EXPR and ORDERED_CODE is NOP_EXPR. In
3751 other cases, UNORDERED_CODE and ORDERED_CODE are comparison codes
3752 that give the opposite of the desired result. UNORDERED_CODE is
3753 used for modes that can hold NaNs and ORDERED_CODE is used for the
3757 expand_unordered_cmp (function
, params
, unordered_code
, ordered_code
)
3758 tree function
, params
;
3759 enum tree_code unordered_code
, ordered_code
;
3761 tree arg0
, arg1
, type
;
3762 enum tree_code code0
, code1
;
3764 /* Check that we have exactly two arguments. */
3765 if (params
== 0 || TREE_CHAIN (params
) == 0)
3767 error ("too few arguments to function `%s'",
3768 IDENTIFIER_POINTER (DECL_NAME (function
)));
3769 return error_mark_node
;
3771 else if (TREE_CHAIN (TREE_CHAIN (params
)) != 0)
3773 error ("too many arguments to function `%s'",
3774 IDENTIFIER_POINTER (DECL_NAME (function
)));
3775 return error_mark_node
;
3778 arg0
= TREE_VALUE (params
);
3779 arg1
= TREE_VALUE (TREE_CHAIN (params
));
3781 code0
= TREE_CODE (TREE_TYPE (arg0
));
3782 code1
= TREE_CODE (TREE_TYPE (arg1
));
3784 /* Make sure that the arguments have a common type of REAL. */
3786 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
)
3787 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
))
3788 type
= common_type (TREE_TYPE (arg0
), TREE_TYPE (arg1
));
3790 if (type
== 0 || TREE_CODE (type
) != REAL_TYPE
)
3792 error ("non-floating-point argument to function `%s'",
3793 IDENTIFIER_POINTER (DECL_NAME (function
)));
3794 return error_mark_node
;
3797 if (unordered_code
== UNORDERED_EXPR
)
3799 if (MODE_HAS_NANS (TYPE_MODE (type
)))
3800 return build_binary_op (unordered_code
,
3801 convert (type
, arg0
),
3802 convert (type
, arg1
),
3805 return integer_zero_node
;
3808 return build_unary_op (TRUTH_NOT_EXPR
,
3809 build_binary_op (MODE_HAS_NANS (TYPE_MODE (type
))
3812 convert (type
, arg0
),
3813 convert (type
, arg1
),
3819 /* Recognize certain built-in functions so we can make tree-codes
3820 other than CALL_EXPR. We do this when it enables fold-const.c
3821 to do something useful. */
3822 /* ??? By rights this should go in builtins.c, but only C and C++
3823 implement build_{binary,unary}_op. Not exactly sure what bits
3824 of functionality are actually needed from those functions, or
3825 where the similar functionality exists in the other front ends. */
3828 expand_tree_builtin (function
, params
, coerced_params
)
3829 tree function
, params
, coerced_params
;
3831 if (DECL_BUILT_IN_CLASS (function
) != BUILT_IN_NORMAL
)
3834 switch (DECL_FUNCTION_CODE (function
))
3838 case BUILT_IN_LLABS
:
3839 case BUILT_IN_IMAXABS
:
3841 case BUILT_IN_FABSL
:
3842 case BUILT_IN_FABSF
:
3843 if (coerced_params
== 0)
3844 return integer_zero_node
;
3845 return build_unary_op (ABS_EXPR
, TREE_VALUE (coerced_params
), 0);
3848 case BUILT_IN_CONJF
:
3849 case BUILT_IN_CONJL
:
3850 if (coerced_params
== 0)
3851 return integer_zero_node
;
3852 return build_unary_op (CONJ_EXPR
, TREE_VALUE (coerced_params
), 0);
3854 case BUILT_IN_CREAL
:
3855 case BUILT_IN_CREALF
:
3856 case BUILT_IN_CREALL
:
3857 if (coerced_params
== 0)
3858 return integer_zero_node
;
3859 return build_unary_op (REALPART_EXPR
, TREE_VALUE (coerced_params
), 0);
3861 case BUILT_IN_CIMAG
:
3862 case BUILT_IN_CIMAGF
:
3863 case BUILT_IN_CIMAGL
:
3864 if (coerced_params
== 0)
3865 return integer_zero_node
;
3866 return build_unary_op (IMAGPART_EXPR
, TREE_VALUE (coerced_params
), 0);
3868 case BUILT_IN_ISGREATER
:
3869 return expand_unordered_cmp (function
, params
, UNLE_EXPR
, LE_EXPR
);
3871 case BUILT_IN_ISGREATEREQUAL
:
3872 return expand_unordered_cmp (function
, params
, UNLT_EXPR
, LT_EXPR
);
3874 case BUILT_IN_ISLESS
:
3875 return expand_unordered_cmp (function
, params
, UNGE_EXPR
, GE_EXPR
);
3877 case BUILT_IN_ISLESSEQUAL
:
3878 return expand_unordered_cmp (function
, params
, UNGT_EXPR
, GT_EXPR
);
3880 case BUILT_IN_ISLESSGREATER
:
3881 return expand_unordered_cmp (function
, params
, UNEQ_EXPR
, EQ_EXPR
);
3883 case BUILT_IN_ISUNORDERED
:
3884 return expand_unordered_cmp (function
, params
, UNORDERED_EXPR
, NOP_EXPR
);
3893 /* Returns nonzero if CODE is the code for a statement. */
3896 statement_code_p (code
)
3897 enum tree_code code
;
3922 if (lang_statement_code_p
)
3923 return (*lang_statement_code_p
) (code
);
3928 /* Walk the statement tree, rooted at *tp. Apply FUNC to all the
3929 sub-trees of *TP in a pre-order traversal. FUNC is called with the
3930 DATA and the address of each sub-tree. If FUNC returns a non-NULL
3931 value, the traversal is aborted, and the value returned by FUNC is
3932 returned. If FUNC sets WALK_SUBTREES to zero, then the subtrees of
3933 the node being visited are not walked.
3935 We don't need a without_duplicates variant of this one because the
3936 statement tree is a tree, not a graph. */
3939 walk_stmt_tree (tp
, func
, data
)
3944 enum tree_code code
;
3949 #define WALK_SUBTREE(NODE) \
3952 result = walk_stmt_tree (&(NODE), func, data); \
3958 /* Skip empty subtrees. */
3962 /* Skip subtrees below non-statement nodes. */
3963 if (!statement_code_p (TREE_CODE (*tp
)))
3966 /* Call the function. */
3968 result
= (*func
) (tp
, &walk_subtrees
, data
);
3970 /* If we found something, return it. */
3974 /* FUNC may have modified the tree, recheck that we're looking at a
3976 code
= TREE_CODE (*tp
);
3977 if (!statement_code_p (code
))
3980 /* Visit the subtrees unless FUNC decided that there was nothing
3981 interesting below this point in the tree. */
3984 /* Walk over all the sub-trees of this operand. Statement nodes
3985 never contain RTL, and we needn't worry about TARGET_EXPRs. */
3986 len
= TREE_CODE_LENGTH (code
);
3988 /* Go through the subtrees. We need to do this in forward order so
3989 that the scope of a FOR_EXPR is handled properly. */
3990 for (i
= 0; i
< len
; ++i
)
3991 WALK_SUBTREE (TREE_OPERAND (*tp
, i
));
3994 /* Finally visit the chain. This can be tail-recursion optimized if
3995 we write it this way. */
3996 return walk_stmt_tree (&TREE_CHAIN (*tp
), func
, data
);
4001 /* Used to compare case labels. K1 and K2 are actually tree nodes
4002 representing case labels, or NULL_TREE for a `default' label.
4003 Returns -1 if K1 is ordered before K2, -1 if K1 is ordered after
4004 K2, and 0 if K1 and K2 are equal. */
4007 case_compare (k1
, k2
)
4011 /* Consider a NULL key (such as arises with a `default' label) to be
4012 smaller than anything else. */
4018 return tree_int_cst_compare ((tree
) k1
, (tree
) k2
);
4021 /* Process a case label for the range LOW_VALUE ... HIGH_VALUE. If
4022 LOW_VALUE and HIGH_VALUE are both NULL_TREE then this case label is
4023 actually a `default' label. If only HIGH_VALUE is NULL_TREE, then
4024 case label was declared using the usual C/C++ syntax, rather than
4025 the GNU case range extension. CASES is a tree containing all the
4026 case ranges processed so far; COND is the condition for the
4027 switch-statement itself. Returns the CASE_LABEL created, or
4028 ERROR_MARK_NODE if no CASE_LABEL is created. */
4031 c_add_case_label (cases
, cond
, low_value
, high_value
)
4040 splay_tree_node node
;
4042 /* Create the LABEL_DECL itself. */
4043 label
= build_decl (LABEL_DECL
, NULL_TREE
, NULL_TREE
);
4044 DECL_CONTEXT (label
) = current_function_decl
;
4046 /* If there was an error processing the switch condition, bail now
4047 before we get more confused. */
4048 if (!cond
|| cond
== error_mark_node
)
4050 /* Add a label anyhow so that the back-end doesn't think that
4051 the beginning of the switch is unreachable. */
4053 add_stmt (build_case_label (NULL_TREE
, NULL_TREE
, label
));
4054 return error_mark_node
;
4057 if ((low_value
&& TREE_TYPE (low_value
)
4058 && POINTER_TYPE_P (TREE_TYPE (low_value
)))
4059 || (high_value
&& TREE_TYPE (high_value
)
4060 && POINTER_TYPE_P (TREE_TYPE (high_value
))))
4061 error ("pointers are not permitted as case values");
4063 /* Case ranges are a GNU extension. */
4064 if (high_value
&& pedantic
)
4066 if (c_language
== clk_cplusplus
)
4067 pedwarn ("ISO C++ forbids range expressions in switch statements");
4069 pedwarn ("ISO C forbids range expressions in switch statements");
4072 type
= TREE_TYPE (cond
);
4075 low_value
= check_case_value (low_value
);
4076 low_value
= convert_and_check (type
, low_value
);
4080 high_value
= check_case_value (high_value
);
4081 high_value
= convert_and_check (type
, high_value
);
4084 /* If an error has occurred, bail out now. */
4085 if (low_value
== error_mark_node
|| high_value
== error_mark_node
)
4088 add_stmt (build_case_label (NULL_TREE
, NULL_TREE
, label
));
4089 return error_mark_node
;
4092 /* If the LOW_VALUE and HIGH_VALUE are the same, then this isn't
4093 really a case range, even though it was written that way. Remove
4094 the HIGH_VALUE to simplify later processing. */
4095 if (tree_int_cst_equal (low_value
, high_value
))
4096 high_value
= NULL_TREE
;
4097 if (low_value
&& high_value
4098 && !tree_int_cst_lt (low_value
, high_value
))
4099 warning ("empty range specified");
4101 /* Look up the LOW_VALUE in the table of case labels we already
4103 node
= splay_tree_lookup (cases
, (splay_tree_key
) low_value
);
4104 /* If there was not an exact match, check for overlapping ranges.
4105 There's no need to do this if there's no LOW_VALUE or HIGH_VALUE;
4106 that's a `default' label and the only overlap is an exact match. */
4107 if (!node
&& (low_value
|| high_value
))
4109 splay_tree_node low_bound
;
4110 splay_tree_node high_bound
;
4112 /* Even though there wasn't an exact match, there might be an
4113 overlap between this case range and another case range.
4114 Since we've (inductively) not allowed any overlapping case
4115 ranges, we simply need to find the greatest low case label
4116 that is smaller that LOW_VALUE, and the smallest low case
4117 label that is greater than LOW_VALUE. If there is an overlap
4118 it will occur in one of these two ranges. */
4119 low_bound
= splay_tree_predecessor (cases
,
4120 (splay_tree_key
) low_value
);
4121 high_bound
= splay_tree_successor (cases
,
4122 (splay_tree_key
) low_value
);
4124 /* Check to see if the LOW_BOUND overlaps. It is smaller than
4125 the LOW_VALUE, so there is no need to check unless the
4126 LOW_BOUND is in fact itself a case range. */
4128 && CASE_HIGH ((tree
) low_bound
->value
)
4129 && tree_int_cst_compare (CASE_HIGH ((tree
) low_bound
->value
),
4132 /* Check to see if the HIGH_BOUND overlaps. The low end of that
4133 range is bigger than the low end of the current range, so we
4134 are only interested if the current range is a real range, and
4135 not an ordinary case label. */
4138 && (tree_int_cst_compare ((tree
) high_bound
->key
,
4143 /* If there was an overlap, issue an error. */
4146 tree duplicate
= CASE_LABEL_DECL ((tree
) node
->value
);
4150 error ("duplicate (or overlapping) case value");
4151 error_with_decl (duplicate
,
4152 "this is the first entry overlapping that value");
4156 error ("duplicate case value") ;
4157 error_with_decl (duplicate
, "previously used here");
4161 error ("multiple default labels in one switch");
4162 error_with_decl (duplicate
, "this is the first default label");
4165 add_stmt (build_case_label (NULL_TREE
, NULL_TREE
, label
));
4168 /* Add a CASE_LABEL to the statement-tree. */
4169 case_label
= add_stmt (build_case_label (low_value
, high_value
, label
));
4170 /* Register this case label in the splay tree. */
4171 splay_tree_insert (cases
,
4172 (splay_tree_key
) low_value
,
4173 (splay_tree_value
) case_label
);
4178 /* Finish an expression taking the address of LABEL. Returns an
4179 expression for the address. */
4182 finish_label_address_expr (label
)
4189 if (c_language
== clk_cplusplus
)
4190 pedwarn ("ISO C++ forbids taking the address of a label");
4192 pedwarn ("ISO C forbids taking the address of a label");
4195 label
= lookup_label (label
);
4196 if (label
== NULL_TREE
)
4197 result
= null_pointer_node
;
4200 TREE_USED (label
) = 1;
4201 result
= build1 (ADDR_EXPR
, ptr_type_node
, label
);
4202 TREE_CONSTANT (result
) = 1;
4203 /* The current function in not necessarily uninlinable.
4204 Computed gotos are incompatible with inlining, but the value
4205 here could be used only in a diagnostic, for example. */
4211 /* Hook used by expand_expr to expand language-specific tree codes. */
4214 c_expand_expr (exp
, target
, tmode
, modifier
)
4217 enum machine_mode tmode
;
4218 int modifier
; /* Actually enum_modifier. */
4220 switch (TREE_CODE (exp
))
4226 bool preserve_result
= false;
4227 bool return_target
= false;
4229 /* Since expand_expr_stmt calls free_temp_slots after every
4230 expression statement, we must call push_temp_slots here.
4231 Otherwise, any temporaries in use now would be considered
4232 out-of-scope after the first EXPR_STMT from within the
4235 rtl_expr
= expand_start_stmt_expr (!STMT_EXPR_NO_SCOPE (exp
));
4237 /* If we want the result of this expression, find the last
4238 EXPR_STMT in the COMPOUND_STMT and mark it as addressable. */
4239 if (target
!= const0_rtx
4240 && TREE_CODE (STMT_EXPR_STMT (exp
)) == COMPOUND_STMT
4241 && TREE_CODE (COMPOUND_BODY (STMT_EXPR_STMT (exp
))) == SCOPE_STMT
)
4243 tree expr
= COMPOUND_BODY (STMT_EXPR_STMT (exp
));
4244 tree last
= TREE_CHAIN (expr
);
4246 while (TREE_CHAIN (last
))
4249 last
= TREE_CHAIN (last
);
4252 if (TREE_CODE (last
) == SCOPE_STMT
4253 && TREE_CODE (expr
) == EXPR_STMT
)
4255 if (target
&& TREE_CODE (EXPR_STMT_EXPR (expr
)) == VAR_DECL
4256 && DECL_RTL_IF_SET (EXPR_STMT_EXPR (expr
)) == target
)
4257 /* If the last expression is a variable whose RTL is the
4258 same as our target, just return the target; if it
4259 isn't valid expanding the decl would produce different
4260 RTL, and store_expr would try to do a copy. */
4261 return_target
= true;
4264 /* Otherwise, note that we want the value from the last
4266 TREE_ADDRESSABLE (expr
) = 1;
4267 preserve_result
= true;
4272 expand_stmt (STMT_EXPR_STMT (exp
));
4273 expand_end_stmt_expr (rtl_expr
);
4275 result
= expand_expr (rtl_expr
, target
, tmode
, modifier
);
4278 else if (preserve_result
&& GET_CODE (result
) == MEM
)
4280 if (GET_MODE (result
) != BLKmode
)
4281 result
= copy_to_reg (result
);
4283 preserve_temp_slots (result
);
4286 /* If the statment-expression does not have a scope, then the
4287 new temporaries we created within it must live beyond the
4288 statement-expression. */
4289 if (STMT_EXPR_NO_SCOPE (exp
))
4290 preserve_temp_slots (NULL_RTX
);
4299 if (TREE_CODE (TREE_OPERAND (exp
, 0)) == ADDR_EXPR
4300 && (TREE_CODE (TREE_OPERAND (TREE_OPERAND (exp
, 0), 0))
4302 && DECL_BUILT_IN (TREE_OPERAND (TREE_OPERAND (exp
, 0), 0))
4303 && (DECL_BUILT_IN_CLASS (TREE_OPERAND (TREE_OPERAND (exp
, 0), 0))
4304 == BUILT_IN_FRONTEND
))
4305 return c_expand_builtin (exp
, target
, tmode
, modifier
);
4311 case COMPOUND_LITERAL_EXPR
:
4313 /* Initialize the anonymous variable declared in the compound
4314 literal, then return the variable. */
4315 tree decl
= COMPOUND_LITERAL_EXPR_DECL (exp
);
4316 emit_local_var (decl
);
4317 return expand_expr (decl
, target
, tmode
, modifier
);
4328 /* Hook used by safe_from_p to handle language-specific tree codes. */
4331 c_safe_from_p (target
, exp
)
4335 /* We can see statements here when processing the body of a
4336 statement-expression. For a declaration statement declaring a
4337 variable, look at the variable's initializer. */
4338 if (TREE_CODE (exp
) == DECL_STMT
)
4340 tree decl
= DECL_STMT_DECL (exp
);
4342 if (TREE_CODE (decl
) == VAR_DECL
4343 && DECL_INITIAL (decl
)
4344 && !safe_from_p (target
, DECL_INITIAL (decl
), /*top_p=*/0))
4348 /* For any statement, we must follow the statement-chain. */
4349 if (statement_code_p (TREE_CODE (exp
)) && TREE_CHAIN (exp
))
4350 return safe_from_p (target
, TREE_CHAIN (exp
), /*top_p=*/0);
4352 /* Assume everything else is safe. */
4356 /* Hook used by unsafe_for_reeval to handle language-specific tree codes. */
4359 c_common_unsafe_for_reeval (exp
)
4362 /* Statement expressions may not be reevaluated, likewise compound
4364 if (TREE_CODE (exp
) == STMT_EXPR
4365 || TREE_CODE (exp
) == COMPOUND_LITERAL_EXPR
)
4368 /* Walk all other expressions. */
4372 /* Hook used by staticp to handle language-specific tree codes. */
4378 if (TREE_CODE (exp
) == COMPOUND_LITERAL_EXPR
4379 && TREE_STATIC (COMPOUND_LITERAL_EXPR_DECL (exp
)))
4384 #define CALLED_AS_BUILT_IN(NODE) \
4385 (!strncmp (IDENTIFIER_POINTER (DECL_NAME (NODE)), "__builtin_", 10))
4388 c_expand_builtin (exp
, target
, tmode
, modifier
)
4391 enum machine_mode tmode
;
4392 enum expand_modifier modifier
;
4394 tree type
= TREE_TYPE (exp
);
4395 tree fndecl
= TREE_OPERAND (TREE_OPERAND (exp
, 0), 0);
4396 tree arglist
= TREE_OPERAND (exp
, 1);
4397 enum built_in_function fcode
= DECL_FUNCTION_CODE (fndecl
);
4398 enum tree_code code
= TREE_CODE (exp
);
4399 const int ignore
= (target
== const0_rtx
4400 || ((code
== NON_LVALUE_EXPR
|| code
== NOP_EXPR
4401 || code
== CONVERT_EXPR
|| code
== REFERENCE_EXPR
4402 || code
== COND_EXPR
)
4403 && TREE_CODE (type
) == VOID_TYPE
));
4405 if (! optimize
&& ! CALLED_AS_BUILT_IN (fndecl
))
4406 return expand_call (exp
, target
, ignore
);
4410 case BUILT_IN_PRINTF
:
4411 target
= c_expand_builtin_printf (arglist
, target
, tmode
,
4412 modifier
, ignore
, /*unlocked=*/ 0);
4417 case BUILT_IN_PRINTF_UNLOCKED
:
4418 target
= c_expand_builtin_printf (arglist
, target
, tmode
,
4419 modifier
, ignore
, /*unlocked=*/ 1);
4424 case BUILT_IN_FPRINTF
:
4425 target
= c_expand_builtin_fprintf (arglist
, target
, tmode
,
4426 modifier
, ignore
, /*unlocked=*/ 0);
4431 case BUILT_IN_FPRINTF_UNLOCKED
:
4432 target
= c_expand_builtin_fprintf (arglist
, target
, tmode
,
4433 modifier
, ignore
, /*unlocked=*/ 1);
4438 default: /* just do library call, if unknown builtin */
4439 error ("built-in function `%s' not currently supported",
4440 IDENTIFIER_POINTER (DECL_NAME (fndecl
)));
4443 /* The switch statement above can drop through to cause the function
4444 to be called normally. */
4445 return expand_call (exp
, target
, ignore
);
4448 /* Check an arglist to *printf for problems. The arglist should start
4449 at the format specifier, with the remaining arguments immediately
4452 is_valid_printf_arglist (arglist
)
4455 /* Save this value so we can restore it later. */
4456 const int SAVE_pedantic
= pedantic
;
4457 int diagnostic_occurred
= 0;
4460 /* Set this to a known value so the user setting won't affect code
4463 /* Check to make sure there are no format specifier errors. */
4464 attrs
= tree_cons (get_identifier ("format"),
4465 tree_cons (NULL_TREE
,
4466 get_identifier ("printf"),
4467 tree_cons (NULL_TREE
,
4469 tree_cons (NULL_TREE
,
4473 check_function_format (&diagnostic_occurred
, attrs
, arglist
);
4475 /* Restore the value of `pedantic'. */
4476 pedantic
= SAVE_pedantic
;
4478 /* If calling `check_function_format_ptr' produces a warning, we
4479 return false, otherwise we return true. */
4480 return ! diagnostic_occurred
;
4483 /* If the arguments passed to printf are suitable for optimizations,
4484 we attempt to transform the call. */
4486 c_expand_builtin_printf (arglist
, target
, tmode
, modifier
, ignore
, unlocked
)
4489 enum machine_mode tmode
;
4490 enum expand_modifier modifier
;
4494 tree fn_putchar
= unlocked
?
4495 built_in_decls
[BUILT_IN_PUTCHAR_UNLOCKED
] : built_in_decls
[BUILT_IN_PUTCHAR
];
4496 tree fn_puts
= unlocked
?
4497 built_in_decls
[BUILT_IN_PUTS_UNLOCKED
] : built_in_decls
[BUILT_IN_PUTS
];
4498 tree fn
, format_arg
, stripped_string
;
4500 /* If the return value is used, or the replacement _DECL isn't
4501 initialized, don't do the transformation. */
4502 if (!ignore
|| !fn_putchar
|| !fn_puts
)
4505 /* Verify the required arguments in the original call. */
4507 || (TREE_CODE (TREE_TYPE (TREE_VALUE (arglist
))) != POINTER_TYPE
))
4510 /* Check the specifier vs. the parameters. */
4511 if (!is_valid_printf_arglist (arglist
))
4514 format_arg
= TREE_VALUE (arglist
);
4515 stripped_string
= format_arg
;
4516 STRIP_NOPS (stripped_string
);
4517 if (stripped_string
&& TREE_CODE (stripped_string
) == ADDR_EXPR
)
4518 stripped_string
= TREE_OPERAND (stripped_string
, 0);
4520 /* If the format specifier isn't a STRING_CST, punt. */
4521 if (TREE_CODE (stripped_string
) != STRING_CST
)
4524 /* OK! We can attempt optimization. */
4526 /* If the format specifier was "%s\n", call __builtin_puts(arg2). */
4527 if (strcmp (TREE_STRING_POINTER (stripped_string
), "%s\n") == 0)
4529 arglist
= TREE_CHAIN (arglist
);
4532 /* If the format specifier was "%c", call __builtin_putchar (arg2). */
4533 else if (strcmp (TREE_STRING_POINTER (stripped_string
), "%c") == 0)
4535 arglist
= TREE_CHAIN (arglist
);
4540 /* We can't handle anything else with % args or %% ... yet. */
4541 if (strchr (TREE_STRING_POINTER (stripped_string
), '%'))
4544 /* If the resulting constant string has a length of 1, call
4545 putchar. Note, TREE_STRING_LENGTH includes the terminating
4546 NULL in its count. */
4547 if (TREE_STRING_LENGTH (stripped_string
) == 2)
4549 /* Given printf("c"), (where c is any one character,)
4550 convert "c"[0] to an int and pass that to the replacement
4552 arglist
= build_int_2 (TREE_STRING_POINTER (stripped_string
)[0], 0);
4553 arglist
= build_tree_list (NULL_TREE
, arglist
);
4557 /* If the resulting constant was "string\n", call
4558 __builtin_puts("string"). Ensure "string" has at least one
4559 character besides the trailing \n. Note, TREE_STRING_LENGTH
4560 includes the terminating NULL in its count. */
4561 else if (TREE_STRING_LENGTH (stripped_string
) > 2
4562 && TREE_STRING_POINTER (stripped_string
)
4563 [TREE_STRING_LENGTH (stripped_string
) - 2] == '\n')
4565 /* Create a NULL-terminated string that's one char shorter
4566 than the original, stripping off the trailing '\n'. */
4567 const int newlen
= TREE_STRING_LENGTH (stripped_string
) - 1;
4568 char *newstr
= (char *) alloca (newlen
);
4569 memcpy (newstr
, TREE_STRING_POINTER (stripped_string
), newlen
- 1);
4570 newstr
[newlen
- 1] = 0;
4572 arglist
= fix_string_type (build_string (newlen
, newstr
));
4573 arglist
= build_tree_list (NULL_TREE
, arglist
);
4577 /* We'd like to arrange to call fputs(string) here, but we
4578 need stdout and don't have a way to get it ... yet. */
4582 return expand_expr (build_function_call (fn
, arglist
),
4583 (ignore
? const0_rtx
: target
),
4587 /* If the arguments passed to fprintf are suitable for optimizations,
4588 we attempt to transform the call. */
4590 c_expand_builtin_fprintf (arglist
, target
, tmode
, modifier
, ignore
, unlocked
)
4593 enum machine_mode tmode
;
4594 enum expand_modifier modifier
;
4598 tree fn_fputc
= unlocked
?
4599 built_in_decls
[BUILT_IN_FPUTC_UNLOCKED
] : built_in_decls
[BUILT_IN_FPUTC
];
4600 tree fn_fputs
= unlocked
?
4601 built_in_decls
[BUILT_IN_FPUTS_UNLOCKED
] : built_in_decls
[BUILT_IN_FPUTS
];
4602 tree fn
, format_arg
, stripped_string
;
4604 /* If the return value is used, or the replacement _DECL isn't
4605 initialized, don't do the transformation. */
4606 if (!ignore
|| !fn_fputc
|| !fn_fputs
)
4609 /* Verify the required arguments in the original call. */
4611 || (TREE_CODE (TREE_TYPE (TREE_VALUE (arglist
))) != POINTER_TYPE
)
4612 || (TREE_CHAIN (arglist
) == 0)
4613 || (TREE_CODE (TREE_TYPE (TREE_VALUE (TREE_CHAIN (arglist
)))) !=
4617 /* Check the specifier vs. the parameters. */
4618 if (!is_valid_printf_arglist (TREE_CHAIN (arglist
)))
4621 format_arg
= TREE_VALUE (TREE_CHAIN (arglist
));
4622 stripped_string
= format_arg
;
4623 STRIP_NOPS (stripped_string
);
4624 if (stripped_string
&& TREE_CODE (stripped_string
) == ADDR_EXPR
)
4625 stripped_string
= TREE_OPERAND (stripped_string
, 0);
4627 /* If the format specifier isn't a STRING_CST, punt. */
4628 if (TREE_CODE (stripped_string
) != STRING_CST
)
4631 /* OK! We can attempt optimization. */
4633 /* If the format specifier was "%s", call __builtin_fputs(arg3, arg1). */
4634 if (strcmp (TREE_STRING_POINTER (stripped_string
), "%s") == 0)
4636 tree newarglist
= build_tree_list (NULL_TREE
, TREE_VALUE (arglist
));
4637 arglist
= tree_cons (NULL_TREE
,
4638 TREE_VALUE (TREE_CHAIN (TREE_CHAIN (arglist
))),
4642 /* If the format specifier was "%c", call __builtin_fputc (arg3, arg1). */
4643 else if (strcmp (TREE_STRING_POINTER (stripped_string
), "%c") == 0)
4645 tree newarglist
= build_tree_list (NULL_TREE
, TREE_VALUE (arglist
));
4646 arglist
= tree_cons (NULL_TREE
,
4647 TREE_VALUE (TREE_CHAIN (TREE_CHAIN (arglist
))),
4653 /* We can't handle anything else with % args or %% ... yet. */
4654 if (strchr (TREE_STRING_POINTER (stripped_string
), '%'))
4657 /* When "string" doesn't contain %, replace all cases of
4658 fprintf(stream,string) with fputs(string,stream). The fputs
4659 builtin will take take of special cases like length==1. */
4660 arglist
= tree_cons (NULL_TREE
, TREE_VALUE (TREE_CHAIN (arglist
)),
4661 build_tree_list (NULL_TREE
, TREE_VALUE (arglist
)));
4665 return expand_expr (build_function_call (fn
, arglist
),
4666 (ignore
? const0_rtx
: target
),
4671 /* Given a boolean expression ARG, return a tree representing an increment
4672 or decrement (as indicated by CODE) of ARG. The front end must check for
4673 invalid cases (e.g., decrement in C++). */
4675 boolean_increment (code
, arg
)
4676 enum tree_code code
;
4680 tree true_res
= (c_language
== clk_cplusplus
4682 : c_bool_true_node
);
4683 arg
= stabilize_reference (arg
);
4686 case PREINCREMENT_EXPR
:
4687 val
= build (MODIFY_EXPR
, TREE_TYPE (arg
), arg
, true_res
);
4689 case POSTINCREMENT_EXPR
:
4690 val
= build (MODIFY_EXPR
, TREE_TYPE (arg
), arg
, true_res
);
4691 arg
= save_expr (arg
);
4692 val
= build (COMPOUND_EXPR
, TREE_TYPE (arg
), val
, arg
);
4693 val
= build (COMPOUND_EXPR
, TREE_TYPE (arg
), arg
, val
);
4695 case PREDECREMENT_EXPR
:
4696 val
= build (MODIFY_EXPR
, TREE_TYPE (arg
), arg
, invert_truthvalue (arg
));
4698 case POSTDECREMENT_EXPR
:
4699 val
= build (MODIFY_EXPR
, TREE_TYPE (arg
), arg
, invert_truthvalue (arg
));
4700 arg
= save_expr (arg
);
4701 val
= build (COMPOUND_EXPR
, TREE_TYPE (arg
), val
, arg
);
4702 val
= build (COMPOUND_EXPR
, TREE_TYPE (arg
), arg
, val
);
4707 TREE_SIDE_EFFECTS (val
) = 1;
4711 /* Define NAME with value TYPE precision. */
4713 builtin_define_type_precision (name
, type
)
4717 builtin_define_with_int_value (name
, TYPE_PRECISION (type
));
4720 /* Define the float.h constants for TYPE using NAME_PREFIX and FP_SUFFIX. */
4722 builtin_define_float_constants (name_prefix
, fp_suffix
, type
)
4723 const char *name_prefix
;
4724 const char *fp_suffix
;
4727 /* Used to convert radix-based values to base 10 values in several cases.
4729 In the max_exp -> max_10_exp conversion for 128-bit IEEE, we need at
4730 least 6 significant digits for correct results. Using the fraction
4731 formed by (log(2)*1e6)/(log(10)*1e6) overflows a 32-bit integer as an
4732 intermediate; perhaps someone can find a better approximation, in the
4733 mean time, I suspect using doubles won't harm the bootstrap here. */
4735 const double log10_2
= .30102999566398119521;
4737 const struct real_format
*fmt
;
4739 char name
[64], buf
[128];
4740 int dig
, min_10_exp
, max_10_exp
;
4743 fmt
= real_format_for_mode
[TYPE_MODE (type
) - QFmode
];
4745 /* The radix of the exponent representation. */
4746 if (type
== float_type_node
)
4747 builtin_define_with_int_value ("__FLT_RADIX__", fmt
->b
);
4748 log10_b
= log10_2
* fmt
->log2_b
;
4750 /* The number of radix digits, p, in the floating-point significand. */
4751 sprintf (name
, "__%s_MANT_DIG__", name_prefix
);
4752 builtin_define_with_int_value (name
, fmt
->p
);
4754 /* The number of decimal digits, q, such that any floating-point number
4755 with q decimal digits can be rounded into a floating-point number with
4756 p radix b digits and back again without change to the q decimal digits,
4758 p log10 b if b is a power of 10
4759 floor((p - 1) log10 b) otherwise
4761 dig
= (fmt
->p
- 1) * log10_b
;
4762 sprintf (name
, "__%s_DIG__", name_prefix
);
4763 builtin_define_with_int_value (name
, dig
);
4765 /* The minimum negative int x such that b**(x-1) is a normalized float. */
4766 sprintf (name
, "__%s_MIN_EXP__", name_prefix
);
4767 sprintf (buf
, "(%d)", fmt
->emin
);
4768 builtin_define_with_value (name
, buf
, 0);
4770 /* The minimum negative int x such that 10**x is a normalized float,
4772 ceil (log10 (b ** (emin - 1)))
4773 = ceil (log10 (b) * (emin - 1))
4775 Recall that emin is negative, so the integer truncation calculates
4776 the ceiling, not the floor, in this case. */
4777 min_10_exp
= (fmt
->emin
- 1) * log10_b
;
4778 sprintf (name
, "__%s_MIN_10_EXP__", name_prefix
);
4779 sprintf (buf
, "(%d)", min_10_exp
);
4780 builtin_define_with_value (name
, buf
, 0);
4782 /* The maximum int x such that b**(x-1) is a representable float. */
4783 sprintf (name
, "__%s_MAX_EXP__", name_prefix
);
4784 builtin_define_with_int_value (name
, fmt
->emax
);
4786 /* The maximum int x such that 10**x is in the range of representable
4787 finite floating-point numbers,
4789 floor (log10((1 - b**-p) * b**emax))
4790 = floor (log10(1 - b**-p) + log10(b**emax))
4791 = floor (log10(1 - b**-p) + log10(b)*emax)
4793 The safest thing to do here is to just compute this number. But since
4794 we don't link cc1 with libm, we cannot. We could implement log10 here
4795 a series expansion, but that seems too much effort because:
4797 Note that the first term, for all extant p, is a number exceedingly close
4798 to zero, but slightly negative. Note that the second term is an integer
4799 scaling an irrational number, and that because of the floor we are only
4800 interested in its integral portion.
4802 In order for the first term to have any effect on the integral portion
4803 of the second term, the second term has to be exceedingly close to an
4804 integer itself (e.g. 123.000000000001 or something). Getting a result
4805 that close to an integer requires that the irrational multiplicand have
4806 a long series of zeros in its expansion, which doesn't occur in the
4807 first 20 digits or so of log10(b).
4809 Hand-waving aside, crunching all of the sets of constants above by hand
4810 does not yield a case for which the first term is significant, which
4811 in the end is all that matters. */
4812 max_10_exp
= fmt
->emax
* log10_b
;
4813 sprintf (name
, "__%s_MAX_10_EXP__", name_prefix
);
4814 builtin_define_with_int_value (name
, max_10_exp
);
4816 /* The number of decimal digits, n, such that any floating-point number
4817 can be rounded to n decimal digits and back again without change to
4820 p * log10(b) if b is a power of 10
4821 ceil(1 + p * log10(b)) otherwise
4823 The only macro we care about is this number for the widest supported
4824 floating type, but we want this value for rendering constants below. */
4826 double d_decimal_dig
= 1 + fmt
->p
* log10_b
;
4827 decimal_dig
= d_decimal_dig
;
4828 if (decimal_dig
< d_decimal_dig
)
4831 if (type
== long_double_type_node
)
4832 builtin_define_with_int_value ("__DECIMAL_DIG__", decimal_dig
);
4834 /* Since, for the supported formats, B is always a power of 2, we
4835 construct the following numbers directly as a hexadecimal
4838 /* The maximum representable finite floating-point number,
4839 (1 - b**-p) * b**emax */
4844 strcpy (buf
, "0x0.");
4845 n
= fmt
->p
* fmt
->log2_b
;
4846 for (i
= 0, p
= buf
+ 4; i
+ 3 < n
; i
+= 4)
4849 *p
++ = "08ce"[n
- i
];
4850 sprintf (p
, "p%d", fmt
->emax
* fmt
->log2_b
);
4852 sprintf (name
, "__%s_MAX__", name_prefix
);
4853 builtin_define_with_hex_fp_value (name
, type
, decimal_dig
, buf
, fp_suffix
);
4855 /* The minimum normalized positive floating-point number,
4857 sprintf (name
, "__%s_MIN__", name_prefix
);
4858 sprintf (buf
, "0x1p%d", (fmt
->emin
- 1) * fmt
->log2_b
);
4859 builtin_define_with_hex_fp_value (name
, type
, decimal_dig
, buf
, fp_suffix
);
4861 /* The difference between 1 and the least value greater than 1 that is
4862 representable in the given floating point type, b**(1-p). */
4863 sprintf (name
, "__%s_EPSILON__", name_prefix
);
4864 sprintf (buf
, "0x1p%d", (1 - fmt
->p
) * fmt
->log2_b
);
4865 builtin_define_with_hex_fp_value (name
, type
, decimal_dig
, buf
, fp_suffix
);
4867 /* For C++ std::numeric_limits<T>::denorm_min. The minimum denormalized
4868 positive floating-point number, b**(emin-p). Zero for formats that
4869 don't support denormals. */
4870 sprintf (name
, "__%s_DENORM_MIN__", name_prefix
);
4871 if (fmt
->has_denorm
)
4873 sprintf (buf
, "0x1p%d", (fmt
->emin
- fmt
->p
) * fmt
->log2_b
);
4874 builtin_define_with_hex_fp_value (name
, type
, decimal_dig
,
4879 sprintf (buf
, "0.0%s", fp_suffix
);
4880 builtin_define_with_value (name
, buf
, 0);
4884 /* Hook that registers front end and target-specific built-ins. */
4886 cb_register_builtins (pfile
)
4889 /* -undef turns off target-specific built-ins. */
4893 if (c_language
== clk_cplusplus
)
4895 if (SUPPORTS_ONE_ONLY
)
4896 cpp_define (pfile
, "__GXX_WEAK__=1");
4898 cpp_define (pfile
, "__GXX_WEAK__=0");
4899 if (flag_exceptions
)
4900 cpp_define (pfile
, "__EXCEPTIONS");
4901 if (warn_deprecated
)
4902 cpp_define (pfile
, "__DEPRECATED");
4905 /* represents the C++ ABI version, always defined so it can be used while
4906 preprocessing C and assembler. */
4907 cpp_define (pfile
, "__GXX_ABI_VERSION=102");
4909 /* libgcc needs to know this. */
4910 if (USING_SJLJ_EXCEPTIONS
)
4911 cpp_define (pfile
, "__USING_SJLJ_EXCEPTIONS__");
4913 /* stddef.h needs to know these. */
4914 builtin_define_with_value ("__SIZE_TYPE__", SIZE_TYPE
, 0);
4915 builtin_define_with_value ("__PTRDIFF_TYPE__", PTRDIFF_TYPE
, 0);
4916 builtin_define_with_value ("__WCHAR_TYPE__", MODIFIED_WCHAR_TYPE
, 0);
4917 builtin_define_with_value ("__WINT_TYPE__", WINT_TYPE
, 0);
4919 /* limits.h needs to know these. */
4920 builtin_define_type_max ("__SCHAR_MAX__", signed_char_type_node
, 0);
4921 builtin_define_type_max ("__SHRT_MAX__", short_integer_type_node
, 0);
4922 builtin_define_type_max ("__INT_MAX__", integer_type_node
, 0);
4923 builtin_define_type_max ("__LONG_MAX__", long_integer_type_node
, 1);
4924 builtin_define_type_max ("__LONG_LONG_MAX__", long_long_integer_type_node
, 2);
4925 builtin_define_type_max ("__WCHAR_MAX__", wchar_type_node
, 0);
4927 builtin_define_type_precision ("__CHAR_BIT__", char_type_node
);
4929 /* float.h needs to know these. */
4931 builtin_define_with_int_value ("__FLT_EVAL_METHOD__",
4932 TARGET_FLT_EVAL_METHOD
);
4934 builtin_define_float_constants ("FLT", "F", float_type_node
);
4935 builtin_define_float_constants ("DBL", "", double_type_node
);
4936 builtin_define_float_constants ("LDBL", "L", long_double_type_node
);
4938 /* For use in assembly language. */
4939 builtin_define_with_value ("__REGISTER_PREFIX__", REGISTER_PREFIX
, 0);
4940 builtin_define_with_value ("__USER_LABEL_PREFIX__", user_label_prefix
, 0);
4943 builtin_define_with_value ("__VERSION__", version_string
, 1);
4945 /* Other target-independent built-ins determined by command-line
4948 cpp_define (pfile
, "__OPTIMIZE_SIZE__");
4950 cpp_define (pfile
, "__OPTIMIZE__");
4953 cpp_define (pfile
, "__STDC_HOSTED__=1");
4955 cpp_define (pfile
, "__STDC_HOSTED__=0");
4957 if (fast_math_flags_set_p ())
4958 cpp_define (pfile
, "__FAST_MATH__");
4959 if (flag_really_no_inline
)
4960 cpp_define (pfile
, "__NO_INLINE__");
4961 if (flag_signaling_nans
)
4962 cpp_define (pfile
, "__SUPPORT_SNAN__");
4963 if (flag_finite_math_only
)
4964 cpp_define (pfile
, "__FINITE_MATH_ONLY__=1");
4966 cpp_define (pfile
, "__FINITE_MATH_ONLY__=0");
4969 cpp_define (pfile
, "__STRICT_ANSI__");
4971 if (!flag_signed_char
)
4972 cpp_define (pfile
, "__CHAR_UNSIGNED__");
4974 if (c_language
== clk_cplusplus
&& TREE_UNSIGNED (wchar_type_node
))
4975 cpp_define (pfile
, "__WCHAR_UNSIGNED__");
4977 /* Make the choice of ObjC runtime visible to source code. */
4978 if (flag_objc
&& flag_next_runtime
)
4979 cpp_define (pfile
, "__NEXT_RUNTIME__");
4981 /* A straightforward target hook doesn't work, because of problems
4982 linking that hook's body when part of non-C front ends. */
4983 # define preprocessing_asm_p() (cpp_get_options (pfile)->lang == CLK_ASM)
4984 # define preprocessing_trad_p() (cpp_get_options (pfile)->traditional)
4985 # define builtin_define(TXT) cpp_define (pfile, TXT)
4986 # define builtin_assert(TXT) cpp_assert (pfile, TXT)
4987 TARGET_CPU_CPP_BUILTINS ();
4988 TARGET_OS_CPP_BUILTINS ();
4991 /* Pass an object-like macro. If it doesn't lie in the user's
4992 namespace, defines it unconditionally. Otherwise define a version
4993 with two leading underscores, and another version with two leading
4994 and trailing underscores, and define the original only if an ISO
4995 standard was not nominated.
4997 e.g. passing "unix" defines "__unix", "__unix__" and possibly
4998 "unix". Passing "_mips" defines "__mips", "__mips__" and possibly
5001 builtin_define_std (macro
)
5004 size_t len
= strlen (macro
);
5005 char *buff
= alloca (len
+ 5);
5009 /* prepend __ (or maybe just _) if in user's namespace. */
5010 memcpy (p
, macro
, len
+ 1);
5011 if (!( *p
== '_' && (p
[1] == '_' || ISUPPER (p
[1]))))
5018 cpp_define (parse_in
, p
);
5020 /* If it was in user's namespace... */
5023 /* Define the macro with leading and following __. */
5029 cpp_define (parse_in
, p
);
5031 /* Finally, define the original macro if permitted. */
5033 cpp_define (parse_in
, macro
);
5037 /* Pass an object-like macro and a value to define it to. The third
5038 parameter says whether or not to turn the value into a string
5041 builtin_define_with_value (macro
, expansion
, is_str
)
5043 const char *expansion
;
5047 size_t mlen
= strlen (macro
);
5048 size_t elen
= strlen (expansion
);
5049 size_t extra
= 2; /* space for an = and a NUL */
5052 extra
+= 2; /* space for two quote marks */
5054 buf
= alloca (mlen
+ elen
+ extra
);
5056 sprintf (buf
, "%s=\"%s\"", macro
, expansion
);
5058 sprintf (buf
, "%s=%s", macro
, expansion
);
5060 cpp_define (parse_in
, buf
);
5063 /* Pass an object-like macro and an integer value to define it to. */
5065 builtin_define_with_int_value (macro
, value
)
5067 HOST_WIDE_INT value
;
5070 size_t mlen
= strlen (macro
);
5072 size_t extra
= 2; /* space for = and NUL. */
5074 buf
= alloca (mlen
+ vlen
+ extra
);
5075 memcpy (buf
, macro
, mlen
);
5077 sprintf (buf
+ mlen
+ 1, HOST_WIDE_INT_PRINT_DEC
, value
);
5079 cpp_define (parse_in
, buf
);
5082 /* Pass an object-like macro a hexadecimal floating-point value. */
5084 builtin_define_with_hex_fp_value (macro
, type
, digits
, hex_str
, fp_suffix
)
5086 tree type ATTRIBUTE_UNUSED
;
5088 const char *hex_str
;
5089 const char *fp_suffix
;
5091 REAL_VALUE_TYPE real
;
5092 char dec_str
[64], buf
[256];
5094 /* Hex values are really cool and convenient, except that they're
5095 not supported in strict ISO C90 mode. First, the "p-" sequence
5096 is not valid as part of a preprocessor number. Second, we get a
5097 pedwarn from the preprocessor, which has no context, so we can't
5098 suppress the warning with __extension__.
5100 So instead what we do is construct the number in hex (because
5101 it's easy to get the exact correct value), parse it as a real,
5102 then print it back out as decimal. */
5104 real_from_string (&real
, hex_str
);
5105 real_to_decimal (dec_str
, &real
, sizeof (dec_str
), digits
, 0);
5107 sprintf (buf
, "%s=%s%s", macro
, dec_str
, fp_suffix
);
5108 cpp_define (parse_in
, buf
);
5111 /* Define MAX for TYPE based on the precision of the type. IS_LONG is
5112 1 for type "long" and 2 for "long long". We have to handle
5113 unsigned types, since wchar_t might be unsigned. */
5116 builtin_define_type_max (macro
, type
, is_long
)
5121 static const char *const values
[]
5124 "2147483647", "4294967295",
5125 "9223372036854775807", "18446744073709551615",
5126 "170141183460469231731687303715884105727",
5127 "340282366920938463463374607431768211455" };
5128 static const char *const suffixes
[] = { "", "U", "L", "UL", "LL", "ULL" };
5130 const char *value
, *suffix
;
5134 /* Pre-rendering the values mean we don't have to futz with printing a
5135 multi-word decimal value. There are also a very limited number of
5136 precisions that we support, so it's really a waste of time. */
5137 switch (TYPE_PRECISION (type
))
5139 case 8: idx
= 0; break;
5140 case 16: idx
= 2; break;
5141 case 32: idx
= 4; break;
5142 case 64: idx
= 6; break;
5143 case 128: idx
= 8; break;
5147 value
= values
[idx
+ TREE_UNSIGNED (type
)];
5148 suffix
= suffixes
[is_long
* 2 + TREE_UNSIGNED (type
)];
5150 buf
= alloca (strlen (macro
) + 1 + strlen (value
) + strlen (suffix
) + 1);
5151 sprintf (buf
, "%s=%s%s", macro
, value
, suffix
);
5153 cpp_define (parse_in
, buf
);
5157 c_init_attributes ()
5159 /* Fill in the built_in_attributes array. */
5160 #define DEF_ATTR_NULL_TREE(ENUM) \
5161 built_in_attributes[(int) ENUM] = NULL_TREE;
5162 #define DEF_ATTR_INT(ENUM, VALUE) \
5163 built_in_attributes[(int) ENUM] = build_int_2 (VALUE, VALUE < 0 ? -1 : 0);
5164 #define DEF_ATTR_IDENT(ENUM, STRING) \
5165 built_in_attributes[(int) ENUM] = get_identifier (STRING);
5166 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) \
5167 built_in_attributes[(int) ENUM] \
5168 = tree_cons (built_in_attributes[(int) PURPOSE], \
5169 built_in_attributes[(int) VALUE], \
5170 built_in_attributes[(int) CHAIN]);
5171 #define DEF_FN_ATTR(NAME, ATTRS, PREDICATE) /* No initialization needed. */
5172 #include "builtin-attrs.def"
5173 #undef DEF_ATTR_NULL_TREE
5175 #undef DEF_ATTR_IDENT
5176 #undef DEF_ATTR_TREE_LIST
5178 c_attrs_initialized
= true;
5181 /* Depending on the name of DECL, apply default attributes to it. */
5184 c_common_insert_default_attributes (decl
)
5187 tree name
= DECL_NAME (decl
);
5189 if (!c_attrs_initialized
)
5190 c_init_attributes ();
5192 #define DEF_ATTR_NULL_TREE(ENUM) /* Nothing needed after initialization. */
5193 #define DEF_ATTR_INT(ENUM, VALUE)
5194 #define DEF_ATTR_IDENT(ENUM, STRING)
5195 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN)
5196 #define DEF_FN_ATTR(NAME, ATTRS, PREDICATE) \
5197 if ((PREDICATE) && name == built_in_attributes[(int) NAME]) \
5198 decl_attributes (&decl, built_in_attributes[(int) ATTRS], \
5199 ATTR_FLAG_BUILT_IN);
5200 #include "builtin-attrs.def"
5201 #undef DEF_ATTR_NULL_TREE
5203 #undef DEF_ATTR_IDENT
5204 #undef DEF_ATTR_TREE_LIST
5208 /* Output a -Wshadow warning MSGID about NAME, an IDENTIFIER_NODE, and
5209 additionally give the location of the previous declaration DECL. */
5211 shadow_warning (msgid
, name
, decl
)
5215 warning ("declaration of `%s' shadows %s", IDENTIFIER_POINTER (name
), msgid
);
5216 warning_with_file_and_line (DECL_SOURCE_FILE (decl
),
5217 DECL_SOURCE_LINE (decl
),
5218 "shadowed declaration is here");
5221 /* Attribute handlers common to C front ends. */
5223 /* Handle a "packed" attribute; arguments as in
5224 struct attribute_spec.handler. */
5227 handle_packed_attribute (node
, name
, args
, flags
, no_add_attrs
)
5230 tree args ATTRIBUTE_UNUSED
;
5237 if (TREE_CODE (*node
) == TYPE_DECL
)
5238 type
= &TREE_TYPE (*node
);
5245 if (!(flags
& (int) ATTR_FLAG_TYPE_IN_PLACE
))
5246 *type
= build_type_copy (*type
);
5247 TYPE_PACKED (*type
) = 1;
5249 else if (TREE_CODE (*node
) == FIELD_DECL
)
5250 DECL_PACKED (*node
) = 1;
5251 /* We can't set DECL_PACKED for a VAR_DECL, because the bit is
5252 used for DECL_REGISTER. It wouldn't mean anything anyway. */
5255 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name
));
5256 *no_add_attrs
= true;
5262 /* Handle a "nocommon" attribute; arguments as in
5263 struct attribute_spec.handler. */
5266 handle_nocommon_attribute (node
, name
, args
, flags
, no_add_attrs
)
5269 tree args ATTRIBUTE_UNUSED
;
5270 int flags ATTRIBUTE_UNUSED
;
5273 if (TREE_CODE (*node
) == VAR_DECL
)
5274 DECL_COMMON (*node
) = 0;
5277 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name
));
5278 *no_add_attrs
= true;
5284 /* Handle a "common" attribute; arguments as in
5285 struct attribute_spec.handler. */
5288 handle_common_attribute (node
, name
, args
, flags
, no_add_attrs
)
5291 tree args ATTRIBUTE_UNUSED
;
5292 int flags ATTRIBUTE_UNUSED
;
5295 if (TREE_CODE (*node
) == VAR_DECL
)
5296 DECL_COMMON (*node
) = 1;
5299 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name
));
5300 *no_add_attrs
= true;
5306 /* Handle a "noreturn" attribute; arguments as in
5307 struct attribute_spec.handler. */
5310 handle_noreturn_attribute (node
, name
, args
, flags
, no_add_attrs
)
5313 tree args ATTRIBUTE_UNUSED
;
5314 int flags ATTRIBUTE_UNUSED
;
5317 tree type
= TREE_TYPE (*node
);
5319 /* See FIXME comment in c_common_attribute_table. */
5320 if (TREE_CODE (*node
) == FUNCTION_DECL
)
5321 TREE_THIS_VOLATILE (*node
) = 1;
5322 else if (TREE_CODE (type
) == POINTER_TYPE
5323 && TREE_CODE (TREE_TYPE (type
)) == FUNCTION_TYPE
)
5325 = build_pointer_type
5326 (build_type_variant (TREE_TYPE (type
),
5327 TREE_READONLY (TREE_TYPE (type
)), 1));
5330 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name
));
5331 *no_add_attrs
= true;
5337 /* Handle a "noinline" attribute; arguments as in
5338 struct attribute_spec.handler. */
5341 handle_noinline_attribute (node
, name
, args
, flags
, no_add_attrs
)
5344 tree args ATTRIBUTE_UNUSED
;
5345 int flags ATTRIBUTE_UNUSED
;
5348 if (TREE_CODE (*node
) == FUNCTION_DECL
)
5349 DECL_UNINLINABLE (*node
) = 1;
5352 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name
));
5353 *no_add_attrs
= true;
5359 /* Handle a "always_inline" attribute; arguments as in
5360 struct attribute_spec.handler. */
5363 handle_always_inline_attribute (node
, name
, args
, flags
, no_add_attrs
)
5366 tree args ATTRIBUTE_UNUSED
;
5367 int flags ATTRIBUTE_UNUSED
;
5370 if (TREE_CODE (*node
) == FUNCTION_DECL
)
5372 /* Do nothing else, just set the attribute. We'll get at
5373 it later with lookup_attribute. */
5377 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name
));
5378 *no_add_attrs
= true;
5384 /* Handle a "used" attribute; arguments as in
5385 struct attribute_spec.handler. */
5388 handle_used_attribute (node
, name
, args
, flags
, no_add_attrs
)
5391 tree args ATTRIBUTE_UNUSED
;
5392 int flags ATTRIBUTE_UNUSED
;
5395 if (TREE_CODE (*node
) == FUNCTION_DECL
)
5396 TREE_SYMBOL_REFERENCED (DECL_ASSEMBLER_NAME (*node
))
5397 = TREE_USED (*node
) = 1;
5400 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name
));
5401 *no_add_attrs
= true;
5407 /* Handle a "unused" attribute; arguments as in
5408 struct attribute_spec.handler. */
5411 handle_unused_attribute (node
, name
, args
, flags
, no_add_attrs
)
5414 tree args ATTRIBUTE_UNUSED
;
5422 if (TREE_CODE (decl
) == PARM_DECL
5423 || TREE_CODE (decl
) == VAR_DECL
5424 || TREE_CODE (decl
) == FUNCTION_DECL
5425 || TREE_CODE (decl
) == LABEL_DECL
5426 || TREE_CODE (decl
) == TYPE_DECL
)
5427 TREE_USED (decl
) = 1;
5430 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name
));
5431 *no_add_attrs
= true;
5436 if (!(flags
& (int) ATTR_FLAG_TYPE_IN_PLACE
))
5437 *node
= build_type_copy (*node
);
5438 TREE_USED (*node
) = 1;
5444 /* Handle a "const" attribute; arguments as in
5445 struct attribute_spec.handler. */
5448 handle_const_attribute (node
, name
, args
, flags
, no_add_attrs
)
5451 tree args ATTRIBUTE_UNUSED
;
5452 int flags ATTRIBUTE_UNUSED
;
5455 tree type
= TREE_TYPE (*node
);
5457 /* See FIXME comment on noreturn in c_common_attribute_table. */
5458 if (TREE_CODE (*node
) == FUNCTION_DECL
)
5459 TREE_READONLY (*node
) = 1;
5460 else if (TREE_CODE (type
) == POINTER_TYPE
5461 && TREE_CODE (TREE_TYPE (type
)) == FUNCTION_TYPE
)
5463 = build_pointer_type
5464 (build_type_variant (TREE_TYPE (type
), 1,
5465 TREE_THIS_VOLATILE (TREE_TYPE (type
))));
5468 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name
));
5469 *no_add_attrs
= true;
5475 /* Handle a "transparent_union" attribute; arguments as in
5476 struct attribute_spec.handler. */
5479 handle_transparent_union_attribute (node
, name
, args
, flags
, no_add_attrs
)
5482 tree args ATTRIBUTE_UNUSED
;
5486 tree decl
= NULL_TREE
;
5493 type
= &TREE_TYPE (decl
);
5494 is_type
= TREE_CODE (*node
) == TYPE_DECL
;
5496 else if (TYPE_P (*node
))
5497 type
= node
, is_type
= 1;
5500 && TREE_CODE (*type
) == UNION_TYPE
5502 || (TYPE_FIELDS (*type
) != 0
5503 && TYPE_MODE (*type
) == DECL_MODE (TYPE_FIELDS (*type
)))))
5505 if (!(flags
& (int) ATTR_FLAG_TYPE_IN_PLACE
))
5506 *type
= build_type_copy (*type
);
5507 TYPE_TRANSPARENT_UNION (*type
) = 1;
5509 else if (decl
!= 0 && TREE_CODE (decl
) == PARM_DECL
5510 && TREE_CODE (*type
) == UNION_TYPE
5511 && TYPE_MODE (*type
) == DECL_MODE (TYPE_FIELDS (*type
)))
5512 DECL_TRANSPARENT_UNION (decl
) = 1;
5515 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name
));
5516 *no_add_attrs
= true;
5522 /* Handle a "constructor" attribute; arguments as in
5523 struct attribute_spec.handler. */
5526 handle_constructor_attribute (node
, name
, args
, flags
, no_add_attrs
)
5529 tree args ATTRIBUTE_UNUSED
;
5530 int flags ATTRIBUTE_UNUSED
;
5534 tree type
= TREE_TYPE (decl
);
5536 if (TREE_CODE (decl
) == FUNCTION_DECL
5537 && TREE_CODE (type
) == FUNCTION_TYPE
5538 && decl_function_context (decl
) == 0)
5540 DECL_STATIC_CONSTRUCTOR (decl
) = 1;
5541 TREE_USED (decl
) = 1;
5545 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name
));
5546 *no_add_attrs
= true;
5552 /* Handle a "destructor" attribute; arguments as in
5553 struct attribute_spec.handler. */
5556 handle_destructor_attribute (node
, name
, args
, flags
, no_add_attrs
)
5559 tree args ATTRIBUTE_UNUSED
;
5560 int flags ATTRIBUTE_UNUSED
;
5564 tree type
= TREE_TYPE (decl
);
5566 if (TREE_CODE (decl
) == FUNCTION_DECL
5567 && TREE_CODE (type
) == FUNCTION_TYPE
5568 && decl_function_context (decl
) == 0)
5570 DECL_STATIC_DESTRUCTOR (decl
) = 1;
5571 TREE_USED (decl
) = 1;
5575 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name
));
5576 *no_add_attrs
= true;
5582 /* Handle a "mode" attribute; arguments as in
5583 struct attribute_spec.handler. */
5586 handle_mode_attribute (node
, name
, args
, flags
, no_add_attrs
)
5590 int flags ATTRIBUTE_UNUSED
;
5595 *no_add_attrs
= true;
5597 if (TREE_CODE (TREE_VALUE (args
)) != IDENTIFIER_NODE
)
5598 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name
));
5602 const char *p
= IDENTIFIER_POINTER (TREE_VALUE (args
));
5603 int len
= strlen (p
);
5604 enum machine_mode mode
= VOIDmode
;
5608 if (len
> 4 && p
[0] == '_' && p
[1] == '_'
5609 && p
[len
- 1] == '_' && p
[len
- 2] == '_')
5611 char *newp
= (char *) alloca (len
- 1);
5613 strcpy (newp
, &p
[2]);
5614 newp
[len
- 4] = '\0';
5618 /* Change this type to have a type with the specified mode.
5619 First check for the special modes. */
5620 if (! strcmp (p
, "byte"))
5622 else if (!strcmp (p
, "word"))
5624 else if (! strcmp (p
, "pointer"))
5627 for (j
= 0; j
< NUM_MACHINE_MODES
; j
++)
5628 if (!strcmp (p
, GET_MODE_NAME (j
)))
5629 mode
= (enum machine_mode
) j
;
5631 if (mode
== VOIDmode
)
5632 error ("unknown machine mode `%s'", p
);
5633 else if (0 == (typefm
= (*lang_hooks
.types
.type_for_mode
)
5634 (mode
, TREE_UNSIGNED (type
))))
5635 error ("no data type for mode `%s'", p
);
5636 else if ((TREE_CODE (type
) == POINTER_TYPE
5637 || TREE_CODE (type
) == REFERENCE_TYPE
)
5638 && !(*targetm
.valid_pointer_mode
) (mode
))
5639 error ("invalid pointer mode `%s'", p
);
5642 /* If this is a vector, make sure we either have hardware
5643 support, or we can emulate it. */
5644 if ((GET_MODE_CLASS (mode
) == MODE_VECTOR_INT
5645 || GET_MODE_CLASS (mode
) == MODE_VECTOR_FLOAT
)
5646 && !vector_mode_valid_p (mode
))
5648 error ("unable to emulate '%s'", GET_MODE_NAME (mode
));
5652 if (TREE_CODE (type
) == POINTER_TYPE
)
5654 ptr_type
= build_pointer_type_for_mode (TREE_TYPE (type
),
5658 else if (TREE_CODE (type
) == REFERENCE_TYPE
)
5660 ptr_type
= build_reference_type_for_mode (TREE_TYPE (type
),
5666 /* No need to layout the type here. The caller should do this. */
5673 /* Handle a "section" attribute; arguments as in
5674 struct attribute_spec.handler. */
5677 handle_section_attribute (node
, name
, args
, flags
, no_add_attrs
)
5679 tree name ATTRIBUTE_UNUSED
;
5681 int flags ATTRIBUTE_UNUSED
;
5686 if (targetm
.have_named_sections
)
5688 if ((TREE_CODE (decl
) == FUNCTION_DECL
5689 || TREE_CODE (decl
) == VAR_DECL
)
5690 && TREE_CODE (TREE_VALUE (args
)) == STRING_CST
)
5692 if (TREE_CODE (decl
) == VAR_DECL
5693 && current_function_decl
!= NULL_TREE
5694 && ! TREE_STATIC (decl
))
5696 error_with_decl (decl
,
5697 "section attribute cannot be specified for local variables");
5698 *no_add_attrs
= true;
5701 /* The decl may have already been given a section attribute
5702 from a previous declaration. Ensure they match. */
5703 else if (DECL_SECTION_NAME (decl
) != NULL_TREE
5704 && strcmp (TREE_STRING_POINTER (DECL_SECTION_NAME (decl
)),
5705 TREE_STRING_POINTER (TREE_VALUE (args
))) != 0)
5707 error_with_decl (*node
,
5708 "section of `%s' conflicts with previous declaration");
5709 *no_add_attrs
= true;
5712 DECL_SECTION_NAME (decl
) = TREE_VALUE (args
);
5716 error_with_decl (*node
,
5717 "section attribute not allowed for `%s'");
5718 *no_add_attrs
= true;
5723 error_with_decl (*node
,
5724 "section attributes are not supported for this target");
5725 *no_add_attrs
= true;
5731 /* Handle a "aligned" attribute; arguments as in
5732 struct attribute_spec.handler. */
5735 handle_aligned_attribute (node
, name
, args
, flags
, no_add_attrs
)
5737 tree name ATTRIBUTE_UNUSED
;
5742 tree decl
= NULL_TREE
;
5745 tree align_expr
= (args
? TREE_VALUE (args
)
5746 : size_int (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
));
5752 type
= &TREE_TYPE (decl
);
5753 is_type
= TREE_CODE (*node
) == TYPE_DECL
;
5755 else if (TYPE_P (*node
))
5756 type
= node
, is_type
= 1;
5758 /* Strip any NOPs of any kind. */
5759 while (TREE_CODE (align_expr
) == NOP_EXPR
5760 || TREE_CODE (align_expr
) == CONVERT_EXPR
5761 || TREE_CODE (align_expr
) == NON_LVALUE_EXPR
)
5762 align_expr
= TREE_OPERAND (align_expr
, 0);
5764 if (TREE_CODE (align_expr
) != INTEGER_CST
)
5766 error ("requested alignment is not a constant");
5767 *no_add_attrs
= true;
5769 else if ((i
= tree_log2 (align_expr
)) == -1)
5771 error ("requested alignment is not a power of 2");
5772 *no_add_attrs
= true;
5774 else if (i
> HOST_BITS_PER_INT
- 2)
5776 error ("requested alignment is too large");
5777 *no_add_attrs
= true;
5781 /* If we have a TYPE_DECL, then copy the type, so that we
5782 don't accidentally modify a builtin type. See pushdecl. */
5783 if (decl
&& TREE_TYPE (decl
) != error_mark_node
5784 && DECL_ORIGINAL_TYPE (decl
) == NULL_TREE
)
5786 tree tt
= TREE_TYPE (decl
);
5787 *type
= build_type_copy (*type
);
5788 DECL_ORIGINAL_TYPE (decl
) = tt
;
5789 TYPE_NAME (*type
) = decl
;
5790 TREE_USED (*type
) = TREE_USED (decl
);
5791 TREE_TYPE (decl
) = *type
;
5793 else if (!(flags
& (int) ATTR_FLAG_TYPE_IN_PLACE
))
5794 *type
= build_type_copy (*type
);
5796 TYPE_ALIGN (*type
) = (1 << i
) * BITS_PER_UNIT
;
5797 TYPE_USER_ALIGN (*type
) = 1;
5799 else if (TREE_CODE (decl
) != VAR_DECL
5800 && TREE_CODE (decl
) != FIELD_DECL
)
5802 error_with_decl (decl
,
5803 "alignment may not be specified for `%s'");
5804 *no_add_attrs
= true;
5808 DECL_ALIGN (decl
) = (1 << i
) * BITS_PER_UNIT
;
5809 DECL_USER_ALIGN (decl
) = 1;
5815 /* Handle a "weak" attribute; arguments as in
5816 struct attribute_spec.handler. */
5819 handle_weak_attribute (node
, name
, args
, flags
, no_add_attrs
)
5821 tree name ATTRIBUTE_UNUSED
;
5822 tree args ATTRIBUTE_UNUSED
;
5823 int flags ATTRIBUTE_UNUSED
;
5824 bool *no_add_attrs ATTRIBUTE_UNUSED
;
5826 declare_weak (*node
);
5831 /* Handle an "alias" attribute; arguments as in
5832 struct attribute_spec.handler. */
5835 handle_alias_attribute (node
, name
, args
, flags
, no_add_attrs
)
5839 int flags ATTRIBUTE_UNUSED
;
5844 if ((TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_INITIAL (decl
))
5845 || (TREE_CODE (decl
) != FUNCTION_DECL
&& ! DECL_EXTERNAL (decl
)))
5847 error_with_decl (decl
,
5848 "`%s' defined both normally and as an alias");
5849 *no_add_attrs
= true;
5851 else if (decl_function_context (decl
) == 0)
5855 id
= TREE_VALUE (args
);
5856 if (TREE_CODE (id
) != STRING_CST
)
5858 error ("alias arg not a string");
5859 *no_add_attrs
= true;
5862 id
= get_identifier (TREE_STRING_POINTER (id
));
5863 /* This counts as a use of the object pointed to. */
5866 if (TREE_CODE (decl
) == FUNCTION_DECL
)
5867 DECL_INITIAL (decl
) = error_mark_node
;
5869 DECL_EXTERNAL (decl
) = 0;
5873 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name
));
5874 *no_add_attrs
= true;
5880 /* Handle an "visibility" attribute; arguments as in
5881 struct attribute_spec.handler. */
5884 handle_visibility_attribute (node
, name
, args
, flags
, no_add_attrs
)
5888 int flags ATTRIBUTE_UNUSED
;
5893 if (decl_function_context (decl
) != 0 || ! TREE_PUBLIC (decl
))
5895 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name
));
5896 *no_add_attrs
= true;
5902 id
= TREE_VALUE (args
);
5903 if (TREE_CODE (id
) != STRING_CST
)
5905 error ("visibility arg not a string");
5906 *no_add_attrs
= true;
5909 if (strcmp (TREE_STRING_POINTER (id
), "hidden")
5910 && strcmp (TREE_STRING_POINTER (id
), "protected")
5911 && strcmp (TREE_STRING_POINTER (id
), "internal")
5912 && strcmp (TREE_STRING_POINTER (id
), "default"))
5914 error ("visibility arg must be one of \"default\", \"hidden\", \"protected\" or \"internal\"");
5915 *no_add_attrs
= true;
5923 /* Handle an "tls_model" attribute; arguments as in
5924 struct attribute_spec.handler. */
5927 handle_tls_model_attribute (node
, name
, args
, flags
, no_add_attrs
)
5931 int flags ATTRIBUTE_UNUSED
;
5936 if (! DECL_THREAD_LOCAL (decl
))
5938 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name
));
5939 *no_add_attrs
= true;
5945 id
= TREE_VALUE (args
);
5946 if (TREE_CODE (id
) != STRING_CST
)
5948 error ("tls_model arg not a string");
5949 *no_add_attrs
= true;
5952 if (strcmp (TREE_STRING_POINTER (id
), "local-exec")
5953 && strcmp (TREE_STRING_POINTER (id
), "initial-exec")
5954 && strcmp (TREE_STRING_POINTER (id
), "local-dynamic")
5955 && strcmp (TREE_STRING_POINTER (id
), "global-dynamic"))
5957 error ("tls_model arg must be one of \"local-exec\", \"initial-exec\", \"local-dynamic\" or \"global-dynamic\"");
5958 *no_add_attrs
= true;
5966 /* Handle a "no_instrument_function" attribute; arguments as in
5967 struct attribute_spec.handler. */
5970 handle_no_instrument_function_attribute (node
, name
, args
, flags
, no_add_attrs
)
5973 tree args ATTRIBUTE_UNUSED
;
5974 int flags ATTRIBUTE_UNUSED
;
5979 if (TREE_CODE (decl
) != FUNCTION_DECL
)
5981 error_with_decl (decl
,
5982 "`%s' attribute applies only to functions",
5983 IDENTIFIER_POINTER (name
));
5984 *no_add_attrs
= true;
5986 else if (DECL_INITIAL (decl
))
5988 error_with_decl (decl
,
5989 "can't set `%s' attribute after definition",
5990 IDENTIFIER_POINTER (name
));
5991 *no_add_attrs
= true;
5994 DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (decl
) = 1;
5999 /* Handle a "malloc" attribute; arguments as in
6000 struct attribute_spec.handler. */
6003 handle_malloc_attribute (node
, name
, args
, flags
, no_add_attrs
)
6006 tree args ATTRIBUTE_UNUSED
;
6007 int flags ATTRIBUTE_UNUSED
;
6010 if (TREE_CODE (*node
) == FUNCTION_DECL
)
6011 DECL_IS_MALLOC (*node
) = 1;
6012 /* ??? TODO: Support types. */
6015 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name
));
6016 *no_add_attrs
= true;
6022 /* Handle a "no_limit_stack" attribute; arguments as in
6023 struct attribute_spec.handler. */
6026 handle_no_limit_stack_attribute (node
, name
, args
, flags
, no_add_attrs
)
6029 tree args ATTRIBUTE_UNUSED
;
6030 int flags ATTRIBUTE_UNUSED
;
6035 if (TREE_CODE (decl
) != FUNCTION_DECL
)
6037 error_with_decl (decl
,
6038 "`%s' attribute applies only to functions",
6039 IDENTIFIER_POINTER (name
));
6040 *no_add_attrs
= true;
6042 else if (DECL_INITIAL (decl
))
6044 error_with_decl (decl
,
6045 "can't set `%s' attribute after definition",
6046 IDENTIFIER_POINTER (name
));
6047 *no_add_attrs
= true;
6050 DECL_NO_LIMIT_STACK (decl
) = 1;
6055 /* Handle a "pure" attribute; arguments as in
6056 struct attribute_spec.handler. */
6059 handle_pure_attribute (node
, name
, args
, flags
, no_add_attrs
)
6062 tree args ATTRIBUTE_UNUSED
;
6063 int flags ATTRIBUTE_UNUSED
;
6066 if (TREE_CODE (*node
) == FUNCTION_DECL
)
6067 DECL_IS_PURE (*node
) = 1;
6068 /* ??? TODO: Support types. */
6071 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name
));
6072 *no_add_attrs
= true;
6078 /* Handle a "deprecated" attribute; arguments as in
6079 struct attribute_spec.handler. */
6082 handle_deprecated_attribute (node
, name
, args
, flags
, no_add_attrs
)
6085 tree args ATTRIBUTE_UNUSED
;
6089 tree type
= NULL_TREE
;
6091 const char *what
= NULL
;
6096 type
= TREE_TYPE (decl
);
6098 if (TREE_CODE (decl
) == TYPE_DECL
6099 || TREE_CODE (decl
) == PARM_DECL
6100 || TREE_CODE (decl
) == VAR_DECL
6101 || TREE_CODE (decl
) == FUNCTION_DECL
6102 || TREE_CODE (decl
) == FIELD_DECL
)
6103 TREE_DEPRECATED (decl
) = 1;
6107 else if (TYPE_P (*node
))
6109 if (!(flags
& (int) ATTR_FLAG_TYPE_IN_PLACE
))
6110 *node
= build_type_copy (*node
);
6111 TREE_DEPRECATED (*node
) = 1;
6119 *no_add_attrs
= true;
6120 if (type
&& TYPE_NAME (type
))
6122 if (TREE_CODE (TYPE_NAME (type
)) == IDENTIFIER_NODE
)
6123 what
= IDENTIFIER_POINTER (TYPE_NAME (*node
));
6124 else if (TREE_CODE (TYPE_NAME (type
)) == TYPE_DECL
6125 && DECL_NAME (TYPE_NAME (type
)))
6126 what
= IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (type
)));
6129 warning ("`%s' attribute ignored for `%s'",
6130 IDENTIFIER_POINTER (name
), what
);
6132 warning ("`%s' attribute ignored",
6133 IDENTIFIER_POINTER (name
));
6139 /* Keep a list of vector type nodes we created in handle_vector_size_attribute,
6140 to prevent us from duplicating type nodes unnecessarily.
6141 The normal mechanism to prevent duplicates is to use type_hash_canon, but
6142 since we want to distinguish types that are essentially identical (except
6143 for their debug representation), we use a local list here. */
6144 static GTY(()) tree vector_type_node_list
= 0;
6146 /* Handle a "vector_size" attribute; arguments as in
6147 struct attribute_spec.handler. */
6150 handle_vector_size_attribute (node
, name
, args
, flags
, no_add_attrs
)
6154 int flags ATTRIBUTE_UNUSED
;
6157 unsigned HOST_WIDE_INT vecsize
, nunits
;
6158 enum machine_mode mode
, orig_mode
, new_mode
;
6159 tree type
= *node
, new_type
= NULL_TREE
;
6160 tree type_list_node
;
6162 *no_add_attrs
= true;
6164 if (! host_integerp (TREE_VALUE (args
), 1))
6166 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name
));
6170 /* Get the vector size (in bytes). */
6171 vecsize
= tree_low_cst (TREE_VALUE (args
), 1);
6173 /* We need to provide for vector pointers, vector arrays, and
6174 functions returning vectors. For example:
6176 __attribute__((vector_size(16))) short *foo;
6178 In this case, the mode is SI, but the type being modified is
6179 HI, so we need to look further. */
6181 while (POINTER_TYPE_P (type
)
6182 || TREE_CODE (type
) == FUNCTION_TYPE
6183 || TREE_CODE (type
) == ARRAY_TYPE
)
6184 type
= TREE_TYPE (type
);
6186 /* Get the mode of the type being modified. */
6187 orig_mode
= TYPE_MODE (type
);
6189 if (TREE_CODE (type
) == RECORD_TYPE
6190 || (GET_MODE_CLASS (orig_mode
) != MODE_FLOAT
6191 && GET_MODE_CLASS (orig_mode
) != MODE_INT
)
6192 || ! host_integerp (TYPE_SIZE_UNIT (type
), 1))
6194 error ("invalid vector type for attribute `%s'",
6195 IDENTIFIER_POINTER (name
));
6199 /* Calculate how many units fit in the vector. */
6200 nunits
= vecsize
/ tree_low_cst (TYPE_SIZE_UNIT (type
), 1);
6202 /* Find a suitably sized vector. */
6203 new_mode
= VOIDmode
;
6204 for (mode
= GET_CLASS_NARROWEST_MODE (GET_MODE_CLASS (orig_mode
) == MODE_INT
6206 : MODE_VECTOR_FLOAT
);
6208 mode
= GET_MODE_WIDER_MODE (mode
))
6209 if (vecsize
== GET_MODE_SIZE (mode
)
6210 && nunits
== (unsigned HOST_WIDE_INT
) GET_MODE_NUNITS (mode
))
6216 if (new_mode
== VOIDmode
)
6218 error ("no vector mode with the size and type specified could be found");
6222 for (type_list_node
= vector_type_node_list
; type_list_node
;
6223 type_list_node
= TREE_CHAIN (type_list_node
))
6225 tree other_type
= TREE_VALUE (type_list_node
);
6226 tree record
= TYPE_DEBUG_REPRESENTATION_TYPE (other_type
);
6227 tree fields
= TYPE_FIELDS (record
);
6228 tree field_type
= TREE_TYPE (fields
);
6229 tree array_type
= TREE_TYPE (field_type
);
6230 if (TREE_CODE (fields
) != FIELD_DECL
6231 || TREE_CODE (field_type
) != ARRAY_TYPE
)
6234 if (TYPE_MODE (other_type
) == mode
&& type
== array_type
)
6236 new_type
= other_type
;
6241 if (new_type
== NULL_TREE
)
6243 tree index
, array
, rt
, list_node
;
6245 new_type
= (*lang_hooks
.types
.type_for_mode
) (new_mode
,
6246 TREE_UNSIGNED (type
));
6250 error ("no vector mode with the size and type specified could be found");
6254 new_type
= build_type_copy (new_type
);
6256 /* If this is a vector, make sure we either have hardware
6257 support, or we can emulate it. */
6258 if ((GET_MODE_CLASS (mode
) == MODE_VECTOR_INT
6259 || GET_MODE_CLASS (mode
) == MODE_VECTOR_FLOAT
)
6260 && !vector_mode_valid_p (mode
))
6262 error ("unable to emulate '%s'", GET_MODE_NAME (mode
));
6266 /* Set the debug information here, because this is the only
6267 place where we know the underlying type for a vector made
6268 with vector_size. For debugging purposes we pretend a vector
6269 is an array within a structure. */
6270 index
= build_int_2 (TYPE_VECTOR_SUBPARTS (new_type
) - 1, 0);
6271 array
= build_array_type (type
, build_index_type (index
));
6272 rt
= make_node (RECORD_TYPE
);
6274 TYPE_FIELDS (rt
) = build_decl (FIELD_DECL
, get_identifier ("f"), array
);
6275 DECL_CONTEXT (TYPE_FIELDS (rt
)) = rt
;
6277 TYPE_DEBUG_REPRESENTATION_TYPE (new_type
) = rt
;
6279 list_node
= build_tree_list (NULL
, new_type
);
6280 TREE_CHAIN (list_node
) = vector_type_node_list
;
6281 vector_type_node_list
= list_node
;
6284 /* Build back pointers if needed. */
6285 *node
= vector_size_helper (*node
, new_type
);
6290 /* HACK. GROSS. This is absolutely disgusting. I wish there was a
6293 If we requested a pointer to a vector, build up the pointers that
6294 we stripped off while looking for the inner type. Similarly for
6295 return values from functions.
6297 The argument "type" is the top of the chain, and "bottom" is the
6298 new type which we will point to. */
6301 vector_size_helper (type
, bottom
)
6306 if (POINTER_TYPE_P (type
))
6308 inner
= vector_size_helper (TREE_TYPE (type
), bottom
);
6309 outer
= build_pointer_type (inner
);
6311 else if (TREE_CODE (type
) == ARRAY_TYPE
)
6313 inner
= vector_size_helper (TREE_TYPE (type
), bottom
);
6314 outer
= build_array_type (inner
, TYPE_VALUES (type
));
6316 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
6318 inner
= vector_size_helper (TREE_TYPE (type
), bottom
);
6319 outer
= build_function_type (inner
, TYPE_VALUES (type
));
6324 TREE_READONLY (outer
) = TREE_READONLY (type
);
6325 TREE_THIS_VOLATILE (outer
) = TREE_THIS_VOLATILE (type
);
6330 /* Handle the "nonnull" attribute. */
6332 handle_nonnull_attribute (node
, name
, args
, flags
, no_add_attrs
)
6334 tree name ATTRIBUTE_UNUSED
;
6336 int flags ATTRIBUTE_UNUSED
;
6340 unsigned HOST_WIDE_INT attr_arg_num
;
6342 /* If no arguments are specified, all pointer arguments should be
6343 non-null. Veryify a full prototype is given so that the arguments
6344 will have the correct types when we actually check them later. */
6347 if (! TYPE_ARG_TYPES (type
))
6349 error ("nonnull attribute without arguments on a non-prototype");
6350 *no_add_attrs
= true;
6355 /* Argument list specified. Verify that each argument number references
6356 a pointer argument. */
6357 for (attr_arg_num
= 1; args
; args
= TREE_CHAIN (args
))
6360 unsigned HOST_WIDE_INT arg_num
, ck_num
;
6362 if (! get_nonnull_operand (TREE_VALUE (args
), &arg_num
))
6364 error ("nonnull argument has invalid operand number (arg %lu)",
6365 (unsigned long) attr_arg_num
);
6366 *no_add_attrs
= true;
6370 argument
= TYPE_ARG_TYPES (type
);
6373 for (ck_num
= 1; ; ck_num
++)
6375 if (! argument
|| ck_num
== arg_num
)
6377 argument
= TREE_CHAIN (argument
);
6381 || TREE_CODE (TREE_VALUE (argument
)) == VOID_TYPE
)
6383 error ("nonnull argument with out-of-range operand number (arg %lu, operand %lu)",
6384 (unsigned long) attr_arg_num
, (unsigned long) arg_num
);
6385 *no_add_attrs
= true;
6389 if (TREE_CODE (TREE_VALUE (argument
)) != POINTER_TYPE
)
6391 error ("nonnull argument references non-pointer operand (arg %lu, operand %lu)",
6392 (unsigned long) attr_arg_num
, (unsigned long) arg_num
);
6393 *no_add_attrs
= true;
6402 /* Check the argument list of a function call for null in argument slots
6403 that are marked as requiring a non-null pointer argument. */
6406 check_function_nonnull (attrs
, params
)
6410 tree a
, args
, param
;
6413 for (a
= attrs
; a
; a
= TREE_CHAIN (a
))
6415 if (is_attribute_p ("nonnull", TREE_PURPOSE (a
)))
6417 args
= TREE_VALUE (a
);
6419 /* Walk the argument list. If we encounter an argument number we
6420 should check for non-null, do it. If the attribute has no args,
6421 then every pointer argument is checked (in which case the check
6422 for pointer type is done in check_nonnull_arg). */
6423 for (param
= params
, param_num
= 1; ;
6424 param_num
++, param
= TREE_CHAIN (param
))
6428 if (! args
|| nonnull_check_p (args
, param_num
))
6429 check_function_arguments_recurse (check_nonnull_arg
, NULL
,
6437 /* Helper for check_function_nonnull; given a list of operands which
6438 must be non-null in ARGS, determine if operand PARAM_NUM should be
6442 nonnull_check_p (args
, param_num
)
6444 unsigned HOST_WIDE_INT param_num
;
6446 unsigned HOST_WIDE_INT arg_num
;
6448 for (; args
; args
= TREE_CHAIN (args
))
6450 if (! get_nonnull_operand (TREE_VALUE (args
), &arg_num
))
6453 if (arg_num
== param_num
)
6459 /* Check that the function argument PARAM (which is operand number
6460 PARAM_NUM) is non-null. This is called by check_function_nonnull
6461 via check_function_arguments_recurse. */
6464 check_nonnull_arg (ctx
, param
, param_num
)
6465 void *ctx ATTRIBUTE_UNUSED
;
6467 unsigned HOST_WIDE_INT param_num
;
6469 /* Just skip checking the argument if it's not a pointer. This can
6470 happen if the "nonnull" attribute was given without an operand
6471 list (which means to check every pointer argument). */
6473 if (TREE_CODE (TREE_TYPE (param
)) != POINTER_TYPE
)
6476 if (integer_zerop (param
))
6477 warning ("null argument where non-null required (arg %lu)",
6478 (unsigned long) param_num
);
6481 /* Helper for nonnull attribute handling; fetch the operand number
6482 from the attribute argument list. */
6485 get_nonnull_operand (arg_num_expr
, valp
)
6487 unsigned HOST_WIDE_INT
*valp
;
6489 /* Strip any conversions from the arg number and verify they
6491 while (TREE_CODE (arg_num_expr
) == NOP_EXPR
6492 || TREE_CODE (arg_num_expr
) == CONVERT_EXPR
6493 || TREE_CODE (arg_num_expr
) == NON_LVALUE_EXPR
)
6494 arg_num_expr
= TREE_OPERAND (arg_num_expr
, 0);
6496 if (TREE_CODE (arg_num_expr
) != INTEGER_CST
6497 || TREE_INT_CST_HIGH (arg_num_expr
) != 0)
6500 *valp
= TREE_INT_CST_LOW (arg_num_expr
);
6504 /* Handle a "nothrow" attribute; arguments as in
6505 struct attribute_spec.handler. */
6508 handle_nothrow_attribute (node
, name
, args
, flags
, no_add_attrs
)
6511 tree args ATTRIBUTE_UNUSED
;
6512 int flags ATTRIBUTE_UNUSED
;
6515 if (TREE_CODE (*node
) == FUNCTION_DECL
)
6516 TREE_NOTHROW (*node
) = 1;
6517 /* ??? TODO: Support types. */
6520 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name
));
6521 *no_add_attrs
= true;
6527 /* Check for valid arguments being passed to a function. */
6529 check_function_arguments (attrs
, params
)
6533 /* Check for null being passed in a pointer argument that must be
6534 non-null. We also need to do this if format checking is enabled. */
6537 check_function_nonnull (attrs
, params
);
6539 /* Check for errors in format strings. */
6542 check_function_format (NULL
, attrs
, params
);
6545 /* Generic argument checking recursion routine. PARAM is the argument to
6546 be checked. PARAM_NUM is the number of the argument. CALLBACK is invoked
6547 once the argument is resolved. CTX is context for the callback. */
6549 check_function_arguments_recurse (callback
, ctx
, param
, param_num
)
6550 void (*callback
) PARAMS ((void *, tree
, unsigned HOST_WIDE_INT
));
6553 unsigned HOST_WIDE_INT param_num
;
6555 if (TREE_CODE (param
) == NOP_EXPR
)
6557 /* Strip coercion. */
6558 check_function_arguments_recurse (callback
, ctx
,
6559 TREE_OPERAND (param
, 0), param_num
);
6563 if (TREE_CODE (param
) == CALL_EXPR
)
6565 tree type
= TREE_TYPE (TREE_TYPE (TREE_OPERAND (param
, 0)));
6567 bool found_format_arg
= false;
6569 /* See if this is a call to a known internationalization function
6570 that modifies a format arg. Such a function may have multiple
6571 format_arg attributes (for example, ngettext). */
6573 for (attrs
= TYPE_ATTRIBUTES (type
);
6575 attrs
= TREE_CHAIN (attrs
))
6576 if (is_attribute_p ("format_arg", TREE_PURPOSE (attrs
)))
6579 tree format_num_expr
;
6583 /* Extract the argument number, which was previously checked
6585 format_num_expr
= TREE_VALUE (TREE_VALUE (attrs
));
6586 while (TREE_CODE (format_num_expr
) == NOP_EXPR
6587 || TREE_CODE (format_num_expr
) == CONVERT_EXPR
6588 || TREE_CODE (format_num_expr
) == NON_LVALUE_EXPR
)
6589 format_num_expr
= TREE_OPERAND (format_num_expr
, 0);
6591 if (TREE_CODE (format_num_expr
) != INTEGER_CST
6592 || TREE_INT_CST_HIGH (format_num_expr
) != 0)
6595 format_num
= TREE_INT_CST_LOW (format_num_expr
);
6597 for (inner_args
= TREE_OPERAND (param
, 1), i
= 1;
6599 inner_args
= TREE_CHAIN (inner_args
), i
++)
6600 if (i
== format_num
)
6602 check_function_arguments_recurse (callback
, ctx
,
6603 TREE_VALUE (inner_args
),
6605 found_format_arg
= true;
6610 /* If we found a format_arg attribute and did a recursive check,
6611 we are done with checking this argument. Otherwise, we continue
6612 and this will be considered a non-literal. */
6613 if (found_format_arg
)
6617 if (TREE_CODE (param
) == COND_EXPR
)
6619 /* Check both halves of the conditional expression. */
6620 check_function_arguments_recurse (callback
, ctx
,
6621 TREE_OPERAND (param
, 1), param_num
);
6622 check_function_arguments_recurse (callback
, ctx
,
6623 TREE_OPERAND (param
, 2), param_num
);
6627 (*callback
) (ctx
, param
, param_num
);
6630 #include "gt-c-common.h"