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, 2003 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 "tree-inline.h"
46 cpp_reader *parse_in; /* Declared in c-pragma.h. */
48 /* We let tm.h override the types used here, to handle trivial differences
49 such as the choice of unsigned int or long unsigned int for size_t.
50 When machines start needing nontrivial differences in the size type,
51 it would be best to do something here to figure out automatically
52 from other information what type to use. */
55 #define SIZE_TYPE "long unsigned int"
59 #define WCHAR_TYPE "int"
62 /* WCHAR_TYPE gets overridden by -fshort-wchar. */
63 #define MODIFIED_WCHAR_TYPE \
64 (flag_short_wchar ? "short unsigned int" : WCHAR_TYPE)
67 #define PTRDIFF_TYPE "long int"
71 #define WINT_TYPE "unsigned int"
75 #define INTMAX_TYPE ((INT_TYPE_SIZE == LONG_LONG_TYPE_SIZE) \
77 : ((LONG_TYPE_SIZE == LONG_LONG_TYPE_SIZE) \
83 #define UINTMAX_TYPE ((INT_TYPE_SIZE == LONG_LONG_TYPE_SIZE) \
85 : ((LONG_TYPE_SIZE == LONG_LONG_TYPE_SIZE) \
86 ? "long unsigned int" \
87 : "long long unsigned int"))
90 /* The following symbols are subsumed in the c_global_trees array, and
91 listed here individually for documentation purposes.
93 INTEGER_TYPE and REAL_TYPE nodes for the standard data types.
95 tree short_integer_type_node;
96 tree long_integer_type_node;
97 tree long_long_integer_type_node;
99 tree short_unsigned_type_node;
100 tree long_unsigned_type_node;
101 tree long_long_unsigned_type_node;
103 tree truthvalue_type_node;
104 tree truthvalue_false_node;
105 tree truthvalue_true_node;
107 tree ptrdiff_type_node;
109 tree unsigned_char_type_node;
110 tree signed_char_type_node;
111 tree wchar_type_node;
112 tree signed_wchar_type_node;
113 tree unsigned_wchar_type_node;
115 tree float_type_node;
116 tree double_type_node;
117 tree long_double_type_node;
119 tree complex_integer_type_node;
120 tree complex_float_type_node;
121 tree complex_double_type_node;
122 tree complex_long_double_type_node;
124 tree intQI_type_node;
125 tree intHI_type_node;
126 tree intSI_type_node;
127 tree intDI_type_node;
128 tree intTI_type_node;
130 tree unsigned_intQI_type_node;
131 tree unsigned_intHI_type_node;
132 tree unsigned_intSI_type_node;
133 tree unsigned_intDI_type_node;
134 tree unsigned_intTI_type_node;
136 tree widest_integer_literal_type_node;
137 tree widest_unsigned_literal_type_node;
139 Nodes for types `void *' and `const void *'.
141 tree ptr_type_node, const_ptr_type_node;
143 Nodes for types `char *' and `const char *'.
145 tree string_type_node, const_string_type_node;
147 Type `char[SOMENUMBER]'.
148 Used when an array of char is needed and the size is irrelevant.
150 tree char_array_type_node;
152 Type `int[SOMENUMBER]' or something like it.
153 Used when an array of int needed and the size is irrelevant.
155 tree int_array_type_node;
157 Type `wchar_t[SOMENUMBER]' or something like it.
158 Used when a wide string literal is created.
160 tree wchar_array_type_node;
162 Type `int ()' -- used for implicit declaration of functions.
164 tree default_function_type;
166 A VOID_TYPE node, packaged in a TREE_LIST.
170 The lazily created VAR_DECLs for __FUNCTION__, __PRETTY_FUNCTION__,
171 and __func__. (C doesn't generate __FUNCTION__ and__PRETTY_FUNCTION__
172 VAR_DECLS, but C++ does.)
174 tree function_name_decl_node;
175 tree pretty_function_name_decl_node;
176 tree c99_function_name_decl_node;
178 Stack of nested function name VAR_DECLs.
180 tree saved_function_name_decls;
184 tree c_global_trees[CTI_MAX];
186 /* TRUE if a code represents a statement. The front end init
187 langhook should take care of initialization of this array. */
189 bool statement_code_p[MAX_TREE_CODES];
191 /* Nonzero if we can read a PCH file now. */
195 /* Switches common to the C front ends. */
197 /* Nonzero if prepreprocessing only. */
199 int flag_preprocess_only;
201 /* Nonzero means don't output line number information. */
203 char flag_no_line_commands;
205 /* Nonzero causes -E output not to be done, but directives such as
206 #define that have side effects are still obeyed. */
210 /* Nonzero means dump macros in some fashion. */
212 char flag_dump_macros;
214 /* Nonzero means pass #include lines through to the output. */
216 char flag_dump_includes;
218 /* The file name to which we should write a precompiled header, or
219 NULL if no header will be written in this compile. */
221 const char *pch_file;
223 /* Nonzero if an ISO standard was selected. It rejects macros in the
227 /* Nonzero if -undef was given. It suppresses target built-in macros
231 /* Nonzero means don't recognize the non-ANSI builtin functions. */
235 /* Nonzero means don't recognize the non-ANSI builtin functions.
238 int flag_no_nonansi_builtin;
240 /* Nonzero means give `double' the same size as `float'. */
242 int flag_short_double;
244 /* Nonzero means give `wchar_t' the same size as `short'. */
246 int flag_short_wchar;
248 /* Nonzero means allow Microsoft extensions without warnings or errors. */
249 int flag_ms_extensions;
251 /* Nonzero means don't recognize the keyword `asm'. */
255 /* Nonzero means give string constants the type `const char *', as mandated
258 int flag_const_strings;
260 /* Nonzero means to treat bitfields as signed unless they say `unsigned'. */
262 int flag_signed_bitfields = 1;
263 int explicit_flag_signed_bitfields;
265 /* Nonzero means warn about pointer casts that can drop a type qualifier
266 from the pointer target type. */
270 /* Warn about functions which might be candidates for format attributes. */
272 int warn_missing_format_attribute;
274 /* Nonzero means warn about sizeof(function) or addition/subtraction
275 of function pointers. */
277 int warn_pointer_arith;
279 /* Nonzero means warn for any global function def
280 without separate previous prototype decl. */
282 int warn_missing_prototypes;
284 /* Warn if adding () is suggested. */
286 int warn_parentheses;
288 /* Warn if initializer is not completely bracketed. */
290 int warn_missing_braces;
292 /* Warn about comparison of signed and unsigned values.
293 If -1, neither -Wsign-compare nor -Wno-sign-compare has been specified
294 (in which case -Wextra gets to decide). */
296 int warn_sign_compare = -1;
298 /* Nonzero means warn about usage of long long when `-pedantic'. */
300 int warn_long_long = 1;
302 /* Nonzero means warn about deprecated conversion from string constant to
305 int warn_write_strings;
307 /* Nonzero means warn about multiple (redundant) decls for the same single
308 variable or function. */
310 int warn_redundant_decls;
312 /* Warn about testing equality of floating point numbers. */
314 int warn_float_equal;
316 /* Warn about a subscript that has type char. */
318 int warn_char_subscripts;
320 /* Warn if a type conversion is done that might have confusing results. */
324 /* Warn about #pragma directives that are not recognized. */
326 int warn_unknown_pragmas; /* Tri state variable. */
328 /* Warn about format/argument anomalies in calls to formatted I/O functions
329 (*printf, *scanf, strftime, strfmon, etc.). */
333 /* Warn about Y2K problems with strftime formats. */
337 /* Warn about excess arguments to formats. */
339 int warn_format_extra_args;
341 /* Warn about zero-length formats. */
343 int warn_format_zero_length;
345 /* Warn about non-literal format arguments. */
347 int warn_format_nonliteral;
349 /* Warn about possible security problems with calls to format functions. */
351 int warn_format_security;
354 /* C/ObjC language option variables. */
357 /* Nonzero means message about use of implicit function declarations;
358 1 means warning; 2 means error. */
360 int mesg_implicit_function_declaration = -1;
362 /* Nonzero means allow type mismatches in conditional expressions;
363 just make their values `void'. */
365 int flag_cond_mismatch;
367 /* Nonzero means enable C89 Amendment 1 features. */
371 /* Nonzero means use the ISO C99 dialect of C. */
375 /* Nonzero means that we have builtin functions, and main is an int */
379 /* Nonzero means add default format_arg attributes for functions not
382 int flag_noniso_default_format_attributes = 1;
384 /* Nonzero means warn when casting a function call to a type that does
385 not match the return type (e.g. (float)sqrt() or (anything*)malloc()
386 when there is no previous declaration of sqrt or malloc. */
388 int warn_bad_function_cast;
390 /* Warn about traditional constructs whose meanings changed in ANSI C. */
392 int warn_traditional;
394 /* Nonzero means warn for non-prototype function decls
395 or non-prototyped defs without previous prototype. */
397 int warn_strict_prototypes;
399 /* Nonzero means warn for any global function def
400 without separate previous decl. */
402 int warn_missing_declarations;
404 /* Nonzero means warn about declarations of objects not at
405 file-scope level and about *all* declarations of functions (whether
406 or static) not at file-scope level. Note that we exclude
407 implicit function declarations. To get warnings about those, use
410 int warn_nested_externs;
412 /* Warn if main is suspicious. */
416 /* Nonzero means warn about possible violations of sequence point rules. */
418 int warn_sequence_point;
420 /* Nonzero means to warn about compile-time division by zero. */
421 int warn_div_by_zero = 1;
423 /* Nonzero means warn about use of implicit int. */
425 int warn_implicit_int;
427 /* Warn about NULL being passed to argument slots marked as requiring
433 /* ObjC language option variables. */
436 /* Open and close the file for outputting class declarations, if
439 int flag_gen_declaration;
441 /* Generate code for GNU or NeXT runtime environment. */
443 #ifdef NEXT_OBJC_RUNTIME
444 int flag_next_runtime = 1;
446 int flag_next_runtime = 0;
449 /* Tells the compiler that this is a special run. Do not perform any
450 compiling, instead we are to test some platform dependent features
451 and output a C header file with appropriate definitions. */
453 int print_struct_values;
455 /* ???. Undocumented. */
457 const char *constant_string_class_name;
459 /* Warn if multiple methods are seen for the same selector, but with
460 different argument types. Performs the check on the whole selector
461 table at the end of compilation. */
465 /* Warn if a @selector() is found, and no method with that selector
466 has been previously declared. The check is done on each
467 @selector() as soon as it is found - so it warns about forward
470 int warn_undeclared_selector;
472 /* Warn if methods required by a protocol are not implemented in the
473 class adopting it. When turned off, methods inherited to that
474 class are also considered implemented. */
476 int warn_protocol = 1;
479 /* C++ language option variables. */
482 /* Nonzero means don't recognize any extension keywords. */
484 int flag_no_gnu_keywords;
486 /* Nonzero means do emit exported implementations of functions even if
487 they can be inlined. */
489 int flag_implement_inlines = 1;
491 /* Nonzero means do emit exported implementations of templates, instead of
492 multiple static copies in each file that needs a definition. */
494 int flag_external_templates;
496 /* Nonzero means that the decision to emit or not emit the implementation of a
497 template depends on where the template is instantiated, rather than where
500 int flag_alt_external_templates;
502 /* Nonzero means that implicit instantiations will be emitted if needed. */
504 int flag_implicit_templates = 1;
506 /* Nonzero means that implicit instantiations of inline templates will be
507 emitted if needed, even if instantiations of non-inline templates
510 int flag_implicit_inline_templates = 1;
512 /* Nonzero means generate separate instantiation control files and
513 juggle them at link time. */
515 int flag_use_repository;
517 /* Nonzero if we want to issue diagnostics that the standard says are not
520 int flag_optional_diags = 1;
522 /* Nonzero means we should attempt to elide constructors when possible. */
524 int flag_elide_constructors = 1;
526 /* Nonzero means that member functions defined in class scope are
527 inline by default. */
529 int flag_default_inline = 1;
531 /* Controls whether compiler generates 'type descriptor' that give
532 run-time type information. */
536 /* Nonzero if we want to conserve space in the .o files. We do this
537 by putting uninitialized data and runtime initialized data into
538 .common instead of .data at the expense of not flagging multiple
541 int flag_conserve_space;
543 /* Nonzero if we want to obey access control semantics. */
545 int flag_access_control = 1;
547 /* Nonzero if we want to check the return value of new and avoid calling
548 constructors if it is a null pointer. */
552 /* Nonzero if we want the new ISO rules for pushing a new scope for `for'
553 initialization variables.
554 0: Old rules, set by -fno-for-scope.
555 2: New ISO rules, set by -ffor-scope.
556 1: Try to implement new ISO rules, but with backup compatibility
557 (and warnings). This is the default, for now. */
559 int flag_new_for_scope = 1;
561 /* Nonzero if we want to emit defined symbols with common-like linkage as
562 weak symbols where possible, in order to conform to C++ semantics.
563 Otherwise, emit them as local symbols. */
567 /* Nonzero to use __cxa_atexit, rather than atexit, to register
568 destructors for local statics and global objects. */
570 int flag_use_cxa_atexit = DEFAULT_USE_CXA_ATEXIT;
572 /* Nonzero means output .vtable_{entry,inherit} for use in doing vtable gc. */
576 /* Nonzero means make the default pedwarns warnings instead of errors.
577 The value of this flag is ignored if -pedantic is specified. */
581 /* Nonzero means to implement standard semantics for exception
582 specifications, calling unexpected if an exception is thrown that
583 doesn't match the specification. Zero means to treat them as
584 assertions and optimize accordingly, but not check them. */
586 int flag_enforce_eh_specs = 1;
588 /* The version of the C++ ABI in use. The following values are
591 0: The version of the ABI believed most conformant with the
592 C++ ABI specification. This ABI may change as bugs are
593 discovered and fixed. Therefore, 0 will not necessarily
594 indicate the same ABI in different versions of G++.
596 1: The version of the ABI first used in G++ 3.2.
598 Additional positive integers will be assigned as new versions of
599 the ABI become the default version of the ABI. */
601 int flag_abi_version = 1;
603 /* Nonzero means warn about things that will change when compiling
604 with an ABI-compliant compiler. */
608 /* Nonzero means warn about invalid uses of offsetof. */
610 int warn_invalid_offsetof = 1;
612 /* Nonzero means warn about implicit declarations. */
614 int warn_implicit = 1;
616 /* Nonzero means warn when all ctors or dtors are private, and the class
619 int warn_ctor_dtor_privacy = 0;
621 /* Nonzero means warn in function declared in derived class has the
622 same name as a virtual in the base class, but fails to match the
623 type signature of any virtual function in the base class. */
625 int warn_overloaded_virtual;
627 /* Nonzero means warn when declaring a class that has a non virtual
628 destructor, when it really ought to have a virtual one. */
632 /* Nonzero means warn when the compiler will reorder code. */
636 /* Nonzero means warn when synthesis behavior differs from Cfront's. */
640 /* Nonzero means warn when we convert a pointer to member function
641 into a pointer to (void or function). */
643 int warn_pmf2ptr = 1;
645 /* Nonzero means warn about violation of some Effective C++ style rules. */
649 /* Nonzero means warn where overload resolution chooses a promotion from
650 unsigned to signed over a conversion to an unsigned of the same size. */
654 /* Nonzero means warn when an old-style cast is used. */
656 int warn_old_style_cast;
658 /* Nonzero means warn when non-templatized friend functions are
659 declared within a template */
661 int warn_nontemplate_friend = 1;
663 /* Nonzero means complain about deprecated features. */
665 int warn_deprecated = 1;
667 /* Maximum template instantiation depth. This limit is rather
668 arbitrary, but it exists to limit the time it takes to notice
669 infinite template instantiations. */
671 int max_tinst_depth = 500;
675 /* The elements of `ridpointers' are identifier nodes for the reserved
676 type names and storage classes. It is indexed by a RID_... value. */
679 tree (*make_fname_decl) (tree, int);
681 /* If non-NULL, the address of a language-specific function that takes
682 any action required right before expand_function_end is called. */
683 void (*lang_expand_function_end) (void);
685 /* Nonzero means the expression being parsed will never be evaluated.
686 This is a count, since unevaluated expressions can nest. */
689 /* Information about how a function name is generated. */
692 tree *const decl; /* pointer to the VAR_DECL. */
693 const unsigned rid; /* RID number for the identifier. */
694 const int pretty; /* How pretty is it? */
697 /* The three ways of getting then name of the current function. */
699 const struct fname_var_t fname_vars[] =
701 /* C99 compliant __func__, must be first. */
702 {&c99_function_name_decl_node, RID_C99_FUNCTION_NAME, 0},
703 /* GCC __FUNCTION__ compliant. */
704 {&function_name_decl_node, RID_FUNCTION_NAME, 0},
705 /* GCC __PRETTY_FUNCTION__ compliant. */
706 {&pretty_function_name_decl_node, RID_PRETTY_FUNCTION_NAME, 1},
710 static int constant_fits_type_p (tree, tree);
712 /* Keep a stack of if statements. We record the number of compound
713 statements seen up to the if keyword, as well as the line number
714 and file of the if. If a potentially ambiguous else is seen, that
715 fact is recorded; the warning is issued when we can be sure that
716 the enclosing if statement does not have an else branch. */
725 static if_elt *if_stack;
727 /* Amount of space in the if statement stack. */
728 static int if_stack_space = 0;
731 static int if_stack_pointer = 0;
733 static tree handle_packed_attribute (tree *, tree, tree, int, bool *);
734 static tree handle_nocommon_attribute (tree *, tree, tree, int, bool *);
735 static tree handle_common_attribute (tree *, tree, tree, int, bool *);
736 static tree handle_noreturn_attribute (tree *, tree, tree, int, bool *);
737 static tree handle_noinline_attribute (tree *, tree, tree, int, bool *);
738 static tree handle_always_inline_attribute (tree *, tree, tree, int,
740 static tree handle_used_attribute (tree *, tree, tree, int, bool *);
741 static tree handle_unused_attribute (tree *, tree, tree, int, bool *);
742 static tree handle_const_attribute (tree *, tree, tree, int, bool *);
743 static tree handle_transparent_union_attribute (tree *, tree, tree,
745 static tree handle_constructor_attribute (tree *, tree, tree, int, bool *);
746 static tree handle_destructor_attribute (tree *, tree, tree, int, bool *);
747 static tree handle_mode_attribute (tree *, tree, tree, int, bool *);
748 static tree handle_section_attribute (tree *, tree, tree, int, bool *);
749 static tree handle_aligned_attribute (tree *, tree, tree, int, bool *);
750 static tree handle_weak_attribute (tree *, tree, tree, int, bool *) ;
751 static tree handle_alias_attribute (tree *, tree, tree, int, bool *);
752 static tree handle_visibility_attribute (tree *, tree, tree, int,
754 static tree handle_tls_model_attribute (tree *, tree, tree, int,
756 static tree handle_no_instrument_function_attribute (tree *, tree,
758 static tree handle_malloc_attribute (tree *, tree, tree, int, bool *);
759 static tree handle_no_limit_stack_attribute (tree *, tree, tree, int,
761 static tree handle_pure_attribute (tree *, tree, tree, int, bool *);
762 static tree handle_deprecated_attribute (tree *, tree, tree, int,
764 static tree handle_vector_size_attribute (tree *, tree, tree, int,
766 static tree handle_nonnull_attribute (tree *, tree, tree, int, bool *);
767 static tree handle_nothrow_attribute (tree *, tree, tree, int, bool *);
768 static tree handle_cleanup_attribute (tree *, tree, tree, int, bool *);
769 static tree vector_size_helper (tree, tree);
771 static void check_function_nonnull (tree, tree);
772 static void check_nonnull_arg (void *, tree, unsigned HOST_WIDE_INT);
773 static bool nonnull_check_p (tree, unsigned HOST_WIDE_INT);
774 static bool get_nonnull_operand (tree, unsigned HOST_WIDE_INT *);
775 static int resort_field_decl_cmp (const void *, const void *);
777 /* Table of machine-independent attributes common to all C-like languages. */
778 const struct attribute_spec c_common_attribute_table[] =
780 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler } */
781 { "packed", 0, 0, false, false, false,
782 handle_packed_attribute },
783 { "nocommon", 0, 0, true, false, false,
784 handle_nocommon_attribute },
785 { "common", 0, 0, true, false, false,
786 handle_common_attribute },
787 /* FIXME: logically, noreturn attributes should be listed as
788 "false, true, true" and apply to function types. But implementing this
789 would require all the places in the compiler that use TREE_THIS_VOLATILE
790 on a decl to identify non-returning functions to be located and fixed
791 to check the function type instead. */
792 { "noreturn", 0, 0, true, false, false,
793 handle_noreturn_attribute },
794 { "volatile", 0, 0, true, false, false,
795 handle_noreturn_attribute },
796 { "noinline", 0, 0, true, false, false,
797 handle_noinline_attribute },
798 { "always_inline", 0, 0, true, false, false,
799 handle_always_inline_attribute },
800 { "used", 0, 0, true, false, false,
801 handle_used_attribute },
802 { "unused", 0, 0, false, false, false,
803 handle_unused_attribute },
804 /* The same comments as for noreturn attributes apply to const ones. */
805 { "const", 0, 0, true, false, false,
806 handle_const_attribute },
807 { "transparent_union", 0, 0, false, false, false,
808 handle_transparent_union_attribute },
809 { "constructor", 0, 0, true, false, false,
810 handle_constructor_attribute },
811 { "destructor", 0, 0, true, false, false,
812 handle_destructor_attribute },
813 { "mode", 1, 1, false, true, false,
814 handle_mode_attribute },
815 { "section", 1, 1, true, false, false,
816 handle_section_attribute },
817 { "aligned", 0, 1, false, false, false,
818 handle_aligned_attribute },
819 { "weak", 0, 0, true, false, false,
820 handle_weak_attribute },
821 { "alias", 1, 1, true, false, false,
822 handle_alias_attribute },
823 { "no_instrument_function", 0, 0, true, false, false,
824 handle_no_instrument_function_attribute },
825 { "malloc", 0, 0, true, false, false,
826 handle_malloc_attribute },
827 { "no_stack_limit", 0, 0, true, false, false,
828 handle_no_limit_stack_attribute },
829 { "pure", 0, 0, true, false, false,
830 handle_pure_attribute },
831 { "deprecated", 0, 0, false, false, false,
832 handle_deprecated_attribute },
833 { "vector_size", 1, 1, false, true, false,
834 handle_vector_size_attribute },
835 { "visibility", 1, 1, true, false, false,
836 handle_visibility_attribute },
837 { "tls_model", 1, 1, true, false, false,
838 handle_tls_model_attribute },
839 { "nonnull", 0, -1, false, true, true,
840 handle_nonnull_attribute },
841 { "nothrow", 0, 0, true, false, false,
842 handle_nothrow_attribute },
843 { "may_alias", 0, 0, false, true, false, NULL },
844 { "cleanup", 1, 1, true, false, false,
845 handle_cleanup_attribute },
846 { NULL, 0, 0, false, false, false, NULL }
849 /* Give the specifications for the format attributes, used by C and all
852 const struct attribute_spec c_common_format_attribute_table[] =
854 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler } */
855 { "format", 3, 3, false, true, true,
856 handle_format_attribute },
857 { "format_arg", 1, 1, false, true, true,
858 handle_format_arg_attribute },
859 { NULL, 0, 0, false, false, false, NULL }
862 /* Record the start of an if-then, and record the start of it
863 for ambiguous else detection.
865 COND is the condition for the if-then statement.
867 IF_STMT is the statement node that has already been created for
868 this if-then statement. It is created before parsing the
869 condition to keep line number information accurate. */
872 c_expand_start_cond (tree cond, int compstmt_count, tree if_stmt)
874 /* Make sure there is enough space on the stack. */
875 if (if_stack_space == 0)
878 if_stack = xmalloc (10 * sizeof (if_elt));
880 else if (if_stack_space == if_stack_pointer)
882 if_stack_space += 10;
883 if_stack = xrealloc (if_stack, if_stack_space * sizeof (if_elt));
886 IF_COND (if_stmt) = cond;
889 /* Record this if statement. */
890 if_stack[if_stack_pointer].compstmt_count = compstmt_count;
891 if_stack[if_stack_pointer].locus = input_location;
892 if_stack[if_stack_pointer].needs_warning = 0;
893 if_stack[if_stack_pointer].if_stmt = if_stmt;
897 /* Called after the then-clause for an if-statement is processed. */
902 tree if_stmt = if_stack[if_stack_pointer - 1].if_stmt;
903 RECHAIN_STMTS (if_stmt, THEN_CLAUSE (if_stmt));
906 /* Record the end of an if-then. Optionally warn if a nested
907 if statement had an ambiguous else clause. */
910 c_expand_end_cond (void)
913 if (if_stack[if_stack_pointer].needs_warning)
914 warning ("%Hsuggest explicit braces to avoid ambiguous `else'",
915 &if_stack[if_stack_pointer].locus);
916 last_expr_type = NULL_TREE;
919 /* Called between the then-clause and the else-clause
920 of an if-then-else. */
923 c_expand_start_else (void)
925 /* An ambiguous else warning must be generated for the enclosing if
926 statement, unless we see an else branch for that one, too. */
928 && if_stack_pointer > 1
929 && (if_stack[if_stack_pointer - 1].compstmt_count
930 == if_stack[if_stack_pointer - 2].compstmt_count))
931 if_stack[if_stack_pointer - 2].needs_warning = 1;
933 /* Even if a nested if statement had an else branch, it can't be
934 ambiguous if this one also has an else. So don't warn in that
935 case. Also don't warn for any if statements nested in this else. */
936 if_stack[if_stack_pointer - 1].needs_warning = 0;
937 if_stack[if_stack_pointer - 1].compstmt_count--;
940 /* Called after the else-clause for an if-statement is processed. */
945 tree if_stmt = if_stack[if_stack_pointer - 1].if_stmt;
946 RECHAIN_STMTS (if_stmt, ELSE_CLAUSE (if_stmt));
949 /* Begin an if-statement. Returns a newly created IF_STMT if
952 Unlike the C++ front-end, we do not call add_stmt here; it is
953 probably safe to do so, but I am not very familiar with this
954 code so I am being extra careful not to change its behavior
955 beyond what is strictly necessary for correctness. */
958 c_begin_if_stmt (void)
961 r = build_stmt (IF_STMT, NULL_TREE, NULL_TREE, NULL_TREE);
965 /* Begin a while statement. Returns a newly created WHILE_STMT if
968 Unlike the C++ front-end, we do not call add_stmt here; it is
969 probably safe to do so, but I am not very familiar with this
970 code so I am being extra careful not to change its behavior
971 beyond what is strictly necessary for correctness. */
974 c_begin_while_stmt (void)
977 r = build_stmt (WHILE_STMT, NULL_TREE, NULL_TREE);
982 c_finish_while_stmt_cond (tree cond, tree while_stmt)
984 WHILE_COND (while_stmt) = cond;
987 /* Push current bindings for the function name VAR_DECLS. */
990 start_fname_decls (void)
993 tree saved = NULL_TREE;
995 for (ix = 0; fname_vars[ix].decl; ix++)
997 tree decl = *fname_vars[ix].decl;
1001 saved = tree_cons (decl, build_int_2 (ix, 0), saved);
1002 *fname_vars[ix].decl = NULL_TREE;
1005 if (saved || saved_function_name_decls)
1006 /* Normally they'll have been NULL, so only push if we've got a
1007 stack, or they are non-NULL. */
1008 saved_function_name_decls = tree_cons (saved, NULL_TREE,
1009 saved_function_name_decls);
1012 /* Finish up the current bindings, adding them into the
1013 current function's statement tree. This is done by wrapping the
1014 function's body in a COMPOUND_STMT containing these decls too. This
1015 must be done _before_ finish_stmt_tree is called. If there is no
1016 current function, we must be at file scope and no statements are
1017 involved. Pop the previous bindings. */
1020 finish_fname_decls (void)
1023 tree body = NULL_TREE;
1024 tree stack = saved_function_name_decls;
1026 for (; stack && TREE_VALUE (stack); stack = TREE_CHAIN (stack))
1027 body = chainon (TREE_VALUE (stack), body);
1031 /* They were called into existence, so add to statement tree. Add
1032 the DECL_STMTs inside the outermost scope. */
1033 tree *p = &DECL_SAVED_TREE (current_function_decl);
1034 /* Skip the dummy EXPR_STMT and any EH_SPEC_BLOCK. */
1035 while (TREE_CODE (*p) != COMPOUND_STMT)
1036 p = &TREE_CHAIN (*p);
1037 p = &COMPOUND_BODY (*p);
1038 if (TREE_CODE (*p) == SCOPE_STMT)
1039 p = &TREE_CHAIN (*p);
1041 body = chainon (body, *p);
1045 for (ix = 0; fname_vars[ix].decl; ix++)
1046 *fname_vars[ix].decl = NULL_TREE;
1050 /* We had saved values, restore them. */
1053 for (saved = TREE_PURPOSE (stack); saved; saved = TREE_CHAIN (saved))
1055 tree decl = TREE_PURPOSE (saved);
1056 unsigned ix = TREE_INT_CST_LOW (TREE_VALUE (saved));
1058 *fname_vars[ix].decl = decl;
1060 stack = TREE_CHAIN (stack);
1062 saved_function_name_decls = stack;
1065 /* Return the text name of the current function, suitably prettified
1069 fname_as_string (int pretty_p)
1071 const char *name = NULL;
1074 name = (current_function_decl
1075 ? (*lang_hooks.decl_printable_name) (current_function_decl, 2)
1077 else if (current_function_decl && DECL_NAME (current_function_decl))
1078 name = IDENTIFIER_POINTER (DECL_NAME (current_function_decl));
1084 /* Return the VAR_DECL for a const char array naming the current
1085 function. If the VAR_DECL has not yet been created, create it
1086 now. RID indicates how it should be formatted and IDENTIFIER_NODE
1087 ID is its name (unfortunately C and C++ hold the RID values of
1088 keywords in different places, so we can't derive RID from ID in
1089 this language independent code. */
1092 fname_decl (unsigned int rid, tree id)
1095 tree decl = NULL_TREE;
1097 for (ix = 0; fname_vars[ix].decl; ix++)
1098 if (fname_vars[ix].rid == rid)
1101 decl = *fname_vars[ix].decl;
1104 tree saved_last_tree = last_tree;
1105 /* If a tree is built here, it would normally have the lineno of
1106 the current statement. Later this tree will be moved to the
1107 beginning of the function and this line number will be wrong.
1108 To avoid this problem set the lineno to 0 here; that prevents
1109 it from appearing in the RTL. */
1110 int saved_lineno = input_line;
1113 decl = (*make_fname_decl) (id, fname_vars[ix].pretty);
1114 if (last_tree != saved_last_tree)
1116 /* We created some statement tree for the decl. This belongs
1117 at the start of the function, so remove it now and reinsert
1118 it after the function is complete. */
1119 tree stmts = TREE_CHAIN (saved_last_tree);
1121 TREE_CHAIN (saved_last_tree) = NULL_TREE;
1122 last_tree = saved_last_tree;
1123 saved_function_name_decls = tree_cons (decl, stmts,
1124 saved_function_name_decls);
1126 *fname_vars[ix].decl = decl;
1127 input_line = saved_lineno;
1129 if (!ix && !current_function_decl)
1130 pedwarn ("%H'%D' is not defined outside of function scope",
1131 &DECL_SOURCE_LOCATION (decl), decl);
1136 /* Given a STRING_CST, give it a suitable array-of-chars data type. */
1139 fix_string_type (tree value)
1141 const int wchar_bytes = TYPE_PRECISION (wchar_type_node) / BITS_PER_UNIT;
1142 const int wide_flag = TREE_TYPE (value) == wchar_array_type_node;
1143 const int nchars_max = flag_isoc99 ? 4095 : 509;
1144 int length = TREE_STRING_LENGTH (value);
1147 /* Compute the number of elements, for the array type. */
1148 nchars = wide_flag ? length / wchar_bytes : length;
1150 if (pedantic && nchars - 1 > nchars_max && !c_dialect_cxx ())
1151 pedwarn ("string length `%d' is greater than the length `%d' ISO C%d compilers are required to support",
1152 nchars - 1, nchars_max, flag_isoc99 ? 99 : 89);
1154 /* Create the array type for the string constant.
1155 -Wwrite-strings says make the string constant an array of const char
1156 so that copying it to a non-const pointer will get a warning.
1157 For C++, this is the standard behavior. */
1158 if (flag_const_strings && ! flag_writable_strings)
1161 = build_type_variant (wide_flag ? wchar_type_node : char_type_node,
1164 = build_array_type (elements,
1165 build_index_type (build_int_2 (nchars - 1, 0)));
1169 = build_array_type (wide_flag ? wchar_type_node : char_type_node,
1170 build_index_type (build_int_2 (nchars - 1, 0)));
1172 TREE_CONSTANT (value) = 1;
1173 TREE_READONLY (value) = ! flag_writable_strings;
1174 TREE_STATIC (value) = 1;
1178 static int is_valid_printf_arglist (tree);
1179 static rtx c_expand_builtin (tree, rtx, enum machine_mode,
1180 enum expand_modifier);
1181 static rtx c_expand_builtin_printf (tree, rtx, enum machine_mode,
1182 enum expand_modifier, int, int);
1183 static rtx c_expand_builtin_fprintf (tree, rtx, enum machine_mode,
1184 enum expand_modifier, int, int);
1186 /* Print a warning if a constant expression had overflow in folding.
1187 Invoke this function on every expression that the language
1188 requires to be a constant expression.
1189 Note the ANSI C standard says it is erroneous for a
1190 constant expression to overflow. */
1193 constant_expression_warning (tree value)
1195 if ((TREE_CODE (value) == INTEGER_CST || TREE_CODE (value) == REAL_CST
1196 || TREE_CODE (value) == VECTOR_CST
1197 || TREE_CODE (value) == COMPLEX_CST)
1198 && TREE_CONSTANT_OVERFLOW (value) && pedantic)
1199 pedwarn ("overflow in constant expression");
1202 /* Print a warning if an expression had overflow in folding.
1203 Invoke this function on every expression that
1204 (1) appears in the source code, and
1205 (2) might be a constant expression that overflowed, and
1206 (3) is not already checked by convert_and_check;
1207 however, do not invoke this function on operands of explicit casts. */
1210 overflow_warning (tree value)
1212 if ((TREE_CODE (value) == INTEGER_CST
1213 || (TREE_CODE (value) == COMPLEX_CST
1214 && TREE_CODE (TREE_REALPART (value)) == INTEGER_CST))
1215 && TREE_OVERFLOW (value))
1217 TREE_OVERFLOW (value) = 0;
1218 if (skip_evaluation == 0)
1219 warning ("integer overflow in expression");
1221 else if ((TREE_CODE (value) == REAL_CST
1222 || (TREE_CODE (value) == COMPLEX_CST
1223 && TREE_CODE (TREE_REALPART (value)) == REAL_CST))
1224 && TREE_OVERFLOW (value))
1226 TREE_OVERFLOW (value) = 0;
1227 if (skip_evaluation == 0)
1228 warning ("floating point overflow in expression");
1230 else if (TREE_CODE (value) == VECTOR_CST && TREE_OVERFLOW (value))
1232 TREE_OVERFLOW (value) = 0;
1233 if (skip_evaluation == 0)
1234 warning ("vector overflow in expression");
1238 /* Print a warning if a large constant is truncated to unsigned,
1239 or if -Wconversion is used and a constant < 0 is converted to unsigned.
1240 Invoke this function on every expression that might be implicitly
1241 converted to an unsigned type. */
1244 unsigned_conversion_warning (tree result, tree operand)
1246 tree type = TREE_TYPE (result);
1248 if (TREE_CODE (operand) == INTEGER_CST
1249 && TREE_CODE (type) == INTEGER_TYPE
1250 && TREE_UNSIGNED (type)
1251 && skip_evaluation == 0
1252 && !int_fits_type_p (operand, type))
1254 if (!int_fits_type_p (operand, c_common_signed_type (type)))
1255 /* This detects cases like converting -129 or 256 to unsigned char. */
1256 warning ("large integer implicitly truncated to unsigned type");
1257 else if (warn_conversion)
1258 warning ("negative integer implicitly converted to unsigned type");
1262 /* Nonzero if constant C has a value that is permissible
1263 for type TYPE (an INTEGER_TYPE). */
1266 constant_fits_type_p (tree c, tree type)
1268 if (TREE_CODE (c) == INTEGER_CST)
1269 return int_fits_type_p (c, type);
1271 c = convert (type, c);
1272 return !TREE_OVERFLOW (c);
1275 /* Convert EXPR to TYPE, warning about conversion problems with constants.
1276 Invoke this function on every expression that is converted implicitly,
1277 i.e. because of language rules and not because of an explicit cast. */
1280 convert_and_check (tree type, tree expr)
1282 tree t = convert (type, expr);
1283 if (TREE_CODE (t) == INTEGER_CST)
1285 if (TREE_OVERFLOW (t))
1287 TREE_OVERFLOW (t) = 0;
1289 /* Do not diagnose overflow in a constant expression merely
1290 because a conversion overflowed. */
1291 TREE_CONSTANT_OVERFLOW (t) = TREE_CONSTANT_OVERFLOW (expr);
1293 /* No warning for converting 0x80000000 to int. */
1294 if (!(TREE_UNSIGNED (type) < TREE_UNSIGNED (TREE_TYPE (expr))
1295 && TREE_CODE (TREE_TYPE (expr)) == INTEGER_TYPE
1296 && TYPE_PRECISION (type) == TYPE_PRECISION (TREE_TYPE (expr))))
1297 /* If EXPR fits in the unsigned version of TYPE,
1298 don't warn unless pedantic. */
1300 || TREE_UNSIGNED (type)
1301 || ! constant_fits_type_p (expr,
1302 c_common_unsigned_type (type)))
1303 && skip_evaluation == 0)
1304 warning ("overflow in implicit constant conversion");
1307 unsigned_conversion_warning (t, expr);
1312 /* A node in a list that describes references to variables (EXPR), which are
1313 either read accesses if WRITER is zero, or write accesses, in which case
1314 WRITER is the parent of EXPR. */
1321 /* Used to implement a cache the results of a call to verify_tree. We only
1322 use this for SAVE_EXPRs. */
1325 struct tlist_cache *next;
1326 struct tlist *cache_before_sp;
1327 struct tlist *cache_after_sp;
1331 /* Obstack to use when allocating tlist structures, and corresponding
1333 static struct obstack tlist_obstack;
1334 static char *tlist_firstobj = 0;
1336 /* Keep track of the identifiers we've warned about, so we can avoid duplicate
1338 static struct tlist *warned_ids;
1339 /* SAVE_EXPRs need special treatment. We process them only once and then
1340 cache the results. */
1341 static struct tlist_cache *save_expr_cache;
1343 static void add_tlist (struct tlist **, struct tlist *, tree, int);
1344 static void merge_tlist (struct tlist **, struct tlist *, int);
1345 static void verify_tree (tree, struct tlist **, struct tlist **, tree);
1346 static int warning_candidate_p (tree);
1347 static void warn_for_collisions (struct tlist *);
1348 static void warn_for_collisions_1 (tree, tree, struct tlist *, int);
1349 static struct tlist *new_tlist (struct tlist *, tree, tree);
1350 static void verify_sequence_points (tree);
1352 /* Create a new struct tlist and fill in its fields. */
1353 static struct tlist *
1354 new_tlist (struct tlist *next, tree t, tree writer)
1357 l = obstack_alloc (&tlist_obstack, sizeof *l);
1364 /* Add duplicates of the nodes found in ADD to the list *TO. If EXCLUDE_WRITER
1365 is nonnull, we ignore any node we find which has a writer equal to it. */
1368 add_tlist (struct tlist **to, struct tlist *add, tree exclude_writer, int copy)
1372 struct tlist *next = add->next;
1375 if (! exclude_writer || add->writer != exclude_writer)
1376 *to = copy ? new_tlist (*to, add->expr, add->writer) : add;
1381 /* Merge the nodes of ADD into TO. This merging process is done so that for
1382 each variable that already exists in TO, no new node is added; however if
1383 there is a write access recorded in ADD, and an occurrence on TO is only
1384 a read access, then the occurrence in TO will be modified to record the
1388 merge_tlist (struct tlist **to, struct tlist *add, int copy)
1390 struct tlist **end = to;
1393 end = &(*end)->next;
1399 struct tlist *next = add->next;
1401 for (tmp2 = *to; tmp2; tmp2 = tmp2->next)
1402 if (tmp2->expr == add->expr)
1406 tmp2->writer = add->writer;
1410 *end = copy ? add : new_tlist (NULL, add->expr, add->writer);
1411 end = &(*end)->next;
1418 /* WRITTEN is a variable, WRITER is its parent. Warn if any of the variable
1419 references in list LIST conflict with it, excluding reads if ONLY writers
1423 warn_for_collisions_1 (tree written, tree writer, struct tlist *list,
1428 /* Avoid duplicate warnings. */
1429 for (tmp = warned_ids; tmp; tmp = tmp->next)
1430 if (tmp->expr == written)
1435 if (list->expr == written
1436 && list->writer != writer
1437 && (! only_writes || list->writer))
1439 warned_ids = new_tlist (warned_ids, written, NULL_TREE);
1440 warning ("operation on `%s' may be undefined",
1441 IDENTIFIER_POINTER (DECL_NAME (list->expr)));
1447 /* Given a list LIST of references to variables, find whether any of these
1448 can cause conflicts due to missing sequence points. */
1451 warn_for_collisions (struct tlist *list)
1455 for (tmp = list; tmp; tmp = tmp->next)
1458 warn_for_collisions_1 (tmp->expr, tmp->writer, list, 0);
1462 /* Return nonzero if X is a tree that can be verified by the sequence point
1465 warning_candidate_p (tree x)
1467 return TREE_CODE (x) == VAR_DECL || TREE_CODE (x) == PARM_DECL;
1470 /* Walk the tree X, and record accesses to variables. If X is written by the
1471 parent tree, WRITER is the parent.
1472 We store accesses in one of the two lists: PBEFORE_SP, and PNO_SP. If this
1473 expression or its only operand forces a sequence point, then everything up
1474 to the sequence point is stored in PBEFORE_SP. Everything else gets stored
1476 Once we return, we will have emitted warnings if any subexpression before
1477 such a sequence point could be undefined. On a higher level, however, the
1478 sequence point may not be relevant, and we'll merge the two lists.
1480 Example: (b++, a) + b;
1481 The call that processes the COMPOUND_EXPR will store the increment of B
1482 in PBEFORE_SP, and the use of A in PNO_SP. The higher-level call that
1483 processes the PLUS_EXPR will need to merge the two lists so that
1484 eventually, all accesses end up on the same list (and we'll warn about the
1485 unordered subexpressions b++ and b.
1487 A note on merging. If we modify the former example so that our expression
1490 care must be taken not simply to add all three expressions into the final
1491 PNO_SP list. The function merge_tlist takes care of that by merging the
1492 before-SP list of the COMPOUND_EXPR into its after-SP list in a special
1493 way, so that no more than one access to B is recorded. */
1496 verify_tree (tree x, struct tlist **pbefore_sp, struct tlist **pno_sp,
1499 struct tlist *tmp_before, *tmp_nosp, *tmp_list2, *tmp_list3;
1500 enum tree_code code;
1503 /* X may be NULL if it is the operand of an empty statement expression
1509 code = TREE_CODE (x);
1510 class = TREE_CODE_CLASS (code);
1512 if (warning_candidate_p (x))
1514 *pno_sp = new_tlist (*pno_sp, x, writer);
1524 case TRUTH_ANDIF_EXPR:
1525 case TRUTH_ORIF_EXPR:
1526 tmp_before = tmp_nosp = tmp_list3 = 0;
1527 verify_tree (TREE_OPERAND (x, 0), &tmp_before, &tmp_nosp, NULL_TREE);
1528 warn_for_collisions (tmp_nosp);
1529 merge_tlist (pbefore_sp, tmp_before, 0);
1530 merge_tlist (pbefore_sp, tmp_nosp, 0);
1531 verify_tree (TREE_OPERAND (x, 1), &tmp_list3, pno_sp, NULL_TREE);
1532 merge_tlist (pbefore_sp, tmp_list3, 0);
1536 tmp_before = tmp_list2 = 0;
1537 verify_tree (TREE_OPERAND (x, 0), &tmp_before, &tmp_list2, NULL_TREE);
1538 warn_for_collisions (tmp_list2);
1539 merge_tlist (pbefore_sp, tmp_before, 0);
1540 merge_tlist (pbefore_sp, tmp_list2, 1);
1542 tmp_list3 = tmp_nosp = 0;
1543 verify_tree (TREE_OPERAND (x, 1), &tmp_list3, &tmp_nosp, NULL_TREE);
1544 warn_for_collisions (tmp_nosp);
1545 merge_tlist (pbefore_sp, tmp_list3, 0);
1547 tmp_list3 = tmp_list2 = 0;
1548 verify_tree (TREE_OPERAND (x, 2), &tmp_list3, &tmp_list2, NULL_TREE);
1549 warn_for_collisions (tmp_list2);
1550 merge_tlist (pbefore_sp, tmp_list3, 0);
1551 /* Rather than add both tmp_nosp and tmp_list2, we have to merge the
1552 two first, to avoid warning for (a ? b++ : b++). */
1553 merge_tlist (&tmp_nosp, tmp_list2, 0);
1554 add_tlist (pno_sp, tmp_nosp, NULL_TREE, 0);
1557 case PREDECREMENT_EXPR:
1558 case PREINCREMENT_EXPR:
1559 case POSTDECREMENT_EXPR:
1560 case POSTINCREMENT_EXPR:
1561 verify_tree (TREE_OPERAND (x, 0), pno_sp, pno_sp, x);
1565 tmp_before = tmp_nosp = tmp_list3 = 0;
1566 verify_tree (TREE_OPERAND (x, 1), &tmp_before, &tmp_nosp, NULL_TREE);
1567 verify_tree (TREE_OPERAND (x, 0), &tmp_list3, &tmp_list3, x);
1568 /* Expressions inside the LHS are not ordered wrt. the sequence points
1569 in the RHS. Example:
1571 Despite the fact that the modification of "a" is in the before_sp
1572 list (tmp_before), it conflicts with the use of "a" in the LHS.
1573 We can handle this by adding the contents of tmp_list3
1574 to those of tmp_before, and redoing the collision warnings for that
1576 add_tlist (&tmp_before, tmp_list3, x, 1);
1577 warn_for_collisions (tmp_before);
1578 /* Exclude the LHS itself here; we first have to merge it into the
1579 tmp_nosp list. This is done to avoid warning for "a = a"; if we
1580 didn't exclude the LHS, we'd get it twice, once as a read and once
1582 add_tlist (pno_sp, tmp_list3, x, 0);
1583 warn_for_collisions_1 (TREE_OPERAND (x, 0), x, tmp_nosp, 1);
1585 merge_tlist (pbefore_sp, tmp_before, 0);
1586 if (warning_candidate_p (TREE_OPERAND (x, 0)))
1587 merge_tlist (&tmp_nosp, new_tlist (NULL, TREE_OPERAND (x, 0), x), 0);
1588 add_tlist (pno_sp, tmp_nosp, NULL_TREE, 1);
1592 /* We need to warn about conflicts among arguments and conflicts between
1593 args and the function address. Side effects of the function address,
1594 however, are not ordered by the sequence point of the call. */
1595 tmp_before = tmp_nosp = tmp_list2 = tmp_list3 = 0;
1596 verify_tree (TREE_OPERAND (x, 0), &tmp_before, &tmp_nosp, NULL_TREE);
1597 if (TREE_OPERAND (x, 1))
1598 verify_tree (TREE_OPERAND (x, 1), &tmp_list2, &tmp_list3, NULL_TREE);
1599 merge_tlist (&tmp_list3, tmp_list2, 0);
1600 add_tlist (&tmp_before, tmp_list3, NULL_TREE, 0);
1601 add_tlist (&tmp_before, tmp_nosp, NULL_TREE, 0);
1602 warn_for_collisions (tmp_before);
1603 add_tlist (pbefore_sp, tmp_before, NULL_TREE, 0);
1607 /* Scan all the list, e.g. indices of multi dimensional array. */
1610 tmp_before = tmp_nosp = 0;
1611 verify_tree (TREE_VALUE (x), &tmp_before, &tmp_nosp, NULL_TREE);
1612 merge_tlist (&tmp_nosp, tmp_before, 0);
1613 add_tlist (pno_sp, tmp_nosp, NULL_TREE, 0);
1620 struct tlist_cache *t;
1621 for (t = save_expr_cache; t; t = t->next)
1627 t = obstack_alloc (&tlist_obstack, sizeof *t);
1628 t->next = save_expr_cache;
1630 save_expr_cache = t;
1632 tmp_before = tmp_nosp = 0;
1633 verify_tree (TREE_OPERAND (x, 0), &tmp_before, &tmp_nosp, NULL_TREE);
1634 warn_for_collisions (tmp_nosp);
1639 struct tlist *t = tmp_nosp;
1641 merge_tlist (&tmp_list3, t, 0);
1643 t->cache_before_sp = tmp_before;
1644 t->cache_after_sp = tmp_list3;
1646 merge_tlist (pbefore_sp, t->cache_before_sp, 1);
1647 add_tlist (pno_sp, t->cache_after_sp, NULL_TREE, 1);
1656 if (first_rtl_op (code) == 0)
1658 x = TREE_OPERAND (x, 0);
1674 int max = first_rtl_op (TREE_CODE (x));
1675 for (lp = 0; lp < max; lp++)
1677 tmp_before = tmp_nosp = 0;
1678 verify_tree (TREE_OPERAND (x, lp), &tmp_before, &tmp_nosp, NULL_TREE);
1679 merge_tlist (&tmp_nosp, tmp_before, 0);
1680 add_tlist (pno_sp, tmp_nosp, NULL_TREE, 0);
1687 /* Try to warn for undefined behavior in EXPR due to missing sequence
1691 verify_sequence_points (tree expr)
1693 struct tlist *before_sp = 0, *after_sp = 0;
1696 save_expr_cache = 0;
1697 if (tlist_firstobj == 0)
1699 gcc_obstack_init (&tlist_obstack);
1700 tlist_firstobj = obstack_alloc (&tlist_obstack, 0);
1703 verify_tree (expr, &before_sp, &after_sp, 0);
1704 warn_for_collisions (after_sp);
1705 obstack_free (&tlist_obstack, tlist_firstobj);
1709 c_expand_expr_stmt (tree expr)
1711 /* Do default conversion if safe and possibly important,
1712 in case within ({...}). */
1713 if ((TREE_CODE (TREE_TYPE (expr)) == ARRAY_TYPE
1714 && (flag_isoc99 || lvalue_p (expr)))
1715 || TREE_CODE (TREE_TYPE (expr)) == FUNCTION_TYPE)
1716 expr = default_conversion (expr);
1718 if (warn_sequence_point)
1719 verify_sequence_points (expr);
1721 if (TREE_TYPE (expr) != error_mark_node
1722 && !COMPLETE_OR_VOID_TYPE_P (TREE_TYPE (expr))
1723 && TREE_CODE (TREE_TYPE (expr)) != ARRAY_TYPE)
1724 error ("expression statement has incomplete type");
1726 last_expr_type = TREE_TYPE (expr);
1727 return add_stmt (build_stmt (EXPR_STMT, expr));
1730 /* Validate the expression after `case' and apply default promotions. */
1733 check_case_value (tree value)
1735 if (value == NULL_TREE)
1738 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
1739 STRIP_TYPE_NOPS (value);
1740 /* In C++, the following is allowed:
1743 switch (...) { case i: ... }
1745 So, we try to reduce the VALUE to a constant that way. */
1746 if (c_dialect_cxx ())
1748 value = decl_constant_value (value);
1749 STRIP_TYPE_NOPS (value);
1750 value = fold (value);
1753 if (TREE_CODE (value) != INTEGER_CST
1754 && value != error_mark_node)
1756 error ("case label does not reduce to an integer constant");
1757 value = error_mark_node;
1760 /* Promote char or short to int. */
1761 value = default_conversion (value);
1763 constant_expression_warning (value);
1768 /* Return an integer type with BITS bits of precision,
1769 that is unsigned if UNSIGNEDP is nonzero, otherwise signed. */
1772 c_common_type_for_size (unsigned int bits, int unsignedp)
1774 if (bits == TYPE_PRECISION (integer_type_node))
1775 return unsignedp ? unsigned_type_node : integer_type_node;
1777 if (bits == TYPE_PRECISION (signed_char_type_node))
1778 return unsignedp ? unsigned_char_type_node : signed_char_type_node;
1780 if (bits == TYPE_PRECISION (short_integer_type_node))
1781 return unsignedp ? short_unsigned_type_node : short_integer_type_node;
1783 if (bits == TYPE_PRECISION (long_integer_type_node))
1784 return unsignedp ? long_unsigned_type_node : long_integer_type_node;
1786 if (bits == TYPE_PRECISION (long_long_integer_type_node))
1787 return (unsignedp ? long_long_unsigned_type_node
1788 : long_long_integer_type_node);
1790 if (bits == TYPE_PRECISION (widest_integer_literal_type_node))
1791 return (unsignedp ? widest_unsigned_literal_type_node
1792 : widest_integer_literal_type_node);
1794 if (bits <= TYPE_PRECISION (intQI_type_node))
1795 return unsignedp ? unsigned_intQI_type_node : intQI_type_node;
1797 if (bits <= TYPE_PRECISION (intHI_type_node))
1798 return unsignedp ? unsigned_intHI_type_node : intHI_type_node;
1800 if (bits <= TYPE_PRECISION (intSI_type_node))
1801 return unsignedp ? unsigned_intSI_type_node : intSI_type_node;
1803 if (bits <= TYPE_PRECISION (intDI_type_node))
1804 return unsignedp ? unsigned_intDI_type_node : intDI_type_node;
1809 /* Return a data type that has machine mode MODE.
1810 If the mode is an integer,
1811 then UNSIGNEDP selects between signed and unsigned types. */
1814 c_common_type_for_mode (enum machine_mode mode, int unsignedp)
1816 if (mode == TYPE_MODE (integer_type_node))
1817 return unsignedp ? unsigned_type_node : integer_type_node;
1819 if (mode == TYPE_MODE (signed_char_type_node))
1820 return unsignedp ? unsigned_char_type_node : signed_char_type_node;
1822 if (mode == TYPE_MODE (short_integer_type_node))
1823 return unsignedp ? short_unsigned_type_node : short_integer_type_node;
1825 if (mode == TYPE_MODE (long_integer_type_node))
1826 return unsignedp ? long_unsigned_type_node : long_integer_type_node;
1828 if (mode == TYPE_MODE (long_long_integer_type_node))
1829 return unsignedp ? long_long_unsigned_type_node : long_long_integer_type_node;
1831 if (mode == TYPE_MODE (widest_integer_literal_type_node))
1832 return unsignedp ? widest_unsigned_literal_type_node
1833 : widest_integer_literal_type_node;
1836 return unsignedp ? unsigned_intQI_type_node : intQI_type_node;
1839 return unsignedp ? unsigned_intHI_type_node : intHI_type_node;
1842 return unsignedp ? unsigned_intSI_type_node : intSI_type_node;
1845 return unsignedp ? unsigned_intDI_type_node : intDI_type_node;
1847 #if HOST_BITS_PER_WIDE_INT >= 64
1848 if (mode == TYPE_MODE (intTI_type_node))
1849 return unsignedp ? unsigned_intTI_type_node : intTI_type_node;
1852 if (mode == TYPE_MODE (float_type_node))
1853 return float_type_node;
1855 if (mode == TYPE_MODE (double_type_node))
1856 return double_type_node;
1858 if (mode == TYPE_MODE (long_double_type_node))
1859 return long_double_type_node;
1861 if (mode == TYPE_MODE (build_pointer_type (char_type_node)))
1862 return unsignedp ? make_unsigned_type (mode) : make_signed_type (mode);
1864 if (mode == TYPE_MODE (build_pointer_type (integer_type_node)))
1865 return unsignedp ? make_unsigned_type (mode) : make_signed_type (mode);
1870 return unsignedp ? unsigned_V16QI_type_node : V16QI_type_node;
1872 return unsignedp ? unsigned_V8HI_type_node : V8HI_type_node;
1874 return unsignedp ? unsigned_V4SI_type_node : V4SI_type_node;
1876 return unsignedp ? unsigned_V2DI_type_node : V2DI_type_node;
1878 return unsignedp ? unsigned_V2SI_type_node : V2SI_type_node;
1880 return unsignedp ? unsigned_V2HI_type_node : V2HI_type_node;
1882 return unsignedp ? unsigned_V4HI_type_node : V4HI_type_node;
1884 return unsignedp ? unsigned_V8QI_type_node : V8QI_type_node;
1886 return unsignedp ? unsigned_V1DI_type_node : V1DI_type_node;
1888 return V16SF_type_node;
1890 return V4SF_type_node;
1892 return V2SF_type_node;
1894 return V2DF_type_node;
1896 return V4DF_type_node;
1904 /* Return an unsigned type the same as TYPE in other respects. */
1906 c_common_unsigned_type (tree type)
1908 tree type1 = TYPE_MAIN_VARIANT (type);
1909 if (type1 == signed_char_type_node || type1 == char_type_node)
1910 return unsigned_char_type_node;
1911 if (type1 == integer_type_node)
1912 return unsigned_type_node;
1913 if (type1 == short_integer_type_node)
1914 return short_unsigned_type_node;
1915 if (type1 == long_integer_type_node)
1916 return long_unsigned_type_node;
1917 if (type1 == long_long_integer_type_node)
1918 return long_long_unsigned_type_node;
1919 if (type1 == widest_integer_literal_type_node)
1920 return widest_unsigned_literal_type_node;
1921 #if HOST_BITS_PER_WIDE_INT >= 64
1922 if (type1 == intTI_type_node)
1923 return unsigned_intTI_type_node;
1925 if (type1 == intDI_type_node)
1926 return unsigned_intDI_type_node;
1927 if (type1 == intSI_type_node)
1928 return unsigned_intSI_type_node;
1929 if (type1 == intHI_type_node)
1930 return unsigned_intHI_type_node;
1931 if (type1 == intQI_type_node)
1932 return unsigned_intQI_type_node;
1934 return c_common_signed_or_unsigned_type (1, type);
1937 /* Return a signed type the same as TYPE in other respects. */
1940 c_common_signed_type (tree type)
1942 tree type1 = TYPE_MAIN_VARIANT (type);
1943 if (type1 == unsigned_char_type_node || type1 == char_type_node)
1944 return signed_char_type_node;
1945 if (type1 == unsigned_type_node)
1946 return integer_type_node;
1947 if (type1 == short_unsigned_type_node)
1948 return short_integer_type_node;
1949 if (type1 == long_unsigned_type_node)
1950 return long_integer_type_node;
1951 if (type1 == long_long_unsigned_type_node)
1952 return long_long_integer_type_node;
1953 if (type1 == widest_unsigned_literal_type_node)
1954 return widest_integer_literal_type_node;
1955 #if HOST_BITS_PER_WIDE_INT >= 64
1956 if (type1 == unsigned_intTI_type_node)
1957 return intTI_type_node;
1959 if (type1 == unsigned_intDI_type_node)
1960 return intDI_type_node;
1961 if (type1 == unsigned_intSI_type_node)
1962 return intSI_type_node;
1963 if (type1 == unsigned_intHI_type_node)
1964 return intHI_type_node;
1965 if (type1 == unsigned_intQI_type_node)
1966 return intQI_type_node;
1968 return c_common_signed_or_unsigned_type (0, type);
1971 /* Return a type the same as TYPE except unsigned or
1972 signed according to UNSIGNEDP. */
1975 c_common_signed_or_unsigned_type (int unsignedp, tree type)
1977 if (! INTEGRAL_TYPE_P (type)
1978 || TREE_UNSIGNED (type) == unsignedp)
1981 if (TYPE_PRECISION (type) == TYPE_PRECISION (signed_char_type_node))
1982 return unsignedp ? unsigned_char_type_node : signed_char_type_node;
1983 if (TYPE_PRECISION (type) == TYPE_PRECISION (integer_type_node))
1984 return unsignedp ? unsigned_type_node : integer_type_node;
1985 if (TYPE_PRECISION (type) == TYPE_PRECISION (short_integer_type_node))
1986 return unsignedp ? short_unsigned_type_node : short_integer_type_node;
1987 if (TYPE_PRECISION (type) == TYPE_PRECISION (long_integer_type_node))
1988 return unsignedp ? long_unsigned_type_node : long_integer_type_node;
1989 if (TYPE_PRECISION (type) == TYPE_PRECISION (long_long_integer_type_node))
1990 return (unsignedp ? long_long_unsigned_type_node
1991 : long_long_integer_type_node);
1992 if (TYPE_PRECISION (type) == TYPE_PRECISION (widest_integer_literal_type_node))
1993 return (unsignedp ? widest_unsigned_literal_type_node
1994 : widest_integer_literal_type_node);
1996 #if HOST_BITS_PER_WIDE_INT >= 64
1997 if (TYPE_PRECISION (type) == TYPE_PRECISION (intTI_type_node))
1998 return unsignedp ? unsigned_intTI_type_node : intTI_type_node;
2000 if (TYPE_PRECISION (type) == TYPE_PRECISION (intDI_type_node))
2001 return unsignedp ? unsigned_intDI_type_node : intDI_type_node;
2002 if (TYPE_PRECISION (type) == TYPE_PRECISION (intSI_type_node))
2003 return unsignedp ? unsigned_intSI_type_node : intSI_type_node;
2004 if (TYPE_PRECISION (type) == TYPE_PRECISION (intHI_type_node))
2005 return unsignedp ? unsigned_intHI_type_node : intHI_type_node;
2006 if (TYPE_PRECISION (type) == TYPE_PRECISION (intQI_type_node))
2007 return unsignedp ? unsigned_intQI_type_node : intQI_type_node;
2012 /* Return the minimum number of bits needed to represent VALUE in a
2013 signed or unsigned type, UNSIGNEDP says which. */
2016 min_precision (tree value, int unsignedp)
2020 /* If the value is negative, compute its negative minus 1. The latter
2021 adjustment is because the absolute value of the largest negative value
2022 is one larger than the largest positive value. This is equivalent to
2023 a bit-wise negation, so use that operation instead. */
2025 if (tree_int_cst_sgn (value) < 0)
2026 value = fold (build1 (BIT_NOT_EXPR, TREE_TYPE (value), value));
2028 /* Return the number of bits needed, taking into account the fact
2029 that we need one more bit for a signed than unsigned type. */
2031 if (integer_zerop (value))
2034 log = tree_floor_log2 (value);
2036 return log + 1 + ! unsignedp;
2039 /* Print an error message for invalid operands to arith operation
2040 CODE. NOP_EXPR is used as a special case (see
2041 c_common_truthvalue_conversion). */
2044 binary_op_error (enum tree_code code)
2051 error ("invalid truth-value expression");
2055 opname = "+"; break;
2057 opname = "-"; break;
2059 opname = "*"; break;
2061 opname = "max"; break;
2063 opname = "min"; break;
2065 opname = "=="; break;
2067 opname = "!="; break;
2069 opname = "<="; break;
2071 opname = ">="; break;
2073 opname = "<"; break;
2075 opname = ">"; break;
2077 opname = "<<"; break;
2079 opname = ">>"; break;
2080 case TRUNC_MOD_EXPR:
2081 case FLOOR_MOD_EXPR:
2082 opname = "%"; break;
2083 case TRUNC_DIV_EXPR:
2084 case FLOOR_DIV_EXPR:
2085 opname = "/"; break;
2087 opname = "&"; break;
2089 opname = "|"; break;
2090 case TRUTH_ANDIF_EXPR:
2091 opname = "&&"; break;
2092 case TRUTH_ORIF_EXPR:
2093 opname = "||"; break;
2095 opname = "^"; break;
2098 opname = "rotate"; break;
2100 opname = "unknown"; break;
2102 error ("invalid operands to binary %s", opname);
2105 /* Subroutine of build_binary_op, used for comparison operations.
2106 See if the operands have both been converted from subword integer types
2107 and, if so, perhaps change them both back to their original type.
2108 This function is also responsible for converting the two operands
2109 to the proper common type for comparison.
2111 The arguments of this function are all pointers to local variables
2112 of build_binary_op: OP0_PTR is &OP0, OP1_PTR is &OP1,
2113 RESTYPE_PTR is &RESULT_TYPE and RESCODE_PTR is &RESULTCODE.
2115 If this function returns nonzero, it means that the comparison has
2116 a constant value. What this function returns is an expression for
2120 shorten_compare (tree *op0_ptr, tree *op1_ptr, tree *restype_ptr,
2121 enum tree_code *rescode_ptr)
2124 tree op0 = *op0_ptr;
2125 tree op1 = *op1_ptr;
2126 int unsignedp0, unsignedp1;
2128 tree primop0, primop1;
2129 enum tree_code code = *rescode_ptr;
2131 /* Throw away any conversions to wider types
2132 already present in the operands. */
2134 primop0 = get_narrower (op0, &unsignedp0);
2135 primop1 = get_narrower (op1, &unsignedp1);
2137 /* Handle the case that OP0 does not *contain* a conversion
2138 but it *requires* conversion to FINAL_TYPE. */
2140 if (op0 == primop0 && TREE_TYPE (op0) != *restype_ptr)
2141 unsignedp0 = TREE_UNSIGNED (TREE_TYPE (op0));
2142 if (op1 == primop1 && TREE_TYPE (op1) != *restype_ptr)
2143 unsignedp1 = TREE_UNSIGNED (TREE_TYPE (op1));
2145 /* If one of the operands must be floated, we cannot optimize. */
2146 real1 = TREE_CODE (TREE_TYPE (primop0)) == REAL_TYPE;
2147 real2 = TREE_CODE (TREE_TYPE (primop1)) == REAL_TYPE;
2149 /* If first arg is constant, swap the args (changing operation
2150 so value is preserved), for canonicalization. Don't do this if
2151 the second arg is 0. */
2153 if (TREE_CONSTANT (primop0)
2154 && ! integer_zerop (primop1) && ! real_zerop (primop1))
2157 int temi = unsignedp0;
2165 unsignedp0 = unsignedp1;
2188 *rescode_ptr = code;
2191 /* If comparing an integer against a constant more bits wide,
2192 maybe we can deduce a value of 1 or 0 independent of the data.
2193 Or else truncate the constant now
2194 rather than extend the variable at run time.
2196 This is only interesting if the constant is the wider arg.
2197 Also, it is not safe if the constant is unsigned and the
2198 variable arg is signed, since in this case the variable
2199 would be sign-extended and then regarded as unsigned.
2200 Our technique fails in this case because the lowest/highest
2201 possible unsigned results don't follow naturally from the
2202 lowest/highest possible values of the variable operand.
2203 For just EQ_EXPR and NE_EXPR there is another technique that
2204 could be used: see if the constant can be faithfully represented
2205 in the other operand's type, by truncating it and reextending it
2206 and see if that preserves the constant's value. */
2208 if (!real1 && !real2
2209 && TREE_CODE (primop1) == INTEGER_CST
2210 && TYPE_PRECISION (TREE_TYPE (primop0)) < TYPE_PRECISION (*restype_ptr))
2212 int min_gt, max_gt, min_lt, max_lt;
2213 tree maxval, minval;
2214 /* 1 if comparison is nominally unsigned. */
2215 int unsignedp = TREE_UNSIGNED (*restype_ptr);
2218 type = c_common_signed_or_unsigned_type (unsignedp0,
2219 TREE_TYPE (primop0));
2221 /* If TYPE is an enumeration, then we need to get its min/max
2222 values from it's underlying integral type, not the enumerated
2224 if (TREE_CODE (type) == ENUMERAL_TYPE)
2225 type = c_common_type_for_size (TYPE_PRECISION (type), unsignedp0);
2227 maxval = TYPE_MAX_VALUE (type);
2228 minval = TYPE_MIN_VALUE (type);
2230 if (unsignedp && !unsignedp0)
2231 *restype_ptr = c_common_signed_type (*restype_ptr);
2233 if (TREE_TYPE (primop1) != *restype_ptr)
2234 primop1 = convert (*restype_ptr, primop1);
2235 if (type != *restype_ptr)
2237 minval = convert (*restype_ptr, minval);
2238 maxval = convert (*restype_ptr, maxval);
2241 if (unsignedp && unsignedp0)
2243 min_gt = INT_CST_LT_UNSIGNED (primop1, minval);
2244 max_gt = INT_CST_LT_UNSIGNED (primop1, maxval);
2245 min_lt = INT_CST_LT_UNSIGNED (minval, primop1);
2246 max_lt = INT_CST_LT_UNSIGNED (maxval, primop1);
2250 min_gt = INT_CST_LT (primop1, minval);
2251 max_gt = INT_CST_LT (primop1, maxval);
2252 min_lt = INT_CST_LT (minval, primop1);
2253 max_lt = INT_CST_LT (maxval, primop1);
2257 /* This used to be a switch, but Genix compiler can't handle that. */
2258 if (code == NE_EXPR)
2260 if (max_lt || min_gt)
2261 val = truthvalue_true_node;
2263 else if (code == EQ_EXPR)
2265 if (max_lt || min_gt)
2266 val = truthvalue_false_node;
2268 else if (code == LT_EXPR)
2271 val = truthvalue_true_node;
2273 val = truthvalue_false_node;
2275 else if (code == GT_EXPR)
2278 val = truthvalue_true_node;
2280 val = truthvalue_false_node;
2282 else if (code == LE_EXPR)
2285 val = truthvalue_true_node;
2287 val = truthvalue_false_node;
2289 else if (code == GE_EXPR)
2292 val = truthvalue_true_node;
2294 val = truthvalue_false_node;
2297 /* If primop0 was sign-extended and unsigned comparison specd,
2298 we did a signed comparison above using the signed type bounds.
2299 But the comparison we output must be unsigned.
2301 Also, for inequalities, VAL is no good; but if the signed
2302 comparison had *any* fixed result, it follows that the
2303 unsigned comparison just tests the sign in reverse
2304 (positive values are LE, negative ones GE).
2305 So we can generate an unsigned comparison
2306 against an extreme value of the signed type. */
2308 if (unsignedp && !unsignedp0)
2315 primop1 = TYPE_MIN_VALUE (type);
2321 primop1 = TYPE_MAX_VALUE (type);
2328 type = c_common_unsigned_type (type);
2331 if (TREE_CODE (primop0) != INTEGER_CST)
2333 if (val == truthvalue_false_node)
2334 warning ("comparison is always false due to limited range of data type");
2335 if (val == truthvalue_true_node)
2336 warning ("comparison is always true due to limited range of data type");
2341 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
2342 if (TREE_SIDE_EFFECTS (primop0))
2343 return build (COMPOUND_EXPR, TREE_TYPE (val), primop0, val);
2347 /* Value is not predetermined, but do the comparison
2348 in the type of the operand that is not constant.
2349 TYPE is already properly set. */
2351 else if (real1 && real2
2352 && (TYPE_PRECISION (TREE_TYPE (primop0))
2353 == TYPE_PRECISION (TREE_TYPE (primop1))))
2354 type = TREE_TYPE (primop0);
2356 /* If args' natural types are both narrower than nominal type
2357 and both extend in the same manner, compare them
2358 in the type of the wider arg.
2359 Otherwise must actually extend both to the nominal
2360 common type lest different ways of extending
2362 (eg, (short)-1 == (unsigned short)-1 should be 0.) */
2364 else if (unsignedp0 == unsignedp1 && real1 == real2
2365 && TYPE_PRECISION (TREE_TYPE (primop0)) < TYPE_PRECISION (*restype_ptr)
2366 && TYPE_PRECISION (TREE_TYPE (primop1)) < TYPE_PRECISION (*restype_ptr))
2368 type = common_type (TREE_TYPE (primop0), TREE_TYPE (primop1));
2369 type = c_common_signed_or_unsigned_type (unsignedp0
2370 || TREE_UNSIGNED (*restype_ptr),
2372 /* Make sure shorter operand is extended the right way
2373 to match the longer operand. */
2375 = convert (c_common_signed_or_unsigned_type (unsignedp0,
2376 TREE_TYPE (primop0)),
2379 = convert (c_common_signed_or_unsigned_type (unsignedp1,
2380 TREE_TYPE (primop1)),
2385 /* Here we must do the comparison on the nominal type
2386 using the args exactly as we received them. */
2387 type = *restype_ptr;
2391 if (!real1 && !real2 && integer_zerop (primop1)
2392 && TREE_UNSIGNED (*restype_ptr))
2398 /* All unsigned values are >= 0, so we warn if extra warnings
2399 are requested. However, if OP0 is a constant that is
2400 >= 0, the signedness of the comparison isn't an issue,
2401 so suppress the warning. */
2402 if (extra_warnings && !in_system_header
2403 && ! (TREE_CODE (primop0) == INTEGER_CST
2404 && ! TREE_OVERFLOW (convert (c_common_signed_type (type),
2406 warning ("comparison of unsigned expression >= 0 is always true");
2407 value = truthvalue_true_node;
2411 if (extra_warnings && !in_system_header
2412 && ! (TREE_CODE (primop0) == INTEGER_CST
2413 && ! TREE_OVERFLOW (convert (c_common_signed_type (type),
2415 warning ("comparison of unsigned expression < 0 is always false");
2416 value = truthvalue_false_node;
2425 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
2426 if (TREE_SIDE_EFFECTS (primop0))
2427 return build (COMPOUND_EXPR, TREE_TYPE (value),
2434 *op0_ptr = convert (type, primop0);
2435 *op1_ptr = convert (type, primop1);
2437 *restype_ptr = truthvalue_type_node;
2442 /* Return a tree for the sum or difference (RESULTCODE says which)
2443 of pointer PTROP and integer INTOP. */
2446 pointer_int_sum (enum tree_code resultcode, tree ptrop, tree intop)
2453 /* The result is a pointer of the same type that is being added. */
2455 tree result_type = TREE_TYPE (ptrop);
2457 if (TREE_CODE (TREE_TYPE (result_type)) == VOID_TYPE)
2459 if (pedantic || warn_pointer_arith)
2460 pedwarn ("pointer of type `void *' used in arithmetic");
2461 size_exp = integer_one_node;
2463 else if (TREE_CODE (TREE_TYPE (result_type)) == FUNCTION_TYPE)
2465 if (pedantic || warn_pointer_arith)
2466 pedwarn ("pointer to a function used in arithmetic");
2467 size_exp = integer_one_node;
2469 else if (TREE_CODE (TREE_TYPE (result_type)) == METHOD_TYPE)
2471 if (pedantic || warn_pointer_arith)
2472 pedwarn ("pointer to member function used in arithmetic");
2473 size_exp = integer_one_node;
2475 else if (TREE_CODE (TREE_TYPE (result_type)) == OFFSET_TYPE)
2477 if (pedantic || warn_pointer_arith)
2478 pedwarn ("pointer to a member used in arithmetic");
2479 size_exp = integer_one_node;
2482 size_exp = size_in_bytes (TREE_TYPE (result_type));
2484 /* If what we are about to multiply by the size of the elements
2485 contains a constant term, apply distributive law
2486 and multiply that constant term separately.
2487 This helps produce common subexpressions. */
2489 if ((TREE_CODE (intop) == PLUS_EXPR || TREE_CODE (intop) == MINUS_EXPR)
2490 && ! TREE_CONSTANT (intop)
2491 && TREE_CONSTANT (TREE_OPERAND (intop, 1))
2492 && TREE_CONSTANT (size_exp)
2493 /* If the constant comes from pointer subtraction,
2494 skip this optimization--it would cause an error. */
2495 && TREE_CODE (TREE_TYPE (TREE_OPERAND (intop, 0))) == INTEGER_TYPE
2496 /* If the constant is unsigned, and smaller than the pointer size,
2497 then we must skip this optimization. This is because it could cause
2498 an overflow error if the constant is negative but INTOP is not. */
2499 && (! TREE_UNSIGNED (TREE_TYPE (intop))
2500 || (TYPE_PRECISION (TREE_TYPE (intop))
2501 == TYPE_PRECISION (TREE_TYPE (ptrop)))))
2503 enum tree_code subcode = resultcode;
2504 tree int_type = TREE_TYPE (intop);
2505 if (TREE_CODE (intop) == MINUS_EXPR)
2506 subcode = (subcode == PLUS_EXPR ? MINUS_EXPR : PLUS_EXPR);
2507 /* Convert both subexpression types to the type of intop,
2508 because weird cases involving pointer arithmetic
2509 can result in a sum or difference with different type args. */
2510 ptrop = build_binary_op (subcode, ptrop,
2511 convert (int_type, TREE_OPERAND (intop, 1)), 1);
2512 intop = convert (int_type, TREE_OPERAND (intop, 0));
2515 /* Convert the integer argument to a type the same size as sizetype
2516 so the multiply won't overflow spuriously. */
2518 if (TYPE_PRECISION (TREE_TYPE (intop)) != TYPE_PRECISION (sizetype)
2519 || TREE_UNSIGNED (TREE_TYPE (intop)) != TREE_UNSIGNED (sizetype))
2520 intop = convert (c_common_type_for_size (TYPE_PRECISION (sizetype),
2521 TREE_UNSIGNED (sizetype)), intop);
2523 /* Replace the integer argument with a suitable product by the object size.
2524 Do this multiplication as signed, then convert to the appropriate
2525 pointer type (actually unsigned integral). */
2527 intop = convert (result_type,
2528 build_binary_op (MULT_EXPR, intop,
2529 convert (TREE_TYPE (intop), size_exp), 1));
2531 /* Create the sum or difference. */
2533 result = build (resultcode, result_type, ptrop, intop);
2535 folded = fold (result);
2536 if (folded == result)
2537 TREE_CONSTANT (folded) = TREE_CONSTANT (ptrop) & TREE_CONSTANT (intop);
2541 /* Prepare expr to be an argument of a TRUTH_NOT_EXPR,
2542 or validate its data type for an `if' or `while' statement or ?..: exp.
2544 This preparation consists of taking the ordinary
2545 representation of an expression expr and producing a valid tree
2546 boolean expression describing whether expr is nonzero. We could
2547 simply always do build_binary_op (NE_EXPR, expr, truthvalue_false_node, 1),
2548 but we optimize comparisons, &&, ||, and !.
2550 The resulting type should always be `truthvalue_type_node'. */
2553 c_common_truthvalue_conversion (tree expr)
2555 if (TREE_CODE (expr) == ERROR_MARK)
2558 #if 0 /* This appears to be wrong for C++. */
2559 /* These really should return error_mark_node after 2.4 is stable.
2560 But not all callers handle ERROR_MARK properly. */
2561 switch (TREE_CODE (TREE_TYPE (expr)))
2564 error ("struct type value used where scalar is required");
2565 return truthvalue_false_node;
2568 error ("union type value used where scalar is required");
2569 return truthvalue_false_node;
2572 error ("array type value used where scalar is required");
2573 return truthvalue_false_node;
2580 switch (TREE_CODE (expr))
2583 case NE_EXPR: case LE_EXPR: case GE_EXPR: case LT_EXPR: case GT_EXPR:
2584 case TRUTH_ANDIF_EXPR:
2585 case TRUTH_ORIF_EXPR:
2586 case TRUTH_AND_EXPR:
2588 case TRUTH_XOR_EXPR:
2589 case TRUTH_NOT_EXPR:
2590 TREE_TYPE (expr) = truthvalue_type_node;
2597 return integer_zerop (expr) ? truthvalue_false_node : truthvalue_true_node;
2600 return real_zerop (expr) ? truthvalue_false_node : truthvalue_true_node;
2603 /* If we are taking the address of an external decl, it might be zero
2604 if it is weak, so we cannot optimize. */
2605 if (DECL_P (TREE_OPERAND (expr, 0))
2606 && DECL_EXTERNAL (TREE_OPERAND (expr, 0)))
2609 if (TREE_SIDE_EFFECTS (TREE_OPERAND (expr, 0)))
2610 return build (COMPOUND_EXPR, truthvalue_type_node,
2611 TREE_OPERAND (expr, 0), truthvalue_true_node);
2613 return truthvalue_true_node;
2616 return build_binary_op ((TREE_SIDE_EFFECTS (TREE_OPERAND (expr, 1))
2617 ? TRUTH_OR_EXPR : TRUTH_ORIF_EXPR),
2618 c_common_truthvalue_conversion (TREE_OPERAND (expr, 0)),
2619 c_common_truthvalue_conversion (TREE_OPERAND (expr, 1)),
2627 /* These don't change whether an object is nonzero or zero. */
2628 return c_common_truthvalue_conversion (TREE_OPERAND (expr, 0));
2632 /* These don't change whether an object is zero or nonzero, but
2633 we can't ignore them if their second arg has side-effects. */
2634 if (TREE_SIDE_EFFECTS (TREE_OPERAND (expr, 1)))
2635 return build (COMPOUND_EXPR, truthvalue_type_node, TREE_OPERAND (expr, 1),
2636 c_common_truthvalue_conversion (TREE_OPERAND (expr, 0)));
2638 return c_common_truthvalue_conversion (TREE_OPERAND (expr, 0));
2641 /* Distribute the conversion into the arms of a COND_EXPR. */
2642 return fold (build (COND_EXPR, truthvalue_type_node, TREE_OPERAND (expr, 0),
2643 c_common_truthvalue_conversion (TREE_OPERAND (expr, 1)),
2644 c_common_truthvalue_conversion (TREE_OPERAND (expr, 2))));
2647 /* Don't cancel the effect of a CONVERT_EXPR from a REFERENCE_TYPE,
2648 since that affects how `default_conversion' will behave. */
2649 if (TREE_CODE (TREE_TYPE (expr)) == REFERENCE_TYPE
2650 || TREE_CODE (TREE_TYPE (TREE_OPERAND (expr, 0))) == REFERENCE_TYPE)
2652 /* Fall through.... */
2654 /* If this is widening the argument, we can ignore it. */
2655 if (TYPE_PRECISION (TREE_TYPE (expr))
2656 >= TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (expr, 0))))
2657 return c_common_truthvalue_conversion (TREE_OPERAND (expr, 0));
2661 /* Perhaps reduce (x - y) != 0 to (x != y). The expressions
2662 aren't guaranteed to the be same for modes that can represent
2663 infinity, since if x and y are both +infinity, or both
2664 -infinity, then x - y is not a number.
2666 Note that this transformation is safe when x or y is NaN.
2667 (x - y) is then NaN, and both (x - y) != 0 and x != y will
2669 if (HONOR_INFINITIES (TYPE_MODE (TREE_TYPE (TREE_OPERAND (expr, 0)))))
2671 /* Fall through.... */
2673 /* This and MINUS_EXPR can be changed into a comparison of the
2675 if (TREE_TYPE (TREE_OPERAND (expr, 0))
2676 == TREE_TYPE (TREE_OPERAND (expr, 1)))
2677 return build_binary_op (NE_EXPR, TREE_OPERAND (expr, 0),
2678 TREE_OPERAND (expr, 1), 1);
2679 return build_binary_op (NE_EXPR, TREE_OPERAND (expr, 0),
2680 fold (build1 (NOP_EXPR,
2681 TREE_TYPE (TREE_OPERAND (expr, 0)),
2682 TREE_OPERAND (expr, 1))), 1);
2685 if (integer_onep (TREE_OPERAND (expr, 1))
2686 && TREE_TYPE (expr) != truthvalue_type_node)
2687 /* Using convert here would cause infinite recursion. */
2688 return build1 (NOP_EXPR, truthvalue_type_node, expr);
2692 if (warn_parentheses && C_EXP_ORIGINAL_CODE (expr) == MODIFY_EXPR)
2693 warning ("suggest parentheses around assignment used as truth value");
2700 if (TREE_CODE (TREE_TYPE (expr)) == COMPLEX_TYPE)
2702 tree t = save_expr (expr);
2703 return (build_binary_op
2704 ((TREE_SIDE_EFFECTS (expr)
2705 ? TRUTH_OR_EXPR : TRUTH_ORIF_EXPR),
2706 c_common_truthvalue_conversion (build_unary_op (REALPART_EXPR, t, 0)),
2707 c_common_truthvalue_conversion (build_unary_op (IMAGPART_EXPR, t, 0)),
2711 return build_binary_op (NE_EXPR, expr, integer_zero_node, 1);
2714 static tree builtin_function_2 (const char *, const char *, tree, tree,
2715 int, enum built_in_class, int, int,
2718 /* Make a variant type in the proper way for C/C++, propagating qualifiers
2719 down to the element type of an array. */
2722 c_build_qualified_type (tree type, int type_quals)
2724 /* A restrict-qualified pointer type must be a pointer to object or
2725 incomplete type. Note that the use of POINTER_TYPE_P also allows
2726 REFERENCE_TYPEs, which is appropriate for C++. Unfortunately,
2727 the C++ front-end also use POINTER_TYPE for pointer-to-member
2728 values, so even though it should be illegal to use `restrict'
2729 with such an entity we don't flag that here. Thus, special case
2730 code for that case is required in the C++ front-end. */
2731 if ((type_quals & TYPE_QUAL_RESTRICT)
2732 && (!POINTER_TYPE_P (type)
2733 || !C_TYPE_OBJECT_OR_INCOMPLETE_P (TREE_TYPE (type))))
2735 error ("invalid use of `restrict'");
2736 type_quals &= ~TYPE_QUAL_RESTRICT;
2739 if (TREE_CODE (type) == ARRAY_TYPE)
2740 return build_array_type (c_build_qualified_type (TREE_TYPE (type),
2742 TYPE_DOMAIN (type));
2743 return build_qualified_type (type, type_quals);
2746 /* Apply the TYPE_QUALS to the new DECL. */
2749 c_apply_type_quals_to_decl (int type_quals, tree decl)
2751 if ((type_quals & TYPE_QUAL_CONST)
2752 || (TREE_TYPE (decl)
2753 && TREE_CODE (TREE_TYPE (decl)) == REFERENCE_TYPE))
2754 TREE_READONLY (decl) = 1;
2755 if (type_quals & TYPE_QUAL_VOLATILE)
2757 TREE_SIDE_EFFECTS (decl) = 1;
2758 TREE_THIS_VOLATILE (decl) = 1;
2760 if (type_quals & TYPE_QUAL_RESTRICT)
2762 if (!TREE_TYPE (decl)
2763 || !POINTER_TYPE_P (TREE_TYPE (decl))
2764 || !C_TYPE_OBJECT_OR_INCOMPLETE_P (TREE_TYPE (TREE_TYPE (decl))))
2765 error ("invalid use of `restrict'");
2766 else if (flag_strict_aliasing)
2767 /* Indicate we need to make a unique alias set for this pointer.
2768 We can't do it here because it might be pointing to an
2770 DECL_POINTER_ALIAS_SET (decl) = -2;
2774 /* Return the typed-based alias set for T, which may be an expression
2775 or a type. Return -1 if we don't do anything special. */
2778 c_common_get_alias_set (tree t)
2782 /* Permit type-punning when accessing a union, provided the access
2783 is directly through the union. For example, this code does not
2784 permit taking the address of a union member and then storing
2785 through it. Even the type-punning allowed here is a GCC
2786 extension, albeit a common and useful one; the C standard says
2787 that such accesses have implementation-defined behavior. */
2789 TREE_CODE (u) == COMPONENT_REF || TREE_CODE (u) == ARRAY_REF;
2790 u = TREE_OPERAND (u, 0))
2791 if (TREE_CODE (u) == COMPONENT_REF
2792 && TREE_CODE (TREE_TYPE (TREE_OPERAND (u, 0))) == UNION_TYPE)
2795 /* That's all the expressions we handle specially. */
2799 /* The C standard guarantees that any object may be accessed via an
2800 lvalue that has character type. */
2801 if (t == char_type_node
2802 || t == signed_char_type_node
2803 || t == unsigned_char_type_node)
2806 /* If it has the may_alias attribute, it can alias anything. */
2807 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (t)))
2810 /* The C standard specifically allows aliasing between signed and
2811 unsigned variants of the same type. We treat the signed
2812 variant as canonical. */
2813 if (TREE_CODE (t) == INTEGER_TYPE && TREE_UNSIGNED (t))
2815 tree t1 = c_common_signed_type (t);
2817 /* t1 == t can happen for boolean nodes which are always unsigned. */
2819 return get_alias_set (t1);
2821 else if (POINTER_TYPE_P (t))
2825 /* Unfortunately, there is no canonical form of a pointer type.
2826 In particular, if we have `typedef int I', then `int *', and
2827 `I *' are different types. So, we have to pick a canonical
2828 representative. We do this below.
2830 Technically, this approach is actually more conservative that
2831 it needs to be. In particular, `const int *' and `int *'
2832 should be in different alias sets, according to the C and C++
2833 standard, since their types are not the same, and so,
2834 technically, an `int **' and `const int **' cannot point at
2837 But, the standard is wrong. In particular, this code is
2842 const int* const* cipp = &ipp;
2844 And, it doesn't make sense for that to be legal unless you
2845 can dereference IPP and CIPP. So, we ignore cv-qualifiers on
2846 the pointed-to types. This issue has been reported to the
2848 t1 = build_type_no_quals (t);
2850 return get_alias_set (t1);
2856 /* Compute the value of 'sizeof (TYPE)' or '__alignof__ (TYPE)', where the
2857 second parameter indicates which OPERATOR is being applied. The COMPLAIN
2858 flag controls whether we should diagnose possibly ill-formed
2859 constructs or not. */
2861 c_sizeof_or_alignof_type (tree type, enum tree_code op, int complain)
2863 const char *op_name;
2865 enum tree_code type_code = TREE_CODE (type);
2867 my_friendly_assert (op == SIZEOF_EXPR || op == ALIGNOF_EXPR, 20020720);
2868 op_name = op == SIZEOF_EXPR ? "sizeof" : "__alignof__";
2870 if (type_code == FUNCTION_TYPE)
2872 if (op == SIZEOF_EXPR)
2874 if (complain && (pedantic || warn_pointer_arith))
2875 pedwarn ("invalid application of `sizeof' to a function type");
2876 value = size_one_node;
2879 value = size_int (FUNCTION_BOUNDARY / BITS_PER_UNIT);
2881 else if (type_code == VOID_TYPE || type_code == ERROR_MARK)
2883 if (type_code == VOID_TYPE
2884 && complain && (pedantic || warn_pointer_arith))
2885 pedwarn ("invalid application of `%s' to a void type", op_name);
2886 value = size_one_node;
2888 else if (!COMPLETE_TYPE_P (type))
2891 error ("invalid application of `%s' to an incomplete type", op_name);
2892 value = size_zero_node;
2896 if (op == SIZEOF_EXPR)
2897 /* Convert in case a char is more than one unit. */
2898 value = size_binop (CEIL_DIV_EXPR, TYPE_SIZE_UNIT (type),
2899 size_int (TYPE_PRECISION (char_type_node)
2902 value = size_int (TYPE_ALIGN (type) / BITS_PER_UNIT);
2905 /* VALUE will have an integer type with TYPE_IS_SIZETYPE set.
2906 TYPE_IS_SIZETYPE means that certain things (like overflow) will
2907 never happen. However, this node should really have type
2908 `size_t', which is just a typedef for an ordinary integer type. */
2909 value = fold (build1 (NOP_EXPR, size_type_node, value));
2910 my_friendly_assert (!TYPE_IS_SIZETYPE (TREE_TYPE (value)), 20001021);
2915 /* Implement the __alignof keyword: Return the minimum required
2916 alignment of EXPR, measured in bytes. For VAR_DECL's and
2917 FIELD_DECL's return DECL_ALIGN (which can be set from an
2918 "aligned" __attribute__ specification). */
2921 c_alignof_expr (tree expr)
2925 if (TREE_CODE (expr) == VAR_DECL)
2926 t = size_int (DECL_ALIGN (expr) / BITS_PER_UNIT);
2928 else if (TREE_CODE (expr) == COMPONENT_REF
2929 && DECL_C_BIT_FIELD (TREE_OPERAND (expr, 1)))
2931 error ("`__alignof' applied to a bit-field");
2934 else if (TREE_CODE (expr) == COMPONENT_REF
2935 && TREE_CODE (TREE_OPERAND (expr, 1)) == FIELD_DECL)
2936 t = size_int (DECL_ALIGN (TREE_OPERAND (expr, 1)) / BITS_PER_UNIT);
2938 else if (TREE_CODE (expr) == INDIRECT_REF)
2940 tree t = TREE_OPERAND (expr, 0);
2942 int bestalign = TYPE_ALIGN (TREE_TYPE (TREE_TYPE (t)));
2944 while (TREE_CODE (t) == NOP_EXPR
2945 && TREE_CODE (TREE_TYPE (TREE_OPERAND (t, 0))) == POINTER_TYPE)
2949 t = TREE_OPERAND (t, 0);
2950 thisalign = TYPE_ALIGN (TREE_TYPE (TREE_TYPE (t)));
2951 if (thisalign > bestalign)
2952 best = t, bestalign = thisalign;
2954 return c_alignof (TREE_TYPE (TREE_TYPE (best)));
2957 return c_alignof (TREE_TYPE (expr));
2959 return fold (build1 (NOP_EXPR, size_type_node, t));
2962 /* Handle C and C++ default attributes. */
2964 enum built_in_attribute
2966 #define DEF_ATTR_NULL_TREE(ENUM) ENUM,
2967 #define DEF_ATTR_INT(ENUM, VALUE) ENUM,
2968 #define DEF_ATTR_IDENT(ENUM, STRING) ENUM,
2969 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) ENUM,
2970 #define DEF_FN_ATTR(NAME, ATTRS, PREDICATE) /* No entry needed in enum. */
2971 #include "builtin-attrs.def"
2972 #undef DEF_ATTR_NULL_TREE
2974 #undef DEF_ATTR_IDENT
2975 #undef DEF_ATTR_TREE_LIST
2980 static GTY(()) tree built_in_attributes[(int) ATTR_LAST];
2982 static bool c_attrs_initialized = false;
2984 static void c_init_attributes (void);
2986 /* Build tree nodes and builtin functions common to both C and C++ language
2990 c_common_nodes_and_builtins (void)
2994 #define DEF_PRIMITIVE_TYPE(NAME, VALUE) NAME,
2995 #define DEF_FUNCTION_TYPE_0(NAME, RETURN) NAME,
2996 #define DEF_FUNCTION_TYPE_1(NAME, RETURN, ARG1) NAME,
2997 #define DEF_FUNCTION_TYPE_2(NAME, RETURN, ARG1, ARG2) NAME,
2998 #define DEF_FUNCTION_TYPE_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
2999 #define DEF_FUNCTION_TYPE_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME,
3000 #define DEF_FUNCTION_TYPE_VAR_0(NAME, RETURN) NAME,
3001 #define DEF_FUNCTION_TYPE_VAR_1(NAME, RETURN, ARG1) NAME,
3002 #define DEF_FUNCTION_TYPE_VAR_2(NAME, RETURN, ARG1, ARG2) NAME,
3003 #define DEF_FUNCTION_TYPE_VAR_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
3004 #define DEF_POINTER_TYPE(NAME, TYPE) NAME,
3005 #include "builtin-types.def"
3006 #undef DEF_PRIMITIVE_TYPE
3007 #undef DEF_FUNCTION_TYPE_0
3008 #undef DEF_FUNCTION_TYPE_1
3009 #undef DEF_FUNCTION_TYPE_2
3010 #undef DEF_FUNCTION_TYPE_3
3011 #undef DEF_FUNCTION_TYPE_4
3012 #undef DEF_FUNCTION_TYPE_VAR_0
3013 #undef DEF_FUNCTION_TYPE_VAR_1
3014 #undef DEF_FUNCTION_TYPE_VAR_2
3015 #undef DEF_FUNCTION_TYPE_VAR_3
3016 #undef DEF_POINTER_TYPE
3020 typedef enum builtin_type builtin_type;
3022 tree builtin_types[(int) BT_LAST];
3023 int wchar_type_size;
3024 tree array_domain_type;
3025 tree va_list_ref_type_node;
3026 tree va_list_arg_type_node;
3028 /* Define `int' and `char' first so that dbx will output them first. */
3029 record_builtin_type (RID_INT, NULL, integer_type_node);
3030 record_builtin_type (RID_CHAR, "char", char_type_node);
3032 /* `signed' is the same as `int'. FIXME: the declarations of "signed",
3033 "unsigned long", "long long unsigned" and "unsigned short" were in C++
3034 but not C. Are the conditionals here needed? */
3035 if (c_dialect_cxx ())
3036 record_builtin_type (RID_SIGNED, NULL, integer_type_node);
3037 record_builtin_type (RID_LONG, "long int", long_integer_type_node);
3038 record_builtin_type (RID_UNSIGNED, "unsigned int", unsigned_type_node);
3039 record_builtin_type (RID_MAX, "long unsigned int",
3040 long_unsigned_type_node);
3041 if (c_dialect_cxx ())
3042 record_builtin_type (RID_MAX, "unsigned long", long_unsigned_type_node);
3043 record_builtin_type (RID_MAX, "long long int",
3044 long_long_integer_type_node);
3045 record_builtin_type (RID_MAX, "long long unsigned int",
3046 long_long_unsigned_type_node);
3047 if (c_dialect_cxx ())
3048 record_builtin_type (RID_MAX, "long long unsigned",
3049 long_long_unsigned_type_node);
3050 record_builtin_type (RID_SHORT, "short int", short_integer_type_node);
3051 record_builtin_type (RID_MAX, "short unsigned int",
3052 short_unsigned_type_node);
3053 if (c_dialect_cxx ())
3054 record_builtin_type (RID_MAX, "unsigned short",
3055 short_unsigned_type_node);
3057 /* Define both `signed char' and `unsigned char'. */
3058 record_builtin_type (RID_MAX, "signed char", signed_char_type_node);
3059 record_builtin_type (RID_MAX, "unsigned char", unsigned_char_type_node);
3061 /* These are types that c_common_type_for_size and
3062 c_common_type_for_mode use. */
3063 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL, NULL_TREE,
3065 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL, NULL_TREE,
3067 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL, NULL_TREE,
3069 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL, NULL_TREE,
3071 #if HOST_BITS_PER_WIDE_INT >= 64
3072 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL,
3073 get_identifier ("__int128_t"),
3076 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL, NULL_TREE,
3077 unsigned_intQI_type_node));
3078 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL, NULL_TREE,
3079 unsigned_intHI_type_node));
3080 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL, NULL_TREE,
3081 unsigned_intSI_type_node));
3082 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL, NULL_TREE,
3083 unsigned_intDI_type_node));
3084 #if HOST_BITS_PER_WIDE_INT >= 64
3085 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL,
3086 get_identifier ("__uint128_t"),
3087 unsigned_intTI_type_node));
3090 /* Create the widest literal types. */
3091 widest_integer_literal_type_node
3092 = make_signed_type (HOST_BITS_PER_WIDE_INT * 2);
3093 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL, NULL_TREE,
3094 widest_integer_literal_type_node));
3096 widest_unsigned_literal_type_node
3097 = make_unsigned_type (HOST_BITS_PER_WIDE_INT * 2);
3098 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL, NULL_TREE,
3099 widest_unsigned_literal_type_node));
3101 /* `unsigned long' is the standard type for sizeof.
3102 Note that stddef.h uses `unsigned long',
3103 and this must agree, even if long and int are the same size. */
3105 TREE_TYPE (identifier_global_value (get_identifier (SIZE_TYPE)));
3106 signed_size_type_node = c_common_signed_type (size_type_node);
3107 set_sizetype (size_type_node);
3109 build_common_tree_nodes_2 (flag_short_double);
3111 record_builtin_type (RID_FLOAT, NULL, float_type_node);
3112 record_builtin_type (RID_DOUBLE, NULL, double_type_node);
3113 record_builtin_type (RID_MAX, "long double", long_double_type_node);
3115 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL,
3116 get_identifier ("complex int"),
3117 complex_integer_type_node));
3118 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL,
3119 get_identifier ("complex float"),
3120 complex_float_type_node));
3121 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL,
3122 get_identifier ("complex double"),
3123 complex_double_type_node));
3124 (*lang_hooks.decls.pushdecl)
3125 (build_decl (TYPE_DECL, get_identifier ("complex long double"),
3126 complex_long_double_type_node));
3128 /* Types which are common to the fortran compiler and libf2c. When
3129 changing these, you also need to be concerned with f/com.h. */
3131 if (TYPE_PRECISION (float_type_node)
3132 == TYPE_PRECISION (long_integer_type_node))
3134 g77_integer_type_node = long_integer_type_node;
3135 g77_uinteger_type_node = long_unsigned_type_node;
3137 else if (TYPE_PRECISION (float_type_node)
3138 == TYPE_PRECISION (integer_type_node))
3140 g77_integer_type_node = integer_type_node;
3141 g77_uinteger_type_node = unsigned_type_node;
3144 g77_integer_type_node = g77_uinteger_type_node = NULL_TREE;
3146 if (g77_integer_type_node != NULL_TREE)
3148 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL,
3149 get_identifier ("__g77_integer"),
3150 g77_integer_type_node));
3151 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL,
3152 get_identifier ("__g77_uinteger"),
3153 g77_uinteger_type_node));
3156 if (TYPE_PRECISION (float_type_node) * 2
3157 == TYPE_PRECISION (long_integer_type_node))
3159 g77_longint_type_node = long_integer_type_node;
3160 g77_ulongint_type_node = long_unsigned_type_node;
3162 else if (TYPE_PRECISION (float_type_node) * 2
3163 == TYPE_PRECISION (long_long_integer_type_node))
3165 g77_longint_type_node = long_long_integer_type_node;
3166 g77_ulongint_type_node = long_long_unsigned_type_node;
3169 g77_longint_type_node = g77_ulongint_type_node = NULL_TREE;
3171 if (g77_longint_type_node != NULL_TREE)
3173 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL,
3174 get_identifier ("__g77_longint"),
3175 g77_longint_type_node));
3176 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL,
3177 get_identifier ("__g77_ulongint"),
3178 g77_ulongint_type_node));
3181 record_builtin_type (RID_VOID, NULL, void_type_node);
3183 void_zero_node = build_int_2 (0, 0);
3184 TREE_TYPE (void_zero_node) = void_type_node;
3186 void_list_node = build_void_list_node ();
3188 /* Make a type to be the domain of a few array types
3189 whose domains don't really matter.
3190 200 is small enough that it always fits in size_t
3191 and large enough that it can hold most function names for the
3192 initializations of __FUNCTION__ and __PRETTY_FUNCTION__. */
3193 array_domain_type = build_index_type (size_int (200));
3195 /* Make a type for arrays of characters.
3196 With luck nothing will ever really depend on the length of this
3198 char_array_type_node
3199 = build_array_type (char_type_node, array_domain_type);
3201 /* Likewise for arrays of ints. */
3203 = build_array_type (integer_type_node, array_domain_type);
3205 string_type_node = build_pointer_type (char_type_node);
3206 const_string_type_node
3207 = build_pointer_type (build_qualified_type
3208 (char_type_node, TYPE_QUAL_CONST));
3210 /* This is special for C++ so functions can be overloaded. */
3211 wchar_type_node = get_identifier (MODIFIED_WCHAR_TYPE);
3212 wchar_type_node = TREE_TYPE (identifier_global_value (wchar_type_node));
3213 wchar_type_size = TYPE_PRECISION (wchar_type_node);
3214 if (c_dialect_cxx ())
3216 if (TREE_UNSIGNED (wchar_type_node))
3217 wchar_type_node = make_unsigned_type (wchar_type_size);
3219 wchar_type_node = make_signed_type (wchar_type_size);
3220 record_builtin_type (RID_WCHAR, "wchar_t", wchar_type_node);
3224 signed_wchar_type_node = c_common_signed_type (wchar_type_node);
3225 unsigned_wchar_type_node = c_common_unsigned_type (wchar_type_node);
3228 /* This is for wide string constants. */
3229 wchar_array_type_node
3230 = build_array_type (wchar_type_node, array_domain_type);
3233 TREE_TYPE (identifier_global_value (get_identifier (WINT_TYPE)));
3236 TREE_TYPE (identifier_global_value (get_identifier (INTMAX_TYPE)));
3238 TREE_TYPE (identifier_global_value (get_identifier (UINTMAX_TYPE)));
3240 default_function_type = build_function_type (integer_type_node, NULL_TREE);
3242 = TREE_TYPE (identifier_global_value (get_identifier (PTRDIFF_TYPE)));
3243 unsigned_ptrdiff_type_node = c_common_unsigned_type (ptrdiff_type_node);
3245 (*lang_hooks.decls.pushdecl)
3246 (build_decl (TYPE_DECL, get_identifier ("__builtin_va_list"),
3247 va_list_type_node));
3249 (*lang_hooks.decls.pushdecl)
3250 (build_decl (TYPE_DECL, get_identifier ("__builtin_ptrdiff_t"),
3251 ptrdiff_type_node));
3253 (*lang_hooks.decls.pushdecl)
3254 (build_decl (TYPE_DECL, get_identifier ("__builtin_size_t"),
3257 if (TREE_CODE (va_list_type_node) == ARRAY_TYPE)
3259 va_list_arg_type_node = va_list_ref_type_node =
3260 build_pointer_type (TREE_TYPE (va_list_type_node));
3264 va_list_arg_type_node = va_list_type_node;
3265 va_list_ref_type_node = build_reference_type (va_list_type_node);
3268 #define DEF_PRIMITIVE_TYPE(ENUM, VALUE) \
3269 builtin_types[(int) ENUM] = VALUE;
3270 #define DEF_FUNCTION_TYPE_0(ENUM, RETURN) \
3271 builtin_types[(int) ENUM] \
3272 = build_function_type (builtin_types[(int) RETURN], \
3274 #define DEF_FUNCTION_TYPE_1(ENUM, RETURN, ARG1) \
3275 builtin_types[(int) ENUM] \
3276 = build_function_type (builtin_types[(int) RETURN], \
3277 tree_cons (NULL_TREE, \
3278 builtin_types[(int) ARG1], \
3280 #define DEF_FUNCTION_TYPE_2(ENUM, RETURN, ARG1, ARG2) \
3281 builtin_types[(int) ENUM] \
3282 = build_function_type \
3283 (builtin_types[(int) RETURN], \
3284 tree_cons (NULL_TREE, \
3285 builtin_types[(int) ARG1], \
3286 tree_cons (NULL_TREE, \
3287 builtin_types[(int) ARG2], \
3289 #define DEF_FUNCTION_TYPE_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
3290 builtin_types[(int) ENUM] \
3291 = build_function_type \
3292 (builtin_types[(int) RETURN], \
3293 tree_cons (NULL_TREE, \
3294 builtin_types[(int) ARG1], \
3295 tree_cons (NULL_TREE, \
3296 builtin_types[(int) ARG2], \
3297 tree_cons (NULL_TREE, \
3298 builtin_types[(int) ARG3], \
3300 #define DEF_FUNCTION_TYPE_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \
3301 builtin_types[(int) ENUM] \
3302 = build_function_type \
3303 (builtin_types[(int) RETURN], \
3304 tree_cons (NULL_TREE, \
3305 builtin_types[(int) ARG1], \
3306 tree_cons (NULL_TREE, \
3307 builtin_types[(int) ARG2], \
3310 builtin_types[(int) ARG3], \
3311 tree_cons (NULL_TREE, \
3312 builtin_types[(int) ARG4], \
3313 void_list_node)))));
3314 #define DEF_FUNCTION_TYPE_VAR_0(ENUM, RETURN) \
3315 builtin_types[(int) ENUM] \
3316 = build_function_type (builtin_types[(int) RETURN], NULL_TREE);
3317 #define DEF_FUNCTION_TYPE_VAR_1(ENUM, RETURN, ARG1) \
3318 builtin_types[(int) ENUM] \
3319 = build_function_type (builtin_types[(int) RETURN], \
3320 tree_cons (NULL_TREE, \
3321 builtin_types[(int) ARG1], \
3324 #define DEF_FUNCTION_TYPE_VAR_2(ENUM, RETURN, ARG1, ARG2) \
3325 builtin_types[(int) ENUM] \
3326 = build_function_type \
3327 (builtin_types[(int) RETURN], \
3328 tree_cons (NULL_TREE, \
3329 builtin_types[(int) ARG1], \
3330 tree_cons (NULL_TREE, \
3331 builtin_types[(int) ARG2], \
3334 #define DEF_FUNCTION_TYPE_VAR_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
3335 builtin_types[(int) ENUM] \
3336 = build_function_type \
3337 (builtin_types[(int) RETURN], \
3338 tree_cons (NULL_TREE, \
3339 builtin_types[(int) ARG1], \
3340 tree_cons (NULL_TREE, \
3341 builtin_types[(int) ARG2], \
3342 tree_cons (NULL_TREE, \
3343 builtin_types[(int) ARG3], \
3346 #define DEF_POINTER_TYPE(ENUM, TYPE) \
3347 builtin_types[(int) ENUM] \
3348 = build_pointer_type (builtin_types[(int) TYPE]);
3349 #include "builtin-types.def"
3350 #undef DEF_PRIMITIVE_TYPE
3351 #undef DEF_FUNCTION_TYPE_1
3352 #undef DEF_FUNCTION_TYPE_2
3353 #undef DEF_FUNCTION_TYPE_3
3354 #undef DEF_FUNCTION_TYPE_4
3355 #undef DEF_FUNCTION_TYPE_VAR_0
3356 #undef DEF_FUNCTION_TYPE_VAR_1
3357 #undef DEF_FUNCTION_TYPE_VAR_2
3358 #undef DEF_FUNCTION_TYPE_VAR_3
3359 #undef DEF_POINTER_TYPE
3361 if (!c_attrs_initialized)
3362 c_init_attributes ();
3364 #define DEF_BUILTIN(ENUM, NAME, CLASS, TYPE, LIBTYPE, \
3365 BOTH_P, FALLBACK_P, NONANSI_P, ATTRS, IMPLICIT) \
3370 if (strncmp (NAME, "__builtin_", strlen ("__builtin_")) != 0) \
3374 decl = builtin_function (NAME, builtin_types[TYPE], ENUM, \
3377 ? (NAME + strlen ("__builtin_")) \
3379 built_in_attributes[(int) ATTRS]); \
3381 decl = builtin_function_2 (NAME, \
3382 NAME + strlen ("__builtin_"), \
3383 builtin_types[TYPE], \
3384 builtin_types[LIBTYPE], \
3389 built_in_attributes[(int) ATTRS]); \
3391 built_in_decls[(int) ENUM] = decl; \
3393 implicit_built_in_decls[(int) ENUM] = decl; \
3395 #include "builtins.def"
3398 (*targetm.init_builtins) ();
3400 main_identifier_node = get_identifier ("main");
3404 build_va_arg (tree expr, tree type)
3406 return build1 (VA_ARG_EXPR, type, expr);
3410 /* Linked list of disabled built-in functions. */
3412 typedef struct disabled_builtin
3415 struct disabled_builtin *next;
3417 static disabled_builtin *disabled_builtins = NULL;
3419 static bool builtin_function_disabled_p (const char *);
3421 /* Disable a built-in function specified by -fno-builtin-NAME. If NAME
3422 begins with "__builtin_", give an error. */
3425 disable_builtin_function (const char *name)
3427 if (strncmp (name, "__builtin_", strlen ("__builtin_")) == 0)
3428 error ("cannot disable built-in function `%s'", name);
3431 disabled_builtin *new = xmalloc (sizeof (disabled_builtin));
3433 new->next = disabled_builtins;
3434 disabled_builtins = new;
3439 /* Return true if the built-in function NAME has been disabled, false
3443 builtin_function_disabled_p (const char *name)
3445 disabled_builtin *p;
3446 for (p = disabled_builtins; p != NULL; p = p->next)
3448 if (strcmp (name, p->name) == 0)
3455 /* Possibly define a builtin function with one or two names. BUILTIN_NAME
3456 is an __builtin_-prefixed name; NAME is the ordinary name; one or both
3457 of these may be NULL (though both being NULL is useless).
3458 BUILTIN_TYPE is the type of the __builtin_-prefixed function;
3459 TYPE is the type of the function with the ordinary name. These
3460 may differ if the ordinary name is declared with a looser type to avoid
3461 conflicts with headers. FUNCTION_CODE and CLASS are as for
3462 builtin_function. If LIBRARY_NAME_P is nonzero, NAME is passed as
3463 the LIBRARY_NAME parameter to builtin_function when declaring BUILTIN_NAME.
3464 If NONANSI_P is nonzero, the name NAME is treated as a non-ANSI name;
3465 ATTRS is the tree list representing the builtin's function attributes.
3466 Returns the declaration of BUILTIN_NAME, if any, otherwise
3467 the declaration of NAME. Does not declare NAME if flag_no_builtin,
3468 or if NONANSI_P and flag_no_nonansi_builtin. */
3471 builtin_function_2 (const char *builtin_name, const char *name,
3472 tree builtin_type, tree type, int function_code,
3473 enum built_in_class class, int library_name_p,
3474 int nonansi_p, tree attrs)
3476 tree bdecl = NULL_TREE;
3477 tree decl = NULL_TREE;
3479 if (builtin_name != 0)
3480 bdecl = builtin_function (builtin_name, builtin_type, function_code,
3481 class, library_name_p ? name : NULL, attrs);
3483 if (name != 0 && !flag_no_builtin && !builtin_function_disabled_p (name)
3484 && !(nonansi_p && flag_no_nonansi_builtin))
3485 decl = builtin_function (name, type, function_code, class, NULL, attrs);
3487 return (bdecl != 0 ? bdecl : decl);
3490 /* Nonzero if the type T promotes to int. This is (nearly) the
3491 integral promotions defined in ISO C99 6.3.1.1/2. */
3494 c_promoting_integer_type_p (tree t)
3496 switch (TREE_CODE (t))
3499 return (TYPE_MAIN_VARIANT (t) == char_type_node
3500 || TYPE_MAIN_VARIANT (t) == signed_char_type_node
3501 || TYPE_MAIN_VARIANT (t) == unsigned_char_type_node
3502 || TYPE_MAIN_VARIANT (t) == short_integer_type_node
3503 || TYPE_MAIN_VARIANT (t) == short_unsigned_type_node
3504 || TYPE_PRECISION (t) < TYPE_PRECISION (integer_type_node));
3507 /* ??? Technically all enumerations not larger than an int
3508 promote to an int. But this is used along code paths
3509 that only want to notice a size change. */
3510 return TYPE_PRECISION (t) < TYPE_PRECISION (integer_type_node);
3520 /* Return 1 if PARMS specifies a fixed number of parameters
3521 and none of their types is affected by default promotions. */
3524 self_promoting_args_p (tree parms)
3527 for (t = parms; t; t = TREE_CHAIN (t))
3529 tree type = TREE_VALUE (t);
3531 if (TREE_CHAIN (t) == 0 && type != void_type_node)
3537 if (TYPE_MAIN_VARIANT (type) == float_type_node)
3540 if (c_promoting_integer_type_p (type))
3546 /* Recursively examines the array elements of TYPE, until a non-array
3547 element type is found. */
3550 strip_array_types (tree type)
3552 while (TREE_CODE (type) == ARRAY_TYPE)
3553 type = TREE_TYPE (type);
3558 static tree expand_unordered_cmp (tree, tree, enum tree_code, enum tree_code);
3560 /* Expand a call to an unordered comparison function such as
3561 __builtin_isgreater(). FUNCTION is the function's declaration and
3562 PARAMS a list of the values passed. For __builtin_isunordered(),
3563 UNORDERED_CODE is UNORDERED_EXPR and ORDERED_CODE is NOP_EXPR. In
3564 other cases, UNORDERED_CODE and ORDERED_CODE are comparison codes
3565 that give the opposite of the desired result. UNORDERED_CODE is
3566 used for modes that can hold NaNs and ORDERED_CODE is used for the
3570 expand_unordered_cmp (tree function, tree params,
3571 enum tree_code unordered_code,
3572 enum tree_code ordered_code)
3574 tree arg0, arg1, type;
3575 enum tree_code code0, code1;
3577 /* Check that we have exactly two arguments. */
3578 if (params == 0 || TREE_CHAIN (params) == 0)
3580 error ("too few arguments to function `%s'",
3581 IDENTIFIER_POINTER (DECL_NAME (function)));
3582 return error_mark_node;
3584 else if (TREE_CHAIN (TREE_CHAIN (params)) != 0)
3586 error ("too many arguments to function `%s'",
3587 IDENTIFIER_POINTER (DECL_NAME (function)));
3588 return error_mark_node;
3591 arg0 = TREE_VALUE (params);
3592 arg1 = TREE_VALUE (TREE_CHAIN (params));
3594 code0 = TREE_CODE (TREE_TYPE (arg0));
3595 code1 = TREE_CODE (TREE_TYPE (arg1));
3597 /* Make sure that the arguments have a common type of REAL. */
3599 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE)
3600 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE))
3601 type = common_type (TREE_TYPE (arg0), TREE_TYPE (arg1));
3603 if (type == 0 || TREE_CODE (type) != REAL_TYPE)
3605 error ("non-floating-point argument to function `%s'",
3606 IDENTIFIER_POINTER (DECL_NAME (function)));
3607 return error_mark_node;
3610 if (unordered_code == UNORDERED_EXPR)
3612 if (MODE_HAS_NANS (TYPE_MODE (type)))
3613 return build_binary_op (unordered_code,
3614 convert (type, arg0),
3615 convert (type, arg1),
3618 return integer_zero_node;
3621 return build_unary_op (TRUTH_NOT_EXPR,
3622 build_binary_op (MODE_HAS_NANS (TYPE_MODE (type))
3625 convert (type, arg0),
3626 convert (type, arg1),
3632 /* Recognize certain built-in functions so we can make tree-codes
3633 other than CALL_EXPR. We do this when it enables fold-const.c
3634 to do something useful. */
3635 /* ??? By rights this should go in builtins.c, but only C and C++
3636 implement build_{binary,unary}_op. Not exactly sure what bits
3637 of functionality are actually needed from those functions, or
3638 where the similar functionality exists in the other front ends. */
3641 expand_tree_builtin (tree function, tree params, tree coerced_params)
3643 if (DECL_BUILT_IN_CLASS (function) != BUILT_IN_NORMAL)
3646 switch (DECL_FUNCTION_CODE (function))
3650 case BUILT_IN_LLABS:
3651 case BUILT_IN_IMAXABS:
3653 case BUILT_IN_FABSL:
3654 case BUILT_IN_FABSF:
3655 if (coerced_params == 0)
3656 return integer_zero_node;
3657 return build_unary_op (ABS_EXPR, TREE_VALUE (coerced_params), 0);
3660 case BUILT_IN_CONJF:
3661 case BUILT_IN_CONJL:
3662 if (coerced_params == 0)
3663 return integer_zero_node;
3664 return build_unary_op (CONJ_EXPR, TREE_VALUE (coerced_params), 0);
3666 case BUILT_IN_CREAL:
3667 case BUILT_IN_CREALF:
3668 case BUILT_IN_CREALL:
3669 if (coerced_params == 0)
3670 return integer_zero_node;
3671 return build_unary_op (REALPART_EXPR, TREE_VALUE (coerced_params), 0);
3673 case BUILT_IN_CIMAG:
3674 case BUILT_IN_CIMAGF:
3675 case BUILT_IN_CIMAGL:
3676 if (coerced_params == 0)
3677 return integer_zero_node;
3678 return build_unary_op (IMAGPART_EXPR, TREE_VALUE (coerced_params), 0);
3680 case BUILT_IN_ISGREATER:
3681 return expand_unordered_cmp (function, params, UNLE_EXPR, LE_EXPR);
3683 case BUILT_IN_ISGREATEREQUAL:
3684 return expand_unordered_cmp (function, params, UNLT_EXPR, LT_EXPR);
3686 case BUILT_IN_ISLESS:
3687 return expand_unordered_cmp (function, params, UNGE_EXPR, GE_EXPR);
3689 case BUILT_IN_ISLESSEQUAL:
3690 return expand_unordered_cmp (function, params, UNGT_EXPR, GT_EXPR);
3692 case BUILT_IN_ISLESSGREATER:
3693 return expand_unordered_cmp (function, params, UNEQ_EXPR, EQ_EXPR);
3695 case BUILT_IN_ISUNORDERED:
3696 return expand_unordered_cmp (function, params, UNORDERED_EXPR, NOP_EXPR);
3705 /* Walk the statement tree, rooted at *tp. Apply FUNC to all the
3706 sub-trees of *TP in a pre-order traversal. FUNC is called with the
3707 DATA and the address of each sub-tree. If FUNC returns a non-NULL
3708 value, the traversal is aborted, and the value returned by FUNC is
3709 returned. If FUNC sets WALK_SUBTREES to zero, then the subtrees of
3710 the node being visited are not walked.
3712 We don't need a without_duplicates variant of this one because the
3713 statement tree is a tree, not a graph. */
3716 walk_stmt_tree (tree *tp, walk_tree_fn func, void *data)
3718 enum tree_code code;
3723 #define WALK_SUBTREE(NODE) \
3726 result = walk_stmt_tree (&(NODE), func, data); \
3732 /* Skip empty subtrees. */
3736 /* Skip subtrees below non-statement nodes. */
3737 if (!STATEMENT_CODE_P (TREE_CODE (*tp)))
3740 /* Call the function. */
3742 result = (*func) (tp, &walk_subtrees, data);
3744 /* If we found something, return it. */
3748 /* FUNC may have modified the tree, recheck that we're looking at a
3750 code = TREE_CODE (*tp);
3751 if (!STATEMENT_CODE_P (code))
3754 /* Visit the subtrees unless FUNC decided that there was nothing
3755 interesting below this point in the tree. */
3758 /* Walk over all the sub-trees of this operand. Statement nodes
3759 never contain RTL, and we needn't worry about TARGET_EXPRs. */
3760 len = TREE_CODE_LENGTH (code);
3762 /* Go through the subtrees. We need to do this in forward order so
3763 that the scope of a FOR_EXPR is handled properly. */
3764 for (i = 0; i < len; ++i)
3765 WALK_SUBTREE (TREE_OPERAND (*tp, i));
3768 /* Finally visit the chain. This can be tail-recursion optimized if
3769 we write it this way. */
3770 return walk_stmt_tree (&TREE_CHAIN (*tp), func, data);
3775 /* Used to compare case labels. K1 and K2 are actually tree nodes
3776 representing case labels, or NULL_TREE for a `default' label.
3777 Returns -1 if K1 is ordered before K2, -1 if K1 is ordered after
3778 K2, and 0 if K1 and K2 are equal. */
3781 case_compare (splay_tree_key k1, splay_tree_key k2)
3783 /* Consider a NULL key (such as arises with a `default' label) to be
3784 smaller than anything else. */
3790 return tree_int_cst_compare ((tree) k1, (tree) k2);
3793 /* Process a case label for the range LOW_VALUE ... HIGH_VALUE. If
3794 LOW_VALUE and HIGH_VALUE are both NULL_TREE then this case label is
3795 actually a `default' label. If only HIGH_VALUE is NULL_TREE, then
3796 case label was declared using the usual C/C++ syntax, rather than
3797 the GNU case range extension. CASES is a tree containing all the
3798 case ranges processed so far; COND is the condition for the
3799 switch-statement itself. Returns the CASE_LABEL created, or
3800 ERROR_MARK_NODE if no CASE_LABEL is created. */
3803 c_add_case_label (splay_tree cases, tree cond, tree low_value,
3809 splay_tree_node node;
3811 /* Create the LABEL_DECL itself. */
3812 label = build_decl (LABEL_DECL, NULL_TREE, NULL_TREE);
3813 DECL_CONTEXT (label) = current_function_decl;
3815 /* If there was an error processing the switch condition, bail now
3816 before we get more confused. */
3817 if (!cond || cond == error_mark_node)
3819 /* Add a label anyhow so that the back-end doesn't think that
3820 the beginning of the switch is unreachable. */
3822 add_stmt (build_case_label (NULL_TREE, NULL_TREE, label));
3823 return error_mark_node;
3826 if ((low_value && TREE_TYPE (low_value)
3827 && POINTER_TYPE_P (TREE_TYPE (low_value)))
3828 || (high_value && TREE_TYPE (high_value)
3829 && POINTER_TYPE_P (TREE_TYPE (high_value))))
3830 error ("pointers are not permitted as case values");
3832 /* Case ranges are a GNU extension. */
3833 if (high_value && pedantic)
3834 pedwarn ("range expressions in switch statements are non-standard");
3836 type = TREE_TYPE (cond);
3839 low_value = check_case_value (low_value);
3840 low_value = convert_and_check (type, low_value);
3844 high_value = check_case_value (high_value);
3845 high_value = convert_and_check (type, high_value);
3848 /* If an error has occurred, bail out now. */
3849 if (low_value == error_mark_node || high_value == error_mark_node)
3852 add_stmt (build_case_label (NULL_TREE, NULL_TREE, label));
3853 return error_mark_node;
3856 /* If the LOW_VALUE and HIGH_VALUE are the same, then this isn't
3857 really a case range, even though it was written that way. Remove
3858 the HIGH_VALUE to simplify later processing. */
3859 if (tree_int_cst_equal (low_value, high_value))
3860 high_value = NULL_TREE;
3861 if (low_value && high_value
3862 && !tree_int_cst_lt (low_value, high_value))
3863 warning ("empty range specified");
3865 /* Look up the LOW_VALUE in the table of case labels we already
3867 node = splay_tree_lookup (cases, (splay_tree_key) low_value);
3868 /* If there was not an exact match, check for overlapping ranges.
3869 There's no need to do this if there's no LOW_VALUE or HIGH_VALUE;
3870 that's a `default' label and the only overlap is an exact match. */
3871 if (!node && (low_value || high_value))
3873 splay_tree_node low_bound;
3874 splay_tree_node high_bound;
3876 /* Even though there wasn't an exact match, there might be an
3877 overlap between this case range and another case range.
3878 Since we've (inductively) not allowed any overlapping case
3879 ranges, we simply need to find the greatest low case label
3880 that is smaller that LOW_VALUE, and the smallest low case
3881 label that is greater than LOW_VALUE. If there is an overlap
3882 it will occur in one of these two ranges. */
3883 low_bound = splay_tree_predecessor (cases,
3884 (splay_tree_key) low_value);
3885 high_bound = splay_tree_successor (cases,
3886 (splay_tree_key) low_value);
3888 /* Check to see if the LOW_BOUND overlaps. It is smaller than
3889 the LOW_VALUE, so there is no need to check unless the
3890 LOW_BOUND is in fact itself a case range. */
3892 && CASE_HIGH ((tree) low_bound->value)
3893 && tree_int_cst_compare (CASE_HIGH ((tree) low_bound->value),
3896 /* Check to see if the HIGH_BOUND overlaps. The low end of that
3897 range is bigger than the low end of the current range, so we
3898 are only interested if the current range is a real range, and
3899 not an ordinary case label. */
3902 && (tree_int_cst_compare ((tree) high_bound->key,
3907 /* If there was an overlap, issue an error. */
3910 tree duplicate = CASE_LABEL_DECL ((tree) node->value);
3914 error ("duplicate (or overlapping) case value");
3915 error ("%Hthis is the first entry overlapping that value",
3916 &DECL_SOURCE_LOCATION (duplicate));
3920 error ("duplicate case value") ;
3921 error ("%Hpreviously used here", &DECL_SOURCE_LOCATION (duplicate));
3925 error ("multiple default labels in one switch");
3926 error ("%Hthis is the first default label",
3927 &DECL_SOURCE_LOCATION (duplicate));
3930 add_stmt (build_case_label (NULL_TREE, NULL_TREE, label));
3933 /* Add a CASE_LABEL to the statement-tree. */
3934 case_label = add_stmt (build_case_label (low_value, high_value, label));
3935 /* Register this case label in the splay tree. */
3936 splay_tree_insert (cases,
3937 (splay_tree_key) low_value,
3938 (splay_tree_value) case_label);
3943 /* Finish an expression taking the address of LABEL (an
3944 IDENTIFIER_NODE). Returns an expression for the address. */
3947 finish_label_address_expr (tree label)
3952 pedwarn ("taking the address of a label is non-standard");
3954 if (label == error_mark_node)
3955 return error_mark_node;
3957 label = lookup_label (label);
3958 if (label == NULL_TREE)
3959 result = null_pointer_node;
3962 TREE_USED (label) = 1;
3963 result = build1 (ADDR_EXPR, ptr_type_node, label);
3964 TREE_CONSTANT (result) = 1;
3965 /* The current function in not necessarily uninlinable.
3966 Computed gotos are incompatible with inlining, but the value
3967 here could be used only in a diagnostic, for example. */
3973 /* Hook used by expand_expr to expand language-specific tree codes. */
3976 c_expand_expr (tree exp, rtx target, enum machine_mode tmode, int modifier)
3977 /* Actually enum_modifier. */
3979 switch (TREE_CODE (exp))
3985 bool preserve_result = false;
3986 bool return_target = false;
3988 /* Since expand_expr_stmt calls free_temp_slots after every
3989 expression statement, we must call push_temp_slots here.
3990 Otherwise, any temporaries in use now would be considered
3991 out-of-scope after the first EXPR_STMT from within the
3994 rtl_expr = expand_start_stmt_expr (!STMT_EXPR_NO_SCOPE (exp));
3996 /* If we want the result of this expression, find the last
3997 EXPR_STMT in the COMPOUND_STMT and mark it as addressable. */
3998 if (target != const0_rtx
3999 && TREE_CODE (STMT_EXPR_STMT (exp)) == COMPOUND_STMT
4000 && TREE_CODE (COMPOUND_BODY (STMT_EXPR_STMT (exp))) == SCOPE_STMT)
4002 tree expr = COMPOUND_BODY (STMT_EXPR_STMT (exp));
4003 tree last = TREE_CHAIN (expr);
4005 while (TREE_CHAIN (last))
4008 last = TREE_CHAIN (last);
4011 if (TREE_CODE (last) == SCOPE_STMT
4012 && TREE_CODE (expr) == EXPR_STMT)
4014 if (target && TREE_CODE (EXPR_STMT_EXPR (expr)) == VAR_DECL
4015 && DECL_RTL_IF_SET (EXPR_STMT_EXPR (expr)) == target)
4016 /* If the last expression is a variable whose RTL is the
4017 same as our target, just return the target; if it
4018 isn't valid expanding the decl would produce different
4019 RTL, and store_expr would try to do a copy. */
4020 return_target = true;
4023 /* Otherwise, note that we want the value from the last
4025 TREE_ADDRESSABLE (expr) = 1;
4026 preserve_result = true;
4031 expand_stmt (STMT_EXPR_STMT (exp));
4032 expand_end_stmt_expr (rtl_expr);
4034 result = expand_expr (rtl_expr, target, tmode, modifier);
4037 else if (preserve_result && GET_CODE (result) == MEM)
4039 if (GET_MODE (result) != BLKmode)
4040 result = copy_to_reg (result);
4042 preserve_temp_slots (result);
4045 /* If the statment-expression does not have a scope, then the
4046 new temporaries we created within it must live beyond the
4047 statement-expression. */
4048 if (STMT_EXPR_NO_SCOPE (exp))
4049 preserve_temp_slots (NULL_RTX);
4058 if (TREE_CODE (TREE_OPERAND (exp, 0)) == ADDR_EXPR
4059 && (TREE_CODE (TREE_OPERAND (TREE_OPERAND (exp, 0), 0))
4061 && DECL_BUILT_IN (TREE_OPERAND (TREE_OPERAND (exp, 0), 0))
4062 && (DECL_BUILT_IN_CLASS (TREE_OPERAND (TREE_OPERAND (exp, 0), 0))
4063 == BUILT_IN_FRONTEND))
4064 return c_expand_builtin (exp, target, tmode, modifier);
4070 case COMPOUND_LITERAL_EXPR:
4072 /* Initialize the anonymous variable declared in the compound
4073 literal, then return the variable. */
4074 tree decl = COMPOUND_LITERAL_EXPR_DECL (exp);
4075 emit_local_var (decl);
4076 return expand_expr (decl, target, tmode, modifier);
4087 /* Hook used by safe_from_p to handle language-specific tree codes. */
4090 c_safe_from_p (rtx target, tree exp)
4092 /* We can see statements here when processing the body of a
4093 statement-expression. For a declaration statement declaring a
4094 variable, look at the variable's initializer. */
4095 if (TREE_CODE (exp) == DECL_STMT)
4097 tree decl = DECL_STMT_DECL (exp);
4099 if (TREE_CODE (decl) == VAR_DECL
4100 && DECL_INITIAL (decl)
4101 && !safe_from_p (target, DECL_INITIAL (decl), /*top_p=*/0))
4105 /* For any statement, we must follow the statement-chain. */
4106 if (STATEMENT_CODE_P (TREE_CODE (exp)) && TREE_CHAIN (exp))
4107 return safe_from_p (target, TREE_CHAIN (exp), /*top_p=*/0);
4109 /* Assume everything else is safe. */
4113 /* Hook used by unsafe_for_reeval to handle language-specific tree codes. */
4116 c_common_unsafe_for_reeval (tree exp)
4118 /* Statement expressions may not be reevaluated, likewise compound
4120 if (TREE_CODE (exp) == STMT_EXPR
4121 || TREE_CODE (exp) == COMPOUND_LITERAL_EXPR)
4124 /* Walk all other expressions. */
4128 /* Hook used by staticp to handle language-specific tree codes. */
4131 c_staticp (tree exp)
4133 if (TREE_CODE (exp) == COMPOUND_LITERAL_EXPR
4134 && TREE_STATIC (COMPOUND_LITERAL_EXPR_DECL (exp)))
4139 #define CALLED_AS_BUILT_IN(NODE) \
4140 (!strncmp (IDENTIFIER_POINTER (DECL_NAME (NODE)), "__builtin_", 10))
4143 c_expand_builtin (tree exp, rtx target, enum machine_mode tmode,
4144 enum expand_modifier modifier)
4146 tree type = TREE_TYPE (exp);
4147 tree fndecl = TREE_OPERAND (TREE_OPERAND (exp, 0), 0);
4148 tree arglist = TREE_OPERAND (exp, 1);
4149 enum built_in_function fcode = DECL_FUNCTION_CODE (fndecl);
4150 enum tree_code code = TREE_CODE (exp);
4151 const int ignore = (target == const0_rtx
4152 || ((code == NON_LVALUE_EXPR || code == NOP_EXPR
4153 || code == CONVERT_EXPR || code == REFERENCE_EXPR
4154 || code == COND_EXPR)
4155 && TREE_CODE (type) == VOID_TYPE));
4157 if (! optimize && ! CALLED_AS_BUILT_IN (fndecl))
4158 return expand_call (exp, target, ignore);
4162 case BUILT_IN_PRINTF:
4163 target = c_expand_builtin_printf (arglist, target, tmode,
4164 modifier, ignore, /*unlocked=*/ 0);
4169 case BUILT_IN_PRINTF_UNLOCKED:
4170 target = c_expand_builtin_printf (arglist, target, tmode,
4171 modifier, ignore, /*unlocked=*/ 1);
4176 case BUILT_IN_FPRINTF:
4177 target = c_expand_builtin_fprintf (arglist, target, tmode,
4178 modifier, ignore, /*unlocked=*/ 0);
4183 case BUILT_IN_FPRINTF_UNLOCKED:
4184 target = c_expand_builtin_fprintf (arglist, target, tmode,
4185 modifier, ignore, /*unlocked=*/ 1);
4190 default: /* just do library call, if unknown builtin */
4191 error ("built-in function `%s' not currently supported",
4192 IDENTIFIER_POINTER (DECL_NAME (fndecl)));
4195 /* The switch statement above can drop through to cause the function
4196 to be called normally. */
4197 return expand_call (exp, target, ignore);
4200 /* Check an arglist to *printf for problems. The arglist should start
4201 at the format specifier, with the remaining arguments immediately
4204 is_valid_printf_arglist (tree arglist)
4206 /* Save this value so we can restore it later. */
4207 const int SAVE_pedantic = pedantic;
4208 int diagnostic_occurred = 0;
4211 /* Set this to a known value so the user setting won't affect code
4214 /* Check to make sure there are no format specifier errors. */
4215 attrs = tree_cons (get_identifier ("format"),
4216 tree_cons (NULL_TREE,
4217 get_identifier ("printf"),
4218 tree_cons (NULL_TREE,
4220 tree_cons (NULL_TREE,
4224 check_function_format (&diagnostic_occurred, attrs, arglist);
4226 /* Restore the value of `pedantic'. */
4227 pedantic = SAVE_pedantic;
4229 /* If calling `check_function_format_ptr' produces a warning, we
4230 return false, otherwise we return true. */
4231 return ! diagnostic_occurred;
4234 /* If the arguments passed to printf are suitable for optimizations,
4235 we attempt to transform the call. */
4237 c_expand_builtin_printf (tree arglist, rtx target, enum machine_mode tmode,
4238 enum expand_modifier modifier, int ignore,
4241 tree fn_putchar = unlocked ?
4242 implicit_built_in_decls[BUILT_IN_PUTCHAR_UNLOCKED] : implicit_built_in_decls[BUILT_IN_PUTCHAR];
4243 tree fn_puts = unlocked ?
4244 implicit_built_in_decls[BUILT_IN_PUTS_UNLOCKED] : implicit_built_in_decls[BUILT_IN_PUTS];
4245 tree fn, format_arg, stripped_string;
4247 /* If the return value is used, or the replacement _DECL isn't
4248 initialized, don't do the transformation. */
4249 if (!ignore || !fn_putchar || !fn_puts)
4252 /* Verify the required arguments in the original call. */
4254 || (TREE_CODE (TREE_TYPE (TREE_VALUE (arglist))) != POINTER_TYPE))
4257 /* Check the specifier vs. the parameters. */
4258 if (!is_valid_printf_arglist (arglist))
4261 format_arg = TREE_VALUE (arglist);
4262 stripped_string = format_arg;
4263 STRIP_NOPS (stripped_string);
4264 if (stripped_string && TREE_CODE (stripped_string) == ADDR_EXPR)
4265 stripped_string = TREE_OPERAND (stripped_string, 0);
4267 /* If the format specifier isn't a STRING_CST, punt. */
4268 if (TREE_CODE (stripped_string) != STRING_CST)
4271 /* OK! We can attempt optimization. */
4273 /* If the format specifier was "%s\n", call __builtin_puts(arg2). */
4274 if (strcmp (TREE_STRING_POINTER (stripped_string), "%s\n") == 0)
4276 arglist = TREE_CHAIN (arglist);
4279 /* If the format specifier was "%c", call __builtin_putchar (arg2). */
4280 else if (strcmp (TREE_STRING_POINTER (stripped_string), "%c") == 0)
4282 arglist = TREE_CHAIN (arglist);
4287 /* We can't handle anything else with % args or %% ... yet. */
4288 if (strchr (TREE_STRING_POINTER (stripped_string), '%'))
4291 /* If the resulting constant string has a length of 1, call
4292 putchar. Note, TREE_STRING_LENGTH includes the terminating
4293 NULL in its count. */
4294 if (TREE_STRING_LENGTH (stripped_string) == 2)
4296 /* Given printf("c"), (where c is any one character,)
4297 convert "c"[0] to an int and pass that to the replacement
4299 arglist = build_int_2 (TREE_STRING_POINTER (stripped_string)[0], 0);
4300 arglist = build_tree_list (NULL_TREE, arglist);
4304 /* If the resulting constant was "string\n", call
4305 __builtin_puts("string"). Ensure "string" has at least one
4306 character besides the trailing \n. Note, TREE_STRING_LENGTH
4307 includes the terminating NULL in its count. */
4308 else if (TREE_STRING_LENGTH (stripped_string) > 2
4309 && TREE_STRING_POINTER (stripped_string)
4310 [TREE_STRING_LENGTH (stripped_string) - 2] == '\n')
4312 /* Create a NULL-terminated string that's one char shorter
4313 than the original, stripping off the trailing '\n'. */
4314 const int newlen = TREE_STRING_LENGTH (stripped_string) - 1;
4315 char *newstr = alloca (newlen);
4316 memcpy (newstr, TREE_STRING_POINTER (stripped_string), newlen - 1);
4317 newstr[newlen - 1] = 0;
4319 arglist = fix_string_type (build_string (newlen, newstr));
4320 arglist = build_tree_list (NULL_TREE, arglist);
4324 /* We'd like to arrange to call fputs(string) here, but we
4325 need stdout and don't have a way to get it ... yet. */
4329 return expand_expr (build_function_call (fn, arglist),
4330 (ignore ? const0_rtx : target),
4334 /* If the arguments passed to fprintf are suitable for optimizations,
4335 we attempt to transform the call. */
4337 c_expand_builtin_fprintf (tree arglist, rtx target, enum machine_mode tmode,
4338 enum expand_modifier modifier, int ignore,
4341 tree fn_fputc = unlocked ?
4342 implicit_built_in_decls[BUILT_IN_FPUTC_UNLOCKED] : implicit_built_in_decls[BUILT_IN_FPUTC];
4343 tree fn_fputs = unlocked ?
4344 implicit_built_in_decls[BUILT_IN_FPUTS_UNLOCKED] : implicit_built_in_decls[BUILT_IN_FPUTS];
4345 tree fn, format_arg, stripped_string;
4347 /* If the return value is used, or the replacement _DECL isn't
4348 initialized, don't do the transformation. */
4349 if (!ignore || !fn_fputc || !fn_fputs)
4352 /* Verify the required arguments in the original call. */
4354 || (TREE_CODE (TREE_TYPE (TREE_VALUE (arglist))) != POINTER_TYPE)
4355 || (TREE_CHAIN (arglist) == 0)
4356 || (TREE_CODE (TREE_TYPE (TREE_VALUE (TREE_CHAIN (arglist)))) !=
4360 /* Check the specifier vs. the parameters. */
4361 if (!is_valid_printf_arglist (TREE_CHAIN (arglist)))
4364 format_arg = TREE_VALUE (TREE_CHAIN (arglist));
4365 stripped_string = format_arg;
4366 STRIP_NOPS (stripped_string);
4367 if (stripped_string && TREE_CODE (stripped_string) == ADDR_EXPR)
4368 stripped_string = TREE_OPERAND (stripped_string, 0);
4370 /* If the format specifier isn't a STRING_CST, punt. */
4371 if (TREE_CODE (stripped_string) != STRING_CST)
4374 /* OK! We can attempt optimization. */
4376 /* If the format specifier was "%s", call __builtin_fputs(arg3, arg1). */
4377 if (strcmp (TREE_STRING_POINTER (stripped_string), "%s") == 0)
4379 tree newarglist = build_tree_list (NULL_TREE, TREE_VALUE (arglist));
4380 arglist = tree_cons (NULL_TREE,
4381 TREE_VALUE (TREE_CHAIN (TREE_CHAIN (arglist))),
4385 /* If the format specifier was "%c", call __builtin_fputc (arg3, arg1). */
4386 else if (strcmp (TREE_STRING_POINTER (stripped_string), "%c") == 0)
4388 tree newarglist = build_tree_list (NULL_TREE, TREE_VALUE (arglist));
4389 arglist = tree_cons (NULL_TREE,
4390 TREE_VALUE (TREE_CHAIN (TREE_CHAIN (arglist))),
4396 /* We can't handle anything else with % args or %% ... yet. */
4397 if (strchr (TREE_STRING_POINTER (stripped_string), '%'))
4400 /* When "string" doesn't contain %, replace all cases of
4401 fprintf(stream,string) with fputs(string,stream). The fputs
4402 builtin will take take of special cases like length==1. */
4403 arglist = tree_cons (NULL_TREE, TREE_VALUE (TREE_CHAIN (arglist)),
4404 build_tree_list (NULL_TREE, TREE_VALUE (arglist)));
4408 return expand_expr (build_function_call (fn, arglist),
4409 (ignore ? const0_rtx : target),
4414 /* Given a boolean expression ARG, return a tree representing an increment
4415 or decrement (as indicated by CODE) of ARG. The front end must check for
4416 invalid cases (e.g., decrement in C++). */
4418 boolean_increment (enum tree_code code, tree arg)
4421 tree true_res = boolean_true_node;
4423 arg = stabilize_reference (arg);
4426 case PREINCREMENT_EXPR:
4427 val = build (MODIFY_EXPR, TREE_TYPE (arg), arg, true_res);
4429 case POSTINCREMENT_EXPR:
4430 val = build (MODIFY_EXPR, TREE_TYPE (arg), arg, true_res);
4431 arg = save_expr (arg);
4432 val = build (COMPOUND_EXPR, TREE_TYPE (arg), val, arg);
4433 val = build (COMPOUND_EXPR, TREE_TYPE (arg), arg, val);
4435 case PREDECREMENT_EXPR:
4436 val = build (MODIFY_EXPR, TREE_TYPE (arg), arg, invert_truthvalue (arg));
4438 case POSTDECREMENT_EXPR:
4439 val = build (MODIFY_EXPR, TREE_TYPE (arg), arg, invert_truthvalue (arg));
4440 arg = save_expr (arg);
4441 val = build (COMPOUND_EXPR, TREE_TYPE (arg), val, arg);
4442 val = build (COMPOUND_EXPR, TREE_TYPE (arg), arg, val);
4447 TREE_SIDE_EFFECTS (val) = 1;
4451 /* Built-in macros for stddef.h, that require macros defined in this
4454 c_stddef_cpp_builtins(void)
4456 builtin_define_with_value ("__SIZE_TYPE__", SIZE_TYPE, 0);
4457 builtin_define_with_value ("__PTRDIFF_TYPE__", PTRDIFF_TYPE, 0);
4458 builtin_define_with_value ("__WCHAR_TYPE__", MODIFIED_WCHAR_TYPE, 0);
4459 builtin_define_with_value ("__WINT_TYPE__", WINT_TYPE, 0);
4463 c_init_attributes (void)
4465 /* Fill in the built_in_attributes array. */
4466 #define DEF_ATTR_NULL_TREE(ENUM) \
4467 built_in_attributes[(int) ENUM] = NULL_TREE;
4468 #define DEF_ATTR_INT(ENUM, VALUE) \
4469 built_in_attributes[(int) ENUM] = build_int_2 (VALUE, VALUE < 0 ? -1 : 0);
4470 #define DEF_ATTR_IDENT(ENUM, STRING) \
4471 built_in_attributes[(int) ENUM] = get_identifier (STRING);
4472 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) \
4473 built_in_attributes[(int) ENUM] \
4474 = tree_cons (built_in_attributes[(int) PURPOSE], \
4475 built_in_attributes[(int) VALUE], \
4476 built_in_attributes[(int) CHAIN]);
4477 #define DEF_FN_ATTR(NAME, ATTRS, PREDICATE) /* No initialization needed. */
4478 #include "builtin-attrs.def"
4479 #undef DEF_ATTR_NULL_TREE
4481 #undef DEF_ATTR_IDENT
4482 #undef DEF_ATTR_TREE_LIST
4484 c_attrs_initialized = true;
4487 /* Depending on the name of DECL, apply default attributes to it. */
4490 c_common_insert_default_attributes (tree decl)
4492 tree name = DECL_NAME (decl);
4494 if (!c_attrs_initialized)
4495 c_init_attributes ();
4497 #define DEF_ATTR_NULL_TREE(ENUM) /* Nothing needed after initialization. */
4498 #define DEF_ATTR_INT(ENUM, VALUE)
4499 #define DEF_ATTR_IDENT(ENUM, STRING)
4500 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN)
4501 #define DEF_FN_ATTR(NAME, ATTRS, PREDICATE) \
4502 if ((PREDICATE) && name == built_in_attributes[(int) NAME]) \
4503 decl_attributes (&decl, built_in_attributes[(int) ATTRS], \
4504 ATTR_FLAG_BUILT_IN);
4505 #include "builtin-attrs.def"
4506 #undef DEF_ATTR_NULL_TREE
4508 #undef DEF_ATTR_IDENT
4509 #undef DEF_ATTR_TREE_LIST
4513 /* Output a -Wshadow warning MSGCODE about NAME, and give the location
4514 of the previous declaration DECL. */
4516 shadow_warning (enum sw_kind msgcode, const char *name, tree decl)
4518 static const char *const msgs[] = {
4519 /* SW_PARAM */ N_("declaration of \"%s\" shadows a parameter"),
4520 /* SW_LOCAL */ N_("declaration of \"%s\" shadows a previous local"),
4521 /* SW_GLOBAL */ N_("declaration of \"%s\" shadows a global declaration")
4524 warning (msgs[msgcode], name);
4525 warning ("%Hshadowed declaration is here", &DECL_SOURCE_LOCATION (decl));
4528 /* Attribute handlers common to C front ends. */
4530 /* Handle a "packed" attribute; arguments as in
4531 struct attribute_spec.handler. */
4534 handle_packed_attribute (tree *node, tree name, tree args ATTRIBUTE_UNUSED,
4535 int flags, bool *no_add_attrs)
4539 if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
4540 *node = build_type_copy (*node);
4541 TYPE_PACKED (*node) = 1;
4542 if (TYPE_MAIN_VARIANT (*node) == *node)
4544 /* If it is the main variant, then pack the other variants
4545 too. This happens in,
4548 struct Foo const *ptr; // creates a variant w/o packed flag
4549 } __ attribute__((packed)); // packs it now.
4553 for (probe = *node; probe; probe = TYPE_NEXT_VARIANT (probe))
4554 TYPE_PACKED (probe) = 1;
4558 else if (TREE_CODE (*node) == FIELD_DECL)
4559 DECL_PACKED (*node) = 1;
4560 /* We can't set DECL_PACKED for a VAR_DECL, because the bit is
4561 used for DECL_REGISTER. It wouldn't mean anything anyway.
4562 We can't set DECL_PACKED on the type of a TYPE_DECL, because
4563 that changes what the typedef is typing. */
4566 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4567 *no_add_attrs = true;
4573 /* Handle a "nocommon" attribute; arguments as in
4574 struct attribute_spec.handler. */
4577 handle_nocommon_attribute (tree *node, tree name,
4578 tree args ATTRIBUTE_UNUSED,
4579 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
4581 if (TREE_CODE (*node) == VAR_DECL)
4582 DECL_COMMON (*node) = 0;
4585 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4586 *no_add_attrs = true;
4592 /* Handle a "common" attribute; arguments as in
4593 struct attribute_spec.handler. */
4596 handle_common_attribute (tree *node, tree name, tree args ATTRIBUTE_UNUSED,
4597 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
4599 if (TREE_CODE (*node) == VAR_DECL)
4600 DECL_COMMON (*node) = 1;
4603 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4604 *no_add_attrs = true;
4610 /* Handle a "noreturn" attribute; arguments as in
4611 struct attribute_spec.handler. */
4614 handle_noreturn_attribute (tree *node, tree name, tree args ATTRIBUTE_UNUSED,
4615 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
4617 tree type = TREE_TYPE (*node);
4619 /* See FIXME comment in c_common_attribute_table. */
4620 if (TREE_CODE (*node) == FUNCTION_DECL)
4621 TREE_THIS_VOLATILE (*node) = 1;
4622 else if (TREE_CODE (type) == POINTER_TYPE
4623 && TREE_CODE (TREE_TYPE (type)) == FUNCTION_TYPE)
4625 = build_pointer_type
4626 (build_type_variant (TREE_TYPE (type),
4627 TREE_READONLY (TREE_TYPE (type)), 1));
4630 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4631 *no_add_attrs = true;
4637 /* Handle a "noinline" attribute; arguments as in
4638 struct attribute_spec.handler. */
4641 handle_noinline_attribute (tree *node, tree name,
4642 tree args ATTRIBUTE_UNUSED,
4643 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
4645 if (TREE_CODE (*node) == FUNCTION_DECL)
4646 DECL_UNINLINABLE (*node) = 1;
4649 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4650 *no_add_attrs = true;
4656 /* Handle a "always_inline" attribute; arguments as in
4657 struct attribute_spec.handler. */
4660 handle_always_inline_attribute (tree *node, tree name,
4661 tree args ATTRIBUTE_UNUSED,
4662 int flags ATTRIBUTE_UNUSED,
4665 if (TREE_CODE (*node) == FUNCTION_DECL)
4667 /* Do nothing else, just set the attribute. We'll get at
4668 it later with lookup_attribute. */
4672 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4673 *no_add_attrs = true;
4679 /* Handle a "used" attribute; arguments as in
4680 struct attribute_spec.handler. */
4683 handle_used_attribute (tree *pnode, tree name, tree args ATTRIBUTE_UNUSED,
4684 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
4688 if (TREE_CODE (node) == FUNCTION_DECL
4689 || (TREE_CODE (node) == VAR_DECL && TREE_STATIC (node)))
4691 TREE_USED (node) = 1;
4695 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4696 *no_add_attrs = true;
4702 /* Handle a "unused" attribute; arguments as in
4703 struct attribute_spec.handler. */
4706 handle_unused_attribute (tree *node, tree name, tree args ATTRIBUTE_UNUSED,
4707 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
4713 if (TREE_CODE (decl) == PARM_DECL
4714 || TREE_CODE (decl) == VAR_DECL
4715 || TREE_CODE (decl) == FUNCTION_DECL
4716 || TREE_CODE (decl) == LABEL_DECL
4717 || TREE_CODE (decl) == TYPE_DECL)
4718 TREE_USED (decl) = 1;
4721 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4722 *no_add_attrs = true;
4727 if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
4728 *node = build_type_copy (*node);
4729 TREE_USED (*node) = 1;
4735 /* Handle a "const" attribute; arguments as in
4736 struct attribute_spec.handler. */
4739 handle_const_attribute (tree *node, tree name, tree args ATTRIBUTE_UNUSED,
4740 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
4742 tree type = TREE_TYPE (*node);
4744 /* See FIXME comment on noreturn in c_common_attribute_table. */
4745 if (TREE_CODE (*node) == FUNCTION_DECL)
4746 TREE_READONLY (*node) = 1;
4747 else if (TREE_CODE (type) == POINTER_TYPE
4748 && TREE_CODE (TREE_TYPE (type)) == FUNCTION_TYPE)
4750 = build_pointer_type
4751 (build_type_variant (TREE_TYPE (type), 1,
4752 TREE_THIS_VOLATILE (TREE_TYPE (type))));
4755 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4756 *no_add_attrs = true;
4762 /* Handle a "transparent_union" attribute; arguments as in
4763 struct attribute_spec.handler. */
4766 handle_transparent_union_attribute (tree *node, tree name,
4767 tree args ATTRIBUTE_UNUSED, int flags,
4770 tree decl = NULL_TREE;
4777 type = &TREE_TYPE (decl);
4778 is_type = TREE_CODE (*node) == TYPE_DECL;
4780 else if (TYPE_P (*node))
4781 type = node, is_type = 1;
4784 && TREE_CODE (*type) == UNION_TYPE
4786 || (TYPE_FIELDS (*type) != 0
4787 && TYPE_MODE (*type) == DECL_MODE (TYPE_FIELDS (*type)))))
4789 if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
4790 *type = build_type_copy (*type);
4791 TYPE_TRANSPARENT_UNION (*type) = 1;
4793 else if (decl != 0 && TREE_CODE (decl) == PARM_DECL
4794 && TREE_CODE (*type) == UNION_TYPE
4795 && TYPE_MODE (*type) == DECL_MODE (TYPE_FIELDS (*type)))
4796 DECL_TRANSPARENT_UNION (decl) = 1;
4799 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4800 *no_add_attrs = true;
4806 /* Handle a "constructor" attribute; arguments as in
4807 struct attribute_spec.handler. */
4810 handle_constructor_attribute (tree *node, tree name,
4811 tree args ATTRIBUTE_UNUSED,
4812 int flags ATTRIBUTE_UNUSED,
4816 tree type = TREE_TYPE (decl);
4818 if (TREE_CODE (decl) == FUNCTION_DECL
4819 && TREE_CODE (type) == FUNCTION_TYPE
4820 && decl_function_context (decl) == 0)
4822 DECL_STATIC_CONSTRUCTOR (decl) = 1;
4823 TREE_USED (decl) = 1;
4827 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4828 *no_add_attrs = true;
4834 /* Handle a "destructor" attribute; arguments as in
4835 struct attribute_spec.handler. */
4838 handle_destructor_attribute (tree *node, tree name,
4839 tree args ATTRIBUTE_UNUSED,
4840 int flags ATTRIBUTE_UNUSED,
4844 tree type = TREE_TYPE (decl);
4846 if (TREE_CODE (decl) == FUNCTION_DECL
4847 && TREE_CODE (type) == FUNCTION_TYPE
4848 && decl_function_context (decl) == 0)
4850 DECL_STATIC_DESTRUCTOR (decl) = 1;
4851 TREE_USED (decl) = 1;
4855 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4856 *no_add_attrs = true;
4862 /* Handle a "mode" attribute; arguments as in
4863 struct attribute_spec.handler. */
4866 handle_mode_attribute (tree *node, tree name, tree args ATTRIBUTE_UNUSED,
4867 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
4871 *no_add_attrs = true;
4873 if (TREE_CODE (TREE_VALUE (args)) != IDENTIFIER_NODE)
4874 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4878 const char *p = IDENTIFIER_POINTER (TREE_VALUE (args));
4879 int len = strlen (p);
4880 enum machine_mode mode = VOIDmode;
4884 if (len > 4 && p[0] == '_' && p[1] == '_'
4885 && p[len - 1] == '_' && p[len - 2] == '_')
4887 char *newp = alloca (len - 1);
4889 strcpy (newp, &p[2]);
4890 newp[len - 4] = '\0';
4894 /* Change this type to have a type with the specified mode.
4895 First check for the special modes. */
4896 if (! strcmp (p, "byte"))
4898 else if (!strcmp (p, "word"))
4900 else if (! strcmp (p, "pointer"))
4903 for (j = 0; j < NUM_MACHINE_MODES; j++)
4904 if (!strcmp (p, GET_MODE_NAME (j)))
4905 mode = (enum machine_mode) j;
4907 if (mode == VOIDmode)
4908 error ("unknown machine mode `%s'", p);
4909 else if (0 == (typefm = (*lang_hooks.types.type_for_mode)
4910 (mode, TREE_UNSIGNED (type))))
4911 error ("no data type for mode `%s'", p);
4912 else if ((TREE_CODE (type) == POINTER_TYPE
4913 || TREE_CODE (type) == REFERENCE_TYPE)
4914 && !(*targetm.valid_pointer_mode) (mode))
4915 error ("invalid pointer mode `%s'", p);
4918 /* If this is a vector, make sure we either have hardware
4919 support, or we can emulate it. */
4920 if (VECTOR_MODE_P (mode) && !vector_mode_valid_p (mode))
4922 error ("unable to emulate '%s'", GET_MODE_NAME (mode));
4926 if (TREE_CODE (type) == POINTER_TYPE)
4928 ptr_type = build_pointer_type_for_mode (TREE_TYPE (type),
4932 else if (TREE_CODE (type) == REFERENCE_TYPE)
4934 ptr_type = build_reference_type_for_mode (TREE_TYPE (type),
4940 /* No need to layout the type here. The caller should do this. */
4947 /* Handle a "section" attribute; arguments as in
4948 struct attribute_spec.handler. */
4951 handle_section_attribute (tree *node, tree name ATTRIBUTE_UNUSED, tree args,
4952 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
4956 if (targetm.have_named_sections)
4958 if ((TREE_CODE (decl) == FUNCTION_DECL
4959 || TREE_CODE (decl) == VAR_DECL)
4960 && TREE_CODE (TREE_VALUE (args)) == STRING_CST)
4962 if (TREE_CODE (decl) == VAR_DECL
4963 && current_function_decl != NULL_TREE
4964 && ! TREE_STATIC (decl))
4966 error ("%Hsection attribute cannot be specified for "
4967 "local variables", &DECL_SOURCE_LOCATION (decl));
4968 *no_add_attrs = true;
4971 /* The decl may have already been given a section attribute
4972 from a previous declaration. Ensure they match. */
4973 else if (DECL_SECTION_NAME (decl) != NULL_TREE
4974 && strcmp (TREE_STRING_POINTER (DECL_SECTION_NAME (decl)),
4975 TREE_STRING_POINTER (TREE_VALUE (args))) != 0)
4977 error ("%Hsection of '%D' conflicts with previous declaration",
4978 &DECL_SOURCE_LOCATION (*node), *node);
4979 *no_add_attrs = true;
4982 DECL_SECTION_NAME (decl) = TREE_VALUE (args);
4986 error ("%Hsection attribute not allowed for '%D'",
4987 &DECL_SOURCE_LOCATION (*node), *node);
4988 *no_add_attrs = true;
4993 error ("%Hsection attributes are not supported for this target",
4994 &DECL_SOURCE_LOCATION (*node));
4995 *no_add_attrs = true;
5001 /* Handle a "aligned" attribute; arguments as in
5002 struct attribute_spec.handler. */
5005 handle_aligned_attribute (tree *node, tree name ATTRIBUTE_UNUSED, tree args,
5006 int flags, bool *no_add_attrs)
5008 tree decl = NULL_TREE;
5011 tree align_expr = (args ? TREE_VALUE (args)
5012 : size_int (BIGGEST_ALIGNMENT / BITS_PER_UNIT));
5018 type = &TREE_TYPE (decl);
5019 is_type = TREE_CODE (*node) == TYPE_DECL;
5021 else if (TYPE_P (*node))
5022 type = node, is_type = 1;
5024 /* Strip any NOPs of any kind. */
5025 while (TREE_CODE (align_expr) == NOP_EXPR
5026 || TREE_CODE (align_expr) == CONVERT_EXPR
5027 || TREE_CODE (align_expr) == NON_LVALUE_EXPR)
5028 align_expr = TREE_OPERAND (align_expr, 0);
5030 if (TREE_CODE (align_expr) != INTEGER_CST)
5032 error ("requested alignment is not a constant");
5033 *no_add_attrs = true;
5035 else if ((i = tree_log2 (align_expr)) == -1)
5037 error ("requested alignment is not a power of 2");
5038 *no_add_attrs = true;
5040 else if (i > HOST_BITS_PER_INT - 2)
5042 error ("requested alignment is too large");
5043 *no_add_attrs = true;
5047 /* If we have a TYPE_DECL, then copy the type, so that we
5048 don't accidentally modify a builtin type. See pushdecl. */
5049 if (decl && TREE_TYPE (decl) != error_mark_node
5050 && DECL_ORIGINAL_TYPE (decl) == NULL_TREE)
5052 tree tt = TREE_TYPE (decl);
5053 *type = build_type_copy (*type);
5054 DECL_ORIGINAL_TYPE (decl) = tt;
5055 TYPE_NAME (*type) = decl;
5056 TREE_USED (*type) = TREE_USED (decl);
5057 TREE_TYPE (decl) = *type;
5059 else if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
5060 *type = build_type_copy (*type);
5062 TYPE_ALIGN (*type) = (1 << i) * BITS_PER_UNIT;
5063 TYPE_USER_ALIGN (*type) = 1;
5065 else if (TREE_CODE (decl) != VAR_DECL
5066 && TREE_CODE (decl) != FIELD_DECL)
5068 error ("%Halignment may not be specified for '%D'",
5069 &DECL_SOURCE_LOCATION (decl), decl);
5070 *no_add_attrs = true;
5074 DECL_ALIGN (decl) = (1 << i) * BITS_PER_UNIT;
5075 DECL_USER_ALIGN (decl) = 1;
5081 /* Handle a "weak" attribute; arguments as in
5082 struct attribute_spec.handler. */
5085 handle_weak_attribute (tree *node, tree name ATTRIBUTE_UNUSED,
5086 tree args ATTRIBUTE_UNUSED,
5087 int flags ATTRIBUTE_UNUSED,
5088 bool *no_add_attrs ATTRIBUTE_UNUSED)
5090 declare_weak (*node);
5095 /* Handle an "alias" attribute; arguments as in
5096 struct attribute_spec.handler. */
5099 handle_alias_attribute (tree *node, tree name, tree args,
5100 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
5104 if ((TREE_CODE (decl) == FUNCTION_DECL && DECL_INITIAL (decl))
5105 || (TREE_CODE (decl) != FUNCTION_DECL && ! DECL_EXTERNAL (decl)))
5107 error ("%H'%D' defined both normally and as an alias",
5108 &DECL_SOURCE_LOCATION (decl), decl);
5109 *no_add_attrs = true;
5111 else if (decl_function_context (decl) == 0)
5115 id = TREE_VALUE (args);
5116 if (TREE_CODE (id) != STRING_CST)
5118 error ("alias arg not a string");
5119 *no_add_attrs = true;
5122 id = get_identifier (TREE_STRING_POINTER (id));
5123 /* This counts as a use of the object pointed to. */
5126 if (TREE_CODE (decl) == FUNCTION_DECL)
5127 DECL_INITIAL (decl) = error_mark_node;
5129 DECL_EXTERNAL (decl) = 0;
5133 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
5134 *no_add_attrs = true;
5140 /* Handle an "visibility" attribute; arguments as in
5141 struct attribute_spec.handler. */
5144 handle_visibility_attribute (tree *node, tree name, tree args,
5145 int flags ATTRIBUTE_UNUSED,
5150 if (decl_function_context (decl) != 0 || ! TREE_PUBLIC (decl))
5152 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
5153 *no_add_attrs = true;
5159 id = TREE_VALUE (args);
5160 if (TREE_CODE (id) != STRING_CST)
5162 error ("visibility arg not a string");
5163 *no_add_attrs = true;
5166 if (strcmp (TREE_STRING_POINTER (id), "hidden")
5167 && strcmp (TREE_STRING_POINTER (id), "protected")
5168 && strcmp (TREE_STRING_POINTER (id), "internal")
5169 && strcmp (TREE_STRING_POINTER (id), "default"))
5171 error ("visibility arg must be one of \"default\", \"hidden\", \"protected\" or \"internal\"");
5172 *no_add_attrs = true;
5180 /* Handle an "tls_model" attribute; arguments as in
5181 struct attribute_spec.handler. */
5184 handle_tls_model_attribute (tree *node, tree name, tree args,
5185 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
5189 if (! DECL_THREAD_LOCAL (decl))
5191 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
5192 *no_add_attrs = true;
5198 id = TREE_VALUE (args);
5199 if (TREE_CODE (id) != STRING_CST)
5201 error ("tls_model arg not a string");
5202 *no_add_attrs = true;
5205 if (strcmp (TREE_STRING_POINTER (id), "local-exec")
5206 && strcmp (TREE_STRING_POINTER (id), "initial-exec")
5207 && strcmp (TREE_STRING_POINTER (id), "local-dynamic")
5208 && strcmp (TREE_STRING_POINTER (id), "global-dynamic"))
5210 error ("tls_model arg must be one of \"local-exec\", \"initial-exec\", \"local-dynamic\" or \"global-dynamic\"");
5211 *no_add_attrs = true;
5219 /* Handle a "no_instrument_function" attribute; arguments as in
5220 struct attribute_spec.handler. */
5223 handle_no_instrument_function_attribute (tree *node, tree name,
5224 tree args ATTRIBUTE_UNUSED,
5225 int flags ATTRIBUTE_UNUSED,
5230 if (TREE_CODE (decl) != FUNCTION_DECL)
5232 error ("%H'%E' attribute applies only to functions",
5233 &DECL_SOURCE_LOCATION (decl), name);
5234 *no_add_attrs = true;
5236 else if (DECL_INITIAL (decl))
5238 error ("%Hcan't set '%E' attribute after definition",
5239 &DECL_SOURCE_LOCATION (decl), name);
5240 *no_add_attrs = true;
5243 DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (decl) = 1;
5248 /* Handle a "malloc" attribute; arguments as in
5249 struct attribute_spec.handler. */
5252 handle_malloc_attribute (tree *node, tree name, tree args ATTRIBUTE_UNUSED,
5253 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
5255 if (TREE_CODE (*node) == FUNCTION_DECL)
5256 DECL_IS_MALLOC (*node) = 1;
5257 /* ??? TODO: Support types. */
5260 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
5261 *no_add_attrs = true;
5267 /* Handle a "no_limit_stack" attribute; arguments as in
5268 struct attribute_spec.handler. */
5271 handle_no_limit_stack_attribute (tree *node, tree name,
5272 tree args ATTRIBUTE_UNUSED,
5273 int flags ATTRIBUTE_UNUSED,
5278 if (TREE_CODE (decl) != FUNCTION_DECL)
5280 error ("%H'%E' attribute applies only to functions",
5281 &DECL_SOURCE_LOCATION (decl), name);
5282 *no_add_attrs = true;
5284 else if (DECL_INITIAL (decl))
5286 error ("%Hcan't set '%E' attribute after definition",
5287 &DECL_SOURCE_LOCATION (decl), name);
5288 *no_add_attrs = true;
5291 DECL_NO_LIMIT_STACK (decl) = 1;
5296 /* Handle a "pure" attribute; arguments as in
5297 struct attribute_spec.handler. */
5300 handle_pure_attribute (tree *node, tree name, tree args ATTRIBUTE_UNUSED,
5301 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
5303 if (TREE_CODE (*node) == FUNCTION_DECL)
5304 DECL_IS_PURE (*node) = 1;
5305 /* ??? TODO: Support types. */
5308 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
5309 *no_add_attrs = true;
5315 /* Handle a "deprecated" attribute; arguments as in
5316 struct attribute_spec.handler. */
5319 handle_deprecated_attribute (tree *node, tree name,
5320 tree args ATTRIBUTE_UNUSED, int flags,
5323 tree type = NULL_TREE;
5325 const char *what = NULL;
5330 type = TREE_TYPE (decl);
5332 if (TREE_CODE (decl) == TYPE_DECL
5333 || TREE_CODE (decl) == PARM_DECL
5334 || TREE_CODE (decl) == VAR_DECL
5335 || TREE_CODE (decl) == FUNCTION_DECL
5336 || TREE_CODE (decl) == FIELD_DECL)
5337 TREE_DEPRECATED (decl) = 1;
5341 else if (TYPE_P (*node))
5343 if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
5344 *node = build_type_copy (*node);
5345 TREE_DEPRECATED (*node) = 1;
5353 *no_add_attrs = true;
5354 if (type && TYPE_NAME (type))
5356 if (TREE_CODE (TYPE_NAME (type)) == IDENTIFIER_NODE)
5357 what = IDENTIFIER_POINTER (TYPE_NAME (*node));
5358 else if (TREE_CODE (TYPE_NAME (type)) == TYPE_DECL
5359 && DECL_NAME (TYPE_NAME (type)))
5360 what = IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (type)));
5363 warning ("`%s' attribute ignored for `%s'",
5364 IDENTIFIER_POINTER (name), what);
5366 warning ("`%s' attribute ignored",
5367 IDENTIFIER_POINTER (name));
5373 /* Keep a list of vector type nodes we created in handle_vector_size_attribute,
5374 to prevent us from duplicating type nodes unnecessarily.
5375 The normal mechanism to prevent duplicates is to use type_hash_canon, but
5376 since we want to distinguish types that are essentially identical (except
5377 for their debug representation), we use a local list here. */
5378 static GTY(()) tree vector_type_node_list = 0;
5380 /* Handle a "vector_size" attribute; arguments as in
5381 struct attribute_spec.handler. */
5384 handle_vector_size_attribute (tree *node, tree name, tree args,
5385 int flags ATTRIBUTE_UNUSED,
5388 unsigned HOST_WIDE_INT vecsize, nunits;
5389 enum machine_mode mode, orig_mode, new_mode;
5390 tree type = *node, new_type = NULL_TREE;
5391 tree type_list_node;
5393 *no_add_attrs = true;
5395 if (! host_integerp (TREE_VALUE (args), 1))
5397 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
5401 /* Get the vector size (in bytes). */
5402 vecsize = tree_low_cst (TREE_VALUE (args), 1);
5404 /* We need to provide for vector pointers, vector arrays, and
5405 functions returning vectors. For example:
5407 __attribute__((vector_size(16))) short *foo;
5409 In this case, the mode is SI, but the type being modified is
5410 HI, so we need to look further. */
5412 while (POINTER_TYPE_P (type)
5413 || TREE_CODE (type) == FUNCTION_TYPE
5414 || TREE_CODE (type) == ARRAY_TYPE)
5415 type = TREE_TYPE (type);
5417 /* Get the mode of the type being modified. */
5418 orig_mode = TYPE_MODE (type);
5420 if (TREE_CODE (type) == RECORD_TYPE
5421 || (GET_MODE_CLASS (orig_mode) != MODE_FLOAT
5422 && GET_MODE_CLASS (orig_mode) != MODE_INT)
5423 || ! host_integerp (TYPE_SIZE_UNIT (type), 1))
5425 error ("invalid vector type for attribute `%s'",
5426 IDENTIFIER_POINTER (name));
5430 /* Calculate how many units fit in the vector. */
5431 nunits = vecsize / tree_low_cst (TYPE_SIZE_UNIT (type), 1);
5433 /* Find a suitably sized vector. */
5434 new_mode = VOIDmode;
5435 for (mode = GET_CLASS_NARROWEST_MODE (GET_MODE_CLASS (orig_mode) == MODE_INT
5437 : MODE_VECTOR_FLOAT);
5439 mode = GET_MODE_WIDER_MODE (mode))
5440 if (vecsize == GET_MODE_SIZE (mode)
5441 && nunits == (unsigned HOST_WIDE_INT) GET_MODE_NUNITS (mode))
5447 if (new_mode == VOIDmode)
5449 error ("no vector mode with the size and type specified could be found");
5453 for (type_list_node = vector_type_node_list; type_list_node;
5454 type_list_node = TREE_CHAIN (type_list_node))
5456 tree other_type = TREE_VALUE (type_list_node);
5457 tree record = TYPE_DEBUG_REPRESENTATION_TYPE (other_type);
5458 tree fields = TYPE_FIELDS (record);
5459 tree field_type = TREE_TYPE (fields);
5460 tree array_type = TREE_TYPE (field_type);
5461 if (TREE_CODE (fields) != FIELD_DECL
5462 || TREE_CODE (field_type) != ARRAY_TYPE)
5465 if (TYPE_MODE (other_type) == mode && type == array_type)
5467 new_type = other_type;
5472 if (new_type == NULL_TREE)
5474 tree index, array, rt, list_node;
5476 new_type = (*lang_hooks.types.type_for_mode) (new_mode,
5477 TREE_UNSIGNED (type));
5481 error ("no vector mode with the size and type specified could be found");
5485 new_type = build_type_copy (new_type);
5487 /* If this is a vector, make sure we either have hardware
5488 support, or we can emulate it. */
5489 if ((GET_MODE_CLASS (mode) == MODE_VECTOR_INT
5490 || GET_MODE_CLASS (mode) == MODE_VECTOR_FLOAT)
5491 && !vector_mode_valid_p (mode))
5493 error ("unable to emulate '%s'", GET_MODE_NAME (mode));
5497 /* Set the debug information here, because this is the only
5498 place where we know the underlying type for a vector made
5499 with vector_size. For debugging purposes we pretend a vector
5500 is an array within a structure. */
5501 index = build_int_2 (TYPE_VECTOR_SUBPARTS (new_type) - 1, 0);
5502 array = build_array_type (type, build_index_type (index));
5503 rt = make_node (RECORD_TYPE);
5505 TYPE_FIELDS (rt) = build_decl (FIELD_DECL, get_identifier ("f"), array);
5506 DECL_CONTEXT (TYPE_FIELDS (rt)) = rt;
5508 TYPE_DEBUG_REPRESENTATION_TYPE (new_type) = rt;
5510 list_node = build_tree_list (NULL, new_type);
5511 TREE_CHAIN (list_node) = vector_type_node_list;
5512 vector_type_node_list = list_node;
5515 /* Build back pointers if needed. */
5516 *node = vector_size_helper (*node, new_type);
5521 /* HACK. GROSS. This is absolutely disgusting. I wish there was a
5524 If we requested a pointer to a vector, build up the pointers that
5525 we stripped off while looking for the inner type. Similarly for
5526 return values from functions.
5528 The argument "type" is the top of the chain, and "bottom" is the
5529 new type which we will point to. */
5532 vector_size_helper (tree type, tree bottom)
5536 if (POINTER_TYPE_P (type))
5538 inner = vector_size_helper (TREE_TYPE (type), bottom);
5539 outer = build_pointer_type (inner);
5541 else if (TREE_CODE (type) == ARRAY_TYPE)
5543 inner = vector_size_helper (TREE_TYPE (type), bottom);
5544 outer = build_array_type (inner, TYPE_VALUES (type));
5546 else if (TREE_CODE (type) == FUNCTION_TYPE)
5548 inner = vector_size_helper (TREE_TYPE (type), bottom);
5549 outer = build_function_type (inner, TYPE_VALUES (type));
5554 TREE_READONLY (outer) = TREE_READONLY (type);
5555 TREE_THIS_VOLATILE (outer) = TREE_THIS_VOLATILE (type);
5560 /* Handle the "nonnull" attribute. */
5562 handle_nonnull_attribute (tree *node, tree name ATTRIBUTE_UNUSED,
5563 tree args, int flags ATTRIBUTE_UNUSED,
5567 unsigned HOST_WIDE_INT attr_arg_num;
5569 /* If no arguments are specified, all pointer arguments should be
5570 non-null. Verify a full prototype is given so that the arguments
5571 will have the correct types when we actually check them later. */
5574 if (! TYPE_ARG_TYPES (type))
5576 error ("nonnull attribute without arguments on a non-prototype");
5577 *no_add_attrs = true;
5582 /* Argument list specified. Verify that each argument number references
5583 a pointer argument. */
5584 for (attr_arg_num = 1; args; args = TREE_CHAIN (args))
5587 unsigned HOST_WIDE_INT arg_num, ck_num;
5589 if (! get_nonnull_operand (TREE_VALUE (args), &arg_num))
5591 error ("nonnull argument has invalid operand number (arg %lu)",
5592 (unsigned long) attr_arg_num);
5593 *no_add_attrs = true;
5597 argument = TYPE_ARG_TYPES (type);
5600 for (ck_num = 1; ; ck_num++)
5602 if (! argument || ck_num == arg_num)
5604 argument = TREE_CHAIN (argument);
5608 || TREE_CODE (TREE_VALUE (argument)) == VOID_TYPE)
5610 error ("nonnull argument with out-of-range operand number (arg %lu, operand %lu)",
5611 (unsigned long) attr_arg_num, (unsigned long) arg_num);
5612 *no_add_attrs = true;
5616 if (TREE_CODE (TREE_VALUE (argument)) != POINTER_TYPE)
5618 error ("nonnull argument references non-pointer operand (arg %lu, operand %lu)",
5619 (unsigned long) attr_arg_num, (unsigned long) arg_num);
5620 *no_add_attrs = true;
5629 /* Check the argument list of a function call for null in argument slots
5630 that are marked as requiring a non-null pointer argument. */
5633 check_function_nonnull (tree attrs, tree params)
5635 tree a, args, param;
5638 for (a = attrs; a; a = TREE_CHAIN (a))
5640 if (is_attribute_p ("nonnull", TREE_PURPOSE (a)))
5642 args = TREE_VALUE (a);
5644 /* Walk the argument list. If we encounter an argument number we
5645 should check for non-null, do it. If the attribute has no args,
5646 then every pointer argument is checked (in which case the check
5647 for pointer type is done in check_nonnull_arg). */
5648 for (param = params, param_num = 1; ;
5649 param_num++, param = TREE_CHAIN (param))
5653 if (! args || nonnull_check_p (args, param_num))
5654 check_function_arguments_recurse (check_nonnull_arg, NULL,
5662 /* Helper for check_function_nonnull; given a list of operands which
5663 must be non-null in ARGS, determine if operand PARAM_NUM should be
5667 nonnull_check_p (tree args, unsigned HOST_WIDE_INT param_num)
5669 unsigned HOST_WIDE_INT arg_num;
5671 for (; args; args = TREE_CHAIN (args))
5673 if (! get_nonnull_operand (TREE_VALUE (args), &arg_num))
5676 if (arg_num == param_num)
5682 /* Check that the function argument PARAM (which is operand number
5683 PARAM_NUM) is non-null. This is called by check_function_nonnull
5684 via check_function_arguments_recurse. */
5687 check_nonnull_arg (void *ctx ATTRIBUTE_UNUSED, tree param,
5688 unsigned HOST_WIDE_INT param_num)
5690 /* Just skip checking the argument if it's not a pointer. This can
5691 happen if the "nonnull" attribute was given without an operand
5692 list (which means to check every pointer argument). */
5694 if (TREE_CODE (TREE_TYPE (param)) != POINTER_TYPE)
5697 if (integer_zerop (param))
5698 warning ("null argument where non-null required (arg %lu)",
5699 (unsigned long) param_num);
5702 /* Helper for nonnull attribute handling; fetch the operand number
5703 from the attribute argument list. */
5706 get_nonnull_operand (tree arg_num_expr, unsigned HOST_WIDE_INT *valp)
5708 /* Strip any conversions from the arg number and verify they
5710 while (TREE_CODE (arg_num_expr) == NOP_EXPR
5711 || TREE_CODE (arg_num_expr) == CONVERT_EXPR
5712 || TREE_CODE (arg_num_expr) == NON_LVALUE_EXPR)
5713 arg_num_expr = TREE_OPERAND (arg_num_expr, 0);
5715 if (TREE_CODE (arg_num_expr) != INTEGER_CST
5716 || TREE_INT_CST_HIGH (arg_num_expr) != 0)
5719 *valp = TREE_INT_CST_LOW (arg_num_expr);
5723 /* Handle a "nothrow" attribute; arguments as in
5724 struct attribute_spec.handler. */
5727 handle_nothrow_attribute (tree *node, tree name, tree args ATTRIBUTE_UNUSED,
5728 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
5730 if (TREE_CODE (*node) == FUNCTION_DECL)
5731 TREE_NOTHROW (*node) = 1;
5732 /* ??? TODO: Support types. */
5735 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
5736 *no_add_attrs = true;
5742 /* Handle a "cleanup" attribute; arguments as in
5743 struct attribute_spec.handler. */
5746 handle_cleanup_attribute (tree *node, tree name, tree args,
5747 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
5750 tree cleanup_id, cleanup_decl;
5752 /* ??? Could perhaps support cleanups on TREE_STATIC, much like we do
5753 for global destructors in C++. This requires infrastructure that
5754 we don't have generically at the moment. It's also not a feature
5755 we'd be missing too much, since we do have attribute constructor. */
5756 if (TREE_CODE (decl) != VAR_DECL || TREE_STATIC (decl))
5758 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
5759 *no_add_attrs = true;
5763 /* Verify that the argument is a function in scope. */
5764 /* ??? We could support pointers to functions here as well, if
5765 that was considered desirable. */
5766 cleanup_id = TREE_VALUE (args);
5767 if (TREE_CODE (cleanup_id) != IDENTIFIER_NODE)
5769 error ("cleanup arg not an identifier");
5770 *no_add_attrs = true;
5773 cleanup_decl = lookup_name (cleanup_id);
5774 if (!cleanup_decl || TREE_CODE (cleanup_decl) != FUNCTION_DECL)
5776 error ("cleanup arg not a function");
5777 *no_add_attrs = true;
5781 /* That the function has proper type is checked with the
5782 eventual call to build_function_call. */
5787 /* Check for valid arguments being passed to a function. */
5789 check_function_arguments (tree attrs, tree params)
5791 /* Check for null being passed in a pointer argument that must be
5792 non-null. We also need to do this if format checking is enabled. */
5795 check_function_nonnull (attrs, params);
5797 /* Check for errors in format strings. */
5800 check_function_format (NULL, attrs, params);
5803 /* Generic argument checking recursion routine. PARAM is the argument to
5804 be checked. PARAM_NUM is the number of the argument. CALLBACK is invoked
5805 once the argument is resolved. CTX is context for the callback. */
5807 check_function_arguments_recurse (void (*callback)
5808 (void *, tree, unsigned HOST_WIDE_INT),
5809 void *ctx, tree param,
5810 unsigned HOST_WIDE_INT param_num)
5812 if (TREE_CODE (param) == NOP_EXPR)
5814 /* Strip coercion. */
5815 check_function_arguments_recurse (callback, ctx,
5816 TREE_OPERAND (param, 0), param_num);
5820 if (TREE_CODE (param) == CALL_EXPR)
5822 tree type = TREE_TYPE (TREE_TYPE (TREE_OPERAND (param, 0)));
5824 bool found_format_arg = false;
5826 /* See if this is a call to a known internationalization function
5827 that modifies a format arg. Such a function may have multiple
5828 format_arg attributes (for example, ngettext). */
5830 for (attrs = TYPE_ATTRIBUTES (type);
5832 attrs = TREE_CHAIN (attrs))
5833 if (is_attribute_p ("format_arg", TREE_PURPOSE (attrs)))
5836 tree format_num_expr;
5840 /* Extract the argument number, which was previously checked
5842 format_num_expr = TREE_VALUE (TREE_VALUE (attrs));
5843 while (TREE_CODE (format_num_expr) == NOP_EXPR
5844 || TREE_CODE (format_num_expr) == CONVERT_EXPR
5845 || TREE_CODE (format_num_expr) == NON_LVALUE_EXPR)
5846 format_num_expr = TREE_OPERAND (format_num_expr, 0);
5848 if (TREE_CODE (format_num_expr) != INTEGER_CST
5849 || TREE_INT_CST_HIGH (format_num_expr) != 0)
5852 format_num = TREE_INT_CST_LOW (format_num_expr);
5854 for (inner_args = TREE_OPERAND (param, 1), i = 1;
5856 inner_args = TREE_CHAIN (inner_args), i++)
5857 if (i == format_num)
5859 check_function_arguments_recurse (callback, ctx,
5860 TREE_VALUE (inner_args),
5862 found_format_arg = true;
5867 /* If we found a format_arg attribute and did a recursive check,
5868 we are done with checking this argument. Otherwise, we continue
5869 and this will be considered a non-literal. */
5870 if (found_format_arg)
5874 if (TREE_CODE (param) == COND_EXPR)
5876 /* Check both halves of the conditional expression. */
5877 check_function_arguments_recurse (callback, ctx,
5878 TREE_OPERAND (param, 1), param_num);
5879 check_function_arguments_recurse (callback, ctx,
5880 TREE_OPERAND (param, 2), param_num);
5884 (*callback) (ctx, param, param_num);
5887 /* Function to help qsort sort FIELD_DECLs by name order. */
5890 field_decl_cmp (const void *x_p, const void *y_p)
5892 const tree *const x = x_p;
5893 const tree *const y = y_p;
5894 if (DECL_NAME (*x) == DECL_NAME (*y))
5895 /* A nontype is "greater" than a type. */
5896 return (TREE_CODE (*y) == TYPE_DECL) - (TREE_CODE (*x) == TYPE_DECL);
5897 if (DECL_NAME (*x) == NULL_TREE)
5899 if (DECL_NAME (*y) == NULL_TREE)
5901 if (DECL_NAME (*x) < DECL_NAME (*y))
5907 gt_pointer_operator new_value;
5911 /* This routine compares two fields like field_decl_cmp but using the
5912 pointer operator in resort_data. */
5915 resort_field_decl_cmp (const void *x_p, const void *y_p)
5917 const tree *const x = x_p;
5918 const tree *const y = y_p;
5920 if (DECL_NAME (*x) == DECL_NAME (*y))
5921 /* A nontype is "greater" than a type. */
5922 return (TREE_CODE (*y) == TYPE_DECL) - (TREE_CODE (*x) == TYPE_DECL);
5923 if (DECL_NAME (*x) == NULL_TREE)
5925 if (DECL_NAME (*y) == NULL_TREE)
5928 tree d1 = DECL_NAME (*x);
5929 tree d2 = DECL_NAME (*y);
5930 resort_data.new_value (&d1, resort_data.cookie);
5931 resort_data.new_value (&d2, resort_data.cookie);
5938 /* Resort DECL_SORTED_FIELDS because pointers have been reordered. */
5941 resort_sorted_fields (void *obj,
5942 void *orig_obj ATTRIBUTE_UNUSED ,
5943 gt_pointer_operator new_value,
5946 struct sorted_fields_type *sf = obj;
5947 resort_data.new_value = new_value;
5948 resort_data.cookie = cookie;
5949 qsort (&sf->elts[0], sf->len, sizeof (tree),
5950 resort_field_decl_cmp);
5953 /* Used by estimate_num_insns. Estimate number of instructions seen
5954 by given statement. */
5956 c_estimate_num_insns_1 (tree *tp, int *walk_subtrees, void *data)
5961 if (TYPE_P (x) || DECL_P (x))
5966 /* Assume that constants and references counts nothing. These should
5967 be majorized by amount of operations amoung them we count later
5968 and are common target of CSE and similar optimizations. */
5969 if (TREE_CODE_CLASS (TREE_CODE (x)) == 'c'
5970 || TREE_CODE_CLASS (TREE_CODE (x)) == 'r')
5972 switch (TREE_CODE (x))
5974 /* Reconginze assignments of large structures and constructors of
5979 int size = int_size_in_bytes (TREE_TYPE (x));
5981 if (!size || size > MOVE_MAX_PIECES)
5984 *count += 2 * (size + MOVE_MAX - 1) / MOVE_MAX;
5988 /* Few special cases of expensive operations. This is usefull
5989 to avoid inlining on functions having too many of these. */
5990 case TRUNC_DIV_EXPR:
5992 case FLOOR_DIV_EXPR:
5993 case ROUND_DIV_EXPR:
5994 case TRUNC_MOD_EXPR:
5996 case FLOOR_MOD_EXPR:
5997 case ROUND_MOD_EXPR:
6002 /* Various containers that will produce no code themselves. */
6009 case IDENTIFIER_NODE:
6010 case PLACEHOLDER_EXPR:
6011 case WITH_CLEANUP_EXPR:
6012 case CLEANUP_POINT_EXPR:
6014 case VIEW_CONVERT_EXPR:
6020 case TRY_CATCH_EXPR:
6021 case TRY_FINALLY_EXPR:
6024 case LABELED_BLOCK_EXPR:
6025 case EXIT_BLOCK_EXPR:
6026 case EXPR_WITH_FILE_LOCATION:
6043 /* Do not account static initializers. */
6044 if (TREE_STATIC (TREE_OPERAND (x, 0)))
6053 /* Estimate number of instructions that will be created by expanding the body. */
6055 c_estimate_num_insns (tree decl)
6058 walk_tree_without_duplicates (&DECL_SAVED_TREE (decl), c_estimate_num_insns_1, &num);
6062 #include "gt-c-common.h"